[ { "file_name": "Format.KeyShareEntry.fsti", "name": "Format.KeyShareEntry.keyShareEntry_parser_kind", "original_source_type": "", "source_type": "val keyShareEntry_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let keyShareEntry_parser_kind =\n LP.strong_parser_kind 5 65539 keyShareEntry_parser_kind_metadata", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.KeyShareEntry.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 54, "start_col": 2, "end_line": 54, "end_col": 66 }, "file_context": "module Format.KeyShareEntry\n\nopen Parsers.NamedGroup\n\nmodule B = FStar.Bytes\nmodule LP = LowParse.SLow.Base\nmodule U32 = FStar.UInt32\n\n(* Types *)\n\n(* \n https://tlswg.github.io/tls13-spec/draft-ietf-tls-tls13.html#rfc.section.4.2.8\n\n struct {\n NamedGroup group;\n opaque key_exchange<1..2^16-1>;\n } KeyShareEntry;\n\n\n https://tlswg.github.io/tls13-spec/draft-ietf-tls-tls13.html#ffdhe-param\n \n Diffie-Hellman [DH] parameters for both clients and servers are encoded in the \n opaque key_exchange field of a KeyShareEntry in a KeyShare structure. The opaque\n value contains the Diffie-Hellman public value (Y = g^X mod p) for the specified\n group (see [RFC7919] for group definitions) encoded as a big-endian integer\n and padded to the left with zeros to the size of p in bytes.\n\n\n https://tlswg.github.io/tls13-spec/draft-ietf-tls-tls13.html#ecdhe-param\n \n ECDHE parameters for both clients and servers are encoded in the the opaque \n key_exchange field of a KeyShareEntry in a KeyShare structure. \n For secp256r1, secp384r1 and secp521r1, the contents are the serialized value\n of the following struct:\n \n struct {\n uint8 legacy_form = 4;\n opaque X[coordinate_length];\n opaque Y[coordinate_length];\n } UncompressedPointRepresentation;\n\n*)\n\ntype keyShareEntry = {\n group : namedGroup; \n key_exchange : (bs:B.bytes{1 <= B.length bs && B.length bs <= 65535});\n}\n\ninline_for_extraction\nval keyShareEntry_parser_kind_metadata : LP.parser_kind_metadata_t\n\ninline_for_extraction", "dependencies": { "source_file": "Format.KeyShareEntry.fsti", "checked_file": "Format.KeyShareEntry.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.NamedGroup.fsti.checked", "LowParse.SLow.Base.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "Format.KeyShareEntry.keyShareEntry_parser_kind_metadata" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let keyShareEntry_parser_kind =", "completed_definiton": "LP.strong_parser_kind 5 65539 keyShareEntry_parser_kind_metadata", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.u64", "original_source_type": "", "source_type": "val u64 : Prims.eqtype", "source_definition": "let u64 = UInt64.t", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 16, "start_col": 10, "end_line": 16, "end_col": 18 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8\n\nlet u8 = UInt8.t", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.eqtype", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt64.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let u64 =", "completed_definiton": "UInt64.t", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.u32", "original_source_type": "", "source_type": "val u32 : Prims.eqtype", "source_definition": "let u32 = UInt32.t", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 15, "start_col": 10, "end_line": 15, "end_col": 18 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.eqtype", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let u32 =", "completed_definiton": "UInt32.t", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.u8", "original_source_type": "", "source_type": "val u8 : Prims.eqtype", "source_definition": "let u8 = UInt8.t", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 14, "start_col": 10, "end_line": 14, "end_col": 17 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.eqtype", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt8.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let u8 =", "completed_definiton": "UInt8.t", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.big_endian", "original_source_type": "val big_endian (b: bytes) : Tot (n : nat) (decreases (Seq.length b))", "source_type": "val big_endian (b: bytes) : Tot (n : nat) (decreases (Seq.length b))", "source_definition": "let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = \n if Seq.length b = 0 then 0 \n else\n UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1))", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 45, "start_col": 2, "end_line": 47, "end_col": 77 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n#set-options \"--initial_fuel 0 --max_fuel 0\"\n\ntype bytes = Seq.seq U8.t // Pure sequence of bytes\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\n\n(* type lbuffer (l:nat) = b:buffer {Buffer.length b == l} *)\n\n#reset-options\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b = UInt128.v a % pow2 8})\n = Math.Lemmas.pow2_modulo_modulo_lemma_2 (UInt128.v a) 64 8;\n uint64_to_uint8 (FStar.UInt128.uint128_to_uint64 a)\n\n#reset-options \"--z3rlimit 20 --initial_fuel 0 --max_fuel 0\"\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\nlet rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) =\n if Seq.length b = 0 then 0\n else\n UInt8.v (head b) + pow2 8 * little_endian (tail b)\n\n(* Big endian integer value of a sequence of bytes *)", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 20, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: FStar.Old.Endianness.bytes -> Prims.Tot Prims.nat", "effect": "Prims.Tot", "effect_flags": [ "total", "" ], "mutual_with": [], "ideal_premises": [ "FStar.Old.Endianness.bytes", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "FStar.UInt8.t", "Prims.bool", "Prims.op_Addition", "FStar.UInt8.v", "FStar.Seq.Properties.last", "FStar.Mul.op_Star", "Prims.pow2", "FStar.Old.Endianness.big_endian", "FStar.Seq.Base.slice", "Prims.op_Subtraction", "Prims.nat" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val big_endian (b: bytes) : Tot (n : nat) (decreases (Seq.length b))\nlet rec big_endian (b: bytes) : Tot (n : nat) (decreases (Seq.length b)) =", "completed_definiton": "if Seq.length b = 0\nthen 0\nelse UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1))", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.lemma_little_endian_lt_2_128", "original_source_type": "val lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]", "source_type": "val lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]", "source_definition": "let lemma_little_endian_lt_2_128 b =\n lemma_little_endian_is_bounded b;\n if Seq.length b = 16 then ()\n else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 173, "start_col": 2, "end_line": 175, "end_col": 56 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n#set-options \"--initial_fuel 0 --max_fuel 0\"\n\ntype bytes = Seq.seq U8.t // Pure sequence of bytes\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\n\n(* type lbuffer (l:nat) = b:buffer {Buffer.length b == l} *)\n\n#reset-options\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b = UInt128.v a % pow2 8})\n = Math.Lemmas.pow2_modulo_modulo_lemma_2 (UInt128.v a) 64 8;\n uint64_to_uint8 (FStar.UInt128.uint128_to_uint64 a)\n\n#reset-options \"--z3rlimit 20 --initial_fuel 0 --max_fuel 0\"\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\nlet rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) =\n if Seq.length b = 0 then 0\n else\n UInt8.v (head b) + pow2 8 * little_endian (tail b)\n\n(* Big endian integer value of a sequence of bytes *)\nlet rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = \n if Seq.length b = 0 then 0 \n else\n UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet rec little_endian_null len =\n if len = 0 then ()\n else\n begin\n Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len)\n\t\t (Seq.create (len - 1) 0uy);\n assert (little_endian (Seq.create len 0uy) ==\n 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len));\n little_endian_null (len - 1)\n end\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n =\n assert (little_endian (Seq.create 1 n) ==\n UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 *\n little_endian (Seq.slice (Seq.create 1 n) 1 1))\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\n (decreases (Seq.length w1))\nlet rec little_endian_append w1 w2 =\n let open FStar.Seq in\n if length w1 = 0 then\n begin\n assert_norm (pow2 (8 * 0) == 1);\n Seq.lemma_eq_intro (append w1 w2) w2\n end\n else\n begin\n let w1' = slice w1 1 (length w1) in\n assert (length w1' == length w1 - 1);\n little_endian_append w1' w2;\n assert (index (append w1 w2) 0 == index w1 0);\n Seq.lemma_eq_intro\n (append w1' w2)\n (Seq.slice (append w1 w2) 1 (length (append w1 w2)));\n assert (little_endian (append w1 w2) ==\n UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2));\n assert (little_endian (append w1' w2) ==\n little_endian w1' + pow2 (8 * length w1') * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2));\n Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1));\n assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1));\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1)\n end\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval lemma_euclidean_division: r:nat -> b:nat -> q:pos -> Lemma\n (requires (r < q))\n (ensures (r + q * b < q * (b+1)))\nlet lemma_euclidean_division r b q = ()\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet rec lemma_little_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 1 (Seq.length b) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_little_endian_is_bounded s;\n assert(UInt8.v (Seq.index b 0) < pow2 8);\n assert(little_endian s < pow2 (8 * Seq.length s));\n assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8);\n assert(little_endian b <= pow2 8 * (little_endian s + 1));\n assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\n [SMTPat (big_endian b)]\nlet rec lemma_big_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 0 (Seq.length b - 1) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_big_endian_is_bounded s;\n assert(UInt8.v (Seq.last b) < pow2 8);\n assert(big_endian s < pow2 (8 * Seq.length s));\n assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8);\n assert(big_endian b <= pow2 8 * (big_endian s + 1));\n assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: FStar.Old.Endianness.bytes{FStar.Seq.Base.length b <= 16}\n -> FStar.Pervasives.Lemma (ensures FStar.Old.Endianness.little_endian b < Prims.pow2 128)\n [SMTPat (FStar.Old.Endianness.little_endian b)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Old.Endianness.bytes", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "FStar.UInt8.t", "Prims.op_Equality", "Prims.int", "Prims.bool", "FStar.Math.Lemmas.pow2_lt_compat", "FStar.Mul.op_Star", "Prims.unit", "FStar.Old.Endianness.lemma_little_endian_is_bounded" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b =", "completed_definiton": "lemma_little_endian_is_bounded b;\nif Seq.length b = 16 then () else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b)", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.little_endian", "original_source_type": "val little_endian (b: bytes) : Tot (n : nat) (decreases (Seq.length b))", "source_type": "val little_endian (b: bytes) : Tot (n : nat) (decreases (Seq.length b))", "source_definition": "let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) =\n if Seq.length b = 0 then 0\n else\n UInt8.v (head b) + pow2 8 * little_endian (tail b)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 39, "start_col": 2, "end_line": 41, "end_col": 54 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n#set-options \"--initial_fuel 0 --max_fuel 0\"\n\ntype bytes = Seq.seq U8.t // Pure sequence of bytes\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\n\n(* type lbuffer (l:nat) = b:buffer {Buffer.length b == l} *)\n\n#reset-options\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b = UInt128.v a % pow2 8})\n = Math.Lemmas.pow2_modulo_modulo_lemma_2 (UInt128.v a) 64 8;\n uint64_to_uint8 (FStar.UInt128.uint128_to_uint64 a)\n\n#reset-options \"--z3rlimit 20 --initial_fuel 0 --max_fuel 0\"\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 20, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: FStar.Old.Endianness.bytes -> Prims.Tot Prims.nat", "effect": "Prims.Tot", "effect_flags": [ "total", "" ], "mutual_with": [], "ideal_premises": [ "FStar.Old.Endianness.bytes", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "FStar.UInt8.t", "Prims.bool", "Prims.op_Addition", "FStar.UInt8.v", "FStar.Seq.Properties.head", "FStar.Mul.op_Star", "Prims.pow2", "FStar.Old.Endianness.little_endian", "FStar.Seq.Properties.tail", "Prims.nat" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val little_endian (b: bytes) : Tot (n : nat) (decreases (Seq.length b))\nlet rec little_endian (b: bytes) : Tot (n : nat) (decreases (Seq.length b)) =", "completed_definiton": "if Seq.length b = 0 then 0 else UInt8.v (head b) + pow2 8 * little_endian (tail b)", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.little_endian_singleton", "original_source_type": "val little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)", "source_type": "val little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)", "source_definition": "let little_endian_singleton n =\n assert (little_endian (Seq.create 1 n) ==\n UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 *\n little_endian (Seq.slice (Seq.create 1 n) 1 1))", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 67, "start_col": 2, "end_line": 69, "end_col": 51 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n#set-options \"--initial_fuel 0 --max_fuel 0\"\n\ntype bytes = Seq.seq U8.t // Pure sequence of bytes\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\n\n(* type lbuffer (l:nat) = b:buffer {Buffer.length b == l} *)\n\n#reset-options\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b = UInt128.v a % pow2 8})\n = Math.Lemmas.pow2_modulo_modulo_lemma_2 (UInt128.v a) 64 8;\n uint64_to_uint8 (FStar.UInt128.uint128_to_uint64 a)\n\n#reset-options \"--z3rlimit 20 --initial_fuel 0 --max_fuel 0\"\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\nlet rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) =\n if Seq.length b = 0 then 0\n else\n UInt8.v (head b) + pow2 8 * little_endian (tail b)\n\n(* Big endian integer value of a sequence of bytes *)\nlet rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = \n if Seq.length b = 0 then 0 \n else\n UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet rec little_endian_null len =\n if len = 0 then ()\n else\n begin\n Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len)\n\t\t (Seq.create (len - 1) 0uy);\n assert (little_endian (Seq.create len 0uy) ==\n 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len));\n little_endian_null (len - 1)\n end\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "n: FStar.UInt8.t\n -> FStar.Pervasives.Lemma\n (ensures FStar.Old.Endianness.little_endian (FStar.Seq.Base.create 1 n) == FStar.UInt8.v n)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt8.t", "Prims._assert", "Prims.eq2", "Prims.int", "FStar.Old.Endianness.little_endian", "FStar.Seq.Base.create", "Prims.op_Addition", "FStar.UInt8.v", "FStar.Seq.Base.index", "FStar.Mul.op_Star", "Prims.pow2", "FStar.Seq.Base.slice", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n =", "completed_definiton": "assert (little_endian (Seq.create 1 n) ==\n UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * little_endian (Seq.slice (Seq.create 1 n) 1 1)\n )", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.endian_is_injective", "original_source_type": "val endian_is_injective (q r q' r': _)\n : Lemma (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q') (ensures r = r' /\\ q = q')", "source_type": "val endian_is_injective (q r q' r': _)\n : Lemma (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q') (ensures r = r' /\\ q = q')", "source_definition": "let endian_is_injective q r q' r' : Lemma\n (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q')\n (ensures r = r' /\\ q = q') =\n lemma_mod_injective (pow2 8) (UInt8.v r) (UInt8.v r')", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 214, "start_col": 2, "end_line": 214, "end_col": 55 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n#set-options \"--initial_fuel 0 --max_fuel 0\"\n\ntype bytes = Seq.seq U8.t // Pure sequence of bytes\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\n\n(* type lbuffer (l:nat) = b:buffer {Buffer.length b == l} *)\n\n#reset-options\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b = UInt128.v a % pow2 8})\n = Math.Lemmas.pow2_modulo_modulo_lemma_2 (UInt128.v a) 64 8;\n uint64_to_uint8 (FStar.UInt128.uint128_to_uint64 a)\n\n#reset-options \"--z3rlimit 20 --initial_fuel 0 --max_fuel 0\"\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\nlet rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) =\n if Seq.length b = 0 then 0\n else\n UInt8.v (head b) + pow2 8 * little_endian (tail b)\n\n(* Big endian integer value of a sequence of bytes *)\nlet rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = \n if Seq.length b = 0 then 0 \n else\n UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet rec little_endian_null len =\n if len = 0 then ()\n else\n begin\n Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len)\n\t\t (Seq.create (len - 1) 0uy);\n assert (little_endian (Seq.create len 0uy) ==\n 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len));\n little_endian_null (len - 1)\n end\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n =\n assert (little_endian (Seq.create 1 n) ==\n UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 *\n little_endian (Seq.slice (Seq.create 1 n) 1 1))\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\n (decreases (Seq.length w1))\nlet rec little_endian_append w1 w2 =\n let open FStar.Seq in\n if length w1 = 0 then\n begin\n assert_norm (pow2 (8 * 0) == 1);\n Seq.lemma_eq_intro (append w1 w2) w2\n end\n else\n begin\n let w1' = slice w1 1 (length w1) in\n assert (length w1' == length w1 - 1);\n little_endian_append w1' w2;\n assert (index (append w1 w2) 0 == index w1 0);\n Seq.lemma_eq_intro\n (append w1' w2)\n (Seq.slice (append w1 w2) 1 (length (append w1 w2)));\n assert (little_endian (append w1 w2) ==\n UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2));\n assert (little_endian (append w1' w2) ==\n little_endian w1' + pow2 (8 * length w1') * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2));\n Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1));\n assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1));\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1)\n end\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval lemma_euclidean_division: r:nat -> b:nat -> q:pos -> Lemma\n (requires (r < q))\n (ensures (r + q * b < q * (b+1)))\nlet lemma_euclidean_division r b q = ()\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet rec lemma_little_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 1 (Seq.length b) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_little_endian_is_bounded s;\n assert(UInt8.v (Seq.index b 0) < pow2 8);\n assert(little_endian s < pow2 (8 * Seq.length s));\n assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8);\n assert(little_endian b <= pow2 8 * (little_endian s + 1));\n assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\n [SMTPat (big_endian b)]\nlet rec lemma_big_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 0 (Seq.length b - 1) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_big_endian_is_bounded s;\n assert(UInt8.v (Seq.last b) < pow2 8);\n assert(big_endian s < pow2 (8 * Seq.length s));\n assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8);\n assert(big_endian b <= pow2 8 * (big_endian s + 1));\n assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b =\n lemma_little_endian_is_bounded b;\n if Seq.length b = 16 then ()\n else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b)\n\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = FStar.UInt128.uint64_to_uint128 (uint8_to_uint64 a)\n\n\n// turns an integer into a bytestream, little-endian\nval little_bytes: \n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b}) (decreases (v len))\nlet rec little_bytes len n = \n if len = 0ul then \n Seq.empty \n else\n let len = len -^ 1ul in \n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in \n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert(n' < pow2 (8 * v len ));\n let b' = little_bytes len n' in\n let b = cons byte b' in\n assert(Seq.equal b' (tail b));\n b\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 0 --max_ifuel 0\"\n\n\n(* injectivity proofs for byte encodings *) \n\ntype word = b:Seq.seq UInt8.t {Seq.length b <= 16}\nopen FStar.Math.Lib\nopen FStar.Math.Lemmas\n\nprivate let endian_is_injective q r q' r' : Lemma\n (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q')", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lib" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "q: Prims.int -> r: FStar.UInt8.t -> q': Prims.int -> r': FStar.UInt8.t\n -> FStar.Pervasives.Lemma\n (requires FStar.UInt8.v r + Prims.pow2 8 * q = FStar.UInt8.v r' + Prims.pow2 8 * q')\n (ensures r = r' /\\ q = q')", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.int", "FStar.UInt8.t", "FStar.Math.Lemmas.lemma_mod_injective", "Prims.pow2", "FStar.UInt8.v", "Prims.unit", "Prims.b2t", "Prims.op_Equality", "Prims.op_Addition", "FStar.Mul.op_Star", "Prims.squash", "Prims.l_and", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val endian_is_injective (q r q' r': _)\n : Lemma (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q') (ensures r = r' /\\ q = q')\nlet endian_is_injective q r q' r'\n : Lemma (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q') (ensures r = r' /\\ q = q') =", "completed_definiton": "lemma_mod_injective (pow2 8) (UInt8.v r) (UInt8.v r')", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.uint8_to_uint128", "original_source_type": "val uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})", "source_type": "val uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})", "source_definition": "let uint8_to_uint128 a = FStar.UInt128.uint64_to_uint128 (uint8_to_uint64 a)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 181, "start_col": 25, "end_line": 181, "end_col": 76 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n#set-options \"--initial_fuel 0 --max_fuel 0\"\n\ntype bytes = Seq.seq U8.t // Pure sequence of bytes\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\n\n(* type lbuffer (l:nat) = b:buffer {Buffer.length b == l} *)\n\n#reset-options\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b = UInt128.v a % pow2 8})\n = Math.Lemmas.pow2_modulo_modulo_lemma_2 (UInt128.v a) 64 8;\n uint64_to_uint8 (FStar.UInt128.uint128_to_uint64 a)\n\n#reset-options \"--z3rlimit 20 --initial_fuel 0 --max_fuel 0\"\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\nlet rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) =\n if Seq.length b = 0 then 0\n else\n UInt8.v (head b) + pow2 8 * little_endian (tail b)\n\n(* Big endian integer value of a sequence of bytes *)\nlet rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = \n if Seq.length b = 0 then 0 \n else\n UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet rec little_endian_null len =\n if len = 0 then ()\n else\n begin\n Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len)\n\t\t (Seq.create (len - 1) 0uy);\n assert (little_endian (Seq.create len 0uy) ==\n 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len));\n little_endian_null (len - 1)\n end\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n =\n assert (little_endian (Seq.create 1 n) ==\n UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 *\n little_endian (Seq.slice (Seq.create 1 n) 1 1))\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\n (decreases (Seq.length w1))\nlet rec little_endian_append w1 w2 =\n let open FStar.Seq in\n if length w1 = 0 then\n begin\n assert_norm (pow2 (8 * 0) == 1);\n Seq.lemma_eq_intro (append w1 w2) w2\n end\n else\n begin\n let w1' = slice w1 1 (length w1) in\n assert (length w1' == length w1 - 1);\n little_endian_append w1' w2;\n assert (index (append w1 w2) 0 == index w1 0);\n Seq.lemma_eq_intro\n (append w1' w2)\n (Seq.slice (append w1 w2) 1 (length (append w1 w2)));\n assert (little_endian (append w1 w2) ==\n UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2));\n assert (little_endian (append w1' w2) ==\n little_endian w1' + pow2 (8 * length w1') * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2));\n Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1));\n assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1));\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1)\n end\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval lemma_euclidean_division: r:nat -> b:nat -> q:pos -> Lemma\n (requires (r < q))\n (ensures (r + q * b < q * (b+1)))\nlet lemma_euclidean_division r b q = ()\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet rec lemma_little_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 1 (Seq.length b) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_little_endian_is_bounded s;\n assert(UInt8.v (Seq.index b 0) < pow2 8);\n assert(little_endian s < pow2 (8 * Seq.length s));\n assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8);\n assert(little_endian b <= pow2 8 * (little_endian s + 1));\n assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\n [SMTPat (big_endian b)]\nlet rec lemma_big_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 0 (Seq.length b - 1) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_big_endian_is_bounded s;\n assert(UInt8.v (Seq.last b) < pow2 8);\n assert(big_endian s < pow2 (8 * Seq.length s));\n assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8);\n assert(big_endian b <= pow2 8 * (big_endian s + 1));\n assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b =\n lemma_little_endian_is_bounded b;\n if Seq.length b = 16 then ()\n else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b)\n\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: FStar.UInt8.t -> b: FStar.UInt128.t{FStar.UInt128.v b == FStar.UInt8.v a}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt8.t", "FStar.UInt128.uint64_to_uint128", "FStar.Int.Cast.uint8_to_uint64", "FStar.UInt128.t", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt128.n", "FStar.UInt8.n", "FStar.UInt128.v", "FStar.UInt8.v" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a =", "completed_definiton": "FStar.UInt128.uint64_to_uint128 (uint8_to_uint64 a)", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.little_endian_null", "original_source_type": "val little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)", "source_type": "val little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)", "source_definition": "let rec little_endian_null len =\n if len = 0 then ()\n else\n begin\n Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len)\n\t\t (Seq.create (len - 1) 0uy);\n assert (little_endian (Seq.create len 0uy) ==\n 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len));\n little_endian_null (len - 1)\n end", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 54, "start_col": 2, "end_line": 62, "end_col": 7 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n#set-options \"--initial_fuel 0 --max_fuel 0\"\n\ntype bytes = Seq.seq U8.t // Pure sequence of bytes\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\n\n(* type lbuffer (l:nat) = b:buffer {Buffer.length b == l} *)\n\n#reset-options\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b = UInt128.v a % pow2 8})\n = Math.Lemmas.pow2_modulo_modulo_lemma_2 (UInt128.v a) 64 8;\n uint64_to_uint8 (FStar.UInt128.uint128_to_uint64 a)\n\n#reset-options \"--z3rlimit 20 --initial_fuel 0 --max_fuel 0\"\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\nlet rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) =\n if Seq.length b = 0 then 0\n else\n UInt8.v (head b) + pow2 8 * little_endian (tail b)\n\n(* Big endian integer value of a sequence of bytes *)\nlet rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = \n if Seq.length b = 0 then 0 \n else\n UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "len: Prims.nat{len < 16}\n -> FStar.Pervasives.Lemma\n (ensures FStar.Old.Endianness.little_endian (FStar.Seq.Base.create len 0uy) == 0)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Prims.op_Equality", "Prims.int", "Prims.bool", "FStar.Old.Endianness.little_endian_null", "Prims.op_Subtraction", "Prims.unit", "Prims._assert", "Prims.eq2", "FStar.Old.Endianness.little_endian", "FStar.Seq.Base.create", "FStar.UInt8.t", "FStar.UInt8.__uint_to_t", "Prims.op_Addition", "FStar.Mul.op_Star", "Prims.pow2", "FStar.Seq.Base.slice", "FStar.Seq.Base.lemma_eq_intro" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet rec little_endian_null len =", "completed_definiton": "if len = 0\nthen ()\nelse\n (Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) (Seq.create (len - 1) 0uy);\n assert (little_endian (Seq.create len 0uy) ==\n 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len));\n little_endian_null (len - 1))", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.lemma_little_endian_is_injective_1", "original_source_type": "val lemma_little_endian_is_injective_1: b:pos -> q:nat -> r:nat -> q':nat -> r':nat -> Lemma\n (requires (r < b /\\ r' < b /\\ r + b * q = r' + b * q'))\n (ensures (r = r' /\\ q = q'))", "source_type": "val lemma_little_endian_is_injective_1: b:pos -> q:nat -> r:nat -> q':nat -> r':nat -> Lemma\n (requires (r < b /\\ r' < b /\\ r + b * q = r' + b * q'))\n (ensures (r = r' /\\ q = q'))", "source_definition": "let lemma_little_endian_is_injective_1 b q r q' r' =\n lemma_mod_plus r q b;\n lemma_mod_plus r' q' b;\n lemma_mod_injective b r r'", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 247, "start_col": 2, "end_line": 249, "end_col": 28 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n#set-options \"--initial_fuel 0 --max_fuel 0\"\n\ntype bytes = Seq.seq U8.t // Pure sequence of bytes\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\n\n(* type lbuffer (l:nat) = b:buffer {Buffer.length b == l} *)\n\n#reset-options\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b = UInt128.v a % pow2 8})\n = Math.Lemmas.pow2_modulo_modulo_lemma_2 (UInt128.v a) 64 8;\n uint64_to_uint8 (FStar.UInt128.uint128_to_uint64 a)\n\n#reset-options \"--z3rlimit 20 --initial_fuel 0 --max_fuel 0\"\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\nlet rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) =\n if Seq.length b = 0 then 0\n else\n UInt8.v (head b) + pow2 8 * little_endian (tail b)\n\n(* Big endian integer value of a sequence of bytes *)\nlet rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = \n if Seq.length b = 0 then 0 \n else\n UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet rec little_endian_null len =\n if len = 0 then ()\n else\n begin\n Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len)\n\t\t (Seq.create (len - 1) 0uy);\n assert (little_endian (Seq.create len 0uy) ==\n 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len));\n little_endian_null (len - 1)\n end\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n =\n assert (little_endian (Seq.create 1 n) ==\n UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 *\n little_endian (Seq.slice (Seq.create 1 n) 1 1))\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\n (decreases (Seq.length w1))\nlet rec little_endian_append w1 w2 =\n let open FStar.Seq in\n if length w1 = 0 then\n begin\n assert_norm (pow2 (8 * 0) == 1);\n Seq.lemma_eq_intro (append w1 w2) w2\n end\n else\n begin\n let w1' = slice w1 1 (length w1) in\n assert (length w1' == length w1 - 1);\n little_endian_append w1' w2;\n assert (index (append w1 w2) 0 == index w1 0);\n Seq.lemma_eq_intro\n (append w1' w2)\n (Seq.slice (append w1 w2) 1 (length (append w1 w2)));\n assert (little_endian (append w1 w2) ==\n UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2));\n assert (little_endian (append w1' w2) ==\n little_endian w1' + pow2 (8 * length w1') * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2));\n Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1));\n assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1));\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1)\n end\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval lemma_euclidean_division: r:nat -> b:nat -> q:pos -> Lemma\n (requires (r < q))\n (ensures (r + q * b < q * (b+1)))\nlet lemma_euclidean_division r b q = ()\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet rec lemma_little_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 1 (Seq.length b) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_little_endian_is_bounded s;\n assert(UInt8.v (Seq.index b 0) < pow2 8);\n assert(little_endian s < pow2 (8 * Seq.length s));\n assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8);\n assert(little_endian b <= pow2 8 * (little_endian s + 1));\n assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\n [SMTPat (big_endian b)]\nlet rec lemma_big_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 0 (Seq.length b - 1) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_big_endian_is_bounded s;\n assert(UInt8.v (Seq.last b) < pow2 8);\n assert(big_endian s < pow2 (8 * Seq.length s));\n assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8);\n assert(big_endian b <= pow2 8 * (big_endian s + 1));\n assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b =\n lemma_little_endian_is_bounded b;\n if Seq.length b = 16 then ()\n else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b)\n\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = FStar.UInt128.uint64_to_uint128 (uint8_to_uint64 a)\n\n\n// turns an integer into a bytestream, little-endian\nval little_bytes: \n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b}) (decreases (v len))\nlet rec little_bytes len n = \n if len = 0ul then \n Seq.empty \n else\n let len = len -^ 1ul in \n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in \n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert(n' < pow2 (8 * v len ));\n let b' = little_bytes len n' in\n let b = cons byte b' in\n assert(Seq.equal b' (tail b));\n b\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 0 --max_ifuel 0\"\n\n\n(* injectivity proofs for byte encodings *) \n\ntype word = b:Seq.seq UInt8.t {Seq.length b <= 16}\nopen FStar.Math.Lib\nopen FStar.Math.Lemmas\n\nprivate let endian_is_injective q r q' r' : Lemma\n (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q')\n (ensures r = r' /\\ q = q') =\n lemma_mod_injective (pow2 8) (UInt8.v r) (UInt8.v r')\n\nprivate let big_endian_step (b:word{length b > 0}) : \n Lemma (big_endian b = U8.v (last b) + pow2 8 * big_endian (slice b 0 (length b - 1))) =\n ()\n\n#reset-options \"--z3rlimit 100\"\nval lemma_big_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires big_endian b = big_endian b')\n (ensures b == b')\n (decreases (length b))\nlet rec lemma_big_endian_inj s s' = \n let len = length s in \n if len = 0 then lemma_eq_intro s s'\n else\n let t = slice s 0 (len - 1) in \n let x = last s in \n lemma_eq_intro s (snoc t x);\n big_endian_step s;\n let t' = slice s' 0 (len - 1) in \n let x' = last s' in \n lemma_eq_intro s' (snoc t' x');\n big_endian_step s';\n endian_is_injective (big_endian t) x (big_endian t') x';\n lemma_big_endian_inj t t'\n\n(* the little endian proof could be simplified, as above *)\n\n(* this lemma is used only Crypto.Symmetric.Poly1305 *)\nval lemma_little_endian_is_injective_1: b:pos -> q:nat -> r:nat -> q':nat -> r':nat -> Lemma\n (requires (r < b /\\ r' < b /\\ r + b * q = r' + b * q'))\n (ensures (r = r' /\\ q = q'))", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lib" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: Prims.pos -> q: Prims.nat -> r: Prims.nat -> q': Prims.nat -> r': Prims.nat\n -> FStar.Pervasives.Lemma (requires r < b /\\ r' < b /\\ r + b * q = r' + b * q')\n (ensures r = r' /\\ q = q')", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.pos", "Prims.nat", "FStar.Math.Lemmas.lemma_mod_injective", "Prims.unit", "FStar.Math.Lemmas.lemma_mod_plus" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_little_endian_is_injective_1: b:pos -> q:nat -> r:nat -> q':nat -> r':nat -> Lemma\n (requires (r < b /\\ r' < b /\\ r + b * q = r' + b * q'))\n (ensures (r = r' /\\ q = q'))\nlet lemma_little_endian_is_injective_1 b q r q' r' =", "completed_definiton": "lemma_mod_plus r q b;\nlemma_mod_plus r' q' b;\nlemma_mod_injective b r r'", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.uint128_to_uint8", "original_source_type": "val uint128_to_uint8 (a: UInt128.t) : Tot (b: UInt8.t{UInt8.v b = UInt128.v a % pow2 8})", "source_type": "val uint128_to_uint8 (a: UInt128.t) : Tot (b: UInt8.t{UInt8.v b = UInt128.v a % pow2 8})", "source_definition": "let uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b = UInt128.v a % pow2 8})\n = Math.Lemmas.pow2_modulo_modulo_lemma_2 (UInt128.v a) 64 8;\n uint64_to_uint8 (FStar.UInt128.uint128_to_uint64 a)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 29, "start_col": 4, "end_line": 30, "end_col": 55 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n#set-options \"--initial_fuel 0 --max_fuel 0\"\n\ntype bytes = Seq.seq U8.t // Pure sequence of bytes\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\n\n(* type lbuffer (l:nat) = b:buffer {Buffer.length b == l} *)\n\n#reset-options", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: FStar.UInt128.t -> b: FStar.UInt8.t{FStar.UInt8.v b = FStar.UInt128.v a % Prims.pow2 8}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt128.t", "FStar.Int.Cast.uint64_to_uint8", "FStar.UInt128.uint128_to_uint64", "Prims.unit", "FStar.Math.Lemmas.pow2_modulo_modulo_lemma_2", "FStar.UInt128.v", "FStar.UInt8.t", "Prims.b2t", "Prims.op_Equality", "Prims.int", "FStar.UInt8.v", "Prims.op_Modulus", "Prims.pow2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val uint128_to_uint8 (a: UInt128.t) : Tot (b: UInt8.t{UInt8.v b = UInt128.v a % pow2 8})\nlet uint128_to_uint8 (a: UInt128.t) : Tot (b: UInt8.t{UInt8.v b = UInt128.v a % pow2 8}) =", "completed_definiton": "Math.Lemmas.pow2_modulo_modulo_lemma_2 (UInt128.v a) 64 8;\nuint64_to_uint8 (FStar.UInt128.uint128_to_uint64 a)", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.lemma_little_endian_is_injective_2", "original_source_type": "val lemma_little_endian_is_injective_2: b:bytes -> len:pos{len <= length b} -> Lemma\n (let s = slice b (length b - len) (length b) in \n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n s'' == s')", "source_type": "val lemma_little_endian_is_injective_2: b:bytes -> len:pos{len <= length b} -> Lemma\n (let s = slice b (length b - len) (length b) in \n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n s'' == s')", "source_definition": "let lemma_little_endian_is_injective_2 b len =\n let s = slice b (length b - len) (length b) in\n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n lemma_eq_intro s' s''", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 257, "start_col": 46, "end_line": 261, "end_col": 23 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n#set-options \"--initial_fuel 0 --max_fuel 0\"\n\ntype bytes = Seq.seq U8.t // Pure sequence of bytes\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\n\n(* type lbuffer (l:nat) = b:buffer {Buffer.length b == l} *)\n\n#reset-options\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b = UInt128.v a % pow2 8})\n = Math.Lemmas.pow2_modulo_modulo_lemma_2 (UInt128.v a) 64 8;\n uint64_to_uint8 (FStar.UInt128.uint128_to_uint64 a)\n\n#reset-options \"--z3rlimit 20 --initial_fuel 0 --max_fuel 0\"\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\nlet rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) =\n if Seq.length b = 0 then 0\n else\n UInt8.v (head b) + pow2 8 * little_endian (tail b)\n\n(* Big endian integer value of a sequence of bytes *)\nlet rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = \n if Seq.length b = 0 then 0 \n else\n UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet rec little_endian_null len =\n if len = 0 then ()\n else\n begin\n Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len)\n\t\t (Seq.create (len - 1) 0uy);\n assert (little_endian (Seq.create len 0uy) ==\n 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len));\n little_endian_null (len - 1)\n end\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n =\n assert (little_endian (Seq.create 1 n) ==\n UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 *\n little_endian (Seq.slice (Seq.create 1 n) 1 1))\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\n (decreases (Seq.length w1))\nlet rec little_endian_append w1 w2 =\n let open FStar.Seq in\n if length w1 = 0 then\n begin\n assert_norm (pow2 (8 * 0) == 1);\n Seq.lemma_eq_intro (append w1 w2) w2\n end\n else\n begin\n let w1' = slice w1 1 (length w1) in\n assert (length w1' == length w1 - 1);\n little_endian_append w1' w2;\n assert (index (append w1 w2) 0 == index w1 0);\n Seq.lemma_eq_intro\n (append w1' w2)\n (Seq.slice (append w1 w2) 1 (length (append w1 w2)));\n assert (little_endian (append w1 w2) ==\n UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2));\n assert (little_endian (append w1' w2) ==\n little_endian w1' + pow2 (8 * length w1') * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2));\n Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1));\n assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1));\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1)\n end\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval lemma_euclidean_division: r:nat -> b:nat -> q:pos -> Lemma\n (requires (r < q))\n (ensures (r + q * b < q * (b+1)))\nlet lemma_euclidean_division r b q = ()\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet rec lemma_little_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 1 (Seq.length b) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_little_endian_is_bounded s;\n assert(UInt8.v (Seq.index b 0) < pow2 8);\n assert(little_endian s < pow2 (8 * Seq.length s));\n assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8);\n assert(little_endian b <= pow2 8 * (little_endian s + 1));\n assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\n [SMTPat (big_endian b)]\nlet rec lemma_big_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 0 (Seq.length b - 1) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_big_endian_is_bounded s;\n assert(UInt8.v (Seq.last b) < pow2 8);\n assert(big_endian s < pow2 (8 * Seq.length s));\n assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8);\n assert(big_endian b <= pow2 8 * (big_endian s + 1));\n assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b =\n lemma_little_endian_is_bounded b;\n if Seq.length b = 16 then ()\n else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b)\n\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = FStar.UInt128.uint64_to_uint128 (uint8_to_uint64 a)\n\n\n// turns an integer into a bytestream, little-endian\nval little_bytes: \n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b}) (decreases (v len))\nlet rec little_bytes len n = \n if len = 0ul then \n Seq.empty \n else\n let len = len -^ 1ul in \n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in \n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert(n' < pow2 (8 * v len ));\n let b' = little_bytes len n' in\n let b = cons byte b' in\n assert(Seq.equal b' (tail b));\n b\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 0 --max_ifuel 0\"\n\n\n(* injectivity proofs for byte encodings *) \n\ntype word = b:Seq.seq UInt8.t {Seq.length b <= 16}\nopen FStar.Math.Lib\nopen FStar.Math.Lemmas\n\nprivate let endian_is_injective q r q' r' : Lemma\n (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q')\n (ensures r = r' /\\ q = q') =\n lemma_mod_injective (pow2 8) (UInt8.v r) (UInt8.v r')\n\nprivate let big_endian_step (b:word{length b > 0}) : \n Lemma (big_endian b = U8.v (last b) + pow2 8 * big_endian (slice b 0 (length b - 1))) =\n ()\n\n#reset-options \"--z3rlimit 100\"\nval lemma_big_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires big_endian b = big_endian b')\n (ensures b == b')\n (decreases (length b))\nlet rec lemma_big_endian_inj s s' = \n let len = length s in \n if len = 0 then lemma_eq_intro s s'\n else\n let t = slice s 0 (len - 1) in \n let x = last s in \n lemma_eq_intro s (snoc t x);\n big_endian_step s;\n let t' = slice s' 0 (len - 1) in \n let x' = last s' in \n lemma_eq_intro s' (snoc t' x');\n big_endian_step s';\n endian_is_injective (big_endian t) x (big_endian t') x';\n lemma_big_endian_inj t t'\n\n(* the little endian proof could be simplified, as above *)\n\n(* this lemma is used only Crypto.Symmetric.Poly1305 *)\nval lemma_little_endian_is_injective_1: b:pos -> q:nat -> r:nat -> q':nat -> r':nat -> Lemma\n (requires (r < b /\\ r' < b /\\ r + b * q = r' + b * q'))\n (ensures (r = r' /\\ q = q'))\nlet lemma_little_endian_is_injective_1 b q r q' r' =\n lemma_mod_plus r q b;\n lemma_mod_plus r' q' b;\n lemma_mod_injective b r r'\n\n(* a sequence associativity property: ... @ ([x] @ s) == ... @ [x]) @ s *)\nprivate val lemma_little_endian_is_injective_2: b:bytes -> len:pos{len <= length b} -> Lemma\n (let s = slice b (length b - len) (length b) in \n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lib" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: FStar.Old.Endianness.bytes -> len: Prims.pos{len <= FStar.Seq.Base.length b}\n -> FStar.Pervasives.Lemma\n (ensures\n (let s = FStar.Seq.Base.slice b (FStar.Seq.Base.length b - len) (FStar.Seq.Base.length b) in\n let s' = FStar.Seq.Base.slice s 1 (FStar.Seq.Base.length s) in\n let s'' =\n FStar.Seq.Base.slice b (FStar.Seq.Base.length b - (len - 1)) (FStar.Seq.Base.length b)\n in\n s'' == s'))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Old.Endianness.bytes", "Prims.pos", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "FStar.UInt8.t", "FStar.Seq.Base.lemma_eq_intro", "FStar.Seq.Base.seq", "FStar.Seq.Base.slice", "Prims.op_Subtraction", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_little_endian_is_injective_2: b:bytes -> len:pos{len <= length b} -> Lemma\n (let s = slice b (length b - len) (length b) in \n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n s'' == s')\nlet lemma_little_endian_is_injective_2 b len =", "completed_definiton": "let s = slice b (length b - len) (length b) in\nlet s' = slice s 1 (length s) in\nlet s'' = slice b (length b - (len - 1)) (length b) in\nlemma_eq_intro s' s''", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.lemma_little_endian_inj", "original_source_type": "val lemma_little_endian_inj: b:bytes -> b':bytes {length b = length b'} -> Lemma\n (requires little_endian b = little_endian b')\n (ensures b == b')", "source_type": "val lemma_little_endian_inj: b:bytes -> b':bytes {length b = length b'} -> Lemma\n (requires little_endian b = little_endian b')\n (ensures b == b')", "source_definition": "let lemma_little_endian_inj b b' =\n let len = length b in \n Seq.lemma_eq_intro b (Seq.slice b 0 len);\n Seq.lemma_eq_intro b' (Seq.slice b' 0 len);\n lemma_little_endian_is_injective b b' len", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 297, "start_col": 34, "end_line": 301, "end_col": 43 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n#set-options \"--initial_fuel 0 --max_fuel 0\"\n\ntype bytes = Seq.seq U8.t // Pure sequence of bytes\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\n\n(* type lbuffer (l:nat) = b:buffer {Buffer.length b == l} *)\n\n#reset-options\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b = UInt128.v a % pow2 8})\n = Math.Lemmas.pow2_modulo_modulo_lemma_2 (UInt128.v a) 64 8;\n uint64_to_uint8 (FStar.UInt128.uint128_to_uint64 a)\n\n#reset-options \"--z3rlimit 20 --initial_fuel 0 --max_fuel 0\"\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\nlet rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) =\n if Seq.length b = 0 then 0\n else\n UInt8.v (head b) + pow2 8 * little_endian (tail b)\n\n(* Big endian integer value of a sequence of bytes *)\nlet rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = \n if Seq.length b = 0 then 0 \n else\n UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet rec little_endian_null len =\n if len = 0 then ()\n else\n begin\n Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len)\n\t\t (Seq.create (len - 1) 0uy);\n assert (little_endian (Seq.create len 0uy) ==\n 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len));\n little_endian_null (len - 1)\n end\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n =\n assert (little_endian (Seq.create 1 n) ==\n UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 *\n little_endian (Seq.slice (Seq.create 1 n) 1 1))\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\n (decreases (Seq.length w1))\nlet rec little_endian_append w1 w2 =\n let open FStar.Seq in\n if length w1 = 0 then\n begin\n assert_norm (pow2 (8 * 0) == 1);\n Seq.lemma_eq_intro (append w1 w2) w2\n end\n else\n begin\n let w1' = slice w1 1 (length w1) in\n assert (length w1' == length w1 - 1);\n little_endian_append w1' w2;\n assert (index (append w1 w2) 0 == index w1 0);\n Seq.lemma_eq_intro\n (append w1' w2)\n (Seq.slice (append w1 w2) 1 (length (append w1 w2)));\n assert (little_endian (append w1 w2) ==\n UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2));\n assert (little_endian (append w1' w2) ==\n little_endian w1' + pow2 (8 * length w1') * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2));\n Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1));\n assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1));\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1)\n end\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval lemma_euclidean_division: r:nat -> b:nat -> q:pos -> Lemma\n (requires (r < q))\n (ensures (r + q * b < q * (b+1)))\nlet lemma_euclidean_division r b q = ()\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet rec lemma_little_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 1 (Seq.length b) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_little_endian_is_bounded s;\n assert(UInt8.v (Seq.index b 0) < pow2 8);\n assert(little_endian s < pow2 (8 * Seq.length s));\n assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8);\n assert(little_endian b <= pow2 8 * (little_endian s + 1));\n assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\n [SMTPat (big_endian b)]\nlet rec lemma_big_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 0 (Seq.length b - 1) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_big_endian_is_bounded s;\n assert(UInt8.v (Seq.last b) < pow2 8);\n assert(big_endian s < pow2 (8 * Seq.length s));\n assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8);\n assert(big_endian b <= pow2 8 * (big_endian s + 1));\n assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b =\n lemma_little_endian_is_bounded b;\n if Seq.length b = 16 then ()\n else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b)\n\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = FStar.UInt128.uint64_to_uint128 (uint8_to_uint64 a)\n\n\n// turns an integer into a bytestream, little-endian\nval little_bytes: \n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b}) (decreases (v len))\nlet rec little_bytes len n = \n if len = 0ul then \n Seq.empty \n else\n let len = len -^ 1ul in \n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in \n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert(n' < pow2 (8 * v len ));\n let b' = little_bytes len n' in\n let b = cons byte b' in\n assert(Seq.equal b' (tail b));\n b\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 0 --max_ifuel 0\"\n\n\n(* injectivity proofs for byte encodings *) \n\ntype word = b:Seq.seq UInt8.t {Seq.length b <= 16}\nopen FStar.Math.Lib\nopen FStar.Math.Lemmas\n\nprivate let endian_is_injective q r q' r' : Lemma\n (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q')\n (ensures r = r' /\\ q = q') =\n lemma_mod_injective (pow2 8) (UInt8.v r) (UInt8.v r')\n\nprivate let big_endian_step (b:word{length b > 0}) : \n Lemma (big_endian b = U8.v (last b) + pow2 8 * big_endian (slice b 0 (length b - 1))) =\n ()\n\n#reset-options \"--z3rlimit 100\"\nval lemma_big_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires big_endian b = big_endian b')\n (ensures b == b')\n (decreases (length b))\nlet rec lemma_big_endian_inj s s' = \n let len = length s in \n if len = 0 then lemma_eq_intro s s'\n else\n let t = slice s 0 (len - 1) in \n let x = last s in \n lemma_eq_intro s (snoc t x);\n big_endian_step s;\n let t' = slice s' 0 (len - 1) in \n let x' = last s' in \n lemma_eq_intro s' (snoc t' x');\n big_endian_step s';\n endian_is_injective (big_endian t) x (big_endian t') x';\n lemma_big_endian_inj t t'\n\n(* the little endian proof could be simplified, as above *)\n\n(* this lemma is used only Crypto.Symmetric.Poly1305 *)\nval lemma_little_endian_is_injective_1: b:pos -> q:nat -> r:nat -> q':nat -> r':nat -> Lemma\n (requires (r < b /\\ r' < b /\\ r + b * q = r' + b * q'))\n (ensures (r = r' /\\ q = q'))\nlet lemma_little_endian_is_injective_1 b q r q' r' =\n lemma_mod_plus r q b;\n lemma_mod_plus r' q' b;\n lemma_mod_injective b r r'\n\n(* a sequence associativity property: ... @ ([x] @ s) == ... @ [x]) @ s *)\nprivate val lemma_little_endian_is_injective_2: b:bytes -> len:pos{len <= length b} -> Lemma\n (let s = slice b (length b - len) (length b) in \n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n s'' == s')\nlet lemma_little_endian_is_injective_2 b len =\n let s = slice b (length b - len) (length b) in\n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n lemma_eq_intro s' s''\n\n(* a sequence injectivity property *)\nprivate val lemma_little_endian_is_injective_3: b:bytes -> b':bytes -> len:pos{len <= length b /\\ len <= length b'} -> Lemma\n (requires \n slice b (length b - (len - 1)) (length b) == slice b' (length b' - (len-1)) (length b') /\\ \n Seq.index b (length b - len) = Seq.index b' (length b' - len))\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))\nlet lemma_little_endian_is_injective_3 b b' len =\n lemma_eq_intro (slice b (length b - len) (length b)) (cons (index b (length b - len)) (slice b (length b - (len-1)) (length b)));\n lemma_eq_intro (slice b' (length b' - len) (length b')) (cons (index b' (length b' - len)) (slice b' (length b' - (len-1)) (length b')))\n\nprivate let little_endian_step (b:bytes{length b > 0}): \n Lemma (little_endian b = U8.v (head b) + pow2 8 * little_endian (tail b)) \n = ()\n\nval lemma_little_endian_is_injective: b:bytes -> b':bytes -> len:nat{len <= length b /\\ len <= length b'} -> Lemma\n (requires little_endian (slice b (length b - len) (length b)) = little_endian (slice b' (length b' - len) (length b')) )\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))\nlet rec lemma_little_endian_is_injective b b' len =\n if len = 0 then\n lemma_eq_intro (slice b (length b - len) (length b)) (slice b' (length b' - len) (length b'))\n else\n let s = slice b (length b - len) (length b) in\n let s' = slice b' (length b' - len) (length b') in\n little_endian_step s; \n little_endian_step s';\n endian_is_injective (little_endian (tail s)) (head s) (little_endian (tail s')) (head s');\n lemma_little_endian_is_injective_2 b len;\n lemma_little_endian_is_injective_2 b' len;\n lemma_little_endian_is_injective b b' (len - 1);\n lemma_little_endian_is_injective_3 b b' len\n\nval lemma_little_endian_inj: b:bytes -> b':bytes {length b = length b'} -> Lemma\n (requires little_endian b = little_endian b')", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lib" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b: FStar.Old.Endianness.bytes ->\n b': FStar.Old.Endianness.bytes{FStar.Seq.Base.length b = FStar.Seq.Base.length b'}\n -> FStar.Pervasives.Lemma\n (requires FStar.Old.Endianness.little_endian b = FStar.Old.Endianness.little_endian b')\n (ensures b == b')", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Old.Endianness.bytes", "Prims.b2t", "Prims.op_Equality", "Prims.nat", "FStar.Seq.Base.length", "FStar.UInt8.t", "FStar.Old.Endianness.lemma_little_endian_is_injective", "Prims.unit", "FStar.Seq.Base.lemma_eq_intro", "FStar.Seq.Base.slice" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_little_endian_inj: b:bytes -> b':bytes {length b = length b'} -> Lemma\n (requires little_endian b = little_endian b')\n (ensures b == b')\nlet lemma_little_endian_inj b b' =", "completed_definiton": "let len = length b in\nSeq.lemma_eq_intro b (Seq.slice b 0 len);\nSeq.lemma_eq_intro b' (Seq.slice b' 0 len);\nlemma_little_endian_is_injective b b' len", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.lemma_little_endian_is_injective_3", "original_source_type": "val lemma_little_endian_is_injective_3: b:bytes -> b':bytes -> len:pos{len <= length b /\\ len <= length b'} -> Lemma\n (requires \n slice b (length b - (len - 1)) (length b) == slice b' (length b' - (len-1)) (length b') /\\ \n Seq.index b (length b - len) = Seq.index b' (length b' - len))\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))", "source_type": "val lemma_little_endian_is_injective_3: b:bytes -> b':bytes -> len:pos{len <= length b /\\ len <= length b'} -> Lemma\n (requires \n slice b (length b - (len - 1)) (length b) == slice b' (length b' - (len-1)) (length b') /\\ \n Seq.index b (length b - len) = Seq.index b' (length b' - len))\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))", "source_definition": "let lemma_little_endian_is_injective_3 b b' len =\n lemma_eq_intro (slice b (length b - len) (length b)) (cons (index b (length b - len)) (slice b (length b - (len-1)) (length b)));\n lemma_eq_intro (slice b' (length b' - len) (length b')) (cons (index b' (length b' - len)) (slice b' (length b' - (len-1)) (length b')))", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 270, "start_col": 2, "end_line": 271, "end_col": 138 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n#set-options \"--initial_fuel 0 --max_fuel 0\"\n\ntype bytes = Seq.seq U8.t // Pure sequence of bytes\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\n\n(* type lbuffer (l:nat) = b:buffer {Buffer.length b == l} *)\n\n#reset-options\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b = UInt128.v a % pow2 8})\n = Math.Lemmas.pow2_modulo_modulo_lemma_2 (UInt128.v a) 64 8;\n uint64_to_uint8 (FStar.UInt128.uint128_to_uint64 a)\n\n#reset-options \"--z3rlimit 20 --initial_fuel 0 --max_fuel 0\"\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\nlet rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) =\n if Seq.length b = 0 then 0\n else\n UInt8.v (head b) + pow2 8 * little_endian (tail b)\n\n(* Big endian integer value of a sequence of bytes *)\nlet rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = \n if Seq.length b = 0 then 0 \n else\n UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet rec little_endian_null len =\n if len = 0 then ()\n else\n begin\n Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len)\n\t\t (Seq.create (len - 1) 0uy);\n assert (little_endian (Seq.create len 0uy) ==\n 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len));\n little_endian_null (len - 1)\n end\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n =\n assert (little_endian (Seq.create 1 n) ==\n UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 *\n little_endian (Seq.slice (Seq.create 1 n) 1 1))\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\n (decreases (Seq.length w1))\nlet rec little_endian_append w1 w2 =\n let open FStar.Seq in\n if length w1 = 0 then\n begin\n assert_norm (pow2 (8 * 0) == 1);\n Seq.lemma_eq_intro (append w1 w2) w2\n end\n else\n begin\n let w1' = slice w1 1 (length w1) in\n assert (length w1' == length w1 - 1);\n little_endian_append w1' w2;\n assert (index (append w1 w2) 0 == index w1 0);\n Seq.lemma_eq_intro\n (append w1' w2)\n (Seq.slice (append w1 w2) 1 (length (append w1 w2)));\n assert (little_endian (append w1 w2) ==\n UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2));\n assert (little_endian (append w1' w2) ==\n little_endian w1' + pow2 (8 * length w1') * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2));\n Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1));\n assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1));\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1)\n end\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval lemma_euclidean_division: r:nat -> b:nat -> q:pos -> Lemma\n (requires (r < q))\n (ensures (r + q * b < q * (b+1)))\nlet lemma_euclidean_division r b q = ()\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet rec lemma_little_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 1 (Seq.length b) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_little_endian_is_bounded s;\n assert(UInt8.v (Seq.index b 0) < pow2 8);\n assert(little_endian s < pow2 (8 * Seq.length s));\n assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8);\n assert(little_endian b <= pow2 8 * (little_endian s + 1));\n assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\n [SMTPat (big_endian b)]\nlet rec lemma_big_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 0 (Seq.length b - 1) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_big_endian_is_bounded s;\n assert(UInt8.v (Seq.last b) < pow2 8);\n assert(big_endian s < pow2 (8 * Seq.length s));\n assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8);\n assert(big_endian b <= pow2 8 * (big_endian s + 1));\n assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b =\n lemma_little_endian_is_bounded b;\n if Seq.length b = 16 then ()\n else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b)\n\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = FStar.UInt128.uint64_to_uint128 (uint8_to_uint64 a)\n\n\n// turns an integer into a bytestream, little-endian\nval little_bytes: \n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b}) (decreases (v len))\nlet rec little_bytes len n = \n if len = 0ul then \n Seq.empty \n else\n let len = len -^ 1ul in \n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in \n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert(n' < pow2 (8 * v len ));\n let b' = little_bytes len n' in\n let b = cons byte b' in\n assert(Seq.equal b' (tail b));\n b\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 0 --max_ifuel 0\"\n\n\n(* injectivity proofs for byte encodings *) \n\ntype word = b:Seq.seq UInt8.t {Seq.length b <= 16}\nopen FStar.Math.Lib\nopen FStar.Math.Lemmas\n\nprivate let endian_is_injective q r q' r' : Lemma\n (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q')\n (ensures r = r' /\\ q = q') =\n lemma_mod_injective (pow2 8) (UInt8.v r) (UInt8.v r')\n\nprivate let big_endian_step (b:word{length b > 0}) : \n Lemma (big_endian b = U8.v (last b) + pow2 8 * big_endian (slice b 0 (length b - 1))) =\n ()\n\n#reset-options \"--z3rlimit 100\"\nval lemma_big_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires big_endian b = big_endian b')\n (ensures b == b')\n (decreases (length b))\nlet rec lemma_big_endian_inj s s' = \n let len = length s in \n if len = 0 then lemma_eq_intro s s'\n else\n let t = slice s 0 (len - 1) in \n let x = last s in \n lemma_eq_intro s (snoc t x);\n big_endian_step s;\n let t' = slice s' 0 (len - 1) in \n let x' = last s' in \n lemma_eq_intro s' (snoc t' x');\n big_endian_step s';\n endian_is_injective (big_endian t) x (big_endian t') x';\n lemma_big_endian_inj t t'\n\n(* the little endian proof could be simplified, as above *)\n\n(* this lemma is used only Crypto.Symmetric.Poly1305 *)\nval lemma_little_endian_is_injective_1: b:pos -> q:nat -> r:nat -> q':nat -> r':nat -> Lemma\n (requires (r < b /\\ r' < b /\\ r + b * q = r' + b * q'))\n (ensures (r = r' /\\ q = q'))\nlet lemma_little_endian_is_injective_1 b q r q' r' =\n lemma_mod_plus r q b;\n lemma_mod_plus r' q' b;\n lemma_mod_injective b r r'\n\n(* a sequence associativity property: ... @ ([x] @ s) == ... @ [x]) @ s *)\nprivate val lemma_little_endian_is_injective_2: b:bytes -> len:pos{len <= length b} -> Lemma\n (let s = slice b (length b - len) (length b) in \n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n s'' == s')\nlet lemma_little_endian_is_injective_2 b len =\n let s = slice b (length b - len) (length b) in\n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n lemma_eq_intro s' s''\n\n(* a sequence injectivity property *)\nprivate val lemma_little_endian_is_injective_3: b:bytes -> b':bytes -> len:pos{len <= length b /\\ len <= length b'} -> Lemma\n (requires \n slice b (length b - (len - 1)) (length b) == slice b' (length b' - (len-1)) (length b') /\\ \n Seq.index b (length b - len) = Seq.index b' (length b' - len))\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lib" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b: FStar.Old.Endianness.bytes ->\n b': FStar.Old.Endianness.bytes ->\n len: Prims.pos{len <= FStar.Seq.Base.length b /\\ len <= FStar.Seq.Base.length b'}\n -> FStar.Pervasives.Lemma\n (requires\n FStar.Seq.Base.slice b (FStar.Seq.Base.length b - (len - 1)) (FStar.Seq.Base.length b) ==\n FStar.Seq.Base.slice b' (FStar.Seq.Base.length b' - (len - 1)) (FStar.Seq.Base.length b') /\\\n FStar.Seq.Base.index b (FStar.Seq.Base.length b - len) =\n FStar.Seq.Base.index b' (FStar.Seq.Base.length b' - len))\n (ensures\n FStar.Seq.Base.slice b (FStar.Seq.Base.length b - len) (FStar.Seq.Base.length b) ==\n FStar.Seq.Base.slice b' (FStar.Seq.Base.length b' - len) (FStar.Seq.Base.length b'))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Old.Endianness.bytes", "Prims.pos", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "FStar.UInt8.t", "FStar.Seq.Base.lemma_eq_intro", "FStar.Seq.Base.slice", "Prims.op_Subtraction", "FStar.Seq.Properties.cons", "FStar.Seq.Base.index", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_little_endian_is_injective_3: b:bytes -> b':bytes -> len:pos{len <= length b /\\ len <= length b'} -> Lemma\n (requires \n slice b (length b - (len - 1)) (length b) == slice b' (length b' - (len-1)) (length b') /\\ \n Seq.index b (length b - len) = Seq.index b' (length b' - len))\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))\nlet lemma_little_endian_is_injective_3 b b' len =", "completed_definiton": "lemma_eq_intro (slice b (length b - len) (length b))\n (cons (index b (length b - len)) (slice b (length b - (len - 1)) (length b)));\nlemma_eq_intro (slice b' (length b' - len) (length b'))\n (cons (index b' (length b' - len)) (slice b' (length b' - (len - 1)) (length b')))", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.lemma_little_endian_is_bounded", "original_source_type": "val lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))", "source_type": "val lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))", "source_definition": "let rec lemma_little_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 1 (Seq.length b) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_little_endian_is_bounded s;\n assert(UInt8.v (Seq.index b 0) < pow2 8);\n assert(little_endian s < pow2 (8 * Seq.length s));\n assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8);\n assert(little_endian b <= pow2 8 * (little_endian s + 1));\n assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 127, "start_col": 2, "end_line": 141, "end_col": 7 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n#set-options \"--initial_fuel 0 --max_fuel 0\"\n\ntype bytes = Seq.seq U8.t // Pure sequence of bytes\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\n\n(* type lbuffer (l:nat) = b:buffer {Buffer.length b == l} *)\n\n#reset-options\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b = UInt128.v a % pow2 8})\n = Math.Lemmas.pow2_modulo_modulo_lemma_2 (UInt128.v a) 64 8;\n uint64_to_uint8 (FStar.UInt128.uint128_to_uint64 a)\n\n#reset-options \"--z3rlimit 20 --initial_fuel 0 --max_fuel 0\"\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\nlet rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) =\n if Seq.length b = 0 then 0\n else\n UInt8.v (head b) + pow2 8 * little_endian (tail b)\n\n(* Big endian integer value of a sequence of bytes *)\nlet rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = \n if Seq.length b = 0 then 0 \n else\n UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet rec little_endian_null len =\n if len = 0 then ()\n else\n begin\n Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len)\n\t\t (Seq.create (len - 1) 0uy);\n assert (little_endian (Seq.create len 0uy) ==\n 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len));\n little_endian_null (len - 1)\n end\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n =\n assert (little_endian (Seq.create 1 n) ==\n UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 *\n little_endian (Seq.slice (Seq.create 1 n) 1 1))\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\n (decreases (Seq.length w1))\nlet rec little_endian_append w1 w2 =\n let open FStar.Seq in\n if length w1 = 0 then\n begin\n assert_norm (pow2 (8 * 0) == 1);\n Seq.lemma_eq_intro (append w1 w2) w2\n end\n else\n begin\n let w1' = slice w1 1 (length w1) in\n assert (length w1' == length w1 - 1);\n little_endian_append w1' w2;\n assert (index (append w1 w2) 0 == index w1 0);\n Seq.lemma_eq_intro\n (append w1' w2)\n (Seq.slice (append w1 w2) 1 (length (append w1 w2)));\n assert (little_endian (append w1 w2) ==\n UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2));\n assert (little_endian (append w1' w2) ==\n little_endian w1' + pow2 (8 * length w1') * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2));\n Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1));\n assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1));\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1)\n end\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval lemma_euclidean_division: r:nat -> b:nat -> q:pos -> Lemma\n (requires (r < q))\n (ensures (r + q * b < q * (b+1)))\nlet lemma_euclidean_division r b q = ()\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 50, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: FStar.Old.Endianness.bytes\n -> FStar.Pervasives.Lemma\n (ensures FStar.Old.Endianness.little_endian b < Prims.pow2 (8 * FStar.Seq.Base.length b))\n (decreases FStar.Seq.Base.length b)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma", "" ], "mutual_with": [], "ideal_premises": [ "FStar.Old.Endianness.bytes", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "FStar.UInt8.t", "Prims.bool", "FStar.Old.Endianness.lemma_factorise", "Prims.op_Subtraction", "Prims.unit", "FStar.Math.Lemmas.pow2_plus", "FStar.Mul.op_Star", "Prims._assert", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Old.Endianness.little_endian", "Prims.pow2", "Prims.op_Addition", "FStar.Old.Endianness.lemma_euclidean_division", "FStar.UInt8.v", "FStar.Seq.Base.index", "Prims.op_LessThan", "FStar.Old.Endianness.lemma_little_endian_is_bounded", "FStar.Seq.Base.seq", "FStar.Seq.Base.slice" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet rec lemma_little_endian_is_bounded b =", "completed_definiton": "if Seq.length b = 0\nthen ()\nelse\n let s = Seq.slice b 1 (Seq.length b) in\n assert (Seq.length s = Seq.length b - 1);\n lemma_little_endian_is_bounded s;\n assert (UInt8.v (Seq.index b 0) < pow2 8);\n assert (little_endian s < pow2 (8 * Seq.length s));\n assert (little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8);\n assert (little_endian b <= pow2 8 * (little_endian s + 1));\n assert (little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.lemma_big_endian_is_bounded", "original_source_type": "val lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\n [SMTPat (big_endian b)]", "source_type": "val lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\n [SMTPat (big_endian b)]", "source_definition": "let rec lemma_big_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 0 (Seq.length b - 1) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_big_endian_is_bounded s;\n assert(UInt8.v (Seq.last b) < pow2 8);\n assert(big_endian s < pow2 (8 * Seq.length s));\n assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8);\n assert(big_endian b <= pow2 8 * (big_endian s + 1));\n assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 149, "start_col": 2, "end_line": 163, "end_col": 7 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n#set-options \"--initial_fuel 0 --max_fuel 0\"\n\ntype bytes = Seq.seq U8.t // Pure sequence of bytes\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\n\n(* type lbuffer (l:nat) = b:buffer {Buffer.length b == l} *)\n\n#reset-options\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b = UInt128.v a % pow2 8})\n = Math.Lemmas.pow2_modulo_modulo_lemma_2 (UInt128.v a) 64 8;\n uint64_to_uint8 (FStar.UInt128.uint128_to_uint64 a)\n\n#reset-options \"--z3rlimit 20 --initial_fuel 0 --max_fuel 0\"\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\nlet rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) =\n if Seq.length b = 0 then 0\n else\n UInt8.v (head b) + pow2 8 * little_endian (tail b)\n\n(* Big endian integer value of a sequence of bytes *)\nlet rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = \n if Seq.length b = 0 then 0 \n else\n UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet rec little_endian_null len =\n if len = 0 then ()\n else\n begin\n Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len)\n\t\t (Seq.create (len - 1) 0uy);\n assert (little_endian (Seq.create len 0uy) ==\n 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len));\n little_endian_null (len - 1)\n end\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n =\n assert (little_endian (Seq.create 1 n) ==\n UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 *\n little_endian (Seq.slice (Seq.create 1 n) 1 1))\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\n (decreases (Seq.length w1))\nlet rec little_endian_append w1 w2 =\n let open FStar.Seq in\n if length w1 = 0 then\n begin\n assert_norm (pow2 (8 * 0) == 1);\n Seq.lemma_eq_intro (append w1 w2) w2\n end\n else\n begin\n let w1' = slice w1 1 (length w1) in\n assert (length w1' == length w1 - 1);\n little_endian_append w1' w2;\n assert (index (append w1 w2) 0 == index w1 0);\n Seq.lemma_eq_intro\n (append w1' w2)\n (Seq.slice (append w1 w2) 1 (length (append w1 w2)));\n assert (little_endian (append w1 w2) ==\n UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2));\n assert (little_endian (append w1' w2) ==\n little_endian w1' + pow2 (8 * length w1') * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2));\n Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1));\n assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1));\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1)\n end\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval lemma_euclidean_division: r:nat -> b:nat -> q:pos -> Lemma\n (requires (r < q))\n (ensures (r + q * b < q * (b+1)))\nlet lemma_euclidean_division r b q = ()\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet rec lemma_little_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 1 (Seq.length b) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_little_endian_is_bounded s;\n assert(UInt8.v (Seq.index b 0) < pow2 8);\n assert(little_endian s < pow2 (8 * Seq.length s));\n assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8);\n assert(little_endian b <= pow2 8 * (little_endian s + 1));\n assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\n [SMTPat (big_endian b)]", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 50, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: FStar.Old.Endianness.bytes\n -> FStar.Pervasives.Lemma\n (ensures FStar.Old.Endianness.big_endian b < Prims.pow2 (8 * FStar.Seq.Base.length b))\n (decreases FStar.Seq.Base.length b)\n [SMTPat (FStar.Old.Endianness.big_endian b)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma", "" ], "mutual_with": [], "ideal_premises": [ "FStar.Old.Endianness.bytes", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "FStar.UInt8.t", "Prims.bool", "FStar.Old.Endianness.lemma_factorise", "Prims.op_Subtraction", "Prims.unit", "FStar.Math.Lemmas.pow2_plus", "FStar.Mul.op_Star", "Prims._assert", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Old.Endianness.big_endian", "Prims.pow2", "Prims.op_Addition", "FStar.Old.Endianness.lemma_euclidean_division", "FStar.UInt8.v", "FStar.Seq.Properties.last", "Prims.op_LessThan", "FStar.Old.Endianness.lemma_big_endian_is_bounded", "FStar.Seq.Base.seq", "FStar.Seq.Base.slice" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\n [SMTPat (big_endian b)]\nlet rec lemma_big_endian_is_bounded b =", "completed_definiton": "if Seq.length b = 0\nthen ()\nelse\n let s = Seq.slice b 0 (Seq.length b - 1) in\n assert (Seq.length s = Seq.length b - 1);\n lemma_big_endian_is_bounded s;\n assert (UInt8.v (Seq.last b) < pow2 8);\n assert (big_endian s < pow2 (8 * Seq.length s));\n assert (big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8);\n assert (big_endian b <= pow2 8 * (big_endian s + 1));\n assert (big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.lemma_big_endian_inj", "original_source_type": "val lemma_big_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires big_endian b = big_endian b')\n (ensures b == b')\n (decreases (length b))", "source_type": "val lemma_big_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires big_endian b = big_endian b')\n (ensures b == b')\n (decreases (length b))", "source_definition": "let rec lemma_big_endian_inj s s' = \n let len = length s in \n if len = 0 then lemma_eq_intro s s'\n else\n let t = slice s 0 (len - 1) in \n let x = last s in \n lemma_eq_intro s (snoc t x);\n big_endian_step s;\n let t' = slice s' 0 (len - 1) in \n let x' = last s' in \n lemma_eq_intro s' (snoc t' x');\n big_endian_step s';\n endian_is_injective (big_endian t) x (big_endian t') x';\n lemma_big_endian_inj t t'", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 225, "start_col": 35, "end_line": 238, "end_col": 29 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n#set-options \"--initial_fuel 0 --max_fuel 0\"\n\ntype bytes = Seq.seq U8.t // Pure sequence of bytes\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\n\n(* type lbuffer (l:nat) = b:buffer {Buffer.length b == l} *)\n\n#reset-options\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b = UInt128.v a % pow2 8})\n = Math.Lemmas.pow2_modulo_modulo_lemma_2 (UInt128.v a) 64 8;\n uint64_to_uint8 (FStar.UInt128.uint128_to_uint64 a)\n\n#reset-options \"--z3rlimit 20 --initial_fuel 0 --max_fuel 0\"\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\nlet rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) =\n if Seq.length b = 0 then 0\n else\n UInt8.v (head b) + pow2 8 * little_endian (tail b)\n\n(* Big endian integer value of a sequence of bytes *)\nlet rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = \n if Seq.length b = 0 then 0 \n else\n UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet rec little_endian_null len =\n if len = 0 then ()\n else\n begin\n Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len)\n\t\t (Seq.create (len - 1) 0uy);\n assert (little_endian (Seq.create len 0uy) ==\n 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len));\n little_endian_null (len - 1)\n end\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n =\n assert (little_endian (Seq.create 1 n) ==\n UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 *\n little_endian (Seq.slice (Seq.create 1 n) 1 1))\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\n (decreases (Seq.length w1))\nlet rec little_endian_append w1 w2 =\n let open FStar.Seq in\n if length w1 = 0 then\n begin\n assert_norm (pow2 (8 * 0) == 1);\n Seq.lemma_eq_intro (append w1 w2) w2\n end\n else\n begin\n let w1' = slice w1 1 (length w1) in\n assert (length w1' == length w1 - 1);\n little_endian_append w1' w2;\n assert (index (append w1 w2) 0 == index w1 0);\n Seq.lemma_eq_intro\n (append w1' w2)\n (Seq.slice (append w1 w2) 1 (length (append w1 w2)));\n assert (little_endian (append w1 w2) ==\n UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2));\n assert (little_endian (append w1' w2) ==\n little_endian w1' + pow2 (8 * length w1') * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2));\n Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1));\n assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1));\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1)\n end\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval lemma_euclidean_division: r:nat -> b:nat -> q:pos -> Lemma\n (requires (r < q))\n (ensures (r + q * b < q * (b+1)))\nlet lemma_euclidean_division r b q = ()\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet rec lemma_little_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 1 (Seq.length b) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_little_endian_is_bounded s;\n assert(UInt8.v (Seq.index b 0) < pow2 8);\n assert(little_endian s < pow2 (8 * Seq.length s));\n assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8);\n assert(little_endian b <= pow2 8 * (little_endian s + 1));\n assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\n [SMTPat (big_endian b)]\nlet rec lemma_big_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 0 (Seq.length b - 1) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_big_endian_is_bounded s;\n assert(UInt8.v (Seq.last b) < pow2 8);\n assert(big_endian s < pow2 (8 * Seq.length s));\n assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8);\n assert(big_endian b <= pow2 8 * (big_endian s + 1));\n assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b =\n lemma_little_endian_is_bounded b;\n if Seq.length b = 16 then ()\n else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b)\n\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = FStar.UInt128.uint64_to_uint128 (uint8_to_uint64 a)\n\n\n// turns an integer into a bytestream, little-endian\nval little_bytes: \n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b}) (decreases (v len))\nlet rec little_bytes len n = \n if len = 0ul then \n Seq.empty \n else\n let len = len -^ 1ul in \n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in \n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert(n' < pow2 (8 * v len ));\n let b' = little_bytes len n' in\n let b = cons byte b' in\n assert(Seq.equal b' (tail b));\n b\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 0 --max_ifuel 0\"\n\n\n(* injectivity proofs for byte encodings *) \n\ntype word = b:Seq.seq UInt8.t {Seq.length b <= 16}\nopen FStar.Math.Lib\nopen FStar.Math.Lemmas\n\nprivate let endian_is_injective q r q' r' : Lemma\n (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q')\n (ensures r = r' /\\ q = q') =\n lemma_mod_injective (pow2 8) (UInt8.v r) (UInt8.v r')\n\nprivate let big_endian_step (b:word{length b > 0}) : \n Lemma (big_endian b = U8.v (last b) + pow2 8 * big_endian (slice b 0 (length b - 1))) =\n ()\n\n#reset-options \"--z3rlimit 100\"\nval lemma_big_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires big_endian b = big_endian b')\n (ensures b == b')", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lib" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b: FStar.Old.Endianness.word ->\n b': FStar.Old.Endianness.word{FStar.Seq.Base.length b = FStar.Seq.Base.length b'}\n -> FStar.Pervasives.Lemma\n (requires FStar.Old.Endianness.big_endian b = FStar.Old.Endianness.big_endian b')\n (ensures b == b')\n (decreases FStar.Seq.Base.length b)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma", "" ], "mutual_with": [], "ideal_premises": [ "FStar.Old.Endianness.word", "Prims.b2t", "Prims.op_Equality", "Prims.nat", "FStar.Seq.Base.length", "FStar.UInt8.t", "Prims.int", "FStar.Seq.Base.lemma_eq_intro", "Prims.bool", "FStar.Old.Endianness.lemma_big_endian_inj", "Prims.unit", "FStar.Old.Endianness.endian_is_injective", "FStar.Old.Endianness.big_endian", "FStar.Old.Endianness.big_endian_step", "FStar.Seq.Properties.snoc", "FStar.Seq.Properties.last", "FStar.Seq.Base.seq", "FStar.Seq.Base.slice", "Prims.op_Subtraction" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_big_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires big_endian b = big_endian b')\n (ensures b == b')\n (decreases (length b))\nlet rec lemma_big_endian_inj s s' =", "completed_definiton": "let len = length s in\nif len = 0\nthen lemma_eq_intro s s'\nelse\n let t = slice s 0 (len - 1) in\n let x = last s in\n lemma_eq_intro s (snoc t x);\n big_endian_step s;\n let t' = slice s' 0 (len - 1) in\n let x' = last s' in\n lemma_eq_intro s' (snoc t' x');\n big_endian_step s';\n endian_is_injective (big_endian t) x (big_endian t') x';\n lemma_big_endian_inj t t'", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.lemma_little_endian_is_injective", "original_source_type": "val lemma_little_endian_is_injective: b:bytes -> b':bytes -> len:nat{len <= length b /\\ len <= length b'} -> Lemma\n (requires little_endian (slice b (length b - len) (length b)) = little_endian (slice b' (length b' - len) (length b')) )\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))", "source_type": "val lemma_little_endian_is_injective: b:bytes -> b':bytes -> len:nat{len <= length b /\\ len <= length b'} -> Lemma\n (requires little_endian (slice b (length b - len) (length b)) = little_endian (slice b' (length b' - len) (length b')) )\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))", "source_definition": "let rec lemma_little_endian_is_injective b b' len =\n if len = 0 then\n lemma_eq_intro (slice b (length b - len) (length b)) (slice b' (length b' - len) (length b'))\n else\n let s = slice b (length b - len) (length b) in\n let s' = slice b' (length b' - len) (length b') in\n little_endian_step s; \n little_endian_step s';\n endian_is_injective (little_endian (tail s)) (head s) (little_endian (tail s')) (head s');\n lemma_little_endian_is_injective_2 b len;\n lemma_little_endian_is_injective_2 b' len;\n lemma_little_endian_is_injective b b' (len - 1);\n lemma_little_endian_is_injective_3 b b' len", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 281, "start_col": 2, "end_line": 292, "end_col": 47 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n#set-options \"--initial_fuel 0 --max_fuel 0\"\n\ntype bytes = Seq.seq U8.t // Pure sequence of bytes\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\n\n(* type lbuffer (l:nat) = b:buffer {Buffer.length b == l} *)\n\n#reset-options\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b = UInt128.v a % pow2 8})\n = Math.Lemmas.pow2_modulo_modulo_lemma_2 (UInt128.v a) 64 8;\n uint64_to_uint8 (FStar.UInt128.uint128_to_uint64 a)\n\n#reset-options \"--z3rlimit 20 --initial_fuel 0 --max_fuel 0\"\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\nlet rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) =\n if Seq.length b = 0 then 0\n else\n UInt8.v (head b) + pow2 8 * little_endian (tail b)\n\n(* Big endian integer value of a sequence of bytes *)\nlet rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = \n if Seq.length b = 0 then 0 \n else\n UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet rec little_endian_null len =\n if len = 0 then ()\n else\n begin\n Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len)\n\t\t (Seq.create (len - 1) 0uy);\n assert (little_endian (Seq.create len 0uy) ==\n 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len));\n little_endian_null (len - 1)\n end\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n =\n assert (little_endian (Seq.create 1 n) ==\n UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 *\n little_endian (Seq.slice (Seq.create 1 n) 1 1))\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\n (decreases (Seq.length w1))\nlet rec little_endian_append w1 w2 =\n let open FStar.Seq in\n if length w1 = 0 then\n begin\n assert_norm (pow2 (8 * 0) == 1);\n Seq.lemma_eq_intro (append w1 w2) w2\n end\n else\n begin\n let w1' = slice w1 1 (length w1) in\n assert (length w1' == length w1 - 1);\n little_endian_append w1' w2;\n assert (index (append w1 w2) 0 == index w1 0);\n Seq.lemma_eq_intro\n (append w1' w2)\n (Seq.slice (append w1 w2) 1 (length (append w1 w2)));\n assert (little_endian (append w1 w2) ==\n UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2));\n assert (little_endian (append w1' w2) ==\n little_endian w1' + pow2 (8 * length w1') * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2));\n Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1));\n assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1));\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1)\n end\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval lemma_euclidean_division: r:nat -> b:nat -> q:pos -> Lemma\n (requires (r < q))\n (ensures (r + q * b < q * (b+1)))\nlet lemma_euclidean_division r b q = ()\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet rec lemma_little_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 1 (Seq.length b) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_little_endian_is_bounded s;\n assert(UInt8.v (Seq.index b 0) < pow2 8);\n assert(little_endian s < pow2 (8 * Seq.length s));\n assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8);\n assert(little_endian b <= pow2 8 * (little_endian s + 1));\n assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\n [SMTPat (big_endian b)]\nlet rec lemma_big_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 0 (Seq.length b - 1) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_big_endian_is_bounded s;\n assert(UInt8.v (Seq.last b) < pow2 8);\n assert(big_endian s < pow2 (8 * Seq.length s));\n assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8);\n assert(big_endian b <= pow2 8 * (big_endian s + 1));\n assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b =\n lemma_little_endian_is_bounded b;\n if Seq.length b = 16 then ()\n else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b)\n\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = FStar.UInt128.uint64_to_uint128 (uint8_to_uint64 a)\n\n\n// turns an integer into a bytestream, little-endian\nval little_bytes: \n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b}) (decreases (v len))\nlet rec little_bytes len n = \n if len = 0ul then \n Seq.empty \n else\n let len = len -^ 1ul in \n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in \n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert(n' < pow2 (8 * v len ));\n let b' = little_bytes len n' in\n let b = cons byte b' in\n assert(Seq.equal b' (tail b));\n b\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 0 --max_ifuel 0\"\n\n\n(* injectivity proofs for byte encodings *) \n\ntype word = b:Seq.seq UInt8.t {Seq.length b <= 16}\nopen FStar.Math.Lib\nopen FStar.Math.Lemmas\n\nprivate let endian_is_injective q r q' r' : Lemma\n (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q')\n (ensures r = r' /\\ q = q') =\n lemma_mod_injective (pow2 8) (UInt8.v r) (UInt8.v r')\n\nprivate let big_endian_step (b:word{length b > 0}) : \n Lemma (big_endian b = U8.v (last b) + pow2 8 * big_endian (slice b 0 (length b - 1))) =\n ()\n\n#reset-options \"--z3rlimit 100\"\nval lemma_big_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires big_endian b = big_endian b')\n (ensures b == b')\n (decreases (length b))\nlet rec lemma_big_endian_inj s s' = \n let len = length s in \n if len = 0 then lemma_eq_intro s s'\n else\n let t = slice s 0 (len - 1) in \n let x = last s in \n lemma_eq_intro s (snoc t x);\n big_endian_step s;\n let t' = slice s' 0 (len - 1) in \n let x' = last s' in \n lemma_eq_intro s' (snoc t' x');\n big_endian_step s';\n endian_is_injective (big_endian t) x (big_endian t') x';\n lemma_big_endian_inj t t'\n\n(* the little endian proof could be simplified, as above *)\n\n(* this lemma is used only Crypto.Symmetric.Poly1305 *)\nval lemma_little_endian_is_injective_1: b:pos -> q:nat -> r:nat -> q':nat -> r':nat -> Lemma\n (requires (r < b /\\ r' < b /\\ r + b * q = r' + b * q'))\n (ensures (r = r' /\\ q = q'))\nlet lemma_little_endian_is_injective_1 b q r q' r' =\n lemma_mod_plus r q b;\n lemma_mod_plus r' q' b;\n lemma_mod_injective b r r'\n\n(* a sequence associativity property: ... @ ([x] @ s) == ... @ [x]) @ s *)\nprivate val lemma_little_endian_is_injective_2: b:bytes -> len:pos{len <= length b} -> Lemma\n (let s = slice b (length b - len) (length b) in \n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n s'' == s')\nlet lemma_little_endian_is_injective_2 b len =\n let s = slice b (length b - len) (length b) in\n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n lemma_eq_intro s' s''\n\n(* a sequence injectivity property *)\nprivate val lemma_little_endian_is_injective_3: b:bytes -> b':bytes -> len:pos{len <= length b /\\ len <= length b'} -> Lemma\n (requires \n slice b (length b - (len - 1)) (length b) == slice b' (length b' - (len-1)) (length b') /\\ \n Seq.index b (length b - len) = Seq.index b' (length b' - len))\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))\nlet lemma_little_endian_is_injective_3 b b' len =\n lemma_eq_intro (slice b (length b - len) (length b)) (cons (index b (length b - len)) (slice b (length b - (len-1)) (length b)));\n lemma_eq_intro (slice b' (length b' - len) (length b')) (cons (index b' (length b' - len)) (slice b' (length b' - (len-1)) (length b')))\n\nprivate let little_endian_step (b:bytes{length b > 0}): \n Lemma (little_endian b = U8.v (head b) + pow2 8 * little_endian (tail b)) \n = ()\n\nval lemma_little_endian_is_injective: b:bytes -> b':bytes -> len:nat{len <= length b /\\ len <= length b'} -> Lemma\n (requires little_endian (slice b (length b - len) (length b)) = little_endian (slice b' (length b' - len) (length b')) )\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lib" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b: FStar.Old.Endianness.bytes ->\n b': FStar.Old.Endianness.bytes ->\n len: Prims.nat{len <= FStar.Seq.Base.length b /\\ len <= FStar.Seq.Base.length b'}\n -> FStar.Pervasives.Lemma\n (requires\n FStar.Old.Endianness.little_endian (FStar.Seq.Base.slice b\n (FStar.Seq.Base.length b - len)\n (FStar.Seq.Base.length b)) =\n FStar.Old.Endianness.little_endian (FStar.Seq.Base.slice b'\n (FStar.Seq.Base.length b' - len)\n (FStar.Seq.Base.length b')))\n (ensures\n FStar.Seq.Base.slice b (FStar.Seq.Base.length b - len) (FStar.Seq.Base.length b) ==\n FStar.Seq.Base.slice b' (FStar.Seq.Base.length b' - len) (FStar.Seq.Base.length b'))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Old.Endianness.bytes", "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "FStar.UInt8.t", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.lemma_eq_intro", "FStar.Seq.Base.slice", "Prims.op_Subtraction", "Prims.bool", "FStar.Old.Endianness.lemma_little_endian_is_injective_3", "Prims.unit", "FStar.Old.Endianness.lemma_little_endian_is_injective", "FStar.Old.Endianness.lemma_little_endian_is_injective_2", "FStar.Old.Endianness.endian_is_injective", "FStar.Old.Endianness.little_endian", "FStar.Seq.Properties.tail", "FStar.Seq.Properties.head", "FStar.Old.Endianness.little_endian_step", "FStar.Seq.Base.seq" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_little_endian_is_injective: b:bytes -> b':bytes -> len:nat{len <= length b /\\ len <= length b'} -> Lemma\n (requires little_endian (slice b (length b - len) (length b)) = little_endian (slice b' (length b' - len) (length b')) )\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))\nlet rec lemma_little_endian_is_injective b b' len =", "completed_definiton": "if len = 0\nthen lemma_eq_intro (slice b (length b - len) (length b)) (slice b' (length b' - len) (length b'))\nelse\n let s = slice b (length b - len) (length b) in\n let s' = slice b' (length b' - len) (length b') in\n little_endian_step s;\n little_endian_step s';\n endian_is_injective (little_endian (tail s)) (head s) (little_endian (tail s')) (head s');\n lemma_little_endian_is_injective_2 b len;\n lemma_little_endian_is_injective_2 b' len;\n lemma_little_endian_is_injective b b' (len - 1);\n lemma_little_endian_is_injective_3 b b' len", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.little_bytes", "original_source_type": "val little_bytes: \n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b}) (decreases (v len))", "source_type": "val little_bytes: \n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b}) (decreases (v len))", "source_definition": "let rec little_bytes len n = \n if len = 0ul then \n Seq.empty \n else\n let len = len -^ 1ul in \n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in \n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert(n' < pow2 (8 * v len ));\n let b' = little_bytes len n' in\n let b = cons byte b' in\n assert(Seq.equal b' (tail b));\n b", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 189, "start_col": 2, "end_line": 200, "end_col": 5 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n#set-options \"--initial_fuel 0 --max_fuel 0\"\n\ntype bytes = Seq.seq U8.t // Pure sequence of bytes\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\n\n(* type lbuffer (l:nat) = b:buffer {Buffer.length b == l} *)\n\n#reset-options\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b = UInt128.v a % pow2 8})\n = Math.Lemmas.pow2_modulo_modulo_lemma_2 (UInt128.v a) 64 8;\n uint64_to_uint8 (FStar.UInt128.uint128_to_uint64 a)\n\n#reset-options \"--z3rlimit 20 --initial_fuel 0 --max_fuel 0\"\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\nlet rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) =\n if Seq.length b = 0 then 0\n else\n UInt8.v (head b) + pow2 8 * little_endian (tail b)\n\n(* Big endian integer value of a sequence of bytes *)\nlet rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = \n if Seq.length b = 0 then 0 \n else\n UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet rec little_endian_null len =\n if len = 0 then ()\n else\n begin\n Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len)\n\t\t (Seq.create (len - 1) 0uy);\n assert (little_endian (Seq.create len 0uy) ==\n 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len));\n little_endian_null (len - 1)\n end\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n =\n assert (little_endian (Seq.create 1 n) ==\n UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 *\n little_endian (Seq.slice (Seq.create 1 n) 1 1))\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\n (decreases (Seq.length w1))\nlet rec little_endian_append w1 w2 =\n let open FStar.Seq in\n if length w1 = 0 then\n begin\n assert_norm (pow2 (8 * 0) == 1);\n Seq.lemma_eq_intro (append w1 w2) w2\n end\n else\n begin\n let w1' = slice w1 1 (length w1) in\n assert (length w1' == length w1 - 1);\n little_endian_append w1' w2;\n assert (index (append w1 w2) 0 == index w1 0);\n Seq.lemma_eq_intro\n (append w1' w2)\n (Seq.slice (append w1 w2) 1 (length (append w1 w2)));\n assert (little_endian (append w1 w2) ==\n UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2));\n assert (little_endian (append w1' w2) ==\n little_endian w1' + pow2 (8 * length w1') * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2));\n Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1));\n assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1));\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1)\n end\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval lemma_euclidean_division: r:nat -> b:nat -> q:pos -> Lemma\n (requires (r < q))\n (ensures (r + q * b < q * (b+1)))\nlet lemma_euclidean_division r b q = ()\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet rec lemma_little_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 1 (Seq.length b) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_little_endian_is_bounded s;\n assert(UInt8.v (Seq.index b 0) < pow2 8);\n assert(little_endian s < pow2 (8 * Seq.length s));\n assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8);\n assert(little_endian b <= pow2 8 * (little_endian s + 1));\n assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\n [SMTPat (big_endian b)]\nlet rec lemma_big_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 0 (Seq.length b - 1) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_big_endian_is_bounded s;\n assert(UInt8.v (Seq.last b) < pow2 8);\n assert(big_endian s < pow2 (8 * Seq.length s));\n assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8);\n assert(big_endian b <= pow2 8 * (big_endian s + 1));\n assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b =\n lemma_little_endian_is_bounded b;\n if Seq.length b = 16 then ()\n else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b)\n\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = FStar.UInt128.uint64_to_uint128 (uint8_to_uint64 a)\n\n\n// turns an integer into a bytestream, little-endian\nval little_bytes: \n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b}) (decreases (v len))", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "len: FStar.UInt32.t -> n: Prims.nat{n < Prims.pow2 (8 * FStar.UInt32.v len)}\n -> Prims.Tot\n (b: FStar.Old.Endianness.lbytes (FStar.UInt32.v len) {n == FStar.Old.Endianness.little_endian b}\n )", "effect": "Prims.Tot", "effect_flags": [ "total", "" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Prims.pow2", "FStar.Mul.op_Star", "FStar.UInt32.v", "Prims.op_Equality", "FStar.UInt32.__uint_to_t", "FStar.Seq.Base.empty", "FStar.UInt8.t", "Prims.bool", "Prims.unit", "Prims._assert", "FStar.Seq.Base.equal", "FStar.Seq.Properties.tail", "FStar.Seq.Base.seq", "FStar.Seq.Properties.cons", "FStar.Old.Endianness.lbytes", "Prims.eq2", "FStar.Old.Endianness.little_endian", "FStar.Old.Endianness.little_bytes", "FStar.Math.Lemmas.pow2_plus", "Prims.int", "Prims.op_Division", "FStar.UInt8.uint_to_t", "Prims.op_Modulus", "FStar.UInt32.op_Subtraction_Hat" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val little_bytes: \n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b}) (decreases (v len))\nlet rec little_bytes len n =", "completed_definiton": "if len = 0ul\nthen Seq.empty\nelse\n let len = len -^ 1ul in\n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert (n' < pow2 (8 * v len));\n let b' = little_bytes len n' in\n let b = cons byte b' in\n assert (Seq.equal b' (tail b));\n b", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.big_bytes", "original_source_type": "val big_bytes: \n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == big_endian b}) (decreases (v len))", "source_type": "val big_bytes: \n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == big_endian b}) (decreases (v len))", "source_definition": "let rec big_bytes len n = \n if len = 0ul then \n Seq.empty \n else\n let len = len -^ 1ul in \n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in \n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert(n' < pow2 (8 * v len ));\n let b' = big_bytes len n' in\n let b'' = Seq.create 1 byte in\n let b = Seq.append b' b'' in\n assert(Seq.equal b' (Seq.slice b 0 (v len)));\n b", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 353, "start_col": 2, "end_line": 365, "end_col": 5 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n#set-options \"--initial_fuel 0 --max_fuel 0\"\n\ntype bytes = Seq.seq U8.t // Pure sequence of bytes\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\n\n(* type lbuffer (l:nat) = b:buffer {Buffer.length b == l} *)\n\n#reset-options\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b = UInt128.v a % pow2 8})\n = Math.Lemmas.pow2_modulo_modulo_lemma_2 (UInt128.v a) 64 8;\n uint64_to_uint8 (FStar.UInt128.uint128_to_uint64 a)\n\n#reset-options \"--z3rlimit 20 --initial_fuel 0 --max_fuel 0\"\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\nlet rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) =\n if Seq.length b = 0 then 0\n else\n UInt8.v (head b) + pow2 8 * little_endian (tail b)\n\n(* Big endian integer value of a sequence of bytes *)\nlet rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = \n if Seq.length b = 0 then 0 \n else\n UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet rec little_endian_null len =\n if len = 0 then ()\n else\n begin\n Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len)\n\t\t (Seq.create (len - 1) 0uy);\n assert (little_endian (Seq.create len 0uy) ==\n 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len));\n little_endian_null (len - 1)\n end\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n =\n assert (little_endian (Seq.create 1 n) ==\n UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 *\n little_endian (Seq.slice (Seq.create 1 n) 1 1))\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\n (decreases (Seq.length w1))\nlet rec little_endian_append w1 w2 =\n let open FStar.Seq in\n if length w1 = 0 then\n begin\n assert_norm (pow2 (8 * 0) == 1);\n Seq.lemma_eq_intro (append w1 w2) w2\n end\n else\n begin\n let w1' = slice w1 1 (length w1) in\n assert (length w1' == length w1 - 1);\n little_endian_append w1' w2;\n assert (index (append w1 w2) 0 == index w1 0);\n Seq.lemma_eq_intro\n (append w1' w2)\n (Seq.slice (append w1 w2) 1 (length (append w1 w2)));\n assert (little_endian (append w1 w2) ==\n UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2));\n assert (little_endian (append w1' w2) ==\n little_endian w1' + pow2 (8 * length w1') * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2));\n Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1));\n assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1));\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1)\n end\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval lemma_euclidean_division: r:nat -> b:nat -> q:pos -> Lemma\n (requires (r < q))\n (ensures (r + q * b < q * (b+1)))\nlet lemma_euclidean_division r b q = ()\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet rec lemma_little_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 1 (Seq.length b) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_little_endian_is_bounded s;\n assert(UInt8.v (Seq.index b 0) < pow2 8);\n assert(little_endian s < pow2 (8 * Seq.length s));\n assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8);\n assert(little_endian b <= pow2 8 * (little_endian s + 1));\n assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\n [SMTPat (big_endian b)]\nlet rec lemma_big_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 0 (Seq.length b - 1) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_big_endian_is_bounded s;\n assert(UInt8.v (Seq.last b) < pow2 8);\n assert(big_endian s < pow2 (8 * Seq.length s));\n assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8);\n assert(big_endian b <= pow2 8 * (big_endian s + 1));\n assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b =\n lemma_little_endian_is_bounded b;\n if Seq.length b = 16 then ()\n else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b)\n\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = FStar.UInt128.uint64_to_uint128 (uint8_to_uint64 a)\n\n\n// turns an integer into a bytestream, little-endian\nval little_bytes: \n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b}) (decreases (v len))\nlet rec little_bytes len n = \n if len = 0ul then \n Seq.empty \n else\n let len = len -^ 1ul in \n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in \n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert(n' < pow2 (8 * v len ));\n let b' = little_bytes len n' in\n let b = cons byte b' in\n assert(Seq.equal b' (tail b));\n b\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 0 --max_ifuel 0\"\n\n\n(* injectivity proofs for byte encodings *) \n\ntype word = b:Seq.seq UInt8.t {Seq.length b <= 16}\nopen FStar.Math.Lib\nopen FStar.Math.Lemmas\n\nprivate let endian_is_injective q r q' r' : Lemma\n (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q')\n (ensures r = r' /\\ q = q') =\n lemma_mod_injective (pow2 8) (UInt8.v r) (UInt8.v r')\n\nprivate let big_endian_step (b:word{length b > 0}) : \n Lemma (big_endian b = U8.v (last b) + pow2 8 * big_endian (slice b 0 (length b - 1))) =\n ()\n\n#reset-options \"--z3rlimit 100\"\nval lemma_big_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires big_endian b = big_endian b')\n (ensures b == b')\n (decreases (length b))\nlet rec lemma_big_endian_inj s s' = \n let len = length s in \n if len = 0 then lemma_eq_intro s s'\n else\n let t = slice s 0 (len - 1) in \n let x = last s in \n lemma_eq_intro s (snoc t x);\n big_endian_step s;\n let t' = slice s' 0 (len - 1) in \n let x' = last s' in \n lemma_eq_intro s' (snoc t' x');\n big_endian_step s';\n endian_is_injective (big_endian t) x (big_endian t') x';\n lemma_big_endian_inj t t'\n\n(* the little endian proof could be simplified, as above *)\n\n(* this lemma is used only Crypto.Symmetric.Poly1305 *)\nval lemma_little_endian_is_injective_1: b:pos -> q:nat -> r:nat -> q':nat -> r':nat -> Lemma\n (requires (r < b /\\ r' < b /\\ r + b * q = r' + b * q'))\n (ensures (r = r' /\\ q = q'))\nlet lemma_little_endian_is_injective_1 b q r q' r' =\n lemma_mod_plus r q b;\n lemma_mod_plus r' q' b;\n lemma_mod_injective b r r'\n\n(* a sequence associativity property: ... @ ([x] @ s) == ... @ [x]) @ s *)\nprivate val lemma_little_endian_is_injective_2: b:bytes -> len:pos{len <= length b} -> Lemma\n (let s = slice b (length b - len) (length b) in \n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n s'' == s')\nlet lemma_little_endian_is_injective_2 b len =\n let s = slice b (length b - len) (length b) in\n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n lemma_eq_intro s' s''\n\n(* a sequence injectivity property *)\nprivate val lemma_little_endian_is_injective_3: b:bytes -> b':bytes -> len:pos{len <= length b /\\ len <= length b'} -> Lemma\n (requires \n slice b (length b - (len - 1)) (length b) == slice b' (length b' - (len-1)) (length b') /\\ \n Seq.index b (length b - len) = Seq.index b' (length b' - len))\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))\nlet lemma_little_endian_is_injective_3 b b' len =\n lemma_eq_intro (slice b (length b - len) (length b)) (cons (index b (length b - len)) (slice b (length b - (len-1)) (length b)));\n lemma_eq_intro (slice b' (length b' - len) (length b')) (cons (index b' (length b' - len)) (slice b' (length b' - (len-1)) (length b')))\n\nprivate let little_endian_step (b:bytes{length b > 0}): \n Lemma (little_endian b = U8.v (head b) + pow2 8 * little_endian (tail b)) \n = ()\n\nval lemma_little_endian_is_injective: b:bytes -> b':bytes -> len:nat{len <= length b /\\ len <= length b'} -> Lemma\n (requires little_endian (slice b (length b - len) (length b)) = little_endian (slice b' (length b' - len) (length b')) )\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))\nlet rec lemma_little_endian_is_injective b b' len =\n if len = 0 then\n lemma_eq_intro (slice b (length b - len) (length b)) (slice b' (length b' - len) (length b'))\n else\n let s = slice b (length b - len) (length b) in\n let s' = slice b' (length b' - len) (length b') in\n little_endian_step s; \n little_endian_step s';\n endian_is_injective (little_endian (tail s)) (head s) (little_endian (tail s')) (head s');\n lemma_little_endian_is_injective_2 b len;\n lemma_little_endian_is_injective_2 b' len;\n lemma_little_endian_is_injective b b' (len - 1);\n lemma_little_endian_is_injective_3 b b' len\n\nval lemma_little_endian_inj: b:bytes -> b':bytes {length b = length b'} -> Lemma\n (requires little_endian b = little_endian b')\n (ensures b == b')\nlet lemma_little_endian_inj b b' =\n let len = length b in \n Seq.lemma_eq_intro b (Seq.slice b 0 len);\n Seq.lemma_eq_intro b' (Seq.slice b' 0 len);\n lemma_little_endian_is_injective b b' len\n\n\nval uint32_bytes: \n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> \n Tot (b:lbytes (v len) { UInt32.v n == little_endian b}) (decreases (v len))\nlet rec uint32_bytes len n = \n if len = 0ul then \n let e = Seq.empty #UInt8.t in\n assert_norm(0 = little_endian e);\n e\n else\n let len = len -^ 1ul in \n let byte = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in \n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_bytes len n'\n in \n Seq.cons byte b'\n\nval uint32_be: \n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> \n Tot (b:lbytes (v len) { UInt32.v n == big_endian b}) (decreases (v len))\nlet rec uint32_be len n = \n if len = 0ul then \n let e = Seq.empty #UInt8.t in\n assert_norm(0 = big_endian e);\n e\n else\n let len = len -^ 1ul in \n let byte = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in \n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_be len n'\n in \n Seq.snoc b' byte \n\n#reset-options \"--z3rlimit 400\"\n\n// turns an integer into a bytestream, big-endian\nval big_bytes: \n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == big_endian b}) (decreases (v len))", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lib" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 400, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "len: FStar.UInt32.t -> n: Prims.nat{n < Prims.pow2 (8 * FStar.UInt32.v len)}\n -> Prims.Tot\n (b: FStar.Old.Endianness.lbytes (FStar.UInt32.v len) {n == FStar.Old.Endianness.big_endian b})", "effect": "Prims.Tot", "effect_flags": [ "total", "" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Prims.pow2", "FStar.Mul.op_Star", "FStar.UInt32.v", "Prims.op_Equality", "FStar.UInt32.__uint_to_t", "FStar.Seq.Base.empty", "FStar.UInt8.t", "Prims.bool", "Prims.unit", "Prims._assert", "FStar.Seq.Base.equal", "FStar.Seq.Base.slice", "FStar.Seq.Base.seq", "FStar.Seq.Base.append", "FStar.Seq.Base.create", "FStar.Old.Endianness.lbytes", "Prims.eq2", "FStar.Old.Endianness.big_endian", "FStar.Old.Endianness.big_bytes", "FStar.Math.Lemmas.pow2_plus", "Prims.int", "Prims.op_Division", "FStar.UInt8.uint_to_t", "Prims.op_Modulus", "FStar.UInt32.op_Subtraction_Hat" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val big_bytes: \n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == big_endian b}) (decreases (v len))\nlet rec big_bytes len n =", "completed_definiton": "if len = 0ul\nthen Seq.empty\nelse\n let len = len -^ 1ul in\n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert (n' < pow2 (8 * v len));\n let b' = big_bytes len n' in\n let b'' = Seq.create 1 byte in\n let b = Seq.append b' b'' in\n assert (Seq.equal b' (Seq.slice b 0 (v len)));\n b", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.little_endian_append", "original_source_type": "val little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\n (decreases (Seq.length w1))", "source_type": "val little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\n (decreases (Seq.length w1))", "source_definition": "let rec little_endian_append w1 w2 =\n let open FStar.Seq in\n if length w1 = 0 then\n begin\n assert_norm (pow2 (8 * 0) == 1);\n Seq.lemma_eq_intro (append w1 w2) w2\n end\n else\n begin\n let w1' = slice w1 1 (length w1) in\n assert (length w1' == length w1 - 1);\n little_endian_append w1' w2;\n assert (index (append w1 w2) 0 == index w1 0);\n Seq.lemma_eq_intro\n (append w1' w2)\n (Seq.slice (append w1 w2) 1 (length (append w1 w2)));\n assert (little_endian (append w1 w2) ==\n UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2));\n assert (little_endian (append w1' w2) ==\n little_endian w1' + pow2 (8 * length w1') * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2));\n Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1));\n assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1));\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1)\n end", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 81, "start_col": 2, "end_line": 109, "end_col": 7 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n#set-options \"--initial_fuel 0 --max_fuel 0\"\n\ntype bytes = Seq.seq U8.t // Pure sequence of bytes\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\n\n(* type lbuffer (l:nat) = b:buffer {Buffer.length b == l} *)\n\n#reset-options\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b = UInt128.v a % pow2 8})\n = Math.Lemmas.pow2_modulo_modulo_lemma_2 (UInt128.v a) 64 8;\n uint64_to_uint8 (FStar.UInt128.uint128_to_uint64 a)\n\n#reset-options \"--z3rlimit 20 --initial_fuel 0 --max_fuel 0\"\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\nlet rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) =\n if Seq.length b = 0 then 0\n else\n UInt8.v (head b) + pow2 8 * little_endian (tail b)\n\n(* Big endian integer value of a sequence of bytes *)\nlet rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = \n if Seq.length b = 0 then 0 \n else\n UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet rec little_endian_null len =\n if len = 0 then ()\n else\n begin\n Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len)\n\t\t (Seq.create (len - 1) 0uy);\n assert (little_endian (Seq.create len 0uy) ==\n 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len));\n little_endian_null (len - 1)\n end\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n =\n assert (little_endian (Seq.create 1 n) ==\n UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 *\n little_endian (Seq.slice (Seq.create 1 n) 1 1))\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\n (decreases (Seq.length w1))", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 50, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w1: FStar.Old.Endianness.bytes -> w2: FStar.Old.Endianness.bytes\n -> FStar.Pervasives.Lemma\n (ensures\n FStar.Old.Endianness.little_endian (FStar.Seq.Base.append w1 w2) ==\n FStar.Old.Endianness.little_endian w1 +\n Prims.pow2 (8 * FStar.Seq.Base.length w1) * FStar.Old.Endianness.little_endian w2)\n (decreases FStar.Seq.Base.length w1)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma", "" ], "mutual_with": [], "ideal_premises": [ "FStar.Old.Endianness.bytes", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "FStar.UInt8.t", "FStar.Seq.Base.lemma_eq_intro", "FStar.Seq.Base.append", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.pow2", "FStar.Mul.op_Star", "Prims.bool", "Prims._assert", "Prims.op_Addition", "FStar.UInt8.v", "FStar.Seq.Base.index", "FStar.Old.Endianness.little_endian", "FStar.Math.Lemmas.pow2_plus", "Prims.op_Subtraction", "FStar.Seq.Base.slice", "FStar.Old.Endianness.little_endian_append", "FStar.Seq.Base.seq" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\n (decreases (Seq.length w1))\nlet rec little_endian_append w1 w2 =", "completed_definiton": "let open FStar.Seq in\nif length w1 = 0\nthen\n (assert_norm (pow2 (8 * 0) == 1);\n Seq.lemma_eq_intro (append w1 w2) w2)\nelse\n let w1' = slice w1 1 (length w1) in\n assert (length w1' == length w1 - 1);\n little_endian_append w1' w2;\n assert (index (append w1 w2) 0 == index w1 0);\n Seq.lemma_eq_intro (append w1' w2) (Seq.slice (append w1 w2) 1 (length (append w1 w2)));\n assert (little_endian (append w1 w2) ==\n UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2));\n assert (little_endian (append w1' w2) ==\n little_endian w1' + pow2 (8 * length w1') * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) + pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)\n );\n Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1));\n assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1));\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) + pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1)", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.uint32_be", "original_source_type": "val uint32_be: \n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> \n Tot (b:lbytes (v len) { UInt32.v n == big_endian b}) (decreases (v len))", "source_type": "val uint32_be: \n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> \n Tot (b:lbytes (v len) { UInt32.v n == big_endian b}) (decreases (v len))", "source_definition": "let rec uint32_be len n = \n if len = 0ul then \n let e = Seq.empty #UInt8.t in\n assert_norm(0 = big_endian e);\n e\n else\n let len = len -^ 1ul in \n let byte = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in \n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_be len n'\n in \n Seq.snoc b' byte", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 329, "start_col": 2, "end_line": 344, "end_col": 20 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n#set-options \"--initial_fuel 0 --max_fuel 0\"\n\ntype bytes = Seq.seq U8.t // Pure sequence of bytes\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\n\n(* type lbuffer (l:nat) = b:buffer {Buffer.length b == l} *)\n\n#reset-options\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b = UInt128.v a % pow2 8})\n = Math.Lemmas.pow2_modulo_modulo_lemma_2 (UInt128.v a) 64 8;\n uint64_to_uint8 (FStar.UInt128.uint128_to_uint64 a)\n\n#reset-options \"--z3rlimit 20 --initial_fuel 0 --max_fuel 0\"\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\nlet rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) =\n if Seq.length b = 0 then 0\n else\n UInt8.v (head b) + pow2 8 * little_endian (tail b)\n\n(* Big endian integer value of a sequence of bytes *)\nlet rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = \n if Seq.length b = 0 then 0 \n else\n UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet rec little_endian_null len =\n if len = 0 then ()\n else\n begin\n Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len)\n\t\t (Seq.create (len - 1) 0uy);\n assert (little_endian (Seq.create len 0uy) ==\n 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len));\n little_endian_null (len - 1)\n end\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n =\n assert (little_endian (Seq.create 1 n) ==\n UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 *\n little_endian (Seq.slice (Seq.create 1 n) 1 1))\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\n (decreases (Seq.length w1))\nlet rec little_endian_append w1 w2 =\n let open FStar.Seq in\n if length w1 = 0 then\n begin\n assert_norm (pow2 (8 * 0) == 1);\n Seq.lemma_eq_intro (append w1 w2) w2\n end\n else\n begin\n let w1' = slice w1 1 (length w1) in\n assert (length w1' == length w1 - 1);\n little_endian_append w1' w2;\n assert (index (append w1 w2) 0 == index w1 0);\n Seq.lemma_eq_intro\n (append w1' w2)\n (Seq.slice (append w1 w2) 1 (length (append w1 w2)));\n assert (little_endian (append w1 w2) ==\n UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2));\n assert (little_endian (append w1' w2) ==\n little_endian w1' + pow2 (8 * length w1') * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2));\n Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1));\n assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1));\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1)\n end\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval lemma_euclidean_division: r:nat -> b:nat -> q:pos -> Lemma\n (requires (r < q))\n (ensures (r + q * b < q * (b+1)))\nlet lemma_euclidean_division r b q = ()\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet rec lemma_little_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 1 (Seq.length b) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_little_endian_is_bounded s;\n assert(UInt8.v (Seq.index b 0) < pow2 8);\n assert(little_endian s < pow2 (8 * Seq.length s));\n assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8);\n assert(little_endian b <= pow2 8 * (little_endian s + 1));\n assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\n [SMTPat (big_endian b)]\nlet rec lemma_big_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 0 (Seq.length b - 1) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_big_endian_is_bounded s;\n assert(UInt8.v (Seq.last b) < pow2 8);\n assert(big_endian s < pow2 (8 * Seq.length s));\n assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8);\n assert(big_endian b <= pow2 8 * (big_endian s + 1));\n assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b =\n lemma_little_endian_is_bounded b;\n if Seq.length b = 16 then ()\n else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b)\n\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = FStar.UInt128.uint64_to_uint128 (uint8_to_uint64 a)\n\n\n// turns an integer into a bytestream, little-endian\nval little_bytes: \n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b}) (decreases (v len))\nlet rec little_bytes len n = \n if len = 0ul then \n Seq.empty \n else\n let len = len -^ 1ul in \n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in \n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert(n' < pow2 (8 * v len ));\n let b' = little_bytes len n' in\n let b = cons byte b' in\n assert(Seq.equal b' (tail b));\n b\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 0 --max_ifuel 0\"\n\n\n(* injectivity proofs for byte encodings *) \n\ntype word = b:Seq.seq UInt8.t {Seq.length b <= 16}\nopen FStar.Math.Lib\nopen FStar.Math.Lemmas\n\nprivate let endian_is_injective q r q' r' : Lemma\n (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q')\n (ensures r = r' /\\ q = q') =\n lemma_mod_injective (pow2 8) (UInt8.v r) (UInt8.v r')\n\nprivate let big_endian_step (b:word{length b > 0}) : \n Lemma (big_endian b = U8.v (last b) + pow2 8 * big_endian (slice b 0 (length b - 1))) =\n ()\n\n#reset-options \"--z3rlimit 100\"\nval lemma_big_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires big_endian b = big_endian b')\n (ensures b == b')\n (decreases (length b))\nlet rec lemma_big_endian_inj s s' = \n let len = length s in \n if len = 0 then lemma_eq_intro s s'\n else\n let t = slice s 0 (len - 1) in \n let x = last s in \n lemma_eq_intro s (snoc t x);\n big_endian_step s;\n let t' = slice s' 0 (len - 1) in \n let x' = last s' in \n lemma_eq_intro s' (snoc t' x');\n big_endian_step s';\n endian_is_injective (big_endian t) x (big_endian t') x';\n lemma_big_endian_inj t t'\n\n(* the little endian proof could be simplified, as above *)\n\n(* this lemma is used only Crypto.Symmetric.Poly1305 *)\nval lemma_little_endian_is_injective_1: b:pos -> q:nat -> r:nat -> q':nat -> r':nat -> Lemma\n (requires (r < b /\\ r' < b /\\ r + b * q = r' + b * q'))\n (ensures (r = r' /\\ q = q'))\nlet lemma_little_endian_is_injective_1 b q r q' r' =\n lemma_mod_plus r q b;\n lemma_mod_plus r' q' b;\n lemma_mod_injective b r r'\n\n(* a sequence associativity property: ... @ ([x] @ s) == ... @ [x]) @ s *)\nprivate val lemma_little_endian_is_injective_2: b:bytes -> len:pos{len <= length b} -> Lemma\n (let s = slice b (length b - len) (length b) in \n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n s'' == s')\nlet lemma_little_endian_is_injective_2 b len =\n let s = slice b (length b - len) (length b) in\n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n lemma_eq_intro s' s''\n\n(* a sequence injectivity property *)\nprivate val lemma_little_endian_is_injective_3: b:bytes -> b':bytes -> len:pos{len <= length b /\\ len <= length b'} -> Lemma\n (requires \n slice b (length b - (len - 1)) (length b) == slice b' (length b' - (len-1)) (length b') /\\ \n Seq.index b (length b - len) = Seq.index b' (length b' - len))\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))\nlet lemma_little_endian_is_injective_3 b b' len =\n lemma_eq_intro (slice b (length b - len) (length b)) (cons (index b (length b - len)) (slice b (length b - (len-1)) (length b)));\n lemma_eq_intro (slice b' (length b' - len) (length b')) (cons (index b' (length b' - len)) (slice b' (length b' - (len-1)) (length b')))\n\nprivate let little_endian_step (b:bytes{length b > 0}): \n Lemma (little_endian b = U8.v (head b) + pow2 8 * little_endian (tail b)) \n = ()\n\nval lemma_little_endian_is_injective: b:bytes -> b':bytes -> len:nat{len <= length b /\\ len <= length b'} -> Lemma\n (requires little_endian (slice b (length b - len) (length b)) = little_endian (slice b' (length b' - len) (length b')) )\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))\nlet rec lemma_little_endian_is_injective b b' len =\n if len = 0 then\n lemma_eq_intro (slice b (length b - len) (length b)) (slice b' (length b' - len) (length b'))\n else\n let s = slice b (length b - len) (length b) in\n let s' = slice b' (length b' - len) (length b') in\n little_endian_step s; \n little_endian_step s';\n endian_is_injective (little_endian (tail s)) (head s) (little_endian (tail s')) (head s');\n lemma_little_endian_is_injective_2 b len;\n lemma_little_endian_is_injective_2 b' len;\n lemma_little_endian_is_injective b b' (len - 1);\n lemma_little_endian_is_injective_3 b b' len\n\nval lemma_little_endian_inj: b:bytes -> b':bytes {length b = length b'} -> Lemma\n (requires little_endian b = little_endian b')\n (ensures b == b')\nlet lemma_little_endian_inj b b' =\n let len = length b in \n Seq.lemma_eq_intro b (Seq.slice b 0 len);\n Seq.lemma_eq_intro b' (Seq.slice b' 0 len);\n lemma_little_endian_is_injective b b' len\n\n\nval uint32_bytes: \n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> \n Tot (b:lbytes (v len) { UInt32.v n == little_endian b}) (decreases (v len))\nlet rec uint32_bytes len n = \n if len = 0ul then \n let e = Seq.empty #UInt8.t in\n assert_norm(0 = little_endian e);\n e\n else\n let len = len -^ 1ul in \n let byte = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in \n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_bytes len n'\n in \n Seq.cons byte b'\n\nval uint32_be: \n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> \n Tot (b:lbytes (v len) { UInt32.v n == big_endian b}) (decreases (v len))", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lib" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n len: FStar.UInt32.t{FStar.UInt32.v len <= 4} ->\n n: FStar.UInt32.t{FStar.UInt32.v n < Prims.pow2 (8 * FStar.UInt32.v len)}\n -> Prims.Tot\n (b:\n FStar.Old.Endianness.lbytes (FStar.UInt32.v len)\n {FStar.UInt32.v n == FStar.Old.Endianness.big_endian b})", "effect": "Prims.Tot", "effect_flags": [ "total", "" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "Prims.op_LessThan", "Prims.pow2", "FStar.Mul.op_Star", "Prims.op_Equality", "FStar.UInt32.__uint_to_t", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.int", "FStar.Old.Endianness.big_endian", "FStar.Seq.Base.seq", "FStar.UInt8.t", "FStar.Seq.Base.length", "FStar.Seq.Base.empty", "Prims.bool", "FStar.Seq.Properties.snoc", "FStar.Old.Endianness.lbytes", "Prims.eq2", "Prims.l_or", "FStar.UInt.size", "Prims.op_GreaterThanOrEqual", "FStar.Old.Endianness.uint32_be", "Prims._assert", "FStar.Math.Lemmas.pow2_plus", "Prims.op_Addition", "FStar.UInt8.v", "FStar.UInt32.op_Greater_Greater_Hat", "Prims.op_Multiply", "Prims.op_Modulus", "FStar.Int.Cast.uint32_to_uint8", "FStar.UInt32.op_Subtraction_Hat", "FStar.UInt32.n" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val uint32_be: \n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> \n Tot (b:lbytes (v len) { UInt32.v n == big_endian b}) (decreases (v len))\nlet rec uint32_be len n =", "completed_definiton": "if len = 0ul\nthen\n let e = Seq.empty #UInt8.t in\n assert_norm (0 = big_endian e);\n e\nelse\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in\n let n' = let open FStar.UInt32 in n1 >>^ 8ul in\n assert (v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert (v n' < pow2 (8 * v len));\n let b' = uint32_be len n' in\n Seq.snoc b' byte", "isa_cross_project_example": true }, { "file_name": "FStar.Old.Endianness.fst", "name": "FStar.Old.Endianness.uint32_bytes", "original_source_type": "val uint32_bytes: \n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> \n Tot (b:lbytes (v len) { UInt32.v n == little_endian b}) (decreases (v len))", "source_type": "val uint32_bytes: \n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> \n Tot (b:lbytes (v len) { UInt32.v n == little_endian b}) (decreases (v len))", "source_definition": "let rec uint32_bytes len n = \n if len = 0ul then \n let e = Seq.empty #UInt8.t in\n assert_norm(0 = little_endian e);\n e\n else\n let len = len -^ 1ul in \n let byte = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in \n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_bytes len n'\n in \n Seq.cons byte b'", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Old.Endianness.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 308, "start_col": 2, "end_line": 323, "end_col": 20 }, "file_context": "module FStar.Old.Endianness\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Mul\nopen FStar.Int.Cast\n\nmodule U8 = FStar.UInt8\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n#set-options \"--initial_fuel 0 --max_fuel 0\"\n\ntype bytes = Seq.seq U8.t // Pure sequence of bytes\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\n\n(* type lbuffer (l:nat) = b:buffer {Buffer.length b == l} *)\n\n#reset-options\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b = UInt128.v a % pow2 8})\n = Math.Lemmas.pow2_modulo_modulo_lemma_2 (UInt128.v a) 64 8;\n uint64_to_uint8 (FStar.UInt128.uint128_to_uint64 a)\n\n#reset-options \"--z3rlimit 20 --initial_fuel 0 --max_fuel 0\"\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\nlet rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) =\n if Seq.length b = 0 then 0\n else\n UInt8.v (head b) + pow2 8 * little_endian (tail b)\n\n(* Big endian integer value of a sequence of bytes *)\nlet rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = \n if Seq.length b = 0 then 0 \n else\n UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet rec little_endian_null len =\n if len = 0 then ()\n else\n begin\n Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len)\n\t\t (Seq.create (len - 1) 0uy);\n assert (little_endian (Seq.create len 0uy) ==\n 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len));\n little_endian_null (len - 1)\n end\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n =\n assert (little_endian (Seq.create 1 n) ==\n UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 *\n little_endian (Seq.slice (Seq.create 1 n) 1 1))\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\n (decreases (Seq.length w1))\nlet rec little_endian_append w1 w2 =\n let open FStar.Seq in\n if length w1 = 0 then\n begin\n assert_norm (pow2 (8 * 0) == 1);\n Seq.lemma_eq_intro (append w1 w2) w2\n end\n else\n begin\n let w1' = slice w1 1 (length w1) in\n assert (length w1' == length w1 - 1);\n little_endian_append w1' w2;\n assert (index (append w1 w2) 0 == index w1 0);\n Seq.lemma_eq_intro\n (append w1' w2)\n (Seq.slice (append w1 w2) 1 (length (append w1 w2)));\n assert (little_endian (append w1 w2) ==\n UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2));\n assert (little_endian (append w1' w2) ==\n little_endian w1' + pow2 (8 * length w1') * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2));\n Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1));\n assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1));\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) ==\n UInt8.v (index w1 0) +\n pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2);\n assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1)\n end\n\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --z3rlimit 50\"\n\nval lemma_euclidean_division: r:nat -> b:nat -> q:pos -> Lemma\n (requires (r < q))\n (ensures (r + q * b < q * (b+1)))\nlet lemma_euclidean_division r b q = ()\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet rec lemma_little_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 1 (Seq.length b) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_little_endian_is_bounded s;\n assert(UInt8.v (Seq.index b 0) < pow2 8);\n assert(little_endian s < pow2 (8 * Seq.length s));\n assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8);\n assert(little_endian b <= pow2 8 * (little_endian s + 1));\n assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\n [SMTPat (big_endian b)]\nlet rec lemma_big_endian_is_bounded b =\n if Seq.length b = 0 then ()\n else\n begin\n let s = Seq.slice b 0 (Seq.length b - 1) in\n assert(Seq.length s = Seq.length b - 1);\n lemma_big_endian_is_bounded s;\n assert(UInt8.v (Seq.last b) < pow2 8);\n assert(big_endian s < pow2 (8 * Seq.length s));\n assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));\n lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8);\n assert(big_endian b <= pow2 8 * (big_endian s + 1));\n assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1)));\n Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1));\n lemma_factorise 8 (Seq.length b - 1)\n end\n\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b =\n lemma_little_endian_is_bounded b;\n if Seq.length b = 16 then ()\n else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b)\n\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = FStar.UInt128.uint64_to_uint128 (uint8_to_uint64 a)\n\n\n// turns an integer into a bytestream, little-endian\nval little_bytes: \n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b}) (decreases (v len))\nlet rec little_bytes len n = \n if len = 0ul then \n Seq.empty \n else\n let len = len -^ 1ul in \n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in \n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert(n' < pow2 (8 * v len ));\n let b' = little_bytes len n' in\n let b = cons byte b' in\n assert(Seq.equal b' (tail b));\n b\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 0 --max_ifuel 0\"\n\n\n(* injectivity proofs for byte encodings *) \n\ntype word = b:Seq.seq UInt8.t {Seq.length b <= 16}\nopen FStar.Math.Lib\nopen FStar.Math.Lemmas\n\nprivate let endian_is_injective q r q' r' : Lemma\n (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q')\n (ensures r = r' /\\ q = q') =\n lemma_mod_injective (pow2 8) (UInt8.v r) (UInt8.v r')\n\nprivate let big_endian_step (b:word{length b > 0}) : \n Lemma (big_endian b = U8.v (last b) + pow2 8 * big_endian (slice b 0 (length b - 1))) =\n ()\n\n#reset-options \"--z3rlimit 100\"\nval lemma_big_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires big_endian b = big_endian b')\n (ensures b == b')\n (decreases (length b))\nlet rec lemma_big_endian_inj s s' = \n let len = length s in \n if len = 0 then lemma_eq_intro s s'\n else\n let t = slice s 0 (len - 1) in \n let x = last s in \n lemma_eq_intro s (snoc t x);\n big_endian_step s;\n let t' = slice s' 0 (len - 1) in \n let x' = last s' in \n lemma_eq_intro s' (snoc t' x');\n big_endian_step s';\n endian_is_injective (big_endian t) x (big_endian t') x';\n lemma_big_endian_inj t t'\n\n(* the little endian proof could be simplified, as above *)\n\n(* this lemma is used only Crypto.Symmetric.Poly1305 *)\nval lemma_little_endian_is_injective_1: b:pos -> q:nat -> r:nat -> q':nat -> r':nat -> Lemma\n (requires (r < b /\\ r' < b /\\ r + b * q = r' + b * q'))\n (ensures (r = r' /\\ q = q'))\nlet lemma_little_endian_is_injective_1 b q r q' r' =\n lemma_mod_plus r q b;\n lemma_mod_plus r' q' b;\n lemma_mod_injective b r r'\n\n(* a sequence associativity property: ... @ ([x] @ s) == ... @ [x]) @ s *)\nprivate val lemma_little_endian_is_injective_2: b:bytes -> len:pos{len <= length b} -> Lemma\n (let s = slice b (length b - len) (length b) in \n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n s'' == s')\nlet lemma_little_endian_is_injective_2 b len =\n let s = slice b (length b - len) (length b) in\n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n lemma_eq_intro s' s''\n\n(* a sequence injectivity property *)\nprivate val lemma_little_endian_is_injective_3: b:bytes -> b':bytes -> len:pos{len <= length b /\\ len <= length b'} -> Lemma\n (requires \n slice b (length b - (len - 1)) (length b) == slice b' (length b' - (len-1)) (length b') /\\ \n Seq.index b (length b - len) = Seq.index b' (length b' - len))\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))\nlet lemma_little_endian_is_injective_3 b b' len =\n lemma_eq_intro (slice b (length b - len) (length b)) (cons (index b (length b - len)) (slice b (length b - (len-1)) (length b)));\n lemma_eq_intro (slice b' (length b' - len) (length b')) (cons (index b' (length b' - len)) (slice b' (length b' - (len-1)) (length b')))\n\nprivate let little_endian_step (b:bytes{length b > 0}): \n Lemma (little_endian b = U8.v (head b) + pow2 8 * little_endian (tail b)) \n = ()\n\nval lemma_little_endian_is_injective: b:bytes -> b':bytes -> len:nat{len <= length b /\\ len <= length b'} -> Lemma\n (requires little_endian (slice b (length b - len) (length b)) = little_endian (slice b' (length b' - len) (length b')) )\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))\nlet rec lemma_little_endian_is_injective b b' len =\n if len = 0 then\n lemma_eq_intro (slice b (length b - len) (length b)) (slice b' (length b' - len) (length b'))\n else\n let s = slice b (length b - len) (length b) in\n let s' = slice b' (length b' - len) (length b') in\n little_endian_step s; \n little_endian_step s';\n endian_is_injective (little_endian (tail s)) (head s) (little_endian (tail s')) (head s');\n lemma_little_endian_is_injective_2 b len;\n lemma_little_endian_is_injective_2 b' len;\n lemma_little_endian_is_injective b b' (len - 1);\n lemma_little_endian_is_injective_3 b b' len\n\nval lemma_little_endian_inj: b:bytes -> b':bytes {length b = length b'} -> Lemma\n (requires little_endian b = little_endian b')\n (ensures b == b')\nlet lemma_little_endian_inj b b' =\n let len = length b in \n Seq.lemma_eq_intro b (Seq.slice b 0 len);\n Seq.lemma_eq_intro b' (Seq.slice b' 0 len);\n lemma_little_endian_is_injective b b' len\n\n\nval uint32_bytes: \n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> \n Tot (b:lbytes (v len) { UInt32.v n == little_endian b}) (decreases (v len))", "dependencies": { "source_file": "FStar.Old.Endianness.fst", "checked_file": "FStar.Old.Endianness.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lib" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Old" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n len: FStar.UInt32.t{FStar.UInt32.v len <= 4} ->\n n: FStar.UInt32.t{FStar.UInt32.v n < Prims.pow2 (8 * FStar.UInt32.v len)}\n -> Prims.Tot\n (b:\n FStar.Old.Endianness.lbytes (FStar.UInt32.v len)\n {FStar.UInt32.v n == FStar.Old.Endianness.little_endian b})", "effect": "Prims.Tot", "effect_flags": [ "total", "" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "Prims.op_LessThan", "Prims.pow2", "FStar.Mul.op_Star", "Prims.op_Equality", "FStar.UInt32.__uint_to_t", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.int", "FStar.Old.Endianness.little_endian", "FStar.Seq.Base.seq", "FStar.UInt8.t", "FStar.Seq.Base.length", "FStar.Seq.Base.empty", "Prims.bool", "FStar.Seq.Properties.cons", "FStar.Old.Endianness.lbytes", "Prims.eq2", "Prims.l_or", "FStar.UInt.size", "Prims.op_GreaterThanOrEqual", "FStar.Old.Endianness.uint32_bytes", "Prims._assert", "FStar.Math.Lemmas.pow2_plus", "Prims.op_Addition", "FStar.UInt8.v", "FStar.UInt32.op_Greater_Greater_Hat", "Prims.op_Multiply", "Prims.op_Modulus", "FStar.Int.Cast.uint32_to_uint8", "FStar.UInt32.op_Subtraction_Hat", "FStar.UInt32.n" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val uint32_bytes: \n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> \n Tot (b:lbytes (v len) { UInt32.v n == little_endian b}) (decreases (v len))\nlet rec uint32_bytes len n =", "completed_definiton": "if len = 0ul\nthen\n let e = Seq.empty #UInt8.t in\n assert_norm (0 = little_endian e);\n e\nelse\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in\n let n' = let open FStar.UInt32 in n1 >>^ 8ul in\n assert (v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert (v n' < pow2 (8 * v len));\n let b' = uint32_bytes len n' in\n Seq.cons byte b'", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fsti", "name": "Parsers.TicketVersion.ticketVersion_parser_kind", "original_source_type": "", "source_type": "val ticketVersion_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let ticketVersion_parser_kind = LP.strong_parser_kind 1 1 None", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 29, "start_col": 64, "end_line": 29, "end_col": 94 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ntype ticketVersion =\n | Ticket12\n | Ticket13\n\nlet string_of_ticketVersion = function\n | Ticket12 -> \"ticket12\"\n | Ticket13 -> \"ticket13\"", "dependencies": { "source_file": "Parsers.TicketVersion.fsti", "checked_file": "Parsers.TicketVersion.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let ticketVersion_parser_kind =", "completed_definiton": "LP.strong_parser_kind 1 1 None", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fsti", "name": "Parsers.TicketVersion.ticketVersion_jumper", "original_source_type": "val ticketVersion_jumper:LL.jumper ticketVersion_parser", "source_type": "val ticketVersion_jumper:LL.jumper ticketVersion_parser", "source_definition": "let ticketVersion_jumper: LL.jumper ticketVersion_parser = LL.jump_constant_size ticketVersion_parser 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 47, "start_col": 59, "end_line": 47, "end_col": 108 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ntype ticketVersion =\n | Ticket12\n | Ticket13\n\nlet string_of_ticketVersion = function\n | Ticket12 -> \"ticket12\"\n | Ticket13 -> \"ticket13\"\n\ninline_for_extraction noextract let ticketVersion_parser_kind = LP.strong_parser_kind 1 1 None\n\nnoextract val ticketVersion_parser: LP.parser ticketVersion_parser_kind ticketVersion\n\nnoextract val ticketVersion_serializer: LP.serializer ticketVersion_parser\n\nnoextract val ticketVersion_bytesize (x:ticketVersion) : GTot nat\n\nnoextract val ticketVersion_bytesize_eq (x:ticketVersion) : Lemma (ticketVersion_bytesize x == Seq.length (LP.serialize ticketVersion_serializer x))\n\nval ticketVersion_parser32: LS.parser32 ticketVersion_parser\n\nval ticketVersion_serializer32: LS.serializer32 ticketVersion_serializer\n\nval ticketVersion_size32: LSZ.size32 ticketVersion_serializer\n\nval ticketVersion_validator: LL.validator ticketVersion_parser", "dependencies": { "source_file": "Parsers.TicketVersion.fsti", "checked_file": "Parsers.TicketVersion.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.TicketVersion.ticketVersion_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.jump_constant_size", "Parsers.TicketVersion.ticketVersion_parser_kind", "Parsers.TicketVersion.ticketVersion", "Parsers.TicketVersion.ticketVersion_parser", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketVersion_jumper:LL.jumper ticketVersion_parser\nlet ticketVersion_jumper:LL.jumper ticketVersion_parser =", "completed_definiton": "LL.jump_constant_size ticketVersion_parser 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fsti", "name": "Parsers.TicketVersion.string_of_ticketVersion", "original_source_type": "", "source_type": "val string_of_ticketVersion : _: Parsers.TicketVersion.ticketVersion -> Prims.string", "source_definition": "let string_of_ticketVersion = function\n | Ticket12 -> \"ticket12\"\n | Ticket13 -> \"ticket13\"", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 25, "start_col": 30, "end_line": 27, "end_col": 26 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ntype ticketVersion =\n | Ticket12\n | Ticket13", "dependencies": { "source_file": "Parsers.TicketVersion.fsti", "checked_file": "Parsers.TicketVersion.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Parsers.TicketVersion.ticketVersion -> Prims.string", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketVersion.ticketVersion", "Prims.string" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let string_of_ticketVersion =", "completed_definiton": "function\n| Ticket12 -> \"ticket12\"\n| Ticket13 -> \"ticket13\"", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fsti", "name": "Parsers.TicketContents.ticketContents_clens_tag", "original_source_type": "val ticketContents_clens_tag:LL.clens ticketContents ticketVersion", "source_type": "val ticketContents_clens_tag:LL.clens ticketContents ticketVersion", "source_definition": "let ticketContents_clens_tag : LL.clens ticketContents ticketVersion = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun (x: ticketContents) -> tag_of_ticketContents x);\n}", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 58, "start_col": 2, "end_line": 59, "end_col": 70 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.TicketVersion\nopen Parsers.TicketContents12\nopen Parsers.TicketContents13\n\ntype ticketContents =\n | T_ticket12 of ticketContents12\n | T_ticket13 of ticketContents13\n\ninline_for_extraction let tag_of_ticketContents (x:ticketContents) : ticketVersion = match x with\n | T_ticket12 _ -> Ticket12\n | T_ticket13 _ -> Ticket13\n\ninline_for_extraction noextract let ticketContents_parser_kind = LP.strong_parser_kind 47 66060 None\n\nnoextract val ticketContents_parser: LP.parser ticketContents_parser_kind ticketContents\n\nnoextract val ticketContents_serializer: LP.serializer ticketContents_parser\n\nnoextract val ticketContents_bytesize (x:ticketContents) : GTot nat\n\nnoextract val ticketContents_bytesize_eq (x:ticketContents) : Lemma (ticketContents_bytesize x == Seq.length (LP.serialize ticketContents_serializer x))\n\nval ticketContents_parser32: LS.parser32 ticketContents_parser\n\nval ticketContents_serializer32: LS.serializer32 ticketContents_serializer\n\nval ticketContents_size32: LSZ.size32 ticketContents_serializer\n\nval ticketContents_validator: LL.validator ticketContents_parser\n\nval ticketContents_jumper: LL.jumper ticketContents_parser\n\nval lemma_valid_ticketContents_valid_ticketVersion: #rrel: _ -> #rel: _ -> s:LL.slice rrel rel -> pos:U32.t -> h:HyperStack.mem -> Lemma\n (requires LL.valid ticketContents_parser h s pos)\n (ensures (LL.valid ticketVersion_parser h s pos /\\ LL.contents ticketVersion_parser h s pos == tag_of_ticketContents (LL.contents ticketContents_parser h s pos)))\n [SMTPat (LL.valid ticketContents_parser h s pos)]", "dependencies": { "source_file": "Parsers.TicketContents.fsti", "checked_file": "Parsers.TicketContents.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fsti.checked", "Parsers.TicketContents13.fsti.checked", "Parsers.TicketContents12.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.TicketContents.ticketContents\n Parsers.TicketVersion.ticketVersion", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.Mkclens", "Parsers.TicketContents.ticketContents", "Parsers.TicketVersion.ticketVersion", "Prims.l_True", "Parsers.TicketContents.tag_of_ticketContents" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_clens_tag:LL.clens ticketContents ticketVersion\nlet ticketContents_clens_tag:LL.clens ticketContents ticketVersion =", "completed_definiton": "{\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun (x: ticketContents) -> tag_of_ticketContents x)\n}", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fsti", "name": "Parsers.TicketContents.ticketContents_parser_kind", "original_source_type": "", "source_type": "val ticketContents_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let ticketContents_parser_kind = LP.strong_parser_kind 47 66060 None", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 32, "start_col": 65, "end_line": 32, "end_col": 100 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.TicketVersion\nopen Parsers.TicketContents12\nopen Parsers.TicketContents13\n\ntype ticketContents =\n | T_ticket12 of ticketContents12\n | T_ticket13 of ticketContents13\n\ninline_for_extraction let tag_of_ticketContents (x:ticketContents) : ticketVersion = match x with\n | T_ticket12 _ -> Ticket12\n | T_ticket13 _ -> Ticket13", "dependencies": { "source_file": "Parsers.TicketContents.fsti", "checked_file": "Parsers.TicketContents.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fsti.checked", "Parsers.TicketContents13.fsti.checked", "Parsers.TicketContents12.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let ticketContents_parser_kind =", "completed_definiton": "LP.strong_parser_kind 47 66060 None", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fsti", "name": "Parsers.TicketContents.tag_of_ticketContents", "original_source_type": "val tag_of_ticketContents (x: ticketContents) : ticketVersion", "source_type": "val tag_of_ticketContents (x: ticketContents) : ticketVersion", "source_definition": "let tag_of_ticketContents (x:ticketContents) : ticketVersion = match x with\n | T_ticket12 _ -> Ticket12\n | T_ticket13 _ -> Ticket13", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 28, "start_col": 85, "end_line": 30, "end_col": 28 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.TicketVersion\nopen Parsers.TicketContents12\nopen Parsers.TicketContents13\n\ntype ticketContents =\n | T_ticket12 of ticketContents12\n | T_ticket13 of ticketContents13", "dependencies": { "source_file": "Parsers.TicketContents.fsti", "checked_file": "Parsers.TicketContents.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fsti.checked", "Parsers.TicketContents13.fsti.checked", "Parsers.TicketContents12.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketContents.ticketContents -> Parsers.TicketVersion.ticketVersion", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketContents.ticketContents", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketVersion.Ticket12", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketVersion.Ticket13", "Parsers.TicketVersion.ticketVersion" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val tag_of_ticketContents (x: ticketContents) : ticketVersion\nlet tag_of_ticketContents (x: ticketContents) : ticketVersion =", "completed_definiton": "match x with\n| T_ticket12 _ -> Ticket12\n| T_ticket13 _ -> Ticket13", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fsti", "name": "Parsers.TicketContents.ticketContents_clens_ticket12", "original_source_type": "val ticketContents_clens_ticket12:LL.clens ticketContents ticketContents12", "source_type": "val ticketContents_clens_ticket12:LL.clens ticketContents ticketContents12", "source_definition": "let ticketContents_clens_ticket12 : LL.clens ticketContents ticketContents12 = {\n LL.clens_cond = (fun (x: ticketContents) -> tag_of_ticketContents x == Ticket12);\n LL.clens_get = (fun (x: ticketContents) -> (match x with T_ticket12 y -> y) <: (Ghost ticketContents12 (requires (tag_of_ticketContents x == Ticket12)) (ensures (fun y -> True))));\n}", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 71, "start_col": 2, "end_line": 72, "end_col": 182 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.TicketVersion\nopen Parsers.TicketContents12\nopen Parsers.TicketContents13\n\ntype ticketContents =\n | T_ticket12 of ticketContents12\n | T_ticket13 of ticketContents13\n\ninline_for_extraction let tag_of_ticketContents (x:ticketContents) : ticketVersion = match x with\n | T_ticket12 _ -> Ticket12\n | T_ticket13 _ -> Ticket13\n\ninline_for_extraction noextract let ticketContents_parser_kind = LP.strong_parser_kind 47 66060 None\n\nnoextract val ticketContents_parser: LP.parser ticketContents_parser_kind ticketContents\n\nnoextract val ticketContents_serializer: LP.serializer ticketContents_parser\n\nnoextract val ticketContents_bytesize (x:ticketContents) : GTot nat\n\nnoextract val ticketContents_bytesize_eq (x:ticketContents) : Lemma (ticketContents_bytesize x == Seq.length (LP.serialize ticketContents_serializer x))\n\nval ticketContents_parser32: LS.parser32 ticketContents_parser\n\nval ticketContents_serializer32: LS.serializer32 ticketContents_serializer\n\nval ticketContents_size32: LSZ.size32 ticketContents_serializer\n\nval ticketContents_validator: LL.validator ticketContents_parser\n\nval ticketContents_jumper: LL.jumper ticketContents_parser\n\nval lemma_valid_ticketContents_valid_ticketVersion: #rrel: _ -> #rel: _ -> s:LL.slice rrel rel -> pos:U32.t -> h:HyperStack.mem -> Lemma\n (requires LL.valid ticketContents_parser h s pos)\n (ensures (LL.valid ticketVersion_parser h s pos /\\ LL.contents ticketVersion_parser h s pos == tag_of_ticketContents (LL.contents ticketContents_parser h s pos)))\n [SMTPat (LL.valid ticketContents_parser h s pos)]\n\nnoextract let ticketContents_clens_tag : LL.clens ticketContents ticketVersion = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun (x: ticketContents) -> tag_of_ticketContents x);\n}\n\nval ticketContents_gaccessor_tag : LL.gaccessor ticketContents_parser ticketVersion_parser ticketContents_clens_tag\n\nval ticketContents_accessor_tag : LL.accessor ticketContents_gaccessor_tag\n\nval ticketContents_bytesize_eqn_ticket12 (x: ticketContents12) : Lemma (ticketContents_bytesize (T_ticket12 x) == 1 + (ticketContents12_bytesize (x))) [SMTPat (ticketContents_bytesize (T_ticket12 x))]\n\nval ticketContents_bytesize_eqn_ticket13 (x: ticketContents13) : Lemma (ticketContents_bytesize (T_ticket13 x) == 1 + (ticketContents13_bytesize (x))) [SMTPat (ticketContents_bytesize (T_ticket13 x))]", "dependencies": { "source_file": "Parsers.TicketContents.fsti", "checked_file": "Parsers.TicketContents.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fsti.checked", "Parsers.TicketContents13.fsti.checked", "Parsers.TicketContents12.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.TicketContents.ticketContents\n Parsers.TicketContents12.ticketContents12", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.Mkclens", "Parsers.TicketContents.ticketContents", "Parsers.TicketContents12.ticketContents12", "Prims.eq2", "Parsers.TicketVersion.ticketVersion", "Parsers.TicketContents.tag_of_ticketContents", "Parsers.TicketVersion.Ticket12", "Prims.l_True" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_clens_ticket12:LL.clens ticketContents ticketContents12\nlet ticketContents_clens_ticket12:LL.clens ticketContents ticketContents12 =", "completed_definiton": "{\n LL.clens_cond = (fun (x: ticketContents) -> tag_of_ticketContents x == Ticket12);\n LL.clens_get\n =\n (fun (x: ticketContents) ->\n (match x with | T_ticket12 y -> y)\n <:\n (Ghost ticketContents12\n (requires (tag_of_ticketContents x == Ticket12))\n (ensures (fun y -> True))))\n}", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fsti", "name": "Parsers.TicketContents.ticketContents_clens_ticket13", "original_source_type": "val ticketContents_clens_ticket13:LL.clens ticketContents ticketContents13", "source_type": "val ticketContents_clens_ticket13:LL.clens ticketContents ticketContents13", "source_definition": "let ticketContents_clens_ticket13 : LL.clens ticketContents ticketContents13 = {\n LL.clens_cond = (fun (x: ticketContents) -> tag_of_ticketContents x == Ticket13);\n LL.clens_get = (fun (x: ticketContents) -> (match x with T_ticket13 y -> y) <: (Ghost ticketContents13 (requires (tag_of_ticketContents x == Ticket13)) (ensures (fun y -> True))));\n}", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 80, "start_col": 2, "end_line": 81, "end_col": 182 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.TicketVersion\nopen Parsers.TicketContents12\nopen Parsers.TicketContents13\n\ntype ticketContents =\n | T_ticket12 of ticketContents12\n | T_ticket13 of ticketContents13\n\ninline_for_extraction let tag_of_ticketContents (x:ticketContents) : ticketVersion = match x with\n | T_ticket12 _ -> Ticket12\n | T_ticket13 _ -> Ticket13\n\ninline_for_extraction noextract let ticketContents_parser_kind = LP.strong_parser_kind 47 66060 None\n\nnoextract val ticketContents_parser: LP.parser ticketContents_parser_kind ticketContents\n\nnoextract val ticketContents_serializer: LP.serializer ticketContents_parser\n\nnoextract val ticketContents_bytesize (x:ticketContents) : GTot nat\n\nnoextract val ticketContents_bytesize_eq (x:ticketContents) : Lemma (ticketContents_bytesize x == Seq.length (LP.serialize ticketContents_serializer x))\n\nval ticketContents_parser32: LS.parser32 ticketContents_parser\n\nval ticketContents_serializer32: LS.serializer32 ticketContents_serializer\n\nval ticketContents_size32: LSZ.size32 ticketContents_serializer\n\nval ticketContents_validator: LL.validator ticketContents_parser\n\nval ticketContents_jumper: LL.jumper ticketContents_parser\n\nval lemma_valid_ticketContents_valid_ticketVersion: #rrel: _ -> #rel: _ -> s:LL.slice rrel rel -> pos:U32.t -> h:HyperStack.mem -> Lemma\n (requires LL.valid ticketContents_parser h s pos)\n (ensures (LL.valid ticketVersion_parser h s pos /\\ LL.contents ticketVersion_parser h s pos == tag_of_ticketContents (LL.contents ticketContents_parser h s pos)))\n [SMTPat (LL.valid ticketContents_parser h s pos)]\n\nnoextract let ticketContents_clens_tag : LL.clens ticketContents ticketVersion = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun (x: ticketContents) -> tag_of_ticketContents x);\n}\n\nval ticketContents_gaccessor_tag : LL.gaccessor ticketContents_parser ticketVersion_parser ticketContents_clens_tag\n\nval ticketContents_accessor_tag : LL.accessor ticketContents_gaccessor_tag\n\nval ticketContents_bytesize_eqn_ticket12 (x: ticketContents12) : Lemma (ticketContents_bytesize (T_ticket12 x) == 1 + (ticketContents12_bytesize (x))) [SMTPat (ticketContents_bytesize (T_ticket12 x))]\n\nval ticketContents_bytesize_eqn_ticket13 (x: ticketContents13) : Lemma (ticketContents_bytesize (T_ticket13 x) == 1 + (ticketContents13_bytesize (x))) [SMTPat (ticketContents_bytesize (T_ticket13 x))]\n\nnoextract let ticketContents_clens_ticket12 : LL.clens ticketContents ticketContents12 = {\n LL.clens_cond = (fun (x: ticketContents) -> tag_of_ticketContents x == Ticket12);\n LL.clens_get = (fun (x: ticketContents) -> (match x with T_ticket12 y -> y) <: (Ghost ticketContents12 (requires (tag_of_ticketContents x == Ticket12)) (ensures (fun y -> True))));\n}\n\nval ticketContents_gaccessor_ticket12 : LL.gaccessor ticketContents_parser ticketContents12_parser ticketContents_clens_ticket12\n\nval ticketContents_accessor_ticket12 : LL.accessor ticketContents_gaccessor_ticket12", "dependencies": { "source_file": "Parsers.TicketContents.fsti", "checked_file": "Parsers.TicketContents.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fsti.checked", "Parsers.TicketContents13.fsti.checked", "Parsers.TicketContents12.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.TicketContents.ticketContents\n Parsers.TicketContents13.ticketContents13", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.Mkclens", "Parsers.TicketContents.ticketContents", "Parsers.TicketContents13.ticketContents13", "Prims.eq2", "Parsers.TicketVersion.ticketVersion", "Parsers.TicketContents.tag_of_ticketContents", "Parsers.TicketVersion.Ticket13", "Prims.l_True" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_clens_ticket13:LL.clens ticketContents ticketContents13\nlet ticketContents_clens_ticket13:LL.clens ticketContents ticketContents13 =", "completed_definiton": "{\n LL.clens_cond = (fun (x: ticketContents) -> tag_of_ticketContents x == Ticket13);\n LL.clens_get\n =\n (fun (x: ticketContents) ->\n (match x with | T_ticket13 y -> y)\n <:\n (Ghost ticketContents13\n (requires (tag_of_ticketContents x == Ticket13))\n (ensures (fun y -> True))))\n}", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.boolean_repr_writer", "original_source_type": "", "source_type": "val boolean_repr_writer : LowParse.Low.Base.leaf_writer_strong LowParse.Spec.Int.serialize_u8", "source_definition": "let boolean_repr_writer = LL.write_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 51, "start_col": 58, "end_line": 51, "end_col": 69 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let boolean_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let boolean_repr_reader = LL.read_u8", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong LowParse.Spec.Int.serialize_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.write_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let boolean_repr_writer =", "completed_definiton": "LL.write_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.boolean_repr_serializer", "original_source_type": "", "source_type": "val boolean_repr_serializer : LowParse.Spec.Base.serializer LowParse.Spec.Int.parse_u8", "source_definition": "let boolean_repr_serializer = LPI.serialize_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 37, "start_col": 40, "end_line": 37, "end_col": 56 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Int.serialize_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let boolean_repr_serializer =", "completed_definiton": "LPI.serialize_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.boolean_repr_size32", "original_source_type": "", "source_type": "val boolean_repr_size32 : LowParse.SLow.Base.size32 LowParse.Spec.Int.serialize_u8", "source_definition": "let boolean_repr_size32 = LSZ.size32_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 43, "start_col": 58, "end_line": 43, "end_col": 71 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 LowParse.Spec.Int.serialize_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.size32_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let boolean_repr_size32 =", "completed_definiton": "LSZ.size32_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.boolean_repr_serializer32", "original_source_type": "", "source_type": "val boolean_repr_serializer32 : LowParse.SLow.Base.serializer32 LowParse.Spec.Int.serialize_u8", "source_definition": "let boolean_repr_serializer32 = LS.serialize32_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 41, "start_col": 64, "end_line": 41, "end_col": 81 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 LowParse.Spec.Int.serialize_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.serialize32_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let boolean_repr_serializer32 =", "completed_definiton": "LS.serialize32_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.boolean_repr_reader", "original_source_type": "", "source_type": "val boolean_repr_reader : LowParse.Low.Base.leaf_reader LowParse.Spec.Int.parse_u8", "source_definition": "let boolean_repr_reader = LL.read_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 49, "start_col": 58, "end_line": 49, "end_col": 68 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let boolean_repr_jumper = LL.jump_u8", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.read_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let boolean_repr_reader =", "completed_definiton": "LL.read_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.boolean_repr_jumper", "original_source_type": "", "source_type": "val boolean_repr_jumper : LowParse.Low.Base.jumper LowParse.Spec.Int.parse_u8", "source_definition": "let boolean_repr_jumper = LL.jump_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 47, "start_col": 58, "end_line": 47, "end_col": 68 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.jump_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let boolean_repr_jumper =", "completed_definiton": "LL.jump_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.boolean_repr_parser32", "original_source_type": "", "source_type": "val boolean_repr_parser32 : LowParse.SLow.Base.parser32 LowParse.Spec.Int.parse_u8", "source_definition": "let boolean_repr_parser32 = LS.parse32_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 39, "start_col": 60, "end_line": 39, "end_col": 73 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.parse32_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let boolean_repr_parser32 =", "completed_definiton": "LS.parse32_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.boolean_repr_validator", "original_source_type": "", "source_type": "val boolean_repr_validator : LowParse.Low.Base.validator LowParse.Spec.Int.parse_u8", "source_definition": "let boolean_repr_validator = (LL.validate_u8 ())", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 45, "start_col": 61, "end_line": 45, "end_col": 80 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.validate_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let boolean_repr_validator =", "completed_definiton": "(LL.validate_u8 ())", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.boolean_repr_parser", "original_source_type": "", "source_type": "val boolean_repr_parser : LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u8_kind FStar.UInt8.t", "source_definition": "let boolean_repr_parser = LPI.parse_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 35, "start_col": 36, "end_line": 35, "end_col": 48 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u8_kind FStar.UInt8.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Int.parse_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let boolean_repr_parser =", "completed_definiton": "LPI.parse_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.boolean_bytesize", "original_source_type": "val boolean_bytesize (x:boolean) : GTot nat", "source_type": "val boolean_bytesize (x:boolean) : GTot nat", "source_definition": "let boolean_bytesize (x:boolean) : GTot nat = Seq.length (boolean_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 82, "start_col": 46, "end_line": 82, "end_col": 79 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let boolean_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let boolean_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let boolean_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean = x\n\ninline_for_extraction let synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst boolean_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_boolean_inj () : Lemma\n (LP.synth_injective synth_boolean) = ()\n\nlet lemma_synth_boolean_inv () : Lemma\n (LP.synth_inverse synth_boolean synth_boolean_inv) = ()\n\nnoextract let parse_boolean_key : LP.parser _ (LP.enum_key boolean_enum) =\n LP.parse_enum_key boolean_repr_parser boolean_enum\n\nnoextract let serialize_boolean_key : LP.serializer parse_boolean_key =\n LP.serialize_enum_key boolean_repr_parser boolean_repr_serializer boolean_enum\n\nnoextract let boolean_parser : LP.parser _ boolean =\n lemma_synth_boolean_inj ();\n parse_boolean_key `LP.parse_synth` synth_boolean\n\nnoextract let boolean_serializer : LP.serializer boolean_parser =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LP.serialize_synth _ synth_boolean serialize_boolean_key synth_boolean_inv ()", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.Boolean.boolean -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.Boolean.boolean", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.Boolean.boolean_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val boolean_bytesize (x:boolean) : GTot nat\nlet boolean_bytesize (x: boolean) : GTot nat =", "completed_definiton": "Seq.length (boolean_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.boolean_size32", "original_source_type": "val boolean_size32: LSZ.size32 boolean_serializer", "source_type": "val boolean_size32: LSZ.size32 boolean_serializer", "source_definition": "let boolean_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond boolean_serializer 1ul) in\n LSZ.size32_constant boolean_serializer 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 103, "start_col": 2, "end_line": 104, "end_col": 47 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let boolean_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let boolean_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let boolean_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean = x\n\ninline_for_extraction let synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst boolean_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_boolean_inj () : Lemma\n (LP.synth_injective synth_boolean) = ()\n\nlet lemma_synth_boolean_inv () : Lemma\n (LP.synth_inverse synth_boolean synth_boolean_inv) = ()\n\nnoextract let parse_boolean_key : LP.parser _ (LP.enum_key boolean_enum) =\n LP.parse_enum_key boolean_repr_parser boolean_enum\n\nnoextract let serialize_boolean_key : LP.serializer parse_boolean_key =\n LP.serialize_enum_key boolean_repr_parser boolean_repr_serializer boolean_enum\n\nnoextract let boolean_parser : LP.parser _ boolean =\n lemma_synth_boolean_inj ();\n parse_boolean_key `LP.parse_synth` synth_boolean\n\nnoextract let boolean_serializer : LP.serializer boolean_parser =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LP.serialize_synth _ synth_boolean serialize_boolean_key synth_boolean_inv ()\n\nlet boolean_bytesize (x:boolean) : GTot nat = Seq.length (boolean_serializer x)\n\nlet boolean_bytesize_eq x = ()\n\nlet parse32_boolean_key : LS.parser32 parse_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac boolean_repr_parser32 boolean_enum)\n\nlet boolean_parser32 : LS.parser32 boolean_parser =\n lemma_synth_boolean_inj ();\n LS.parse32_synth _ synth_boolean (fun x->synth_boolean x) parse32_boolean_key ()\n\nlet serialize32_boolean_key : LS.serializer32 serialize_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n boolean_repr_serializer32 boolean_enum)\n\nlet boolean_serializer32 : LS.serializer32 boolean_serializer =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LS.serialize32_synth _ synth_boolean _ serialize32_boolean_key synth_boolean_inv (fun x->synth_boolean_inv x) ()", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.Boolean.boolean_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Base.size32_constant", "Parsers.Boolean.boolean_parser_kind", "Parsers.Boolean.boolean", "Parsers.Boolean.boolean_parser", "Parsers.Boolean.boolean_serializer", "FStar.UInt32.__uint_to_t", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.SLow.Base.size32_constant_precond" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val boolean_size32: LSZ.size32 boolean_serializer\nlet boolean_size32 =", "completed_definiton": "[@@ inline_let ]let _ = assert_norm (LSZ.size32_constant_precond boolean_serializer 1ul) in\nLSZ.size32_constant boolean_serializer 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.boolean_enum", "original_source_type": "val boolean_enum:LP.enum boolean U8.t", "source_type": "val boolean_enum:LP.enum boolean U8.t", "source_definition": "let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 24, "start_col": 2, "end_line": 33, "end_col": 6 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Enum.enum Parsers.Boolean.boolean FStar.UInt8.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.b2t", "FStar.List.Tot.Base.noRepeats", "FStar.UInt8.t", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "Parsers.Boolean.boolean", "FStar.Pervasives.Native.snd", "FStar.Pervasives.Native.fst", "Prims.list", "Prims.Cons", "FStar.Pervasives.Native.Mktuple2", "Parsers.Boolean.B_false", "FStar.UInt8.__uint_to_t", "Parsers.Boolean.B_true", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val boolean_enum:LP.enum boolean U8.t\nlet boolean_enum:LP.enum boolean U8.t =", "completed_definiton": "[@@ inline_let ]let e = [B_false, 0uy; B_true, 1uy] in\n[@@ inline_let ]let _ = assert_norm (L.noRepeats (LP.list_map fst e)) in\n[@@ inline_let ]let _ = assert_norm (L.noRepeats (LP.list_map snd e)) in\ne", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.synth_boolean", "original_source_type": "val synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean", "source_type": "val synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean", "source_definition": "let synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean = x", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 53, "start_col": 86, "end_line": 53, "end_col": 87 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let boolean_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let boolean_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let boolean_repr_writer = LL.write_u8", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: LowParse.Spec.Enum.enum_key Parsers.Boolean.boolean_enum -> Parsers.Boolean.boolean", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.enum_key", "Parsers.Boolean.boolean", "FStar.UInt8.t", "Parsers.Boolean.boolean_enum" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean\nlet synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean =", "completed_definiton": "x", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.validate_boolean_key", "original_source_type": "val validate_boolean_key:LL.validator parse_boolean_key", "source_type": "val validate_boolean_key:LL.validator parse_boolean_key", "source_definition": "let validate_boolean_key : LL.validator parse_boolean_key =\n LL.mk_validate_enum_key boolean_repr_validator boolean_repr_reader boolean_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 108, "start_col": 4, "end_line": 108, "end_col": 83 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let boolean_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let boolean_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let boolean_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean = x\n\ninline_for_extraction let synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst boolean_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_boolean_inj () : Lemma\n (LP.synth_injective synth_boolean) = ()\n\nlet lemma_synth_boolean_inv () : Lemma\n (LP.synth_inverse synth_boolean synth_boolean_inv) = ()\n\nnoextract let parse_boolean_key : LP.parser _ (LP.enum_key boolean_enum) =\n LP.parse_enum_key boolean_repr_parser boolean_enum\n\nnoextract let serialize_boolean_key : LP.serializer parse_boolean_key =\n LP.serialize_enum_key boolean_repr_parser boolean_repr_serializer boolean_enum\n\nnoextract let boolean_parser : LP.parser _ boolean =\n lemma_synth_boolean_inj ();\n parse_boolean_key `LP.parse_synth` synth_boolean\n\nnoextract let boolean_serializer : LP.serializer boolean_parser =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LP.serialize_synth _ synth_boolean serialize_boolean_key synth_boolean_inv ()\n\nlet boolean_bytesize (x:boolean) : GTot nat = Seq.length (boolean_serializer x)\n\nlet boolean_bytesize_eq x = ()\n\nlet parse32_boolean_key : LS.parser32 parse_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac boolean_repr_parser32 boolean_enum)\n\nlet boolean_parser32 : LS.parser32 boolean_parser =\n lemma_synth_boolean_inj ();\n LS.parse32_synth _ synth_boolean (fun x->synth_boolean x) parse32_boolean_key ()\n\nlet serialize32_boolean_key : LS.serializer32 serialize_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n boolean_repr_serializer32 boolean_enum)\n\nlet boolean_serializer32 : LS.serializer32 boolean_serializer =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LS.serialize32_synth _ synth_boolean _ serialize32_boolean_key synth_boolean_inv (fun x->synth_boolean_inv x) ()\n\nlet boolean_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond boolean_serializer 1ul) in\n LSZ.size32_constant boolean_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.Boolean.parse_boolean_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.validate_enum_key", "Parsers.Boolean.boolean", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "Parsers.Boolean.boolean_repr_validator", "Parsers.Boolean.boolean_repr_reader", "Prims.Cons", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.Mktuple2", "Parsers.Boolean.B_false", "FStar.UInt8.__uint_to_t", "Parsers.Boolean.B_true", "Prims.Nil", "LowParse.Spec.Enum.maybe_enum_destr_t_intro", "Prims.bool", "LowParse.Spec.Enum.maybe_enum_destr_cons", "LowParse.Spec.Enum.maybe_enum_destr_nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val validate_boolean_key:LL.validator parse_boolean_key\nlet validate_boolean_key:LL.validator parse_boolean_key =", "completed_definiton": "LL.mk_validate_enum_key boolean_repr_validator boolean_repr_reader boolean_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.serialize_boolean_key", "original_source_type": "val serialize_boolean_key:LP.serializer parse_boolean_key", "source_type": "val serialize_boolean_key:LP.serializer parse_boolean_key", "source_definition": "let serialize_boolean_key : LP.serializer parse_boolean_key =\n LP.serialize_enum_key boolean_repr_parser boolean_repr_serializer boolean_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 71, "start_col": 2, "end_line": 71, "end_col": 80 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let boolean_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let boolean_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let boolean_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean = x\n\ninline_for_extraction let synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst boolean_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_boolean_inj () : Lemma\n (LP.synth_injective synth_boolean) = ()\n\nlet lemma_synth_boolean_inv () : Lemma\n (LP.synth_inverse synth_boolean synth_boolean_inv) = ()\n\nnoextract let parse_boolean_key : LP.parser _ (LP.enum_key boolean_enum) =\n LP.parse_enum_key boolean_repr_parser boolean_enum", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.Boolean.parse_boolean_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.serialize_enum_key", "LowParse.Spec.Int.parse_u8_kind", "Parsers.Boolean.boolean", "FStar.UInt8.t", "Parsers.Boolean.boolean_repr_parser", "Parsers.Boolean.boolean_repr_serializer", "Parsers.Boolean.boolean_enum" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_boolean_key:LP.serializer parse_boolean_key\nlet serialize_boolean_key:LP.serializer parse_boolean_key =", "completed_definiton": "LP.serialize_enum_key boolean_repr_parser boolean_repr_serializer boolean_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.write_boolean_key", "original_source_type": "val write_boolean_key:LL.leaf_writer_strong serialize_boolean_key", "source_type": "val write_boolean_key:LL.leaf_writer_strong serialize_boolean_key", "source_definition": "let write_boolean_key : LL.leaf_writer_strong serialize_boolean_key =\n LL.write_enum_key boolean_repr_writer boolean_enum (_ by (LP.enum_repr_of_key_tac boolean_enum))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 123, "start_col": 2, "end_line": 123, "end_col": 98 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let boolean_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let boolean_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let boolean_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean = x\n\ninline_for_extraction let synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst boolean_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_boolean_inj () : Lemma\n (LP.synth_injective synth_boolean) = ()\n\nlet lemma_synth_boolean_inv () : Lemma\n (LP.synth_inverse synth_boolean synth_boolean_inv) = ()\n\nnoextract let parse_boolean_key : LP.parser _ (LP.enum_key boolean_enum) =\n LP.parse_enum_key boolean_repr_parser boolean_enum\n\nnoextract let serialize_boolean_key : LP.serializer parse_boolean_key =\n LP.serialize_enum_key boolean_repr_parser boolean_repr_serializer boolean_enum\n\nnoextract let boolean_parser : LP.parser _ boolean =\n lemma_synth_boolean_inj ();\n parse_boolean_key `LP.parse_synth` synth_boolean\n\nnoextract let boolean_serializer : LP.serializer boolean_parser =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LP.serialize_synth _ synth_boolean serialize_boolean_key synth_boolean_inv ()\n\nlet boolean_bytesize (x:boolean) : GTot nat = Seq.length (boolean_serializer x)\n\nlet boolean_bytesize_eq x = ()\n\nlet parse32_boolean_key : LS.parser32 parse_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac boolean_repr_parser32 boolean_enum)\n\nlet boolean_parser32 : LS.parser32 boolean_parser =\n lemma_synth_boolean_inj ();\n LS.parse32_synth _ synth_boolean (fun x->synth_boolean x) parse32_boolean_key ()\n\nlet serialize32_boolean_key : LS.serializer32 serialize_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n boolean_repr_serializer32 boolean_enum)\n\nlet boolean_serializer32 : LS.serializer32 boolean_serializer =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LS.serialize32_synth _ synth_boolean _ serialize32_boolean_key synth_boolean_inv (fun x->synth_boolean_inv x) ()\n\nlet boolean_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond boolean_serializer 1ul) in\n LSZ.size32_constant boolean_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_boolean_key : LL.validator parse_boolean_key =\n LL.mk_validate_enum_key boolean_repr_validator boolean_repr_reader boolean_enum\n\nlet boolean_validator =\n lemma_synth_boolean_inj ();\n LL.validate_synth validate_boolean_key synth_boolean ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_boolean_key : LL.leaf_reader parse_boolean_key =\n LL.mk_read_enum_key boolean_repr_reader boolean_enum\n\nlet boolean_reader =\n [@inline_let] let _ = lemma_synth_boolean_inj () in\n LL.read_synth' parse_boolean_key synth_boolean read_boolean_key ()", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong Parsers.Boolean.serialize_boolean_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.write_enum_key", "Parsers.Boolean.boolean", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "Parsers.Boolean.boolean_repr_writer", "Parsers.Boolean.boolean_enum", "LowParse.Spec.Enum.enum_repr_of_key_cons'", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'", "LowParse.Spec.Enum.enum_tail'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val write_boolean_key:LL.leaf_writer_strong serialize_boolean_key\nlet write_boolean_key:LL.leaf_writer_strong serialize_boolean_key =", "completed_definiton": "LL.write_enum_key boolean_repr_writer\n boolean_enum\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.enum_repr_of_key_tac boolean_enum)))", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.parse32_boolean_key", "original_source_type": "val parse32_boolean_key:LS.parser32 parse_boolean_key", "source_type": "val parse32_boolean_key:LS.parser32 parse_boolean_key", "source_definition": "let parse32_boolean_key : LS.parser32 parse_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac boolean_repr_parser32 boolean_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 87, "start_col": 2, "end_line": 87, "end_col": 92 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let boolean_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let boolean_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let boolean_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean = x\n\ninline_for_extraction let synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst boolean_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_boolean_inj () : Lemma\n (LP.synth_injective synth_boolean) = ()\n\nlet lemma_synth_boolean_inv () : Lemma\n (LP.synth_inverse synth_boolean synth_boolean_inv) = ()\n\nnoextract let parse_boolean_key : LP.parser _ (LP.enum_key boolean_enum) =\n LP.parse_enum_key boolean_repr_parser boolean_enum\n\nnoextract let serialize_boolean_key : LP.serializer parse_boolean_key =\n LP.serialize_enum_key boolean_repr_parser boolean_repr_serializer boolean_enum\n\nnoextract let boolean_parser : LP.parser _ boolean =\n lemma_synth_boolean_inj ();\n parse_boolean_key `LP.parse_synth` synth_boolean\n\nnoextract let boolean_serializer : LP.serializer boolean_parser =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LP.serialize_synth _ synth_boolean serialize_boolean_key synth_boolean_inv ()\n\nlet boolean_bytesize (x:boolean) : GTot nat = Seq.length (boolean_serializer x)\n\nlet boolean_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.Boolean.parse_boolean_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Enum.parse32_enum_key_gen", "LowParse.Spec.Int.parse_u8_kind", "Parsers.Boolean.boolean", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "Parsers.Boolean.boolean_enum", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Enum.enum_key", "Parsers.Boolean.parse_boolean_key", "LowParse.SLow.Enum.parse32_maybe_enum_key_gen", "Parsers.Boolean.boolean_repr_parser32", "LowParse.Spec.Enum.maybe_enum_key", "LowParse.Spec.Enum.parse_maybe_enum_key", "LowParse.Spec.Enum.maybe_enum_key_of_repr'_t_cons'", "LowParse.Spec.Enum.maybe_enum_key_of_repr'_t_cons_nil'", "LowParse.Spec.Enum.enum_tail'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse32_boolean_key:LS.parser32 parse_boolean_key\nlet parse32_boolean_key:LS.parser32 parse_boolean_key =", "completed_definiton": "FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac boolean_repr_parser32 boolean_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.boolean_parser", "original_source_type": "val boolean_parser: LP.parser boolean_parser_kind boolean", "source_type": "val boolean_parser: LP.parser boolean_parser_kind boolean", "source_definition": "let boolean_parser : LP.parser _ boolean =\n lemma_synth_boolean_inj ();\n parse_boolean_key `LP.parse_synth` synth_boolean", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 74, "start_col": 2, "end_line": 75, "end_col": 50 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let boolean_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let boolean_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let boolean_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean = x\n\ninline_for_extraction let synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst boolean_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_boolean_inj () : Lemma\n (LP.synth_injective synth_boolean) = ()\n\nlet lemma_synth_boolean_inv () : Lemma\n (LP.synth_inverse synth_boolean synth_boolean_inv) = ()\n\nnoextract let parse_boolean_key : LP.parser _ (LP.enum_key boolean_enum) =\n LP.parse_enum_key boolean_repr_parser boolean_enum\n\nnoextract let serialize_boolean_key : LP.serializer parse_boolean_key =\n LP.serialize_enum_key boolean_repr_parser boolean_repr_serializer boolean_enum", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.Boolean.boolean_parser_kind Parsers.Boolean.boolean", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.Boolean.boolean", "FStar.UInt8.t", "Parsers.Boolean.boolean_enum", "Parsers.Boolean.parse_boolean_key", "Parsers.Boolean.synth_boolean", "Prims.unit", "Parsers.Boolean.lemma_synth_boolean_inj", "LowParse.Spec.Base.parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val boolean_parser: LP.parser boolean_parser_kind boolean\nlet boolean_parser:LP.parser _ boolean =", "completed_definiton": "lemma_synth_boolean_inj ();\nparse_boolean_key `LP.parse_synth` synth_boolean", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.boolean_serializer32", "original_source_type": "val boolean_serializer32: LS.serializer32 boolean_serializer", "source_type": "val boolean_serializer32: LS.serializer32 boolean_serializer", "source_definition": "let boolean_serializer32 : LS.serializer32 boolean_serializer =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LS.serialize32_synth _ synth_boolean _ serialize32_boolean_key synth_boolean_inv (fun x->synth_boolean_inv x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 98, "start_col": 2, "end_line": 100, "end_col": 114 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let boolean_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let boolean_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let boolean_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean = x\n\ninline_for_extraction let synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst boolean_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_boolean_inj () : Lemma\n (LP.synth_injective synth_boolean) = ()\n\nlet lemma_synth_boolean_inv () : Lemma\n (LP.synth_inverse synth_boolean synth_boolean_inv) = ()\n\nnoextract let parse_boolean_key : LP.parser _ (LP.enum_key boolean_enum) =\n LP.parse_enum_key boolean_repr_parser boolean_enum\n\nnoextract let serialize_boolean_key : LP.serializer parse_boolean_key =\n LP.serialize_enum_key boolean_repr_parser boolean_repr_serializer boolean_enum\n\nnoextract let boolean_parser : LP.parser _ boolean =\n lemma_synth_boolean_inj ();\n parse_boolean_key `LP.parse_synth` synth_boolean\n\nnoextract let boolean_serializer : LP.serializer boolean_parser =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LP.serialize_synth _ synth_boolean serialize_boolean_key synth_boolean_inv ()\n\nlet boolean_bytesize (x:boolean) : GTot nat = Seq.length (boolean_serializer x)\n\nlet boolean_bytesize_eq x = ()\n\nlet parse32_boolean_key : LS.parser32 parse_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac boolean_repr_parser32 boolean_enum)\n\nlet boolean_parser32 : LS.parser32 boolean_parser =\n lemma_synth_boolean_inj ();\n LS.parse32_synth _ synth_boolean (fun x->synth_boolean x) parse32_boolean_key ()\n\nlet serialize32_boolean_key : LS.serializer32 serialize_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n boolean_repr_serializer32 boolean_enum)", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.Boolean.boolean_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.Boolean.boolean", "FStar.UInt8.t", "Parsers.Boolean.boolean_enum", "Parsers.Boolean.parse_boolean_key", "Parsers.Boolean.synth_boolean", "Parsers.Boolean.serialize_boolean_key", "Parsers.Boolean.serialize32_boolean_key", "Parsers.Boolean.synth_boolean_inv", "Prims.eq2", "Prims.unit", "Parsers.Boolean.lemma_synth_boolean_inv", "Parsers.Boolean.lemma_synth_boolean_inj", "LowParse.SLow.Base.serializer32", "Parsers.Boolean.boolean_parser_kind", "Parsers.Boolean.boolean_parser", "Parsers.Boolean.boolean_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val boolean_serializer32: LS.serializer32 boolean_serializer\nlet boolean_serializer32:LS.serializer32 boolean_serializer =", "completed_definiton": "lemma_synth_boolean_inj ();\nlemma_synth_boolean_inv ();\nLS.serialize32_synth _\n synth_boolean\n _\n serialize32_boolean_key\n synth_boolean_inv\n (fun x -> synth_boolean_inv x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.boolean_lserializer", "original_source_type": "val boolean_lserializer: LL.serializer32 boolean_serializer", "source_type": "val boolean_lserializer: LL.serializer32 boolean_serializer", "source_definition": "let boolean_lserializer = LL.serializer32_of_leaf_writer_strong_constant_size boolean_writer 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 132, "start_col": 26, "end_line": 132, "end_col": 99 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let boolean_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let boolean_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let boolean_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean = x\n\ninline_for_extraction let synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst boolean_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_boolean_inj () : Lemma\n (LP.synth_injective synth_boolean) = ()\n\nlet lemma_synth_boolean_inv () : Lemma\n (LP.synth_inverse synth_boolean synth_boolean_inv) = ()\n\nnoextract let parse_boolean_key : LP.parser _ (LP.enum_key boolean_enum) =\n LP.parse_enum_key boolean_repr_parser boolean_enum\n\nnoextract let serialize_boolean_key : LP.serializer parse_boolean_key =\n LP.serialize_enum_key boolean_repr_parser boolean_repr_serializer boolean_enum\n\nnoextract let boolean_parser : LP.parser _ boolean =\n lemma_synth_boolean_inj ();\n parse_boolean_key `LP.parse_synth` synth_boolean\n\nnoextract let boolean_serializer : LP.serializer boolean_parser =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LP.serialize_synth _ synth_boolean serialize_boolean_key synth_boolean_inv ()\n\nlet boolean_bytesize (x:boolean) : GTot nat = Seq.length (boolean_serializer x)\n\nlet boolean_bytesize_eq x = ()\n\nlet parse32_boolean_key : LS.parser32 parse_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac boolean_repr_parser32 boolean_enum)\n\nlet boolean_parser32 : LS.parser32 boolean_parser =\n lemma_synth_boolean_inj ();\n LS.parse32_synth _ synth_boolean (fun x->synth_boolean x) parse32_boolean_key ()\n\nlet serialize32_boolean_key : LS.serializer32 serialize_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n boolean_repr_serializer32 boolean_enum)\n\nlet boolean_serializer32 : LS.serializer32 boolean_serializer =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LS.serialize32_synth _ synth_boolean _ serialize32_boolean_key synth_boolean_inv (fun x->synth_boolean_inv x) ()\n\nlet boolean_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond boolean_serializer 1ul) in\n LSZ.size32_constant boolean_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_boolean_key : LL.validator parse_boolean_key =\n LL.mk_validate_enum_key boolean_repr_validator boolean_repr_reader boolean_enum\n\nlet boolean_validator =\n lemma_synth_boolean_inj ();\n LL.validate_synth validate_boolean_key synth_boolean ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_boolean_key : LL.leaf_reader parse_boolean_key =\n LL.mk_read_enum_key boolean_repr_reader boolean_enum\n\nlet boolean_reader =\n [@inline_let] let _ = lemma_synth_boolean_inj () in\n LL.read_synth' parse_boolean_key synth_boolean read_boolean_key ()\n\ninline_for_extraction let write_boolean_key : LL.leaf_writer_strong serialize_boolean_key =\n LL.write_enum_key boolean_repr_writer boolean_enum (_ by (LP.enum_repr_of_key_tac boolean_enum))\n\ninline_for_extraction let lserialize_boolean_key : LL.serializer32 serialize_boolean_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_boolean_key 1ul ()\n\nlet boolean_writer =\n [@inline_let] let _ = lemma_synth_boolean_inj (); lemma_synth_boolean_inv () in\n LL.write_synth write_boolean_key synth_boolean synth_boolean_inv (fun x -> synth_boolean_inv x) ()", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 Parsers.Boolean.boolean_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.serializer32_of_leaf_writer_strong_constant_size", "Parsers.Boolean.boolean_parser_kind", "Parsers.Boolean.boolean", "Parsers.Boolean.boolean_parser", "Parsers.Boolean.boolean_serializer", "Parsers.Boolean.boolean_writer", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val boolean_lserializer: LL.serializer32 boolean_serializer\nlet boolean_lserializer =", "completed_definiton": "LL.serializer32_of_leaf_writer_strong_constant_size boolean_writer 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.synth_boolean_inv", "original_source_type": "val synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum)", "source_type": "val synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum)", "source_definition": "let synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst boolean_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 56, "start_col": 2, "end_line": 59, "end_col": 3 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let boolean_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let boolean_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let boolean_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean = x", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.Boolean.boolean -> LowParse.Spec.Enum.enum_key Parsers.Boolean.boolean_enum", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.Boolean.boolean", "Prims.squash", "Prims.b2t", "LowParse.Spec.Enum.list_mem", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "FStar.UInt8.t", "FStar.Pervasives.Native.fst", "Parsers.Boolean.boolean_enum", "LowParse.Spec.Enum.enum_key" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum)\nlet synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum) =", "completed_definiton": "[@@ inline_let ]let _:squash (LP.list_mem x (LP.list_map fst boolean_enum)) =\n FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.synth_maybe_enum_key_inv_unknown_tac x))\nin\nx", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.read_boolean_key", "original_source_type": "val read_boolean_key:LL.leaf_reader parse_boolean_key", "source_type": "val read_boolean_key:LL.leaf_reader parse_boolean_key", "source_definition": "let read_boolean_key : LL.leaf_reader parse_boolean_key =\n LL.mk_read_enum_key boolean_repr_reader boolean_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 116, "start_col": 2, "end_line": 116, "end_col": 54 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let boolean_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let boolean_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let boolean_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean = x\n\ninline_for_extraction let synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst boolean_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_boolean_inj () : Lemma\n (LP.synth_injective synth_boolean) = ()\n\nlet lemma_synth_boolean_inv () : Lemma\n (LP.synth_inverse synth_boolean synth_boolean_inv) = ()\n\nnoextract let parse_boolean_key : LP.parser _ (LP.enum_key boolean_enum) =\n LP.parse_enum_key boolean_repr_parser boolean_enum\n\nnoextract let serialize_boolean_key : LP.serializer parse_boolean_key =\n LP.serialize_enum_key boolean_repr_parser boolean_repr_serializer boolean_enum\n\nnoextract let boolean_parser : LP.parser _ boolean =\n lemma_synth_boolean_inj ();\n parse_boolean_key `LP.parse_synth` synth_boolean\n\nnoextract let boolean_serializer : LP.serializer boolean_parser =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LP.serialize_synth _ synth_boolean serialize_boolean_key synth_boolean_inv ()\n\nlet boolean_bytesize (x:boolean) : GTot nat = Seq.length (boolean_serializer x)\n\nlet boolean_bytesize_eq x = ()\n\nlet parse32_boolean_key : LS.parser32 parse_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac boolean_repr_parser32 boolean_enum)\n\nlet boolean_parser32 : LS.parser32 boolean_parser =\n lemma_synth_boolean_inj ();\n LS.parse32_synth _ synth_boolean (fun x->synth_boolean x) parse32_boolean_key ()\n\nlet serialize32_boolean_key : LS.serializer32 serialize_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n boolean_repr_serializer32 boolean_enum)\n\nlet boolean_serializer32 : LS.serializer32 boolean_serializer =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LS.serialize32_synth _ synth_boolean _ serialize32_boolean_key synth_boolean_inv (fun x->synth_boolean_inv x) ()\n\nlet boolean_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond boolean_serializer 1ul) in\n LSZ.size32_constant boolean_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_boolean_key : LL.validator parse_boolean_key =\n LL.mk_validate_enum_key boolean_repr_validator boolean_repr_reader boolean_enum\n\nlet boolean_validator =\n lemma_synth_boolean_inj ();\n LL.validate_synth validate_boolean_key synth_boolean ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader Parsers.Boolean.parse_boolean_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.read_enum_key", "Parsers.Boolean.boolean", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "Parsers.Boolean.boolean_repr_reader", "Prims.Cons", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.Mktuple2", "Parsers.Boolean.B_false", "FStar.UInt8.__uint_to_t", "Parsers.Boolean.B_true", "Prims.Nil", "LowParse.Spec.Enum.dep_maybe_enum_destr_t_intro", "LowParse.Low.Enum.read_enum_key_t", "LowParse.Spec.Enum.dep_maybe_enum_destr_cons", "LowParse.Spec.Enum.list_append_rev_cons", "LowParse.Spec.Enum.dep_maybe_enum_destr_nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_boolean_key:LL.leaf_reader parse_boolean_key\nlet read_boolean_key:LL.leaf_reader parse_boolean_key =", "completed_definiton": "LL.mk_read_enum_key boolean_repr_reader boolean_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.lserialize_boolean_key", "original_source_type": "val lserialize_boolean_key:LL.serializer32 serialize_boolean_key", "source_type": "val lserialize_boolean_key:LL.serializer32 serialize_boolean_key", "source_definition": "let lserialize_boolean_key : LL.serializer32 serialize_boolean_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_boolean_key 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 126, "start_col": 2, "end_line": 126, "end_col": 78 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let boolean_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let boolean_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let boolean_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean = x\n\ninline_for_extraction let synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst boolean_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_boolean_inj () : Lemma\n (LP.synth_injective synth_boolean) = ()\n\nlet lemma_synth_boolean_inv () : Lemma\n (LP.synth_inverse synth_boolean synth_boolean_inv) = ()\n\nnoextract let parse_boolean_key : LP.parser _ (LP.enum_key boolean_enum) =\n LP.parse_enum_key boolean_repr_parser boolean_enum\n\nnoextract let serialize_boolean_key : LP.serializer parse_boolean_key =\n LP.serialize_enum_key boolean_repr_parser boolean_repr_serializer boolean_enum\n\nnoextract let boolean_parser : LP.parser _ boolean =\n lemma_synth_boolean_inj ();\n parse_boolean_key `LP.parse_synth` synth_boolean\n\nnoextract let boolean_serializer : LP.serializer boolean_parser =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LP.serialize_synth _ synth_boolean serialize_boolean_key synth_boolean_inv ()\n\nlet boolean_bytesize (x:boolean) : GTot nat = Seq.length (boolean_serializer x)\n\nlet boolean_bytesize_eq x = ()\n\nlet parse32_boolean_key : LS.parser32 parse_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac boolean_repr_parser32 boolean_enum)\n\nlet boolean_parser32 : LS.parser32 boolean_parser =\n lemma_synth_boolean_inj ();\n LS.parse32_synth _ synth_boolean (fun x->synth_boolean x) parse32_boolean_key ()\n\nlet serialize32_boolean_key : LS.serializer32 serialize_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n boolean_repr_serializer32 boolean_enum)\n\nlet boolean_serializer32 : LS.serializer32 boolean_serializer =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LS.serialize32_synth _ synth_boolean _ serialize32_boolean_key synth_boolean_inv (fun x->synth_boolean_inv x) ()\n\nlet boolean_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond boolean_serializer 1ul) in\n LSZ.size32_constant boolean_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_boolean_key : LL.validator parse_boolean_key =\n LL.mk_validate_enum_key boolean_repr_validator boolean_repr_reader boolean_enum\n\nlet boolean_validator =\n lemma_synth_boolean_inj ();\n LL.validate_synth validate_boolean_key synth_boolean ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_boolean_key : LL.leaf_reader parse_boolean_key =\n LL.mk_read_enum_key boolean_repr_reader boolean_enum\n\nlet boolean_reader =\n [@inline_let] let _ = lemma_synth_boolean_inj () in\n LL.read_synth' parse_boolean_key synth_boolean read_boolean_key ()\n\ninline_for_extraction let write_boolean_key : LL.leaf_writer_strong serialize_boolean_key =\n LL.write_enum_key boolean_repr_writer boolean_enum (_ by (LP.enum_repr_of_key_tac boolean_enum))", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 Parsers.Boolean.serialize_boolean_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.serializer32_of_leaf_writer_strong_constant_size", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.Boolean.boolean", "FStar.UInt8.t", "Parsers.Boolean.boolean_enum", "Parsers.Boolean.parse_boolean_key", "Parsers.Boolean.serialize_boolean_key", "Parsers.Boolean.write_boolean_key", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lserialize_boolean_key:LL.serializer32 serialize_boolean_key\nlet lserialize_boolean_key:LL.serializer32 serialize_boolean_key =", "completed_definiton": "LL.serializer32_of_leaf_writer_strong_constant_size write_boolean_key 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.boolean_reader", "original_source_type": "val boolean_reader: LL.leaf_reader boolean_parser", "source_type": "val boolean_reader: LL.leaf_reader boolean_parser", "source_definition": "let boolean_reader =\n [@inline_let] let _ = lemma_synth_boolean_inj () in\n LL.read_synth' parse_boolean_key synth_boolean read_boolean_key ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 119, "start_col": 1, "end_line": 120, "end_col": 67 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let boolean_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let boolean_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let boolean_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean = x\n\ninline_for_extraction let synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst boolean_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_boolean_inj () : Lemma\n (LP.synth_injective synth_boolean) = ()\n\nlet lemma_synth_boolean_inv () : Lemma\n (LP.synth_inverse synth_boolean synth_boolean_inv) = ()\n\nnoextract let parse_boolean_key : LP.parser _ (LP.enum_key boolean_enum) =\n LP.parse_enum_key boolean_repr_parser boolean_enum\n\nnoextract let serialize_boolean_key : LP.serializer parse_boolean_key =\n LP.serialize_enum_key boolean_repr_parser boolean_repr_serializer boolean_enum\n\nnoextract let boolean_parser : LP.parser _ boolean =\n lemma_synth_boolean_inj ();\n parse_boolean_key `LP.parse_synth` synth_boolean\n\nnoextract let boolean_serializer : LP.serializer boolean_parser =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LP.serialize_synth _ synth_boolean serialize_boolean_key synth_boolean_inv ()\n\nlet boolean_bytesize (x:boolean) : GTot nat = Seq.length (boolean_serializer x)\n\nlet boolean_bytesize_eq x = ()\n\nlet parse32_boolean_key : LS.parser32 parse_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac boolean_repr_parser32 boolean_enum)\n\nlet boolean_parser32 : LS.parser32 boolean_parser =\n lemma_synth_boolean_inj ();\n LS.parse32_synth _ synth_boolean (fun x->synth_boolean x) parse32_boolean_key ()\n\nlet serialize32_boolean_key : LS.serializer32 serialize_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n boolean_repr_serializer32 boolean_enum)\n\nlet boolean_serializer32 : LS.serializer32 boolean_serializer =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LS.serialize32_synth _ synth_boolean _ serialize32_boolean_key synth_boolean_inv (fun x->synth_boolean_inv x) ()\n\nlet boolean_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond boolean_serializer 1ul) in\n LSZ.size32_constant boolean_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_boolean_key : LL.validator parse_boolean_key =\n LL.mk_validate_enum_key boolean_repr_validator boolean_repr_reader boolean_enum\n\nlet boolean_validator =\n lemma_synth_boolean_inj ();\n LL.validate_synth validate_boolean_key synth_boolean ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_boolean_key : LL.leaf_reader parse_boolean_key =\n LL.mk_read_enum_key boolean_repr_reader boolean_enum", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader Parsers.Boolean.boolean_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.read_synth'", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.Boolean.boolean", "FStar.UInt8.t", "Parsers.Boolean.boolean_enum", "Parsers.Boolean.parse_boolean_key", "Parsers.Boolean.synth_boolean", "Parsers.Boolean.read_boolean_key", "Prims.unit", "Parsers.Boolean.lemma_synth_boolean_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val boolean_reader: LL.leaf_reader boolean_parser\nlet boolean_reader =", "completed_definiton": "[@@ inline_let ]let _ = lemma_synth_boolean_inj () in\nLL.read_synth' parse_boolean_key synth_boolean read_boolean_key ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.boolean_serializer", "original_source_type": "val boolean_serializer: LP.serializer boolean_parser", "source_type": "val boolean_serializer: LP.serializer boolean_parser", "source_definition": "let boolean_serializer : LP.serializer boolean_parser =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LP.serialize_synth _ synth_boolean serialize_boolean_key synth_boolean_inv ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 78, "start_col": 2, "end_line": 80, "end_col": 79 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let boolean_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let boolean_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let boolean_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean = x\n\ninline_for_extraction let synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst boolean_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_boolean_inj () : Lemma\n (LP.synth_injective synth_boolean) = ()\n\nlet lemma_synth_boolean_inv () : Lemma\n (LP.synth_inverse synth_boolean synth_boolean_inv) = ()\n\nnoextract let parse_boolean_key : LP.parser _ (LP.enum_key boolean_enum) =\n LP.parse_enum_key boolean_repr_parser boolean_enum\n\nnoextract let serialize_boolean_key : LP.serializer parse_boolean_key =\n LP.serialize_enum_key boolean_repr_parser boolean_repr_serializer boolean_enum\n\nnoextract let boolean_parser : LP.parser _ boolean =\n lemma_synth_boolean_inj ();\n parse_boolean_key `LP.parse_synth` synth_boolean", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.Boolean.boolean_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.Boolean.boolean", "FStar.UInt8.t", "Parsers.Boolean.boolean_enum", "Parsers.Boolean.parse_boolean_key", "Parsers.Boolean.synth_boolean", "Parsers.Boolean.serialize_boolean_key", "Parsers.Boolean.synth_boolean_inv", "Prims.unit", "Parsers.Boolean.lemma_synth_boolean_inv", "Parsers.Boolean.lemma_synth_boolean_inj", "LowParse.Spec.Base.serializer", "Parsers.Boolean.boolean_parser_kind", "Parsers.Boolean.boolean_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val boolean_serializer: LP.serializer boolean_parser\nlet boolean_serializer:LP.serializer boolean_parser =", "completed_definiton": "lemma_synth_boolean_inj ();\nlemma_synth_boolean_inv ();\nLP.serialize_synth _ synth_boolean serialize_boolean_key synth_boolean_inv ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.boolean_writer", "original_source_type": "val boolean_writer: LL.leaf_writer_strong boolean_serializer", "source_type": "val boolean_writer: LL.leaf_writer_strong boolean_serializer", "source_definition": "let boolean_writer =\n [@inline_let] let _ = lemma_synth_boolean_inj (); lemma_synth_boolean_inv () in\n LL.write_synth write_boolean_key synth_boolean synth_boolean_inv (fun x -> synth_boolean_inv x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 129, "start_col": 2, "end_line": 130, "end_col": 100 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let boolean_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let boolean_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let boolean_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean = x\n\ninline_for_extraction let synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst boolean_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_boolean_inj () : Lemma\n (LP.synth_injective synth_boolean) = ()\n\nlet lemma_synth_boolean_inv () : Lemma\n (LP.synth_inverse synth_boolean synth_boolean_inv) = ()\n\nnoextract let parse_boolean_key : LP.parser _ (LP.enum_key boolean_enum) =\n LP.parse_enum_key boolean_repr_parser boolean_enum\n\nnoextract let serialize_boolean_key : LP.serializer parse_boolean_key =\n LP.serialize_enum_key boolean_repr_parser boolean_repr_serializer boolean_enum\n\nnoextract let boolean_parser : LP.parser _ boolean =\n lemma_synth_boolean_inj ();\n parse_boolean_key `LP.parse_synth` synth_boolean\n\nnoextract let boolean_serializer : LP.serializer boolean_parser =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LP.serialize_synth _ synth_boolean serialize_boolean_key synth_boolean_inv ()\n\nlet boolean_bytesize (x:boolean) : GTot nat = Seq.length (boolean_serializer x)\n\nlet boolean_bytesize_eq x = ()\n\nlet parse32_boolean_key : LS.parser32 parse_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac boolean_repr_parser32 boolean_enum)\n\nlet boolean_parser32 : LS.parser32 boolean_parser =\n lemma_synth_boolean_inj ();\n LS.parse32_synth _ synth_boolean (fun x->synth_boolean x) parse32_boolean_key ()\n\nlet serialize32_boolean_key : LS.serializer32 serialize_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n boolean_repr_serializer32 boolean_enum)\n\nlet boolean_serializer32 : LS.serializer32 boolean_serializer =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LS.serialize32_synth _ synth_boolean _ serialize32_boolean_key synth_boolean_inv (fun x->synth_boolean_inv x) ()\n\nlet boolean_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond boolean_serializer 1ul) in\n LSZ.size32_constant boolean_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_boolean_key : LL.validator parse_boolean_key =\n LL.mk_validate_enum_key boolean_repr_validator boolean_repr_reader boolean_enum\n\nlet boolean_validator =\n lemma_synth_boolean_inj ();\n LL.validate_synth validate_boolean_key synth_boolean ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_boolean_key : LL.leaf_reader parse_boolean_key =\n LL.mk_read_enum_key boolean_repr_reader boolean_enum\n\nlet boolean_reader =\n [@inline_let] let _ = lemma_synth_boolean_inj () in\n LL.read_synth' parse_boolean_key synth_boolean read_boolean_key ()\n\ninline_for_extraction let write_boolean_key : LL.leaf_writer_strong serialize_boolean_key =\n LL.write_enum_key boolean_repr_writer boolean_enum (_ by (LP.enum_repr_of_key_tac boolean_enum))\n\ninline_for_extraction let lserialize_boolean_key : LL.serializer32 serialize_boolean_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_boolean_key 1ul ()", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong Parsers.Boolean.boolean_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.write_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.Boolean.boolean", "FStar.UInt8.t", "Parsers.Boolean.boolean_enum", "Parsers.Boolean.parse_boolean_key", "Parsers.Boolean.serialize_boolean_key", "Parsers.Boolean.write_boolean_key", "Parsers.Boolean.synth_boolean", "Parsers.Boolean.synth_boolean_inv", "Prims.eq2", "Prims.unit", "Parsers.Boolean.lemma_synth_boolean_inv", "Parsers.Boolean.lemma_synth_boolean_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val boolean_writer: LL.leaf_writer_strong boolean_serializer\nlet boolean_writer =", "completed_definiton": "[@@ inline_let ]let _ =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ()\nin\nLL.write_synth write_boolean_key synth_boolean synth_boolean_inv (fun x -> synth_boolean_inv x) ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.boolean_validator", "original_source_type": "val boolean_validator: LL.validator boolean_parser", "source_type": "val boolean_validator: LL.validator boolean_parser", "source_definition": "let boolean_validator =\n lemma_synth_boolean_inj ();\n LL.validate_synth validate_boolean_key synth_boolean ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 111, "start_col": 2, "end_line": 112, "end_col": 57 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let boolean_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let boolean_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let boolean_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean = x\n\ninline_for_extraction let synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst boolean_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_boolean_inj () : Lemma\n (LP.synth_injective synth_boolean) = ()\n\nlet lemma_synth_boolean_inv () : Lemma\n (LP.synth_inverse synth_boolean synth_boolean_inv) = ()\n\nnoextract let parse_boolean_key : LP.parser _ (LP.enum_key boolean_enum) =\n LP.parse_enum_key boolean_repr_parser boolean_enum\n\nnoextract let serialize_boolean_key : LP.serializer parse_boolean_key =\n LP.serialize_enum_key boolean_repr_parser boolean_repr_serializer boolean_enum\n\nnoextract let boolean_parser : LP.parser _ boolean =\n lemma_synth_boolean_inj ();\n parse_boolean_key `LP.parse_synth` synth_boolean\n\nnoextract let boolean_serializer : LP.serializer boolean_parser =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LP.serialize_synth _ synth_boolean serialize_boolean_key synth_boolean_inv ()\n\nlet boolean_bytesize (x:boolean) : GTot nat = Seq.length (boolean_serializer x)\n\nlet boolean_bytesize_eq x = ()\n\nlet parse32_boolean_key : LS.parser32 parse_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac boolean_repr_parser32 boolean_enum)\n\nlet boolean_parser32 : LS.parser32 boolean_parser =\n lemma_synth_boolean_inj ();\n LS.parse32_synth _ synth_boolean (fun x->synth_boolean x) parse32_boolean_key ()\n\nlet serialize32_boolean_key : LS.serializer32 serialize_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n boolean_repr_serializer32 boolean_enum)\n\nlet boolean_serializer32 : LS.serializer32 boolean_serializer =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LS.serialize32_synth _ synth_boolean _ serialize32_boolean_key synth_boolean_inv (fun x->synth_boolean_inv x) ()\n\nlet boolean_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond boolean_serializer 1ul) in\n LSZ.size32_constant boolean_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_boolean_key : LL.validator parse_boolean_key =\n LL.mk_validate_enum_key boolean_repr_validator boolean_repr_reader boolean_enum", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.Boolean.boolean_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.validate_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.Boolean.boolean", "FStar.UInt8.t", "Parsers.Boolean.boolean_enum", "Parsers.Boolean.parse_boolean_key", "Parsers.Boolean.validate_boolean_key", "Parsers.Boolean.synth_boolean", "Prims.unit", "Parsers.Boolean.lemma_synth_boolean_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val boolean_validator: LL.validator boolean_parser\nlet boolean_validator =", "completed_definiton": "lemma_synth_boolean_inj ();\nLL.validate_synth validate_boolean_key synth_boolean ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.boolean_parser32", "original_source_type": "val boolean_parser32: LS.parser32 boolean_parser", "source_type": "val boolean_parser32: LS.parser32 boolean_parser", "source_definition": "let boolean_parser32 : LS.parser32 boolean_parser =\n lemma_synth_boolean_inj ();\n LS.parse32_synth _ synth_boolean (fun x->synth_boolean x) parse32_boolean_key ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 90, "start_col": 2, "end_line": 91, "end_col": 82 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let boolean_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let boolean_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let boolean_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean = x\n\ninline_for_extraction let synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst boolean_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_boolean_inj () : Lemma\n (LP.synth_injective synth_boolean) = ()\n\nlet lemma_synth_boolean_inv () : Lemma\n (LP.synth_inverse synth_boolean synth_boolean_inv) = ()\n\nnoextract let parse_boolean_key : LP.parser _ (LP.enum_key boolean_enum) =\n LP.parse_enum_key boolean_repr_parser boolean_enum\n\nnoextract let serialize_boolean_key : LP.serializer parse_boolean_key =\n LP.serialize_enum_key boolean_repr_parser boolean_repr_serializer boolean_enum\n\nnoextract let boolean_parser : LP.parser _ boolean =\n lemma_synth_boolean_inj ();\n parse_boolean_key `LP.parse_synth` synth_boolean\n\nnoextract let boolean_serializer : LP.serializer boolean_parser =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LP.serialize_synth _ synth_boolean serialize_boolean_key synth_boolean_inv ()\n\nlet boolean_bytesize (x:boolean) : GTot nat = Seq.length (boolean_serializer x)\n\nlet boolean_bytesize_eq x = ()\n\nlet parse32_boolean_key : LS.parser32 parse_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac boolean_repr_parser32 boolean_enum)", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.Boolean.boolean_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.Boolean.boolean", "FStar.UInt8.t", "Parsers.Boolean.boolean_enum", "Parsers.Boolean.parse_boolean_key", "Parsers.Boolean.synth_boolean", "Prims.eq2", "Parsers.Boolean.parse32_boolean_key", "Prims.unit", "Parsers.Boolean.lemma_synth_boolean_inj", "LowParse.SLow.Base.parser32", "Parsers.Boolean.boolean_parser_kind", "Parsers.Boolean.boolean_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val boolean_parser32: LS.parser32 boolean_parser\nlet boolean_parser32:LS.parser32 boolean_parser =", "completed_definiton": "lemma_synth_boolean_inj ();\nLS.parse32_synth _ synth_boolean (fun x -> synth_boolean x) parse32_boolean_key ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.boolean_bytesize_eqn", "original_source_type": "val boolean_bytesize_eqn (x: boolean) : Lemma (boolean_bytesize x == 1) [SMTPat (boolean_bytesize x)]", "source_type": "val boolean_bytesize_eqn (x: boolean) : Lemma (boolean_bytesize x == 1) [SMTPat (boolean_bytesize x)]", "source_definition": "let boolean_bytesize_eqn x = boolean_bytesize_eq x; assert (FStar.Seq.length (LP.serialize boolean_serializer x) <= 1); assert (1 <= FStar.Seq.length (LP.serialize boolean_serializer x))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 134, "start_col": 29, "end_line": 134, "end_col": 186 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let boolean_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let boolean_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let boolean_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean = x\n\ninline_for_extraction let synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst boolean_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_boolean_inj () : Lemma\n (LP.synth_injective synth_boolean) = ()\n\nlet lemma_synth_boolean_inv () : Lemma\n (LP.synth_inverse synth_boolean synth_boolean_inv) = ()\n\nnoextract let parse_boolean_key : LP.parser _ (LP.enum_key boolean_enum) =\n LP.parse_enum_key boolean_repr_parser boolean_enum\n\nnoextract let serialize_boolean_key : LP.serializer parse_boolean_key =\n LP.serialize_enum_key boolean_repr_parser boolean_repr_serializer boolean_enum\n\nnoextract let boolean_parser : LP.parser _ boolean =\n lemma_synth_boolean_inj ();\n parse_boolean_key `LP.parse_synth` synth_boolean\n\nnoextract let boolean_serializer : LP.serializer boolean_parser =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LP.serialize_synth _ synth_boolean serialize_boolean_key synth_boolean_inv ()\n\nlet boolean_bytesize (x:boolean) : GTot nat = Seq.length (boolean_serializer x)\n\nlet boolean_bytesize_eq x = ()\n\nlet parse32_boolean_key : LS.parser32 parse_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac boolean_repr_parser32 boolean_enum)\n\nlet boolean_parser32 : LS.parser32 boolean_parser =\n lemma_synth_boolean_inj ();\n LS.parse32_synth _ synth_boolean (fun x->synth_boolean x) parse32_boolean_key ()\n\nlet serialize32_boolean_key : LS.serializer32 serialize_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n boolean_repr_serializer32 boolean_enum)\n\nlet boolean_serializer32 : LS.serializer32 boolean_serializer =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LS.serialize32_synth _ synth_boolean _ serialize32_boolean_key synth_boolean_inv (fun x->synth_boolean_inv x) ()\n\nlet boolean_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond boolean_serializer 1ul) in\n LSZ.size32_constant boolean_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_boolean_key : LL.validator parse_boolean_key =\n LL.mk_validate_enum_key boolean_repr_validator boolean_repr_reader boolean_enum\n\nlet boolean_validator =\n lemma_synth_boolean_inj ();\n LL.validate_synth validate_boolean_key synth_boolean ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_boolean_key : LL.leaf_reader parse_boolean_key =\n LL.mk_read_enum_key boolean_repr_reader boolean_enum\n\nlet boolean_reader =\n [@inline_let] let _ = lemma_synth_boolean_inj () in\n LL.read_synth' parse_boolean_key synth_boolean read_boolean_key ()\n\ninline_for_extraction let write_boolean_key : LL.leaf_writer_strong serialize_boolean_key =\n LL.write_enum_key boolean_repr_writer boolean_enum (_ by (LP.enum_repr_of_key_tac boolean_enum))\n\ninline_for_extraction let lserialize_boolean_key : LL.serializer32 serialize_boolean_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_boolean_key 1ul ()\n\nlet boolean_writer =\n [@inline_let] let _ = lemma_synth_boolean_inj (); lemma_synth_boolean_inv () in\n LL.write_synth write_boolean_key synth_boolean synth_boolean_inv (fun x -> synth_boolean_inv x) ()\n\nlet boolean_lserializer = LL.serializer32_of_leaf_writer_strong_constant_size boolean_writer 1ul ()", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.Boolean.boolean\n -> FStar.Pervasives.Lemma (ensures Parsers.Boolean.boolean_bytesize x == 1)\n [SMTPat (Parsers.Boolean.boolean_bytesize x)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.Boolean.boolean", "Prims._assert", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "Parsers.Boolean.boolean_parser_kind", "Parsers.Boolean.boolean_parser", "Parsers.Boolean.boolean_serializer", "Prims.unit", "Parsers.Boolean.boolean_bytesize_eq" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val boolean_bytesize_eqn (x: boolean) : Lemma (boolean_bytesize x == 1) [SMTPat (boolean_bytesize x)]\nlet boolean_bytesize_eqn x =", "completed_definiton": "boolean_bytesize_eq x;\nassert (FStar.Seq.length (LP.serialize boolean_serializer x) <= 1);\nassert (1 <= FStar.Seq.length (LP.serialize boolean_serializer x))", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fst", "name": "Parsers.Boolean.serialize32_boolean_key", "original_source_type": "val serialize32_boolean_key:LS.serializer32 serialize_boolean_key", "source_type": "val serialize32_boolean_key:LS.serializer32 serialize_boolean_key", "source_definition": "let serialize32_boolean_key : LS.serializer32 serialize_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n boolean_repr_serializer32 boolean_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 94, "start_col": 2, "end_line": 95, "end_col": 43 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let boolean_enum : LP.enum boolean U8.t =\n [@inline_let] let e = [\n B_false, 0z;\n B_true, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let boolean_repr_parser = LPI.parse_u8\n\nnoextract let boolean_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let boolean_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let boolean_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let boolean_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let boolean_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let boolean_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let boolean_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let boolean_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_boolean (x: LP.enum_key boolean_enum) : Tot boolean = x\n\ninline_for_extraction let synth_boolean_inv (x: boolean) : Tot (LP.enum_key boolean_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst boolean_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_boolean_inj () : Lemma\n (LP.synth_injective synth_boolean) = ()\n\nlet lemma_synth_boolean_inv () : Lemma\n (LP.synth_inverse synth_boolean synth_boolean_inv) = ()\n\nnoextract let parse_boolean_key : LP.parser _ (LP.enum_key boolean_enum) =\n LP.parse_enum_key boolean_repr_parser boolean_enum\n\nnoextract let serialize_boolean_key : LP.serializer parse_boolean_key =\n LP.serialize_enum_key boolean_repr_parser boolean_repr_serializer boolean_enum\n\nnoextract let boolean_parser : LP.parser _ boolean =\n lemma_synth_boolean_inj ();\n parse_boolean_key `LP.parse_synth` synth_boolean\n\nnoextract let boolean_serializer : LP.serializer boolean_parser =\n lemma_synth_boolean_inj ();\n lemma_synth_boolean_inv ();\n LP.serialize_synth _ synth_boolean serialize_boolean_key synth_boolean_inv ()\n\nlet boolean_bytesize (x:boolean) : GTot nat = Seq.length (boolean_serializer x)\n\nlet boolean_bytesize_eq x = ()\n\nlet parse32_boolean_key : LS.parser32 parse_boolean_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac boolean_repr_parser32 boolean_enum)\n\nlet boolean_parser32 : LS.parser32 boolean_parser =\n lemma_synth_boolean_inj ();\n LS.parse32_synth _ synth_boolean (fun x->synth_boolean x) parse32_boolean_key ()", "dependencies": { "source_file": "Parsers.Boolean.fst", "checked_file": "Parsers.Boolean.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.Boolean.serialize_boolean_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Enum.serialize32_enum_key_gen", "LowParse.Spec.Int.parse_u8_kind", "Parsers.Boolean.boolean", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "Parsers.Boolean.boolean_repr_serializer32", "Parsers.Boolean.boolean_enum", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Enum.enum_key", "Parsers.Boolean.parse_boolean_key", "Parsers.Boolean.serialize_boolean_key", "LowParse.Spec.Enum.enum_repr_of_key_cons'", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'", "LowParse.Spec.Enum.enum_tail'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize32_boolean_key:LS.serializer32 serialize_boolean_key\nlet serialize32_boolean_key:LS.serializer32 serialize_boolean_key =", "completed_definiton": "FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac boolean_repr_serializer32\n boolean_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_nonce.fst", "name": "Parsers.TicketContents13_nonce.ticketContents13_nonce_bytesize", "original_source_type": "val ticketContents13_nonce_bytesize (x:ticketContents13_nonce) : GTot nat", "source_type": "val ticketContents13_nonce_bytesize (x:ticketContents13_nonce) : GTot nat", "source_definition": "let ticketContents13_nonce_bytesize (x:ticketContents13_nonce) : GTot nat = Seq.length (ticketContents13_nonce_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_nonce.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 27, "start_col": 76, "end_line": 27, "end_col": 124 }, "file_context": "module Parsers.TicketContents13_nonce\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_nonce_parser = LP.parse_bounded_vlbytes 0 255\n\nnoextract let ticketContents13_nonce_serializer = LP.serialize_bounded_vlbytes 0 255", "dependencies": { "source_file": "Parsers.TicketContents13_nonce.fst", "checked_file": "Parsers.TicketContents13_nonce.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketContents13_nonce.ticketContents13_nonce -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketContents13_nonce.ticketContents13_nonce", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.TicketContents13_nonce.ticketContents13_nonce_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_nonce_bytesize (x:ticketContents13_nonce) : GTot nat\nlet ticketContents13_nonce_bytesize (x: ticketContents13_nonce) : GTot nat =", "completed_definiton": "Seq.length (ticketContents13_nonce_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_nonce.fst", "name": "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser32", "original_source_type": "val ticketContents13_nonce_parser32: LS.parser32 ticketContents13_nonce_parser", "source_type": "val ticketContents13_nonce_parser32: LS.parser32 ticketContents13_nonce_parser", "source_definition": "let ticketContents13_nonce_parser32 = LS.parse32_bounded_vlbytes 0 0ul 255 255ul", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_nonce.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 31, "start_col": 38, "end_line": 31, "end_col": 80 }, "file_context": "module Parsers.TicketContents13_nonce\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_nonce_parser = LP.parse_bounded_vlbytes 0 255\n\nnoextract let ticketContents13_nonce_serializer = LP.serialize_bounded_vlbytes 0 255\n\nlet ticketContents13_nonce_bytesize (x:ticketContents13_nonce) : GTot nat = Seq.length (ticketContents13_nonce_serializer x)\n\nlet ticketContents13_nonce_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.TicketContents13_nonce.fst", "checked_file": "Parsers.TicketContents13_nonce.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.TicketContents13_nonce.ticketContents13_nonce_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Bytes.parse32_bounded_vlbytes", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_nonce_parser32: LS.parser32 ticketContents13_nonce_parser\nlet ticketContents13_nonce_parser32 =", "completed_definiton": "LS.parse32_bounded_vlbytes 0 0ul 255 255ul", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_nonce.fst", "name": "Parsers.TicketContents13_nonce.ticketContents13_nonce_jumper", "original_source_type": "val ticketContents13_nonce_jumper: LL.jumper ticketContents13_nonce_parser", "source_type": "val ticketContents13_nonce_jumper: LL.jumper ticketContents13_nonce_parser", "source_definition": "let ticketContents13_nonce_jumper = LL.jump_bounded_vlbytes 0 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_nonce.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 39, "start_col": 36, "end_line": 39, "end_col": 65 }, "file_context": "module Parsers.TicketContents13_nonce\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_nonce_parser = LP.parse_bounded_vlbytes 0 255\n\nnoextract let ticketContents13_nonce_serializer = LP.serialize_bounded_vlbytes 0 255\n\nlet ticketContents13_nonce_bytesize (x:ticketContents13_nonce) : GTot nat = Seq.length (ticketContents13_nonce_serializer x)\n\nlet ticketContents13_nonce_bytesize_eq x = ()\n\nlet ticketContents13_nonce_parser32 = LS.parse32_bounded_vlbytes 0 0ul 255 255ul\n\nlet ticketContents13_nonce_serializer32 = LS.serialize32_bounded_vlbytes 0 255\n\nlet ticketContents13_nonce_size32 = LSZ.size32_bounded_vlbytes 0 255\n\nlet ticketContents13_nonce_validator = LL.validate_bounded_vlbytes 0 255", "dependencies": { "source_file": "Parsers.TicketContents13_nonce.fst", "checked_file": "Parsers.TicketContents13_nonce.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.TicketContents13_nonce.ticketContents13_nonce_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Bytes.jump_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_nonce_jumper: LL.jumper ticketContents13_nonce_parser\nlet ticketContents13_nonce_jumper =", "completed_definiton": "LL.jump_bounded_vlbytes 0 255", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_nonce.fst", "name": "Parsers.TicketContents13_nonce.ticketContents13_nonce_validator", "original_source_type": "val ticketContents13_nonce_validator: LL.validator ticketContents13_nonce_parser", "source_type": "val ticketContents13_nonce_validator: LL.validator ticketContents13_nonce_parser", "source_definition": "let ticketContents13_nonce_validator = LL.validate_bounded_vlbytes 0 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_nonce.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 37, "start_col": 39, "end_line": 37, "end_col": 72 }, "file_context": "module Parsers.TicketContents13_nonce\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_nonce_parser = LP.parse_bounded_vlbytes 0 255\n\nnoextract let ticketContents13_nonce_serializer = LP.serialize_bounded_vlbytes 0 255\n\nlet ticketContents13_nonce_bytesize (x:ticketContents13_nonce) : GTot nat = Seq.length (ticketContents13_nonce_serializer x)\n\nlet ticketContents13_nonce_bytesize_eq x = ()\n\nlet ticketContents13_nonce_parser32 = LS.parse32_bounded_vlbytes 0 0ul 255 255ul\n\nlet ticketContents13_nonce_serializer32 = LS.serialize32_bounded_vlbytes 0 255\n\nlet ticketContents13_nonce_size32 = LSZ.size32_bounded_vlbytes 0 255", "dependencies": { "source_file": "Parsers.TicketContents13_nonce.fst", "checked_file": "Parsers.TicketContents13_nonce.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.TicketContents13_nonce.ticketContents13_nonce_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Bytes.validate_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_nonce_validator: LL.validator ticketContents13_nonce_parser\nlet ticketContents13_nonce_validator =", "completed_definiton": "LL.validate_bounded_vlbytes 0 255", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_nonce.fst", "name": "Parsers.TicketContents13_nonce.ticketContents13_nonce_size32", "original_source_type": "val ticketContents13_nonce_size32: LSZ.size32 ticketContents13_nonce_serializer", "source_type": "val ticketContents13_nonce_size32: LSZ.size32 ticketContents13_nonce_serializer", "source_definition": "let ticketContents13_nonce_size32 = LSZ.size32_bounded_vlbytes 0 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_nonce.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 35, "start_col": 36, "end_line": 35, "end_col": 68 }, "file_context": "module Parsers.TicketContents13_nonce\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_nonce_parser = LP.parse_bounded_vlbytes 0 255\n\nnoextract let ticketContents13_nonce_serializer = LP.serialize_bounded_vlbytes 0 255\n\nlet ticketContents13_nonce_bytesize (x:ticketContents13_nonce) : GTot nat = Seq.length (ticketContents13_nonce_serializer x)\n\nlet ticketContents13_nonce_bytesize_eq x = ()\n\nlet ticketContents13_nonce_parser32 = LS.parse32_bounded_vlbytes 0 0ul 255 255ul\n\nlet ticketContents13_nonce_serializer32 = LS.serialize32_bounded_vlbytes 0 255", "dependencies": { "source_file": "Parsers.TicketContents13_nonce.fst", "checked_file": "Parsers.TicketContents13_nonce.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.TicketContents13_nonce.ticketContents13_nonce_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Bytes.size32_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_nonce_size32: LSZ.size32 ticketContents13_nonce_serializer\nlet ticketContents13_nonce_size32 =", "completed_definiton": "LSZ.size32_bounded_vlbytes 0 255", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_nonce.fst", "name": "Parsers.TicketContents13_nonce.ticketContents13_nonce_serializer", "original_source_type": "val ticketContents13_nonce_serializer: LP.serializer ticketContents13_nonce_parser", "source_type": "val ticketContents13_nonce_serializer: LP.serializer ticketContents13_nonce_parser", "source_definition": "let ticketContents13_nonce_serializer = LP.serialize_bounded_vlbytes 0 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_nonce.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 25, "start_col": 50, "end_line": 25, "end_col": 84 }, "file_context": "module Parsers.TicketContents13_nonce\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_nonce_parser = LP.parse_bounded_vlbytes 0 255", "dependencies": { "source_file": "Parsers.TicketContents13_nonce.fst", "checked_file": "Parsers.TicketContents13_nonce.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.TicketContents13_nonce.ticketContents13_nonce_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Bytes.serialize_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_nonce_serializer: LP.serializer ticketContents13_nonce_parser\nlet ticketContents13_nonce_serializer =", "completed_definiton": "LP.serialize_bounded_vlbytes 0 255", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_nonce.fst", "name": "Parsers.TicketContents13_nonce.ticketContents13_nonce_serializer32", "original_source_type": "val ticketContents13_nonce_serializer32: LS.serializer32 ticketContents13_nonce_serializer", "source_type": "val ticketContents13_nonce_serializer32: LS.serializer32 ticketContents13_nonce_serializer", "source_definition": "let ticketContents13_nonce_serializer32 = LS.serialize32_bounded_vlbytes 0 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_nonce.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 33, "start_col": 42, "end_line": 33, "end_col": 78 }, "file_context": "module Parsers.TicketContents13_nonce\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_nonce_parser = LP.parse_bounded_vlbytes 0 255\n\nnoextract let ticketContents13_nonce_serializer = LP.serialize_bounded_vlbytes 0 255\n\nlet ticketContents13_nonce_bytesize (x:ticketContents13_nonce) : GTot nat = Seq.length (ticketContents13_nonce_serializer x)\n\nlet ticketContents13_nonce_bytesize_eq x = ()\n\nlet ticketContents13_nonce_parser32 = LS.parse32_bounded_vlbytes 0 0ul 255 255ul", "dependencies": { "source_file": "Parsers.TicketContents13_nonce.fst", "checked_file": "Parsers.TicketContents13_nonce.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.TicketContents13_nonce.ticketContents13_nonce_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Bytes.serialize32_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_nonce_serializer32: LS.serializer32 ticketContents13_nonce_serializer\nlet ticketContents13_nonce_serializer32 =", "completed_definiton": "LS.serialize32_bounded_vlbytes 0 255", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_nonce.fst", "name": "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser", "original_source_type": "val ticketContents13_nonce_parser: LP.parser ticketContents13_nonce_parser_kind ticketContents13_nonce", "source_type": "val ticketContents13_nonce_parser: LP.parser ticketContents13_nonce_parser_kind ticketContents13_nonce", "source_definition": "let ticketContents13_nonce_parser = LP.parse_bounded_vlbytes 0 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_nonce.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 23, "start_col": 46, "end_line": 23, "end_col": 76 }, "file_context": "module Parsers.TicketContents13_nonce\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"", "dependencies": { "source_file": "Parsers.TicketContents13_nonce.fst", "checked_file": "Parsers.TicketContents13_nonce.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind\n Parsers.TicketContents13_nonce.ticketContents13_nonce", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Bytes.parse_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_nonce_parser: LP.parser ticketContents13_nonce_parser_kind ticketContents13_nonce\nlet ticketContents13_nonce_parser =", "completed_definiton": "LP.parse_bounded_vlbytes 0 255", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_nonce.fst", "name": "Parsers.TicketContents13_nonce.ticketContents13_nonce_bytesize_eqn", "original_source_type": "val ticketContents13_nonce_bytesize_eqn (x: ticketContents13_nonce) : Lemma (ticketContents13_nonce_bytesize x == 1 + BY.length x) [SMTPat (ticketContents13_nonce_bytesize x)]", "source_type": "val ticketContents13_nonce_bytesize_eqn (x: ticketContents13_nonce) : Lemma (ticketContents13_nonce_bytesize x == 1 + BY.length x) [SMTPat (ticketContents13_nonce_bytesize x)]", "source_definition": "let ticketContents13_nonce_bytesize_eqn x = LP.length_serialize_bounded_vlbytes 0 255 x", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_nonce.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 41, "start_col": 44, "end_line": 41, "end_col": 87 }, "file_context": "module Parsers.TicketContents13_nonce\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_nonce_parser = LP.parse_bounded_vlbytes 0 255\n\nnoextract let ticketContents13_nonce_serializer = LP.serialize_bounded_vlbytes 0 255\n\nlet ticketContents13_nonce_bytesize (x:ticketContents13_nonce) : GTot nat = Seq.length (ticketContents13_nonce_serializer x)\n\nlet ticketContents13_nonce_bytesize_eq x = ()\n\nlet ticketContents13_nonce_parser32 = LS.parse32_bounded_vlbytes 0 0ul 255 255ul\n\nlet ticketContents13_nonce_serializer32 = LS.serialize32_bounded_vlbytes 0 255\n\nlet ticketContents13_nonce_size32 = LSZ.size32_bounded_vlbytes 0 255\n\nlet ticketContents13_nonce_validator = LL.validate_bounded_vlbytes 0 255\n\nlet ticketContents13_nonce_jumper = LL.jump_bounded_vlbytes 0 255", "dependencies": { "source_file": "Parsers.TicketContents13_nonce.fst", "checked_file": "Parsers.TicketContents13_nonce.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketContents13_nonce.ticketContents13_nonce\n -> FStar.Pervasives.Lemma\n (ensures\n Parsers.TicketContents13_nonce.ticketContents13_nonce_bytesize x == 1 + FStar.Bytes.length x\n ) [SMTPat (Parsers.TicketContents13_nonce.ticketContents13_nonce_bytesize x)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketContents13_nonce.ticketContents13_nonce", "LowParse.Spec.Bytes.length_serialize_bounded_vlbytes", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_nonce_bytesize_eqn (x: ticketContents13_nonce) : Lemma (ticketContents13_nonce_bytesize x == 1 + BY.length x) [SMTPat (ticketContents13_nonce_bytesize x)]\nlet ticketContents13_nonce_bytesize_eqn x =", "completed_definiton": "LP.length_serialize_bounded_vlbytes 0 255 x", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_nonce.fst", "name": "Parsers.TicketContents13_nonce.ticketContents13_nonce_length", "original_source_type": "val ticketContents13_nonce_length (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid ticketContents13_nonce_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents ticketContents13_nonce_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v pos + 1 + U32.v res == U32.v (LL.get_valid_pos ticketContents13_nonce_parser h input pos) /\\\n res == BY.len x /\\\n LL.bytes_of_slice_from_to h input (pos `U32.add` 1ul) ((pos `U32.add` 1ul) `U32.add` res) == BY.reveal x\n ))", "source_type": "val ticketContents13_nonce_length (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid ticketContents13_nonce_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents ticketContents13_nonce_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v pos + 1 + U32.v res == U32.v (LL.get_valid_pos ticketContents13_nonce_parser h input pos) /\\\n res == BY.len x /\\\n LL.bytes_of_slice_from_to h input (pos `U32.add` 1ul) ((pos `U32.add` 1ul) `U32.add` res) == BY.reveal x\n ))", "source_definition": "let ticketContents13_nonce_length #_ #_ input pos =\n [@inline_let] let _ = assert_norm (ticketContents13_nonce == LP.parse_bounded_vlbytes_t 0 255) in\n LL.bounded_vlbytes_payload_length 0 255 input pos", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_nonce.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 44, "start_col": 2, "end_line": 45, "end_col": 51 }, "file_context": "module Parsers.TicketContents13_nonce\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_nonce_parser = LP.parse_bounded_vlbytes 0 255\n\nnoextract let ticketContents13_nonce_serializer = LP.serialize_bounded_vlbytes 0 255\n\nlet ticketContents13_nonce_bytesize (x:ticketContents13_nonce) : GTot nat = Seq.length (ticketContents13_nonce_serializer x)\n\nlet ticketContents13_nonce_bytesize_eq x = ()\n\nlet ticketContents13_nonce_parser32 = LS.parse32_bounded_vlbytes 0 0ul 255 255ul\n\nlet ticketContents13_nonce_serializer32 = LS.serialize32_bounded_vlbytes 0 255\n\nlet ticketContents13_nonce_size32 = LSZ.size32_bounded_vlbytes 0 255\n\nlet ticketContents13_nonce_validator = LL.validate_bounded_vlbytes 0 255\n\nlet ticketContents13_nonce_jumper = LL.jump_bounded_vlbytes 0 255\n\nlet ticketContents13_nonce_bytesize_eqn x = LP.length_serialize_bounded_vlbytes 0 255 x", "dependencies": { "source_file": "Parsers.TicketContents13_nonce.fst", "checked_file": "Parsers.TicketContents13_nonce.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "input: LowParse.Slice.slice rrel rel -> pos: FStar.UInt32.t\n -> FStar.HyperStack.ST.Stack FStar.UInt32.t", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "LowParse.Low.Bytes.bounded_vlbytes_payload_length", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_nonce_length (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid ticketContents13_nonce_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents ticketContents13_nonce_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v pos + 1 + U32.v res == U32.v (LL.get_valid_pos ticketContents13_nonce_parser h input pos) /\\\n res == BY.len x /\\\n LL.bytes_of_slice_from_to h input (pos `U32.add` 1ul) ((pos `U32.add` 1ul) `U32.add` res) == BY.reveal x\n ))\nlet ticketContents13_nonce_length #_ #_ input pos =", "completed_definiton": "[@@ inline_let ]let _ = assert_norm (ticketContents13_nonce == LP.parse_bounded_vlbytes_t 0 255) in\nLL.bounded_vlbytes_payload_length 0 255 input pos", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_nonce.fst", "name": "Parsers.TicketContents13_nonce.ticketContents13_nonce_finalize", "original_source_type": "val ticketContents13_nonce_finalize (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) (len: U32.t) : HST.Stack U32.t\n\n (requires (fun h ->\n LL.live_slice h input /\\\n 0 <= U32.v len /\\ U32.v len <= 255 /\\\n U32.v pos + 1 + U32.v len <= U32.v input.LL.len /\\\n LL.writable input.LL.base (U32.v pos) (U32.v pos + 1) h\n ))\n (ensures (fun h pos' h' ->\n let pos_payload = pos `U32.add` 1ul in\n B.modifies (LL.loc_slice_from_to input pos pos_payload) h h' /\\\n LL.valid_content_pos ticketContents13_nonce_parser h' input pos (BY.hide (LL.bytes_of_slice_from_to h input pos_payload (pos_payload `U32.add` len))) pos' /\\\n U32.v pos' == U32.v pos_payload + U32.v len\n ))", "source_type": "val ticketContents13_nonce_finalize (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) (len: U32.t) : HST.Stack U32.t\n\n (requires (fun h ->\n LL.live_slice h input /\\\n 0 <= U32.v len /\\ U32.v len <= 255 /\\\n U32.v pos + 1 + U32.v len <= U32.v input.LL.len /\\\n LL.writable input.LL.base (U32.v pos) (U32.v pos + 1) h\n ))\n (ensures (fun h pos' h' ->\n let pos_payload = pos `U32.add` 1ul in\n B.modifies (LL.loc_slice_from_to input pos pos_payload) h h' /\\\n LL.valid_content_pos ticketContents13_nonce_parser h' input pos (BY.hide (LL.bytes_of_slice_from_to h input pos_payload (pos_payload `U32.add` len))) pos' /\\\n U32.v pos' == U32.v pos_payload + U32.v len\n ))", "source_definition": "let ticketContents13_nonce_finalize #_ #_ input pos len =\n [@inline_let] let _ = assert_norm (ticketContents13_nonce == LP.parse_bounded_vlbytes_t 0 255) in\n LL.finalize_bounded_vlbytes 0 255 input pos len", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_nonce.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 48, "start_col": 2, "end_line": 49, "end_col": 49 }, "file_context": "module Parsers.TicketContents13_nonce\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_nonce_parser = LP.parse_bounded_vlbytes 0 255\n\nnoextract let ticketContents13_nonce_serializer = LP.serialize_bounded_vlbytes 0 255\n\nlet ticketContents13_nonce_bytesize (x:ticketContents13_nonce) : GTot nat = Seq.length (ticketContents13_nonce_serializer x)\n\nlet ticketContents13_nonce_bytesize_eq x = ()\n\nlet ticketContents13_nonce_parser32 = LS.parse32_bounded_vlbytes 0 0ul 255 255ul\n\nlet ticketContents13_nonce_serializer32 = LS.serialize32_bounded_vlbytes 0 255\n\nlet ticketContents13_nonce_size32 = LSZ.size32_bounded_vlbytes 0 255\n\nlet ticketContents13_nonce_validator = LL.validate_bounded_vlbytes 0 255\n\nlet ticketContents13_nonce_jumper = LL.jump_bounded_vlbytes 0 255\n\nlet ticketContents13_nonce_bytesize_eqn x = LP.length_serialize_bounded_vlbytes 0 255 x\n\nlet ticketContents13_nonce_length #_ #_ input pos =\n [@inline_let] let _ = assert_norm (ticketContents13_nonce == LP.parse_bounded_vlbytes_t 0 255) in\n LL.bounded_vlbytes_payload_length 0 255 input pos", "dependencies": { "source_file": "Parsers.TicketContents13_nonce.fst", "checked_file": "Parsers.TicketContents13_nonce.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "input: LowParse.Slice.slice rrel rel -> pos: FStar.UInt32.t -> len: FStar.UInt32.t\n -> FStar.HyperStack.ST.Stack FStar.UInt32.t", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "LowParse.Low.Bytes.finalize_bounded_vlbytes", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_nonce_finalize (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) (len: U32.t) : HST.Stack U32.t\n\n (requires (fun h ->\n LL.live_slice h input /\\\n 0 <= U32.v len /\\ U32.v len <= 255 /\\\n U32.v pos + 1 + U32.v len <= U32.v input.LL.len /\\\n LL.writable input.LL.base (U32.v pos) (U32.v pos + 1) h\n ))\n (ensures (fun h pos' h' ->\n let pos_payload = pos `U32.add` 1ul in\n B.modifies (LL.loc_slice_from_to input pos pos_payload) h h' /\\\n LL.valid_content_pos ticketContents13_nonce_parser h' input pos (BY.hide (LL.bytes_of_slice_from_to h input pos_payload (pos_payload `U32.add` len))) pos' /\\\n U32.v pos' == U32.v pos_payload + U32.v len\n ))\nlet ticketContents13_nonce_finalize #_ #_ input pos len =", "completed_definiton": "[@@ inline_let ]let _ = assert_norm (ticketContents13_nonce == LP.parse_bounded_vlbytes_t 0 255) in\nLL.finalize_bounded_vlbytes 0 255 input pos len", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_context.fsti", "name": "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "original_source_type": "", "source_type": "val hkdfLabel_context_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let hkdfLabel_context_parser_kind = LP.strong_parser_kind 1 256 None", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_context.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 25, "start_col": 68, "end_line": 25, "end_col": 100 }, "file_context": "module Parsers.HKDF.HkdfLabel_context\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ninline_for_extraction noextract let min_len = 0\ninline_for_extraction noextract let max_len = 255\ntype hkdfLabel_context = b:bytes{0 <= length b /\\ length b <= 255}", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_context.fsti", "checked_file": "Parsers.HKDF.HkdfLabel_context.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let hkdfLabel_context_parser_kind =", "completed_definiton": "LP.strong_parser_kind 1 256 None", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_context.fsti", "name": "Parsers.HKDF.HkdfLabel_context.max_len", "original_source_type": "", "source_type": "val max_len : Prims.int", "source_definition": "let max_len = 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_context.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 22, "start_col": 46, "end_line": 22, "end_col": 49 }, "file_context": "module Parsers.HKDF.HkdfLabel_context\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_context.fsti", "checked_file": "Parsers.HKDF.HkdfLabel_context.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.int", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let max_len =", "completed_definiton": "255", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_context.fsti", "name": "Parsers.HKDF.HkdfLabel_context.min_len", "original_source_type": "", "source_type": "val min_len : Prims.int", "source_definition": "let min_len = 0", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_context.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 21, "start_col": 46, "end_line": 21, "end_col": 47 }, "file_context": "module Parsers.HKDF.HkdfLabel_context\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_context.fsti", "checked_file": "Parsers.HKDF.HkdfLabel_context.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.int", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let min_len =", "completed_definiton": "0", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fsti", "name": "Parsers.Alert.clens_alert_description", "original_source_type": "val clens_alert_description:LL.clens alert alertDescription", "source_type": "val clens_alert_description:LL.clens alert alertDescription", "source_definition": "let clens_alert_description : LL.clens alert alertDescription = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.description);\n}", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 60, "start_col": 2, "end_line": 61, "end_col": 42 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.AlertLevel\nopen Parsers.AlertDescription\n\ntype alert = {\n level : alertLevel;\n description : alertDescription;\n}\n\ninline_for_extraction noextract let alert_parser_kind = LP.strong_parser_kind 2 2 None\n\nnoextract val alert_parser: LP.parser alert_parser_kind alert\n\nnoextract val alert_serializer: LP.serializer alert_parser\n\nnoextract val alert_bytesize (x:alert) : GTot nat\n\nnoextract val alert_bytesize_eq (x:alert) : Lemma (alert_bytesize x == Seq.length (LP.serialize alert_serializer x))\n\nval alert_parser32: LS.parser32 alert_parser\n\nval alert_serializer32: LS.serializer32 alert_serializer\n\nval alert_size32: LSZ.size32 alert_serializer\n\nval alert_validator: LL.validator alert_parser\n\nlet alert_jumper: LL.jumper alert_parser = LL.jump_constant_size alert_parser 2ul ()\n\nval alert_reader : LL.leaf_reader alert_parser\n\nval alert_lserializer : LL.serializer32 alert_serializer\n\nval alert_bytesize_eqn (x: alert) : Lemma (alert_bytesize x == (alertLevel_bytesize (x.level)) + (alertDescription_bytesize (x.description))) [SMTPat (alert_bytesize x)]\n\nnoextract let clens_alert_level : LL.clens alert alertLevel = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.level);\n}", "dependencies": { "source_file": "Parsers.Alert.fsti", "checked_file": "Parsers.Alert.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.AlertLevel.fsti.checked", "Parsers.AlertDescription.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.Alert.alert Parsers.AlertDescription.alertDescription", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.Mkclens", "Parsers.Alert.alert", "Parsers.AlertDescription.alertDescription", "Prims.l_True", "Parsers.Alert.__proj__Mkalert__item__description" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val clens_alert_description:LL.clens alert alertDescription\nlet clens_alert_description:LL.clens alert alertDescription =", "completed_definiton": "{ LL.clens_cond = (fun _ -> True); LL.clens_get = (fun x -> x.description) }", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fsti", "name": "Parsers.Alert.alert_parser_kind", "original_source_type": "", "source_type": "val alert_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let alert_parser_kind = LP.strong_parser_kind 2 2 None", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 28, "start_col": 56, "end_line": 28, "end_col": 86 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.AlertLevel\nopen Parsers.AlertDescription\n\ntype alert = {\n level : alertLevel;\n description : alertDescription;\n}", "dependencies": { "source_file": "Parsers.Alert.fsti", "checked_file": "Parsers.Alert.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.AlertLevel.fsti.checked", "Parsers.AlertDescription.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alert_parser_kind =", "completed_definiton": "LP.strong_parser_kind 2 2 None", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fsti", "name": "Parsers.Alert.clens_alert_level", "original_source_type": "val clens_alert_level:LL.clens alert alertLevel", "source_type": "val clens_alert_level:LL.clens alert alertLevel", "source_definition": "let clens_alert_level : LL.clens alert alertLevel = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.level);\n}", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 55, "start_col": 2, "end_line": 56, "end_col": 36 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.AlertLevel\nopen Parsers.AlertDescription\n\ntype alert = {\n level : alertLevel;\n description : alertDescription;\n}\n\ninline_for_extraction noextract let alert_parser_kind = LP.strong_parser_kind 2 2 None\n\nnoextract val alert_parser: LP.parser alert_parser_kind alert\n\nnoextract val alert_serializer: LP.serializer alert_parser\n\nnoextract val alert_bytesize (x:alert) : GTot nat\n\nnoextract val alert_bytesize_eq (x:alert) : Lemma (alert_bytesize x == Seq.length (LP.serialize alert_serializer x))\n\nval alert_parser32: LS.parser32 alert_parser\n\nval alert_serializer32: LS.serializer32 alert_serializer\n\nval alert_size32: LSZ.size32 alert_serializer\n\nval alert_validator: LL.validator alert_parser\n\nlet alert_jumper: LL.jumper alert_parser = LL.jump_constant_size alert_parser 2ul ()\n\nval alert_reader : LL.leaf_reader alert_parser\n\nval alert_lserializer : LL.serializer32 alert_serializer\n\nval alert_bytesize_eqn (x: alert) : Lemma (alert_bytesize x == (alertLevel_bytesize (x.level)) + (alertDescription_bytesize (x.description))) [SMTPat (alert_bytesize x)]", "dependencies": { "source_file": "Parsers.Alert.fsti", "checked_file": "Parsers.Alert.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.AlertLevel.fsti.checked", "Parsers.AlertDescription.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.Alert.alert Parsers.AlertLevel.alertLevel", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.Mkclens", "Parsers.Alert.alert", "Parsers.AlertLevel.alertLevel", "Prims.l_True", "Parsers.Alert.__proj__Mkalert__item__level" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val clens_alert_level:LL.clens alert alertLevel\nlet clens_alert_level:LL.clens alert alertLevel =", "completed_definiton": "{ LL.clens_cond = (fun _ -> True); LL.clens_get = (fun x -> x.level) }", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fsti", "name": "Parsers.Alert.alert_jumper", "original_source_type": "val alert_jumper:LL.jumper alert_parser", "source_type": "val alert_jumper:LL.jumper alert_parser", "source_definition": "let alert_jumper: LL.jumper alert_parser = LL.jump_constant_size alert_parser 2ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 46, "start_col": 43, "end_line": 46, "end_col": 84 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.AlertLevel\nopen Parsers.AlertDescription\n\ntype alert = {\n level : alertLevel;\n description : alertDescription;\n}\n\ninline_for_extraction noextract let alert_parser_kind = LP.strong_parser_kind 2 2 None\n\nnoextract val alert_parser: LP.parser alert_parser_kind alert\n\nnoextract val alert_serializer: LP.serializer alert_parser\n\nnoextract val alert_bytesize (x:alert) : GTot nat\n\nnoextract val alert_bytesize_eq (x:alert) : Lemma (alert_bytesize x == Seq.length (LP.serialize alert_serializer x))\n\nval alert_parser32: LS.parser32 alert_parser\n\nval alert_serializer32: LS.serializer32 alert_serializer\n\nval alert_size32: LSZ.size32 alert_serializer\n\nval alert_validator: LL.validator alert_parser", "dependencies": { "source_file": "Parsers.Alert.fsti", "checked_file": "Parsers.Alert.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.AlertLevel.fsti.checked", "Parsers.AlertDescription.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.Alert.alert_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.jump_constant_size", "Parsers.Alert.alert_parser_kind", "Parsers.Alert.alert", "Parsers.Alert.alert_parser", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alert_jumper:LL.jumper alert_parser\nlet alert_jumper:LL.jumper alert_parser =", "completed_definiton": "LL.jump_constant_size alert_parser 2ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.alertDescription_repr_size32", "original_source_type": "", "source_type": "val alertDescription_repr_size32 : LowParse.SLow.Base.size32 LowParse.Spec.Int.serialize_u8", "source_definition": "let alertDescription_repr_size32 = LSZ.size32_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 68, "start_col": 67, "end_line": 68, "end_col": 80 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 LowParse.Spec.Int.serialize_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.size32_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alertDescription_repr_size32 =", "completed_definiton": "LSZ.size32_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.alertDescription_repr_reader", "original_source_type": "", "source_type": "val alertDescription_repr_reader : LowParse.Low.Base.leaf_reader LowParse.Spec.Int.parse_u8", "source_definition": "let alertDescription_repr_reader = LL.read_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 74, "start_col": 67, "end_line": 74, "end_col": 77 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertDescription_repr_jumper = LL.jump_u8", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.read_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alertDescription_repr_reader =", "completed_definiton": "LL.read_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.alertDescription_repr_parser", "original_source_type": "", "source_type": "val alertDescription_repr_parser : LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u8_kind FStar.UInt8.t", "source_definition": "let alertDescription_repr_parser = LPI.parse_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 60, "start_col": 45, "end_line": 60, "end_col": 57 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u8_kind FStar.UInt8.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Int.parse_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alertDescription_repr_parser =", "completed_definiton": "LPI.parse_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.alertDescription_bytesize", "original_source_type": "val alertDescription_bytesize (x:alertDescription) : GTot nat", "source_type": "val alertDescription_bytesize (x:alertDescription) : GTot nat", "source_definition": "let alertDescription_bytesize (x:alertDescription) : GTot nat = Seq.length (alertDescription_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 107, "start_col": 64, "end_line": 107, "end_col": 106 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertDescription_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertDescription_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertDescription_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription = x\n\ninline_for_extraction let synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertDescription_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertDescription_inj () : Lemma\n (LP.synth_injective synth_alertDescription) = ()\n\nlet lemma_synth_alertDescription_inv () : Lemma\n (LP.synth_inverse synth_alertDescription synth_alertDescription_inv) = ()\n\nnoextract let parse_alertDescription_key : LP.parser _ (LP.enum_key alertDescription_enum) =\n LP.parse_enum_key alertDescription_repr_parser alertDescription_enum\n\nnoextract let serialize_alertDescription_key : LP.serializer parse_alertDescription_key =\n LP.serialize_enum_key alertDescription_repr_parser alertDescription_repr_serializer alertDescription_enum\n\nnoextract let alertDescription_parser : LP.parser _ alertDescription =\n lemma_synth_alertDescription_inj ();\n parse_alertDescription_key `LP.parse_synth` synth_alertDescription\n\nnoextract let alertDescription_serializer : LP.serializer alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LP.serialize_synth _ synth_alertDescription serialize_alertDescription_key synth_alertDescription_inv ()", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.AlertDescription.alertDescription -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.AlertDescription.alertDescription", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.AlertDescription.alertDescription_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertDescription_bytesize (x:alertDescription) : GTot nat\nlet alertDescription_bytesize (x: alertDescription) : GTot nat =", "completed_definiton": "Seq.length (alertDescription_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.alertDescription_repr_serializer32", "original_source_type": "", "source_type": "val alertDescription_repr_serializer32 : LowParse.SLow.Base.serializer32 LowParse.Spec.Int.serialize_u8", "source_definition": "let alertDescription_repr_serializer32 = LS.serialize32_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 66, "start_col": 73, "end_line": 66, "end_col": 90 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 LowParse.Spec.Int.serialize_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.serialize32_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alertDescription_repr_serializer32 =", "completed_definiton": "LS.serialize32_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.alertDescription_repr_writer", "original_source_type": "", "source_type": "val alertDescription_repr_writer : LowParse.Low.Base.leaf_writer_strong LowParse.Spec.Int.serialize_u8", "source_definition": "let alertDescription_repr_writer = LL.write_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 76, "start_col": 67, "end_line": 76, "end_col": 78 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertDescription_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertDescription_repr_reader = LL.read_u8", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong LowParse.Spec.Int.serialize_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.write_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alertDescription_repr_writer =", "completed_definiton": "LL.write_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.alertDescription_repr_validator", "original_source_type": "", "source_type": "val alertDescription_repr_validator : LowParse.Low.Base.validator LowParse.Spec.Int.parse_u8", "source_definition": "let alertDescription_repr_validator = (LL.validate_u8 ())", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 70, "start_col": 70, "end_line": 70, "end_col": 89 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.validate_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alertDescription_repr_validator =", "completed_definiton": "(LL.validate_u8 ())", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.alertDescription_repr_jumper", "original_source_type": "", "source_type": "val alertDescription_repr_jumper : LowParse.Low.Base.jumper LowParse.Spec.Int.parse_u8", "source_definition": "let alertDescription_repr_jumper = LL.jump_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 72, "start_col": 67, "end_line": 72, "end_col": 77 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.jump_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alertDescription_repr_jumper =", "completed_definiton": "LL.jump_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.alertDescription_repr_parser32", "original_source_type": "", "source_type": "val alertDescription_repr_parser32 : LowParse.SLow.Base.parser32 LowParse.Spec.Int.parse_u8", "source_definition": "let alertDescription_repr_parser32 = LS.parse32_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 64, "start_col": 69, "end_line": 64, "end_col": 82 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.parse32_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alertDescription_repr_parser32 =", "completed_definiton": "LS.parse32_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.alertDescription_repr_serializer", "original_source_type": "", "source_type": "val alertDescription_repr_serializer : LowParse.Spec.Base.serializer LowParse.Spec.Int.parse_u8", "source_definition": "let alertDescription_repr_serializer = LPI.serialize_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 62, "start_col": 49, "end_line": 62, "end_col": 65 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Int.serialize_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alertDescription_repr_serializer =", "completed_definiton": "LPI.serialize_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.synth_alertDescription", "original_source_type": "val synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription", "source_type": "val synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription", "source_definition": "let synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription = x", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 78, "start_col": 113, "end_line": 78, "end_col": 114 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertDescription_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertDescription_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertDescription_repr_writer = LL.write_u8", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: LowParse.Spec.Enum.enum_key Parsers.AlertDescription.alertDescription_enum\n -> Parsers.AlertDescription.alertDescription", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.enum_key", "Parsers.AlertDescription.alertDescription", "FStar.UInt8.t", "Parsers.AlertDescription.alertDescription_enum" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription\nlet synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription =", "completed_definiton": "x", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.validate_alertDescription_key", "original_source_type": "val validate_alertDescription_key:LL.validator parse_alertDescription_key", "source_type": "val validate_alertDescription_key:LL.validator parse_alertDescription_key", "source_definition": "let validate_alertDescription_key : LL.validator parse_alertDescription_key =\n LL.mk_validate_enum_key alertDescription_repr_validator alertDescription_repr_reader alertDescription_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 133, "start_col": 4, "end_line": 133, "end_col": 110 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertDescription_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertDescription_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertDescription_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription = x\n\ninline_for_extraction let synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertDescription_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertDescription_inj () : Lemma\n (LP.synth_injective synth_alertDescription) = ()\n\nlet lemma_synth_alertDescription_inv () : Lemma\n (LP.synth_inverse synth_alertDescription synth_alertDescription_inv) = ()\n\nnoextract let parse_alertDescription_key : LP.parser _ (LP.enum_key alertDescription_enum) =\n LP.parse_enum_key alertDescription_repr_parser alertDescription_enum\n\nnoextract let serialize_alertDescription_key : LP.serializer parse_alertDescription_key =\n LP.serialize_enum_key alertDescription_repr_parser alertDescription_repr_serializer alertDescription_enum\n\nnoextract let alertDescription_parser : LP.parser _ alertDescription =\n lemma_synth_alertDescription_inj ();\n parse_alertDescription_key `LP.parse_synth` synth_alertDescription\n\nnoextract let alertDescription_serializer : LP.serializer alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LP.serialize_synth _ synth_alertDescription serialize_alertDescription_key synth_alertDescription_inv ()\n\nlet alertDescription_bytesize (x:alertDescription) : GTot nat = Seq.length (alertDescription_serializer x)\n\nlet alertDescription_bytesize_eq x = ()\n\nlet parse32_alertDescription_key : LS.parser32 parse_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertDescription_repr_parser32 alertDescription_enum)\n\nlet alertDescription_parser32 : LS.parser32 alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n LS.parse32_synth _ synth_alertDescription (fun x->synth_alertDescription x) parse32_alertDescription_key ()\n\nlet serialize32_alertDescription_key : LS.serializer32 serialize_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertDescription_repr_serializer32 alertDescription_enum)\n\nlet alertDescription_serializer32 : LS.serializer32 alertDescription_serializer =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LS.serialize32_synth _ synth_alertDescription _ serialize32_alertDescription_key synth_alertDescription_inv (fun x->synth_alertDescription_inv x) ()\n\nlet alertDescription_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond alertDescription_serializer 1ul) in\n LSZ.size32_constant alertDescription_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.AlertDescription.parse_alertDescription_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.validate_enum_key", "Parsers.AlertDescription.alertDescription", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "Parsers.AlertDescription.alertDescription_repr_validator", "Parsers.AlertDescription.alertDescription_repr_reader", "Prims.Cons", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.Mktuple2", "Parsers.AlertDescription.Close_notify", "FStar.UInt8.__uint_to_t", "Parsers.AlertDescription.Unexpected_message", "Parsers.AlertDescription.Bad_record_mac", "Parsers.AlertDescription.Record_overflow", "Parsers.AlertDescription.Handshake_failure", "Parsers.AlertDescription.Bad_certificate", "Parsers.AlertDescription.Unsupported_certificate", "Parsers.AlertDescription.Certificate_revoked", "Parsers.AlertDescription.Certificate_expired", "Parsers.AlertDescription.Certificate_unknown", "Parsers.AlertDescription.Illegal_parameter", "Parsers.AlertDescription.Unknown_ca", "Parsers.AlertDescription.Access_denied", "Parsers.AlertDescription.Decode_error", "Parsers.AlertDescription.Decrypt_error", "Parsers.AlertDescription.Protocol_version", "Parsers.AlertDescription.Insufficient_security", "Parsers.AlertDescription.Internal_error", "Parsers.AlertDescription.Inappropriate_fallback", "Parsers.AlertDescription.User_canceled", "Parsers.AlertDescription.Missing_extension", "Parsers.AlertDescription.Unsupported_extension", "Parsers.AlertDescription.Unrecognized_name", "Parsers.AlertDescription.Bad_certificate_status_response", "Parsers.AlertDescription.Unknown_psk_identity", "Parsers.AlertDescription.Certificate_required", "Parsers.AlertDescription.No_application_protocol", "Prims.Nil", "LowParse.Spec.Enum.maybe_enum_destr_t_intro", "Prims.bool", "LowParse.Spec.Enum.maybe_enum_destr_cons", "LowParse.Spec.Enum.maybe_enum_destr_nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val validate_alertDescription_key:LL.validator parse_alertDescription_key\nlet validate_alertDescription_key:LL.validator parse_alertDescription_key =", "completed_definiton": "LL.mk_validate_enum_key alertDescription_repr_validator\n alertDescription_repr_reader\n alertDescription_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.alertDescription_size32", "original_source_type": "val alertDescription_size32: LSZ.size32 alertDescription_serializer", "source_type": "val alertDescription_size32: LSZ.size32 alertDescription_serializer", "source_definition": "let alertDescription_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond alertDescription_serializer 1ul) in\n LSZ.size32_constant alertDescription_serializer 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 128, "start_col": 2, "end_line": 129, "end_col": 56 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertDescription_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertDescription_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertDescription_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription = x\n\ninline_for_extraction let synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertDescription_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertDescription_inj () : Lemma\n (LP.synth_injective synth_alertDescription) = ()\n\nlet lemma_synth_alertDescription_inv () : Lemma\n (LP.synth_inverse synth_alertDescription synth_alertDescription_inv) = ()\n\nnoextract let parse_alertDescription_key : LP.parser _ (LP.enum_key alertDescription_enum) =\n LP.parse_enum_key alertDescription_repr_parser alertDescription_enum\n\nnoextract let serialize_alertDescription_key : LP.serializer parse_alertDescription_key =\n LP.serialize_enum_key alertDescription_repr_parser alertDescription_repr_serializer alertDescription_enum\n\nnoextract let alertDescription_parser : LP.parser _ alertDescription =\n lemma_synth_alertDescription_inj ();\n parse_alertDescription_key `LP.parse_synth` synth_alertDescription\n\nnoextract let alertDescription_serializer : LP.serializer alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LP.serialize_synth _ synth_alertDescription serialize_alertDescription_key synth_alertDescription_inv ()\n\nlet alertDescription_bytesize (x:alertDescription) : GTot nat = Seq.length (alertDescription_serializer x)\n\nlet alertDescription_bytesize_eq x = ()\n\nlet parse32_alertDescription_key : LS.parser32 parse_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertDescription_repr_parser32 alertDescription_enum)\n\nlet alertDescription_parser32 : LS.parser32 alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n LS.parse32_synth _ synth_alertDescription (fun x->synth_alertDescription x) parse32_alertDescription_key ()\n\nlet serialize32_alertDescription_key : LS.serializer32 serialize_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertDescription_repr_serializer32 alertDescription_enum)\n\nlet alertDescription_serializer32 : LS.serializer32 alertDescription_serializer =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LS.serialize32_synth _ synth_alertDescription _ serialize32_alertDescription_key synth_alertDescription_inv (fun x->synth_alertDescription_inv x) ()", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.AlertDescription.alertDescription_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Base.size32_constant", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.AlertDescription.alertDescription", "Parsers.AlertDescription.alertDescription_parser", "Parsers.AlertDescription.alertDescription_serializer", "FStar.UInt32.__uint_to_t", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.SLow.Base.size32_constant_precond" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertDescription_size32: LSZ.size32 alertDescription_serializer\nlet alertDescription_size32 =", "completed_definiton": "[@@ inline_let ]let _ = assert_norm (LSZ.size32_constant_precond alertDescription_serializer 1ul) in\nLSZ.size32_constant alertDescription_serializer 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.serialize_alertDescription_key", "original_source_type": "val serialize_alertDescription_key:LP.serializer parse_alertDescription_key", "source_type": "val serialize_alertDescription_key:LP.serializer parse_alertDescription_key", "source_definition": "let serialize_alertDescription_key : LP.serializer parse_alertDescription_key =\n LP.serialize_enum_key alertDescription_repr_parser alertDescription_repr_serializer alertDescription_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 96, "start_col": 2, "end_line": 96, "end_col": 107 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertDescription_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertDescription_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertDescription_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription = x\n\ninline_for_extraction let synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertDescription_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertDescription_inj () : Lemma\n (LP.synth_injective synth_alertDescription) = ()\n\nlet lemma_synth_alertDescription_inv () : Lemma\n (LP.synth_inverse synth_alertDescription synth_alertDescription_inv) = ()\n\nnoextract let parse_alertDescription_key : LP.parser _ (LP.enum_key alertDescription_enum) =\n LP.parse_enum_key alertDescription_repr_parser alertDescription_enum", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.AlertDescription.parse_alertDescription_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.serialize_enum_key", "LowParse.Spec.Int.parse_u8_kind", "Parsers.AlertDescription.alertDescription", "FStar.UInt8.t", "Parsers.AlertDescription.alertDescription_repr_parser", "Parsers.AlertDescription.alertDescription_repr_serializer", "Parsers.AlertDescription.alertDescription_enum" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_alertDescription_key:LP.serializer parse_alertDescription_key\nlet serialize_alertDescription_key:LP.serializer parse_alertDescription_key =", "completed_definiton": "LP.serialize_enum_key alertDescription_repr_parser\n alertDescription_repr_serializer\n alertDescription_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.alertDescription_enum", "original_source_type": "val alertDescription_enum:LP.enum alertDescription U8.t", "source_type": "val alertDescription_enum:LP.enum alertDescription U8.t", "source_definition": "let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 24, "start_col": 2, "end_line": 58, "end_col": 6 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Enum.enum Parsers.AlertDescription.alertDescription FStar.UInt8.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.b2t", "FStar.List.Tot.Base.noRepeats", "FStar.UInt8.t", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "Parsers.AlertDescription.alertDescription", "FStar.Pervasives.Native.snd", "FStar.Pervasives.Native.fst", "Prims.list", "Prims.Cons", "FStar.Pervasives.Native.Mktuple2", "Parsers.AlertDescription.Close_notify", "FStar.UInt8.__uint_to_t", "Parsers.AlertDescription.Unexpected_message", "Parsers.AlertDescription.Bad_record_mac", "Parsers.AlertDescription.Record_overflow", "Parsers.AlertDescription.Handshake_failure", "Parsers.AlertDescription.Bad_certificate", "Parsers.AlertDescription.Unsupported_certificate", "Parsers.AlertDescription.Certificate_revoked", "Parsers.AlertDescription.Certificate_expired", "Parsers.AlertDescription.Certificate_unknown", "Parsers.AlertDescription.Illegal_parameter", "Parsers.AlertDescription.Unknown_ca", "Parsers.AlertDescription.Access_denied", "Parsers.AlertDescription.Decode_error", "Parsers.AlertDescription.Decrypt_error", "Parsers.AlertDescription.Protocol_version", "Parsers.AlertDescription.Insufficient_security", "Parsers.AlertDescription.Internal_error", "Parsers.AlertDescription.Inappropriate_fallback", "Parsers.AlertDescription.User_canceled", "Parsers.AlertDescription.Missing_extension", "Parsers.AlertDescription.Unsupported_extension", "Parsers.AlertDescription.Unrecognized_name", "Parsers.AlertDescription.Bad_certificate_status_response", "Parsers.AlertDescription.Unknown_psk_identity", "Parsers.AlertDescription.Certificate_required", "Parsers.AlertDescription.No_application_protocol", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertDescription_enum:LP.enum alertDescription U8.t\nlet alertDescription_enum:LP.enum alertDescription U8.t =", "completed_definiton": "[@@ inline_let ]let e =\n [\n Close_notify, 0uy; Unexpected_message, 10uy; Bad_record_mac, 20uy; Record_overflow, 22uy;\n Handshake_failure, 40uy; Bad_certificate, 42uy; Unsupported_certificate, 43uy;\n Certificate_revoked, 44uy; Certificate_expired, 45uy; Certificate_unknown, 46uy;\n Illegal_parameter, 47uy; Unknown_ca, 48uy; Access_denied, 49uy; Decode_error, 50uy;\n Decrypt_error, 51uy; Protocol_version, 70uy; Insufficient_security, 71uy; Internal_error, 80uy;\n Inappropriate_fallback, 86uy; User_canceled, 90uy; Missing_extension, 109uy;\n Unsupported_extension, 110uy; Unrecognized_name, 112uy; Bad_certificate_status_response, 113uy;\n Unknown_psk_identity, 115uy; Certificate_required, 116uy; No_application_protocol, 120uy\n ]\nin\n[@@ inline_let ]let _ = assert_norm (L.noRepeats (LP.list_map fst e)) in\n[@@ inline_let ]let _ = assert_norm (L.noRepeats (LP.list_map snd e)) in\ne", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.alertDescription_parser", "original_source_type": "val alertDescription_parser: LP.parser alertDescription_parser_kind alertDescription", "source_type": "val alertDescription_parser: LP.parser alertDescription_parser_kind alertDescription", "source_definition": "let alertDescription_parser : LP.parser _ alertDescription =\n lemma_synth_alertDescription_inj ();\n parse_alertDescription_key `LP.parse_synth` synth_alertDescription", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 99, "start_col": 2, "end_line": 100, "end_col": 68 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertDescription_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertDescription_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertDescription_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription = x\n\ninline_for_extraction let synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertDescription_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertDescription_inj () : Lemma\n (LP.synth_injective synth_alertDescription) = ()\n\nlet lemma_synth_alertDescription_inv () : Lemma\n (LP.synth_inverse synth_alertDescription synth_alertDescription_inv) = ()\n\nnoextract let parse_alertDescription_key : LP.parser _ (LP.enum_key alertDescription_enum) =\n LP.parse_enum_key alertDescription_repr_parser alertDescription_enum\n\nnoextract let serialize_alertDescription_key : LP.serializer parse_alertDescription_key =\n LP.serialize_enum_key alertDescription_repr_parser alertDescription_repr_serializer alertDescription_enum", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.AlertDescription.alertDescription_parser_kind\n Parsers.AlertDescription.alertDescription", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.AlertDescription.alertDescription", "FStar.UInt8.t", "Parsers.AlertDescription.alertDescription_enum", "Parsers.AlertDescription.parse_alertDescription_key", "Parsers.AlertDescription.synth_alertDescription", "Prims.unit", "Parsers.AlertDescription.lemma_synth_alertDescription_inj", "LowParse.Spec.Base.parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertDescription_parser: LP.parser alertDescription_parser_kind alertDescription\nlet alertDescription_parser:LP.parser _ alertDescription =", "completed_definiton": "lemma_synth_alertDescription_inj ();\nparse_alertDescription_key `LP.parse_synth` synth_alertDescription", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.alertDescription_serializer", "original_source_type": "val alertDescription_serializer: LP.serializer alertDescription_parser", "source_type": "val alertDescription_serializer: LP.serializer alertDescription_parser", "source_definition": "let alertDescription_serializer : LP.serializer alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LP.serialize_synth _ synth_alertDescription serialize_alertDescription_key synth_alertDescription_inv ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 103, "start_col": 2, "end_line": 105, "end_col": 106 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertDescription_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertDescription_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertDescription_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription = x\n\ninline_for_extraction let synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertDescription_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertDescription_inj () : Lemma\n (LP.synth_injective synth_alertDescription) = ()\n\nlet lemma_synth_alertDescription_inv () : Lemma\n (LP.synth_inverse synth_alertDescription synth_alertDescription_inv) = ()\n\nnoextract let parse_alertDescription_key : LP.parser _ (LP.enum_key alertDescription_enum) =\n LP.parse_enum_key alertDescription_repr_parser alertDescription_enum\n\nnoextract let serialize_alertDescription_key : LP.serializer parse_alertDescription_key =\n LP.serialize_enum_key alertDescription_repr_parser alertDescription_repr_serializer alertDescription_enum\n\nnoextract let alertDescription_parser : LP.parser _ alertDescription =\n lemma_synth_alertDescription_inj ();\n parse_alertDescription_key `LP.parse_synth` synth_alertDescription", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.AlertDescription.alertDescription_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.AlertDescription.alertDescription", "FStar.UInt8.t", "Parsers.AlertDescription.alertDescription_enum", "Parsers.AlertDescription.parse_alertDescription_key", "Parsers.AlertDescription.synth_alertDescription", "Parsers.AlertDescription.serialize_alertDescription_key", "Parsers.AlertDescription.synth_alertDescription_inv", "Prims.unit", "Parsers.AlertDescription.lemma_synth_alertDescription_inv", "Parsers.AlertDescription.lemma_synth_alertDescription_inj", "LowParse.Spec.Base.serializer", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.AlertDescription.alertDescription_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertDescription_serializer: LP.serializer alertDescription_parser\nlet alertDescription_serializer:LP.serializer alertDescription_parser =", "completed_definiton": "lemma_synth_alertDescription_inj ();\nlemma_synth_alertDescription_inv ();\nLP.serialize_synth _\n synth_alertDescription\n serialize_alertDescription_key\n synth_alertDescription_inv\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.alertDescription_parser32", "original_source_type": "val alertDescription_parser32: LS.parser32 alertDescription_parser", "source_type": "val alertDescription_parser32: LS.parser32 alertDescription_parser", "source_definition": "let alertDescription_parser32 : LS.parser32 alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n LS.parse32_synth _ synth_alertDescription (fun x->synth_alertDescription x) parse32_alertDescription_key ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 115, "start_col": 2, "end_line": 116, "end_col": 109 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertDescription_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertDescription_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertDescription_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription = x\n\ninline_for_extraction let synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertDescription_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertDescription_inj () : Lemma\n (LP.synth_injective synth_alertDescription) = ()\n\nlet lemma_synth_alertDescription_inv () : Lemma\n (LP.synth_inverse synth_alertDescription synth_alertDescription_inv) = ()\n\nnoextract let parse_alertDescription_key : LP.parser _ (LP.enum_key alertDescription_enum) =\n LP.parse_enum_key alertDescription_repr_parser alertDescription_enum\n\nnoextract let serialize_alertDescription_key : LP.serializer parse_alertDescription_key =\n LP.serialize_enum_key alertDescription_repr_parser alertDescription_repr_serializer alertDescription_enum\n\nnoextract let alertDescription_parser : LP.parser _ alertDescription =\n lemma_synth_alertDescription_inj ();\n parse_alertDescription_key `LP.parse_synth` synth_alertDescription\n\nnoextract let alertDescription_serializer : LP.serializer alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LP.serialize_synth _ synth_alertDescription serialize_alertDescription_key synth_alertDescription_inv ()\n\nlet alertDescription_bytesize (x:alertDescription) : GTot nat = Seq.length (alertDescription_serializer x)\n\nlet alertDescription_bytesize_eq x = ()\n\nlet parse32_alertDescription_key : LS.parser32 parse_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertDescription_repr_parser32 alertDescription_enum)", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.AlertDescription.alertDescription_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.AlertDescription.alertDescription", "FStar.UInt8.t", "Parsers.AlertDescription.alertDescription_enum", "Parsers.AlertDescription.parse_alertDescription_key", "Parsers.AlertDescription.synth_alertDescription", "Prims.eq2", "Parsers.AlertDescription.parse32_alertDescription_key", "Prims.unit", "Parsers.AlertDescription.lemma_synth_alertDescription_inj", "LowParse.SLow.Base.parser32", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.AlertDescription.alertDescription_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertDescription_parser32: LS.parser32 alertDescription_parser\nlet alertDescription_parser32:LS.parser32 alertDescription_parser =", "completed_definiton": "lemma_synth_alertDescription_inj ();\nLS.parse32_synth _\n synth_alertDescription\n (fun x -> synth_alertDescription x)\n parse32_alertDescription_key\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.alertDescription_serializer32", "original_source_type": "val alertDescription_serializer32: LS.serializer32 alertDescription_serializer", "source_type": "val alertDescription_serializer32: LS.serializer32 alertDescription_serializer", "source_definition": "let alertDescription_serializer32 : LS.serializer32 alertDescription_serializer =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LS.serialize32_synth _ synth_alertDescription _ serialize32_alertDescription_key synth_alertDescription_inv (fun x->synth_alertDescription_inv x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 123, "start_col": 2, "end_line": 125, "end_col": 150 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertDescription_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertDescription_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertDescription_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription = x\n\ninline_for_extraction let synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertDescription_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertDescription_inj () : Lemma\n (LP.synth_injective synth_alertDescription) = ()\n\nlet lemma_synth_alertDescription_inv () : Lemma\n (LP.synth_inverse synth_alertDescription synth_alertDescription_inv) = ()\n\nnoextract let parse_alertDescription_key : LP.parser _ (LP.enum_key alertDescription_enum) =\n LP.parse_enum_key alertDescription_repr_parser alertDescription_enum\n\nnoextract let serialize_alertDescription_key : LP.serializer parse_alertDescription_key =\n LP.serialize_enum_key alertDescription_repr_parser alertDescription_repr_serializer alertDescription_enum\n\nnoextract let alertDescription_parser : LP.parser _ alertDescription =\n lemma_synth_alertDescription_inj ();\n parse_alertDescription_key `LP.parse_synth` synth_alertDescription\n\nnoextract let alertDescription_serializer : LP.serializer alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LP.serialize_synth _ synth_alertDescription serialize_alertDescription_key synth_alertDescription_inv ()\n\nlet alertDescription_bytesize (x:alertDescription) : GTot nat = Seq.length (alertDescription_serializer x)\n\nlet alertDescription_bytesize_eq x = ()\n\nlet parse32_alertDescription_key : LS.parser32 parse_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertDescription_repr_parser32 alertDescription_enum)\n\nlet alertDescription_parser32 : LS.parser32 alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n LS.parse32_synth _ synth_alertDescription (fun x->synth_alertDescription x) parse32_alertDescription_key ()\n\nlet serialize32_alertDescription_key : LS.serializer32 serialize_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertDescription_repr_serializer32 alertDescription_enum)", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.AlertDescription.alertDescription_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.AlertDescription.alertDescription", "FStar.UInt8.t", "Parsers.AlertDescription.alertDescription_enum", "Parsers.AlertDescription.parse_alertDescription_key", "Parsers.AlertDescription.synth_alertDescription", "Parsers.AlertDescription.serialize_alertDescription_key", "Parsers.AlertDescription.serialize32_alertDescription_key", "Parsers.AlertDescription.synth_alertDescription_inv", "Prims.eq2", "Prims.unit", "Parsers.AlertDescription.lemma_synth_alertDescription_inv", "Parsers.AlertDescription.lemma_synth_alertDescription_inj", "LowParse.SLow.Base.serializer32", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.AlertDescription.alertDescription_parser", "Parsers.AlertDescription.alertDescription_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertDescription_serializer32: LS.serializer32 alertDescription_serializer\nlet alertDescription_serializer32:LS.serializer32 alertDescription_serializer =", "completed_definiton": "lemma_synth_alertDescription_inj ();\nlemma_synth_alertDescription_inv ();\nLS.serialize32_synth _\n synth_alertDescription\n _\n serialize32_alertDescription_key\n synth_alertDescription_inv\n (fun x -> synth_alertDescription_inv x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.read_alertDescription_key", "original_source_type": "val read_alertDescription_key:LL.leaf_reader parse_alertDescription_key", "source_type": "val read_alertDescription_key:LL.leaf_reader parse_alertDescription_key", "source_definition": "let read_alertDescription_key : LL.leaf_reader parse_alertDescription_key =\n LL.mk_read_enum_key alertDescription_repr_reader alertDescription_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 141, "start_col": 2, "end_line": 141, "end_col": 72 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertDescription_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertDescription_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertDescription_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription = x\n\ninline_for_extraction let synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertDescription_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertDescription_inj () : Lemma\n (LP.synth_injective synth_alertDescription) = ()\n\nlet lemma_synth_alertDescription_inv () : Lemma\n (LP.synth_inverse synth_alertDescription synth_alertDescription_inv) = ()\n\nnoextract let parse_alertDescription_key : LP.parser _ (LP.enum_key alertDescription_enum) =\n LP.parse_enum_key alertDescription_repr_parser alertDescription_enum\n\nnoextract let serialize_alertDescription_key : LP.serializer parse_alertDescription_key =\n LP.serialize_enum_key alertDescription_repr_parser alertDescription_repr_serializer alertDescription_enum\n\nnoextract let alertDescription_parser : LP.parser _ alertDescription =\n lemma_synth_alertDescription_inj ();\n parse_alertDescription_key `LP.parse_synth` synth_alertDescription\n\nnoextract let alertDescription_serializer : LP.serializer alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LP.serialize_synth _ synth_alertDescription serialize_alertDescription_key synth_alertDescription_inv ()\n\nlet alertDescription_bytesize (x:alertDescription) : GTot nat = Seq.length (alertDescription_serializer x)\n\nlet alertDescription_bytesize_eq x = ()\n\nlet parse32_alertDescription_key : LS.parser32 parse_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertDescription_repr_parser32 alertDescription_enum)\n\nlet alertDescription_parser32 : LS.parser32 alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n LS.parse32_synth _ synth_alertDescription (fun x->synth_alertDescription x) parse32_alertDescription_key ()\n\nlet serialize32_alertDescription_key : LS.serializer32 serialize_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertDescription_repr_serializer32 alertDescription_enum)\n\nlet alertDescription_serializer32 : LS.serializer32 alertDescription_serializer =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LS.serialize32_synth _ synth_alertDescription _ serialize32_alertDescription_key synth_alertDescription_inv (fun x->synth_alertDescription_inv x) ()\n\nlet alertDescription_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond alertDescription_serializer 1ul) in\n LSZ.size32_constant alertDescription_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_alertDescription_key : LL.validator parse_alertDescription_key =\n LL.mk_validate_enum_key alertDescription_repr_validator alertDescription_repr_reader alertDescription_enum\n\nlet alertDescription_validator =\n lemma_synth_alertDescription_inj ();\n LL.validate_synth validate_alertDescription_key synth_alertDescription ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader Parsers.AlertDescription.parse_alertDescription_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.read_enum_key", "Parsers.AlertDescription.alertDescription", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "Parsers.AlertDescription.alertDescription_repr_reader", "Prims.Cons", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.Mktuple2", "Parsers.AlertDescription.Close_notify", "FStar.UInt8.__uint_to_t", "Parsers.AlertDescription.Unexpected_message", "Parsers.AlertDescription.Bad_record_mac", "Parsers.AlertDescription.Record_overflow", "Parsers.AlertDescription.Handshake_failure", "Parsers.AlertDescription.Bad_certificate", "Parsers.AlertDescription.Unsupported_certificate", "Parsers.AlertDescription.Certificate_revoked", "Parsers.AlertDescription.Certificate_expired", "Parsers.AlertDescription.Certificate_unknown", "Parsers.AlertDescription.Illegal_parameter", "Parsers.AlertDescription.Unknown_ca", "Parsers.AlertDescription.Access_denied", "Parsers.AlertDescription.Decode_error", "Parsers.AlertDescription.Decrypt_error", "Parsers.AlertDescription.Protocol_version", "Parsers.AlertDescription.Insufficient_security", "Parsers.AlertDescription.Internal_error", "Parsers.AlertDescription.Inappropriate_fallback", "Parsers.AlertDescription.User_canceled", "Parsers.AlertDescription.Missing_extension", "Parsers.AlertDescription.Unsupported_extension", "Parsers.AlertDescription.Unrecognized_name", "Parsers.AlertDescription.Bad_certificate_status_response", "Parsers.AlertDescription.Unknown_psk_identity", "Parsers.AlertDescription.Certificate_required", "Parsers.AlertDescription.No_application_protocol", "Prims.Nil", "LowParse.Spec.Enum.dep_maybe_enum_destr_t_intro", "LowParse.Low.Enum.read_enum_key_t", "LowParse.Spec.Enum.dep_maybe_enum_destr_cons", "LowParse.Spec.Enum.list_append_rev_cons", "LowParse.Spec.Enum.dep_maybe_enum_destr_nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_alertDescription_key:LL.leaf_reader parse_alertDescription_key\nlet read_alertDescription_key:LL.leaf_reader parse_alertDescription_key =", "completed_definiton": "LL.mk_read_enum_key alertDescription_repr_reader alertDescription_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.alertDescription_validator", "original_source_type": "val alertDescription_validator: LL.validator alertDescription_parser", "source_type": "val alertDescription_validator: LL.validator alertDescription_parser", "source_definition": "let alertDescription_validator =\n lemma_synth_alertDescription_inj ();\n LL.validate_synth validate_alertDescription_key synth_alertDescription ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 136, "start_col": 2, "end_line": 137, "end_col": 75 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertDescription_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertDescription_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertDescription_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription = x\n\ninline_for_extraction let synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertDescription_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertDescription_inj () : Lemma\n (LP.synth_injective synth_alertDescription) = ()\n\nlet lemma_synth_alertDescription_inv () : Lemma\n (LP.synth_inverse synth_alertDescription synth_alertDescription_inv) = ()\n\nnoextract let parse_alertDescription_key : LP.parser _ (LP.enum_key alertDescription_enum) =\n LP.parse_enum_key alertDescription_repr_parser alertDescription_enum\n\nnoextract let serialize_alertDescription_key : LP.serializer parse_alertDescription_key =\n LP.serialize_enum_key alertDescription_repr_parser alertDescription_repr_serializer alertDescription_enum\n\nnoextract let alertDescription_parser : LP.parser _ alertDescription =\n lemma_synth_alertDescription_inj ();\n parse_alertDescription_key `LP.parse_synth` synth_alertDescription\n\nnoextract let alertDescription_serializer : LP.serializer alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LP.serialize_synth _ synth_alertDescription serialize_alertDescription_key synth_alertDescription_inv ()\n\nlet alertDescription_bytesize (x:alertDescription) : GTot nat = Seq.length (alertDescription_serializer x)\n\nlet alertDescription_bytesize_eq x = ()\n\nlet parse32_alertDescription_key : LS.parser32 parse_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertDescription_repr_parser32 alertDescription_enum)\n\nlet alertDescription_parser32 : LS.parser32 alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n LS.parse32_synth _ synth_alertDescription (fun x->synth_alertDescription x) parse32_alertDescription_key ()\n\nlet serialize32_alertDescription_key : LS.serializer32 serialize_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertDescription_repr_serializer32 alertDescription_enum)\n\nlet alertDescription_serializer32 : LS.serializer32 alertDescription_serializer =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LS.serialize32_synth _ synth_alertDescription _ serialize32_alertDescription_key synth_alertDescription_inv (fun x->synth_alertDescription_inv x) ()\n\nlet alertDescription_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond alertDescription_serializer 1ul) in\n LSZ.size32_constant alertDescription_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_alertDescription_key : LL.validator parse_alertDescription_key =\n LL.mk_validate_enum_key alertDescription_repr_validator alertDescription_repr_reader alertDescription_enum", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.AlertDescription.alertDescription_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.validate_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.AlertDescription.alertDescription", "FStar.UInt8.t", "Parsers.AlertDescription.alertDescription_enum", "Parsers.AlertDescription.parse_alertDescription_key", "Parsers.AlertDescription.validate_alertDescription_key", "Parsers.AlertDescription.synth_alertDescription", "Prims.unit", "Parsers.AlertDescription.lemma_synth_alertDescription_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertDescription_validator: LL.validator alertDescription_parser\nlet alertDescription_validator =", "completed_definiton": "lemma_synth_alertDescription_inj ();\nLL.validate_synth validate_alertDescription_key synth_alertDescription ()", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.synth_alertDescription_inv", "original_source_type": "val synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum)", "source_type": "val synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum)", "source_definition": "let synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertDescription_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 81, "start_col": 2, "end_line": 84, "end_col": 3 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertDescription_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertDescription_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertDescription_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription = x", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.AlertDescription.alertDescription\n -> LowParse.Spec.Enum.enum_key Parsers.AlertDescription.alertDescription_enum", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.AlertDescription.alertDescription", "Prims.squash", "Prims.b2t", "LowParse.Spec.Enum.list_mem", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "FStar.UInt8.t", "FStar.Pervasives.Native.fst", "Parsers.AlertDescription.alertDescription_enum", "LowParse.Spec.Enum.enum_key" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum)\nlet synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum) =", "completed_definiton": "[@@ inline_let ]let _:squash (LP.list_mem x (LP.list_map fst alertDescription_enum)) =\n FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.synth_maybe_enum_key_inv_unknown_tac x))\nin\nx", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.parse32_alertDescription_key", "original_source_type": "val parse32_alertDescription_key:LS.parser32 parse_alertDescription_key", "source_type": "val parse32_alertDescription_key:LS.parser32 parse_alertDescription_key", "source_definition": "let parse32_alertDescription_key : LS.parser32 parse_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertDescription_repr_parser32 alertDescription_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 112, "start_col": 2, "end_line": 112, "end_col": 110 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertDescription_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertDescription_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertDescription_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription = x\n\ninline_for_extraction let synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertDescription_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertDescription_inj () : Lemma\n (LP.synth_injective synth_alertDescription) = ()\n\nlet lemma_synth_alertDescription_inv () : Lemma\n (LP.synth_inverse synth_alertDescription synth_alertDescription_inv) = ()\n\nnoextract let parse_alertDescription_key : LP.parser _ (LP.enum_key alertDescription_enum) =\n LP.parse_enum_key alertDescription_repr_parser alertDescription_enum\n\nnoextract let serialize_alertDescription_key : LP.serializer parse_alertDescription_key =\n LP.serialize_enum_key alertDescription_repr_parser alertDescription_repr_serializer alertDescription_enum\n\nnoextract let alertDescription_parser : LP.parser _ alertDescription =\n lemma_synth_alertDescription_inj ();\n parse_alertDescription_key `LP.parse_synth` synth_alertDescription\n\nnoextract let alertDescription_serializer : LP.serializer alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LP.serialize_synth _ synth_alertDescription serialize_alertDescription_key synth_alertDescription_inv ()\n\nlet alertDescription_bytesize (x:alertDescription) : GTot nat = Seq.length (alertDescription_serializer x)\n\nlet alertDescription_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.AlertDescription.parse_alertDescription_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Enum.parse32_enum_key_gen", "LowParse.Spec.Int.parse_u8_kind", "Parsers.AlertDescription.alertDescription", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "Parsers.AlertDescription.alertDescription_enum", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Enum.enum_key", "Parsers.AlertDescription.parse_alertDescription_key", "LowParse.SLow.Enum.parse32_maybe_enum_key_gen", "Parsers.AlertDescription.alertDescription_repr_parser32", "LowParse.Spec.Enum.maybe_enum_key", "LowParse.Spec.Enum.parse_maybe_enum_key", "LowParse.Spec.Enum.maybe_enum_key_of_repr'_t_cons'", "LowParse.Spec.Enum.enum_tail'", "LowParse.Spec.Enum.maybe_enum_key_of_repr'_t_cons_nil'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse32_alertDescription_key:LS.parser32 parse_alertDescription_key\nlet parse32_alertDescription_key:LS.parser32 parse_alertDescription_key =", "completed_definiton": "FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertDescription_repr_parser32\n alertDescription_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.lserialize_alertDescription_key", "original_source_type": "val lserialize_alertDescription_key:LL.serializer32 serialize_alertDescription_key", "source_type": "val lserialize_alertDescription_key:LL.serializer32 serialize_alertDescription_key", "source_definition": "let lserialize_alertDescription_key : LL.serializer32 serialize_alertDescription_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_alertDescription_key 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 151, "start_col": 2, "end_line": 151, "end_col": 87 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertDescription_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertDescription_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertDescription_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription = x\n\ninline_for_extraction let synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertDescription_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertDescription_inj () : Lemma\n (LP.synth_injective synth_alertDescription) = ()\n\nlet lemma_synth_alertDescription_inv () : Lemma\n (LP.synth_inverse synth_alertDescription synth_alertDescription_inv) = ()\n\nnoextract let parse_alertDescription_key : LP.parser _ (LP.enum_key alertDescription_enum) =\n LP.parse_enum_key alertDescription_repr_parser alertDescription_enum\n\nnoextract let serialize_alertDescription_key : LP.serializer parse_alertDescription_key =\n LP.serialize_enum_key alertDescription_repr_parser alertDescription_repr_serializer alertDescription_enum\n\nnoextract let alertDescription_parser : LP.parser _ alertDescription =\n lemma_synth_alertDescription_inj ();\n parse_alertDescription_key `LP.parse_synth` synth_alertDescription\n\nnoextract let alertDescription_serializer : LP.serializer alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LP.serialize_synth _ synth_alertDescription serialize_alertDescription_key synth_alertDescription_inv ()\n\nlet alertDescription_bytesize (x:alertDescription) : GTot nat = Seq.length (alertDescription_serializer x)\n\nlet alertDescription_bytesize_eq x = ()\n\nlet parse32_alertDescription_key : LS.parser32 parse_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertDescription_repr_parser32 alertDescription_enum)\n\nlet alertDescription_parser32 : LS.parser32 alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n LS.parse32_synth _ synth_alertDescription (fun x->synth_alertDescription x) parse32_alertDescription_key ()\n\nlet serialize32_alertDescription_key : LS.serializer32 serialize_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertDescription_repr_serializer32 alertDescription_enum)\n\nlet alertDescription_serializer32 : LS.serializer32 alertDescription_serializer =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LS.serialize32_synth _ synth_alertDescription _ serialize32_alertDescription_key synth_alertDescription_inv (fun x->synth_alertDescription_inv x) ()\n\nlet alertDescription_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond alertDescription_serializer 1ul) in\n LSZ.size32_constant alertDescription_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_alertDescription_key : LL.validator parse_alertDescription_key =\n LL.mk_validate_enum_key alertDescription_repr_validator alertDescription_repr_reader alertDescription_enum\n\nlet alertDescription_validator =\n lemma_synth_alertDescription_inj ();\n LL.validate_synth validate_alertDescription_key synth_alertDescription ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_alertDescription_key : LL.leaf_reader parse_alertDescription_key =\n LL.mk_read_enum_key alertDescription_repr_reader alertDescription_enum\n\nlet alertDescription_reader =\n [@inline_let] let _ = lemma_synth_alertDescription_inj () in\n LL.read_synth' parse_alertDescription_key synth_alertDescription read_alertDescription_key ()\n\ninline_for_extraction let write_alertDescription_key : LL.leaf_writer_strong serialize_alertDescription_key =\n LL.write_enum_key alertDescription_repr_writer alertDescription_enum (_ by (LP.enum_repr_of_key_tac alertDescription_enum))", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 Parsers.AlertDescription.serialize_alertDescription_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.serializer32_of_leaf_writer_strong_constant_size", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.AlertDescription.alertDescription", "FStar.UInt8.t", "Parsers.AlertDescription.alertDescription_enum", "Parsers.AlertDescription.parse_alertDescription_key", "Parsers.AlertDescription.serialize_alertDescription_key", "Parsers.AlertDescription.write_alertDescription_key", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lserialize_alertDescription_key:LL.serializer32 serialize_alertDescription_key\nlet lserialize_alertDescription_key:LL.serializer32 serialize_alertDescription_key =", "completed_definiton": "LL.serializer32_of_leaf_writer_strong_constant_size write_alertDescription_key 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.alertDescription_reader", "original_source_type": "val alertDescription_reader: LL.leaf_reader alertDescription_parser", "source_type": "val alertDescription_reader: LL.leaf_reader alertDescription_parser", "source_definition": "let alertDescription_reader =\n [@inline_let] let _ = lemma_synth_alertDescription_inj () in\n LL.read_synth' parse_alertDescription_key synth_alertDescription read_alertDescription_key ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 144, "start_col": 1, "end_line": 145, "end_col": 94 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertDescription_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertDescription_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertDescription_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription = x\n\ninline_for_extraction let synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertDescription_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertDescription_inj () : Lemma\n (LP.synth_injective synth_alertDescription) = ()\n\nlet lemma_synth_alertDescription_inv () : Lemma\n (LP.synth_inverse synth_alertDescription synth_alertDescription_inv) = ()\n\nnoextract let parse_alertDescription_key : LP.parser _ (LP.enum_key alertDescription_enum) =\n LP.parse_enum_key alertDescription_repr_parser alertDescription_enum\n\nnoextract let serialize_alertDescription_key : LP.serializer parse_alertDescription_key =\n LP.serialize_enum_key alertDescription_repr_parser alertDescription_repr_serializer alertDescription_enum\n\nnoextract let alertDescription_parser : LP.parser _ alertDescription =\n lemma_synth_alertDescription_inj ();\n parse_alertDescription_key `LP.parse_synth` synth_alertDescription\n\nnoextract let alertDescription_serializer : LP.serializer alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LP.serialize_synth _ synth_alertDescription serialize_alertDescription_key synth_alertDescription_inv ()\n\nlet alertDescription_bytesize (x:alertDescription) : GTot nat = Seq.length (alertDescription_serializer x)\n\nlet alertDescription_bytesize_eq x = ()\n\nlet parse32_alertDescription_key : LS.parser32 parse_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertDescription_repr_parser32 alertDescription_enum)\n\nlet alertDescription_parser32 : LS.parser32 alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n LS.parse32_synth _ synth_alertDescription (fun x->synth_alertDescription x) parse32_alertDescription_key ()\n\nlet serialize32_alertDescription_key : LS.serializer32 serialize_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertDescription_repr_serializer32 alertDescription_enum)\n\nlet alertDescription_serializer32 : LS.serializer32 alertDescription_serializer =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LS.serialize32_synth _ synth_alertDescription _ serialize32_alertDescription_key synth_alertDescription_inv (fun x->synth_alertDescription_inv x) ()\n\nlet alertDescription_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond alertDescription_serializer 1ul) in\n LSZ.size32_constant alertDescription_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_alertDescription_key : LL.validator parse_alertDescription_key =\n LL.mk_validate_enum_key alertDescription_repr_validator alertDescription_repr_reader alertDescription_enum\n\nlet alertDescription_validator =\n lemma_synth_alertDescription_inj ();\n LL.validate_synth validate_alertDescription_key synth_alertDescription ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_alertDescription_key : LL.leaf_reader parse_alertDescription_key =\n LL.mk_read_enum_key alertDescription_repr_reader alertDescription_enum", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader Parsers.AlertDescription.alertDescription_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.read_synth'", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.AlertDescription.alertDescription", "FStar.UInt8.t", "Parsers.AlertDescription.alertDescription_enum", "Parsers.AlertDescription.parse_alertDescription_key", "Parsers.AlertDescription.synth_alertDescription", "Parsers.AlertDescription.read_alertDescription_key", "Prims.unit", "Parsers.AlertDescription.lemma_synth_alertDescription_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertDescription_reader: LL.leaf_reader alertDescription_parser\nlet alertDescription_reader =", "completed_definiton": "[@@ inline_let ]let _ = lemma_synth_alertDescription_inj () in\nLL.read_synth' parse_alertDescription_key synth_alertDescription read_alertDescription_key ()", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.alertDescription_lserializer", "original_source_type": "val alertDescription_lserializer: LL.serializer32 alertDescription_serializer", "source_type": "val alertDescription_lserializer: LL.serializer32 alertDescription_serializer", "source_definition": "let alertDescription_lserializer = LL.serializer32_of_leaf_writer_strong_constant_size alertDescription_writer 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 157, "start_col": 35, "end_line": 157, "end_col": 117 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertDescription_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertDescription_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertDescription_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription = x\n\ninline_for_extraction let synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertDescription_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertDescription_inj () : Lemma\n (LP.synth_injective synth_alertDescription) = ()\n\nlet lemma_synth_alertDescription_inv () : Lemma\n (LP.synth_inverse synth_alertDescription synth_alertDescription_inv) = ()\n\nnoextract let parse_alertDescription_key : LP.parser _ (LP.enum_key alertDescription_enum) =\n LP.parse_enum_key alertDescription_repr_parser alertDescription_enum\n\nnoextract let serialize_alertDescription_key : LP.serializer parse_alertDescription_key =\n LP.serialize_enum_key alertDescription_repr_parser alertDescription_repr_serializer alertDescription_enum\n\nnoextract let alertDescription_parser : LP.parser _ alertDescription =\n lemma_synth_alertDescription_inj ();\n parse_alertDescription_key `LP.parse_synth` synth_alertDescription\n\nnoextract let alertDescription_serializer : LP.serializer alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LP.serialize_synth _ synth_alertDescription serialize_alertDescription_key synth_alertDescription_inv ()\n\nlet alertDescription_bytesize (x:alertDescription) : GTot nat = Seq.length (alertDescription_serializer x)\n\nlet alertDescription_bytesize_eq x = ()\n\nlet parse32_alertDescription_key : LS.parser32 parse_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertDescription_repr_parser32 alertDescription_enum)\n\nlet alertDescription_parser32 : LS.parser32 alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n LS.parse32_synth _ synth_alertDescription (fun x->synth_alertDescription x) parse32_alertDescription_key ()\n\nlet serialize32_alertDescription_key : LS.serializer32 serialize_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertDescription_repr_serializer32 alertDescription_enum)\n\nlet alertDescription_serializer32 : LS.serializer32 alertDescription_serializer =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LS.serialize32_synth _ synth_alertDescription _ serialize32_alertDescription_key synth_alertDescription_inv (fun x->synth_alertDescription_inv x) ()\n\nlet alertDescription_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond alertDescription_serializer 1ul) in\n LSZ.size32_constant alertDescription_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_alertDescription_key : LL.validator parse_alertDescription_key =\n LL.mk_validate_enum_key alertDescription_repr_validator alertDescription_repr_reader alertDescription_enum\n\nlet alertDescription_validator =\n lemma_synth_alertDescription_inj ();\n LL.validate_synth validate_alertDescription_key synth_alertDescription ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_alertDescription_key : LL.leaf_reader parse_alertDescription_key =\n LL.mk_read_enum_key alertDescription_repr_reader alertDescription_enum\n\nlet alertDescription_reader =\n [@inline_let] let _ = lemma_synth_alertDescription_inj () in\n LL.read_synth' parse_alertDescription_key synth_alertDescription read_alertDescription_key ()\n\ninline_for_extraction let write_alertDescription_key : LL.leaf_writer_strong serialize_alertDescription_key =\n LL.write_enum_key alertDescription_repr_writer alertDescription_enum (_ by (LP.enum_repr_of_key_tac alertDescription_enum))\n\ninline_for_extraction let lserialize_alertDescription_key : LL.serializer32 serialize_alertDescription_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_alertDescription_key 1ul ()\n\nlet alertDescription_writer =\n [@inline_let] let _ = lemma_synth_alertDescription_inj (); lemma_synth_alertDescription_inv () in\n LL.write_synth write_alertDescription_key synth_alertDescription synth_alertDescription_inv (fun x -> synth_alertDescription_inv x) ()", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 Parsers.AlertDescription.alertDescription_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.serializer32_of_leaf_writer_strong_constant_size", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.AlertDescription.alertDescription", "Parsers.AlertDescription.alertDescription_parser", "Parsers.AlertDescription.alertDescription_serializer", "Parsers.AlertDescription.alertDescription_writer", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertDescription_lserializer: LL.serializer32 alertDescription_serializer\nlet alertDescription_lserializer =", "completed_definiton": "LL.serializer32_of_leaf_writer_strong_constant_size alertDescription_writer 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.alertDescription_writer", "original_source_type": "val alertDescription_writer: LL.leaf_writer_strong alertDescription_serializer", "source_type": "val alertDescription_writer: LL.leaf_writer_strong alertDescription_serializer", "source_definition": "let alertDescription_writer =\n [@inline_let] let _ = lemma_synth_alertDescription_inj (); lemma_synth_alertDescription_inv () in\n LL.write_synth write_alertDescription_key synth_alertDescription synth_alertDescription_inv (fun x -> synth_alertDescription_inv x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 154, "start_col": 2, "end_line": 155, "end_col": 136 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertDescription_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertDescription_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertDescription_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription = x\n\ninline_for_extraction let synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertDescription_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertDescription_inj () : Lemma\n (LP.synth_injective synth_alertDescription) = ()\n\nlet lemma_synth_alertDescription_inv () : Lemma\n (LP.synth_inverse synth_alertDescription synth_alertDescription_inv) = ()\n\nnoextract let parse_alertDescription_key : LP.parser _ (LP.enum_key alertDescription_enum) =\n LP.parse_enum_key alertDescription_repr_parser alertDescription_enum\n\nnoextract let serialize_alertDescription_key : LP.serializer parse_alertDescription_key =\n LP.serialize_enum_key alertDescription_repr_parser alertDescription_repr_serializer alertDescription_enum\n\nnoextract let alertDescription_parser : LP.parser _ alertDescription =\n lemma_synth_alertDescription_inj ();\n parse_alertDescription_key `LP.parse_synth` synth_alertDescription\n\nnoextract let alertDescription_serializer : LP.serializer alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LP.serialize_synth _ synth_alertDescription serialize_alertDescription_key synth_alertDescription_inv ()\n\nlet alertDescription_bytesize (x:alertDescription) : GTot nat = Seq.length (alertDescription_serializer x)\n\nlet alertDescription_bytesize_eq x = ()\n\nlet parse32_alertDescription_key : LS.parser32 parse_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertDescription_repr_parser32 alertDescription_enum)\n\nlet alertDescription_parser32 : LS.parser32 alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n LS.parse32_synth _ synth_alertDescription (fun x->synth_alertDescription x) parse32_alertDescription_key ()\n\nlet serialize32_alertDescription_key : LS.serializer32 serialize_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertDescription_repr_serializer32 alertDescription_enum)\n\nlet alertDescription_serializer32 : LS.serializer32 alertDescription_serializer =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LS.serialize32_synth _ synth_alertDescription _ serialize32_alertDescription_key synth_alertDescription_inv (fun x->synth_alertDescription_inv x) ()\n\nlet alertDescription_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond alertDescription_serializer 1ul) in\n LSZ.size32_constant alertDescription_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_alertDescription_key : LL.validator parse_alertDescription_key =\n LL.mk_validate_enum_key alertDescription_repr_validator alertDescription_repr_reader alertDescription_enum\n\nlet alertDescription_validator =\n lemma_synth_alertDescription_inj ();\n LL.validate_synth validate_alertDescription_key synth_alertDescription ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_alertDescription_key : LL.leaf_reader parse_alertDescription_key =\n LL.mk_read_enum_key alertDescription_repr_reader alertDescription_enum\n\nlet alertDescription_reader =\n [@inline_let] let _ = lemma_synth_alertDescription_inj () in\n LL.read_synth' parse_alertDescription_key synth_alertDescription read_alertDescription_key ()\n\ninline_for_extraction let write_alertDescription_key : LL.leaf_writer_strong serialize_alertDescription_key =\n LL.write_enum_key alertDescription_repr_writer alertDescription_enum (_ by (LP.enum_repr_of_key_tac alertDescription_enum))\n\ninline_for_extraction let lserialize_alertDescription_key : LL.serializer32 serialize_alertDescription_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_alertDescription_key 1ul ()", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong Parsers.AlertDescription.alertDescription_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.write_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.AlertDescription.alertDescription", "FStar.UInt8.t", "Parsers.AlertDescription.alertDescription_enum", "Parsers.AlertDescription.parse_alertDescription_key", "Parsers.AlertDescription.serialize_alertDescription_key", "Parsers.AlertDescription.write_alertDescription_key", "Parsers.AlertDescription.synth_alertDescription", "Parsers.AlertDescription.synth_alertDescription_inv", "Prims.eq2", "Prims.unit", "Parsers.AlertDescription.lemma_synth_alertDescription_inv", "Parsers.AlertDescription.lemma_synth_alertDescription_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertDescription_writer: LL.leaf_writer_strong alertDescription_serializer\nlet alertDescription_writer =", "completed_definiton": "[@@ inline_let ]let _ =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ()\nin\nLL.write_synth write_alertDescription_key\n synth_alertDescription\n synth_alertDescription_inv\n (fun x -> synth_alertDescription_inv x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.alertDescription_bytesize_eqn", "original_source_type": "val alertDescription_bytesize_eqn (x: alertDescription) : Lemma (alertDescription_bytesize x == 1) [SMTPat (alertDescription_bytesize x)]", "source_type": "val alertDescription_bytesize_eqn (x: alertDescription) : Lemma (alertDescription_bytesize x == 1) [SMTPat (alertDescription_bytesize x)]", "source_definition": "let alertDescription_bytesize_eqn x = alertDescription_bytesize_eq x; assert (FStar.Seq.length (LP.serialize alertDescription_serializer x) <= 1); assert (1 <= FStar.Seq.length (LP.serialize alertDescription_serializer x))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 159, "start_col": 38, "end_line": 159, "end_col": 222 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertDescription_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertDescription_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertDescription_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription = x\n\ninline_for_extraction let synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertDescription_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertDescription_inj () : Lemma\n (LP.synth_injective synth_alertDescription) = ()\n\nlet lemma_synth_alertDescription_inv () : Lemma\n (LP.synth_inverse synth_alertDescription synth_alertDescription_inv) = ()\n\nnoextract let parse_alertDescription_key : LP.parser _ (LP.enum_key alertDescription_enum) =\n LP.parse_enum_key alertDescription_repr_parser alertDescription_enum\n\nnoextract let serialize_alertDescription_key : LP.serializer parse_alertDescription_key =\n LP.serialize_enum_key alertDescription_repr_parser alertDescription_repr_serializer alertDescription_enum\n\nnoextract let alertDescription_parser : LP.parser _ alertDescription =\n lemma_synth_alertDescription_inj ();\n parse_alertDescription_key `LP.parse_synth` synth_alertDescription\n\nnoextract let alertDescription_serializer : LP.serializer alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LP.serialize_synth _ synth_alertDescription serialize_alertDescription_key synth_alertDescription_inv ()\n\nlet alertDescription_bytesize (x:alertDescription) : GTot nat = Seq.length (alertDescription_serializer x)\n\nlet alertDescription_bytesize_eq x = ()\n\nlet parse32_alertDescription_key : LS.parser32 parse_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertDescription_repr_parser32 alertDescription_enum)\n\nlet alertDescription_parser32 : LS.parser32 alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n LS.parse32_synth _ synth_alertDescription (fun x->synth_alertDescription x) parse32_alertDescription_key ()\n\nlet serialize32_alertDescription_key : LS.serializer32 serialize_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertDescription_repr_serializer32 alertDescription_enum)\n\nlet alertDescription_serializer32 : LS.serializer32 alertDescription_serializer =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LS.serialize32_synth _ synth_alertDescription _ serialize32_alertDescription_key synth_alertDescription_inv (fun x->synth_alertDescription_inv x) ()\n\nlet alertDescription_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond alertDescription_serializer 1ul) in\n LSZ.size32_constant alertDescription_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_alertDescription_key : LL.validator parse_alertDescription_key =\n LL.mk_validate_enum_key alertDescription_repr_validator alertDescription_repr_reader alertDescription_enum\n\nlet alertDescription_validator =\n lemma_synth_alertDescription_inj ();\n LL.validate_synth validate_alertDescription_key synth_alertDescription ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_alertDescription_key : LL.leaf_reader parse_alertDescription_key =\n LL.mk_read_enum_key alertDescription_repr_reader alertDescription_enum\n\nlet alertDescription_reader =\n [@inline_let] let _ = lemma_synth_alertDescription_inj () in\n LL.read_synth' parse_alertDescription_key synth_alertDescription read_alertDescription_key ()\n\ninline_for_extraction let write_alertDescription_key : LL.leaf_writer_strong serialize_alertDescription_key =\n LL.write_enum_key alertDescription_repr_writer alertDescription_enum (_ by (LP.enum_repr_of_key_tac alertDescription_enum))\n\ninline_for_extraction let lserialize_alertDescription_key : LL.serializer32 serialize_alertDescription_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_alertDescription_key 1ul ()\n\nlet alertDescription_writer =\n [@inline_let] let _ = lemma_synth_alertDescription_inj (); lemma_synth_alertDescription_inv () in\n LL.write_synth write_alertDescription_key synth_alertDescription synth_alertDescription_inv (fun x -> synth_alertDescription_inv x) ()\n\nlet alertDescription_lserializer = LL.serializer32_of_leaf_writer_strong_constant_size alertDescription_writer 1ul ()", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.AlertDescription.alertDescription\n -> FStar.Pervasives.Lemma (ensures Parsers.AlertDescription.alertDescription_bytesize x == 1)\n [SMTPat (Parsers.AlertDescription.alertDescription_bytesize x)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.AlertDescription.alertDescription", "Prims._assert", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.AlertDescription.alertDescription_parser", "Parsers.AlertDescription.alertDescription_serializer", "Prims.unit", "Parsers.AlertDescription.alertDescription_bytesize_eq" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertDescription_bytesize_eqn (x: alertDescription) : Lemma (alertDescription_bytesize x == 1) [SMTPat (alertDescription_bytesize x)]\nlet alertDescription_bytesize_eqn x =", "completed_definiton": "alertDescription_bytesize_eq x;\nassert (FStar.Seq.length (LP.serialize alertDescription_serializer x) <= 1);\nassert (1 <= FStar.Seq.length (LP.serialize alertDescription_serializer x))", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.write_alertDescription_key", "original_source_type": "val write_alertDescription_key:LL.leaf_writer_strong serialize_alertDescription_key", "source_type": "val write_alertDescription_key:LL.leaf_writer_strong serialize_alertDescription_key", "source_definition": "let write_alertDescription_key : LL.leaf_writer_strong serialize_alertDescription_key =\n LL.write_enum_key alertDescription_repr_writer alertDescription_enum (_ by (LP.enum_repr_of_key_tac alertDescription_enum))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 148, "start_col": 2, "end_line": 148, "end_col": 125 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertDescription_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertDescription_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertDescription_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription = x\n\ninline_for_extraction let synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertDescription_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertDescription_inj () : Lemma\n (LP.synth_injective synth_alertDescription) = ()\n\nlet lemma_synth_alertDescription_inv () : Lemma\n (LP.synth_inverse synth_alertDescription synth_alertDescription_inv) = ()\n\nnoextract let parse_alertDescription_key : LP.parser _ (LP.enum_key alertDescription_enum) =\n LP.parse_enum_key alertDescription_repr_parser alertDescription_enum\n\nnoextract let serialize_alertDescription_key : LP.serializer parse_alertDescription_key =\n LP.serialize_enum_key alertDescription_repr_parser alertDescription_repr_serializer alertDescription_enum\n\nnoextract let alertDescription_parser : LP.parser _ alertDescription =\n lemma_synth_alertDescription_inj ();\n parse_alertDescription_key `LP.parse_synth` synth_alertDescription\n\nnoextract let alertDescription_serializer : LP.serializer alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LP.serialize_synth _ synth_alertDescription serialize_alertDescription_key synth_alertDescription_inv ()\n\nlet alertDescription_bytesize (x:alertDescription) : GTot nat = Seq.length (alertDescription_serializer x)\n\nlet alertDescription_bytesize_eq x = ()\n\nlet parse32_alertDescription_key : LS.parser32 parse_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertDescription_repr_parser32 alertDescription_enum)\n\nlet alertDescription_parser32 : LS.parser32 alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n LS.parse32_synth _ synth_alertDescription (fun x->synth_alertDescription x) parse32_alertDescription_key ()\n\nlet serialize32_alertDescription_key : LS.serializer32 serialize_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertDescription_repr_serializer32 alertDescription_enum)\n\nlet alertDescription_serializer32 : LS.serializer32 alertDescription_serializer =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LS.serialize32_synth _ synth_alertDescription _ serialize32_alertDescription_key synth_alertDescription_inv (fun x->synth_alertDescription_inv x) ()\n\nlet alertDescription_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond alertDescription_serializer 1ul) in\n LSZ.size32_constant alertDescription_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_alertDescription_key : LL.validator parse_alertDescription_key =\n LL.mk_validate_enum_key alertDescription_repr_validator alertDescription_repr_reader alertDescription_enum\n\nlet alertDescription_validator =\n lemma_synth_alertDescription_inj ();\n LL.validate_synth validate_alertDescription_key synth_alertDescription ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_alertDescription_key : LL.leaf_reader parse_alertDescription_key =\n LL.mk_read_enum_key alertDescription_repr_reader alertDescription_enum\n\nlet alertDescription_reader =\n [@inline_let] let _ = lemma_synth_alertDescription_inj () in\n LL.read_synth' parse_alertDescription_key synth_alertDescription read_alertDescription_key ()", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong Parsers.AlertDescription.serialize_alertDescription_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.write_enum_key", "Parsers.AlertDescription.alertDescription", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "Parsers.AlertDescription.alertDescription_repr_writer", "Parsers.AlertDescription.alertDescription_enum", "LowParse.Spec.Enum.enum_repr_of_key_cons'", "LowParse.Spec.Enum.enum_tail'", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val write_alertDescription_key:LL.leaf_writer_strong serialize_alertDescription_key\nlet write_alertDescription_key:LL.leaf_writer_strong serialize_alertDescription_key =", "completed_definiton": "LL.write_enum_key alertDescription_repr_writer\n alertDescription_enum\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.enum_repr_of_key_tac alertDescription_enum)))", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fst", "name": "Parsers.AlertDescription.serialize32_alertDescription_key", "original_source_type": "val serialize32_alertDescription_key:LS.serializer32 serialize_alertDescription_key", "source_type": "val serialize32_alertDescription_key:LS.serializer32 serialize_alertDescription_key", "source_definition": "let serialize32_alertDescription_key : LS.serializer32 serialize_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertDescription_repr_serializer32 alertDescription_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 119, "start_col": 2, "end_line": 120, "end_col": 61 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertDescription_enum : LP.enum alertDescription U8.t =\n [@inline_let] let e = [\n Close_notify, 0z;\n Unexpected_message, 10z;\n Bad_record_mac, 20z;\n Record_overflow, 22z;\n Handshake_failure, 40z;\n Bad_certificate, 42z;\n Unsupported_certificate, 43z;\n Certificate_revoked, 44z;\n Certificate_expired, 45z;\n Certificate_unknown, 46z;\n Illegal_parameter, 47z;\n Unknown_ca, 48z;\n Access_denied, 49z;\n Decode_error, 50z;\n Decrypt_error, 51z;\n Protocol_version, 70z;\n Insufficient_security, 71z;\n Internal_error, 80z;\n Inappropriate_fallback, 86z;\n User_canceled, 90z;\n Missing_extension, 109z;\n Unsupported_extension, 110z;\n Unrecognized_name, 112z;\n Bad_certificate_status_response, 113z;\n Unknown_psk_identity, 115z;\n Certificate_required, 116z;\n No_application_protocol, 120z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertDescription_repr_parser = LPI.parse_u8\n\nnoextract let alertDescription_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertDescription_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertDescription_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertDescription_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertDescription_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertDescription_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertDescription_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertDescription_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertDescription (x: LP.enum_key alertDescription_enum) : Tot alertDescription = x\n\ninline_for_extraction let synth_alertDescription_inv (x: alertDescription) : Tot (LP.enum_key alertDescription_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertDescription_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertDescription_inj () : Lemma\n (LP.synth_injective synth_alertDescription) = ()\n\nlet lemma_synth_alertDescription_inv () : Lemma\n (LP.synth_inverse synth_alertDescription synth_alertDescription_inv) = ()\n\nnoextract let parse_alertDescription_key : LP.parser _ (LP.enum_key alertDescription_enum) =\n LP.parse_enum_key alertDescription_repr_parser alertDescription_enum\n\nnoextract let serialize_alertDescription_key : LP.serializer parse_alertDescription_key =\n LP.serialize_enum_key alertDescription_repr_parser alertDescription_repr_serializer alertDescription_enum\n\nnoextract let alertDescription_parser : LP.parser _ alertDescription =\n lemma_synth_alertDescription_inj ();\n parse_alertDescription_key `LP.parse_synth` synth_alertDescription\n\nnoextract let alertDescription_serializer : LP.serializer alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n lemma_synth_alertDescription_inv ();\n LP.serialize_synth _ synth_alertDescription serialize_alertDescription_key synth_alertDescription_inv ()\n\nlet alertDescription_bytesize (x:alertDescription) : GTot nat = Seq.length (alertDescription_serializer x)\n\nlet alertDescription_bytesize_eq x = ()\n\nlet parse32_alertDescription_key : LS.parser32 parse_alertDescription_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertDescription_repr_parser32 alertDescription_enum)\n\nlet alertDescription_parser32 : LS.parser32 alertDescription_parser =\n lemma_synth_alertDescription_inj ();\n LS.parse32_synth _ synth_alertDescription (fun x->synth_alertDescription x) parse32_alertDescription_key ()", "dependencies": { "source_file": "Parsers.AlertDescription.fst", "checked_file": "Parsers.AlertDescription.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.AlertDescription.serialize_alertDescription_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Enum.serialize32_enum_key_gen", "LowParse.Spec.Int.parse_u8_kind", "Parsers.AlertDescription.alertDescription", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "Parsers.AlertDescription.alertDescription_repr_serializer32", "Parsers.AlertDescription.alertDescription_enum", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Enum.enum_key", "Parsers.AlertDescription.parse_alertDescription_key", "Parsers.AlertDescription.serialize_alertDescription_key", "LowParse.Spec.Enum.enum_repr_of_key_cons'", "LowParse.Spec.Enum.enum_tail'", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize32_alertDescription_key:LS.serializer32 serialize_alertDescription_key\nlet serialize32_alertDescription_key:LS.serializer32 serialize_alertDescription_key =", "completed_definiton": "FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac alertDescription_repr_serializer32\n alertDescription_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fsti", "name": "Parsers.AlertLevel.alertLevel_parser_kind", "original_source_type": "", "source_type": "val alertLevel_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let alertLevel_parser_kind = LP.strong_parser_kind 1 1 None", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 29, "start_col": 61, "end_line": 29, "end_col": 91 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ntype alertLevel =\n | Warning\n | Fatal\n\nlet string_of_alertLevel = function\n | Warning -> \"warning\"\n | Fatal -> \"fatal\"", "dependencies": { "source_file": "Parsers.AlertLevel.fsti", "checked_file": "Parsers.AlertLevel.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alertLevel_parser_kind =", "completed_definiton": "LP.strong_parser_kind 1 1 None", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fsti", "name": "Parsers.AlertLevel.string_of_alertLevel", "original_source_type": "", "source_type": "val string_of_alertLevel : _: Parsers.AlertLevel.alertLevel -> Prims.string", "source_definition": "let string_of_alertLevel = function\n | Warning -> \"warning\"\n | Fatal -> \"fatal\"", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 25, "start_col": 27, "end_line": 27, "end_col": 20 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ntype alertLevel =\n | Warning\n | Fatal", "dependencies": { "source_file": "Parsers.AlertLevel.fsti", "checked_file": "Parsers.AlertLevel.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Parsers.AlertLevel.alertLevel -> Prims.string", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.AlertLevel.alertLevel", "Prims.string" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let string_of_alertLevel =", "completed_definiton": "function\n| Warning -> \"warning\"\n| Fatal -> \"fatal\"", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fsti", "name": "Parsers.AlertLevel.alertLevel_jumper", "original_source_type": "val alertLevel_jumper:LL.jumper alertLevel_parser", "source_type": "val alertLevel_jumper:LL.jumper alertLevel_parser", "source_definition": "let alertLevel_jumper: LL.jumper alertLevel_parser = LL.jump_constant_size alertLevel_parser 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 47, "start_col": 53, "end_line": 47, "end_col": 99 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ntype alertLevel =\n | Warning\n | Fatal\n\nlet string_of_alertLevel = function\n | Warning -> \"warning\"\n | Fatal -> \"fatal\"\n\ninline_for_extraction noextract let alertLevel_parser_kind = LP.strong_parser_kind 1 1 None\n\nnoextract val alertLevel_parser: LP.parser alertLevel_parser_kind alertLevel\n\nnoextract val alertLevel_serializer: LP.serializer alertLevel_parser\n\nnoextract val alertLevel_bytesize (x:alertLevel) : GTot nat\n\nnoextract val alertLevel_bytesize_eq (x:alertLevel) : Lemma (alertLevel_bytesize x == Seq.length (LP.serialize alertLevel_serializer x))\n\nval alertLevel_parser32: LS.parser32 alertLevel_parser\n\nval alertLevel_serializer32: LS.serializer32 alertLevel_serializer\n\nval alertLevel_size32: LSZ.size32 alertLevel_serializer\n\nval alertLevel_validator: LL.validator alertLevel_parser", "dependencies": { "source_file": "Parsers.AlertLevel.fsti", "checked_file": "Parsers.AlertLevel.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.AlertLevel.alertLevel_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.jump_constant_size", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertLevel.alertLevel", "Parsers.AlertLevel.alertLevel_parser", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertLevel_jumper:LL.jumper alertLevel_parser\nlet alertLevel_jumper:LL.jumper alertLevel_parser =", "completed_definiton": "LL.jump_constant_size alertLevel_parser 1ul ()", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aes256_compute_pre", "original_source_type": "", "source_type": "val aes256_compute_pre : _: _ -> Prims.logical", "source_definition": "let aes256_compute_pre = fun _ -> False", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 22, "start_col": 25, "end_line": 22, "end_col": 39 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aes256_compute_pre =", "completed_definiton": "fun _ -> False", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aes128_compute_pre", "original_source_type": "", "source_type": "val aes128_compute_pre : _: _ -> Prims.logical", "source_definition": "let aes128_compute_pre = fun _ -> False", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 15, "start_col": 25, "end_line": 15, "end_col": 39 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aes128_compute_pre =", "completed_definiton": "fun _ -> False", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aes256_compute_post", "original_source_type": "", "source_type": "val aes256_compute_post : _: _ -> _: _ -> _: _ -> Prims.logical", "source_definition": "let aes256_compute_post = fun _ _ _ -> True", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 23, "start_col": 26, "end_line": 23, "end_col": 43 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> _: _ -> _: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aes256_compute_post =", "completed_definiton": "fun _ _ _ -> True", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.random_cleanup_pre", "original_source_type": "", "source_type": "val random_cleanup_pre : _: _ -> Prims.logical", "source_definition": "let random_cleanup_pre = fun _ -> False", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 10, "start_col": 25, "end_line": 10, "end_col": 39 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let random_cleanup_pre =", "completed_definiton": "fun _ -> False", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aes128_gcm_decrypt_pre", "original_source_type": "", "source_type": "val aes128_gcm_decrypt_pre : _: _ -> Prims.logical", "source_definition": "let aes128_gcm_decrypt_pre = fun _ -> False", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 32, "start_col": 29, "end_line": 32, "end_col": 43 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True\nlet aes256_free_pre = fun _ -> False\nlet aes256_free_post = fun _ _ _ -> True\n\nlet chacha20_pre = fun _ -> False\nlet chacha20_post = fun _ _ _ -> True\n\nlet aes128_gcm_encrypt_pre = fun _ -> False", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aes128_gcm_decrypt_pre =", "completed_definiton": "fun _ -> False", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aes256_free_post", "original_source_type": "", "source_type": "val aes256_free_post : _: _ -> _: _ -> _: _ -> Prims.logical", "source_definition": "let aes256_free_post = fun _ _ _ -> True", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 25, "start_col": 23, "end_line": 25, "end_col": 40 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> _: _ -> _: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aes256_free_post =", "completed_definiton": "fun _ _ _ -> True", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.random_sample_post", "original_source_type": "", "source_type": "val random_sample_post : _: _ -> _: _ -> _: _ -> Prims.logical", "source_definition": "let random_sample_post = fun _ _ _ -> True", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 9, "start_col": 25, "end_line": 9, "end_col": 42 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> _: _ -> _: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let random_sample_post =", "completed_definiton": "fun _ _ _ -> True", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aes128_compute_post", "original_source_type": "", "source_type": "val aes128_compute_post : _: _ -> _: _ -> _: _ -> Prims.logical", "source_definition": "let aes128_compute_post = fun _ _ _ -> True", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 16, "start_col": 26, "end_line": 16, "end_col": 43 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> _: _ -> _: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aes128_compute_post =", "completed_definiton": "fun _ _ _ -> True", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.chacha20_pre", "original_source_type": "", "source_type": "val chacha20_pre : _: _ -> Prims.logical", "source_definition": "let chacha20_pre = fun _ -> False", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 27, "start_col": 19, "end_line": 27, "end_col": 33 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True\nlet aes256_free_pre = fun _ -> False\nlet aes256_free_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let chacha20_pre =", "completed_definiton": "fun _ -> False", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aes256_gcm_decrypt_post", "original_source_type": "", "source_type": "val aes256_gcm_decrypt_post : _: _ -> _: _ -> _: _ -> Prims.logical", "source_definition": "let aes256_gcm_decrypt_post = fun _ _ _ -> True", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 37, "start_col": 30, "end_line": 37, "end_col": 47 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True\nlet aes256_free_pre = fun _ -> False\nlet aes256_free_post = fun _ _ _ -> True\n\nlet chacha20_pre = fun _ -> False\nlet chacha20_post = fun _ _ _ -> True\n\nlet aes128_gcm_encrypt_pre = fun _ -> False\nlet aes128_gcm_encrypt_post = fun _ _ _ -> True\nlet aes128_gcm_decrypt_pre = fun _ -> False\nlet aes128_gcm_decrypt_post = fun _ _ _ -> True\nlet aes256_gcm_encrypt_pre = fun _ -> False\nlet aes256_gcm_encrypt_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> _: _ -> _: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aes256_gcm_decrypt_post =", "completed_definiton": "fun _ _ _ -> True", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aes128_gcm_decrypt_post", "original_source_type": "", "source_type": "val aes128_gcm_decrypt_post : _: _ -> _: _ -> _: _ -> Prims.logical", "source_definition": "let aes128_gcm_decrypt_post = fun _ _ _ -> True", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 33, "start_col": 30, "end_line": 33, "end_col": 47 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True\nlet aes256_free_pre = fun _ -> False\nlet aes256_free_post = fun _ _ _ -> True\n\nlet chacha20_pre = fun _ -> False\nlet chacha20_post = fun _ _ _ -> True\n\nlet aes128_gcm_encrypt_pre = fun _ -> False\nlet aes128_gcm_encrypt_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> _: _ -> _: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aes128_gcm_decrypt_post =", "completed_definiton": "fun _ _ _ -> True", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aes256_create_pre", "original_source_type": "", "source_type": "val aes256_create_pre : _: _ -> Prims.logical", "source_definition": "let aes256_create_pre = fun _ -> False", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 20, "start_col": 24, "end_line": 20, "end_col": 38 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aes256_create_pre =", "completed_definiton": "fun _ -> False", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.chacha20_poly1305_decrypt_post", "original_source_type": "", "source_type": "val chacha20_poly1305_decrypt_post : _: _ -> _: _ -> _: _ -> Prims.logical", "source_definition": "let chacha20_poly1305_decrypt_post = fun _ _ _ -> True", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 42, "start_col": 37, "end_line": 42, "end_col": 54 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True\nlet aes256_free_pre = fun _ -> False\nlet aes256_free_post = fun _ _ _ -> True\n\nlet chacha20_pre = fun _ -> False\nlet chacha20_post = fun _ _ _ -> True\n\nlet aes128_gcm_encrypt_pre = fun _ -> False\nlet aes128_gcm_encrypt_post = fun _ _ _ -> True\nlet aes128_gcm_decrypt_pre = fun _ -> False\nlet aes128_gcm_decrypt_post = fun _ _ _ -> True\nlet aes256_gcm_encrypt_pre = fun _ -> False\nlet aes256_gcm_encrypt_post = fun _ _ _ -> True\nlet aes256_gcm_decrypt_pre = fun _ -> False\nlet aes256_gcm_decrypt_post = fun _ _ _ -> True\n\nlet chacha20_poly1305_encrypt_pre = fun _ -> False\nlet chacha20_poly1305_encrypt_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> _: _ -> _: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let chacha20_poly1305_decrypt_post =", "completed_definiton": "fun _ _ _ -> True", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aes256_free_pre", "original_source_type": "", "source_type": "val aes256_free_pre : _: _ -> Prims.logical", "source_definition": "let aes256_free_pre = fun _ -> False", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 24, "start_col": 22, "end_line": 24, "end_col": 36 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aes256_free_pre =", "completed_definiton": "fun _ -> False", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aes128_gcm_encrypt_pre", "original_source_type": "", "source_type": "val aes128_gcm_encrypt_pre : _: _ -> Prims.logical", "source_definition": "let aes128_gcm_encrypt_pre = fun _ -> False", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 30, "start_col": 29, "end_line": 30, "end_col": 43 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True\nlet aes256_free_pre = fun _ -> False\nlet aes256_free_post = fun _ _ _ -> True\n\nlet chacha20_pre = fun _ -> False\nlet chacha20_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aes128_gcm_encrypt_pre =", "completed_definiton": "fun _ -> False", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aes256_gcm_encrypt_pre", "original_source_type": "", "source_type": "val aes256_gcm_encrypt_pre : _: _ -> Prims.logical", "source_definition": "let aes256_gcm_encrypt_pre = fun _ -> False", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 34, "start_col": 29, "end_line": 34, "end_col": 43 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True\nlet aes256_free_pre = fun _ -> False\nlet aes256_free_post = fun _ _ _ -> True\n\nlet chacha20_pre = fun _ -> False\nlet chacha20_post = fun _ _ _ -> True\n\nlet aes128_gcm_encrypt_pre = fun _ -> False\nlet aes128_gcm_encrypt_post = fun _ _ _ -> True\nlet aes128_gcm_decrypt_pre = fun _ -> False", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aes256_gcm_encrypt_pre =", "completed_definiton": "fun _ -> False", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aead_decrypt_pre", "original_source_type": "", "source_type": "val aead_decrypt_pre : _: _ -> Prims.logical", "source_definition": "let aead_decrypt_pre = fun _ -> False", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 48, "start_col": 23, "end_line": 48, "end_col": 37 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True\nlet aes256_free_pre = fun _ -> False\nlet aes256_free_post = fun _ _ _ -> True\n\nlet chacha20_pre = fun _ -> False\nlet chacha20_post = fun _ _ _ -> True\n\nlet aes128_gcm_encrypt_pre = fun _ -> False\nlet aes128_gcm_encrypt_post = fun _ _ _ -> True\nlet aes128_gcm_decrypt_pre = fun _ -> False\nlet aes128_gcm_decrypt_post = fun _ _ _ -> True\nlet aes256_gcm_encrypt_pre = fun _ -> False\nlet aes256_gcm_encrypt_post = fun _ _ _ -> True\nlet aes256_gcm_decrypt_pre = fun _ -> False\nlet aes256_gcm_decrypt_post = fun _ _ _ -> True\n\nlet chacha20_poly1305_encrypt_pre = fun _ -> False\nlet chacha20_poly1305_encrypt_post = fun _ _ _ -> True\nlet chacha20_poly1305_decrypt_pre = fun _ -> False\nlet chacha20_poly1305_decrypt_post = fun _ _ _ -> True\n\nlet aead_create_pre = fun _ -> False\nlet aead_create_post = fun _ _ _ -> True\nlet aead_encrypt_pre = fun _ -> False", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aead_decrypt_pre =", "completed_definiton": "fun _ -> False", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.random_sample_pre", "original_source_type": "", "source_type": "val random_sample_pre : _: _ -> Prims.logical", "source_definition": "let random_sample_pre = fun _ -> False", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 8, "start_col": 24, "end_line": 8, "end_col": 38 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let random_sample_pre =", "completed_definiton": "fun _ -> False", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aes128_create_post", "original_source_type": "", "source_type": "val aes128_create_post : _: _ -> _: _ -> _: _ -> Prims.logical", "source_definition": "let aes128_create_post = fun _ _ _ -> True", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 14, "start_col": 25, "end_line": 14, "end_col": 42 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> _: _ -> _: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aes128_create_post =", "completed_definiton": "fun _ _ _ -> True", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aead_decrypt_post", "original_source_type": "", "source_type": "val aead_decrypt_post : _: _ -> _: _ -> _: _ -> Prims.logical", "source_definition": "let aead_decrypt_post = fun _ _ _ -> True", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 49, "start_col": 24, "end_line": 49, "end_col": 41 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True\nlet aes256_free_pre = fun _ -> False\nlet aes256_free_post = fun _ _ _ -> True\n\nlet chacha20_pre = fun _ -> False\nlet chacha20_post = fun _ _ _ -> True\n\nlet aes128_gcm_encrypt_pre = fun _ -> False\nlet aes128_gcm_encrypt_post = fun _ _ _ -> True\nlet aes128_gcm_decrypt_pre = fun _ -> False\nlet aes128_gcm_decrypt_post = fun _ _ _ -> True\nlet aes256_gcm_encrypt_pre = fun _ -> False\nlet aes256_gcm_encrypt_post = fun _ _ _ -> True\nlet aes256_gcm_decrypt_pre = fun _ -> False\nlet aes256_gcm_decrypt_post = fun _ _ _ -> True\n\nlet chacha20_poly1305_encrypt_pre = fun _ -> False\nlet chacha20_poly1305_encrypt_post = fun _ _ _ -> True\nlet chacha20_poly1305_decrypt_pre = fun _ -> False\nlet chacha20_poly1305_decrypt_post = fun _ _ _ -> True\n\nlet aead_create_pre = fun _ -> False\nlet aead_create_post = fun _ _ _ -> True\nlet aead_encrypt_pre = fun _ -> False\nlet aead_encrypt_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> _: _ -> _: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aead_decrypt_post =", "completed_definiton": "fun _ _ _ -> True", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aead_encrypt_pre", "original_source_type": "", "source_type": "val aead_encrypt_pre : _: _ -> Prims.logical", "source_definition": "let aead_encrypt_pre = fun _ -> False", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 46, "start_col": 23, "end_line": 46, "end_col": 37 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True\nlet aes256_free_pre = fun _ -> False\nlet aes256_free_post = fun _ _ _ -> True\n\nlet chacha20_pre = fun _ -> False\nlet chacha20_post = fun _ _ _ -> True\n\nlet aes128_gcm_encrypt_pre = fun _ -> False\nlet aes128_gcm_encrypt_post = fun _ _ _ -> True\nlet aes128_gcm_decrypt_pre = fun _ -> False\nlet aes128_gcm_decrypt_post = fun _ _ _ -> True\nlet aes256_gcm_encrypt_pre = fun _ -> False\nlet aes256_gcm_encrypt_post = fun _ _ _ -> True\nlet aes256_gcm_decrypt_pre = fun _ -> False\nlet aes256_gcm_decrypt_post = fun _ _ _ -> True\n\nlet chacha20_poly1305_encrypt_pre = fun _ -> False\nlet chacha20_poly1305_encrypt_post = fun _ _ _ -> True\nlet chacha20_poly1305_decrypt_pre = fun _ -> False\nlet chacha20_poly1305_decrypt_post = fun _ _ _ -> True\n\nlet aead_create_pre = fun _ -> False", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aead_encrypt_pre =", "completed_definiton": "fun _ -> False", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.chacha20_poly1305_decrypt_pre", "original_source_type": "", "source_type": "val chacha20_poly1305_decrypt_pre : _: _ -> Prims.logical", "source_definition": "let chacha20_poly1305_decrypt_pre = fun _ -> False", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 41, "start_col": 36, "end_line": 41, "end_col": 50 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True\nlet aes256_free_pre = fun _ -> False\nlet aes256_free_post = fun _ _ _ -> True\n\nlet chacha20_pre = fun _ -> False\nlet chacha20_post = fun _ _ _ -> True\n\nlet aes128_gcm_encrypt_pre = fun _ -> False\nlet aes128_gcm_encrypt_post = fun _ _ _ -> True\nlet aes128_gcm_decrypt_pre = fun _ -> False\nlet aes128_gcm_decrypt_post = fun _ _ _ -> True\nlet aes256_gcm_encrypt_pre = fun _ -> False\nlet aes256_gcm_encrypt_post = fun _ _ _ -> True\nlet aes256_gcm_decrypt_pre = fun _ -> False\nlet aes256_gcm_decrypt_post = fun _ _ _ -> True\n\nlet chacha20_poly1305_encrypt_pre = fun _ -> False", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let chacha20_poly1305_decrypt_pre =", "completed_definiton": "fun _ -> False", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aes128_free_pre", "original_source_type": "", "source_type": "val aes128_free_pre : _: _ -> Prims.logical", "source_definition": "let aes128_free_pre = fun _ -> False", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 17, "start_col": 22, "end_line": 17, "end_col": 36 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aes128_free_pre =", "completed_definiton": "fun _ -> False", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aes256_gcm_decrypt_pre", "original_source_type": "", "source_type": "val aes256_gcm_decrypt_pre : _: _ -> Prims.logical", "source_definition": "let aes256_gcm_decrypt_pre = fun _ -> False", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 36, "start_col": 29, "end_line": 36, "end_col": 43 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True\nlet aes256_free_pre = fun _ -> False\nlet aes256_free_post = fun _ _ _ -> True\n\nlet chacha20_pre = fun _ -> False\nlet chacha20_post = fun _ _ _ -> True\n\nlet aes128_gcm_encrypt_pre = fun _ -> False\nlet aes128_gcm_encrypt_post = fun _ _ _ -> True\nlet aes128_gcm_decrypt_pre = fun _ -> False\nlet aes128_gcm_decrypt_post = fun _ _ _ -> True\nlet aes256_gcm_encrypt_pre = fun _ -> False", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aes256_gcm_decrypt_pre =", "completed_definiton": "fun _ -> False", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.curve_x25519_post", "original_source_type": "", "source_type": "val curve_x25519_post : _: _ -> _: _ -> _: _ -> Prims.logical", "source_definition": "let curve_x25519_post = fun _ _ _ -> True", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 4, "start_col": 24, "end_line": 4, "end_col": 41 }, "file_context": "module EverCrypt.Specs", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> _: _ -> _: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let curve_x25519_post =", "completed_definiton": "fun _ _ _ -> True", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aes128_gcm_encrypt_post", "original_source_type": "", "source_type": "val aes128_gcm_encrypt_post : _: _ -> _: _ -> _: _ -> Prims.logical", "source_definition": "let aes128_gcm_encrypt_post = fun _ _ _ -> True", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 31, "start_col": 30, "end_line": 31, "end_col": 47 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True\nlet aes256_free_pre = fun _ -> False\nlet aes256_free_post = fun _ _ _ -> True\n\nlet chacha20_pre = fun _ -> False\nlet chacha20_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> _: _ -> _: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aes128_gcm_encrypt_post =", "completed_definiton": "fun _ _ _ -> True", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.chacha20_poly1305_encrypt_pre", "original_source_type": "", "source_type": "val chacha20_poly1305_encrypt_pre : _: _ -> Prims.logical", "source_definition": "let chacha20_poly1305_encrypt_pre = fun _ -> False", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 39, "start_col": 36, "end_line": 39, "end_col": 50 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True\nlet aes256_free_pre = fun _ -> False\nlet aes256_free_post = fun _ _ _ -> True\n\nlet chacha20_pre = fun _ -> False\nlet chacha20_post = fun _ _ _ -> True\n\nlet aes128_gcm_encrypt_pre = fun _ -> False\nlet aes128_gcm_encrypt_post = fun _ _ _ -> True\nlet aes128_gcm_decrypt_pre = fun _ -> False\nlet aes128_gcm_decrypt_post = fun _ _ _ -> True\nlet aes256_gcm_encrypt_pre = fun _ -> False\nlet aes256_gcm_encrypt_post = fun _ _ _ -> True\nlet aes256_gcm_decrypt_pre = fun _ -> False\nlet aes256_gcm_decrypt_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let chacha20_poly1305_encrypt_pre =", "completed_definiton": "fun _ -> False", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aes256_create_post", "original_source_type": "", "source_type": "val aes256_create_post : _: _ -> _: _ -> _: _ -> Prims.logical", "source_definition": "let aes256_create_post = fun _ _ _ -> True", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 21, "start_col": 25, "end_line": 21, "end_col": 42 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> _: _ -> _: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aes256_create_post =", "completed_definiton": "fun _ _ _ -> True", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.chacha20_post", "original_source_type": "", "source_type": "val chacha20_post : _: _ -> _: _ -> _: _ -> Prims.logical", "source_definition": "let chacha20_post = fun _ _ _ -> True", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 28, "start_col": 20, "end_line": 28, "end_col": 37 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True\nlet aes256_free_pre = fun _ -> False\nlet aes256_free_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> _: _ -> _: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let chacha20_post =", "completed_definiton": "fun _ _ _ -> True", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aead_create_pre", "original_source_type": "", "source_type": "val aead_create_pre : _: _ -> Prims.logical", "source_definition": "let aead_create_pre = fun _ -> False", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 44, "start_col": 22, "end_line": 44, "end_col": 36 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True\nlet aes256_free_pre = fun _ -> False\nlet aes256_free_post = fun _ _ _ -> True\n\nlet chacha20_pre = fun _ -> False\nlet chacha20_post = fun _ _ _ -> True\n\nlet aes128_gcm_encrypt_pre = fun _ -> False\nlet aes128_gcm_encrypt_post = fun _ _ _ -> True\nlet aes128_gcm_decrypt_pre = fun _ -> False\nlet aes128_gcm_decrypt_post = fun _ _ _ -> True\nlet aes256_gcm_encrypt_pre = fun _ -> False\nlet aes256_gcm_encrypt_post = fun _ _ _ -> True\nlet aes256_gcm_decrypt_pre = fun _ -> False\nlet aes256_gcm_decrypt_post = fun _ _ _ -> True\n\nlet chacha20_poly1305_encrypt_pre = fun _ -> False\nlet chacha20_poly1305_encrypt_post = fun _ _ _ -> True\nlet chacha20_poly1305_decrypt_pre = fun _ -> False\nlet chacha20_poly1305_decrypt_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aead_create_pre =", "completed_definiton": "fun _ -> False", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.random_cleanup_post", "original_source_type": "", "source_type": "val random_cleanup_post : _: _ -> _: _ -> _: _ -> Prims.logical", "source_definition": "let random_cleanup_post = fun _ _ _ -> True", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 11, "start_col": 26, "end_line": 11, "end_col": 43 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> _: _ -> _: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let random_cleanup_post =", "completed_definiton": "fun _ _ _ -> True", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aes128_free_post", "original_source_type": "", "source_type": "val aes128_free_post : _: _ -> _: _ -> _: _ -> Prims.logical", "source_definition": "let aes128_free_post = fun _ _ _ -> True", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 18, "start_col": 23, "end_line": 18, "end_col": 40 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> _: _ -> _: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aes128_free_post =", "completed_definiton": "fun _ _ _ -> True", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.curve_x25519_pre", "original_source_type": "", "source_type": "val curve_x25519_pre : _: _ -> Prims.logical", "source_definition": "let curve_x25519_pre = fun _ -> False", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 3, "start_col": 23, "end_line": 3, "end_col": 37 }, "file_context": "module EverCrypt.Specs", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let curve_x25519_pre =", "completed_definiton": "fun _ -> False", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.random_init_pre", "original_source_type": "", "source_type": "val random_init_pre : _: _ -> Prims.logical", "source_definition": "let random_init_pre = fun _ -> False", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 6, "start_col": 22, "end_line": 6, "end_col": 36 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let random_init_pre =", "completed_definiton": "fun _ -> False", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aead_create_post", "original_source_type": "", "source_type": "val aead_create_post : _: _ -> _: _ -> _: _ -> Prims.logical", "source_definition": "let aead_create_post = fun _ _ _ -> True", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 45, "start_col": 23, "end_line": 45, "end_col": 40 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True\nlet aes256_free_pre = fun _ -> False\nlet aes256_free_post = fun _ _ _ -> True\n\nlet chacha20_pre = fun _ -> False\nlet chacha20_post = fun _ _ _ -> True\n\nlet aes128_gcm_encrypt_pre = fun _ -> False\nlet aes128_gcm_encrypt_post = fun _ _ _ -> True\nlet aes128_gcm_decrypt_pre = fun _ -> False\nlet aes128_gcm_decrypt_post = fun _ _ _ -> True\nlet aes256_gcm_encrypt_pre = fun _ -> False\nlet aes256_gcm_encrypt_post = fun _ _ _ -> True\nlet aes256_gcm_decrypt_pre = fun _ -> False\nlet aes256_gcm_decrypt_post = fun _ _ _ -> True\n\nlet chacha20_poly1305_encrypt_pre = fun _ -> False\nlet chacha20_poly1305_encrypt_post = fun _ _ _ -> True\nlet chacha20_poly1305_decrypt_pre = fun _ -> False\nlet chacha20_poly1305_decrypt_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> _: _ -> _: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aead_create_post =", "completed_definiton": "fun _ _ _ -> True", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aead_free_post", "original_source_type": "", "source_type": "val aead_free_post : _: _ -> _: _ -> _: _ -> Prims.logical", "source_definition": "let aead_free_post = fun _ _ _ -> True", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 51, "start_col": 21, "end_line": 51, "end_col": 38 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True\nlet aes256_free_pre = fun _ -> False\nlet aes256_free_post = fun _ _ _ -> True\n\nlet chacha20_pre = fun _ -> False\nlet chacha20_post = fun _ _ _ -> True\n\nlet aes128_gcm_encrypt_pre = fun _ -> False\nlet aes128_gcm_encrypt_post = fun _ _ _ -> True\nlet aes128_gcm_decrypt_pre = fun _ -> False\nlet aes128_gcm_decrypt_post = fun _ _ _ -> True\nlet aes256_gcm_encrypt_pre = fun _ -> False\nlet aes256_gcm_encrypt_post = fun _ _ _ -> True\nlet aes256_gcm_decrypt_pre = fun _ -> False\nlet aes256_gcm_decrypt_post = fun _ _ _ -> True\n\nlet chacha20_poly1305_encrypt_pre = fun _ -> False\nlet chacha20_poly1305_encrypt_post = fun _ _ _ -> True\nlet chacha20_poly1305_decrypt_pre = fun _ -> False\nlet chacha20_poly1305_decrypt_post = fun _ _ _ -> True\n\nlet aead_create_pre = fun _ -> False\nlet aead_create_post = fun _ _ _ -> True\nlet aead_encrypt_pre = fun _ -> False\nlet aead_encrypt_post = fun _ _ _ -> True\nlet aead_decrypt_pre = fun _ -> False\nlet aead_decrypt_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> _: _ -> _: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aead_free_post =", "completed_definiton": "fun _ _ _ -> True", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aead_free_pre", "original_source_type": "", "source_type": "val aead_free_pre : _: _ -> Prims.logical", "source_definition": "let aead_free_pre = fun _ -> False", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 50, "start_col": 20, "end_line": 50, "end_col": 34 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True\nlet aes256_free_pre = fun _ -> False\nlet aes256_free_post = fun _ _ _ -> True\n\nlet chacha20_pre = fun _ -> False\nlet chacha20_post = fun _ _ _ -> True\n\nlet aes128_gcm_encrypt_pre = fun _ -> False\nlet aes128_gcm_encrypt_post = fun _ _ _ -> True\nlet aes128_gcm_decrypt_pre = fun _ -> False\nlet aes128_gcm_decrypt_post = fun _ _ _ -> True\nlet aes256_gcm_encrypt_pre = fun _ -> False\nlet aes256_gcm_encrypt_post = fun _ _ _ -> True\nlet aes256_gcm_decrypt_pre = fun _ -> False\nlet aes256_gcm_decrypt_post = fun _ _ _ -> True\n\nlet chacha20_poly1305_encrypt_pre = fun _ -> False\nlet chacha20_poly1305_encrypt_post = fun _ _ _ -> True\nlet chacha20_poly1305_decrypt_pre = fun _ -> False\nlet chacha20_poly1305_decrypt_post = fun _ _ _ -> True\n\nlet aead_create_pre = fun _ -> False\nlet aead_create_post = fun _ _ _ -> True\nlet aead_encrypt_pre = fun _ -> False\nlet aead_encrypt_post = fun _ _ _ -> True\nlet aead_decrypt_pre = fun _ -> False", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aead_free_pre =", "completed_definiton": "fun _ -> False", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.random_init_post", "original_source_type": "", "source_type": "val random_init_post : _: _ -> _: _ -> _: _ -> Prims.logical", "source_definition": "let random_init_post = fun _ _ _ -> True", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 7, "start_col": 23, "end_line": 7, "end_col": 40 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> _: _ -> _: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let random_init_post =", "completed_definiton": "fun _ _ _ -> True", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aes128_create_pre", "original_source_type": "", "source_type": "val aes128_create_pre : _: _ -> Prims.logical", "source_definition": "let aes128_create_pre = fun _ -> False", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 13, "start_col": 24, "end_line": 13, "end_col": 38 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aes128_create_pre =", "completed_definiton": "fun _ -> False", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aes256_gcm_encrypt_post", "original_source_type": "", "source_type": "val aes256_gcm_encrypt_post : _: _ -> _: _ -> _: _ -> Prims.logical", "source_definition": "let aes256_gcm_encrypt_post = fun _ _ _ -> True", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 35, "start_col": 30, "end_line": 35, "end_col": 47 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True\nlet aes256_free_pre = fun _ -> False\nlet aes256_free_post = fun _ _ _ -> True\n\nlet chacha20_pre = fun _ -> False\nlet chacha20_post = fun _ _ _ -> True\n\nlet aes128_gcm_encrypt_pre = fun _ -> False\nlet aes128_gcm_encrypt_post = fun _ _ _ -> True\nlet aes128_gcm_decrypt_pre = fun _ -> False\nlet aes128_gcm_decrypt_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> _: _ -> _: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aes256_gcm_encrypt_post =", "completed_definiton": "fun _ _ _ -> True", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.chacha20_poly1305_encrypt_post", "original_source_type": "", "source_type": "val chacha20_poly1305_encrypt_post : _: _ -> _: _ -> _: _ -> Prims.logical", "source_definition": "let chacha20_poly1305_encrypt_post = fun _ _ _ -> True", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 40, "start_col": 37, "end_line": 40, "end_col": 54 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True\nlet aes256_free_pre = fun _ -> False\nlet aes256_free_post = fun _ _ _ -> True\n\nlet chacha20_pre = fun _ -> False\nlet chacha20_post = fun _ _ _ -> True\n\nlet aes128_gcm_encrypt_pre = fun _ -> False\nlet aes128_gcm_encrypt_post = fun _ _ _ -> True\nlet aes128_gcm_decrypt_pre = fun _ -> False\nlet aes128_gcm_decrypt_post = fun _ _ _ -> True\nlet aes256_gcm_encrypt_pre = fun _ -> False\nlet aes256_gcm_encrypt_post = fun _ _ _ -> True\nlet aes256_gcm_decrypt_pre = fun _ -> False\nlet aes256_gcm_decrypt_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> _: _ -> _: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let chacha20_poly1305_encrypt_post =", "completed_definiton": "fun _ _ _ -> True", "isa_cross_project_example": true }, { "file_name": "EverCrypt.Specs.fsti", "name": "EverCrypt.Specs.aead_encrypt_post", "original_source_type": "", "source_type": "val aead_encrypt_post : _: _ -> _: _ -> _: _ -> Prims.logical", "source_definition": "let aead_encrypt_post = fun _ _ _ -> True", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.Specs.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 47, "start_col": 24, "end_line": 47, "end_col": 41 }, "file_context": "module EverCrypt.Specs\n\nlet curve_x25519_pre = fun _ -> False\nlet curve_x25519_post = fun _ _ _ -> True\n\nlet random_init_pre = fun _ -> False\nlet random_init_post = fun _ _ _ -> True\nlet random_sample_pre = fun _ -> False\nlet random_sample_post = fun _ _ _ -> True\nlet random_cleanup_pre = fun _ -> False\nlet random_cleanup_post = fun _ _ _ -> True\n\nlet aes128_create_pre = fun _ -> False\nlet aes128_create_post = fun _ _ _ -> True\nlet aes128_compute_pre = fun _ -> False\nlet aes128_compute_post = fun _ _ _ -> True\nlet aes128_free_pre = fun _ -> False\nlet aes128_free_post = fun _ _ _ -> True\n\nlet aes256_create_pre = fun _ -> False\nlet aes256_create_post = fun _ _ _ -> True\nlet aes256_compute_pre = fun _ -> False\nlet aes256_compute_post = fun _ _ _ -> True\nlet aes256_free_pre = fun _ -> False\nlet aes256_free_post = fun _ _ _ -> True\n\nlet chacha20_pre = fun _ -> False\nlet chacha20_post = fun _ _ _ -> True\n\nlet aes128_gcm_encrypt_pre = fun _ -> False\nlet aes128_gcm_encrypt_post = fun _ _ _ -> True\nlet aes128_gcm_decrypt_pre = fun _ -> False\nlet aes128_gcm_decrypt_post = fun _ _ _ -> True\nlet aes256_gcm_encrypt_pre = fun _ -> False\nlet aes256_gcm_encrypt_post = fun _ _ _ -> True\nlet aes256_gcm_decrypt_pre = fun _ -> False\nlet aes256_gcm_decrypt_post = fun _ _ _ -> True\n\nlet chacha20_poly1305_encrypt_pre = fun _ -> False\nlet chacha20_poly1305_encrypt_post = fun _ _ _ -> True\nlet chacha20_poly1305_decrypt_pre = fun _ -> False\nlet chacha20_poly1305_decrypt_post = fun _ _ _ -> True\n\nlet aead_create_pre = fun _ -> False\nlet aead_create_post = fun _ _ _ -> True", "dependencies": { "source_file": "EverCrypt.Specs.fsti", "checked_file": "EverCrypt.Specs.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: _ -> _: _ -> _: _ -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aead_encrypt_post =", "completed_definiton": "fun _ _ _ -> True", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.compressionMethod_repr_jumper", "original_source_type": "", "source_type": "val compressionMethod_repr_jumper : LowParse.Low.Base.jumper LowParse.Spec.Int.parse_u8", "source_definition": "let compressionMethod_repr_jumper = LL.jump_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 46, "start_col": 68, "end_line": 46, "end_col": 78 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.jump_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let compressionMethod_repr_jumper =", "completed_definiton": "LL.jump_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.compressionMethod_repr_validator", "original_source_type": "", "source_type": "val compressionMethod_repr_validator : LowParse.Low.Base.validator LowParse.Spec.Int.parse_u8", "source_definition": "let compressionMethod_repr_validator = (LL.validate_u8 ())", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 44, "start_col": 71, "end_line": 44, "end_col": 90 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.validate_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let compressionMethod_repr_validator =", "completed_definiton": "(LL.validate_u8 ())", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.compressionMethod_repr_parser32", "original_source_type": "", "source_type": "val compressionMethod_repr_parser32 : LowParse.SLow.Base.parser32 LowParse.Spec.Int.parse_u8", "source_definition": "let compressionMethod_repr_parser32 = LS.parse32_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 38, "start_col": 70, "end_line": 38, "end_col": 83 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.parse32_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let compressionMethod_repr_parser32 =", "completed_definiton": "LS.parse32_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.compressionMethod_repr_serializer", "original_source_type": "", "source_type": "val compressionMethod_repr_serializer : LowParse.Spec.Base.serializer LowParse.Spec.Int.parse_u8", "source_definition": "let compressionMethod_repr_serializer = LPI.serialize_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 36, "start_col": 50, "end_line": 36, "end_col": 66 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Int.serialize_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let compressionMethod_repr_serializer =", "completed_definiton": "LPI.serialize_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.compressionMethod_repr_size32", "original_source_type": "", "source_type": "val compressionMethod_repr_size32 : LowParse.SLow.Base.size32 LowParse.Spec.Int.serialize_u8", "source_definition": "let compressionMethod_repr_size32 = LSZ.size32_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 42, "start_col": 68, "end_line": 42, "end_col": 81 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 LowParse.Spec.Int.serialize_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.size32_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let compressionMethod_repr_size32 =", "completed_definiton": "LSZ.size32_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.compressionMethod_repr_parser", "original_source_type": "", "source_type": "val compressionMethod_repr_parser : LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u8_kind FStar.UInt8.t", "source_definition": "let compressionMethod_repr_parser = LPI.parse_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 34, "start_col": 46, "end_line": 34, "end_col": 58 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u8_kind FStar.UInt8.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Int.parse_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let compressionMethod_repr_parser =", "completed_definiton": "LPI.parse_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.compressionMethod_bytesize", "original_source_type": "val compressionMethod_bytesize (x:compressionMethod) : GTot nat", "source_type": "val compressionMethod_bytesize (x:compressionMethod) : GTot nat", "source_definition": "let compressionMethod_bytesize (x:compressionMethod) : GTot nat = Seq.length (compressionMethod_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 104, "start_col": 66, "end_line": 104, "end_col": 109 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let compressionMethod_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let compressionMethod_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_compressionMethod (x:LP.maybe_enum_key compressionMethod_enum) : compressionMethod = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n Unknown_compressionMethod v\n\ninline_for_extraction let synth_compressionMethod_inv (x:compressionMethod) : LP.maybe_enum_key compressionMethod_enum = \n match x with\n | Unknown_compressionMethod y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : compressionMethod = x in\n [@inline_let] let _ : squash(not (Unknown_compressionMethod? x1) ==> LP.list_mem x1 (LP.list_map fst compressionMethod_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key compressionMethod_enum)\n\nlet lemma_synth_compressionMethod_inv' () : Lemma\n (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod)\n= LP.forall_maybe_enum_key compressionMethod_enum (fun x -> synth_compressionMethod_inv (synth_compressionMethod x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_compressionMethod_inj () : Lemma\n (LP.synth_injective synth_compressionMethod) = \n lemma_synth_compressionMethod_inv' ();\n LP.synth_inverse_synth_injective synth_compressionMethod synth_compressionMethod_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_compressionMethod_inv () : Lemma\n (LP.synth_inverse synth_compressionMethod synth_compressionMethod_inv) = allow_inversion compressionMethod; ()\n\n#pop-options\nnoextract let parse_maybe_compressionMethod_key : LP.parser _ (LP.maybe_enum_key compressionMethod_enum) =\n LP.parse_maybe_enum_key compressionMethod_repr_parser compressionMethod_enum\n\nnoextract let serialize_maybe_compressionMethod_key : LP.serializer parse_maybe_compressionMethod_key =\n LP.serialize_maybe_enum_key compressionMethod_repr_parser compressionMethod_repr_serializer compressionMethod_enum\n\nnoextract let compressionMethod_parser : LP.parser _ compressionMethod =\n lemma_synth_compressionMethod_inj ();\n parse_maybe_compressionMethod_key `LP.parse_synth` synth_compressionMethod\n\nnoextract let compressionMethod_serializer : LP.serializer compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LP.serialize_synth _ synth_compressionMethod serialize_maybe_compressionMethod_key synth_compressionMethod_inv ()", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.CompressionMethod.compressionMethod -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.CompressionMethod.compressionMethod", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.CompressionMethod.compressionMethod_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val compressionMethod_bytesize (x:compressionMethod) : GTot nat\nlet compressionMethod_bytesize (x: compressionMethod) : GTot nat =", "completed_definiton": "Seq.length (compressionMethod_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.compressionMethod_repr_reader", "original_source_type": "", "source_type": "val compressionMethod_repr_reader : LowParse.Low.Base.leaf_reader LowParse.Spec.Int.parse_u8", "source_definition": "let compressionMethod_repr_reader = LL.read_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 48, "start_col": 68, "end_line": 48, "end_col": 78 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.read_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let compressionMethod_repr_reader =", "completed_definiton": "LL.read_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.compressionMethod_repr_serializer32", "original_source_type": "", "source_type": "val compressionMethod_repr_serializer32 : LowParse.SLow.Base.serializer32 LowParse.Spec.Int.serialize_u8", "source_definition": "let compressionMethod_repr_serializer32 = LS.serialize32_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 40, "start_col": 74, "end_line": 40, "end_col": 91 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 LowParse.Spec.Int.serialize_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.serialize32_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let compressionMethod_repr_serializer32 =", "completed_definiton": "LS.serialize32_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.compressionMethod_repr_writer", "original_source_type": "", "source_type": "val compressionMethod_repr_writer : LowParse.Low.Base.leaf_writer_strong LowParse.Spec.Int.serialize_u8", "source_definition": "let compressionMethod_repr_writer = LL.write_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 50, "start_col": 68, "end_line": 50, "end_col": 79 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let compressionMethod_repr_reader = LL.read_u8", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong LowParse.Spec.Int.serialize_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.write_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let compressionMethod_repr_writer =", "completed_definiton": "LL.write_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.compressionMethod_serializer", "original_source_type": "val compressionMethod_serializer: LP.serializer compressionMethod_parser", "source_type": "val compressionMethod_serializer: LP.serializer compressionMethod_parser", "source_definition": "let compressionMethod_serializer : LP.serializer compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LP.serialize_synth _ synth_compressionMethod serialize_maybe_compressionMethod_key synth_compressionMethod_inv ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 100, "start_col": 2, "end_line": 102, "end_col": 115 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let compressionMethod_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let compressionMethod_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_compressionMethod (x:LP.maybe_enum_key compressionMethod_enum) : compressionMethod = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n Unknown_compressionMethod v\n\ninline_for_extraction let synth_compressionMethod_inv (x:compressionMethod) : LP.maybe_enum_key compressionMethod_enum = \n match x with\n | Unknown_compressionMethod y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : compressionMethod = x in\n [@inline_let] let _ : squash(not (Unknown_compressionMethod? x1) ==> LP.list_mem x1 (LP.list_map fst compressionMethod_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key compressionMethod_enum)\n\nlet lemma_synth_compressionMethod_inv' () : Lemma\n (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod)\n= LP.forall_maybe_enum_key compressionMethod_enum (fun x -> synth_compressionMethod_inv (synth_compressionMethod x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_compressionMethod_inj () : Lemma\n (LP.synth_injective synth_compressionMethod) = \n lemma_synth_compressionMethod_inv' ();\n LP.synth_inverse_synth_injective synth_compressionMethod synth_compressionMethod_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_compressionMethod_inv () : Lemma\n (LP.synth_inverse synth_compressionMethod synth_compressionMethod_inv) = allow_inversion compressionMethod; ()\n\n#pop-options\nnoextract let parse_maybe_compressionMethod_key : LP.parser _ (LP.maybe_enum_key compressionMethod_enum) =\n LP.parse_maybe_enum_key compressionMethod_repr_parser compressionMethod_enum\n\nnoextract let serialize_maybe_compressionMethod_key : LP.serializer parse_maybe_compressionMethod_key =\n LP.serialize_maybe_enum_key compressionMethod_repr_parser compressionMethod_repr_serializer compressionMethod_enum\n\nnoextract let compressionMethod_parser : LP.parser _ compressionMethod =\n lemma_synth_compressionMethod_inj ();\n parse_maybe_compressionMethod_key `LP.parse_synth` synth_compressionMethod", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.CompressionMethod.compressionMethod_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_synth", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.CompressionMethod.compressionMethod", "FStar.UInt8.t", "Parsers.CompressionMethod.compressionMethod_enum", "Parsers.CompressionMethod.parse_maybe_compressionMethod_key", "Parsers.CompressionMethod.synth_compressionMethod", "Parsers.CompressionMethod.serialize_maybe_compressionMethod_key", "Parsers.CompressionMethod.synth_compressionMethod_inv", "Prims.unit", "Parsers.CompressionMethod.lemma_synth_compressionMethod_inv", "Parsers.CompressionMethod.lemma_synth_compressionMethod_inj", "LowParse.Spec.Base.serializer", "Parsers.CompressionMethod.compressionMethod_parser_kind", "Parsers.CompressionMethod.compressionMethod_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val compressionMethod_serializer: LP.serializer compressionMethod_parser\nlet compressionMethod_serializer:LP.serializer compressionMethod_parser =", "completed_definiton": "lemma_synth_compressionMethod_inj ();\nlemma_synth_compressionMethod_inv ();\nLP.serialize_synth _\n synth_compressionMethod\n serialize_maybe_compressionMethod_key\n synth_compressionMethod_inv\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.compressionMethod_size32", "original_source_type": "val compressionMethod_size32: LSZ.size32 compressionMethod_serializer", "source_type": "val compressionMethod_size32: LSZ.size32 compressionMethod_serializer", "source_definition": "let compressionMethod_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond compressionMethod_serializer 1ul) in\n LSZ.size32_constant compressionMethod_serializer 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 125, "start_col": 2, "end_line": 126, "end_col": 57 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let compressionMethod_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let compressionMethod_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_compressionMethod (x:LP.maybe_enum_key compressionMethod_enum) : compressionMethod = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n Unknown_compressionMethod v\n\ninline_for_extraction let synth_compressionMethod_inv (x:compressionMethod) : LP.maybe_enum_key compressionMethod_enum = \n match x with\n | Unknown_compressionMethod y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : compressionMethod = x in\n [@inline_let] let _ : squash(not (Unknown_compressionMethod? x1) ==> LP.list_mem x1 (LP.list_map fst compressionMethod_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key compressionMethod_enum)\n\nlet lemma_synth_compressionMethod_inv' () : Lemma\n (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod)\n= LP.forall_maybe_enum_key compressionMethod_enum (fun x -> synth_compressionMethod_inv (synth_compressionMethod x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_compressionMethod_inj () : Lemma\n (LP.synth_injective synth_compressionMethod) = \n lemma_synth_compressionMethod_inv' ();\n LP.synth_inverse_synth_injective synth_compressionMethod synth_compressionMethod_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_compressionMethod_inv () : Lemma\n (LP.synth_inverse synth_compressionMethod synth_compressionMethod_inv) = allow_inversion compressionMethod; ()\n\n#pop-options\nnoextract let parse_maybe_compressionMethod_key : LP.parser _ (LP.maybe_enum_key compressionMethod_enum) =\n LP.parse_maybe_enum_key compressionMethod_repr_parser compressionMethod_enum\n\nnoextract let serialize_maybe_compressionMethod_key : LP.serializer parse_maybe_compressionMethod_key =\n LP.serialize_maybe_enum_key compressionMethod_repr_parser compressionMethod_repr_serializer compressionMethod_enum\n\nnoextract let compressionMethod_parser : LP.parser _ compressionMethod =\n lemma_synth_compressionMethod_inj ();\n parse_maybe_compressionMethod_key `LP.parse_synth` synth_compressionMethod\n\nnoextract let compressionMethod_serializer : LP.serializer compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LP.serialize_synth _ synth_compressionMethod serialize_maybe_compressionMethod_key synth_compressionMethod_inv ()\n\nlet compressionMethod_bytesize (x:compressionMethod) : GTot nat = Seq.length (compressionMethod_serializer x)\n\nlet compressionMethod_bytesize_eq x = ()\n\nlet parse32_maybe_compressionMethod_key : LS.parser32 parse_maybe_compressionMethod_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac compressionMethod_repr_parser32 compressionMethod_enum)\n\nlet compressionMethod_parser32 : LS.parser32 compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n LS.parse32_synth _ synth_compressionMethod (fun x->synth_compressionMethod x) parse32_maybe_compressionMethod_key ()\n\nlet serialize32_maybe_compressionMethod_key : LS.serializer32 serialize_maybe_compressionMethod_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n compressionMethod_repr_serializer32 compressionMethod_enum)\n\nlet compressionMethod_serializer32 : LS.serializer32 compressionMethod_serializer =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LS.serialize32_synth _ synth_compressionMethod _ serialize32_maybe_compressionMethod_key synth_compressionMethod_inv (fun x->synth_compressionMethod_inv x) ()", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.CompressionMethod.compressionMethod_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Base.size32_constant", "Parsers.CompressionMethod.compressionMethod_parser_kind", "Parsers.CompressionMethod.compressionMethod", "Parsers.CompressionMethod.compressionMethod_parser", "Parsers.CompressionMethod.compressionMethod_serializer", "FStar.UInt32.__uint_to_t", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.SLow.Base.size32_constant_precond" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val compressionMethod_size32: LSZ.size32 compressionMethod_serializer\nlet compressionMethod_size32 =", "completed_definiton": "[@@ inline_let ]let _ =\n assert_norm (LSZ.size32_constant_precond compressionMethod_serializer 1ul)\nin\nLSZ.size32_constant compressionMethod_serializer 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.compressionMethod_enum", "original_source_type": "val compressionMethod_enum:LP.enum compressionMethod U8.t", "source_type": "val compressionMethod_enum:LP.enum compressionMethod U8.t", "source_definition": "let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 24, "start_col": 2, "end_line": 32, "end_col": 6 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Enum.enum Parsers.CompressionMethod.compressionMethod FStar.UInt8.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.b2t", "FStar.List.Tot.Base.noRepeats", "FStar.UInt8.t", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "Parsers.CompressionMethod.compressionMethod", "FStar.Pervasives.Native.snd", "FStar.Pervasives.Native.fst", "Prims.list", "Prims.Cons", "FStar.Pervasives.Native.Mktuple2", "Parsers.CompressionMethod.NullCompression", "FStar.UInt8.__uint_to_t", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val compressionMethod_enum:LP.enum compressionMethod U8.t\nlet compressionMethod_enum:LP.enum compressionMethod U8.t =", "completed_definiton": "[@@ inline_let ]let e = [NullCompression, 0uy] in\n[@@ inline_let ]let _ = assert_norm (L.noRepeats (LP.list_map fst e)) in\n[@@ inline_let ]let _ = assert_norm (L.noRepeats (LP.list_map snd e)) in\ne", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.compressionMethod_parser32", "original_source_type": "val compressionMethod_parser32: LS.parser32 compressionMethod_parser", "source_type": "val compressionMethod_parser32: LS.parser32 compressionMethod_parser", "source_definition": "let compressionMethod_parser32 : LS.parser32 compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n LS.parse32_synth _ synth_compressionMethod (fun x->synth_compressionMethod x) parse32_maybe_compressionMethod_key ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 112, "start_col": 2, "end_line": 113, "end_col": 118 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let compressionMethod_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let compressionMethod_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_compressionMethod (x:LP.maybe_enum_key compressionMethod_enum) : compressionMethod = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n Unknown_compressionMethod v\n\ninline_for_extraction let synth_compressionMethod_inv (x:compressionMethod) : LP.maybe_enum_key compressionMethod_enum = \n match x with\n | Unknown_compressionMethod y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : compressionMethod = x in\n [@inline_let] let _ : squash(not (Unknown_compressionMethod? x1) ==> LP.list_mem x1 (LP.list_map fst compressionMethod_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key compressionMethod_enum)\n\nlet lemma_synth_compressionMethod_inv' () : Lemma\n (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod)\n= LP.forall_maybe_enum_key compressionMethod_enum (fun x -> synth_compressionMethod_inv (synth_compressionMethod x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_compressionMethod_inj () : Lemma\n (LP.synth_injective synth_compressionMethod) = \n lemma_synth_compressionMethod_inv' ();\n LP.synth_inverse_synth_injective synth_compressionMethod synth_compressionMethod_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_compressionMethod_inv () : Lemma\n (LP.synth_inverse synth_compressionMethod synth_compressionMethod_inv) = allow_inversion compressionMethod; ()\n\n#pop-options\nnoextract let parse_maybe_compressionMethod_key : LP.parser _ (LP.maybe_enum_key compressionMethod_enum) =\n LP.parse_maybe_enum_key compressionMethod_repr_parser compressionMethod_enum\n\nnoextract let serialize_maybe_compressionMethod_key : LP.serializer parse_maybe_compressionMethod_key =\n LP.serialize_maybe_enum_key compressionMethod_repr_parser compressionMethod_repr_serializer compressionMethod_enum\n\nnoextract let compressionMethod_parser : LP.parser _ compressionMethod =\n lemma_synth_compressionMethod_inj ();\n parse_maybe_compressionMethod_key `LP.parse_synth` synth_compressionMethod\n\nnoextract let compressionMethod_serializer : LP.serializer compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LP.serialize_synth _ synth_compressionMethod serialize_maybe_compressionMethod_key synth_compressionMethod_inv ()\n\nlet compressionMethod_bytesize (x:compressionMethod) : GTot nat = Seq.length (compressionMethod_serializer x)\n\nlet compressionMethod_bytesize_eq x = ()\n\nlet parse32_maybe_compressionMethod_key : LS.parser32 parse_maybe_compressionMethod_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac compressionMethod_repr_parser32 compressionMethod_enum)", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.CompressionMethod.compressionMethod_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_synth", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.CompressionMethod.compressionMethod", "FStar.UInt8.t", "Parsers.CompressionMethod.compressionMethod_enum", "Parsers.CompressionMethod.parse_maybe_compressionMethod_key", "Parsers.CompressionMethod.synth_compressionMethod", "Prims.eq2", "Parsers.CompressionMethod.parse32_maybe_compressionMethod_key", "Prims.unit", "Parsers.CompressionMethod.lemma_synth_compressionMethod_inj", "LowParse.SLow.Base.parser32", "Parsers.CompressionMethod.compressionMethod_parser_kind", "Parsers.CompressionMethod.compressionMethod_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val compressionMethod_parser32: LS.parser32 compressionMethod_parser\nlet compressionMethod_parser32:LS.parser32 compressionMethod_parser =", "completed_definiton": "lemma_synth_compressionMethod_inj ();\nLS.parse32_synth _\n synth_compressionMethod\n (fun x -> synth_compressionMethod x)\n parse32_maybe_compressionMethod_key\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.write_maybe_compressionMethod_key", "original_source_type": "val write_maybe_compressionMethod_key:LL.leaf_writer_strong serialize_maybe_compressionMethod_key", "source_type": "val write_maybe_compressionMethod_key:LL.leaf_writer_strong serialize_maybe_compressionMethod_key", "source_definition": "let write_maybe_compressionMethod_key : LL.leaf_writer_strong serialize_maybe_compressionMethod_key =\n LL.write_maybe_enum_key compressionMethod_repr_writer compressionMethod_enum (_ by (LP.enum_repr_of_key_tac compressionMethod_enum))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 137, "start_col": 2, "end_line": 137, "end_col": 134 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let compressionMethod_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let compressionMethod_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_compressionMethod (x:LP.maybe_enum_key compressionMethod_enum) : compressionMethod = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n Unknown_compressionMethod v\n\ninline_for_extraction let synth_compressionMethod_inv (x:compressionMethod) : LP.maybe_enum_key compressionMethod_enum = \n match x with\n | Unknown_compressionMethod y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : compressionMethod = x in\n [@inline_let] let _ : squash(not (Unknown_compressionMethod? x1) ==> LP.list_mem x1 (LP.list_map fst compressionMethod_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key compressionMethod_enum)\n\nlet lemma_synth_compressionMethod_inv' () : Lemma\n (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod)\n= LP.forall_maybe_enum_key compressionMethod_enum (fun x -> synth_compressionMethod_inv (synth_compressionMethod x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_compressionMethod_inj () : Lemma\n (LP.synth_injective synth_compressionMethod) = \n lemma_synth_compressionMethod_inv' ();\n LP.synth_inverse_synth_injective synth_compressionMethod synth_compressionMethod_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_compressionMethod_inv () : Lemma\n (LP.synth_inverse synth_compressionMethod synth_compressionMethod_inv) = allow_inversion compressionMethod; ()\n\n#pop-options\nnoextract let parse_maybe_compressionMethod_key : LP.parser _ (LP.maybe_enum_key compressionMethod_enum) =\n LP.parse_maybe_enum_key compressionMethod_repr_parser compressionMethod_enum\n\nnoextract let serialize_maybe_compressionMethod_key : LP.serializer parse_maybe_compressionMethod_key =\n LP.serialize_maybe_enum_key compressionMethod_repr_parser compressionMethod_repr_serializer compressionMethod_enum\n\nnoextract let compressionMethod_parser : LP.parser _ compressionMethod =\n lemma_synth_compressionMethod_inj ();\n parse_maybe_compressionMethod_key `LP.parse_synth` synth_compressionMethod\n\nnoextract let compressionMethod_serializer : LP.serializer compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LP.serialize_synth _ synth_compressionMethod serialize_maybe_compressionMethod_key synth_compressionMethod_inv ()\n\nlet compressionMethod_bytesize (x:compressionMethod) : GTot nat = Seq.length (compressionMethod_serializer x)\n\nlet compressionMethod_bytesize_eq x = ()\n\nlet parse32_maybe_compressionMethod_key : LS.parser32 parse_maybe_compressionMethod_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac compressionMethod_repr_parser32 compressionMethod_enum)\n\nlet compressionMethod_parser32 : LS.parser32 compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n LS.parse32_synth _ synth_compressionMethod (fun x->synth_compressionMethod x) parse32_maybe_compressionMethod_key ()\n\nlet serialize32_maybe_compressionMethod_key : LS.serializer32 serialize_maybe_compressionMethod_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n compressionMethod_repr_serializer32 compressionMethod_enum)\n\nlet compressionMethod_serializer32 : LS.serializer32 compressionMethod_serializer =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LS.serialize32_synth _ synth_compressionMethod _ serialize32_maybe_compressionMethod_key synth_compressionMethod_inv (fun x->synth_compressionMethod_inv x) ()\n\nlet compressionMethod_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond compressionMethod_serializer 1ul) in\n LSZ.size32_constant compressionMethod_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_compressionMethod_key : LL.leaf_reader parse_maybe_compressionMethod_key =\n LL.mk_read_maybe_enum_key compressionMethod_repr_reader compressionMethod_enum\n\nlet compressionMethod_reader =\n [@inline_let] let _ = lemma_synth_compressionMethod_inj () in\n LL.read_synth' parse_maybe_compressionMethod_key synth_compressionMethod read_maybe_compressionMethod_key ()", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong Parsers.CompressionMethod.serialize_maybe_compressionMethod_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.write_maybe_enum_key", "Parsers.CompressionMethod.compressionMethod", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "Parsers.CompressionMethod.compressionMethod_repr_writer", "Parsers.CompressionMethod.compressionMethod_enum", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val write_maybe_compressionMethod_key:LL.leaf_writer_strong serialize_maybe_compressionMethod_key\nlet write_maybe_compressionMethod_key:LL.leaf_writer_strong serialize_maybe_compressionMethod_key =", "completed_definiton": "LL.write_maybe_enum_key compressionMethod_repr_writer\n compressionMethod_enum\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.enum_repr_of_key_tac compressionMethod_enum)))", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.compressionMethod_writer", "original_source_type": "val compressionMethod_writer: LL.leaf_writer_strong compressionMethod_serializer", "source_type": "val compressionMethod_writer: LL.leaf_writer_strong compressionMethod_serializer", "source_definition": "let compressionMethod_writer =\n [@inline_let] let _ = lemma_synth_compressionMethod_inj (); lemma_synth_compressionMethod_inv () in\n LL.write_synth write_maybe_compressionMethod_key synth_compressionMethod synth_compressionMethod_inv (fun x -> synth_compressionMethod_inv x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 143, "start_col": 2, "end_line": 144, "end_col": 146 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let compressionMethod_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let compressionMethod_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_compressionMethod (x:LP.maybe_enum_key compressionMethod_enum) : compressionMethod = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n Unknown_compressionMethod v\n\ninline_for_extraction let synth_compressionMethod_inv (x:compressionMethod) : LP.maybe_enum_key compressionMethod_enum = \n match x with\n | Unknown_compressionMethod y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : compressionMethod = x in\n [@inline_let] let _ : squash(not (Unknown_compressionMethod? x1) ==> LP.list_mem x1 (LP.list_map fst compressionMethod_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key compressionMethod_enum)\n\nlet lemma_synth_compressionMethod_inv' () : Lemma\n (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod)\n= LP.forall_maybe_enum_key compressionMethod_enum (fun x -> synth_compressionMethod_inv (synth_compressionMethod x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_compressionMethod_inj () : Lemma\n (LP.synth_injective synth_compressionMethod) = \n lemma_synth_compressionMethod_inv' ();\n LP.synth_inverse_synth_injective synth_compressionMethod synth_compressionMethod_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_compressionMethod_inv () : Lemma\n (LP.synth_inverse synth_compressionMethod synth_compressionMethod_inv) = allow_inversion compressionMethod; ()\n\n#pop-options\nnoextract let parse_maybe_compressionMethod_key : LP.parser _ (LP.maybe_enum_key compressionMethod_enum) =\n LP.parse_maybe_enum_key compressionMethod_repr_parser compressionMethod_enum\n\nnoextract let serialize_maybe_compressionMethod_key : LP.serializer parse_maybe_compressionMethod_key =\n LP.serialize_maybe_enum_key compressionMethod_repr_parser compressionMethod_repr_serializer compressionMethod_enum\n\nnoextract let compressionMethod_parser : LP.parser _ compressionMethod =\n lemma_synth_compressionMethod_inj ();\n parse_maybe_compressionMethod_key `LP.parse_synth` synth_compressionMethod\n\nnoextract let compressionMethod_serializer : LP.serializer compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LP.serialize_synth _ synth_compressionMethod serialize_maybe_compressionMethod_key synth_compressionMethod_inv ()\n\nlet compressionMethod_bytesize (x:compressionMethod) : GTot nat = Seq.length (compressionMethod_serializer x)\n\nlet compressionMethod_bytesize_eq x = ()\n\nlet parse32_maybe_compressionMethod_key : LS.parser32 parse_maybe_compressionMethod_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac compressionMethod_repr_parser32 compressionMethod_enum)\n\nlet compressionMethod_parser32 : LS.parser32 compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n LS.parse32_synth _ synth_compressionMethod (fun x->synth_compressionMethod x) parse32_maybe_compressionMethod_key ()\n\nlet serialize32_maybe_compressionMethod_key : LS.serializer32 serialize_maybe_compressionMethod_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n compressionMethod_repr_serializer32 compressionMethod_enum)\n\nlet compressionMethod_serializer32 : LS.serializer32 compressionMethod_serializer =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LS.serialize32_synth _ synth_compressionMethod _ serialize32_maybe_compressionMethod_key synth_compressionMethod_inv (fun x->synth_compressionMethod_inv x) ()\n\nlet compressionMethod_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond compressionMethod_serializer 1ul) in\n LSZ.size32_constant compressionMethod_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_compressionMethod_key : LL.leaf_reader parse_maybe_compressionMethod_key =\n LL.mk_read_maybe_enum_key compressionMethod_repr_reader compressionMethod_enum\n\nlet compressionMethod_reader =\n [@inline_let] let _ = lemma_synth_compressionMethod_inj () in\n LL.read_synth' parse_maybe_compressionMethod_key synth_compressionMethod read_maybe_compressionMethod_key ()\n\ninline_for_extraction let write_maybe_compressionMethod_key : LL.leaf_writer_strong serialize_maybe_compressionMethod_key =\n LL.write_maybe_enum_key compressionMethod_repr_writer compressionMethod_enum (_ by (LP.enum_repr_of_key_tac compressionMethod_enum))\n\ninline_for_extraction let lserialize_maybe_compressionMethod_key : LL.serializer32 serialize_maybe_compressionMethod_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_compressionMethod_key 1ul ()", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong Parsers.CompressionMethod.compressionMethod_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.write_synth", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.CompressionMethod.compressionMethod", "FStar.UInt8.t", "Parsers.CompressionMethod.compressionMethod_enum", "Parsers.CompressionMethod.parse_maybe_compressionMethod_key", "Parsers.CompressionMethod.serialize_maybe_compressionMethod_key", "Parsers.CompressionMethod.write_maybe_compressionMethod_key", "Parsers.CompressionMethod.synth_compressionMethod", "Parsers.CompressionMethod.synth_compressionMethod_inv", "Prims.eq2", "Prims.unit", "Parsers.CompressionMethod.lemma_synth_compressionMethod_inv", "Parsers.CompressionMethod.lemma_synth_compressionMethod_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val compressionMethod_writer: LL.leaf_writer_strong compressionMethod_serializer\nlet compressionMethod_writer =", "completed_definiton": "[@@ inline_let ]let _ =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ()\nin\nLL.write_synth write_maybe_compressionMethod_key\n synth_compressionMethod\n synth_compressionMethod_inv\n (fun x -> synth_compressionMethod_inv x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.serialize_maybe_compressionMethod_key", "original_source_type": "val serialize_maybe_compressionMethod_key:LP.serializer parse_maybe_compressionMethod_key", "source_type": "val serialize_maybe_compressionMethod_key:LP.serializer parse_maybe_compressionMethod_key", "source_definition": "let serialize_maybe_compressionMethod_key : LP.serializer parse_maybe_compressionMethod_key =\n LP.serialize_maybe_enum_key compressionMethod_repr_parser compressionMethod_repr_serializer compressionMethod_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 93, "start_col": 2, "end_line": 93, "end_col": 116 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let compressionMethod_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let compressionMethod_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_compressionMethod (x:LP.maybe_enum_key compressionMethod_enum) : compressionMethod = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n Unknown_compressionMethod v\n\ninline_for_extraction let synth_compressionMethod_inv (x:compressionMethod) : LP.maybe_enum_key compressionMethod_enum = \n match x with\n | Unknown_compressionMethod y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : compressionMethod = x in\n [@inline_let] let _ : squash(not (Unknown_compressionMethod? x1) ==> LP.list_mem x1 (LP.list_map fst compressionMethod_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key compressionMethod_enum)\n\nlet lemma_synth_compressionMethod_inv' () : Lemma\n (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod)\n= LP.forall_maybe_enum_key compressionMethod_enum (fun x -> synth_compressionMethod_inv (synth_compressionMethod x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_compressionMethod_inj () : Lemma\n (LP.synth_injective synth_compressionMethod) = \n lemma_synth_compressionMethod_inv' ();\n LP.synth_inverse_synth_injective synth_compressionMethod synth_compressionMethod_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_compressionMethod_inv () : Lemma\n (LP.synth_inverse synth_compressionMethod synth_compressionMethod_inv) = allow_inversion compressionMethod; ()\n\n#pop-options\nnoextract let parse_maybe_compressionMethod_key : LP.parser _ (LP.maybe_enum_key compressionMethod_enum) =\n LP.parse_maybe_enum_key compressionMethod_repr_parser compressionMethod_enum", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.CompressionMethod.parse_maybe_compressionMethod_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.serialize_maybe_enum_key", "LowParse.Spec.Int.parse_u8_kind", "Parsers.CompressionMethod.compressionMethod", "FStar.UInt8.t", "Parsers.CompressionMethod.compressionMethod_repr_parser", "Parsers.CompressionMethod.compressionMethod_repr_serializer", "Parsers.CompressionMethod.compressionMethod_enum" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_maybe_compressionMethod_key:LP.serializer parse_maybe_compressionMethod_key\nlet serialize_maybe_compressionMethod_key:LP.serializer parse_maybe_compressionMethod_key =", "completed_definiton": "LP.serialize_maybe_enum_key compressionMethod_repr_parser\n compressionMethod_repr_serializer\n compressionMethod_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.read_maybe_compressionMethod_key", "original_source_type": "val read_maybe_compressionMethod_key:LL.leaf_reader parse_maybe_compressionMethod_key", "source_type": "val read_maybe_compressionMethod_key:LL.leaf_reader parse_maybe_compressionMethod_key", "source_definition": "let read_maybe_compressionMethod_key : LL.leaf_reader parse_maybe_compressionMethod_key =\n LL.mk_read_maybe_enum_key compressionMethod_repr_reader compressionMethod_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 130, "start_col": 4, "end_line": 130, "end_col": 82 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let compressionMethod_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let compressionMethod_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_compressionMethod (x:LP.maybe_enum_key compressionMethod_enum) : compressionMethod = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n Unknown_compressionMethod v\n\ninline_for_extraction let synth_compressionMethod_inv (x:compressionMethod) : LP.maybe_enum_key compressionMethod_enum = \n match x with\n | Unknown_compressionMethod y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : compressionMethod = x in\n [@inline_let] let _ : squash(not (Unknown_compressionMethod? x1) ==> LP.list_mem x1 (LP.list_map fst compressionMethod_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key compressionMethod_enum)\n\nlet lemma_synth_compressionMethod_inv' () : Lemma\n (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod)\n= LP.forall_maybe_enum_key compressionMethod_enum (fun x -> synth_compressionMethod_inv (synth_compressionMethod x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_compressionMethod_inj () : Lemma\n (LP.synth_injective synth_compressionMethod) = \n lemma_synth_compressionMethod_inv' ();\n LP.synth_inverse_synth_injective synth_compressionMethod synth_compressionMethod_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_compressionMethod_inv () : Lemma\n (LP.synth_inverse synth_compressionMethod synth_compressionMethod_inv) = allow_inversion compressionMethod; ()\n\n#pop-options\nnoextract let parse_maybe_compressionMethod_key : LP.parser _ (LP.maybe_enum_key compressionMethod_enum) =\n LP.parse_maybe_enum_key compressionMethod_repr_parser compressionMethod_enum\n\nnoextract let serialize_maybe_compressionMethod_key : LP.serializer parse_maybe_compressionMethod_key =\n LP.serialize_maybe_enum_key compressionMethod_repr_parser compressionMethod_repr_serializer compressionMethod_enum\n\nnoextract let compressionMethod_parser : LP.parser _ compressionMethod =\n lemma_synth_compressionMethod_inj ();\n parse_maybe_compressionMethod_key `LP.parse_synth` synth_compressionMethod\n\nnoextract let compressionMethod_serializer : LP.serializer compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LP.serialize_synth _ synth_compressionMethod serialize_maybe_compressionMethod_key synth_compressionMethod_inv ()\n\nlet compressionMethod_bytesize (x:compressionMethod) : GTot nat = Seq.length (compressionMethod_serializer x)\n\nlet compressionMethod_bytesize_eq x = ()\n\nlet parse32_maybe_compressionMethod_key : LS.parser32 parse_maybe_compressionMethod_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac compressionMethod_repr_parser32 compressionMethod_enum)\n\nlet compressionMethod_parser32 : LS.parser32 compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n LS.parse32_synth _ synth_compressionMethod (fun x->synth_compressionMethod x) parse32_maybe_compressionMethod_key ()\n\nlet serialize32_maybe_compressionMethod_key : LS.serializer32 serialize_maybe_compressionMethod_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n compressionMethod_repr_serializer32 compressionMethod_enum)\n\nlet compressionMethod_serializer32 : LS.serializer32 compressionMethod_serializer =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LS.serialize32_synth _ synth_compressionMethod _ serialize32_maybe_compressionMethod_key synth_compressionMethod_inv (fun x->synth_compressionMethod_inv x) ()\n\nlet compressionMethod_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond compressionMethod_serializer 1ul) in\n LSZ.size32_constant compressionMethod_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader Parsers.CompressionMethod.parse_maybe_compressionMethod_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.read_maybe_enum_key", "Parsers.CompressionMethod.compressionMethod", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "Parsers.CompressionMethod.compressionMethod_repr_reader", "Prims.Cons", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.Mktuple2", "Parsers.CompressionMethod.NullCompression", "FStar.UInt8.__uint_to_t", "Prims.Nil", "LowParse.Spec.Enum.maybe_enum_destr_t_intro", "LowParse.Spec.Enum.maybe_enum_key", "LowParse.Spec.Enum.maybe_enum_destr_cons", "LowParse.Spec.Enum.maybe_enum_destr_nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_maybe_compressionMethod_key:LL.leaf_reader parse_maybe_compressionMethod_key\nlet read_maybe_compressionMethod_key:LL.leaf_reader parse_maybe_compressionMethod_key =", "completed_definiton": "LL.mk_read_maybe_enum_key compressionMethod_repr_reader compressionMethod_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.compressionMethod_parser", "original_source_type": "val compressionMethod_parser: LP.parser compressionMethod_parser_kind compressionMethod", "source_type": "val compressionMethod_parser: LP.parser compressionMethod_parser_kind compressionMethod", "source_definition": "let compressionMethod_parser : LP.parser _ compressionMethod =\n lemma_synth_compressionMethod_inj ();\n parse_maybe_compressionMethod_key `LP.parse_synth` synth_compressionMethod", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 96, "start_col": 2, "end_line": 97, "end_col": 76 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let compressionMethod_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let compressionMethod_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_compressionMethod (x:LP.maybe_enum_key compressionMethod_enum) : compressionMethod = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n Unknown_compressionMethod v\n\ninline_for_extraction let synth_compressionMethod_inv (x:compressionMethod) : LP.maybe_enum_key compressionMethod_enum = \n match x with\n | Unknown_compressionMethod y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : compressionMethod = x in\n [@inline_let] let _ : squash(not (Unknown_compressionMethod? x1) ==> LP.list_mem x1 (LP.list_map fst compressionMethod_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key compressionMethod_enum)\n\nlet lemma_synth_compressionMethod_inv' () : Lemma\n (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod)\n= LP.forall_maybe_enum_key compressionMethod_enum (fun x -> synth_compressionMethod_inv (synth_compressionMethod x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_compressionMethod_inj () : Lemma\n (LP.synth_injective synth_compressionMethod) = \n lemma_synth_compressionMethod_inv' ();\n LP.synth_inverse_synth_injective synth_compressionMethod synth_compressionMethod_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_compressionMethod_inv () : Lemma\n (LP.synth_inverse synth_compressionMethod synth_compressionMethod_inv) = allow_inversion compressionMethod; ()\n\n#pop-options\nnoextract let parse_maybe_compressionMethod_key : LP.parser _ (LP.maybe_enum_key compressionMethod_enum) =\n LP.parse_maybe_enum_key compressionMethod_repr_parser compressionMethod_enum\n\nnoextract let serialize_maybe_compressionMethod_key : LP.serializer parse_maybe_compressionMethod_key =\n LP.serialize_maybe_enum_key compressionMethod_repr_parser compressionMethod_repr_serializer compressionMethod_enum", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.CompressionMethod.compressionMethod_parser_kind\n Parsers.CompressionMethod.compressionMethod", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.CompressionMethod.compressionMethod", "FStar.UInt8.t", "Parsers.CompressionMethod.compressionMethod_enum", "Parsers.CompressionMethod.parse_maybe_compressionMethod_key", "Parsers.CompressionMethod.synth_compressionMethod", "Prims.unit", "Parsers.CompressionMethod.lemma_synth_compressionMethod_inj", "LowParse.Spec.Base.parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val compressionMethod_parser: LP.parser compressionMethod_parser_kind compressionMethod\nlet compressionMethod_parser:LP.parser _ compressionMethod =", "completed_definiton": "lemma_synth_compressionMethod_inj ();\nparse_maybe_compressionMethod_key `LP.parse_synth` synth_compressionMethod", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.compressionMethod_reader", "original_source_type": "val compressionMethod_reader: LL.leaf_reader compressionMethod_parser", "source_type": "val compressionMethod_reader: LL.leaf_reader compressionMethod_parser", "source_definition": "let compressionMethod_reader =\n [@inline_let] let _ = lemma_synth_compressionMethod_inj () in\n LL.read_synth' parse_maybe_compressionMethod_key synth_compressionMethod read_maybe_compressionMethod_key ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 133, "start_col": 1, "end_line": 134, "end_col": 109 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let compressionMethod_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let compressionMethod_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_compressionMethod (x:LP.maybe_enum_key compressionMethod_enum) : compressionMethod = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n Unknown_compressionMethod v\n\ninline_for_extraction let synth_compressionMethod_inv (x:compressionMethod) : LP.maybe_enum_key compressionMethod_enum = \n match x with\n | Unknown_compressionMethod y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : compressionMethod = x in\n [@inline_let] let _ : squash(not (Unknown_compressionMethod? x1) ==> LP.list_mem x1 (LP.list_map fst compressionMethod_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key compressionMethod_enum)\n\nlet lemma_synth_compressionMethod_inv' () : Lemma\n (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod)\n= LP.forall_maybe_enum_key compressionMethod_enum (fun x -> synth_compressionMethod_inv (synth_compressionMethod x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_compressionMethod_inj () : Lemma\n (LP.synth_injective synth_compressionMethod) = \n lemma_synth_compressionMethod_inv' ();\n LP.synth_inverse_synth_injective synth_compressionMethod synth_compressionMethod_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_compressionMethod_inv () : Lemma\n (LP.synth_inverse synth_compressionMethod synth_compressionMethod_inv) = allow_inversion compressionMethod; ()\n\n#pop-options\nnoextract let parse_maybe_compressionMethod_key : LP.parser _ (LP.maybe_enum_key compressionMethod_enum) =\n LP.parse_maybe_enum_key compressionMethod_repr_parser compressionMethod_enum\n\nnoextract let serialize_maybe_compressionMethod_key : LP.serializer parse_maybe_compressionMethod_key =\n LP.serialize_maybe_enum_key compressionMethod_repr_parser compressionMethod_repr_serializer compressionMethod_enum\n\nnoextract let compressionMethod_parser : LP.parser _ compressionMethod =\n lemma_synth_compressionMethod_inj ();\n parse_maybe_compressionMethod_key `LP.parse_synth` synth_compressionMethod\n\nnoextract let compressionMethod_serializer : LP.serializer compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LP.serialize_synth _ synth_compressionMethod serialize_maybe_compressionMethod_key synth_compressionMethod_inv ()\n\nlet compressionMethod_bytesize (x:compressionMethod) : GTot nat = Seq.length (compressionMethod_serializer x)\n\nlet compressionMethod_bytesize_eq x = ()\n\nlet parse32_maybe_compressionMethod_key : LS.parser32 parse_maybe_compressionMethod_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac compressionMethod_repr_parser32 compressionMethod_enum)\n\nlet compressionMethod_parser32 : LS.parser32 compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n LS.parse32_synth _ synth_compressionMethod (fun x->synth_compressionMethod x) parse32_maybe_compressionMethod_key ()\n\nlet serialize32_maybe_compressionMethod_key : LS.serializer32 serialize_maybe_compressionMethod_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n compressionMethod_repr_serializer32 compressionMethod_enum)\n\nlet compressionMethod_serializer32 : LS.serializer32 compressionMethod_serializer =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LS.serialize32_synth _ synth_compressionMethod _ serialize32_maybe_compressionMethod_key synth_compressionMethod_inv (fun x->synth_compressionMethod_inv x) ()\n\nlet compressionMethod_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond compressionMethod_serializer 1ul) in\n LSZ.size32_constant compressionMethod_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_compressionMethod_key : LL.leaf_reader parse_maybe_compressionMethod_key =\n LL.mk_read_maybe_enum_key compressionMethod_repr_reader compressionMethod_enum", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader Parsers.CompressionMethod.compressionMethod_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.read_synth'", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.CompressionMethod.compressionMethod", "FStar.UInt8.t", "Parsers.CompressionMethod.compressionMethod_enum", "Parsers.CompressionMethod.parse_maybe_compressionMethod_key", "Parsers.CompressionMethod.synth_compressionMethod", "Parsers.CompressionMethod.read_maybe_compressionMethod_key", "Prims.unit", "Parsers.CompressionMethod.lemma_synth_compressionMethod_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val compressionMethod_reader: LL.leaf_reader compressionMethod_parser\nlet compressionMethod_reader =", "completed_definiton": "[@@ inline_let ]let _ = lemma_synth_compressionMethod_inj () in\nLL.read_synth' parse_maybe_compressionMethod_key\n synth_compressionMethod\n read_maybe_compressionMethod_key\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.compressionMethod_serializer32", "original_source_type": "val compressionMethod_serializer32: LS.serializer32 compressionMethod_serializer", "source_type": "val compressionMethod_serializer32: LS.serializer32 compressionMethod_serializer", "source_definition": "let compressionMethod_serializer32 : LS.serializer32 compressionMethod_serializer =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LS.serialize32_synth _ synth_compressionMethod _ serialize32_maybe_compressionMethod_key synth_compressionMethod_inv (fun x->synth_compressionMethod_inv x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 120, "start_col": 2, "end_line": 122, "end_col": 160 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let compressionMethod_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let compressionMethod_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_compressionMethod (x:LP.maybe_enum_key compressionMethod_enum) : compressionMethod = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n Unknown_compressionMethod v\n\ninline_for_extraction let synth_compressionMethod_inv (x:compressionMethod) : LP.maybe_enum_key compressionMethod_enum = \n match x with\n | Unknown_compressionMethod y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : compressionMethod = x in\n [@inline_let] let _ : squash(not (Unknown_compressionMethod? x1) ==> LP.list_mem x1 (LP.list_map fst compressionMethod_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key compressionMethod_enum)\n\nlet lemma_synth_compressionMethod_inv' () : Lemma\n (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod)\n= LP.forall_maybe_enum_key compressionMethod_enum (fun x -> synth_compressionMethod_inv (synth_compressionMethod x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_compressionMethod_inj () : Lemma\n (LP.synth_injective synth_compressionMethod) = \n lemma_synth_compressionMethod_inv' ();\n LP.synth_inverse_synth_injective synth_compressionMethod synth_compressionMethod_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_compressionMethod_inv () : Lemma\n (LP.synth_inverse synth_compressionMethod synth_compressionMethod_inv) = allow_inversion compressionMethod; ()\n\n#pop-options\nnoextract let parse_maybe_compressionMethod_key : LP.parser _ (LP.maybe_enum_key compressionMethod_enum) =\n LP.parse_maybe_enum_key compressionMethod_repr_parser compressionMethod_enum\n\nnoextract let serialize_maybe_compressionMethod_key : LP.serializer parse_maybe_compressionMethod_key =\n LP.serialize_maybe_enum_key compressionMethod_repr_parser compressionMethod_repr_serializer compressionMethod_enum\n\nnoextract let compressionMethod_parser : LP.parser _ compressionMethod =\n lemma_synth_compressionMethod_inj ();\n parse_maybe_compressionMethod_key `LP.parse_synth` synth_compressionMethod\n\nnoextract let compressionMethod_serializer : LP.serializer compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LP.serialize_synth _ synth_compressionMethod serialize_maybe_compressionMethod_key synth_compressionMethod_inv ()\n\nlet compressionMethod_bytesize (x:compressionMethod) : GTot nat = Seq.length (compressionMethod_serializer x)\n\nlet compressionMethod_bytesize_eq x = ()\n\nlet parse32_maybe_compressionMethod_key : LS.parser32 parse_maybe_compressionMethod_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac compressionMethod_repr_parser32 compressionMethod_enum)\n\nlet compressionMethod_parser32 : LS.parser32 compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n LS.parse32_synth _ synth_compressionMethod (fun x->synth_compressionMethod x) parse32_maybe_compressionMethod_key ()\n\nlet serialize32_maybe_compressionMethod_key : LS.serializer32 serialize_maybe_compressionMethod_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n compressionMethod_repr_serializer32 compressionMethod_enum)", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.CompressionMethod.compressionMethod_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_synth", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.CompressionMethod.compressionMethod", "FStar.UInt8.t", "Parsers.CompressionMethod.compressionMethod_enum", "Parsers.CompressionMethod.parse_maybe_compressionMethod_key", "Parsers.CompressionMethod.synth_compressionMethod", "Parsers.CompressionMethod.serialize_maybe_compressionMethod_key", "Parsers.CompressionMethod.serialize32_maybe_compressionMethod_key", "Parsers.CompressionMethod.synth_compressionMethod_inv", "Prims.eq2", "Prims.unit", "Parsers.CompressionMethod.lemma_synth_compressionMethod_inv", "Parsers.CompressionMethod.lemma_synth_compressionMethod_inj", "LowParse.SLow.Base.serializer32", "Parsers.CompressionMethod.compressionMethod_parser_kind", "Parsers.CompressionMethod.compressionMethod_parser", "Parsers.CompressionMethod.compressionMethod_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val compressionMethod_serializer32: LS.serializer32 compressionMethod_serializer\nlet compressionMethod_serializer32:LS.serializer32 compressionMethod_serializer =", "completed_definiton": "lemma_synth_compressionMethod_inj ();\nlemma_synth_compressionMethod_inv ();\nLS.serialize32_synth _\n synth_compressionMethod\n _\n serialize32_maybe_compressionMethod_key\n synth_compressionMethod_inv\n (fun x -> synth_compressionMethod_inv x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.lemma_synth_compressionMethod_inj", "original_source_type": "val lemma_synth_compressionMethod_inj: Prims.unit\n -> Lemma (LP.synth_injective synth_compressionMethod)", "source_type": "val lemma_synth_compressionMethod_inj: Prims.unit\n -> Lemma (LP.synth_injective synth_compressionMethod)", "source_definition": "let lemma_synth_compressionMethod_inj () : Lemma\n (LP.synth_injective synth_compressionMethod) = \n lemma_synth_compressionMethod_inv' ();\n LP.synth_inverse_synth_injective synth_compressionMethod synth_compressionMethod_inv", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 81, "start_col": 2, "end_line": 82, "end_col": 86 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let compressionMethod_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let compressionMethod_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_compressionMethod (x:LP.maybe_enum_key compressionMethod_enum) : compressionMethod = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n Unknown_compressionMethod v\n\ninline_for_extraction let synth_compressionMethod_inv (x:compressionMethod) : LP.maybe_enum_key compressionMethod_enum = \n match x with\n | Unknown_compressionMethod y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : compressionMethod = x in\n [@inline_let] let _ : squash(not (Unknown_compressionMethod? x1) ==> LP.list_mem x1 (LP.list_map fst compressionMethod_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key compressionMethod_enum)\n\nlet lemma_synth_compressionMethod_inv' () : Lemma\n (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod)\n= LP.forall_maybe_enum_key compressionMethod_enum (fun x -> synth_compressionMethod_inv (synth_compressionMethod x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_compressionMethod_inj () : Lemma", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_injective Parsers.CompressionMethod.synth_compressionMethod)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "LowParse.Spec.Combinators.synth_inverse_synth_injective", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.CompressionMethod.compressionMethod", "FStar.UInt8.t", "Parsers.CompressionMethod.compressionMethod_enum", "Parsers.CompressionMethod.synth_compressionMethod", "Parsers.CompressionMethod.synth_compressionMethod_inv", "Parsers.CompressionMethod.lemma_synth_compressionMethod_inv'", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_injective", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_synth_compressionMethod_inj: Prims.unit\n -> Lemma (LP.synth_injective synth_compressionMethod)\nlet lemma_synth_compressionMethod_inj () : Lemma (LP.synth_injective synth_compressionMethod) =", "completed_definiton": "lemma_synth_compressionMethod_inv' ();\nLP.synth_inverse_synth_injective synth_compressionMethod synth_compressionMethod_inv", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.lemma_synth_compressionMethod_inv", "original_source_type": "val lemma_synth_compressionMethod_inv: Prims.unit\n -> Lemma (LP.synth_inverse synth_compressionMethod synth_compressionMethod_inv)", "source_type": "val lemma_synth_compressionMethod_inv: Prims.unit\n -> Lemma (LP.synth_inverse synth_compressionMethod synth_compressionMethod_inv)", "source_definition": "let lemma_synth_compressionMethod_inv () : Lemma\n (LP.synth_inverse synth_compressionMethod synth_compressionMethod_inv) = allow_inversion compressionMethod; ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 86, "start_col": 75, "end_line": 86, "end_col": 112 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let compressionMethod_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let compressionMethod_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_compressionMethod (x:LP.maybe_enum_key compressionMethod_enum) : compressionMethod = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n Unknown_compressionMethod v\n\ninline_for_extraction let synth_compressionMethod_inv (x:compressionMethod) : LP.maybe_enum_key compressionMethod_enum = \n match x with\n | Unknown_compressionMethod y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : compressionMethod = x in\n [@inline_let] let _ : squash(not (Unknown_compressionMethod? x1) ==> LP.list_mem x1 (LP.list_map fst compressionMethod_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key compressionMethod_enum)\n\nlet lemma_synth_compressionMethod_inv' () : Lemma\n (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod)\n= LP.forall_maybe_enum_key compressionMethod_enum (fun x -> synth_compressionMethod_inv (synth_compressionMethod x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_compressionMethod_inj () : Lemma\n (LP.synth_injective synth_compressionMethod) = \n lemma_synth_compressionMethod_inv' ();\n LP.synth_inverse_synth_injective synth_compressionMethod synth_compressionMethod_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_inverse Parsers.CompressionMethod.synth_compressionMethod\n Parsers.CompressionMethod.synth_compressionMethod_inv)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.allow_inversion", "Parsers.CompressionMethod.compressionMethod", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_inverse", "LowParse.Spec.Enum.maybe_enum_key", "FStar.UInt8.t", "Parsers.CompressionMethod.compressionMethod_enum", "Parsers.CompressionMethod.synth_compressionMethod", "Parsers.CompressionMethod.synth_compressionMethod_inv", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_synth_compressionMethod_inv: Prims.unit\n -> Lemma (LP.synth_inverse synth_compressionMethod synth_compressionMethod_inv)\nlet lemma_synth_compressionMethod_inv ()\n : Lemma (LP.synth_inverse synth_compressionMethod synth_compressionMethod_inv) =", "completed_definiton": "allow_inversion compressionMethod;\n()", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.synth_compressionMethod", "original_source_type": "val synth_compressionMethod (x: LP.maybe_enum_key compressionMethod_enum) : compressionMethod", "source_type": "val synth_compressionMethod (x: LP.maybe_enum_key compressionMethod_enum) : compressionMethod", "source_definition": "let synth_compressionMethod (x:LP.maybe_enum_key compressionMethod_enum) : compressionMethod = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n Unknown_compressionMethod v", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 53, "start_col": 2, "end_line": 58, "end_col": 31 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let compressionMethod_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let compressionMethod_repr_writer = LL.write_u8", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: LowParse.Spec.Enum.maybe_enum_key Parsers.CompressionMethod.compressionMethod_enum\n -> Parsers.CompressionMethod.compressionMethod", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.maybe_enum_key", "Parsers.CompressionMethod.compressionMethod", "FStar.UInt8.t", "Parsers.CompressionMethod.compressionMethod_enum", "LowParse.Spec.Enum.enum_key", "LowParse.Spec.Enum.unknown_enum_repr", "Parsers.CompressionMethod.Unknown_compressionMethod", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.bool", "LowParse.Spec.Enum.list_mem", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.snd", "Parsers.CompressionMethod.known_compressionMethod_repr" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_compressionMethod (x: LP.maybe_enum_key compressionMethod_enum) : compressionMethod\nlet synth_compressionMethod (x: LP.maybe_enum_key compressionMethod_enum) : compressionMethod =", "completed_definiton": "match x with\n| LP.Known k -> k\n| LP.Unknown y ->\n [@@ inline_let ]let v:U8.t = y in\n [@@ inline_let ]let _ =\n assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) ==\n known_compressionMethod_repr v)\n in\n Unknown_compressionMethod v", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.synth_compressionMethod_inv", "original_source_type": "val synth_compressionMethod_inv (x: compressionMethod) : LP.maybe_enum_key compressionMethod_enum", "source_type": "val synth_compressionMethod_inv (x: compressionMethod) : LP.maybe_enum_key compressionMethod_enum", "source_definition": "let synth_compressionMethod_inv (x:compressionMethod) : LP.maybe_enum_key compressionMethod_enum = \n match x with\n | Unknown_compressionMethod y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : compressionMethod = x in\n [@inline_let] let _ : squash(not (Unknown_compressionMethod? x1) ==> LP.list_mem x1 (LP.list_map fst compressionMethod_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key compressionMethod_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 61, "start_col": 2, "end_line": 71, "end_col": 55 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let compressionMethod_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let compressionMethod_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_compressionMethod (x:LP.maybe_enum_key compressionMethod_enum) : compressionMethod = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n Unknown_compressionMethod v", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.CompressionMethod.compressionMethod\n -> LowParse.Spec.Enum.maybe_enum_key Parsers.CompressionMethod.compressionMethod_enum", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.CompressionMethod.compressionMethod", "FStar.UInt8.t", "Prims.b2t", "Prims.op_Negation", "Parsers.CompressionMethod.known_compressionMethod_repr", "LowParse.Spec.Enum.Unknown", "Parsers.CompressionMethod.compressionMethod_enum", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.bool", "LowParse.Spec.Enum.list_mem", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.snd", "LowParse.Spec.Enum.Known", "LowParse.Spec.Enum.enum_key", "Prims.squash", "Prims.l_imp", "Parsers.CompressionMethod.uu___is_Unknown_compressionMethod", "FStar.Pervasives.Native.fst", "LowParse.Spec.Enum.maybe_enum_key" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_compressionMethod_inv (x: compressionMethod) : LP.maybe_enum_key compressionMethod_enum\nlet synth_compressionMethod_inv (x: compressionMethod) : LP.maybe_enum_key compressionMethod_enum =", "completed_definiton": "match x with\n| Unknown_compressionMethod y ->\n [@@ inline_let ]let v:U8.t = y in\n [@@ inline_let ]let _ =\n assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) ==\n known_compressionMethod_repr v)\n in\n LP.Unknown v\n| x ->\n [@@ inline_let ]let x1:compressionMethod = x in\n [@@ inline_let ]let _:squash (not (Unknown_compressionMethod? x1) ==>\n LP.list_mem x1 (LP.list_map fst compressionMethod_enum)) =\n FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.synth_maybe_enum_key_inv_unknown_tac x1))\n in\n LP.Known (x1 <: LP.enum_key compressionMethod_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.compressionMethod_lserializer", "original_source_type": "val compressionMethod_lserializer: LL.serializer32 compressionMethod_serializer", "source_type": "val compressionMethod_lserializer: LL.serializer32 compressionMethod_serializer", "source_definition": "let compressionMethod_lserializer = LL.serializer32_of_leaf_writer_strong_constant_size compressionMethod_writer 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 146, "start_col": 36, "end_line": 146, "end_col": 119 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let compressionMethod_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let compressionMethod_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_compressionMethod (x:LP.maybe_enum_key compressionMethod_enum) : compressionMethod = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n Unknown_compressionMethod v\n\ninline_for_extraction let synth_compressionMethod_inv (x:compressionMethod) : LP.maybe_enum_key compressionMethod_enum = \n match x with\n | Unknown_compressionMethod y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : compressionMethod = x in\n [@inline_let] let _ : squash(not (Unknown_compressionMethod? x1) ==> LP.list_mem x1 (LP.list_map fst compressionMethod_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key compressionMethod_enum)\n\nlet lemma_synth_compressionMethod_inv' () : Lemma\n (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod)\n= LP.forall_maybe_enum_key compressionMethod_enum (fun x -> synth_compressionMethod_inv (synth_compressionMethod x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_compressionMethod_inj () : Lemma\n (LP.synth_injective synth_compressionMethod) = \n lemma_synth_compressionMethod_inv' ();\n LP.synth_inverse_synth_injective synth_compressionMethod synth_compressionMethod_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_compressionMethod_inv () : Lemma\n (LP.synth_inverse synth_compressionMethod synth_compressionMethod_inv) = allow_inversion compressionMethod; ()\n\n#pop-options\nnoextract let parse_maybe_compressionMethod_key : LP.parser _ (LP.maybe_enum_key compressionMethod_enum) =\n LP.parse_maybe_enum_key compressionMethod_repr_parser compressionMethod_enum\n\nnoextract let serialize_maybe_compressionMethod_key : LP.serializer parse_maybe_compressionMethod_key =\n LP.serialize_maybe_enum_key compressionMethod_repr_parser compressionMethod_repr_serializer compressionMethod_enum\n\nnoextract let compressionMethod_parser : LP.parser _ compressionMethod =\n lemma_synth_compressionMethod_inj ();\n parse_maybe_compressionMethod_key `LP.parse_synth` synth_compressionMethod\n\nnoextract let compressionMethod_serializer : LP.serializer compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LP.serialize_synth _ synth_compressionMethod serialize_maybe_compressionMethod_key synth_compressionMethod_inv ()\n\nlet compressionMethod_bytesize (x:compressionMethod) : GTot nat = Seq.length (compressionMethod_serializer x)\n\nlet compressionMethod_bytesize_eq x = ()\n\nlet parse32_maybe_compressionMethod_key : LS.parser32 parse_maybe_compressionMethod_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac compressionMethod_repr_parser32 compressionMethod_enum)\n\nlet compressionMethod_parser32 : LS.parser32 compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n LS.parse32_synth _ synth_compressionMethod (fun x->synth_compressionMethod x) parse32_maybe_compressionMethod_key ()\n\nlet serialize32_maybe_compressionMethod_key : LS.serializer32 serialize_maybe_compressionMethod_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n compressionMethod_repr_serializer32 compressionMethod_enum)\n\nlet compressionMethod_serializer32 : LS.serializer32 compressionMethod_serializer =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LS.serialize32_synth _ synth_compressionMethod _ serialize32_maybe_compressionMethod_key synth_compressionMethod_inv (fun x->synth_compressionMethod_inv x) ()\n\nlet compressionMethod_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond compressionMethod_serializer 1ul) in\n LSZ.size32_constant compressionMethod_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_compressionMethod_key : LL.leaf_reader parse_maybe_compressionMethod_key =\n LL.mk_read_maybe_enum_key compressionMethod_repr_reader compressionMethod_enum\n\nlet compressionMethod_reader =\n [@inline_let] let _ = lemma_synth_compressionMethod_inj () in\n LL.read_synth' parse_maybe_compressionMethod_key synth_compressionMethod read_maybe_compressionMethod_key ()\n\ninline_for_extraction let write_maybe_compressionMethod_key : LL.leaf_writer_strong serialize_maybe_compressionMethod_key =\n LL.write_maybe_enum_key compressionMethod_repr_writer compressionMethod_enum (_ by (LP.enum_repr_of_key_tac compressionMethod_enum))\n\ninline_for_extraction let lserialize_maybe_compressionMethod_key : LL.serializer32 serialize_maybe_compressionMethod_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_compressionMethod_key 1ul ()\n\nlet compressionMethod_writer =\n [@inline_let] let _ = lemma_synth_compressionMethod_inj (); lemma_synth_compressionMethod_inv () in\n LL.write_synth write_maybe_compressionMethod_key synth_compressionMethod synth_compressionMethod_inv (fun x -> synth_compressionMethod_inv x) ()", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 Parsers.CompressionMethod.compressionMethod_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.serializer32_of_leaf_writer_strong_constant_size", "Parsers.CompressionMethod.compressionMethod_parser_kind", "Parsers.CompressionMethod.compressionMethod", "Parsers.CompressionMethod.compressionMethod_parser", "Parsers.CompressionMethod.compressionMethod_serializer", "Parsers.CompressionMethod.compressionMethod_writer", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val compressionMethod_lserializer: LL.serializer32 compressionMethod_serializer\nlet compressionMethod_lserializer =", "completed_definiton": "LL.serializer32_of_leaf_writer_strong_constant_size compressionMethod_writer 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.lemma_synth_compressionMethod_inv'", "original_source_type": "val lemma_synth_compressionMethod_inv': Prims.unit\n -> Lemma (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod)", "source_type": "val lemma_synth_compressionMethod_inv': Prims.unit\n -> Lemma (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod)", "source_definition": "let lemma_synth_compressionMethod_inv' () : Lemma\n (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod)\n= LP.forall_maybe_enum_key compressionMethod_enum (fun x -> synth_compressionMethod_inv (synth_compressionMethod x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 75, "start_col": 2, "end_line": 77, "end_col": 52 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let compressionMethod_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let compressionMethod_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_compressionMethod (x:LP.maybe_enum_key compressionMethod_enum) : compressionMethod = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n Unknown_compressionMethod v\n\ninline_for_extraction let synth_compressionMethod_inv (x:compressionMethod) : LP.maybe_enum_key compressionMethod_enum = \n match x with\n | Unknown_compressionMethod y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : compressionMethod = x in\n [@inline_let] let _ : squash(not (Unknown_compressionMethod? x1) ==> LP.list_mem x1 (LP.list_map fst compressionMethod_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key compressionMethod_enum)\n\nlet lemma_synth_compressionMethod_inv' () : Lemma", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_inverse Parsers.CompressionMethod.synth_compressionMethod_inv\n Parsers.CompressionMethod.synth_compressionMethod)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "LowParse.Spec.Enum.forall_maybe_enum_key", "Parsers.CompressionMethod.compressionMethod", "FStar.UInt8.t", "Parsers.CompressionMethod.compressionMethod_enum", "LowParse.Spec.Enum.maybe_enum_key", "Prims.eq2", "Parsers.CompressionMethod.synth_compressionMethod_inv", "Parsers.CompressionMethod.synth_compressionMethod", "Prims.squash", "Prims.l_imp", "Prims.bool", "LowParse.Spec.Enum.list_mem", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.snd", "LowParse.Spec.Enum.Unknown", "Prims.l_True", "LowParse.Spec.Combinators.synth_inverse", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_synth_compressionMethod_inv': Prims.unit\n -> Lemma (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod)\nlet lemma_synth_compressionMethod_inv' ()\n : Lemma (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod) =", "completed_definiton": "LP.forall_maybe_enum_key compressionMethod_enum\n (fun x -> synth_compressionMethod_inv (synth_compressionMethod x) == x)\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.forall_maybe_enum_key_known_tac ())))\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.forall_maybe_enum_key_unknown_tac ())))", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.compressionMethod_bytesize_eqn", "original_source_type": "val compressionMethod_bytesize_eqn (x: compressionMethod) : Lemma (compressionMethod_bytesize x == 1) [SMTPat (compressionMethod_bytesize x)]", "source_type": "val compressionMethod_bytesize_eqn (x: compressionMethod) : Lemma (compressionMethod_bytesize x == 1) [SMTPat (compressionMethod_bytesize x)]", "source_definition": "let compressionMethod_bytesize_eqn x = compressionMethod_bytesize_eq x; assert (FStar.Seq.length (LP.serialize compressionMethod_serializer x) <= 1); assert (1 <= FStar.Seq.length (LP.serialize compressionMethod_serializer x))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 148, "start_col": 39, "end_line": 148, "end_col": 226 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let compressionMethod_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let compressionMethod_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_compressionMethod (x:LP.maybe_enum_key compressionMethod_enum) : compressionMethod = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n Unknown_compressionMethod v\n\ninline_for_extraction let synth_compressionMethod_inv (x:compressionMethod) : LP.maybe_enum_key compressionMethod_enum = \n match x with\n | Unknown_compressionMethod y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : compressionMethod = x in\n [@inline_let] let _ : squash(not (Unknown_compressionMethod? x1) ==> LP.list_mem x1 (LP.list_map fst compressionMethod_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key compressionMethod_enum)\n\nlet lemma_synth_compressionMethod_inv' () : Lemma\n (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod)\n= LP.forall_maybe_enum_key compressionMethod_enum (fun x -> synth_compressionMethod_inv (synth_compressionMethod x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_compressionMethod_inj () : Lemma\n (LP.synth_injective synth_compressionMethod) = \n lemma_synth_compressionMethod_inv' ();\n LP.synth_inverse_synth_injective synth_compressionMethod synth_compressionMethod_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_compressionMethod_inv () : Lemma\n (LP.synth_inverse synth_compressionMethod synth_compressionMethod_inv) = allow_inversion compressionMethod; ()\n\n#pop-options\nnoextract let parse_maybe_compressionMethod_key : LP.parser _ (LP.maybe_enum_key compressionMethod_enum) =\n LP.parse_maybe_enum_key compressionMethod_repr_parser compressionMethod_enum\n\nnoextract let serialize_maybe_compressionMethod_key : LP.serializer parse_maybe_compressionMethod_key =\n LP.serialize_maybe_enum_key compressionMethod_repr_parser compressionMethod_repr_serializer compressionMethod_enum\n\nnoextract let compressionMethod_parser : LP.parser _ compressionMethod =\n lemma_synth_compressionMethod_inj ();\n parse_maybe_compressionMethod_key `LP.parse_synth` synth_compressionMethod\n\nnoextract let compressionMethod_serializer : LP.serializer compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LP.serialize_synth _ synth_compressionMethod serialize_maybe_compressionMethod_key synth_compressionMethod_inv ()\n\nlet compressionMethod_bytesize (x:compressionMethod) : GTot nat = Seq.length (compressionMethod_serializer x)\n\nlet compressionMethod_bytesize_eq x = ()\n\nlet parse32_maybe_compressionMethod_key : LS.parser32 parse_maybe_compressionMethod_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac compressionMethod_repr_parser32 compressionMethod_enum)\n\nlet compressionMethod_parser32 : LS.parser32 compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n LS.parse32_synth _ synth_compressionMethod (fun x->synth_compressionMethod x) parse32_maybe_compressionMethod_key ()\n\nlet serialize32_maybe_compressionMethod_key : LS.serializer32 serialize_maybe_compressionMethod_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n compressionMethod_repr_serializer32 compressionMethod_enum)\n\nlet compressionMethod_serializer32 : LS.serializer32 compressionMethod_serializer =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LS.serialize32_synth _ synth_compressionMethod _ serialize32_maybe_compressionMethod_key synth_compressionMethod_inv (fun x->synth_compressionMethod_inv x) ()\n\nlet compressionMethod_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond compressionMethod_serializer 1ul) in\n LSZ.size32_constant compressionMethod_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_compressionMethod_key : LL.leaf_reader parse_maybe_compressionMethod_key =\n LL.mk_read_maybe_enum_key compressionMethod_repr_reader compressionMethod_enum\n\nlet compressionMethod_reader =\n [@inline_let] let _ = lemma_synth_compressionMethod_inj () in\n LL.read_synth' parse_maybe_compressionMethod_key synth_compressionMethod read_maybe_compressionMethod_key ()\n\ninline_for_extraction let write_maybe_compressionMethod_key : LL.leaf_writer_strong serialize_maybe_compressionMethod_key =\n LL.write_maybe_enum_key compressionMethod_repr_writer compressionMethod_enum (_ by (LP.enum_repr_of_key_tac compressionMethod_enum))\n\ninline_for_extraction let lserialize_maybe_compressionMethod_key : LL.serializer32 serialize_maybe_compressionMethod_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_compressionMethod_key 1ul ()\n\nlet compressionMethod_writer =\n [@inline_let] let _ = lemma_synth_compressionMethod_inj (); lemma_synth_compressionMethod_inv () in\n LL.write_synth write_maybe_compressionMethod_key synth_compressionMethod synth_compressionMethod_inv (fun x -> synth_compressionMethod_inv x) ()\n\nlet compressionMethod_lserializer = LL.serializer32_of_leaf_writer_strong_constant_size compressionMethod_writer 1ul ()", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.CompressionMethod.compressionMethod\n -> FStar.Pervasives.Lemma (ensures Parsers.CompressionMethod.compressionMethod_bytesize x == 1)\n [SMTPat (Parsers.CompressionMethod.compressionMethod_bytesize x)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.CompressionMethod.compressionMethod", "Prims._assert", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "Parsers.CompressionMethod.compressionMethod_parser_kind", "Parsers.CompressionMethod.compressionMethod_parser", "Parsers.CompressionMethod.compressionMethod_serializer", "Prims.unit", "Parsers.CompressionMethod.compressionMethod_bytesize_eq" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val compressionMethod_bytesize_eqn (x: compressionMethod) : Lemma (compressionMethod_bytesize x == 1) [SMTPat (compressionMethod_bytesize x)]\nlet compressionMethod_bytesize_eqn x =", "completed_definiton": "compressionMethod_bytesize_eq x;\nassert (FStar.Seq.length (LP.serialize compressionMethod_serializer x) <= 1);\nassert (1 <= FStar.Seq.length (LP.serialize compressionMethod_serializer x))", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.lserialize_maybe_compressionMethod_key", "original_source_type": "val lserialize_maybe_compressionMethod_key:LL.serializer32 serialize_maybe_compressionMethod_key", "source_type": "val lserialize_maybe_compressionMethod_key:LL.serializer32 serialize_maybe_compressionMethod_key", "source_definition": "let lserialize_maybe_compressionMethod_key : LL.serializer32 serialize_maybe_compressionMethod_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_compressionMethod_key 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 140, "start_col": 2, "end_line": 140, "end_col": 94 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let compressionMethod_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let compressionMethod_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_compressionMethod (x:LP.maybe_enum_key compressionMethod_enum) : compressionMethod = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n Unknown_compressionMethod v\n\ninline_for_extraction let synth_compressionMethod_inv (x:compressionMethod) : LP.maybe_enum_key compressionMethod_enum = \n match x with\n | Unknown_compressionMethod y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : compressionMethod = x in\n [@inline_let] let _ : squash(not (Unknown_compressionMethod? x1) ==> LP.list_mem x1 (LP.list_map fst compressionMethod_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key compressionMethod_enum)\n\nlet lemma_synth_compressionMethod_inv' () : Lemma\n (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod)\n= LP.forall_maybe_enum_key compressionMethod_enum (fun x -> synth_compressionMethod_inv (synth_compressionMethod x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_compressionMethod_inj () : Lemma\n (LP.synth_injective synth_compressionMethod) = \n lemma_synth_compressionMethod_inv' ();\n LP.synth_inverse_synth_injective synth_compressionMethod synth_compressionMethod_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_compressionMethod_inv () : Lemma\n (LP.synth_inverse synth_compressionMethod synth_compressionMethod_inv) = allow_inversion compressionMethod; ()\n\n#pop-options\nnoextract let parse_maybe_compressionMethod_key : LP.parser _ (LP.maybe_enum_key compressionMethod_enum) =\n LP.parse_maybe_enum_key compressionMethod_repr_parser compressionMethod_enum\n\nnoextract let serialize_maybe_compressionMethod_key : LP.serializer parse_maybe_compressionMethod_key =\n LP.serialize_maybe_enum_key compressionMethod_repr_parser compressionMethod_repr_serializer compressionMethod_enum\n\nnoextract let compressionMethod_parser : LP.parser _ compressionMethod =\n lemma_synth_compressionMethod_inj ();\n parse_maybe_compressionMethod_key `LP.parse_synth` synth_compressionMethod\n\nnoextract let compressionMethod_serializer : LP.serializer compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LP.serialize_synth _ synth_compressionMethod serialize_maybe_compressionMethod_key synth_compressionMethod_inv ()\n\nlet compressionMethod_bytesize (x:compressionMethod) : GTot nat = Seq.length (compressionMethod_serializer x)\n\nlet compressionMethod_bytesize_eq x = ()\n\nlet parse32_maybe_compressionMethod_key : LS.parser32 parse_maybe_compressionMethod_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac compressionMethod_repr_parser32 compressionMethod_enum)\n\nlet compressionMethod_parser32 : LS.parser32 compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n LS.parse32_synth _ synth_compressionMethod (fun x->synth_compressionMethod x) parse32_maybe_compressionMethod_key ()\n\nlet serialize32_maybe_compressionMethod_key : LS.serializer32 serialize_maybe_compressionMethod_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n compressionMethod_repr_serializer32 compressionMethod_enum)\n\nlet compressionMethod_serializer32 : LS.serializer32 compressionMethod_serializer =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LS.serialize32_synth _ synth_compressionMethod _ serialize32_maybe_compressionMethod_key synth_compressionMethod_inv (fun x->synth_compressionMethod_inv x) ()\n\nlet compressionMethod_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond compressionMethod_serializer 1ul) in\n LSZ.size32_constant compressionMethod_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_compressionMethod_key : LL.leaf_reader parse_maybe_compressionMethod_key =\n LL.mk_read_maybe_enum_key compressionMethod_repr_reader compressionMethod_enum\n\nlet compressionMethod_reader =\n [@inline_let] let _ = lemma_synth_compressionMethod_inj () in\n LL.read_synth' parse_maybe_compressionMethod_key synth_compressionMethod read_maybe_compressionMethod_key ()\n\ninline_for_extraction let write_maybe_compressionMethod_key : LL.leaf_writer_strong serialize_maybe_compressionMethod_key =\n LL.write_maybe_enum_key compressionMethod_repr_writer compressionMethod_enum (_ by (LP.enum_repr_of_key_tac compressionMethod_enum))", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 Parsers.CompressionMethod.serialize_maybe_compressionMethod_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.serializer32_of_leaf_writer_strong_constant_size", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.CompressionMethod.compressionMethod", "FStar.UInt8.t", "Parsers.CompressionMethod.compressionMethod_enum", "Parsers.CompressionMethod.parse_maybe_compressionMethod_key", "Parsers.CompressionMethod.serialize_maybe_compressionMethod_key", "Parsers.CompressionMethod.write_maybe_compressionMethod_key", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lserialize_maybe_compressionMethod_key:LL.serializer32 serialize_maybe_compressionMethod_key\nlet lserialize_maybe_compressionMethod_key:LL.serializer32 serialize_maybe_compressionMethod_key =", "completed_definiton": "LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_compressionMethod_key 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.serialize32_maybe_compressionMethod_key", "original_source_type": "val serialize32_maybe_compressionMethod_key:LS.serializer32 serialize_maybe_compressionMethod_key", "source_type": "val serialize32_maybe_compressionMethod_key:LS.serializer32 serialize_maybe_compressionMethod_key", "source_definition": "let serialize32_maybe_compressionMethod_key : LS.serializer32 serialize_maybe_compressionMethod_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n compressionMethod_repr_serializer32 compressionMethod_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 116, "start_col": 2, "end_line": 117, "end_col": 63 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let compressionMethod_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let compressionMethod_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_compressionMethod (x:LP.maybe_enum_key compressionMethod_enum) : compressionMethod = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n Unknown_compressionMethod v\n\ninline_for_extraction let synth_compressionMethod_inv (x:compressionMethod) : LP.maybe_enum_key compressionMethod_enum = \n match x with\n | Unknown_compressionMethod y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : compressionMethod = x in\n [@inline_let] let _ : squash(not (Unknown_compressionMethod? x1) ==> LP.list_mem x1 (LP.list_map fst compressionMethod_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key compressionMethod_enum)\n\nlet lemma_synth_compressionMethod_inv' () : Lemma\n (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod)\n= LP.forall_maybe_enum_key compressionMethod_enum (fun x -> synth_compressionMethod_inv (synth_compressionMethod x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_compressionMethod_inj () : Lemma\n (LP.synth_injective synth_compressionMethod) = \n lemma_synth_compressionMethod_inv' ();\n LP.synth_inverse_synth_injective synth_compressionMethod synth_compressionMethod_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_compressionMethod_inv () : Lemma\n (LP.synth_inverse synth_compressionMethod synth_compressionMethod_inv) = allow_inversion compressionMethod; ()\n\n#pop-options\nnoextract let parse_maybe_compressionMethod_key : LP.parser _ (LP.maybe_enum_key compressionMethod_enum) =\n LP.parse_maybe_enum_key compressionMethod_repr_parser compressionMethod_enum\n\nnoextract let serialize_maybe_compressionMethod_key : LP.serializer parse_maybe_compressionMethod_key =\n LP.serialize_maybe_enum_key compressionMethod_repr_parser compressionMethod_repr_serializer compressionMethod_enum\n\nnoextract let compressionMethod_parser : LP.parser _ compressionMethod =\n lemma_synth_compressionMethod_inj ();\n parse_maybe_compressionMethod_key `LP.parse_synth` synth_compressionMethod\n\nnoextract let compressionMethod_serializer : LP.serializer compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LP.serialize_synth _ synth_compressionMethod serialize_maybe_compressionMethod_key synth_compressionMethod_inv ()\n\nlet compressionMethod_bytesize (x:compressionMethod) : GTot nat = Seq.length (compressionMethod_serializer x)\n\nlet compressionMethod_bytesize_eq x = ()\n\nlet parse32_maybe_compressionMethod_key : LS.parser32 parse_maybe_compressionMethod_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac compressionMethod_repr_parser32 compressionMethod_enum)\n\nlet compressionMethod_parser32 : LS.parser32 compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n LS.parse32_synth _ synth_compressionMethod (fun x->synth_compressionMethod x) parse32_maybe_compressionMethod_key ()", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.CompressionMethod.serialize_maybe_compressionMethod_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Enum.serialize32_maybe_enum_key_gen", "LowParse.Spec.Int.parse_u8_kind", "Parsers.CompressionMethod.compressionMethod", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "Parsers.CompressionMethod.compressionMethod_repr_serializer32", "Parsers.CompressionMethod.compressionMethod_enum", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.CompressionMethod.parse_maybe_compressionMethod_key", "Parsers.CompressionMethod.serialize_maybe_compressionMethod_key", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize32_maybe_compressionMethod_key:LS.serializer32 serialize_maybe_compressionMethod_key\nlet serialize32_maybe_compressionMethod_key:LS.serializer32 serialize_maybe_compressionMethod_key =", "completed_definiton": "FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac compressionMethod_repr_serializer32\n compressionMethod_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fst", "name": "Parsers.CompressionMethod.parse32_maybe_compressionMethod_key", "original_source_type": "val parse32_maybe_compressionMethod_key:LS.parser32 parse_maybe_compressionMethod_key", "source_type": "val parse32_maybe_compressionMethod_key:LS.parser32 parse_maybe_compressionMethod_key", "source_definition": "let parse32_maybe_compressionMethod_key : LS.parser32 parse_maybe_compressionMethod_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac compressionMethod_repr_parser32 compressionMethod_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 109, "start_col": 2, "end_line": 109, "end_col": 118 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let compressionMethod_enum : LP.enum compressionMethod U8.t =\n [@inline_let] let e = [\n NullCompression, 0z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let compressionMethod_repr_parser = LPI.parse_u8\n\nnoextract let compressionMethod_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let compressionMethod_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let compressionMethod_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let compressionMethod_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let compressionMethod_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let compressionMethod_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_compressionMethod (x:LP.maybe_enum_key compressionMethod_enum) : compressionMethod = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n Unknown_compressionMethod v\n\ninline_for_extraction let synth_compressionMethod_inv (x:compressionMethod) : LP.maybe_enum_key compressionMethod_enum = \n match x with\n | Unknown_compressionMethod y ->\n [@inline_let] let v : U8.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd compressionMethod_enum) == known_compressionMethod_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : compressionMethod = x in\n [@inline_let] let _ : squash(not (Unknown_compressionMethod? x1) ==> LP.list_mem x1 (LP.list_map fst compressionMethod_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key compressionMethod_enum)\n\nlet lemma_synth_compressionMethod_inv' () : Lemma\n (LP.synth_inverse synth_compressionMethod_inv synth_compressionMethod)\n= LP.forall_maybe_enum_key compressionMethod_enum (fun x -> synth_compressionMethod_inv (synth_compressionMethod x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_compressionMethod_inj () : Lemma\n (LP.synth_injective synth_compressionMethod) = \n lemma_synth_compressionMethod_inv' ();\n LP.synth_inverse_synth_injective synth_compressionMethod synth_compressionMethod_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_compressionMethod_inv () : Lemma\n (LP.synth_inverse synth_compressionMethod synth_compressionMethod_inv) = allow_inversion compressionMethod; ()\n\n#pop-options\nnoextract let parse_maybe_compressionMethod_key : LP.parser _ (LP.maybe_enum_key compressionMethod_enum) =\n LP.parse_maybe_enum_key compressionMethod_repr_parser compressionMethod_enum\n\nnoextract let serialize_maybe_compressionMethod_key : LP.serializer parse_maybe_compressionMethod_key =\n LP.serialize_maybe_enum_key compressionMethod_repr_parser compressionMethod_repr_serializer compressionMethod_enum\n\nnoextract let compressionMethod_parser : LP.parser _ compressionMethod =\n lemma_synth_compressionMethod_inj ();\n parse_maybe_compressionMethod_key `LP.parse_synth` synth_compressionMethod\n\nnoextract let compressionMethod_serializer : LP.serializer compressionMethod_parser =\n lemma_synth_compressionMethod_inj ();\n lemma_synth_compressionMethod_inv ();\n LP.serialize_synth _ synth_compressionMethod serialize_maybe_compressionMethod_key synth_compressionMethod_inv ()\n\nlet compressionMethod_bytesize (x:compressionMethod) : GTot nat = Seq.length (compressionMethod_serializer x)\n\nlet compressionMethod_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.CompressionMethod.fst", "checked_file": "Parsers.CompressionMethod.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.CompressionMethod.parse_maybe_compressionMethod_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Enum.parse32_maybe_enum_key_gen", "LowParse.Spec.Int.parse_u8_kind", "Parsers.CompressionMethod.compressionMethod", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "Parsers.CompressionMethod.compressionMethod_repr_parser32", "Parsers.CompressionMethod.compressionMethod_enum", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.CompressionMethod.parse_maybe_compressionMethod_key", "LowParse.Spec.Enum.maybe_enum_key_of_repr'_t_cons_nil'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse32_maybe_compressionMethod_key:LS.parser32 parse_maybe_compressionMethod_key\nlet parse32_maybe_compressionMethod_key:LS.parser32 parse_maybe_compressionMethod_key =", "completed_definiton": "FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac compressionMethod_repr_parser32\n compressionMethod_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_nonce.fsti", "name": "Parsers.TicketContents13_nonce.max_len", "original_source_type": "", "source_type": "val max_len : Prims.int", "source_definition": "let max_len = 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_nonce.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 22, "start_col": 46, "end_line": 22, "end_col": 49 }, "file_context": "module Parsers.TicketContents13_nonce\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST", "dependencies": { "source_file": "Parsers.TicketContents13_nonce.fsti", "checked_file": "Parsers.TicketContents13_nonce.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.int", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let max_len =", "completed_definiton": "255", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_nonce.fsti", "name": "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "original_source_type": "", "source_type": "val ticketContents13_nonce_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let ticketContents13_nonce_parser_kind = LP.strong_parser_kind 1 256 None", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_nonce.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 25, "start_col": 73, "end_line": 25, "end_col": 105 }, "file_context": "module Parsers.TicketContents13_nonce\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ninline_for_extraction noextract let min_len = 0\ninline_for_extraction noextract let max_len = 255\ntype ticketContents13_nonce = b:bytes{0 <= length b /\\ length b <= 255}", "dependencies": { "source_file": "Parsers.TicketContents13_nonce.fsti", "checked_file": "Parsers.TicketContents13_nonce.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let ticketContents13_nonce_parser_kind =", "completed_definiton": "LP.strong_parser_kind 1 256 None", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_nonce.fsti", "name": "Parsers.TicketContents13_nonce.min_len", "original_source_type": "", "source_type": "val min_len : Prims.int", "source_definition": "let min_len = 0", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_nonce.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 21, "start_col": 46, "end_line": 21, "end_col": 47 }, "file_context": "module Parsers.TicketContents13_nonce\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST", "dependencies": { "source_file": "Parsers.TicketContents13_nonce.fsti", "checked_file": "Parsers.TicketContents13_nonce.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.int", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let min_len =", "completed_definiton": "0", "isa_cross_project_example": true }, { "file_name": "Hashing.Spec.fst", "name": "Hashing.Spec.max_hash_len", "original_source_type": "", "source_type": "val max_hash_len : FStar.UInt32.t", "source_definition": "let max_hash_len = 64ul", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Hashing.Spec.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 27, "start_col": 19, "end_line": 27, "end_col": 23 }, "file_context": "\ufeff(** hash algorithms and providers\n\n * provides bytes-friendly API before idealization\n * no dependency on TLS: could go to EverCrypt or SecureAPI.\n\n*)\nmodule Hashing.Spec\n\ninclude EverCrypt.Hash\ninclude Spec.Hash.Definitions\n\nopen FStar.Bytes\n\nopen Declassify\n\n#set-options \"--max_fuel 0 --max_ifuel 0 --z3rlimit 10\"\n\nlet alg = a:alg { is_md a }\n\nlet hash_len (a:alg)\n : n:UInt32.t{UInt32.v n == hash_length a}\n = Hacl.Hash.Definitions.hash_len a\n\ntype tag (a:alg) = Bytes.lbytes (hash_length a)", "dependencies": { "source_file": "Hashing.Spec.fst", "checked_file": "Hashing.Spec.fst.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HMAC.fsti.checked", "prims.fst.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.HMAC.fsti.checked", "EverCrypt.Hash.fsti.checked", "Declassify.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Declassify" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Hash.Definitions" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": false, "short_module": null, "full_module": "Hashing" }, { "abbrev": false, "short_module": null, "full_module": "Hashing" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 10, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "FStar.UInt32.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let max_hash_len =", "completed_definiton": "64ul", "isa_cross_project_example": true }, { "file_name": "Hashing.Spec.fst", "name": "Hashing.Spec.alg", "original_source_type": "", "source_type": "val alg : Type0", "source_definition": "let alg = a:alg { is_md a }", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Hashing.Spec.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 18, "start_col": 10, "end_line": 18, "end_col": 27 }, "file_context": "\ufeff(** hash algorithms and providers\n\n * provides bytes-friendly API before idealization\n * no dependency on TLS: could go to EverCrypt or SecureAPI.\n\n*)\nmodule Hashing.Spec\n\ninclude EverCrypt.Hash\ninclude Spec.Hash.Definitions\n\nopen FStar.Bytes\n\nopen Declassify\n\n#set-options \"--max_fuel 0 --max_ifuel 0 --z3rlimit 10\"", "dependencies": { "source_file": "Hashing.Spec.fst", "checked_file": "Hashing.Spec.fst.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HMAC.fsti.checked", "prims.fst.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.HMAC.fsti.checked", "EverCrypt.Hash.fsti.checked", "Declassify.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Declassify" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Hash.Definitions" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": false, "short_module": null, "full_module": "Hashing" }, { "abbrev": false, "short_module": null, "full_module": "Hashing" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 10, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "EverCrypt.Hash.alg", "Prims.b2t", "Spec.Hash.Definitions.is_md" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alg =", "completed_definiton": "a: alg{is_md a}", "isa_cross_project_example": true }, { "file_name": "Hashing.Spec.fst", "name": "Hashing.Spec.max_block_len", "original_source_type": "", "source_type": "val max_block_len : FStar.UInt32.t", "source_definition": "let max_block_len = 128ul", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Hashing.Spec.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 31, "start_col": 20, "end_line": 31, "end_col": 25 }, "file_context": "\ufeff(** hash algorithms and providers\n\n * provides bytes-friendly API before idealization\n * no dependency on TLS: could go to EverCrypt or SecureAPI.\n\n*)\nmodule Hashing.Spec\n\ninclude EverCrypt.Hash\ninclude Spec.Hash.Definitions\n\nopen FStar.Bytes\n\nopen Declassify\n\n#set-options \"--max_fuel 0 --max_ifuel 0 --z3rlimit 10\"\n\nlet alg = a:alg { is_md a }\n\nlet hash_len (a:alg)\n : n:UInt32.t{UInt32.v n == hash_length a}\n = Hacl.Hash.Definitions.hash_len a\n\ntype tag (a:alg) = Bytes.lbytes (hash_length a)\n\nlet max_hash_length = 64\nlet max_hash_len = 64ul\ntype anyTag = lbytes max_hash_length", "dependencies": { "source_file": "Hashing.Spec.fst", "checked_file": "Hashing.Spec.fst.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HMAC.fsti.checked", "prims.fst.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.HMAC.fsti.checked", "EverCrypt.Hash.fsti.checked", "Declassify.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Declassify" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Hash.Definitions" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": false, "short_module": null, "full_module": "Hashing" }, { "abbrev": false, "short_module": null, "full_module": "Hashing" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 10, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "FStar.UInt32.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let max_block_len =", "completed_definiton": "128ul", "isa_cross_project_example": true }, { "file_name": "Hashing.Spec.fst", "name": "Hashing.Spec.max_hash_length", "original_source_type": "", "source_type": "val max_hash_length : Prims.int", "source_definition": "let max_hash_length = 64", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Hashing.Spec.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 26, "start_col": 22, "end_line": 26, "end_col": 24 }, "file_context": "\ufeff(** hash algorithms and providers\n\n * provides bytes-friendly API before idealization\n * no dependency on TLS: could go to EverCrypt or SecureAPI.\n\n*)\nmodule Hashing.Spec\n\ninclude EverCrypt.Hash\ninclude Spec.Hash.Definitions\n\nopen FStar.Bytes\n\nopen Declassify\n\n#set-options \"--max_fuel 0 --max_ifuel 0 --z3rlimit 10\"\n\nlet alg = a:alg { is_md a }\n\nlet hash_len (a:alg)\n : n:UInt32.t{UInt32.v n == hash_length a}\n = Hacl.Hash.Definitions.hash_len a\n\ntype tag (a:alg) = Bytes.lbytes (hash_length a)", "dependencies": { "source_file": "Hashing.Spec.fst", "checked_file": "Hashing.Spec.fst.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HMAC.fsti.checked", "prims.fst.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.HMAC.fsti.checked", "EverCrypt.Hash.fsti.checked", "Declassify.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Declassify" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Hash.Definitions" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": false, "short_module": null, "full_module": "Hashing" }, { "abbrev": false, "short_module": null, "full_module": "Hashing" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 10, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.int", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let max_hash_length =", "completed_definiton": "64", "isa_cross_project_example": true }, { "file_name": "Hashing.Spec.fst", "name": "Hashing.Spec.max_block_length", "original_source_type": "", "source_type": "val max_block_length : Prims.int", "source_definition": "let max_block_length = 128", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Hashing.Spec.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 30, "start_col": 23, "end_line": 30, "end_col": 26 }, "file_context": "\ufeff(** hash algorithms and providers\n\n * provides bytes-friendly API before idealization\n * no dependency on TLS: could go to EverCrypt or SecureAPI.\n\n*)\nmodule Hashing.Spec\n\ninclude EverCrypt.Hash\ninclude Spec.Hash.Definitions\n\nopen FStar.Bytes\n\nopen Declassify\n\n#set-options \"--max_fuel 0 --max_ifuel 0 --z3rlimit 10\"\n\nlet alg = a:alg { is_md a }\n\nlet hash_len (a:alg)\n : n:UInt32.t{UInt32.v n == hash_length a}\n = Hacl.Hash.Definitions.hash_len a\n\ntype tag (a:alg) = Bytes.lbytes (hash_length a)\n\nlet max_hash_length = 64\nlet max_hash_len = 64ul\ntype anyTag = lbytes max_hash_length", "dependencies": { "source_file": "Hashing.Spec.fst", "checked_file": "Hashing.Spec.fst.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HMAC.fsti.checked", "prims.fst.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.HMAC.fsti.checked", "EverCrypt.Hash.fsti.checked", "Declassify.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Declassify" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Hash.Definitions" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": false, "short_module": null, "full_module": "Hashing" }, { "abbrev": false, "short_module": null, "full_module": "Hashing" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 10, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.int", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let max_block_length =", "completed_definiton": "128", "isa_cross_project_example": true }, { "file_name": "Hashing.Spec.fst", "name": "Hashing.Spec.hash_len", "original_source_type": "val hash_len (a: alg) : n: UInt32.t{UInt32.v n == hash_length a}", "source_type": "val hash_len (a: alg) : n: UInt32.t{UInt32.v n == hash_length a}", "source_definition": "let hash_len (a:alg)\n : n:UInt32.t{UInt32.v n == hash_length a}\n = Hacl.Hash.Definitions.hash_len a", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Hashing.Spec.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 22, "start_col": 4, "end_line": 22, "end_col": 36 }, "file_context": "\ufeff(** hash algorithms and providers\n\n * provides bytes-friendly API before idealization\n * no dependency on TLS: could go to EverCrypt or SecureAPI.\n\n*)\nmodule Hashing.Spec\n\ninclude EverCrypt.Hash\ninclude Spec.Hash.Definitions\n\nopen FStar.Bytes\n\nopen Declassify\n\n#set-options \"--max_fuel 0 --max_ifuel 0 --z3rlimit 10\"\n\nlet alg = a:alg { is_md a }\n\nlet hash_len (a:alg)", "dependencies": { "source_file": "Hashing.Spec.fst", "checked_file": "Hashing.Spec.fst.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HMAC.fsti.checked", "prims.fst.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.HMAC.fsti.checked", "EverCrypt.Hash.fsti.checked", "Declassify.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Declassify" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Hash.Definitions" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": false, "short_module": null, "full_module": "Hashing" }, { "abbrev": false, "short_module": null, "full_module": "Hashing" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 10, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Hashing.Spec.alg -> n: FStar.UInt32.t{FStar.UInt32.v n == Spec.Hash.Definitions.hash_length a}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Hashing.Spec.alg", "Hacl.Hash.Definitions.hash_len", "FStar.UInt32.t", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "Prims.op_LessThanOrEqual", "Lib.IntTypes.max_size_t", "Prims.op_GreaterThan", "FStar.UInt32.v", "Spec.Hash.Definitions.hash_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hash_len (a: alg) : n: UInt32.t{UInt32.v n == hash_length a}\nlet hash_len (a: alg) : n: UInt32.t{UInt32.v n == hash_length a} =", "completed_definiton": "Hacl.Hash.Definitions.hash_len a", "isa_cross_project_example": true }, { "file_name": "Hashing.Spec.fst", "name": "Hashing.Spec.zeroHash", "original_source_type": "val zeroHash (a: alg) : Tot (tag a)", "source_type": "val zeroHash (a: alg) : Tot (tag a)", "source_definition": "let zeroHash (a:alg): Tot (tag a) = Bytes.create (Hacl.Hash.Definitions.hash_len a) 0uy", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Hashing.Spec.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 88, "start_col": 36, "end_line": 88, "end_col": 87 }, "file_context": "\ufeff(** hash algorithms and providers\n\n * provides bytes-friendly API before idealization\n * no dependency on TLS: could go to EverCrypt or SecureAPI.\n\n*)\nmodule Hashing.Spec\n\ninclude EverCrypt.Hash\ninclude Spec.Hash.Definitions\n\nopen FStar.Bytes\n\nopen Declassify\n\n#set-options \"--max_fuel 0 --max_ifuel 0 --z3rlimit 10\"\n\nlet alg = a:alg { is_md a }\n\nlet hash_len (a:alg)\n : n:UInt32.t{UInt32.v n == hash_length a}\n = Hacl.Hash.Definitions.hash_len a\n\ntype tag (a:alg) = Bytes.lbytes (hash_length a)\n\nlet max_hash_length = 64\nlet max_hash_len = 64ul\ntype anyTag = lbytes max_hash_length\n\nlet max_block_length = 128\nlet max_block_len = 128ul\n\nprivate let lemma_tagLen (a:alg)\n : Lemma (hash_length a <= max_hash_length)\n [SMTPat (hash_length a)]\n = ()\n\nprivate let lemma_blockLength (a:alg)\n : Lemma (block_length a <= max_block_length)\n [SMTPat (block_length a)]\n = ()\n\nlet macable a = b:bytes {length b + block_length a < pow2 32}\n// 32-bit implementation restriction\n\n// Adapting EverCrypt's HMAC specification to TLS. In contrast with\n// RFC 2104 (which take any key length), in TLS, the HMAC key has the\n// same length as the hash [TLS1.3, 4.4.3]\n\ntype hkey (a:alg) = b:bytes{\n // 18-09-12 this usage restriction is dubious, but always met in\n // miTLS; it avoids a null-pointer case in the wrapper below.\n length b > 0 /\\\n Spec.Agile.HMAC.keysized a (length b)}\n\nval hmac:\n a:alg ->\n k:hkey a ->\n text:macable a ->\n GTot (t:tag a{\n let text = Bytes.reveal text in\n (Seq.length text + block_length a) `less_than_max_input_length` a /\\\n Bytes.reveal t = Spec.Agile.HMAC.hmac a (Bytes.reveal k) text})\n\nlet hmac a k text =\n let k = Bytes.reveal k in\n let text = Bytes.reveal text in\n assert_norm (pow2 32 < pow2 61);\n assert_norm (pow2 61 < pow2 125);\n //assert (Seq.length text + block_length a <= max_input_length a);\n let t: bytes_hash a = Spec.Agile.HMAC.hmac a k text in\n Bytes.hide t\n\n//18-08-31 review\n// The hash of the empty string, used in KS\n#set-options \"--admit_smt_queries true\" //17-05-08 TODO size of bytes constants.\nlet emptyHash : a:alg -> Tot (tag a) =\n function\n | MD5 -> bytes_of_hex \"d41d8cd98f00b204e9800998ecf8427e\"\n | SHA1 -> bytes_of_hex \"da39a3ee5e6b4b0d3255bfef95601890afd80709\"\n | SHA2_224 -> bytes_of_hex \"2bc9476102bb288234c415a2b01f828ea62ac5b3e42f\"\n | SHA2_256 -> bytes_of_hex \"e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855\"\n | SHA2_384 -> bytes_of_hex \"38b060a751ac96384cd9327eb1b1e36a21fdb71114be07434c0cc7bf63f6e1da274edebfe76f65fbd51ad2f14898b95b\"\n | SHA2_512 -> bytes_of_hex \"cf83e1357eefb8bdf1542850d66d8007d620e4050b5715dc83f4a921d36ce9ce47d0d13c5d85f2b0ff8318d2877eec2f63b931bd47417a81a538327af927da3e\"\n#reset-options", "dependencies": { "source_file": "Hashing.Spec.fst", "checked_file": "Hashing.Spec.fst.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HMAC.fsti.checked", "prims.fst.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.HMAC.fsti.checked", "EverCrypt.Hash.fsti.checked", "Declassify.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Declassify" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Hash.Definitions" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": false, "short_module": null, "full_module": "Hashing" }, { "abbrev": false, "short_module": null, "full_module": "Hashing" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Hashing.Spec.alg -> Hashing.Spec.tag a", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Hashing.Spec.alg", "FStar.Bytes.create", "Hacl.Hash.Definitions.hash_len", "FStar.UInt8.__uint_to_t", "Hashing.Spec.tag" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val zeroHash (a: alg) : Tot (tag a)\nlet zeroHash (a: alg) : Tot (tag a) =", "completed_definiton": "Bytes.create (Hacl.Hash.Definitions.hash_len a) 0uy", "isa_cross_project_example": true }, { "file_name": "Hashing.Spec.fst", "name": "Hashing.Spec.tls_tagLen", "original_source_type": "val tls_tagLen: h:tls_alg{h<>NULL} -> Tot UInt32.t", "source_type": "val tls_tagLen: h:tls_alg{h<>NULL} -> Tot UInt32.t", "source_definition": "let tls_tagLen = function\n | Hash a -> Hacl.Hash.Definitions.hash_len a\n | MD5SHA1 -> Hacl.Hash.Definitions.hash_len MD5 `FStar.UInt32.add` Hacl.Hash.Definitions.hash_len SHA1", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Hashing.Spec.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 98, "start_col": 17, "end_line": 100, "end_col": 104 }, "file_context": "\ufeff(** hash algorithms and providers\n\n * provides bytes-friendly API before idealization\n * no dependency on TLS: could go to EverCrypt or SecureAPI.\n\n*)\nmodule Hashing.Spec\n\ninclude EverCrypt.Hash\ninclude Spec.Hash.Definitions\n\nopen FStar.Bytes\n\nopen Declassify\n\n#set-options \"--max_fuel 0 --max_ifuel 0 --z3rlimit 10\"\n\nlet alg = a:alg { is_md a }\n\nlet hash_len (a:alg)\n : n:UInt32.t{UInt32.v n == hash_length a}\n = Hacl.Hash.Definitions.hash_len a\n\ntype tag (a:alg) = Bytes.lbytes (hash_length a)\n\nlet max_hash_length = 64\nlet max_hash_len = 64ul\ntype anyTag = lbytes max_hash_length\n\nlet max_block_length = 128\nlet max_block_len = 128ul\n\nprivate let lemma_tagLen (a:alg)\n : Lemma (hash_length a <= max_hash_length)\n [SMTPat (hash_length a)]\n = ()\n\nprivate let lemma_blockLength (a:alg)\n : Lemma (block_length a <= max_block_length)\n [SMTPat (block_length a)]\n = ()\n\nlet macable a = b:bytes {length b + block_length a < pow2 32}\n// 32-bit implementation restriction\n\n// Adapting EverCrypt's HMAC specification to TLS. In contrast with\n// RFC 2104 (which take any key length), in TLS, the HMAC key has the\n// same length as the hash [TLS1.3, 4.4.3]\n\ntype hkey (a:alg) = b:bytes{\n // 18-09-12 this usage restriction is dubious, but always met in\n // miTLS; it avoids a null-pointer case in the wrapper below.\n length b > 0 /\\\n Spec.Agile.HMAC.keysized a (length b)}\n\nval hmac:\n a:alg ->\n k:hkey a ->\n text:macable a ->\n GTot (t:tag a{\n let text = Bytes.reveal text in\n (Seq.length text + block_length a) `less_than_max_input_length` a /\\\n Bytes.reveal t = Spec.Agile.HMAC.hmac a (Bytes.reveal k) text})\n\nlet hmac a k text =\n let k = Bytes.reveal k in\n let text = Bytes.reveal text in\n assert_norm (pow2 32 < pow2 61);\n assert_norm (pow2 61 < pow2 125);\n //assert (Seq.length text + block_length a <= max_input_length a);\n let t: bytes_hash a = Spec.Agile.HMAC.hmac a k text in\n Bytes.hide t\n\n//18-08-31 review\n// The hash of the empty string, used in KS\n#set-options \"--admit_smt_queries true\" //17-05-08 TODO size of bytes constants.\nlet emptyHash : a:alg -> Tot (tag a) =\n function\n | MD5 -> bytes_of_hex \"d41d8cd98f00b204e9800998ecf8427e\"\n | SHA1 -> bytes_of_hex \"da39a3ee5e6b4b0d3255bfef95601890afd80709\"\n | SHA2_224 -> bytes_of_hex \"2bc9476102bb288234c415a2b01f828ea62ac5b3e42f\"\n | SHA2_256 -> bytes_of_hex \"e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855\"\n | SHA2_384 -> bytes_of_hex \"38b060a751ac96384cd9327eb1b1e36a21fdb71114be07434c0cc7bf63f6e1da274edebfe76f65fbd51ad2f14898b95b\"\n | SHA2_512 -> bytes_of_hex \"cf83e1357eefb8bdf1542850d66d8007d620e4050b5715dc83f4a921d36ce9ce47d0d13c5d85f2b0ff8318d2877eec2f63b931bd47417a81a538327af927da3e\"\n#reset-options\n\n// A \"placeholder\" hash whose bytes are all 0, used for key-derivation in Handshake.Secret\nlet zeroHash (a:alg): Tot (tag a) = Bytes.create (Hacl.Hash.Definitions.hash_len a) 0uy\n\n\n// TLS-specific hash and MAC algorithms (review)\ntype tls_alg =\n | NULL\n | MD5SHA1\n | Hash of alg", "dependencies": { "source_file": "Hashing.Spec.fst", "checked_file": "Hashing.Spec.fst.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HMAC.fsti.checked", "prims.fst.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.HMAC.fsti.checked", "EverCrypt.Hash.fsti.checked", "Declassify.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Declassify" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Hash.Definitions" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": false, "short_module": null, "full_module": "Hashing" }, { "abbrev": false, "short_module": null, "full_module": "Hashing" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: Hashing.Spec.tls_alg{h <> Hashing.Spec.NULL} -> FStar.UInt32.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Hashing.Spec.tls_alg", "Prims.b2t", "Prims.op_disEquality", "Hashing.Spec.NULL", "Hashing.Spec.alg", "Hacl.Hash.Definitions.hash_len", "FStar.UInt32.add", "Spec.Hash.Definitions.MD5", "Spec.Hash.Definitions.SHA1", "FStar.UInt32.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val tls_tagLen: h:tls_alg{h<>NULL} -> Tot UInt32.t\nlet tls_tagLen =", "completed_definiton": "function\n| Hash a -> Hacl.Hash.Definitions.hash_len a\n| MD5SHA1 ->\n (Hacl.Hash.Definitions.hash_len MD5) `FStar.UInt32.add` (Hacl.Hash.Definitions.hash_len SHA1)", "isa_cross_project_example": true }, { "file_name": "Hashing.Spec.fst", "name": "Hashing.Spec.hmac", "original_source_type": "val hmac:\n a:alg ->\n k:hkey a ->\n text:macable a ->\n GTot (t:tag a{\n let text = Bytes.reveal text in\n (Seq.length text + block_length a) `less_than_max_input_length` a /\\\n Bytes.reveal t = Spec.Agile.HMAC.hmac a (Bytes.reveal k) text})", "source_type": "val hmac:\n a:alg ->\n k:hkey a ->\n text:macable a ->\n GTot (t:tag a{\n let text = Bytes.reveal text in\n (Seq.length text + block_length a) `less_than_max_input_length` a /\\\n Bytes.reveal t = Spec.Agile.HMAC.hmac a (Bytes.reveal k) text})", "source_definition": "let hmac a k text =\n let k = Bytes.reveal k in\n let text = Bytes.reveal text in\n assert_norm (pow2 32 < pow2 61);\n assert_norm (pow2 61 < pow2 125);\n //assert (Seq.length text + block_length a <= max_input_length a);\n let t: bytes_hash a = Spec.Agile.HMAC.hmac a k text in\n Bytes.hide t", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Hashing.Spec.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 65, "start_col": 19, "end_line": 72, "end_col": 14 }, "file_context": "\ufeff(** hash algorithms and providers\n\n * provides bytes-friendly API before idealization\n * no dependency on TLS: could go to EverCrypt or SecureAPI.\n\n*)\nmodule Hashing.Spec\n\ninclude EverCrypt.Hash\ninclude Spec.Hash.Definitions\n\nopen FStar.Bytes\n\nopen Declassify\n\n#set-options \"--max_fuel 0 --max_ifuel 0 --z3rlimit 10\"\n\nlet alg = a:alg { is_md a }\n\nlet hash_len (a:alg)\n : n:UInt32.t{UInt32.v n == hash_length a}\n = Hacl.Hash.Definitions.hash_len a\n\ntype tag (a:alg) = Bytes.lbytes (hash_length a)\n\nlet max_hash_length = 64\nlet max_hash_len = 64ul\ntype anyTag = lbytes max_hash_length\n\nlet max_block_length = 128\nlet max_block_len = 128ul\n\nprivate let lemma_tagLen (a:alg)\n : Lemma (hash_length a <= max_hash_length)\n [SMTPat (hash_length a)]\n = ()\n\nprivate let lemma_blockLength (a:alg)\n : Lemma (block_length a <= max_block_length)\n [SMTPat (block_length a)]\n = ()\n\nlet macable a = b:bytes {length b + block_length a < pow2 32}\n// 32-bit implementation restriction\n\n// Adapting EverCrypt's HMAC specification to TLS. In contrast with\n// RFC 2104 (which take any key length), in TLS, the HMAC key has the\n// same length as the hash [TLS1.3, 4.4.3]\n\ntype hkey (a:alg) = b:bytes{\n // 18-09-12 this usage restriction is dubious, but always met in\n // miTLS; it avoids a null-pointer case in the wrapper below.\n length b > 0 /\\\n Spec.Agile.HMAC.keysized a (length b)}\n\nval hmac:\n a:alg ->\n k:hkey a ->\n text:macable a ->\n GTot (t:tag a{\n let text = Bytes.reveal text in\n (Seq.length text + block_length a) `less_than_max_input_length` a /\\\n Bytes.reveal t = Spec.Agile.HMAC.hmac a (Bytes.reveal k) text})", "dependencies": { "source_file": "Hashing.Spec.fst", "checked_file": "Hashing.Spec.fst.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HMAC.fsti.checked", "prims.fst.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.HMAC.fsti.checked", "EverCrypt.Hash.fsti.checked", "Declassify.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Declassify" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Hash.Definitions" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": false, "short_module": null, "full_module": "Hashing" }, { "abbrev": false, "short_module": null, "full_module": "Hashing" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 10, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Hashing.Spec.alg -> k: Hashing.Spec.hkey a -> text: Hashing.Spec.macable a\n -> Prims.GTot\n (t:\n Hashing.Spec.tag a\n { let text = FStar.Bytes.reveal text in\n Spec.Hash.Definitions.less_than_max_input_length (FStar.Seq.Base.length text +\n Spec.Hash.Definitions.block_length a)\n a /\\ FStar.Bytes.reveal t = Spec.Agile.HMAC.hmac a (FStar.Bytes.reveal k) text })", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Hashing.Spec.alg", "Hashing.Spec.hkey", "Hashing.Spec.macable", "FStar.Bytes.hide", "Spec.Hash.Definitions.bytes_hash", "Spec.Agile.HMAC.hmac", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.b2t", "Prims.op_LessThan", "Prims.pow2", "FStar.Seq.Base.seq", "FStar.UInt8.t", "FStar.Bytes.reveal", "Hashing.Spec.tag", "Prims.l_and", "Spec.Hash.Definitions.less_than_max_input_length", "Prims.op_Addition", "FStar.Seq.Base.length", "FStar.Bytes.byte", "Spec.Hash.Definitions.block_length", "Prims.op_Equality", "Lib.IntTypes.uint8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hmac:\n a:alg ->\n k:hkey a ->\n text:macable a ->\n GTot (t:tag a{\n let text = Bytes.reveal text in\n (Seq.length text + block_length a) `less_than_max_input_length` a /\\\n Bytes.reveal t = Spec.Agile.HMAC.hmac a (Bytes.reveal k) text})\nlet hmac a k text =", "completed_definiton": "let k = Bytes.reveal k in\nlet text = Bytes.reveal text in\nassert_norm (pow2 32 < pow2 61);\nassert_norm (pow2 61 < pow2 125);\nlet t:bytes_hash a = Spec.Agile.HMAC.hmac a k text in\nBytes.hide t", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.eCCurveType_repr_serializer32", "original_source_type": "", "source_type": "val eCCurveType_repr_serializer32 : LowParse.SLow.Base.serializer32 LowParse.Spec.Int.serialize_u8", "source_definition": "let eCCurveType_repr_serializer32 = LS.serialize32_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 42, "start_col": 68, "end_line": 42, "end_col": 85 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 LowParse.Spec.Int.serialize_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.serialize32_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let eCCurveType_repr_serializer32 =", "completed_definiton": "LS.serialize32_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.eCCurveType_repr_jumper", "original_source_type": "", "source_type": "val eCCurveType_repr_jumper : LowParse.Low.Base.jumper LowParse.Spec.Int.parse_u8", "source_definition": "let eCCurveType_repr_jumper = LL.jump_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 48, "start_col": 62, "end_line": 48, "end_col": 72 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.jump_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let eCCurveType_repr_jumper =", "completed_definiton": "LL.jump_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.eCCurveType_repr_validator", "original_source_type": "", "source_type": "val eCCurveType_repr_validator : LowParse.Low.Base.validator LowParse.Spec.Int.parse_u8", "source_definition": "let eCCurveType_repr_validator = (LL.validate_u8 ())", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 46, "start_col": 65, "end_line": 46, "end_col": 84 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.validate_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let eCCurveType_repr_validator =", "completed_definiton": "(LL.validate_u8 ())", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.eCCurveType_repr_serializer", "original_source_type": "", "source_type": "val eCCurveType_repr_serializer : LowParse.Spec.Base.serializer LowParse.Spec.Int.parse_u8", "source_definition": "let eCCurveType_repr_serializer = LPI.serialize_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 38, "start_col": 44, "end_line": 38, "end_col": 60 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Int.serialize_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let eCCurveType_repr_serializer =", "completed_definiton": "LPI.serialize_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.eCCurveType_repr_parser32", "original_source_type": "", "source_type": "val eCCurveType_repr_parser32 : LowParse.SLow.Base.parser32 LowParse.Spec.Int.parse_u8", "source_definition": "let eCCurveType_repr_parser32 = LS.parse32_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 40, "start_col": 64, "end_line": 40, "end_col": 77 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.parse32_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let eCCurveType_repr_parser32 =", "completed_definiton": "LS.parse32_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.eCCurveType_repr_writer", "original_source_type": "", "source_type": "val eCCurveType_repr_writer : LowParse.Low.Base.leaf_writer_strong LowParse.Spec.Int.serialize_u8", "source_definition": "let eCCurveType_repr_writer = LL.write_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 52, "start_col": 62, "end_line": 52, "end_col": 73 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let eCCurveType_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let eCCurveType_repr_reader = LL.read_u8", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong LowParse.Spec.Int.serialize_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.write_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let eCCurveType_repr_writer =", "completed_definiton": "LL.write_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.eCCurveType_repr_size32", "original_source_type": "", "source_type": "val eCCurveType_repr_size32 : LowParse.SLow.Base.size32 LowParse.Spec.Int.serialize_u8", "source_definition": "let eCCurveType_repr_size32 = LSZ.size32_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 44, "start_col": 62, "end_line": 44, "end_col": 75 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 LowParse.Spec.Int.serialize_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.size32_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let eCCurveType_repr_size32 =", "completed_definiton": "LSZ.size32_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.eCCurveType_repr_reader", "original_source_type": "", "source_type": "val eCCurveType_repr_reader : LowParse.Low.Base.leaf_reader LowParse.Spec.Int.parse_u8", "source_definition": "let eCCurveType_repr_reader = LL.read_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 50, "start_col": 62, "end_line": 50, "end_col": 72 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let eCCurveType_repr_jumper = LL.jump_u8", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.read_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let eCCurveType_repr_reader =", "completed_definiton": "LL.read_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.eCCurveType_bytesize", "original_source_type": "val eCCurveType_bytesize (x:eCCurveType) : GTot nat", "source_type": "val eCCurveType_bytesize (x:eCCurveType) : GTot nat", "source_definition": "let eCCurveType_bytesize (x:eCCurveType) : GTot nat = Seq.length (eCCurveType_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 83, "start_col": 54, "end_line": 83, "end_col": 91 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let eCCurveType_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let eCCurveType_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let eCCurveType_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType = x\n\ninline_for_extraction let synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst eCCurveType_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_eCCurveType_inj () : Lemma\n (LP.synth_injective synth_eCCurveType) = ()\n\nlet lemma_synth_eCCurveType_inv () : Lemma\n (LP.synth_inverse synth_eCCurveType synth_eCCurveType_inv) = ()\n\nnoextract let parse_eCCurveType_key : LP.parser _ (LP.enum_key eCCurveType_enum) =\n LP.parse_enum_key eCCurveType_repr_parser eCCurveType_enum\n\nnoextract let serialize_eCCurveType_key : LP.serializer parse_eCCurveType_key =\n LP.serialize_enum_key eCCurveType_repr_parser eCCurveType_repr_serializer eCCurveType_enum\n\nnoextract let eCCurveType_parser : LP.parser _ eCCurveType =\n lemma_synth_eCCurveType_inj ();\n parse_eCCurveType_key `LP.parse_synth` synth_eCCurveType\n\nnoextract let eCCurveType_serializer : LP.serializer eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LP.serialize_synth _ synth_eCCurveType serialize_eCCurveType_key synth_eCCurveType_inv ()", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.ECCurveType.eCCurveType -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.ECCurveType.eCCurveType", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.ECCurveType.eCCurveType_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val eCCurveType_bytesize (x:eCCurveType) : GTot nat\nlet eCCurveType_bytesize (x: eCCurveType) : GTot nat =", "completed_definiton": "Seq.length (eCCurveType_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.eCCurveType_repr_parser", "original_source_type": "", "source_type": "val eCCurveType_repr_parser : LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u8_kind FStar.UInt8.t", "source_definition": "let eCCurveType_repr_parser = LPI.parse_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 36, "start_col": 40, "end_line": 36, "end_col": 52 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u8_kind FStar.UInt8.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Int.parse_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let eCCurveType_repr_parser =", "completed_definiton": "LPI.parse_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.eCCurveType_enum", "original_source_type": "val eCCurveType_enum:LP.enum eCCurveType U8.t", "source_type": "val eCCurveType_enum:LP.enum eCCurveType U8.t", "source_definition": "let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 24, "start_col": 2, "end_line": 34, "end_col": 6 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Enum.enum Parsers.ECCurveType.eCCurveType FStar.UInt8.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.b2t", "FStar.List.Tot.Base.noRepeats", "FStar.UInt8.t", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "Parsers.ECCurveType.eCCurveType", "FStar.Pervasives.Native.snd", "FStar.Pervasives.Native.fst", "Prims.list", "Prims.Cons", "FStar.Pervasives.Native.Mktuple2", "Parsers.ECCurveType.Explicit_prime", "FStar.UInt8.__uint_to_t", "Parsers.ECCurveType.Explicit_char2", "Parsers.ECCurveType.Named_curve", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val eCCurveType_enum:LP.enum eCCurveType U8.t\nlet eCCurveType_enum:LP.enum eCCurveType U8.t =", "completed_definiton": "[@@ inline_let ]let e = [Explicit_prime, 1uy; Explicit_char2, 2uy; Named_curve, 3uy] in\n[@@ inline_let ]let _ = assert_norm (L.noRepeats (LP.list_map fst e)) in\n[@@ inline_let ]let _ = assert_norm (L.noRepeats (LP.list_map snd e)) in\ne", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.synth_eCCurveType", "original_source_type": "val synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType", "source_type": "val synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType", "source_definition": "let synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType = x", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 54, "start_col": 98, "end_line": 54, "end_col": 99 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let eCCurveType_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let eCCurveType_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let eCCurveType_repr_writer = LL.write_u8", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: LowParse.Spec.Enum.enum_key Parsers.ECCurveType.eCCurveType_enum\n -> Parsers.ECCurveType.eCCurveType", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.enum_key", "Parsers.ECCurveType.eCCurveType", "FStar.UInt8.t", "Parsers.ECCurveType.eCCurveType_enum" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType\nlet synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType =", "completed_definiton": "x", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.validate_eCCurveType_key", "original_source_type": "val validate_eCCurveType_key:LL.validator parse_eCCurveType_key", "source_type": "val validate_eCCurveType_key:LL.validator parse_eCCurveType_key", "source_definition": "let validate_eCCurveType_key : LL.validator parse_eCCurveType_key =\n LL.mk_validate_enum_key eCCurveType_repr_validator eCCurveType_repr_reader eCCurveType_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 109, "start_col": 4, "end_line": 109, "end_col": 95 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let eCCurveType_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let eCCurveType_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let eCCurveType_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType = x\n\ninline_for_extraction let synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst eCCurveType_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_eCCurveType_inj () : Lemma\n (LP.synth_injective synth_eCCurveType) = ()\n\nlet lemma_synth_eCCurveType_inv () : Lemma\n (LP.synth_inverse synth_eCCurveType synth_eCCurveType_inv) = ()\n\nnoextract let parse_eCCurveType_key : LP.parser _ (LP.enum_key eCCurveType_enum) =\n LP.parse_enum_key eCCurveType_repr_parser eCCurveType_enum\n\nnoextract let serialize_eCCurveType_key : LP.serializer parse_eCCurveType_key =\n LP.serialize_enum_key eCCurveType_repr_parser eCCurveType_repr_serializer eCCurveType_enum\n\nnoextract let eCCurveType_parser : LP.parser _ eCCurveType =\n lemma_synth_eCCurveType_inj ();\n parse_eCCurveType_key `LP.parse_synth` synth_eCCurveType\n\nnoextract let eCCurveType_serializer : LP.serializer eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LP.serialize_synth _ synth_eCCurveType serialize_eCCurveType_key synth_eCCurveType_inv ()\n\nlet eCCurveType_bytesize (x:eCCurveType) : GTot nat = Seq.length (eCCurveType_serializer x)\n\nlet eCCurveType_bytesize_eq x = ()\n\nlet parse32_eCCurveType_key : LS.parser32 parse_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac eCCurveType_repr_parser32 eCCurveType_enum)\n\nlet eCCurveType_parser32 : LS.parser32 eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n LS.parse32_synth _ synth_eCCurveType (fun x->synth_eCCurveType x) parse32_eCCurveType_key ()\n\nlet serialize32_eCCurveType_key : LS.serializer32 serialize_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n eCCurveType_repr_serializer32 eCCurveType_enum)\n\nlet eCCurveType_serializer32 : LS.serializer32 eCCurveType_serializer =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LS.serialize32_synth _ synth_eCCurveType _ serialize32_eCCurveType_key synth_eCCurveType_inv (fun x->synth_eCCurveType_inv x) ()\n\nlet eCCurveType_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond eCCurveType_serializer 1ul) in\n LSZ.size32_constant eCCurveType_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.ECCurveType.parse_eCCurveType_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.validate_enum_key", "Parsers.ECCurveType.eCCurveType", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "Parsers.ECCurveType.eCCurveType_repr_validator", "Parsers.ECCurveType.eCCurveType_repr_reader", "Prims.Cons", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.Mktuple2", "Parsers.ECCurveType.Explicit_prime", "FStar.UInt8.__uint_to_t", "Parsers.ECCurveType.Explicit_char2", "Parsers.ECCurveType.Named_curve", "Prims.Nil", "LowParse.Spec.Enum.maybe_enum_destr_t_intro", "Prims.bool", "LowParse.Spec.Enum.maybe_enum_destr_cons", "LowParse.Spec.Enum.maybe_enum_destr_nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val validate_eCCurveType_key:LL.validator parse_eCCurveType_key\nlet validate_eCCurveType_key:LL.validator parse_eCCurveType_key =", "completed_definiton": "LL.mk_validate_enum_key eCCurveType_repr_validator eCCurveType_repr_reader eCCurveType_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.serialize_eCCurveType_key", "original_source_type": "val serialize_eCCurveType_key:LP.serializer parse_eCCurveType_key", "source_type": "val serialize_eCCurveType_key:LP.serializer parse_eCCurveType_key", "source_definition": "let serialize_eCCurveType_key : LP.serializer parse_eCCurveType_key =\n LP.serialize_enum_key eCCurveType_repr_parser eCCurveType_repr_serializer eCCurveType_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 72, "start_col": 2, "end_line": 72, "end_col": 92 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let eCCurveType_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let eCCurveType_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let eCCurveType_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType = x\n\ninline_for_extraction let synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst eCCurveType_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_eCCurveType_inj () : Lemma\n (LP.synth_injective synth_eCCurveType) = ()\n\nlet lemma_synth_eCCurveType_inv () : Lemma\n (LP.synth_inverse synth_eCCurveType synth_eCCurveType_inv) = ()\n\nnoextract let parse_eCCurveType_key : LP.parser _ (LP.enum_key eCCurveType_enum) =\n LP.parse_enum_key eCCurveType_repr_parser eCCurveType_enum", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.ECCurveType.parse_eCCurveType_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.serialize_enum_key", "LowParse.Spec.Int.parse_u8_kind", "Parsers.ECCurveType.eCCurveType", "FStar.UInt8.t", "Parsers.ECCurveType.eCCurveType_repr_parser", "Parsers.ECCurveType.eCCurveType_repr_serializer", "Parsers.ECCurveType.eCCurveType_enum" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_eCCurveType_key:LP.serializer parse_eCCurveType_key\nlet serialize_eCCurveType_key:LP.serializer parse_eCCurveType_key =", "completed_definiton": "LP.serialize_enum_key eCCurveType_repr_parser eCCurveType_repr_serializer eCCurveType_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.write_eCCurveType_key", "original_source_type": "val write_eCCurveType_key:LL.leaf_writer_strong serialize_eCCurveType_key", "source_type": "val write_eCCurveType_key:LL.leaf_writer_strong serialize_eCCurveType_key", "source_definition": "let write_eCCurveType_key : LL.leaf_writer_strong serialize_eCCurveType_key =\n LL.write_enum_key eCCurveType_repr_writer eCCurveType_enum (_ by (LP.enum_repr_of_key_tac eCCurveType_enum))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 124, "start_col": 2, "end_line": 124, "end_col": 110 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let eCCurveType_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let eCCurveType_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let eCCurveType_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType = x\n\ninline_for_extraction let synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst eCCurveType_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_eCCurveType_inj () : Lemma\n (LP.synth_injective synth_eCCurveType) = ()\n\nlet lemma_synth_eCCurveType_inv () : Lemma\n (LP.synth_inverse synth_eCCurveType synth_eCCurveType_inv) = ()\n\nnoextract let parse_eCCurveType_key : LP.parser _ (LP.enum_key eCCurveType_enum) =\n LP.parse_enum_key eCCurveType_repr_parser eCCurveType_enum\n\nnoextract let serialize_eCCurveType_key : LP.serializer parse_eCCurveType_key =\n LP.serialize_enum_key eCCurveType_repr_parser eCCurveType_repr_serializer eCCurveType_enum\n\nnoextract let eCCurveType_parser : LP.parser _ eCCurveType =\n lemma_synth_eCCurveType_inj ();\n parse_eCCurveType_key `LP.parse_synth` synth_eCCurveType\n\nnoextract let eCCurveType_serializer : LP.serializer eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LP.serialize_synth _ synth_eCCurveType serialize_eCCurveType_key synth_eCCurveType_inv ()\n\nlet eCCurveType_bytesize (x:eCCurveType) : GTot nat = Seq.length (eCCurveType_serializer x)\n\nlet eCCurveType_bytesize_eq x = ()\n\nlet parse32_eCCurveType_key : LS.parser32 parse_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac eCCurveType_repr_parser32 eCCurveType_enum)\n\nlet eCCurveType_parser32 : LS.parser32 eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n LS.parse32_synth _ synth_eCCurveType (fun x->synth_eCCurveType x) parse32_eCCurveType_key ()\n\nlet serialize32_eCCurveType_key : LS.serializer32 serialize_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n eCCurveType_repr_serializer32 eCCurveType_enum)\n\nlet eCCurveType_serializer32 : LS.serializer32 eCCurveType_serializer =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LS.serialize32_synth _ synth_eCCurveType _ serialize32_eCCurveType_key synth_eCCurveType_inv (fun x->synth_eCCurveType_inv x) ()\n\nlet eCCurveType_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond eCCurveType_serializer 1ul) in\n LSZ.size32_constant eCCurveType_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_eCCurveType_key : LL.validator parse_eCCurveType_key =\n LL.mk_validate_enum_key eCCurveType_repr_validator eCCurveType_repr_reader eCCurveType_enum\n\nlet eCCurveType_validator =\n lemma_synth_eCCurveType_inj ();\n LL.validate_synth validate_eCCurveType_key synth_eCCurveType ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_eCCurveType_key : LL.leaf_reader parse_eCCurveType_key =\n LL.mk_read_enum_key eCCurveType_repr_reader eCCurveType_enum\n\nlet eCCurveType_reader =\n [@inline_let] let _ = lemma_synth_eCCurveType_inj () in\n LL.read_synth' parse_eCCurveType_key synth_eCCurveType read_eCCurveType_key ()", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong Parsers.ECCurveType.serialize_eCCurveType_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.write_enum_key", "Parsers.ECCurveType.eCCurveType", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "Parsers.ECCurveType.eCCurveType_repr_writer", "Parsers.ECCurveType.eCCurveType_enum", "LowParse.Spec.Enum.enum_repr_of_key_cons'", "LowParse.Spec.Enum.enum_tail'", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val write_eCCurveType_key:LL.leaf_writer_strong serialize_eCCurveType_key\nlet write_eCCurveType_key:LL.leaf_writer_strong serialize_eCCurveType_key =", "completed_definiton": "LL.write_enum_key eCCurveType_repr_writer\n eCCurveType_enum\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.enum_repr_of_key_tac eCCurveType_enum)))", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.eCCurveType_size32", "original_source_type": "val eCCurveType_size32: LSZ.size32 eCCurveType_serializer", "source_type": "val eCCurveType_size32: LSZ.size32 eCCurveType_serializer", "source_definition": "let eCCurveType_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond eCCurveType_serializer 1ul) in\n LSZ.size32_constant eCCurveType_serializer 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 104, "start_col": 2, "end_line": 105, "end_col": 51 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let eCCurveType_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let eCCurveType_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let eCCurveType_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType = x\n\ninline_for_extraction let synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst eCCurveType_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_eCCurveType_inj () : Lemma\n (LP.synth_injective synth_eCCurveType) = ()\n\nlet lemma_synth_eCCurveType_inv () : Lemma\n (LP.synth_inverse synth_eCCurveType synth_eCCurveType_inv) = ()\n\nnoextract let parse_eCCurveType_key : LP.parser _ (LP.enum_key eCCurveType_enum) =\n LP.parse_enum_key eCCurveType_repr_parser eCCurveType_enum\n\nnoextract let serialize_eCCurveType_key : LP.serializer parse_eCCurveType_key =\n LP.serialize_enum_key eCCurveType_repr_parser eCCurveType_repr_serializer eCCurveType_enum\n\nnoextract let eCCurveType_parser : LP.parser _ eCCurveType =\n lemma_synth_eCCurveType_inj ();\n parse_eCCurveType_key `LP.parse_synth` synth_eCCurveType\n\nnoextract let eCCurveType_serializer : LP.serializer eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LP.serialize_synth _ synth_eCCurveType serialize_eCCurveType_key synth_eCCurveType_inv ()\n\nlet eCCurveType_bytesize (x:eCCurveType) : GTot nat = Seq.length (eCCurveType_serializer x)\n\nlet eCCurveType_bytesize_eq x = ()\n\nlet parse32_eCCurveType_key : LS.parser32 parse_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac eCCurveType_repr_parser32 eCCurveType_enum)\n\nlet eCCurveType_parser32 : LS.parser32 eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n LS.parse32_synth _ synth_eCCurveType (fun x->synth_eCCurveType x) parse32_eCCurveType_key ()\n\nlet serialize32_eCCurveType_key : LS.serializer32 serialize_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n eCCurveType_repr_serializer32 eCCurveType_enum)\n\nlet eCCurveType_serializer32 : LS.serializer32 eCCurveType_serializer =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LS.serialize32_synth _ synth_eCCurveType _ serialize32_eCCurveType_key synth_eCCurveType_inv (fun x->synth_eCCurveType_inv x) ()", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.ECCurveType.eCCurveType_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Base.size32_constant", "Parsers.ECCurveType.eCCurveType_parser_kind", "Parsers.ECCurveType.eCCurveType", "Parsers.ECCurveType.eCCurveType_parser", "Parsers.ECCurveType.eCCurveType_serializer", "FStar.UInt32.__uint_to_t", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.SLow.Base.size32_constant_precond" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val eCCurveType_size32: LSZ.size32 eCCurveType_serializer\nlet eCCurveType_size32 =", "completed_definiton": "[@@ inline_let ]let _ = assert_norm (LSZ.size32_constant_precond eCCurveType_serializer 1ul) in\nLSZ.size32_constant eCCurveType_serializer 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.parse32_eCCurveType_key", "original_source_type": "val parse32_eCCurveType_key:LS.parser32 parse_eCCurveType_key", "source_type": "val parse32_eCCurveType_key:LS.parser32 parse_eCCurveType_key", "source_definition": "let parse32_eCCurveType_key : LS.parser32 parse_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac eCCurveType_repr_parser32 eCCurveType_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 88, "start_col": 2, "end_line": 88, "end_col": 100 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let eCCurveType_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let eCCurveType_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let eCCurveType_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType = x\n\ninline_for_extraction let synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst eCCurveType_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_eCCurveType_inj () : Lemma\n (LP.synth_injective synth_eCCurveType) = ()\n\nlet lemma_synth_eCCurveType_inv () : Lemma\n (LP.synth_inverse synth_eCCurveType synth_eCCurveType_inv) = ()\n\nnoextract let parse_eCCurveType_key : LP.parser _ (LP.enum_key eCCurveType_enum) =\n LP.parse_enum_key eCCurveType_repr_parser eCCurveType_enum\n\nnoextract let serialize_eCCurveType_key : LP.serializer parse_eCCurveType_key =\n LP.serialize_enum_key eCCurveType_repr_parser eCCurveType_repr_serializer eCCurveType_enum\n\nnoextract let eCCurveType_parser : LP.parser _ eCCurveType =\n lemma_synth_eCCurveType_inj ();\n parse_eCCurveType_key `LP.parse_synth` synth_eCCurveType\n\nnoextract let eCCurveType_serializer : LP.serializer eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LP.serialize_synth _ synth_eCCurveType serialize_eCCurveType_key synth_eCCurveType_inv ()\n\nlet eCCurveType_bytesize (x:eCCurveType) : GTot nat = Seq.length (eCCurveType_serializer x)\n\nlet eCCurveType_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.ECCurveType.parse_eCCurveType_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Enum.parse32_enum_key_gen", "LowParse.Spec.Int.parse_u8_kind", "Parsers.ECCurveType.eCCurveType", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "Parsers.ECCurveType.eCCurveType_enum", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Enum.enum_key", "Parsers.ECCurveType.parse_eCCurveType_key", "LowParse.SLow.Enum.parse32_maybe_enum_key_gen", "Parsers.ECCurveType.eCCurveType_repr_parser32", "LowParse.Spec.Enum.maybe_enum_key", "LowParse.Spec.Enum.parse_maybe_enum_key", "LowParse.Spec.Enum.maybe_enum_key_of_repr'_t_cons'", "LowParse.Spec.Enum.enum_tail'", "LowParse.Spec.Enum.maybe_enum_key_of_repr'_t_cons_nil'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse32_eCCurveType_key:LS.parser32 parse_eCCurveType_key\nlet parse32_eCCurveType_key:LS.parser32 parse_eCCurveType_key =", "completed_definiton": "FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac eCCurveType_repr_parser32 eCCurveType_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.eCCurveType_serializer", "original_source_type": "val eCCurveType_serializer: LP.serializer eCCurveType_parser", "source_type": "val eCCurveType_serializer: LP.serializer eCCurveType_parser", "source_definition": "let eCCurveType_serializer : LP.serializer eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LP.serialize_synth _ synth_eCCurveType serialize_eCCurveType_key synth_eCCurveType_inv ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 79, "start_col": 2, "end_line": 81, "end_col": 91 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let eCCurveType_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let eCCurveType_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let eCCurveType_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType = x\n\ninline_for_extraction let synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst eCCurveType_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_eCCurveType_inj () : Lemma\n (LP.synth_injective synth_eCCurveType) = ()\n\nlet lemma_synth_eCCurveType_inv () : Lemma\n (LP.synth_inverse synth_eCCurveType synth_eCCurveType_inv) = ()\n\nnoextract let parse_eCCurveType_key : LP.parser _ (LP.enum_key eCCurveType_enum) =\n LP.parse_enum_key eCCurveType_repr_parser eCCurveType_enum\n\nnoextract let serialize_eCCurveType_key : LP.serializer parse_eCCurveType_key =\n LP.serialize_enum_key eCCurveType_repr_parser eCCurveType_repr_serializer eCCurveType_enum\n\nnoextract let eCCurveType_parser : LP.parser _ eCCurveType =\n lemma_synth_eCCurveType_inj ();\n parse_eCCurveType_key `LP.parse_synth` synth_eCCurveType", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.ECCurveType.eCCurveType_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.ECCurveType.eCCurveType", "FStar.UInt8.t", "Parsers.ECCurveType.eCCurveType_enum", "Parsers.ECCurveType.parse_eCCurveType_key", "Parsers.ECCurveType.synth_eCCurveType", "Parsers.ECCurveType.serialize_eCCurveType_key", "Parsers.ECCurveType.synth_eCCurveType_inv", "Prims.unit", "Parsers.ECCurveType.lemma_synth_eCCurveType_inv", "Parsers.ECCurveType.lemma_synth_eCCurveType_inj", "LowParse.Spec.Base.serializer", "Parsers.ECCurveType.eCCurveType_parser_kind", "Parsers.ECCurveType.eCCurveType_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val eCCurveType_serializer: LP.serializer eCCurveType_parser\nlet eCCurveType_serializer:LP.serializer eCCurveType_parser =", "completed_definiton": "lemma_synth_eCCurveType_inj ();\nlemma_synth_eCCurveType_inv ();\nLP.serialize_synth _ synth_eCCurveType serialize_eCCurveType_key synth_eCCurveType_inv ()", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.eCCurveType_parser", "original_source_type": "val eCCurveType_parser: LP.parser eCCurveType_parser_kind eCCurveType", "source_type": "val eCCurveType_parser: LP.parser eCCurveType_parser_kind eCCurveType", "source_definition": "let eCCurveType_parser : LP.parser _ eCCurveType =\n lemma_synth_eCCurveType_inj ();\n parse_eCCurveType_key `LP.parse_synth` synth_eCCurveType", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 75, "start_col": 2, "end_line": 76, "end_col": 58 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let eCCurveType_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let eCCurveType_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let eCCurveType_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType = x\n\ninline_for_extraction let synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst eCCurveType_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_eCCurveType_inj () : Lemma\n (LP.synth_injective synth_eCCurveType) = ()\n\nlet lemma_synth_eCCurveType_inv () : Lemma\n (LP.synth_inverse synth_eCCurveType synth_eCCurveType_inv) = ()\n\nnoextract let parse_eCCurveType_key : LP.parser _ (LP.enum_key eCCurveType_enum) =\n LP.parse_enum_key eCCurveType_repr_parser eCCurveType_enum\n\nnoextract let serialize_eCCurveType_key : LP.serializer parse_eCCurveType_key =\n LP.serialize_enum_key eCCurveType_repr_parser eCCurveType_repr_serializer eCCurveType_enum", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.ECCurveType.eCCurveType_parser_kind\n Parsers.ECCurveType.eCCurveType", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.ECCurveType.eCCurveType", "FStar.UInt8.t", "Parsers.ECCurveType.eCCurveType_enum", "Parsers.ECCurveType.parse_eCCurveType_key", "Parsers.ECCurveType.synth_eCCurveType", "Prims.unit", "Parsers.ECCurveType.lemma_synth_eCCurveType_inj", "LowParse.Spec.Base.parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val eCCurveType_parser: LP.parser eCCurveType_parser_kind eCCurveType\nlet eCCurveType_parser:LP.parser _ eCCurveType =", "completed_definiton": "lemma_synth_eCCurveType_inj ();\nparse_eCCurveType_key `LP.parse_synth` synth_eCCurveType", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.read_eCCurveType_key", "original_source_type": "val read_eCCurveType_key:LL.leaf_reader parse_eCCurveType_key", "source_type": "val read_eCCurveType_key:LL.leaf_reader parse_eCCurveType_key", "source_definition": "let read_eCCurveType_key : LL.leaf_reader parse_eCCurveType_key =\n LL.mk_read_enum_key eCCurveType_repr_reader eCCurveType_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 117, "start_col": 2, "end_line": 117, "end_col": 62 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let eCCurveType_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let eCCurveType_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let eCCurveType_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType = x\n\ninline_for_extraction let synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst eCCurveType_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_eCCurveType_inj () : Lemma\n (LP.synth_injective synth_eCCurveType) = ()\n\nlet lemma_synth_eCCurveType_inv () : Lemma\n (LP.synth_inverse synth_eCCurveType synth_eCCurveType_inv) = ()\n\nnoextract let parse_eCCurveType_key : LP.parser _ (LP.enum_key eCCurveType_enum) =\n LP.parse_enum_key eCCurveType_repr_parser eCCurveType_enum\n\nnoextract let serialize_eCCurveType_key : LP.serializer parse_eCCurveType_key =\n LP.serialize_enum_key eCCurveType_repr_parser eCCurveType_repr_serializer eCCurveType_enum\n\nnoextract let eCCurveType_parser : LP.parser _ eCCurveType =\n lemma_synth_eCCurveType_inj ();\n parse_eCCurveType_key `LP.parse_synth` synth_eCCurveType\n\nnoextract let eCCurveType_serializer : LP.serializer eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LP.serialize_synth _ synth_eCCurveType serialize_eCCurveType_key synth_eCCurveType_inv ()\n\nlet eCCurveType_bytesize (x:eCCurveType) : GTot nat = Seq.length (eCCurveType_serializer x)\n\nlet eCCurveType_bytesize_eq x = ()\n\nlet parse32_eCCurveType_key : LS.parser32 parse_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac eCCurveType_repr_parser32 eCCurveType_enum)\n\nlet eCCurveType_parser32 : LS.parser32 eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n LS.parse32_synth _ synth_eCCurveType (fun x->synth_eCCurveType x) parse32_eCCurveType_key ()\n\nlet serialize32_eCCurveType_key : LS.serializer32 serialize_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n eCCurveType_repr_serializer32 eCCurveType_enum)\n\nlet eCCurveType_serializer32 : LS.serializer32 eCCurveType_serializer =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LS.serialize32_synth _ synth_eCCurveType _ serialize32_eCCurveType_key synth_eCCurveType_inv (fun x->synth_eCCurveType_inv x) ()\n\nlet eCCurveType_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond eCCurveType_serializer 1ul) in\n LSZ.size32_constant eCCurveType_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_eCCurveType_key : LL.validator parse_eCCurveType_key =\n LL.mk_validate_enum_key eCCurveType_repr_validator eCCurveType_repr_reader eCCurveType_enum\n\nlet eCCurveType_validator =\n lemma_synth_eCCurveType_inj ();\n LL.validate_synth validate_eCCurveType_key synth_eCCurveType ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader Parsers.ECCurveType.parse_eCCurveType_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.read_enum_key", "Parsers.ECCurveType.eCCurveType", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "Parsers.ECCurveType.eCCurveType_repr_reader", "Prims.Cons", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.Mktuple2", "Parsers.ECCurveType.Explicit_prime", "FStar.UInt8.__uint_to_t", "Parsers.ECCurveType.Explicit_char2", "Parsers.ECCurveType.Named_curve", "Prims.Nil", "LowParse.Spec.Enum.dep_maybe_enum_destr_t_intro", "LowParse.Low.Enum.read_enum_key_t", "LowParse.Spec.Enum.dep_maybe_enum_destr_cons", "LowParse.Spec.Enum.list_append_rev_cons", "LowParse.Spec.Enum.dep_maybe_enum_destr_nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_eCCurveType_key:LL.leaf_reader parse_eCCurveType_key\nlet read_eCCurveType_key:LL.leaf_reader parse_eCCurveType_key =", "completed_definiton": "LL.mk_read_enum_key eCCurveType_repr_reader eCCurveType_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.eCCurveType_parser32", "original_source_type": "val eCCurveType_parser32: LS.parser32 eCCurveType_parser", "source_type": "val eCCurveType_parser32: LS.parser32 eCCurveType_parser", "source_definition": "let eCCurveType_parser32 : LS.parser32 eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n LS.parse32_synth _ synth_eCCurveType (fun x->synth_eCCurveType x) parse32_eCCurveType_key ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 91, "start_col": 2, "end_line": 92, "end_col": 94 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let eCCurveType_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let eCCurveType_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let eCCurveType_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType = x\n\ninline_for_extraction let synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst eCCurveType_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_eCCurveType_inj () : Lemma\n (LP.synth_injective synth_eCCurveType) = ()\n\nlet lemma_synth_eCCurveType_inv () : Lemma\n (LP.synth_inverse synth_eCCurveType synth_eCCurveType_inv) = ()\n\nnoextract let parse_eCCurveType_key : LP.parser _ (LP.enum_key eCCurveType_enum) =\n LP.parse_enum_key eCCurveType_repr_parser eCCurveType_enum\n\nnoextract let serialize_eCCurveType_key : LP.serializer parse_eCCurveType_key =\n LP.serialize_enum_key eCCurveType_repr_parser eCCurveType_repr_serializer eCCurveType_enum\n\nnoextract let eCCurveType_parser : LP.parser _ eCCurveType =\n lemma_synth_eCCurveType_inj ();\n parse_eCCurveType_key `LP.parse_synth` synth_eCCurveType\n\nnoextract let eCCurveType_serializer : LP.serializer eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LP.serialize_synth _ synth_eCCurveType serialize_eCCurveType_key synth_eCCurveType_inv ()\n\nlet eCCurveType_bytesize (x:eCCurveType) : GTot nat = Seq.length (eCCurveType_serializer x)\n\nlet eCCurveType_bytesize_eq x = ()\n\nlet parse32_eCCurveType_key : LS.parser32 parse_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac eCCurveType_repr_parser32 eCCurveType_enum)", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.ECCurveType.eCCurveType_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.ECCurveType.eCCurveType", "FStar.UInt8.t", "Parsers.ECCurveType.eCCurveType_enum", "Parsers.ECCurveType.parse_eCCurveType_key", "Parsers.ECCurveType.synth_eCCurveType", "Prims.eq2", "Parsers.ECCurveType.parse32_eCCurveType_key", "Prims.unit", "Parsers.ECCurveType.lemma_synth_eCCurveType_inj", "LowParse.SLow.Base.parser32", "Parsers.ECCurveType.eCCurveType_parser_kind", "Parsers.ECCurveType.eCCurveType_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val eCCurveType_parser32: LS.parser32 eCCurveType_parser\nlet eCCurveType_parser32:LS.parser32 eCCurveType_parser =", "completed_definiton": "lemma_synth_eCCurveType_inj ();\nLS.parse32_synth _ synth_eCCurveType (fun x -> synth_eCCurveType x) parse32_eCCurveType_key ()", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.eCCurveType_lserializer", "original_source_type": "val eCCurveType_lserializer: LL.serializer32 eCCurveType_serializer", "source_type": "val eCCurveType_lserializer: LL.serializer32 eCCurveType_serializer", "source_definition": "let eCCurveType_lserializer = LL.serializer32_of_leaf_writer_strong_constant_size eCCurveType_writer 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 133, "start_col": 30, "end_line": 133, "end_col": 107 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let eCCurveType_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let eCCurveType_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let eCCurveType_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType = x\n\ninline_for_extraction let synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst eCCurveType_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_eCCurveType_inj () : Lemma\n (LP.synth_injective synth_eCCurveType) = ()\n\nlet lemma_synth_eCCurveType_inv () : Lemma\n (LP.synth_inverse synth_eCCurveType synth_eCCurveType_inv) = ()\n\nnoextract let parse_eCCurveType_key : LP.parser _ (LP.enum_key eCCurveType_enum) =\n LP.parse_enum_key eCCurveType_repr_parser eCCurveType_enum\n\nnoextract let serialize_eCCurveType_key : LP.serializer parse_eCCurveType_key =\n LP.serialize_enum_key eCCurveType_repr_parser eCCurveType_repr_serializer eCCurveType_enum\n\nnoextract let eCCurveType_parser : LP.parser _ eCCurveType =\n lemma_synth_eCCurveType_inj ();\n parse_eCCurveType_key `LP.parse_synth` synth_eCCurveType\n\nnoextract let eCCurveType_serializer : LP.serializer eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LP.serialize_synth _ synth_eCCurveType serialize_eCCurveType_key synth_eCCurveType_inv ()\n\nlet eCCurveType_bytesize (x:eCCurveType) : GTot nat = Seq.length (eCCurveType_serializer x)\n\nlet eCCurveType_bytesize_eq x = ()\n\nlet parse32_eCCurveType_key : LS.parser32 parse_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac eCCurveType_repr_parser32 eCCurveType_enum)\n\nlet eCCurveType_parser32 : LS.parser32 eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n LS.parse32_synth _ synth_eCCurveType (fun x->synth_eCCurveType x) parse32_eCCurveType_key ()\n\nlet serialize32_eCCurveType_key : LS.serializer32 serialize_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n eCCurveType_repr_serializer32 eCCurveType_enum)\n\nlet eCCurveType_serializer32 : LS.serializer32 eCCurveType_serializer =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LS.serialize32_synth _ synth_eCCurveType _ serialize32_eCCurveType_key synth_eCCurveType_inv (fun x->synth_eCCurveType_inv x) ()\n\nlet eCCurveType_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond eCCurveType_serializer 1ul) in\n LSZ.size32_constant eCCurveType_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_eCCurveType_key : LL.validator parse_eCCurveType_key =\n LL.mk_validate_enum_key eCCurveType_repr_validator eCCurveType_repr_reader eCCurveType_enum\n\nlet eCCurveType_validator =\n lemma_synth_eCCurveType_inj ();\n LL.validate_synth validate_eCCurveType_key synth_eCCurveType ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_eCCurveType_key : LL.leaf_reader parse_eCCurveType_key =\n LL.mk_read_enum_key eCCurveType_repr_reader eCCurveType_enum\n\nlet eCCurveType_reader =\n [@inline_let] let _ = lemma_synth_eCCurveType_inj () in\n LL.read_synth' parse_eCCurveType_key synth_eCCurveType read_eCCurveType_key ()\n\ninline_for_extraction let write_eCCurveType_key : LL.leaf_writer_strong serialize_eCCurveType_key =\n LL.write_enum_key eCCurveType_repr_writer eCCurveType_enum (_ by (LP.enum_repr_of_key_tac eCCurveType_enum))\n\ninline_for_extraction let lserialize_eCCurveType_key : LL.serializer32 serialize_eCCurveType_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_eCCurveType_key 1ul ()\n\nlet eCCurveType_writer =\n [@inline_let] let _ = lemma_synth_eCCurveType_inj (); lemma_synth_eCCurveType_inv () in\n LL.write_synth write_eCCurveType_key synth_eCCurveType synth_eCCurveType_inv (fun x -> synth_eCCurveType_inv x) ()", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 Parsers.ECCurveType.eCCurveType_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.serializer32_of_leaf_writer_strong_constant_size", "Parsers.ECCurveType.eCCurveType_parser_kind", "Parsers.ECCurveType.eCCurveType", "Parsers.ECCurveType.eCCurveType_parser", "Parsers.ECCurveType.eCCurveType_serializer", "Parsers.ECCurveType.eCCurveType_writer", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val eCCurveType_lserializer: LL.serializer32 eCCurveType_serializer\nlet eCCurveType_lserializer =", "completed_definiton": "LL.serializer32_of_leaf_writer_strong_constant_size eCCurveType_writer 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.synth_eCCurveType_inv", "original_source_type": "val synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum)", "source_type": "val synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum)", "source_definition": "let synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst eCCurveType_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 57, "start_col": 2, "end_line": 60, "end_col": 3 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let eCCurveType_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let eCCurveType_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let eCCurveType_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType = x", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.ECCurveType.eCCurveType\n -> LowParse.Spec.Enum.enum_key Parsers.ECCurveType.eCCurveType_enum", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.ECCurveType.eCCurveType", "Prims.squash", "Prims.b2t", "LowParse.Spec.Enum.list_mem", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "FStar.UInt8.t", "FStar.Pervasives.Native.fst", "Parsers.ECCurveType.eCCurveType_enum", "LowParse.Spec.Enum.enum_key" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum)\nlet synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum) =", "completed_definiton": "[@@ inline_let ]let _:squash (LP.list_mem x (LP.list_map fst eCCurveType_enum)) =\n FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.synth_maybe_enum_key_inv_unknown_tac x))\nin\nx", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.lserialize_eCCurveType_key", "original_source_type": "val lserialize_eCCurveType_key:LL.serializer32 serialize_eCCurveType_key", "source_type": "val lserialize_eCCurveType_key:LL.serializer32 serialize_eCCurveType_key", "source_definition": "let lserialize_eCCurveType_key : LL.serializer32 serialize_eCCurveType_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_eCCurveType_key 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 127, "start_col": 2, "end_line": 127, "end_col": 82 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let eCCurveType_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let eCCurveType_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let eCCurveType_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType = x\n\ninline_for_extraction let synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst eCCurveType_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_eCCurveType_inj () : Lemma\n (LP.synth_injective synth_eCCurveType) = ()\n\nlet lemma_synth_eCCurveType_inv () : Lemma\n (LP.synth_inverse synth_eCCurveType synth_eCCurveType_inv) = ()\n\nnoextract let parse_eCCurveType_key : LP.parser _ (LP.enum_key eCCurveType_enum) =\n LP.parse_enum_key eCCurveType_repr_parser eCCurveType_enum\n\nnoextract let serialize_eCCurveType_key : LP.serializer parse_eCCurveType_key =\n LP.serialize_enum_key eCCurveType_repr_parser eCCurveType_repr_serializer eCCurveType_enum\n\nnoextract let eCCurveType_parser : LP.parser _ eCCurveType =\n lemma_synth_eCCurveType_inj ();\n parse_eCCurveType_key `LP.parse_synth` synth_eCCurveType\n\nnoextract let eCCurveType_serializer : LP.serializer eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LP.serialize_synth _ synth_eCCurveType serialize_eCCurveType_key synth_eCCurveType_inv ()\n\nlet eCCurveType_bytesize (x:eCCurveType) : GTot nat = Seq.length (eCCurveType_serializer x)\n\nlet eCCurveType_bytesize_eq x = ()\n\nlet parse32_eCCurveType_key : LS.parser32 parse_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac eCCurveType_repr_parser32 eCCurveType_enum)\n\nlet eCCurveType_parser32 : LS.parser32 eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n LS.parse32_synth _ synth_eCCurveType (fun x->synth_eCCurveType x) parse32_eCCurveType_key ()\n\nlet serialize32_eCCurveType_key : LS.serializer32 serialize_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n eCCurveType_repr_serializer32 eCCurveType_enum)\n\nlet eCCurveType_serializer32 : LS.serializer32 eCCurveType_serializer =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LS.serialize32_synth _ synth_eCCurveType _ serialize32_eCCurveType_key synth_eCCurveType_inv (fun x->synth_eCCurveType_inv x) ()\n\nlet eCCurveType_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond eCCurveType_serializer 1ul) in\n LSZ.size32_constant eCCurveType_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_eCCurveType_key : LL.validator parse_eCCurveType_key =\n LL.mk_validate_enum_key eCCurveType_repr_validator eCCurveType_repr_reader eCCurveType_enum\n\nlet eCCurveType_validator =\n lemma_synth_eCCurveType_inj ();\n LL.validate_synth validate_eCCurveType_key synth_eCCurveType ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_eCCurveType_key : LL.leaf_reader parse_eCCurveType_key =\n LL.mk_read_enum_key eCCurveType_repr_reader eCCurveType_enum\n\nlet eCCurveType_reader =\n [@inline_let] let _ = lemma_synth_eCCurveType_inj () in\n LL.read_synth' parse_eCCurveType_key synth_eCCurveType read_eCCurveType_key ()\n\ninline_for_extraction let write_eCCurveType_key : LL.leaf_writer_strong serialize_eCCurveType_key =\n LL.write_enum_key eCCurveType_repr_writer eCCurveType_enum (_ by (LP.enum_repr_of_key_tac eCCurveType_enum))", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 Parsers.ECCurveType.serialize_eCCurveType_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.serializer32_of_leaf_writer_strong_constant_size", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.ECCurveType.eCCurveType", "FStar.UInt8.t", "Parsers.ECCurveType.eCCurveType_enum", "Parsers.ECCurveType.parse_eCCurveType_key", "Parsers.ECCurveType.serialize_eCCurveType_key", "Parsers.ECCurveType.write_eCCurveType_key", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lserialize_eCCurveType_key:LL.serializer32 serialize_eCCurveType_key\nlet lserialize_eCCurveType_key:LL.serializer32 serialize_eCCurveType_key =", "completed_definiton": "LL.serializer32_of_leaf_writer_strong_constant_size write_eCCurveType_key 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.eCCurveType_validator", "original_source_type": "val eCCurveType_validator: LL.validator eCCurveType_parser", "source_type": "val eCCurveType_validator: LL.validator eCCurveType_parser", "source_definition": "let eCCurveType_validator =\n lemma_synth_eCCurveType_inj ();\n LL.validate_synth validate_eCCurveType_key synth_eCCurveType ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 112, "start_col": 2, "end_line": 113, "end_col": 65 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let eCCurveType_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let eCCurveType_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let eCCurveType_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType = x\n\ninline_for_extraction let synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst eCCurveType_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_eCCurveType_inj () : Lemma\n (LP.synth_injective synth_eCCurveType) = ()\n\nlet lemma_synth_eCCurveType_inv () : Lemma\n (LP.synth_inverse synth_eCCurveType synth_eCCurveType_inv) = ()\n\nnoextract let parse_eCCurveType_key : LP.parser _ (LP.enum_key eCCurveType_enum) =\n LP.parse_enum_key eCCurveType_repr_parser eCCurveType_enum\n\nnoextract let serialize_eCCurveType_key : LP.serializer parse_eCCurveType_key =\n LP.serialize_enum_key eCCurveType_repr_parser eCCurveType_repr_serializer eCCurveType_enum\n\nnoextract let eCCurveType_parser : LP.parser _ eCCurveType =\n lemma_synth_eCCurveType_inj ();\n parse_eCCurveType_key `LP.parse_synth` synth_eCCurveType\n\nnoextract let eCCurveType_serializer : LP.serializer eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LP.serialize_synth _ synth_eCCurveType serialize_eCCurveType_key synth_eCCurveType_inv ()\n\nlet eCCurveType_bytesize (x:eCCurveType) : GTot nat = Seq.length (eCCurveType_serializer x)\n\nlet eCCurveType_bytesize_eq x = ()\n\nlet parse32_eCCurveType_key : LS.parser32 parse_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac eCCurveType_repr_parser32 eCCurveType_enum)\n\nlet eCCurveType_parser32 : LS.parser32 eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n LS.parse32_synth _ synth_eCCurveType (fun x->synth_eCCurveType x) parse32_eCCurveType_key ()\n\nlet serialize32_eCCurveType_key : LS.serializer32 serialize_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n eCCurveType_repr_serializer32 eCCurveType_enum)\n\nlet eCCurveType_serializer32 : LS.serializer32 eCCurveType_serializer =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LS.serialize32_synth _ synth_eCCurveType _ serialize32_eCCurveType_key synth_eCCurveType_inv (fun x->synth_eCCurveType_inv x) ()\n\nlet eCCurveType_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond eCCurveType_serializer 1ul) in\n LSZ.size32_constant eCCurveType_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_eCCurveType_key : LL.validator parse_eCCurveType_key =\n LL.mk_validate_enum_key eCCurveType_repr_validator eCCurveType_repr_reader eCCurveType_enum", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.ECCurveType.eCCurveType_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.validate_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.ECCurveType.eCCurveType", "FStar.UInt8.t", "Parsers.ECCurveType.eCCurveType_enum", "Parsers.ECCurveType.parse_eCCurveType_key", "Parsers.ECCurveType.validate_eCCurveType_key", "Parsers.ECCurveType.synth_eCCurveType", "Prims.unit", "Parsers.ECCurveType.lemma_synth_eCCurveType_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val eCCurveType_validator: LL.validator eCCurveType_parser\nlet eCCurveType_validator =", "completed_definiton": "lemma_synth_eCCurveType_inj ();\nLL.validate_synth validate_eCCurveType_key synth_eCCurveType ()", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.eCCurveType_serializer32", "original_source_type": "val eCCurveType_serializer32: LS.serializer32 eCCurveType_serializer", "source_type": "val eCCurveType_serializer32: LS.serializer32 eCCurveType_serializer", "source_definition": "let eCCurveType_serializer32 : LS.serializer32 eCCurveType_serializer =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LS.serialize32_synth _ synth_eCCurveType _ serialize32_eCCurveType_key synth_eCCurveType_inv (fun x->synth_eCCurveType_inv x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 99, "start_col": 2, "end_line": 101, "end_col": 130 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let eCCurveType_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let eCCurveType_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let eCCurveType_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType = x\n\ninline_for_extraction let synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst eCCurveType_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_eCCurveType_inj () : Lemma\n (LP.synth_injective synth_eCCurveType) = ()\n\nlet lemma_synth_eCCurveType_inv () : Lemma\n (LP.synth_inverse synth_eCCurveType synth_eCCurveType_inv) = ()\n\nnoextract let parse_eCCurveType_key : LP.parser _ (LP.enum_key eCCurveType_enum) =\n LP.parse_enum_key eCCurveType_repr_parser eCCurveType_enum\n\nnoextract let serialize_eCCurveType_key : LP.serializer parse_eCCurveType_key =\n LP.serialize_enum_key eCCurveType_repr_parser eCCurveType_repr_serializer eCCurveType_enum\n\nnoextract let eCCurveType_parser : LP.parser _ eCCurveType =\n lemma_synth_eCCurveType_inj ();\n parse_eCCurveType_key `LP.parse_synth` synth_eCCurveType\n\nnoextract let eCCurveType_serializer : LP.serializer eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LP.serialize_synth _ synth_eCCurveType serialize_eCCurveType_key synth_eCCurveType_inv ()\n\nlet eCCurveType_bytesize (x:eCCurveType) : GTot nat = Seq.length (eCCurveType_serializer x)\n\nlet eCCurveType_bytesize_eq x = ()\n\nlet parse32_eCCurveType_key : LS.parser32 parse_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac eCCurveType_repr_parser32 eCCurveType_enum)\n\nlet eCCurveType_parser32 : LS.parser32 eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n LS.parse32_synth _ synth_eCCurveType (fun x->synth_eCCurveType x) parse32_eCCurveType_key ()\n\nlet serialize32_eCCurveType_key : LS.serializer32 serialize_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n eCCurveType_repr_serializer32 eCCurveType_enum)", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.ECCurveType.eCCurveType_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.ECCurveType.eCCurveType", "FStar.UInt8.t", "Parsers.ECCurveType.eCCurveType_enum", "Parsers.ECCurveType.parse_eCCurveType_key", "Parsers.ECCurveType.synth_eCCurveType", "Parsers.ECCurveType.serialize_eCCurveType_key", "Parsers.ECCurveType.serialize32_eCCurveType_key", "Parsers.ECCurveType.synth_eCCurveType_inv", "Prims.eq2", "Prims.unit", "Parsers.ECCurveType.lemma_synth_eCCurveType_inv", "Parsers.ECCurveType.lemma_synth_eCCurveType_inj", "LowParse.SLow.Base.serializer32", "Parsers.ECCurveType.eCCurveType_parser_kind", "Parsers.ECCurveType.eCCurveType_parser", "Parsers.ECCurveType.eCCurveType_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val eCCurveType_serializer32: LS.serializer32 eCCurveType_serializer\nlet eCCurveType_serializer32:LS.serializer32 eCCurveType_serializer =", "completed_definiton": "lemma_synth_eCCurveType_inj ();\nlemma_synth_eCCurveType_inv ();\nLS.serialize32_synth _\n synth_eCCurveType\n _\n serialize32_eCCurveType_key\n synth_eCCurveType_inv\n (fun x -> synth_eCCurveType_inv x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.eCCurveType_reader", "original_source_type": "val eCCurveType_reader: LL.leaf_reader eCCurveType_parser", "source_type": "val eCCurveType_reader: LL.leaf_reader eCCurveType_parser", "source_definition": "let eCCurveType_reader =\n [@inline_let] let _ = lemma_synth_eCCurveType_inj () in\n LL.read_synth' parse_eCCurveType_key synth_eCCurveType read_eCCurveType_key ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 120, "start_col": 1, "end_line": 121, "end_col": 79 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let eCCurveType_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let eCCurveType_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let eCCurveType_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType = x\n\ninline_for_extraction let synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst eCCurveType_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_eCCurveType_inj () : Lemma\n (LP.synth_injective synth_eCCurveType) = ()\n\nlet lemma_synth_eCCurveType_inv () : Lemma\n (LP.synth_inverse synth_eCCurveType synth_eCCurveType_inv) = ()\n\nnoextract let parse_eCCurveType_key : LP.parser _ (LP.enum_key eCCurveType_enum) =\n LP.parse_enum_key eCCurveType_repr_parser eCCurveType_enum\n\nnoextract let serialize_eCCurveType_key : LP.serializer parse_eCCurveType_key =\n LP.serialize_enum_key eCCurveType_repr_parser eCCurveType_repr_serializer eCCurveType_enum\n\nnoextract let eCCurveType_parser : LP.parser _ eCCurveType =\n lemma_synth_eCCurveType_inj ();\n parse_eCCurveType_key `LP.parse_synth` synth_eCCurveType\n\nnoextract let eCCurveType_serializer : LP.serializer eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LP.serialize_synth _ synth_eCCurveType serialize_eCCurveType_key synth_eCCurveType_inv ()\n\nlet eCCurveType_bytesize (x:eCCurveType) : GTot nat = Seq.length (eCCurveType_serializer x)\n\nlet eCCurveType_bytesize_eq x = ()\n\nlet parse32_eCCurveType_key : LS.parser32 parse_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac eCCurveType_repr_parser32 eCCurveType_enum)\n\nlet eCCurveType_parser32 : LS.parser32 eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n LS.parse32_synth _ synth_eCCurveType (fun x->synth_eCCurveType x) parse32_eCCurveType_key ()\n\nlet serialize32_eCCurveType_key : LS.serializer32 serialize_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n eCCurveType_repr_serializer32 eCCurveType_enum)\n\nlet eCCurveType_serializer32 : LS.serializer32 eCCurveType_serializer =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LS.serialize32_synth _ synth_eCCurveType _ serialize32_eCCurveType_key synth_eCCurveType_inv (fun x->synth_eCCurveType_inv x) ()\n\nlet eCCurveType_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond eCCurveType_serializer 1ul) in\n LSZ.size32_constant eCCurveType_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_eCCurveType_key : LL.validator parse_eCCurveType_key =\n LL.mk_validate_enum_key eCCurveType_repr_validator eCCurveType_repr_reader eCCurveType_enum\n\nlet eCCurveType_validator =\n lemma_synth_eCCurveType_inj ();\n LL.validate_synth validate_eCCurveType_key synth_eCCurveType ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_eCCurveType_key : LL.leaf_reader parse_eCCurveType_key =\n LL.mk_read_enum_key eCCurveType_repr_reader eCCurveType_enum", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader Parsers.ECCurveType.eCCurveType_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.read_synth'", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.ECCurveType.eCCurveType", "FStar.UInt8.t", "Parsers.ECCurveType.eCCurveType_enum", "Parsers.ECCurveType.parse_eCCurveType_key", "Parsers.ECCurveType.synth_eCCurveType", "Parsers.ECCurveType.read_eCCurveType_key", "Prims.unit", "Parsers.ECCurveType.lemma_synth_eCCurveType_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val eCCurveType_reader: LL.leaf_reader eCCurveType_parser\nlet eCCurveType_reader =", "completed_definiton": "[@@ inline_let ]let _ = lemma_synth_eCCurveType_inj () in\nLL.read_synth' parse_eCCurveType_key synth_eCCurveType read_eCCurveType_key ()", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.eCCurveType_writer", "original_source_type": "val eCCurveType_writer: LL.leaf_writer_strong eCCurveType_serializer", "source_type": "val eCCurveType_writer: LL.leaf_writer_strong eCCurveType_serializer", "source_definition": "let eCCurveType_writer =\n [@inline_let] let _ = lemma_synth_eCCurveType_inj (); lemma_synth_eCCurveType_inv () in\n LL.write_synth write_eCCurveType_key synth_eCCurveType synth_eCCurveType_inv (fun x -> synth_eCCurveType_inv x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 130, "start_col": 2, "end_line": 131, "end_col": 116 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let eCCurveType_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let eCCurveType_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let eCCurveType_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType = x\n\ninline_for_extraction let synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst eCCurveType_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_eCCurveType_inj () : Lemma\n (LP.synth_injective synth_eCCurveType) = ()\n\nlet lemma_synth_eCCurveType_inv () : Lemma\n (LP.synth_inverse synth_eCCurveType synth_eCCurveType_inv) = ()\n\nnoextract let parse_eCCurveType_key : LP.parser _ (LP.enum_key eCCurveType_enum) =\n LP.parse_enum_key eCCurveType_repr_parser eCCurveType_enum\n\nnoextract let serialize_eCCurveType_key : LP.serializer parse_eCCurveType_key =\n LP.serialize_enum_key eCCurveType_repr_parser eCCurveType_repr_serializer eCCurveType_enum\n\nnoextract let eCCurveType_parser : LP.parser _ eCCurveType =\n lemma_synth_eCCurveType_inj ();\n parse_eCCurveType_key `LP.parse_synth` synth_eCCurveType\n\nnoextract let eCCurveType_serializer : LP.serializer eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LP.serialize_synth _ synth_eCCurveType serialize_eCCurveType_key synth_eCCurveType_inv ()\n\nlet eCCurveType_bytesize (x:eCCurveType) : GTot nat = Seq.length (eCCurveType_serializer x)\n\nlet eCCurveType_bytesize_eq x = ()\n\nlet parse32_eCCurveType_key : LS.parser32 parse_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac eCCurveType_repr_parser32 eCCurveType_enum)\n\nlet eCCurveType_parser32 : LS.parser32 eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n LS.parse32_synth _ synth_eCCurveType (fun x->synth_eCCurveType x) parse32_eCCurveType_key ()\n\nlet serialize32_eCCurveType_key : LS.serializer32 serialize_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n eCCurveType_repr_serializer32 eCCurveType_enum)\n\nlet eCCurveType_serializer32 : LS.serializer32 eCCurveType_serializer =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LS.serialize32_synth _ synth_eCCurveType _ serialize32_eCCurveType_key synth_eCCurveType_inv (fun x->synth_eCCurveType_inv x) ()\n\nlet eCCurveType_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond eCCurveType_serializer 1ul) in\n LSZ.size32_constant eCCurveType_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_eCCurveType_key : LL.validator parse_eCCurveType_key =\n LL.mk_validate_enum_key eCCurveType_repr_validator eCCurveType_repr_reader eCCurveType_enum\n\nlet eCCurveType_validator =\n lemma_synth_eCCurveType_inj ();\n LL.validate_synth validate_eCCurveType_key synth_eCCurveType ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_eCCurveType_key : LL.leaf_reader parse_eCCurveType_key =\n LL.mk_read_enum_key eCCurveType_repr_reader eCCurveType_enum\n\nlet eCCurveType_reader =\n [@inline_let] let _ = lemma_synth_eCCurveType_inj () in\n LL.read_synth' parse_eCCurveType_key synth_eCCurveType read_eCCurveType_key ()\n\ninline_for_extraction let write_eCCurveType_key : LL.leaf_writer_strong serialize_eCCurveType_key =\n LL.write_enum_key eCCurveType_repr_writer eCCurveType_enum (_ by (LP.enum_repr_of_key_tac eCCurveType_enum))\n\ninline_for_extraction let lserialize_eCCurveType_key : LL.serializer32 serialize_eCCurveType_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_eCCurveType_key 1ul ()", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong Parsers.ECCurveType.eCCurveType_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.write_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.ECCurveType.eCCurveType", "FStar.UInt8.t", "Parsers.ECCurveType.eCCurveType_enum", "Parsers.ECCurveType.parse_eCCurveType_key", "Parsers.ECCurveType.serialize_eCCurveType_key", "Parsers.ECCurveType.write_eCCurveType_key", "Parsers.ECCurveType.synth_eCCurveType", "Parsers.ECCurveType.synth_eCCurveType_inv", "Prims.eq2", "Prims.unit", "Parsers.ECCurveType.lemma_synth_eCCurveType_inv", "Parsers.ECCurveType.lemma_synth_eCCurveType_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val eCCurveType_writer: LL.leaf_writer_strong eCCurveType_serializer\nlet eCCurveType_writer =", "completed_definiton": "[@@ inline_let ]let _ =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ()\nin\nLL.write_synth write_eCCurveType_key\n synth_eCCurveType\n synth_eCCurveType_inv\n (fun x -> synth_eCCurveType_inv x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.eCCurveType_bytesize_eqn", "original_source_type": "val eCCurveType_bytesize_eqn (x: eCCurveType) : Lemma (eCCurveType_bytesize x == 1) [SMTPat (eCCurveType_bytesize x)]", "source_type": "val eCCurveType_bytesize_eqn (x: eCCurveType) : Lemma (eCCurveType_bytesize x == 1) [SMTPat (eCCurveType_bytesize x)]", "source_definition": "let eCCurveType_bytesize_eqn x = eCCurveType_bytesize_eq x; assert (FStar.Seq.length (LP.serialize eCCurveType_serializer x) <= 1); assert (1 <= FStar.Seq.length (LP.serialize eCCurveType_serializer x))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 135, "start_col": 33, "end_line": 135, "end_col": 202 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let eCCurveType_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let eCCurveType_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let eCCurveType_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType = x\n\ninline_for_extraction let synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst eCCurveType_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_eCCurveType_inj () : Lemma\n (LP.synth_injective synth_eCCurveType) = ()\n\nlet lemma_synth_eCCurveType_inv () : Lemma\n (LP.synth_inverse synth_eCCurveType synth_eCCurveType_inv) = ()\n\nnoextract let parse_eCCurveType_key : LP.parser _ (LP.enum_key eCCurveType_enum) =\n LP.parse_enum_key eCCurveType_repr_parser eCCurveType_enum\n\nnoextract let serialize_eCCurveType_key : LP.serializer parse_eCCurveType_key =\n LP.serialize_enum_key eCCurveType_repr_parser eCCurveType_repr_serializer eCCurveType_enum\n\nnoextract let eCCurveType_parser : LP.parser _ eCCurveType =\n lemma_synth_eCCurveType_inj ();\n parse_eCCurveType_key `LP.parse_synth` synth_eCCurveType\n\nnoextract let eCCurveType_serializer : LP.serializer eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LP.serialize_synth _ synth_eCCurveType serialize_eCCurveType_key synth_eCCurveType_inv ()\n\nlet eCCurveType_bytesize (x:eCCurveType) : GTot nat = Seq.length (eCCurveType_serializer x)\n\nlet eCCurveType_bytesize_eq x = ()\n\nlet parse32_eCCurveType_key : LS.parser32 parse_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac eCCurveType_repr_parser32 eCCurveType_enum)\n\nlet eCCurveType_parser32 : LS.parser32 eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n LS.parse32_synth _ synth_eCCurveType (fun x->synth_eCCurveType x) parse32_eCCurveType_key ()\n\nlet serialize32_eCCurveType_key : LS.serializer32 serialize_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n eCCurveType_repr_serializer32 eCCurveType_enum)\n\nlet eCCurveType_serializer32 : LS.serializer32 eCCurveType_serializer =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LS.serialize32_synth _ synth_eCCurveType _ serialize32_eCCurveType_key synth_eCCurveType_inv (fun x->synth_eCCurveType_inv x) ()\n\nlet eCCurveType_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond eCCurveType_serializer 1ul) in\n LSZ.size32_constant eCCurveType_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_eCCurveType_key : LL.validator parse_eCCurveType_key =\n LL.mk_validate_enum_key eCCurveType_repr_validator eCCurveType_repr_reader eCCurveType_enum\n\nlet eCCurveType_validator =\n lemma_synth_eCCurveType_inj ();\n LL.validate_synth validate_eCCurveType_key synth_eCCurveType ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_eCCurveType_key : LL.leaf_reader parse_eCCurveType_key =\n LL.mk_read_enum_key eCCurveType_repr_reader eCCurveType_enum\n\nlet eCCurveType_reader =\n [@inline_let] let _ = lemma_synth_eCCurveType_inj () in\n LL.read_synth' parse_eCCurveType_key synth_eCCurveType read_eCCurveType_key ()\n\ninline_for_extraction let write_eCCurveType_key : LL.leaf_writer_strong serialize_eCCurveType_key =\n LL.write_enum_key eCCurveType_repr_writer eCCurveType_enum (_ by (LP.enum_repr_of_key_tac eCCurveType_enum))\n\ninline_for_extraction let lserialize_eCCurveType_key : LL.serializer32 serialize_eCCurveType_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_eCCurveType_key 1ul ()\n\nlet eCCurveType_writer =\n [@inline_let] let _ = lemma_synth_eCCurveType_inj (); lemma_synth_eCCurveType_inv () in\n LL.write_synth write_eCCurveType_key synth_eCCurveType synth_eCCurveType_inv (fun x -> synth_eCCurveType_inv x) ()\n\nlet eCCurveType_lserializer = LL.serializer32_of_leaf_writer_strong_constant_size eCCurveType_writer 1ul ()", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.ECCurveType.eCCurveType\n -> FStar.Pervasives.Lemma (ensures Parsers.ECCurveType.eCCurveType_bytesize x == 1)\n [SMTPat (Parsers.ECCurveType.eCCurveType_bytesize x)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.ECCurveType.eCCurveType", "Prims._assert", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "Parsers.ECCurveType.eCCurveType_parser_kind", "Parsers.ECCurveType.eCCurveType_parser", "Parsers.ECCurveType.eCCurveType_serializer", "Prims.unit", "Parsers.ECCurveType.eCCurveType_bytesize_eq" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val eCCurveType_bytesize_eqn (x: eCCurveType) : Lemma (eCCurveType_bytesize x == 1) [SMTPat (eCCurveType_bytesize x)]\nlet eCCurveType_bytesize_eqn x =", "completed_definiton": "eCCurveType_bytesize_eq x;\nassert (FStar.Seq.length (LP.serialize eCCurveType_serializer x) <= 1);\nassert (1 <= FStar.Seq.length (LP.serialize eCCurveType_serializer x))", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fst", "name": "Parsers.ECCurveType.serialize32_eCCurveType_key", "original_source_type": "val serialize32_eCCurveType_key:LS.serializer32 serialize_eCCurveType_key", "source_type": "val serialize32_eCCurveType_key:LS.serializer32 serialize_eCCurveType_key", "source_definition": "let serialize32_eCCurveType_key : LS.serializer32 serialize_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n eCCurveType_repr_serializer32 eCCurveType_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 95, "start_col": 2, "end_line": 96, "end_col": 51 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let eCCurveType_enum : LP.enum eCCurveType U8.t =\n [@inline_let] let e = [\n Explicit_prime, 1z;\n Explicit_char2, 2z;\n Named_curve, 3z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let eCCurveType_repr_parser = LPI.parse_u8\n\nnoextract let eCCurveType_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let eCCurveType_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let eCCurveType_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let eCCurveType_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let eCCurveType_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let eCCurveType_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_eCCurveType (x: LP.enum_key eCCurveType_enum) : Tot eCCurveType = x\n\ninline_for_extraction let synth_eCCurveType_inv (x: eCCurveType) : Tot (LP.enum_key eCCurveType_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst eCCurveType_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_eCCurveType_inj () : Lemma\n (LP.synth_injective synth_eCCurveType) = ()\n\nlet lemma_synth_eCCurveType_inv () : Lemma\n (LP.synth_inverse synth_eCCurveType synth_eCCurveType_inv) = ()\n\nnoextract let parse_eCCurveType_key : LP.parser _ (LP.enum_key eCCurveType_enum) =\n LP.parse_enum_key eCCurveType_repr_parser eCCurveType_enum\n\nnoextract let serialize_eCCurveType_key : LP.serializer parse_eCCurveType_key =\n LP.serialize_enum_key eCCurveType_repr_parser eCCurveType_repr_serializer eCCurveType_enum\n\nnoextract let eCCurveType_parser : LP.parser _ eCCurveType =\n lemma_synth_eCCurveType_inj ();\n parse_eCCurveType_key `LP.parse_synth` synth_eCCurveType\n\nnoextract let eCCurveType_serializer : LP.serializer eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n lemma_synth_eCCurveType_inv ();\n LP.serialize_synth _ synth_eCCurveType serialize_eCCurveType_key synth_eCCurveType_inv ()\n\nlet eCCurveType_bytesize (x:eCCurveType) : GTot nat = Seq.length (eCCurveType_serializer x)\n\nlet eCCurveType_bytesize_eq x = ()\n\nlet parse32_eCCurveType_key : LS.parser32 parse_eCCurveType_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac eCCurveType_repr_parser32 eCCurveType_enum)\n\nlet eCCurveType_parser32 : LS.parser32 eCCurveType_parser =\n lemma_synth_eCCurveType_inj ();\n LS.parse32_synth _ synth_eCCurveType (fun x->synth_eCCurveType x) parse32_eCCurveType_key ()", "dependencies": { "source_file": "Parsers.ECCurveType.fst", "checked_file": "Parsers.ECCurveType.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.ECCurveType.serialize_eCCurveType_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Enum.serialize32_enum_key_gen", "LowParse.Spec.Int.parse_u8_kind", "Parsers.ECCurveType.eCCurveType", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "Parsers.ECCurveType.eCCurveType_repr_serializer32", "Parsers.ECCurveType.eCCurveType_enum", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Enum.enum_key", "Parsers.ECCurveType.parse_eCCurveType_key", "Parsers.ECCurveType.serialize_eCCurveType_key", "LowParse.Spec.Enum.enum_repr_of_key_cons'", "LowParse.Spec.Enum.enum_tail'", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize32_eCCurveType_key:LS.serializer32 serialize_eCCurveType_key\nlet serialize32_eCCurveType_key:LS.serializer32 serialize_eCCurveType_key =", "completed_definiton": "FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac eCCurveType_repr_serializer32\n eCCurveType_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12_master_secret.fst", "name": "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser", "original_source_type": "val ticketContents12_master_secret_parser: LP.parser ticketContents12_master_secret_parser_kind ticketContents12_master_secret", "source_type": "val ticketContents12_master_secret_parser: LP.parser ticketContents12_master_secret_parser_kind ticketContents12_master_secret", "source_definition": "let ticketContents12_master_secret_parser = LP.parse_flbytes 48", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12_master_secret.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 23, "start_col": 54, "end_line": 23, "end_col": 73 }, "file_context": "module Parsers.TicketContents12_master_secret\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"", "dependencies": { "source_file": "Parsers.TicketContents12_master_secret.fst", "checked_file": "Parsers.TicketContents12_master_secret.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind\n Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Bytes.parse_flbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12_master_secret_parser: LP.parser ticketContents12_master_secret_parser_kind ticketContents12_master_secret\nlet ticketContents12_master_secret_parser =", "completed_definiton": "LP.parse_flbytes 48", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12_master_secret.fst", "name": "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_bytesize", "original_source_type": "val ticketContents12_master_secret_bytesize (x:ticketContents12_master_secret) : GTot nat", "source_type": "val ticketContents12_master_secret_bytesize (x:ticketContents12_master_secret) : GTot nat", "source_definition": "let ticketContents12_master_secret_bytesize (x:ticketContents12_master_secret) : GTot nat = Seq.length (ticketContents12_master_secret_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12_master_secret.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 27, "start_col": 92, "end_line": 27, "end_col": 148 }, "file_context": "module Parsers.TicketContents12_master_secret\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents12_master_secret_parser = LP.parse_flbytes 48\n\nnoextract let ticketContents12_master_secret_serializer = LP.serialize_flbytes 48", "dependencies": { "source_file": "Parsers.TicketContents12_master_secret.fst", "checked_file": "Parsers.TicketContents12_master_secret.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketContents12_master_secret.ticketContents12_master_secret -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12_master_secret_bytesize (x:ticketContents12_master_secret) : GTot nat\nlet ticketContents12_master_secret_bytesize (x: ticketContents12_master_secret) : GTot nat =", "completed_definiton": "Seq.length (ticketContents12_master_secret_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12_master_secret.fst", "name": "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser32", "original_source_type": "val ticketContents12_master_secret_parser32: LS.parser32 ticketContents12_master_secret_parser", "source_type": "val ticketContents12_master_secret_parser32: LS.parser32 ticketContents12_master_secret_parser", "source_definition": "let ticketContents12_master_secret_parser32 = LS.parse32_flbytes 48 48ul", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12_master_secret.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 31, "start_col": 46, "end_line": 31, "end_col": 72 }, "file_context": "module Parsers.TicketContents12_master_secret\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents12_master_secret_parser = LP.parse_flbytes 48\n\nnoextract let ticketContents12_master_secret_serializer = LP.serialize_flbytes 48\n\nlet ticketContents12_master_secret_bytesize (x:ticketContents12_master_secret) : GTot nat = Seq.length (ticketContents12_master_secret_serializer x)\n\nlet ticketContents12_master_secret_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.TicketContents12_master_secret.fst", "checked_file": "Parsers.TicketContents12_master_secret.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser\n", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Bytes.parse32_flbytes", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12_master_secret_parser32: LS.parser32 ticketContents12_master_secret_parser\nlet ticketContents12_master_secret_parser32 =", "completed_definiton": "LS.parse32_flbytes 48 48ul", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12_master_secret.fst", "name": "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_serializer", "original_source_type": "val ticketContents12_master_secret_serializer: LP.serializer ticketContents12_master_secret_parser", "source_type": "val ticketContents12_master_secret_serializer: LP.serializer ticketContents12_master_secret_parser", "source_definition": "let ticketContents12_master_secret_serializer = LP.serialize_flbytes 48", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12_master_secret.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 25, "start_col": 58, "end_line": 25, "end_col": 81 }, "file_context": "module Parsers.TicketContents12_master_secret\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents12_master_secret_parser = LP.parse_flbytes 48", "dependencies": { "source_file": "Parsers.TicketContents12_master_secret.fst", "checked_file": "Parsers.TicketContents12_master_secret.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser\n", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Bytes.serialize_flbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12_master_secret_serializer: LP.serializer ticketContents12_master_secret_parser\nlet ticketContents12_master_secret_serializer =", "completed_definiton": "LP.serialize_flbytes 48", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12_master_secret.fst", "name": "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_serializer32", "original_source_type": "val ticketContents12_master_secret_serializer32: LS.serializer32 ticketContents12_master_secret_serializer", "source_type": "val ticketContents12_master_secret_serializer32: LS.serializer32 ticketContents12_master_secret_serializer", "source_definition": "let ticketContents12_master_secret_serializer32 = LS.serialize32_flbytes 48", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12_master_secret.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 33, "start_col": 50, "end_line": 33, "end_col": 75 }, "file_context": "module Parsers.TicketContents12_master_secret\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents12_master_secret_parser = LP.parse_flbytes 48\n\nnoextract let ticketContents12_master_secret_serializer = LP.serialize_flbytes 48\n\nlet ticketContents12_master_secret_bytesize (x:ticketContents12_master_secret) : GTot nat = Seq.length (ticketContents12_master_secret_serializer x)\n\nlet ticketContents12_master_secret_bytesize_eq x = ()\n\nlet ticketContents12_master_secret_parser32 = LS.parse32_flbytes 48 48ul", "dependencies": { "source_file": "Parsers.TicketContents12_master_secret.fst", "checked_file": "Parsers.TicketContents12_master_secret.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.TicketContents12_master_secret.ticketContents12_master_secret_serializer\n", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Bytes.serialize32_flbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12_master_secret_serializer32: LS.serializer32 ticketContents12_master_secret_serializer\nlet ticketContents12_master_secret_serializer32 =", "completed_definiton": "LS.serialize32_flbytes 48", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12_master_secret.fst", "name": "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_size32", "original_source_type": "val ticketContents12_master_secret_size32: LSZ.size32 ticketContents12_master_secret_serializer", "source_type": "val ticketContents12_master_secret_size32: LSZ.size32 ticketContents12_master_secret_serializer", "source_definition": "let ticketContents12_master_secret_size32 = LSZ.size32_constant ticketContents12_master_secret_serializer 48ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12_master_secret.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 35, "start_col": 44, "end_line": 35, "end_col": 113 }, "file_context": "module Parsers.TicketContents12_master_secret\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents12_master_secret_parser = LP.parse_flbytes 48\n\nnoextract let ticketContents12_master_secret_serializer = LP.serialize_flbytes 48\n\nlet ticketContents12_master_secret_bytesize (x:ticketContents12_master_secret) : GTot nat = Seq.length (ticketContents12_master_secret_serializer x)\n\nlet ticketContents12_master_secret_bytesize_eq x = ()\n\nlet ticketContents12_master_secret_parser32 = LS.parse32_flbytes 48 48ul\n\nlet ticketContents12_master_secret_serializer32 = LS.serialize32_flbytes 48", "dependencies": { "source_file": "Parsers.TicketContents12_master_secret.fst", "checked_file": "Parsers.TicketContents12_master_secret.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.TicketContents12_master_secret.ticketContents12_master_secret_serializer\n", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Base.size32_constant", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_serializer", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12_master_secret_size32: LSZ.size32 ticketContents12_master_secret_serializer\nlet ticketContents12_master_secret_size32 =", "completed_definiton": "LSZ.size32_constant ticketContents12_master_secret_serializer 48ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12_master_secret.fst", "name": "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_intro", "original_source_type": "val ticketContents12_master_secret_intro (h: HS.mem) (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : Lemma\n (requires (\n LL.live_slice h input /\\\n U32.v pos + 48 <= U32.v input.LL.len\n ))\n (ensures (\n LL.valid_content_pos ticketContents12_master_secret_parser h input pos (BY.hide (LL.bytes_of_slice_from_to h input pos (pos `U32.add` 48ul))) (pos `U32.add` 48ul)\n ))", "source_type": "val ticketContents12_master_secret_intro (h: HS.mem) (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : Lemma\n (requires (\n LL.live_slice h input /\\\n U32.v pos + 48 <= U32.v input.LL.len\n ))\n (ensures (\n LL.valid_content_pos ticketContents12_master_secret_parser h input pos (BY.hide (LL.bytes_of_slice_from_to h input pos (pos `U32.add` 48ul))) (pos `U32.add` 48ul)\n ))", "source_definition": "let ticketContents12_master_secret_intro h #_ #_ input pos =\n LL.valid_flbytes_intro h 48 input pos", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12_master_secret.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 40, "start_col": 2, "end_line": 40, "end_col": 39 }, "file_context": "module Parsers.TicketContents12_master_secret\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents12_master_secret_parser = LP.parse_flbytes 48\n\nnoextract let ticketContents12_master_secret_serializer = LP.serialize_flbytes 48\n\nlet ticketContents12_master_secret_bytesize (x:ticketContents12_master_secret) : GTot nat = Seq.length (ticketContents12_master_secret_serializer x)\n\nlet ticketContents12_master_secret_bytesize_eq x = ()\n\nlet ticketContents12_master_secret_parser32 = LS.parse32_flbytes 48 48ul\n\nlet ticketContents12_master_secret_serializer32 = LS.serialize32_flbytes 48\n\nlet ticketContents12_master_secret_size32 = LSZ.size32_constant ticketContents12_master_secret_serializer 48ul ()\n\nlet ticketContents12_master_secret_bytesize_eqn x = ()", "dependencies": { "source_file": "Parsers.TicketContents12_master_secret.fst", "checked_file": "Parsers.TicketContents12_master_secret.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: FStar.Monotonic.HyperStack.mem -> input: LowParse.Slice.slice rrel rel -> pos: FStar.UInt32.t\n -> FStar.Pervasives.Lemma\n (requires\n LowParse.Slice.live_slice h input /\\\n FStar.UInt32.v pos + 48 <= FStar.UInt32.v (Mkslice?.len input))\n (ensures\n LowParse.Low.Base.Spec.valid_content_pos Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser\n h\n input\n pos\n (FStar.Bytes.hide (LowParse.Low.Base.Spec.bytes_of_slice_from_to h\n input\n pos\n (FStar.UInt32.add pos 48ul)))\n (FStar.UInt32.add pos 48ul))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Monotonic.HyperStack.mem", "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "LowParse.Low.Bytes.valid_flbytes_intro", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12_master_secret_intro (h: HS.mem) (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : Lemma\n (requires (\n LL.live_slice h input /\\\n U32.v pos + 48 <= U32.v input.LL.len\n ))\n (ensures (\n LL.valid_content_pos ticketContents12_master_secret_parser h input pos (BY.hide (LL.bytes_of_slice_from_to h input pos (pos `U32.add` 48ul))) (pos `U32.add` 48ul)\n ))\nlet ticketContents12_master_secret_intro h #_ #_ input pos =", "completed_definiton": "LL.valid_flbytes_intro h 48 input pos", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12_master_secret.fst", "name": "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_elim", "original_source_type": "val ticketContents12_master_secret_elim (h: HS.mem) (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : Lemma\n (requires (LL.valid ticketContents12_master_secret_parser h input pos))\n (ensures (\n U32.v pos + 48 <= U32.v input.LL.len /\\\n LL.valid_content_pos ticketContents12_master_secret_parser h input pos (BY.hide (LL.bytes_of_slice_from_to h input pos (pos `U32.add` 48ul))) (pos `U32.add` 48ul)\n ))", "source_type": "val ticketContents12_master_secret_elim (h: HS.mem) (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : Lemma\n (requires (LL.valid ticketContents12_master_secret_parser h input pos))\n (ensures (\n U32.v pos + 48 <= U32.v input.LL.len /\\\n LL.valid_content_pos ticketContents12_master_secret_parser h input pos (BY.hide (LL.bytes_of_slice_from_to h input pos (pos `U32.add` 48ul))) (pos `U32.add` 48ul)\n ))", "source_definition": "let ticketContents12_master_secret_elim h #_ #_ input pos =\n LL.valid_flbytes_elim h 48 input pos", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12_master_secret.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 43, "start_col": 2, "end_line": 43, "end_col": 38 }, "file_context": "module Parsers.TicketContents12_master_secret\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents12_master_secret_parser = LP.parse_flbytes 48\n\nnoextract let ticketContents12_master_secret_serializer = LP.serialize_flbytes 48\n\nlet ticketContents12_master_secret_bytesize (x:ticketContents12_master_secret) : GTot nat = Seq.length (ticketContents12_master_secret_serializer x)\n\nlet ticketContents12_master_secret_bytesize_eq x = ()\n\nlet ticketContents12_master_secret_parser32 = LS.parse32_flbytes 48 48ul\n\nlet ticketContents12_master_secret_serializer32 = LS.serialize32_flbytes 48\n\nlet ticketContents12_master_secret_size32 = LSZ.size32_constant ticketContents12_master_secret_serializer 48ul ()\n\nlet ticketContents12_master_secret_bytesize_eqn x = ()\n\nlet ticketContents12_master_secret_intro h #_ #_ input pos =\n LL.valid_flbytes_intro h 48 input pos", "dependencies": { "source_file": "Parsers.TicketContents12_master_secret.fst", "checked_file": "Parsers.TicketContents12_master_secret.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: FStar.Monotonic.HyperStack.mem -> input: LowParse.Slice.slice rrel rel -> pos: FStar.UInt32.t\n -> FStar.Pervasives.Lemma\n (requires\n LowParse.Low.Base.Spec.valid Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser\n h\n input\n pos)\n (ensures\n FStar.UInt32.v pos + 48 <= FStar.UInt32.v (Mkslice?.len input) /\\\n LowParse.Low.Base.Spec.valid_content_pos Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser\n h\n input\n pos\n (FStar.Bytes.hide (LowParse.Low.Base.Spec.bytes_of_slice_from_to h\n input\n pos\n (FStar.UInt32.add pos 48ul)))\n (FStar.UInt32.add pos 48ul))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Monotonic.HyperStack.mem", "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "LowParse.Low.Bytes.valid_flbytes_elim", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12_master_secret_elim (h: HS.mem) (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : Lemma\n (requires (LL.valid ticketContents12_master_secret_parser h input pos))\n (ensures (\n U32.v pos + 48 <= U32.v input.LL.len /\\\n LL.valid_content_pos ticketContents12_master_secret_parser h input pos (BY.hide (LL.bytes_of_slice_from_to h input pos (pos `U32.add` 48ul))) (pos `U32.add` 48ul)\n ))\nlet ticketContents12_master_secret_elim h #_ #_ input pos =", "completed_definiton": "LL.valid_flbytes_elim h 48 input pos", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fsti", "name": "Parsers.TicketContents13.ticketContents13_parser_kind", "original_source_type": "", "source_type": "val ticketContents13_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let ticketContents13_parser_kind = LP.strong_parser_kind 46 66059 None", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 40, "start_col": 67, "end_line": 40, "end_col": 102 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.CipherSuite\n\n(* Type of field rms*)\ninclude Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\ninclude Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\ninclude Parsers.TicketContents13_custom_data\n\ntype ticketContents13 = {\n cs : cipherSuite;\n rms : ticketContents13_rms;\n nonce : ticketContents13_nonce;\n creation_time : U32.t;\n age_add : U32.t;\n custom_data : ticketContents13_custom_data;\n}", "dependencies": { "source_file": "Parsers.TicketContents13.fsti", "checked_file": "Parsers.TicketContents13.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "Parsers.CipherSuite.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let ticketContents13_parser_kind =", "completed_definiton": "LP.strong_parser_kind 46 66059 None", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fsti", "name": "Parsers.TicketContents13.clens_ticketContents13_nonce", "original_source_type": "val clens_ticketContents13_nonce:LL.clens ticketContents13 ticketContents13_nonce", "source_type": "val clens_ticketContents13_nonce:LL.clens ticketContents13 ticketContents13_nonce", "source_definition": "let clens_ticketContents13_nonce : LL.clens ticketContents13 ticketContents13_nonce = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.nonce);\n}", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 73, "start_col": 2, "end_line": 74, "end_col": 36 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.CipherSuite\n\n(* Type of field rms*)\ninclude Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\ninclude Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\ninclude Parsers.TicketContents13_custom_data\n\ntype ticketContents13 = {\n cs : cipherSuite;\n rms : ticketContents13_rms;\n nonce : ticketContents13_nonce;\n creation_time : U32.t;\n age_add : U32.t;\n custom_data : ticketContents13_custom_data;\n}\n\ninline_for_extraction noextract let ticketContents13_parser_kind = LP.strong_parser_kind 46 66059 None\n\nnoextract val ticketContents13_parser: LP.parser ticketContents13_parser_kind ticketContents13\n\nnoextract val ticketContents13_serializer: LP.serializer ticketContents13_parser\n\nnoextract val ticketContents13_bytesize (x:ticketContents13) : GTot nat\n\nnoextract val ticketContents13_bytesize_eq (x:ticketContents13) : Lemma (ticketContents13_bytesize x == Seq.length (LP.serialize ticketContents13_serializer x))\n\nval ticketContents13_parser32: LS.parser32 ticketContents13_parser\n\nval ticketContents13_serializer32: LS.serializer32 ticketContents13_serializer\n\nval ticketContents13_size32: LSZ.size32 ticketContents13_serializer\n\nval ticketContents13_validator: LL.validator ticketContents13_parser\n\nval ticketContents13_jumper: LL.jumper ticketContents13_parser\n\nval ticketContents13_bytesize_eqn (x: ticketContents13) : Lemma (ticketContents13_bytesize x == (cipherSuite_bytesize (x.cs)) + (ticketContents13_rms_bytesize (x.rms)) + (ticketContents13_nonce_bytesize (x.nonce)) + 4 + 4 + (ticketContents13_custom_data_bytesize (x.custom_data))) [SMTPat (ticketContents13_bytesize x)]\n\nnoextract let clens_ticketContents13_cs : LL.clens ticketContents13 cipherSuite = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.cs);\n}\n\nnoextract let clens_ticketContents13_rms : LL.clens ticketContents13 ticketContents13_rms = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.rms);\n}", "dependencies": { "source_file": "Parsers.TicketContents13.fsti", "checked_file": "Parsers.TicketContents13.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "Parsers.CipherSuite.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.TicketContents13.ticketContents13\n Parsers.TicketContents13_nonce.ticketContents13_nonce", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.Mkclens", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "Prims.l_True", "Parsers.TicketContents13.__proj__MkticketContents13__item__nonce" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val clens_ticketContents13_nonce:LL.clens ticketContents13 ticketContents13_nonce\nlet clens_ticketContents13_nonce:LL.clens ticketContents13 ticketContents13_nonce =", "completed_definiton": "{ LL.clens_cond = (fun _ -> True); LL.clens_get = (fun x -> x.nonce) }", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fsti", "name": "Parsers.TicketContents13.clens_ticketContents13_cs", "original_source_type": "val clens_ticketContents13_cs:LL.clens ticketContents13 cipherSuite", "source_type": "val clens_ticketContents13_cs:LL.clens ticketContents13 cipherSuite", "source_definition": "let clens_ticketContents13_cs : LL.clens ticketContents13 cipherSuite = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.cs);\n}", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 63, "start_col": 2, "end_line": 64, "end_col": 33 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.CipherSuite\n\n(* Type of field rms*)\ninclude Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\ninclude Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\ninclude Parsers.TicketContents13_custom_data\n\ntype ticketContents13 = {\n cs : cipherSuite;\n rms : ticketContents13_rms;\n nonce : ticketContents13_nonce;\n creation_time : U32.t;\n age_add : U32.t;\n custom_data : ticketContents13_custom_data;\n}\n\ninline_for_extraction noextract let ticketContents13_parser_kind = LP.strong_parser_kind 46 66059 None\n\nnoextract val ticketContents13_parser: LP.parser ticketContents13_parser_kind ticketContents13\n\nnoextract val ticketContents13_serializer: LP.serializer ticketContents13_parser\n\nnoextract val ticketContents13_bytesize (x:ticketContents13) : GTot nat\n\nnoextract val ticketContents13_bytesize_eq (x:ticketContents13) : Lemma (ticketContents13_bytesize x == Seq.length (LP.serialize ticketContents13_serializer x))\n\nval ticketContents13_parser32: LS.parser32 ticketContents13_parser\n\nval ticketContents13_serializer32: LS.serializer32 ticketContents13_serializer\n\nval ticketContents13_size32: LSZ.size32 ticketContents13_serializer\n\nval ticketContents13_validator: LL.validator ticketContents13_parser\n\nval ticketContents13_jumper: LL.jumper ticketContents13_parser\n\nval ticketContents13_bytesize_eqn (x: ticketContents13) : Lemma (ticketContents13_bytesize x == (cipherSuite_bytesize (x.cs)) + (ticketContents13_rms_bytesize (x.rms)) + (ticketContents13_nonce_bytesize (x.nonce)) + 4 + 4 + (ticketContents13_custom_data_bytesize (x.custom_data))) [SMTPat (ticketContents13_bytesize x)]", "dependencies": { "source_file": "Parsers.TicketContents13.fsti", "checked_file": "Parsers.TicketContents13.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "Parsers.CipherSuite.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.TicketContents13.ticketContents13\n Parsers.CipherSuite.cipherSuite", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.Mkclens", "Parsers.TicketContents13.ticketContents13", "Parsers.CipherSuite.cipherSuite", "Prims.l_True", "Parsers.TicketContents13.__proj__MkticketContents13__item__cs" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val clens_ticketContents13_cs:LL.clens ticketContents13 cipherSuite\nlet clens_ticketContents13_cs:LL.clens ticketContents13 cipherSuite =", "completed_definiton": "{ LL.clens_cond = (fun _ -> True); LL.clens_get = (fun x -> x.cs) }", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fsti", "name": "Parsers.TicketContents13.clens_ticketContents13_custom_data", "original_source_type": "val clens_ticketContents13_custom_data:LL.clens ticketContents13 ticketContents13_custom_data", "source_type": "val clens_ticketContents13_custom_data:LL.clens ticketContents13 ticketContents13_custom_data", "source_definition": "let clens_ticketContents13_custom_data : LL.clens ticketContents13 ticketContents13_custom_data = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.custom_data);\n}", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 88, "start_col": 2, "end_line": 89, "end_col": 42 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.CipherSuite\n\n(* Type of field rms*)\ninclude Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\ninclude Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\ninclude Parsers.TicketContents13_custom_data\n\ntype ticketContents13 = {\n cs : cipherSuite;\n rms : ticketContents13_rms;\n nonce : ticketContents13_nonce;\n creation_time : U32.t;\n age_add : U32.t;\n custom_data : ticketContents13_custom_data;\n}\n\ninline_for_extraction noextract let ticketContents13_parser_kind = LP.strong_parser_kind 46 66059 None\n\nnoextract val ticketContents13_parser: LP.parser ticketContents13_parser_kind ticketContents13\n\nnoextract val ticketContents13_serializer: LP.serializer ticketContents13_parser\n\nnoextract val ticketContents13_bytesize (x:ticketContents13) : GTot nat\n\nnoextract val ticketContents13_bytesize_eq (x:ticketContents13) : Lemma (ticketContents13_bytesize x == Seq.length (LP.serialize ticketContents13_serializer x))\n\nval ticketContents13_parser32: LS.parser32 ticketContents13_parser\n\nval ticketContents13_serializer32: LS.serializer32 ticketContents13_serializer\n\nval ticketContents13_size32: LSZ.size32 ticketContents13_serializer\n\nval ticketContents13_validator: LL.validator ticketContents13_parser\n\nval ticketContents13_jumper: LL.jumper ticketContents13_parser\n\nval ticketContents13_bytesize_eqn (x: ticketContents13) : Lemma (ticketContents13_bytesize x == (cipherSuite_bytesize (x.cs)) + (ticketContents13_rms_bytesize (x.rms)) + (ticketContents13_nonce_bytesize (x.nonce)) + 4 + 4 + (ticketContents13_custom_data_bytesize (x.custom_data))) [SMTPat (ticketContents13_bytesize x)]\n\nnoextract let clens_ticketContents13_cs : LL.clens ticketContents13 cipherSuite = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.cs);\n}\n\nnoextract let clens_ticketContents13_rms : LL.clens ticketContents13 ticketContents13_rms = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.rms);\n}\n\nnoextract let clens_ticketContents13_nonce : LL.clens ticketContents13 ticketContents13_nonce = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.nonce);\n}\n\nnoextract let clens_ticketContents13_creation_time : LL.clens ticketContents13 U32.t = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.creation_time);\n}\n\nnoextract let clens_ticketContents13_age_add : LL.clens ticketContents13 U32.t = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.age_add);\n}", "dependencies": { "source_file": "Parsers.TicketContents13.fsti", "checked_file": "Parsers.TicketContents13.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "Parsers.CipherSuite.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.TicketContents13.ticketContents13\n Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.Mkclens", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "Prims.l_True", "Parsers.TicketContents13.__proj__MkticketContents13__item__custom_data" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val clens_ticketContents13_custom_data:LL.clens ticketContents13 ticketContents13_custom_data\nlet clens_ticketContents13_custom_data:LL.clens ticketContents13 ticketContents13_custom_data =", "completed_definiton": "{ LL.clens_cond = (fun _ -> True); LL.clens_get = (fun x -> x.custom_data) }", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fsti", "name": "Parsers.TicketContents13.clens_ticketContents13_rms", "original_source_type": "val clens_ticketContents13_rms:LL.clens ticketContents13 ticketContents13_rms", "source_type": "val clens_ticketContents13_rms:LL.clens ticketContents13 ticketContents13_rms", "source_definition": "let clens_ticketContents13_rms : LL.clens ticketContents13 ticketContents13_rms = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.rms);\n}", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 68, "start_col": 2, "end_line": 69, "end_col": 34 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.CipherSuite\n\n(* Type of field rms*)\ninclude Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\ninclude Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\ninclude Parsers.TicketContents13_custom_data\n\ntype ticketContents13 = {\n cs : cipherSuite;\n rms : ticketContents13_rms;\n nonce : ticketContents13_nonce;\n creation_time : U32.t;\n age_add : U32.t;\n custom_data : ticketContents13_custom_data;\n}\n\ninline_for_extraction noextract let ticketContents13_parser_kind = LP.strong_parser_kind 46 66059 None\n\nnoextract val ticketContents13_parser: LP.parser ticketContents13_parser_kind ticketContents13\n\nnoextract val ticketContents13_serializer: LP.serializer ticketContents13_parser\n\nnoextract val ticketContents13_bytesize (x:ticketContents13) : GTot nat\n\nnoextract val ticketContents13_bytesize_eq (x:ticketContents13) : Lemma (ticketContents13_bytesize x == Seq.length (LP.serialize ticketContents13_serializer x))\n\nval ticketContents13_parser32: LS.parser32 ticketContents13_parser\n\nval ticketContents13_serializer32: LS.serializer32 ticketContents13_serializer\n\nval ticketContents13_size32: LSZ.size32 ticketContents13_serializer\n\nval ticketContents13_validator: LL.validator ticketContents13_parser\n\nval ticketContents13_jumper: LL.jumper ticketContents13_parser\n\nval ticketContents13_bytesize_eqn (x: ticketContents13) : Lemma (ticketContents13_bytesize x == (cipherSuite_bytesize (x.cs)) + (ticketContents13_rms_bytesize (x.rms)) + (ticketContents13_nonce_bytesize (x.nonce)) + 4 + 4 + (ticketContents13_custom_data_bytesize (x.custom_data))) [SMTPat (ticketContents13_bytesize x)]\n\nnoextract let clens_ticketContents13_cs : LL.clens ticketContents13 cipherSuite = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.cs);\n}", "dependencies": { "source_file": "Parsers.TicketContents13.fsti", "checked_file": "Parsers.TicketContents13.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "Parsers.CipherSuite.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.TicketContents13.ticketContents13\n Parsers.TicketContents13_rms.ticketContents13_rms", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.Mkclens", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13_rms.ticketContents13_rms", "Prims.l_True", "Parsers.TicketContents13.__proj__MkticketContents13__item__rms" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val clens_ticketContents13_rms:LL.clens ticketContents13 ticketContents13_rms\nlet clens_ticketContents13_rms:LL.clens ticketContents13 ticketContents13_rms =", "completed_definiton": "{ LL.clens_cond = (fun _ -> True); LL.clens_get = (fun x -> x.rms) }", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fsti", "name": "Parsers.TicketContents13.clens_ticketContents13_age_add", "original_source_type": "val clens_ticketContents13_age_add:LL.clens ticketContents13 U32.t", "source_type": "val clens_ticketContents13_age_add:LL.clens ticketContents13 U32.t", "source_definition": "let clens_ticketContents13_age_add : LL.clens ticketContents13 U32.t = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.age_add);\n}", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 83, "start_col": 2, "end_line": 84, "end_col": 38 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.CipherSuite\n\n(* Type of field rms*)\ninclude Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\ninclude Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\ninclude Parsers.TicketContents13_custom_data\n\ntype ticketContents13 = {\n cs : cipherSuite;\n rms : ticketContents13_rms;\n nonce : ticketContents13_nonce;\n creation_time : U32.t;\n age_add : U32.t;\n custom_data : ticketContents13_custom_data;\n}\n\ninline_for_extraction noextract let ticketContents13_parser_kind = LP.strong_parser_kind 46 66059 None\n\nnoextract val ticketContents13_parser: LP.parser ticketContents13_parser_kind ticketContents13\n\nnoextract val ticketContents13_serializer: LP.serializer ticketContents13_parser\n\nnoextract val ticketContents13_bytesize (x:ticketContents13) : GTot nat\n\nnoextract val ticketContents13_bytesize_eq (x:ticketContents13) : Lemma (ticketContents13_bytesize x == Seq.length (LP.serialize ticketContents13_serializer x))\n\nval ticketContents13_parser32: LS.parser32 ticketContents13_parser\n\nval ticketContents13_serializer32: LS.serializer32 ticketContents13_serializer\n\nval ticketContents13_size32: LSZ.size32 ticketContents13_serializer\n\nval ticketContents13_validator: LL.validator ticketContents13_parser\n\nval ticketContents13_jumper: LL.jumper ticketContents13_parser\n\nval ticketContents13_bytesize_eqn (x: ticketContents13) : Lemma (ticketContents13_bytesize x == (cipherSuite_bytesize (x.cs)) + (ticketContents13_rms_bytesize (x.rms)) + (ticketContents13_nonce_bytesize (x.nonce)) + 4 + 4 + (ticketContents13_custom_data_bytesize (x.custom_data))) [SMTPat (ticketContents13_bytesize x)]\n\nnoextract let clens_ticketContents13_cs : LL.clens ticketContents13 cipherSuite = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.cs);\n}\n\nnoextract let clens_ticketContents13_rms : LL.clens ticketContents13 ticketContents13_rms = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.rms);\n}\n\nnoextract let clens_ticketContents13_nonce : LL.clens ticketContents13 ticketContents13_nonce = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.nonce);\n}\n\nnoextract let clens_ticketContents13_creation_time : LL.clens ticketContents13 U32.t = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.creation_time);\n}", "dependencies": { "source_file": "Parsers.TicketContents13.fsti", "checked_file": "Parsers.TicketContents13.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "Parsers.CipherSuite.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.TicketContents13.ticketContents13 FStar.UInt32.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.Mkclens", "Parsers.TicketContents13.ticketContents13", "FStar.UInt32.t", "Prims.l_True", "Parsers.TicketContents13.__proj__MkticketContents13__item__age_add" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val clens_ticketContents13_age_add:LL.clens ticketContents13 U32.t\nlet clens_ticketContents13_age_add:LL.clens ticketContents13 U32.t =", "completed_definiton": "{ LL.clens_cond = (fun _ -> True); LL.clens_get = (fun x -> x.age_add) }", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fsti", "name": "Parsers.TicketContents13.clens_ticketContents13_creation_time", "original_source_type": "val clens_ticketContents13_creation_time:LL.clens ticketContents13 U32.t", "source_type": "val clens_ticketContents13_creation_time:LL.clens ticketContents13 U32.t", "source_definition": "let clens_ticketContents13_creation_time : LL.clens ticketContents13 U32.t = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.creation_time);\n}", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 78, "start_col": 2, "end_line": 79, "end_col": 44 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.CipherSuite\n\n(* Type of field rms*)\ninclude Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\ninclude Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\ninclude Parsers.TicketContents13_custom_data\n\ntype ticketContents13 = {\n cs : cipherSuite;\n rms : ticketContents13_rms;\n nonce : ticketContents13_nonce;\n creation_time : U32.t;\n age_add : U32.t;\n custom_data : ticketContents13_custom_data;\n}\n\ninline_for_extraction noextract let ticketContents13_parser_kind = LP.strong_parser_kind 46 66059 None\n\nnoextract val ticketContents13_parser: LP.parser ticketContents13_parser_kind ticketContents13\n\nnoextract val ticketContents13_serializer: LP.serializer ticketContents13_parser\n\nnoextract val ticketContents13_bytesize (x:ticketContents13) : GTot nat\n\nnoextract val ticketContents13_bytesize_eq (x:ticketContents13) : Lemma (ticketContents13_bytesize x == Seq.length (LP.serialize ticketContents13_serializer x))\n\nval ticketContents13_parser32: LS.parser32 ticketContents13_parser\n\nval ticketContents13_serializer32: LS.serializer32 ticketContents13_serializer\n\nval ticketContents13_size32: LSZ.size32 ticketContents13_serializer\n\nval ticketContents13_validator: LL.validator ticketContents13_parser\n\nval ticketContents13_jumper: LL.jumper ticketContents13_parser\n\nval ticketContents13_bytesize_eqn (x: ticketContents13) : Lemma (ticketContents13_bytesize x == (cipherSuite_bytesize (x.cs)) + (ticketContents13_rms_bytesize (x.rms)) + (ticketContents13_nonce_bytesize (x.nonce)) + 4 + 4 + (ticketContents13_custom_data_bytesize (x.custom_data))) [SMTPat (ticketContents13_bytesize x)]\n\nnoextract let clens_ticketContents13_cs : LL.clens ticketContents13 cipherSuite = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.cs);\n}\n\nnoextract let clens_ticketContents13_rms : LL.clens ticketContents13 ticketContents13_rms = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.rms);\n}\n\nnoextract let clens_ticketContents13_nonce : LL.clens ticketContents13 ticketContents13_nonce = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.nonce);\n}", "dependencies": { "source_file": "Parsers.TicketContents13.fsti", "checked_file": "Parsers.TicketContents13.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "Parsers.CipherSuite.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.TicketContents13.ticketContents13 FStar.UInt32.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.Mkclens", "Parsers.TicketContents13.ticketContents13", "FStar.UInt32.t", "Prims.l_True", "Parsers.TicketContents13.__proj__MkticketContents13__item__creation_time" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val clens_ticketContents13_creation_time:LL.clens ticketContents13 U32.t\nlet clens_ticketContents13_creation_time:LL.clens ticketContents13 U32.t =", "completed_definiton": "{ LL.clens_cond = (fun _ -> True); LL.clens_get = (fun x -> x.creation_time) }", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_context.fst", "name": "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_bytesize", "original_source_type": "val hkdfLabel_context_bytesize (x:hkdfLabel_context) : GTot nat", "source_type": "val hkdfLabel_context_bytesize (x:hkdfLabel_context) : GTot nat", "source_definition": "let hkdfLabel_context_bytesize (x:hkdfLabel_context) : GTot nat = Seq.length (hkdfLabel_context_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_context.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 27, "start_col": 66, "end_line": 27, "end_col": 109 }, "file_context": "module Parsers.HKDF.HkdfLabel_context\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let hkdfLabel_context_parser = LP.parse_bounded_vlbytes 0 255\n\nnoextract let hkdfLabel_context_serializer = LP.serialize_bounded_vlbytes 0 255", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_context.fst", "checked_file": "Parsers.HKDF.HkdfLabel_context.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.HKDF.HkdfLabel_context.hkdfLabel_context -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_context_bytesize (x:hkdfLabel_context) : GTot nat\nlet hkdfLabel_context_bytesize (x: hkdfLabel_context) : GTot nat =", "completed_definiton": "Seq.length (hkdfLabel_context_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_context.fst", "name": "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser32", "original_source_type": "val hkdfLabel_context_parser32: LS.parser32 hkdfLabel_context_parser", "source_type": "val hkdfLabel_context_parser32: LS.parser32 hkdfLabel_context_parser", "source_definition": "let hkdfLabel_context_parser32 = LS.parse32_bounded_vlbytes 0 0ul 255 255ul", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_context.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 31, "start_col": 33, "end_line": 31, "end_col": 75 }, "file_context": "module Parsers.HKDF.HkdfLabel_context\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let hkdfLabel_context_parser = LP.parse_bounded_vlbytes 0 255\n\nnoextract let hkdfLabel_context_serializer = LP.serialize_bounded_vlbytes 0 255\n\nlet hkdfLabel_context_bytesize (x:hkdfLabel_context) : GTot nat = Seq.length (hkdfLabel_context_serializer x)\n\nlet hkdfLabel_context_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_context.fst", "checked_file": "Parsers.HKDF.HkdfLabel_context.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Bytes.parse32_bounded_vlbytes", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_context_parser32: LS.parser32 hkdfLabel_context_parser\nlet hkdfLabel_context_parser32 =", "completed_definiton": "LS.parse32_bounded_vlbytes 0 0ul 255 255ul", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_context.fst", "name": "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_validator", "original_source_type": "val hkdfLabel_context_validator: LL.validator hkdfLabel_context_parser", "source_type": "val hkdfLabel_context_validator: LL.validator hkdfLabel_context_parser", "source_definition": "let hkdfLabel_context_validator = LL.validate_bounded_vlbytes 0 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_context.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 37, "start_col": 34, "end_line": 37, "end_col": 67 }, "file_context": "module Parsers.HKDF.HkdfLabel_context\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let hkdfLabel_context_parser = LP.parse_bounded_vlbytes 0 255\n\nnoextract let hkdfLabel_context_serializer = LP.serialize_bounded_vlbytes 0 255\n\nlet hkdfLabel_context_bytesize (x:hkdfLabel_context) : GTot nat = Seq.length (hkdfLabel_context_serializer x)\n\nlet hkdfLabel_context_bytesize_eq x = ()\n\nlet hkdfLabel_context_parser32 = LS.parse32_bounded_vlbytes 0 0ul 255 255ul\n\nlet hkdfLabel_context_serializer32 = LS.serialize32_bounded_vlbytes 0 255\n\nlet hkdfLabel_context_size32 = LSZ.size32_bounded_vlbytes 0 255", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_context.fst", "checked_file": "Parsers.HKDF.HkdfLabel_context.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Bytes.validate_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_context_validator: LL.validator hkdfLabel_context_parser\nlet hkdfLabel_context_validator =", "completed_definiton": "LL.validate_bounded_vlbytes 0 255", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_context.fst", "name": "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_size32", "original_source_type": "val hkdfLabel_context_size32: LSZ.size32 hkdfLabel_context_serializer", "source_type": "val hkdfLabel_context_size32: LSZ.size32 hkdfLabel_context_serializer", "source_definition": "let hkdfLabel_context_size32 = LSZ.size32_bounded_vlbytes 0 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_context.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 35, "start_col": 31, "end_line": 35, "end_col": 63 }, "file_context": "module Parsers.HKDF.HkdfLabel_context\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let hkdfLabel_context_parser = LP.parse_bounded_vlbytes 0 255\n\nnoextract let hkdfLabel_context_serializer = LP.serialize_bounded_vlbytes 0 255\n\nlet hkdfLabel_context_bytesize (x:hkdfLabel_context) : GTot nat = Seq.length (hkdfLabel_context_serializer x)\n\nlet hkdfLabel_context_bytesize_eq x = ()\n\nlet hkdfLabel_context_parser32 = LS.parse32_bounded_vlbytes 0 0ul 255 255ul\n\nlet hkdfLabel_context_serializer32 = LS.serialize32_bounded_vlbytes 0 255", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_context.fst", "checked_file": "Parsers.HKDF.HkdfLabel_context.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Bytes.size32_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_context_size32: LSZ.size32 hkdfLabel_context_serializer\nlet hkdfLabel_context_size32 =", "completed_definiton": "LSZ.size32_bounded_vlbytes 0 255", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_context.fst", "name": "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_jumper", "original_source_type": "val hkdfLabel_context_jumper: LL.jumper hkdfLabel_context_parser", "source_type": "val hkdfLabel_context_jumper: LL.jumper hkdfLabel_context_parser", "source_definition": "let hkdfLabel_context_jumper = LL.jump_bounded_vlbytes 0 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_context.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 39, "start_col": 31, "end_line": 39, "end_col": 60 }, "file_context": "module Parsers.HKDF.HkdfLabel_context\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let hkdfLabel_context_parser = LP.parse_bounded_vlbytes 0 255\n\nnoextract let hkdfLabel_context_serializer = LP.serialize_bounded_vlbytes 0 255\n\nlet hkdfLabel_context_bytesize (x:hkdfLabel_context) : GTot nat = Seq.length (hkdfLabel_context_serializer x)\n\nlet hkdfLabel_context_bytesize_eq x = ()\n\nlet hkdfLabel_context_parser32 = LS.parse32_bounded_vlbytes 0 0ul 255 255ul\n\nlet hkdfLabel_context_serializer32 = LS.serialize32_bounded_vlbytes 0 255\n\nlet hkdfLabel_context_size32 = LSZ.size32_bounded_vlbytes 0 255\n\nlet hkdfLabel_context_validator = LL.validate_bounded_vlbytes 0 255", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_context.fst", "checked_file": "Parsers.HKDF.HkdfLabel_context.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Bytes.jump_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_context_jumper: LL.jumper hkdfLabel_context_parser\nlet hkdfLabel_context_jumper =", "completed_definiton": "LL.jump_bounded_vlbytes 0 255", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_context.fst", "name": "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_serializer32", "original_source_type": "val hkdfLabel_context_serializer32: LS.serializer32 hkdfLabel_context_serializer", "source_type": "val hkdfLabel_context_serializer32: LS.serializer32 hkdfLabel_context_serializer", "source_definition": "let hkdfLabel_context_serializer32 = LS.serialize32_bounded_vlbytes 0 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_context.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 33, "start_col": 37, "end_line": 33, "end_col": 73 }, "file_context": "module Parsers.HKDF.HkdfLabel_context\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let hkdfLabel_context_parser = LP.parse_bounded_vlbytes 0 255\n\nnoextract let hkdfLabel_context_serializer = LP.serialize_bounded_vlbytes 0 255\n\nlet hkdfLabel_context_bytesize (x:hkdfLabel_context) : GTot nat = Seq.length (hkdfLabel_context_serializer x)\n\nlet hkdfLabel_context_bytesize_eq x = ()\n\nlet hkdfLabel_context_parser32 = LS.parse32_bounded_vlbytes 0 0ul 255 255ul", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_context.fst", "checked_file": "Parsers.HKDF.HkdfLabel_context.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Bytes.serialize32_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_context_serializer32: LS.serializer32 hkdfLabel_context_serializer\nlet hkdfLabel_context_serializer32 =", "completed_definiton": "LS.serialize32_bounded_vlbytes 0 255", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_context.fst", "name": "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser", "original_source_type": "val hkdfLabel_context_parser: LP.parser hkdfLabel_context_parser_kind hkdfLabel_context", "source_type": "val hkdfLabel_context_parser: LP.parser hkdfLabel_context_parser_kind hkdfLabel_context", "source_definition": "let hkdfLabel_context_parser = LP.parse_bounded_vlbytes 0 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_context.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 23, "start_col": 41, "end_line": 23, "end_col": 71 }, "file_context": "module Parsers.HKDF.HkdfLabel_context\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_context.fst", "checked_file": "Parsers.HKDF.HkdfLabel_context.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind\n Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Bytes.parse_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_context_parser: LP.parser hkdfLabel_context_parser_kind hkdfLabel_context\nlet hkdfLabel_context_parser =", "completed_definiton": "LP.parse_bounded_vlbytes 0 255", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_context.fst", "name": "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_serializer", "original_source_type": "val hkdfLabel_context_serializer: LP.serializer hkdfLabel_context_parser", "source_type": "val hkdfLabel_context_serializer: LP.serializer hkdfLabel_context_parser", "source_definition": "let hkdfLabel_context_serializer = LP.serialize_bounded_vlbytes 0 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_context.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 25, "start_col": 45, "end_line": 25, "end_col": 79 }, "file_context": "module Parsers.HKDF.HkdfLabel_context\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let hkdfLabel_context_parser = LP.parse_bounded_vlbytes 0 255", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_context.fst", "checked_file": "Parsers.HKDF.HkdfLabel_context.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Bytes.serialize_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_context_serializer: LP.serializer hkdfLabel_context_parser\nlet hkdfLabel_context_serializer =", "completed_definiton": "LP.serialize_bounded_vlbytes 0 255", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_context.fst", "name": "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_bytesize_eqn", "original_source_type": "val hkdfLabel_context_bytesize_eqn (x: hkdfLabel_context) : Lemma (hkdfLabel_context_bytesize x == 1 + BY.length x) [SMTPat (hkdfLabel_context_bytesize x)]", "source_type": "val hkdfLabel_context_bytesize_eqn (x: hkdfLabel_context) : Lemma (hkdfLabel_context_bytesize x == 1 + BY.length x) [SMTPat (hkdfLabel_context_bytesize x)]", "source_definition": "let hkdfLabel_context_bytesize_eqn x = LP.length_serialize_bounded_vlbytes 0 255 x", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_context.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 41, "start_col": 39, "end_line": 41, "end_col": 82 }, "file_context": "module Parsers.HKDF.HkdfLabel_context\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let hkdfLabel_context_parser = LP.parse_bounded_vlbytes 0 255\n\nnoextract let hkdfLabel_context_serializer = LP.serialize_bounded_vlbytes 0 255\n\nlet hkdfLabel_context_bytesize (x:hkdfLabel_context) : GTot nat = Seq.length (hkdfLabel_context_serializer x)\n\nlet hkdfLabel_context_bytesize_eq x = ()\n\nlet hkdfLabel_context_parser32 = LS.parse32_bounded_vlbytes 0 0ul 255 255ul\n\nlet hkdfLabel_context_serializer32 = LS.serialize32_bounded_vlbytes 0 255\n\nlet hkdfLabel_context_size32 = LSZ.size32_bounded_vlbytes 0 255\n\nlet hkdfLabel_context_validator = LL.validate_bounded_vlbytes 0 255\n\nlet hkdfLabel_context_jumper = LL.jump_bounded_vlbytes 0 255", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_context.fst", "checked_file": "Parsers.HKDF.HkdfLabel_context.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.HKDF.HkdfLabel_context.hkdfLabel_context\n -> FStar.Pervasives.Lemma\n (ensures\n Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_bytesize x == 1 + FStar.Bytes.length x)\n [SMTPat (Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_bytesize x)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "LowParse.Spec.Bytes.length_serialize_bounded_vlbytes", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_context_bytesize_eqn (x: hkdfLabel_context) : Lemma (hkdfLabel_context_bytesize x == 1 + BY.length x) [SMTPat (hkdfLabel_context_bytesize x)]\nlet hkdfLabel_context_bytesize_eqn x =", "completed_definiton": "LP.length_serialize_bounded_vlbytes 0 255 x", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_context.fst", "name": "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_length", "original_source_type": "val hkdfLabel_context_length (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid hkdfLabel_context_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents hkdfLabel_context_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v pos + 1 + U32.v res == U32.v (LL.get_valid_pos hkdfLabel_context_parser h input pos) /\\\n res == BY.len x /\\\n LL.bytes_of_slice_from_to h input (pos `U32.add` 1ul) ((pos `U32.add` 1ul) `U32.add` res) == BY.reveal x\n ))", "source_type": "val hkdfLabel_context_length (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid hkdfLabel_context_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents hkdfLabel_context_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v pos + 1 + U32.v res == U32.v (LL.get_valid_pos hkdfLabel_context_parser h input pos) /\\\n res == BY.len x /\\\n LL.bytes_of_slice_from_to h input (pos `U32.add` 1ul) ((pos `U32.add` 1ul) `U32.add` res) == BY.reveal x\n ))", "source_definition": "let hkdfLabel_context_length #_ #_ input pos =\n [@inline_let] let _ = assert_norm (hkdfLabel_context == LP.parse_bounded_vlbytes_t 0 255) in\n LL.bounded_vlbytes_payload_length 0 255 input pos", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_context.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 44, "start_col": 2, "end_line": 45, "end_col": 51 }, "file_context": "module Parsers.HKDF.HkdfLabel_context\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let hkdfLabel_context_parser = LP.parse_bounded_vlbytes 0 255\n\nnoextract let hkdfLabel_context_serializer = LP.serialize_bounded_vlbytes 0 255\n\nlet hkdfLabel_context_bytesize (x:hkdfLabel_context) : GTot nat = Seq.length (hkdfLabel_context_serializer x)\n\nlet hkdfLabel_context_bytesize_eq x = ()\n\nlet hkdfLabel_context_parser32 = LS.parse32_bounded_vlbytes 0 0ul 255 255ul\n\nlet hkdfLabel_context_serializer32 = LS.serialize32_bounded_vlbytes 0 255\n\nlet hkdfLabel_context_size32 = LSZ.size32_bounded_vlbytes 0 255\n\nlet hkdfLabel_context_validator = LL.validate_bounded_vlbytes 0 255\n\nlet hkdfLabel_context_jumper = LL.jump_bounded_vlbytes 0 255\n\nlet hkdfLabel_context_bytesize_eqn x = LP.length_serialize_bounded_vlbytes 0 255 x", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_context.fst", "checked_file": "Parsers.HKDF.HkdfLabel_context.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "input: LowParse.Slice.slice rrel rel -> pos: FStar.UInt32.t\n -> FStar.HyperStack.ST.Stack FStar.UInt32.t", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "LowParse.Low.Bytes.bounded_vlbytes_payload_length", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_context_length (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid hkdfLabel_context_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents hkdfLabel_context_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v pos + 1 + U32.v res == U32.v (LL.get_valid_pos hkdfLabel_context_parser h input pos) /\\\n res == BY.len x /\\\n LL.bytes_of_slice_from_to h input (pos `U32.add` 1ul) ((pos `U32.add` 1ul) `U32.add` res) == BY.reveal x\n ))\nlet hkdfLabel_context_length #_ #_ input pos =", "completed_definiton": "[@@ inline_let ]let _ = assert_norm (hkdfLabel_context == LP.parse_bounded_vlbytes_t 0 255) in\nLL.bounded_vlbytes_payload_length 0 255 input pos", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_context.fst", "name": "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_finalize", "original_source_type": "val hkdfLabel_context_finalize (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) (len: U32.t) : HST.Stack U32.t\n\n (requires (fun h ->\n LL.live_slice h input /\\\n 0 <= U32.v len /\\ U32.v len <= 255 /\\\n U32.v pos + 1 + U32.v len <= U32.v input.LL.len /\\\n LL.writable input.LL.base (U32.v pos) (U32.v pos + 1) h\n ))\n (ensures (fun h pos' h' ->\n let pos_payload = pos `U32.add` 1ul in\n B.modifies (LL.loc_slice_from_to input pos pos_payload) h h' /\\\n LL.valid_content_pos hkdfLabel_context_parser h' input pos (BY.hide (LL.bytes_of_slice_from_to h input pos_payload (pos_payload `U32.add` len))) pos' /\\\n U32.v pos' == U32.v pos_payload + U32.v len\n ))", "source_type": "val hkdfLabel_context_finalize (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) (len: U32.t) : HST.Stack U32.t\n\n (requires (fun h ->\n LL.live_slice h input /\\\n 0 <= U32.v len /\\ U32.v len <= 255 /\\\n U32.v pos + 1 + U32.v len <= U32.v input.LL.len /\\\n LL.writable input.LL.base (U32.v pos) (U32.v pos + 1) h\n ))\n (ensures (fun h pos' h' ->\n let pos_payload = pos `U32.add` 1ul in\n B.modifies (LL.loc_slice_from_to input pos pos_payload) h h' /\\\n LL.valid_content_pos hkdfLabel_context_parser h' input pos (BY.hide (LL.bytes_of_slice_from_to h input pos_payload (pos_payload `U32.add` len))) pos' /\\\n U32.v pos' == U32.v pos_payload + U32.v len\n ))", "source_definition": "let hkdfLabel_context_finalize #_ #_ input pos len =\n [@inline_let] let _ = assert_norm (hkdfLabel_context == LP.parse_bounded_vlbytes_t 0 255) in\n LL.finalize_bounded_vlbytes 0 255 input pos len", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_context.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 48, "start_col": 2, "end_line": 49, "end_col": 49 }, "file_context": "module Parsers.HKDF.HkdfLabel_context\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let hkdfLabel_context_parser = LP.parse_bounded_vlbytes 0 255\n\nnoextract let hkdfLabel_context_serializer = LP.serialize_bounded_vlbytes 0 255\n\nlet hkdfLabel_context_bytesize (x:hkdfLabel_context) : GTot nat = Seq.length (hkdfLabel_context_serializer x)\n\nlet hkdfLabel_context_bytesize_eq x = ()\n\nlet hkdfLabel_context_parser32 = LS.parse32_bounded_vlbytes 0 0ul 255 255ul\n\nlet hkdfLabel_context_serializer32 = LS.serialize32_bounded_vlbytes 0 255\n\nlet hkdfLabel_context_size32 = LSZ.size32_bounded_vlbytes 0 255\n\nlet hkdfLabel_context_validator = LL.validate_bounded_vlbytes 0 255\n\nlet hkdfLabel_context_jumper = LL.jump_bounded_vlbytes 0 255\n\nlet hkdfLabel_context_bytesize_eqn x = LP.length_serialize_bounded_vlbytes 0 255 x\n\nlet hkdfLabel_context_length #_ #_ input pos =\n [@inline_let] let _ = assert_norm (hkdfLabel_context == LP.parse_bounded_vlbytes_t 0 255) in\n LL.bounded_vlbytes_payload_length 0 255 input pos", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_context.fst", "checked_file": "Parsers.HKDF.HkdfLabel_context.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "input: LowParse.Slice.slice rrel rel -> pos: FStar.UInt32.t -> len: FStar.UInt32.t\n -> FStar.HyperStack.ST.Stack FStar.UInt32.t", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "LowParse.Low.Bytes.finalize_bounded_vlbytes", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_context_finalize (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) (len: U32.t) : HST.Stack U32.t\n\n (requires (fun h ->\n LL.live_slice h input /\\\n 0 <= U32.v len /\\ U32.v len <= 255 /\\\n U32.v pos + 1 + U32.v len <= U32.v input.LL.len /\\\n LL.writable input.LL.base (U32.v pos) (U32.v pos + 1) h\n ))\n (ensures (fun h pos' h' ->\n let pos_payload = pos `U32.add` 1ul in\n B.modifies (LL.loc_slice_from_to input pos pos_payload) h h' /\\\n LL.valid_content_pos hkdfLabel_context_parser h' input pos (BY.hide (LL.bytes_of_slice_from_to h input pos_payload (pos_payload `U32.add` len))) pos' /\\\n U32.v pos' == U32.v pos_payload + U32.v len\n ))\nlet hkdfLabel_context_finalize #_ #_ input pos len =", "completed_definiton": "[@@ inline_let ]let _ = assert_norm (hkdfLabel_context == LP.parse_bounded_vlbytes_t 0 255) in\nLL.finalize_bounded_vlbytes 0 255 input pos len", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fsti", "name": "Parsers.NamedGroup.namedGroup_repr", "original_source_type": "", "source_type": "val namedGroup_repr : Prims.eqtype", "source_definition": "let namedGroup_repr = U16.t", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 21, "start_col": 22, "end_line": 21, "end_col": 27 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST", "dependencies": { "source_file": "Parsers.NamedGroup.fsti", "checked_file": "Parsers.NamedGroup.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.eqtype", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt16.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let namedGroup_repr =", "completed_definiton": "U16.t", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fsti", "name": "Parsers.NamedGroup.namedGroup_parser_kind", "original_source_type": "", "source_type": "val namedGroup_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let namedGroup_parser_kind = LP.strong_parser_kind 2 2 (Some LP.ParserKindMetadataTotal)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 75, "start_col": 61, "end_line": 75, "end_col": 120 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet namedGroup_repr = U16.t\ninline_for_extraction let namedGroup_repr_eq (x1 x2: namedGroup_repr) : Tot bool = (x1 = x2)\nlet known_namedGroup_repr (v:U16.t) : bool = v `namedGroup_repr_eq` 6us || (v `namedGroup_repr_eq` 7us || (v `namedGroup_repr_eq` 8us || (v `namedGroup_repr_eq` 9us || (v `namedGroup_repr_eq` 10us || (v `namedGroup_repr_eq` 11us || (v `namedGroup_repr_eq` 12us || (v `namedGroup_repr_eq` 13us || (v `namedGroup_repr_eq` 14us || (v `namedGroup_repr_eq` 20us || (v `namedGroup_repr_eq` 21us || (v `namedGroup_repr_eq` 22us || (v `namedGroup_repr_eq` 23us || (v `namedGroup_repr_eq` 24us || (v `namedGroup_repr_eq` 25us || (v `namedGroup_repr_eq` 29us || (v `namedGroup_repr_eq` 30us || (v `namedGroup_repr_eq` 256us || (v `namedGroup_repr_eq` 257us || (v `namedGroup_repr_eq` 258us || (v `namedGroup_repr_eq` 259us || (v `namedGroup_repr_eq` 260us || (false))))))))))))))))))))))\n\ntype namedGroup =\n | Sect233k1\n | Sect233r1\n | Sect239k1\n | Sect283k1\n | Sect283r1\n | Sect409k1\n | Sect409r1\n | Sect571k1\n | Sect571r1\n | Secp224k1\n | Secp224r1\n | Secp256k1\n | Secp256r1\n | Secp384r1\n | Secp521r1\n | X25519\n | X448\n | Ffdhe2048\n | Ffdhe3072\n | Ffdhe4096\n | Ffdhe6144\n | Ffdhe8192\n | Unknown_namedGroup of (v:U16.t{not (known_namedGroup_repr v)})\n\nlet string_of_namedGroup = function\n | Sect233k1 -> \"sect233k1\"\n | Sect233r1 -> \"sect233r1\"\n | Sect239k1 -> \"sect239k1\"\n | Sect283k1 -> \"sect283k1\"\n | Sect283r1 -> \"sect283r1\"\n | Sect409k1 -> \"sect409k1\"\n | Sect409r1 -> \"sect409r1\"\n | Sect571k1 -> \"sect571k1\"\n | Sect571r1 -> \"sect571r1\"\n | Secp224k1 -> \"secp224k1\"\n | Secp224r1 -> \"secp224r1\"\n | Secp256k1 -> \"secp256k1\"\n | Secp256r1 -> \"secp256r1\"\n | Secp384r1 -> \"secp384r1\"\n | Secp521r1 -> \"secp521r1\"\n | X25519 -> \"x25519\"\n | X448 -> \"x448\"\n | Ffdhe2048 -> \"ffdhe2048\"\n | Ffdhe3072 -> \"ffdhe3072\"\n | Ffdhe4096 -> \"ffdhe4096\"\n | Ffdhe6144 -> \"ffdhe6144\"\n | Ffdhe8192 -> \"ffdhe8192\"\n | Unknown_namedGroup _ -> \"Unknown_namedGroup\"", "dependencies": { "source_file": "Parsers.NamedGroup.fsti", "checked_file": "Parsers.NamedGroup.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.Some", "LowParse.Spec.Base.parser_kind_metadata_some", "LowParse.Spec.Base.ParserKindMetadataTotal" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let namedGroup_parser_kind =", "completed_definiton": "LP.strong_parser_kind 2 2 (Some LP.ParserKindMetadataTotal)", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fsti", "name": "Parsers.NamedGroup.namedGroup_repr_eq", "original_source_type": "val namedGroup_repr_eq (x1 x2: namedGroup_repr) : Tot bool", "source_type": "val namedGroup_repr_eq (x1 x2: namedGroup_repr) : Tot bool", "source_definition": "let namedGroup_repr_eq (x1 x2: namedGroup_repr) : Tot bool = (x1 = x2)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 22, "start_col": 83, "end_line": 22, "end_col": 92 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST", "dependencies": { "source_file": "Parsers.NamedGroup.fsti", "checked_file": "Parsers.NamedGroup.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x1: Parsers.NamedGroup.namedGroup_repr -> x2: Parsers.NamedGroup.namedGroup_repr -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.NamedGroup.namedGroup_repr", "Prims.op_Equality", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroup_repr_eq (x1 x2: namedGroup_repr) : Tot bool\nlet namedGroup_repr_eq (x1 x2: namedGroup_repr) : Tot bool =", "completed_definiton": "(x1 = x2)", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fsti", "name": "Parsers.NamedGroup.known_namedGroup_repr", "original_source_type": "val known_namedGroup_repr (v: U16.t) : bool", "source_type": "val known_namedGroup_repr (v: U16.t) : bool", "source_definition": "let known_namedGroup_repr (v:U16.t) : bool = v `namedGroup_repr_eq` 6us || (v `namedGroup_repr_eq` 7us || (v `namedGroup_repr_eq` 8us || (v `namedGroup_repr_eq` 9us || (v `namedGroup_repr_eq` 10us || (v `namedGroup_repr_eq` 11us || (v `namedGroup_repr_eq` 12us || (v `namedGroup_repr_eq` 13us || (v `namedGroup_repr_eq` 14us || (v `namedGroup_repr_eq` 20us || (v `namedGroup_repr_eq` 21us || (v `namedGroup_repr_eq` 22us || (v `namedGroup_repr_eq` 23us || (v `namedGroup_repr_eq` 24us || (v `namedGroup_repr_eq` 25us || (v `namedGroup_repr_eq` 29us || (v `namedGroup_repr_eq` 30us || (v `namedGroup_repr_eq` 256us || (v `namedGroup_repr_eq` 257us || (v `namedGroup_repr_eq` 258us || (v `namedGroup_repr_eq` 259us || (v `namedGroup_repr_eq` 260us || (false))))))))))))))))))))))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 23, "start_col": 45, "end_line": 23, "end_col": 777 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet namedGroup_repr = U16.t", "dependencies": { "source_file": "Parsers.NamedGroup.fsti", "checked_file": "Parsers.NamedGroup.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "v: FStar.UInt16.t -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt16.t", "Prims.op_BarBar", "Parsers.NamedGroup.namedGroup_repr_eq", "FStar.UInt16.__uint_to_t", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val known_namedGroup_repr (v: U16.t) : bool\nlet known_namedGroup_repr (v: U16.t) : bool =", "completed_definiton": "v\n`namedGroup_repr_eq`\n6us ||\n(v\n `namedGroup_repr_eq`\n 7us ||\n (v\n `namedGroup_repr_eq`\n 8us ||\n (v\n `namedGroup_repr_eq`\n 9us ||\n (v\n `namedGroup_repr_eq`\n 10us ||\n (v\n `namedGroup_repr_eq`\n 11us ||\n (v\n `namedGroup_repr_eq`\n 12us ||\n (v\n `namedGroup_repr_eq`\n 13us ||\n (v\n `namedGroup_repr_eq`\n 14us ||\n (v\n `namedGroup_repr_eq`\n 20us ||\n (v\n `namedGroup_repr_eq`\n 21us ||\n (v\n `namedGroup_repr_eq`\n 22us ||\n (v\n `namedGroup_repr_eq`\n 23us ||\n (v\n `namedGroup_repr_eq`\n 24us ||\n (v\n `namedGroup_repr_eq`\n 25us ||\n (v\n `namedGroup_repr_eq`\n 29us ||\n (v\n `namedGroup_repr_eq`\n 30us ||\n (v\n `namedGroup_repr_eq`\n 256us ||\n (v\n `namedGroup_repr_eq`\n 257us ||\n (v\n `namedGroup_repr_eq`\n 258us ||\n (v\n `namedGroup_repr_eq`\n 259us ||\n (v `namedGroup_repr_eq` 260us || (false)))))))))))))))))))))\n)", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fsti", "name": "Parsers.NamedGroup.string_of_namedGroup", "original_source_type": "", "source_type": "val string_of_namedGroup : _: Parsers.NamedGroup.namedGroup -> Prims.string", "source_definition": "let string_of_namedGroup = function\n | Sect233k1 -> \"sect233k1\"\n | Sect233r1 -> \"sect233r1\"\n | Sect239k1 -> \"sect239k1\"\n | Sect283k1 -> \"sect283k1\"\n | Sect283r1 -> \"sect283r1\"\n | Sect409k1 -> \"sect409k1\"\n | Sect409r1 -> \"sect409r1\"\n | Sect571k1 -> \"sect571k1\"\n | Sect571r1 -> \"sect571r1\"\n | Secp224k1 -> \"secp224k1\"\n | Secp224r1 -> \"secp224r1\"\n | Secp256k1 -> \"secp256k1\"\n | Secp256r1 -> \"secp256r1\"\n | Secp384r1 -> \"secp384r1\"\n | Secp521r1 -> \"secp521r1\"\n | X25519 -> \"x25519\"\n | X448 -> \"x448\"\n | Ffdhe2048 -> \"ffdhe2048\"\n | Ffdhe3072 -> \"ffdhe3072\"\n | Ffdhe4096 -> \"ffdhe4096\"\n | Ffdhe6144 -> \"ffdhe6144\"\n | Ffdhe8192 -> \"ffdhe8192\"\n | Unknown_namedGroup _ -> \"Unknown_namedGroup\"", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 50, "start_col": 27, "end_line": 73, "end_col": 48 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet namedGroup_repr = U16.t\ninline_for_extraction let namedGroup_repr_eq (x1 x2: namedGroup_repr) : Tot bool = (x1 = x2)\nlet known_namedGroup_repr (v:U16.t) : bool = v `namedGroup_repr_eq` 6us || (v `namedGroup_repr_eq` 7us || (v `namedGroup_repr_eq` 8us || (v `namedGroup_repr_eq` 9us || (v `namedGroup_repr_eq` 10us || (v `namedGroup_repr_eq` 11us || (v `namedGroup_repr_eq` 12us || (v `namedGroup_repr_eq` 13us || (v `namedGroup_repr_eq` 14us || (v `namedGroup_repr_eq` 20us || (v `namedGroup_repr_eq` 21us || (v `namedGroup_repr_eq` 22us || (v `namedGroup_repr_eq` 23us || (v `namedGroup_repr_eq` 24us || (v `namedGroup_repr_eq` 25us || (v `namedGroup_repr_eq` 29us || (v `namedGroup_repr_eq` 30us || (v `namedGroup_repr_eq` 256us || (v `namedGroup_repr_eq` 257us || (v `namedGroup_repr_eq` 258us || (v `namedGroup_repr_eq` 259us || (v `namedGroup_repr_eq` 260us || (false))))))))))))))))))))))\n\ntype namedGroup =\n | Sect233k1\n | Sect233r1\n | Sect239k1\n | Sect283k1\n | Sect283r1\n | Sect409k1\n | Sect409r1\n | Sect571k1\n | Sect571r1\n | Secp224k1\n | Secp224r1\n | Secp256k1\n | Secp256r1\n | Secp384r1\n | Secp521r1\n | X25519\n | X448\n | Ffdhe2048\n | Ffdhe3072\n | Ffdhe4096\n | Ffdhe6144\n | Ffdhe8192\n | Unknown_namedGroup of (v:U16.t{not (known_namedGroup_repr v)})", "dependencies": { "source_file": "Parsers.NamedGroup.fsti", "checked_file": "Parsers.NamedGroup.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Parsers.NamedGroup.namedGroup -> Prims.string", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.NamedGroup.namedGroup", "FStar.UInt16.t", "Prims.b2t", "Prims.op_Negation", "Parsers.NamedGroup.known_namedGroup_repr", "Prims.string" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let string_of_namedGroup =", "completed_definiton": "function\n| Sect233k1 -> \"sect233k1\"\n| Sect233r1 -> \"sect233r1\"\n| Sect239k1 -> \"sect239k1\"\n| Sect283k1 -> \"sect283k1\"\n| Sect283r1 -> \"sect283r1\"\n| Sect409k1 -> \"sect409k1\"\n| Sect409r1 -> \"sect409r1\"\n| Sect571k1 -> \"sect571k1\"\n| Sect571r1 -> \"sect571r1\"\n| Secp224k1 -> \"secp224k1\"\n| Secp224r1 -> \"secp224r1\"\n| Secp256k1 -> \"secp256k1\"\n| Secp256r1 -> \"secp256r1\"\n| Secp384r1 -> \"secp384r1\"\n| Secp521r1 -> \"secp521r1\"\n| X25519 -> \"x25519\"\n| X448 -> \"x448\"\n| Ffdhe2048 -> \"ffdhe2048\"\n| Ffdhe3072 -> \"ffdhe3072\"\n| Ffdhe4096 -> \"ffdhe4096\"\n| Ffdhe6144 -> \"ffdhe6144\"\n| Ffdhe8192 -> \"ffdhe8192\"\n| Unknown_namedGroup _ -> \"Unknown_namedGroup\"", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fsti", "name": "Parsers.NamedGroup.namedGroup_jumper", "original_source_type": "val namedGroup_jumper:LL.jumper namedGroup_parser", "source_type": "val namedGroup_jumper:LL.jumper namedGroup_parser", "source_definition": "let namedGroup_jumper: LL.jumper namedGroup_parser = LL.jump_constant_size namedGroup_parser 2ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 93, "start_col": 53, "end_line": 93, "end_col": 99 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet namedGroup_repr = U16.t\ninline_for_extraction let namedGroup_repr_eq (x1 x2: namedGroup_repr) : Tot bool = (x1 = x2)\nlet known_namedGroup_repr (v:U16.t) : bool = v `namedGroup_repr_eq` 6us || (v `namedGroup_repr_eq` 7us || (v `namedGroup_repr_eq` 8us || (v `namedGroup_repr_eq` 9us || (v `namedGroup_repr_eq` 10us || (v `namedGroup_repr_eq` 11us || (v `namedGroup_repr_eq` 12us || (v `namedGroup_repr_eq` 13us || (v `namedGroup_repr_eq` 14us || (v `namedGroup_repr_eq` 20us || (v `namedGroup_repr_eq` 21us || (v `namedGroup_repr_eq` 22us || (v `namedGroup_repr_eq` 23us || (v `namedGroup_repr_eq` 24us || (v `namedGroup_repr_eq` 25us || (v `namedGroup_repr_eq` 29us || (v `namedGroup_repr_eq` 30us || (v `namedGroup_repr_eq` 256us || (v `namedGroup_repr_eq` 257us || (v `namedGroup_repr_eq` 258us || (v `namedGroup_repr_eq` 259us || (v `namedGroup_repr_eq` 260us || (false))))))))))))))))))))))\n\ntype namedGroup =\n | Sect233k1\n | Sect233r1\n | Sect239k1\n | Sect283k1\n | Sect283r1\n | Sect409k1\n | Sect409r1\n | Sect571k1\n | Sect571r1\n | Secp224k1\n | Secp224r1\n | Secp256k1\n | Secp256r1\n | Secp384r1\n | Secp521r1\n | X25519\n | X448\n | Ffdhe2048\n | Ffdhe3072\n | Ffdhe4096\n | Ffdhe6144\n | Ffdhe8192\n | Unknown_namedGroup of (v:U16.t{not (known_namedGroup_repr v)})\n\nlet string_of_namedGroup = function\n | Sect233k1 -> \"sect233k1\"\n | Sect233r1 -> \"sect233r1\"\n | Sect239k1 -> \"sect239k1\"\n | Sect283k1 -> \"sect283k1\"\n | Sect283r1 -> \"sect283r1\"\n | Sect409k1 -> \"sect409k1\"\n | Sect409r1 -> \"sect409r1\"\n | Sect571k1 -> \"sect571k1\"\n | Sect571r1 -> \"sect571r1\"\n | Secp224k1 -> \"secp224k1\"\n | Secp224r1 -> \"secp224r1\"\n | Secp256k1 -> \"secp256k1\"\n | Secp256r1 -> \"secp256r1\"\n | Secp384r1 -> \"secp384r1\"\n | Secp521r1 -> \"secp521r1\"\n | X25519 -> \"x25519\"\n | X448 -> \"x448\"\n | Ffdhe2048 -> \"ffdhe2048\"\n | Ffdhe3072 -> \"ffdhe3072\"\n | Ffdhe4096 -> \"ffdhe4096\"\n | Ffdhe6144 -> \"ffdhe6144\"\n | Ffdhe8192 -> \"ffdhe8192\"\n | Unknown_namedGroup _ -> \"Unknown_namedGroup\"\n\ninline_for_extraction noextract let namedGroup_parser_kind = LP.strong_parser_kind 2 2 (Some LP.ParserKindMetadataTotal)\n\nnoextract val namedGroup_parser: LP.parser namedGroup_parser_kind namedGroup\n\nnoextract val namedGroup_serializer: LP.serializer namedGroup_parser\n\nnoextract val namedGroup_bytesize (x:namedGroup) : GTot nat\n\nnoextract val namedGroup_bytesize_eq (x:namedGroup) : Lemma (namedGroup_bytesize x == Seq.length (LP.serialize namedGroup_serializer x))\n\nval namedGroup_parser32: LS.parser32 namedGroup_parser\n\nval namedGroup_serializer32: LS.serializer32 namedGroup_serializer\n\nval namedGroup_size32: LSZ.size32 namedGroup_serializer\n\nlet namedGroup_validator: LL.validator namedGroup_parser = LL.validate_total_constant_size namedGroup_parser 2uL ()", "dependencies": { "source_file": "Parsers.NamedGroup.fsti", "checked_file": "Parsers.NamedGroup.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.NamedGroup.namedGroup_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.jump_constant_size", "Parsers.NamedGroup.namedGroup_parser_kind", "Parsers.NamedGroup.namedGroup", "Parsers.NamedGroup.namedGroup_parser", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroup_jumper:LL.jumper namedGroup_parser\nlet namedGroup_jumper:LL.jumper namedGroup_parser =", "completed_definiton": "LL.jump_constant_size namedGroup_parser 2ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fsti", "name": "Parsers.NamedGroup.namedGroup_validator", "original_source_type": "val namedGroup_validator:LL.validator namedGroup_parser", "source_type": "val namedGroup_validator:LL.validator namedGroup_parser", "source_definition": "let namedGroup_validator: LL.validator namedGroup_parser = LL.validate_total_constant_size namedGroup_parser 2uL ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 91, "start_col": 59, "end_line": 91, "end_col": 115 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet namedGroup_repr = U16.t\ninline_for_extraction let namedGroup_repr_eq (x1 x2: namedGroup_repr) : Tot bool = (x1 = x2)\nlet known_namedGroup_repr (v:U16.t) : bool = v `namedGroup_repr_eq` 6us || (v `namedGroup_repr_eq` 7us || (v `namedGroup_repr_eq` 8us || (v `namedGroup_repr_eq` 9us || (v `namedGroup_repr_eq` 10us || (v `namedGroup_repr_eq` 11us || (v `namedGroup_repr_eq` 12us || (v `namedGroup_repr_eq` 13us || (v `namedGroup_repr_eq` 14us || (v `namedGroup_repr_eq` 20us || (v `namedGroup_repr_eq` 21us || (v `namedGroup_repr_eq` 22us || (v `namedGroup_repr_eq` 23us || (v `namedGroup_repr_eq` 24us || (v `namedGroup_repr_eq` 25us || (v `namedGroup_repr_eq` 29us || (v `namedGroup_repr_eq` 30us || (v `namedGroup_repr_eq` 256us || (v `namedGroup_repr_eq` 257us || (v `namedGroup_repr_eq` 258us || (v `namedGroup_repr_eq` 259us || (v `namedGroup_repr_eq` 260us || (false))))))))))))))))))))))\n\ntype namedGroup =\n | Sect233k1\n | Sect233r1\n | Sect239k1\n | Sect283k1\n | Sect283r1\n | Sect409k1\n | Sect409r1\n | Sect571k1\n | Sect571r1\n | Secp224k1\n | Secp224r1\n | Secp256k1\n | Secp256r1\n | Secp384r1\n | Secp521r1\n | X25519\n | X448\n | Ffdhe2048\n | Ffdhe3072\n | Ffdhe4096\n | Ffdhe6144\n | Ffdhe8192\n | Unknown_namedGroup of (v:U16.t{not (known_namedGroup_repr v)})\n\nlet string_of_namedGroup = function\n | Sect233k1 -> \"sect233k1\"\n | Sect233r1 -> \"sect233r1\"\n | Sect239k1 -> \"sect239k1\"\n | Sect283k1 -> \"sect283k1\"\n | Sect283r1 -> \"sect283r1\"\n | Sect409k1 -> \"sect409k1\"\n | Sect409r1 -> \"sect409r1\"\n | Sect571k1 -> \"sect571k1\"\n | Sect571r1 -> \"sect571r1\"\n | Secp224k1 -> \"secp224k1\"\n | Secp224r1 -> \"secp224r1\"\n | Secp256k1 -> \"secp256k1\"\n | Secp256r1 -> \"secp256r1\"\n | Secp384r1 -> \"secp384r1\"\n | Secp521r1 -> \"secp521r1\"\n | X25519 -> \"x25519\"\n | X448 -> \"x448\"\n | Ffdhe2048 -> \"ffdhe2048\"\n | Ffdhe3072 -> \"ffdhe3072\"\n | Ffdhe4096 -> \"ffdhe4096\"\n | Ffdhe6144 -> \"ffdhe6144\"\n | Ffdhe8192 -> \"ffdhe8192\"\n | Unknown_namedGroup _ -> \"Unknown_namedGroup\"\n\ninline_for_extraction noextract let namedGroup_parser_kind = LP.strong_parser_kind 2 2 (Some LP.ParserKindMetadataTotal)\n\nnoextract val namedGroup_parser: LP.parser namedGroup_parser_kind namedGroup\n\nnoextract val namedGroup_serializer: LP.serializer namedGroup_parser\n\nnoextract val namedGroup_bytesize (x:namedGroup) : GTot nat\n\nnoextract val namedGroup_bytesize_eq (x:namedGroup) : Lemma (namedGroup_bytesize x == Seq.length (LP.serialize namedGroup_serializer x))\n\nval namedGroup_parser32: LS.parser32 namedGroup_parser\n\nval namedGroup_serializer32: LS.serializer32 namedGroup_serializer\n\nval namedGroup_size32: LSZ.size32 namedGroup_serializer", "dependencies": { "source_file": "Parsers.NamedGroup.fsti", "checked_file": "Parsers.NamedGroup.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.NamedGroup.namedGroup_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.validate_total_constant_size", "Parsers.NamedGroup.namedGroup_parser_kind", "Parsers.NamedGroup.namedGroup", "Parsers.NamedGroup.namedGroup_parser", "FStar.UInt64.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroup_validator:LL.validator namedGroup_parser\nlet namedGroup_validator:LL.validator namedGroup_parser =", "completed_definiton": "LL.validate_total_constant_size namedGroup_parser 2uL ()", "isa_cross_project_example": true }, { "file_name": "Format.UncompressedPointRepresentation.fst", "name": "Format.UncompressedPointRepresentation.ucp_of_cuv", "original_source_type": "val ucp_of_cuv (#l: _) (cuv: (constantByte 4uy * lbytes_pair l))\n : Tot (ucp : uncompressedPointRepresentation l)", "source_type": "val ucp_of_cuv (#l: _) (cuv: (constantByte 4uy * lbytes_pair l))\n : Tot (ucp : uncompressedPointRepresentation l)", "source_definition": "let ucp_of_cuv #l (cuv:constantByte 4uy * lbytes_pair l): Tot (ucp:uncompressedPointRepresentation l) = let c, uv = cuv in ucp_of_uv uv", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.UncompressedPointRepresentation.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 87, "start_col": 103, "end_line": 87, "end_col": 135 }, "file_context": "module Format.UncompressedPointRepresentation\n\nopen Format.Constants\n\nmodule B = FStar.Bytes\nmodule U32 = FStar.UInt32\nmodule LP = LowParse.SLow\n\nunfold type is_injective (#a:Type) (#b:Type) (f:a -> b) \n = forall x y . f x == f y ==> x == y\n \nunfold type is_injective_2 (#a:Type) (#b:Type) (f:a -> b) (x:a) (y:a)\n = f x == f y ==> x == y\n\n(* Types *)\n\nprivate unfold\ntype lbytes_pair (coordinate_length:coordinate_length_type) \n = B.lbytes32 coordinate_length * B.lbytes32 coordinate_length\n // = (p:(B.lbytes32 coordinate_length * B.lbytes32 coordinate_length)\n // {U32.(coordinate_length +^ coordinate_length <^ 512ul) /\\\n // U32.v coordinate_length + U32.v coordinate_length < 512 /\\\n // B.length (fst p) + B.length (snd p) < pow2 32 /\\\n // UInt.fits (B.length (fst p) + B.length (snd p)) 32})\n\n\n(* Parsers *)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser_kind (coordinate_length:coordinate_length_type)\n : LP.parser_kind\n = let l = (UInt32.v coordinate_length) in\n LP.and_then_kind \n (LP.total_constant_size_parser_kind l)\n (LP.total_constant_size_parser_kind l)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser (coordinate_length:coordinate_length_type)\n : LP.parser (lbytes_pair_parser_kind coordinate_length) (lbytes_pair coordinate_length)\n = let l = U32.v coordinate_length in\n LP.nondep_then\n (LP.parse_flbytes l)\n (LP.parse_flbytes l)\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nprivate\ninline_for_extraction\nlet lbytes_pair_parser32 (coordinate_length:coordinate_length_type)\n : LP.parser32 (lbytes_pair_parser coordinate_length) \n = [@inline_let]\n let l = UInt32.v coordinate_length in\n LP.parse32_nondep_then\n (LP.parse32_flbytes l coordinate_length)\n (LP.parse32_flbytes l coordinate_length)\n#reset-options\n\ninline_for_extraction\nlet uncompressedPointRepresentation_parser_kind (coordinate_length:coordinate_length_type) \n = LP.and_then_kind\n constantByte_parser_kind\n (lbytes_pair_parser_kind coordinate_length)\n\nprivate\ninline_for_extraction\nlet ucp_of_uv (#n:coordinate_length_type) (p:(B.lbytes32 n) * (B.lbytes32 n))\n : uncompressedPointRepresentation n\n = { legacy_form = 4uy; x = (fst p); y = (snd p) }\n\nprivate\ninline_for_extraction\nlet uv_of_ucp (#n:coordinate_length_type) (x:uncompressedPointRepresentation n)\n : Tot (B.lbytes32 n * B.lbytes32 n)\n = (x.x, x.y)\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nlet lemma_ucp_of_uv_is_injective #l\n : Lemma (is_injective (ucp_of_uv #l))\n = ()\n\nlet lemma_ucp_of_uv_of_ucp #l \n : Lemma (forall x . ucp_of_uv #l (uv_of_ucp #l x) == x)\n = lemma_ucp_of_uv_is_injective #l\n#reset-options", "dependencies": { "source_file": "Format.UncompressedPointRepresentation.fst", "checked_file": "Format.UncompressedPointRepresentation.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.Constants.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format.Constants" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "cuv: (Format.Constants.constantByte 4uy * Format.UncompressedPointRepresentation.lbytes_pair l)\n -> Format.UncompressedPointRepresentation.uncompressedPointRepresentation l", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Format.UncompressedPointRepresentation.coordinate_length_type", "FStar.Pervasives.Native.tuple2", "Format.Constants.constantByte", "FStar.UInt8.__uint_to_t", "Format.UncompressedPointRepresentation.lbytes_pair", "Format.UncompressedPointRepresentation.ucp_of_uv", "Format.UncompressedPointRepresentation.uncompressedPointRepresentation", "FStar.UInt8.uint_to_t", "FStar.UInt8.t", "FStar.Bytes.lbytes32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ucp_of_cuv (#l: _) (cuv: (constantByte 4uy * lbytes_pair l))\n : Tot (ucp : uncompressedPointRepresentation l)\nlet ucp_of_cuv #l (cuv: constantByte 4uy * lbytes_pair l)\n : Tot (ucp : uncompressedPointRepresentation l) =", "completed_definiton": "let c, uv = cuv in\nucp_of_uv uv", "isa_cross_project_example": true }, { "file_name": "Format.UncompressedPointRepresentation.fst", "name": "Format.UncompressedPointRepresentation.ucp_of_uv", "original_source_type": "val ucp_of_uv (#n: coordinate_length_type) (p: ((B.lbytes32 n) * (B.lbytes32 n)))\n : uncompressedPointRepresentation n", "source_type": "val ucp_of_uv (#n: coordinate_length_type) (p: ((B.lbytes32 n) * (B.lbytes32 n)))\n : uncompressedPointRepresentation n", "source_definition": "let ucp_of_uv (#n:coordinate_length_type) (p:(B.lbytes32 n) * (B.lbytes32 n))\n : uncompressedPointRepresentation n\n = { legacy_form = 4uy; x = (fst p); y = (snd p) }", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.UncompressedPointRepresentation.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 69, "start_col": 6, "end_line": 69, "end_col": 49 }, "file_context": "module Format.UncompressedPointRepresentation\n\nopen Format.Constants\n\nmodule B = FStar.Bytes\nmodule U32 = FStar.UInt32\nmodule LP = LowParse.SLow\n\nunfold type is_injective (#a:Type) (#b:Type) (f:a -> b) \n = forall x y . f x == f y ==> x == y\n \nunfold type is_injective_2 (#a:Type) (#b:Type) (f:a -> b) (x:a) (y:a)\n = f x == f y ==> x == y\n\n(* Types *)\n\nprivate unfold\ntype lbytes_pair (coordinate_length:coordinate_length_type) \n = B.lbytes32 coordinate_length * B.lbytes32 coordinate_length\n // = (p:(B.lbytes32 coordinate_length * B.lbytes32 coordinate_length)\n // {U32.(coordinate_length +^ coordinate_length <^ 512ul) /\\\n // U32.v coordinate_length + U32.v coordinate_length < 512 /\\\n // B.length (fst p) + B.length (snd p) < pow2 32 /\\\n // UInt.fits (B.length (fst p) + B.length (snd p)) 32})\n\n\n(* Parsers *)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser_kind (coordinate_length:coordinate_length_type)\n : LP.parser_kind\n = let l = (UInt32.v coordinate_length) in\n LP.and_then_kind \n (LP.total_constant_size_parser_kind l)\n (LP.total_constant_size_parser_kind l)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser (coordinate_length:coordinate_length_type)\n : LP.parser (lbytes_pair_parser_kind coordinate_length) (lbytes_pair coordinate_length)\n = let l = U32.v coordinate_length in\n LP.nondep_then\n (LP.parse_flbytes l)\n (LP.parse_flbytes l)\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nprivate\ninline_for_extraction\nlet lbytes_pair_parser32 (coordinate_length:coordinate_length_type)\n : LP.parser32 (lbytes_pair_parser coordinate_length) \n = [@inline_let]\n let l = UInt32.v coordinate_length in\n LP.parse32_nondep_then\n (LP.parse32_flbytes l coordinate_length)\n (LP.parse32_flbytes l coordinate_length)\n#reset-options\n\ninline_for_extraction\nlet uncompressedPointRepresentation_parser_kind (coordinate_length:coordinate_length_type) \n = LP.and_then_kind\n constantByte_parser_kind\n (lbytes_pair_parser_kind coordinate_length)\n\nprivate\ninline_for_extraction\nlet ucp_of_uv (#n:coordinate_length_type) (p:(B.lbytes32 n) * (B.lbytes32 n))", "dependencies": { "source_file": "Format.UncompressedPointRepresentation.fst", "checked_file": "Format.UncompressedPointRepresentation.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.Constants.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format.Constants" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "p: (FStar.Bytes.lbytes32 n * FStar.Bytes.lbytes32 n)\n -> Format.UncompressedPointRepresentation.uncompressedPointRepresentation n", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Format.UncompressedPointRepresentation.coordinate_length_type", "FStar.Pervasives.Native.tuple2", "FStar.Bytes.lbytes32", "Format.UncompressedPointRepresentation.MkuncompressedPointRepresentation", "FStar.UInt8.__uint_to_t", "FStar.Pervasives.Native.fst", "FStar.Pervasives.Native.snd", "Format.UncompressedPointRepresentation.uncompressedPointRepresentation" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ucp_of_uv (#n: coordinate_length_type) (p: ((B.lbytes32 n) * (B.lbytes32 n)))\n : uncompressedPointRepresentation n\nlet ucp_of_uv (#n: coordinate_length_type) (p: (B.lbytes32 n) * (B.lbytes32 n))\n : uncompressedPointRepresentation n =", "completed_definiton": "{ legacy_form = 4uy; x = (fst p); y = (snd p) }", "isa_cross_project_example": true }, { "file_name": "Format.UncompressedPointRepresentation.fst", "name": "Format.UncompressedPointRepresentation.uncompressedPointRepresentation_parser_kind", "original_source_type": "val uncompressedPointRepresentation_parser_kind (coordinate_length:coordinate_length_type): LP.parser_kind", "source_type": "val uncompressedPointRepresentation_parser_kind (coordinate_length:coordinate_length_type): LP.parser_kind", "source_definition": "let uncompressedPointRepresentation_parser_kind (coordinate_length:coordinate_length_type) \n = LP.and_then_kind\n constantByte_parser_kind\n (lbytes_pair_parser_kind coordinate_length)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.UncompressedPointRepresentation.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 61, "start_col": 4, "end_line": 63, "end_col": 49 }, "file_context": "module Format.UncompressedPointRepresentation\n\nopen Format.Constants\n\nmodule B = FStar.Bytes\nmodule U32 = FStar.UInt32\nmodule LP = LowParse.SLow\n\nunfold type is_injective (#a:Type) (#b:Type) (f:a -> b) \n = forall x y . f x == f y ==> x == y\n \nunfold type is_injective_2 (#a:Type) (#b:Type) (f:a -> b) (x:a) (y:a)\n = f x == f y ==> x == y\n\n(* Types *)\n\nprivate unfold\ntype lbytes_pair (coordinate_length:coordinate_length_type) \n = B.lbytes32 coordinate_length * B.lbytes32 coordinate_length\n // = (p:(B.lbytes32 coordinate_length * B.lbytes32 coordinate_length)\n // {U32.(coordinate_length +^ coordinate_length <^ 512ul) /\\\n // U32.v coordinate_length + U32.v coordinate_length < 512 /\\\n // B.length (fst p) + B.length (snd p) < pow2 32 /\\\n // UInt.fits (B.length (fst p) + B.length (snd p)) 32})\n\n\n(* Parsers *)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser_kind (coordinate_length:coordinate_length_type)\n : LP.parser_kind\n = let l = (UInt32.v coordinate_length) in\n LP.and_then_kind \n (LP.total_constant_size_parser_kind l)\n (LP.total_constant_size_parser_kind l)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser (coordinate_length:coordinate_length_type)\n : LP.parser (lbytes_pair_parser_kind coordinate_length) (lbytes_pair coordinate_length)\n = let l = U32.v coordinate_length in\n LP.nondep_then\n (LP.parse_flbytes l)\n (LP.parse_flbytes l)\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nprivate\ninline_for_extraction\nlet lbytes_pair_parser32 (coordinate_length:coordinate_length_type)\n : LP.parser32 (lbytes_pair_parser coordinate_length) \n = [@inline_let]\n let l = UInt32.v coordinate_length in\n LP.parse32_nondep_then\n (LP.parse32_flbytes l coordinate_length)\n (LP.parse32_flbytes l coordinate_length)\n#reset-options\n\ninline_for_extraction", "dependencies": { "source_file": "Format.UncompressedPointRepresentation.fst", "checked_file": "Format.UncompressedPointRepresentation.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.Constants.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format.Constants" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "coordinate_length: Format.UncompressedPointRepresentation.coordinate_length_type\n -> LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Format.UncompressedPointRepresentation.coordinate_length_type", "LowParse.Spec.Combinators.and_then_kind", "Format.Constants.constantByte_parser_kind", "Format.UncompressedPointRepresentation.lbytes_pair_parser_kind", "LowParse.Spec.Base.parser_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val uncompressedPointRepresentation_parser_kind (coordinate_length:coordinate_length_type): LP.parser_kind\nlet uncompressedPointRepresentation_parser_kind (coordinate_length: coordinate_length_type) =", "completed_definiton": "LP.and_then_kind constantByte_parser_kind (lbytes_pair_parser_kind coordinate_length)", "isa_cross_project_example": true }, { "file_name": "Format.UncompressedPointRepresentation.fst", "name": "Format.UncompressedPointRepresentation.uv_of_ucp", "original_source_type": "val uv_of_ucp (#n: coordinate_length_type) (x: uncompressedPointRepresentation n)\n : Tot (B.lbytes32 n * B.lbytes32 n)", "source_type": "val uv_of_ucp (#n: coordinate_length_type) (x: uncompressedPointRepresentation n)\n : Tot (B.lbytes32 n * B.lbytes32 n)", "source_definition": "let uv_of_ucp (#n:coordinate_length_type) (x:uncompressedPointRepresentation n)\n : Tot (B.lbytes32 n * B.lbytes32 n)\n = (x.x, x.y)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.UncompressedPointRepresentation.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 75, "start_col": 4, "end_line": 75, "end_col": 14 }, "file_context": "module Format.UncompressedPointRepresentation\n\nopen Format.Constants\n\nmodule B = FStar.Bytes\nmodule U32 = FStar.UInt32\nmodule LP = LowParse.SLow\n\nunfold type is_injective (#a:Type) (#b:Type) (f:a -> b) \n = forall x y . f x == f y ==> x == y\n \nunfold type is_injective_2 (#a:Type) (#b:Type) (f:a -> b) (x:a) (y:a)\n = f x == f y ==> x == y\n\n(* Types *)\n\nprivate unfold\ntype lbytes_pair (coordinate_length:coordinate_length_type) \n = B.lbytes32 coordinate_length * B.lbytes32 coordinate_length\n // = (p:(B.lbytes32 coordinate_length * B.lbytes32 coordinate_length)\n // {U32.(coordinate_length +^ coordinate_length <^ 512ul) /\\\n // U32.v coordinate_length + U32.v coordinate_length < 512 /\\\n // B.length (fst p) + B.length (snd p) < pow2 32 /\\\n // UInt.fits (B.length (fst p) + B.length (snd p)) 32})\n\n\n(* Parsers *)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser_kind (coordinate_length:coordinate_length_type)\n : LP.parser_kind\n = let l = (UInt32.v coordinate_length) in\n LP.and_then_kind \n (LP.total_constant_size_parser_kind l)\n (LP.total_constant_size_parser_kind l)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser (coordinate_length:coordinate_length_type)\n : LP.parser (lbytes_pair_parser_kind coordinate_length) (lbytes_pair coordinate_length)\n = let l = U32.v coordinate_length in\n LP.nondep_then\n (LP.parse_flbytes l)\n (LP.parse_flbytes l)\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nprivate\ninline_for_extraction\nlet lbytes_pair_parser32 (coordinate_length:coordinate_length_type)\n : LP.parser32 (lbytes_pair_parser coordinate_length) \n = [@inline_let]\n let l = UInt32.v coordinate_length in\n LP.parse32_nondep_then\n (LP.parse32_flbytes l coordinate_length)\n (LP.parse32_flbytes l coordinate_length)\n#reset-options\n\ninline_for_extraction\nlet uncompressedPointRepresentation_parser_kind (coordinate_length:coordinate_length_type) \n = LP.and_then_kind\n constantByte_parser_kind\n (lbytes_pair_parser_kind coordinate_length)\n\nprivate\ninline_for_extraction\nlet ucp_of_uv (#n:coordinate_length_type) (p:(B.lbytes32 n) * (B.lbytes32 n))\n : uncompressedPointRepresentation n\n = { legacy_form = 4uy; x = (fst p); y = (snd p) }\n\nprivate\ninline_for_extraction\nlet uv_of_ucp (#n:coordinate_length_type) (x:uncompressedPointRepresentation n)", "dependencies": { "source_file": "Format.UncompressedPointRepresentation.fst", "checked_file": "Format.UncompressedPointRepresentation.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.Constants.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format.Constants" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Format.UncompressedPointRepresentation.uncompressedPointRepresentation n\n -> FStar.Bytes.lbytes32 n * FStar.Bytes.lbytes32 n", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Format.UncompressedPointRepresentation.coordinate_length_type", "Format.UncompressedPointRepresentation.uncompressedPointRepresentation", "FStar.Pervasives.Native.Mktuple2", "FStar.Bytes.lbytes32", "Format.UncompressedPointRepresentation.__proj__MkuncompressedPointRepresentation__item__x", "Format.UncompressedPointRepresentation.__proj__MkuncompressedPointRepresentation__item__y", "FStar.Pervasives.Native.tuple2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val uv_of_ucp (#n: coordinate_length_type) (x: uncompressedPointRepresentation n)\n : Tot (B.lbytes32 n * B.lbytes32 n)\nlet uv_of_ucp (#n: coordinate_length_type) (x: uncompressedPointRepresentation n)\n : Tot (B.lbytes32 n * B.lbytes32 n) =", "completed_definiton": "(x.x, x.y)", "isa_cross_project_example": true }, { "file_name": "Format.UncompressedPointRepresentation.fst", "name": "Format.UncompressedPointRepresentation.lemma_ucp_of_uv_of_ucp", "original_source_type": "val lemma_ucp_of_uv_of_ucp (#l: _) : Lemma (forall x. ucp_of_uv #l (uv_of_ucp #l x) == x)", "source_type": "val lemma_ucp_of_uv_of_ucp (#l: _) : Lemma (forall x. ucp_of_uv #l (uv_of_ucp #l x) == x)", "source_definition": "let lemma_ucp_of_uv_of_ucp #l \n : Lemma (forall x . ucp_of_uv #l (uv_of_ucp #l x) == x)\n = lemma_ucp_of_uv_is_injective #l", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.UncompressedPointRepresentation.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 84, "start_col": 4, "end_line": 84, "end_col": 35 }, "file_context": "module Format.UncompressedPointRepresentation\n\nopen Format.Constants\n\nmodule B = FStar.Bytes\nmodule U32 = FStar.UInt32\nmodule LP = LowParse.SLow\n\nunfold type is_injective (#a:Type) (#b:Type) (f:a -> b) \n = forall x y . f x == f y ==> x == y\n \nunfold type is_injective_2 (#a:Type) (#b:Type) (f:a -> b) (x:a) (y:a)\n = f x == f y ==> x == y\n\n(* Types *)\n\nprivate unfold\ntype lbytes_pair (coordinate_length:coordinate_length_type) \n = B.lbytes32 coordinate_length * B.lbytes32 coordinate_length\n // = (p:(B.lbytes32 coordinate_length * B.lbytes32 coordinate_length)\n // {U32.(coordinate_length +^ coordinate_length <^ 512ul) /\\\n // U32.v coordinate_length + U32.v coordinate_length < 512 /\\\n // B.length (fst p) + B.length (snd p) < pow2 32 /\\\n // UInt.fits (B.length (fst p) + B.length (snd p)) 32})\n\n\n(* Parsers *)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser_kind (coordinate_length:coordinate_length_type)\n : LP.parser_kind\n = let l = (UInt32.v coordinate_length) in\n LP.and_then_kind \n (LP.total_constant_size_parser_kind l)\n (LP.total_constant_size_parser_kind l)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser (coordinate_length:coordinate_length_type)\n : LP.parser (lbytes_pair_parser_kind coordinate_length) (lbytes_pair coordinate_length)\n = let l = U32.v coordinate_length in\n LP.nondep_then\n (LP.parse_flbytes l)\n (LP.parse_flbytes l)\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nprivate\ninline_for_extraction\nlet lbytes_pair_parser32 (coordinate_length:coordinate_length_type)\n : LP.parser32 (lbytes_pair_parser coordinate_length) \n = [@inline_let]\n let l = UInt32.v coordinate_length in\n LP.parse32_nondep_then\n (LP.parse32_flbytes l coordinate_length)\n (LP.parse32_flbytes l coordinate_length)\n#reset-options\n\ninline_for_extraction\nlet uncompressedPointRepresentation_parser_kind (coordinate_length:coordinate_length_type) \n = LP.and_then_kind\n constantByte_parser_kind\n (lbytes_pair_parser_kind coordinate_length)\n\nprivate\ninline_for_extraction\nlet ucp_of_uv (#n:coordinate_length_type) (p:(B.lbytes32 n) * (B.lbytes32 n))\n : uncompressedPointRepresentation n\n = { legacy_form = 4uy; x = (fst p); y = (snd p) }\n\nprivate\ninline_for_extraction\nlet uv_of_ucp (#n:coordinate_length_type) (x:uncompressedPointRepresentation n)\n : Tot (B.lbytes32 n * B.lbytes32 n)\n = (x.x, x.y)\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nlet lemma_ucp_of_uv_is_injective #l\n : Lemma (is_injective (ucp_of_uv #l))\n = ()\n\nlet lemma_ucp_of_uv_of_ucp #l", "dependencies": { "source_file": "Format.UncompressedPointRepresentation.fst", "checked_file": "Format.UncompressedPointRepresentation.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.Constants.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format.Constants" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 16, "max_fuel": 16, "initial_ifuel": 16, "max_ifuel": 16, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "FStar.Pervasives.Lemma\n(ensures\n forall (x: Format.UncompressedPointRepresentation.uncompressedPointRepresentation l).\n Format.UncompressedPointRepresentation.ucp_of_uv (Format.UncompressedPointRepresentation.uv_of_ucp\n x) ==\n x)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Format.UncompressedPointRepresentation.coordinate_length_type", "Format.UncompressedPointRepresentation.lemma_ucp_of_uv_is_injective", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.l_Forall", "Format.UncompressedPointRepresentation.uncompressedPointRepresentation", "Prims.eq2", "Format.UncompressedPointRepresentation.ucp_of_uv", "Format.UncompressedPointRepresentation.uv_of_ucp", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_ucp_of_uv_of_ucp (#l: _) : Lemma (forall x. ucp_of_uv #l (uv_of_ucp #l x) == x)\nlet lemma_ucp_of_uv_of_ucp #l : Lemma (forall x. ucp_of_uv #l (uv_of_ucp #l x) == x) =", "completed_definiton": "lemma_ucp_of_uv_is_injective #l", "isa_cross_project_example": true }, { "file_name": "Format.UncompressedPointRepresentation.fst", "name": "Format.UncompressedPointRepresentation.lemma_ucp_of_cuv_of_ucp", "original_source_type": "val lemma_ucp_of_cuv_of_ucp (#l: _) : Lemma (forall x. ucp_of_cuv #l (cuv_of_ucp #l x) == x)", "source_type": "val lemma_ucp_of_cuv_of_ucp (#l: _) : Lemma (forall x. ucp_of_cuv #l (cuv_of_ucp #l x) == x)", "source_definition": "let lemma_ucp_of_cuv_of_ucp #l \n : Lemma (forall x . ucp_of_cuv #l (cuv_of_ucp #l x) == x)\n = lemma_ucp_of_cuv_is_injective #l", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.UncompressedPointRepresentation.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 97, "start_col": 4, "end_line": 97, "end_col": 36 }, "file_context": "module Format.UncompressedPointRepresentation\n\nopen Format.Constants\n\nmodule B = FStar.Bytes\nmodule U32 = FStar.UInt32\nmodule LP = LowParse.SLow\n\nunfold type is_injective (#a:Type) (#b:Type) (f:a -> b) \n = forall x y . f x == f y ==> x == y\n \nunfold type is_injective_2 (#a:Type) (#b:Type) (f:a -> b) (x:a) (y:a)\n = f x == f y ==> x == y\n\n(* Types *)\n\nprivate unfold\ntype lbytes_pair (coordinate_length:coordinate_length_type) \n = B.lbytes32 coordinate_length * B.lbytes32 coordinate_length\n // = (p:(B.lbytes32 coordinate_length * B.lbytes32 coordinate_length)\n // {U32.(coordinate_length +^ coordinate_length <^ 512ul) /\\\n // U32.v coordinate_length + U32.v coordinate_length < 512 /\\\n // B.length (fst p) + B.length (snd p) < pow2 32 /\\\n // UInt.fits (B.length (fst p) + B.length (snd p)) 32})\n\n\n(* Parsers *)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser_kind (coordinate_length:coordinate_length_type)\n : LP.parser_kind\n = let l = (UInt32.v coordinate_length) in\n LP.and_then_kind \n (LP.total_constant_size_parser_kind l)\n (LP.total_constant_size_parser_kind l)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser (coordinate_length:coordinate_length_type)\n : LP.parser (lbytes_pair_parser_kind coordinate_length) (lbytes_pair coordinate_length)\n = let l = U32.v coordinate_length in\n LP.nondep_then\n (LP.parse_flbytes l)\n (LP.parse_flbytes l)\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nprivate\ninline_for_extraction\nlet lbytes_pair_parser32 (coordinate_length:coordinate_length_type)\n : LP.parser32 (lbytes_pair_parser coordinate_length) \n = [@inline_let]\n let l = UInt32.v coordinate_length in\n LP.parse32_nondep_then\n (LP.parse32_flbytes l coordinate_length)\n (LP.parse32_flbytes l coordinate_length)\n#reset-options\n\ninline_for_extraction\nlet uncompressedPointRepresentation_parser_kind (coordinate_length:coordinate_length_type) \n = LP.and_then_kind\n constantByte_parser_kind\n (lbytes_pair_parser_kind coordinate_length)\n\nprivate\ninline_for_extraction\nlet ucp_of_uv (#n:coordinate_length_type) (p:(B.lbytes32 n) * (B.lbytes32 n))\n : uncompressedPointRepresentation n\n = { legacy_form = 4uy; x = (fst p); y = (snd p) }\n\nprivate\ninline_for_extraction\nlet uv_of_ucp (#n:coordinate_length_type) (x:uncompressedPointRepresentation n)\n : Tot (B.lbytes32 n * B.lbytes32 n)\n = (x.x, x.y)\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nlet lemma_ucp_of_uv_is_injective #l\n : Lemma (is_injective (ucp_of_uv #l))\n = ()\n\nlet lemma_ucp_of_uv_of_ucp #l \n : Lemma (forall x . ucp_of_uv #l (uv_of_ucp #l x) == x)\n = lemma_ucp_of_uv_is_injective #l\n#reset-options\n\nlet ucp_of_cuv #l (cuv:constantByte 4uy * lbytes_pair l): Tot (ucp:uncompressedPointRepresentation l) = let c, uv = cuv in ucp_of_uv uv\nlet cuv_of_ucp #l (ucp:uncompressedPointRepresentation l): Tot (cuv:constantByte 4uy * lbytes_pair l) = 4uy, (ucp.x, ucp.y)\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nlet lemma_ucp_of_cuv_is_injective #l\n : Lemma (is_injective (ucp_of_cuv #l))\n = ()\n\nlet lemma_ucp_of_cuv_of_ucp #l", "dependencies": { "source_file": "Format.UncompressedPointRepresentation.fst", "checked_file": "Format.UncompressedPointRepresentation.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.Constants.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format.Constants" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 16, "max_fuel": 16, "initial_ifuel": 16, "max_ifuel": 16, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "FStar.Pervasives.Lemma\n(ensures\n forall (x: Format.UncompressedPointRepresentation.uncompressedPointRepresentation l).\n Format.UncompressedPointRepresentation.ucp_of_cuv (Format.UncompressedPointRepresentation.cuv_of_ucp\n x) ==\n x)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Format.UncompressedPointRepresentation.coordinate_length_type", "Format.UncompressedPointRepresentation.lemma_ucp_of_cuv_is_injective", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.l_Forall", "Format.UncompressedPointRepresentation.uncompressedPointRepresentation", "Prims.eq2", "Format.UncompressedPointRepresentation.ucp_of_cuv", "Format.UncompressedPointRepresentation.cuv_of_ucp", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_ucp_of_cuv_of_ucp (#l: _) : Lemma (forall x. ucp_of_cuv #l (cuv_of_ucp #l x) == x)\nlet lemma_ucp_of_cuv_of_ucp #l : Lemma (forall x. ucp_of_cuv #l (cuv_of_ucp #l x) == x) =", "completed_definiton": "lemma_ucp_of_cuv_is_injective #l", "isa_cross_project_example": true }, { "file_name": "Format.UncompressedPointRepresentation.fst", "name": "Format.UncompressedPointRepresentation.lbytes_pair_parser_kind", "original_source_type": "val lbytes_pair_parser_kind (coordinate_length: coordinate_length_type) : LP.parser_kind", "source_type": "val lbytes_pair_parser_kind (coordinate_length: coordinate_length_type) : LP.parser_kind", "source_definition": "let lbytes_pair_parser_kind (coordinate_length:coordinate_length_type)\n : LP.parser_kind\n = let l = (UInt32.v coordinate_length) in\n LP.and_then_kind \n (LP.total_constant_size_parser_kind l)\n (LP.total_constant_size_parser_kind l)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.UncompressedPointRepresentation.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 33, "start_col": 3, "end_line": 36, "end_col": 44 }, "file_context": "module Format.UncompressedPointRepresentation\n\nopen Format.Constants\n\nmodule B = FStar.Bytes\nmodule U32 = FStar.UInt32\nmodule LP = LowParse.SLow\n\nunfold type is_injective (#a:Type) (#b:Type) (f:a -> b) \n = forall x y . f x == f y ==> x == y\n \nunfold type is_injective_2 (#a:Type) (#b:Type) (f:a -> b) (x:a) (y:a)\n = f x == f y ==> x == y\n\n(* Types *)\n\nprivate unfold\ntype lbytes_pair (coordinate_length:coordinate_length_type) \n = B.lbytes32 coordinate_length * B.lbytes32 coordinate_length\n // = (p:(B.lbytes32 coordinate_length * B.lbytes32 coordinate_length)\n // {U32.(coordinate_length +^ coordinate_length <^ 512ul) /\\\n // U32.v coordinate_length + U32.v coordinate_length < 512 /\\\n // B.length (fst p) + B.length (snd p) < pow2 32 /\\\n // UInt.fits (B.length (fst p) + B.length (snd p)) 32})\n\n\n(* Parsers *)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser_kind (coordinate_length:coordinate_length_type)", "dependencies": { "source_file": "Format.UncompressedPointRepresentation.fst", "checked_file": "Format.UncompressedPointRepresentation.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.Constants.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format.Constants" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "coordinate_length: Format.UncompressedPointRepresentation.coordinate_length_type\n -> LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Format.UncompressedPointRepresentation.coordinate_length_type", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Base.total_constant_size_parser_kind", "FStar.UInt.uint_t", "FStar.UInt32.v", "LowParse.Spec.Base.parser_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lbytes_pair_parser_kind (coordinate_length: coordinate_length_type) : LP.parser_kind\nlet lbytes_pair_parser_kind (coordinate_length: coordinate_length_type) : LP.parser_kind =", "completed_definiton": "let l = (UInt32.v coordinate_length) in\nLP.and_then_kind (LP.total_constant_size_parser_kind l) (LP.total_constant_size_parser_kind l)", "isa_cross_project_example": true }, { "file_name": "Format.UncompressedPointRepresentation.fst", "name": "Format.UncompressedPointRepresentation.cuv_of_ucp", "original_source_type": "val cuv_of_ucp (#l: _) (ucp: uncompressedPointRepresentation l)\n : Tot (cuv : constantByte 4uy * lbytes_pair l)", "source_type": "val cuv_of_ucp (#l: _) (ucp: uncompressedPointRepresentation l)\n : Tot (cuv : constantByte 4uy * lbytes_pair l)", "source_definition": "let cuv_of_ucp #l (ucp:uncompressedPointRepresentation l): Tot (cuv:constantByte 4uy * lbytes_pair l) = 4uy, (ucp.x, ucp.y)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.UncompressedPointRepresentation.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 88, "start_col": 104, "end_line": 88, "end_col": 123 }, "file_context": "module Format.UncompressedPointRepresentation\n\nopen Format.Constants\n\nmodule B = FStar.Bytes\nmodule U32 = FStar.UInt32\nmodule LP = LowParse.SLow\n\nunfold type is_injective (#a:Type) (#b:Type) (f:a -> b) \n = forall x y . f x == f y ==> x == y\n \nunfold type is_injective_2 (#a:Type) (#b:Type) (f:a -> b) (x:a) (y:a)\n = f x == f y ==> x == y\n\n(* Types *)\n\nprivate unfold\ntype lbytes_pair (coordinate_length:coordinate_length_type) \n = B.lbytes32 coordinate_length * B.lbytes32 coordinate_length\n // = (p:(B.lbytes32 coordinate_length * B.lbytes32 coordinate_length)\n // {U32.(coordinate_length +^ coordinate_length <^ 512ul) /\\\n // U32.v coordinate_length + U32.v coordinate_length < 512 /\\\n // B.length (fst p) + B.length (snd p) < pow2 32 /\\\n // UInt.fits (B.length (fst p) + B.length (snd p)) 32})\n\n\n(* Parsers *)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser_kind (coordinate_length:coordinate_length_type)\n : LP.parser_kind\n = let l = (UInt32.v coordinate_length) in\n LP.and_then_kind \n (LP.total_constant_size_parser_kind l)\n (LP.total_constant_size_parser_kind l)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser (coordinate_length:coordinate_length_type)\n : LP.parser (lbytes_pair_parser_kind coordinate_length) (lbytes_pair coordinate_length)\n = let l = U32.v coordinate_length in\n LP.nondep_then\n (LP.parse_flbytes l)\n (LP.parse_flbytes l)\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nprivate\ninline_for_extraction\nlet lbytes_pair_parser32 (coordinate_length:coordinate_length_type)\n : LP.parser32 (lbytes_pair_parser coordinate_length) \n = [@inline_let]\n let l = UInt32.v coordinate_length in\n LP.parse32_nondep_then\n (LP.parse32_flbytes l coordinate_length)\n (LP.parse32_flbytes l coordinate_length)\n#reset-options\n\ninline_for_extraction\nlet uncompressedPointRepresentation_parser_kind (coordinate_length:coordinate_length_type) \n = LP.and_then_kind\n constantByte_parser_kind\n (lbytes_pair_parser_kind coordinate_length)\n\nprivate\ninline_for_extraction\nlet ucp_of_uv (#n:coordinate_length_type) (p:(B.lbytes32 n) * (B.lbytes32 n))\n : uncompressedPointRepresentation n\n = { legacy_form = 4uy; x = (fst p); y = (snd p) }\n\nprivate\ninline_for_extraction\nlet uv_of_ucp (#n:coordinate_length_type) (x:uncompressedPointRepresentation n)\n : Tot (B.lbytes32 n * B.lbytes32 n)\n = (x.x, x.y)\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nlet lemma_ucp_of_uv_is_injective #l\n : Lemma (is_injective (ucp_of_uv #l))\n = ()\n\nlet lemma_ucp_of_uv_of_ucp #l \n : Lemma (forall x . ucp_of_uv #l (uv_of_ucp #l x) == x)\n = lemma_ucp_of_uv_is_injective #l\n#reset-options", "dependencies": { "source_file": "Format.UncompressedPointRepresentation.fst", "checked_file": "Format.UncompressedPointRepresentation.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.Constants.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format.Constants" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "ucp: Format.UncompressedPointRepresentation.uncompressedPointRepresentation l\n -> Format.Constants.constantByte 4uy * Format.UncompressedPointRepresentation.lbytes_pair l", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Format.UncompressedPointRepresentation.coordinate_length_type", "Format.UncompressedPointRepresentation.uncompressedPointRepresentation", "FStar.Pervasives.Native.Mktuple2", "Format.Constants.constantByte", "FStar.UInt8.__uint_to_t", "Format.UncompressedPointRepresentation.lbytes_pair", "FStar.Bytes.lbytes32", "Format.UncompressedPointRepresentation.__proj__MkuncompressedPointRepresentation__item__x", "Format.UncompressedPointRepresentation.__proj__MkuncompressedPointRepresentation__item__y", "FStar.Pervasives.Native.tuple2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val cuv_of_ucp (#l: _) (ucp: uncompressedPointRepresentation l)\n : Tot (cuv : constantByte 4uy * lbytes_pair l)\nlet cuv_of_ucp #l (ucp: uncompressedPointRepresentation l)\n : Tot (cuv : constantByte 4uy * lbytes_pair l) =", "completed_definiton": "4uy, (ucp.x, ucp.y)", "isa_cross_project_example": true }, { "file_name": "Format.UncompressedPointRepresentation.fst", "name": "Format.UncompressedPointRepresentation.uncompressedPointRepresentation_parser", "original_source_type": "val uncompressedPointRepresentation_parser (coordinate_length:coordinate_length_type)\n : LP.parser (uncompressedPointRepresentation_parser_kind coordinate_length) (uncompressedPointRepresentation coordinate_length)", "source_type": "val uncompressedPointRepresentation_parser (coordinate_length:coordinate_length_type)\n : LP.parser (uncompressedPointRepresentation_parser_kind coordinate_length) (uncompressedPointRepresentation coordinate_length)", "source_definition": "let uncompressedPointRepresentation_parser (coordinate_length:coordinate_length_type)\n : LP.parser (uncompressedPointRepresentation_parser_kind coordinate_length) (uncompressedPointRepresentation coordinate_length) \n = LP.parse_synth\n (LP.nondep_then (constantByte_parser 4uy) (lbytes_pair_parser coordinate_length))\n ucp_of_cuv", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.UncompressedPointRepresentation.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 103, "start_col": 4, "end_line": 105, "end_col": 16 }, "file_context": "module Format.UncompressedPointRepresentation\n\nopen Format.Constants\n\nmodule B = FStar.Bytes\nmodule U32 = FStar.UInt32\nmodule LP = LowParse.SLow\n\nunfold type is_injective (#a:Type) (#b:Type) (f:a -> b) \n = forall x y . f x == f y ==> x == y\n \nunfold type is_injective_2 (#a:Type) (#b:Type) (f:a -> b) (x:a) (y:a)\n = f x == f y ==> x == y\n\n(* Types *)\n\nprivate unfold\ntype lbytes_pair (coordinate_length:coordinate_length_type) \n = B.lbytes32 coordinate_length * B.lbytes32 coordinate_length\n // = (p:(B.lbytes32 coordinate_length * B.lbytes32 coordinate_length)\n // {U32.(coordinate_length +^ coordinate_length <^ 512ul) /\\\n // U32.v coordinate_length + U32.v coordinate_length < 512 /\\\n // B.length (fst p) + B.length (snd p) < pow2 32 /\\\n // UInt.fits (B.length (fst p) + B.length (snd p)) 32})\n\n\n(* Parsers *)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser_kind (coordinate_length:coordinate_length_type)\n : LP.parser_kind\n = let l = (UInt32.v coordinate_length) in\n LP.and_then_kind \n (LP.total_constant_size_parser_kind l)\n (LP.total_constant_size_parser_kind l)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser (coordinate_length:coordinate_length_type)\n : LP.parser (lbytes_pair_parser_kind coordinate_length) (lbytes_pair coordinate_length)\n = let l = U32.v coordinate_length in\n LP.nondep_then\n (LP.parse_flbytes l)\n (LP.parse_flbytes l)\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nprivate\ninline_for_extraction\nlet lbytes_pair_parser32 (coordinate_length:coordinate_length_type)\n : LP.parser32 (lbytes_pair_parser coordinate_length) \n = [@inline_let]\n let l = UInt32.v coordinate_length in\n LP.parse32_nondep_then\n (LP.parse32_flbytes l coordinate_length)\n (LP.parse32_flbytes l coordinate_length)\n#reset-options\n\ninline_for_extraction\nlet uncompressedPointRepresentation_parser_kind (coordinate_length:coordinate_length_type) \n = LP.and_then_kind\n constantByte_parser_kind\n (lbytes_pair_parser_kind coordinate_length)\n\nprivate\ninline_for_extraction\nlet ucp_of_uv (#n:coordinate_length_type) (p:(B.lbytes32 n) * (B.lbytes32 n))\n : uncompressedPointRepresentation n\n = { legacy_form = 4uy; x = (fst p); y = (snd p) }\n\nprivate\ninline_for_extraction\nlet uv_of_ucp (#n:coordinate_length_type) (x:uncompressedPointRepresentation n)\n : Tot (B.lbytes32 n * B.lbytes32 n)\n = (x.x, x.y)\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nlet lemma_ucp_of_uv_is_injective #l\n : Lemma (is_injective (ucp_of_uv #l))\n = ()\n\nlet lemma_ucp_of_uv_of_ucp #l \n : Lemma (forall x . ucp_of_uv #l (uv_of_ucp #l x) == x)\n = lemma_ucp_of_uv_is_injective #l\n#reset-options\n\nlet ucp_of_cuv #l (cuv:constantByte 4uy * lbytes_pair l): Tot (ucp:uncompressedPointRepresentation l) = let c, uv = cuv in ucp_of_uv uv\nlet cuv_of_ucp #l (ucp:uncompressedPointRepresentation l): Tot (cuv:constantByte 4uy * lbytes_pair l) = 4uy, (ucp.x, ucp.y)\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nlet lemma_ucp_of_cuv_is_injective #l\n : Lemma (is_injective (ucp_of_cuv #l))\n = ()\n\nlet lemma_ucp_of_cuv_of_ucp #l \n : Lemma (forall x . ucp_of_cuv #l (cuv_of_ucp #l x) == x)\n = lemma_ucp_of_cuv_is_injective #l\n#reset-options\n\n\nlet uncompressedPointRepresentation_parser (coordinate_length:coordinate_length_type)", "dependencies": { "source_file": "Format.UncompressedPointRepresentation.fst", "checked_file": "Format.UncompressedPointRepresentation.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.Constants.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format.Constants" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "coordinate_length: Format.UncompressedPointRepresentation.coordinate_length_type\n -> LowParse.Spec.Base.parser (Format.UncompressedPointRepresentation.uncompressedPointRepresentation_parser_kind\n coordinate_length)\n (Format.UncompressedPointRepresentation.uncompressedPointRepresentation coordinate_length)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Format.UncompressedPointRepresentation.coordinate_length_type", "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.Combinators.and_then_kind", "Format.Constants.constantByte_parser_kind", "Format.UncompressedPointRepresentation.lbytes_pair_parser_kind", "FStar.Pervasives.Native.tuple2", "Format.Constants.constantByte", "FStar.UInt8.__uint_to_t", "Format.UncompressedPointRepresentation.lbytes_pair", "Format.UncompressedPointRepresentation.uncompressedPointRepresentation", "LowParse.Spec.Combinators.nondep_then", "Format.Constants.constantByte_parser", "Format.UncompressedPointRepresentation.lbytes_pair_parser", "Format.UncompressedPointRepresentation.ucp_of_cuv", "LowParse.Spec.Base.parser", "Format.UncompressedPointRepresentation.uncompressedPointRepresentation_parser_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val uncompressedPointRepresentation_parser (coordinate_length:coordinate_length_type)\n : LP.parser (uncompressedPointRepresentation_parser_kind coordinate_length) (uncompressedPointRepresentation coordinate_length)\nlet uncompressedPointRepresentation_parser (coordinate_length: coordinate_length_type)\n : LP.parser (uncompressedPointRepresentation_parser_kind coordinate_length)\n (uncompressedPointRepresentation coordinate_length) =", "completed_definiton": "LP.parse_synth (LP.nondep_then (constantByte_parser 4uy) (lbytes_pair_parser coordinate_length))\n ucp_of_cuv", "isa_cross_project_example": true }, { "file_name": "Format.UncompressedPointRepresentation.fst", "name": "Format.UncompressedPointRepresentation.uncompressedPointRepresentation_parser32", "original_source_type": "val uncompressedPointRepresentation_parser32 (coordinate_length:coordinate_length_type) \n : LP.parser32 (uncompressedPointRepresentation_parser coordinate_length)", "source_type": "val uncompressedPointRepresentation_parser32 (coordinate_length:coordinate_length_type) \n : LP.parser32 (uncompressedPointRepresentation_parser coordinate_length)", "source_definition": "let uncompressedPointRepresentation_parser32 (coordinate_length:coordinate_length_type)\n : LP.parser32 (uncompressedPointRepresentation_parser coordinate_length)\n = LP.parse32_synth\n (LP.nondep_then (constantByte_parser 4uy) (lbytes_pair_parser coordinate_length))\n ucp_of_cuv\n (fun x -> ucp_of_cuv x)\n (LP.parse32_nondep_then (constantByte_parser32 4uy) (lbytes_pair_parser32 coordinate_length))\n ()", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.UncompressedPointRepresentation.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 110, "start_col": 4, "end_line": 115, "end_col": 8 }, "file_context": "module Format.UncompressedPointRepresentation\n\nopen Format.Constants\n\nmodule B = FStar.Bytes\nmodule U32 = FStar.UInt32\nmodule LP = LowParse.SLow\n\nunfold type is_injective (#a:Type) (#b:Type) (f:a -> b) \n = forall x y . f x == f y ==> x == y\n \nunfold type is_injective_2 (#a:Type) (#b:Type) (f:a -> b) (x:a) (y:a)\n = f x == f y ==> x == y\n\n(* Types *)\n\nprivate unfold\ntype lbytes_pair (coordinate_length:coordinate_length_type) \n = B.lbytes32 coordinate_length * B.lbytes32 coordinate_length\n // = (p:(B.lbytes32 coordinate_length * B.lbytes32 coordinate_length)\n // {U32.(coordinate_length +^ coordinate_length <^ 512ul) /\\\n // U32.v coordinate_length + U32.v coordinate_length < 512 /\\\n // B.length (fst p) + B.length (snd p) < pow2 32 /\\\n // UInt.fits (B.length (fst p) + B.length (snd p)) 32})\n\n\n(* Parsers *)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser_kind (coordinate_length:coordinate_length_type)\n : LP.parser_kind\n = let l = (UInt32.v coordinate_length) in\n LP.and_then_kind \n (LP.total_constant_size_parser_kind l)\n (LP.total_constant_size_parser_kind l)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser (coordinate_length:coordinate_length_type)\n : LP.parser (lbytes_pair_parser_kind coordinate_length) (lbytes_pair coordinate_length)\n = let l = U32.v coordinate_length in\n LP.nondep_then\n (LP.parse_flbytes l)\n (LP.parse_flbytes l)\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nprivate\ninline_for_extraction\nlet lbytes_pair_parser32 (coordinate_length:coordinate_length_type)\n : LP.parser32 (lbytes_pair_parser coordinate_length) \n = [@inline_let]\n let l = UInt32.v coordinate_length in\n LP.parse32_nondep_then\n (LP.parse32_flbytes l coordinate_length)\n (LP.parse32_flbytes l coordinate_length)\n#reset-options\n\ninline_for_extraction\nlet uncompressedPointRepresentation_parser_kind (coordinate_length:coordinate_length_type) \n = LP.and_then_kind\n constantByte_parser_kind\n (lbytes_pair_parser_kind coordinate_length)\n\nprivate\ninline_for_extraction\nlet ucp_of_uv (#n:coordinate_length_type) (p:(B.lbytes32 n) * (B.lbytes32 n))\n : uncompressedPointRepresentation n\n = { legacy_form = 4uy; x = (fst p); y = (snd p) }\n\nprivate\ninline_for_extraction\nlet uv_of_ucp (#n:coordinate_length_type) (x:uncompressedPointRepresentation n)\n : Tot (B.lbytes32 n * B.lbytes32 n)\n = (x.x, x.y)\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nlet lemma_ucp_of_uv_is_injective #l\n : Lemma (is_injective (ucp_of_uv #l))\n = ()\n\nlet lemma_ucp_of_uv_of_ucp #l \n : Lemma (forall x . ucp_of_uv #l (uv_of_ucp #l x) == x)\n = lemma_ucp_of_uv_is_injective #l\n#reset-options\n\nlet ucp_of_cuv #l (cuv:constantByte 4uy * lbytes_pair l): Tot (ucp:uncompressedPointRepresentation l) = let c, uv = cuv in ucp_of_uv uv\nlet cuv_of_ucp #l (ucp:uncompressedPointRepresentation l): Tot (cuv:constantByte 4uy * lbytes_pair l) = 4uy, (ucp.x, ucp.y)\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nlet lemma_ucp_of_cuv_is_injective #l\n : Lemma (is_injective (ucp_of_cuv #l))\n = ()\n\nlet lemma_ucp_of_cuv_of_ucp #l \n : Lemma (forall x . ucp_of_cuv #l (cuv_of_ucp #l x) == x)\n = lemma_ucp_of_cuv_is_injective #l\n#reset-options\n\n\nlet uncompressedPointRepresentation_parser (coordinate_length:coordinate_length_type)\n : LP.parser (uncompressedPointRepresentation_parser_kind coordinate_length) (uncompressedPointRepresentation coordinate_length) \n = LP.parse_synth\n (LP.nondep_then (constantByte_parser 4uy) (lbytes_pair_parser coordinate_length))\n ucp_of_cuv\n\ninline_for_extraction\nlet uncompressedPointRepresentation_parser32 (coordinate_length:coordinate_length_type)", "dependencies": { "source_file": "Format.UncompressedPointRepresentation.fst", "checked_file": "Format.UncompressedPointRepresentation.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.Constants.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format.Constants" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "coordinate_length: Format.UncompressedPointRepresentation.coordinate_length_type\n -> LowParse.SLow.Base.parser32 (Format.UncompressedPointRepresentation.uncompressedPointRepresentation_parser\n coordinate_length)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Format.UncompressedPointRepresentation.coordinate_length_type", "LowParse.SLow.Combinators.parse32_synth", "LowParse.Spec.Combinators.and_then_kind", "Format.Constants.constantByte_parser_kind", "Format.UncompressedPointRepresentation.lbytes_pair_parser_kind", "FStar.Pervasives.Native.tuple2", "Format.Constants.constantByte", "FStar.UInt8.__uint_to_t", "Format.UncompressedPointRepresentation.lbytes_pair", "Format.UncompressedPointRepresentation.uncompressedPointRepresentation", "LowParse.Spec.Combinators.nondep_then", "Format.Constants.constantByte_parser", "Format.UncompressedPointRepresentation.lbytes_pair_parser", "Format.UncompressedPointRepresentation.ucp_of_cuv", "Prims.eq2", "LowParse.SLow.Combinators.parse32_nondep_then", "Format.Constants.constantByte_parser32", "Format.UncompressedPointRepresentation.lbytes_pair_parser32", "LowParse.SLow.Base.parser32", "Format.UncompressedPointRepresentation.uncompressedPointRepresentation_parser_kind", "Format.UncompressedPointRepresentation.uncompressedPointRepresentation_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val uncompressedPointRepresentation_parser32 (coordinate_length:coordinate_length_type) \n : LP.parser32 (uncompressedPointRepresentation_parser coordinate_length)\nlet uncompressedPointRepresentation_parser32 (coordinate_length: coordinate_length_type)\n : LP.parser32 (uncompressedPointRepresentation_parser coordinate_length) =", "completed_definiton": "LP.parse32_synth (LP.nondep_then (constantByte_parser 4uy) (lbytes_pair_parser coordinate_length))\n ucp_of_cuv\n (fun x -> ucp_of_cuv x)\n (LP.parse32_nondep_then (constantByte_parser32 4uy) (lbytes_pair_parser32 coordinate_length))\n ()", "isa_cross_project_example": true }, { "file_name": "Format.UncompressedPointRepresentation.fst", "name": "Format.UncompressedPointRepresentation.lbytes_pair_parser", "original_source_type": "val lbytes_pair_parser (coordinate_length: coordinate_length_type)\n : LP.parser (lbytes_pair_parser_kind coordinate_length) (lbytes_pair coordinate_length)", "source_type": "val lbytes_pair_parser (coordinate_length: coordinate_length_type)\n : LP.parser (lbytes_pair_parser_kind coordinate_length) (lbytes_pair coordinate_length)", "source_definition": "let lbytes_pair_parser (coordinate_length:coordinate_length_type)\n : LP.parser (lbytes_pair_parser_kind coordinate_length) (lbytes_pair coordinate_length)\n = let l = U32.v coordinate_length in\n LP.nondep_then\n (LP.parse_flbytes l)\n (LP.parse_flbytes l)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.UncompressedPointRepresentation.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 42, "start_col": 3, "end_line": 45, "end_col": 26 }, "file_context": "module Format.UncompressedPointRepresentation\n\nopen Format.Constants\n\nmodule B = FStar.Bytes\nmodule U32 = FStar.UInt32\nmodule LP = LowParse.SLow\n\nunfold type is_injective (#a:Type) (#b:Type) (f:a -> b) \n = forall x y . f x == f y ==> x == y\n \nunfold type is_injective_2 (#a:Type) (#b:Type) (f:a -> b) (x:a) (y:a)\n = f x == f y ==> x == y\n\n(* Types *)\n\nprivate unfold\ntype lbytes_pair (coordinate_length:coordinate_length_type) \n = B.lbytes32 coordinate_length * B.lbytes32 coordinate_length\n // = (p:(B.lbytes32 coordinate_length * B.lbytes32 coordinate_length)\n // {U32.(coordinate_length +^ coordinate_length <^ 512ul) /\\\n // U32.v coordinate_length + U32.v coordinate_length < 512 /\\\n // B.length (fst p) + B.length (snd p) < pow2 32 /\\\n // UInt.fits (B.length (fst p) + B.length (snd p)) 32})\n\n\n(* Parsers *)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser_kind (coordinate_length:coordinate_length_type)\n : LP.parser_kind\n = let l = (UInt32.v coordinate_length) in\n LP.and_then_kind \n (LP.total_constant_size_parser_kind l)\n (LP.total_constant_size_parser_kind l)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser (coordinate_length:coordinate_length_type)", "dependencies": { "source_file": "Format.UncompressedPointRepresentation.fst", "checked_file": "Format.UncompressedPointRepresentation.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.Constants.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format.Constants" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "coordinate_length: Format.UncompressedPointRepresentation.coordinate_length_type\n -> LowParse.Spec.Base.parser (Format.UncompressedPointRepresentation.lbytes_pair_parser_kind coordinate_length\n )\n (Format.UncompressedPointRepresentation.lbytes_pair coordinate_length)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Format.UncompressedPointRepresentation.coordinate_length_type", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Base.total_constant_size_parser_kind", "FStar.Bytes.lbytes", "LowParse.Spec.Bytes.parse_flbytes", "FStar.UInt.uint_t", "FStar.UInt32.v", "LowParse.Spec.Base.parser", "Format.UncompressedPointRepresentation.lbytes_pair_parser_kind", "Format.UncompressedPointRepresentation.lbytes_pair" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lbytes_pair_parser (coordinate_length: coordinate_length_type)\n : LP.parser (lbytes_pair_parser_kind coordinate_length) (lbytes_pair coordinate_length)\nlet lbytes_pair_parser (coordinate_length: coordinate_length_type)\n : LP.parser (lbytes_pair_parser_kind coordinate_length) (lbytes_pair coordinate_length) =", "completed_definiton": "let l = U32.v coordinate_length in\nLP.nondep_then (LP.parse_flbytes l) (LP.parse_flbytes l)", "isa_cross_project_example": true }, { "file_name": "Format.UncompressedPointRepresentation.fst", "name": "Format.UncompressedPointRepresentation.lbytes_pair_parser32", "original_source_type": "val lbytes_pair_parser32 (coordinate_length: coordinate_length_type)\n : LP.parser32 (lbytes_pair_parser coordinate_length)", "source_type": "val lbytes_pair_parser32 (coordinate_length: coordinate_length_type)\n : LP.parser32 (lbytes_pair_parser coordinate_length)", "source_definition": "let lbytes_pair_parser32 (coordinate_length:coordinate_length_type)\n : LP.parser32 (lbytes_pair_parser coordinate_length) \n = [@inline_let]\n let l = UInt32.v coordinate_length in\n LP.parse32_nondep_then\n (LP.parse32_flbytes l coordinate_length)\n (LP.parse32_flbytes l coordinate_length)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.UncompressedPointRepresentation.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 52, "start_col": 4, "end_line": 56, "end_col": 46 }, "file_context": "module Format.UncompressedPointRepresentation\n\nopen Format.Constants\n\nmodule B = FStar.Bytes\nmodule U32 = FStar.UInt32\nmodule LP = LowParse.SLow\n\nunfold type is_injective (#a:Type) (#b:Type) (f:a -> b) \n = forall x y . f x == f y ==> x == y\n \nunfold type is_injective_2 (#a:Type) (#b:Type) (f:a -> b) (x:a) (y:a)\n = f x == f y ==> x == y\n\n(* Types *)\n\nprivate unfold\ntype lbytes_pair (coordinate_length:coordinate_length_type) \n = B.lbytes32 coordinate_length * B.lbytes32 coordinate_length\n // = (p:(B.lbytes32 coordinate_length * B.lbytes32 coordinate_length)\n // {U32.(coordinate_length +^ coordinate_length <^ 512ul) /\\\n // U32.v coordinate_length + U32.v coordinate_length < 512 /\\\n // B.length (fst p) + B.length (snd p) < pow2 32 /\\\n // UInt.fits (B.length (fst p) + B.length (snd p)) 32})\n\n\n(* Parsers *)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser_kind (coordinate_length:coordinate_length_type)\n : LP.parser_kind\n = let l = (UInt32.v coordinate_length) in\n LP.and_then_kind \n (LP.total_constant_size_parser_kind l)\n (LP.total_constant_size_parser_kind l)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser (coordinate_length:coordinate_length_type)\n : LP.parser (lbytes_pair_parser_kind coordinate_length) (lbytes_pair coordinate_length)\n = let l = U32.v coordinate_length in\n LP.nondep_then\n (LP.parse_flbytes l)\n (LP.parse_flbytes l)\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nprivate\ninline_for_extraction\nlet lbytes_pair_parser32 (coordinate_length:coordinate_length_type)", "dependencies": { "source_file": "Format.UncompressedPointRepresentation.fst", "checked_file": "Format.UncompressedPointRepresentation.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.Constants.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format.Constants" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 16, "max_fuel": 16, "initial_ifuel": 16, "max_ifuel": 16, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "coordinate_length: Format.UncompressedPointRepresentation.coordinate_length_type\n -> LowParse.SLow.Base.parser32 (Format.UncompressedPointRepresentation.lbytes_pair_parser coordinate_length\n )", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Format.UncompressedPointRepresentation.coordinate_length_type", "LowParse.SLow.Combinators.parse32_nondep_then", "LowParse.Spec.Base.total_constant_size_parser_kind", "FStar.Bytes.lbytes", "LowParse.Spec.Bytes.parse_flbytes", "LowParse.SLow.Bytes.parse32_flbytes", "FStar.UInt.uint_t", "FStar.UInt32.v", "LowParse.SLow.Base.parser32", "Format.UncompressedPointRepresentation.lbytes_pair_parser_kind", "Format.UncompressedPointRepresentation.lbytes_pair", "Format.UncompressedPointRepresentation.lbytes_pair_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lbytes_pair_parser32 (coordinate_length: coordinate_length_type)\n : LP.parser32 (lbytes_pair_parser coordinate_length)\nlet lbytes_pair_parser32 (coordinate_length: coordinate_length_type)\n : LP.parser32 (lbytes_pair_parser coordinate_length) =", "completed_definiton": "[@@ inline_let ]let l = UInt32.v coordinate_length in\nLP.parse32_nondep_then (LP.parse32_flbytes l coordinate_length)\n (LP.parse32_flbytes l coordinate_length)", "isa_cross_project_example": true }, { "file_name": "Format.UncompressedPointRepresentation.fst", "name": "Format.UncompressedPointRepresentation.lbytes_pair_serializer", "original_source_type": "val lbytes_pair_serializer (coordinate_length: coordinate_length_type)\n : LP.serializer (lbytes_pair_parser coordinate_length)", "source_type": "val lbytes_pair_serializer (coordinate_length: coordinate_length_type)\n : LP.serializer (lbytes_pair_parser coordinate_length)", "source_definition": "let lbytes_pair_serializer (coordinate_length:coordinate_length_type)\n : LP.serializer (lbytes_pair_parser coordinate_length) \n = let l = U32.v coordinate_length in\n let p = LP.parse_flbytes l in\n let s = LP.serialize_flbytes l in\n LP.serialize_nondep_then s s", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.UncompressedPointRepresentation.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 124, "start_col": 3, "end_line": 127, "end_col": 32 }, "file_context": "module Format.UncompressedPointRepresentation\n\nopen Format.Constants\n\nmodule B = FStar.Bytes\nmodule U32 = FStar.UInt32\nmodule LP = LowParse.SLow\n\nunfold type is_injective (#a:Type) (#b:Type) (f:a -> b) \n = forall x y . f x == f y ==> x == y\n \nunfold type is_injective_2 (#a:Type) (#b:Type) (f:a -> b) (x:a) (y:a)\n = f x == f y ==> x == y\n\n(* Types *)\n\nprivate unfold\ntype lbytes_pair (coordinate_length:coordinate_length_type) \n = B.lbytes32 coordinate_length * B.lbytes32 coordinate_length\n // = (p:(B.lbytes32 coordinate_length * B.lbytes32 coordinate_length)\n // {U32.(coordinate_length +^ coordinate_length <^ 512ul) /\\\n // U32.v coordinate_length + U32.v coordinate_length < 512 /\\\n // B.length (fst p) + B.length (snd p) < pow2 32 /\\\n // UInt.fits (B.length (fst p) + B.length (snd p)) 32})\n\n\n(* Parsers *)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser_kind (coordinate_length:coordinate_length_type)\n : LP.parser_kind\n = let l = (UInt32.v coordinate_length) in\n LP.and_then_kind \n (LP.total_constant_size_parser_kind l)\n (LP.total_constant_size_parser_kind l)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser (coordinate_length:coordinate_length_type)\n : LP.parser (lbytes_pair_parser_kind coordinate_length) (lbytes_pair coordinate_length)\n = let l = U32.v coordinate_length in\n LP.nondep_then\n (LP.parse_flbytes l)\n (LP.parse_flbytes l)\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nprivate\ninline_for_extraction\nlet lbytes_pair_parser32 (coordinate_length:coordinate_length_type)\n : LP.parser32 (lbytes_pair_parser coordinate_length) \n = [@inline_let]\n let l = UInt32.v coordinate_length in\n LP.parse32_nondep_then\n (LP.parse32_flbytes l coordinate_length)\n (LP.parse32_flbytes l coordinate_length)\n#reset-options\n\ninline_for_extraction\nlet uncompressedPointRepresentation_parser_kind (coordinate_length:coordinate_length_type) \n = LP.and_then_kind\n constantByte_parser_kind\n (lbytes_pair_parser_kind coordinate_length)\n\nprivate\ninline_for_extraction\nlet ucp_of_uv (#n:coordinate_length_type) (p:(B.lbytes32 n) * (B.lbytes32 n))\n : uncompressedPointRepresentation n\n = { legacy_form = 4uy; x = (fst p); y = (snd p) }\n\nprivate\ninline_for_extraction\nlet uv_of_ucp (#n:coordinate_length_type) (x:uncompressedPointRepresentation n)\n : Tot (B.lbytes32 n * B.lbytes32 n)\n = (x.x, x.y)\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nlet lemma_ucp_of_uv_is_injective #l\n : Lemma (is_injective (ucp_of_uv #l))\n = ()\n\nlet lemma_ucp_of_uv_of_ucp #l \n : Lemma (forall x . ucp_of_uv #l (uv_of_ucp #l x) == x)\n = lemma_ucp_of_uv_is_injective #l\n#reset-options\n\nlet ucp_of_cuv #l (cuv:constantByte 4uy * lbytes_pair l): Tot (ucp:uncompressedPointRepresentation l) = let c, uv = cuv in ucp_of_uv uv\nlet cuv_of_ucp #l (ucp:uncompressedPointRepresentation l): Tot (cuv:constantByte 4uy * lbytes_pair l) = 4uy, (ucp.x, ucp.y)\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nlet lemma_ucp_of_cuv_is_injective #l\n : Lemma (is_injective (ucp_of_cuv #l))\n = ()\n\nlet lemma_ucp_of_cuv_of_ucp #l \n : Lemma (forall x . ucp_of_cuv #l (cuv_of_ucp #l x) == x)\n = lemma_ucp_of_cuv_is_injective #l\n#reset-options\n\n\nlet uncompressedPointRepresentation_parser (coordinate_length:coordinate_length_type)\n : LP.parser (uncompressedPointRepresentation_parser_kind coordinate_length) (uncompressedPointRepresentation coordinate_length) \n = LP.parse_synth\n (LP.nondep_then (constantByte_parser 4uy) (lbytes_pair_parser coordinate_length))\n ucp_of_cuv\n\ninline_for_extraction\nlet uncompressedPointRepresentation_parser32 (coordinate_length:coordinate_length_type)\n : LP.parser32 (uncompressedPointRepresentation_parser coordinate_length)\n = LP.parse32_synth\n (LP.nondep_then (constantByte_parser 4uy) (lbytes_pair_parser coordinate_length))\n ucp_of_cuv\n (fun x -> ucp_of_cuv x)\n (LP.parse32_nondep_then (constantByte_parser32 4uy) (lbytes_pair_parser32 coordinate_length))\n ()\n\n\n(* Serializers *)\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16 --z3rlimit 10\"\nprivate\nlet lbytes_pair_serializer (coordinate_length:coordinate_length_type)", "dependencies": { "source_file": "Format.UncompressedPointRepresentation.fst", "checked_file": "Format.UncompressedPointRepresentation.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.Constants.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format.Constants" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 16, "max_fuel": 16, "initial_ifuel": 16, "max_ifuel": 16, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 10, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "coordinate_length: Format.UncompressedPointRepresentation.coordinate_length_type\n -> LowParse.Spec.Base.serializer (Format.UncompressedPointRepresentation.lbytes_pair_parser coordinate_length\n )", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Format.UncompressedPointRepresentation.coordinate_length_type", "LowParse.Spec.Combinators.serialize_nondep_then", "LowParse.Spec.Base.total_constant_size_parser_kind", "FStar.Bytes.lbytes", "LowParse.Spec.Bytes.parse_flbytes", "LowParse.Spec.Base.serializer", "LowParse.Spec.Bytes.serialize_flbytes", "LowParse.Spec.Base.parser", "FStar.UInt.uint_t", "FStar.UInt32.v", "Format.UncompressedPointRepresentation.lbytes_pair_parser_kind", "Format.UncompressedPointRepresentation.lbytes_pair", "Format.UncompressedPointRepresentation.lbytes_pair_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lbytes_pair_serializer (coordinate_length: coordinate_length_type)\n : LP.serializer (lbytes_pair_parser coordinate_length)\nlet lbytes_pair_serializer (coordinate_length: coordinate_length_type)\n : LP.serializer (lbytes_pair_parser coordinate_length) =", "completed_definiton": "let l = U32.v coordinate_length in\nlet p = LP.parse_flbytes l in\nlet s = LP.serialize_flbytes l in\nLP.serialize_nondep_then s s", "isa_cross_project_example": true }, { "file_name": "Format.UncompressedPointRepresentation.fst", "name": "Format.UncompressedPointRepresentation.uncompressedPointRepresentation_serializer", "original_source_type": "val uncompressedPointRepresentation_serializer (coordinate_length:coordinate_length_type) \n : LP.serializer (uncompressedPointRepresentation_parser coordinate_length)", "source_type": "val uncompressedPointRepresentation_serializer (coordinate_length:coordinate_length_type) \n : LP.serializer (uncompressedPointRepresentation_parser coordinate_length)", "source_definition": "let uncompressedPointRepresentation_serializer (coordinate_length:coordinate_length_type) \n : LP.serializer (uncompressedPointRepresentation_parser coordinate_length)\n = let l = coordinate_length in\n lemma_ucp_of_cuv_is_injective #l;\n lemma_ucp_of_cuv_of_ucp #l;\n LP.serialize_synth\n (LP.nondep_then (constantByte_parser 4uy) (lbytes_pair_parser l))\n ucp_of_cuv\n (LP.serialize_nondep_then \n (constantByte_serializer 4uy) \n (lbytes_pair_serializer l))\n cuv_of_ucp\n ()", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.UncompressedPointRepresentation.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 144, "start_col": 3, "end_line": 154, "end_col": 8 }, "file_context": "module Format.UncompressedPointRepresentation\n\nopen Format.Constants\n\nmodule B = FStar.Bytes\nmodule U32 = FStar.UInt32\nmodule LP = LowParse.SLow\n\nunfold type is_injective (#a:Type) (#b:Type) (f:a -> b) \n = forall x y . f x == f y ==> x == y\n \nunfold type is_injective_2 (#a:Type) (#b:Type) (f:a -> b) (x:a) (y:a)\n = f x == f y ==> x == y\n\n(* Types *)\n\nprivate unfold\ntype lbytes_pair (coordinate_length:coordinate_length_type) \n = B.lbytes32 coordinate_length * B.lbytes32 coordinate_length\n // = (p:(B.lbytes32 coordinate_length * B.lbytes32 coordinate_length)\n // {U32.(coordinate_length +^ coordinate_length <^ 512ul) /\\\n // U32.v coordinate_length + U32.v coordinate_length < 512 /\\\n // B.length (fst p) + B.length (snd p) < pow2 32 /\\\n // UInt.fits (B.length (fst p) + B.length (snd p)) 32})\n\n\n(* Parsers *)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser_kind (coordinate_length:coordinate_length_type)\n : LP.parser_kind\n = let l = (UInt32.v coordinate_length) in\n LP.and_then_kind \n (LP.total_constant_size_parser_kind l)\n (LP.total_constant_size_parser_kind l)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser (coordinate_length:coordinate_length_type)\n : LP.parser (lbytes_pair_parser_kind coordinate_length) (lbytes_pair coordinate_length)\n = let l = U32.v coordinate_length in\n LP.nondep_then\n (LP.parse_flbytes l)\n (LP.parse_flbytes l)\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nprivate\ninline_for_extraction\nlet lbytes_pair_parser32 (coordinate_length:coordinate_length_type)\n : LP.parser32 (lbytes_pair_parser coordinate_length) \n = [@inline_let]\n let l = UInt32.v coordinate_length in\n LP.parse32_nondep_then\n (LP.parse32_flbytes l coordinate_length)\n (LP.parse32_flbytes l coordinate_length)\n#reset-options\n\ninline_for_extraction\nlet uncompressedPointRepresentation_parser_kind (coordinate_length:coordinate_length_type) \n = LP.and_then_kind\n constantByte_parser_kind\n (lbytes_pair_parser_kind coordinate_length)\n\nprivate\ninline_for_extraction\nlet ucp_of_uv (#n:coordinate_length_type) (p:(B.lbytes32 n) * (B.lbytes32 n))\n : uncompressedPointRepresentation n\n = { legacy_form = 4uy; x = (fst p); y = (snd p) }\n\nprivate\ninline_for_extraction\nlet uv_of_ucp (#n:coordinate_length_type) (x:uncompressedPointRepresentation n)\n : Tot (B.lbytes32 n * B.lbytes32 n)\n = (x.x, x.y)\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nlet lemma_ucp_of_uv_is_injective #l\n : Lemma (is_injective (ucp_of_uv #l))\n = ()\n\nlet lemma_ucp_of_uv_of_ucp #l \n : Lemma (forall x . ucp_of_uv #l (uv_of_ucp #l x) == x)\n = lemma_ucp_of_uv_is_injective #l\n#reset-options\n\nlet ucp_of_cuv #l (cuv:constantByte 4uy * lbytes_pair l): Tot (ucp:uncompressedPointRepresentation l) = let c, uv = cuv in ucp_of_uv uv\nlet cuv_of_ucp #l (ucp:uncompressedPointRepresentation l): Tot (cuv:constantByte 4uy * lbytes_pair l) = 4uy, (ucp.x, ucp.y)\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nlet lemma_ucp_of_cuv_is_injective #l\n : Lemma (is_injective (ucp_of_cuv #l))\n = ()\n\nlet lemma_ucp_of_cuv_of_ucp #l \n : Lemma (forall x . ucp_of_cuv #l (cuv_of_ucp #l x) == x)\n = lemma_ucp_of_cuv_is_injective #l\n#reset-options\n\n\nlet uncompressedPointRepresentation_parser (coordinate_length:coordinate_length_type)\n : LP.parser (uncompressedPointRepresentation_parser_kind coordinate_length) (uncompressedPointRepresentation coordinate_length) \n = LP.parse_synth\n (LP.nondep_then (constantByte_parser 4uy) (lbytes_pair_parser coordinate_length))\n ucp_of_cuv\n\ninline_for_extraction\nlet uncompressedPointRepresentation_parser32 (coordinate_length:coordinate_length_type)\n : LP.parser32 (uncompressedPointRepresentation_parser coordinate_length)\n = LP.parse32_synth\n (LP.nondep_then (constantByte_parser 4uy) (lbytes_pair_parser coordinate_length))\n ucp_of_cuv\n (fun x -> ucp_of_cuv x)\n (LP.parse32_nondep_then (constantByte_parser32 4uy) (lbytes_pair_parser32 coordinate_length))\n ()\n\n\n(* Serializers *)\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16 --z3rlimit 10\"\nprivate\nlet lbytes_pair_serializer (coordinate_length:coordinate_length_type)\n : LP.serializer (lbytes_pair_parser coordinate_length) \n = let l = U32.v coordinate_length in\n let p = LP.parse_flbytes l in\n let s = LP.serialize_flbytes l in\n LP.serialize_nondep_then s s\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16 --z3rlimit 10\"\nprivate\ninline_for_extraction\nlet lbytes_pair_serializer32 (coordinate_length:coordinate_length_type)\n : LP.serializer32 (lbytes_pair_serializer coordinate_length) \n = [@inline_let]\n let l = U32.v coordinate_length in\n LP.serialize32_nondep_then\n (LP.serialize32_flbytes l)\n (LP.serialize32_flbytes l)\n#reset-options\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics'\"\nlet uncompressedPointRepresentation_serializer (coordinate_length:coordinate_length_type)", "dependencies": { "source_file": "Format.UncompressedPointRepresentation.fst", "checked_file": "Format.UncompressedPointRepresentation.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.Constants.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format.Constants" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "coordinate_length: Format.UncompressedPointRepresentation.coordinate_length_type\n -> LowParse.Spec.Base.serializer (Format.UncompressedPointRepresentation.uncompressedPointRepresentation_parser\n coordinate_length)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Format.UncompressedPointRepresentation.coordinate_length_type", "LowParse.Spec.Combinators.serialize_synth", "LowParse.Spec.Combinators.and_then_kind", "Format.Constants.constantByte_parser_kind", "Format.UncompressedPointRepresentation.lbytes_pair_parser_kind", "FStar.Pervasives.Native.tuple2", "Format.Constants.constantByte", "FStar.UInt8.__uint_to_t", "Format.UncompressedPointRepresentation.lbytes_pair", "Format.UncompressedPointRepresentation.uncompressedPointRepresentation", "LowParse.Spec.Combinators.nondep_then", "Format.Constants.constantByte_parser", "Format.UncompressedPointRepresentation.lbytes_pair_parser", "Format.UncompressedPointRepresentation.ucp_of_cuv", "LowParse.Spec.Combinators.serialize_nondep_then", "Format.Constants.constantByte_serializer", "Format.UncompressedPointRepresentation.lbytes_pair_serializer", "Format.UncompressedPointRepresentation.cuv_of_ucp", "Prims.unit", "Format.UncompressedPointRepresentation.lemma_ucp_of_cuv_of_ucp", "Format.UncompressedPointRepresentation.lemma_ucp_of_cuv_is_injective", "LowParse.Spec.Base.serializer", "Format.UncompressedPointRepresentation.uncompressedPointRepresentation_parser_kind", "Format.UncompressedPointRepresentation.uncompressedPointRepresentation_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val uncompressedPointRepresentation_serializer (coordinate_length:coordinate_length_type) \n : LP.serializer (uncompressedPointRepresentation_parser coordinate_length)\nlet uncompressedPointRepresentation_serializer (coordinate_length: coordinate_length_type)\n : LP.serializer (uncompressedPointRepresentation_parser coordinate_length) =", "completed_definiton": "let l = coordinate_length in\nlemma_ucp_of_cuv_is_injective #l;\nlemma_ucp_of_cuv_of_ucp #l;\nLP.serialize_synth (LP.nondep_then (constantByte_parser 4uy) (lbytes_pair_parser l))\n ucp_of_cuv\n (LP.serialize_nondep_then (constantByte_serializer 4uy) (lbytes_pair_serializer l))\n cuv_of_ucp\n ()", "isa_cross_project_example": true }, { "file_name": "Format.UncompressedPointRepresentation.fst", "name": "Format.UncompressedPointRepresentation.lbytes_pair_serializer32", "original_source_type": "val lbytes_pair_serializer32 (coordinate_length: coordinate_length_type)\n : LP.serializer32 (lbytes_pair_serializer coordinate_length)", "source_type": "val lbytes_pair_serializer32 (coordinate_length: coordinate_length_type)\n : LP.serializer32 (lbytes_pair_serializer coordinate_length)", "source_definition": "let lbytes_pair_serializer32 (coordinate_length:coordinate_length_type)\n : LP.serializer32 (lbytes_pair_serializer coordinate_length) \n = [@inline_let]\n let l = U32.v coordinate_length in\n LP.serialize32_nondep_then\n (LP.serialize32_flbytes l)\n (LP.serialize32_flbytes l)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.UncompressedPointRepresentation.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 134, "start_col": 4, "end_line": 138, "end_col": 32 }, "file_context": "module Format.UncompressedPointRepresentation\n\nopen Format.Constants\n\nmodule B = FStar.Bytes\nmodule U32 = FStar.UInt32\nmodule LP = LowParse.SLow\n\nunfold type is_injective (#a:Type) (#b:Type) (f:a -> b) \n = forall x y . f x == f y ==> x == y\n \nunfold type is_injective_2 (#a:Type) (#b:Type) (f:a -> b) (x:a) (y:a)\n = f x == f y ==> x == y\n\n(* Types *)\n\nprivate unfold\ntype lbytes_pair (coordinate_length:coordinate_length_type) \n = B.lbytes32 coordinate_length * B.lbytes32 coordinate_length\n // = (p:(B.lbytes32 coordinate_length * B.lbytes32 coordinate_length)\n // {U32.(coordinate_length +^ coordinate_length <^ 512ul) /\\\n // U32.v coordinate_length + U32.v coordinate_length < 512 /\\\n // B.length (fst p) + B.length (snd p) < pow2 32 /\\\n // UInt.fits (B.length (fst p) + B.length (snd p)) 32})\n\n\n(* Parsers *)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser_kind (coordinate_length:coordinate_length_type)\n : LP.parser_kind\n = let l = (UInt32.v coordinate_length) in\n LP.and_then_kind \n (LP.total_constant_size_parser_kind l)\n (LP.total_constant_size_parser_kind l)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser (coordinate_length:coordinate_length_type)\n : LP.parser (lbytes_pair_parser_kind coordinate_length) (lbytes_pair coordinate_length)\n = let l = U32.v coordinate_length in\n LP.nondep_then\n (LP.parse_flbytes l)\n (LP.parse_flbytes l)\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nprivate\ninline_for_extraction\nlet lbytes_pair_parser32 (coordinate_length:coordinate_length_type)\n : LP.parser32 (lbytes_pair_parser coordinate_length) \n = [@inline_let]\n let l = UInt32.v coordinate_length in\n LP.parse32_nondep_then\n (LP.parse32_flbytes l coordinate_length)\n (LP.parse32_flbytes l coordinate_length)\n#reset-options\n\ninline_for_extraction\nlet uncompressedPointRepresentation_parser_kind (coordinate_length:coordinate_length_type) \n = LP.and_then_kind\n constantByte_parser_kind\n (lbytes_pair_parser_kind coordinate_length)\n\nprivate\ninline_for_extraction\nlet ucp_of_uv (#n:coordinate_length_type) (p:(B.lbytes32 n) * (B.lbytes32 n))\n : uncompressedPointRepresentation n\n = { legacy_form = 4uy; x = (fst p); y = (snd p) }\n\nprivate\ninline_for_extraction\nlet uv_of_ucp (#n:coordinate_length_type) (x:uncompressedPointRepresentation n)\n : Tot (B.lbytes32 n * B.lbytes32 n)\n = (x.x, x.y)\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nlet lemma_ucp_of_uv_is_injective #l\n : Lemma (is_injective (ucp_of_uv #l))\n = ()\n\nlet lemma_ucp_of_uv_of_ucp #l \n : Lemma (forall x . ucp_of_uv #l (uv_of_ucp #l x) == x)\n = lemma_ucp_of_uv_is_injective #l\n#reset-options\n\nlet ucp_of_cuv #l (cuv:constantByte 4uy * lbytes_pair l): Tot (ucp:uncompressedPointRepresentation l) = let c, uv = cuv in ucp_of_uv uv\nlet cuv_of_ucp #l (ucp:uncompressedPointRepresentation l): Tot (cuv:constantByte 4uy * lbytes_pair l) = 4uy, (ucp.x, ucp.y)\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nlet lemma_ucp_of_cuv_is_injective #l\n : Lemma (is_injective (ucp_of_cuv #l))\n = ()\n\nlet lemma_ucp_of_cuv_of_ucp #l \n : Lemma (forall x . ucp_of_cuv #l (cuv_of_ucp #l x) == x)\n = lemma_ucp_of_cuv_is_injective #l\n#reset-options\n\n\nlet uncompressedPointRepresentation_parser (coordinate_length:coordinate_length_type)\n : LP.parser (uncompressedPointRepresentation_parser_kind coordinate_length) (uncompressedPointRepresentation coordinate_length) \n = LP.parse_synth\n (LP.nondep_then (constantByte_parser 4uy) (lbytes_pair_parser coordinate_length))\n ucp_of_cuv\n\ninline_for_extraction\nlet uncompressedPointRepresentation_parser32 (coordinate_length:coordinate_length_type)\n : LP.parser32 (uncompressedPointRepresentation_parser coordinate_length)\n = LP.parse32_synth\n (LP.nondep_then (constantByte_parser 4uy) (lbytes_pair_parser coordinate_length))\n ucp_of_cuv\n (fun x -> ucp_of_cuv x)\n (LP.parse32_nondep_then (constantByte_parser32 4uy) (lbytes_pair_parser32 coordinate_length))\n ()\n\n\n(* Serializers *)\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16 --z3rlimit 10\"\nprivate\nlet lbytes_pair_serializer (coordinate_length:coordinate_length_type)\n : LP.serializer (lbytes_pair_parser coordinate_length) \n = let l = U32.v coordinate_length in\n let p = LP.parse_flbytes l in\n let s = LP.serialize_flbytes l in\n LP.serialize_nondep_then s s\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16 --z3rlimit 10\"\nprivate\ninline_for_extraction\nlet lbytes_pair_serializer32 (coordinate_length:coordinate_length_type)", "dependencies": { "source_file": "Format.UncompressedPointRepresentation.fst", "checked_file": "Format.UncompressedPointRepresentation.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.Constants.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format.Constants" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 16, "max_fuel": 16, "initial_ifuel": 16, "max_ifuel": 16, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 10, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "coordinate_length: Format.UncompressedPointRepresentation.coordinate_length_type\n -> LowParse.SLow.Base.serializer32 (Format.UncompressedPointRepresentation.lbytes_pair_serializer coordinate_length\n )", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Format.UncompressedPointRepresentation.coordinate_length_type", "LowParse.SLow.Combinators.serialize32_nondep_then", "LowParse.Spec.Base.total_constant_size_parser_kind", "FStar.Bytes.lbytes", "LowParse.Spec.Bytes.parse_flbytes", "LowParse.Spec.Bytes.serialize_flbytes", "LowParse.SLow.Bytes.serialize32_flbytes", "FStar.UInt.uint_t", "FStar.UInt32.v", "LowParse.SLow.Base.serializer32", "Format.UncompressedPointRepresentation.lbytes_pair_parser_kind", "Format.UncompressedPointRepresentation.lbytes_pair", "Format.UncompressedPointRepresentation.lbytes_pair_parser", "Format.UncompressedPointRepresentation.lbytes_pair_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lbytes_pair_serializer32 (coordinate_length: coordinate_length_type)\n : LP.serializer32 (lbytes_pair_serializer coordinate_length)\nlet lbytes_pair_serializer32 (coordinate_length: coordinate_length_type)\n : LP.serializer32 (lbytes_pair_serializer coordinate_length) =", "completed_definiton": "[@@ inline_let ]let l = U32.v coordinate_length in\nLP.serialize32_nondep_then (LP.serialize32_flbytes l) (LP.serialize32_flbytes l)", "isa_cross_project_example": true }, { "file_name": "Format.UncompressedPointRepresentation.fst", "name": "Format.UncompressedPointRepresentation.uncompressedPointRepresentation_serializer32", "original_source_type": "val uncompressedPointRepresentation_serializer32 (coordinate_length:coordinate_length_type) \n : LP.serializer32 (uncompressedPointRepresentation_serializer coordinate_length)", "source_type": "val uncompressedPointRepresentation_serializer32 (coordinate_length:coordinate_length_type) \n : LP.serializer32 (uncompressedPointRepresentation_serializer coordinate_length)", "source_definition": "let uncompressedPointRepresentation_serializer32 (coordinate_length:coordinate_length_type) \n : LP.serializer32 (uncompressedPointRepresentation_serializer coordinate_length)\n = [@inline_let]\n let l = coordinate_length in\n lemma_ucp_of_cuv_is_injective #l;\n lemma_ucp_of_cuv_of_ucp #l;\n LP.serialize32_synth \n (LP.nondep_then (constantByte_parser 4uy) (lbytes_pair_parser l)) \n ucp_of_cuv\n (LP.serialize_nondep_then (constantByte_serializer 4uy)\n (lbytes_pair_serializer l))\n (LP.serialize32_nondep_then (constantByte_serializer32 4uy)\n (lbytes_pair_serializer32 l))\n cuv_of_ucp\n (fun x -> cuv_of_ucp x)\n ()", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.UncompressedPointRepresentation.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 159, "start_col": 4, "end_line": 172, "end_col": 8 }, "file_context": "module Format.UncompressedPointRepresentation\n\nopen Format.Constants\n\nmodule B = FStar.Bytes\nmodule U32 = FStar.UInt32\nmodule LP = LowParse.SLow\n\nunfold type is_injective (#a:Type) (#b:Type) (f:a -> b) \n = forall x y . f x == f y ==> x == y\n \nunfold type is_injective_2 (#a:Type) (#b:Type) (f:a -> b) (x:a) (y:a)\n = f x == f y ==> x == y\n\n(* Types *)\n\nprivate unfold\ntype lbytes_pair (coordinate_length:coordinate_length_type) \n = B.lbytes32 coordinate_length * B.lbytes32 coordinate_length\n // = (p:(B.lbytes32 coordinate_length * B.lbytes32 coordinate_length)\n // {U32.(coordinate_length +^ coordinate_length <^ 512ul) /\\\n // U32.v coordinate_length + U32.v coordinate_length < 512 /\\\n // B.length (fst p) + B.length (snd p) < pow2 32 /\\\n // UInt.fits (B.length (fst p) + B.length (snd p)) 32})\n\n\n(* Parsers *)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser_kind (coordinate_length:coordinate_length_type)\n : LP.parser_kind\n = let l = (UInt32.v coordinate_length) in\n LP.and_then_kind \n (LP.total_constant_size_parser_kind l)\n (LP.total_constant_size_parser_kind l)\n\nprivate\ninline_for_extraction\nlet lbytes_pair_parser (coordinate_length:coordinate_length_type)\n : LP.parser (lbytes_pair_parser_kind coordinate_length) (lbytes_pair coordinate_length)\n = let l = U32.v coordinate_length in\n LP.nondep_then\n (LP.parse_flbytes l)\n (LP.parse_flbytes l)\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nprivate\ninline_for_extraction\nlet lbytes_pair_parser32 (coordinate_length:coordinate_length_type)\n : LP.parser32 (lbytes_pair_parser coordinate_length) \n = [@inline_let]\n let l = UInt32.v coordinate_length in\n LP.parse32_nondep_then\n (LP.parse32_flbytes l coordinate_length)\n (LP.parse32_flbytes l coordinate_length)\n#reset-options\n\ninline_for_extraction\nlet uncompressedPointRepresentation_parser_kind (coordinate_length:coordinate_length_type) \n = LP.and_then_kind\n constantByte_parser_kind\n (lbytes_pair_parser_kind coordinate_length)\n\nprivate\ninline_for_extraction\nlet ucp_of_uv (#n:coordinate_length_type) (p:(B.lbytes32 n) * (B.lbytes32 n))\n : uncompressedPointRepresentation n\n = { legacy_form = 4uy; x = (fst p); y = (snd p) }\n\nprivate\ninline_for_extraction\nlet uv_of_ucp (#n:coordinate_length_type) (x:uncompressedPointRepresentation n)\n : Tot (B.lbytes32 n * B.lbytes32 n)\n = (x.x, x.y)\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nlet lemma_ucp_of_uv_is_injective #l\n : Lemma (is_injective (ucp_of_uv #l))\n = ()\n\nlet lemma_ucp_of_uv_of_ucp #l \n : Lemma (forall x . ucp_of_uv #l (uv_of_ucp #l x) == x)\n = lemma_ucp_of_uv_is_injective #l\n#reset-options\n\nlet ucp_of_cuv #l (cuv:constantByte 4uy * lbytes_pair l): Tot (ucp:uncompressedPointRepresentation l) = let c, uv = cuv in ucp_of_uv uv\nlet cuv_of_ucp #l (ucp:uncompressedPointRepresentation l): Tot (cuv:constantByte 4uy * lbytes_pair l) = 4uy, (ucp.x, ucp.y)\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16\"\nlet lemma_ucp_of_cuv_is_injective #l\n : Lemma (is_injective (ucp_of_cuv #l))\n = ()\n\nlet lemma_ucp_of_cuv_of_ucp #l \n : Lemma (forall x . ucp_of_cuv #l (cuv_of_ucp #l x) == x)\n = lemma_ucp_of_cuv_is_injective #l\n#reset-options\n\n\nlet uncompressedPointRepresentation_parser (coordinate_length:coordinate_length_type)\n : LP.parser (uncompressedPointRepresentation_parser_kind coordinate_length) (uncompressedPointRepresentation coordinate_length) \n = LP.parse_synth\n (LP.nondep_then (constantByte_parser 4uy) (lbytes_pair_parser coordinate_length))\n ucp_of_cuv\n\ninline_for_extraction\nlet uncompressedPointRepresentation_parser32 (coordinate_length:coordinate_length_type)\n : LP.parser32 (uncompressedPointRepresentation_parser coordinate_length)\n = LP.parse32_synth\n (LP.nondep_then (constantByte_parser 4uy) (lbytes_pair_parser coordinate_length))\n ucp_of_cuv\n (fun x -> ucp_of_cuv x)\n (LP.parse32_nondep_then (constantByte_parser32 4uy) (lbytes_pair_parser32 coordinate_length))\n ()\n\n\n(* Serializers *)\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16 --z3rlimit 10\"\nprivate\nlet lbytes_pair_serializer (coordinate_length:coordinate_length_type)\n : LP.serializer (lbytes_pair_parser coordinate_length) \n = let l = U32.v coordinate_length in\n let p = LP.parse_flbytes l in\n let s = LP.serialize_flbytes l in\n LP.serialize_nondep_then s s\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics' --max_fuel 16 --initial_fuel 16 --max_ifuel 16 --initial_ifuel 16 --z3rlimit 10\"\nprivate\ninline_for_extraction\nlet lbytes_pair_serializer32 (coordinate_length:coordinate_length_type)\n : LP.serializer32 (lbytes_pair_serializer coordinate_length) \n = [@inline_let]\n let l = U32.v coordinate_length in\n LP.serialize32_nondep_then\n (LP.serialize32_flbytes l)\n (LP.serialize32_flbytes l)\n#reset-options\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics'\"\nlet uncompressedPointRepresentation_serializer (coordinate_length:coordinate_length_type) \n : LP.serializer (uncompressedPointRepresentation_parser coordinate_length)\n = let l = coordinate_length in\n lemma_ucp_of_cuv_is_injective #l;\n lemma_ucp_of_cuv_of_ucp #l;\n LP.serialize_synth\n (LP.nondep_then (constantByte_parser 4uy) (lbytes_pair_parser l))\n ucp_of_cuv\n (LP.serialize_nondep_then \n (constantByte_serializer 4uy) \n (lbytes_pair_serializer l))\n cuv_of_ucp\n ()\n\ninline_for_extraction\nlet uncompressedPointRepresentation_serializer32 (coordinate_length:coordinate_length_type)", "dependencies": { "source_file": "Format.UncompressedPointRepresentation.fst", "checked_file": "Format.UncompressedPointRepresentation.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.Constants.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format.Constants" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "coordinate_length: Format.UncompressedPointRepresentation.coordinate_length_type\n -> LowParse.SLow.Base.serializer32 (Format.UncompressedPointRepresentation.uncompressedPointRepresentation_serializer\n coordinate_length)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Format.UncompressedPointRepresentation.coordinate_length_type", "LowParse.SLow.Combinators.serialize32_synth", "LowParse.Spec.Combinators.and_then_kind", "Format.Constants.constantByte_parser_kind", "Format.UncompressedPointRepresentation.lbytes_pair_parser_kind", "FStar.Pervasives.Native.tuple2", "Format.Constants.constantByte", "FStar.UInt8.__uint_to_t", "Format.UncompressedPointRepresentation.lbytes_pair", "Format.UncompressedPointRepresentation.uncompressedPointRepresentation", "LowParse.Spec.Combinators.nondep_then", "Format.Constants.constantByte_parser", "Format.UncompressedPointRepresentation.lbytes_pair_parser", "Format.UncompressedPointRepresentation.ucp_of_cuv", "LowParse.Spec.Combinators.serialize_nondep_then", "Format.Constants.constantByte_serializer", "Format.UncompressedPointRepresentation.lbytes_pair_serializer", "LowParse.SLow.Combinators.serialize32_nondep_then", "Format.Constants.constantByte_serializer32", "Format.UncompressedPointRepresentation.lbytes_pair_serializer32", "Format.UncompressedPointRepresentation.cuv_of_ucp", "Prims.eq2", "Prims.unit", "Format.UncompressedPointRepresentation.lemma_ucp_of_cuv_of_ucp", "Format.UncompressedPointRepresentation.lemma_ucp_of_cuv_is_injective", "LowParse.SLow.Base.serializer32", "Format.UncompressedPointRepresentation.uncompressedPointRepresentation_parser_kind", "Format.UncompressedPointRepresentation.uncompressedPointRepresentation_parser", "Format.UncompressedPointRepresentation.uncompressedPointRepresentation_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val uncompressedPointRepresentation_serializer32 (coordinate_length:coordinate_length_type) \n : LP.serializer32 (uncompressedPointRepresentation_serializer coordinate_length)\nlet uncompressedPointRepresentation_serializer32 (coordinate_length: coordinate_length_type)\n : LP.serializer32 (uncompressedPointRepresentation_serializer coordinate_length) =", "completed_definiton": "[@@ inline_let ]let l = coordinate_length in\nlemma_ucp_of_cuv_is_injective #l;\nlemma_ucp_of_cuv_of_ucp #l;\nLP.serialize32_synth (LP.nondep_then (constantByte_parser 4uy) (lbytes_pair_parser l))\n ucp_of_cuv\n (LP.serialize_nondep_then (constantByte_serializer 4uy) (lbytes_pair_serializer l))\n (LP.serialize32_nondep_then (constantByte_serializer32 4uy) (lbytes_pair_serializer32 l))\n cuv_of_ucp\n (fun x -> cuv_of_ucp x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fsti", "name": "Parsers.SignatureScheme.signatureScheme_repr", "original_source_type": "", "source_type": "val signatureScheme_repr : Prims.eqtype", "source_definition": "let signatureScheme_repr = U16.t", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 21, "start_col": 27, "end_line": 21, "end_col": 32 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST", "dependencies": { "source_file": "Parsers.SignatureScheme.fsti", "checked_file": "Parsers.SignatureScheme.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.eqtype", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt16.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let signatureScheme_repr =", "completed_definiton": "U16.t", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fsti", "name": "Parsers.SignatureScheme.signatureScheme_parser_kind", "original_source_type": "", "source_type": "val signatureScheme_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let signatureScheme_parser_kind = LP.strong_parser_kind 2 2 (Some LP.ParserKindMetadataTotal)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 67, "start_col": 66, "end_line": 67, "end_col": 125 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet signatureScheme_repr = U16.t\ninline_for_extraction let signatureScheme_repr_eq (x1 x2: signatureScheme_repr) : Tot bool = (x1 = x2)\nlet known_signatureScheme_repr (v:U16.t) : bool = v `signatureScheme_repr_eq` 257us || (v `signatureScheme_repr_eq` 513us || (v `signatureScheme_repr_eq` 259us || (v `signatureScheme_repr_eq` 515us || (v `signatureScheme_repr_eq` 1025us || (v `signatureScheme_repr_eq` 1281us || (v `signatureScheme_repr_eq` 1537us || (v `signatureScheme_repr_eq` 1027us || (v `signatureScheme_repr_eq` 1283us || (v `signatureScheme_repr_eq` 1539us || (v `signatureScheme_repr_eq` 2052us || (v `signatureScheme_repr_eq` 2053us || (v `signatureScheme_repr_eq` 2054us || (v `signatureScheme_repr_eq` 2055us || (v `signatureScheme_repr_eq` 2056us || (v `signatureScheme_repr_eq` 2057us || (v `signatureScheme_repr_eq` 2058us || (v `signatureScheme_repr_eq` 2059us || (false))))))))))))))))))\n\ntype signatureScheme =\n | Rsa_pkcs1_md5\n | Rsa_pkcs1_sha1\n | Ecdsa_md5\n | Ecdsa_sha1\n | Rsa_pkcs1_sha256\n | Rsa_pkcs1_sha384\n | Rsa_pkcs1_sha512\n | Ecdsa_secp256r1_sha256\n | Ecdsa_secp384r1_sha384\n | Ecdsa_secp521r1_sha512\n | Rsa_pss_rsae_sha256\n | Rsa_pss_rsae_sha384\n | Rsa_pss_rsae_sha512\n | Ed25519\n | Ed448\n | Rsa_pss_pss_sha256\n | Rsa_pss_pss_sha384\n | Rsa_pss_pss_sha512\n | Unknown_signatureScheme of (v:U16.t{not (known_signatureScheme_repr v)})\n\nlet string_of_signatureScheme = function\n | Rsa_pkcs1_md5 -> \"rsa_pkcs1_md5\"\n | Rsa_pkcs1_sha1 -> \"rsa_pkcs1_sha1\"\n | Ecdsa_md5 -> \"ecdsa_md5\"\n | Ecdsa_sha1 -> \"ecdsa_sha1\"\n | Rsa_pkcs1_sha256 -> \"rsa_pkcs1_sha256\"\n | Rsa_pkcs1_sha384 -> \"rsa_pkcs1_sha384\"\n | Rsa_pkcs1_sha512 -> \"rsa_pkcs1_sha512\"\n | Ecdsa_secp256r1_sha256 -> \"ecdsa_secp256r1_sha256\"\n | Ecdsa_secp384r1_sha384 -> \"ecdsa_secp384r1_sha384\"\n | Ecdsa_secp521r1_sha512 -> \"ecdsa_secp521r1_sha512\"\n | Rsa_pss_rsae_sha256 -> \"rsa_pss_rsae_sha256\"\n | Rsa_pss_rsae_sha384 -> \"rsa_pss_rsae_sha384\"\n | Rsa_pss_rsae_sha512 -> \"rsa_pss_rsae_sha512\"\n | Ed25519 -> \"ed25519\"\n | Ed448 -> \"ed448\"\n | Rsa_pss_pss_sha256 -> \"rsa_pss_pss_sha256\"\n | Rsa_pss_pss_sha384 -> \"rsa_pss_pss_sha384\"\n | Rsa_pss_pss_sha512 -> \"rsa_pss_pss_sha512\"\n | Unknown_signatureScheme _ -> \"Unknown_signatureScheme\"", "dependencies": { "source_file": "Parsers.SignatureScheme.fsti", "checked_file": "Parsers.SignatureScheme.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.Some", "LowParse.Spec.Base.parser_kind_metadata_some", "LowParse.Spec.Base.ParserKindMetadataTotal" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let signatureScheme_parser_kind =", "completed_definiton": "LP.strong_parser_kind 2 2 (Some LP.ParserKindMetadataTotal)", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fsti", "name": "Parsers.SignatureScheme.signatureScheme_repr_eq", "original_source_type": "val signatureScheme_repr_eq (x1 x2: signatureScheme_repr) : Tot bool", "source_type": "val signatureScheme_repr_eq (x1 x2: signatureScheme_repr) : Tot bool", "source_definition": "let signatureScheme_repr_eq (x1 x2: signatureScheme_repr) : Tot bool = (x1 = x2)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 22, "start_col": 93, "end_line": 22, "end_col": 102 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST", "dependencies": { "source_file": "Parsers.SignatureScheme.fsti", "checked_file": "Parsers.SignatureScheme.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x1: Parsers.SignatureScheme.signatureScheme_repr -> x2: Parsers.SignatureScheme.signatureScheme_repr\n -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.SignatureScheme.signatureScheme_repr", "Prims.op_Equality", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureScheme_repr_eq (x1 x2: signatureScheme_repr) : Tot bool\nlet signatureScheme_repr_eq (x1 x2: signatureScheme_repr) : Tot bool =", "completed_definiton": "(x1 = x2)", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fsti", "name": "Parsers.SignatureScheme.known_signatureScheme_repr", "original_source_type": "val known_signatureScheme_repr (v: U16.t) : bool", "source_type": "val known_signatureScheme_repr (v: U16.t) : bool", "source_definition": "let known_signatureScheme_repr (v:U16.t) : bool = v `signatureScheme_repr_eq` 257us || (v `signatureScheme_repr_eq` 513us || (v `signatureScheme_repr_eq` 259us || (v `signatureScheme_repr_eq` 515us || (v `signatureScheme_repr_eq` 1025us || (v `signatureScheme_repr_eq` 1281us || (v `signatureScheme_repr_eq` 1537us || (v `signatureScheme_repr_eq` 1027us || (v `signatureScheme_repr_eq` 1283us || (v `signatureScheme_repr_eq` 1539us || (v `signatureScheme_repr_eq` 2052us || (v `signatureScheme_repr_eq` 2053us || (v `signatureScheme_repr_eq` 2054us || (v `signatureScheme_repr_eq` 2055us || (v `signatureScheme_repr_eq` 2056us || (v `signatureScheme_repr_eq` 2057us || (v `signatureScheme_repr_eq` 2058us || (v `signatureScheme_repr_eq` 2059us || (false))))))))))))))))))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 23, "start_col": 50, "end_line": 23, "end_col": 771 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet signatureScheme_repr = U16.t", "dependencies": { "source_file": "Parsers.SignatureScheme.fsti", "checked_file": "Parsers.SignatureScheme.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "v: FStar.UInt16.t -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt16.t", "Prims.op_BarBar", "Parsers.SignatureScheme.signatureScheme_repr_eq", "FStar.UInt16.__uint_to_t", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val known_signatureScheme_repr (v: U16.t) : bool\nlet known_signatureScheme_repr (v: U16.t) : bool =", "completed_definiton": "v\n`signatureScheme_repr_eq`\n257us ||\n(v\n `signatureScheme_repr_eq`\n 513us ||\n (v\n `signatureScheme_repr_eq`\n 259us ||\n (v\n `signatureScheme_repr_eq`\n 515us ||\n (v\n `signatureScheme_repr_eq`\n 1025us ||\n (v\n `signatureScheme_repr_eq`\n 1281us ||\n (v\n `signatureScheme_repr_eq`\n 1537us ||\n (v\n `signatureScheme_repr_eq`\n 1027us ||\n (v\n `signatureScheme_repr_eq`\n 1283us ||\n (v\n `signatureScheme_repr_eq`\n 1539us ||\n (v\n `signatureScheme_repr_eq`\n 2052us ||\n (v\n `signatureScheme_repr_eq`\n 2053us ||\n (v\n `signatureScheme_repr_eq`\n 2054us ||\n (v\n `signatureScheme_repr_eq`\n 2055us ||\n (v\n `signatureScheme_repr_eq`\n 2056us ||\n (v\n `signatureScheme_repr_eq`\n 2057us ||\n (v\n `signatureScheme_repr_eq`\n 2058us ||\n (v `signatureScheme_repr_eq` 2059us || (false))))))))))))))))))", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fsti", "name": "Parsers.SignatureScheme.string_of_signatureScheme", "original_source_type": "", "source_type": "val string_of_signatureScheme : _: Parsers.SignatureScheme.signatureScheme -> Prims.string", "source_definition": "let string_of_signatureScheme = function\n | Rsa_pkcs1_md5 -> \"rsa_pkcs1_md5\"\n | Rsa_pkcs1_sha1 -> \"rsa_pkcs1_sha1\"\n | Ecdsa_md5 -> \"ecdsa_md5\"\n | Ecdsa_sha1 -> \"ecdsa_sha1\"\n | Rsa_pkcs1_sha256 -> \"rsa_pkcs1_sha256\"\n | Rsa_pkcs1_sha384 -> \"rsa_pkcs1_sha384\"\n | Rsa_pkcs1_sha512 -> \"rsa_pkcs1_sha512\"\n | Ecdsa_secp256r1_sha256 -> \"ecdsa_secp256r1_sha256\"\n | Ecdsa_secp384r1_sha384 -> \"ecdsa_secp384r1_sha384\"\n | Ecdsa_secp521r1_sha512 -> \"ecdsa_secp521r1_sha512\"\n | Rsa_pss_rsae_sha256 -> \"rsa_pss_rsae_sha256\"\n | Rsa_pss_rsae_sha384 -> \"rsa_pss_rsae_sha384\"\n | Rsa_pss_rsae_sha512 -> \"rsa_pss_rsae_sha512\"\n | Ed25519 -> \"ed25519\"\n | Ed448 -> \"ed448\"\n | Rsa_pss_pss_sha256 -> \"rsa_pss_pss_sha256\"\n | Rsa_pss_pss_sha384 -> \"rsa_pss_pss_sha384\"\n | Rsa_pss_pss_sha512 -> \"rsa_pss_pss_sha512\"\n | Unknown_signatureScheme _ -> \"Unknown_signatureScheme\"", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 46, "start_col": 32, "end_line": 65, "end_col": 58 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet signatureScheme_repr = U16.t\ninline_for_extraction let signatureScheme_repr_eq (x1 x2: signatureScheme_repr) : Tot bool = (x1 = x2)\nlet known_signatureScheme_repr (v:U16.t) : bool = v `signatureScheme_repr_eq` 257us || (v `signatureScheme_repr_eq` 513us || (v `signatureScheme_repr_eq` 259us || (v `signatureScheme_repr_eq` 515us || (v `signatureScheme_repr_eq` 1025us || (v `signatureScheme_repr_eq` 1281us || (v `signatureScheme_repr_eq` 1537us || (v `signatureScheme_repr_eq` 1027us || (v `signatureScheme_repr_eq` 1283us || (v `signatureScheme_repr_eq` 1539us || (v `signatureScheme_repr_eq` 2052us || (v `signatureScheme_repr_eq` 2053us || (v `signatureScheme_repr_eq` 2054us || (v `signatureScheme_repr_eq` 2055us || (v `signatureScheme_repr_eq` 2056us || (v `signatureScheme_repr_eq` 2057us || (v `signatureScheme_repr_eq` 2058us || (v `signatureScheme_repr_eq` 2059us || (false))))))))))))))))))\n\ntype signatureScheme =\n | Rsa_pkcs1_md5\n | Rsa_pkcs1_sha1\n | Ecdsa_md5\n | Ecdsa_sha1\n | Rsa_pkcs1_sha256\n | Rsa_pkcs1_sha384\n | Rsa_pkcs1_sha512\n | Ecdsa_secp256r1_sha256\n | Ecdsa_secp384r1_sha384\n | Ecdsa_secp521r1_sha512\n | Rsa_pss_rsae_sha256\n | Rsa_pss_rsae_sha384\n | Rsa_pss_rsae_sha512\n | Ed25519\n | Ed448\n | Rsa_pss_pss_sha256\n | Rsa_pss_pss_sha384\n | Rsa_pss_pss_sha512\n | Unknown_signatureScheme of (v:U16.t{not (known_signatureScheme_repr v)})", "dependencies": { "source_file": "Parsers.SignatureScheme.fsti", "checked_file": "Parsers.SignatureScheme.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Parsers.SignatureScheme.signatureScheme -> Prims.string", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.SignatureScheme.signatureScheme", "FStar.UInt16.t", "Prims.b2t", "Prims.op_Negation", "Parsers.SignatureScheme.known_signatureScheme_repr", "Prims.string" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let string_of_signatureScheme =", "completed_definiton": "function\n| Rsa_pkcs1_md5 -> \"rsa_pkcs1_md5\"\n| Rsa_pkcs1_sha1 -> \"rsa_pkcs1_sha1\"\n| Ecdsa_md5 -> \"ecdsa_md5\"\n| Ecdsa_sha1 -> \"ecdsa_sha1\"\n| Rsa_pkcs1_sha256 -> \"rsa_pkcs1_sha256\"\n| Rsa_pkcs1_sha384 -> \"rsa_pkcs1_sha384\"\n| Rsa_pkcs1_sha512 -> \"rsa_pkcs1_sha512\"\n| Ecdsa_secp256r1_sha256 -> \"ecdsa_secp256r1_sha256\"\n| Ecdsa_secp384r1_sha384 -> \"ecdsa_secp384r1_sha384\"\n| Ecdsa_secp521r1_sha512 -> \"ecdsa_secp521r1_sha512\"\n| Rsa_pss_rsae_sha256 -> \"rsa_pss_rsae_sha256\"\n| Rsa_pss_rsae_sha384 -> \"rsa_pss_rsae_sha384\"\n| Rsa_pss_rsae_sha512 -> \"rsa_pss_rsae_sha512\"\n| Ed25519 -> \"ed25519\"\n| Ed448 -> \"ed448\"\n| Rsa_pss_pss_sha256 -> \"rsa_pss_pss_sha256\"\n| Rsa_pss_pss_sha384 -> \"rsa_pss_pss_sha384\"\n| Rsa_pss_pss_sha512 -> \"rsa_pss_pss_sha512\"\n| Unknown_signatureScheme _ -> \"Unknown_signatureScheme\"", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fsti", "name": "Parsers.SignatureScheme.signatureScheme_validator", "original_source_type": "val signatureScheme_validator:LL.validator signatureScheme_parser", "source_type": "val signatureScheme_validator:LL.validator signatureScheme_parser", "source_definition": "let signatureScheme_validator: LL.validator signatureScheme_parser = LL.validate_total_constant_size signatureScheme_parser 2uL ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 83, "start_col": 69, "end_line": 83, "end_col": 130 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet signatureScheme_repr = U16.t\ninline_for_extraction let signatureScheme_repr_eq (x1 x2: signatureScheme_repr) : Tot bool = (x1 = x2)\nlet known_signatureScheme_repr (v:U16.t) : bool = v `signatureScheme_repr_eq` 257us || (v `signatureScheme_repr_eq` 513us || (v `signatureScheme_repr_eq` 259us || (v `signatureScheme_repr_eq` 515us || (v `signatureScheme_repr_eq` 1025us || (v `signatureScheme_repr_eq` 1281us || (v `signatureScheme_repr_eq` 1537us || (v `signatureScheme_repr_eq` 1027us || (v `signatureScheme_repr_eq` 1283us || (v `signatureScheme_repr_eq` 1539us || (v `signatureScheme_repr_eq` 2052us || (v `signatureScheme_repr_eq` 2053us || (v `signatureScheme_repr_eq` 2054us || (v `signatureScheme_repr_eq` 2055us || (v `signatureScheme_repr_eq` 2056us || (v `signatureScheme_repr_eq` 2057us || (v `signatureScheme_repr_eq` 2058us || (v `signatureScheme_repr_eq` 2059us || (false))))))))))))))))))\n\ntype signatureScheme =\n | Rsa_pkcs1_md5\n | Rsa_pkcs1_sha1\n | Ecdsa_md5\n | Ecdsa_sha1\n | Rsa_pkcs1_sha256\n | Rsa_pkcs1_sha384\n | Rsa_pkcs1_sha512\n | Ecdsa_secp256r1_sha256\n | Ecdsa_secp384r1_sha384\n | Ecdsa_secp521r1_sha512\n | Rsa_pss_rsae_sha256\n | Rsa_pss_rsae_sha384\n | Rsa_pss_rsae_sha512\n | Ed25519\n | Ed448\n | Rsa_pss_pss_sha256\n | Rsa_pss_pss_sha384\n | Rsa_pss_pss_sha512\n | Unknown_signatureScheme of (v:U16.t{not (known_signatureScheme_repr v)})\n\nlet string_of_signatureScheme = function\n | Rsa_pkcs1_md5 -> \"rsa_pkcs1_md5\"\n | Rsa_pkcs1_sha1 -> \"rsa_pkcs1_sha1\"\n | Ecdsa_md5 -> \"ecdsa_md5\"\n | Ecdsa_sha1 -> \"ecdsa_sha1\"\n | Rsa_pkcs1_sha256 -> \"rsa_pkcs1_sha256\"\n | Rsa_pkcs1_sha384 -> \"rsa_pkcs1_sha384\"\n | Rsa_pkcs1_sha512 -> \"rsa_pkcs1_sha512\"\n | Ecdsa_secp256r1_sha256 -> \"ecdsa_secp256r1_sha256\"\n | Ecdsa_secp384r1_sha384 -> \"ecdsa_secp384r1_sha384\"\n | Ecdsa_secp521r1_sha512 -> \"ecdsa_secp521r1_sha512\"\n | Rsa_pss_rsae_sha256 -> \"rsa_pss_rsae_sha256\"\n | Rsa_pss_rsae_sha384 -> \"rsa_pss_rsae_sha384\"\n | Rsa_pss_rsae_sha512 -> \"rsa_pss_rsae_sha512\"\n | Ed25519 -> \"ed25519\"\n | Ed448 -> \"ed448\"\n | Rsa_pss_pss_sha256 -> \"rsa_pss_pss_sha256\"\n | Rsa_pss_pss_sha384 -> \"rsa_pss_pss_sha384\"\n | Rsa_pss_pss_sha512 -> \"rsa_pss_pss_sha512\"\n | Unknown_signatureScheme _ -> \"Unknown_signatureScheme\"\n\ninline_for_extraction noextract let signatureScheme_parser_kind = LP.strong_parser_kind 2 2 (Some LP.ParserKindMetadataTotal)\n\nnoextract val signatureScheme_parser: LP.parser signatureScheme_parser_kind signatureScheme\n\nnoextract val signatureScheme_serializer: LP.serializer signatureScheme_parser\n\nnoextract val signatureScheme_bytesize (x:signatureScheme) : GTot nat\n\nnoextract val signatureScheme_bytesize_eq (x:signatureScheme) : Lemma (signatureScheme_bytesize x == Seq.length (LP.serialize signatureScheme_serializer x))\n\nval signatureScheme_parser32: LS.parser32 signatureScheme_parser\n\nval signatureScheme_serializer32: LS.serializer32 signatureScheme_serializer\n\nval signatureScheme_size32: LSZ.size32 signatureScheme_serializer", "dependencies": { "source_file": "Parsers.SignatureScheme.fsti", "checked_file": "Parsers.SignatureScheme.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.SignatureScheme.signatureScheme_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.validate_total_constant_size", "Parsers.SignatureScheme.signatureScheme_parser_kind", "Parsers.SignatureScheme.signatureScheme", "Parsers.SignatureScheme.signatureScheme_parser", "FStar.UInt64.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureScheme_validator:LL.validator signatureScheme_parser\nlet signatureScheme_validator:LL.validator signatureScheme_parser =", "completed_definiton": "LL.validate_total_constant_size signatureScheme_parser 2uL ()", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fsti", "name": "Parsers.SignatureScheme.signatureScheme_jumper", "original_source_type": "val signatureScheme_jumper:LL.jumper signatureScheme_parser", "source_type": "val signatureScheme_jumper:LL.jumper signatureScheme_parser", "source_definition": "let signatureScheme_jumper: LL.jumper signatureScheme_parser = LL.jump_constant_size signatureScheme_parser 2ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 85, "start_col": 63, "end_line": 85, "end_col": 114 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet signatureScheme_repr = U16.t\ninline_for_extraction let signatureScheme_repr_eq (x1 x2: signatureScheme_repr) : Tot bool = (x1 = x2)\nlet known_signatureScheme_repr (v:U16.t) : bool = v `signatureScheme_repr_eq` 257us || (v `signatureScheme_repr_eq` 513us || (v `signatureScheme_repr_eq` 259us || (v `signatureScheme_repr_eq` 515us || (v `signatureScheme_repr_eq` 1025us || (v `signatureScheme_repr_eq` 1281us || (v `signatureScheme_repr_eq` 1537us || (v `signatureScheme_repr_eq` 1027us || (v `signatureScheme_repr_eq` 1283us || (v `signatureScheme_repr_eq` 1539us || (v `signatureScheme_repr_eq` 2052us || (v `signatureScheme_repr_eq` 2053us || (v `signatureScheme_repr_eq` 2054us || (v `signatureScheme_repr_eq` 2055us || (v `signatureScheme_repr_eq` 2056us || (v `signatureScheme_repr_eq` 2057us || (v `signatureScheme_repr_eq` 2058us || (v `signatureScheme_repr_eq` 2059us || (false))))))))))))))))))\n\ntype signatureScheme =\n | Rsa_pkcs1_md5\n | Rsa_pkcs1_sha1\n | Ecdsa_md5\n | Ecdsa_sha1\n | Rsa_pkcs1_sha256\n | Rsa_pkcs1_sha384\n | Rsa_pkcs1_sha512\n | Ecdsa_secp256r1_sha256\n | Ecdsa_secp384r1_sha384\n | Ecdsa_secp521r1_sha512\n | Rsa_pss_rsae_sha256\n | Rsa_pss_rsae_sha384\n | Rsa_pss_rsae_sha512\n | Ed25519\n | Ed448\n | Rsa_pss_pss_sha256\n | Rsa_pss_pss_sha384\n | Rsa_pss_pss_sha512\n | Unknown_signatureScheme of (v:U16.t{not (known_signatureScheme_repr v)})\n\nlet string_of_signatureScheme = function\n | Rsa_pkcs1_md5 -> \"rsa_pkcs1_md5\"\n | Rsa_pkcs1_sha1 -> \"rsa_pkcs1_sha1\"\n | Ecdsa_md5 -> \"ecdsa_md5\"\n | Ecdsa_sha1 -> \"ecdsa_sha1\"\n | Rsa_pkcs1_sha256 -> \"rsa_pkcs1_sha256\"\n | Rsa_pkcs1_sha384 -> \"rsa_pkcs1_sha384\"\n | Rsa_pkcs1_sha512 -> \"rsa_pkcs1_sha512\"\n | Ecdsa_secp256r1_sha256 -> \"ecdsa_secp256r1_sha256\"\n | Ecdsa_secp384r1_sha384 -> \"ecdsa_secp384r1_sha384\"\n | Ecdsa_secp521r1_sha512 -> \"ecdsa_secp521r1_sha512\"\n | Rsa_pss_rsae_sha256 -> \"rsa_pss_rsae_sha256\"\n | Rsa_pss_rsae_sha384 -> \"rsa_pss_rsae_sha384\"\n | Rsa_pss_rsae_sha512 -> \"rsa_pss_rsae_sha512\"\n | Ed25519 -> \"ed25519\"\n | Ed448 -> \"ed448\"\n | Rsa_pss_pss_sha256 -> \"rsa_pss_pss_sha256\"\n | Rsa_pss_pss_sha384 -> \"rsa_pss_pss_sha384\"\n | Rsa_pss_pss_sha512 -> \"rsa_pss_pss_sha512\"\n | Unknown_signatureScheme _ -> \"Unknown_signatureScheme\"\n\ninline_for_extraction noextract let signatureScheme_parser_kind = LP.strong_parser_kind 2 2 (Some LP.ParserKindMetadataTotal)\n\nnoextract val signatureScheme_parser: LP.parser signatureScheme_parser_kind signatureScheme\n\nnoextract val signatureScheme_serializer: LP.serializer signatureScheme_parser\n\nnoextract val signatureScheme_bytesize (x:signatureScheme) : GTot nat\n\nnoextract val signatureScheme_bytesize_eq (x:signatureScheme) : Lemma (signatureScheme_bytesize x == Seq.length (LP.serialize signatureScheme_serializer x))\n\nval signatureScheme_parser32: LS.parser32 signatureScheme_parser\n\nval signatureScheme_serializer32: LS.serializer32 signatureScheme_serializer\n\nval signatureScheme_size32: LSZ.size32 signatureScheme_serializer\n\nlet signatureScheme_validator: LL.validator signatureScheme_parser = LL.validate_total_constant_size signatureScheme_parser 2uL ()", "dependencies": { "source_file": "Parsers.SignatureScheme.fsti", "checked_file": "Parsers.SignatureScheme.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.SignatureScheme.signatureScheme_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.jump_constant_size", "Parsers.SignatureScheme.signatureScheme_parser_kind", "Parsers.SignatureScheme.signatureScheme", "Parsers.SignatureScheme.signatureScheme_parser", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureScheme_jumper:LL.jumper signatureScheme_parser\nlet signatureScheme_jumper:LL.jumper signatureScheme_parser =", "completed_definiton": "LL.jump_constant_size signatureScheme_parser 2ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fsti", "name": "Parsers.ECCurveType.eCCurveType_parser_kind", "original_source_type": "", "source_type": "val eCCurveType_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let eCCurveType_parser_kind = LP.strong_parser_kind 1 1 None", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 31, "start_col": 62, "end_line": 31, "end_col": 92 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ntype eCCurveType =\n | Explicit_prime\n | Explicit_char2\n | Named_curve\n\nlet string_of_eCCurveType = function\n | Explicit_prime -> \"explicit_prime\"\n | Explicit_char2 -> \"explicit_char2\"\n | Named_curve -> \"named_curve\"", "dependencies": { "source_file": "Parsers.ECCurveType.fsti", "checked_file": "Parsers.ECCurveType.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let eCCurveType_parser_kind =", "completed_definiton": "LP.strong_parser_kind 1 1 None", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fsti", "name": "Parsers.ECCurveType.eCCurveType_jumper", "original_source_type": "val eCCurveType_jumper:LL.jumper eCCurveType_parser", "source_type": "val eCCurveType_jumper:LL.jumper eCCurveType_parser", "source_definition": "let eCCurveType_jumper: LL.jumper eCCurveType_parser = LL.jump_constant_size eCCurveType_parser 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 49, "start_col": 55, "end_line": 49, "end_col": 102 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ntype eCCurveType =\n | Explicit_prime\n | Explicit_char2\n | Named_curve\n\nlet string_of_eCCurveType = function\n | Explicit_prime -> \"explicit_prime\"\n | Explicit_char2 -> \"explicit_char2\"\n | Named_curve -> \"named_curve\"\n\ninline_for_extraction noextract let eCCurveType_parser_kind = LP.strong_parser_kind 1 1 None\n\nnoextract val eCCurveType_parser: LP.parser eCCurveType_parser_kind eCCurveType\n\nnoextract val eCCurveType_serializer: LP.serializer eCCurveType_parser\n\nnoextract val eCCurveType_bytesize (x:eCCurveType) : GTot nat\n\nnoextract val eCCurveType_bytesize_eq (x:eCCurveType) : Lemma (eCCurveType_bytesize x == Seq.length (LP.serialize eCCurveType_serializer x))\n\nval eCCurveType_parser32: LS.parser32 eCCurveType_parser\n\nval eCCurveType_serializer32: LS.serializer32 eCCurveType_serializer\n\nval eCCurveType_size32: LSZ.size32 eCCurveType_serializer\n\nval eCCurveType_validator: LL.validator eCCurveType_parser", "dependencies": { "source_file": "Parsers.ECCurveType.fsti", "checked_file": "Parsers.ECCurveType.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.ECCurveType.eCCurveType_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.jump_constant_size", "Parsers.ECCurveType.eCCurveType_parser_kind", "Parsers.ECCurveType.eCCurveType", "Parsers.ECCurveType.eCCurveType_parser", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val eCCurveType_jumper:LL.jumper eCCurveType_parser\nlet eCCurveType_jumper:LL.jumper eCCurveType_parser =", "completed_definiton": "LL.jump_constant_size eCCurveType_parser 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.ECCurveType.fsti", "name": "Parsers.ECCurveType.string_of_eCCurveType", "original_source_type": "", "source_type": "val string_of_eCCurveType : _: Parsers.ECCurveType.eCCurveType -> Prims.string", "source_definition": "let string_of_eCCurveType = function\n | Explicit_prime -> \"explicit_prime\"\n | Explicit_char2 -> \"explicit_char2\"\n | Named_curve -> \"named_curve\"", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ECCurveType.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 26, "start_col": 28, "end_line": 29, "end_col": 32 }, "file_context": "module Parsers.ECCurveType\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ntype eCCurveType =\n | Explicit_prime\n | Explicit_char2\n | Named_curve", "dependencies": { "source_file": "Parsers.ECCurveType.fsti", "checked_file": "Parsers.ECCurveType.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Parsers.ECCurveType.eCCurveType -> Prims.string", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.ECCurveType.eCCurveType", "Prims.string" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let string_of_eCCurveType =", "completed_definiton": "function\n| Explicit_prime -> \"explicit_prime\"\n| Explicit_char2 -> \"explicit_char2\"\n| Named_curve -> \"named_curve\"", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fsti", "name": "EverCrypt.aes128_key", "original_source_type": "", "source_type": "val aes128_key : Type0", "source_definition": "let aes128_key = B.pointer aes128_key_s", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 44, "start_col": 17, "end_line": 44, "end_col": 39 }, "file_context": "module EverCrypt\n\nopen FStar.HyperStack.ST\nopen EverCrypt.Helpers\nopen EverCrypt.Specs\n\nmodule B = LowStar.Buffer\n\n/// The EverCrypt verified cryptographic library\n/// --------------------------------------------\n///\n/// This top-level module brings into scope all the components of EverCrypt.\n\ninclude EverCrypt.Hash\ninclude EverCrypt.HMAC\ninclude EverCrypt.HKDF\ninclude EverCrypt.DRBG\ninclude EverCrypt.Poly1305\ninclude EverCrypt.Curve25519\ninclude EverCrypt.Cipher\n\n/// Legacy, deprecated\n/// ------------------\n///\n/// Unverified, legacy wrappers calling into old HACL* code. Clients should\n/// abandon these in favor of the verified, properly-specified modules above.\n\n/// Random sampling\n\nval random_init: unit ->\n ST uint32_t random_init_pre random_init_post\n\nval random_sample: len:uint32_t -> out:uint8_p ->\n ST unit random_sample_pre random_sample_post\n\nval random_cleanup: unit ->\n ST unit random_cleanup_pre random_cleanup_post\n\n/// AES block function\n\n[@CAbstractStruct]\nval aes128_key_s: Type0", "dependencies": { "source_file": "EverCrypt.fsti", "checked_file": "EverCrypt.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.Specs.fsti.checked", "EverCrypt.Poly1305.fsti.checked", "EverCrypt.HMAC.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hash.fsti.checked", "EverCrypt.DRBG.fsti.checked", "EverCrypt.Curve25519.fsti.checked", "EverCrypt.Cipher.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.pointer", "EverCrypt.aes128_key_s" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aes128_key =", "completed_definiton": "B.pointer aes128_key_s", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fsti", "name": "EverCrypt.aead_ivLen", "original_source_type": "", "source_type": "val aead_ivLen : a: EverCrypt.aead_alg -> FStar.UInt32.t", "source_definition": "let aead_ivLen (a:aead_alg) = 12ul", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 170, "start_col": 30, "end_line": 170, "end_col": 34 }, "file_context": "module EverCrypt\n\nopen FStar.HyperStack.ST\nopen EverCrypt.Helpers\nopen EverCrypt.Specs\n\nmodule B = LowStar.Buffer\n\n/// The EverCrypt verified cryptographic library\n/// --------------------------------------------\n///\n/// This top-level module brings into scope all the components of EverCrypt.\n\ninclude EverCrypt.Hash\ninclude EverCrypt.HMAC\ninclude EverCrypt.HKDF\ninclude EverCrypt.DRBG\ninclude EverCrypt.Poly1305\ninclude EverCrypt.Curve25519\ninclude EverCrypt.Cipher\n\n/// Legacy, deprecated\n/// ------------------\n///\n/// Unverified, legacy wrappers calling into old HACL* code. Clients should\n/// abandon these in favor of the verified, properly-specified modules above.\n\n/// Random sampling\n\nval random_init: unit ->\n ST uint32_t random_init_pre random_init_post\n\nval random_sample: len:uint32_t -> out:uint8_p ->\n ST unit random_sample_pre random_sample_post\n\nval random_cleanup: unit ->\n ST unit random_cleanup_pre random_cleanup_post\n\n/// AES block function\n\n[@CAbstractStruct]\nval aes128_key_s: Type0\n\nlet aes128_key = B.pointer aes128_key_s\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_create: key:uint8_p ->\n ST aes128_key aes128_create_pre aes128_create_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_compute: key:aes128_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes128_compute_pre aes128_compute_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_free: aes128_key ->\n ST unit aes128_free_pre aes128_free_post\n\n[@CAbstractStruct]\nval aes256_key_s : Type0\n\nlet aes256_key = B.pointer aes256_key_s\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_create: key:uint8_p ->\n ST aes256_key aes256_create_pre aes256_create_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_compute: key:aes256_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes256_compute_pre aes256_compute_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_free: aes256_key ->\n ST unit aes256_free_pre aes256_free_post\n\n\n/// AES-GCM\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes128_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes128_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes128_gcm_decrypt_pre aes128_gcm_decrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes256_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes256_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes256_gcm_decrypt_pre aes256_gcm_decrypt_post\n\n/// Agile Block and Stream Ciphers (adapted from CoreCrypto, TBC)\n\ntype block_cipher_alg =\n | AES128_CBC\n | AES256_CBC\n | TDES_EDE_CBC\n\nlet block_cipher_keyLen = function\n | AES128_CBC -> 16ul\n | AES256_CBC -> 32ul\n | TDES_EDE_CBC -> 24ul\n\nlet block_cipher_blockLen = function\n | AES128_CBC -> 16ul\n | AES256_CBC -> 16ul\n | TDES_EDE_CBC -> 8ul\n\ntype stream_cipher_alg = \n | RC4_128\n\n/// Agile AEAD\n\ntype aead_alg =\n | AES128_GCM\n | AES256_GCM\n | CHACHA20_POLY1305\n // the algorithms below are used in TLS 1.3 but not yet supported by\n // EverCrypt or miTLS; they are included e.g. for parsing\n | AES128_CCM // \"Counter with CBC-Message Authentication Code\"\n | AES256_CCM\n | AES128_CCM8 // variant with truncated 8-byte tags\n | AES256_CCM8\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nlet supported_aead_alg (a:aead_alg): GTot bool = \n match a with \n | AES128_GCM\n | AES256_GCM\n | CHACHA20_POLY1305 -> true\n | _ -> false\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nlet aead_keyLen = function\n | AES128_GCM -> 16ul\n | AES256_GCM -> 32ul\n | CHACHA20_POLY1305 -> 32ul\n | AES128_CCM -> 16ul\n | AES128_CCM8 -> 16ul\n | AES256_CCM -> 32ul\n | AES256_CCM8 -> 32ul\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nlet aead_tagLen = function\n | AES128_CCM8 -> 8ul\n | AES256_CCM8 -> 8ul\n | AES128_GCM -> 16ul\n | AES256_GCM -> 16ul\n | CHACHA20_POLY1305 -> 16ul\n | AES128_CCM -> 16ul\n | AES256_CCM -> 16ul", "dependencies": { "source_file": "EverCrypt.fsti", "checked_file": "EverCrypt.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.Specs.fsti.checked", "EverCrypt.Poly1305.fsti.checked", "EverCrypt.HMAC.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hash.fsti.checked", "EverCrypt.DRBG.fsti.checked", "EverCrypt.Curve25519.fsti.checked", "EverCrypt.Cipher.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: EverCrypt.aead_alg -> FStar.UInt32.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "EverCrypt.aead_alg", "FStar.UInt32.__uint_to_t", "FStar.UInt32.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aead_ivLen (a: aead_alg) =", "completed_definiton": "12ul", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fsti", "name": "EverCrypt.aes256_key", "original_source_type": "", "source_type": "val aes256_key : Type0", "source_definition": "let aes256_key = B.pointer aes256_key_s", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 62, "start_col": 17, "end_line": 62, "end_col": 39 }, "file_context": "module EverCrypt\n\nopen FStar.HyperStack.ST\nopen EverCrypt.Helpers\nopen EverCrypt.Specs\n\nmodule B = LowStar.Buffer\n\n/// The EverCrypt verified cryptographic library\n/// --------------------------------------------\n///\n/// This top-level module brings into scope all the components of EverCrypt.\n\ninclude EverCrypt.Hash\ninclude EverCrypt.HMAC\ninclude EverCrypt.HKDF\ninclude EverCrypt.DRBG\ninclude EverCrypt.Poly1305\ninclude EverCrypt.Curve25519\ninclude EverCrypt.Cipher\n\n/// Legacy, deprecated\n/// ------------------\n///\n/// Unverified, legacy wrappers calling into old HACL* code. Clients should\n/// abandon these in favor of the verified, properly-specified modules above.\n\n/// Random sampling\n\nval random_init: unit ->\n ST uint32_t random_init_pre random_init_post\n\nval random_sample: len:uint32_t -> out:uint8_p ->\n ST unit random_sample_pre random_sample_post\n\nval random_cleanup: unit ->\n ST unit random_cleanup_pre random_cleanup_post\n\n/// AES block function\n\n[@CAbstractStruct]\nval aes128_key_s: Type0\n\nlet aes128_key = B.pointer aes128_key_s\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_create: key:uint8_p ->\n ST aes128_key aes128_create_pre aes128_create_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_compute: key:aes128_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes128_compute_pre aes128_compute_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_free: aes128_key ->\n ST unit aes128_free_pre aes128_free_post\n\n[@CAbstractStruct]\nval aes256_key_s : Type0", "dependencies": { "source_file": "EverCrypt.fsti", "checked_file": "EverCrypt.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.Specs.fsti.checked", "EverCrypt.Poly1305.fsti.checked", "EverCrypt.HMAC.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hash.fsti.checked", "EverCrypt.DRBG.fsti.checked", "EverCrypt.Curve25519.fsti.checked", "EverCrypt.Cipher.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.pointer", "EverCrypt.aes256_key_s" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aes256_key =", "completed_definiton": "B.pointer aes256_key_s", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fsti", "name": "EverCrypt.aead_state", "original_source_type": "", "source_type": "val aead_state : Type0", "source_definition": "let aead_state = B.pointer aead_state_s", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 176, "start_col": 17, "end_line": 176, "end_col": 39 }, "file_context": "module EverCrypt\n\nopen FStar.HyperStack.ST\nopen EverCrypt.Helpers\nopen EverCrypt.Specs\n\nmodule B = LowStar.Buffer\n\n/// The EverCrypt verified cryptographic library\n/// --------------------------------------------\n///\n/// This top-level module brings into scope all the components of EverCrypt.\n\ninclude EverCrypt.Hash\ninclude EverCrypt.HMAC\ninclude EverCrypt.HKDF\ninclude EverCrypt.DRBG\ninclude EverCrypt.Poly1305\ninclude EverCrypt.Curve25519\ninclude EverCrypt.Cipher\n\n/// Legacy, deprecated\n/// ------------------\n///\n/// Unverified, legacy wrappers calling into old HACL* code. Clients should\n/// abandon these in favor of the verified, properly-specified modules above.\n\n/// Random sampling\n\nval random_init: unit ->\n ST uint32_t random_init_pre random_init_post\n\nval random_sample: len:uint32_t -> out:uint8_p ->\n ST unit random_sample_pre random_sample_post\n\nval random_cleanup: unit ->\n ST unit random_cleanup_pre random_cleanup_post\n\n/// AES block function\n\n[@CAbstractStruct]\nval aes128_key_s: Type0\n\nlet aes128_key = B.pointer aes128_key_s\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_create: key:uint8_p ->\n ST aes128_key aes128_create_pre aes128_create_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_compute: key:aes128_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes128_compute_pre aes128_compute_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_free: aes128_key ->\n ST unit aes128_free_pre aes128_free_post\n\n[@CAbstractStruct]\nval aes256_key_s : Type0\n\nlet aes256_key = B.pointer aes256_key_s\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_create: key:uint8_p ->\n ST aes256_key aes256_create_pre aes256_create_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_compute: key:aes256_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes256_compute_pre aes256_compute_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_free: aes256_key ->\n ST unit aes256_free_pre aes256_free_post\n\n\n/// AES-GCM\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes128_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes128_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes128_gcm_decrypt_pre aes128_gcm_decrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes256_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes256_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes256_gcm_decrypt_pre aes256_gcm_decrypt_post\n\n/// Agile Block and Stream Ciphers (adapted from CoreCrypto, TBC)\n\ntype block_cipher_alg =\n | AES128_CBC\n | AES256_CBC\n | TDES_EDE_CBC\n\nlet block_cipher_keyLen = function\n | AES128_CBC -> 16ul\n | AES256_CBC -> 32ul\n | TDES_EDE_CBC -> 24ul\n\nlet block_cipher_blockLen = function\n | AES128_CBC -> 16ul\n | AES256_CBC -> 16ul\n | TDES_EDE_CBC -> 8ul\n\ntype stream_cipher_alg = \n | RC4_128\n\n/// Agile AEAD\n\ntype aead_alg =\n | AES128_GCM\n | AES256_GCM\n | CHACHA20_POLY1305\n // the algorithms below are used in TLS 1.3 but not yet supported by\n // EverCrypt or miTLS; they are included e.g. for parsing\n | AES128_CCM // \"Counter with CBC-Message Authentication Code\"\n | AES256_CCM\n | AES128_CCM8 // variant with truncated 8-byte tags\n | AES256_CCM8\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nlet supported_aead_alg (a:aead_alg): GTot bool = \n match a with \n | AES128_GCM\n | AES256_GCM\n | CHACHA20_POLY1305 -> true\n | _ -> false\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nlet aead_keyLen = function\n | AES128_GCM -> 16ul\n | AES256_GCM -> 32ul\n | CHACHA20_POLY1305 -> 32ul\n | AES128_CCM -> 16ul\n | AES128_CCM8 -> 16ul\n | AES256_CCM -> 32ul\n | AES256_CCM8 -> 32ul\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nlet aead_tagLen = function\n | AES128_CCM8 -> 8ul\n | AES256_CCM8 -> 8ul\n | AES128_GCM -> 16ul\n | AES256_GCM -> 16ul\n | CHACHA20_POLY1305 -> 16ul\n | AES128_CCM -> 16ul\n | AES256_CCM -> 16ul\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nlet aead_ivLen (a:aead_alg) = 12ul\n\n\n[@CAbstractStruct]\nval aead_state_s: Type0", "dependencies": { "source_file": "EverCrypt.fsti", "checked_file": "EverCrypt.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.Specs.fsti.checked", "EverCrypt.Poly1305.fsti.checked", "EverCrypt.HMAC.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hash.fsti.checked", "EverCrypt.DRBG.fsti.checked", "EverCrypt.Curve25519.fsti.checked", "EverCrypt.Cipher.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.pointer", "EverCrypt.aead_state_s" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aead_state =", "completed_definiton": "B.pointer aead_state_s", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fsti", "name": "EverCrypt.ecdh_state", "original_source_type": "", "source_type": "val ecdh_state : Type0", "source_definition": "let ecdh_state = B.pointer ecdh_state_s", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 252, "start_col": 17, "end_line": 252, "end_col": 39 }, "file_context": "module EverCrypt\n\nopen FStar.HyperStack.ST\nopen EverCrypt.Helpers\nopen EverCrypt.Specs\n\nmodule B = LowStar.Buffer\n\n/// The EverCrypt verified cryptographic library\n/// --------------------------------------------\n///\n/// This top-level module brings into scope all the components of EverCrypt.\n\ninclude EverCrypt.Hash\ninclude EverCrypt.HMAC\ninclude EverCrypt.HKDF\ninclude EverCrypt.DRBG\ninclude EverCrypt.Poly1305\ninclude EverCrypt.Curve25519\ninclude EverCrypt.Cipher\n\n/// Legacy, deprecated\n/// ------------------\n///\n/// Unverified, legacy wrappers calling into old HACL* code. Clients should\n/// abandon these in favor of the verified, properly-specified modules above.\n\n/// Random sampling\n\nval random_init: unit ->\n ST uint32_t random_init_pre random_init_post\n\nval random_sample: len:uint32_t -> out:uint8_p ->\n ST unit random_sample_pre random_sample_post\n\nval random_cleanup: unit ->\n ST unit random_cleanup_pre random_cleanup_post\n\n/// AES block function\n\n[@CAbstractStruct]\nval aes128_key_s: Type0\n\nlet aes128_key = B.pointer aes128_key_s\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_create: key:uint8_p ->\n ST aes128_key aes128_create_pre aes128_create_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_compute: key:aes128_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes128_compute_pre aes128_compute_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_free: aes128_key ->\n ST unit aes128_free_pre aes128_free_post\n\n[@CAbstractStruct]\nval aes256_key_s : Type0\n\nlet aes256_key = B.pointer aes256_key_s\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_create: key:uint8_p ->\n ST aes256_key aes256_create_pre aes256_create_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_compute: key:aes256_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes256_compute_pre aes256_compute_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_free: aes256_key ->\n ST unit aes256_free_pre aes256_free_post\n\n\n/// AES-GCM\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes128_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes128_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes128_gcm_decrypt_pre aes128_gcm_decrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes256_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes256_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes256_gcm_decrypt_pre aes256_gcm_decrypt_post\n\n/// Agile Block and Stream Ciphers (adapted from CoreCrypto, TBC)\n\ntype block_cipher_alg =\n | AES128_CBC\n | AES256_CBC\n | TDES_EDE_CBC\n\nlet block_cipher_keyLen = function\n | AES128_CBC -> 16ul\n | AES256_CBC -> 32ul\n | TDES_EDE_CBC -> 24ul\n\nlet block_cipher_blockLen = function\n | AES128_CBC -> 16ul\n | AES256_CBC -> 16ul\n | TDES_EDE_CBC -> 8ul\n\ntype stream_cipher_alg = \n | RC4_128\n\n/// Agile AEAD\n\ntype aead_alg =\n | AES128_GCM\n | AES256_GCM\n | CHACHA20_POLY1305\n // the algorithms below are used in TLS 1.3 but not yet supported by\n // EverCrypt or miTLS; they are included e.g. for parsing\n | AES128_CCM // \"Counter with CBC-Message Authentication Code\"\n | AES256_CCM\n | AES128_CCM8 // variant with truncated 8-byte tags\n | AES256_CCM8\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nlet supported_aead_alg (a:aead_alg): GTot bool = \n match a with \n | AES128_GCM\n | AES256_GCM\n | CHACHA20_POLY1305 -> true\n | _ -> false\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nlet aead_keyLen = function\n | AES128_GCM -> 16ul\n | AES256_GCM -> 32ul\n | CHACHA20_POLY1305 -> 32ul\n | AES128_CCM -> 16ul\n | AES128_CCM8 -> 16ul\n | AES256_CCM -> 32ul\n | AES256_CCM8 -> 32ul\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nlet aead_tagLen = function\n | AES128_CCM8 -> 8ul\n | AES256_CCM8 -> 8ul\n | AES128_GCM -> 16ul\n | AES256_GCM -> 16ul\n | CHACHA20_POLY1305 -> 16ul\n | AES128_CCM -> 16ul\n | AES256_CCM -> 16ul\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nlet aead_ivLen (a:aead_alg) = 12ul\n\n\n[@CAbstractStruct]\nval aead_state_s: Type0\n\nlet aead_state = B.pointer aead_state_s\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aead_create: a:aead_alg {supported_aead_alg a} -> key:uint8_p ->\n ST aead_state aead_create_pre aead_create_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aead_encrypt: key:aead_state -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher:uint8_p -> tag:uint8_p ->\n ST unit aead_encrypt_pre aead_encrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aead_decrypt: key:aead_state -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher:uint8_p -> tag:uint8_p ->\n ST uint32_t aead_decrypt_pre aead_decrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aead_free: aead_state ->\n ST unit aead_free_pre aead_free_post\n\n/// DH\n\n[@CAbstractStruct]\nval dh_state_s: Type0\n\nlet dh_state = B.pointer dh_state_s\n\nval dh_load_group:\n dh_p: uint8_p ->\n dh_p_len: uint32_t ->\n dh_g: uint8_p ->\n dh_g_len: uint32_t ->\n dh_q: uint8_p ->\n dh_q_len: uint32_t ->\n ST dh_state\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)\n\nval dh_free_group:\n st: dh_state ->\n ST unit\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)\n\nval dh_keygen:\n st: dh_state ->\n out: uint8_p ->\n ST uint32_t\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)\n\nval dh_compute:\n st: dh_state ->\n public: uint8_p ->\n public_len: uint32_t ->\n out: uint8_p ->\n ST uint32_t\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)\n\n/// ECDH\n\ntype ec_curve =\n | ECC_P256\n | ECC_P384\n | ECC_P521\n | ECC_X25519\n | ECC_X448\n\n[@CAbstractStruct]\nval ecdh_state_s: Type0", "dependencies": { "source_file": "EverCrypt.fsti", "checked_file": "EverCrypt.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.Specs.fsti.checked", "EverCrypt.Poly1305.fsti.checked", "EverCrypt.HMAC.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hash.fsti.checked", "EverCrypt.DRBG.fsti.checked", "EverCrypt.Curve25519.fsti.checked", "EverCrypt.Cipher.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.pointer", "EverCrypt.ecdh_state_s" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let ecdh_state =", "completed_definiton": "B.pointer ecdh_state_s", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fsti", "name": "EverCrypt.supported_aead_alg", "original_source_type": "val supported_aead_alg (a: aead_alg) : GTot bool", "source_type": "val supported_aead_alg (a: aead_alg) : GTot bool", "source_definition": "let supported_aead_alg (a:aead_alg): GTot bool = \n match a with \n | AES128_GCM\n | AES256_GCM\n | CHACHA20_POLY1305 -> true\n | _ -> false", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 143, "start_col": 2, "end_line": 147, "end_col": 14 }, "file_context": "module EverCrypt\n\nopen FStar.HyperStack.ST\nopen EverCrypt.Helpers\nopen EverCrypt.Specs\n\nmodule B = LowStar.Buffer\n\n/// The EverCrypt verified cryptographic library\n/// --------------------------------------------\n///\n/// This top-level module brings into scope all the components of EverCrypt.\n\ninclude EverCrypt.Hash\ninclude EverCrypt.HMAC\ninclude EverCrypt.HKDF\ninclude EverCrypt.DRBG\ninclude EverCrypt.Poly1305\ninclude EverCrypt.Curve25519\ninclude EverCrypt.Cipher\n\n/// Legacy, deprecated\n/// ------------------\n///\n/// Unverified, legacy wrappers calling into old HACL* code. Clients should\n/// abandon these in favor of the verified, properly-specified modules above.\n\n/// Random sampling\n\nval random_init: unit ->\n ST uint32_t random_init_pre random_init_post\n\nval random_sample: len:uint32_t -> out:uint8_p ->\n ST unit random_sample_pre random_sample_post\n\nval random_cleanup: unit ->\n ST unit random_cleanup_pre random_cleanup_post\n\n/// AES block function\n\n[@CAbstractStruct]\nval aes128_key_s: Type0\n\nlet aes128_key = B.pointer aes128_key_s\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_create: key:uint8_p ->\n ST aes128_key aes128_create_pre aes128_create_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_compute: key:aes128_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes128_compute_pre aes128_compute_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_free: aes128_key ->\n ST unit aes128_free_pre aes128_free_post\n\n[@CAbstractStruct]\nval aes256_key_s : Type0\n\nlet aes256_key = B.pointer aes256_key_s\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_create: key:uint8_p ->\n ST aes256_key aes256_create_pre aes256_create_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_compute: key:aes256_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes256_compute_pre aes256_compute_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_free: aes256_key ->\n ST unit aes256_free_pre aes256_free_post\n\n\n/// AES-GCM\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes128_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes128_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes128_gcm_decrypt_pre aes128_gcm_decrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes256_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes256_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes256_gcm_decrypt_pre aes256_gcm_decrypt_post\n\n/// Agile Block and Stream Ciphers (adapted from CoreCrypto, TBC)\n\ntype block_cipher_alg =\n | AES128_CBC\n | AES256_CBC\n | TDES_EDE_CBC\n\nlet block_cipher_keyLen = function\n | AES128_CBC -> 16ul\n | AES256_CBC -> 32ul\n | TDES_EDE_CBC -> 24ul\n\nlet block_cipher_blockLen = function\n | AES128_CBC -> 16ul\n | AES256_CBC -> 16ul\n | TDES_EDE_CBC -> 8ul\n\ntype stream_cipher_alg = \n | RC4_128\n\n/// Agile AEAD\n\ntype aead_alg =\n | AES128_GCM\n | AES256_GCM\n | CHACHA20_POLY1305\n // the algorithms below are used in TLS 1.3 but not yet supported by\n // EverCrypt or miTLS; they are included e.g. for parsing\n | AES128_CCM // \"Counter with CBC-Message Authentication Code\"\n | AES256_CCM\n | AES128_CCM8 // variant with truncated 8-byte tags\n | AES256_CCM8\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]", "dependencies": { "source_file": "EverCrypt.fsti", "checked_file": "EverCrypt.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.Specs.fsti.checked", "EverCrypt.Poly1305.fsti.checked", "EverCrypt.HMAC.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hash.fsti.checked", "EverCrypt.DRBG.fsti.checked", "EverCrypt.Curve25519.fsti.checked", "EverCrypt.Cipher.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: EverCrypt.aead_alg -> Prims.GTot Prims.bool", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "EverCrypt.aead_alg", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val supported_aead_alg (a: aead_alg) : GTot bool\nlet supported_aead_alg (a: aead_alg) : GTot bool =", "completed_definiton": "match a with\n| AES128_GCM | AES256_GCM | CHACHA20_POLY1305 -> true\n| _ -> false", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fsti", "name": "EverCrypt.dh_state", "original_source_type": "", "source_type": "val dh_state : Type0", "source_definition": "let dh_state = B.pointer dh_state_s", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 205, "start_col": 15, "end_line": 205, "end_col": 35 }, "file_context": "module EverCrypt\n\nopen FStar.HyperStack.ST\nopen EverCrypt.Helpers\nopen EverCrypt.Specs\n\nmodule B = LowStar.Buffer\n\n/// The EverCrypt verified cryptographic library\n/// --------------------------------------------\n///\n/// This top-level module brings into scope all the components of EverCrypt.\n\ninclude EverCrypt.Hash\ninclude EverCrypt.HMAC\ninclude EverCrypt.HKDF\ninclude EverCrypt.DRBG\ninclude EverCrypt.Poly1305\ninclude EverCrypt.Curve25519\ninclude EverCrypt.Cipher\n\n/// Legacy, deprecated\n/// ------------------\n///\n/// Unverified, legacy wrappers calling into old HACL* code. Clients should\n/// abandon these in favor of the verified, properly-specified modules above.\n\n/// Random sampling\n\nval random_init: unit ->\n ST uint32_t random_init_pre random_init_post\n\nval random_sample: len:uint32_t -> out:uint8_p ->\n ST unit random_sample_pre random_sample_post\n\nval random_cleanup: unit ->\n ST unit random_cleanup_pre random_cleanup_post\n\n/// AES block function\n\n[@CAbstractStruct]\nval aes128_key_s: Type0\n\nlet aes128_key = B.pointer aes128_key_s\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_create: key:uint8_p ->\n ST aes128_key aes128_create_pre aes128_create_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_compute: key:aes128_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes128_compute_pre aes128_compute_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_free: aes128_key ->\n ST unit aes128_free_pre aes128_free_post\n\n[@CAbstractStruct]\nval aes256_key_s : Type0\n\nlet aes256_key = B.pointer aes256_key_s\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_create: key:uint8_p ->\n ST aes256_key aes256_create_pre aes256_create_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_compute: key:aes256_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes256_compute_pre aes256_compute_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_free: aes256_key ->\n ST unit aes256_free_pre aes256_free_post\n\n\n/// AES-GCM\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes128_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes128_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes128_gcm_decrypt_pre aes128_gcm_decrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes256_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes256_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes256_gcm_decrypt_pre aes256_gcm_decrypt_post\n\n/// Agile Block and Stream Ciphers (adapted from CoreCrypto, TBC)\n\ntype block_cipher_alg =\n | AES128_CBC\n | AES256_CBC\n | TDES_EDE_CBC\n\nlet block_cipher_keyLen = function\n | AES128_CBC -> 16ul\n | AES256_CBC -> 32ul\n | TDES_EDE_CBC -> 24ul\n\nlet block_cipher_blockLen = function\n | AES128_CBC -> 16ul\n | AES256_CBC -> 16ul\n | TDES_EDE_CBC -> 8ul\n\ntype stream_cipher_alg = \n | RC4_128\n\n/// Agile AEAD\n\ntype aead_alg =\n | AES128_GCM\n | AES256_GCM\n | CHACHA20_POLY1305\n // the algorithms below are used in TLS 1.3 but not yet supported by\n // EverCrypt or miTLS; they are included e.g. for parsing\n | AES128_CCM // \"Counter with CBC-Message Authentication Code\"\n | AES256_CCM\n | AES128_CCM8 // variant with truncated 8-byte tags\n | AES256_CCM8\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nlet supported_aead_alg (a:aead_alg): GTot bool = \n match a with \n | AES128_GCM\n | AES256_GCM\n | CHACHA20_POLY1305 -> true\n | _ -> false\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nlet aead_keyLen = function\n | AES128_GCM -> 16ul\n | AES256_GCM -> 32ul\n | CHACHA20_POLY1305 -> 32ul\n | AES128_CCM -> 16ul\n | AES128_CCM8 -> 16ul\n | AES256_CCM -> 32ul\n | AES256_CCM8 -> 32ul\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nlet aead_tagLen = function\n | AES128_CCM8 -> 8ul\n | AES256_CCM8 -> 8ul\n | AES128_GCM -> 16ul\n | AES256_GCM -> 16ul\n | CHACHA20_POLY1305 -> 16ul\n | AES128_CCM -> 16ul\n | AES256_CCM -> 16ul\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nlet aead_ivLen (a:aead_alg) = 12ul\n\n\n[@CAbstractStruct]\nval aead_state_s: Type0\n\nlet aead_state = B.pointer aead_state_s\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aead_create: a:aead_alg {supported_aead_alg a} -> key:uint8_p ->\n ST aead_state aead_create_pre aead_create_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aead_encrypt: key:aead_state -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher:uint8_p -> tag:uint8_p ->\n ST unit aead_encrypt_pre aead_encrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aead_decrypt: key:aead_state -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher:uint8_p -> tag:uint8_p ->\n ST uint32_t aead_decrypt_pre aead_decrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aead_free: aead_state ->\n ST unit aead_free_pre aead_free_post\n\n/// DH\n\n[@CAbstractStruct]\nval dh_state_s: Type0", "dependencies": { "source_file": "EverCrypt.fsti", "checked_file": "EverCrypt.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.Specs.fsti.checked", "EverCrypt.Poly1305.fsti.checked", "EverCrypt.HMAC.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hash.fsti.checked", "EverCrypt.DRBG.fsti.checked", "EverCrypt.Curve25519.fsti.checked", "EverCrypt.Cipher.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.pointer", "EverCrypt.dh_state_s" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let dh_state =", "completed_definiton": "B.pointer dh_state_s", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fsti", "name": "EverCrypt.block_cipher_keyLen", "original_source_type": "", "source_type": "val block_cipher_keyLen : _: EverCrypt.block_cipher_alg -> FStar.UInt32.t", "source_definition": "let block_cipher_keyLen = function\n | AES128_CBC -> 16ul\n | AES256_CBC -> 32ul\n | TDES_EDE_CBC -> 24ul", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 115, "start_col": 26, "end_line": 118, "end_col": 25 }, "file_context": "module EverCrypt\n\nopen FStar.HyperStack.ST\nopen EverCrypt.Helpers\nopen EverCrypt.Specs\n\nmodule B = LowStar.Buffer\n\n/// The EverCrypt verified cryptographic library\n/// --------------------------------------------\n///\n/// This top-level module brings into scope all the components of EverCrypt.\n\ninclude EverCrypt.Hash\ninclude EverCrypt.HMAC\ninclude EverCrypt.HKDF\ninclude EverCrypt.DRBG\ninclude EverCrypt.Poly1305\ninclude EverCrypt.Curve25519\ninclude EverCrypt.Cipher\n\n/// Legacy, deprecated\n/// ------------------\n///\n/// Unverified, legacy wrappers calling into old HACL* code. Clients should\n/// abandon these in favor of the verified, properly-specified modules above.\n\n/// Random sampling\n\nval random_init: unit ->\n ST uint32_t random_init_pre random_init_post\n\nval random_sample: len:uint32_t -> out:uint8_p ->\n ST unit random_sample_pre random_sample_post\n\nval random_cleanup: unit ->\n ST unit random_cleanup_pre random_cleanup_post\n\n/// AES block function\n\n[@CAbstractStruct]\nval aes128_key_s: Type0\n\nlet aes128_key = B.pointer aes128_key_s\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_create: key:uint8_p ->\n ST aes128_key aes128_create_pre aes128_create_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_compute: key:aes128_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes128_compute_pre aes128_compute_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_free: aes128_key ->\n ST unit aes128_free_pre aes128_free_post\n\n[@CAbstractStruct]\nval aes256_key_s : Type0\n\nlet aes256_key = B.pointer aes256_key_s\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_create: key:uint8_p ->\n ST aes256_key aes256_create_pre aes256_create_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_compute: key:aes256_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes256_compute_pre aes256_compute_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_free: aes256_key ->\n ST unit aes256_free_pre aes256_free_post\n\n\n/// AES-GCM\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes128_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes128_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes128_gcm_decrypt_pre aes128_gcm_decrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes256_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes256_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes256_gcm_decrypt_pre aes256_gcm_decrypt_post\n\n/// Agile Block and Stream Ciphers (adapted from CoreCrypto, TBC)\n\ntype block_cipher_alg =\n | AES128_CBC\n | AES256_CBC\n | TDES_EDE_CBC", "dependencies": { "source_file": "EverCrypt.fsti", "checked_file": "EverCrypt.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.Specs.fsti.checked", "EverCrypt.Poly1305.fsti.checked", "EverCrypt.HMAC.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hash.fsti.checked", "EverCrypt.DRBG.fsti.checked", "EverCrypt.Curve25519.fsti.checked", "EverCrypt.Cipher.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: EverCrypt.block_cipher_alg -> FStar.UInt32.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "EverCrypt.block_cipher_alg", "FStar.UInt32.__uint_to_t", "FStar.UInt32.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let block_cipher_keyLen =", "completed_definiton": "function\n| AES128_CBC -> 16ul\n| AES256_CBC -> 32ul\n| TDES_EDE_CBC -> 24ul", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fsti", "name": "EverCrypt.block_cipher_blockLen", "original_source_type": "", "source_type": "val block_cipher_blockLen : _: EverCrypt.block_cipher_alg -> FStar.UInt32.t", "source_definition": "let block_cipher_blockLen = function\n | AES128_CBC -> 16ul\n | AES256_CBC -> 16ul\n | TDES_EDE_CBC -> 8ul", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 120, "start_col": 28, "end_line": 123, "end_col": 24 }, "file_context": "module EverCrypt\n\nopen FStar.HyperStack.ST\nopen EverCrypt.Helpers\nopen EverCrypt.Specs\n\nmodule B = LowStar.Buffer\n\n/// The EverCrypt verified cryptographic library\n/// --------------------------------------------\n///\n/// This top-level module brings into scope all the components of EverCrypt.\n\ninclude EverCrypt.Hash\ninclude EverCrypt.HMAC\ninclude EverCrypt.HKDF\ninclude EverCrypt.DRBG\ninclude EverCrypt.Poly1305\ninclude EverCrypt.Curve25519\ninclude EverCrypt.Cipher\n\n/// Legacy, deprecated\n/// ------------------\n///\n/// Unverified, legacy wrappers calling into old HACL* code. Clients should\n/// abandon these in favor of the verified, properly-specified modules above.\n\n/// Random sampling\n\nval random_init: unit ->\n ST uint32_t random_init_pre random_init_post\n\nval random_sample: len:uint32_t -> out:uint8_p ->\n ST unit random_sample_pre random_sample_post\n\nval random_cleanup: unit ->\n ST unit random_cleanup_pre random_cleanup_post\n\n/// AES block function\n\n[@CAbstractStruct]\nval aes128_key_s: Type0\n\nlet aes128_key = B.pointer aes128_key_s\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_create: key:uint8_p ->\n ST aes128_key aes128_create_pre aes128_create_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_compute: key:aes128_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes128_compute_pre aes128_compute_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_free: aes128_key ->\n ST unit aes128_free_pre aes128_free_post\n\n[@CAbstractStruct]\nval aes256_key_s : Type0\n\nlet aes256_key = B.pointer aes256_key_s\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_create: key:uint8_p ->\n ST aes256_key aes256_create_pre aes256_create_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_compute: key:aes256_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes256_compute_pre aes256_compute_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_free: aes256_key ->\n ST unit aes256_free_pre aes256_free_post\n\n\n/// AES-GCM\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes128_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes128_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes128_gcm_decrypt_pre aes128_gcm_decrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes256_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes256_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes256_gcm_decrypt_pre aes256_gcm_decrypt_post\n\n/// Agile Block and Stream Ciphers (adapted from CoreCrypto, TBC)\n\ntype block_cipher_alg =\n | AES128_CBC\n | AES256_CBC\n | TDES_EDE_CBC\n\nlet block_cipher_keyLen = function\n | AES128_CBC -> 16ul\n | AES256_CBC -> 32ul\n | TDES_EDE_CBC -> 24ul", "dependencies": { "source_file": "EverCrypt.fsti", "checked_file": "EverCrypt.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.Specs.fsti.checked", "EverCrypt.Poly1305.fsti.checked", "EverCrypt.HMAC.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hash.fsti.checked", "EverCrypt.DRBG.fsti.checked", "EverCrypt.Curve25519.fsti.checked", "EverCrypt.Cipher.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: EverCrypt.block_cipher_alg -> FStar.UInt32.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "EverCrypt.block_cipher_alg", "FStar.UInt32.__uint_to_t", "FStar.UInt32.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let block_cipher_blockLen =", "completed_definiton": "function\n| AES128_CBC -> 16ul\n| AES256_CBC -> 16ul\n| TDES_EDE_CBC -> 8ul", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fsti", "name": "EverCrypt.aead_keyLen", "original_source_type": "", "source_type": "val aead_keyLen : _: EverCrypt.aead_alg -> FStar.UInt32.t", "source_definition": "let aead_keyLen = function\n | AES128_GCM -> 16ul\n | AES256_GCM -> 32ul\n | CHACHA20_POLY1305 -> 32ul\n | AES128_CCM -> 16ul\n | AES128_CCM8 -> 16ul\n | AES256_CCM -> 32ul\n | AES256_CCM8 -> 32ul", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 150, "start_col": 18, "end_line": 157, "end_col": 29 }, "file_context": "module EverCrypt\n\nopen FStar.HyperStack.ST\nopen EverCrypt.Helpers\nopen EverCrypt.Specs\n\nmodule B = LowStar.Buffer\n\n/// The EverCrypt verified cryptographic library\n/// --------------------------------------------\n///\n/// This top-level module brings into scope all the components of EverCrypt.\n\ninclude EverCrypt.Hash\ninclude EverCrypt.HMAC\ninclude EverCrypt.HKDF\ninclude EverCrypt.DRBG\ninclude EverCrypt.Poly1305\ninclude EverCrypt.Curve25519\ninclude EverCrypt.Cipher\n\n/// Legacy, deprecated\n/// ------------------\n///\n/// Unverified, legacy wrappers calling into old HACL* code. Clients should\n/// abandon these in favor of the verified, properly-specified modules above.\n\n/// Random sampling\n\nval random_init: unit ->\n ST uint32_t random_init_pre random_init_post\n\nval random_sample: len:uint32_t -> out:uint8_p ->\n ST unit random_sample_pre random_sample_post\n\nval random_cleanup: unit ->\n ST unit random_cleanup_pre random_cleanup_post\n\n/// AES block function\n\n[@CAbstractStruct]\nval aes128_key_s: Type0\n\nlet aes128_key = B.pointer aes128_key_s\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_create: key:uint8_p ->\n ST aes128_key aes128_create_pre aes128_create_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_compute: key:aes128_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes128_compute_pre aes128_compute_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_free: aes128_key ->\n ST unit aes128_free_pre aes128_free_post\n\n[@CAbstractStruct]\nval aes256_key_s : Type0\n\nlet aes256_key = B.pointer aes256_key_s\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_create: key:uint8_p ->\n ST aes256_key aes256_create_pre aes256_create_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_compute: key:aes256_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes256_compute_pre aes256_compute_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_free: aes256_key ->\n ST unit aes256_free_pre aes256_free_post\n\n\n/// AES-GCM\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes128_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes128_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes128_gcm_decrypt_pre aes128_gcm_decrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes256_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes256_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes256_gcm_decrypt_pre aes256_gcm_decrypt_post\n\n/// Agile Block and Stream Ciphers (adapted from CoreCrypto, TBC)\n\ntype block_cipher_alg =\n | AES128_CBC\n | AES256_CBC\n | TDES_EDE_CBC\n\nlet block_cipher_keyLen = function\n | AES128_CBC -> 16ul\n | AES256_CBC -> 32ul\n | TDES_EDE_CBC -> 24ul\n\nlet block_cipher_blockLen = function\n | AES128_CBC -> 16ul\n | AES256_CBC -> 16ul\n | TDES_EDE_CBC -> 8ul\n\ntype stream_cipher_alg = \n | RC4_128\n\n/// Agile AEAD\n\ntype aead_alg =\n | AES128_GCM\n | AES256_GCM\n | CHACHA20_POLY1305\n // the algorithms below are used in TLS 1.3 but not yet supported by\n // EverCrypt or miTLS; they are included e.g. for parsing\n | AES128_CCM // \"Counter with CBC-Message Authentication Code\"\n | AES256_CCM\n | AES128_CCM8 // variant with truncated 8-byte tags\n | AES256_CCM8\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nlet supported_aead_alg (a:aead_alg): GTot bool = \n match a with \n | AES128_GCM\n | AES256_GCM\n | CHACHA20_POLY1305 -> true\n | _ -> false", "dependencies": { "source_file": "EverCrypt.fsti", "checked_file": "EverCrypt.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.Specs.fsti.checked", "EverCrypt.Poly1305.fsti.checked", "EverCrypt.HMAC.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hash.fsti.checked", "EverCrypt.DRBG.fsti.checked", "EverCrypt.Curve25519.fsti.checked", "EverCrypt.Cipher.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: EverCrypt.aead_alg -> FStar.UInt32.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "EverCrypt.aead_alg", "FStar.UInt32.__uint_to_t", "FStar.UInt32.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aead_keyLen =", "completed_definiton": "function\n| AES128_GCM -> 16ul\n| AES256_GCM -> 32ul\n| CHACHA20_POLY1305 -> 32ul\n| AES128_CCM -> 16ul\n| AES128_CCM8 -> 16ul\n| AES256_CCM -> 32ul\n| AES256_CCM8 -> 32ul", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fsti", "name": "EverCrypt.aead_tagLen", "original_source_type": "", "source_type": "val aead_tagLen : _: EverCrypt.aead_alg -> FStar.UInt32.t", "source_definition": "let aead_tagLen = function\n | AES128_CCM8 -> 8ul\n | AES256_CCM8 -> 8ul\n | AES128_GCM -> 16ul\n | AES256_GCM -> 16ul\n | CHACHA20_POLY1305 -> 16ul\n | AES128_CCM -> 16ul\n | AES256_CCM -> 16ul", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 160, "start_col": 18, "end_line": 167, "end_col": 29 }, "file_context": "module EverCrypt\n\nopen FStar.HyperStack.ST\nopen EverCrypt.Helpers\nopen EverCrypt.Specs\n\nmodule B = LowStar.Buffer\n\n/// The EverCrypt verified cryptographic library\n/// --------------------------------------------\n///\n/// This top-level module brings into scope all the components of EverCrypt.\n\ninclude EverCrypt.Hash\ninclude EverCrypt.HMAC\ninclude EverCrypt.HKDF\ninclude EverCrypt.DRBG\ninclude EverCrypt.Poly1305\ninclude EverCrypt.Curve25519\ninclude EverCrypt.Cipher\n\n/// Legacy, deprecated\n/// ------------------\n///\n/// Unverified, legacy wrappers calling into old HACL* code. Clients should\n/// abandon these in favor of the verified, properly-specified modules above.\n\n/// Random sampling\n\nval random_init: unit ->\n ST uint32_t random_init_pre random_init_post\n\nval random_sample: len:uint32_t -> out:uint8_p ->\n ST unit random_sample_pre random_sample_post\n\nval random_cleanup: unit ->\n ST unit random_cleanup_pre random_cleanup_post\n\n/// AES block function\n\n[@CAbstractStruct]\nval aes128_key_s: Type0\n\nlet aes128_key = B.pointer aes128_key_s\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_create: key:uint8_p ->\n ST aes128_key aes128_create_pre aes128_create_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_compute: key:aes128_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes128_compute_pre aes128_compute_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes128_free: aes128_key ->\n ST unit aes128_free_pre aes128_free_post\n\n[@CAbstractStruct]\nval aes256_key_s : Type0\n\nlet aes256_key = B.pointer aes256_key_s\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_create: key:uint8_p ->\n ST aes256_key aes256_create_pre aes256_create_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_compute: key:aes256_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes256_compute_pre aes256_compute_post\n\n[@ (deprecated \"Please use EverCrypt_CTR.h (from C) or EverCrypt.CTR.fsti (from F*) \")]\nval aes256_free: aes256_key ->\n ST unit aes256_free_pre aes256_free_post\n\n\n/// AES-GCM\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes128_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes128_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes128_gcm_decrypt_pre aes128_gcm_decrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes256_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nval aes256_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes256_gcm_decrypt_pre aes256_gcm_decrypt_post\n\n/// Agile Block and Stream Ciphers (adapted from CoreCrypto, TBC)\n\ntype block_cipher_alg =\n | AES128_CBC\n | AES256_CBC\n | TDES_EDE_CBC\n\nlet block_cipher_keyLen = function\n | AES128_CBC -> 16ul\n | AES256_CBC -> 32ul\n | TDES_EDE_CBC -> 24ul\n\nlet block_cipher_blockLen = function\n | AES128_CBC -> 16ul\n | AES256_CBC -> 16ul\n | TDES_EDE_CBC -> 8ul\n\ntype stream_cipher_alg = \n | RC4_128\n\n/// Agile AEAD\n\ntype aead_alg =\n | AES128_GCM\n | AES256_GCM\n | CHACHA20_POLY1305\n // the algorithms below are used in TLS 1.3 but not yet supported by\n // EverCrypt or miTLS; they are included e.g. for parsing\n | AES128_CCM // \"Counter with CBC-Message Authentication Code\"\n | AES256_CCM\n | AES128_CCM8 // variant with truncated 8-byte tags\n | AES256_CCM8\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nlet supported_aead_alg (a:aead_alg): GTot bool = \n match a with \n | AES128_GCM\n | AES256_GCM\n | CHACHA20_POLY1305 -> true\n | _ -> false\n\n[@ (deprecated \"Please use EverCrypt_AEAD.h (from C) or EverCrypt.AEAD.fsti (from F*) \")]\nlet aead_keyLen = function\n | AES128_GCM -> 16ul\n | AES256_GCM -> 32ul\n | CHACHA20_POLY1305 -> 32ul\n | AES128_CCM -> 16ul\n | AES128_CCM8 -> 16ul\n | AES256_CCM -> 32ul\n | AES256_CCM8 -> 32ul", "dependencies": { "source_file": "EverCrypt.fsti", "checked_file": "EverCrypt.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.Specs.fsti.checked", "EverCrypt.Poly1305.fsti.checked", "EverCrypt.HMAC.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hash.fsti.checked", "EverCrypt.DRBG.fsti.checked", "EverCrypt.Curve25519.fsti.checked", "EverCrypt.Cipher.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: EverCrypt.aead_alg -> FStar.UInt32.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "EverCrypt.aead_alg", "FStar.UInt32.__uint_to_t", "FStar.UInt32.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let aead_tagLen =", "completed_definiton": "function\n| AES128_CCM8 -> 8ul\n| AES256_CCM8 -> 8ul\n| AES128_GCM -> 16ul\n| AES256_GCM -> 16ul\n| CHACHA20_POLY1305 -> 16ul\n| AES128_CCM -> 16ul\n| AES256_CCM -> 16ul", "isa_cross_project_example": true }, { "file_name": "TLSError.fst", "name": "TLSError.string_of_alert", "original_source_type": "", "source_type": "val string_of_alert : a: Parsers.Alert.alert -> Prims.string", "source_definition": "let string_of_alert (a:alert) = \n \"level=\"^string_of_alertLevel a.level^\n \"description=\"^string_of_alertDescription a.description", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/TLSError.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 13, "start_col": 2, "end_line": 14, "end_col": 57 }, "file_context": "\ufeffmodule TLSError\nopen FStar.String\n(* TLS explicitly returns run-time errors:\n results carry either values or error descriptions *)\n\ninclude Parsers.AlertDescription\ninclude Parsers.AlertLevel\ninclude Parsers.Alert\n\nlet string_of_alertDescription (a:alertDescription) = \"alertDescription\"\nlet string_of_alertLevel (a:alertLevel) = \"alertLevel\"", "dependencies": { "source_file": "TLSError.fst", "checked_file": "TLSError.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.AlertLevel.fsti.checked", "Parsers.AlertDescription.fsti.checked", "Parsers.Alert.fsti.checked", "FStar.String.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.Alert" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "FStar.String" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Parsers.Alert.alert -> Prims.string", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.Alert.alert", "Prims.op_Hat", "TLSError.string_of_alertLevel", "Parsers.Alert.__proj__Mkalert__item__level", "TLSError.string_of_alertDescription", "Parsers.Alert.__proj__Mkalert__item__description", "Prims.string" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let string_of_alert (a: alert) =", "completed_definiton": "\"level=\" ^ string_of_alertLevel a.level ^ \"description=\" ^ string_of_alertDescription a.description", "isa_cross_project_example": true }, { "file_name": "TLSError.fst", "name": "TLSError.string_of_alertLevel", "original_source_type": "", "source_type": "val string_of_alertLevel : a: Parsers.AlertLevel.alertLevel -> Prims.string", "source_definition": "let string_of_alertLevel (a:alertLevel) = \"alertLevel\"", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/TLSError.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 11, "start_col": 42, "end_line": 11, "end_col": 54 }, "file_context": "\ufeffmodule TLSError\nopen FStar.String\n(* TLS explicitly returns run-time errors:\n results carry either values or error descriptions *)\n\ninclude Parsers.AlertDescription\ninclude Parsers.AlertLevel\ninclude Parsers.Alert", "dependencies": { "source_file": "TLSError.fst", "checked_file": "TLSError.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.AlertLevel.fsti.checked", "Parsers.AlertDescription.fsti.checked", "Parsers.Alert.fsti.checked", "FStar.String.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.Alert" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "FStar.String" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Parsers.AlertLevel.alertLevel -> Prims.string", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.AlertLevel.alertLevel", "Prims.string" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let string_of_alertLevel (a: alertLevel) =", "completed_definiton": "\"alertLevel\"", "isa_cross_project_example": true }, { "file_name": "TLSError.fst", "name": "TLSError.string_of_alertDescription", "original_source_type": "", "source_type": "val string_of_alertDescription : a: Parsers.AlertDescription.alertDescription -> Prims.string", "source_definition": "let string_of_alertDescription (a:alertDescription) = \"alertDescription\"", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/TLSError.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 10, "start_col": 54, "end_line": 10, "end_col": 72 }, "file_context": "\ufeffmodule TLSError\nopen FStar.String\n(* TLS explicitly returns run-time errors:\n results carry either values or error descriptions *)\n\ninclude Parsers.AlertDescription\ninclude Parsers.AlertLevel\ninclude Parsers.Alert", "dependencies": { "source_file": "TLSError.fst", "checked_file": "TLSError.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.AlertLevel.fsti.checked", "Parsers.AlertDescription.fsti.checked", "Parsers.Alert.fsti.checked", "FStar.String.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.Alert" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "FStar.String" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Parsers.AlertDescription.alertDescription -> Prims.string", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.AlertDescription.alertDescription", "Prims.string" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let string_of_alertDescription (a: alertDescription) =", "completed_definiton": "\"alertDescription\"", "isa_cross_project_example": true }, { "file_name": "TLSError.fst", "name": "TLSError.string_of_error", "original_source_type": "", "source_type": "val string_of_error : _: (Parsers.Alert.alert * Prims.string) -> Prims.string", "source_definition": "let string_of_error (a,s)= string_of_alertDescription a.description^\" (\"^s^\")\"", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/TLSError.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 49, "start_col": 27, "end_line": 49, "end_col": 78 }, "file_context": "\ufeffmodule TLSError\nopen FStar.String\n(* TLS explicitly returns run-time errors:\n results carry either values or error descriptions *)\n\ninclude Parsers.AlertDescription\ninclude Parsers.AlertLevel\ninclude Parsers.Alert\n\nlet string_of_alertDescription (a:alertDescription) = \"alertDescription\"\nlet string_of_alertLevel (a:alertLevel) = \"alertLevel\"\nlet string_of_alert (a:alert) = \n \"level=\"^string_of_alertLevel a.level^\n \"description=\"^string_of_alertDescription a.description\n\nlet fatalAlert ad = {level=Fatal; description=ad}\n\n(* TODO functions checking consistency of levels and descriptions *)\n\n// let isFatal ad =\n// match ad with\n// | AD_unexpected_message\n// | AD_bad_record_mac\n// | AD_decryption_failed\n// | AD_record_overflow\n// | AD_decompression_failure\n// | AD_handshake_failure\n// | AD_bad_certificate_fatal\n// | AD_unsupported_certificate_fatal\n// | AD_certificate_revoked_fatal\n// | AD_certificate_expired_fatal\n// | AD_certificate_unknown_fatal\n// | AD_illegal_parameter\n// | AD_unknown_ca\n// | AD_access_denied\n// | AD_decode_error\n// | AD_decrypt_error\n// | AD_export_restriction\n// | AD_protocol_version\n// | AD_insufficient_security\n// | AD_internal_error\n// | AD_user_cancelled_fatal\n// | AD_missing_extension\n// | AD_unsupported_extension\n// | AD_no_application_protocol -> true\n// | _ -> false", "dependencies": { "source_file": "TLSError.fst", "checked_file": "TLSError.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.AlertLevel.fsti.checked", "Parsers.AlertDescription.fsti.checked", "Parsers.Alert.fsti.checked", "FStar.String.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.Alert" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "FStar.String" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: (Parsers.Alert.alert * Prims.string) -> Prims.string", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Pervasives.Native.tuple2", "Parsers.Alert.alert", "Prims.string", "Prims.op_Hat", "TLSError.string_of_alertDescription", "Parsers.Alert.__proj__Mkalert__item__description" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let string_of_error (a, s) =", "completed_definiton": "string_of_alertDescription a.description ^ \" (\" ^ s ^ \")\"", "isa_cross_project_example": true }, { "file_name": "TLSError.fst", "name": "TLSError.fatalAlert", "original_source_type": "", "source_type": "val fatalAlert : ad: Parsers.AlertDescription.alertDescription -> Parsers.Alert.alert", "source_definition": "let fatalAlert ad = {level=Fatal; description=ad}", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/TLSError.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 16, "start_col": 21, "end_line": 16, "end_col": 48 }, "file_context": "\ufeffmodule TLSError\nopen FStar.String\n(* TLS explicitly returns run-time errors:\n results carry either values or error descriptions *)\n\ninclude Parsers.AlertDescription\ninclude Parsers.AlertLevel\ninclude Parsers.Alert\n\nlet string_of_alertDescription (a:alertDescription) = \"alertDescription\"\nlet string_of_alertLevel (a:alertLevel) = \"alertLevel\"\nlet string_of_alert (a:alert) = \n \"level=\"^string_of_alertLevel a.level^\n \"description=\"^string_of_alertDescription a.description", "dependencies": { "source_file": "TLSError.fst", "checked_file": "TLSError.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.AlertLevel.fsti.checked", "Parsers.AlertDescription.fsti.checked", "Parsers.Alert.fsti.checked", "FStar.String.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.Alert" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "FStar.String" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "ad: Parsers.AlertDescription.alertDescription -> Parsers.Alert.alert", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.AlertDescription.alertDescription", "Parsers.Alert.Mkalert", "Parsers.AlertLevel.Fatal", "Parsers.Alert.alert" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let fatalAlert ad =", "completed_definiton": "{ level = Fatal; description = ad }", "isa_cross_project_example": true }, { "file_name": "TLSError.fst", "name": "TLSError.resT", "original_source_type": "val resT: r:result 'a { FStar.Error.Correct? r } -> Tot 'a", "source_type": "val resT: r:result 'a { FStar.Error.Correct? r } -> Tot 'a", "source_definition": "let resT (FStar.Error.Correct v) = v", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/TLSError.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 61, "start_col": 35, "end_line": 61, "end_col": 36 }, "file_context": "\ufeffmodule TLSError\nopen FStar.String\n(* TLS explicitly returns run-time errors:\n results carry either values or error descriptions *)\n\ninclude Parsers.AlertDescription\ninclude Parsers.AlertLevel\ninclude Parsers.Alert\n\nlet string_of_alertDescription (a:alertDescription) = \"alertDescription\"\nlet string_of_alertLevel (a:alertLevel) = \"alertLevel\"\nlet string_of_alert (a:alert) = \n \"level=\"^string_of_alertLevel a.level^\n \"description=\"^string_of_alertDescription a.description\n\nlet fatalAlert ad = {level=Fatal; description=ad}\n\n(* TODO functions checking consistency of levels and descriptions *)\n\n// let isFatal ad =\n// match ad with\n// | AD_unexpected_message\n// | AD_bad_record_mac\n// | AD_decryption_failed\n// | AD_record_overflow\n// | AD_decompression_failure\n// | AD_handshake_failure\n// | AD_bad_certificate_fatal\n// | AD_unsupported_certificate_fatal\n// | AD_certificate_revoked_fatal\n// | AD_certificate_expired_fatal\n// | AD_certificate_unknown_fatal\n// | AD_illegal_parameter\n// | AD_unknown_ca\n// | AD_access_denied\n// | AD_decode_error\n// | AD_decrypt_error\n// | AD_export_restriction\n// | AD_protocol_version\n// | AD_insufficient_security\n// | AD_internal_error\n// | AD_user_cancelled_fatal\n// | AD_missing_extension\n// | AD_unsupported_extension\n// | AD_no_application_protocol -> true\n// | _ -> false\n\ntype error = alert * string\nlet string_of_error (a,s)= string_of_alertDescription a.description^\" (\"^s^\")\"\n\ntype result 'a = FStar.Error.optResult error 'a\n\nopen FStar.Error\nlet string_of_result f = function\n | Error z -> \"Error: \"^string_of_error z\n | Correct v -> f v\n\nlet fatal #t a s: result t = Error(fatalAlert a, s)", "dependencies": { "source_file": "TLSError.fst", "checked_file": "TLSError.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.AlertLevel.fsti.checked", "Parsers.AlertDescription.fsti.checked", "Parsers.Alert.fsti.checked", "FStar.String.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Alert" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "FStar.String" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "r: TLSError.result 'a {Correct? r} -> 'a", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "TLSError.result", "Prims.b2t", "FStar.Error.uu___is_Correct", "TLSError.error" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val resT: r:result 'a { FStar.Error.Correct? r } -> Tot 'a\nlet resT (FStar.Error.Correct v) =", "completed_definiton": "v", "isa_cross_project_example": true }, { "file_name": "TLSError.fst", "name": "TLSError.bindResult", "original_source_type": "val bindResult: ('a -> Tot (result 'b)) -> result 'a -> Tot (result 'b)", "source_type": "val bindResult: ('a -> Tot (result 'b)) -> result 'a -> Tot (result 'b)", "source_definition": "let bindResult f r =\n (match r with\n | Error z -> Error z\n | Correct c -> f c)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/TLSError.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 73, "start_col": 3, "end_line": 75, "end_col": 23 }, "file_context": "\ufeffmodule TLSError\nopen FStar.String\n(* TLS explicitly returns run-time errors:\n results carry either values or error descriptions *)\n\ninclude Parsers.AlertDescription\ninclude Parsers.AlertLevel\ninclude Parsers.Alert\n\nlet string_of_alertDescription (a:alertDescription) = \"alertDescription\"\nlet string_of_alertLevel (a:alertLevel) = \"alertLevel\"\nlet string_of_alert (a:alert) = \n \"level=\"^string_of_alertLevel a.level^\n \"description=\"^string_of_alertDescription a.description\n\nlet fatalAlert ad = {level=Fatal; description=ad}\n\n(* TODO functions checking consistency of levels and descriptions *)\n\n// let isFatal ad =\n// match ad with\n// | AD_unexpected_message\n// | AD_bad_record_mac\n// | AD_decryption_failed\n// | AD_record_overflow\n// | AD_decompression_failure\n// | AD_handshake_failure\n// | AD_bad_certificate_fatal\n// | AD_unsupported_certificate_fatal\n// | AD_certificate_revoked_fatal\n// | AD_certificate_expired_fatal\n// | AD_certificate_unknown_fatal\n// | AD_illegal_parameter\n// | AD_unknown_ca\n// | AD_access_denied\n// | AD_decode_error\n// | AD_decrypt_error\n// | AD_export_restriction\n// | AD_protocol_version\n// | AD_insufficient_security\n// | AD_internal_error\n// | AD_user_cancelled_fatal\n// | AD_missing_extension\n// | AD_unsupported_extension\n// | AD_no_application_protocol -> true\n// | _ -> false\n\ntype error = alert * string\nlet string_of_error (a,s)= string_of_alertDescription a.description^\" (\"^s^\")\"\n\ntype result 'a = FStar.Error.optResult error 'a\n\nopen FStar.Error\nlet string_of_result f = function\n | Error z -> \"Error: \"^string_of_error z\n | Correct v -> f v\n\nlet fatal #t a s: result t = Error(fatalAlert a, s)\n\nval resT: r:result 'a { FStar.Error.Correct? r } -> Tot 'a\nlet resT (FStar.Error.Correct v) = v\n\ninline_for_extraction\nval mapResult: ('a -> Tot 'b) -> result 'a -> Tot (result 'b)\ninline_for_extraction\nlet mapResult f r =\n (match r with\n | Error z -> Error z\n | Correct c -> Correct (f c))\n\nval bindResult: ('a -> Tot (result 'b)) -> result 'a -> Tot (result 'b)", "dependencies": { "source_file": "TLSError.fst", "checked_file": "TLSError.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.AlertLevel.fsti.checked", "Parsers.AlertDescription.fsti.checked", "Parsers.Alert.fsti.checked", "FStar.String.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Alert" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "FStar.String" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "f: (_: 'a -> TLSError.result 'b) -> r: TLSError.result 'a -> TLSError.result 'b", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "TLSError.result", "TLSError.error", "FStar.Error.Error" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val bindResult: ('a -> Tot (result 'b)) -> result 'a -> Tot (result 'b)\nlet bindResult f r =", "completed_definiton": "(match r with\n | Error z -> Error z\n | Correct c -> f c)", "isa_cross_project_example": true }, { "file_name": "TLSError.fst", "name": "TLSError.resultBind", "original_source_type": "val resultBind: result 'a -> ('a -> Tot (result 'b)) -> Tot (result 'b)", "source_type": "val resultBind: result 'a -> ('a -> Tot (result 'b)) -> Tot (result 'b)", "source_definition": "let resultBind r f =\n (match r with\n | Error z -> Error z\n | Correct c -> f c)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/TLSError.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 85, "start_col": 3, "end_line": 87, "end_col": 23 }, "file_context": "\ufeffmodule TLSError\nopen FStar.String\n(* TLS explicitly returns run-time errors:\n results carry either values or error descriptions *)\n\ninclude Parsers.AlertDescription\ninclude Parsers.AlertLevel\ninclude Parsers.Alert\n\nlet string_of_alertDescription (a:alertDescription) = \"alertDescription\"\nlet string_of_alertLevel (a:alertLevel) = \"alertLevel\"\nlet string_of_alert (a:alert) = \n \"level=\"^string_of_alertLevel a.level^\n \"description=\"^string_of_alertDescription a.description\n\nlet fatalAlert ad = {level=Fatal; description=ad}\n\n(* TODO functions checking consistency of levels and descriptions *)\n\n// let isFatal ad =\n// match ad with\n// | AD_unexpected_message\n// | AD_bad_record_mac\n// | AD_decryption_failed\n// | AD_record_overflow\n// | AD_decompression_failure\n// | AD_handshake_failure\n// | AD_bad_certificate_fatal\n// | AD_unsupported_certificate_fatal\n// | AD_certificate_revoked_fatal\n// | AD_certificate_expired_fatal\n// | AD_certificate_unknown_fatal\n// | AD_illegal_parameter\n// | AD_unknown_ca\n// | AD_access_denied\n// | AD_decode_error\n// | AD_decrypt_error\n// | AD_export_restriction\n// | AD_protocol_version\n// | AD_insufficient_security\n// | AD_internal_error\n// | AD_user_cancelled_fatal\n// | AD_missing_extension\n// | AD_unsupported_extension\n// | AD_no_application_protocol -> true\n// | _ -> false\n\ntype error = alert * string\nlet string_of_error (a,s)= string_of_alertDescription a.description^\" (\"^s^\")\"\n\ntype result 'a = FStar.Error.optResult error 'a\n\nopen FStar.Error\nlet string_of_result f = function\n | Error z -> \"Error: \"^string_of_error z\n | Correct v -> f v\n\nlet fatal #t a s: result t = Error(fatalAlert a, s)\n\nval resT: r:result 'a { FStar.Error.Correct? r } -> Tot 'a\nlet resT (FStar.Error.Correct v) = v\n\ninline_for_extraction\nval mapResult: ('a -> Tot 'b) -> result 'a -> Tot (result 'b)\ninline_for_extraction\nlet mapResult f r =\n (match r with\n | Error z -> Error z\n | Correct c -> Correct (f c))\n\nval bindResult: ('a -> Tot (result 'b)) -> result 'a -> Tot (result 'b)\nlet bindResult f r =\n (match r with\n | Error z -> Error z\n | Correct c -> f c)\n\nval resultMap: result 'a -> ('a -> Tot 'b) -> Tot (result 'b)\nlet resultMap r f =\n (match r with\n | Error z -> Error z\n | Correct c -> Correct (f c))\n\nval resultBind: result 'a -> ('a -> Tot (result 'b)) -> Tot (result 'b)", "dependencies": { "source_file": "TLSError.fst", "checked_file": "TLSError.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.AlertLevel.fsti.checked", "Parsers.AlertDescription.fsti.checked", "Parsers.Alert.fsti.checked", "FStar.String.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Alert" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "FStar.String" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "r: TLSError.result 'a -> f: (_: 'a -> TLSError.result 'b) -> TLSError.result 'b", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "TLSError.result", "TLSError.error", "FStar.Error.Error" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val resultBind: result 'a -> ('a -> Tot (result 'b)) -> Tot (result 'b)\nlet resultBind r f =", "completed_definiton": "(match r with\n | Error z -> Error z\n | Correct c -> f c)", "isa_cross_project_example": true }, { "file_name": "TLSError.fst", "name": "TLSError.resultMap", "original_source_type": "val resultMap: result 'a -> ('a -> Tot 'b) -> Tot (result 'b)", "source_type": "val resultMap: result 'a -> ('a -> Tot 'b) -> Tot (result 'b)", "source_definition": "let resultMap r f =\n (match r with\n | Error z -> Error z\n | Correct c -> Correct (f c))", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/TLSError.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 79, "start_col": 3, "end_line": 81, "end_col": 33 }, "file_context": "\ufeffmodule TLSError\nopen FStar.String\n(* TLS explicitly returns run-time errors:\n results carry either values or error descriptions *)\n\ninclude Parsers.AlertDescription\ninclude Parsers.AlertLevel\ninclude Parsers.Alert\n\nlet string_of_alertDescription (a:alertDescription) = \"alertDescription\"\nlet string_of_alertLevel (a:alertLevel) = \"alertLevel\"\nlet string_of_alert (a:alert) = \n \"level=\"^string_of_alertLevel a.level^\n \"description=\"^string_of_alertDescription a.description\n\nlet fatalAlert ad = {level=Fatal; description=ad}\n\n(* TODO functions checking consistency of levels and descriptions *)\n\n// let isFatal ad =\n// match ad with\n// | AD_unexpected_message\n// | AD_bad_record_mac\n// | AD_decryption_failed\n// | AD_record_overflow\n// | AD_decompression_failure\n// | AD_handshake_failure\n// | AD_bad_certificate_fatal\n// | AD_unsupported_certificate_fatal\n// | AD_certificate_revoked_fatal\n// | AD_certificate_expired_fatal\n// | AD_certificate_unknown_fatal\n// | AD_illegal_parameter\n// | AD_unknown_ca\n// | AD_access_denied\n// | AD_decode_error\n// | AD_decrypt_error\n// | AD_export_restriction\n// | AD_protocol_version\n// | AD_insufficient_security\n// | AD_internal_error\n// | AD_user_cancelled_fatal\n// | AD_missing_extension\n// | AD_unsupported_extension\n// | AD_no_application_protocol -> true\n// | _ -> false\n\ntype error = alert * string\nlet string_of_error (a,s)= string_of_alertDescription a.description^\" (\"^s^\")\"\n\ntype result 'a = FStar.Error.optResult error 'a\n\nopen FStar.Error\nlet string_of_result f = function\n | Error z -> \"Error: \"^string_of_error z\n | Correct v -> f v\n\nlet fatal #t a s: result t = Error(fatalAlert a, s)\n\nval resT: r:result 'a { FStar.Error.Correct? r } -> Tot 'a\nlet resT (FStar.Error.Correct v) = v\n\ninline_for_extraction\nval mapResult: ('a -> Tot 'b) -> result 'a -> Tot (result 'b)\ninline_for_extraction\nlet mapResult f r =\n (match r with\n | Error z -> Error z\n | Correct c -> Correct (f c))\n\nval bindResult: ('a -> Tot (result 'b)) -> result 'a -> Tot (result 'b)\nlet bindResult f r =\n (match r with\n | Error z -> Error z\n | Correct c -> f c)\n\nval resultMap: result 'a -> ('a -> Tot 'b) -> Tot (result 'b)", "dependencies": { "source_file": "TLSError.fst", "checked_file": "TLSError.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.AlertLevel.fsti.checked", "Parsers.AlertDescription.fsti.checked", "Parsers.Alert.fsti.checked", "FStar.String.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Alert" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "FStar.String" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "r: TLSError.result 'a -> f: (_: 'a -> 'b) -> TLSError.result 'b", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "TLSError.result", "TLSError.error", "FStar.Error.Error", "FStar.Error.Correct" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val resultMap: result 'a -> ('a -> Tot 'b) -> Tot (result 'b)\nlet resultMap r f =", "completed_definiton": "(match r with\n | Error z -> Error z\n | Correct c -> Correct (f c))", "isa_cross_project_example": true }, { "file_name": "TLSError.fst", "name": "TLSError.mapResult", "original_source_type": "val mapResult: ('a -> Tot 'b) -> result 'a -> Tot (result 'b)", "source_type": "val mapResult: ('a -> Tot 'b) -> result 'a -> Tot (result 'b)", "source_definition": "let mapResult f r =\n (match r with\n | Error z -> Error z\n | Correct c -> Correct (f c))", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/TLSError.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 67, "start_col": 3, "end_line": 69, "end_col": 33 }, "file_context": "\ufeffmodule TLSError\nopen FStar.String\n(* TLS explicitly returns run-time errors:\n results carry either values or error descriptions *)\n\ninclude Parsers.AlertDescription\ninclude Parsers.AlertLevel\ninclude Parsers.Alert\n\nlet string_of_alertDescription (a:alertDescription) = \"alertDescription\"\nlet string_of_alertLevel (a:alertLevel) = \"alertLevel\"\nlet string_of_alert (a:alert) = \n \"level=\"^string_of_alertLevel a.level^\n \"description=\"^string_of_alertDescription a.description\n\nlet fatalAlert ad = {level=Fatal; description=ad}\n\n(* TODO functions checking consistency of levels and descriptions *)\n\n// let isFatal ad =\n// match ad with\n// | AD_unexpected_message\n// | AD_bad_record_mac\n// | AD_decryption_failed\n// | AD_record_overflow\n// | AD_decompression_failure\n// | AD_handshake_failure\n// | AD_bad_certificate_fatal\n// | AD_unsupported_certificate_fatal\n// | AD_certificate_revoked_fatal\n// | AD_certificate_expired_fatal\n// | AD_certificate_unknown_fatal\n// | AD_illegal_parameter\n// | AD_unknown_ca\n// | AD_access_denied\n// | AD_decode_error\n// | AD_decrypt_error\n// | AD_export_restriction\n// | AD_protocol_version\n// | AD_insufficient_security\n// | AD_internal_error\n// | AD_user_cancelled_fatal\n// | AD_missing_extension\n// | AD_unsupported_extension\n// | AD_no_application_protocol -> true\n// | _ -> false\n\ntype error = alert * string\nlet string_of_error (a,s)= string_of_alertDescription a.description^\" (\"^s^\")\"\n\ntype result 'a = FStar.Error.optResult error 'a\n\nopen FStar.Error\nlet string_of_result f = function\n | Error z -> \"Error: \"^string_of_error z\n | Correct v -> f v\n\nlet fatal #t a s: result t = Error(fatalAlert a, s)\n\nval resT: r:result 'a { FStar.Error.Correct? r } -> Tot 'a\nlet resT (FStar.Error.Correct v) = v\n\ninline_for_extraction\nval mapResult: ('a -> Tot 'b) -> result 'a -> Tot (result 'b)\ninline_for_extraction", "dependencies": { "source_file": "TLSError.fst", "checked_file": "TLSError.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.AlertLevel.fsti.checked", "Parsers.AlertDescription.fsti.checked", "Parsers.Alert.fsti.checked", "FStar.String.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Alert" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "FStar.String" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "f: (_: 'a -> 'b) -> r: TLSError.result 'a -> TLSError.result 'b", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "TLSError.result", "TLSError.error", "FStar.Error.Error", "FStar.Error.Correct" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val mapResult: ('a -> Tot 'b) -> result 'a -> Tot (result 'b)\nlet mapResult f r =", "completed_definiton": "(match r with\n | Error z -> Error z\n | Correct c -> Correct (f c))", "isa_cross_project_example": true }, { "file_name": "TLSError.fst", "name": "TLSError.string_of_result", "original_source_type": "", "source_type": "val string_of_result : f: (_: _ -> Prims.string) -> _: FStar.Error.optResult (Parsers.Alert.alert * Prims.string) _\n -> Prims.string", "source_definition": "let string_of_result f = function\n | Error z -> \"Error: \"^string_of_error z\n | Correct v -> f v", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/TLSError.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 54, "start_col": 25, "end_line": 56, "end_col": 20 }, "file_context": "\ufeffmodule TLSError\nopen FStar.String\n(* TLS explicitly returns run-time errors:\n results carry either values or error descriptions *)\n\ninclude Parsers.AlertDescription\ninclude Parsers.AlertLevel\ninclude Parsers.Alert\n\nlet string_of_alertDescription (a:alertDescription) = \"alertDescription\"\nlet string_of_alertLevel (a:alertLevel) = \"alertLevel\"\nlet string_of_alert (a:alert) = \n \"level=\"^string_of_alertLevel a.level^\n \"description=\"^string_of_alertDescription a.description\n\nlet fatalAlert ad = {level=Fatal; description=ad}\n\n(* TODO functions checking consistency of levels and descriptions *)\n\n// let isFatal ad =\n// match ad with\n// | AD_unexpected_message\n// | AD_bad_record_mac\n// | AD_decryption_failed\n// | AD_record_overflow\n// | AD_decompression_failure\n// | AD_handshake_failure\n// | AD_bad_certificate_fatal\n// | AD_unsupported_certificate_fatal\n// | AD_certificate_revoked_fatal\n// | AD_certificate_expired_fatal\n// | AD_certificate_unknown_fatal\n// | AD_illegal_parameter\n// | AD_unknown_ca\n// | AD_access_denied\n// | AD_decode_error\n// | AD_decrypt_error\n// | AD_export_restriction\n// | AD_protocol_version\n// | AD_insufficient_security\n// | AD_internal_error\n// | AD_user_cancelled_fatal\n// | AD_missing_extension\n// | AD_unsupported_extension\n// | AD_no_application_protocol -> true\n// | _ -> false\n\ntype error = alert * string\nlet string_of_error (a,s)= string_of_alertDescription a.description^\" (\"^s^\")\"\n\ntype result 'a = FStar.Error.optResult error 'a", "dependencies": { "source_file": "TLSError.fst", "checked_file": "TLSError.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.AlertLevel.fsti.checked", "Parsers.AlertDescription.fsti.checked", "Parsers.Alert.fsti.checked", "FStar.String.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Alert" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "FStar.String" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "f: (_: _ -> Prims.string) -> _: FStar.Error.optResult (Parsers.Alert.alert * Prims.string) _\n -> Prims.string", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.string", "FStar.Error.optResult", "FStar.Pervasives.Native.tuple2", "Parsers.Alert.alert", "Prims.op_Hat", "TLSError.string_of_error" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let string_of_result f =", "completed_definiton": "function\n| Error z -> \"Error: \" ^ string_of_error z\n| Correct v -> f v", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.hex1", "original_source_type": "", "source_type": "val hex1 : x: FStar.UInt8.t{x <^ 16uy} -> Prims.string", "source_definition": "let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 50, "start_col": 2, "end_line": 56, "end_col": 34 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: FStar.UInt8.t{x <^ 16uy} -> Prims.string", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt8.t", "Prims.b2t", "FStar.UInt8.op_Less_Hat", "FStar.UInt8.__uint_to_t", "FStar.UInt8.to_string", "Prims.bool", "Prims.op_Equality", "Prims.string" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let hex1 (x: UInt8.t{let open FStar.UInt8 in x <^ 16uy}) =", "completed_definiton": "let open FStar.UInt8 in\nif x <^ 10uy\nthen UInt8.to_string x\nelse\n if x = 10uy\n then \"a\"\n else\n if x = 11uy\n then \"b\"\n else if x = 12uy then \"c\" else if x = 13uy then \"d\" else if x = 14uy then \"e\" else \"f\"", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.u32", "original_source_type": "", "source_type": "val u32 : Prims.eqtype", "source_definition": "let u32 = UInt32.t", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 24, "start_col": 10, "end_line": 24, "end_col": 18 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.eqtype", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let u32 =", "completed_definiton": "UInt32.t", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.u8", "original_source_type": "", "source_type": "val u8 : Prims.eqtype", "source_definition": "let u8 = UInt8.t", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 23, "start_col": 10, "end_line": 23, "end_col": 17 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.eqtype", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt8.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let u8 =", "completed_definiton": "UInt8.t", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.u64", "original_source_type": "", "source_type": "val u64 : Prims.eqtype", "source_definition": "let u64 = UInt64.t", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 25, "start_col": 10, "end_line": 25, "end_col": 18 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.eqtype", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt64.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let u64 =", "completed_definiton": "UInt64.t", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.little_endian", "original_source_type": "", "source_type": "val little_endian : b: Crypto.Symmetric.Bytes.bytes -> Prims.nat", "source_definition": "let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 146, "start_col": 52, "end_line": 146, "end_col": 88 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 20, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: Crypto.Symmetric.Bytes.bytes -> Prims.nat", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Crypto.Symmetric.Bytes.bytes", "FStar.Old.Endianness.little_endian", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let little_endian (b: bytes) =", "completed_definiton": "FStar.Old.Endianness.little_endian b", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.big_endian", "original_source_type": "", "source_type": "val big_endian : b: Crypto.Symmetric.Bytes.bytes -> Prims.nat", "source_definition": "let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 153, "start_col": 49, "end_line": 153, "end_col": 82 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 20, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: Crypto.Symmetric.Bytes.bytes -> Prims.nat", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Crypto.Symmetric.Bytes.bytes", "FStar.Old.Endianness.big_endian", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let big_endian (b: bytes) =", "completed_definiton": "FStar.Old.Endianness.big_endian b", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.hex2", "original_source_type": "", "source_type": "val hex2 : x: FStar.UInt8.t -> Prims.string", "source_definition": "let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 58, "start_col": 2, "end_line": 58, "end_col": 51 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: FStar.UInt8.t -> Prims.string", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt8.t", "Prims.op_Hat", "Crypto.Symmetric.Bytes.hex1", "FStar.UInt8.op_Slash_Hat", "FStar.UInt8.__uint_to_t", "FStar.UInt8.op_Percent_Hat", "Prims.string" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let hex2 x =", "completed_definiton": "let open FStar.UInt8 in hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy)", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.little_endian_singleton", "original_source_type": "val little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)", "source_type": "val little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)", "source_definition": "let little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 177, "start_col": 32, "end_line": 177, "end_col": 78 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "n: FStar.UInt8.t\n -> FStar.Pervasives.Lemma\n (ensures Crypto.Symmetric.Bytes.little_endian (FStar.Seq.Base.create 1 n) == FStar.UInt8.v n)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt8.t", "FStar.Old.Endianness.little_endian_singleton", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n =", "completed_definiton": "FStar.Old.Endianness.little_endian_singleton n", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.uint8_to_uint128", "original_source_type": "val uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})", "source_type": "val uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})", "source_definition": "let uint8_to_uint128 a = uint64_to_uint128 (uint8_to_uint64 a)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 345, "start_col": 25, "end_line": 345, "end_col": 62 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b\n(* [SMTPat (big_endian b)] *)\n(* let rec lemma_big_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 0 (Seq.length b - 1) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_big_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.last b) < pow2 8); *)\n(* assert(big_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8); *)\n(* assert(big_endian b <= pow2 8 * (big_endian s + 1)); *)\n(* assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b = FStar.Old.Endianness.lemma_little_endian_lt_2_128 b\n (* lemma_little_endian_is_bounded b; *)\n (* if Seq.length b = 16 then () *)\n (* else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b) *)\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\n(* REMARK: The trigger in lemma_little_endian_lt_2_128 is used to prove absence of\n overflow *)\n(** Loads a machine integer from a buffer of len bytes *)\nval load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nlet rec load_uint32 len buf =\n if len = 0ul then 0ul\n else\n let h = ST.get () in\n let len = len -^ 1ul in\n let m = load_uint32 len (sub buf 1ul len) in\n lemma_little_endian_is_bounded (sel_bytes h len (sub buf 1ul len));\n assert (UInt32.v len <= 3);\n assert (UInt32.v m < pow2 (8 * (UInt32.v len)));\n FStar.Math.Lemmas.pow2_le_compat (8 * 3) (8 * (UInt32.v len));\n FStar.Math.Lemmas.pow2_plus 8 (8 * 3);\n assert (pow2 (8 * (UInt32.v len)) <= pow2 (8 * 3));\n assert (pow2 8 * pow2 (8 * 3) = UInt.max_int 32 + 1);\n assert (UInt32.v m * pow2 8 <= UInt.max_int 32);\n let b = buf.(0ul) in\n assert_norm (pow2 8 == 256);\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ m)\n\nval load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big32 len buf =\n if len = 0ul then 0ul\n else\n let len = len -^ 1ul in\n let n = load_big32 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n' *)\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ n')\n\n(** Used e.g. for converting TLS sequence numbers into AEAD nonces *)\n#reset-options \"--z3rlimit 100\"\nval load_big64: len:UInt32.t { v len <= 8 } -> buf:lbuffer (v len) -> ST UInt64.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt64.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big64 len buf =\n if len = 0ul then 0UL\n else\n let len = len -^ 1ul in\n let n = load_big64 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt64, so was shadowed, so renamed into n' *)\n FStar.UInt64.(uint8_to_uint64 b +^ 256UL *^ n')\n\n\n(* TODO: Add to FStar.Int.Cast and KaRaMeL and OCaml implementations *)", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: FStar.UInt8.t -> b: FStar.UInt128.t{FStar.UInt128.v b == FStar.UInt8.v a}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt8.t", "FStar.Int.Cast.Full.uint64_to_uint128", "FStar.Int.Cast.uint8_to_uint64", "FStar.UInt128.t", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt128.n", "FStar.UInt8.n", "FStar.UInt128.v", "FStar.UInt8.v" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a =", "completed_definiton": "uint64_to_uint128 (uint8_to_uint64 a)", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.lemma_little_endian_lt_2_128", "original_source_type": "val lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]", "source_type": "val lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]", "source_definition": "let lemma_little_endian_lt_2_128 b = FStar.Old.Endianness.lemma_little_endian_lt_2_128 b", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 274, "start_col": 37, "end_line": 274, "end_col": 88 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b\n(* [SMTPat (big_endian b)] *)\n(* let rec lemma_big_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 0 (Seq.length b - 1) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_big_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.last b) < pow2 8); *)\n(* assert(big_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8); *)\n(* assert(big_endian b <= pow2 8 * (big_endian s + 1)); *)\n(* assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: Crypto.Symmetric.Bytes.bytes{FStar.Seq.Base.length b <= 16}\n -> FStar.Pervasives.Lemma (ensures Crypto.Symmetric.Bytes.little_endian b < Prims.pow2 128)\n [SMTPat (Crypto.Symmetric.Bytes.little_endian b)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Crypto.Symmetric.Bytes.bytes", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "FStar.UInt8.t", "FStar.Old.Endianness.lemma_little_endian_lt_2_128", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b =", "completed_definiton": "FStar.Old.Endianness.lemma_little_endian_lt_2_128 b", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.print_buffer", "original_source_type": "val print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))", "source_type": "val print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))", "source_definition": "let rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 64, "start_col": 2, "end_line": 70, "end_col": 6 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n s: Crypto.Symmetric.Bytes.buffer ->\n i: FStar.UInt32.t{FStar.UInt32.v i <= FStar.Buffer.length s} ->\n len: FStar.UInt32.t{FStar.UInt32.v len <= FStar.Buffer.length s}\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Crypto.Symmetric.Bytes.buffer", "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "FStar.Buffer.length", "FStar.UInt8.t", "FStar.UInt32.op_Less_Hat", "Prims.unit", "Crypto.Symmetric.Bytes.print_buffer", "FStar.UInt32.op_Plus_Hat", "FStar.UInt32.__uint_to_t", "Prims.bool", "FStar.IO.debug_print_string", "Prims.op_Hat", "Crypto.Symmetric.Bytes.hex2", "Prims.string", "Prims.op_BarBar", "FStar.UInt32.op_Equals_Hat", "FStar.UInt32.op_Percent_Hat", "Prims.op_Equality", "FStar.Buffer.index" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =", "completed_definiton": "let open FStar.UInt32 in\nif i <^ len\nthen\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.little_endian_null", "original_source_type": "val little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)", "source_type": "val little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)", "source_definition": "let little_endian_null len = FStar.Old.Endianness.little_endian_null len", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 163, "start_col": 29, "end_line": 163, "end_col": 72 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "len: Prims.nat{len < 16}\n -> FStar.Pervasives.Lemma\n (ensures Crypto.Symmetric.Bytes.little_endian (FStar.Seq.Base.create len 0uy) == 0)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "FStar.Old.Endianness.little_endian_null", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len =", "completed_definiton": "FStar.Old.Endianness.little_endian_null len", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.little_endian_append", "original_source_type": "val little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)", "source_type": "val little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)", "source_definition": "let little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 187, "start_col": 33, "end_line": 187, "end_col": 80 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w1: Crypto.Symmetric.Bytes.bytes -> w2: Crypto.Symmetric.Bytes.bytes\n -> FStar.Pervasives.Lemma\n (ensures\n Crypto.Symmetric.Bytes.little_endian (FStar.Seq.Base.append w1 w2) ==\n Crypto.Symmetric.Bytes.little_endian w1 +\n Prims.pow2 (8 * FStar.Seq.Base.length w1) * Crypto.Symmetric.Bytes.little_endian w2)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Crypto.Symmetric.Bytes.bytes", "FStar.Old.Endianness.little_endian_append", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 =", "completed_definiton": "FStar.Old.Endianness.little_endian_append w1 w2", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.uint128_to_uint8", "original_source_type": "val uint128_to_uint8 (a: UInt128.t) : Tot (b: UInt8.t{UInt8.v b == UInt128.v a % pow2 8})", "source_type": "val uint128_to_uint8 (a: UInt128.t) : Tot (b: UInt8.t{UInt8.v b == UInt128.v a % pow2 8})", "source_definition": "let uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 47, "start_col": 4, "end_line": 47, "end_col": 41 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: FStar.UInt128.t -> b: FStar.UInt8.t{FStar.UInt8.v b == FStar.UInt128.v a % Prims.pow2 8}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt128.t", "FStar.Int.Cast.uint64_to_uint8", "FStar.Int.Cast.Full.uint128_to_uint64", "FStar.UInt8.t", "Prims.eq2", "Prims.int", "FStar.UInt8.v", "Prims.op_Modulus", "FStar.UInt128.v", "Prims.pow2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val uint128_to_uint8 (a: UInt128.t) : Tot (b: UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\nlet uint128_to_uint8 (a: UInt128.t) : Tot (b: UInt8.t{UInt8.v b == UInt128.v a % pow2 8}) =", "completed_definiton": "uint64_to_uint8 (uint128_to_uint64 a)", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.lemma_little_endian_is_bounded", "original_source_type": "val lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))", "source_type": "val lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))", "source_definition": "let lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 226, "start_col": 39, "end_line": 226, "end_col": 92 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: Crypto.Symmetric.Bytes.bytes\n -> FStar.Pervasives.Lemma\n (ensures Crypto.Symmetric.Bytes.little_endian b < Prims.pow2 (8 * FStar.Seq.Base.length b))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Crypto.Symmetric.Bytes.bytes", "FStar.Old.Endianness.lemma_little_endian_is_bounded", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b =", "completed_definiton": "FStar.Old.Endianness.lemma_little_endian_is_bounded b", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.lemma_little_endian_is_injective_2", "original_source_type": "val lemma_little_endian_is_injective_2: b:word -> len:pos{len <= length b} -> Lemma\n (let s = slice b (length b - len) (length b) in\n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n s'' == s')", "source_type": "val lemma_little_endian_is_injective_2: b:word -> len:pos{len <= length b} -> Lemma\n (let s = slice b (length b - len) (length b) in\n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n s'' == s')", "source_definition": "let lemma_little_endian_is_injective_2 b len =\n let s = slice b (length b - len) (length b) in\n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n lemma_eq_intro s' s''", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 631, "start_col": 46, "end_line": 635, "end_col": 23 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b\n(* [SMTPat (big_endian b)] *)\n(* let rec lemma_big_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 0 (Seq.length b - 1) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_big_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.last b) < pow2 8); *)\n(* assert(big_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8); *)\n(* assert(big_endian b <= pow2 8 * (big_endian s + 1)); *)\n(* assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b = FStar.Old.Endianness.lemma_little_endian_lt_2_128 b\n (* lemma_little_endian_is_bounded b; *)\n (* if Seq.length b = 16 then () *)\n (* else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b) *)\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\n(* REMARK: The trigger in lemma_little_endian_lt_2_128 is used to prove absence of\n overflow *)\n(** Loads a machine integer from a buffer of len bytes *)\nval load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nlet rec load_uint32 len buf =\n if len = 0ul then 0ul\n else\n let h = ST.get () in\n let len = len -^ 1ul in\n let m = load_uint32 len (sub buf 1ul len) in\n lemma_little_endian_is_bounded (sel_bytes h len (sub buf 1ul len));\n assert (UInt32.v len <= 3);\n assert (UInt32.v m < pow2 (8 * (UInt32.v len)));\n FStar.Math.Lemmas.pow2_le_compat (8 * 3) (8 * (UInt32.v len));\n FStar.Math.Lemmas.pow2_plus 8 (8 * 3);\n assert (pow2 (8 * (UInt32.v len)) <= pow2 (8 * 3));\n assert (pow2 8 * pow2 (8 * 3) = UInt.max_int 32 + 1);\n assert (UInt32.v m * pow2 8 <= UInt.max_int 32);\n let b = buf.(0ul) in\n assert_norm (pow2 8 == 256);\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ m)\n\nval load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big32 len buf =\n if len = 0ul then 0ul\n else\n let len = len -^ 1ul in\n let n = load_big32 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n' *)\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ n')\n\n(** Used e.g. for converting TLS sequence numbers into AEAD nonces *)\n#reset-options \"--z3rlimit 100\"\nval load_big64: len:UInt32.t { v len <= 8 } -> buf:lbuffer (v len) -> ST UInt64.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt64.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big64 len buf =\n if len = 0ul then 0UL\n else\n let len = len -^ 1ul in\n let n = load_big64 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt64, so was shadowed, so renamed into n' *)\n FStar.UInt64.(uint8_to_uint64 b +^ 256UL *^ n')\n\n\n(* TODO: Add to FStar.Int.Cast and KaRaMeL and OCaml implementations *)\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = uint64_to_uint128 (uint8_to_uint64 a)\n\nval load_uint128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec load_uint128 len buf =\n if len = 0ul then uint64_to_uint128 0UL // Need 128-bit constants?\n else\n let n = load_uint128 (len -^ 1ul) (sub buf 1ul (len -^ 1ul)) in\n let b = buf.(0ul) in\n let h = ST.get () in\n lemma_little_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 1ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n\nval load_big128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big128 len buf =\n if len = 0ul then uint64_to_uint128 0UL\n else\n let n = load_big128 (len -^ 1ul) (sub buf 0ul (len -^ 1ul)) in\n let b = buf.(len -^ 1ul) in\n let h = ST.get () in\n lemma_big_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 0ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n(* stores a machine integer into a buffer of len bytes *)\n// 16-10-02 subsumes Buffer.Utils.bytes_of_uint32 ?\n// check efficient compilation for all back-ends\nval store_uint32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint32 len buf' n';\n buf.(0ul) <- b // updating after the recursive call helps verification\n\nval store_big32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec store_big32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big32 len buf' n';\n buf.(len) <- b // updating after the recursive call helps verification\n\nnoextract val uint32_bytes:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == little_endian b}) (decreases (v len))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nlet rec uint32_bytes len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = little_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_bytes len n' in\n assert (little_endian b' = UInt32.v n');\n let res = Seq.cons byte b' in\n assert (Seq.equal (Seq.tail res) b'); //NS: added 05/15, cf #1028\n res\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 1 --max_ifuel 1 --z3rlimit 50\"\nnoextract val uint32_be:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == big_endian b}) (decreases (v len))\n\nlet rec uint32_be len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = big_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_be len n'\n in\n let res = Seq.snoc b' byte in\n let b0, last = Seq.un_snoc res in\n assert (Seq.equal b0 b'); //NS: added 05/15, cf #1028\n res\n\n// turns an integer into a bytestream, little-endian\ninline_for_extraction val little_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b})(* (decreases (v len)) *)\ninline_for_extraction let little_bytes len n = FStar.Old.Endianness.little_bytes len n\n(* let rec little_bytes len n = *)\n(* if len = 0ul then *)\n(* Seq.empty *)\n(* else *)\n(* let len = len -^ 1ul in *)\n(* let byte = UInt8.uint_to_t (n % 256) in *)\n(* let n' = n / 256 in *)\n(* Math.Lemmas.pow2_plus 8 (8 * v len); *)\n(* assert(n' < pow2 (8 * v len )); *)\n(* let b' = little_bytes len n' in *)\n(* let b = cons byte b' in *)\n(* assert(Seq.equal b' (tail b)); *)\n(* b *)\n\n#reset-options \"--z3rlimit 400\"\n\n// turns an integer into a bytestream, big-endian\nval big_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == big_endian b}) (decreases (v len))\nlet rec big_bytes len n =\n if len = 0ul then\n Seq.empty\n else\n let len = len -^ 1ul in\n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert(n' < pow2 (8 * v len ));\n let b' = big_bytes len n' in\n let b'' = Seq.create 1 byte in\n let b = Seq.append b' b'' in\n assert(Seq.equal b' (Seq.slice b 0 (v len)));\n b\n\n// check efficient compilation for all back-ends\nval store_uint128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint128 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint128_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt128, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt128.(n1 >>^ 8ul) in\n assert(UInt128.v n = UInt8.v b + 256 * UInt128.v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint128 len buf' n';\n buf.(0ul) <- b // updating after the recursive call helps verification\n\nval store_big128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec store_big128 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint128_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt128, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt128.(n1 >>^ 8ul) in\n assert(UInt128.v n = UInt8.v b + 256 * UInt128.v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big128 len buf' n';\n buf.(len) <- b // updating after the recursive call helps verification\n\n(* from Spec; used e.g. in AEAD.Encoding *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 0 --max_ifuel 0\"\n\n\n(* injectivity proofs for byte encodings *)\n\ntype word = b:Seq.seq UInt8.t {Seq.length b <= 16}\nopen FStar.Math.Lib\nopen FStar.Math.Lemmas\nopen FStar.Seq\nopen FStar.Seq\n\nprivate let endian_is_injective q r q' r' : Lemma\n (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q')\n (ensures r = r' /\\ q = q') =\n lemma_mod_injective (pow2 8) (UInt8.v r) (UInt8.v r')\n\nprivate let big_endian_step (b:word{length b > 0}) :\n Lemma (big_endian b = U8.v (last b) + pow2 8 * big_endian (slice b 0 (length b - 1))) =\n ()\n\n#reset-options \"--z3rlimit 30\"\nval lemma_big_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires big_endian b = big_endian b')\n (ensures b == b')\n (decreases (length b))\nlet rec lemma_big_endian_inj s s' =\n let len = length s in\n if len = 0 then lemma_eq_intro s s'\n else\n let t = slice s 0 (len - 1) in\n let x = last s in\n lemma_eq_intro s (snoc t x);\n big_endian_step s;\n let t' = slice s' 0 (len - 1) in\n let x' = last s' in\n lemma_eq_intro s' (snoc t' x');\n big_endian_step s';\n endian_is_injective (big_endian t) x (big_endian t') x';\n lemma_big_endian_inj t t'\n\n(* the little endian proof could be simplified, as above *)\n\n(* this lemma is used only Crypto.Symmetric.Poly1305 *)\nval lemma_little_endian_is_injective_1: b:pos -> q:nat -> r:nat -> q':nat -> r':nat -> Lemma\n (requires (r < b /\\ r' < b /\\ r + b * q = r' + b * q'))\n (ensures (r = r' /\\ q = q'))\nlet lemma_little_endian_is_injective_1 b q r q' r' =\n lemma_mod_plus r q b;\n lemma_mod_plus r' q' b;\n lemma_mod_injective b r r'\n\n(* a sequence associativity property: ... @ ([x] @ s) == ... @ [x]) @ s *)\nprivate val lemma_little_endian_is_injective_2: b:word -> len:pos{len <= length b} -> Lemma\n (let s = slice b (length b - len) (length b) in\n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lib" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 30, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: Crypto.Symmetric.Bytes.word -> len: Prims.pos{len <= FStar.Seq.Base.length b}\n -> FStar.Pervasives.Lemma\n (ensures\n (let s = FStar.Seq.Base.slice b (FStar.Seq.Base.length b - len) (FStar.Seq.Base.length b) in\n let s' = FStar.Seq.Base.slice s 1 (FStar.Seq.Base.length s) in\n let s'' =\n FStar.Seq.Base.slice b (FStar.Seq.Base.length b - (len - 1)) (FStar.Seq.Base.length b)\n in\n s'' == s'))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Crypto.Symmetric.Bytes.word", "Prims.pos", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "FStar.UInt8.t", "FStar.Seq.Base.lemma_eq_intro", "FStar.Seq.Base.seq", "FStar.Seq.Base.slice", "Prims.op_Subtraction", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_little_endian_is_injective_2: b:word -> len:pos{len <= length b} -> Lemma\n (let s = slice b (length b - len) (length b) in\n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n s'' == s')\nlet lemma_little_endian_is_injective_2 b len =", "completed_definiton": "let s = slice b (length b - len) (length b) in\nlet s' = slice s 1 (length s) in\nlet s'' = slice b (length b - (len - 1)) (length b) in\nlemma_eq_intro s' s''", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.endian_is_injective", "original_source_type": "val endian_is_injective (q r q' r': _)\n : Lemma (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q') (ensures r = r' /\\ q = q')", "source_type": "val endian_is_injective (q r q' r': _)\n : Lemma (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q') (ensures r = r' /\\ q = q')", "source_definition": "let endian_is_injective q r q' r' : Lemma\n (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q')\n (ensures r = r' /\\ q = q') =\n lemma_mod_injective (pow2 8) (UInt8.v r) (UInt8.v r')", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 588, "start_col": 2, "end_line": 588, "end_col": 55 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b\n(* [SMTPat (big_endian b)] *)\n(* let rec lemma_big_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 0 (Seq.length b - 1) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_big_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.last b) < pow2 8); *)\n(* assert(big_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8); *)\n(* assert(big_endian b <= pow2 8 * (big_endian s + 1)); *)\n(* assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b = FStar.Old.Endianness.lemma_little_endian_lt_2_128 b\n (* lemma_little_endian_is_bounded b; *)\n (* if Seq.length b = 16 then () *)\n (* else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b) *)\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\n(* REMARK: The trigger in lemma_little_endian_lt_2_128 is used to prove absence of\n overflow *)\n(** Loads a machine integer from a buffer of len bytes *)\nval load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nlet rec load_uint32 len buf =\n if len = 0ul then 0ul\n else\n let h = ST.get () in\n let len = len -^ 1ul in\n let m = load_uint32 len (sub buf 1ul len) in\n lemma_little_endian_is_bounded (sel_bytes h len (sub buf 1ul len));\n assert (UInt32.v len <= 3);\n assert (UInt32.v m < pow2 (8 * (UInt32.v len)));\n FStar.Math.Lemmas.pow2_le_compat (8 * 3) (8 * (UInt32.v len));\n FStar.Math.Lemmas.pow2_plus 8 (8 * 3);\n assert (pow2 (8 * (UInt32.v len)) <= pow2 (8 * 3));\n assert (pow2 8 * pow2 (8 * 3) = UInt.max_int 32 + 1);\n assert (UInt32.v m * pow2 8 <= UInt.max_int 32);\n let b = buf.(0ul) in\n assert_norm (pow2 8 == 256);\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ m)\n\nval load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big32 len buf =\n if len = 0ul then 0ul\n else\n let len = len -^ 1ul in\n let n = load_big32 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n' *)\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ n')\n\n(** Used e.g. for converting TLS sequence numbers into AEAD nonces *)\n#reset-options \"--z3rlimit 100\"\nval load_big64: len:UInt32.t { v len <= 8 } -> buf:lbuffer (v len) -> ST UInt64.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt64.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big64 len buf =\n if len = 0ul then 0UL\n else\n let len = len -^ 1ul in\n let n = load_big64 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt64, so was shadowed, so renamed into n' *)\n FStar.UInt64.(uint8_to_uint64 b +^ 256UL *^ n')\n\n\n(* TODO: Add to FStar.Int.Cast and KaRaMeL and OCaml implementations *)\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = uint64_to_uint128 (uint8_to_uint64 a)\n\nval load_uint128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec load_uint128 len buf =\n if len = 0ul then uint64_to_uint128 0UL // Need 128-bit constants?\n else\n let n = load_uint128 (len -^ 1ul) (sub buf 1ul (len -^ 1ul)) in\n let b = buf.(0ul) in\n let h = ST.get () in\n lemma_little_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 1ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n\nval load_big128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big128 len buf =\n if len = 0ul then uint64_to_uint128 0UL\n else\n let n = load_big128 (len -^ 1ul) (sub buf 0ul (len -^ 1ul)) in\n let b = buf.(len -^ 1ul) in\n let h = ST.get () in\n lemma_big_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 0ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n(* stores a machine integer into a buffer of len bytes *)\n// 16-10-02 subsumes Buffer.Utils.bytes_of_uint32 ?\n// check efficient compilation for all back-ends\nval store_uint32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint32 len buf' n';\n buf.(0ul) <- b // updating after the recursive call helps verification\n\nval store_big32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec store_big32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big32 len buf' n';\n buf.(len) <- b // updating after the recursive call helps verification\n\nnoextract val uint32_bytes:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == little_endian b}) (decreases (v len))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nlet rec uint32_bytes len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = little_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_bytes len n' in\n assert (little_endian b' = UInt32.v n');\n let res = Seq.cons byte b' in\n assert (Seq.equal (Seq.tail res) b'); //NS: added 05/15, cf #1028\n res\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 1 --max_ifuel 1 --z3rlimit 50\"\nnoextract val uint32_be:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == big_endian b}) (decreases (v len))\n\nlet rec uint32_be len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = big_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_be len n'\n in\n let res = Seq.snoc b' byte in\n let b0, last = Seq.un_snoc res in\n assert (Seq.equal b0 b'); //NS: added 05/15, cf #1028\n res\n\n// turns an integer into a bytestream, little-endian\ninline_for_extraction val little_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b})(* (decreases (v len)) *)\ninline_for_extraction let little_bytes len n = FStar.Old.Endianness.little_bytes len n\n(* let rec little_bytes len n = *)\n(* if len = 0ul then *)\n(* Seq.empty *)\n(* else *)\n(* let len = len -^ 1ul in *)\n(* let byte = UInt8.uint_to_t (n % 256) in *)\n(* let n' = n / 256 in *)\n(* Math.Lemmas.pow2_plus 8 (8 * v len); *)\n(* assert(n' < pow2 (8 * v len )); *)\n(* let b' = little_bytes len n' in *)\n(* let b = cons byte b' in *)\n(* assert(Seq.equal b' (tail b)); *)\n(* b *)\n\n#reset-options \"--z3rlimit 400\"\n\n// turns an integer into a bytestream, big-endian\nval big_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == big_endian b}) (decreases (v len))\nlet rec big_bytes len n =\n if len = 0ul then\n Seq.empty\n else\n let len = len -^ 1ul in\n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert(n' < pow2 (8 * v len ));\n let b' = big_bytes len n' in\n let b'' = Seq.create 1 byte in\n let b = Seq.append b' b'' in\n assert(Seq.equal b' (Seq.slice b 0 (v len)));\n b\n\n// check efficient compilation for all back-ends\nval store_uint128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint128 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint128_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt128, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt128.(n1 >>^ 8ul) in\n assert(UInt128.v n = UInt8.v b + 256 * UInt128.v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint128 len buf' n';\n buf.(0ul) <- b // updating after the recursive call helps verification\n\nval store_big128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec store_big128 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint128_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt128, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt128.(n1 >>^ 8ul) in\n assert(UInt128.v n = UInt8.v b + 256 * UInt128.v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big128 len buf' n';\n buf.(len) <- b // updating after the recursive call helps verification\n\n(* from Spec; used e.g. in AEAD.Encoding *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 0 --max_ifuel 0\"\n\n\n(* injectivity proofs for byte encodings *)\n\ntype word = b:Seq.seq UInt8.t {Seq.length b <= 16}\nopen FStar.Math.Lib\nopen FStar.Math.Lemmas\nopen FStar.Seq\nopen FStar.Seq\n\nprivate let endian_is_injective q r q' r' : Lemma\n (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q')", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lib" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "q: Prims.int -> r: FStar.UInt8.t -> q': Prims.int -> r': FStar.UInt8.t\n -> FStar.Pervasives.Lemma\n (requires FStar.UInt8.v r + Prims.pow2 8 * q = FStar.UInt8.v r' + Prims.pow2 8 * q')\n (ensures r = r' /\\ q = q')", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.int", "FStar.UInt8.t", "FStar.Math.Lemmas.lemma_mod_injective", "Prims.pow2", "FStar.UInt8.v", "Prims.unit", "Prims.b2t", "Prims.op_Equality", "Prims.op_Addition", "FStar.Mul.op_Star", "Prims.squash", "Prims.l_and", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val endian_is_injective (q r q' r': _)\n : Lemma (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q') (ensures r = r' /\\ q = q')\nlet endian_is_injective q r q' r'\n : Lemma (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q') (ensures r = r' /\\ q = q') =", "completed_definiton": "lemma_mod_injective (pow2 8) (UInt8.v r) (UInt8.v r')", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.lemma_big_endian_is_bounded", "original_source_type": "val lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))", "source_type": "val lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))", "source_definition": "let lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 249, "start_col": 36, "end_line": 249, "end_col": 86 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: Crypto.Symmetric.Bytes.bytes\n -> FStar.Pervasives.Lemma\n (ensures Crypto.Symmetric.Bytes.big_endian b < Prims.pow2 (8 * FStar.Seq.Base.length b))\n (decreases FStar.Seq.Base.length b)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma", "" ], "mutual_with": [], "ideal_premises": [ "Crypto.Symmetric.Bytes.bytes", "FStar.Old.Endianness.lemma_big_endian_is_bounded", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b =", "completed_definiton": "FStar.Old.Endianness.lemma_big_endian_is_bounded b", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.sel_bytes", "original_source_type": "val sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))", "source_type": "val sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))", "source_definition": "let sel_bytes h l buf = Buffer.as_seq h buf", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 76, "start_col": 24, "end_line": 76, "end_col": 43 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n h: Crypto.Symmetric.Bytes.mem ->\n l: FStar.UInt32.t ->\n buf: Crypto.Symmetric.Bytes.lbuffer (FStar.UInt32.v l)\n -> Prims.GTot (Crypto.Symmetric.Bytes.lbytes (FStar.UInt32.v l))", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Crypto.Symmetric.Bytes.mem", "FStar.UInt32.t", "Crypto.Symmetric.Bytes.lbuffer", "FStar.UInt32.v", "FStar.Buffer.as_seq", "FStar.UInt8.t", "Crypto.Symmetric.Bytes.lbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nlet sel_bytes h l buf =", "completed_definiton": "Buffer.as_seq h buf", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.random_bytes", "original_source_type": "val random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))", "source_type": "val random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))", "source_definition": "let random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 130, "start_col": 2, "end_line": 140, "end_col": 3 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 20, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "len: Crypto.Symmetric.Bytes.u32\n -> FStar.HyperStack.ST.Stack (Crypto.Symmetric.Bytes.lbytes (FStar.UInt32.v len))", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Crypto.Symmetric.Bytes.u32", "Crypto.Symmetric.Bytes.lbytes", "FStar.UInt32.v", "Prims.unit", "FStar.HyperStack.ST.pop_frame", "Crypto.Symmetric.Bytes.load_bytes", "FStar.Buffer.lemma_reveal_modifies_1", "FStar.UInt8.t", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "Crypto.Symmetric.Bytes.random", "FStar.Buffer.lemma_reveal_modifies_0", "FStar.Buffer.buffer", "FStar.Buffer.create", "FStar.UInt8.__uint_to_t", "FStar.HyperStack.ST.push_frame" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =", "completed_definiton": "push_frame ();\nlet m0 = ST.get () in\nlet buf = Buffer.create 0uy len in\nlet m1 = ST.get () in\nlemma_reveal_modifies_0 m0 m1;\nrandom (v len) buf;\nlet m2 = ST.get () in\nlemma_reveal_modifies_1 buf m1 m2;\nlet b = load_bytes len buf in\npop_frame ();\nb", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.little_bytes", "original_source_type": "val little_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b})", "source_type": "val little_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b})", "source_definition": "let little_bytes len n = FStar.Old.Endianness.little_bytes len n", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 495, "start_col": 47, "end_line": 495, "end_col": 86 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b\n(* [SMTPat (big_endian b)] *)\n(* let rec lemma_big_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 0 (Seq.length b - 1) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_big_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.last b) < pow2 8); *)\n(* assert(big_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8); *)\n(* assert(big_endian b <= pow2 8 * (big_endian s + 1)); *)\n(* assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b = FStar.Old.Endianness.lemma_little_endian_lt_2_128 b\n (* lemma_little_endian_is_bounded b; *)\n (* if Seq.length b = 16 then () *)\n (* else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b) *)\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\n(* REMARK: The trigger in lemma_little_endian_lt_2_128 is used to prove absence of\n overflow *)\n(** Loads a machine integer from a buffer of len bytes *)\nval load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nlet rec load_uint32 len buf =\n if len = 0ul then 0ul\n else\n let h = ST.get () in\n let len = len -^ 1ul in\n let m = load_uint32 len (sub buf 1ul len) in\n lemma_little_endian_is_bounded (sel_bytes h len (sub buf 1ul len));\n assert (UInt32.v len <= 3);\n assert (UInt32.v m < pow2 (8 * (UInt32.v len)));\n FStar.Math.Lemmas.pow2_le_compat (8 * 3) (8 * (UInt32.v len));\n FStar.Math.Lemmas.pow2_plus 8 (8 * 3);\n assert (pow2 (8 * (UInt32.v len)) <= pow2 (8 * 3));\n assert (pow2 8 * pow2 (8 * 3) = UInt.max_int 32 + 1);\n assert (UInt32.v m * pow2 8 <= UInt.max_int 32);\n let b = buf.(0ul) in\n assert_norm (pow2 8 == 256);\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ m)\n\nval load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big32 len buf =\n if len = 0ul then 0ul\n else\n let len = len -^ 1ul in\n let n = load_big32 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n' *)\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ n')\n\n(** Used e.g. for converting TLS sequence numbers into AEAD nonces *)\n#reset-options \"--z3rlimit 100\"\nval load_big64: len:UInt32.t { v len <= 8 } -> buf:lbuffer (v len) -> ST UInt64.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt64.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big64 len buf =\n if len = 0ul then 0UL\n else\n let len = len -^ 1ul in\n let n = load_big64 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt64, so was shadowed, so renamed into n' *)\n FStar.UInt64.(uint8_to_uint64 b +^ 256UL *^ n')\n\n\n(* TODO: Add to FStar.Int.Cast and KaRaMeL and OCaml implementations *)\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = uint64_to_uint128 (uint8_to_uint64 a)\n\nval load_uint128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec load_uint128 len buf =\n if len = 0ul then uint64_to_uint128 0UL // Need 128-bit constants?\n else\n let n = load_uint128 (len -^ 1ul) (sub buf 1ul (len -^ 1ul)) in\n let b = buf.(0ul) in\n let h = ST.get () in\n lemma_little_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 1ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n\nval load_big128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big128 len buf =\n if len = 0ul then uint64_to_uint128 0UL\n else\n let n = load_big128 (len -^ 1ul) (sub buf 0ul (len -^ 1ul)) in\n let b = buf.(len -^ 1ul) in\n let h = ST.get () in\n lemma_big_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 0ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n(* stores a machine integer into a buffer of len bytes *)\n// 16-10-02 subsumes Buffer.Utils.bytes_of_uint32 ?\n// check efficient compilation for all back-ends\nval store_uint32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint32 len buf' n';\n buf.(0ul) <- b // updating after the recursive call helps verification\n\nval store_big32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec store_big32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big32 len buf' n';\n buf.(len) <- b // updating after the recursive call helps verification\n\nnoextract val uint32_bytes:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == little_endian b}) (decreases (v len))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nlet rec uint32_bytes len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = little_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_bytes len n' in\n assert (little_endian b' = UInt32.v n');\n let res = Seq.cons byte b' in\n assert (Seq.equal (Seq.tail res) b'); //NS: added 05/15, cf #1028\n res\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 1 --max_ifuel 1 --z3rlimit 50\"\nnoextract val uint32_be:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == big_endian b}) (decreases (v len))\n\nlet rec uint32_be len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = big_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_be len n'\n in\n let res = Seq.snoc b' byte in\n let b0, last = Seq.un_snoc res in\n assert (Seq.equal b0 b'); //NS: added 05/15, cf #1028\n res\n\n// turns an integer into a bytestream, little-endian\ninline_for_extraction val little_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 1, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 50, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "len: FStar.UInt32.t -> n: Prims.nat{n < Prims.pow2 (8 * FStar.UInt32.v len)}\n -> b:\n Crypto.Symmetric.Bytes.lbytes (FStar.UInt32.v len) {n == Crypto.Symmetric.Bytes.little_endian b}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Prims.pow2", "FStar.Mul.op_Star", "FStar.UInt32.v", "FStar.Old.Endianness.little_bytes", "Crypto.Symmetric.Bytes.lbytes", "Prims.eq2", "Crypto.Symmetric.Bytes.little_endian" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val little_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b})\nlet little_bytes len n =", "completed_definiton": "FStar.Old.Endianness.little_bytes len n", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.store_bytes", "original_source_type": "val store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))", "source_type": "val store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))", "source_definition": "let store_bytes l buf b = store_bytes_aux l buf 0ul b", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 116, "start_col": 26, "end_line": 116, "end_col": 53 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 20, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n l: FStar.UInt32.t ->\n buf: Crypto.Symmetric.Bytes.lbuffer (FStar.UInt32.v l) ->\n b: Crypto.Symmetric.Bytes.lbytes (FStar.UInt32.v l)\n -> FStar.HyperStack.ST.ST Prims.unit", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Crypto.Symmetric.Bytes.lbuffer", "FStar.UInt32.v", "Crypto.Symmetric.Bytes.lbytes", "Crypto.Symmetric.Bytes.store_bytes_aux", "FStar.UInt32.__uint_to_t", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b =", "completed_definiton": "store_bytes_aux l buf 0ul b", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.lemma_little_endian_is_injective_3", "original_source_type": "val lemma_little_endian_is_injective_3: b:word -> b':word -> len:pos{len <= length b /\\ len <= length b'} -> Lemma\n (requires\n slice b (length b - (len - 1)) (length b) == slice b' (length b' - (len-1)) (length b') /\\\n Seq.index b (length b - len) = Seq.index b' (length b' - len))\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))", "source_type": "val lemma_little_endian_is_injective_3: b:word -> b':word -> len:pos{len <= length b /\\ len <= length b'} -> Lemma\n (requires\n slice b (length b - (len - 1)) (length b) == slice b' (length b' - (len-1)) (length b') /\\\n Seq.index b (length b - len) = Seq.index b' (length b' - len))\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))", "source_definition": "let lemma_little_endian_is_injective_3 b b' len =\n lemma_eq_intro (slice b (length b - len) (length b)) (cons (index b (length b - len)) (slice b (length b - (len-1)) (length b)));\n lemma_eq_intro (slice b' (length b' - len) (length b')) (cons (index b' (length b' - len)) (slice b' (length b' - (len-1)) (length b')))", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 644, "start_col": 2, "end_line": 645, "end_col": 138 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b\n(* [SMTPat (big_endian b)] *)\n(* let rec lemma_big_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 0 (Seq.length b - 1) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_big_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.last b) < pow2 8); *)\n(* assert(big_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8); *)\n(* assert(big_endian b <= pow2 8 * (big_endian s + 1)); *)\n(* assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b = FStar.Old.Endianness.lemma_little_endian_lt_2_128 b\n (* lemma_little_endian_is_bounded b; *)\n (* if Seq.length b = 16 then () *)\n (* else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b) *)\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\n(* REMARK: The trigger in lemma_little_endian_lt_2_128 is used to prove absence of\n overflow *)\n(** Loads a machine integer from a buffer of len bytes *)\nval load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nlet rec load_uint32 len buf =\n if len = 0ul then 0ul\n else\n let h = ST.get () in\n let len = len -^ 1ul in\n let m = load_uint32 len (sub buf 1ul len) in\n lemma_little_endian_is_bounded (sel_bytes h len (sub buf 1ul len));\n assert (UInt32.v len <= 3);\n assert (UInt32.v m < pow2 (8 * (UInt32.v len)));\n FStar.Math.Lemmas.pow2_le_compat (8 * 3) (8 * (UInt32.v len));\n FStar.Math.Lemmas.pow2_plus 8 (8 * 3);\n assert (pow2 (8 * (UInt32.v len)) <= pow2 (8 * 3));\n assert (pow2 8 * pow2 (8 * 3) = UInt.max_int 32 + 1);\n assert (UInt32.v m * pow2 8 <= UInt.max_int 32);\n let b = buf.(0ul) in\n assert_norm (pow2 8 == 256);\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ m)\n\nval load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big32 len buf =\n if len = 0ul then 0ul\n else\n let len = len -^ 1ul in\n let n = load_big32 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n' *)\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ n')\n\n(** Used e.g. for converting TLS sequence numbers into AEAD nonces *)\n#reset-options \"--z3rlimit 100\"\nval load_big64: len:UInt32.t { v len <= 8 } -> buf:lbuffer (v len) -> ST UInt64.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt64.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big64 len buf =\n if len = 0ul then 0UL\n else\n let len = len -^ 1ul in\n let n = load_big64 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt64, so was shadowed, so renamed into n' *)\n FStar.UInt64.(uint8_to_uint64 b +^ 256UL *^ n')\n\n\n(* TODO: Add to FStar.Int.Cast and KaRaMeL and OCaml implementations *)\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = uint64_to_uint128 (uint8_to_uint64 a)\n\nval load_uint128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec load_uint128 len buf =\n if len = 0ul then uint64_to_uint128 0UL // Need 128-bit constants?\n else\n let n = load_uint128 (len -^ 1ul) (sub buf 1ul (len -^ 1ul)) in\n let b = buf.(0ul) in\n let h = ST.get () in\n lemma_little_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 1ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n\nval load_big128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big128 len buf =\n if len = 0ul then uint64_to_uint128 0UL\n else\n let n = load_big128 (len -^ 1ul) (sub buf 0ul (len -^ 1ul)) in\n let b = buf.(len -^ 1ul) in\n let h = ST.get () in\n lemma_big_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 0ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n(* stores a machine integer into a buffer of len bytes *)\n// 16-10-02 subsumes Buffer.Utils.bytes_of_uint32 ?\n// check efficient compilation for all back-ends\nval store_uint32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint32 len buf' n';\n buf.(0ul) <- b // updating after the recursive call helps verification\n\nval store_big32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec store_big32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big32 len buf' n';\n buf.(len) <- b // updating after the recursive call helps verification\n\nnoextract val uint32_bytes:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == little_endian b}) (decreases (v len))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nlet rec uint32_bytes len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = little_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_bytes len n' in\n assert (little_endian b' = UInt32.v n');\n let res = Seq.cons byte b' in\n assert (Seq.equal (Seq.tail res) b'); //NS: added 05/15, cf #1028\n res\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 1 --max_ifuel 1 --z3rlimit 50\"\nnoextract val uint32_be:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == big_endian b}) (decreases (v len))\n\nlet rec uint32_be len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = big_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_be len n'\n in\n let res = Seq.snoc b' byte in\n let b0, last = Seq.un_snoc res in\n assert (Seq.equal b0 b'); //NS: added 05/15, cf #1028\n res\n\n// turns an integer into a bytestream, little-endian\ninline_for_extraction val little_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b})(* (decreases (v len)) *)\ninline_for_extraction let little_bytes len n = FStar.Old.Endianness.little_bytes len n\n(* let rec little_bytes len n = *)\n(* if len = 0ul then *)\n(* Seq.empty *)\n(* else *)\n(* let len = len -^ 1ul in *)\n(* let byte = UInt8.uint_to_t (n % 256) in *)\n(* let n' = n / 256 in *)\n(* Math.Lemmas.pow2_plus 8 (8 * v len); *)\n(* assert(n' < pow2 (8 * v len )); *)\n(* let b' = little_bytes len n' in *)\n(* let b = cons byte b' in *)\n(* assert(Seq.equal b' (tail b)); *)\n(* b *)\n\n#reset-options \"--z3rlimit 400\"\n\n// turns an integer into a bytestream, big-endian\nval big_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == big_endian b}) (decreases (v len))\nlet rec big_bytes len n =\n if len = 0ul then\n Seq.empty\n else\n let len = len -^ 1ul in\n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert(n' < pow2 (8 * v len ));\n let b' = big_bytes len n' in\n let b'' = Seq.create 1 byte in\n let b = Seq.append b' b'' in\n assert(Seq.equal b' (Seq.slice b 0 (v len)));\n b\n\n// check efficient compilation for all back-ends\nval store_uint128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint128 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint128_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt128, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt128.(n1 >>^ 8ul) in\n assert(UInt128.v n = UInt8.v b + 256 * UInt128.v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint128 len buf' n';\n buf.(0ul) <- b // updating after the recursive call helps verification\n\nval store_big128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec store_big128 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint128_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt128, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt128.(n1 >>^ 8ul) in\n assert(UInt128.v n = UInt8.v b + 256 * UInt128.v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big128 len buf' n';\n buf.(len) <- b // updating after the recursive call helps verification\n\n(* from Spec; used e.g. in AEAD.Encoding *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 0 --max_ifuel 0\"\n\n\n(* injectivity proofs for byte encodings *)\n\ntype word = b:Seq.seq UInt8.t {Seq.length b <= 16}\nopen FStar.Math.Lib\nopen FStar.Math.Lemmas\nopen FStar.Seq\nopen FStar.Seq\n\nprivate let endian_is_injective q r q' r' : Lemma\n (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q')\n (ensures r = r' /\\ q = q') =\n lemma_mod_injective (pow2 8) (UInt8.v r) (UInt8.v r')\n\nprivate let big_endian_step (b:word{length b > 0}) :\n Lemma (big_endian b = U8.v (last b) + pow2 8 * big_endian (slice b 0 (length b - 1))) =\n ()\n\n#reset-options \"--z3rlimit 30\"\nval lemma_big_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires big_endian b = big_endian b')\n (ensures b == b')\n (decreases (length b))\nlet rec lemma_big_endian_inj s s' =\n let len = length s in\n if len = 0 then lemma_eq_intro s s'\n else\n let t = slice s 0 (len - 1) in\n let x = last s in\n lemma_eq_intro s (snoc t x);\n big_endian_step s;\n let t' = slice s' 0 (len - 1) in\n let x' = last s' in\n lemma_eq_intro s' (snoc t' x');\n big_endian_step s';\n endian_is_injective (big_endian t) x (big_endian t') x';\n lemma_big_endian_inj t t'\n\n(* the little endian proof could be simplified, as above *)\n\n(* this lemma is used only Crypto.Symmetric.Poly1305 *)\nval lemma_little_endian_is_injective_1: b:pos -> q:nat -> r:nat -> q':nat -> r':nat -> Lemma\n (requires (r < b /\\ r' < b /\\ r + b * q = r' + b * q'))\n (ensures (r = r' /\\ q = q'))\nlet lemma_little_endian_is_injective_1 b q r q' r' =\n lemma_mod_plus r q b;\n lemma_mod_plus r' q' b;\n lemma_mod_injective b r r'\n\n(* a sequence associativity property: ... @ ([x] @ s) == ... @ [x]) @ s *)\nprivate val lemma_little_endian_is_injective_2: b:word -> len:pos{len <= length b} -> Lemma\n (let s = slice b (length b - len) (length b) in\n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n s'' == s')\nlet lemma_little_endian_is_injective_2 b len =\n let s = slice b (length b - len) (length b) in\n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n lemma_eq_intro s' s''\n\n(* a sequence injectivity property *)\nprivate val lemma_little_endian_is_injective_3: b:word -> b':word -> len:pos{len <= length b /\\ len <= length b'} -> Lemma\n (requires\n slice b (length b - (len - 1)) (length b) == slice b' (length b' - (len-1)) (length b') /\\\n Seq.index b (length b - len) = Seq.index b' (length b' - len))\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lib" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 30, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b: Crypto.Symmetric.Bytes.word ->\n b': Crypto.Symmetric.Bytes.word ->\n len: Prims.pos{len <= FStar.Seq.Base.length b /\\ len <= FStar.Seq.Base.length b'}\n -> FStar.Pervasives.Lemma\n (requires\n FStar.Seq.Base.slice b (FStar.Seq.Base.length b - (len - 1)) (FStar.Seq.Base.length b) ==\n FStar.Seq.Base.slice b' (FStar.Seq.Base.length b' - (len - 1)) (FStar.Seq.Base.length b') /\\\n FStar.Seq.Base.index b (FStar.Seq.Base.length b - len) =\n FStar.Seq.Base.index b' (FStar.Seq.Base.length b' - len))\n (ensures\n FStar.Seq.Base.slice b (FStar.Seq.Base.length b - len) (FStar.Seq.Base.length b) ==\n FStar.Seq.Base.slice b' (FStar.Seq.Base.length b' - len) (FStar.Seq.Base.length b'))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Crypto.Symmetric.Bytes.word", "Prims.pos", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "FStar.UInt8.t", "FStar.Seq.Base.lemma_eq_intro", "FStar.Seq.Base.slice", "Prims.op_Subtraction", "FStar.Seq.Properties.cons", "FStar.Seq.Base.index", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_little_endian_is_injective_3: b:word -> b':word -> len:pos{len <= length b /\\ len <= length b'} -> Lemma\n (requires\n slice b (length b - (len - 1)) (length b) == slice b' (length b' - (len-1)) (length b') /\\\n Seq.index b (length b - len) = Seq.index b' (length b' - len))\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))\nlet lemma_little_endian_is_injective_3 b b' len =", "completed_definiton": "lemma_eq_intro (slice b (length b - len) (length b))\n (cons (index b (length b - len)) (slice b (length b - (len - 1)) (length b)));\nlemma_eq_intro (slice b' (length b' - len) (length b'))\n (cons (index b' (length b' - len)) (slice b' (length b' - (len - 1)) (length b')))", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.lemma_little_endian_inj", "original_source_type": "val lemma_little_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires little_endian b = little_endian b')\n (ensures b == b')", "source_type": "val lemma_little_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires little_endian b = little_endian b')\n (ensures b == b')", "source_definition": "let lemma_little_endian_inj b b' =\n let len = length b in\n Seq.lemma_eq_intro b (Seq.slice b 0 len);\n Seq.lemma_eq_intro b' (Seq.slice b' 0 len);\n lemma_little_endian_is_injective b b' len", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 671, "start_col": 34, "end_line": 675, "end_col": 43 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b\n(* [SMTPat (big_endian b)] *)\n(* let rec lemma_big_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 0 (Seq.length b - 1) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_big_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.last b) < pow2 8); *)\n(* assert(big_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8); *)\n(* assert(big_endian b <= pow2 8 * (big_endian s + 1)); *)\n(* assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b = FStar.Old.Endianness.lemma_little_endian_lt_2_128 b\n (* lemma_little_endian_is_bounded b; *)\n (* if Seq.length b = 16 then () *)\n (* else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b) *)\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\n(* REMARK: The trigger in lemma_little_endian_lt_2_128 is used to prove absence of\n overflow *)\n(** Loads a machine integer from a buffer of len bytes *)\nval load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nlet rec load_uint32 len buf =\n if len = 0ul then 0ul\n else\n let h = ST.get () in\n let len = len -^ 1ul in\n let m = load_uint32 len (sub buf 1ul len) in\n lemma_little_endian_is_bounded (sel_bytes h len (sub buf 1ul len));\n assert (UInt32.v len <= 3);\n assert (UInt32.v m < pow2 (8 * (UInt32.v len)));\n FStar.Math.Lemmas.pow2_le_compat (8 * 3) (8 * (UInt32.v len));\n FStar.Math.Lemmas.pow2_plus 8 (8 * 3);\n assert (pow2 (8 * (UInt32.v len)) <= pow2 (8 * 3));\n assert (pow2 8 * pow2 (8 * 3) = UInt.max_int 32 + 1);\n assert (UInt32.v m * pow2 8 <= UInt.max_int 32);\n let b = buf.(0ul) in\n assert_norm (pow2 8 == 256);\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ m)\n\nval load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big32 len buf =\n if len = 0ul then 0ul\n else\n let len = len -^ 1ul in\n let n = load_big32 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n' *)\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ n')\n\n(** Used e.g. for converting TLS sequence numbers into AEAD nonces *)\n#reset-options \"--z3rlimit 100\"\nval load_big64: len:UInt32.t { v len <= 8 } -> buf:lbuffer (v len) -> ST UInt64.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt64.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big64 len buf =\n if len = 0ul then 0UL\n else\n let len = len -^ 1ul in\n let n = load_big64 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt64, so was shadowed, so renamed into n' *)\n FStar.UInt64.(uint8_to_uint64 b +^ 256UL *^ n')\n\n\n(* TODO: Add to FStar.Int.Cast and KaRaMeL and OCaml implementations *)\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = uint64_to_uint128 (uint8_to_uint64 a)\n\nval load_uint128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec load_uint128 len buf =\n if len = 0ul then uint64_to_uint128 0UL // Need 128-bit constants?\n else\n let n = load_uint128 (len -^ 1ul) (sub buf 1ul (len -^ 1ul)) in\n let b = buf.(0ul) in\n let h = ST.get () in\n lemma_little_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 1ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n\nval load_big128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big128 len buf =\n if len = 0ul then uint64_to_uint128 0UL\n else\n let n = load_big128 (len -^ 1ul) (sub buf 0ul (len -^ 1ul)) in\n let b = buf.(len -^ 1ul) in\n let h = ST.get () in\n lemma_big_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 0ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n(* stores a machine integer into a buffer of len bytes *)\n// 16-10-02 subsumes Buffer.Utils.bytes_of_uint32 ?\n// check efficient compilation for all back-ends\nval store_uint32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint32 len buf' n';\n buf.(0ul) <- b // updating after the recursive call helps verification\n\nval store_big32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec store_big32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big32 len buf' n';\n buf.(len) <- b // updating after the recursive call helps verification\n\nnoextract val uint32_bytes:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == little_endian b}) (decreases (v len))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nlet rec uint32_bytes len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = little_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_bytes len n' in\n assert (little_endian b' = UInt32.v n');\n let res = Seq.cons byte b' in\n assert (Seq.equal (Seq.tail res) b'); //NS: added 05/15, cf #1028\n res\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 1 --max_ifuel 1 --z3rlimit 50\"\nnoextract val uint32_be:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == big_endian b}) (decreases (v len))\n\nlet rec uint32_be len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = big_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_be len n'\n in\n let res = Seq.snoc b' byte in\n let b0, last = Seq.un_snoc res in\n assert (Seq.equal b0 b'); //NS: added 05/15, cf #1028\n res\n\n// turns an integer into a bytestream, little-endian\ninline_for_extraction val little_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b})(* (decreases (v len)) *)\ninline_for_extraction let little_bytes len n = FStar.Old.Endianness.little_bytes len n\n(* let rec little_bytes len n = *)\n(* if len = 0ul then *)\n(* Seq.empty *)\n(* else *)\n(* let len = len -^ 1ul in *)\n(* let byte = UInt8.uint_to_t (n % 256) in *)\n(* let n' = n / 256 in *)\n(* Math.Lemmas.pow2_plus 8 (8 * v len); *)\n(* assert(n' < pow2 (8 * v len )); *)\n(* let b' = little_bytes len n' in *)\n(* let b = cons byte b' in *)\n(* assert(Seq.equal b' (tail b)); *)\n(* b *)\n\n#reset-options \"--z3rlimit 400\"\n\n// turns an integer into a bytestream, big-endian\nval big_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == big_endian b}) (decreases (v len))\nlet rec big_bytes len n =\n if len = 0ul then\n Seq.empty\n else\n let len = len -^ 1ul in\n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert(n' < pow2 (8 * v len ));\n let b' = big_bytes len n' in\n let b'' = Seq.create 1 byte in\n let b = Seq.append b' b'' in\n assert(Seq.equal b' (Seq.slice b 0 (v len)));\n b\n\n// check efficient compilation for all back-ends\nval store_uint128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint128 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint128_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt128, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt128.(n1 >>^ 8ul) in\n assert(UInt128.v n = UInt8.v b + 256 * UInt128.v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint128 len buf' n';\n buf.(0ul) <- b // updating after the recursive call helps verification\n\nval store_big128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec store_big128 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint128_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt128, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt128.(n1 >>^ 8ul) in\n assert(UInt128.v n = UInt8.v b + 256 * UInt128.v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big128 len buf' n';\n buf.(len) <- b // updating after the recursive call helps verification\n\n(* from Spec; used e.g. in AEAD.Encoding *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 0 --max_ifuel 0\"\n\n\n(* injectivity proofs for byte encodings *)\n\ntype word = b:Seq.seq UInt8.t {Seq.length b <= 16}\nopen FStar.Math.Lib\nopen FStar.Math.Lemmas\nopen FStar.Seq\nopen FStar.Seq\n\nprivate let endian_is_injective q r q' r' : Lemma\n (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q')\n (ensures r = r' /\\ q = q') =\n lemma_mod_injective (pow2 8) (UInt8.v r) (UInt8.v r')\n\nprivate let big_endian_step (b:word{length b > 0}) :\n Lemma (big_endian b = U8.v (last b) + pow2 8 * big_endian (slice b 0 (length b - 1))) =\n ()\n\n#reset-options \"--z3rlimit 30\"\nval lemma_big_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires big_endian b = big_endian b')\n (ensures b == b')\n (decreases (length b))\nlet rec lemma_big_endian_inj s s' =\n let len = length s in\n if len = 0 then lemma_eq_intro s s'\n else\n let t = slice s 0 (len - 1) in\n let x = last s in\n lemma_eq_intro s (snoc t x);\n big_endian_step s;\n let t' = slice s' 0 (len - 1) in\n let x' = last s' in\n lemma_eq_intro s' (snoc t' x');\n big_endian_step s';\n endian_is_injective (big_endian t) x (big_endian t') x';\n lemma_big_endian_inj t t'\n\n(* the little endian proof could be simplified, as above *)\n\n(* this lemma is used only Crypto.Symmetric.Poly1305 *)\nval lemma_little_endian_is_injective_1: b:pos -> q:nat -> r:nat -> q':nat -> r':nat -> Lemma\n (requires (r < b /\\ r' < b /\\ r + b * q = r' + b * q'))\n (ensures (r = r' /\\ q = q'))\nlet lemma_little_endian_is_injective_1 b q r q' r' =\n lemma_mod_plus r q b;\n lemma_mod_plus r' q' b;\n lemma_mod_injective b r r'\n\n(* a sequence associativity property: ... @ ([x] @ s) == ... @ [x]) @ s *)\nprivate val lemma_little_endian_is_injective_2: b:word -> len:pos{len <= length b} -> Lemma\n (let s = slice b (length b - len) (length b) in\n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n s'' == s')\nlet lemma_little_endian_is_injective_2 b len =\n let s = slice b (length b - len) (length b) in\n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n lemma_eq_intro s' s''\n\n(* a sequence injectivity property *)\nprivate val lemma_little_endian_is_injective_3: b:word -> b':word -> len:pos{len <= length b /\\ len <= length b'} -> Lemma\n (requires\n slice b (length b - (len - 1)) (length b) == slice b' (length b' - (len-1)) (length b') /\\\n Seq.index b (length b - len) = Seq.index b' (length b' - len))\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))\nlet lemma_little_endian_is_injective_3 b b' len =\n lemma_eq_intro (slice b (length b - len) (length b)) (cons (index b (length b - len)) (slice b (length b - (len-1)) (length b)));\n lemma_eq_intro (slice b' (length b' - len) (length b')) (cons (index b' (length b' - len)) (slice b' (length b' - (len-1)) (length b')))\n\nprivate let little_endian_step (b:word{length b > 0}):\n Lemma (little_endian b = U8.v (head b) + pow2 8 * little_endian (tail b))\n = ()\n\nval lemma_little_endian_is_injective: b:word -> b':word -> len:nat{len <= length b /\\ len <= length b'} -> Lemma\n (requires little_endian (slice b (length b - len) (length b)) = little_endian (slice b' (length b' - len) (length b')) )\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))\nlet rec lemma_little_endian_is_injective b b' len =\n if len = 0 then\n lemma_eq_intro (slice b (length b - len) (length b)) (slice b' (length b' - len) (length b'))\n else\n let s = slice b (length b - len) (length b) in\n let s' = slice b' (length b' - len) (length b') in\n little_endian_step s;\n little_endian_step s';\n endian_is_injective (little_endian (tail s)) (head s) (little_endian (tail s')) (head s');\n lemma_little_endian_is_injective_2 b len;\n lemma_little_endian_is_injective_2 b' len;\n lemma_little_endian_is_injective b b' (len - 1);\n lemma_little_endian_is_injective_3 b b' len\n\nval lemma_little_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires little_endian b = little_endian b')", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lib" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 30, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b: Crypto.Symmetric.Bytes.word ->\n b': Crypto.Symmetric.Bytes.word{FStar.Seq.Base.length b = FStar.Seq.Base.length b'}\n -> FStar.Pervasives.Lemma\n (requires Crypto.Symmetric.Bytes.little_endian b = Crypto.Symmetric.Bytes.little_endian b')\n (ensures b == b')", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Crypto.Symmetric.Bytes.word", "Prims.b2t", "Prims.op_Equality", "Prims.nat", "FStar.Seq.Base.length", "FStar.UInt8.t", "Crypto.Symmetric.Bytes.lemma_little_endian_is_injective", "Prims.unit", "FStar.Seq.Base.lemma_eq_intro", "FStar.Seq.Base.slice" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_little_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires little_endian b = little_endian b')\n (ensures b == b')\nlet lemma_little_endian_inj b b' =", "completed_definiton": "let len = length b in\nSeq.lemma_eq_intro b (Seq.slice b 0 len);\nSeq.lemma_eq_intro b' (Seq.slice b' 0 len);\nlemma_little_endian_is_injective b b' len", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.load_bytes", "original_source_type": "val load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))", "source_type": "val load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))", "source_definition": "let rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 88, "start_col": 2, "end_line": 93, "end_col": 16 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 20, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "l: FStar.UInt32.t -> buf: Crypto.Symmetric.Bytes.lbuffer (FStar.UInt32.v l)\n -> FStar.HyperStack.ST.Stack (Crypto.Symmetric.Bytes.lbytes (FStar.UInt32.v l))", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Crypto.Symmetric.Bytes.lbuffer", "FStar.UInt32.v", "Prims.op_Equality", "FStar.UInt32.__uint_to_t", "FStar.Seq.Base.empty", "FStar.UInt8.t", "Crypto.Symmetric.Bytes.lbytes", "Prims.bool", "FStar.Seq.Properties.cons", "FStar.UInt32.sub", "FStar.UInt32.uint_to_t", "Crypto.Symmetric.Bytes.load_bytes", "FStar.UInt32.op_Subtraction_Hat", "FStar.Buffer.sub", "FStar.Buffer.index" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =", "completed_definiton": "if l = 0ul\nthen Seq.empty\nelse\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.lemma_big_endian_inj", "original_source_type": "val lemma_big_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires big_endian b = big_endian b')\n (ensures b == b')\n (decreases (length b))", "source_type": "val lemma_big_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires big_endian b = big_endian b')\n (ensures b == b')\n (decreases (length b))", "source_definition": "let rec lemma_big_endian_inj s s' =\n let len = length s in\n if len = 0 then lemma_eq_intro s s'\n else\n let t = slice s 0 (len - 1) in\n let x = last s in\n lemma_eq_intro s (snoc t x);\n big_endian_step s;\n let t' = slice s' 0 (len - 1) in\n let x' = last s' in\n lemma_eq_intro s' (snoc t' x');\n big_endian_step s';\n endian_is_injective (big_endian t) x (big_endian t') x';\n lemma_big_endian_inj t t'", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 599, "start_col": 35, "end_line": 612, "end_col": 29 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b\n(* [SMTPat (big_endian b)] *)\n(* let rec lemma_big_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 0 (Seq.length b - 1) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_big_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.last b) < pow2 8); *)\n(* assert(big_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8); *)\n(* assert(big_endian b <= pow2 8 * (big_endian s + 1)); *)\n(* assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b = FStar.Old.Endianness.lemma_little_endian_lt_2_128 b\n (* lemma_little_endian_is_bounded b; *)\n (* if Seq.length b = 16 then () *)\n (* else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b) *)\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\n(* REMARK: The trigger in lemma_little_endian_lt_2_128 is used to prove absence of\n overflow *)\n(** Loads a machine integer from a buffer of len bytes *)\nval load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nlet rec load_uint32 len buf =\n if len = 0ul then 0ul\n else\n let h = ST.get () in\n let len = len -^ 1ul in\n let m = load_uint32 len (sub buf 1ul len) in\n lemma_little_endian_is_bounded (sel_bytes h len (sub buf 1ul len));\n assert (UInt32.v len <= 3);\n assert (UInt32.v m < pow2 (8 * (UInt32.v len)));\n FStar.Math.Lemmas.pow2_le_compat (8 * 3) (8 * (UInt32.v len));\n FStar.Math.Lemmas.pow2_plus 8 (8 * 3);\n assert (pow2 (8 * (UInt32.v len)) <= pow2 (8 * 3));\n assert (pow2 8 * pow2 (8 * 3) = UInt.max_int 32 + 1);\n assert (UInt32.v m * pow2 8 <= UInt.max_int 32);\n let b = buf.(0ul) in\n assert_norm (pow2 8 == 256);\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ m)\n\nval load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big32 len buf =\n if len = 0ul then 0ul\n else\n let len = len -^ 1ul in\n let n = load_big32 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n' *)\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ n')\n\n(** Used e.g. for converting TLS sequence numbers into AEAD nonces *)\n#reset-options \"--z3rlimit 100\"\nval load_big64: len:UInt32.t { v len <= 8 } -> buf:lbuffer (v len) -> ST UInt64.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt64.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big64 len buf =\n if len = 0ul then 0UL\n else\n let len = len -^ 1ul in\n let n = load_big64 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt64, so was shadowed, so renamed into n' *)\n FStar.UInt64.(uint8_to_uint64 b +^ 256UL *^ n')\n\n\n(* TODO: Add to FStar.Int.Cast and KaRaMeL and OCaml implementations *)\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = uint64_to_uint128 (uint8_to_uint64 a)\n\nval load_uint128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec load_uint128 len buf =\n if len = 0ul then uint64_to_uint128 0UL // Need 128-bit constants?\n else\n let n = load_uint128 (len -^ 1ul) (sub buf 1ul (len -^ 1ul)) in\n let b = buf.(0ul) in\n let h = ST.get () in\n lemma_little_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 1ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n\nval load_big128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big128 len buf =\n if len = 0ul then uint64_to_uint128 0UL\n else\n let n = load_big128 (len -^ 1ul) (sub buf 0ul (len -^ 1ul)) in\n let b = buf.(len -^ 1ul) in\n let h = ST.get () in\n lemma_big_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 0ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n(* stores a machine integer into a buffer of len bytes *)\n// 16-10-02 subsumes Buffer.Utils.bytes_of_uint32 ?\n// check efficient compilation for all back-ends\nval store_uint32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint32 len buf' n';\n buf.(0ul) <- b // updating after the recursive call helps verification\n\nval store_big32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec store_big32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big32 len buf' n';\n buf.(len) <- b // updating after the recursive call helps verification\n\nnoextract val uint32_bytes:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == little_endian b}) (decreases (v len))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nlet rec uint32_bytes len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = little_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_bytes len n' in\n assert (little_endian b' = UInt32.v n');\n let res = Seq.cons byte b' in\n assert (Seq.equal (Seq.tail res) b'); //NS: added 05/15, cf #1028\n res\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 1 --max_ifuel 1 --z3rlimit 50\"\nnoextract val uint32_be:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == big_endian b}) (decreases (v len))\n\nlet rec uint32_be len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = big_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_be len n'\n in\n let res = Seq.snoc b' byte in\n let b0, last = Seq.un_snoc res in\n assert (Seq.equal b0 b'); //NS: added 05/15, cf #1028\n res\n\n// turns an integer into a bytestream, little-endian\ninline_for_extraction val little_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b})(* (decreases (v len)) *)\ninline_for_extraction let little_bytes len n = FStar.Old.Endianness.little_bytes len n\n(* let rec little_bytes len n = *)\n(* if len = 0ul then *)\n(* Seq.empty *)\n(* else *)\n(* let len = len -^ 1ul in *)\n(* let byte = UInt8.uint_to_t (n % 256) in *)\n(* let n' = n / 256 in *)\n(* Math.Lemmas.pow2_plus 8 (8 * v len); *)\n(* assert(n' < pow2 (8 * v len )); *)\n(* let b' = little_bytes len n' in *)\n(* let b = cons byte b' in *)\n(* assert(Seq.equal b' (tail b)); *)\n(* b *)\n\n#reset-options \"--z3rlimit 400\"\n\n// turns an integer into a bytestream, big-endian\nval big_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == big_endian b}) (decreases (v len))\nlet rec big_bytes len n =\n if len = 0ul then\n Seq.empty\n else\n let len = len -^ 1ul in\n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert(n' < pow2 (8 * v len ));\n let b' = big_bytes len n' in\n let b'' = Seq.create 1 byte in\n let b = Seq.append b' b'' in\n assert(Seq.equal b' (Seq.slice b 0 (v len)));\n b\n\n// check efficient compilation for all back-ends\nval store_uint128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint128 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint128_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt128, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt128.(n1 >>^ 8ul) in\n assert(UInt128.v n = UInt8.v b + 256 * UInt128.v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint128 len buf' n';\n buf.(0ul) <- b // updating after the recursive call helps verification\n\nval store_big128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec store_big128 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint128_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt128, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt128.(n1 >>^ 8ul) in\n assert(UInt128.v n = UInt8.v b + 256 * UInt128.v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big128 len buf' n';\n buf.(len) <- b // updating after the recursive call helps verification\n\n(* from Spec; used e.g. in AEAD.Encoding *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 0 --max_ifuel 0\"\n\n\n(* injectivity proofs for byte encodings *)\n\ntype word = b:Seq.seq UInt8.t {Seq.length b <= 16}\nopen FStar.Math.Lib\nopen FStar.Math.Lemmas\nopen FStar.Seq\nopen FStar.Seq\n\nprivate let endian_is_injective q r q' r' : Lemma\n (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q')\n (ensures r = r' /\\ q = q') =\n lemma_mod_injective (pow2 8) (UInt8.v r) (UInt8.v r')\n\nprivate let big_endian_step (b:word{length b > 0}) :\n Lemma (big_endian b = U8.v (last b) + pow2 8 * big_endian (slice b 0 (length b - 1))) =\n ()\n\n#reset-options \"--z3rlimit 30\"\nval lemma_big_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires big_endian b = big_endian b')\n (ensures b == b')", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lib" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 30, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b: Crypto.Symmetric.Bytes.word ->\n b': Crypto.Symmetric.Bytes.word{FStar.Seq.Base.length b = FStar.Seq.Base.length b'}\n -> FStar.Pervasives.Lemma\n (requires Crypto.Symmetric.Bytes.big_endian b = Crypto.Symmetric.Bytes.big_endian b')\n (ensures b == b')\n (decreases FStar.Seq.Base.length b)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma", "" ], "mutual_with": [], "ideal_premises": [ "Crypto.Symmetric.Bytes.word", "Prims.b2t", "Prims.op_Equality", "Prims.nat", "FStar.Seq.Base.length", "FStar.UInt8.t", "Prims.int", "FStar.Seq.Base.lemma_eq_intro", "Prims.bool", "Crypto.Symmetric.Bytes.lemma_big_endian_inj", "Prims.unit", "Crypto.Symmetric.Bytes.endian_is_injective", "Crypto.Symmetric.Bytes.big_endian", "Crypto.Symmetric.Bytes.big_endian_step", "FStar.Seq.Properties.snoc", "FStar.Seq.Properties.last", "FStar.Seq.Base.seq", "FStar.Seq.Base.slice", "Prims.op_Subtraction" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_big_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires big_endian b = big_endian b')\n (ensures b == b')\n (decreases (length b))\nlet rec lemma_big_endian_inj s s' =", "completed_definiton": "let len = length s in\nif len = 0\nthen lemma_eq_intro s s'\nelse\n let t = slice s 0 (len - 1) in\n let x = last s in\n lemma_eq_intro s (snoc t x);\n big_endian_step s;\n let t' = slice s' 0 (len - 1) in\n let x' = last s' in\n lemma_eq_intro s' (snoc t' x');\n big_endian_step s';\n endian_is_injective (big_endian t) x (big_endian t') x';\n lemma_big_endian_inj t t'", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.lemma_little_endian_is_injective", "original_source_type": "val lemma_little_endian_is_injective: b:word -> b':word -> len:nat{len <= length b /\\ len <= length b'} -> Lemma\n (requires little_endian (slice b (length b - len) (length b)) = little_endian (slice b' (length b' - len) (length b')) )\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))", "source_type": "val lemma_little_endian_is_injective: b:word -> b':word -> len:nat{len <= length b /\\ len <= length b'} -> Lemma\n (requires little_endian (slice b (length b - len) (length b)) = little_endian (slice b' (length b' - len) (length b')) )\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))", "source_definition": "let rec lemma_little_endian_is_injective b b' len =\n if len = 0 then\n lemma_eq_intro (slice b (length b - len) (length b)) (slice b' (length b' - len) (length b'))\n else\n let s = slice b (length b - len) (length b) in\n let s' = slice b' (length b' - len) (length b') in\n little_endian_step s;\n little_endian_step s';\n endian_is_injective (little_endian (tail s)) (head s) (little_endian (tail s')) (head s');\n lemma_little_endian_is_injective_2 b len;\n lemma_little_endian_is_injective_2 b' len;\n lemma_little_endian_is_injective b b' (len - 1);\n lemma_little_endian_is_injective_3 b b' len", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 655, "start_col": 2, "end_line": 666, "end_col": 47 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b\n(* [SMTPat (big_endian b)] *)\n(* let rec lemma_big_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 0 (Seq.length b - 1) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_big_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.last b) < pow2 8); *)\n(* assert(big_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8); *)\n(* assert(big_endian b <= pow2 8 * (big_endian s + 1)); *)\n(* assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b = FStar.Old.Endianness.lemma_little_endian_lt_2_128 b\n (* lemma_little_endian_is_bounded b; *)\n (* if Seq.length b = 16 then () *)\n (* else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b) *)\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\n(* REMARK: The trigger in lemma_little_endian_lt_2_128 is used to prove absence of\n overflow *)\n(** Loads a machine integer from a buffer of len bytes *)\nval load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nlet rec load_uint32 len buf =\n if len = 0ul then 0ul\n else\n let h = ST.get () in\n let len = len -^ 1ul in\n let m = load_uint32 len (sub buf 1ul len) in\n lemma_little_endian_is_bounded (sel_bytes h len (sub buf 1ul len));\n assert (UInt32.v len <= 3);\n assert (UInt32.v m < pow2 (8 * (UInt32.v len)));\n FStar.Math.Lemmas.pow2_le_compat (8 * 3) (8 * (UInt32.v len));\n FStar.Math.Lemmas.pow2_plus 8 (8 * 3);\n assert (pow2 (8 * (UInt32.v len)) <= pow2 (8 * 3));\n assert (pow2 8 * pow2 (8 * 3) = UInt.max_int 32 + 1);\n assert (UInt32.v m * pow2 8 <= UInt.max_int 32);\n let b = buf.(0ul) in\n assert_norm (pow2 8 == 256);\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ m)\n\nval load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big32 len buf =\n if len = 0ul then 0ul\n else\n let len = len -^ 1ul in\n let n = load_big32 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n' *)\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ n')\n\n(** Used e.g. for converting TLS sequence numbers into AEAD nonces *)\n#reset-options \"--z3rlimit 100\"\nval load_big64: len:UInt32.t { v len <= 8 } -> buf:lbuffer (v len) -> ST UInt64.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt64.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big64 len buf =\n if len = 0ul then 0UL\n else\n let len = len -^ 1ul in\n let n = load_big64 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt64, so was shadowed, so renamed into n' *)\n FStar.UInt64.(uint8_to_uint64 b +^ 256UL *^ n')\n\n\n(* TODO: Add to FStar.Int.Cast and KaRaMeL and OCaml implementations *)\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = uint64_to_uint128 (uint8_to_uint64 a)\n\nval load_uint128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec load_uint128 len buf =\n if len = 0ul then uint64_to_uint128 0UL // Need 128-bit constants?\n else\n let n = load_uint128 (len -^ 1ul) (sub buf 1ul (len -^ 1ul)) in\n let b = buf.(0ul) in\n let h = ST.get () in\n lemma_little_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 1ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n\nval load_big128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big128 len buf =\n if len = 0ul then uint64_to_uint128 0UL\n else\n let n = load_big128 (len -^ 1ul) (sub buf 0ul (len -^ 1ul)) in\n let b = buf.(len -^ 1ul) in\n let h = ST.get () in\n lemma_big_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 0ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n(* stores a machine integer into a buffer of len bytes *)\n// 16-10-02 subsumes Buffer.Utils.bytes_of_uint32 ?\n// check efficient compilation for all back-ends\nval store_uint32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint32 len buf' n';\n buf.(0ul) <- b // updating after the recursive call helps verification\n\nval store_big32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec store_big32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big32 len buf' n';\n buf.(len) <- b // updating after the recursive call helps verification\n\nnoextract val uint32_bytes:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == little_endian b}) (decreases (v len))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nlet rec uint32_bytes len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = little_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_bytes len n' in\n assert (little_endian b' = UInt32.v n');\n let res = Seq.cons byte b' in\n assert (Seq.equal (Seq.tail res) b'); //NS: added 05/15, cf #1028\n res\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 1 --max_ifuel 1 --z3rlimit 50\"\nnoextract val uint32_be:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == big_endian b}) (decreases (v len))\n\nlet rec uint32_be len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = big_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_be len n'\n in\n let res = Seq.snoc b' byte in\n let b0, last = Seq.un_snoc res in\n assert (Seq.equal b0 b'); //NS: added 05/15, cf #1028\n res\n\n// turns an integer into a bytestream, little-endian\ninline_for_extraction val little_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b})(* (decreases (v len)) *)\ninline_for_extraction let little_bytes len n = FStar.Old.Endianness.little_bytes len n\n(* let rec little_bytes len n = *)\n(* if len = 0ul then *)\n(* Seq.empty *)\n(* else *)\n(* let len = len -^ 1ul in *)\n(* let byte = UInt8.uint_to_t (n % 256) in *)\n(* let n' = n / 256 in *)\n(* Math.Lemmas.pow2_plus 8 (8 * v len); *)\n(* assert(n' < pow2 (8 * v len )); *)\n(* let b' = little_bytes len n' in *)\n(* let b = cons byte b' in *)\n(* assert(Seq.equal b' (tail b)); *)\n(* b *)\n\n#reset-options \"--z3rlimit 400\"\n\n// turns an integer into a bytestream, big-endian\nval big_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == big_endian b}) (decreases (v len))\nlet rec big_bytes len n =\n if len = 0ul then\n Seq.empty\n else\n let len = len -^ 1ul in\n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert(n' < pow2 (8 * v len ));\n let b' = big_bytes len n' in\n let b'' = Seq.create 1 byte in\n let b = Seq.append b' b'' in\n assert(Seq.equal b' (Seq.slice b 0 (v len)));\n b\n\n// check efficient compilation for all back-ends\nval store_uint128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint128 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint128_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt128, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt128.(n1 >>^ 8ul) in\n assert(UInt128.v n = UInt8.v b + 256 * UInt128.v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint128 len buf' n';\n buf.(0ul) <- b // updating after the recursive call helps verification\n\nval store_big128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec store_big128 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint128_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt128, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt128.(n1 >>^ 8ul) in\n assert(UInt128.v n = UInt8.v b + 256 * UInt128.v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big128 len buf' n';\n buf.(len) <- b // updating after the recursive call helps verification\n\n(* from Spec; used e.g. in AEAD.Encoding *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 0 --max_ifuel 0\"\n\n\n(* injectivity proofs for byte encodings *)\n\ntype word = b:Seq.seq UInt8.t {Seq.length b <= 16}\nopen FStar.Math.Lib\nopen FStar.Math.Lemmas\nopen FStar.Seq\nopen FStar.Seq\n\nprivate let endian_is_injective q r q' r' : Lemma\n (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q')\n (ensures r = r' /\\ q = q') =\n lemma_mod_injective (pow2 8) (UInt8.v r) (UInt8.v r')\n\nprivate let big_endian_step (b:word{length b > 0}) :\n Lemma (big_endian b = U8.v (last b) + pow2 8 * big_endian (slice b 0 (length b - 1))) =\n ()\n\n#reset-options \"--z3rlimit 30\"\nval lemma_big_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires big_endian b = big_endian b')\n (ensures b == b')\n (decreases (length b))\nlet rec lemma_big_endian_inj s s' =\n let len = length s in\n if len = 0 then lemma_eq_intro s s'\n else\n let t = slice s 0 (len - 1) in\n let x = last s in\n lemma_eq_intro s (snoc t x);\n big_endian_step s;\n let t' = slice s' 0 (len - 1) in\n let x' = last s' in\n lemma_eq_intro s' (snoc t' x');\n big_endian_step s';\n endian_is_injective (big_endian t) x (big_endian t') x';\n lemma_big_endian_inj t t'\n\n(* the little endian proof could be simplified, as above *)\n\n(* this lemma is used only Crypto.Symmetric.Poly1305 *)\nval lemma_little_endian_is_injective_1: b:pos -> q:nat -> r:nat -> q':nat -> r':nat -> Lemma\n (requires (r < b /\\ r' < b /\\ r + b * q = r' + b * q'))\n (ensures (r = r' /\\ q = q'))\nlet lemma_little_endian_is_injective_1 b q r q' r' =\n lemma_mod_plus r q b;\n lemma_mod_plus r' q' b;\n lemma_mod_injective b r r'\n\n(* a sequence associativity property: ... @ ([x] @ s) == ... @ [x]) @ s *)\nprivate val lemma_little_endian_is_injective_2: b:word -> len:pos{len <= length b} -> Lemma\n (let s = slice b (length b - len) (length b) in\n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n s'' == s')\nlet lemma_little_endian_is_injective_2 b len =\n let s = slice b (length b - len) (length b) in\n let s' = slice s 1 (length s) in\n let s'' = slice b (length b - (len - 1)) (length b) in\n lemma_eq_intro s' s''\n\n(* a sequence injectivity property *)\nprivate val lemma_little_endian_is_injective_3: b:word -> b':word -> len:pos{len <= length b /\\ len <= length b'} -> Lemma\n (requires\n slice b (length b - (len - 1)) (length b) == slice b' (length b' - (len-1)) (length b') /\\\n Seq.index b (length b - len) = Seq.index b' (length b' - len))\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))\nlet lemma_little_endian_is_injective_3 b b' len =\n lemma_eq_intro (slice b (length b - len) (length b)) (cons (index b (length b - len)) (slice b (length b - (len-1)) (length b)));\n lemma_eq_intro (slice b' (length b' - len) (length b')) (cons (index b' (length b' - len)) (slice b' (length b' - (len-1)) (length b')))\n\nprivate let little_endian_step (b:word{length b > 0}):\n Lemma (little_endian b = U8.v (head b) + pow2 8 * little_endian (tail b))\n = ()\n\nval lemma_little_endian_is_injective: b:word -> b':word -> len:nat{len <= length b /\\ len <= length b'} -> Lemma\n (requires little_endian (slice b (length b - len) (length b)) = little_endian (slice b' (length b' - len) (length b')) )\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lib" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 30, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b: Crypto.Symmetric.Bytes.word ->\n b': Crypto.Symmetric.Bytes.word ->\n len: Prims.nat{len <= FStar.Seq.Base.length b /\\ len <= FStar.Seq.Base.length b'}\n -> FStar.Pervasives.Lemma\n (requires\n Crypto.Symmetric.Bytes.little_endian (FStar.Seq.Base.slice b\n (FStar.Seq.Base.length b - len)\n (FStar.Seq.Base.length b)) =\n Crypto.Symmetric.Bytes.little_endian (FStar.Seq.Base.slice b'\n (FStar.Seq.Base.length b' - len)\n (FStar.Seq.Base.length b')))\n (ensures\n FStar.Seq.Base.slice b (FStar.Seq.Base.length b - len) (FStar.Seq.Base.length b) ==\n FStar.Seq.Base.slice b' (FStar.Seq.Base.length b' - len) (FStar.Seq.Base.length b'))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Crypto.Symmetric.Bytes.word", "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "FStar.UInt8.t", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.lemma_eq_intro", "FStar.Seq.Base.slice", "Prims.op_Subtraction", "Prims.bool", "Crypto.Symmetric.Bytes.lemma_little_endian_is_injective_3", "Prims.unit", "Crypto.Symmetric.Bytes.lemma_little_endian_is_injective", "Crypto.Symmetric.Bytes.lemma_little_endian_is_injective_2", "Crypto.Symmetric.Bytes.endian_is_injective", "Crypto.Symmetric.Bytes.little_endian", "FStar.Seq.Properties.tail", "FStar.Seq.Properties.head", "Crypto.Symmetric.Bytes.little_endian_step", "FStar.Seq.Base.seq" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_little_endian_is_injective: b:word -> b':word -> len:nat{len <= length b /\\ len <= length b'} -> Lemma\n (requires little_endian (slice b (length b - len) (length b)) = little_endian (slice b' (length b' - len) (length b')) )\n (ensures slice b (length b - len) (length b) == slice b' (length b' - len) (length b'))\nlet rec lemma_little_endian_is_injective b b' len =", "completed_definiton": "if len = 0\nthen lemma_eq_intro (slice b (length b - len) (length b)) (slice b' (length b' - len) (length b'))\nelse\n let s = slice b (length b - len) (length b) in\n let s' = slice b' (length b' - len) (length b') in\n little_endian_step s;\n little_endian_step s';\n endian_is_injective (little_endian (tail s)) (head s) (little_endian (tail s')) (head s');\n lemma_little_endian_is_injective_2 b len;\n lemma_little_endian_is_injective_2 b' len;\n lemma_little_endian_is_injective b b' (len - 1);\n lemma_little_endian_is_injective_3 b b' len", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.load_big32", "original_source_type": "val load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))", "source_type": "val load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))", "source_definition": "let rec load_big32 len buf =\n if len = 0ul then 0ul\n else\n let len = len -^ 1ul in\n let n = load_big32 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n' *)\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ n')", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 316, "start_col": 2, "end_line": 323, "end_col": 51 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b\n(* [SMTPat (big_endian b)] *)\n(* let rec lemma_big_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 0 (Seq.length b - 1) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_big_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.last b) < pow2 8); *)\n(* assert(big_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8); *)\n(* assert(big_endian b <= pow2 8 * (big_endian s + 1)); *)\n(* assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b = FStar.Old.Endianness.lemma_little_endian_lt_2_128 b\n (* lemma_little_endian_is_bounded b; *)\n (* if Seq.length b = 16 then () *)\n (* else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b) *)\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\n(* REMARK: The trigger in lemma_little_endian_lt_2_128 is used to prove absence of\n overflow *)\n(** Loads a machine integer from a buffer of len bytes *)\nval load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nlet rec load_uint32 len buf =\n if len = 0ul then 0ul\n else\n let h = ST.get () in\n let len = len -^ 1ul in\n let m = load_uint32 len (sub buf 1ul len) in\n lemma_little_endian_is_bounded (sel_bytes h len (sub buf 1ul len));\n assert (UInt32.v len <= 3);\n assert (UInt32.v m < pow2 (8 * (UInt32.v len)));\n FStar.Math.Lemmas.pow2_le_compat (8 * 3) (8 * (UInt32.v len));\n FStar.Math.Lemmas.pow2_plus 8 (8 * 3);\n assert (pow2 (8 * (UInt32.v len)) <= pow2 (8 * 3));\n assert (pow2 8 * pow2 (8 * 3) = UInt.max_int 32 + 1);\n assert (UInt32.v m * pow2 8 <= UInt.max_int 32);\n let b = buf.(0ul) in\n assert_norm (pow2 8 == 256);\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ m)\n\nval load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n len: FStar.UInt32.t{FStar.UInt32.v len <= 4} ->\n buf: Crypto.Symmetric.Bytes.lbuffer (FStar.UInt32.v len)\n -> FStar.HyperStack.ST.ST FStar.UInt32.t", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "Crypto.Symmetric.Bytes.lbuffer", "Prims.op_Equality", "FStar.UInt32.__uint_to_t", "Prims.bool", "FStar.UInt32.op_Plus_Hat", "FStar.Int.Cast.uint8_to_uint32", "FStar.UInt32.op_Star_Hat", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.int", "Prims.pow2", "FStar.UInt8.t", "FStar.Buffer.op_Array_Access", "Crypto.Symmetric.Bytes.load_big32", "FStar.Buffer.sub", "FStar.UInt32.op_Subtraction_Hat" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big32 len buf =", "completed_definiton": "if len = 0ul\nthen 0ul\nelse\n let len = len -^ 1ul in\n let n = load_big32 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in\n let open FStar.UInt32 in uint8_to_uint32 b +^ 256ul *^ n'", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.uint32_be", "original_source_type": "val uint32_be:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == big_endian b}) (decreases (v len))", "source_type": "val uint32_be:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == big_endian b}) (decreases (v len))", "source_definition": "let rec uint32_be len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = big_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_be len n'\n in\n let res = Seq.snoc b' byte in\n let b0, last = Seq.un_snoc res in\n assert (Seq.equal b0 b'); //NS: added 05/15, cf #1028\n res", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 471, "start_col": 2, "end_line": 489, "end_col": 7 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b\n(* [SMTPat (big_endian b)] *)\n(* let rec lemma_big_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 0 (Seq.length b - 1) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_big_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.last b) < pow2 8); *)\n(* assert(big_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8); *)\n(* assert(big_endian b <= pow2 8 * (big_endian s + 1)); *)\n(* assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b = FStar.Old.Endianness.lemma_little_endian_lt_2_128 b\n (* lemma_little_endian_is_bounded b; *)\n (* if Seq.length b = 16 then () *)\n (* else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b) *)\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\n(* REMARK: The trigger in lemma_little_endian_lt_2_128 is used to prove absence of\n overflow *)\n(** Loads a machine integer from a buffer of len bytes *)\nval load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nlet rec load_uint32 len buf =\n if len = 0ul then 0ul\n else\n let h = ST.get () in\n let len = len -^ 1ul in\n let m = load_uint32 len (sub buf 1ul len) in\n lemma_little_endian_is_bounded (sel_bytes h len (sub buf 1ul len));\n assert (UInt32.v len <= 3);\n assert (UInt32.v m < pow2 (8 * (UInt32.v len)));\n FStar.Math.Lemmas.pow2_le_compat (8 * 3) (8 * (UInt32.v len));\n FStar.Math.Lemmas.pow2_plus 8 (8 * 3);\n assert (pow2 (8 * (UInt32.v len)) <= pow2 (8 * 3));\n assert (pow2 8 * pow2 (8 * 3) = UInt.max_int 32 + 1);\n assert (UInt32.v m * pow2 8 <= UInt.max_int 32);\n let b = buf.(0ul) in\n assert_norm (pow2 8 == 256);\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ m)\n\nval load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big32 len buf =\n if len = 0ul then 0ul\n else\n let len = len -^ 1ul in\n let n = load_big32 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n' *)\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ n')\n\n(** Used e.g. for converting TLS sequence numbers into AEAD nonces *)\n#reset-options \"--z3rlimit 100\"\nval load_big64: len:UInt32.t { v len <= 8 } -> buf:lbuffer (v len) -> ST UInt64.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt64.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big64 len buf =\n if len = 0ul then 0UL\n else\n let len = len -^ 1ul in\n let n = load_big64 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt64, so was shadowed, so renamed into n' *)\n FStar.UInt64.(uint8_to_uint64 b +^ 256UL *^ n')\n\n\n(* TODO: Add to FStar.Int.Cast and KaRaMeL and OCaml implementations *)\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = uint64_to_uint128 (uint8_to_uint64 a)\n\nval load_uint128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec load_uint128 len buf =\n if len = 0ul then uint64_to_uint128 0UL // Need 128-bit constants?\n else\n let n = load_uint128 (len -^ 1ul) (sub buf 1ul (len -^ 1ul)) in\n let b = buf.(0ul) in\n let h = ST.get () in\n lemma_little_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 1ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n\nval load_big128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big128 len buf =\n if len = 0ul then uint64_to_uint128 0UL\n else\n let n = load_big128 (len -^ 1ul) (sub buf 0ul (len -^ 1ul)) in\n let b = buf.(len -^ 1ul) in\n let h = ST.get () in\n lemma_big_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 0ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n(* stores a machine integer into a buffer of len bytes *)\n// 16-10-02 subsumes Buffer.Utils.bytes_of_uint32 ?\n// check efficient compilation for all back-ends\nval store_uint32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint32 len buf' n';\n buf.(0ul) <- b // updating after the recursive call helps verification\n\nval store_big32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec store_big32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big32 len buf' n';\n buf.(len) <- b // updating after the recursive call helps verification\n\nnoextract val uint32_bytes:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == little_endian b}) (decreases (v len))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nlet rec uint32_bytes len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = little_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_bytes len n' in\n assert (little_endian b' = UInt32.v n');\n let res = Seq.cons byte b' in\n assert (Seq.equal (Seq.tail res) b'); //NS: added 05/15, cf #1028\n res\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 1 --max_ifuel 1 --z3rlimit 50\"\nnoextract val uint32_be:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == big_endian b}) (decreases (v len))", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 1, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 50, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n len: FStar.UInt32.t{FStar.UInt32.v len <= 4} ->\n n: FStar.UInt32.t{FStar.UInt32.v n < Prims.pow2 (8 * FStar.UInt32.v len)}\n -> Prims.Tot\n (b:\n Crypto.Symmetric.Bytes.lbytes (FStar.UInt32.v len)\n {FStar.UInt32.v n == Crypto.Symmetric.Bytes.big_endian b})", "effect": "Prims.Tot", "effect_flags": [ "total", "" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "Prims.op_LessThan", "Prims.pow2", "FStar.Mul.op_Star", "Prims.op_Equality", "FStar.UInt32.__uint_to_t", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.int", "Crypto.Symmetric.Bytes.big_endian", "FStar.Seq.Base.seq", "FStar.UInt8.t", "FStar.Seq.Base.length", "FStar.Seq.Base.empty", "Prims.bool", "Prims._assert", "FStar.Seq.Base.equal", "Crypto.Symmetric.Bytes.lbytes", "Prims.eq2", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.op_GreaterThanOrEqual", "FStar.Pervasives.Native.tuple2", "FStar.Seq.Properties.snoc", "FStar.Pervasives.Native.fst", "FStar.Pervasives.Native.snd", "FStar.Seq.Properties.un_snoc", "Crypto.Symmetric.Bytes.uint32_be", "FStar.Math.Lemmas.pow2_plus", "Prims.op_Addition", "FStar.UInt8.v", "FStar.UInt32.op_Greater_Greater_Hat", "Prims.op_Multiply", "Prims.op_Modulus", "FStar.Int.Cast.uint32_to_uint8", "FStar.UInt32.op_Subtraction_Hat" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val uint32_be:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == big_endian b}) (decreases (v len))\nlet rec uint32_be len n =", "completed_definiton": "if len = 0ul\nthen\n let e = Seq.empty #UInt8.t in\n assert_norm (0 = big_endian e);\n e\nelse\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in\n let n' = let open FStar.UInt32 in n1 >>^ 8ul in\n assert (v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert (v n' < pow2 (8 * v len));\n let b' = uint32_be len n' in\n let res = Seq.snoc b' byte in\n let b0, last = Seq.un_snoc res in\n assert (Seq.equal b0 b');\n res", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.big_bytes", "original_source_type": "val big_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == big_endian b}) (decreases (v len))", "source_type": "val big_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == big_endian b}) (decreases (v len))", "source_definition": "let rec big_bytes len n =\n if len = 0ul then\n Seq.empty\n else\n let len = len -^ 1ul in\n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert(n' < pow2 (8 * v len ));\n let b' = big_bytes len n' in\n let b'' = Seq.create 1 byte in\n let b = Seq.append b' b'' in\n assert(Seq.equal b' (Seq.slice b 0 (v len)));\n b", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 517, "start_col": 2, "end_line": 529, "end_col": 5 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b\n(* [SMTPat (big_endian b)] *)\n(* let rec lemma_big_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 0 (Seq.length b - 1) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_big_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.last b) < pow2 8); *)\n(* assert(big_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8); *)\n(* assert(big_endian b <= pow2 8 * (big_endian s + 1)); *)\n(* assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b = FStar.Old.Endianness.lemma_little_endian_lt_2_128 b\n (* lemma_little_endian_is_bounded b; *)\n (* if Seq.length b = 16 then () *)\n (* else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b) *)\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\n(* REMARK: The trigger in lemma_little_endian_lt_2_128 is used to prove absence of\n overflow *)\n(** Loads a machine integer from a buffer of len bytes *)\nval load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nlet rec load_uint32 len buf =\n if len = 0ul then 0ul\n else\n let h = ST.get () in\n let len = len -^ 1ul in\n let m = load_uint32 len (sub buf 1ul len) in\n lemma_little_endian_is_bounded (sel_bytes h len (sub buf 1ul len));\n assert (UInt32.v len <= 3);\n assert (UInt32.v m < pow2 (8 * (UInt32.v len)));\n FStar.Math.Lemmas.pow2_le_compat (8 * 3) (8 * (UInt32.v len));\n FStar.Math.Lemmas.pow2_plus 8 (8 * 3);\n assert (pow2 (8 * (UInt32.v len)) <= pow2 (8 * 3));\n assert (pow2 8 * pow2 (8 * 3) = UInt.max_int 32 + 1);\n assert (UInt32.v m * pow2 8 <= UInt.max_int 32);\n let b = buf.(0ul) in\n assert_norm (pow2 8 == 256);\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ m)\n\nval load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big32 len buf =\n if len = 0ul then 0ul\n else\n let len = len -^ 1ul in\n let n = load_big32 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n' *)\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ n')\n\n(** Used e.g. for converting TLS sequence numbers into AEAD nonces *)\n#reset-options \"--z3rlimit 100\"\nval load_big64: len:UInt32.t { v len <= 8 } -> buf:lbuffer (v len) -> ST UInt64.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt64.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big64 len buf =\n if len = 0ul then 0UL\n else\n let len = len -^ 1ul in\n let n = load_big64 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt64, so was shadowed, so renamed into n' *)\n FStar.UInt64.(uint8_to_uint64 b +^ 256UL *^ n')\n\n\n(* TODO: Add to FStar.Int.Cast and KaRaMeL and OCaml implementations *)\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = uint64_to_uint128 (uint8_to_uint64 a)\n\nval load_uint128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec load_uint128 len buf =\n if len = 0ul then uint64_to_uint128 0UL // Need 128-bit constants?\n else\n let n = load_uint128 (len -^ 1ul) (sub buf 1ul (len -^ 1ul)) in\n let b = buf.(0ul) in\n let h = ST.get () in\n lemma_little_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 1ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n\nval load_big128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big128 len buf =\n if len = 0ul then uint64_to_uint128 0UL\n else\n let n = load_big128 (len -^ 1ul) (sub buf 0ul (len -^ 1ul)) in\n let b = buf.(len -^ 1ul) in\n let h = ST.get () in\n lemma_big_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 0ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n(* stores a machine integer into a buffer of len bytes *)\n// 16-10-02 subsumes Buffer.Utils.bytes_of_uint32 ?\n// check efficient compilation for all back-ends\nval store_uint32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint32 len buf' n';\n buf.(0ul) <- b // updating after the recursive call helps verification\n\nval store_big32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec store_big32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big32 len buf' n';\n buf.(len) <- b // updating after the recursive call helps verification\n\nnoextract val uint32_bytes:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == little_endian b}) (decreases (v len))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nlet rec uint32_bytes len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = little_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_bytes len n' in\n assert (little_endian b' = UInt32.v n');\n let res = Seq.cons byte b' in\n assert (Seq.equal (Seq.tail res) b'); //NS: added 05/15, cf #1028\n res\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 1 --max_ifuel 1 --z3rlimit 50\"\nnoextract val uint32_be:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == big_endian b}) (decreases (v len))\n\nlet rec uint32_be len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = big_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_be len n'\n in\n let res = Seq.snoc b' byte in\n let b0, last = Seq.un_snoc res in\n assert (Seq.equal b0 b'); //NS: added 05/15, cf #1028\n res\n\n// turns an integer into a bytestream, little-endian\ninline_for_extraction val little_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b})(* (decreases (v len)) *)\ninline_for_extraction let little_bytes len n = FStar.Old.Endianness.little_bytes len n\n(* let rec little_bytes len n = *)\n(* if len = 0ul then *)\n(* Seq.empty *)\n(* else *)\n(* let len = len -^ 1ul in *)\n(* let byte = UInt8.uint_to_t (n % 256) in *)\n(* let n' = n / 256 in *)\n(* Math.Lemmas.pow2_plus 8 (8 * v len); *)\n(* assert(n' < pow2 (8 * v len )); *)\n(* let b' = little_bytes len n' in *)\n(* let b = cons byte b' in *)\n(* assert(Seq.equal b' (tail b)); *)\n(* b *)\n\n#reset-options \"--z3rlimit 400\"\n\n// turns an integer into a bytestream, big-endian\nval big_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == big_endian b}) (decreases (v len))", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 400, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "len: FStar.UInt32.t -> n: Prims.nat{n < Prims.pow2 (8 * FStar.UInt32.v len)}\n -> Prims.Tot\n (b:\n Crypto.Symmetric.Bytes.lbytes (FStar.UInt32.v len) {n == Crypto.Symmetric.Bytes.big_endian b})", "effect": "Prims.Tot", "effect_flags": [ "total", "" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Prims.pow2", "FStar.Mul.op_Star", "FStar.UInt32.v", "Prims.op_Equality", "FStar.UInt32.__uint_to_t", "FStar.Seq.Base.empty", "FStar.UInt8.t", "Prims.bool", "Prims.unit", "Prims._assert", "FStar.Seq.Base.equal", "FStar.Seq.Base.slice", "FStar.Seq.Base.seq", "FStar.Seq.Base.append", "FStar.Seq.Base.create", "Crypto.Symmetric.Bytes.lbytes", "Prims.eq2", "Crypto.Symmetric.Bytes.big_endian", "Crypto.Symmetric.Bytes.big_bytes", "FStar.Math.Lemmas.pow2_plus", "Prims.int", "Prims.op_Division", "FStar.UInt8.uint_to_t", "Prims.op_Modulus", "FStar.UInt32.op_Subtraction_Hat" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val big_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == big_endian b}) (decreases (v len))\nlet rec big_bytes len n =", "completed_definiton": "if len = 0ul\nthen Seq.empty\nelse\n let len = len -^ 1ul in\n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert (n' < pow2 (8 * v len));\n let b' = big_bytes len n' in\n let b'' = Seq.create 1 byte in\n let b = Seq.append b' b'' in\n assert (Seq.equal b' (Seq.slice b 0 (v len)));\n b", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.uint32_bytes", "original_source_type": "val uint32_bytes:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == little_endian b}) (decreases (v len))", "source_type": "val uint32_bytes:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == little_endian b}) (decreases (v len))", "source_definition": "let rec uint32_bytes len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = little_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_bytes len n' in\n assert (little_endian b' = UInt32.v n');\n let res = Seq.cons byte b' in\n assert (Seq.equal (Seq.tail res) b'); //NS: added 05/15, cf #1028\n res", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 446, "start_col": 2, "end_line": 463, "end_col": 7 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b\n(* [SMTPat (big_endian b)] *)\n(* let rec lemma_big_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 0 (Seq.length b - 1) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_big_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.last b) < pow2 8); *)\n(* assert(big_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8); *)\n(* assert(big_endian b <= pow2 8 * (big_endian s + 1)); *)\n(* assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b = FStar.Old.Endianness.lemma_little_endian_lt_2_128 b\n (* lemma_little_endian_is_bounded b; *)\n (* if Seq.length b = 16 then () *)\n (* else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b) *)\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\n(* REMARK: The trigger in lemma_little_endian_lt_2_128 is used to prove absence of\n overflow *)\n(** Loads a machine integer from a buffer of len bytes *)\nval load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nlet rec load_uint32 len buf =\n if len = 0ul then 0ul\n else\n let h = ST.get () in\n let len = len -^ 1ul in\n let m = load_uint32 len (sub buf 1ul len) in\n lemma_little_endian_is_bounded (sel_bytes h len (sub buf 1ul len));\n assert (UInt32.v len <= 3);\n assert (UInt32.v m < pow2 (8 * (UInt32.v len)));\n FStar.Math.Lemmas.pow2_le_compat (8 * 3) (8 * (UInt32.v len));\n FStar.Math.Lemmas.pow2_plus 8 (8 * 3);\n assert (pow2 (8 * (UInt32.v len)) <= pow2 (8 * 3));\n assert (pow2 8 * pow2 (8 * 3) = UInt.max_int 32 + 1);\n assert (UInt32.v m * pow2 8 <= UInt.max_int 32);\n let b = buf.(0ul) in\n assert_norm (pow2 8 == 256);\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ m)\n\nval load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big32 len buf =\n if len = 0ul then 0ul\n else\n let len = len -^ 1ul in\n let n = load_big32 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n' *)\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ n')\n\n(** Used e.g. for converting TLS sequence numbers into AEAD nonces *)\n#reset-options \"--z3rlimit 100\"\nval load_big64: len:UInt32.t { v len <= 8 } -> buf:lbuffer (v len) -> ST UInt64.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt64.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big64 len buf =\n if len = 0ul then 0UL\n else\n let len = len -^ 1ul in\n let n = load_big64 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt64, so was shadowed, so renamed into n' *)\n FStar.UInt64.(uint8_to_uint64 b +^ 256UL *^ n')\n\n\n(* TODO: Add to FStar.Int.Cast and KaRaMeL and OCaml implementations *)\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = uint64_to_uint128 (uint8_to_uint64 a)\n\nval load_uint128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec load_uint128 len buf =\n if len = 0ul then uint64_to_uint128 0UL // Need 128-bit constants?\n else\n let n = load_uint128 (len -^ 1ul) (sub buf 1ul (len -^ 1ul)) in\n let b = buf.(0ul) in\n let h = ST.get () in\n lemma_little_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 1ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n\nval load_big128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big128 len buf =\n if len = 0ul then uint64_to_uint128 0UL\n else\n let n = load_big128 (len -^ 1ul) (sub buf 0ul (len -^ 1ul)) in\n let b = buf.(len -^ 1ul) in\n let h = ST.get () in\n lemma_big_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 0ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n(* stores a machine integer into a buffer of len bytes *)\n// 16-10-02 subsumes Buffer.Utils.bytes_of_uint32 ?\n// check efficient compilation for all back-ends\nval store_uint32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint32 len buf' n';\n buf.(0ul) <- b // updating after the recursive call helps verification\n\nval store_big32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec store_big32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big32 len buf' n';\n buf.(len) <- b // updating after the recursive call helps verification\n\nnoextract val uint32_bytes:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == little_endian b}) (decreases (v len))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n len: FStar.UInt32.t{FStar.UInt32.v len <= 4} ->\n n: FStar.UInt32.t{FStar.UInt32.v n < Prims.pow2 (8 * FStar.UInt32.v len)}\n -> Prims.Tot\n (b:\n Crypto.Symmetric.Bytes.lbytes (FStar.UInt32.v len)\n {FStar.UInt32.v n == Crypto.Symmetric.Bytes.little_endian b})", "effect": "Prims.Tot", "effect_flags": [ "total", "" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "Prims.op_LessThan", "Prims.pow2", "FStar.Mul.op_Star", "Prims.op_Equality", "FStar.UInt32.__uint_to_t", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.int", "Crypto.Symmetric.Bytes.little_endian", "FStar.Seq.Base.seq", "FStar.UInt8.t", "FStar.Seq.Base.length", "FStar.Seq.Base.empty", "Prims.bool", "Prims._assert", "FStar.Seq.Base.equal", "FStar.Seq.Properties.tail", "FStar.Seq.Properties.cons", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.op_GreaterThanOrEqual", "Crypto.Symmetric.Bytes.lbytes", "Prims.eq2", "Crypto.Symmetric.Bytes.uint32_bytes", "FStar.Math.Lemmas.pow2_plus", "Prims.op_Addition", "FStar.UInt8.v", "FStar.UInt32.op_Greater_Greater_Hat", "Prims.op_Multiply", "Prims.op_Modulus", "FStar.Int.Cast.uint32_to_uint8", "FStar.UInt32.op_Subtraction_Hat" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val uint32_bytes:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == little_endian b}) (decreases (v len))\nlet rec uint32_bytes len n =", "completed_definiton": "if len = 0ul\nthen\n let e = Seq.empty #UInt8.t in\n assert_norm (0 = little_endian e);\n e\nelse\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in\n let n' = let open FStar.UInt32 in n1 >>^ 8ul in\n assert (v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert (v n' < pow2 (8 * v len));\n let b' = uint32_bytes len n' in\n assert (little_endian b' = UInt32.v n');\n let res = Seq.cons byte b' in\n assert (Seq.equal (Seq.tail res) b');\n res", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.load_big128", "original_source_type": "val load_big128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))", "source_type": "val load_big128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))", "source_definition": "let rec load_big128 len buf =\n if len = 0ul then uint64_to_uint128 0UL\n else\n let n = load_big128 (len -^ 1ul) (sub buf 0ul (len -^ 1ul)) in\n let b = buf.(len -^ 1ul) in\n let h = ST.get () in\n lemma_big_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 0ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 378, "start_col": 2, "end_line": 394, "end_col": 54 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b\n(* [SMTPat (big_endian b)] *)\n(* let rec lemma_big_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 0 (Seq.length b - 1) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_big_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.last b) < pow2 8); *)\n(* assert(big_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8); *)\n(* assert(big_endian b <= pow2 8 * (big_endian s + 1)); *)\n(* assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b = FStar.Old.Endianness.lemma_little_endian_lt_2_128 b\n (* lemma_little_endian_is_bounded b; *)\n (* if Seq.length b = 16 then () *)\n (* else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b) *)\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\n(* REMARK: The trigger in lemma_little_endian_lt_2_128 is used to prove absence of\n overflow *)\n(** Loads a machine integer from a buffer of len bytes *)\nval load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nlet rec load_uint32 len buf =\n if len = 0ul then 0ul\n else\n let h = ST.get () in\n let len = len -^ 1ul in\n let m = load_uint32 len (sub buf 1ul len) in\n lemma_little_endian_is_bounded (sel_bytes h len (sub buf 1ul len));\n assert (UInt32.v len <= 3);\n assert (UInt32.v m < pow2 (8 * (UInt32.v len)));\n FStar.Math.Lemmas.pow2_le_compat (8 * 3) (8 * (UInt32.v len));\n FStar.Math.Lemmas.pow2_plus 8 (8 * 3);\n assert (pow2 (8 * (UInt32.v len)) <= pow2 (8 * 3));\n assert (pow2 8 * pow2 (8 * 3) = UInt.max_int 32 + 1);\n assert (UInt32.v m * pow2 8 <= UInt.max_int 32);\n let b = buf.(0ul) in\n assert_norm (pow2 8 == 256);\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ m)\n\nval load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big32 len buf =\n if len = 0ul then 0ul\n else\n let len = len -^ 1ul in\n let n = load_big32 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n' *)\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ n')\n\n(** Used e.g. for converting TLS sequence numbers into AEAD nonces *)\n#reset-options \"--z3rlimit 100\"\nval load_big64: len:UInt32.t { v len <= 8 } -> buf:lbuffer (v len) -> ST UInt64.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt64.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big64 len buf =\n if len = 0ul then 0UL\n else\n let len = len -^ 1ul in\n let n = load_big64 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt64, so was shadowed, so renamed into n' *)\n FStar.UInt64.(uint8_to_uint64 b +^ 256UL *^ n')\n\n\n(* TODO: Add to FStar.Int.Cast and KaRaMeL and OCaml implementations *)\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = uint64_to_uint128 (uint8_to_uint64 a)\n\nval load_uint128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec load_uint128 len buf =\n if len = 0ul then uint64_to_uint128 0UL // Need 128-bit constants?\n else\n let n = load_uint128 (len -^ 1ul) (sub buf 1ul (len -^ 1ul)) in\n let b = buf.(0ul) in\n let h = ST.get () in\n lemma_little_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 1ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n\nval load_big128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n len: FStar.UInt32.t{FStar.UInt32.v len <= 16} ->\n buf: Crypto.Symmetric.Bytes.lbuffer (FStar.UInt32.v len)\n -> FStar.HyperStack.ST.ST FStar.UInt128.t", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "Crypto.Symmetric.Bytes.lbuffer", "Prims.op_Equality", "FStar.UInt32.__uint_to_t", "FStar.Int.Cast.Full.uint64_to_uint128", "FStar.UInt64.__uint_to_t", "FStar.UInt128.t", "Prims.bool", "FStar.UInt128.op_Plus_Hat", "Crypto.Symmetric.Bytes.uint8_to_uint128", "FStar.UInt128.op_Less_Less_Hat", "Prims.unit", "Prims._assert", "Prims.eq2", "Prims.int", "FStar.Mul.op_Star", "FStar.UInt128.v", "FStar.Pervasives.assert_norm", "Prims.pow2", "FStar.Math.Lemmas.modulo_lemma", "Prims.op_Subtraction", "FStar.Math.Lemmas.pow2_le_compat", "Crypto.Symmetric.Bytes.lemma_big_endian_is_bounded", "Crypto.Symmetric.Bytes.sel_bytes", "FStar.UInt32.op_Subtraction_Hat", "FStar.Buffer.sub", "FStar.UInt8.t", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "FStar.Buffer.op_Array_Access", "Crypto.Symmetric.Bytes.load_big128" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val load_big128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big128 len buf =", "completed_definiton": "if len = 0ul\nthen uint64_to_uint128 0uL\nelse\n let n = load_big128 (len -^ 1ul) (sub buf 0ul (len -^ 1ul)) in\n let b = buf.(len -^ 1ul) in\n let h = ST.get () in\n lemma_big_endian_is_bounded (sel_bytes h (len -^ 1ul) (sub buf 0ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n let open FStar.UInt128 in uint8_to_uint128 b +^ (n' <<^ 8ul)", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.store_big128", "original_source_type": "val store_big128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))", "source_type": "val store_big128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))", "source_definition": "let rec store_big128 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint128_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt128, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt128.(n1 >>^ 8ul) in\n assert(UInt128.v n = UInt8.v b + 256 * UInt128.v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big128 len buf' n';\n buf.(len) <- b", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 560, "start_col": 2, "end_line": 570, "end_col": 18 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b\n(* [SMTPat (big_endian b)] *)\n(* let rec lemma_big_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 0 (Seq.length b - 1) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_big_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.last b) < pow2 8); *)\n(* assert(big_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8); *)\n(* assert(big_endian b <= pow2 8 * (big_endian s + 1)); *)\n(* assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b = FStar.Old.Endianness.lemma_little_endian_lt_2_128 b\n (* lemma_little_endian_is_bounded b; *)\n (* if Seq.length b = 16 then () *)\n (* else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b) *)\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\n(* REMARK: The trigger in lemma_little_endian_lt_2_128 is used to prove absence of\n overflow *)\n(** Loads a machine integer from a buffer of len bytes *)\nval load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nlet rec load_uint32 len buf =\n if len = 0ul then 0ul\n else\n let h = ST.get () in\n let len = len -^ 1ul in\n let m = load_uint32 len (sub buf 1ul len) in\n lemma_little_endian_is_bounded (sel_bytes h len (sub buf 1ul len));\n assert (UInt32.v len <= 3);\n assert (UInt32.v m < pow2 (8 * (UInt32.v len)));\n FStar.Math.Lemmas.pow2_le_compat (8 * 3) (8 * (UInt32.v len));\n FStar.Math.Lemmas.pow2_plus 8 (8 * 3);\n assert (pow2 (8 * (UInt32.v len)) <= pow2 (8 * 3));\n assert (pow2 8 * pow2 (8 * 3) = UInt.max_int 32 + 1);\n assert (UInt32.v m * pow2 8 <= UInt.max_int 32);\n let b = buf.(0ul) in\n assert_norm (pow2 8 == 256);\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ m)\n\nval load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big32 len buf =\n if len = 0ul then 0ul\n else\n let len = len -^ 1ul in\n let n = load_big32 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n' *)\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ n')\n\n(** Used e.g. for converting TLS sequence numbers into AEAD nonces *)\n#reset-options \"--z3rlimit 100\"\nval load_big64: len:UInt32.t { v len <= 8 } -> buf:lbuffer (v len) -> ST UInt64.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt64.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big64 len buf =\n if len = 0ul then 0UL\n else\n let len = len -^ 1ul in\n let n = load_big64 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt64, so was shadowed, so renamed into n' *)\n FStar.UInt64.(uint8_to_uint64 b +^ 256UL *^ n')\n\n\n(* TODO: Add to FStar.Int.Cast and KaRaMeL and OCaml implementations *)\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = uint64_to_uint128 (uint8_to_uint64 a)\n\nval load_uint128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec load_uint128 len buf =\n if len = 0ul then uint64_to_uint128 0UL // Need 128-bit constants?\n else\n let n = load_uint128 (len -^ 1ul) (sub buf 1ul (len -^ 1ul)) in\n let b = buf.(0ul) in\n let h = ST.get () in\n lemma_little_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 1ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n\nval load_big128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big128 len buf =\n if len = 0ul then uint64_to_uint128 0UL\n else\n let n = load_big128 (len -^ 1ul) (sub buf 0ul (len -^ 1ul)) in\n let b = buf.(len -^ 1ul) in\n let h = ST.get () in\n lemma_big_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 0ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n(* stores a machine integer into a buffer of len bytes *)\n// 16-10-02 subsumes Buffer.Utils.bytes_of_uint32 ?\n// check efficient compilation for all back-ends\nval store_uint32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint32 len buf' n';\n buf.(0ul) <- b // updating after the recursive call helps verification\n\nval store_big32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec store_big32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big32 len buf' n';\n buf.(len) <- b // updating after the recursive call helps verification\n\nnoextract val uint32_bytes:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == little_endian b}) (decreases (v len))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nlet rec uint32_bytes len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = little_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_bytes len n' in\n assert (little_endian b' = UInt32.v n');\n let res = Seq.cons byte b' in\n assert (Seq.equal (Seq.tail res) b'); //NS: added 05/15, cf #1028\n res\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 1 --max_ifuel 1 --z3rlimit 50\"\nnoextract val uint32_be:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == big_endian b}) (decreases (v len))\n\nlet rec uint32_be len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = big_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_be len n'\n in\n let res = Seq.snoc b' byte in\n let b0, last = Seq.un_snoc res in\n assert (Seq.equal b0 b'); //NS: added 05/15, cf #1028\n res\n\n// turns an integer into a bytestream, little-endian\ninline_for_extraction val little_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b})(* (decreases (v len)) *)\ninline_for_extraction let little_bytes len n = FStar.Old.Endianness.little_bytes len n\n(* let rec little_bytes len n = *)\n(* if len = 0ul then *)\n(* Seq.empty *)\n(* else *)\n(* let len = len -^ 1ul in *)\n(* let byte = UInt8.uint_to_t (n % 256) in *)\n(* let n' = n / 256 in *)\n(* Math.Lemmas.pow2_plus 8 (8 * v len); *)\n(* assert(n' < pow2 (8 * v len )); *)\n(* let b' = little_bytes len n' in *)\n(* let b = cons byte b' in *)\n(* assert(Seq.equal b' (tail b)); *)\n(* b *)\n\n#reset-options \"--z3rlimit 400\"\n\n// turns an integer into a bytestream, big-endian\nval big_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == big_endian b}) (decreases (v len))\nlet rec big_bytes len n =\n if len = 0ul then\n Seq.empty\n else\n let len = len -^ 1ul in\n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert(n' < pow2 (8 * v len ));\n let b' = big_bytes len n' in\n let b'' = Seq.create 1 byte in\n let b = Seq.append b' b'' in\n assert(Seq.equal b' (Seq.slice b 0 (v len)));\n b\n\n// check efficient compilation for all back-ends\nval store_uint128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint128 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint128_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt128, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt128.(n1 >>^ 8ul) in\n assert(UInt128.v n = UInt8.v b + 256 * UInt128.v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint128 len buf' n';\n buf.(0ul) <- b // updating after the recursive call helps verification\n\nval store_big128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 400, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n len: FStar.UInt32.t{FStar.UInt32.v len <= 16} ->\n buf: Crypto.Symmetric.Bytes.lbuffer (FStar.UInt32.v len) ->\n n: FStar.UInt128.t{FStar.UInt128.v n < Prims.pow2 (8 * FStar.UInt32.v len)}\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "Crypto.Symmetric.Bytes.lbuffer", "FStar.UInt128.t", "Prims.op_LessThan", "FStar.UInt128.v", "Prims.pow2", "FStar.Mul.op_Star", "Prims.op_disEquality", "FStar.UInt32.__uint_to_t", "FStar.Buffer.op_Array_Assignment", "FStar.UInt8.t", "Prims.unit", "Crypto.Symmetric.Bytes.store_big128", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.int", "FStar.Math.Lemmas.pow2_plus", "FStar.Buffer.buffer", "Prims.l_and", "FStar.Buffer.includes", "Prims.l_or", "Prims.op_GreaterThanOrEqual", "FStar.UInt.size", "FStar.Buffer.length", "FStar.Buffer.sub", "Prims._assert", "Prims.op_Equality", "Prims.op_Addition", "FStar.UInt8.v", "FStar.UInt128.op_Greater_Greater_Hat", "Prims.op_Multiply", "Prims.op_Modulus", "Crypto.Symmetric.Bytes.uint128_to_uint8", "FStar.UInt32.op_Subtraction_Hat", "Prims.bool" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val store_big128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec store_big128 len buf n =", "completed_definiton": "if len <> 0ul\nthen\n let len = len -^ 1ul in\n let b = uint128_to_uint8 n in\n let n1 = n in\n let n' = let open FStar.UInt128 in n1 >>^ 8ul in\n assert (UInt128.v n = UInt8.v b + 256 * UInt128.v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big128 len buf' n';\n buf.(len) <- b", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.load_uint32", "original_source_type": "val load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))", "source_type": "val load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))", "source_definition": "let rec load_uint32 len buf =\n if len = 0ul then 0ul\n else\n let h = ST.get () in\n let len = len -^ 1ul in\n let m = load_uint32 len (sub buf 1ul len) in\n lemma_little_endian_is_bounded (sel_bytes h len (sub buf 1ul len));\n assert (UInt32.v len <= 3);\n assert (UInt32.v m < pow2 (8 * (UInt32.v len)));\n FStar.Math.Lemmas.pow2_le_compat (8 * 3) (8 * (UInt32.v len));\n FStar.Math.Lemmas.pow2_plus 8 (8 * 3);\n assert (pow2 (8 * (UInt32.v len)) <= pow2 (8 * 3));\n assert (pow2 8 * pow2 (8 * 3) = UInt.max_int 32 + 1);\n assert (UInt32.v m * pow2 8 <= UInt.max_int 32);\n let b = buf.(0ul) in\n assert_norm (pow2 8 == 256);\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ m)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 293, "start_col": 2, "end_line": 308, "end_col": 50 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b\n(* [SMTPat (big_endian b)] *)\n(* let rec lemma_big_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 0 (Seq.length b - 1) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_big_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.last b) < pow2 8); *)\n(* assert(big_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8); *)\n(* assert(big_endian b <= pow2 8 * (big_endian s + 1)); *)\n(* assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b = FStar.Old.Endianness.lemma_little_endian_lt_2_128 b\n (* lemma_little_endian_is_bounded b; *)\n (* if Seq.length b = 16 then () *)\n (* else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b) *)\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\n(* REMARK: The trigger in lemma_little_endian_lt_2_128 is used to prove absence of\n overflow *)\n(** Loads a machine integer from a buffer of len bytes *)\nval load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n len: FStar.UInt32.t{FStar.UInt32.v len <= 4} ->\n buf: Crypto.Symmetric.Bytes.lbuffer (FStar.UInt32.v len)\n -> FStar.HyperStack.ST.ST FStar.UInt32.t", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "Crypto.Symmetric.Bytes.lbuffer", "Prims.op_Equality", "FStar.UInt32.__uint_to_t", "Prims.bool", "FStar.UInt32.op_Plus_Hat", "FStar.Int.Cast.uint8_to_uint32", "FStar.UInt32.op_Star_Hat", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.int", "Prims.pow2", "FStar.UInt8.t", "FStar.Buffer.op_Array_Access", "Prims._assert", "FStar.Mul.op_Star", "FStar.UInt.max_int", "Prims.op_Addition", "FStar.Math.Lemmas.pow2_plus", "FStar.Math.Lemmas.pow2_le_compat", "Prims.op_LessThan", "Crypto.Symmetric.Bytes.lemma_little_endian_is_bounded", "Crypto.Symmetric.Bytes.sel_bytes", "FStar.Buffer.sub", "Crypto.Symmetric.Bytes.load_uint32", "FStar.UInt32.op_Subtraction_Hat", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\nlet rec load_uint32 len buf =", "completed_definiton": "if len = 0ul\nthen 0ul\nelse\n let h = ST.get () in\n let len = len -^ 1ul in\n let m = load_uint32 len (sub buf 1ul len) in\n lemma_little_endian_is_bounded (sel_bytes h len (sub buf 1ul len));\n assert (UInt32.v len <= 3);\n assert (UInt32.v m < pow2 (8 * (UInt32.v len)));\n FStar.Math.Lemmas.pow2_le_compat (8 * 3) (8 * (UInt32.v len));\n FStar.Math.Lemmas.pow2_plus 8 (8 * 3);\n assert (pow2 (8 * (UInt32.v len)) <= pow2 (8 * 3));\n assert (pow2 8 * pow2 (8 * 3) = UInt.max_int 32 + 1);\n assert (UInt32.v m * pow2 8 <= UInt.max_int 32);\n let b = buf.(0ul) in\n assert_norm (pow2 8 == 256);\n let open FStar.UInt32 in uint8_to_uint32 b +^ 256ul *^ m", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.lemma_little_endian_is_injective_1", "original_source_type": "val lemma_little_endian_is_injective_1: b:pos -> q:nat -> r:nat -> q':nat -> r':nat -> Lemma\n (requires (r < b /\\ r' < b /\\ r + b * q = r' + b * q'))\n (ensures (r = r' /\\ q = q'))", "source_type": "val lemma_little_endian_is_injective_1: b:pos -> q:nat -> r:nat -> q':nat -> r':nat -> Lemma\n (requires (r < b /\\ r' < b /\\ r + b * q = r' + b * q'))\n (ensures (r = r' /\\ q = q'))", "source_definition": "let lemma_little_endian_is_injective_1 b q r q' r' =\n lemma_mod_plus r q b;\n lemma_mod_plus r' q' b;\n lemma_mod_injective b r r'", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 621, "start_col": 2, "end_line": 623, "end_col": 28 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b\n(* [SMTPat (big_endian b)] *)\n(* let rec lemma_big_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 0 (Seq.length b - 1) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_big_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.last b) < pow2 8); *)\n(* assert(big_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8); *)\n(* assert(big_endian b <= pow2 8 * (big_endian s + 1)); *)\n(* assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b = FStar.Old.Endianness.lemma_little_endian_lt_2_128 b\n (* lemma_little_endian_is_bounded b; *)\n (* if Seq.length b = 16 then () *)\n (* else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b) *)\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\n(* REMARK: The trigger in lemma_little_endian_lt_2_128 is used to prove absence of\n overflow *)\n(** Loads a machine integer from a buffer of len bytes *)\nval load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nlet rec load_uint32 len buf =\n if len = 0ul then 0ul\n else\n let h = ST.get () in\n let len = len -^ 1ul in\n let m = load_uint32 len (sub buf 1ul len) in\n lemma_little_endian_is_bounded (sel_bytes h len (sub buf 1ul len));\n assert (UInt32.v len <= 3);\n assert (UInt32.v m < pow2 (8 * (UInt32.v len)));\n FStar.Math.Lemmas.pow2_le_compat (8 * 3) (8 * (UInt32.v len));\n FStar.Math.Lemmas.pow2_plus 8 (8 * 3);\n assert (pow2 (8 * (UInt32.v len)) <= pow2 (8 * 3));\n assert (pow2 8 * pow2 (8 * 3) = UInt.max_int 32 + 1);\n assert (UInt32.v m * pow2 8 <= UInt.max_int 32);\n let b = buf.(0ul) in\n assert_norm (pow2 8 == 256);\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ m)\n\nval load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big32 len buf =\n if len = 0ul then 0ul\n else\n let len = len -^ 1ul in\n let n = load_big32 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n' *)\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ n')\n\n(** Used e.g. for converting TLS sequence numbers into AEAD nonces *)\n#reset-options \"--z3rlimit 100\"\nval load_big64: len:UInt32.t { v len <= 8 } -> buf:lbuffer (v len) -> ST UInt64.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt64.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big64 len buf =\n if len = 0ul then 0UL\n else\n let len = len -^ 1ul in\n let n = load_big64 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt64, so was shadowed, so renamed into n' *)\n FStar.UInt64.(uint8_to_uint64 b +^ 256UL *^ n')\n\n\n(* TODO: Add to FStar.Int.Cast and KaRaMeL and OCaml implementations *)\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = uint64_to_uint128 (uint8_to_uint64 a)\n\nval load_uint128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec load_uint128 len buf =\n if len = 0ul then uint64_to_uint128 0UL // Need 128-bit constants?\n else\n let n = load_uint128 (len -^ 1ul) (sub buf 1ul (len -^ 1ul)) in\n let b = buf.(0ul) in\n let h = ST.get () in\n lemma_little_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 1ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n\nval load_big128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big128 len buf =\n if len = 0ul then uint64_to_uint128 0UL\n else\n let n = load_big128 (len -^ 1ul) (sub buf 0ul (len -^ 1ul)) in\n let b = buf.(len -^ 1ul) in\n let h = ST.get () in\n lemma_big_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 0ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n(* stores a machine integer into a buffer of len bytes *)\n// 16-10-02 subsumes Buffer.Utils.bytes_of_uint32 ?\n// check efficient compilation for all back-ends\nval store_uint32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint32 len buf' n';\n buf.(0ul) <- b // updating after the recursive call helps verification\n\nval store_big32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec store_big32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big32 len buf' n';\n buf.(len) <- b // updating after the recursive call helps verification\n\nnoextract val uint32_bytes:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == little_endian b}) (decreases (v len))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nlet rec uint32_bytes len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = little_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_bytes len n' in\n assert (little_endian b' = UInt32.v n');\n let res = Seq.cons byte b' in\n assert (Seq.equal (Seq.tail res) b'); //NS: added 05/15, cf #1028\n res\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 1 --max_ifuel 1 --z3rlimit 50\"\nnoextract val uint32_be:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == big_endian b}) (decreases (v len))\n\nlet rec uint32_be len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = big_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_be len n'\n in\n let res = Seq.snoc b' byte in\n let b0, last = Seq.un_snoc res in\n assert (Seq.equal b0 b'); //NS: added 05/15, cf #1028\n res\n\n// turns an integer into a bytestream, little-endian\ninline_for_extraction val little_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b})(* (decreases (v len)) *)\ninline_for_extraction let little_bytes len n = FStar.Old.Endianness.little_bytes len n\n(* let rec little_bytes len n = *)\n(* if len = 0ul then *)\n(* Seq.empty *)\n(* else *)\n(* let len = len -^ 1ul in *)\n(* let byte = UInt8.uint_to_t (n % 256) in *)\n(* let n' = n / 256 in *)\n(* Math.Lemmas.pow2_plus 8 (8 * v len); *)\n(* assert(n' < pow2 (8 * v len )); *)\n(* let b' = little_bytes len n' in *)\n(* let b = cons byte b' in *)\n(* assert(Seq.equal b' (tail b)); *)\n(* b *)\n\n#reset-options \"--z3rlimit 400\"\n\n// turns an integer into a bytestream, big-endian\nval big_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == big_endian b}) (decreases (v len))\nlet rec big_bytes len n =\n if len = 0ul then\n Seq.empty\n else\n let len = len -^ 1ul in\n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert(n' < pow2 (8 * v len ));\n let b' = big_bytes len n' in\n let b'' = Seq.create 1 byte in\n let b = Seq.append b' b'' in\n assert(Seq.equal b' (Seq.slice b 0 (v len)));\n b\n\n// check efficient compilation for all back-ends\nval store_uint128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint128 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint128_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt128, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt128.(n1 >>^ 8ul) in\n assert(UInt128.v n = UInt8.v b + 256 * UInt128.v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint128 len buf' n';\n buf.(0ul) <- b // updating after the recursive call helps verification\n\nval store_big128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec store_big128 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint128_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt128, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt128.(n1 >>^ 8ul) in\n assert(UInt128.v n = UInt8.v b + 256 * UInt128.v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big128 len buf' n';\n buf.(len) <- b // updating after the recursive call helps verification\n\n(* from Spec; used e.g. in AEAD.Encoding *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 0 --max_ifuel 0\"\n\n\n(* injectivity proofs for byte encodings *)\n\ntype word = b:Seq.seq UInt8.t {Seq.length b <= 16}\nopen FStar.Math.Lib\nopen FStar.Math.Lemmas\nopen FStar.Seq\nopen FStar.Seq\n\nprivate let endian_is_injective q r q' r' : Lemma\n (requires UInt8.v r + pow2 8 * q = UInt8.v r' + pow2 8 * q')\n (ensures r = r' /\\ q = q') =\n lemma_mod_injective (pow2 8) (UInt8.v r) (UInt8.v r')\n\nprivate let big_endian_step (b:word{length b > 0}) :\n Lemma (big_endian b = U8.v (last b) + pow2 8 * big_endian (slice b 0 (length b - 1))) =\n ()\n\n#reset-options \"--z3rlimit 30\"\nval lemma_big_endian_inj: b:word -> b':word {length b = length b'} -> Lemma\n (requires big_endian b = big_endian b')\n (ensures b == b')\n (decreases (length b))\nlet rec lemma_big_endian_inj s s' =\n let len = length s in\n if len = 0 then lemma_eq_intro s s'\n else\n let t = slice s 0 (len - 1) in\n let x = last s in\n lemma_eq_intro s (snoc t x);\n big_endian_step s;\n let t' = slice s' 0 (len - 1) in\n let x' = last s' in\n lemma_eq_intro s' (snoc t' x');\n big_endian_step s';\n endian_is_injective (big_endian t) x (big_endian t') x';\n lemma_big_endian_inj t t'\n\n(* the little endian proof could be simplified, as above *)\n\n(* this lemma is used only Crypto.Symmetric.Poly1305 *)\nval lemma_little_endian_is_injective_1: b:pos -> q:nat -> r:nat -> q':nat -> r':nat -> Lemma\n (requires (r < b /\\ r' < b /\\ r + b * q = r' + b * q'))\n (ensures (r = r' /\\ q = q'))", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lib" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 30, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: Prims.pos -> q: Prims.nat -> r: Prims.nat -> q': Prims.nat -> r': Prims.nat\n -> FStar.Pervasives.Lemma (requires r < b /\\ r' < b /\\ r + b * q = r' + b * q')\n (ensures r = r' /\\ q = q')", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.pos", "Prims.nat", "FStar.Math.Lemmas.lemma_mod_injective", "Prims.unit", "FStar.Math.Lemmas.lemma_mod_plus" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_little_endian_is_injective_1: b:pos -> q:nat -> r:nat -> q':nat -> r':nat -> Lemma\n (requires (r < b /\\ r' < b /\\ r + b * q = r' + b * q'))\n (ensures (r = r' /\\ q = q'))\nlet lemma_little_endian_is_injective_1 b q r q' r' =", "completed_definiton": "lemma_mod_plus r q b;\nlemma_mod_plus r' q' b;\nlemma_mod_injective b r r'", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.store_uint128", "original_source_type": "val store_uint128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))", "source_type": "val store_uint128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))", "source_definition": "let rec store_uint128 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint128_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt128, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt128.(n1 >>^ 8ul) in\n assert(UInt128.v n = UInt8.v b + 256 * UInt128.v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint128 len buf' n';\n buf.(0ul) <- b", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 540, "start_col": 2, "end_line": 550, "end_col": 18 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b\n(* [SMTPat (big_endian b)] *)\n(* let rec lemma_big_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 0 (Seq.length b - 1) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_big_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.last b) < pow2 8); *)\n(* assert(big_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8); *)\n(* assert(big_endian b <= pow2 8 * (big_endian s + 1)); *)\n(* assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b = FStar.Old.Endianness.lemma_little_endian_lt_2_128 b\n (* lemma_little_endian_is_bounded b; *)\n (* if Seq.length b = 16 then () *)\n (* else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b) *)\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\n(* REMARK: The trigger in lemma_little_endian_lt_2_128 is used to prove absence of\n overflow *)\n(** Loads a machine integer from a buffer of len bytes *)\nval load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nlet rec load_uint32 len buf =\n if len = 0ul then 0ul\n else\n let h = ST.get () in\n let len = len -^ 1ul in\n let m = load_uint32 len (sub buf 1ul len) in\n lemma_little_endian_is_bounded (sel_bytes h len (sub buf 1ul len));\n assert (UInt32.v len <= 3);\n assert (UInt32.v m < pow2 (8 * (UInt32.v len)));\n FStar.Math.Lemmas.pow2_le_compat (8 * 3) (8 * (UInt32.v len));\n FStar.Math.Lemmas.pow2_plus 8 (8 * 3);\n assert (pow2 (8 * (UInt32.v len)) <= pow2 (8 * 3));\n assert (pow2 8 * pow2 (8 * 3) = UInt.max_int 32 + 1);\n assert (UInt32.v m * pow2 8 <= UInt.max_int 32);\n let b = buf.(0ul) in\n assert_norm (pow2 8 == 256);\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ m)\n\nval load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big32 len buf =\n if len = 0ul then 0ul\n else\n let len = len -^ 1ul in\n let n = load_big32 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n' *)\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ n')\n\n(** Used e.g. for converting TLS sequence numbers into AEAD nonces *)\n#reset-options \"--z3rlimit 100\"\nval load_big64: len:UInt32.t { v len <= 8 } -> buf:lbuffer (v len) -> ST UInt64.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt64.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big64 len buf =\n if len = 0ul then 0UL\n else\n let len = len -^ 1ul in\n let n = load_big64 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt64, so was shadowed, so renamed into n' *)\n FStar.UInt64.(uint8_to_uint64 b +^ 256UL *^ n')\n\n\n(* TODO: Add to FStar.Int.Cast and KaRaMeL and OCaml implementations *)\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = uint64_to_uint128 (uint8_to_uint64 a)\n\nval load_uint128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec load_uint128 len buf =\n if len = 0ul then uint64_to_uint128 0UL // Need 128-bit constants?\n else\n let n = load_uint128 (len -^ 1ul) (sub buf 1ul (len -^ 1ul)) in\n let b = buf.(0ul) in\n let h = ST.get () in\n lemma_little_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 1ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n\nval load_big128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big128 len buf =\n if len = 0ul then uint64_to_uint128 0UL\n else\n let n = load_big128 (len -^ 1ul) (sub buf 0ul (len -^ 1ul)) in\n let b = buf.(len -^ 1ul) in\n let h = ST.get () in\n lemma_big_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 0ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n(* stores a machine integer into a buffer of len bytes *)\n// 16-10-02 subsumes Buffer.Utils.bytes_of_uint32 ?\n// check efficient compilation for all back-ends\nval store_uint32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint32 len buf' n';\n buf.(0ul) <- b // updating after the recursive call helps verification\n\nval store_big32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec store_big32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big32 len buf' n';\n buf.(len) <- b // updating after the recursive call helps verification\n\nnoextract val uint32_bytes:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == little_endian b}) (decreases (v len))\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nlet rec uint32_bytes len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = little_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_bytes len n' in\n assert (little_endian b' = UInt32.v n');\n let res = Seq.cons byte b' in\n assert (Seq.equal (Seq.tail res) b'); //NS: added 05/15, cf #1028\n res\n\n#reset-options \"--initial_fuel 1 --max_fuel 1 --initial_ifuel 1 --max_ifuel 1 --z3rlimit 50\"\nnoextract val uint32_be:\n len:UInt32.t {v len <= 4} -> n:UInt32.t {UInt32.v n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) { UInt32.v n == big_endian b}) (decreases (v len))\n\nlet rec uint32_be len n =\n if len = 0ul then\n let e = Seq.empty #UInt8.t in\n assert_norm(0 = big_endian e);\n e\n else\n let len = len -^ 1ul in\n let byte = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v byte + 256 * v n');\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n assert(v n' < pow2 (8 * v len ));\n let b' = uint32_be len n'\n in\n let res = Seq.snoc b' byte in\n let b0, last = Seq.un_snoc res in\n assert (Seq.equal b0 b'); //NS: added 05/15, cf #1028\n res\n\n// turns an integer into a bytestream, little-endian\ninline_for_extraction val little_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == little_endian b})(* (decreases (v len)) *)\ninline_for_extraction let little_bytes len n = FStar.Old.Endianness.little_bytes len n\n(* let rec little_bytes len n = *)\n(* if len = 0ul then *)\n(* Seq.empty *)\n(* else *)\n(* let len = len -^ 1ul in *)\n(* let byte = UInt8.uint_to_t (n % 256) in *)\n(* let n' = n / 256 in *)\n(* Math.Lemmas.pow2_plus 8 (8 * v len); *)\n(* assert(n' < pow2 (8 * v len )); *)\n(* let b' = little_bytes len n' in *)\n(* let b = cons byte b' in *)\n(* assert(Seq.equal b' (tail b)); *)\n(* b *)\n\n#reset-options \"--z3rlimit 400\"\n\n// turns an integer into a bytestream, big-endian\nval big_bytes:\n len:UInt32.t -> n:nat{n < pow2 (8 * v len)} ->\n Tot (b:lbytes (v len) {n == big_endian b}) (decreases (v len))\nlet rec big_bytes len n =\n if len = 0ul then\n Seq.empty\n else\n let len = len -^ 1ul in\n let byte = UInt8.uint_to_t (n % 256) in\n let n' = n / 256 in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert(n' < pow2 (8 * v len ));\n let b' = big_bytes len n' in\n let b'' = Seq.create 1 byte in\n let b = Seq.append b' b'' in\n assert(Seq.equal b' (Seq.slice b 0 (v len)));\n b\n\n// check efficient compilation for all back-ends\nval store_uint128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 400, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n len: FStar.UInt32.t{FStar.UInt32.v len <= 16} ->\n buf: Crypto.Symmetric.Bytes.lbuffer (FStar.UInt32.v len) ->\n n: FStar.UInt128.t{FStar.UInt128.v n < Prims.pow2 (8 * FStar.UInt32.v len)}\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "Crypto.Symmetric.Bytes.lbuffer", "FStar.UInt128.t", "Prims.op_LessThan", "FStar.UInt128.v", "Prims.pow2", "FStar.Mul.op_Star", "Prims.op_disEquality", "FStar.UInt32.__uint_to_t", "FStar.Buffer.op_Array_Assignment", "FStar.UInt8.t", "Prims.unit", "Crypto.Symmetric.Bytes.store_uint128", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.int", "FStar.Math.Lemmas.pow2_plus", "FStar.Buffer.buffer", "Prims.l_and", "FStar.Buffer.includes", "Prims.l_or", "Prims.op_GreaterThanOrEqual", "FStar.UInt.size", "FStar.Buffer.length", "FStar.Buffer.sub", "Prims._assert", "Prims.op_Equality", "Prims.op_Addition", "FStar.UInt8.v", "FStar.UInt128.op_Greater_Greater_Hat", "Prims.op_Multiply", "Prims.op_Modulus", "Crypto.Symmetric.Bytes.uint128_to_uint8", "FStar.UInt32.op_Subtraction_Hat", "Prims.bool" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val store_uint128:\n len:UInt32.t {v len <= 16} -> buf:lbuffer (v len) ->\n n:UInt128.t {UInt128.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint128 len buf n =", "completed_definiton": "if len <> 0ul\nthen\n let len = len -^ 1ul in\n let b = uint128_to_uint8 n in\n let n1 = n in\n let n' = let open FStar.UInt128 in n1 >>^ 8ul in\n assert (UInt128.v n = UInt8.v b + 256 * UInt128.v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint128 len buf' n';\n buf.(0ul) <- b", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.store_bytes_aux", "original_source_type": "val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))", "source_type": "val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))", "source_definition": "let rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 102, "start_col": 2, "end_line": 110, "end_col": 7 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 20, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n len: FStar.UInt32.t ->\n buf: Crypto.Symmetric.Bytes.lbuffer (FStar.UInt32.v len) ->\n i: FStar.UInt32.t{i <=^ len} ->\n b: Crypto.Symmetric.Bytes.lbytes (FStar.UInt32.v len)\n -> FStar.HyperStack.ST.ST Prims.unit", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Crypto.Symmetric.Bytes.lbuffer", "FStar.UInt32.v", "Prims.b2t", "FStar.UInt32.op_Less_Equals_Hat", "Crypto.Symmetric.Bytes.lbytes", "FStar.UInt32.op_Less_Hat", "Crypto.Symmetric.Bytes.store_bytes_aux", "FStar.UInt32.op_Plus_Hat", "FStar.UInt32.__uint_to_t", "Prims.unit", "Prims._assert", "FStar.Seq.Base.equal", "FStar.UInt8.t", "Crypto.Symmetric.Bytes.sel_bytes", "FStar.Buffer.sub", "FStar.Seq.Properties.snoc", "FStar.Seq.Base.index", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "FStar.Buffer.upd", "Prims.bool" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =", "completed_definiton": "if i <^ len\nthen\n (Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b)", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.load_uint128", "original_source_type": "val load_uint128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))", "source_type": "val load_uint128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))", "source_definition": "let rec load_uint128 len buf =\n if len = 0ul then uint64_to_uint128 0UL // Need 128-bit constants?\n else\n let n = load_uint128 (len -^ 1ul) (sub buf 1ul (len -^ 1ul)) in\n let b = buf.(0ul) in\n let h = ST.get () in\n lemma_little_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 1ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 353, "start_col": 2, "end_line": 369, "end_col": 54 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b\n(* [SMTPat (big_endian b)] *)\n(* let rec lemma_big_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 0 (Seq.length b - 1) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_big_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.last b) < pow2 8); *)\n(* assert(big_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8); *)\n(* assert(big_endian b <= pow2 8 * (big_endian s + 1)); *)\n(* assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b = FStar.Old.Endianness.lemma_little_endian_lt_2_128 b\n (* lemma_little_endian_is_bounded b; *)\n (* if Seq.length b = 16 then () *)\n (* else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b) *)\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\n(* REMARK: The trigger in lemma_little_endian_lt_2_128 is used to prove absence of\n overflow *)\n(** Loads a machine integer from a buffer of len bytes *)\nval load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nlet rec load_uint32 len buf =\n if len = 0ul then 0ul\n else\n let h = ST.get () in\n let len = len -^ 1ul in\n let m = load_uint32 len (sub buf 1ul len) in\n lemma_little_endian_is_bounded (sel_bytes h len (sub buf 1ul len));\n assert (UInt32.v len <= 3);\n assert (UInt32.v m < pow2 (8 * (UInt32.v len)));\n FStar.Math.Lemmas.pow2_le_compat (8 * 3) (8 * (UInt32.v len));\n FStar.Math.Lemmas.pow2_plus 8 (8 * 3);\n assert (pow2 (8 * (UInt32.v len)) <= pow2 (8 * 3));\n assert (pow2 8 * pow2 (8 * 3) = UInt.max_int 32 + 1);\n assert (UInt32.v m * pow2 8 <= UInt.max_int 32);\n let b = buf.(0ul) in\n assert_norm (pow2 8 == 256);\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ m)\n\nval load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big32 len buf =\n if len = 0ul then 0ul\n else\n let len = len -^ 1ul in\n let n = load_big32 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n' *)\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ n')\n\n(** Used e.g. for converting TLS sequence numbers into AEAD nonces *)\n#reset-options \"--z3rlimit 100\"\nval load_big64: len:UInt32.t { v len <= 8 } -> buf:lbuffer (v len) -> ST UInt64.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt64.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big64 len buf =\n if len = 0ul then 0UL\n else\n let len = len -^ 1ul in\n let n = load_big64 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt64, so was shadowed, so renamed into n' *)\n FStar.UInt64.(uint8_to_uint64 b +^ 256UL *^ n')\n\n\n(* TODO: Add to FStar.Int.Cast and KaRaMeL and OCaml implementations *)\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = uint64_to_uint128 (uint8_to_uint64 a)\n\nval load_uint128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n len: FStar.UInt32.t{FStar.UInt32.v len <= 16} ->\n buf: Crypto.Symmetric.Bytes.lbuffer (FStar.UInt32.v len)\n -> FStar.HyperStack.ST.ST FStar.UInt128.t", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "Crypto.Symmetric.Bytes.lbuffer", "Prims.op_Equality", "FStar.UInt32.__uint_to_t", "FStar.Int.Cast.Full.uint64_to_uint128", "FStar.UInt64.__uint_to_t", "FStar.UInt128.t", "Prims.bool", "FStar.UInt128.op_Plus_Hat", "Crypto.Symmetric.Bytes.uint8_to_uint128", "FStar.UInt128.op_Less_Less_Hat", "Prims.unit", "Prims._assert", "Prims.eq2", "Prims.int", "FStar.Mul.op_Star", "FStar.UInt128.v", "FStar.Pervasives.assert_norm", "Prims.pow2", "FStar.Math.Lemmas.modulo_lemma", "Prims.op_Subtraction", "FStar.Math.Lemmas.pow2_le_compat", "Crypto.Symmetric.Bytes.lemma_little_endian_is_bounded", "Crypto.Symmetric.Bytes.sel_bytes", "FStar.UInt32.op_Subtraction_Hat", "FStar.Buffer.sub", "FStar.UInt8.t", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "FStar.Buffer.op_Array_Access", "Crypto.Symmetric.Bytes.load_uint128" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val load_uint128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec load_uint128 len buf =", "completed_definiton": "if len = 0ul\nthen uint64_to_uint128 0uL\nelse\n let n = load_uint128 (len -^ 1ul) (sub buf 1ul (len -^ 1ul)) in\n let b = buf.(0ul) in\n let h = ST.get () in\n lemma_little_endian_is_bounded (sel_bytes h (len -^ 1ul) (sub buf 1ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n let open FStar.UInt128 in uint8_to_uint128 b +^ (n' <<^ 8ul)", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.store_uint32", "original_source_type": "val store_uint32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))", "source_type": "val store_uint32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))", "source_definition": "let rec store_uint32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint32 len buf' n';\n buf.(0ul) <- b", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 407, "start_col": 2, "end_line": 417, "end_col": 18 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b\n(* [SMTPat (big_endian b)] *)\n(* let rec lemma_big_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 0 (Seq.length b - 1) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_big_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.last b) < pow2 8); *)\n(* assert(big_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8); *)\n(* assert(big_endian b <= pow2 8 * (big_endian s + 1)); *)\n(* assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b = FStar.Old.Endianness.lemma_little_endian_lt_2_128 b\n (* lemma_little_endian_is_bounded b; *)\n (* if Seq.length b = 16 then () *)\n (* else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b) *)\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\n(* REMARK: The trigger in lemma_little_endian_lt_2_128 is used to prove absence of\n overflow *)\n(** Loads a machine integer from a buffer of len bytes *)\nval load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nlet rec load_uint32 len buf =\n if len = 0ul then 0ul\n else\n let h = ST.get () in\n let len = len -^ 1ul in\n let m = load_uint32 len (sub buf 1ul len) in\n lemma_little_endian_is_bounded (sel_bytes h len (sub buf 1ul len));\n assert (UInt32.v len <= 3);\n assert (UInt32.v m < pow2 (8 * (UInt32.v len)));\n FStar.Math.Lemmas.pow2_le_compat (8 * 3) (8 * (UInt32.v len));\n FStar.Math.Lemmas.pow2_plus 8 (8 * 3);\n assert (pow2 (8 * (UInt32.v len)) <= pow2 (8 * 3));\n assert (pow2 8 * pow2 (8 * 3) = UInt.max_int 32 + 1);\n assert (UInt32.v m * pow2 8 <= UInt.max_int 32);\n let b = buf.(0ul) in\n assert_norm (pow2 8 == 256);\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ m)\n\nval load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big32 len buf =\n if len = 0ul then 0ul\n else\n let len = len -^ 1ul in\n let n = load_big32 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n' *)\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ n')\n\n(** Used e.g. for converting TLS sequence numbers into AEAD nonces *)\n#reset-options \"--z3rlimit 100\"\nval load_big64: len:UInt32.t { v len <= 8 } -> buf:lbuffer (v len) -> ST UInt64.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt64.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big64 len buf =\n if len = 0ul then 0UL\n else\n let len = len -^ 1ul in\n let n = load_big64 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt64, so was shadowed, so renamed into n' *)\n FStar.UInt64.(uint8_to_uint64 b +^ 256UL *^ n')\n\n\n(* TODO: Add to FStar.Int.Cast and KaRaMeL and OCaml implementations *)\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = uint64_to_uint128 (uint8_to_uint64 a)\n\nval load_uint128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec load_uint128 len buf =\n if len = 0ul then uint64_to_uint128 0UL // Need 128-bit constants?\n else\n let n = load_uint128 (len -^ 1ul) (sub buf 1ul (len -^ 1ul)) in\n let b = buf.(0ul) in\n let h = ST.get () in\n lemma_little_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 1ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n\nval load_big128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big128 len buf =\n if len = 0ul then uint64_to_uint128 0UL\n else\n let n = load_big128 (len -^ 1ul) (sub buf 0ul (len -^ 1ul)) in\n let b = buf.(len -^ 1ul) in\n let h = ST.get () in\n lemma_big_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 0ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n(* stores a machine integer into a buffer of len bytes *)\n// 16-10-02 subsumes Buffer.Utils.bytes_of_uint32 ?\n// check efficient compilation for all back-ends\nval store_uint32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n len: FStar.UInt32.t{FStar.UInt32.v len <= 4} ->\n buf: Crypto.Symmetric.Bytes.lbuffer (FStar.UInt32.v len) ->\n n: FStar.UInt32.t{FStar.UInt32.v n < Prims.pow2 (8 * FStar.UInt32.v len)}\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "Crypto.Symmetric.Bytes.lbuffer", "Prims.op_LessThan", "Prims.pow2", "FStar.Mul.op_Star", "Prims.op_disEquality", "FStar.UInt32.__uint_to_t", "FStar.Buffer.op_Array_Assignment", "FStar.UInt8.t", "Prims.unit", "Crypto.Symmetric.Bytes.store_uint32", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.int", "FStar.Math.Lemmas.pow2_plus", "FStar.Buffer.buffer", "Prims.l_and", "FStar.Buffer.includes", "Prims.l_or", "Prims.op_GreaterThanOrEqual", "FStar.UInt.size", "FStar.Buffer.length", "FStar.Buffer.sub", "Prims._assert", "Prims.op_Equality", "Prims.op_Addition", "FStar.UInt8.v", "FStar.UInt32.op_Greater_Greater_Hat", "Prims.op_Multiply", "Prims.op_Modulus", "FStar.Int.Cast.uint32_to_uint8", "FStar.UInt32.op_Subtraction_Hat", "Prims.bool" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val store_uint32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint32 len buf n =", "completed_definiton": "if len <> 0ul\nthen\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in\n let n' = let open FStar.UInt32 in n1 >>^ 8ul in\n assert (v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint32 len buf' n';\n buf.(0ul) <- b", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.store_big32", "original_source_type": "val store_big32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))", "source_type": "val store_big32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))", "source_definition": "let rec store_big32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n shadowed by FStar.UInt32.n *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big32 len buf' n';\n buf.(len) <- b", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 427, "start_col": 2, "end_line": 437, "end_col": 18 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b\n(* [SMTPat (big_endian b)] *)\n(* let rec lemma_big_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 0 (Seq.length b - 1) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_big_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.last b) < pow2 8); *)\n(* assert(big_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8); *)\n(* assert(big_endian b <= pow2 8 * (big_endian s + 1)); *)\n(* assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b = FStar.Old.Endianness.lemma_little_endian_lt_2_128 b\n (* lemma_little_endian_is_bounded b; *)\n (* if Seq.length b = 16 then () *)\n (* else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b) *)\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\n(* REMARK: The trigger in lemma_little_endian_lt_2_128 is used to prove absence of\n overflow *)\n(** Loads a machine integer from a buffer of len bytes *)\nval load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nlet rec load_uint32 len buf =\n if len = 0ul then 0ul\n else\n let h = ST.get () in\n let len = len -^ 1ul in\n let m = load_uint32 len (sub buf 1ul len) in\n lemma_little_endian_is_bounded (sel_bytes h len (sub buf 1ul len));\n assert (UInt32.v len <= 3);\n assert (UInt32.v m < pow2 (8 * (UInt32.v len)));\n FStar.Math.Lemmas.pow2_le_compat (8 * 3) (8 * (UInt32.v len));\n FStar.Math.Lemmas.pow2_plus 8 (8 * 3);\n assert (pow2 (8 * (UInt32.v len)) <= pow2 (8 * 3));\n assert (pow2 8 * pow2 (8 * 3) = UInt.max_int 32 + 1);\n assert (UInt32.v m * pow2 8 <= UInt.max_int 32);\n let b = buf.(0ul) in\n assert_norm (pow2 8 == 256);\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ m)\n\nval load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big32 len buf =\n if len = 0ul then 0ul\n else\n let len = len -^ 1ul in\n let n = load_big32 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n' *)\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ n')\n\n(** Used e.g. for converting TLS sequence numbers into AEAD nonces *)\n#reset-options \"--z3rlimit 100\"\nval load_big64: len:UInt32.t { v len <= 8 } -> buf:lbuffer (v len) -> ST UInt64.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt64.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big64 len buf =\n if len = 0ul then 0UL\n else\n let len = len -^ 1ul in\n let n = load_big64 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt64, so was shadowed, so renamed into n' *)\n FStar.UInt64.(uint8_to_uint64 b +^ 256UL *^ n')\n\n\n(* TODO: Add to FStar.Int.Cast and KaRaMeL and OCaml implementations *)\nval uint8_to_uint128: a:UInt8.t -> Tot (b:UInt128.t{UInt128.v b == UInt8.v a})\nlet uint8_to_uint128 a = uint64_to_uint128 (uint8_to_uint64 a)\n\nval load_uint128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == little_endian (sel_bytes h1 len buf)))\nlet rec load_uint128 len buf =\n if len = 0ul then uint64_to_uint128 0UL // Need 128-bit constants?\n else\n let n = load_uint128 (len -^ 1ul) (sub buf 1ul (len -^ 1ul)) in\n let b = buf.(0ul) in\n let h = ST.get () in\n lemma_little_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 1ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n\nval load_big128: len:UInt32.t { v len <= 16 } -> buf:lbuffer (v len) -> ST UInt128.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt128.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big128 len buf =\n if len = 0ul then uint64_to_uint128 0UL\n else\n let n = load_big128 (len -^ 1ul) (sub buf 0ul (len -^ 1ul)) in\n let b = buf.(len -^ 1ul) in\n let h = ST.get () in\n lemma_big_endian_is_bounded\n (sel_bytes h (len -^ 1ul) (sub buf 0ul (len -^ 1ul)));\n assert (UInt128.v n <= pow2 (8 * v len - 8) - 1);\n assert (256 * UInt128.v n <= 256 * pow2 (8 * v len - 8) - 256);\n assert_norm (256 * pow2 (8 * 16 - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.pow2_le_compat (8 * 16 - 8) (8 * v len - 8);\n assert (256 * pow2 (8 * v len - 8) - 256 <= pow2 128 - 256);\n Math.Lemmas.modulo_lemma (256 * UInt128.v n) (pow2 128);\n assert_norm (pow2 (UInt32.v 8ul) == 256);\n let n' = n in (* n shadowed by FStar.UInt128.n *)\n assert (256 * UInt128.v n' == FStar.UInt128.(v (n' <<^ 8ul)));\n FStar.UInt128.(uint8_to_uint128 b +^ (n' <<^ 8ul))\n\n(* stores a machine integer into a buffer of len bytes *)\n// 16-10-02 subsumes Buffer.Utils.bytes_of_uint32 ?\n// check efficient compilation for all back-ends\nval store_uint32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\nlet rec store_uint32 len buf n =\n if len <> 0ul then\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n1 *)\n let n' = FStar.UInt32.(n1 >>^ 8ul) in\n assert(v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 1ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_uint32 len buf' n';\n buf.(0ul) <- b // updating after the recursive call helps verification\n\nval store_big32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n len: FStar.UInt32.t{FStar.UInt32.v len <= 4} ->\n buf: Crypto.Symmetric.Bytes.lbuffer (FStar.UInt32.v len) ->\n n: FStar.UInt32.t{FStar.UInt32.v n < Prims.pow2 (8 * FStar.UInt32.v len)}\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "Crypto.Symmetric.Bytes.lbuffer", "Prims.op_LessThan", "Prims.pow2", "FStar.Mul.op_Star", "Prims.op_disEquality", "FStar.UInt32.__uint_to_t", "FStar.Buffer.op_Array_Assignment", "FStar.UInt8.t", "Prims.unit", "Crypto.Symmetric.Bytes.store_big32", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.int", "FStar.Math.Lemmas.pow2_plus", "FStar.Buffer.buffer", "Prims.l_and", "FStar.Buffer.includes", "Prims.l_or", "Prims.op_GreaterThanOrEqual", "FStar.UInt.size", "FStar.Buffer.length", "FStar.Buffer.sub", "Prims._assert", "Prims.op_Equality", "Prims.op_Addition", "FStar.UInt8.v", "FStar.UInt32.op_Greater_Greater_Hat", "Prims.op_Multiply", "Prims.op_Modulus", "FStar.Int.Cast.uint32_to_uint8", "FStar.UInt32.op_Subtraction_Hat", "Prims.bool" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val store_big32:\n len:UInt32.t {v len <= 4} -> buf:lbuffer (v len) ->\n n:UInt32.t {UInt32.v n < pow2 (8 * v len)} -> Stack unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 ->\n Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec store_big32 len buf n =", "completed_definiton": "if len <> 0ul\nthen\n let len = len -^ 1ul in\n let b = uint32_to_uint8 n in\n let n1 = n in\n let n' = let open FStar.UInt32 in n1 >>^ 8ul in\n assert (v n = UInt8.v b + 256 * v n');\n let buf' = Buffer.sub buf 0ul len in\n Math.Lemmas.pow2_plus 8 (8 * v len);\n assert_norm (pow2 8 == 256);\n store_big32 len buf' n';\n buf.(len) <- b", "isa_cross_project_example": true }, { "file_name": "Crypto.Symmetric.Bytes.fst", "name": "Crypto.Symmetric.Bytes.load_big64", "original_source_type": "val load_big64: len:UInt32.t { v len <= 8 } -> buf:lbuffer (v len) -> ST UInt64.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt64.v n == big_endian (sel_bytes h1 len buf)))", "source_type": "val load_big64: len:UInt32.t { v len <= 8 } -> buf:lbuffer (v len) -> ST UInt64.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt64.v n == big_endian (sel_bytes h1 len buf)))", "source_definition": "let rec load_big64 len buf =\n if len = 0ul then 0UL\n else\n let len = len -^ 1ul in\n let n = load_big64 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt64, so was shadowed, so renamed into n' *)\n FStar.UInt64.(uint8_to_uint64 b +^ 256UL *^ n')", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Crypto.Symmetric.Bytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 333, "start_col": 2, "end_line": 340, "end_col": 51 }, "file_context": "(*--build-config\noptions:--trace_error --max_fuel 4 --initial_fuel 0 --max_ifuel 2 --initial_ifuel 0 --z3rlimit 20 --use_hints --include ../../code/bignum --include ../../code/experimental/aesgcm --include ../../code/lib/karamel --include ../../code/poly1305 --include ../../code/salsa-family --include ../../secure_api/aead --include ../../secure_api/prf --include ../../secure_api/vale --include ../../secure_api/uf1cma --include ../../secure_api/utils --include ../../specs --include ../../../karamel/krmllib\n--*)\nmodule Crypto.Symmetric.Bytes\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.HyperStack\nopen FStar.UInt32\nopen FStar.Ghost\nopen FStar.Buffer\nopen FStar.Mul\nopen FStar.Int.Cast.Full\n\nmodule U8 = FStar.UInt8\n\nopen Buffer.Utils\n\ntype mem = FStar.HyperStack.mem\n\nlet u8 = UInt8.t\nlet u32 = UInt32.t\nlet u64 = UInt64.t\n\n\n(** TODO: Move. Used only in AEAD.EnxorDexor, much faster to prove here *)\nval eq_snoc_slice: #a:Type -> s_0:Seq.seq a -> s_1:Seq.seq a -> x:a -> Lemma\n (requires (Seq.length s_1 == Seq.length s_0 + 1 /\\\n Seq.index s_1 (Seq.length s_0) == x /\\\n Seq.equal (Seq.slice s_1 0 (Seq.length s_0)) s_0))\n (ensures (Seq.equal s_1 (Seq.snoc s_0 x)))\nlet eq_snoc_slice #a s_0 s_1 x = ()\n\n// TODO: rename and move to FStar.Buffer\n// bytes -> uint8_s; lbytes -> uint8_sl\n// buffer -> uint8_p; lbuffer -> uint8_sl\n\ntype bytes = Seq.seq UInt8.t // Currently, Buffer.Utils redefines this as buffer\ntype buffer = Buffer.buffer UInt8.t\n\ntype lbytes (l:nat) = b:bytes {Seq.length b == l}\ntype lbuffer (l:nat) = b:buffer {Buffer.length b == l}\n\nlet uint128_to_uint8 (a:UInt128.t) : Tot (b:UInt8.t{UInt8.v b == UInt128.v a % pow2 8})\n = uint64_to_uint8 (uint128_to_uint64 a)\n\nprivate let hex1 (x:UInt8.t {FStar.UInt8.(x <^ 16uy)}) =\n FStar.UInt8.(\n if x <^ 10uy then UInt8.to_string x else\n if x = 10uy then \"a\" else\n if x = 11uy then \"b\" else\n if x = 12uy then \"c\" else\n if x = 13uy then \"d\" else\n if x = 14uy then \"e\" else \"f\")\nprivate let hex2 x =\n FStar.UInt8.(hex1 (x /^ 16uy) ^ hex1 (x %^ 16uy))\n\nval print_buffer: s:buffer -> i:UInt32.t{UInt32.v i <= length s} -> len:UInt32.t{UInt32.v len <= length s} -> Stack unit\n (requires (fun h -> live h s))\n (ensures (fun h0 _ h1 -> h0 == h1))\nlet rec print_buffer s i len =\n let open FStar.UInt32 in\n if i <^ len then\n let b = Buffer.index s i in\n let sep = if i %^ 16ul =^ 15ul || i +^ 1ul = len then \"\\n\" else \" \" in\n let _ = IO.debug_print_string (hex2 b ^ sep) in\n let _ = print_buffer s (i +^ 1ul) len in\n ()\n\n// TODO: Deprecate?\nnoextract\nval sel_bytes: h:mem -> l:UInt32.t -> buf:lbuffer (v l) -> GTot (lbytes (v l))\nnoextract\nlet sel_bytes h l buf = Buffer.as_seq h buf\n\n#reset-options \"--z3rlimit 20\"\n\n// Should be polymorphic on the integer size\n// This will be leaky (using implicitly the heap)\n// TODO: We should isolate it in a different module, e.g. Buffer.Alloc\nval load_bytes: l:UInt32.t -> buf:lbuffer (v l) -> Stack (lbytes (v l))\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ Buffer.live h0 buf /\\\n Seq.equal r (sel_bytes h1 l buf)))\nlet rec load_bytes l buf =\n if l = 0ul then\n Seq.empty\n else\n let b = Buffer.index buf 0ul in\n let t = load_bytes (l -^ 1ul) (Buffer.sub buf 1ul (l -^ 1ul)) in\n Seq.cons b t\n\nprivate val store_bytes_aux: len:UInt32.t -> buf:lbuffer (v len)\n -> i:UInt32.t{i <=^ len} -> b:lbytes (v len) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf /\\\n Seq.equal (Seq.slice b 0 (v i)) (sel_bytes h0 i (Buffer.sub buf 0ul i))))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 len buf)))\nlet rec store_bytes_aux len buf i b =\n if i <^ len then\n begin\n Buffer.upd buf i (Seq.index b (v i));\n let h = ST.get () in\n assert (Seq.equal\n (sel_bytes h (i +^ 1ul) (Buffer.sub buf 0ul (i +^ 1ul)))\n (Seq.snoc (sel_bytes h i (Buffer.sub buf 0ul i)) (Seq.index b (v i))));\n store_bytes_aux len buf (i +^ 1ul) b\n end\n\nval store_bytes: l:UInt32.t -> buf:lbuffer (v l) -> b:lbytes (v l) -> ST unit\n (requires (fun h0 -> Buffer.live h0 buf))\n (ensures (fun h0 r h1 -> Buffer.live h1 buf /\\ Buffer.modifies_1 buf h0 h1 /\\\n Seq.equal b (sel_bytes h1 l buf)))\nlet store_bytes l buf b = store_bytes_aux l buf 0ul b\n\n// TODO: Dummy.\n// Should be external and relocated in some library with a crypto-grade\n// implementation in both OCaml and KaRaMeL,\nval random: len:nat -> b:lbuffer len -> Stack unit\n (requires (fun h -> live h b))\n (ensures (fun h0 _ h1 -> live h1 b /\\ modifies_1 b h0 h1))\nlet random len b = ()\n\nval random_bytes: len:u32 -> Stack (lbytes (v len))\n (requires (fun m -> True))\n (ensures (fun m0 _ m1 -> modifies Set.empty m0 m1))\nlet random_bytes len =\n push_frame ();\n let m0 = ST.get () in\n let buf = Buffer.create 0uy len in\n let m1 = ST.get () in\n lemma_reveal_modifies_0 m0 m1;\n random (v len) buf;\n let m2 = ST.get () in\n lemma_reveal_modifies_1 buf m1 m2;\n let b = load_bytes len buf in\n pop_frame ();\n b\n\n\nopen FStar.Seq\n\n(* Little endian integer value of a sequence of bytes *)\ninline_for_extraction let little_endian (b:bytes) = FStar.Old.Endianness.little_endian b\n(* let rec little_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (head b) + pow2 8 * little_endian (tail b) *)\n\n(* Big endian integer value of a sequence of bytes *)\ninline_for_extraction let big_endian (b:bytes) = FStar.Old.Endianness.big_endian b\n(* let rec big_endian (b:bytes) : Tot (n:nat) (decreases (Seq.length b)) = *)\n(* if Seq.length b = 0 then 0 *)\n(* else *)\n(* UInt8.v (last b) + pow2 8 * big_endian (Seq.slice b 0 (Seq.length b - 1)) *)\n\n#reset-options \"--initial_fuel 1 --max_fuel 1\"\n\nval little_endian_null: len:nat{len < 16} -> Lemma\n (little_endian (Seq.create len 0uy) == 0)\nlet little_endian_null len = FStar.Old.Endianness.little_endian_null len\n(* let rec little_endian_null len = *)\n(* if len = 0 then () *)\n(* else *)\n(* begin *)\n(* Seq.lemma_eq_intro (Seq.slice (Seq.create len 0uy) 1 len) *)\n(* (Seq.create (len - 1) 0uy); *)\n(* assert (little_endian (Seq.create len 0uy) == *)\n(* 0 + pow2 8 * little_endian (Seq.slice (Seq.create len 0uy) 1 len)); *)\n(* little_endian_null (len - 1) *)\n(* end *)\n\nval little_endian_singleton: n:UInt8.t -> Lemma\n (little_endian (Seq.create 1 n) == UInt8.v n)\nlet little_endian_singleton n = FStar.Old.Endianness.little_endian_singleton n\n (* assert (little_endian (Seq.create 1 n) == *)\n (* UInt8.v (Seq.index (Seq.create 1 n) 0) + pow2 8 * *)\n (* little_endian (Seq.slice (Seq.create 1 n) 1 1)) *)\n\nval little_endian_append: w1:bytes -> w2:bytes -> Lemma\n (requires True)\n (ensures\n little_endian (Seq.append w1 w2) ==\n little_endian w1 + pow2 (8 * Seq.length w1) * little_endian w2)\nlet little_endian_append w1 w2 = FStar.Old.Endianness.little_endian_append w1 w2\n (* (decreases (Seq.length w1)) *)\n(* let rec little_endian_append w1 w2 = *)\n(* let open FStar.Seq in *)\n(* if length w1 = 0 then *)\n(* begin *)\n(* assert_norm (pow2 (8 * 0) == 1); *)\n(* Seq.lemma_eq_intro (append w1 w2) w2 *)\n(* end *)\n(* else *)\n(* begin *)\n(* let w1' = slice w1 1 (length w1) in *)\n(* assert (length w1' == length w1 - 1); *)\n(* little_endian_append w1' w2; *)\n(* assert (index (append w1 w2) 0 == index w1 0); *)\n(* Seq.lemma_eq_intro *)\n(* (append w1' w2) *)\n(* (Seq.slice (append w1 w2) 1 (length (append w1 w2))); *)\n(* assert (little_endian (append w1 w2) == *)\n(* UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2)); *)\n(* assert (little_endian (append w1' w2) == *)\n(* little_endian w1' + pow2 (8 * length w1') * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * (little_endian w1' + pow2 (8 * length w1') * little_endian w2)); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (length w1 - 1)); *)\n(* assert (pow2 8 * pow2 (8 * length w1') == pow2 (8 * length w1)); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian (append w1' w2) == *)\n(* UInt8.v (index w1 0) + *)\n(* pow2 8 * little_endian w1' + pow2 (8 * length w1) * little_endian w2); *)\n(* assert (UInt8.v (index w1 0) + pow2 8 * little_endian w1' == little_endian w1) *)\n(* end *)\n\nprivate val lemma_factorise: a:nat -> b:nat -> Lemma (a + a * b == a * (b + 1))\nlet lemma_factorise a b = ()\n\nval lemma_little_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 (8 * Seq.length b)))\nlet lemma_little_endian_is_bounded b = FStar.Old.Endianness.lemma_little_endian_is_bounded b\n(* (decreases (Seq.length b)) *)\n(* let rec lemma_little_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 1 (Seq.length b) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_little_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.index b 0) < pow2 8); *)\n(* assert(little_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(little_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.index b 0)) (little_endian s) (pow2 8); *)\n(* assert(little_endian b <= pow2 8 * (little_endian s + 1)); *)\n(* assert(little_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\nval lemma_big_endian_is_bounded: b:bytes -> Lemma\n (requires True)\n (ensures (big_endian b < pow2 (8 * Seq.length b)))\n (decreases (Seq.length b))\nlet lemma_big_endian_is_bounded b = FStar.Old.Endianness.lemma_big_endian_is_bounded b\n(* [SMTPat (big_endian b)] *)\n(* let rec lemma_big_endian_is_bounded b = *)\n(* if Seq.length b = 0 then () *)\n(* else *)\n(* begin *)\n(* let s = Seq.slice b 0 (Seq.length b - 1) in *)\n(* assert(Seq.length s = Seq.length b - 1); *)\n(* lemma_big_endian_is_bounded s; *)\n(* assert(UInt8.v (Seq.last b) < pow2 8); *)\n(* assert(big_endian s < pow2 (8 * Seq.length s)); *)\n(* assert(big_endian b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* lemma_euclidean_division (UInt8.v (Seq.last b)) (big_endian s) (pow2 8); *)\n(* assert(big_endian b <= pow2 8 * (big_endian s + 1)); *)\n(* assert(big_endian b <= pow2 8 * pow2 (8 * (Seq.length b - 1))); *)\n(* Math.Lemmas.pow2_plus 8 (8 * (Seq.length b - 1)); *)\n(* lemma_factorise 8 (Seq.length b - 1) *)\n(* end *)\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nval lemma_little_endian_lt_2_128: b:bytes {Seq.length b <= 16} -> Lemma\n (requires True)\n (ensures (little_endian b < pow2 128))\n [SMTPat (little_endian b)]\nlet lemma_little_endian_lt_2_128 b = FStar.Old.Endianness.lemma_little_endian_lt_2_128 b\n (* lemma_little_endian_is_bounded b; *)\n (* if Seq.length b = 16 then () *)\n (* else Math.Lemmas.pow2_lt_compat 128 (8 * Seq.length b) *)\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\n(* REMARK: The trigger in lemma_little_endian_lt_2_128 is used to prove absence of\n overflow *)\n(** Loads a machine integer from a buffer of len bytes *)\nval load_uint32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == little_endian (sel_bytes h1 len buf)))\n\n#reset-options \"--z3rlimit 100 --max_fuel 1 --initial_fuel 1\"\n\nlet rec load_uint32 len buf =\n if len = 0ul then 0ul\n else\n let h = ST.get () in\n let len = len -^ 1ul in\n let m = load_uint32 len (sub buf 1ul len) in\n lemma_little_endian_is_bounded (sel_bytes h len (sub buf 1ul len));\n assert (UInt32.v len <= 3);\n assert (UInt32.v m < pow2 (8 * (UInt32.v len)));\n FStar.Math.Lemmas.pow2_le_compat (8 * 3) (8 * (UInt32.v len));\n FStar.Math.Lemmas.pow2_plus 8 (8 * 3);\n assert (pow2 (8 * (UInt32.v len)) <= pow2 (8 * 3));\n assert (pow2 8 * pow2 (8 * 3) = UInt.max_int 32 + 1);\n assert (UInt32.v m * pow2 8 <= UInt.max_int 32);\n let b = buf.(0ul) in\n assert_norm (pow2 8 == 256);\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ m)\n\nval load_big32: len:UInt32.t { v len <= 4 } -> buf:lbuffer (v len) -> ST UInt32.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt32.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big32 len buf =\n if len = 0ul then 0ul\n else\n let len = len -^ 1ul in\n let n = load_big32 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in (* n defined in FStar.UInt32, so was shadowed, so renamed into n' *)\n FStar.UInt32.(uint8_to_uint32 b +^ 256ul *^ n')\n\n(** Used e.g. for converting TLS sequence numbers into AEAD nonces *)\n#reset-options \"--z3rlimit 100\"\nval load_big64: len:UInt32.t { v len <= 8 } -> buf:lbuffer (v len) -> ST UInt64.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt64.v n == big_endian (sel_bytes h1 len buf)))", "dependencies": { "source_file": "Crypto.Symmetric.Bytes.fst", "checked_file": "Crypto.Symmetric.Bytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Old.Endianness.fst.checked", "FStar.Mul.fst.checked", "FStar.Math.Lib.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.IO.fst.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "Buffer.Utils.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "Buffer.Utils" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast.Full" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "Crypto.Symmetric" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n len: FStar.UInt32.t{FStar.UInt32.v len <= 8} ->\n buf: Crypto.Symmetric.Bytes.lbuffer (FStar.UInt32.v len)\n -> FStar.HyperStack.ST.ST FStar.UInt64.t", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "Crypto.Symmetric.Bytes.lbuffer", "Prims.op_Equality", "FStar.UInt32.__uint_to_t", "FStar.UInt64.__uint_to_t", "FStar.UInt64.t", "Prims.bool", "FStar.UInt64.op_Plus_Hat", "FStar.Int.Cast.uint8_to_uint64", "FStar.UInt64.op_Star_Hat", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.int", "Prims.pow2", "FStar.UInt8.t", "FStar.Buffer.op_Array_Access", "Crypto.Symmetric.Bytes.load_big64", "FStar.Buffer.sub", "FStar.UInt32.op_Subtraction_Hat" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val load_big64: len:UInt32.t { v len <= 8 } -> buf:lbuffer (v len) -> ST UInt64.t\n (requires (fun h0 -> live h0 buf))\n (ensures (fun h0 n h1 ->\n h0 == h1 /\\ live h0 buf /\\\n UInt64.v n == big_endian (sel_bytes h1 len buf)))\nlet rec load_big64 len buf =", "completed_definiton": "if len = 0ul\nthen 0uL\nelse\n let len = len -^ 1ul in\n let n = load_big64 len (sub buf 0ul len) in\n let b = buf.(len) in\n assert_norm (pow2 8 == 256);\n let n' = n in\n let open FStar.UInt64 in uint8_to_uint64 b +^ 256uL *^ n'", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_custom_data.fst", "name": "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_bytesize", "original_source_type": "val ticketContents13_custom_data_bytesize (x:ticketContents13_custom_data) : GTot nat", "source_type": "val ticketContents13_custom_data_bytesize (x:ticketContents13_custom_data) : GTot nat", "source_definition": "let ticketContents13_custom_data_bytesize (x:ticketContents13_custom_data) : GTot nat = Seq.length (ticketContents13_custom_data_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_custom_data.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 27, "start_col": 88, "end_line": 27, "end_col": 142 }, "file_context": "module Parsers.TicketContents13_custom_data\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_custom_data_parser = LP.parse_bounded_vlbytes 0 65535\n\nnoextract let ticketContents13_custom_data_serializer = LP.serialize_bounded_vlbytes 0 65535", "dependencies": { "source_file": "Parsers.TicketContents13_custom_data.fst", "checked_file": "Parsers.TicketContents13_custom_data.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketContents13_custom_data.ticketContents13_custom_data -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_custom_data_bytesize (x:ticketContents13_custom_data) : GTot nat\nlet ticketContents13_custom_data_bytesize (x: ticketContents13_custom_data) : GTot nat =", "completed_definiton": "Seq.length (ticketContents13_custom_data_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_custom_data.fst", "name": "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser32", "original_source_type": "val ticketContents13_custom_data_parser32: LS.parser32 ticketContents13_custom_data_parser", "source_type": "val ticketContents13_custom_data_parser32: LS.parser32 ticketContents13_custom_data_parser", "source_definition": "let ticketContents13_custom_data_parser32 = LS.parse32_bounded_vlbytes 0 0ul 65535 65535ul", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_custom_data.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 31, "start_col": 44, "end_line": 31, "end_col": 90 }, "file_context": "module Parsers.TicketContents13_custom_data\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_custom_data_parser = LP.parse_bounded_vlbytes 0 65535\n\nnoextract let ticketContents13_custom_data_serializer = LP.serialize_bounded_vlbytes 0 65535\n\nlet ticketContents13_custom_data_bytesize (x:ticketContents13_custom_data) : GTot nat = Seq.length (ticketContents13_custom_data_serializer x)\n\nlet ticketContents13_custom_data_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.TicketContents13_custom_data.fst", "checked_file": "Parsers.TicketContents13_custom_data.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Bytes.parse32_bounded_vlbytes", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_custom_data_parser32: LS.parser32 ticketContents13_custom_data_parser\nlet ticketContents13_custom_data_parser32 =", "completed_definiton": "LS.parse32_bounded_vlbytes 0 0ul 65535 65535ul", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_custom_data.fst", "name": "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_serializer", "original_source_type": "val ticketContents13_custom_data_serializer: LP.serializer ticketContents13_custom_data_parser", "source_type": "val ticketContents13_custom_data_serializer: LP.serializer ticketContents13_custom_data_parser", "source_definition": "let ticketContents13_custom_data_serializer = LP.serialize_bounded_vlbytes 0 65535", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_custom_data.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 25, "start_col": 56, "end_line": 25, "end_col": 92 }, "file_context": "module Parsers.TicketContents13_custom_data\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_custom_data_parser = LP.parse_bounded_vlbytes 0 65535", "dependencies": { "source_file": "Parsers.TicketContents13_custom_data.fst", "checked_file": "Parsers.TicketContents13_custom_data.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser\n", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Bytes.serialize_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_custom_data_serializer: LP.serializer ticketContents13_custom_data_parser\nlet ticketContents13_custom_data_serializer =", "completed_definiton": "LP.serialize_bounded_vlbytes 0 65535", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_custom_data.fst", "name": "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_validator", "original_source_type": "val ticketContents13_custom_data_validator: LL.validator ticketContents13_custom_data_parser", "source_type": "val ticketContents13_custom_data_validator: LL.validator ticketContents13_custom_data_parser", "source_definition": "let ticketContents13_custom_data_validator = LL.validate_bounded_vlbytes 0 65535", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_custom_data.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 37, "start_col": 45, "end_line": 37, "end_col": 80 }, "file_context": "module Parsers.TicketContents13_custom_data\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_custom_data_parser = LP.parse_bounded_vlbytes 0 65535\n\nnoextract let ticketContents13_custom_data_serializer = LP.serialize_bounded_vlbytes 0 65535\n\nlet ticketContents13_custom_data_bytesize (x:ticketContents13_custom_data) : GTot nat = Seq.length (ticketContents13_custom_data_serializer x)\n\nlet ticketContents13_custom_data_bytesize_eq x = ()\n\nlet ticketContents13_custom_data_parser32 = LS.parse32_bounded_vlbytes 0 0ul 65535 65535ul\n\nlet ticketContents13_custom_data_serializer32 = LS.serialize32_bounded_vlbytes 0 65535\n\nlet ticketContents13_custom_data_size32 = LSZ.size32_bounded_vlbytes 0 65535", "dependencies": { "source_file": "Parsers.TicketContents13_custom_data.fst", "checked_file": "Parsers.TicketContents13_custom_data.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Bytes.validate_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_custom_data_validator: LL.validator ticketContents13_custom_data_parser\nlet ticketContents13_custom_data_validator =", "completed_definiton": "LL.validate_bounded_vlbytes 0 65535", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_custom_data.fst", "name": "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_serializer32", "original_source_type": "val ticketContents13_custom_data_serializer32: LS.serializer32 ticketContents13_custom_data_serializer", "source_type": "val ticketContents13_custom_data_serializer32: LS.serializer32 ticketContents13_custom_data_serializer", "source_definition": "let ticketContents13_custom_data_serializer32 = LS.serialize32_bounded_vlbytes 0 65535", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_custom_data.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 33, "start_col": 48, "end_line": 33, "end_col": 86 }, "file_context": "module Parsers.TicketContents13_custom_data\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_custom_data_parser = LP.parse_bounded_vlbytes 0 65535\n\nnoextract let ticketContents13_custom_data_serializer = LP.serialize_bounded_vlbytes 0 65535\n\nlet ticketContents13_custom_data_bytesize (x:ticketContents13_custom_data) : GTot nat = Seq.length (ticketContents13_custom_data_serializer x)\n\nlet ticketContents13_custom_data_bytesize_eq x = ()\n\nlet ticketContents13_custom_data_parser32 = LS.parse32_bounded_vlbytes 0 0ul 65535 65535ul", "dependencies": { "source_file": "Parsers.TicketContents13_custom_data.fst", "checked_file": "Parsers.TicketContents13_custom_data.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.TicketContents13_custom_data.ticketContents13_custom_data_serializer\n", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Bytes.serialize32_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_custom_data_serializer32: LS.serializer32 ticketContents13_custom_data_serializer\nlet ticketContents13_custom_data_serializer32 =", "completed_definiton": "LS.serialize32_bounded_vlbytes 0 65535", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_custom_data.fst", "name": "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_jumper", "original_source_type": "val ticketContents13_custom_data_jumper: LL.jumper ticketContents13_custom_data_parser", "source_type": "val ticketContents13_custom_data_jumper: LL.jumper ticketContents13_custom_data_parser", "source_definition": "let ticketContents13_custom_data_jumper = LL.jump_bounded_vlbytes 0 65535", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_custom_data.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 39, "start_col": 42, "end_line": 39, "end_col": 73 }, "file_context": "module Parsers.TicketContents13_custom_data\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_custom_data_parser = LP.parse_bounded_vlbytes 0 65535\n\nnoextract let ticketContents13_custom_data_serializer = LP.serialize_bounded_vlbytes 0 65535\n\nlet ticketContents13_custom_data_bytesize (x:ticketContents13_custom_data) : GTot nat = Seq.length (ticketContents13_custom_data_serializer x)\n\nlet ticketContents13_custom_data_bytesize_eq x = ()\n\nlet ticketContents13_custom_data_parser32 = LS.parse32_bounded_vlbytes 0 0ul 65535 65535ul\n\nlet ticketContents13_custom_data_serializer32 = LS.serialize32_bounded_vlbytes 0 65535\n\nlet ticketContents13_custom_data_size32 = LSZ.size32_bounded_vlbytes 0 65535\n\nlet ticketContents13_custom_data_validator = LL.validate_bounded_vlbytes 0 65535", "dependencies": { "source_file": "Parsers.TicketContents13_custom_data.fst", "checked_file": "Parsers.TicketContents13_custom_data.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Bytes.jump_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_custom_data_jumper: LL.jumper ticketContents13_custom_data_parser\nlet ticketContents13_custom_data_jumper =", "completed_definiton": "LL.jump_bounded_vlbytes 0 65535", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_custom_data.fst", "name": "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser", "original_source_type": "val ticketContents13_custom_data_parser: LP.parser ticketContents13_custom_data_parser_kind ticketContents13_custom_data", "source_type": "val ticketContents13_custom_data_parser: LP.parser ticketContents13_custom_data_parser_kind ticketContents13_custom_data", "source_definition": "let ticketContents13_custom_data_parser = LP.parse_bounded_vlbytes 0 65535", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_custom_data.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 23, "start_col": 52, "end_line": 23, "end_col": 84 }, "file_context": "module Parsers.TicketContents13_custom_data\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"", "dependencies": { "source_file": "Parsers.TicketContents13_custom_data.fst", "checked_file": "Parsers.TicketContents13_custom_data.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind\n Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Bytes.parse_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_custom_data_parser: LP.parser ticketContents13_custom_data_parser_kind ticketContents13_custom_data\nlet ticketContents13_custom_data_parser =", "completed_definiton": "LP.parse_bounded_vlbytes 0 65535", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_custom_data.fst", "name": "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_size32", "original_source_type": "val ticketContents13_custom_data_size32: LSZ.size32 ticketContents13_custom_data_serializer", "source_type": "val ticketContents13_custom_data_size32: LSZ.size32 ticketContents13_custom_data_serializer", "source_definition": "let ticketContents13_custom_data_size32 = LSZ.size32_bounded_vlbytes 0 65535", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_custom_data.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 35, "start_col": 42, "end_line": 35, "end_col": 76 }, "file_context": "module Parsers.TicketContents13_custom_data\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_custom_data_parser = LP.parse_bounded_vlbytes 0 65535\n\nnoextract let ticketContents13_custom_data_serializer = LP.serialize_bounded_vlbytes 0 65535\n\nlet ticketContents13_custom_data_bytesize (x:ticketContents13_custom_data) : GTot nat = Seq.length (ticketContents13_custom_data_serializer x)\n\nlet ticketContents13_custom_data_bytesize_eq x = ()\n\nlet ticketContents13_custom_data_parser32 = LS.parse32_bounded_vlbytes 0 0ul 65535 65535ul\n\nlet ticketContents13_custom_data_serializer32 = LS.serialize32_bounded_vlbytes 0 65535", "dependencies": { "source_file": "Parsers.TicketContents13_custom_data.fst", "checked_file": "Parsers.TicketContents13_custom_data.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.TicketContents13_custom_data.ticketContents13_custom_data_serializer\n", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Bytes.size32_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_custom_data_size32: LSZ.size32 ticketContents13_custom_data_serializer\nlet ticketContents13_custom_data_size32 =", "completed_definiton": "LSZ.size32_bounded_vlbytes 0 65535", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_custom_data.fst", "name": "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_bytesize_eqn", "original_source_type": "val ticketContents13_custom_data_bytesize_eqn (x: ticketContents13_custom_data) : Lemma (ticketContents13_custom_data_bytesize x == 2 + BY.length x) [SMTPat (ticketContents13_custom_data_bytesize x)]", "source_type": "val ticketContents13_custom_data_bytesize_eqn (x: ticketContents13_custom_data) : Lemma (ticketContents13_custom_data_bytesize x == 2 + BY.length x) [SMTPat (ticketContents13_custom_data_bytesize x)]", "source_definition": "let ticketContents13_custom_data_bytesize_eqn x = LP.length_serialize_bounded_vlbytes 0 65535 x", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_custom_data.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 41, "start_col": 50, "end_line": 41, "end_col": 95 }, "file_context": "module Parsers.TicketContents13_custom_data\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_custom_data_parser = LP.parse_bounded_vlbytes 0 65535\n\nnoextract let ticketContents13_custom_data_serializer = LP.serialize_bounded_vlbytes 0 65535\n\nlet ticketContents13_custom_data_bytesize (x:ticketContents13_custom_data) : GTot nat = Seq.length (ticketContents13_custom_data_serializer x)\n\nlet ticketContents13_custom_data_bytesize_eq x = ()\n\nlet ticketContents13_custom_data_parser32 = LS.parse32_bounded_vlbytes 0 0ul 65535 65535ul\n\nlet ticketContents13_custom_data_serializer32 = LS.serialize32_bounded_vlbytes 0 65535\n\nlet ticketContents13_custom_data_size32 = LSZ.size32_bounded_vlbytes 0 65535\n\nlet ticketContents13_custom_data_validator = LL.validate_bounded_vlbytes 0 65535\n\nlet ticketContents13_custom_data_jumper = LL.jump_bounded_vlbytes 0 65535", "dependencies": { "source_file": "Parsers.TicketContents13_custom_data.fst", "checked_file": "Parsers.TicketContents13_custom_data.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketContents13_custom_data.ticketContents13_custom_data\n -> FStar.Pervasives.Lemma\n (ensures\n Parsers.TicketContents13_custom_data.ticketContents13_custom_data_bytesize x ==\n 2 + FStar.Bytes.length x)\n [SMTPat (Parsers.TicketContents13_custom_data.ticketContents13_custom_data_bytesize x)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "LowParse.Spec.Bytes.length_serialize_bounded_vlbytes", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_custom_data_bytesize_eqn (x: ticketContents13_custom_data) : Lemma (ticketContents13_custom_data_bytesize x == 2 + BY.length x) [SMTPat (ticketContents13_custom_data_bytesize x)]\nlet ticketContents13_custom_data_bytesize_eqn x =", "completed_definiton": "LP.length_serialize_bounded_vlbytes 0 65535 x", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_custom_data.fst", "name": "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_finalize", "original_source_type": "val ticketContents13_custom_data_finalize (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) (len: U32.t) : HST.Stack U32.t\n\n (requires (fun h ->\n LL.live_slice h input /\\\n 0 <= U32.v len /\\ U32.v len <= 65535 /\\\n U32.v pos + 2 + U32.v len <= U32.v input.LL.len /\\\n LL.writable input.LL.base (U32.v pos) (U32.v pos + 2) h\n ))\n (ensures (fun h pos' h' ->\n let pos_payload = pos `U32.add` 2ul in\n B.modifies (LL.loc_slice_from_to input pos pos_payload) h h' /\\\n LL.valid_content_pos ticketContents13_custom_data_parser h' input pos (BY.hide (LL.bytes_of_slice_from_to h input pos_payload (pos_payload `U32.add` len))) pos' /\\\n U32.v pos' == U32.v pos_payload + U32.v len\n ))", "source_type": "val ticketContents13_custom_data_finalize (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) (len: U32.t) : HST.Stack U32.t\n\n (requires (fun h ->\n LL.live_slice h input /\\\n 0 <= U32.v len /\\ U32.v len <= 65535 /\\\n U32.v pos + 2 + U32.v len <= U32.v input.LL.len /\\\n LL.writable input.LL.base (U32.v pos) (U32.v pos + 2) h\n ))\n (ensures (fun h pos' h' ->\n let pos_payload = pos `U32.add` 2ul in\n B.modifies (LL.loc_slice_from_to input pos pos_payload) h h' /\\\n LL.valid_content_pos ticketContents13_custom_data_parser h' input pos (BY.hide (LL.bytes_of_slice_from_to h input pos_payload (pos_payload `U32.add` len))) pos' /\\\n U32.v pos' == U32.v pos_payload + U32.v len\n ))", "source_definition": "let ticketContents13_custom_data_finalize #_ #_ input pos len =\n [@inline_let] let _ = assert_norm (ticketContents13_custom_data == LP.parse_bounded_vlbytes_t 0 65535) in\n LL.finalize_bounded_vlbytes 0 65535 input pos len", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_custom_data.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 48, "start_col": 2, "end_line": 49, "end_col": 51 }, "file_context": "module Parsers.TicketContents13_custom_data\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_custom_data_parser = LP.parse_bounded_vlbytes 0 65535\n\nnoextract let ticketContents13_custom_data_serializer = LP.serialize_bounded_vlbytes 0 65535\n\nlet ticketContents13_custom_data_bytesize (x:ticketContents13_custom_data) : GTot nat = Seq.length (ticketContents13_custom_data_serializer x)\n\nlet ticketContents13_custom_data_bytesize_eq x = ()\n\nlet ticketContents13_custom_data_parser32 = LS.parse32_bounded_vlbytes 0 0ul 65535 65535ul\n\nlet ticketContents13_custom_data_serializer32 = LS.serialize32_bounded_vlbytes 0 65535\n\nlet ticketContents13_custom_data_size32 = LSZ.size32_bounded_vlbytes 0 65535\n\nlet ticketContents13_custom_data_validator = LL.validate_bounded_vlbytes 0 65535\n\nlet ticketContents13_custom_data_jumper = LL.jump_bounded_vlbytes 0 65535\n\nlet ticketContents13_custom_data_bytesize_eqn x = LP.length_serialize_bounded_vlbytes 0 65535 x\n\nlet ticketContents13_custom_data_length #_ #_ input pos =\n [@inline_let] let _ = assert_norm (ticketContents13_custom_data == LP.parse_bounded_vlbytes_t 0 65535) in\n LL.bounded_vlbytes_payload_length 0 65535 input pos", "dependencies": { "source_file": "Parsers.TicketContents13_custom_data.fst", "checked_file": "Parsers.TicketContents13_custom_data.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "input: LowParse.Slice.slice rrel rel -> pos: FStar.UInt32.t -> len: FStar.UInt32.t\n -> FStar.HyperStack.ST.Stack FStar.UInt32.t", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "LowParse.Low.Bytes.finalize_bounded_vlbytes", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_custom_data_finalize (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) (len: U32.t) : HST.Stack U32.t\n\n (requires (fun h ->\n LL.live_slice h input /\\\n 0 <= U32.v len /\\ U32.v len <= 65535 /\\\n U32.v pos + 2 + U32.v len <= U32.v input.LL.len /\\\n LL.writable input.LL.base (U32.v pos) (U32.v pos + 2) h\n ))\n (ensures (fun h pos' h' ->\n let pos_payload = pos `U32.add` 2ul in\n B.modifies (LL.loc_slice_from_to input pos pos_payload) h h' /\\\n LL.valid_content_pos ticketContents13_custom_data_parser h' input pos (BY.hide (LL.bytes_of_slice_from_to h input pos_payload (pos_payload `U32.add` len))) pos' /\\\n U32.v pos' == U32.v pos_payload + U32.v len\n ))\nlet ticketContents13_custom_data_finalize #_ #_ input pos len =", "completed_definiton": "[@@ inline_let ]let _ =\n assert_norm (ticketContents13_custom_data == LP.parse_bounded_vlbytes_t 0 65535)\nin\nLL.finalize_bounded_vlbytes 0 65535 input pos len", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_custom_data.fst", "name": "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_length", "original_source_type": "val ticketContents13_custom_data_length (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid ticketContents13_custom_data_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents ticketContents13_custom_data_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v pos + 2 + U32.v res == U32.v (LL.get_valid_pos ticketContents13_custom_data_parser h input pos) /\\\n res == BY.len x /\\\n LL.bytes_of_slice_from_to h input (pos `U32.add` 2ul) ((pos `U32.add` 2ul) `U32.add` res) == BY.reveal x\n ))", "source_type": "val ticketContents13_custom_data_length (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid ticketContents13_custom_data_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents ticketContents13_custom_data_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v pos + 2 + U32.v res == U32.v (LL.get_valid_pos ticketContents13_custom_data_parser h input pos) /\\\n res == BY.len x /\\\n LL.bytes_of_slice_from_to h input (pos `U32.add` 2ul) ((pos `U32.add` 2ul) `U32.add` res) == BY.reveal x\n ))", "source_definition": "let ticketContents13_custom_data_length #_ #_ input pos =\n [@inline_let] let _ = assert_norm (ticketContents13_custom_data == LP.parse_bounded_vlbytes_t 0 65535) in\n LL.bounded_vlbytes_payload_length 0 65535 input pos", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_custom_data.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 44, "start_col": 2, "end_line": 45, "end_col": 53 }, "file_context": "module Parsers.TicketContents13_custom_data\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_custom_data_parser = LP.parse_bounded_vlbytes 0 65535\n\nnoextract let ticketContents13_custom_data_serializer = LP.serialize_bounded_vlbytes 0 65535\n\nlet ticketContents13_custom_data_bytesize (x:ticketContents13_custom_data) : GTot nat = Seq.length (ticketContents13_custom_data_serializer x)\n\nlet ticketContents13_custom_data_bytesize_eq x = ()\n\nlet ticketContents13_custom_data_parser32 = LS.parse32_bounded_vlbytes 0 0ul 65535 65535ul\n\nlet ticketContents13_custom_data_serializer32 = LS.serialize32_bounded_vlbytes 0 65535\n\nlet ticketContents13_custom_data_size32 = LSZ.size32_bounded_vlbytes 0 65535\n\nlet ticketContents13_custom_data_validator = LL.validate_bounded_vlbytes 0 65535\n\nlet ticketContents13_custom_data_jumper = LL.jump_bounded_vlbytes 0 65535\n\nlet ticketContents13_custom_data_bytesize_eqn x = LP.length_serialize_bounded_vlbytes 0 65535 x", "dependencies": { "source_file": "Parsers.TicketContents13_custom_data.fst", "checked_file": "Parsers.TicketContents13_custom_data.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "input: LowParse.Slice.slice rrel rel -> pos: FStar.UInt32.t\n -> FStar.HyperStack.ST.Stack FStar.UInt32.t", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "LowParse.Low.Bytes.bounded_vlbytes_payload_length", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_custom_data_length (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid ticketContents13_custom_data_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents ticketContents13_custom_data_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v pos + 2 + U32.v res == U32.v (LL.get_valid_pos ticketContents13_custom_data_parser h input pos) /\\\n res == BY.len x /\\\n LL.bytes_of_slice_from_to h input (pos `U32.add` 2ul) ((pos `U32.add` 2ul) `U32.add` res) == BY.reveal x\n ))\nlet ticketContents13_custom_data_length #_ #_ input pos =", "completed_definiton": "[@@ inline_let ]let _ =\n assert_norm (ticketContents13_custom_data == LP.parse_bounded_vlbytes_t 0 65535)\nin\nLL.bounded_vlbytes_payload_length 0 65535 input pos", "isa_cross_project_example": true }, { "file_name": "Format.Constants.fsti", "name": "Format.Constants.is_constantByte", "original_source_type": "val is_constantByte (c x: byte) : Tot bool", "source_type": "val is_constantByte (c x: byte) : Tot bool", "source_definition": "let is_constantByte (c:byte) (x:byte): Tot bool = x = c", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.Constants.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 9, "start_col": 50, "end_line": 9, "end_col": 55 }, "file_context": "module Format.Constants\n\nopen FStar.Bytes\n\nmodule LP = LowParse.SLow.Base\nmodule U8 = FStar.UInt8", "dependencies": { "source_file": "Format.Constants.fsti", "checked_file": "Format.Constants.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowParse.SLow.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "c: FStar.Bytes.byte -> x: FStar.Bytes.byte -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Bytes.byte", "Prims.op_Equality", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val is_constantByte (c x: byte) : Tot bool\nlet is_constantByte (c x: byte) : Tot bool =", "completed_definiton": "x = c", "isa_cross_project_example": true }, { "file_name": "Format.Constants.fsti", "name": "Format.Constants.constantByte_parser_kind", "original_source_type": "", "source_type": "val constantByte_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let constantByte_parser_kind =\n LP.strong_parser_kind 1 1 constantByte_parser_kind_metadata", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.Constants.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 18, "start_col": 2, "end_line": 18, "end_col": 61 }, "file_context": "module Format.Constants\n\nopen FStar.Bytes\n\nmodule LP = LowParse.SLow.Base\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet is_constantByte (c:byte) (x:byte): Tot bool = x = c\n\ntype constantByte (c:byte) = b:byte{is_constantByte c b}\n\ninline_for_extraction\nval constantByte_parser_kind_metadata: LP.parser_kind_metadata_t\n\ninline_for_extraction", "dependencies": { "source_file": "Format.Constants.fsti", "checked_file": "Format.Constants.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowParse.SLow.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "Format.Constants.constantByte_parser_kind_metadata" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let constantByte_parser_kind =", "completed_definiton": "LP.strong_parser_kind 1 1 constantByte_parser_kind_metadata", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.ticketContents12_bytesize", "original_source_type": "val ticketContents12_bytesize (x:ticketContents12) : GTot nat", "source_type": "val ticketContents12_bytesize (x:ticketContents12) : GTot nat", "source_definition": "let ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 68, "start_col": 64, "end_line": 68, "end_col": 106 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketContents12.ticketContents12 -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketContents12.ticketContents12", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.TicketContents12.ticketContents12_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12_bytesize (x:ticketContents12) : GTot nat\nlet ticketContents12_bytesize (x: ticketContents12) : GTot nat =", "completed_definiton": "Seq.length (ticketContents12_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.synth_ticketContents12_recip", "original_source_type": "val synth_ticketContents12_recip (x: ticketContents12) : ticketContents12'", "source_type": "val synth_ticketContents12_recip (x: ticketContents12) : ticketContents12'", "source_definition": "let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 36, "start_col": 99, "end_line": 36, "end_col": 136 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketContents12.ticketContents12 -> Parsers.TicketContents12.ticketContents12'", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketContents12.ticketContents12", "FStar.Pervasives.Native.Mktuple2", "FStar.Pervasives.Native.tuple2", "Parsers.ProtocolVersion.protocolVersion", "Parsers.CipherSuite.cipherSuite", "Parsers.Boolean.boolean", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "Parsers.TicketContents12.__proj__MkticketContents12__item__pv", "Parsers.TicketContents12.__proj__MkticketContents12__item__cs", "Parsers.TicketContents12.__proj__MkticketContents12__item__ems", "Parsers.TicketContents12.__proj__MkticketContents12__item__master_secret", "Parsers.TicketContents12.ticketContents12'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_ticketContents12_recip (x: ticketContents12) : ticketContents12'\nlet synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' =", "completed_definiton": "((x.pv, x.cs), (x.ems, x.master_secret))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.ticketContents12'_validator", "original_source_type": "val ticketContents12'_validator:LL.validator ticketContents12'_parser", "source_type": "val ticketContents12'_validator:LL.validator ticketContents12'_parser", "source_definition": "let ticketContents12'_validator : LL.validator ticketContents12'_parser = ((protocolVersion_validator `LL.validate_nondep_then` cipherSuite_validator) `LL.validate_nondep_then` (boolean_validator `LL.validate_nondep_then` ticketContents12_master_secret_validator))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 95, "start_col": 96, "end_line": 95, "end_col": 286 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()\n\ninline_for_extraction let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))\n\nlet ticketContents12_serializer32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents12 _ ticketContents12'_serializer32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_size32 : LSZ.size32 ticketContents12'_serializer = ((protocolVersion_size32 `LSZ.size32_nondep_then` cipherSuite_size32) `LSZ.size32_nondep_then` (boolean_size32 `LSZ.size32_nondep_then` ticketContents12_master_secret_size32))\n\nlet ticketContents12_size32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents12 _ ticketContents12'_size32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.TicketContents12.ticketContents12'_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.validate_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "FStar.Pervasives.Native.tuple2", "Parsers.ProtocolVersion.protocolVersion", "Parsers.CipherSuite.cipherSuite", "LowParse.Spec.Combinators.nondep_then", "Parsers.ProtocolVersion.protocolVersion_parser", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.ProtocolVersion.protocolVersion_validator", "Parsers.CipherSuite.cipherSuite_validator", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.Boolean.boolean", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "Parsers.Boolean.boolean_parser", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser", "Parsers.Boolean.boolean_validator", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_validator" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12'_validator:LL.validator ticketContents12'_parser\nlet ticketContents12'_validator:LL.validator ticketContents12'_parser =", "completed_definiton": "((protocolVersion_validator `LL.validate_nondep_then` cipherSuite_validator)\n `LL.validate_nondep_then`\n (boolean_validator `LL.validate_nondep_then` ticketContents12_master_secret_validator))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.ticketContents12'_parser32", "original_source_type": "val ticketContents12'_parser32:LS.parser32 ticketContents12'_parser", "source_type": "val ticketContents12'_parser32:LS.parser32 ticketContents12'_parser", "source_definition": "let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 72, "start_col": 94, "end_line": 72, "end_col": 277 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.TicketContents12.ticketContents12'_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "FStar.Pervasives.Native.tuple2", "Parsers.ProtocolVersion.protocolVersion", "Parsers.CipherSuite.cipherSuite", "LowParse.Spec.Combinators.nondep_then", "Parsers.ProtocolVersion.protocolVersion_parser", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.ProtocolVersion.protocolVersion_parser32", "Parsers.CipherSuite.cipherSuite_parser32", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.Boolean.boolean", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "Parsers.Boolean.boolean_parser", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser", "Parsers.Boolean.boolean_parser32", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12'_parser32:LS.parser32 ticketContents12'_parser\nlet ticketContents12'_parser32:LS.parser32 ticketContents12'_parser =", "completed_definiton": "((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32)\n `LS.parse32_nondep_then`\n (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.clens_ticketContents12_ticketContents12'", "original_source_type": "val clens_ticketContents12_ticketContents12':LL.clens ticketContents12 ticketContents12'", "source_type": "val clens_ticketContents12_ticketContents12':LL.clens ticketContents12 ticketContents12'", "source_definition": "let clens_ticketContents12_ticketContents12' : LL.clens ticketContents12 ticketContents12' = synth_ticketContents12_recip_inverse (); synth_ticketContents12_recip_injective (); LL.clens_synth synth_ticketContents12_recip synth_ticketContents12", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 132, "start_col": 103, "end_line": 132, "end_col": 253 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()\n\ninline_for_extraction let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))\n\nlet ticketContents12_serializer32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents12 _ ticketContents12'_serializer32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_size32 : LSZ.size32 ticketContents12'_serializer = ((protocolVersion_size32 `LSZ.size32_nondep_then` cipherSuite_size32) `LSZ.size32_nondep_then` (boolean_size32 `LSZ.size32_nondep_then` ticketContents12_master_secret_size32))\n\nlet ticketContents12_size32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents12 _ ticketContents12'_size32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_validator : LL.validator ticketContents12'_parser = ((protocolVersion_validator `LL.validate_nondep_then` cipherSuite_validator) `LL.validate_nondep_then` (boolean_validator `LL.validate_nondep_then` ticketContents12_master_secret_validator))\n\nlet ticketContents12_validator =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LL.validate_synth ticketContents12'_validator synth_ticketContents12 ()\n\nlet ticketContents12_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip () x;\nLP.length_serialize_nondep_then protocolVersion_serializer cipherSuite_serializer x.pv x.cs;\nLP.length_serialize_nondep_then boolean_serializer ticketContents12_master_secret_serializer x.ems x.master_secret;\nLP.length_serialize_nondep_then (protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer) (x.pv, x.cs) (x.ems, x.master_secret);\n (protocolVersion_bytesize_eq (x.pv));\n (cipherSuite_bytesize_eq (x.cs));\n (boolean_bytesize_eq (x.ems));\n (ticketContents12_master_secret_bytesize_eq (x.master_secret));\n assert(ticketContents12_bytesize x == Seq.length (LP.serialize protocolVersion_serializer x.pv) + Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize boolean_serializer x.ems) + Seq.length (LP.serialize ticketContents12_master_secret_serializer x.master_secret))\n\nlet gaccessor'_ticketContents12_pv : LL.gaccessor ticketContents12'_parser protocolVersion_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_cs : LL.gaccessor ticketContents12'_parser cipherSuite_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_ems : LL.gaccessor ticketContents12'_parser boolean_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_master_secret : LL.gaccessor ticketContents12'_parser ticketContents12_master_secret_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_pv : LL.accessor gaccessor'_ticketContents12_pv = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_cs : LL.accessor gaccessor'_ticketContents12_cs = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)) protocolVersion_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents12_ems : LL.accessor gaccessor'_ticketContents12_ems = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_master_secret : LL.accessor gaccessor'_ticketContents12_master_secret = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)) boolean_jumper)", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.TicketContents12.ticketContents12\n Parsers.TicketContents12.ticketContents12'", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.clens_synth", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.synth_ticketContents12_recip", "Parsers.TicketContents12.synth_ticketContents12", "Prims.unit", "Parsers.TicketContents12.synth_ticketContents12_recip_injective", "Parsers.TicketContents12.synth_ticketContents12_recip_inverse" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val clens_ticketContents12_ticketContents12':LL.clens ticketContents12 ticketContents12'\nlet clens_ticketContents12_ticketContents12':LL.clens ticketContents12 ticketContents12' =", "completed_definiton": "synth_ticketContents12_recip_inverse ();\nsynth_ticketContents12_recip_injective ();\nLL.clens_synth synth_ticketContents12_recip synth_ticketContents12", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.ticketContents12'_parser_kind", "original_source_type": "", "source_type": "val ticketContents12'_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 53, "start_col": 46, "end_line": 53, "end_col": 89 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.get_parser_kind", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.ticketContents12'_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let ticketContents12'_parser_kind =", "completed_definiton": "LP.get_parser_kind ticketContents12'_parser", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.accessor'_ticketContents12_ems", "original_source_type": "val accessor'_ticketContents12_ems:LL.accessor gaccessor'_ticketContents12_ems", "source_type": "val accessor'_ticketContents12_ems:LL.accessor gaccessor'_ticketContents12_ems", "source_definition": "let accessor'_ticketContents12_ems : LL.accessor gaccessor'_ticketContents12_ems = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 128, "start_col": 115, "end_line": 128, "end_col": 268 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()\n\ninline_for_extraction let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))\n\nlet ticketContents12_serializer32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents12 _ ticketContents12'_serializer32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_size32 : LSZ.size32 ticketContents12'_serializer = ((protocolVersion_size32 `LSZ.size32_nondep_then` cipherSuite_size32) `LSZ.size32_nondep_then` (boolean_size32 `LSZ.size32_nondep_then` ticketContents12_master_secret_size32))\n\nlet ticketContents12_size32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents12 _ ticketContents12'_size32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_validator : LL.validator ticketContents12'_parser = ((protocolVersion_validator `LL.validate_nondep_then` cipherSuite_validator) `LL.validate_nondep_then` (boolean_validator `LL.validate_nondep_then` ticketContents12_master_secret_validator))\n\nlet ticketContents12_validator =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LL.validate_synth ticketContents12'_validator synth_ticketContents12 ()\n\nlet ticketContents12_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip () x;\nLP.length_serialize_nondep_then protocolVersion_serializer cipherSuite_serializer x.pv x.cs;\nLP.length_serialize_nondep_then boolean_serializer ticketContents12_master_secret_serializer x.ems x.master_secret;\nLP.length_serialize_nondep_then (protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer) (x.pv, x.cs) (x.ems, x.master_secret);\n (protocolVersion_bytesize_eq (x.pv));\n (cipherSuite_bytesize_eq (x.cs));\n (boolean_bytesize_eq (x.ems));\n (ticketContents12_master_secret_bytesize_eq (x.master_secret));\n assert(ticketContents12_bytesize x == Seq.length (LP.serialize protocolVersion_serializer x.pv) + Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize boolean_serializer x.ems) + Seq.length (LP.serialize ticketContents12_master_secret_serializer x.master_secret))\n\nlet gaccessor'_ticketContents12_pv : LL.gaccessor ticketContents12'_parser protocolVersion_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_cs : LL.gaccessor ticketContents12'_parser cipherSuite_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_ems : LL.gaccessor ticketContents12'_parser boolean_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_master_secret : LL.gaccessor ticketContents12'_parser ticketContents12_master_secret_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_pv : LL.accessor gaccessor'_ticketContents12_pv = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_cs : LL.accessor gaccessor'_ticketContents12_cs = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)) protocolVersion_jumper)", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents12.gaccessor'_ticketContents12_ems", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.accessor_then_fst", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.ticketContents12'_parser", "Parsers.Boolean.boolean", "Parsers.Boolean.boolean_parser", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser", "LowParse.Low.Base.Spec.clens_compose", "FStar.Pervasives.Native.tuple2", "Parsers.ProtocolVersion.protocolVersion", "Parsers.CipherSuite.cipherSuite", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Combinators.gaccessor_then_snd", "LowParse.Spec.Combinators.nondep_then", "Parsers.ProtocolVersion.protocolVersion_parser", "Parsers.CipherSuite.cipherSuite_parser", "LowParse.Low.Base.Spec.gaccessor_id", "LowParse.Low.Combinators.accessor_then_snd", "LowParse.Low.Base.accessor_id", "LowParse.Low.Combinators.jump_nondep_then", "Parsers.ProtocolVersion.protocolVersion_jumper", "Parsers.CipherSuite.cipherSuite_jumper" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor'_ticketContents12_ems:LL.accessor gaccessor'_ticketContents12_ems\nlet accessor'_ticketContents12_ems:LL.accessor gaccessor'_ticketContents12_ems =", "completed_definiton": "(LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser)\n (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.synth_ticketContents12", "original_source_type": "val synth_ticketContents12 (x: ticketContents12') : ticketContents12", "source_type": "val synth_ticketContents12 (x: ticketContents12') : ticketContents12", "source_definition": "let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 29, "start_col": 2, "end_line": 34, "end_col": 3 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketContents12.ticketContents12' -> Parsers.TicketContents12.ticketContents12", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketContents12.ticketContents12'", "Parsers.ProtocolVersion.protocolVersion", "Parsers.CipherSuite.cipherSuite", "Parsers.Boolean.boolean", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "Parsers.TicketContents12.MkticketContents12", "Parsers.TicketContents12.ticketContents12" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_ticketContents12 (x: ticketContents12') : ticketContents12\nlet synth_ticketContents12 (x: ticketContents12') : ticketContents12 =", "completed_definiton": "match x with\n| (pv, cs), (ems, master_secret) -> { pv = pv; cs = cs; ems = ems; master_secret = master_secret }", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.accessor'_ticketContents12_pv", "original_source_type": "val accessor'_ticketContents12_pv:LL.accessor gaccessor'_ticketContents12_pv", "source_type": "val accessor'_ticketContents12_pv:LL.accessor gaccessor'_ticketContents12_pv", "source_definition": "let accessor'_ticketContents12_pv : LL.accessor gaccessor'_ticketContents12_pv = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 124, "start_col": 113, "end_line": 124, "end_col": 200 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()\n\ninline_for_extraction let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))\n\nlet ticketContents12_serializer32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents12 _ ticketContents12'_serializer32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_size32 : LSZ.size32 ticketContents12'_serializer = ((protocolVersion_size32 `LSZ.size32_nondep_then` cipherSuite_size32) `LSZ.size32_nondep_then` (boolean_size32 `LSZ.size32_nondep_then` ticketContents12_master_secret_size32))\n\nlet ticketContents12_size32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents12 _ ticketContents12'_size32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_validator : LL.validator ticketContents12'_parser = ((protocolVersion_validator `LL.validate_nondep_then` cipherSuite_validator) `LL.validate_nondep_then` (boolean_validator `LL.validate_nondep_then` ticketContents12_master_secret_validator))\n\nlet ticketContents12_validator =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LL.validate_synth ticketContents12'_validator synth_ticketContents12 ()\n\nlet ticketContents12_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip () x;\nLP.length_serialize_nondep_then protocolVersion_serializer cipherSuite_serializer x.pv x.cs;\nLP.length_serialize_nondep_then boolean_serializer ticketContents12_master_secret_serializer x.ems x.master_secret;\nLP.length_serialize_nondep_then (protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer) (x.pv, x.cs) (x.ems, x.master_secret);\n (protocolVersion_bytesize_eq (x.pv));\n (cipherSuite_bytesize_eq (x.cs));\n (boolean_bytesize_eq (x.ems));\n (ticketContents12_master_secret_bytesize_eq (x.master_secret));\n assert(ticketContents12_bytesize x == Seq.length (LP.serialize protocolVersion_serializer x.pv) + Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize boolean_serializer x.ems) + Seq.length (LP.serialize ticketContents12_master_secret_serializer x.master_secret))\n\nlet gaccessor'_ticketContents12_pv : LL.gaccessor ticketContents12'_parser protocolVersion_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_cs : LL.gaccessor ticketContents12'_parser cipherSuite_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_ems : LL.gaccessor ticketContents12'_parser boolean_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_master_secret : LL.gaccessor ticketContents12'_parser ticketContents12_master_secret_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents12.gaccessor'_ticketContents12_pv", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.accessor_then_fst", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.ticketContents12'_parser", "Parsers.ProtocolVersion.protocolVersion", "Parsers.ProtocolVersion.protocolVersion_parser", "Parsers.CipherSuite.cipherSuite", "Parsers.CipherSuite.cipherSuite_parser", "LowParse.Low.Base.Spec.clens_compose", "FStar.Pervasives.Native.tuple2", "Parsers.Boolean.boolean", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Combinators.gaccessor_then_fst", "LowParse.Spec.Combinators.nondep_then", "Parsers.Boolean.boolean_parser", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser", "LowParse.Low.Base.Spec.gaccessor_id", "LowParse.Low.Base.accessor_id" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor'_ticketContents12_pv:LL.accessor gaccessor'_ticketContents12_pv\nlet accessor'_ticketContents12_pv:LL.accessor gaccessor'_ticketContents12_pv =", "completed_definiton": "(LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.accessor'_ticketContents12_cs", "original_source_type": "val accessor'_ticketContents12_cs:LL.accessor gaccessor'_ticketContents12_cs", "source_type": "val accessor'_ticketContents12_cs:LL.accessor gaccessor'_ticketContents12_cs", "source_definition": "let accessor'_ticketContents12_cs : LL.accessor gaccessor'_ticketContents12_cs = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)) protocolVersion_jumper)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 126, "start_col": 113, "end_line": 126, "end_col": 223 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()\n\ninline_for_extraction let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))\n\nlet ticketContents12_serializer32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents12 _ ticketContents12'_serializer32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_size32 : LSZ.size32 ticketContents12'_serializer = ((protocolVersion_size32 `LSZ.size32_nondep_then` cipherSuite_size32) `LSZ.size32_nondep_then` (boolean_size32 `LSZ.size32_nondep_then` ticketContents12_master_secret_size32))\n\nlet ticketContents12_size32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents12 _ ticketContents12'_size32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_validator : LL.validator ticketContents12'_parser = ((protocolVersion_validator `LL.validate_nondep_then` cipherSuite_validator) `LL.validate_nondep_then` (boolean_validator `LL.validate_nondep_then` ticketContents12_master_secret_validator))\n\nlet ticketContents12_validator =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LL.validate_synth ticketContents12'_validator synth_ticketContents12 ()\n\nlet ticketContents12_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip () x;\nLP.length_serialize_nondep_then protocolVersion_serializer cipherSuite_serializer x.pv x.cs;\nLP.length_serialize_nondep_then boolean_serializer ticketContents12_master_secret_serializer x.ems x.master_secret;\nLP.length_serialize_nondep_then (protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer) (x.pv, x.cs) (x.ems, x.master_secret);\n (protocolVersion_bytesize_eq (x.pv));\n (cipherSuite_bytesize_eq (x.cs));\n (boolean_bytesize_eq (x.ems));\n (ticketContents12_master_secret_bytesize_eq (x.master_secret));\n assert(ticketContents12_bytesize x == Seq.length (LP.serialize protocolVersion_serializer x.pv) + Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize boolean_serializer x.ems) + Seq.length (LP.serialize ticketContents12_master_secret_serializer x.master_secret))\n\nlet gaccessor'_ticketContents12_pv : LL.gaccessor ticketContents12'_parser protocolVersion_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_cs : LL.gaccessor ticketContents12'_parser cipherSuite_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_ems : LL.gaccessor ticketContents12'_parser boolean_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_master_secret : LL.gaccessor ticketContents12'_parser ticketContents12_master_secret_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_pv : LL.accessor gaccessor'_ticketContents12_pv = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)))", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents12.gaccessor'_ticketContents12_cs", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.accessor_then_snd", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.ticketContents12'_parser", "Parsers.ProtocolVersion.protocolVersion", "Parsers.ProtocolVersion.protocolVersion_parser", "Parsers.CipherSuite.cipherSuite", "Parsers.CipherSuite.cipherSuite_parser", "LowParse.Low.Base.Spec.clens_compose", "FStar.Pervasives.Native.tuple2", "Parsers.Boolean.boolean", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Combinators.gaccessor_then_fst", "LowParse.Spec.Combinators.nondep_then", "Parsers.Boolean.boolean_parser", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser", "LowParse.Low.Base.Spec.gaccessor_id", "LowParse.Low.Combinators.accessor_then_fst", "LowParse.Low.Base.accessor_id", "Parsers.ProtocolVersion.protocolVersion_jumper" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor'_ticketContents12_cs:LL.accessor gaccessor'_ticketContents12_cs\nlet accessor'_ticketContents12_cs:LL.accessor gaccessor'_ticketContents12_cs =", "completed_definiton": "(LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser))\n protocolVersion_jumper)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.accessor'_ticketContents12_master_secret", "original_source_type": "val accessor'_ticketContents12_master_secret:LL.accessor gaccessor'_ticketContents12_master_secret", "source_type": "val accessor'_ticketContents12_master_secret:LL.accessor gaccessor'_ticketContents12_master_secret", "source_definition": "let accessor'_ticketContents12_master_secret : LL.accessor gaccessor'_ticketContents12_master_secret = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)) boolean_jumper)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 130, "start_col": 135, "end_line": 130, "end_col": 303 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()\n\ninline_for_extraction let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))\n\nlet ticketContents12_serializer32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents12 _ ticketContents12'_serializer32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_size32 : LSZ.size32 ticketContents12'_serializer = ((protocolVersion_size32 `LSZ.size32_nondep_then` cipherSuite_size32) `LSZ.size32_nondep_then` (boolean_size32 `LSZ.size32_nondep_then` ticketContents12_master_secret_size32))\n\nlet ticketContents12_size32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents12 _ ticketContents12'_size32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_validator : LL.validator ticketContents12'_parser = ((protocolVersion_validator `LL.validate_nondep_then` cipherSuite_validator) `LL.validate_nondep_then` (boolean_validator `LL.validate_nondep_then` ticketContents12_master_secret_validator))\n\nlet ticketContents12_validator =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LL.validate_synth ticketContents12'_validator synth_ticketContents12 ()\n\nlet ticketContents12_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip () x;\nLP.length_serialize_nondep_then protocolVersion_serializer cipherSuite_serializer x.pv x.cs;\nLP.length_serialize_nondep_then boolean_serializer ticketContents12_master_secret_serializer x.ems x.master_secret;\nLP.length_serialize_nondep_then (protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer) (x.pv, x.cs) (x.ems, x.master_secret);\n (protocolVersion_bytesize_eq (x.pv));\n (cipherSuite_bytesize_eq (x.cs));\n (boolean_bytesize_eq (x.ems));\n (ticketContents12_master_secret_bytesize_eq (x.master_secret));\n assert(ticketContents12_bytesize x == Seq.length (LP.serialize protocolVersion_serializer x.pv) + Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize boolean_serializer x.ems) + Seq.length (LP.serialize ticketContents12_master_secret_serializer x.master_secret))\n\nlet gaccessor'_ticketContents12_pv : LL.gaccessor ticketContents12'_parser protocolVersion_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_cs : LL.gaccessor ticketContents12'_parser cipherSuite_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_ems : LL.gaccessor ticketContents12'_parser boolean_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_master_secret : LL.gaccessor ticketContents12'_parser ticketContents12_master_secret_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_pv : LL.accessor gaccessor'_ticketContents12_pv = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_cs : LL.accessor gaccessor'_ticketContents12_cs = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)) protocolVersion_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents12_ems : LL.accessor gaccessor'_ticketContents12_ems = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)))", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents12.gaccessor'_ticketContents12_master_secret", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.accessor_then_snd", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.ticketContents12'_parser", "Parsers.Boolean.boolean", "Parsers.Boolean.boolean_parser", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser", "LowParse.Low.Base.Spec.clens_compose", "FStar.Pervasives.Native.tuple2", "Parsers.ProtocolVersion.protocolVersion", "Parsers.CipherSuite.cipherSuite", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Combinators.gaccessor_then_snd", "LowParse.Spec.Combinators.nondep_then", "Parsers.ProtocolVersion.protocolVersion_parser", "Parsers.CipherSuite.cipherSuite_parser", "LowParse.Low.Base.Spec.gaccessor_id", "LowParse.Low.Base.accessor_id", "LowParse.Low.Combinators.jump_nondep_then", "Parsers.ProtocolVersion.protocolVersion_jumper", "Parsers.CipherSuite.cipherSuite_jumper", "Parsers.Boolean.boolean_jumper" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor'_ticketContents12_master_secret:LL.accessor gaccessor'_ticketContents12_master_secret\nlet accessor'_ticketContents12_master_secret:LL.accessor gaccessor'_ticketContents12_master_secret =", "completed_definiton": "(LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser)\n (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper))\n boolean_jumper)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.ticketContents12_serializer", "original_source_type": "val ticketContents12_serializer: LP.serializer ticketContents12_parser", "source_type": "val ticketContents12_serializer: LP.serializer ticketContents12_parser", "source_definition": "let ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 63, "start_col": 2, "end_line": 66, "end_col": 106 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.TicketContents12.ticketContents12_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.ticketContents12'_parser", "Parsers.TicketContents12.synth_ticketContents12", "Parsers.TicketContents12.ticketContents12'_serializer", "Parsers.TicketContents12.synth_ticketContents12_recip", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "Parsers.TicketContents12.ticketContents12_parser_kind", "Parsers.TicketContents12.ticketContents12'_parser_kind", "Parsers.TicketContents12.synth_ticketContents12_inverse", "Parsers.TicketContents12.synth_ticketContents12_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12_serializer: LP.serializer ticketContents12_parser\nlet ticketContents12_serializer =", "completed_definiton": "[@@ inline_let ]let _ = synth_ticketContents12_injective () in\n[@@ inline_let ]let _ = synth_ticketContents12_inverse () in\n[@@ inline_let ]let _ =\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind)\nin\nLP.serialize_synth _\n synth_ticketContents12\n ticketContents12'_serializer\n synth_ticketContents12_recip\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.ticketContents12'_size32", "original_source_type": "val ticketContents12'_size32:LSZ.size32 ticketContents12'_serializer", "source_type": "val ticketContents12'_size32:LSZ.size32 ticketContents12'_serializer", "source_definition": "let ticketContents12'_size32 : LSZ.size32 ticketContents12'_serializer = ((protocolVersion_size32 `LSZ.size32_nondep_then` cipherSuite_size32) `LSZ.size32_nondep_then` (boolean_size32 `LSZ.size32_nondep_then` ticketContents12_master_secret_size32))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 87, "start_col": 95, "end_line": 87, "end_col": 270 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()\n\ninline_for_extraction let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))\n\nlet ticketContents12_serializer32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents12 _ ticketContents12'_serializer32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.TicketContents12.ticketContents12'_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.size32_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "FStar.Pervasives.Native.tuple2", "Parsers.ProtocolVersion.protocolVersion", "Parsers.CipherSuite.cipherSuite", "LowParse.Spec.Combinators.nondep_then", "Parsers.ProtocolVersion.protocolVersion_parser", "Parsers.CipherSuite.cipherSuite_parser", "LowParse.Spec.Combinators.serialize_nondep_then", "Parsers.ProtocolVersion.protocolVersion_serializer", "Parsers.CipherSuite.cipherSuite_serializer", "Parsers.ProtocolVersion.protocolVersion_size32", "Parsers.CipherSuite.cipherSuite_size32", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.Boolean.boolean", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "Parsers.Boolean.boolean_parser", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser", "Parsers.Boolean.boolean_serializer", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_serializer", "Parsers.Boolean.boolean_size32", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_size32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12'_size32:LSZ.size32 ticketContents12'_serializer\nlet ticketContents12'_size32:LSZ.size32 ticketContents12'_serializer =", "completed_definiton": "((protocolVersion_size32 `LSZ.size32_nondep_then` cipherSuite_size32)\n `LSZ.size32_nondep_then`\n (boolean_size32 `LSZ.size32_nondep_then` ticketContents12_master_secret_size32))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.synth_ticketContents12_recip_injective", "original_source_type": "val synth_ticketContents12_recip_injective: Prims.unit\n -> Lemma (LP.synth_injective synth_ticketContents12_recip)", "source_type": "val synth_ticketContents12_recip_injective: Prims.unit\n -> Lemma (LP.synth_injective synth_ticketContents12_recip)", "source_definition": "let synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 48, "start_col": 2, "end_line": 49, "end_col": 86 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_injective Parsers.TicketContents12.synth_ticketContents12_recip\n )", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "LowParse.Spec.Combinators.synth_inverse_synth_injective", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.synth_ticketContents12", "Parsers.TicketContents12.synth_ticketContents12_recip", "Parsers.TicketContents12.synth_ticketContents12_recip_inverse", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_injective", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_ticketContents12_recip_injective: Prims.unit\n -> Lemma (LP.synth_injective synth_ticketContents12_recip)\nlet synth_ticketContents12_recip_injective ()\n : Lemma (LP.synth_injective synth_ticketContents12_recip) =", "completed_definiton": "synth_ticketContents12_recip_inverse ();\nLP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.synth_ticketContents12_inverse", "original_source_type": "val synth_ticketContents12_inverse: Prims.unit\n -> Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)", "source_type": "val synth_ticketContents12_inverse: Prims.unit\n -> Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)", "source_definition": "let synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 45, "start_col": 2, "end_line": 45, "end_col": 84 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_inverse Parsers.TicketContents12.synth_ticketContents12\n Parsers.TicketContents12.synth_ticketContents12_recip)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.Combinators.synth_inverse", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.synth_ticketContents12", "Parsers.TicketContents12.synth_ticketContents12_recip", "Prims.l_True", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_ticketContents12_inverse: Prims.unit\n -> Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\nlet synth_ticketContents12_inverse ()\n : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =", "completed_definiton": "assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.ticketContents12_validator", "original_source_type": "val ticketContents12_validator: LL.validator ticketContents12_parser", "source_type": "val ticketContents12_validator: LL.validator ticketContents12_parser", "source_definition": "let ticketContents12_validator =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LL.validate_synth ticketContents12'_validator synth_ticketContents12 ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 98, "start_col": 2, "end_line": 100, "end_col": 73 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()\n\ninline_for_extraction let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))\n\nlet ticketContents12_serializer32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents12 _ ticketContents12'_serializer32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_size32 : LSZ.size32 ticketContents12'_serializer = ((protocolVersion_size32 `LSZ.size32_nondep_then` cipherSuite_size32) `LSZ.size32_nondep_then` (boolean_size32 `LSZ.size32_nondep_then` ticketContents12_master_secret_size32))\n\nlet ticketContents12_size32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents12 _ ticketContents12'_size32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_validator : LL.validator ticketContents12'_parser = ((protocolVersion_validator `LL.validate_nondep_then` cipherSuite_validator) `LL.validate_nondep_then` (boolean_validator `LL.validate_nondep_then` ticketContents12_master_secret_validator))", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.TicketContents12.ticketContents12_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.validate_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.ticketContents12'_parser", "Parsers.TicketContents12.ticketContents12'_validator", "Parsers.TicketContents12.synth_ticketContents12", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "Parsers.TicketContents12.ticketContents12_parser_kind", "Parsers.TicketContents12.ticketContents12'_parser_kind", "Parsers.TicketContents12.synth_ticketContents12_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12_validator: LL.validator ticketContents12_parser\nlet ticketContents12_validator =", "completed_definiton": "[@@ inline_let ]let _ = synth_ticketContents12_injective () in\n[@@ inline_let ]let _ =\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind)\nin\nLL.validate_synth ticketContents12'_validator synth_ticketContents12 ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.ticketContents12_parser32", "original_source_type": "val ticketContents12_parser32: LS.parser32 ticketContents12_parser", "source_type": "val ticketContents12_parser32: LS.parser32 ticketContents12_parser", "source_definition": "let ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 75, "start_col": 2, "end_line": 77, "end_col": 109 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.TicketContents12.ticketContents12_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.ticketContents12'_parser", "Parsers.TicketContents12.synth_ticketContents12", "Prims.eq2", "Parsers.TicketContents12.ticketContents12'_parser32", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.Base.parser_kind", "Parsers.TicketContents12.ticketContents12_parser_kind", "Parsers.TicketContents12.ticketContents12'_parser_kind", "Parsers.TicketContents12.synth_ticketContents12_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12_parser32: LS.parser32 ticketContents12_parser\nlet ticketContents12_parser32 =", "completed_definiton": "[@@ inline_let ]let _ = synth_ticketContents12_injective () in\n[@@ inline_let ]let _ =\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind)\nin\nLS.parse32_synth _\n synth_ticketContents12\n (fun x -> synth_ticketContents12 x)\n ticketContents12'_parser32\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.synth_ticketContents12_injective", "original_source_type": "val synth_ticketContents12_injective: Prims.unit\n -> Lemma (LP.synth_injective synth_ticketContents12)", "source_type": "val synth_ticketContents12_injective: Prims.unit\n -> Lemma (LP.synth_injective synth_ticketContents12)", "source_definition": "let synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 41, "start_col": 2, "end_line": 42, "end_col": 41 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_injective Parsers.TicketContents12.synth_ticketContents12)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "Parsers.TicketContents12.synth_ticketContents12_recip_inverse", "LowParse.Spec.Combinators.synth_inverse_synth_injective", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.synth_ticketContents12_recip", "Parsers.TicketContents12.synth_ticketContents12", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_injective", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_ticketContents12_injective: Prims.unit\n -> Lemma (LP.synth_injective synth_ticketContents12)\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =", "completed_definiton": "LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\nsynth_ticketContents12_recip_inverse ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.gaccessor_ticketContents12_ticketContents12'", "original_source_type": "val gaccessor_ticketContents12_ticketContents12':LL.gaccessor ticketContents12_parser\n ticketContents12'_parser\n clens_ticketContents12_ticketContents12'", "source_type": "val gaccessor_ticketContents12_ticketContents12':LL.gaccessor ticketContents12_parser\n ticketContents12'_parser\n clens_ticketContents12_ticketContents12'", "source_definition": "let gaccessor_ticketContents12_ticketContents12' : LL.gaccessor ticketContents12_parser ticketContents12'_parser clens_ticketContents12_ticketContents12' = synth_ticketContents12_inverse (); synth_ticketContents12_injective (); synth_ticketContents12_recip_inverse (); LL.gaccessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 134, "start_col": 156, "end_line": 134, "end_col": 367 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()\n\ninline_for_extraction let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))\n\nlet ticketContents12_serializer32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents12 _ ticketContents12'_serializer32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_size32 : LSZ.size32 ticketContents12'_serializer = ((protocolVersion_size32 `LSZ.size32_nondep_then` cipherSuite_size32) `LSZ.size32_nondep_then` (boolean_size32 `LSZ.size32_nondep_then` ticketContents12_master_secret_size32))\n\nlet ticketContents12_size32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents12 _ ticketContents12'_size32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_validator : LL.validator ticketContents12'_parser = ((protocolVersion_validator `LL.validate_nondep_then` cipherSuite_validator) `LL.validate_nondep_then` (boolean_validator `LL.validate_nondep_then` ticketContents12_master_secret_validator))\n\nlet ticketContents12_validator =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LL.validate_synth ticketContents12'_validator synth_ticketContents12 ()\n\nlet ticketContents12_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip () x;\nLP.length_serialize_nondep_then protocolVersion_serializer cipherSuite_serializer x.pv x.cs;\nLP.length_serialize_nondep_then boolean_serializer ticketContents12_master_secret_serializer x.ems x.master_secret;\nLP.length_serialize_nondep_then (protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer) (x.pv, x.cs) (x.ems, x.master_secret);\n (protocolVersion_bytesize_eq (x.pv));\n (cipherSuite_bytesize_eq (x.cs));\n (boolean_bytesize_eq (x.ems));\n (ticketContents12_master_secret_bytesize_eq (x.master_secret));\n assert(ticketContents12_bytesize x == Seq.length (LP.serialize protocolVersion_serializer x.pv) + Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize boolean_serializer x.ems) + Seq.length (LP.serialize ticketContents12_master_secret_serializer x.master_secret))\n\nlet gaccessor'_ticketContents12_pv : LL.gaccessor ticketContents12'_parser protocolVersion_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_cs : LL.gaccessor ticketContents12'_parser cipherSuite_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_ems : LL.gaccessor ticketContents12'_parser boolean_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_master_secret : LL.gaccessor ticketContents12'_parser ticketContents12_master_secret_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_pv : LL.accessor gaccessor'_ticketContents12_pv = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_cs : LL.accessor gaccessor'_ticketContents12_cs = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)) protocolVersion_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents12_ems : LL.accessor gaccessor'_ticketContents12_ems = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_master_secret : LL.accessor gaccessor'_ticketContents12_master_secret = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)) boolean_jumper)\n\nnoextract let clens_ticketContents12_ticketContents12' : LL.clens ticketContents12 ticketContents12' = synth_ticketContents12_recip_inverse (); synth_ticketContents12_recip_injective (); LL.clens_synth synth_ticketContents12_recip synth_ticketContents12", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.TicketContents12.ticketContents12_parser\n Parsers.TicketContents12.ticketContents12'_parser\n Parsers.TicketContents12.clens_ticketContents12_ticketContents12'", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.gaccessor_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.ticketContents12'_parser", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.synth_ticketContents12", "Parsers.TicketContents12.synth_ticketContents12_recip", "Prims.unit", "Parsers.TicketContents12.synth_ticketContents12_recip_inverse", "Parsers.TicketContents12.synth_ticketContents12_injective", "Parsers.TicketContents12.synth_ticketContents12_inverse" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val gaccessor_ticketContents12_ticketContents12':LL.gaccessor ticketContents12_parser\n ticketContents12'_parser\n clens_ticketContents12_ticketContents12'\nlet gaccessor_ticketContents12_ticketContents12':LL.gaccessor ticketContents12_parser\n ticketContents12'_parser\n clens_ticketContents12_ticketContents12' =", "completed_definiton": "synth_ticketContents12_inverse ();\nsynth_ticketContents12_injective ();\nsynth_ticketContents12_recip_inverse ();\nLL.gaccessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.ticketContents12'_serializer32", "original_source_type": "val ticketContents12'_serializer32:LS.serializer32 ticketContents12'_serializer", "source_type": "val ticketContents12'_serializer32:LS.serializer32 ticketContents12'_serializer", "source_definition": "let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 79, "start_col": 106, "end_line": 79, "end_col": 317 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.TicketContents12.ticketContents12'_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "FStar.Pervasives.Native.tuple2", "Parsers.ProtocolVersion.protocolVersion", "Parsers.CipherSuite.cipherSuite", "LowParse.Spec.Combinators.nondep_then", "Parsers.ProtocolVersion.protocolVersion_parser", "Parsers.CipherSuite.cipherSuite_parser", "LowParse.Spec.Combinators.serialize_nondep_then", "Parsers.ProtocolVersion.protocolVersion_serializer", "Parsers.CipherSuite.cipherSuite_serializer", "Parsers.ProtocolVersion.protocolVersion_serializer32", "Parsers.CipherSuite.cipherSuite_serializer32", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.Boolean.boolean", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "Parsers.Boolean.boolean_parser", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser", "Parsers.Boolean.boolean_serializer", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_serializer", "Parsers.Boolean.boolean_serializer32", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_serializer32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12'_serializer32:LS.serializer32 ticketContents12'_serializer\nlet ticketContents12'_serializer32:LS.serializer32 ticketContents12'_serializer =", "completed_definiton": "((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32)\n `LS.serialize32_nondep_then`\n (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.ticketContents12_bytesize_eqn", "original_source_type": "val ticketContents12_bytesize_eqn (x: ticketContents12) : Lemma (ticketContents12_bytesize x == (protocolVersion_bytesize (x.pv)) + (cipherSuite_bytesize (x.cs)) + (boolean_bytesize (x.ems)) + (ticketContents12_master_secret_bytesize (x.master_secret))) [SMTPat (ticketContents12_bytesize x)]", "source_type": "val ticketContents12_bytesize_eqn (x: ticketContents12) : Lemma (ticketContents12_bytesize x == (protocolVersion_bytesize (x.pv)) + (cipherSuite_bytesize (x.cs)) + (boolean_bytesize (x.ems)) + (ticketContents12_master_secret_bytesize (x.master_secret))) [SMTPat (ticketContents12_bytesize x)]", "source_definition": "let ticketContents12_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip () x;\nLP.length_serialize_nondep_then protocolVersion_serializer cipherSuite_serializer x.pv x.cs;\nLP.length_serialize_nondep_then boolean_serializer ticketContents12_master_secret_serializer x.ems x.master_secret;\nLP.length_serialize_nondep_then (protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer) (x.pv, x.cs) (x.ems, x.master_secret);\n (protocolVersion_bytesize_eq (x.pv));\n (cipherSuite_bytesize_eq (x.cs));\n (boolean_bytesize_eq (x.ems));\n (ticketContents12_master_secret_bytesize_eq (x.master_secret));\n assert(ticketContents12_bytesize x == Seq.length (LP.serialize protocolVersion_serializer x.pv) + Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize boolean_serializer x.ems) + Seq.length (LP.serialize ticketContents12_master_secret_serializer x.master_secret))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 103, "start_col": 2, "end_line": 114, "end_col": 293 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()\n\ninline_for_extraction let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))\n\nlet ticketContents12_serializer32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents12 _ ticketContents12'_serializer32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_size32 : LSZ.size32 ticketContents12'_serializer = ((protocolVersion_size32 `LSZ.size32_nondep_then` cipherSuite_size32) `LSZ.size32_nondep_then` (boolean_size32 `LSZ.size32_nondep_then` ticketContents12_master_secret_size32))\n\nlet ticketContents12_size32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents12 _ ticketContents12'_size32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_validator : LL.validator ticketContents12'_parser = ((protocolVersion_validator `LL.validate_nondep_then` cipherSuite_validator) `LL.validate_nondep_then` (boolean_validator `LL.validate_nondep_then` ticketContents12_master_secret_validator))\n\nlet ticketContents12_validator =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LL.validate_synth ticketContents12'_validator synth_ticketContents12 ()", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketContents12.ticketContents12\n -> FStar.Pervasives.Lemma\n (ensures\n Parsers.TicketContents12.ticketContents12_bytesize x ==\n Parsers.ProtocolVersion.protocolVersion_bytesize (MkticketContents12?.pv x) +\n Parsers.CipherSuite.cipherSuite_bytesize (MkticketContents12?.cs x) +\n Parsers.Boolean.boolean_bytesize (MkticketContents12?.ems x) +\n Parsers.TicketContents12_master_secret.ticketContents12_master_secret_bytesize (MkticketContents12?.master_secret\n x)) [SMTPat (Parsers.TicketContents12.ticketContents12_bytesize x)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketContents12.ticketContents12", "Prims._assert", "Prims.eq2", "Prims.int", "Parsers.TicketContents12.ticketContents12_bytesize", "Prims.op_Addition", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.ProtocolVersion.protocolVersion", "Parsers.ProtocolVersion.protocolVersion_parser", "Parsers.ProtocolVersion.protocolVersion_serializer", "Parsers.TicketContents12.__proj__MkticketContents12__item__pv", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.CipherSuite.cipherSuite", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.CipherSuite.cipherSuite_serializer", "Parsers.TicketContents12.__proj__MkticketContents12__item__cs", "Parsers.Boolean.boolean_parser_kind", "Parsers.Boolean.boolean", "Parsers.Boolean.boolean_parser", "Parsers.Boolean.boolean_serializer", "Parsers.TicketContents12.__proj__MkticketContents12__item__ems", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_serializer", "Parsers.TicketContents12.__proj__MkticketContents12__item__master_secret", "Prims.unit", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_bytesize_eq", "Parsers.Boolean.boolean_bytesize_eq", "Parsers.CipherSuite.cipherSuite_bytesize_eq", "Parsers.ProtocolVersion.protocolVersion_bytesize_eq", "LowParse.Spec.Combinators.length_serialize_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Combinators.serialize_nondep_then", "FStar.Pervasives.Native.Mktuple2", "LowParse.Spec.Combinators.serialize_synth_eq", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.ticketContents12'_parser", "Parsers.TicketContents12.synth_ticketContents12", "Parsers.TicketContents12.ticketContents12'_serializer", "Parsers.TicketContents12.synth_ticketContents12_recip", "FStar.Pervasives.assert_norm", "LowParse.Spec.Base.parser_kind", "Parsers.TicketContents12.ticketContents12_parser_kind", "Parsers.TicketContents12.ticketContents12'_parser_kind", "Parsers.TicketContents12.synth_ticketContents12_inverse", "Parsers.TicketContents12.synth_ticketContents12_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12_bytesize_eqn (x: ticketContents12) : Lemma (ticketContents12_bytesize x == (protocolVersion_bytesize (x.pv)) + (cipherSuite_bytesize (x.cs)) + (boolean_bytesize (x.ems)) + (ticketContents12_master_secret_bytesize (x.master_secret))) [SMTPat (ticketContents12_bytesize x)]\nlet ticketContents12_bytesize_eqn x =", "completed_definiton": "[@@ inline_let ]let _ = synth_ticketContents12_injective () in\n[@@ inline_let ]let _ = synth_ticketContents12_inverse () in\n[@@ inline_let ]let _ =\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind)\nin\nLP.serialize_synth_eq _\n synth_ticketContents12\n ticketContents12'_serializer\n synth_ticketContents12_recip\n ()\n x;\nLP.length_serialize_nondep_then protocolVersion_serializer cipherSuite_serializer x.pv x.cs;\nLP.length_serialize_nondep_then boolean_serializer\n ticketContents12_master_secret_serializer\n x.ems\n x.master_secret;\nLP.length_serialize_nondep_then (protocolVersion_serializer\n `LP.serialize_nondep_then`\n cipherSuite_serializer)\n (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer)\n (x.pv, x.cs)\n (x.ems, x.master_secret);\n(protocolVersion_bytesize_eq (x.pv));\n(cipherSuite_bytesize_eq (x.cs));\n(boolean_bytesize_eq (x.ems));\n(ticketContents12_master_secret_bytesize_eq (x.master_secret));\nassert (ticketContents12_bytesize x ==\n Seq.length (LP.serialize protocolVersion_serializer x.pv) +\n Seq.length (LP.serialize cipherSuite_serializer x.cs) +\n Seq.length (LP.serialize boolean_serializer x.ems) +\n Seq.length (LP.serialize ticketContents12_master_secret_serializer x.master_secret))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.ticketContents12_parser", "original_source_type": "val ticketContents12_parser: LP.parser ticketContents12_parser_kind ticketContents12", "source_type": "val ticketContents12_parser: LP.parser ticketContents12_parser_kind ticketContents12", "source_definition": "let ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 56, "start_col": 2, "end_line": 58, "end_col": 66 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.TicketContents12.ticketContents12_parser_kind\n Parsers.TicketContents12.ticketContents12", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.ticketContents12'_parser", "Parsers.TicketContents12.synth_ticketContents12", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "Parsers.TicketContents12.ticketContents12_parser_kind", "Parsers.TicketContents12.ticketContents12'_parser_kind", "Parsers.TicketContents12.synth_ticketContents12_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12_parser: LP.parser ticketContents12_parser_kind ticketContents12\nlet ticketContents12_parser =", "completed_definiton": "synth_ticketContents12_injective ();\nassert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\nticketContents12'_parser `LP.parse_synth` synth_ticketContents12", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.ticketContents12'_serializer", "original_source_type": "val ticketContents12'_serializer:LP.serializer ticketContents12'_parser", "source_type": "val ticketContents12'_serializer:LP.serializer ticketContents12'_parser", "source_definition": "let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 60, "start_col": 86, "end_line": 60, "end_col": 283 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.TicketContents12.ticketContents12'_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "FStar.Pervasives.Native.tuple2", "Parsers.ProtocolVersion.protocolVersion", "Parsers.CipherSuite.cipherSuite", "LowParse.Spec.Combinators.nondep_then", "Parsers.ProtocolVersion.protocolVersion_parser", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.ProtocolVersion.protocolVersion_serializer", "Parsers.CipherSuite.cipherSuite_serializer", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.Boolean.boolean", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "Parsers.Boolean.boolean_parser", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser", "Parsers.Boolean.boolean_serializer", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12'_serializer:LP.serializer ticketContents12'_parser\nlet ticketContents12'_serializer:LP.serializer ticketContents12'_parser =", "completed_definiton": "((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer)\n `LP.serialize_nondep_then`\n (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.gaccessor_ticketContents12_master_secret", "original_source_type": "val gaccessor_ticketContents12_master_secret : LL.gaccessor ticketContents12_parser ticketContents12_master_secret_parser clens_ticketContents12_master_secret", "source_type": "val gaccessor_ticketContents12_master_secret : LL.gaccessor ticketContents12_parser ticketContents12_master_secret_parser clens_ticketContents12_master_secret", "source_definition": "let gaccessor_ticketContents12_master_secret = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_master_secret) clens_ticketContents12_master_secret ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 150, "start_col": 47, "end_line": 150, "end_col": 215 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()\n\ninline_for_extraction let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))\n\nlet ticketContents12_serializer32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents12 _ ticketContents12'_serializer32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_size32 : LSZ.size32 ticketContents12'_serializer = ((protocolVersion_size32 `LSZ.size32_nondep_then` cipherSuite_size32) `LSZ.size32_nondep_then` (boolean_size32 `LSZ.size32_nondep_then` ticketContents12_master_secret_size32))\n\nlet ticketContents12_size32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents12 _ ticketContents12'_size32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_validator : LL.validator ticketContents12'_parser = ((protocolVersion_validator `LL.validate_nondep_then` cipherSuite_validator) `LL.validate_nondep_then` (boolean_validator `LL.validate_nondep_then` ticketContents12_master_secret_validator))\n\nlet ticketContents12_validator =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LL.validate_synth ticketContents12'_validator synth_ticketContents12 ()\n\nlet ticketContents12_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip () x;\nLP.length_serialize_nondep_then protocolVersion_serializer cipherSuite_serializer x.pv x.cs;\nLP.length_serialize_nondep_then boolean_serializer ticketContents12_master_secret_serializer x.ems x.master_secret;\nLP.length_serialize_nondep_then (protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer) (x.pv, x.cs) (x.ems, x.master_secret);\n (protocolVersion_bytesize_eq (x.pv));\n (cipherSuite_bytesize_eq (x.cs));\n (boolean_bytesize_eq (x.ems));\n (ticketContents12_master_secret_bytesize_eq (x.master_secret));\n assert(ticketContents12_bytesize x == Seq.length (LP.serialize protocolVersion_serializer x.pv) + Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize boolean_serializer x.ems) + Seq.length (LP.serialize ticketContents12_master_secret_serializer x.master_secret))\n\nlet gaccessor'_ticketContents12_pv : LL.gaccessor ticketContents12'_parser protocolVersion_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_cs : LL.gaccessor ticketContents12'_parser cipherSuite_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_ems : LL.gaccessor ticketContents12'_parser boolean_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_master_secret : LL.gaccessor ticketContents12'_parser ticketContents12_master_secret_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_pv : LL.accessor gaccessor'_ticketContents12_pv = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_cs : LL.accessor gaccessor'_ticketContents12_cs = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)) protocolVersion_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents12_ems : LL.accessor gaccessor'_ticketContents12_ems = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_master_secret : LL.accessor gaccessor'_ticketContents12_master_secret = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)) boolean_jumper)\n\nnoextract let clens_ticketContents12_ticketContents12' : LL.clens ticketContents12 ticketContents12' = synth_ticketContents12_recip_inverse (); synth_ticketContents12_recip_injective (); LL.clens_synth synth_ticketContents12_recip synth_ticketContents12\n\nlet gaccessor_ticketContents12_ticketContents12' : LL.gaccessor ticketContents12_parser ticketContents12'_parser clens_ticketContents12_ticketContents12' = synth_ticketContents12_inverse (); synth_ticketContents12_injective (); synth_ticketContents12_recip_inverse (); LL.gaccessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()\n\ninline_for_extraction noextract let accessor_ticketContents12_ticketContents12' : LL.accessor gaccessor_ticketContents12_ticketContents12' = synth_ticketContents12_inverse (); synth_ticketContents12_injective (); synth_ticketContents12_recip_inverse (); LL.accessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()\n\nlet gaccessor_ticketContents12_pv = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_pv) clens_ticketContents12_pv ()\n\nlet accessor_ticketContents12_pv = LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12' accessor'_ticketContents12_pv ()) clens_ticketContents12_pv ()\n\nlet gaccessor_ticketContents12_cs = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_cs) clens_ticketContents12_cs ()\n\nlet accessor_ticketContents12_cs = LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12' accessor'_ticketContents12_cs ()) clens_ticketContents12_cs ()\n\nlet gaccessor_ticketContents12_ems = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_ems) clens_ticketContents12_ems ()\n\nlet accessor_ticketContents12_ems = LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12' accessor'_ticketContents12_ems ()) clens_ticketContents12_ems ()", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.TicketContents12.ticketContents12_parser\n Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser\n Parsers.TicketContents12.clens_ticketContents12_master_secret", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.gaccessor_ext", "Parsers.TicketContents12.ticketContents12_parser_kind", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.ticketContents12_parser", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.clens_ticketContents12_ticketContents12'", "FStar.Pervasives.Native.tuple2", "Parsers.Boolean.boolean", "Parsers.ProtocolVersion.protocolVersion", "Parsers.CipherSuite.cipherSuite", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12.ticketContents12'_parser", "Parsers.TicketContents12.gaccessor_ticketContents12_ticketContents12'", "Parsers.TicketContents12.gaccessor'_ticketContents12_master_secret", "Parsers.TicketContents12.clens_ticketContents12_master_secret" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val gaccessor_ticketContents12_master_secret : LL.gaccessor ticketContents12_parser ticketContents12_master_secret_parser clens_ticketContents12_master_secret\nlet gaccessor_ticketContents12_master_secret =", "completed_definiton": "LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12'\n `LL.gaccessor_compose`\n gaccessor'_ticketContents12_master_secret)\n clens_ticketContents12_master_secret\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.ticketContents12_size32", "original_source_type": "val ticketContents12_size32: LSZ.size32 ticketContents12_serializer", "source_type": "val ticketContents12_size32: LSZ.size32 ticketContents12_serializer", "source_definition": "let ticketContents12_size32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents12 _ ticketContents12'_size32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 90, "start_col": 2, "end_line": 93, "end_col": 144 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()\n\ninline_for_extraction let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))\n\nlet ticketContents12_serializer32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents12 _ ticketContents12'_serializer32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_size32 : LSZ.size32 ticketContents12'_serializer = ((protocolVersion_size32 `LSZ.size32_nondep_then` cipherSuite_size32) `LSZ.size32_nondep_then` (boolean_size32 `LSZ.size32_nondep_then` ticketContents12_master_secret_size32))", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.TicketContents12.ticketContents12_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.size32_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.ticketContents12'_parser", "Parsers.TicketContents12.synth_ticketContents12", "Parsers.TicketContents12.ticketContents12'_serializer", "Parsers.TicketContents12.ticketContents12'_size32", "Parsers.TicketContents12.synth_ticketContents12_recip", "Prims.eq2", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.Base.parser_kind", "Parsers.TicketContents12.ticketContents12_parser_kind", "Parsers.TicketContents12.ticketContents12'_parser_kind", "Parsers.TicketContents12.synth_ticketContents12_inverse", "Parsers.TicketContents12.synth_ticketContents12_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12_size32: LSZ.size32 ticketContents12_serializer\nlet ticketContents12_size32 =", "completed_definiton": "[@@ inline_let ]let _ = synth_ticketContents12_injective () in\n[@@ inline_let ]let _ = synth_ticketContents12_inverse () in\n[@@ inline_let ]let _ =\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind)\nin\nLSZ.size32_synth _\n synth_ticketContents12\n _\n ticketContents12'_size32\n synth_ticketContents12_recip\n (fun x -> synth_ticketContents12_recip x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.gaccessor_ticketContents12_pv", "original_source_type": "val gaccessor_ticketContents12_pv : LL.gaccessor ticketContents12_parser protocolVersion_parser clens_ticketContents12_pv", "source_type": "val gaccessor_ticketContents12_pv : LL.gaccessor ticketContents12_parser protocolVersion_parser clens_ticketContents12_pv", "source_definition": "let gaccessor_ticketContents12_pv = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_pv) clens_ticketContents12_pv ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 138, "start_col": 36, "end_line": 138, "end_col": 182 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()\n\ninline_for_extraction let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))\n\nlet ticketContents12_serializer32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents12 _ ticketContents12'_serializer32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_size32 : LSZ.size32 ticketContents12'_serializer = ((protocolVersion_size32 `LSZ.size32_nondep_then` cipherSuite_size32) `LSZ.size32_nondep_then` (boolean_size32 `LSZ.size32_nondep_then` ticketContents12_master_secret_size32))\n\nlet ticketContents12_size32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents12 _ ticketContents12'_size32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_validator : LL.validator ticketContents12'_parser = ((protocolVersion_validator `LL.validate_nondep_then` cipherSuite_validator) `LL.validate_nondep_then` (boolean_validator `LL.validate_nondep_then` ticketContents12_master_secret_validator))\n\nlet ticketContents12_validator =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LL.validate_synth ticketContents12'_validator synth_ticketContents12 ()\n\nlet ticketContents12_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip () x;\nLP.length_serialize_nondep_then protocolVersion_serializer cipherSuite_serializer x.pv x.cs;\nLP.length_serialize_nondep_then boolean_serializer ticketContents12_master_secret_serializer x.ems x.master_secret;\nLP.length_serialize_nondep_then (protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer) (x.pv, x.cs) (x.ems, x.master_secret);\n (protocolVersion_bytesize_eq (x.pv));\n (cipherSuite_bytesize_eq (x.cs));\n (boolean_bytesize_eq (x.ems));\n (ticketContents12_master_secret_bytesize_eq (x.master_secret));\n assert(ticketContents12_bytesize x == Seq.length (LP.serialize protocolVersion_serializer x.pv) + Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize boolean_serializer x.ems) + Seq.length (LP.serialize ticketContents12_master_secret_serializer x.master_secret))\n\nlet gaccessor'_ticketContents12_pv : LL.gaccessor ticketContents12'_parser protocolVersion_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_cs : LL.gaccessor ticketContents12'_parser cipherSuite_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_ems : LL.gaccessor ticketContents12'_parser boolean_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_master_secret : LL.gaccessor ticketContents12'_parser ticketContents12_master_secret_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_pv : LL.accessor gaccessor'_ticketContents12_pv = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_cs : LL.accessor gaccessor'_ticketContents12_cs = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)) protocolVersion_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents12_ems : LL.accessor gaccessor'_ticketContents12_ems = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_master_secret : LL.accessor gaccessor'_ticketContents12_master_secret = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)) boolean_jumper)\n\nnoextract let clens_ticketContents12_ticketContents12' : LL.clens ticketContents12 ticketContents12' = synth_ticketContents12_recip_inverse (); synth_ticketContents12_recip_injective (); LL.clens_synth synth_ticketContents12_recip synth_ticketContents12\n\nlet gaccessor_ticketContents12_ticketContents12' : LL.gaccessor ticketContents12_parser ticketContents12'_parser clens_ticketContents12_ticketContents12' = synth_ticketContents12_inverse (); synth_ticketContents12_injective (); synth_ticketContents12_recip_inverse (); LL.gaccessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()\n\ninline_for_extraction noextract let accessor_ticketContents12_ticketContents12' : LL.accessor gaccessor_ticketContents12_ticketContents12' = synth_ticketContents12_inverse (); synth_ticketContents12_injective (); synth_ticketContents12_recip_inverse (); LL.accessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.TicketContents12.ticketContents12_parser\n Parsers.ProtocolVersion.protocolVersion_parser\n Parsers.TicketContents12.clens_ticketContents12_pv", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.gaccessor_ext", "Parsers.TicketContents12.ticketContents12_parser_kind", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.ticketContents12_parser", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.ProtocolVersion.protocolVersion", "Parsers.ProtocolVersion.protocolVersion_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.clens_ticketContents12_ticketContents12'", "FStar.Pervasives.Native.tuple2", "Parsers.CipherSuite.cipherSuite", "Parsers.Boolean.boolean", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12.ticketContents12'_parser", "Parsers.TicketContents12.gaccessor_ticketContents12_ticketContents12'", "Parsers.TicketContents12.gaccessor'_ticketContents12_pv", "Parsers.TicketContents12.clens_ticketContents12_pv" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val gaccessor_ticketContents12_pv : LL.gaccessor ticketContents12_parser protocolVersion_parser clens_ticketContents12_pv\nlet gaccessor_ticketContents12_pv =", "completed_definiton": "LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12'\n `LL.gaccessor_compose`\n gaccessor'_ticketContents12_pv)\n clens_ticketContents12_pv\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.ticketContents12_serializer32", "original_source_type": "val ticketContents12_serializer32: LS.serializer32 ticketContents12_serializer", "source_type": "val ticketContents12_serializer32: LS.serializer32 ticketContents12_serializer", "source_definition": "let ticketContents12_serializer32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents12 _ ticketContents12'_serializer32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 82, "start_col": 2, "end_line": 85, "end_col": 154 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()\n\ninline_for_extraction let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.TicketContents12.ticketContents12_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.ticketContents12'_parser", "Parsers.TicketContents12.synth_ticketContents12", "Parsers.TicketContents12.ticketContents12'_serializer", "Parsers.TicketContents12.ticketContents12'_serializer32", "Parsers.TicketContents12.synth_ticketContents12_recip", "Prims.eq2", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.Base.parser_kind", "Parsers.TicketContents12.ticketContents12_parser_kind", "Parsers.TicketContents12.ticketContents12'_parser_kind", "Parsers.TicketContents12.synth_ticketContents12_inverse", "Parsers.TicketContents12.synth_ticketContents12_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12_serializer32: LS.serializer32 ticketContents12_serializer\nlet ticketContents12_serializer32 =", "completed_definiton": "[@@ inline_let ]let _ = synth_ticketContents12_injective () in\n[@@ inline_let ]let _ = synth_ticketContents12_inverse () in\n[@@ inline_let ]let _ =\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind)\nin\nLS.serialize32_synth _\n synth_ticketContents12\n _\n ticketContents12'_serializer32\n synth_ticketContents12_recip\n (fun x -> synth_ticketContents12_recip x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.accessor_ticketContents12_ems", "original_source_type": "val accessor_ticketContents12_ems : LL.accessor gaccessor_ticketContents12_ems", "source_type": "val accessor_ticketContents12_ems : LL.accessor gaccessor_ticketContents12_ems", "source_definition": "let accessor_ticketContents12_ems = LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12' accessor'_ticketContents12_ems ()) clens_ticketContents12_ems ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 148, "start_col": 36, "end_line": 148, "end_col": 181 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()\n\ninline_for_extraction let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))\n\nlet ticketContents12_serializer32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents12 _ ticketContents12'_serializer32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_size32 : LSZ.size32 ticketContents12'_serializer = ((protocolVersion_size32 `LSZ.size32_nondep_then` cipherSuite_size32) `LSZ.size32_nondep_then` (boolean_size32 `LSZ.size32_nondep_then` ticketContents12_master_secret_size32))\n\nlet ticketContents12_size32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents12 _ ticketContents12'_size32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_validator : LL.validator ticketContents12'_parser = ((protocolVersion_validator `LL.validate_nondep_then` cipherSuite_validator) `LL.validate_nondep_then` (boolean_validator `LL.validate_nondep_then` ticketContents12_master_secret_validator))\n\nlet ticketContents12_validator =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LL.validate_synth ticketContents12'_validator synth_ticketContents12 ()\n\nlet ticketContents12_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip () x;\nLP.length_serialize_nondep_then protocolVersion_serializer cipherSuite_serializer x.pv x.cs;\nLP.length_serialize_nondep_then boolean_serializer ticketContents12_master_secret_serializer x.ems x.master_secret;\nLP.length_serialize_nondep_then (protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer) (x.pv, x.cs) (x.ems, x.master_secret);\n (protocolVersion_bytesize_eq (x.pv));\n (cipherSuite_bytesize_eq (x.cs));\n (boolean_bytesize_eq (x.ems));\n (ticketContents12_master_secret_bytesize_eq (x.master_secret));\n assert(ticketContents12_bytesize x == Seq.length (LP.serialize protocolVersion_serializer x.pv) + Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize boolean_serializer x.ems) + Seq.length (LP.serialize ticketContents12_master_secret_serializer x.master_secret))\n\nlet gaccessor'_ticketContents12_pv : LL.gaccessor ticketContents12'_parser protocolVersion_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_cs : LL.gaccessor ticketContents12'_parser cipherSuite_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_ems : LL.gaccessor ticketContents12'_parser boolean_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_master_secret : LL.gaccessor ticketContents12'_parser ticketContents12_master_secret_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_pv : LL.accessor gaccessor'_ticketContents12_pv = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_cs : LL.accessor gaccessor'_ticketContents12_cs = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)) protocolVersion_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents12_ems : LL.accessor gaccessor'_ticketContents12_ems = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_master_secret : LL.accessor gaccessor'_ticketContents12_master_secret = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)) boolean_jumper)\n\nnoextract let clens_ticketContents12_ticketContents12' : LL.clens ticketContents12 ticketContents12' = synth_ticketContents12_recip_inverse (); synth_ticketContents12_recip_injective (); LL.clens_synth synth_ticketContents12_recip synth_ticketContents12\n\nlet gaccessor_ticketContents12_ticketContents12' : LL.gaccessor ticketContents12_parser ticketContents12'_parser clens_ticketContents12_ticketContents12' = synth_ticketContents12_inverse (); synth_ticketContents12_injective (); synth_ticketContents12_recip_inverse (); LL.gaccessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()\n\ninline_for_extraction noextract let accessor_ticketContents12_ticketContents12' : LL.accessor gaccessor_ticketContents12_ticketContents12' = synth_ticketContents12_inverse (); synth_ticketContents12_injective (); synth_ticketContents12_recip_inverse (); LL.accessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()\n\nlet gaccessor_ticketContents12_pv = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_pv) clens_ticketContents12_pv ()\n\nlet accessor_ticketContents12_pv = LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12' accessor'_ticketContents12_pv ()) clens_ticketContents12_pv ()\n\nlet gaccessor_ticketContents12_cs = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_cs) clens_ticketContents12_cs ()\n\nlet accessor_ticketContents12_cs = LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12' accessor'_ticketContents12_cs ()) clens_ticketContents12_cs ()\n\nlet gaccessor_ticketContents12_ems = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_ems) clens_ticketContents12_ems ()", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents12.gaccessor_ticketContents12_ems", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.accessor_ext", "Parsers.TicketContents12.ticketContents12_parser_kind", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.ticketContents12_parser", "Parsers.Boolean.boolean_parser_kind", "Parsers.Boolean.boolean", "Parsers.Boolean.boolean_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.clens_ticketContents12_ticketContents12'", "FStar.Pervasives.Native.tuple2", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "Parsers.ProtocolVersion.protocolVersion", "Parsers.CipherSuite.cipherSuite", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12.ticketContents12'_parser", "Parsers.TicketContents12.gaccessor_ticketContents12_ticketContents12'", "Parsers.TicketContents12.gaccessor'_ticketContents12_ems", "LowParse.Low.Base.accessor_compose", "Parsers.TicketContents12.accessor_ticketContents12_ticketContents12'", "Parsers.TicketContents12.accessor'_ticketContents12_ems", "Parsers.TicketContents12.clens_ticketContents12_ems" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor_ticketContents12_ems : LL.accessor gaccessor_ticketContents12_ems\nlet accessor_ticketContents12_ems =", "completed_definiton": "LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12'\n accessor'_ticketContents12_ems\n ())\n clens_ticketContents12_ems\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.accessor_ticketContents12_cs", "original_source_type": "val accessor_ticketContents12_cs : LL.accessor gaccessor_ticketContents12_cs", "source_type": "val accessor_ticketContents12_cs : LL.accessor gaccessor_ticketContents12_cs", "source_definition": "let accessor_ticketContents12_cs = LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12' accessor'_ticketContents12_cs ()) clens_ticketContents12_cs ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 144, "start_col": 35, "end_line": 144, "end_col": 178 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()\n\ninline_for_extraction let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))\n\nlet ticketContents12_serializer32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents12 _ ticketContents12'_serializer32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_size32 : LSZ.size32 ticketContents12'_serializer = ((protocolVersion_size32 `LSZ.size32_nondep_then` cipherSuite_size32) `LSZ.size32_nondep_then` (boolean_size32 `LSZ.size32_nondep_then` ticketContents12_master_secret_size32))\n\nlet ticketContents12_size32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents12 _ ticketContents12'_size32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_validator : LL.validator ticketContents12'_parser = ((protocolVersion_validator `LL.validate_nondep_then` cipherSuite_validator) `LL.validate_nondep_then` (boolean_validator `LL.validate_nondep_then` ticketContents12_master_secret_validator))\n\nlet ticketContents12_validator =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LL.validate_synth ticketContents12'_validator synth_ticketContents12 ()\n\nlet ticketContents12_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip () x;\nLP.length_serialize_nondep_then protocolVersion_serializer cipherSuite_serializer x.pv x.cs;\nLP.length_serialize_nondep_then boolean_serializer ticketContents12_master_secret_serializer x.ems x.master_secret;\nLP.length_serialize_nondep_then (protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer) (x.pv, x.cs) (x.ems, x.master_secret);\n (protocolVersion_bytesize_eq (x.pv));\n (cipherSuite_bytesize_eq (x.cs));\n (boolean_bytesize_eq (x.ems));\n (ticketContents12_master_secret_bytesize_eq (x.master_secret));\n assert(ticketContents12_bytesize x == Seq.length (LP.serialize protocolVersion_serializer x.pv) + Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize boolean_serializer x.ems) + Seq.length (LP.serialize ticketContents12_master_secret_serializer x.master_secret))\n\nlet gaccessor'_ticketContents12_pv : LL.gaccessor ticketContents12'_parser protocolVersion_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_cs : LL.gaccessor ticketContents12'_parser cipherSuite_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_ems : LL.gaccessor ticketContents12'_parser boolean_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_master_secret : LL.gaccessor ticketContents12'_parser ticketContents12_master_secret_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_pv : LL.accessor gaccessor'_ticketContents12_pv = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_cs : LL.accessor gaccessor'_ticketContents12_cs = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)) protocolVersion_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents12_ems : LL.accessor gaccessor'_ticketContents12_ems = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_master_secret : LL.accessor gaccessor'_ticketContents12_master_secret = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)) boolean_jumper)\n\nnoextract let clens_ticketContents12_ticketContents12' : LL.clens ticketContents12 ticketContents12' = synth_ticketContents12_recip_inverse (); synth_ticketContents12_recip_injective (); LL.clens_synth synth_ticketContents12_recip synth_ticketContents12\n\nlet gaccessor_ticketContents12_ticketContents12' : LL.gaccessor ticketContents12_parser ticketContents12'_parser clens_ticketContents12_ticketContents12' = synth_ticketContents12_inverse (); synth_ticketContents12_injective (); synth_ticketContents12_recip_inverse (); LL.gaccessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()\n\ninline_for_extraction noextract let accessor_ticketContents12_ticketContents12' : LL.accessor gaccessor_ticketContents12_ticketContents12' = synth_ticketContents12_inverse (); synth_ticketContents12_injective (); synth_ticketContents12_recip_inverse (); LL.accessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()\n\nlet gaccessor_ticketContents12_pv = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_pv) clens_ticketContents12_pv ()\n\nlet accessor_ticketContents12_pv = LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12' accessor'_ticketContents12_pv ()) clens_ticketContents12_pv ()\n\nlet gaccessor_ticketContents12_cs = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_cs) clens_ticketContents12_cs ()", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents12.gaccessor_ticketContents12_cs", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.accessor_ext", "Parsers.TicketContents12.ticketContents12_parser_kind", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.ticketContents12_parser", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.CipherSuite.cipherSuite", "Parsers.CipherSuite.cipherSuite_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.clens_ticketContents12_ticketContents12'", "FStar.Pervasives.Native.tuple2", "Parsers.ProtocolVersion.protocolVersion", "Parsers.Boolean.boolean", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12.ticketContents12'_parser", "Parsers.TicketContents12.gaccessor_ticketContents12_ticketContents12'", "Parsers.TicketContents12.gaccessor'_ticketContents12_cs", "LowParse.Low.Base.accessor_compose", "Parsers.TicketContents12.accessor_ticketContents12_ticketContents12'", "Parsers.TicketContents12.accessor'_ticketContents12_cs", "Parsers.TicketContents12.clens_ticketContents12_cs" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor_ticketContents12_cs : LL.accessor gaccessor_ticketContents12_cs\nlet accessor_ticketContents12_cs =", "completed_definiton": "LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12'\n accessor'_ticketContents12_cs\n ())\n clens_ticketContents12_cs\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.accessor_ticketContents12_ticketContents12'", "original_source_type": "val accessor_ticketContents12_ticketContents12':LL.accessor gaccessor_ticketContents12_ticketContents12'", "source_type": "val accessor_ticketContents12_ticketContents12':LL.accessor gaccessor_ticketContents12_ticketContents12'", "source_definition": "let accessor_ticketContents12_ticketContents12' : LL.accessor gaccessor_ticketContents12_ticketContents12' = synth_ticketContents12_inverse (); synth_ticketContents12_injective (); synth_ticketContents12_recip_inverse (); LL.accessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 136, "start_col": 141, "end_line": 136, "end_col": 351 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()\n\ninline_for_extraction let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))\n\nlet ticketContents12_serializer32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents12 _ ticketContents12'_serializer32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_size32 : LSZ.size32 ticketContents12'_serializer = ((protocolVersion_size32 `LSZ.size32_nondep_then` cipherSuite_size32) `LSZ.size32_nondep_then` (boolean_size32 `LSZ.size32_nondep_then` ticketContents12_master_secret_size32))\n\nlet ticketContents12_size32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents12 _ ticketContents12'_size32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_validator : LL.validator ticketContents12'_parser = ((protocolVersion_validator `LL.validate_nondep_then` cipherSuite_validator) `LL.validate_nondep_then` (boolean_validator `LL.validate_nondep_then` ticketContents12_master_secret_validator))\n\nlet ticketContents12_validator =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LL.validate_synth ticketContents12'_validator synth_ticketContents12 ()\n\nlet ticketContents12_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip () x;\nLP.length_serialize_nondep_then protocolVersion_serializer cipherSuite_serializer x.pv x.cs;\nLP.length_serialize_nondep_then boolean_serializer ticketContents12_master_secret_serializer x.ems x.master_secret;\nLP.length_serialize_nondep_then (protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer) (x.pv, x.cs) (x.ems, x.master_secret);\n (protocolVersion_bytesize_eq (x.pv));\n (cipherSuite_bytesize_eq (x.cs));\n (boolean_bytesize_eq (x.ems));\n (ticketContents12_master_secret_bytesize_eq (x.master_secret));\n assert(ticketContents12_bytesize x == Seq.length (LP.serialize protocolVersion_serializer x.pv) + Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize boolean_serializer x.ems) + Seq.length (LP.serialize ticketContents12_master_secret_serializer x.master_secret))\n\nlet gaccessor'_ticketContents12_pv : LL.gaccessor ticketContents12'_parser protocolVersion_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_cs : LL.gaccessor ticketContents12'_parser cipherSuite_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_ems : LL.gaccessor ticketContents12'_parser boolean_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_master_secret : LL.gaccessor ticketContents12'_parser ticketContents12_master_secret_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_pv : LL.accessor gaccessor'_ticketContents12_pv = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_cs : LL.accessor gaccessor'_ticketContents12_cs = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)) protocolVersion_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents12_ems : LL.accessor gaccessor'_ticketContents12_ems = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_master_secret : LL.accessor gaccessor'_ticketContents12_master_secret = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)) boolean_jumper)\n\nnoextract let clens_ticketContents12_ticketContents12' : LL.clens ticketContents12 ticketContents12' = synth_ticketContents12_recip_inverse (); synth_ticketContents12_recip_injective (); LL.clens_synth synth_ticketContents12_recip synth_ticketContents12\n\nlet gaccessor_ticketContents12_ticketContents12' : LL.gaccessor ticketContents12_parser ticketContents12'_parser clens_ticketContents12_ticketContents12' = synth_ticketContents12_inverse (); synth_ticketContents12_injective (); synth_ticketContents12_recip_inverse (); LL.gaccessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents12.gaccessor_ticketContents12_ticketContents12'", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.accessor_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.ticketContents12'_parser", "Parsers.TicketContents12.synth_ticketContents12", "Parsers.TicketContents12.synth_ticketContents12_recip", "Prims.unit", "Parsers.TicketContents12.synth_ticketContents12_recip_inverse", "Parsers.TicketContents12.synth_ticketContents12_injective", "Parsers.TicketContents12.synth_ticketContents12_inverse" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor_ticketContents12_ticketContents12':LL.accessor gaccessor_ticketContents12_ticketContents12'\nlet accessor_ticketContents12_ticketContents12':LL.accessor gaccessor_ticketContents12_ticketContents12'\n =", "completed_definiton": "synth_ticketContents12_inverse ();\nsynth_ticketContents12_injective ();\nsynth_ticketContents12_recip_inverse ();\nLL.accessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.gaccessor_ticketContents12_ems", "original_source_type": "val gaccessor_ticketContents12_ems : LL.gaccessor ticketContents12_parser boolean_parser clens_ticketContents12_ems", "source_type": "val gaccessor_ticketContents12_ems : LL.gaccessor ticketContents12_parser boolean_parser clens_ticketContents12_ems", "source_definition": "let gaccessor_ticketContents12_ems = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_ems) clens_ticketContents12_ems ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 146, "start_col": 37, "end_line": 146, "end_col": 185 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()\n\ninline_for_extraction let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))\n\nlet ticketContents12_serializer32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents12 _ ticketContents12'_serializer32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_size32 : LSZ.size32 ticketContents12'_serializer = ((protocolVersion_size32 `LSZ.size32_nondep_then` cipherSuite_size32) `LSZ.size32_nondep_then` (boolean_size32 `LSZ.size32_nondep_then` ticketContents12_master_secret_size32))\n\nlet ticketContents12_size32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents12 _ ticketContents12'_size32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_validator : LL.validator ticketContents12'_parser = ((protocolVersion_validator `LL.validate_nondep_then` cipherSuite_validator) `LL.validate_nondep_then` (boolean_validator `LL.validate_nondep_then` ticketContents12_master_secret_validator))\n\nlet ticketContents12_validator =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LL.validate_synth ticketContents12'_validator synth_ticketContents12 ()\n\nlet ticketContents12_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip () x;\nLP.length_serialize_nondep_then protocolVersion_serializer cipherSuite_serializer x.pv x.cs;\nLP.length_serialize_nondep_then boolean_serializer ticketContents12_master_secret_serializer x.ems x.master_secret;\nLP.length_serialize_nondep_then (protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer) (x.pv, x.cs) (x.ems, x.master_secret);\n (protocolVersion_bytesize_eq (x.pv));\n (cipherSuite_bytesize_eq (x.cs));\n (boolean_bytesize_eq (x.ems));\n (ticketContents12_master_secret_bytesize_eq (x.master_secret));\n assert(ticketContents12_bytesize x == Seq.length (LP.serialize protocolVersion_serializer x.pv) + Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize boolean_serializer x.ems) + Seq.length (LP.serialize ticketContents12_master_secret_serializer x.master_secret))\n\nlet gaccessor'_ticketContents12_pv : LL.gaccessor ticketContents12'_parser protocolVersion_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_cs : LL.gaccessor ticketContents12'_parser cipherSuite_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_ems : LL.gaccessor ticketContents12'_parser boolean_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_master_secret : LL.gaccessor ticketContents12'_parser ticketContents12_master_secret_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_pv : LL.accessor gaccessor'_ticketContents12_pv = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_cs : LL.accessor gaccessor'_ticketContents12_cs = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)) protocolVersion_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents12_ems : LL.accessor gaccessor'_ticketContents12_ems = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_master_secret : LL.accessor gaccessor'_ticketContents12_master_secret = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)) boolean_jumper)\n\nnoextract let clens_ticketContents12_ticketContents12' : LL.clens ticketContents12 ticketContents12' = synth_ticketContents12_recip_inverse (); synth_ticketContents12_recip_injective (); LL.clens_synth synth_ticketContents12_recip synth_ticketContents12\n\nlet gaccessor_ticketContents12_ticketContents12' : LL.gaccessor ticketContents12_parser ticketContents12'_parser clens_ticketContents12_ticketContents12' = synth_ticketContents12_inverse (); synth_ticketContents12_injective (); synth_ticketContents12_recip_inverse (); LL.gaccessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()\n\ninline_for_extraction noextract let accessor_ticketContents12_ticketContents12' : LL.accessor gaccessor_ticketContents12_ticketContents12' = synth_ticketContents12_inverse (); synth_ticketContents12_injective (); synth_ticketContents12_recip_inverse (); LL.accessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()\n\nlet gaccessor_ticketContents12_pv = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_pv) clens_ticketContents12_pv ()\n\nlet accessor_ticketContents12_pv = LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12' accessor'_ticketContents12_pv ()) clens_ticketContents12_pv ()\n\nlet gaccessor_ticketContents12_cs = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_cs) clens_ticketContents12_cs ()\n\nlet accessor_ticketContents12_cs = LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12' accessor'_ticketContents12_cs ()) clens_ticketContents12_cs ()", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.TicketContents12.ticketContents12_parser\n Parsers.Boolean.boolean_parser\n Parsers.TicketContents12.clens_ticketContents12_ems", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.gaccessor_ext", "Parsers.TicketContents12.ticketContents12_parser_kind", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.ticketContents12_parser", "Parsers.Boolean.boolean_parser_kind", "Parsers.Boolean.boolean", "Parsers.Boolean.boolean_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.clens_ticketContents12_ticketContents12'", "FStar.Pervasives.Native.tuple2", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "Parsers.ProtocolVersion.protocolVersion", "Parsers.CipherSuite.cipherSuite", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12.ticketContents12'_parser", "Parsers.TicketContents12.gaccessor_ticketContents12_ticketContents12'", "Parsers.TicketContents12.gaccessor'_ticketContents12_ems", "Parsers.TicketContents12.clens_ticketContents12_ems" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val gaccessor_ticketContents12_ems : LL.gaccessor ticketContents12_parser boolean_parser clens_ticketContents12_ems\nlet gaccessor_ticketContents12_ems =", "completed_definiton": "LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12'\n `LL.gaccessor_compose`\n gaccessor'_ticketContents12_ems)\n clens_ticketContents12_ems\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.accessor_ticketContents12_master_secret", "original_source_type": "val accessor_ticketContents12_master_secret : LL.accessor gaccessor_ticketContents12_master_secret", "source_type": "val accessor_ticketContents12_master_secret : LL.accessor gaccessor_ticketContents12_master_secret", "source_definition": "let accessor_ticketContents12_master_secret = LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12' accessor'_ticketContents12_master_secret ()) clens_ticketContents12_master_secret ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 152, "start_col": 46, "end_line": 152, "end_col": 211 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()\n\ninline_for_extraction let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))\n\nlet ticketContents12_serializer32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents12 _ ticketContents12'_serializer32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_size32 : LSZ.size32 ticketContents12'_serializer = ((protocolVersion_size32 `LSZ.size32_nondep_then` cipherSuite_size32) `LSZ.size32_nondep_then` (boolean_size32 `LSZ.size32_nondep_then` ticketContents12_master_secret_size32))\n\nlet ticketContents12_size32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents12 _ ticketContents12'_size32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_validator : LL.validator ticketContents12'_parser = ((protocolVersion_validator `LL.validate_nondep_then` cipherSuite_validator) `LL.validate_nondep_then` (boolean_validator `LL.validate_nondep_then` ticketContents12_master_secret_validator))\n\nlet ticketContents12_validator =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LL.validate_synth ticketContents12'_validator synth_ticketContents12 ()\n\nlet ticketContents12_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip () x;\nLP.length_serialize_nondep_then protocolVersion_serializer cipherSuite_serializer x.pv x.cs;\nLP.length_serialize_nondep_then boolean_serializer ticketContents12_master_secret_serializer x.ems x.master_secret;\nLP.length_serialize_nondep_then (protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer) (x.pv, x.cs) (x.ems, x.master_secret);\n (protocolVersion_bytesize_eq (x.pv));\n (cipherSuite_bytesize_eq (x.cs));\n (boolean_bytesize_eq (x.ems));\n (ticketContents12_master_secret_bytesize_eq (x.master_secret));\n assert(ticketContents12_bytesize x == Seq.length (LP.serialize protocolVersion_serializer x.pv) + Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize boolean_serializer x.ems) + Seq.length (LP.serialize ticketContents12_master_secret_serializer x.master_secret))\n\nlet gaccessor'_ticketContents12_pv : LL.gaccessor ticketContents12'_parser protocolVersion_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_cs : LL.gaccessor ticketContents12'_parser cipherSuite_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_ems : LL.gaccessor ticketContents12'_parser boolean_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_master_secret : LL.gaccessor ticketContents12'_parser ticketContents12_master_secret_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_pv : LL.accessor gaccessor'_ticketContents12_pv = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_cs : LL.accessor gaccessor'_ticketContents12_cs = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)) protocolVersion_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents12_ems : LL.accessor gaccessor'_ticketContents12_ems = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_master_secret : LL.accessor gaccessor'_ticketContents12_master_secret = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)) boolean_jumper)\n\nnoextract let clens_ticketContents12_ticketContents12' : LL.clens ticketContents12 ticketContents12' = synth_ticketContents12_recip_inverse (); synth_ticketContents12_recip_injective (); LL.clens_synth synth_ticketContents12_recip synth_ticketContents12\n\nlet gaccessor_ticketContents12_ticketContents12' : LL.gaccessor ticketContents12_parser ticketContents12'_parser clens_ticketContents12_ticketContents12' = synth_ticketContents12_inverse (); synth_ticketContents12_injective (); synth_ticketContents12_recip_inverse (); LL.gaccessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()\n\ninline_for_extraction noextract let accessor_ticketContents12_ticketContents12' : LL.accessor gaccessor_ticketContents12_ticketContents12' = synth_ticketContents12_inverse (); synth_ticketContents12_injective (); synth_ticketContents12_recip_inverse (); LL.accessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()\n\nlet gaccessor_ticketContents12_pv = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_pv) clens_ticketContents12_pv ()\n\nlet accessor_ticketContents12_pv = LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12' accessor'_ticketContents12_pv ()) clens_ticketContents12_pv ()\n\nlet gaccessor_ticketContents12_cs = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_cs) clens_ticketContents12_cs ()\n\nlet accessor_ticketContents12_cs = LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12' accessor'_ticketContents12_cs ()) clens_ticketContents12_cs ()\n\nlet gaccessor_ticketContents12_ems = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_ems) clens_ticketContents12_ems ()\n\nlet accessor_ticketContents12_ems = LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12' accessor'_ticketContents12_ems ()) clens_ticketContents12_ems ()\n\nlet gaccessor_ticketContents12_master_secret = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_master_secret) clens_ticketContents12_master_secret ()", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents12.gaccessor_ticketContents12_master_secret", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.accessor_ext", "Parsers.TicketContents12.ticketContents12_parser_kind", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.ticketContents12_parser", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.clens_ticketContents12_ticketContents12'", "FStar.Pervasives.Native.tuple2", "Parsers.Boolean.boolean", "Parsers.ProtocolVersion.protocolVersion", "Parsers.CipherSuite.cipherSuite", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12.ticketContents12'_parser", "Parsers.TicketContents12.gaccessor_ticketContents12_ticketContents12'", "Parsers.TicketContents12.gaccessor'_ticketContents12_master_secret", "LowParse.Low.Base.accessor_compose", "Parsers.TicketContents12.accessor_ticketContents12_ticketContents12'", "Parsers.TicketContents12.accessor'_ticketContents12_master_secret", "Parsers.TicketContents12.clens_ticketContents12_master_secret" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor_ticketContents12_master_secret : LL.accessor gaccessor_ticketContents12_master_secret\nlet accessor_ticketContents12_master_secret =", "completed_definiton": "LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12'\n accessor'_ticketContents12_master_secret\n ())\n clens_ticketContents12_master_secret\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.accessor_ticketContents12_pv", "original_source_type": "val accessor_ticketContents12_pv : LL.accessor gaccessor_ticketContents12_pv", "source_type": "val accessor_ticketContents12_pv : LL.accessor gaccessor_ticketContents12_pv", "source_definition": "let accessor_ticketContents12_pv = LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12' accessor'_ticketContents12_pv ()) clens_ticketContents12_pv ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 140, "start_col": 35, "end_line": 140, "end_col": 178 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()\n\ninline_for_extraction let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))\n\nlet ticketContents12_serializer32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents12 _ ticketContents12'_serializer32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_size32 : LSZ.size32 ticketContents12'_serializer = ((protocolVersion_size32 `LSZ.size32_nondep_then` cipherSuite_size32) `LSZ.size32_nondep_then` (boolean_size32 `LSZ.size32_nondep_then` ticketContents12_master_secret_size32))\n\nlet ticketContents12_size32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents12 _ ticketContents12'_size32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_validator : LL.validator ticketContents12'_parser = ((protocolVersion_validator `LL.validate_nondep_then` cipherSuite_validator) `LL.validate_nondep_then` (boolean_validator `LL.validate_nondep_then` ticketContents12_master_secret_validator))\n\nlet ticketContents12_validator =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LL.validate_synth ticketContents12'_validator synth_ticketContents12 ()\n\nlet ticketContents12_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip () x;\nLP.length_serialize_nondep_then protocolVersion_serializer cipherSuite_serializer x.pv x.cs;\nLP.length_serialize_nondep_then boolean_serializer ticketContents12_master_secret_serializer x.ems x.master_secret;\nLP.length_serialize_nondep_then (protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer) (x.pv, x.cs) (x.ems, x.master_secret);\n (protocolVersion_bytesize_eq (x.pv));\n (cipherSuite_bytesize_eq (x.cs));\n (boolean_bytesize_eq (x.ems));\n (ticketContents12_master_secret_bytesize_eq (x.master_secret));\n assert(ticketContents12_bytesize x == Seq.length (LP.serialize protocolVersion_serializer x.pv) + Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize boolean_serializer x.ems) + Seq.length (LP.serialize ticketContents12_master_secret_serializer x.master_secret))\n\nlet gaccessor'_ticketContents12_pv : LL.gaccessor ticketContents12'_parser protocolVersion_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_cs : LL.gaccessor ticketContents12'_parser cipherSuite_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_ems : LL.gaccessor ticketContents12'_parser boolean_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_master_secret : LL.gaccessor ticketContents12'_parser ticketContents12_master_secret_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_pv : LL.accessor gaccessor'_ticketContents12_pv = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_cs : LL.accessor gaccessor'_ticketContents12_cs = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)) protocolVersion_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents12_ems : LL.accessor gaccessor'_ticketContents12_ems = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_master_secret : LL.accessor gaccessor'_ticketContents12_master_secret = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)) boolean_jumper)\n\nnoextract let clens_ticketContents12_ticketContents12' : LL.clens ticketContents12 ticketContents12' = synth_ticketContents12_recip_inverse (); synth_ticketContents12_recip_injective (); LL.clens_synth synth_ticketContents12_recip synth_ticketContents12\n\nlet gaccessor_ticketContents12_ticketContents12' : LL.gaccessor ticketContents12_parser ticketContents12'_parser clens_ticketContents12_ticketContents12' = synth_ticketContents12_inverse (); synth_ticketContents12_injective (); synth_ticketContents12_recip_inverse (); LL.gaccessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()\n\ninline_for_extraction noextract let accessor_ticketContents12_ticketContents12' : LL.accessor gaccessor_ticketContents12_ticketContents12' = synth_ticketContents12_inverse (); synth_ticketContents12_injective (); synth_ticketContents12_recip_inverse (); LL.accessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()\n\nlet gaccessor_ticketContents12_pv = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_pv) clens_ticketContents12_pv ()", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents12.gaccessor_ticketContents12_pv", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.accessor_ext", "Parsers.TicketContents12.ticketContents12_parser_kind", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.ticketContents12_parser", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.ProtocolVersion.protocolVersion", "Parsers.ProtocolVersion.protocolVersion_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.clens_ticketContents12_ticketContents12'", "FStar.Pervasives.Native.tuple2", "Parsers.CipherSuite.cipherSuite", "Parsers.Boolean.boolean", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12.ticketContents12'_parser", "Parsers.TicketContents12.gaccessor_ticketContents12_ticketContents12'", "Parsers.TicketContents12.gaccessor'_ticketContents12_pv", "LowParse.Low.Base.accessor_compose", "Parsers.TicketContents12.accessor_ticketContents12_ticketContents12'", "Parsers.TicketContents12.accessor'_ticketContents12_pv", "Parsers.TicketContents12.clens_ticketContents12_pv" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor_ticketContents12_pv : LL.accessor gaccessor_ticketContents12_pv\nlet accessor_ticketContents12_pv =", "completed_definiton": "LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12'\n accessor'_ticketContents12_pv\n ())\n clens_ticketContents12_pv\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.gaccessor_ticketContents12_cs", "original_source_type": "val gaccessor_ticketContents12_cs : LL.gaccessor ticketContents12_parser cipherSuite_parser clens_ticketContents12_cs", "source_type": "val gaccessor_ticketContents12_cs : LL.gaccessor ticketContents12_parser cipherSuite_parser clens_ticketContents12_cs", "source_definition": "let gaccessor_ticketContents12_cs = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_cs) clens_ticketContents12_cs ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 142, "start_col": 36, "end_line": 142, "end_col": 182 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()\n\ninline_for_extraction let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))\n\nlet ticketContents12_serializer32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents12 _ ticketContents12'_serializer32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_size32 : LSZ.size32 ticketContents12'_serializer = ((protocolVersion_size32 `LSZ.size32_nondep_then` cipherSuite_size32) `LSZ.size32_nondep_then` (boolean_size32 `LSZ.size32_nondep_then` ticketContents12_master_secret_size32))\n\nlet ticketContents12_size32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents12 _ ticketContents12'_size32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_validator : LL.validator ticketContents12'_parser = ((protocolVersion_validator `LL.validate_nondep_then` cipherSuite_validator) `LL.validate_nondep_then` (boolean_validator `LL.validate_nondep_then` ticketContents12_master_secret_validator))\n\nlet ticketContents12_validator =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LL.validate_synth ticketContents12'_validator synth_ticketContents12 ()\n\nlet ticketContents12_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip () x;\nLP.length_serialize_nondep_then protocolVersion_serializer cipherSuite_serializer x.pv x.cs;\nLP.length_serialize_nondep_then boolean_serializer ticketContents12_master_secret_serializer x.ems x.master_secret;\nLP.length_serialize_nondep_then (protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer) (x.pv, x.cs) (x.ems, x.master_secret);\n (protocolVersion_bytesize_eq (x.pv));\n (cipherSuite_bytesize_eq (x.cs));\n (boolean_bytesize_eq (x.ems));\n (ticketContents12_master_secret_bytesize_eq (x.master_secret));\n assert(ticketContents12_bytesize x == Seq.length (LP.serialize protocolVersion_serializer x.pv) + Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize boolean_serializer x.ems) + Seq.length (LP.serialize ticketContents12_master_secret_serializer x.master_secret))\n\nlet gaccessor'_ticketContents12_pv : LL.gaccessor ticketContents12'_parser protocolVersion_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_cs : LL.gaccessor ticketContents12'_parser cipherSuite_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_ems : LL.gaccessor ticketContents12'_parser boolean_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_master_secret : LL.gaccessor ticketContents12'_parser ticketContents12_master_secret_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_pv : LL.accessor gaccessor'_ticketContents12_pv = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_cs : LL.accessor gaccessor'_ticketContents12_cs = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)) protocolVersion_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents12_ems : LL.accessor gaccessor'_ticketContents12_ems = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_master_secret : LL.accessor gaccessor'_ticketContents12_master_secret = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)) boolean_jumper)\n\nnoextract let clens_ticketContents12_ticketContents12' : LL.clens ticketContents12 ticketContents12' = synth_ticketContents12_recip_inverse (); synth_ticketContents12_recip_injective (); LL.clens_synth synth_ticketContents12_recip synth_ticketContents12\n\nlet gaccessor_ticketContents12_ticketContents12' : LL.gaccessor ticketContents12_parser ticketContents12'_parser clens_ticketContents12_ticketContents12' = synth_ticketContents12_inverse (); synth_ticketContents12_injective (); synth_ticketContents12_recip_inverse (); LL.gaccessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()\n\ninline_for_extraction noextract let accessor_ticketContents12_ticketContents12' : LL.accessor gaccessor_ticketContents12_ticketContents12' = synth_ticketContents12_inverse (); synth_ticketContents12_injective (); synth_ticketContents12_recip_inverse (); LL.accessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()\n\nlet gaccessor_ticketContents12_pv = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_pv) clens_ticketContents12_pv ()\n\nlet accessor_ticketContents12_pv = LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12' accessor'_ticketContents12_pv ()) clens_ticketContents12_pv ()", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.TicketContents12.ticketContents12_parser\n Parsers.CipherSuite.cipherSuite_parser\n Parsers.TicketContents12.clens_ticketContents12_cs", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.gaccessor_ext", "Parsers.TicketContents12.ticketContents12_parser_kind", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.ticketContents12_parser", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.CipherSuite.cipherSuite", "Parsers.CipherSuite.cipherSuite_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.clens_ticketContents12_ticketContents12'", "FStar.Pervasives.Native.tuple2", "Parsers.ProtocolVersion.protocolVersion", "Parsers.Boolean.boolean", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12.ticketContents12'_parser", "Parsers.TicketContents12.gaccessor_ticketContents12_ticketContents12'", "Parsers.TicketContents12.gaccessor'_ticketContents12_cs", "Parsers.TicketContents12.clens_ticketContents12_cs" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val gaccessor_ticketContents12_cs : LL.gaccessor ticketContents12_parser cipherSuite_parser clens_ticketContents12_cs\nlet gaccessor_ticketContents12_cs =", "completed_definiton": "LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12'\n `LL.gaccessor_compose`\n gaccessor'_ticketContents12_cs)\n clens_ticketContents12_cs\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fst", "name": "Parsers.TicketContents12.ticketContents12_valid", "original_source_type": "val ticketContents12_valid (h:HS.mem) (#rrel: _) (#rel: _) (input:LL.slice rrel rel) (pos0:U32.t) : Lemma\n (requires (\n LL.valid protocolVersion_parser h input pos0 /\\ (\n let pos1 = LL.get_valid_pos protocolVersion_parser h input pos0 in\n LL.valid cipherSuite_parser h input pos1 /\\ (\n let pos2 = LL.get_valid_pos cipherSuite_parser h input pos1 in\n LL.valid boolean_parser h input pos2 /\\ (\n let pos3 = LL.get_valid_pos boolean_parser h input pos2 in\n LL.valid ticketContents12_master_secret_parser h input pos3 /\\ (\n let pos4 = LL.get_valid_pos ticketContents12_master_secret_parser h input pos3 in\n True\n ))))))\n (ensures (\n let pv = LL.contents protocolVersion_parser h input pos0 in\n let pos1 = LL.get_valid_pos protocolVersion_parser h input pos0 in\n let cs = LL.contents cipherSuite_parser h input pos1 in\n let pos2 = LL.get_valid_pos cipherSuite_parser h input pos1 in\n let ems = LL.contents boolean_parser h input pos2 in\n let pos3 = LL.get_valid_pos boolean_parser h input pos2 in\n let master_secret = LL.contents ticketContents12_master_secret_parser h input pos3 in\n let pos4 = LL.get_valid_pos ticketContents12_master_secret_parser h input pos3 in\n LL.valid_content_pos ticketContents12_parser h input pos0 ({\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }) pos4))", "source_type": "val ticketContents12_valid (h:HS.mem) (#rrel: _) (#rel: _) (input:LL.slice rrel rel) (pos0:U32.t) : Lemma\n (requires (\n LL.valid protocolVersion_parser h input pos0 /\\ (\n let pos1 = LL.get_valid_pos protocolVersion_parser h input pos0 in\n LL.valid cipherSuite_parser h input pos1 /\\ (\n let pos2 = LL.get_valid_pos cipherSuite_parser h input pos1 in\n LL.valid boolean_parser h input pos2 /\\ (\n let pos3 = LL.get_valid_pos boolean_parser h input pos2 in\n LL.valid ticketContents12_master_secret_parser h input pos3 /\\ (\n let pos4 = LL.get_valid_pos ticketContents12_master_secret_parser h input pos3 in\n True\n ))))))\n (ensures (\n let pv = LL.contents protocolVersion_parser h input pos0 in\n let pos1 = LL.get_valid_pos protocolVersion_parser h input pos0 in\n let cs = LL.contents cipherSuite_parser h input pos1 in\n let pos2 = LL.get_valid_pos cipherSuite_parser h input pos1 in\n let ems = LL.contents boolean_parser h input pos2 in\n let pos3 = LL.get_valid_pos boolean_parser h input pos2 in\n let master_secret = LL.contents ticketContents12_master_secret_parser h input pos3 in\n let pos4 = LL.get_valid_pos ticketContents12_master_secret_parser h input pos3 in\n LL.valid_content_pos ticketContents12_parser h input pos0 ({\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }) pos4))", "source_definition": "let ticketContents12_valid h #_ #_ input pos0 =\n let pv = LL.contents protocolVersion_parser h input pos0 in\n let pos1 = LL.get_valid_pos protocolVersion_parser h input pos0 in\n let cs = LL.contents cipherSuite_parser h input pos1 in\n let pos2 = LL.get_valid_pos cipherSuite_parser h input pos1 in\n let ems = LL.contents boolean_parser h input pos2 in\n let pos3 = LL.get_valid_pos boolean_parser h input pos2 in\n let master_secret = LL.contents ticketContents12_master_secret_parser h input pos3 in\n let pos4 = LL.get_valid_pos ticketContents12_master_secret_parser h input pos3 in\n LL.valid_nondep_then_intro h protocolVersion_parser cipherSuite_parser input pos0;\n LL.valid_nondep_then_intro h boolean_parser ticketContents12_master_secret_parser input pos2;\n LL.valid_nondep_then_intro h (protocolVersion_parser `LP.nondep_then` cipherSuite_parser) (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser) input pos0;\n assert_norm (ticketContents12' == LP.get_parser_type ticketContents12'_parser);\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n synth_ticketContents12_injective ();\n LL.valid_synth_intro h ticketContents12'_parser synth_ticketContents12 input pos0", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 154, "start_col": 47, "end_line": 169, "end_col": 83 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field master_secret*)\nopen Parsers.TicketContents12_master_secret\n\ntype ticketContents12' = ((protocolVersion & cipherSuite) & (boolean & ticketContents12_master_secret))\n\ninline_for_extraction let synth_ticketContents12 (x: ticketContents12') : ticketContents12 =\n match x with ((pv,cs),(ems,master_secret)) -> {\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }\n\ninline_for_extraction let synth_ticketContents12_recip (x: ticketContents12) : ticketContents12' = ((x.pv,x.cs),(x.ems,x.master_secret))\n\nlet synth_ticketContents12_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents12_recip synth_ticketContents12) = ()\n\nlet synth_ticketContents12_injective () : Lemma (LP.synth_injective synth_ticketContents12) =\n LP.synth_inverse_synth_injective synth_ticketContents12_recip synth_ticketContents12;\n synth_ticketContents12_recip_inverse ()\n\nlet synth_ticketContents12_inverse () : Lemma (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents12 synth_ticketContents12_recip)\n\nlet synth_ticketContents12_recip_injective () : Lemma (LP.synth_injective synth_ticketContents12_recip) =\n synth_ticketContents12_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents12 synth_ticketContents12_recip\n\nnoextract let ticketContents12'_parser : LP.parser _ ticketContents12' = ((protocolVersion_parser `LP.nondep_then` cipherSuite_parser) `LP.nondep_then` (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser))\n\nnoextract let ticketContents12'_parser_kind = LP.get_parser_kind ticketContents12'_parser\n\nlet ticketContents12_parser =\n synth_ticketContents12_injective ();\n assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\n ticketContents12'_parser `LP.parse_synth` synth_ticketContents12\n\nnoextract let ticketContents12'_serializer : LP.serializer ticketContents12'_parser = ((protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) `LP.serialize_nondep_then` (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer))\n\nlet ticketContents12_serializer =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip ()\n\nlet ticketContents12_bytesize (x:ticketContents12) : GTot nat = Seq.length (ticketContents12_serializer x)\n\nlet ticketContents12_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents12'_parser32 : LS.parser32 ticketContents12'_parser = ((protocolVersion_parser32 `LS.parse32_nondep_then` cipherSuite_parser32) `LS.parse32_nondep_then` (boolean_parser32 `LS.parse32_nondep_then` ticketContents12_master_secret_parser32))\n\nlet ticketContents12_parser32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents12 (fun x -> synth_ticketContents12 x) ticketContents12'_parser32 ()\n\ninline_for_extraction let ticketContents12'_serializer32 : LS.serializer32 ticketContents12'_serializer = ((protocolVersion_serializer32 `LS.serialize32_nondep_then` cipherSuite_serializer32) `LS.serialize32_nondep_then` (boolean_serializer32 `LS.serialize32_nondep_then` ticketContents12_master_secret_serializer32))\n\nlet ticketContents12_serializer32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents12 _ ticketContents12'_serializer32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_size32 : LSZ.size32 ticketContents12'_serializer = ((protocolVersion_size32 `LSZ.size32_nondep_then` cipherSuite_size32) `LSZ.size32_nondep_then` (boolean_size32 `LSZ.size32_nondep_then` ticketContents12_master_secret_size32))\n\nlet ticketContents12_size32 =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents12 _ ticketContents12'_size32 synth_ticketContents12_recip (fun x -> synth_ticketContents12_recip x) ()\n\ninline_for_extraction let ticketContents12'_validator : LL.validator ticketContents12'_parser = ((protocolVersion_validator `LL.validate_nondep_then` cipherSuite_validator) `LL.validate_nondep_then` (boolean_validator `LL.validate_nondep_then` ticketContents12_master_secret_validator))\n\nlet ticketContents12_validator =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LL.validate_synth ticketContents12'_validator synth_ticketContents12 ()\n\nlet ticketContents12_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents12_injective () in\n [@inline_let] let _ = synth_ticketContents12_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents12 ticketContents12'_serializer synth_ticketContents12_recip () x;\nLP.length_serialize_nondep_then protocolVersion_serializer cipherSuite_serializer x.pv x.cs;\nLP.length_serialize_nondep_then boolean_serializer ticketContents12_master_secret_serializer x.ems x.master_secret;\nLP.length_serialize_nondep_then (protocolVersion_serializer `LP.serialize_nondep_then` cipherSuite_serializer) (boolean_serializer `LP.serialize_nondep_then` ticketContents12_master_secret_serializer) (x.pv, x.cs) (x.ems, x.master_secret);\n (protocolVersion_bytesize_eq (x.pv));\n (cipherSuite_bytesize_eq (x.cs));\n (boolean_bytesize_eq (x.ems));\n (ticketContents12_master_secret_bytesize_eq (x.master_secret));\n assert(ticketContents12_bytesize x == Seq.length (LP.serialize protocolVersion_serializer x.pv) + Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize boolean_serializer x.ems) + Seq.length (LP.serialize ticketContents12_master_secret_serializer x.master_secret))\n\nlet gaccessor'_ticketContents12_pv : LL.gaccessor ticketContents12'_parser protocolVersion_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_cs : LL.gaccessor ticketContents12'_parser cipherSuite_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_ems : LL.gaccessor ticketContents12'_parser boolean_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\nlet gaccessor'_ticketContents12_master_secret : LL.gaccessor ticketContents12'_parser ticketContents12_master_secret_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_pv : LL.accessor gaccessor'_ticketContents12_pv = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_cs : LL.accessor gaccessor'_ticketContents12_cs = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents12'_parser)) protocolVersion_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents12_ems : LL.accessor gaccessor'_ticketContents12_ems = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents12_master_secret : LL.accessor gaccessor'_ticketContents12_master_secret = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents12'_parser) (protocolVersion_jumper `LL.jump_nondep_then` cipherSuite_jumper)) boolean_jumper)\n\nnoextract let clens_ticketContents12_ticketContents12' : LL.clens ticketContents12 ticketContents12' = synth_ticketContents12_recip_inverse (); synth_ticketContents12_recip_injective (); LL.clens_synth synth_ticketContents12_recip synth_ticketContents12\n\nlet gaccessor_ticketContents12_ticketContents12' : LL.gaccessor ticketContents12_parser ticketContents12'_parser clens_ticketContents12_ticketContents12' = synth_ticketContents12_inverse (); synth_ticketContents12_injective (); synth_ticketContents12_recip_inverse (); LL.gaccessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()\n\ninline_for_extraction noextract let accessor_ticketContents12_ticketContents12' : LL.accessor gaccessor_ticketContents12_ticketContents12' = synth_ticketContents12_inverse (); synth_ticketContents12_injective (); synth_ticketContents12_recip_inverse (); LL.accessor_synth ticketContents12'_parser synth_ticketContents12 synth_ticketContents12_recip ()\n\nlet gaccessor_ticketContents12_pv = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_pv) clens_ticketContents12_pv ()\n\nlet accessor_ticketContents12_pv = LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12' accessor'_ticketContents12_pv ()) clens_ticketContents12_pv ()\n\nlet gaccessor_ticketContents12_cs = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_cs) clens_ticketContents12_cs ()\n\nlet accessor_ticketContents12_cs = LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12' accessor'_ticketContents12_cs ()) clens_ticketContents12_cs ()\n\nlet gaccessor_ticketContents12_ems = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_ems) clens_ticketContents12_ems ()\n\nlet accessor_ticketContents12_ems = LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12' accessor'_ticketContents12_ems ()) clens_ticketContents12_ems ()\n\nlet gaccessor_ticketContents12_master_secret = LL.gaccessor_ext (gaccessor_ticketContents12_ticketContents12' `LL.gaccessor_compose` gaccessor'_ticketContents12_master_secret) clens_ticketContents12_master_secret ()\n\nlet accessor_ticketContents12_master_secret = LL.accessor_ext (LL.accessor_compose accessor_ticketContents12_ticketContents12' accessor'_ticketContents12_master_secret ()) clens_ticketContents12_master_secret ()", "dependencies": { "source_file": "Parsers.TicketContents12.fst", "checked_file": "Parsers.TicketContents12.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: FStar.Monotonic.HyperStack.mem -> input: LowParse.Slice.slice rrel rel -> pos0: FStar.UInt32.t\n -> FStar.Pervasives.Lemma\n (requires\n LowParse.Low.Base.Spec.valid Parsers.ProtocolVersion.protocolVersion_parser h input pos0 /\\\n (let pos1 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.ProtocolVersion.protocolVersion_parser\n h\n input\n pos0\n in\n LowParse.Low.Base.Spec.valid Parsers.CipherSuite.cipherSuite_parser h input pos1 /\\\n (let pos2 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.CipherSuite.cipherSuite_parser\n h\n input\n pos1\n in\n LowParse.Low.Base.Spec.valid Parsers.Boolean.boolean_parser h input pos2 /\\\n (let pos3 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.Boolean.boolean_parser h input pos2\n in\n LowParse.Low.Base.Spec.valid Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser\n h\n input\n pos3 /\\\n (let pos4 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser\n h\n input\n pos3\n in\n Prims.l_True)))))\n (ensures\n (let pv =\n LowParse.Low.Base.Spec.contents Parsers.ProtocolVersion.protocolVersion_parser\n h\n input\n pos0\n in\n let pos1 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.ProtocolVersion.protocolVersion_parser\n h\n input\n pos0\n in\n let cs =\n LowParse.Low.Base.Spec.contents Parsers.CipherSuite.cipherSuite_parser h input pos1\n in\n let pos2 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.CipherSuite.cipherSuite_parser h input pos1\n in\n let ems = LowParse.Low.Base.Spec.contents Parsers.Boolean.boolean_parser h input pos2 in\n let pos3 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.Boolean.boolean_parser h input pos2\n in\n let master_secret =\n LowParse.Low.Base.Spec.contents Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser\n h\n input\n pos3\n in\n let pos4 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser\n h\n input\n pos3\n in\n LowParse.Low.Base.Spec.valid_content_pos Parsers.TicketContents12.ticketContents12_parser\n h\n input\n pos0\n (Parsers.TicketContents12.MkticketContents12 pv cs ems master_secret)\n pos4))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Monotonic.HyperStack.mem", "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "LowParse.Low.Combinators.valid_synth_intro", "LowParse.Spec.Combinators.and_then_kind", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.Boolean.boolean_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12.ticketContents12'", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.ticketContents12'_parser", "Parsers.TicketContents12.synth_ticketContents12", "Prims.unit", "Parsers.TicketContents12.synth_ticketContents12_injective", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "Parsers.TicketContents12.ticketContents12_parser_kind", "Parsers.TicketContents12.ticketContents12'_parser_kind", "LowParse.Spec.Base.get_parser_type", "LowParse.Low.Combinators.valid_nondep_then_intro", "FStar.Pervasives.Native.tuple2", "Parsers.ProtocolVersion.protocolVersion", "Parsers.CipherSuite.cipherSuite", "LowParse.Spec.Combinators.nondep_then", "Parsers.ProtocolVersion.protocolVersion_parser", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.Boolean.boolean", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "Parsers.Boolean.boolean_parser", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser", "LowParse.Low.Base.Spec.get_valid_pos", "LowParse.Low.Base.Spec.contents" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12_valid (h:HS.mem) (#rrel: _) (#rel: _) (input:LL.slice rrel rel) (pos0:U32.t) : Lemma\n (requires (\n LL.valid protocolVersion_parser h input pos0 /\\ (\n let pos1 = LL.get_valid_pos protocolVersion_parser h input pos0 in\n LL.valid cipherSuite_parser h input pos1 /\\ (\n let pos2 = LL.get_valid_pos cipherSuite_parser h input pos1 in\n LL.valid boolean_parser h input pos2 /\\ (\n let pos3 = LL.get_valid_pos boolean_parser h input pos2 in\n LL.valid ticketContents12_master_secret_parser h input pos3 /\\ (\n let pos4 = LL.get_valid_pos ticketContents12_master_secret_parser h input pos3 in\n True\n ))))))\n (ensures (\n let pv = LL.contents protocolVersion_parser h input pos0 in\n let pos1 = LL.get_valid_pos protocolVersion_parser h input pos0 in\n let cs = LL.contents cipherSuite_parser h input pos1 in\n let pos2 = LL.get_valid_pos cipherSuite_parser h input pos1 in\n let ems = LL.contents boolean_parser h input pos2 in\n let pos3 = LL.get_valid_pos boolean_parser h input pos2 in\n let master_secret = LL.contents ticketContents12_master_secret_parser h input pos3 in\n let pos4 = LL.get_valid_pos ticketContents12_master_secret_parser h input pos3 in\n LL.valid_content_pos ticketContents12_parser h input pos0 ({\n pv = pv;\n cs = cs;\n ems = ems;\n master_secret = master_secret;\n }) pos4))\nlet ticketContents12_valid h #_ #_ input pos0 =", "completed_definiton": "let pv = LL.contents protocolVersion_parser h input pos0 in\nlet pos1 = LL.get_valid_pos protocolVersion_parser h input pos0 in\nlet cs = LL.contents cipherSuite_parser h input pos1 in\nlet pos2 = LL.get_valid_pos cipherSuite_parser h input pos1 in\nlet ems = LL.contents boolean_parser h input pos2 in\nlet pos3 = LL.get_valid_pos boolean_parser h input pos2 in\nlet master_secret = LL.contents ticketContents12_master_secret_parser h input pos3 in\nlet pos4 = LL.get_valid_pos ticketContents12_master_secret_parser h input pos3 in\nLL.valid_nondep_then_intro h protocolVersion_parser cipherSuite_parser input pos0;\nLL.valid_nondep_then_intro h boolean_parser ticketContents12_master_secret_parser input pos2;\nLL.valid_nondep_then_intro h\n (protocolVersion_parser `LP.nondep_then` cipherSuite_parser)\n (boolean_parser `LP.nondep_then` ticketContents12_master_secret_parser)\n input\n pos0;\nassert_norm (ticketContents12' == LP.get_parser_type ticketContents12'_parser);\nassert_norm (ticketContents12_parser_kind == ticketContents12'_parser_kind);\nsynth_ticketContents12_injective ();\nLL.valid_synth_intro h ticketContents12'_parser synth_ticketContents12 input pos0", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureSchemeList.fsti", "name": "Parsers.SignatureSchemeList.signatureSchemeList_parser_kind", "original_source_type": "", "source_type": "val signatureSchemeList_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let signatureSchemeList_parser_kind = LP.strong_parser_kind 4 65536 None", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureSchemeList.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 26, "start_col": 70, "end_line": 26, "end_col": 104 }, "file_context": "module Parsers.SignatureSchemeList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.SignatureScheme\n\ninline_for_extraction noextract let min_count = 1\ninline_for_extraction noextract let max_count = 32767\ntype signatureSchemeList = l:list signatureScheme{1 <= L.length l /\\ L.length l <= 32767}", "dependencies": { "source_file": "Parsers.SignatureSchemeList.fsti", "checked_file": "Parsers.SignatureSchemeList.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.SignatureScheme.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.SignatureScheme" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let signatureSchemeList_parser_kind =", "completed_definiton": "LP.strong_parser_kind 4 65536 None", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureSchemeList.fsti", "name": "Parsers.SignatureSchemeList.max_count", "original_source_type": "", "source_type": "val max_count : Prims.int", "source_definition": "let max_count = 32767", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureSchemeList.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 23, "start_col": 48, "end_line": 23, "end_col": 53 }, "file_context": "module Parsers.SignatureSchemeList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.SignatureScheme", "dependencies": { "source_file": "Parsers.SignatureSchemeList.fsti", "checked_file": "Parsers.SignatureSchemeList.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.SignatureScheme.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.SignatureScheme" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.int", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let max_count =", "completed_definiton": "32767", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureSchemeList.fsti", "name": "Parsers.SignatureSchemeList.min_count", "original_source_type": "", "source_type": "val min_count : Prims.int", "source_definition": "let min_count = 1", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureSchemeList.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 22, "start_col": 48, "end_line": 22, "end_col": 49 }, "file_context": "module Parsers.SignatureSchemeList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.SignatureScheme", "dependencies": { "source_file": "Parsers.SignatureSchemeList.fsti", "checked_file": "Parsers.SignatureSchemeList.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.SignatureScheme.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.SignatureScheme" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.int", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let min_count =", "completed_definiton": "1", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureSchemeList.fsti", "name": "Parsers.SignatureSchemeList.signatureSchemeList_clens_nth", "original_source_type": "val signatureSchemeList_clens_nth (i: nat) : Tot (LL.clens signatureSchemeList signatureScheme)", "source_type": "val signatureSchemeList_clens_nth (i: nat) : Tot (LL.clens signatureSchemeList signatureScheme)", "source_definition": "let signatureSchemeList_clens_nth (i: nat) : Tot (LL.clens signatureSchemeList signatureScheme) = {\n LL.clens_cond = (fun (l: signatureSchemeList) -> i < L.length l);\n LL.clens_get = (fun (l: signatureSchemeList) -> L.index l i);\n}", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureSchemeList.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 74, "start_col": 2, "end_line": 75, "end_col": 63 }, "file_context": "module Parsers.SignatureSchemeList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.SignatureScheme\n\ninline_for_extraction noextract let min_count = 1\ninline_for_extraction noextract let max_count = 32767\ntype signatureSchemeList = l:list signatureScheme{1 <= L.length l /\\ L.length l <= 32767}\n\ninline_for_extraction noextract let signatureSchemeList_parser_kind = LP.strong_parser_kind 4 65536 None\n\nnoextract val signatureSchemeList_parser: LP.parser signatureSchemeList_parser_kind signatureSchemeList\n\nnoextract val signatureSchemeList_serializer: LP.serializer signatureSchemeList_parser\n\nnoextract val signatureSchemeList_bytesize (x:signatureSchemeList) : GTot nat\n\nnoextract val signatureSchemeList_bytesize_eq (x:signatureSchemeList) : Lemma (signatureSchemeList_bytesize x == Seq.length (LP.serialize signatureSchemeList_serializer x))\n\nval signatureSchemeList_parser32: LS.parser32 signatureSchemeList_parser\n\nval signatureSchemeList_serializer32: LS.serializer32 signatureSchemeList_serializer\n\nval signatureSchemeList_size32: LSZ.size32 signatureSchemeList_serializer\n\nval signatureSchemeList_validator: LL.validator signatureSchemeList_parser\n\nval signatureSchemeList_jumper: LL.jumper signatureSchemeList_parser\n\ninline_for_extraction val finalize_signatureSchemeList (#rrel: _) (#rel: _) (sl: LL.slice rrel rel) (pos pos' : U32.t) : HST.Stack unit\n(requires (fun h ->\n U32.v pos + 2 < 4294967296 /\\\n LL.writable sl.LL.base (U32.v pos) (U32.v pos + 2) h /\\\n LL.valid_list signatureScheme_parser h sl (pos `U32.add` 2ul) pos' /\\ (\n let count = L.length (LL.contents_list signatureScheme_parser h sl (pos `U32.add` 2ul) pos') in\n let len = U32.v pos' - (U32.v pos + 2) in\n ((2 <= len /\\ len <= 65534) \\/ (1 <= count /\\ count <= 32767))\n)))\n(ensures (fun h _ h' ->\n B.modifies (LL.loc_slice_from_to sl pos (pos `U32.add` 2ul)) h h' /\\ (\n let l = LL.contents_list signatureScheme_parser h sl (pos `U32.add` 2ul) pos' in\n 1 <= L.length l /\\ L.length l <= 32767 /\\\n LL.valid_content_pos signatureSchemeList_parser h' sl pos l pos'\n)))\n\nval signatureSchemeList_count (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid signatureSchemeList_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents signatureSchemeList_parser h input pos in\n let pos' = LL.get_valid_pos signatureSchemeList_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v res == L.length x /\\\n U32.v pos' == U32.v pos + 2 + (U32.v res `FStar.Mul.op_Star` 2) /\\\n LL.valid_list signatureScheme_parser h input (pos `U32.add` 2ul) pos' /\\\n LL.contents_list signatureScheme_parser h input (pos `U32.add` 2ul) pos' == x\n ))", "dependencies": { "source_file": "Parsers.SignatureSchemeList.fsti", "checked_file": "Parsers.SignatureSchemeList.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.SignatureScheme.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.SignatureScheme" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: Prims.nat\n -> LowParse.Low.Base.Spec.clens Parsers.SignatureSchemeList.signatureSchemeList\n Parsers.SignatureScheme.signatureScheme", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "LowParse.Low.Base.Spec.Mkclens", "Parsers.SignatureSchemeList.signatureSchemeList", "Parsers.SignatureScheme.signatureScheme", "Prims.b2t", "Prims.op_LessThan", "FStar.List.Tot.Base.length", "FStar.List.Tot.Base.index", "LowParse.Low.Base.Spec.clens" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureSchemeList_clens_nth (i: nat) : Tot (LL.clens signatureSchemeList signatureScheme)\nlet signatureSchemeList_clens_nth (i: nat) : Tot (LL.clens signatureSchemeList signatureScheme) =", "completed_definiton": "{\n LL.clens_cond = (fun (l: signatureSchemeList) -> i < L.length l);\n LL.clens_get = (fun (l: signatureSchemeList) -> L.index l i)\n}", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12_master_secret.Low.fst", "name": "Parsers.TicketContents12_master_secret.Low.write_ticketContents12_master_secret", "original_source_type": "val write_ticketContents12_master_secret : LP.leaf_writer_strong ticketContents12_master_secret_serializer", "source_type": "val write_ticketContents12_master_secret : LP.leaf_writer_strong ticketContents12_master_secret_serializer", "source_definition": "let write_ticketContents12_master_secret = \n LP.write_flbytes 48ul", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Parsers.TicketContents12_master_secret.Low.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 9, "start_col": 2, "end_line": 9, "end_col": 23 }, "file_context": "module Parsers.TicketContents12_master_secret.Low\nopen Parsers.TicketContents12_master_secret\n\nfriend Parsers.TicketContents12_master_secret\n\nmodule LP = LowParse.Low", "dependencies": { "source_file": "Parsers.TicketContents12_master_secret.Low.fst", "checked_file": "Parsers.TicketContents12_master_secret.Low.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fst.checked", "Parsers.TicketContents12_master_secret.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong Parsers.TicketContents12_master_secret.ticketContents12_master_secret_serializer\n", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Bytes.write_flbytes", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val write_ticketContents12_master_secret : LP.leaf_writer_strong ticketContents12_master_secret_serializer\nlet write_ticketContents12_master_secret =", "completed_definiton": "LP.write_flbytes 48ul", "isa_cross_project_example": true }, { "file_name": "Buffer.Utils.fst", "name": "Buffer.Utils.uint32s", "original_source_type": "", "source_type": "val uint32s : Type0", "source_definition": "let uint32s = buffer u32", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Buffer.Utils.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 24, "start_col": 14, "end_line": 24, "end_col": 24 }, "file_context": "module Buffer.Utils\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.Mul\nopen FStar.Ghost\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\nopen FStar.Int.Cast\nopen FStar.UInt8\nopen FStar.UInt32\nopen FStar.Buffer\n\nopen FStar.Math.Lemmas\n\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule ST = FStar.HyperStack.ST\n\nlet u32 = FStar.UInt32.t", "dependencies": { "source_file": "Buffer.Utils.fst", "checked_file": "Buffer.Utils.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "C.Compat.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Buffer.buffer", "Buffer.Utils.u32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let uint32s =", "completed_definiton": "buffer u32", "isa_cross_project_example": true }, { "file_name": "Buffer.Utils.fst", "name": "Buffer.Utils.bytes", "original_source_type": "", "source_type": "val bytes : Type0", "source_definition": "let bytes = buffer u8", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Buffer.Utils.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 25, "start_col": 12, "end_line": 25, "end_col": 21 }, "file_context": "module Buffer.Utils\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.Mul\nopen FStar.Ghost\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\nopen FStar.Int.Cast\nopen FStar.UInt8\nopen FStar.UInt32\nopen FStar.Buffer\n\nopen FStar.Math.Lemmas\n\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule ST = FStar.HyperStack.ST\n\nlet u32 = FStar.UInt32.t\nlet u8 = FStar.UInt8.t", "dependencies": { "source_file": "Buffer.Utils.fst", "checked_file": "Buffer.Utils.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "C.Compat.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Buffer.buffer", "Buffer.Utils.u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let bytes =", "completed_definiton": "buffer u8", "isa_cross_project_example": true }, { "file_name": "Buffer.Utils.fst", "name": "Buffer.Utils.u8", "original_source_type": "", "source_type": "val u8 : Prims.eqtype", "source_definition": "let u8 = FStar.UInt8.t", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Buffer.Utils.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 23, "start_col": 9, "end_line": 23, "end_col": 22 }, "file_context": "module Buffer.Utils\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.Mul\nopen FStar.Ghost\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\nopen FStar.Int.Cast\nopen FStar.UInt8\nopen FStar.UInt32\nopen FStar.Buffer\n\nopen FStar.Math.Lemmas\n\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule ST = FStar.HyperStack.ST", "dependencies": { "source_file": "Buffer.Utils.fst", "checked_file": "Buffer.Utils.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "C.Compat.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.eqtype", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt8.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let u8 =", "completed_definiton": "FStar.UInt8.t", "isa_cross_project_example": true }, { "file_name": "Buffer.Utils.fst", "name": "Buffer.Utils.u32", "original_source_type": "", "source_type": "val u32 : Prims.eqtype", "source_definition": "let u32 = FStar.UInt32.t", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Buffer.Utils.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 22, "start_col": 10, "end_line": 22, "end_col": 24 }, "file_context": "module Buffer.Utils\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.Mul\nopen FStar.Ghost\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\nopen FStar.Int.Cast\nopen FStar.UInt8\nopen FStar.UInt32\nopen FStar.Buffer\n\nopen FStar.Math.Lemmas\n\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule ST = FStar.HyperStack.ST", "dependencies": { "source_file": "Buffer.Utils.fst", "checked_file": "Buffer.Utils.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "C.Compat.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.eqtype", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let u32 =", "completed_definiton": "FStar.UInt32.t", "isa_cross_project_example": true }, { "file_name": "Buffer.Utils.fst", "name": "Buffer.Utils.op_Less_Less_Less", "original_source_type": "", "source_type": "val op_Less_Less_Less : a: Buffer.Utils.u32 -> s: Buffer.Utils.u32{0 < FStar.UInt32.v s && FStar.UInt32.v s < 32}\n -> FStar.UInt32.t", "source_definition": "let op_Less_Less_Less (a:u32) (s:u32{0 < v s && v s < 32}) =\n let (m:u32{v m = 32}) = 32ul in\n (op_Less_Less_Hat a s) |^ (op_Greater_Greater_Hat a (m -^ s))", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Buffer.Utils.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 32, "start_col": 60, "end_line": 34, "end_col": 63 }, "file_context": "module Buffer.Utils\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.Mul\nopen FStar.Ghost\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\nopen FStar.Int.Cast\nopen FStar.UInt8\nopen FStar.UInt32\nopen FStar.Buffer\n\nopen FStar.Math.Lemmas\n\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule ST = FStar.HyperStack.ST\n\nlet u32 = FStar.UInt32.t\nlet u8 = FStar.UInt8.t\nlet uint32s = buffer u32\nlet bytes = buffer u8\n\n(** Rotate operators on UInt32.t *)\nlet op_Greater_Greater_Greater (a:u32) (s:u32{0 < v s && v s < 32}) =\n let (m:u32{v m = 32}) = 32ul in\n (op_Greater_Greater_Hat a s) |^ (a <<^ (m -^ s))", "dependencies": { "source_file": "Buffer.Utils.fst", "checked_file": "Buffer.Utils.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "C.Compat.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Buffer.Utils.u32 -> s: Buffer.Utils.u32{0 < FStar.UInt32.v s && FStar.UInt32.v s < 32}\n -> FStar.UInt32.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Buffer.Utils.u32", "Prims.b2t", "Prims.op_AmpAmp", "Prims.op_LessThan", "FStar.UInt32.v", "FStar.UInt32.op_Bar_Hat", "FStar.UInt32.op_Less_Less_Hat", "FStar.UInt32.op_Greater_Greater_Hat", "FStar.UInt32.op_Subtraction_Hat", "Prims.op_Equality", "Prims.int", "FStar.UInt32.__uint_to_t", "FStar.UInt32.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let op_Less_Less_Less (a: u32) (s: u32{0 < v s && v s < 32}) =", "completed_definiton": "let m:m: u32{v m = 32} = 32ul in\n(op_Less_Less_Hat a s) |^ (op_Greater_Greater_Hat a (m -^ s))", "isa_cross_project_example": true }, { "file_name": "Buffer.Utils.fst", "name": "Buffer.Utils.op_Greater_Greater_Greater", "original_source_type": "", "source_type": "val op_Greater_Greater_Greater : a: Buffer.Utils.u32 -> s: Buffer.Utils.u32{0 < FStar.UInt32.v s && FStar.UInt32.v s < 32}\n -> FStar.UInt32.t", "source_definition": "let op_Greater_Greater_Greater (a:u32) (s:u32{0 < v s && v s < 32}) =\n let (m:u32{v m = 32}) = 32ul in\n (op_Greater_Greater_Hat a s) |^ (a <<^ (m -^ s))", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Buffer.Utils.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 28, "start_col": 69, "end_line": 30, "end_col": 50 }, "file_context": "module Buffer.Utils\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.Mul\nopen FStar.Ghost\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\nopen FStar.Int.Cast\nopen FStar.UInt8\nopen FStar.UInt32\nopen FStar.Buffer\n\nopen FStar.Math.Lemmas\n\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule ST = FStar.HyperStack.ST\n\nlet u32 = FStar.UInt32.t\nlet u8 = FStar.UInt8.t\nlet uint32s = buffer u32\nlet bytes = buffer u8", "dependencies": { "source_file": "Buffer.Utils.fst", "checked_file": "Buffer.Utils.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "C.Compat.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Buffer.Utils.u32 -> s: Buffer.Utils.u32{0 < FStar.UInt32.v s && FStar.UInt32.v s < 32}\n -> FStar.UInt32.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Buffer.Utils.u32", "Prims.b2t", "Prims.op_AmpAmp", "Prims.op_LessThan", "FStar.UInt32.v", "FStar.UInt32.op_Bar_Hat", "FStar.UInt32.op_Greater_Greater_Hat", "FStar.UInt32.op_Less_Less_Hat", "FStar.UInt32.op_Subtraction_Hat", "Prims.op_Equality", "Prims.int", "FStar.UInt32.__uint_to_t", "FStar.UInt32.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let op_Greater_Greater_Greater (a: u32) (s: u32{0 < v s && v s < 32}) =", "completed_definiton": "let m:m: u32{v m = 32} = 32ul in\n(op_Greater_Greater_Hat a s) |^ (a <<^ (m -^ s))", "isa_cross_project_example": true }, { "file_name": "Buffer.Utils.fst", "name": "Buffer.Utils.xor_bytes_inplace", "original_source_type": "val xor_bytes_inplace: output:bytes -> in1:bytes{disjoint in1 output} ->\n len:u32{v len <= length output /\\ v len <= length in1} -> STL unit\n (requires (fun h -> live h output /\\ live h in1))\n (ensures (fun h0 _ h1 -> live h0 output /\\ live h0 in1 /\\ live h1 output /\\ live h1 in1\n /\\ modifies_1 output h0 h1 ))", "source_type": "val xor_bytes_inplace: output:bytes -> in1:bytes{disjoint in1 output} ->\n len:u32{v len <= length output /\\ v len <= length in1} -> STL unit\n (requires (fun h -> live h output /\\ live h in1))\n (ensures (fun h0 _ h1 -> live h0 output /\\ live h0 in1 /\\ live h1 output /\\ live h1 in1\n /\\ modifies_1 output h0 h1 ))", "source_definition": "let xor_bytes_inplace output in1 len =\n let h0 = ST.get() in\n C.Compat.Loops.for 0ul len (fun h1 i -> live h1 output /\\ live h1 in1 /\\ modifies_1 output h0 h1)\n (fun i -> let ibyte = index in1 i in\n let obyte = index output i in\n let obyte' = UInt8.logxor ibyte obyte in\n output.(i) <- obyte')", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Buffer.Utils.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 43, "start_col": 38, "end_line": 49, "end_col": 30 }, "file_context": "module Buffer.Utils\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.Mul\nopen FStar.Ghost\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\nopen FStar.Int.Cast\nopen FStar.UInt8\nopen FStar.UInt32\nopen FStar.Buffer\n\nopen FStar.Math.Lemmas\n\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule ST = FStar.HyperStack.ST\n\nlet u32 = FStar.UInt32.t\nlet u8 = FStar.UInt8.t\nlet uint32s = buffer u32\nlet bytes = buffer u8\n\n(** Rotate operators on UInt32.t *)\nlet op_Greater_Greater_Greater (a:u32) (s:u32{0 < v s && v s < 32}) =\n let (m:u32{v m = 32}) = 32ul in\n (op_Greater_Greater_Hat a s) |^ (a <<^ (m -^ s))\n\nlet op_Less_Less_Less (a:u32) (s:u32{0 < v s && v s < 32}) =\n let (m:u32{v m = 32}) = 32ul in\n (op_Less_Less_Hat a s) |^ (op_Greater_Greater_Hat a (m -^ s))\n\n(** Inplace xor operation on bytes *)\n(* TODO: add functional spec *)\nval xor_bytes_inplace: output:bytes -> in1:bytes{disjoint in1 output} ->\n len:u32{v len <= length output /\\ v len <= length in1} -> STL unit\n (requires (fun h -> live h output /\\ live h in1))\n (ensures (fun h0 _ h1 -> live h0 output /\\ live h0 in1 /\\ live h1 output /\\ live h1 in1", "dependencies": { "source_file": "Buffer.Utils.fst", "checked_file": "Buffer.Utils.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "C.Compat.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n output: Buffer.Utils.bytes ->\n in1: Buffer.Utils.bytes{FStar.Buffer.disjoint in1 output} ->\n len:\n Buffer.Utils.u32\n { FStar.UInt32.v len <= FStar.Buffer.length output /\\\n FStar.UInt32.v len <= FStar.Buffer.length in1 }\n -> FStar.HyperStack.ST.STL Prims.unit", "effect": "FStar.HyperStack.ST.STL", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Buffer.Utils.bytes", "FStar.Buffer.disjoint", "Buffer.Utils.u8", "Buffer.Utils.u32", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "FStar.Buffer.length", "C.Compat.Loops.for", "FStar.UInt32.__uint_to_t", "FStar.Monotonic.HyperStack.mem", "Prims.nat", "FStar.Buffer.live", "FStar.Buffer.modifies_1", "FStar.UInt32.t", "Prims.op_LessThan", "FStar.Buffer.op_Array_Assignment", "Prims.unit", "FStar.UInt8.t", "FStar.UInt8.logxor", "FStar.Buffer.index", "FStar.HyperStack.ST.get" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val xor_bytes_inplace: output:bytes -> in1:bytes{disjoint in1 output} ->\n len:u32{v len <= length output /\\ v len <= length in1} -> STL unit\n (requires (fun h -> live h output /\\ live h in1))\n (ensures (fun h0 _ h1 -> live h0 output /\\ live h0 in1 /\\ live h1 output /\\ live h1 in1\n /\\ modifies_1 output h0 h1 ))\nlet xor_bytes_inplace output in1 len =", "completed_definiton": "let h0 = ST.get () in\nC.Compat.Loops.for 0ul\n len\n (fun h1 i -> live h1 output /\\ live h1 in1 /\\ modifies_1 output h0 h1)\n (fun i ->\n let ibyte = index in1 i in\n let obyte = index output i in\n let obyte' = UInt8.logxor ibyte obyte in\n output.(i) <- obyte')", "isa_cross_project_example": true }, { "file_name": "Buffer.Utils.fst", "name": "Buffer.Utils.lemma_uint32_of_bytes", "original_source_type": "val lemma_uint32_of_bytes (a b c d: t)\n : Lemma (requires (v a < pow2 8 /\\ v b < pow2 8 /\\ v c < pow2 8 /\\ v d < pow2 8))\n (ensures\n (v a + pow2 8 * v b < pow2 16 /\\ v a + pow2 8 * v b + pow2 16 * v c < pow2 24 /\\\n v a + pow2 8 * v b + pow2 16 * v c + pow2 24 * v d < pow2 32))", "source_type": "val lemma_uint32_of_bytes (a b c d: t)\n : Lemma (requires (v a < pow2 8 /\\ v b < pow2 8 /\\ v c < pow2 8 /\\ v d < pow2 8))\n (ensures\n (v a + pow2 8 * v b < pow2 16 /\\ v a + pow2 8 * v b + pow2 16 * v c < pow2 24 /\\\n v a + pow2 8 * v b + pow2 16 * v c + pow2 24 * v d < pow2 32))", "source_definition": "let lemma_uint32_of_bytes (a:t) (b:t) (c:t) (d:t) : Lemma\n (requires (v a < pow2 8 /\\ v b < pow2 8 /\\ v c < pow2 8 /\\ v d < pow2 8))\n (ensures (v a + pow2 8 * v b < pow2 16\n /\\ v a + pow2 8 * v b + pow2 16 * v c < pow2 24\n /\\ v a + pow2 8 * v b + pow2 16 * v c + pow2 24 * v d < pow2 32))\n = pow2_plus 8 8;\n lemma_euclidean_division (v a) (v b) (pow2 8);\n pow2_plus 8 16;\n lemma_euclidean_division (v a + pow2 8 * v b) (v c) (pow2 16);\n pow2_plus 8 24;\n lemma_euclidean_division (v a + pow2 8 * v b + pow2 16 * v c) (v d) (pow2 24)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Buffer.Utils.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 63, "start_col": 4, "end_line": 68, "end_col": 81 }, "file_context": "module Buffer.Utils\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.Mul\nopen FStar.Ghost\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\nopen FStar.Int.Cast\nopen FStar.UInt8\nopen FStar.UInt32\nopen FStar.Buffer\n\nopen FStar.Math.Lemmas\n\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule ST = FStar.HyperStack.ST\n\nlet u32 = FStar.UInt32.t\nlet u8 = FStar.UInt8.t\nlet uint32s = buffer u32\nlet bytes = buffer u8\n\n(** Rotate operators on UInt32.t *)\nlet op_Greater_Greater_Greater (a:u32) (s:u32{0 < v s && v s < 32}) =\n let (m:u32{v m = 32}) = 32ul in\n (op_Greater_Greater_Hat a s) |^ (a <<^ (m -^ s))\n\nlet op_Less_Less_Less (a:u32) (s:u32{0 < v s && v s < 32}) =\n let (m:u32{v m = 32}) = 32ul in\n (op_Less_Less_Hat a s) |^ (op_Greater_Greater_Hat a (m -^ s))\n\n(** Inplace xor operation on bytes *)\n(* TODO: add functional spec *)\nval xor_bytes_inplace: output:bytes -> in1:bytes{disjoint in1 output} ->\n len:u32{v len <= length output /\\ v len <= length in1} -> STL unit\n (requires (fun h -> live h output /\\ live h in1))\n (ensures (fun h0 _ h1 -> live h0 output /\\ live h0 in1 /\\ live h1 output /\\ live h1 in1\n /\\ modifies_1 output h0 h1 ))\nlet xor_bytes_inplace output in1 len =\n let h0 = ST.get() in\n C.Compat.Loops.for 0ul len (fun h1 i -> live h1 output /\\ live h1 in1 /\\ modifies_1 output h0 h1)\n (fun i -> let ibyte = index in1 i in\n let obyte = index output i in\n let obyte' = UInt8.logxor ibyte obyte in\n output.(i) <- obyte')\n\nval lemma_euclidean_division: r:nat -> b:nat -> q:pos -> Lemma\n (requires (r < q))\n (ensures (r + q * b < q * (b+1)))\nlet lemma_euclidean_division r b q = ()\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nlet lemma_uint32_of_bytes (a:t) (b:t) (c:t) (d:t) : Lemma\n (requires (v a < pow2 8 /\\ v b < pow2 8 /\\ v c < pow2 8 /\\ v d < pow2 8))\n (ensures (v a + pow2 8 * v b < pow2 16\n /\\ v a + pow2 8 * v b + pow2 16 * v c < pow2 24", "dependencies": { "source_file": "Buffer.Utils.fst", "checked_file": "Buffer.Utils.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "C.Compat.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: FStar.UInt32.t -> b: FStar.UInt32.t -> c: FStar.UInt32.t -> d: FStar.UInt32.t\n -> FStar.Pervasives.Lemma\n (requires\n FStar.UInt32.v a < Prims.pow2 8 /\\ FStar.UInt32.v b < Prims.pow2 8 /\\\n FStar.UInt32.v c < Prims.pow2 8 /\\ FStar.UInt32.v d < Prims.pow2 8)\n (ensures\n FStar.UInt32.v a + Prims.pow2 8 * FStar.UInt32.v b < Prims.pow2 16 /\\\n FStar.UInt32.v a + Prims.pow2 8 * FStar.UInt32.v b + Prims.pow2 16 * FStar.UInt32.v c <\n Prims.pow2 24 /\\\n FStar.UInt32.v a + Prims.pow2 8 * FStar.UInt32.v b + Prims.pow2 16 * FStar.UInt32.v c +\n Prims.pow2 24 * FStar.UInt32.v d <\n Prims.pow2 32)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Buffer.Utils.lemma_euclidean_division", "Prims.op_Addition", "FStar.UInt32.v", "FStar.Mul.op_Star", "Prims.pow2", "Prims.unit", "FStar.Math.Lemmas.pow2_plus", "Prims.l_and", "Prims.b2t", "Prims.op_LessThan", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_uint32_of_bytes (a b c d: t)\n : Lemma (requires (v a < pow2 8 /\\ v b < pow2 8 /\\ v c < pow2 8 /\\ v d < pow2 8))\n (ensures\n (v a + pow2 8 * v b < pow2 16 /\\ v a + pow2 8 * v b + pow2 16 * v c < pow2 24 /\\\n v a + pow2 8 * v b + pow2 16 * v c + pow2 24 * v d < pow2 32))\nlet lemma_uint32_of_bytes (a b c d: t)\n : Lemma (requires (v a < pow2 8 /\\ v b < pow2 8 /\\ v c < pow2 8 /\\ v d < pow2 8))\n (ensures\n (v a + pow2 8 * v b < pow2 16 /\\ v a + pow2 8 * v b + pow2 16 * v c < pow2 24 /\\\n v a + pow2 8 * v b + pow2 16 * v c + pow2 24 * v d < pow2 32)) =", "completed_definiton": "pow2_plus 8 8;\nlemma_euclidean_division (v a) (v b) (pow2 8);\npow2_plus 8 16;\nlemma_euclidean_division (v a + pow2 8 * v b) (v c) (pow2 16);\npow2_plus 8 24;\nlemma_euclidean_division (v a + pow2 8 * v b + pow2 16 * v c) (v d) (pow2 24)", "isa_cross_project_example": true }, { "file_name": "Buffer.Utils.fst", "name": "Buffer.Utils.memset", "original_source_type": "val memset: b:bytes -> z:u8 -> len:u32 -> STL unit\n (requires (fun h -> live h b /\\ v len = length b))\n (ensures (fun h0 _ h1 -> \n live h1 b /\\ modifies_1 b h0 h1 /\\\n Seq.equal (as_seq h1 b) (Seq.create (v len) z)))", "source_type": "val memset: b:bytes -> z:u8 -> len:u32 -> STL unit\n (requires (fun h -> live h b /\\ v len = length b))\n (ensures (fun h0 _ h1 -> \n live h1 b /\\ modifies_1 b h0 h1 /\\\n Seq.equal (as_seq h1 b) (Seq.create (v len) z)))", "source_definition": "let memset b z len =\n let h0 = ST.get() in\n C.Compat.Loops.for 0ul len (fun h1 i -> live h1 b /\\ modifies_1 b h0 h1 /\\ i <= Buffer.length b /\\\n (forall (j:nat{j < i}).{:pattern Seq.index (as_seq h1 b) j} Seq.index (as_seq h1 b) j == z))\n (fun i -> b.(i) <- z)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Buffer.Utils.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 176, "start_col": 20, "end_line": 180, "end_col": 23 }, "file_context": "module Buffer.Utils\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.Mul\nopen FStar.Ghost\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\nopen FStar.Int.Cast\nopen FStar.UInt8\nopen FStar.UInt32\nopen FStar.Buffer\n\nopen FStar.Math.Lemmas\n\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule ST = FStar.HyperStack.ST\n\nlet u32 = FStar.UInt32.t\nlet u8 = FStar.UInt8.t\nlet uint32s = buffer u32\nlet bytes = buffer u8\n\n(** Rotate operators on UInt32.t *)\nlet op_Greater_Greater_Greater (a:u32) (s:u32{0 < v s && v s < 32}) =\n let (m:u32{v m = 32}) = 32ul in\n (op_Greater_Greater_Hat a s) |^ (a <<^ (m -^ s))\n\nlet op_Less_Less_Less (a:u32) (s:u32{0 < v s && v s < 32}) =\n let (m:u32{v m = 32}) = 32ul in\n (op_Less_Less_Hat a s) |^ (op_Greater_Greater_Hat a (m -^ s))\n\n(** Inplace xor operation on bytes *)\n(* TODO: add functional spec *)\nval xor_bytes_inplace: output:bytes -> in1:bytes{disjoint in1 output} ->\n len:u32{v len <= length output /\\ v len <= length in1} -> STL unit\n (requires (fun h -> live h output /\\ live h in1))\n (ensures (fun h0 _ h1 -> live h0 output /\\ live h0 in1 /\\ live h1 output /\\ live h1 in1\n /\\ modifies_1 output h0 h1 ))\nlet xor_bytes_inplace output in1 len =\n let h0 = ST.get() in\n C.Compat.Loops.for 0ul len (fun h1 i -> live h1 output /\\ live h1 in1 /\\ modifies_1 output h0 h1)\n (fun i -> let ibyte = index in1 i in\n let obyte = index output i in\n let obyte' = UInt8.logxor ibyte obyte in\n output.(i) <- obyte')\n\nval lemma_euclidean_division: r:nat -> b:nat -> q:pos -> Lemma\n (requires (r < q))\n (ensures (r + q * b < q * (b+1)))\nlet lemma_euclidean_division r b q = ()\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nlet lemma_uint32_of_bytes (a:t) (b:t) (c:t) (d:t) : Lemma\n (requires (v a < pow2 8 /\\ v b < pow2 8 /\\ v c < pow2 8 /\\ v d < pow2 8))\n (ensures (v a + pow2 8 * v b < pow2 16\n /\\ v a + pow2 8 * v b + pow2 16 * v c < pow2 24\n /\\ v a + pow2 8 * v b + pow2 16 * v c + pow2 24 * v d < pow2 32))\n = pow2_plus 8 8;\n lemma_euclidean_division (v a) (v b) (pow2 8);\n pow2_plus 8 16;\n lemma_euclidean_division (v a + pow2 8 * v b) (v c) (pow2 16);\n pow2_plus 8 24;\n lemma_euclidean_division (v a + pow2 8 * v b + pow2 16 * v c) (v d) (pow2 24)\n\n(** Reads an unsigned int32 out of 4 bytes *)\nval uint32_of_bytes: b:bytes{length b >= 4} -> STL u32\n (requires (fun h -> live h b))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ live h0 b\n /\\ v r = U8.(v (get h0 b 0)\n\t\t + pow2 8 * v (get h0 b 1)\n\t\t + pow2 16 * v (get h0 b 2)\n\t\t + pow2 24 * v (get h0 b 3)) ))\nlet uint32_of_bytes (b:bytes{length b >= 4}) =\n let b0 = b.(0ul) in\n let b1 = b.(1ul) in\n let b2 = b.(2ul) in\n let b3 = b.(3ul) in\n let b0' = uint8_to_uint32 b0 in\n let b1' = uint8_to_uint32 b1 in\n let b2' = uint8_to_uint32 b2 in\n let b3' = uint8_to_uint32 b3 in\n pow2_lt_compat 32 8;\n cut (v b0' = U8.v b0 /\\ v b1' = U8.v b1 /\\ v b2' = U8.v b2 /\\ v b3' = U8.v b3);\n pow2_lt_compat 16 8;\n pow2_lt_compat 24 16;\n pow2_lt_compat 32 24;\n pow2_plus 8 8;\n pow2_plus 8 16;\n pow2_plus 8 24;\n let b1'' = b1' <<^ 8ul in\n let b2'' = b2' <<^ 16ul in\n let b3'' = b3' <<^ 24ul in\n cut (v b1'' = pow2 8 * U8.v b1 /\\ v b2'' = pow2 16 * U8.v b2 /\\ v b3'' = pow2 24 * U8.v b3);\n lemma_uint32_of_bytes b0' b1' b2' b3';\n b0' +^ b1'' +^ b2'' +^ b3''\n\n#reset-options \"--z3rlimit 20\"\n\n(** Stores the content of a byte buffer into a unsigned int32 buffer *)\n(* TODO: add functional spec *)\nval bytes_of_uint32s: output:bytes -> m:uint32s{disjoint output m} -> len:u32{v len <=length output /\\ v len<=op_Multiply 4 (length m)} -> STL unit\n (requires (fun h -> live h output /\\ live h m))\n (ensures (fun h0 _ h1 -> live h0 output /\\ live h0 m /\\ live h1 output /\\ live h1 m\n /\\ modifies_1 output h0 h1 ))\nlet rec bytes_of_uint32s output m l =\n if l >^ 0ul then\n begin\n let rem = l %^ 4ul in\n if UInt32.gt rem 0ul then\n begin\n let l = l -^ rem in\n let x = index m (l /^ 4ul) in\n let b0 = uint32_to_uint8 (x &^ 255ul) in\n output.(l) <- b0;\n if UInt32.gt rem 1ul then\n begin\n let b1 = uint32_to_uint8 ((x >>^ 8ul) &^ 255ul) in\n output.(l +^ 1ul) <- b1;\n\tif UInt32.gt rem 2ul then\n\t begin\n\t let b2 = uint32_to_uint8 ((x >>^ 16ul) &^ 255ul) in\n\t output.(l +^ 2ul) <- b2\n end\n\telse ()\n\tend\n else ();\n bytes_of_uint32s output m l\n end\n else\n begin\n let l = l -^ 4ul in\n let x = index m (l /^ 4ul) in\n let b0 = uint32_to_uint8 (x &^ 255ul) in\n let b1 = uint32_to_uint8 ((x >>^ 8ul) &^ 255ul) in\n let b2 = uint32_to_uint8 ((x >>^ 16ul) &^ 255ul) in\n let b3 = uint32_to_uint8 ((x >>^ 24ul) &^ 255ul) in\n output.(l) <- b0;\n output.(l +^ 1ul) <- b1;\n output.(l +^ 2ul) <- b2;\n output.(l +^ 3ul) <- b3;\n bytes_of_uint32s output m l\n end\n end\n\n(** Stores the content of a byte buffer into a unsigned int32 buffer *)\nval bytes_of_uint32: output:bytes{length output >= 4} -> m:u32 -> STL unit\n (requires (fun h -> live h output))\n (ensures (fun h0 _ h1 -> live h1 output\n /\\ modifies_1 output h0 h1\n /\\ U8.v (get h1 output 0) = (U32.v m) % pow2 8\n /\\ U8.v (get h1 output 1) = (U32.v m / pow2 8) % pow2 8\n /\\ U8.v (get h1 output 2) = (U32.v m / pow2 16) % pow2 8\n /\\ U8.v (get h1 output 3) = (U32.v m / pow2 24) % pow2 8 ))\nlet bytes_of_uint32 output x =\n let b0 = uint32_to_uint8 (x) in\n let b1 = uint32_to_uint8 ((x >>^ 8ul)) in\n let b2 = uint32_to_uint8 ((x >>^ 16ul)) in\n let b3 = uint32_to_uint8 ((x >>^ 24ul)) in\n output.(0ul) <- b0;\n output.(1ul) <- b1;\n output.(2ul) <- b2;\n output.(3ul) <- b3\n\n(* A form of memset, could go into some \"Utils\" functions module *)\n//16-10-03 added functional step; made pre-condition tighter (sufficient for use in AEAD)\nval memset: b:bytes -> z:u8 -> len:u32 -> STL unit\n (requires (fun h -> live h b /\\ v len = length b))\n (ensures (fun h0 _ h1 -> \n live h1 b /\\ modifies_1 b h0 h1 /\\", "dependencies": { "source_file": "Buffer.Utils.fst", "checked_file": "Buffer.Utils.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "C.Compat.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 20, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: Buffer.Utils.bytes -> z: Buffer.Utils.u8 -> len: Buffer.Utils.u32\n -> FStar.HyperStack.ST.STL Prims.unit", "effect": "FStar.HyperStack.ST.STL", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Buffer.Utils.bytes", "Buffer.Utils.u8", "Buffer.Utils.u32", "C.Compat.Loops.for", "FStar.UInt32.__uint_to_t", "FStar.Monotonic.HyperStack.mem", "Prims.nat", "Prims.l_and", "FStar.Buffer.live", "FStar.Buffer.modifies_1", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Buffer.length", "Prims.l_Forall", "Prims.op_LessThan", "Prims.eq2", "FStar.Seq.Base.index", "FStar.Buffer.as_seq", "FStar.UInt32.t", "FStar.UInt32.v", "FStar.Buffer.op_Array_Assignment", "Prims.unit", "FStar.HyperStack.ST.get" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val memset: b:bytes -> z:u8 -> len:u32 -> STL unit\n (requires (fun h -> live h b /\\ v len = length b))\n (ensures (fun h0 _ h1 -> \n live h1 b /\\ modifies_1 b h0 h1 /\\\n Seq.equal (as_seq h1 b) (Seq.create (v len) z)))\nlet memset b z len =", "completed_definiton": "let h0 = ST.get () in\nC.Compat.Loops.for 0ul\n len\n (fun h1 i ->\n live h1 b /\\ modifies_1 b h0 h1 /\\ i <= Buffer.length b /\\\n (forall (j: nat{j < i}). {:pattern Seq.index (as_seq h1 b) j} Seq.index (as_seq h1 b) j == z))\n (fun i -> b.(i) <- z)", "isa_cross_project_example": true }, { "file_name": "Buffer.Utils.fst", "name": "Buffer.Utils.uint32_of_bytes", "original_source_type": "val uint32_of_bytes: b:bytes{length b >= 4} -> STL u32\n (requires (fun h -> live h b))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ live h0 b\n /\\ v r = U8.(v (get h0 b 0)\n\t\t + pow2 8 * v (get h0 b 1)\n\t\t + pow2 16 * v (get h0 b 2)\n\t\t + pow2 24 * v (get h0 b 3)) ))", "source_type": "val uint32_of_bytes: b:bytes{length b >= 4} -> STL u32\n (requires (fun h -> live h b))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ live h0 b\n /\\ v r = U8.(v (get h0 b 0)\n\t\t + pow2 8 * v (get h0 b 1)\n\t\t + pow2 16 * v (get h0 b 2)\n\t\t + pow2 24 * v (get h0 b 3)) ))", "source_definition": "let uint32_of_bytes (b:bytes{length b >= 4}) =\n let b0 = b.(0ul) in\n let b1 = b.(1ul) in\n let b2 = b.(2ul) in\n let b3 = b.(3ul) in\n let b0' = uint8_to_uint32 b0 in\n let b1' = uint8_to_uint32 b1 in\n let b2' = uint8_to_uint32 b2 in\n let b3' = uint8_to_uint32 b3 in\n pow2_lt_compat 32 8;\n cut (v b0' = U8.v b0 /\\ v b1' = U8.v b1 /\\ v b2' = U8.v b2 /\\ v b3' = U8.v b3);\n pow2_lt_compat 16 8;\n pow2_lt_compat 24 16;\n pow2_lt_compat 32 24;\n pow2_plus 8 8;\n pow2_plus 8 16;\n pow2_plus 8 24;\n let b1'' = b1' <<^ 8ul in\n let b2'' = b2' <<^ 16ul in\n let b3'' = b3' <<^ 24ul in\n cut (v b1'' = pow2 8 * U8.v b1 /\\ v b2'' = pow2 16 * U8.v b2 /\\ v b3'' = pow2 24 * U8.v b3);\n lemma_uint32_of_bytes b0' b1' b2' b3';\n b0' +^ b1'' +^ b2'' +^ b3''", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Buffer.Utils.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 78, "start_col": 46, "end_line": 100, "end_col": 29 }, "file_context": "module Buffer.Utils\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.Mul\nopen FStar.Ghost\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\nopen FStar.Int.Cast\nopen FStar.UInt8\nopen FStar.UInt32\nopen FStar.Buffer\n\nopen FStar.Math.Lemmas\n\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule ST = FStar.HyperStack.ST\n\nlet u32 = FStar.UInt32.t\nlet u8 = FStar.UInt8.t\nlet uint32s = buffer u32\nlet bytes = buffer u8\n\n(** Rotate operators on UInt32.t *)\nlet op_Greater_Greater_Greater (a:u32) (s:u32{0 < v s && v s < 32}) =\n let (m:u32{v m = 32}) = 32ul in\n (op_Greater_Greater_Hat a s) |^ (a <<^ (m -^ s))\n\nlet op_Less_Less_Less (a:u32) (s:u32{0 < v s && v s < 32}) =\n let (m:u32{v m = 32}) = 32ul in\n (op_Less_Less_Hat a s) |^ (op_Greater_Greater_Hat a (m -^ s))\n\n(** Inplace xor operation on bytes *)\n(* TODO: add functional spec *)\nval xor_bytes_inplace: output:bytes -> in1:bytes{disjoint in1 output} ->\n len:u32{v len <= length output /\\ v len <= length in1} -> STL unit\n (requires (fun h -> live h output /\\ live h in1))\n (ensures (fun h0 _ h1 -> live h0 output /\\ live h0 in1 /\\ live h1 output /\\ live h1 in1\n /\\ modifies_1 output h0 h1 ))\nlet xor_bytes_inplace output in1 len =\n let h0 = ST.get() in\n C.Compat.Loops.for 0ul len (fun h1 i -> live h1 output /\\ live h1 in1 /\\ modifies_1 output h0 h1)\n (fun i -> let ibyte = index in1 i in\n let obyte = index output i in\n let obyte' = UInt8.logxor ibyte obyte in\n output.(i) <- obyte')\n\nval lemma_euclidean_division: r:nat -> b:nat -> q:pos -> Lemma\n (requires (r < q))\n (ensures (r + q * b < q * (b+1)))\nlet lemma_euclidean_division r b q = ()\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nlet lemma_uint32_of_bytes (a:t) (b:t) (c:t) (d:t) : Lemma\n (requires (v a < pow2 8 /\\ v b < pow2 8 /\\ v c < pow2 8 /\\ v d < pow2 8))\n (ensures (v a + pow2 8 * v b < pow2 16\n /\\ v a + pow2 8 * v b + pow2 16 * v c < pow2 24\n /\\ v a + pow2 8 * v b + pow2 16 * v c + pow2 24 * v d < pow2 32))\n = pow2_plus 8 8;\n lemma_euclidean_division (v a) (v b) (pow2 8);\n pow2_plus 8 16;\n lemma_euclidean_division (v a + pow2 8 * v b) (v c) (pow2 16);\n pow2_plus 8 24;\n lemma_euclidean_division (v a + pow2 8 * v b + pow2 16 * v c) (v d) (pow2 24)\n\n(** Reads an unsigned int32 out of 4 bytes *)\nval uint32_of_bytes: b:bytes{length b >= 4} -> STL u32\n (requires (fun h -> live h b))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ live h0 b\n /\\ v r = U8.(v (get h0 b 0)\n\t\t + pow2 8 * v (get h0 b 1)\n\t\t + pow2 16 * v (get h0 b 2)", "dependencies": { "source_file": "Buffer.Utils.fst", "checked_file": "Buffer.Utils.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "C.Compat.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: Buffer.Utils.bytes{FStar.Buffer.length b >= 4} -> FStar.HyperStack.ST.STL Buffer.Utils.u32", "effect": "FStar.HyperStack.ST.STL", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Buffer.Utils.bytes", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "FStar.Buffer.length", "Buffer.Utils.u8", "FStar.UInt32.op_Plus_Hat", "Prims.unit", "Buffer.Utils.lemma_uint32_of_bytes", "Prims.cut", "Prims.l_and", "Prims.op_Equality", "Prims.int", "FStar.UInt32.v", "FStar.Mul.op_Star", "Prims.pow2", "FStar.UInt8.v", "FStar.UInt32.t", "FStar.UInt32.op_Less_Less_Hat", "FStar.UInt32.__uint_to_t", "FStar.Math.Lemmas.pow2_plus", "FStar.Math.Lemmas.pow2_lt_compat", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "FStar.UInt8.n", "FStar.Int.Cast.uint8_to_uint32", "Buffer.Utils.u32", "FStar.Buffer.op_Array_Access" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val uint32_of_bytes: b:bytes{length b >= 4} -> STL u32\n (requires (fun h -> live h b))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ live h0 b\n /\\ v r = U8.(v (get h0 b 0)\n\t\t + pow2 8 * v (get h0 b 1)\n\t\t + pow2 16 * v (get h0 b 2)\n\t\t + pow2 24 * v (get h0 b 3)) ))\nlet uint32_of_bytes (b: bytes{length b >= 4}) =", "completed_definiton": "let b0 = b.(0ul) in\nlet b1 = b.(1ul) in\nlet b2 = b.(2ul) in\nlet b3 = b.(3ul) in\nlet b0' = uint8_to_uint32 b0 in\nlet b1' = uint8_to_uint32 b1 in\nlet b2' = uint8_to_uint32 b2 in\nlet b3' = uint8_to_uint32 b3 in\npow2_lt_compat 32 8;\ncut (v b0' = U8.v b0 /\\ v b1' = U8.v b1 /\\ v b2' = U8.v b2 /\\ v b3' = U8.v b3);\npow2_lt_compat 16 8;\npow2_lt_compat 24 16;\npow2_lt_compat 32 24;\npow2_plus 8 8;\npow2_plus 8 16;\npow2_plus 8 24;\nlet b1'' = b1' <<^ 8ul in\nlet b2'' = b2' <<^ 16ul in\nlet b3'' = b3' <<^ 24ul in\ncut (v b1'' = pow2 8 * U8.v b1 /\\ v b2'' = pow2 16 * U8.v b2 /\\ v b3'' = pow2 24 * U8.v b3);\nlemma_uint32_of_bytes b0' b1' b2' b3';\nb0' +^ b1'' +^ b2'' +^ b3''", "isa_cross_project_example": true }, { "file_name": "Buffer.Utils.fst", "name": "Buffer.Utils.bytes_of_uint32s", "original_source_type": "val bytes_of_uint32s: output:bytes -> m:uint32s{disjoint output m} -> len:u32{v len <=length output /\\ v len<=op_Multiply 4 (length m)} -> STL unit\n (requires (fun h -> live h output /\\ live h m))\n (ensures (fun h0 _ h1 -> live h0 output /\\ live h0 m /\\ live h1 output /\\ live h1 m\n /\\ modifies_1 output h0 h1 ))", "source_type": "val bytes_of_uint32s: output:bytes -> m:uint32s{disjoint output m} -> len:u32{v len <=length output /\\ v len<=op_Multiply 4 (length m)} -> STL unit\n (requires (fun h -> live h output /\\ live h m))\n (ensures (fun h0 _ h1 -> live h0 output /\\ live h0 m /\\ live h1 output /\\ live h1 m\n /\\ modifies_1 output h0 h1 ))", "source_definition": "let rec bytes_of_uint32s output m l =\n if l >^ 0ul then\n begin\n let rem = l %^ 4ul in\n if UInt32.gt rem 0ul then\n begin\n let l = l -^ rem in\n let x = index m (l /^ 4ul) in\n let b0 = uint32_to_uint8 (x &^ 255ul) in\n output.(l) <- b0;\n if UInt32.gt rem 1ul then\n begin\n let b1 = uint32_to_uint8 ((x >>^ 8ul) &^ 255ul) in\n output.(l +^ 1ul) <- b1;\n\tif UInt32.gt rem 2ul then\n\t begin\n\t let b2 = uint32_to_uint8 ((x >>^ 16ul) &^ 255ul) in\n\t output.(l +^ 2ul) <- b2\n end\n\telse ()\n\tend\n else ();\n bytes_of_uint32s output m l\n end\n else\n begin\n let l = l -^ 4ul in\n let x = index m (l /^ 4ul) in\n let b0 = uint32_to_uint8 (x &^ 255ul) in\n let b1 = uint32_to_uint8 ((x >>^ 8ul) &^ 255ul) in\n let b2 = uint32_to_uint8 ((x >>^ 16ul) &^ 255ul) in\n let b3 = uint32_to_uint8 ((x >>^ 24ul) &^ 255ul) in\n output.(l) <- b0;\n output.(l +^ 1ul) <- b1;\n output.(l +^ 2ul) <- b2;\n output.(l +^ 3ul) <- b3;\n bytes_of_uint32s output m l\n end\n end", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Buffer.Utils.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 111, "start_col": 2, "end_line": 148, "end_col": 7 }, "file_context": "module Buffer.Utils\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.Mul\nopen FStar.Ghost\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\nopen FStar.Int.Cast\nopen FStar.UInt8\nopen FStar.UInt32\nopen FStar.Buffer\n\nopen FStar.Math.Lemmas\n\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule ST = FStar.HyperStack.ST\n\nlet u32 = FStar.UInt32.t\nlet u8 = FStar.UInt8.t\nlet uint32s = buffer u32\nlet bytes = buffer u8\n\n(** Rotate operators on UInt32.t *)\nlet op_Greater_Greater_Greater (a:u32) (s:u32{0 < v s && v s < 32}) =\n let (m:u32{v m = 32}) = 32ul in\n (op_Greater_Greater_Hat a s) |^ (a <<^ (m -^ s))\n\nlet op_Less_Less_Less (a:u32) (s:u32{0 < v s && v s < 32}) =\n let (m:u32{v m = 32}) = 32ul in\n (op_Less_Less_Hat a s) |^ (op_Greater_Greater_Hat a (m -^ s))\n\n(** Inplace xor operation on bytes *)\n(* TODO: add functional spec *)\nval xor_bytes_inplace: output:bytes -> in1:bytes{disjoint in1 output} ->\n len:u32{v len <= length output /\\ v len <= length in1} -> STL unit\n (requires (fun h -> live h output /\\ live h in1))\n (ensures (fun h0 _ h1 -> live h0 output /\\ live h0 in1 /\\ live h1 output /\\ live h1 in1\n /\\ modifies_1 output h0 h1 ))\nlet xor_bytes_inplace output in1 len =\n let h0 = ST.get() in\n C.Compat.Loops.for 0ul len (fun h1 i -> live h1 output /\\ live h1 in1 /\\ modifies_1 output h0 h1)\n (fun i -> let ibyte = index in1 i in\n let obyte = index output i in\n let obyte' = UInt8.logxor ibyte obyte in\n output.(i) <- obyte')\n\nval lemma_euclidean_division: r:nat -> b:nat -> q:pos -> Lemma\n (requires (r < q))\n (ensures (r + q * b < q * (b+1)))\nlet lemma_euclidean_division r b q = ()\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nlet lemma_uint32_of_bytes (a:t) (b:t) (c:t) (d:t) : Lemma\n (requires (v a < pow2 8 /\\ v b < pow2 8 /\\ v c < pow2 8 /\\ v d < pow2 8))\n (ensures (v a + pow2 8 * v b < pow2 16\n /\\ v a + pow2 8 * v b + pow2 16 * v c < pow2 24\n /\\ v a + pow2 8 * v b + pow2 16 * v c + pow2 24 * v d < pow2 32))\n = pow2_plus 8 8;\n lemma_euclidean_division (v a) (v b) (pow2 8);\n pow2_plus 8 16;\n lemma_euclidean_division (v a + pow2 8 * v b) (v c) (pow2 16);\n pow2_plus 8 24;\n lemma_euclidean_division (v a + pow2 8 * v b + pow2 16 * v c) (v d) (pow2 24)\n\n(** Reads an unsigned int32 out of 4 bytes *)\nval uint32_of_bytes: b:bytes{length b >= 4} -> STL u32\n (requires (fun h -> live h b))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ live h0 b\n /\\ v r = U8.(v (get h0 b 0)\n\t\t + pow2 8 * v (get h0 b 1)\n\t\t + pow2 16 * v (get h0 b 2)\n\t\t + pow2 24 * v (get h0 b 3)) ))\nlet uint32_of_bytes (b:bytes{length b >= 4}) =\n let b0 = b.(0ul) in\n let b1 = b.(1ul) in\n let b2 = b.(2ul) in\n let b3 = b.(3ul) in\n let b0' = uint8_to_uint32 b0 in\n let b1' = uint8_to_uint32 b1 in\n let b2' = uint8_to_uint32 b2 in\n let b3' = uint8_to_uint32 b3 in\n pow2_lt_compat 32 8;\n cut (v b0' = U8.v b0 /\\ v b1' = U8.v b1 /\\ v b2' = U8.v b2 /\\ v b3' = U8.v b3);\n pow2_lt_compat 16 8;\n pow2_lt_compat 24 16;\n pow2_lt_compat 32 24;\n pow2_plus 8 8;\n pow2_plus 8 16;\n pow2_plus 8 24;\n let b1'' = b1' <<^ 8ul in\n let b2'' = b2' <<^ 16ul in\n let b3'' = b3' <<^ 24ul in\n cut (v b1'' = pow2 8 * U8.v b1 /\\ v b2'' = pow2 16 * U8.v b2 /\\ v b3'' = pow2 24 * U8.v b3);\n lemma_uint32_of_bytes b0' b1' b2' b3';\n b0' +^ b1'' +^ b2'' +^ b3''\n\n#reset-options \"--z3rlimit 20\"\n\n(** Stores the content of a byte buffer into a unsigned int32 buffer *)\n(* TODO: add functional spec *)\nval bytes_of_uint32s: output:bytes -> m:uint32s{disjoint output m} -> len:u32{v len <=length output /\\ v len<=op_Multiply 4 (length m)} -> STL unit\n (requires (fun h -> live h output /\\ live h m))\n (ensures (fun h0 _ h1 -> live h0 output /\\ live h0 m /\\ live h1 output /\\ live h1 m\n /\\ modifies_1 output h0 h1 ))", "dependencies": { "source_file": "Buffer.Utils.fst", "checked_file": "Buffer.Utils.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "C.Compat.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 20, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n output: Buffer.Utils.bytes ->\n m: Buffer.Utils.uint32s{FStar.Buffer.disjoint output m} ->\n len:\n Buffer.Utils.u32\n { FStar.UInt32.v len <= FStar.Buffer.length output /\\\n FStar.UInt32.v len <= 4 * FStar.Buffer.length m }\n -> FStar.HyperStack.ST.STL Prims.unit", "effect": "FStar.HyperStack.ST.STL", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Buffer.Utils.bytes", "Buffer.Utils.uint32s", "FStar.Buffer.disjoint", "Buffer.Utils.u8", "Buffer.Utils.u32", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "FStar.Buffer.length", "Prims.op_Multiply", "FStar.UInt32.op_Greater_Hat", "FStar.UInt32.__uint_to_t", "FStar.UInt32.gt", "Buffer.Utils.bytes_of_uint32s", "Prims.unit", "FStar.Buffer.op_Array_Assignment", "FStar.UInt32.op_Plus_Hat", "FStar.UInt8.t", "Prims.op_Equality", "Prims.int", "FStar.UInt8.v", "Prims.op_Modulus", "FStar.UInt32.logand", "FStar.UInt32.shift_right", "FStar.UInt32.uint_to_t", "FStar.UInt32.t", "Prims.pow2", "FStar.Int.Cast.uint32_to_uint8", "FStar.UInt32.op_Amp_Hat", "FStar.UInt32.op_Greater_Greater_Hat", "Prims.bool", "FStar.Buffer.index", "FStar.UInt32.op_Slash_Hat", "FStar.UInt32.op_Subtraction_Hat", "FStar.UInt32.op_Percent_Hat" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val bytes_of_uint32s: output:bytes -> m:uint32s{disjoint output m} -> len:u32{v len <=length output /\\ v len<=op_Multiply 4 (length m)} -> STL unit\n (requires (fun h -> live h output /\\ live h m))\n (ensures (fun h0 _ h1 -> live h0 output /\\ live h0 m /\\ live h1 output /\\ live h1 m\n /\\ modifies_1 output h0 h1 ))\nlet rec bytes_of_uint32s output m l =", "completed_definiton": "if l >^ 0ul\nthen\n let rem = l %^ 4ul in\n if UInt32.gt rem 0ul\n then\n let l = l -^ rem in\n let x = index m (l /^ 4ul) in\n let b0 = uint32_to_uint8 (x &^ 255ul) in\n output.(l) <- b0;\n if UInt32.gt rem 1ul\n then\n (let b1 = uint32_to_uint8 ((x >>^ 8ul) &^ 255ul) in\n output.(l +^ 1ul) <- b1;\n if UInt32.gt rem 2ul\n then\n let b2 = uint32_to_uint8 ((x >>^ 16ul) &^ 255ul) in\n output.(l +^ 2ul) <- b2);\n bytes_of_uint32s output m l\n else\n let l = l -^ 4ul in\n let x = index m (l /^ 4ul) in\n let b0 = uint32_to_uint8 (x &^ 255ul) in\n let b1 = uint32_to_uint8 ((x >>^ 8ul) &^ 255ul) in\n let b2 = uint32_to_uint8 ((x >>^ 16ul) &^ 255ul) in\n let b3 = uint32_to_uint8 ((x >>^ 24ul) &^ 255ul) in\n output.(l) <- b0;\n output.(l +^ 1ul) <- b1;\n output.(l +^ 2ul) <- b2;\n output.(l +^ 3ul) <- b3;\n bytes_of_uint32s output m l", "isa_cross_project_example": true }, { "file_name": "Buffer.Utils.fst", "name": "Buffer.Utils.bytes_of_uint32", "original_source_type": "val bytes_of_uint32: output:bytes{length output >= 4} -> m:u32 -> STL unit\n (requires (fun h -> live h output))\n (ensures (fun h0 _ h1 -> live h1 output\n /\\ modifies_1 output h0 h1\n /\\ U8.v (get h1 output 0) = (U32.v m) % pow2 8\n /\\ U8.v (get h1 output 1) = (U32.v m / pow2 8) % pow2 8\n /\\ U8.v (get h1 output 2) = (U32.v m / pow2 16) % pow2 8\n /\\ U8.v (get h1 output 3) = (U32.v m / pow2 24) % pow2 8 ))", "source_type": "val bytes_of_uint32: output:bytes{length output >= 4} -> m:u32 -> STL unit\n (requires (fun h -> live h output))\n (ensures (fun h0 _ h1 -> live h1 output\n /\\ modifies_1 output h0 h1\n /\\ U8.v (get h1 output 0) = (U32.v m) % pow2 8\n /\\ U8.v (get h1 output 1) = (U32.v m / pow2 8) % pow2 8\n /\\ U8.v (get h1 output 2) = (U32.v m / pow2 16) % pow2 8\n /\\ U8.v (get h1 output 3) = (U32.v m / pow2 24) % pow2 8 ))", "source_definition": "let bytes_of_uint32 output x =\n let b0 = uint32_to_uint8 (x) in\n let b1 = uint32_to_uint8 ((x >>^ 8ul)) in\n let b2 = uint32_to_uint8 ((x >>^ 16ul)) in\n let b3 = uint32_to_uint8 ((x >>^ 24ul)) in\n output.(0ul) <- b0;\n output.(1ul) <- b1;\n output.(2ul) <- b2;\n output.(3ul) <- b3", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Buffer.Utils.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 159, "start_col": 30, "end_line": 167, "end_col": 20 }, "file_context": "module Buffer.Utils\n\nmodule ST = FStar.HyperStack.ST\n\nopen FStar.HyperStack.All\n\nopen FStar.Mul\nopen FStar.Ghost\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\nopen FStar.Int.Cast\nopen FStar.UInt8\nopen FStar.UInt32\nopen FStar.Buffer\n\nopen FStar.Math.Lemmas\n\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule ST = FStar.HyperStack.ST\n\nlet u32 = FStar.UInt32.t\nlet u8 = FStar.UInt8.t\nlet uint32s = buffer u32\nlet bytes = buffer u8\n\n(** Rotate operators on UInt32.t *)\nlet op_Greater_Greater_Greater (a:u32) (s:u32{0 < v s && v s < 32}) =\n let (m:u32{v m = 32}) = 32ul in\n (op_Greater_Greater_Hat a s) |^ (a <<^ (m -^ s))\n\nlet op_Less_Less_Less (a:u32) (s:u32{0 < v s && v s < 32}) =\n let (m:u32{v m = 32}) = 32ul in\n (op_Less_Less_Hat a s) |^ (op_Greater_Greater_Hat a (m -^ s))\n\n(** Inplace xor operation on bytes *)\n(* TODO: add functional spec *)\nval xor_bytes_inplace: output:bytes -> in1:bytes{disjoint in1 output} ->\n len:u32{v len <= length output /\\ v len <= length in1} -> STL unit\n (requires (fun h -> live h output /\\ live h in1))\n (ensures (fun h0 _ h1 -> live h0 output /\\ live h0 in1 /\\ live h1 output /\\ live h1 in1\n /\\ modifies_1 output h0 h1 ))\nlet xor_bytes_inplace output in1 len =\n let h0 = ST.get() in\n C.Compat.Loops.for 0ul len (fun h1 i -> live h1 output /\\ live h1 in1 /\\ modifies_1 output h0 h1)\n (fun i -> let ibyte = index in1 i in\n let obyte = index output i in\n let obyte' = UInt8.logxor ibyte obyte in\n output.(i) <- obyte')\n\nval lemma_euclidean_division: r:nat -> b:nat -> q:pos -> Lemma\n (requires (r < q))\n (ensures (r + q * b < q * (b+1)))\nlet lemma_euclidean_division r b q = ()\n\n#reset-options \"--initial_fuel 0 --max_fuel 0\"\n\nlet lemma_uint32_of_bytes (a:t) (b:t) (c:t) (d:t) : Lemma\n (requires (v a < pow2 8 /\\ v b < pow2 8 /\\ v c < pow2 8 /\\ v d < pow2 8))\n (ensures (v a + pow2 8 * v b < pow2 16\n /\\ v a + pow2 8 * v b + pow2 16 * v c < pow2 24\n /\\ v a + pow2 8 * v b + pow2 16 * v c + pow2 24 * v d < pow2 32))\n = pow2_plus 8 8;\n lemma_euclidean_division (v a) (v b) (pow2 8);\n pow2_plus 8 16;\n lemma_euclidean_division (v a + pow2 8 * v b) (v c) (pow2 16);\n pow2_plus 8 24;\n lemma_euclidean_division (v a + pow2 8 * v b + pow2 16 * v c) (v d) (pow2 24)\n\n(** Reads an unsigned int32 out of 4 bytes *)\nval uint32_of_bytes: b:bytes{length b >= 4} -> STL u32\n (requires (fun h -> live h b))\n (ensures (fun h0 r h1 -> h0 == h1 /\\ live h0 b\n /\\ v r = U8.(v (get h0 b 0)\n\t\t + pow2 8 * v (get h0 b 1)\n\t\t + pow2 16 * v (get h0 b 2)\n\t\t + pow2 24 * v (get h0 b 3)) ))\nlet uint32_of_bytes (b:bytes{length b >= 4}) =\n let b0 = b.(0ul) in\n let b1 = b.(1ul) in\n let b2 = b.(2ul) in\n let b3 = b.(3ul) in\n let b0' = uint8_to_uint32 b0 in\n let b1' = uint8_to_uint32 b1 in\n let b2' = uint8_to_uint32 b2 in\n let b3' = uint8_to_uint32 b3 in\n pow2_lt_compat 32 8;\n cut (v b0' = U8.v b0 /\\ v b1' = U8.v b1 /\\ v b2' = U8.v b2 /\\ v b3' = U8.v b3);\n pow2_lt_compat 16 8;\n pow2_lt_compat 24 16;\n pow2_lt_compat 32 24;\n pow2_plus 8 8;\n pow2_plus 8 16;\n pow2_plus 8 24;\n let b1'' = b1' <<^ 8ul in\n let b2'' = b2' <<^ 16ul in\n let b3'' = b3' <<^ 24ul in\n cut (v b1'' = pow2 8 * U8.v b1 /\\ v b2'' = pow2 16 * U8.v b2 /\\ v b3'' = pow2 24 * U8.v b3);\n lemma_uint32_of_bytes b0' b1' b2' b3';\n b0' +^ b1'' +^ b2'' +^ b3''\n\n#reset-options \"--z3rlimit 20\"\n\n(** Stores the content of a byte buffer into a unsigned int32 buffer *)\n(* TODO: add functional spec *)\nval bytes_of_uint32s: output:bytes -> m:uint32s{disjoint output m} -> len:u32{v len <=length output /\\ v len<=op_Multiply 4 (length m)} -> STL unit\n (requires (fun h -> live h output /\\ live h m))\n (ensures (fun h0 _ h1 -> live h0 output /\\ live h0 m /\\ live h1 output /\\ live h1 m\n /\\ modifies_1 output h0 h1 ))\nlet rec bytes_of_uint32s output m l =\n if l >^ 0ul then\n begin\n let rem = l %^ 4ul in\n if UInt32.gt rem 0ul then\n begin\n let l = l -^ rem in\n let x = index m (l /^ 4ul) in\n let b0 = uint32_to_uint8 (x &^ 255ul) in\n output.(l) <- b0;\n if UInt32.gt rem 1ul then\n begin\n let b1 = uint32_to_uint8 ((x >>^ 8ul) &^ 255ul) in\n output.(l +^ 1ul) <- b1;\n\tif UInt32.gt rem 2ul then\n\t begin\n\t let b2 = uint32_to_uint8 ((x >>^ 16ul) &^ 255ul) in\n\t output.(l +^ 2ul) <- b2\n end\n\telse ()\n\tend\n else ();\n bytes_of_uint32s output m l\n end\n else\n begin\n let l = l -^ 4ul in\n let x = index m (l /^ 4ul) in\n let b0 = uint32_to_uint8 (x &^ 255ul) in\n let b1 = uint32_to_uint8 ((x >>^ 8ul) &^ 255ul) in\n let b2 = uint32_to_uint8 ((x >>^ 16ul) &^ 255ul) in\n let b3 = uint32_to_uint8 ((x >>^ 24ul) &^ 255ul) in\n output.(l) <- b0;\n output.(l +^ 1ul) <- b1;\n output.(l +^ 2ul) <- b2;\n output.(l +^ 3ul) <- b3;\n bytes_of_uint32s output m l\n end\n end\n\n(** Stores the content of a byte buffer into a unsigned int32 buffer *)\nval bytes_of_uint32: output:bytes{length output >= 4} -> m:u32 -> STL unit\n (requires (fun h -> live h output))\n (ensures (fun h0 _ h1 -> live h1 output\n /\\ modifies_1 output h0 h1\n /\\ U8.v (get h1 output 0) = (U32.v m) % pow2 8\n /\\ U8.v (get h1 output 1) = (U32.v m / pow2 8) % pow2 8\n /\\ U8.v (get h1 output 2) = (U32.v m / pow2 16) % pow2 8", "dependencies": { "source_file": "Buffer.Utils.fst", "checked_file": "Buffer.Utils.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.All.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Buffer.fst.checked", "C.Compat.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.All" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 20, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "output: Buffer.Utils.bytes{FStar.Buffer.length output >= 4} -> m: Buffer.Utils.u32\n -> FStar.HyperStack.ST.STL Prims.unit", "effect": "FStar.HyperStack.ST.STL", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Buffer.Utils.bytes", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "FStar.Buffer.length", "Buffer.Utils.u8", "Buffer.Utils.u32", "FStar.Buffer.op_Array_Assignment", "FStar.UInt32.__uint_to_t", "Prims.unit", "FStar.UInt8.t", "Prims.op_Equality", "Prims.int", "FStar.UInt8.v", "Prims.op_Modulus", "FStar.UInt32.v", "FStar.UInt32.shift_right", "FStar.UInt32.uint_to_t", "FStar.UInt32.t", "Prims.pow2", "FStar.Int.Cast.uint32_to_uint8", "FStar.UInt32.op_Greater_Greater_Hat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val bytes_of_uint32: output:bytes{length output >= 4} -> m:u32 -> STL unit\n (requires (fun h -> live h output))\n (ensures (fun h0 _ h1 -> live h1 output\n /\\ modifies_1 output h0 h1\n /\\ U8.v (get h1 output 0) = (U32.v m) % pow2 8\n /\\ U8.v (get h1 output 1) = (U32.v m / pow2 8) % pow2 8\n /\\ U8.v (get h1 output 2) = (U32.v m / pow2 16) % pow2 8\n /\\ U8.v (get h1 output 3) = (U32.v m / pow2 24) % pow2 8 ))\nlet bytes_of_uint32 output x =", "completed_definiton": "let b0 = uint32_to_uint8 (x) in\nlet b1 = uint32_to_uint8 ((x >>^ 8ul)) in\nlet b2 = uint32_to_uint8 ((x >>^ 16ul)) in\nlet b3 = uint32_to_uint8 ((x >>^ 24ul)) in\noutput.(0ul) <- b0;\noutput.(1ul) <- b1;\noutput.(2ul) <- b2;\noutput.(3ul) <- b3", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroupList.fsti", "name": "Parsers.NamedGroupList.min_count", "original_source_type": "", "source_type": "val min_count : Prims.int", "source_definition": "let min_count = 1", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroupList.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 22, "start_col": 48, "end_line": 22, "end_col": 49 }, "file_context": "module Parsers.NamedGroupList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.NamedGroup", "dependencies": { "source_file": "Parsers.NamedGroupList.fsti", "checked_file": "Parsers.NamedGroupList.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.NamedGroup.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.int", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let min_count =", "completed_definiton": "1", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroupList.fsti", "name": "Parsers.NamedGroupList.max_count", "original_source_type": "", "source_type": "val max_count : Prims.int", "source_definition": "let max_count = 32767", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroupList.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 23, "start_col": 48, "end_line": 23, "end_col": 53 }, "file_context": "module Parsers.NamedGroupList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.NamedGroup", "dependencies": { "source_file": "Parsers.NamedGroupList.fsti", "checked_file": "Parsers.NamedGroupList.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.NamedGroup.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.int", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let max_count =", "completed_definiton": "32767", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroupList.fsti", "name": "Parsers.NamedGroupList.namedGroupList_parser_kind", "original_source_type": "", "source_type": "val namedGroupList_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let namedGroupList_parser_kind = LP.strong_parser_kind 4 65537 None", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroupList.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 26, "start_col": 65, "end_line": 26, "end_col": 99 }, "file_context": "module Parsers.NamedGroupList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.NamedGroup\n\ninline_for_extraction noextract let min_count = 1\ninline_for_extraction noextract let max_count = 32767\ntype namedGroupList = l:list namedGroup{1 <= L.length l /\\ L.length l <= 32767}", "dependencies": { "source_file": "Parsers.NamedGroupList.fsti", "checked_file": "Parsers.NamedGroupList.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.NamedGroup.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let namedGroupList_parser_kind =", "completed_definiton": "LP.strong_parser_kind 4 65537 None", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroupList.fsti", "name": "Parsers.NamedGroupList.namedGroupList_clens_nth", "original_source_type": "val namedGroupList_clens_nth (i: nat) : Tot (LL.clens namedGroupList namedGroup)", "source_type": "val namedGroupList_clens_nth (i: nat) : Tot (LL.clens namedGroupList namedGroup)", "source_definition": "let namedGroupList_clens_nth (i: nat) : Tot (LL.clens namedGroupList namedGroup) = {\n LL.clens_cond = (fun (l: namedGroupList) -> i < L.length l);\n LL.clens_get = (fun (l: namedGroupList) -> L.index l i);\n}", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroupList.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 74, "start_col": 2, "end_line": 75, "end_col": 58 }, "file_context": "module Parsers.NamedGroupList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.NamedGroup\n\ninline_for_extraction noextract let min_count = 1\ninline_for_extraction noextract let max_count = 32767\ntype namedGroupList = l:list namedGroup{1 <= L.length l /\\ L.length l <= 32767}\n\ninline_for_extraction noextract let namedGroupList_parser_kind = LP.strong_parser_kind 4 65537 None\n\nnoextract val namedGroupList_parser: LP.parser namedGroupList_parser_kind namedGroupList\n\nnoextract val namedGroupList_serializer: LP.serializer namedGroupList_parser\n\nnoextract val namedGroupList_bytesize (x:namedGroupList) : GTot nat\n\nnoextract val namedGroupList_bytesize_eq (x:namedGroupList) : Lemma (namedGroupList_bytesize x == Seq.length (LP.serialize namedGroupList_serializer x))\n\nval namedGroupList_parser32: LS.parser32 namedGroupList_parser\n\nval namedGroupList_serializer32: LS.serializer32 namedGroupList_serializer\n\nval namedGroupList_size32: LSZ.size32 namedGroupList_serializer\n\nval namedGroupList_validator: LL.validator namedGroupList_parser\n\nval namedGroupList_jumper: LL.jumper namedGroupList_parser\n\ninline_for_extraction val finalize_namedGroupList (#rrel: _) (#rel: _) (sl: LL.slice rrel rel) (pos pos' : U32.t) : HST.Stack unit\n(requires (fun h ->\n U32.v pos + 2 < 4294967296 /\\\n LL.writable sl.LL.base (U32.v pos) (U32.v pos + 2) h /\\\n LL.valid_list namedGroup_parser h sl (pos `U32.add` 2ul) pos' /\\ (\n let count = L.length (LL.contents_list namedGroup_parser h sl (pos `U32.add` 2ul) pos') in\n let len = U32.v pos' - (U32.v pos + 2) in\n ((2 <= len /\\ len <= 65535) \\/ (1 <= count /\\ count <= 32767))\n)))\n(ensures (fun h _ h' ->\n B.modifies (LL.loc_slice_from_to sl pos (pos `U32.add` 2ul)) h h' /\\ (\n let l = LL.contents_list namedGroup_parser h sl (pos `U32.add` 2ul) pos' in\n 1 <= L.length l /\\ L.length l <= 32767 /\\\n LL.valid_content_pos namedGroupList_parser h' sl pos l pos'\n)))\n\nval namedGroupList_count (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid namedGroupList_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents namedGroupList_parser h input pos in\n let pos' = LL.get_valid_pos namedGroupList_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v res == L.length x /\\\n U32.v pos' == U32.v pos + 2 + (U32.v res `FStar.Mul.op_Star` 2) /\\\n LL.valid_list namedGroup_parser h input (pos `U32.add` 2ul) pos' /\\\n LL.contents_list namedGroup_parser h input (pos `U32.add` 2ul) pos' == x\n ))", "dependencies": { "source_file": "Parsers.NamedGroupList.fsti", "checked_file": "Parsers.NamedGroupList.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.NamedGroup.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: Prims.nat\n -> LowParse.Low.Base.Spec.clens Parsers.NamedGroupList.namedGroupList\n Parsers.NamedGroup.namedGroup", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "LowParse.Low.Base.Spec.Mkclens", "Parsers.NamedGroupList.namedGroupList", "Parsers.NamedGroup.namedGroup", "Prims.b2t", "Prims.op_LessThan", "FStar.List.Tot.Base.length", "FStar.List.Tot.Base.index", "LowParse.Low.Base.Spec.clens" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroupList_clens_nth (i: nat) : Tot (LL.clens namedGroupList namedGroup)\nlet namedGroupList_clens_nth (i: nat) : Tot (LL.clens namedGroupList namedGroup) =", "completed_definiton": "{\n LL.clens_cond = (fun (l: namedGroupList) -> i < L.length l);\n LL.clens_get = (fun (l: namedGroupList) -> L.index l i)\n}", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_rms.fsti", "name": "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "original_source_type": "", "source_type": "val ticketContents13_rms_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let ticketContents13_rms_parser_kind = LP.strong_parser_kind 33 256 None", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_rms.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 25, "start_col": 71, "end_line": 25, "end_col": 104 }, "file_context": "module Parsers.TicketContents13_rms\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ninline_for_extraction noextract let min_len = 32\ninline_for_extraction noextract let max_len = 255\ntype ticketContents13_rms = b:bytes{32 <= length b /\\ length b <= 255}", "dependencies": { "source_file": "Parsers.TicketContents13_rms.fsti", "checked_file": "Parsers.TicketContents13_rms.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let ticketContents13_rms_parser_kind =", "completed_definiton": "LP.strong_parser_kind 33 256 None", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_rms.fsti", "name": "Parsers.TicketContents13_rms.min_len", "original_source_type": "", "source_type": "val min_len : Prims.int", "source_definition": "let min_len = 32", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_rms.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 21, "start_col": 46, "end_line": 21, "end_col": 48 }, "file_context": "module Parsers.TicketContents13_rms\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST", "dependencies": { "source_file": "Parsers.TicketContents13_rms.fsti", "checked_file": "Parsers.TicketContents13_rms.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.int", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let min_len =", "completed_definiton": "32", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_rms.fsti", "name": "Parsers.TicketContents13_rms.max_len", "original_source_type": "", "source_type": "val max_len : Prims.int", "source_definition": "let max_len = 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_rms.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 22, "start_col": 46, "end_line": 22, "end_col": 49 }, "file_context": "module Parsers.TicketContents13_rms\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST", "dependencies": { "source_file": "Parsers.TicketContents13_rms.fsti", "checked_file": "Parsers.TicketContents13_rms.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.int", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let max_len =", "completed_definiton": "255", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.ticketVersion_repr_jumper", "original_source_type": "", "source_type": "val ticketVersion_repr_jumper : LowParse.Low.Base.jumper LowParse.Spec.Int.parse_u8", "source_definition": "let ticketVersion_repr_jumper = LL.jump_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 47, "start_col": 64, "end_line": 47, "end_col": 74 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.jump_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let ticketVersion_repr_jumper =", "completed_definiton": "LL.jump_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.ticketVersion_repr_parser", "original_source_type": "", "source_type": "val ticketVersion_repr_parser : LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u8_kind FStar.UInt8.t", "source_definition": "let ticketVersion_repr_parser = LPI.parse_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 35, "start_col": 42, "end_line": 35, "end_col": 54 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u8_kind FStar.UInt8.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Int.parse_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let ticketVersion_repr_parser =", "completed_definiton": "LPI.parse_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.ticketVersion_repr_serializer32", "original_source_type": "", "source_type": "val ticketVersion_repr_serializer32 : LowParse.SLow.Base.serializer32 LowParse.Spec.Int.serialize_u8", "source_definition": "let ticketVersion_repr_serializer32 = LS.serialize32_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 41, "start_col": 70, "end_line": 41, "end_col": 87 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 LowParse.Spec.Int.serialize_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.serialize32_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let ticketVersion_repr_serializer32 =", "completed_definiton": "LS.serialize32_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.ticketVersion_repr_serializer", "original_source_type": "", "source_type": "val ticketVersion_repr_serializer : LowParse.Spec.Base.serializer LowParse.Spec.Int.parse_u8", "source_definition": "let ticketVersion_repr_serializer = LPI.serialize_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 37, "start_col": 46, "end_line": 37, "end_col": 62 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Int.serialize_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let ticketVersion_repr_serializer =", "completed_definiton": "LPI.serialize_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.ticketVersion_repr_writer", "original_source_type": "", "source_type": "val ticketVersion_repr_writer : LowParse.Low.Base.leaf_writer_strong LowParse.Spec.Int.serialize_u8", "source_definition": "let ticketVersion_repr_writer = LL.write_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 51, "start_col": 64, "end_line": 51, "end_col": 75 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let ticketVersion_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let ticketVersion_repr_reader = LL.read_u8", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong LowParse.Spec.Int.serialize_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.write_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let ticketVersion_repr_writer =", "completed_definiton": "LL.write_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.ticketVersion_repr_reader", "original_source_type": "", "source_type": "val ticketVersion_repr_reader : LowParse.Low.Base.leaf_reader LowParse.Spec.Int.parse_u8", "source_definition": "let ticketVersion_repr_reader = LL.read_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 49, "start_col": 64, "end_line": 49, "end_col": 74 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let ticketVersion_repr_jumper = LL.jump_u8", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.read_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let ticketVersion_repr_reader =", "completed_definiton": "LL.read_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.ticketVersion_repr_parser32", "original_source_type": "", "source_type": "val ticketVersion_repr_parser32 : LowParse.SLow.Base.parser32 LowParse.Spec.Int.parse_u8", "source_definition": "let ticketVersion_repr_parser32 = LS.parse32_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 39, "start_col": 66, "end_line": 39, "end_col": 79 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.parse32_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let ticketVersion_repr_parser32 =", "completed_definiton": "LS.parse32_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.ticketVersion_bytesize", "original_source_type": "val ticketVersion_bytesize (x:ticketVersion) : GTot nat", "source_type": "val ticketVersion_bytesize (x:ticketVersion) : GTot nat", "source_definition": "let ticketVersion_bytesize (x:ticketVersion) : GTot nat = Seq.length (ticketVersion_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 82, "start_col": 58, "end_line": 82, "end_col": 97 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let ticketVersion_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let ticketVersion_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let ticketVersion_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion = x\n\ninline_for_extraction let synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst ticketVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_ticketVersion_inj () : Lemma\n (LP.synth_injective synth_ticketVersion) = ()\n\nlet lemma_synth_ticketVersion_inv () : Lemma\n (LP.synth_inverse synth_ticketVersion synth_ticketVersion_inv) = ()\n\nnoextract let parse_ticketVersion_key : LP.parser _ (LP.enum_key ticketVersion_enum) =\n LP.parse_enum_key ticketVersion_repr_parser ticketVersion_enum\n\nnoextract let serialize_ticketVersion_key : LP.serializer parse_ticketVersion_key =\n LP.serialize_enum_key ticketVersion_repr_parser ticketVersion_repr_serializer ticketVersion_enum\n\nnoextract let ticketVersion_parser : LP.parser _ ticketVersion =\n lemma_synth_ticketVersion_inj ();\n parse_ticketVersion_key `LP.parse_synth` synth_ticketVersion\n\nnoextract let ticketVersion_serializer : LP.serializer ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LP.serialize_synth _ synth_ticketVersion serialize_ticketVersion_key synth_ticketVersion_inv ()", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketVersion.ticketVersion -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketVersion.ticketVersion", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.TicketVersion.ticketVersion_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketVersion_bytesize (x:ticketVersion) : GTot nat\nlet ticketVersion_bytesize (x: ticketVersion) : GTot nat =", "completed_definiton": "Seq.length (ticketVersion_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.ticketVersion_repr_size32", "original_source_type": "", "source_type": "val ticketVersion_repr_size32 : LowParse.SLow.Base.size32 LowParse.Spec.Int.serialize_u8", "source_definition": "let ticketVersion_repr_size32 = LSZ.size32_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 43, "start_col": 64, "end_line": 43, "end_col": 77 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 LowParse.Spec.Int.serialize_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.size32_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let ticketVersion_repr_size32 =", "completed_definiton": "LSZ.size32_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.ticketVersion_repr_validator", "original_source_type": "", "source_type": "val ticketVersion_repr_validator : LowParse.Low.Base.validator LowParse.Spec.Int.parse_u8", "source_definition": "let ticketVersion_repr_validator = (LL.validate_u8 ())", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 45, "start_col": 67, "end_line": 45, "end_col": 86 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.validate_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let ticketVersion_repr_validator =", "completed_definiton": "(LL.validate_u8 ())", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.synth_ticketVersion", "original_source_type": "val synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion", "source_type": "val synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion", "source_definition": "let synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion = x", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 53, "start_col": 104, "end_line": 53, "end_col": 105 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let ticketVersion_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let ticketVersion_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let ticketVersion_repr_writer = LL.write_u8", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: LowParse.Spec.Enum.enum_key Parsers.TicketVersion.ticketVersion_enum\n -> Parsers.TicketVersion.ticketVersion", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.enum_key", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_enum" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion\nlet synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion =", "completed_definiton": "x", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.ticketVersion_enum", "original_source_type": "val ticketVersion_enum:LP.enum ticketVersion U8.t", "source_type": "val ticketVersion_enum:LP.enum ticketVersion U8.t", "source_definition": "let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 24, "start_col": 2, "end_line": 33, "end_col": 6 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Enum.enum Parsers.TicketVersion.ticketVersion FStar.UInt8.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.b2t", "FStar.List.Tot.Base.noRepeats", "FStar.UInt8.t", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "Parsers.TicketVersion.ticketVersion", "FStar.Pervasives.Native.snd", "FStar.Pervasives.Native.fst", "Prims.list", "Prims.Cons", "FStar.Pervasives.Native.Mktuple2", "Parsers.TicketVersion.Ticket12", "FStar.UInt8.__uint_to_t", "Parsers.TicketVersion.Ticket13", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketVersion_enum:LP.enum ticketVersion U8.t\nlet ticketVersion_enum:LP.enum ticketVersion U8.t =", "completed_definiton": "[@@ inline_let ]let e = [Ticket12, 0uy; Ticket13, 1uy] in\n[@@ inline_let ]let _ = assert_norm (L.noRepeats (LP.list_map fst e)) in\n[@@ inline_let ]let _ = assert_norm (L.noRepeats (LP.list_map snd e)) in\ne", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.validate_ticketVersion_key", "original_source_type": "val validate_ticketVersion_key:LL.validator parse_ticketVersion_key", "source_type": "val validate_ticketVersion_key:LL.validator parse_ticketVersion_key", "source_definition": "let validate_ticketVersion_key : LL.validator parse_ticketVersion_key =\n LL.mk_validate_enum_key ticketVersion_repr_validator ticketVersion_repr_reader ticketVersion_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 108, "start_col": 4, "end_line": 108, "end_col": 101 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let ticketVersion_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let ticketVersion_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let ticketVersion_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion = x\n\ninline_for_extraction let synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst ticketVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_ticketVersion_inj () : Lemma\n (LP.synth_injective synth_ticketVersion) = ()\n\nlet lemma_synth_ticketVersion_inv () : Lemma\n (LP.synth_inverse synth_ticketVersion synth_ticketVersion_inv) = ()\n\nnoextract let parse_ticketVersion_key : LP.parser _ (LP.enum_key ticketVersion_enum) =\n LP.parse_enum_key ticketVersion_repr_parser ticketVersion_enum\n\nnoextract let serialize_ticketVersion_key : LP.serializer parse_ticketVersion_key =\n LP.serialize_enum_key ticketVersion_repr_parser ticketVersion_repr_serializer ticketVersion_enum\n\nnoextract let ticketVersion_parser : LP.parser _ ticketVersion =\n lemma_synth_ticketVersion_inj ();\n parse_ticketVersion_key `LP.parse_synth` synth_ticketVersion\n\nnoextract let ticketVersion_serializer : LP.serializer ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LP.serialize_synth _ synth_ticketVersion serialize_ticketVersion_key synth_ticketVersion_inv ()\n\nlet ticketVersion_bytesize (x:ticketVersion) : GTot nat = Seq.length (ticketVersion_serializer x)\n\nlet ticketVersion_bytesize_eq x = ()\n\nlet parse32_ticketVersion_key : LS.parser32 parse_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac ticketVersion_repr_parser32 ticketVersion_enum)\n\nlet ticketVersion_parser32 : LS.parser32 ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n LS.parse32_synth _ synth_ticketVersion (fun x->synth_ticketVersion x) parse32_ticketVersion_key ()\n\nlet serialize32_ticketVersion_key : LS.serializer32 serialize_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n ticketVersion_repr_serializer32 ticketVersion_enum)\n\nlet ticketVersion_serializer32 : LS.serializer32 ticketVersion_serializer =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LS.serialize32_synth _ synth_ticketVersion _ serialize32_ticketVersion_key synth_ticketVersion_inv (fun x->synth_ticketVersion_inv x) ()\n\nlet ticketVersion_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond ticketVersion_serializer 1ul) in\n LSZ.size32_constant ticketVersion_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.TicketVersion.parse_ticketVersion_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.validate_enum_key", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "Parsers.TicketVersion.ticketVersion_repr_validator", "Parsers.TicketVersion.ticketVersion_repr_reader", "Prims.Cons", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.Mktuple2", "Parsers.TicketVersion.Ticket12", "FStar.UInt8.__uint_to_t", "Parsers.TicketVersion.Ticket13", "Prims.Nil", "LowParse.Spec.Enum.maybe_enum_destr_t_intro", "Prims.bool", "LowParse.Spec.Enum.maybe_enum_destr_cons", "LowParse.Spec.Enum.maybe_enum_destr_nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val validate_ticketVersion_key:LL.validator parse_ticketVersion_key\nlet validate_ticketVersion_key:LL.validator parse_ticketVersion_key =", "completed_definiton": "LL.mk_validate_enum_key ticketVersion_repr_validator ticketVersion_repr_reader ticketVersion_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.serialize_ticketVersion_key", "original_source_type": "val serialize_ticketVersion_key:LP.serializer parse_ticketVersion_key", "source_type": "val serialize_ticketVersion_key:LP.serializer parse_ticketVersion_key", "source_definition": "let serialize_ticketVersion_key : LP.serializer parse_ticketVersion_key =\n LP.serialize_enum_key ticketVersion_repr_parser ticketVersion_repr_serializer ticketVersion_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 71, "start_col": 2, "end_line": 71, "end_col": 98 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let ticketVersion_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let ticketVersion_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let ticketVersion_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion = x\n\ninline_for_extraction let synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst ticketVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_ticketVersion_inj () : Lemma\n (LP.synth_injective synth_ticketVersion) = ()\n\nlet lemma_synth_ticketVersion_inv () : Lemma\n (LP.synth_inverse synth_ticketVersion synth_ticketVersion_inv) = ()\n\nnoextract let parse_ticketVersion_key : LP.parser _ (LP.enum_key ticketVersion_enum) =\n LP.parse_enum_key ticketVersion_repr_parser ticketVersion_enum", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.TicketVersion.parse_ticketVersion_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.serialize_enum_key", "LowParse.Spec.Int.parse_u8_kind", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_repr_parser", "Parsers.TicketVersion.ticketVersion_repr_serializer", "Parsers.TicketVersion.ticketVersion_enum" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_ticketVersion_key:LP.serializer parse_ticketVersion_key\nlet serialize_ticketVersion_key:LP.serializer parse_ticketVersion_key =", "completed_definiton": "LP.serialize_enum_key ticketVersion_repr_parser ticketVersion_repr_serializer ticketVersion_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.write_ticketVersion_key", "original_source_type": "val write_ticketVersion_key:LL.leaf_writer_strong serialize_ticketVersion_key", "source_type": "val write_ticketVersion_key:LL.leaf_writer_strong serialize_ticketVersion_key", "source_definition": "let write_ticketVersion_key : LL.leaf_writer_strong serialize_ticketVersion_key =\n LL.write_enum_key ticketVersion_repr_writer ticketVersion_enum (_ by (LP.enum_repr_of_key_tac ticketVersion_enum))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 123, "start_col": 2, "end_line": 123, "end_col": 116 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let ticketVersion_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let ticketVersion_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let ticketVersion_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion = x\n\ninline_for_extraction let synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst ticketVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_ticketVersion_inj () : Lemma\n (LP.synth_injective synth_ticketVersion) = ()\n\nlet lemma_synth_ticketVersion_inv () : Lemma\n (LP.synth_inverse synth_ticketVersion synth_ticketVersion_inv) = ()\n\nnoextract let parse_ticketVersion_key : LP.parser _ (LP.enum_key ticketVersion_enum) =\n LP.parse_enum_key ticketVersion_repr_parser ticketVersion_enum\n\nnoextract let serialize_ticketVersion_key : LP.serializer parse_ticketVersion_key =\n LP.serialize_enum_key ticketVersion_repr_parser ticketVersion_repr_serializer ticketVersion_enum\n\nnoextract let ticketVersion_parser : LP.parser _ ticketVersion =\n lemma_synth_ticketVersion_inj ();\n parse_ticketVersion_key `LP.parse_synth` synth_ticketVersion\n\nnoextract let ticketVersion_serializer : LP.serializer ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LP.serialize_synth _ synth_ticketVersion serialize_ticketVersion_key synth_ticketVersion_inv ()\n\nlet ticketVersion_bytesize (x:ticketVersion) : GTot nat = Seq.length (ticketVersion_serializer x)\n\nlet ticketVersion_bytesize_eq x = ()\n\nlet parse32_ticketVersion_key : LS.parser32 parse_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac ticketVersion_repr_parser32 ticketVersion_enum)\n\nlet ticketVersion_parser32 : LS.parser32 ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n LS.parse32_synth _ synth_ticketVersion (fun x->synth_ticketVersion x) parse32_ticketVersion_key ()\n\nlet serialize32_ticketVersion_key : LS.serializer32 serialize_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n ticketVersion_repr_serializer32 ticketVersion_enum)\n\nlet ticketVersion_serializer32 : LS.serializer32 ticketVersion_serializer =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LS.serialize32_synth _ synth_ticketVersion _ serialize32_ticketVersion_key synth_ticketVersion_inv (fun x->synth_ticketVersion_inv x) ()\n\nlet ticketVersion_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond ticketVersion_serializer 1ul) in\n LSZ.size32_constant ticketVersion_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_ticketVersion_key : LL.validator parse_ticketVersion_key =\n LL.mk_validate_enum_key ticketVersion_repr_validator ticketVersion_repr_reader ticketVersion_enum\n\nlet ticketVersion_validator =\n lemma_synth_ticketVersion_inj ();\n LL.validate_synth validate_ticketVersion_key synth_ticketVersion ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_ticketVersion_key : LL.leaf_reader parse_ticketVersion_key =\n LL.mk_read_enum_key ticketVersion_repr_reader ticketVersion_enum\n\nlet ticketVersion_reader =\n [@inline_let] let _ = lemma_synth_ticketVersion_inj () in\n LL.read_synth' parse_ticketVersion_key synth_ticketVersion read_ticketVersion_key ()", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong Parsers.TicketVersion.serialize_ticketVersion_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.write_enum_key", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "Parsers.TicketVersion.ticketVersion_repr_writer", "Parsers.TicketVersion.ticketVersion_enum", "LowParse.Spec.Enum.enum_repr_of_key_cons'", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'", "LowParse.Spec.Enum.enum_tail'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val write_ticketVersion_key:LL.leaf_writer_strong serialize_ticketVersion_key\nlet write_ticketVersion_key:LL.leaf_writer_strong serialize_ticketVersion_key =", "completed_definiton": "LL.write_enum_key ticketVersion_repr_writer\n ticketVersion_enum\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.enum_repr_of_key_tac ticketVersion_enum)))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.parse32_ticketVersion_key", "original_source_type": "val parse32_ticketVersion_key:LS.parser32 parse_ticketVersion_key", "source_type": "val parse32_ticketVersion_key:LS.parser32 parse_ticketVersion_key", "source_definition": "let parse32_ticketVersion_key : LS.parser32 parse_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac ticketVersion_repr_parser32 ticketVersion_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 87, "start_col": 2, "end_line": 87, "end_col": 104 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let ticketVersion_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let ticketVersion_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let ticketVersion_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion = x\n\ninline_for_extraction let synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst ticketVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_ticketVersion_inj () : Lemma\n (LP.synth_injective synth_ticketVersion) = ()\n\nlet lemma_synth_ticketVersion_inv () : Lemma\n (LP.synth_inverse synth_ticketVersion synth_ticketVersion_inv) = ()\n\nnoextract let parse_ticketVersion_key : LP.parser _ (LP.enum_key ticketVersion_enum) =\n LP.parse_enum_key ticketVersion_repr_parser ticketVersion_enum\n\nnoextract let serialize_ticketVersion_key : LP.serializer parse_ticketVersion_key =\n LP.serialize_enum_key ticketVersion_repr_parser ticketVersion_repr_serializer ticketVersion_enum\n\nnoextract let ticketVersion_parser : LP.parser _ ticketVersion =\n lemma_synth_ticketVersion_inj ();\n parse_ticketVersion_key `LP.parse_synth` synth_ticketVersion\n\nnoextract let ticketVersion_serializer : LP.serializer ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LP.serialize_synth _ synth_ticketVersion serialize_ticketVersion_key synth_ticketVersion_inv ()\n\nlet ticketVersion_bytesize (x:ticketVersion) : GTot nat = Seq.length (ticketVersion_serializer x)\n\nlet ticketVersion_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.TicketVersion.parse_ticketVersion_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Enum.parse32_enum_key_gen", "LowParse.Spec.Int.parse_u8_kind", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "Parsers.TicketVersion.ticketVersion_enum", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Enum.enum_key", "Parsers.TicketVersion.parse_ticketVersion_key", "LowParse.SLow.Enum.parse32_maybe_enum_key_gen", "Parsers.TicketVersion.ticketVersion_repr_parser32", "LowParse.Spec.Enum.maybe_enum_key", "LowParse.Spec.Enum.parse_maybe_enum_key", "LowParse.Spec.Enum.maybe_enum_key_of_repr'_t_cons'", "LowParse.Spec.Enum.maybe_enum_key_of_repr'_t_cons_nil'", "LowParse.Spec.Enum.enum_tail'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse32_ticketVersion_key:LS.parser32 parse_ticketVersion_key\nlet parse32_ticketVersion_key:LS.parser32 parse_ticketVersion_key =", "completed_definiton": "FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac ticketVersion_repr_parser32\n ticketVersion_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.ticketVersion_size32", "original_source_type": "val ticketVersion_size32: LSZ.size32 ticketVersion_serializer", "source_type": "val ticketVersion_size32: LSZ.size32 ticketVersion_serializer", "source_definition": "let ticketVersion_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond ticketVersion_serializer 1ul) in\n LSZ.size32_constant ticketVersion_serializer 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 103, "start_col": 2, "end_line": 104, "end_col": 53 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let ticketVersion_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let ticketVersion_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let ticketVersion_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion = x\n\ninline_for_extraction let synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst ticketVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_ticketVersion_inj () : Lemma\n (LP.synth_injective synth_ticketVersion) = ()\n\nlet lemma_synth_ticketVersion_inv () : Lemma\n (LP.synth_inverse synth_ticketVersion synth_ticketVersion_inv) = ()\n\nnoextract let parse_ticketVersion_key : LP.parser _ (LP.enum_key ticketVersion_enum) =\n LP.parse_enum_key ticketVersion_repr_parser ticketVersion_enum\n\nnoextract let serialize_ticketVersion_key : LP.serializer parse_ticketVersion_key =\n LP.serialize_enum_key ticketVersion_repr_parser ticketVersion_repr_serializer ticketVersion_enum\n\nnoextract let ticketVersion_parser : LP.parser _ ticketVersion =\n lemma_synth_ticketVersion_inj ();\n parse_ticketVersion_key `LP.parse_synth` synth_ticketVersion\n\nnoextract let ticketVersion_serializer : LP.serializer ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LP.serialize_synth _ synth_ticketVersion serialize_ticketVersion_key synth_ticketVersion_inv ()\n\nlet ticketVersion_bytesize (x:ticketVersion) : GTot nat = Seq.length (ticketVersion_serializer x)\n\nlet ticketVersion_bytesize_eq x = ()\n\nlet parse32_ticketVersion_key : LS.parser32 parse_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac ticketVersion_repr_parser32 ticketVersion_enum)\n\nlet ticketVersion_parser32 : LS.parser32 ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n LS.parse32_synth _ synth_ticketVersion (fun x->synth_ticketVersion x) parse32_ticketVersion_key ()\n\nlet serialize32_ticketVersion_key : LS.serializer32 serialize_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n ticketVersion_repr_serializer32 ticketVersion_enum)\n\nlet ticketVersion_serializer32 : LS.serializer32 ticketVersion_serializer =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LS.serialize32_synth _ synth_ticketVersion _ serialize32_ticketVersion_key synth_ticketVersion_inv (fun x->synth_ticketVersion_inv x) ()", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.TicketVersion.ticketVersion_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Base.size32_constant", "Parsers.TicketVersion.ticketVersion_parser_kind", "Parsers.TicketVersion.ticketVersion", "Parsers.TicketVersion.ticketVersion_parser", "Parsers.TicketVersion.ticketVersion_serializer", "FStar.UInt32.__uint_to_t", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.SLow.Base.size32_constant_precond" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketVersion_size32: LSZ.size32 ticketVersion_serializer\nlet ticketVersion_size32 =", "completed_definiton": "[@@ inline_let ]let _ = assert_norm (LSZ.size32_constant_precond ticketVersion_serializer 1ul) in\nLSZ.size32_constant ticketVersion_serializer 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.lserialize_ticketVersion_key", "original_source_type": "val lserialize_ticketVersion_key:LL.serializer32 serialize_ticketVersion_key", "source_type": "val lserialize_ticketVersion_key:LL.serializer32 serialize_ticketVersion_key", "source_definition": "let lserialize_ticketVersion_key : LL.serializer32 serialize_ticketVersion_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_ticketVersion_key 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 126, "start_col": 2, "end_line": 126, "end_col": 84 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let ticketVersion_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let ticketVersion_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let ticketVersion_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion = x\n\ninline_for_extraction let synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst ticketVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_ticketVersion_inj () : Lemma\n (LP.synth_injective synth_ticketVersion) = ()\n\nlet lemma_synth_ticketVersion_inv () : Lemma\n (LP.synth_inverse synth_ticketVersion synth_ticketVersion_inv) = ()\n\nnoextract let parse_ticketVersion_key : LP.parser _ (LP.enum_key ticketVersion_enum) =\n LP.parse_enum_key ticketVersion_repr_parser ticketVersion_enum\n\nnoextract let serialize_ticketVersion_key : LP.serializer parse_ticketVersion_key =\n LP.serialize_enum_key ticketVersion_repr_parser ticketVersion_repr_serializer ticketVersion_enum\n\nnoextract let ticketVersion_parser : LP.parser _ ticketVersion =\n lemma_synth_ticketVersion_inj ();\n parse_ticketVersion_key `LP.parse_synth` synth_ticketVersion\n\nnoextract let ticketVersion_serializer : LP.serializer ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LP.serialize_synth _ synth_ticketVersion serialize_ticketVersion_key synth_ticketVersion_inv ()\n\nlet ticketVersion_bytesize (x:ticketVersion) : GTot nat = Seq.length (ticketVersion_serializer x)\n\nlet ticketVersion_bytesize_eq x = ()\n\nlet parse32_ticketVersion_key : LS.parser32 parse_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac ticketVersion_repr_parser32 ticketVersion_enum)\n\nlet ticketVersion_parser32 : LS.parser32 ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n LS.parse32_synth _ synth_ticketVersion (fun x->synth_ticketVersion x) parse32_ticketVersion_key ()\n\nlet serialize32_ticketVersion_key : LS.serializer32 serialize_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n ticketVersion_repr_serializer32 ticketVersion_enum)\n\nlet ticketVersion_serializer32 : LS.serializer32 ticketVersion_serializer =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LS.serialize32_synth _ synth_ticketVersion _ serialize32_ticketVersion_key synth_ticketVersion_inv (fun x->synth_ticketVersion_inv x) ()\n\nlet ticketVersion_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond ticketVersion_serializer 1ul) in\n LSZ.size32_constant ticketVersion_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_ticketVersion_key : LL.validator parse_ticketVersion_key =\n LL.mk_validate_enum_key ticketVersion_repr_validator ticketVersion_repr_reader ticketVersion_enum\n\nlet ticketVersion_validator =\n lemma_synth_ticketVersion_inj ();\n LL.validate_synth validate_ticketVersion_key synth_ticketVersion ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_ticketVersion_key : LL.leaf_reader parse_ticketVersion_key =\n LL.mk_read_enum_key ticketVersion_repr_reader ticketVersion_enum\n\nlet ticketVersion_reader =\n [@inline_let] let _ = lemma_synth_ticketVersion_inj () in\n LL.read_synth' parse_ticketVersion_key synth_ticketVersion read_ticketVersion_key ()\n\ninline_for_extraction let write_ticketVersion_key : LL.leaf_writer_strong serialize_ticketVersion_key =\n LL.write_enum_key ticketVersion_repr_writer ticketVersion_enum (_ by (LP.enum_repr_of_key_tac ticketVersion_enum))", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 Parsers.TicketVersion.serialize_ticketVersion_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.serializer32_of_leaf_writer_strong_constant_size", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_enum", "Parsers.TicketVersion.parse_ticketVersion_key", "Parsers.TicketVersion.serialize_ticketVersion_key", "Parsers.TicketVersion.write_ticketVersion_key", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lserialize_ticketVersion_key:LL.serializer32 serialize_ticketVersion_key\nlet lserialize_ticketVersion_key:LL.serializer32 serialize_ticketVersion_key =", "completed_definiton": "LL.serializer32_of_leaf_writer_strong_constant_size write_ticketVersion_key 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.read_ticketVersion_key", "original_source_type": "val read_ticketVersion_key:LL.leaf_reader parse_ticketVersion_key", "source_type": "val read_ticketVersion_key:LL.leaf_reader parse_ticketVersion_key", "source_definition": "let read_ticketVersion_key : LL.leaf_reader parse_ticketVersion_key =\n LL.mk_read_enum_key ticketVersion_repr_reader ticketVersion_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 116, "start_col": 2, "end_line": 116, "end_col": 66 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let ticketVersion_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let ticketVersion_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let ticketVersion_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion = x\n\ninline_for_extraction let synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst ticketVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_ticketVersion_inj () : Lemma\n (LP.synth_injective synth_ticketVersion) = ()\n\nlet lemma_synth_ticketVersion_inv () : Lemma\n (LP.synth_inverse synth_ticketVersion synth_ticketVersion_inv) = ()\n\nnoextract let parse_ticketVersion_key : LP.parser _ (LP.enum_key ticketVersion_enum) =\n LP.parse_enum_key ticketVersion_repr_parser ticketVersion_enum\n\nnoextract let serialize_ticketVersion_key : LP.serializer parse_ticketVersion_key =\n LP.serialize_enum_key ticketVersion_repr_parser ticketVersion_repr_serializer ticketVersion_enum\n\nnoextract let ticketVersion_parser : LP.parser _ ticketVersion =\n lemma_synth_ticketVersion_inj ();\n parse_ticketVersion_key `LP.parse_synth` synth_ticketVersion\n\nnoextract let ticketVersion_serializer : LP.serializer ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LP.serialize_synth _ synth_ticketVersion serialize_ticketVersion_key synth_ticketVersion_inv ()\n\nlet ticketVersion_bytesize (x:ticketVersion) : GTot nat = Seq.length (ticketVersion_serializer x)\n\nlet ticketVersion_bytesize_eq x = ()\n\nlet parse32_ticketVersion_key : LS.parser32 parse_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac ticketVersion_repr_parser32 ticketVersion_enum)\n\nlet ticketVersion_parser32 : LS.parser32 ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n LS.parse32_synth _ synth_ticketVersion (fun x->synth_ticketVersion x) parse32_ticketVersion_key ()\n\nlet serialize32_ticketVersion_key : LS.serializer32 serialize_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n ticketVersion_repr_serializer32 ticketVersion_enum)\n\nlet ticketVersion_serializer32 : LS.serializer32 ticketVersion_serializer =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LS.serialize32_synth _ synth_ticketVersion _ serialize32_ticketVersion_key synth_ticketVersion_inv (fun x->synth_ticketVersion_inv x) ()\n\nlet ticketVersion_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond ticketVersion_serializer 1ul) in\n LSZ.size32_constant ticketVersion_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_ticketVersion_key : LL.validator parse_ticketVersion_key =\n LL.mk_validate_enum_key ticketVersion_repr_validator ticketVersion_repr_reader ticketVersion_enum\n\nlet ticketVersion_validator =\n lemma_synth_ticketVersion_inj ();\n LL.validate_synth validate_ticketVersion_key synth_ticketVersion ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader Parsers.TicketVersion.parse_ticketVersion_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.read_enum_key", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "Parsers.TicketVersion.ticketVersion_repr_reader", "Prims.Cons", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.Mktuple2", "Parsers.TicketVersion.Ticket12", "FStar.UInt8.__uint_to_t", "Parsers.TicketVersion.Ticket13", "Prims.Nil", "LowParse.Spec.Enum.dep_maybe_enum_destr_t_intro", "LowParse.Low.Enum.read_enum_key_t", "LowParse.Spec.Enum.dep_maybe_enum_destr_cons", "LowParse.Spec.Enum.list_append_rev_cons", "LowParse.Spec.Enum.dep_maybe_enum_destr_nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_ticketVersion_key:LL.leaf_reader parse_ticketVersion_key\nlet read_ticketVersion_key:LL.leaf_reader parse_ticketVersion_key =", "completed_definiton": "LL.mk_read_enum_key ticketVersion_repr_reader ticketVersion_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.ticketVersion_serializer", "original_source_type": "val ticketVersion_serializer: LP.serializer ticketVersion_parser", "source_type": "val ticketVersion_serializer: LP.serializer ticketVersion_parser", "source_definition": "let ticketVersion_serializer : LP.serializer ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LP.serialize_synth _ synth_ticketVersion serialize_ticketVersion_key synth_ticketVersion_inv ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 78, "start_col": 2, "end_line": 80, "end_col": 97 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let ticketVersion_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let ticketVersion_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let ticketVersion_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion = x\n\ninline_for_extraction let synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst ticketVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_ticketVersion_inj () : Lemma\n (LP.synth_injective synth_ticketVersion) = ()\n\nlet lemma_synth_ticketVersion_inv () : Lemma\n (LP.synth_inverse synth_ticketVersion synth_ticketVersion_inv) = ()\n\nnoextract let parse_ticketVersion_key : LP.parser _ (LP.enum_key ticketVersion_enum) =\n LP.parse_enum_key ticketVersion_repr_parser ticketVersion_enum\n\nnoextract let serialize_ticketVersion_key : LP.serializer parse_ticketVersion_key =\n LP.serialize_enum_key ticketVersion_repr_parser ticketVersion_repr_serializer ticketVersion_enum\n\nnoextract let ticketVersion_parser : LP.parser _ ticketVersion =\n lemma_synth_ticketVersion_inj ();\n parse_ticketVersion_key `LP.parse_synth` synth_ticketVersion", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.TicketVersion.ticketVersion_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_enum", "Parsers.TicketVersion.parse_ticketVersion_key", "Parsers.TicketVersion.synth_ticketVersion", "Parsers.TicketVersion.serialize_ticketVersion_key", "Parsers.TicketVersion.synth_ticketVersion_inv", "Prims.unit", "Parsers.TicketVersion.lemma_synth_ticketVersion_inv", "Parsers.TicketVersion.lemma_synth_ticketVersion_inj", "LowParse.Spec.Base.serializer", "Parsers.TicketVersion.ticketVersion_parser_kind", "Parsers.TicketVersion.ticketVersion_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketVersion_serializer: LP.serializer ticketVersion_parser\nlet ticketVersion_serializer:LP.serializer ticketVersion_parser =", "completed_definiton": "lemma_synth_ticketVersion_inj ();\nlemma_synth_ticketVersion_inv ();\nLP.serialize_synth _ synth_ticketVersion serialize_ticketVersion_key synth_ticketVersion_inv ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.ticketVersion_validator", "original_source_type": "val ticketVersion_validator: LL.validator ticketVersion_parser", "source_type": "val ticketVersion_validator: LL.validator ticketVersion_parser", "source_definition": "let ticketVersion_validator =\n lemma_synth_ticketVersion_inj ();\n LL.validate_synth validate_ticketVersion_key synth_ticketVersion ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 111, "start_col": 2, "end_line": 112, "end_col": 69 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let ticketVersion_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let ticketVersion_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let ticketVersion_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion = x\n\ninline_for_extraction let synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst ticketVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_ticketVersion_inj () : Lemma\n (LP.synth_injective synth_ticketVersion) = ()\n\nlet lemma_synth_ticketVersion_inv () : Lemma\n (LP.synth_inverse synth_ticketVersion synth_ticketVersion_inv) = ()\n\nnoextract let parse_ticketVersion_key : LP.parser _ (LP.enum_key ticketVersion_enum) =\n LP.parse_enum_key ticketVersion_repr_parser ticketVersion_enum\n\nnoextract let serialize_ticketVersion_key : LP.serializer parse_ticketVersion_key =\n LP.serialize_enum_key ticketVersion_repr_parser ticketVersion_repr_serializer ticketVersion_enum\n\nnoextract let ticketVersion_parser : LP.parser _ ticketVersion =\n lemma_synth_ticketVersion_inj ();\n parse_ticketVersion_key `LP.parse_synth` synth_ticketVersion\n\nnoextract let ticketVersion_serializer : LP.serializer ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LP.serialize_synth _ synth_ticketVersion serialize_ticketVersion_key synth_ticketVersion_inv ()\n\nlet ticketVersion_bytesize (x:ticketVersion) : GTot nat = Seq.length (ticketVersion_serializer x)\n\nlet ticketVersion_bytesize_eq x = ()\n\nlet parse32_ticketVersion_key : LS.parser32 parse_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac ticketVersion_repr_parser32 ticketVersion_enum)\n\nlet ticketVersion_parser32 : LS.parser32 ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n LS.parse32_synth _ synth_ticketVersion (fun x->synth_ticketVersion x) parse32_ticketVersion_key ()\n\nlet serialize32_ticketVersion_key : LS.serializer32 serialize_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n ticketVersion_repr_serializer32 ticketVersion_enum)\n\nlet ticketVersion_serializer32 : LS.serializer32 ticketVersion_serializer =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LS.serialize32_synth _ synth_ticketVersion _ serialize32_ticketVersion_key synth_ticketVersion_inv (fun x->synth_ticketVersion_inv x) ()\n\nlet ticketVersion_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond ticketVersion_serializer 1ul) in\n LSZ.size32_constant ticketVersion_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_ticketVersion_key : LL.validator parse_ticketVersion_key =\n LL.mk_validate_enum_key ticketVersion_repr_validator ticketVersion_repr_reader ticketVersion_enum", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.TicketVersion.ticketVersion_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.validate_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_enum", "Parsers.TicketVersion.parse_ticketVersion_key", "Parsers.TicketVersion.validate_ticketVersion_key", "Parsers.TicketVersion.synth_ticketVersion", "Prims.unit", "Parsers.TicketVersion.lemma_synth_ticketVersion_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketVersion_validator: LL.validator ticketVersion_parser\nlet ticketVersion_validator =", "completed_definiton": "lemma_synth_ticketVersion_inj ();\nLL.validate_synth validate_ticketVersion_key synth_ticketVersion ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.ticketVersion_lserializer", "original_source_type": "val ticketVersion_lserializer: LL.serializer32 ticketVersion_serializer", "source_type": "val ticketVersion_lserializer: LL.serializer32 ticketVersion_serializer", "source_definition": "let ticketVersion_lserializer = LL.serializer32_of_leaf_writer_strong_constant_size ticketVersion_writer 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 132, "start_col": 32, "end_line": 132, "end_col": 111 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let ticketVersion_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let ticketVersion_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let ticketVersion_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion = x\n\ninline_for_extraction let synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst ticketVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_ticketVersion_inj () : Lemma\n (LP.synth_injective synth_ticketVersion) = ()\n\nlet lemma_synth_ticketVersion_inv () : Lemma\n (LP.synth_inverse synth_ticketVersion synth_ticketVersion_inv) = ()\n\nnoextract let parse_ticketVersion_key : LP.parser _ (LP.enum_key ticketVersion_enum) =\n LP.parse_enum_key ticketVersion_repr_parser ticketVersion_enum\n\nnoextract let serialize_ticketVersion_key : LP.serializer parse_ticketVersion_key =\n LP.serialize_enum_key ticketVersion_repr_parser ticketVersion_repr_serializer ticketVersion_enum\n\nnoextract let ticketVersion_parser : LP.parser _ ticketVersion =\n lemma_synth_ticketVersion_inj ();\n parse_ticketVersion_key `LP.parse_synth` synth_ticketVersion\n\nnoextract let ticketVersion_serializer : LP.serializer ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LP.serialize_synth _ synth_ticketVersion serialize_ticketVersion_key synth_ticketVersion_inv ()\n\nlet ticketVersion_bytesize (x:ticketVersion) : GTot nat = Seq.length (ticketVersion_serializer x)\n\nlet ticketVersion_bytesize_eq x = ()\n\nlet parse32_ticketVersion_key : LS.parser32 parse_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac ticketVersion_repr_parser32 ticketVersion_enum)\n\nlet ticketVersion_parser32 : LS.parser32 ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n LS.parse32_synth _ synth_ticketVersion (fun x->synth_ticketVersion x) parse32_ticketVersion_key ()\n\nlet serialize32_ticketVersion_key : LS.serializer32 serialize_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n ticketVersion_repr_serializer32 ticketVersion_enum)\n\nlet ticketVersion_serializer32 : LS.serializer32 ticketVersion_serializer =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LS.serialize32_synth _ synth_ticketVersion _ serialize32_ticketVersion_key synth_ticketVersion_inv (fun x->synth_ticketVersion_inv x) ()\n\nlet ticketVersion_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond ticketVersion_serializer 1ul) in\n LSZ.size32_constant ticketVersion_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_ticketVersion_key : LL.validator parse_ticketVersion_key =\n LL.mk_validate_enum_key ticketVersion_repr_validator ticketVersion_repr_reader ticketVersion_enum\n\nlet ticketVersion_validator =\n lemma_synth_ticketVersion_inj ();\n LL.validate_synth validate_ticketVersion_key synth_ticketVersion ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_ticketVersion_key : LL.leaf_reader parse_ticketVersion_key =\n LL.mk_read_enum_key ticketVersion_repr_reader ticketVersion_enum\n\nlet ticketVersion_reader =\n [@inline_let] let _ = lemma_synth_ticketVersion_inj () in\n LL.read_synth' parse_ticketVersion_key synth_ticketVersion read_ticketVersion_key ()\n\ninline_for_extraction let write_ticketVersion_key : LL.leaf_writer_strong serialize_ticketVersion_key =\n LL.write_enum_key ticketVersion_repr_writer ticketVersion_enum (_ by (LP.enum_repr_of_key_tac ticketVersion_enum))\n\ninline_for_extraction let lserialize_ticketVersion_key : LL.serializer32 serialize_ticketVersion_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_ticketVersion_key 1ul ()\n\nlet ticketVersion_writer =\n [@inline_let] let _ = lemma_synth_ticketVersion_inj (); lemma_synth_ticketVersion_inv () in\n LL.write_synth write_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv (fun x -> synth_ticketVersion_inv x) ()", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 Parsers.TicketVersion.ticketVersion_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.serializer32_of_leaf_writer_strong_constant_size", "Parsers.TicketVersion.ticketVersion_parser_kind", "Parsers.TicketVersion.ticketVersion", "Parsers.TicketVersion.ticketVersion_parser", "Parsers.TicketVersion.ticketVersion_serializer", "Parsers.TicketVersion.ticketVersion_writer", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketVersion_lserializer: LL.serializer32 ticketVersion_serializer\nlet ticketVersion_lserializer =", "completed_definiton": "LL.serializer32_of_leaf_writer_strong_constant_size ticketVersion_writer 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.synth_ticketVersion_inv", "original_source_type": "val synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum)", "source_type": "val synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum)", "source_definition": "let synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst ticketVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 56, "start_col": 2, "end_line": 59, "end_col": 3 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let ticketVersion_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let ticketVersion_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let ticketVersion_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion = x", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketVersion.ticketVersion\n -> LowParse.Spec.Enum.enum_key Parsers.TicketVersion.ticketVersion_enum", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketVersion.ticketVersion", "Prims.squash", "Prims.b2t", "LowParse.Spec.Enum.list_mem", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "FStar.UInt8.t", "FStar.Pervasives.Native.fst", "Parsers.TicketVersion.ticketVersion_enum", "LowParse.Spec.Enum.enum_key" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum)\nlet synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum) =", "completed_definiton": "[@@ inline_let ]let _:squash (LP.list_mem x (LP.list_map fst ticketVersion_enum)) =\n FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.synth_maybe_enum_key_inv_unknown_tac x))\nin\nx", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.ticketVersion_parser", "original_source_type": "val ticketVersion_parser: LP.parser ticketVersion_parser_kind ticketVersion", "source_type": "val ticketVersion_parser: LP.parser ticketVersion_parser_kind ticketVersion", "source_definition": "let ticketVersion_parser : LP.parser _ ticketVersion =\n lemma_synth_ticketVersion_inj ();\n parse_ticketVersion_key `LP.parse_synth` synth_ticketVersion", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 74, "start_col": 2, "end_line": 75, "end_col": 62 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let ticketVersion_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let ticketVersion_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let ticketVersion_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion = x\n\ninline_for_extraction let synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst ticketVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_ticketVersion_inj () : Lemma\n (LP.synth_injective synth_ticketVersion) = ()\n\nlet lemma_synth_ticketVersion_inv () : Lemma\n (LP.synth_inverse synth_ticketVersion synth_ticketVersion_inv) = ()\n\nnoextract let parse_ticketVersion_key : LP.parser _ (LP.enum_key ticketVersion_enum) =\n LP.parse_enum_key ticketVersion_repr_parser ticketVersion_enum\n\nnoextract let serialize_ticketVersion_key : LP.serializer parse_ticketVersion_key =\n LP.serialize_enum_key ticketVersion_repr_parser ticketVersion_repr_serializer ticketVersion_enum", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.TicketVersion.ticketVersion_parser_kind\n Parsers.TicketVersion.ticketVersion", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_enum", "Parsers.TicketVersion.parse_ticketVersion_key", "Parsers.TicketVersion.synth_ticketVersion", "Prims.unit", "Parsers.TicketVersion.lemma_synth_ticketVersion_inj", "LowParse.Spec.Base.parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketVersion_parser: LP.parser ticketVersion_parser_kind ticketVersion\nlet ticketVersion_parser:LP.parser _ ticketVersion =", "completed_definiton": "lemma_synth_ticketVersion_inj ();\nparse_ticketVersion_key `LP.parse_synth` synth_ticketVersion", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.ticketVersion_serializer32", "original_source_type": "val ticketVersion_serializer32: LS.serializer32 ticketVersion_serializer", "source_type": "val ticketVersion_serializer32: LS.serializer32 ticketVersion_serializer", "source_definition": "let ticketVersion_serializer32 : LS.serializer32 ticketVersion_serializer =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LS.serialize32_synth _ synth_ticketVersion _ serialize32_ticketVersion_key synth_ticketVersion_inv (fun x->synth_ticketVersion_inv x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 98, "start_col": 2, "end_line": 100, "end_col": 138 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let ticketVersion_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let ticketVersion_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let ticketVersion_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion = x\n\ninline_for_extraction let synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst ticketVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_ticketVersion_inj () : Lemma\n (LP.synth_injective synth_ticketVersion) = ()\n\nlet lemma_synth_ticketVersion_inv () : Lemma\n (LP.synth_inverse synth_ticketVersion synth_ticketVersion_inv) = ()\n\nnoextract let parse_ticketVersion_key : LP.parser _ (LP.enum_key ticketVersion_enum) =\n LP.parse_enum_key ticketVersion_repr_parser ticketVersion_enum\n\nnoextract let serialize_ticketVersion_key : LP.serializer parse_ticketVersion_key =\n LP.serialize_enum_key ticketVersion_repr_parser ticketVersion_repr_serializer ticketVersion_enum\n\nnoextract let ticketVersion_parser : LP.parser _ ticketVersion =\n lemma_synth_ticketVersion_inj ();\n parse_ticketVersion_key `LP.parse_synth` synth_ticketVersion\n\nnoextract let ticketVersion_serializer : LP.serializer ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LP.serialize_synth _ synth_ticketVersion serialize_ticketVersion_key synth_ticketVersion_inv ()\n\nlet ticketVersion_bytesize (x:ticketVersion) : GTot nat = Seq.length (ticketVersion_serializer x)\n\nlet ticketVersion_bytesize_eq x = ()\n\nlet parse32_ticketVersion_key : LS.parser32 parse_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac ticketVersion_repr_parser32 ticketVersion_enum)\n\nlet ticketVersion_parser32 : LS.parser32 ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n LS.parse32_synth _ synth_ticketVersion (fun x->synth_ticketVersion x) parse32_ticketVersion_key ()\n\nlet serialize32_ticketVersion_key : LS.serializer32 serialize_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n ticketVersion_repr_serializer32 ticketVersion_enum)", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.TicketVersion.ticketVersion_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_enum", "Parsers.TicketVersion.parse_ticketVersion_key", "Parsers.TicketVersion.synth_ticketVersion", "Parsers.TicketVersion.serialize_ticketVersion_key", "Parsers.TicketVersion.serialize32_ticketVersion_key", "Parsers.TicketVersion.synth_ticketVersion_inv", "Prims.eq2", "Prims.unit", "Parsers.TicketVersion.lemma_synth_ticketVersion_inv", "Parsers.TicketVersion.lemma_synth_ticketVersion_inj", "LowParse.SLow.Base.serializer32", "Parsers.TicketVersion.ticketVersion_parser_kind", "Parsers.TicketVersion.ticketVersion_parser", "Parsers.TicketVersion.ticketVersion_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketVersion_serializer32: LS.serializer32 ticketVersion_serializer\nlet ticketVersion_serializer32:LS.serializer32 ticketVersion_serializer =", "completed_definiton": "lemma_synth_ticketVersion_inj ();\nlemma_synth_ticketVersion_inv ();\nLS.serialize32_synth _\n synth_ticketVersion\n _\n serialize32_ticketVersion_key\n synth_ticketVersion_inv\n (fun x -> synth_ticketVersion_inv x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.ticketVersion_reader", "original_source_type": "val ticketVersion_reader: LL.leaf_reader ticketVersion_parser", "source_type": "val ticketVersion_reader: LL.leaf_reader ticketVersion_parser", "source_definition": "let ticketVersion_reader =\n [@inline_let] let _ = lemma_synth_ticketVersion_inj () in\n LL.read_synth' parse_ticketVersion_key synth_ticketVersion read_ticketVersion_key ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 119, "start_col": 1, "end_line": 120, "end_col": 85 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let ticketVersion_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let ticketVersion_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let ticketVersion_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion = x\n\ninline_for_extraction let synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst ticketVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_ticketVersion_inj () : Lemma\n (LP.synth_injective synth_ticketVersion) = ()\n\nlet lemma_synth_ticketVersion_inv () : Lemma\n (LP.synth_inverse synth_ticketVersion synth_ticketVersion_inv) = ()\n\nnoextract let parse_ticketVersion_key : LP.parser _ (LP.enum_key ticketVersion_enum) =\n LP.parse_enum_key ticketVersion_repr_parser ticketVersion_enum\n\nnoextract let serialize_ticketVersion_key : LP.serializer parse_ticketVersion_key =\n LP.serialize_enum_key ticketVersion_repr_parser ticketVersion_repr_serializer ticketVersion_enum\n\nnoextract let ticketVersion_parser : LP.parser _ ticketVersion =\n lemma_synth_ticketVersion_inj ();\n parse_ticketVersion_key `LP.parse_synth` synth_ticketVersion\n\nnoextract let ticketVersion_serializer : LP.serializer ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LP.serialize_synth _ synth_ticketVersion serialize_ticketVersion_key synth_ticketVersion_inv ()\n\nlet ticketVersion_bytesize (x:ticketVersion) : GTot nat = Seq.length (ticketVersion_serializer x)\n\nlet ticketVersion_bytesize_eq x = ()\n\nlet parse32_ticketVersion_key : LS.parser32 parse_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac ticketVersion_repr_parser32 ticketVersion_enum)\n\nlet ticketVersion_parser32 : LS.parser32 ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n LS.parse32_synth _ synth_ticketVersion (fun x->synth_ticketVersion x) parse32_ticketVersion_key ()\n\nlet serialize32_ticketVersion_key : LS.serializer32 serialize_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n ticketVersion_repr_serializer32 ticketVersion_enum)\n\nlet ticketVersion_serializer32 : LS.serializer32 ticketVersion_serializer =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LS.serialize32_synth _ synth_ticketVersion _ serialize32_ticketVersion_key synth_ticketVersion_inv (fun x->synth_ticketVersion_inv x) ()\n\nlet ticketVersion_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond ticketVersion_serializer 1ul) in\n LSZ.size32_constant ticketVersion_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_ticketVersion_key : LL.validator parse_ticketVersion_key =\n LL.mk_validate_enum_key ticketVersion_repr_validator ticketVersion_repr_reader ticketVersion_enum\n\nlet ticketVersion_validator =\n lemma_synth_ticketVersion_inj ();\n LL.validate_synth validate_ticketVersion_key synth_ticketVersion ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_ticketVersion_key : LL.leaf_reader parse_ticketVersion_key =\n LL.mk_read_enum_key ticketVersion_repr_reader ticketVersion_enum", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader Parsers.TicketVersion.ticketVersion_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.read_synth'", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_enum", "Parsers.TicketVersion.parse_ticketVersion_key", "Parsers.TicketVersion.synth_ticketVersion", "Parsers.TicketVersion.read_ticketVersion_key", "Prims.unit", "Parsers.TicketVersion.lemma_synth_ticketVersion_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketVersion_reader: LL.leaf_reader ticketVersion_parser\nlet ticketVersion_reader =", "completed_definiton": "[@@ inline_let ]let _ = lemma_synth_ticketVersion_inj () in\nLL.read_synth' parse_ticketVersion_key synth_ticketVersion read_ticketVersion_key ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.ticketVersion_writer", "original_source_type": "val ticketVersion_writer: LL.leaf_writer_strong ticketVersion_serializer", "source_type": "val ticketVersion_writer: LL.leaf_writer_strong ticketVersion_serializer", "source_definition": "let ticketVersion_writer =\n [@inline_let] let _ = lemma_synth_ticketVersion_inj (); lemma_synth_ticketVersion_inv () in\n LL.write_synth write_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv (fun x -> synth_ticketVersion_inv x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 129, "start_col": 2, "end_line": 130, "end_col": 124 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let ticketVersion_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let ticketVersion_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let ticketVersion_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion = x\n\ninline_for_extraction let synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst ticketVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_ticketVersion_inj () : Lemma\n (LP.synth_injective synth_ticketVersion) = ()\n\nlet lemma_synth_ticketVersion_inv () : Lemma\n (LP.synth_inverse synth_ticketVersion synth_ticketVersion_inv) = ()\n\nnoextract let parse_ticketVersion_key : LP.parser _ (LP.enum_key ticketVersion_enum) =\n LP.parse_enum_key ticketVersion_repr_parser ticketVersion_enum\n\nnoextract let serialize_ticketVersion_key : LP.serializer parse_ticketVersion_key =\n LP.serialize_enum_key ticketVersion_repr_parser ticketVersion_repr_serializer ticketVersion_enum\n\nnoextract let ticketVersion_parser : LP.parser _ ticketVersion =\n lemma_synth_ticketVersion_inj ();\n parse_ticketVersion_key `LP.parse_synth` synth_ticketVersion\n\nnoextract let ticketVersion_serializer : LP.serializer ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LP.serialize_synth _ synth_ticketVersion serialize_ticketVersion_key synth_ticketVersion_inv ()\n\nlet ticketVersion_bytesize (x:ticketVersion) : GTot nat = Seq.length (ticketVersion_serializer x)\n\nlet ticketVersion_bytesize_eq x = ()\n\nlet parse32_ticketVersion_key : LS.parser32 parse_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac ticketVersion_repr_parser32 ticketVersion_enum)\n\nlet ticketVersion_parser32 : LS.parser32 ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n LS.parse32_synth _ synth_ticketVersion (fun x->synth_ticketVersion x) parse32_ticketVersion_key ()\n\nlet serialize32_ticketVersion_key : LS.serializer32 serialize_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n ticketVersion_repr_serializer32 ticketVersion_enum)\n\nlet ticketVersion_serializer32 : LS.serializer32 ticketVersion_serializer =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LS.serialize32_synth _ synth_ticketVersion _ serialize32_ticketVersion_key synth_ticketVersion_inv (fun x->synth_ticketVersion_inv x) ()\n\nlet ticketVersion_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond ticketVersion_serializer 1ul) in\n LSZ.size32_constant ticketVersion_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_ticketVersion_key : LL.validator parse_ticketVersion_key =\n LL.mk_validate_enum_key ticketVersion_repr_validator ticketVersion_repr_reader ticketVersion_enum\n\nlet ticketVersion_validator =\n lemma_synth_ticketVersion_inj ();\n LL.validate_synth validate_ticketVersion_key synth_ticketVersion ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_ticketVersion_key : LL.leaf_reader parse_ticketVersion_key =\n LL.mk_read_enum_key ticketVersion_repr_reader ticketVersion_enum\n\nlet ticketVersion_reader =\n [@inline_let] let _ = lemma_synth_ticketVersion_inj () in\n LL.read_synth' parse_ticketVersion_key synth_ticketVersion read_ticketVersion_key ()\n\ninline_for_extraction let write_ticketVersion_key : LL.leaf_writer_strong serialize_ticketVersion_key =\n LL.write_enum_key ticketVersion_repr_writer ticketVersion_enum (_ by (LP.enum_repr_of_key_tac ticketVersion_enum))\n\ninline_for_extraction let lserialize_ticketVersion_key : LL.serializer32 serialize_ticketVersion_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_ticketVersion_key 1ul ()", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong Parsers.TicketVersion.ticketVersion_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.write_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_enum", "Parsers.TicketVersion.parse_ticketVersion_key", "Parsers.TicketVersion.serialize_ticketVersion_key", "Parsers.TicketVersion.write_ticketVersion_key", "Parsers.TicketVersion.synth_ticketVersion", "Parsers.TicketVersion.synth_ticketVersion_inv", "Prims.eq2", "Prims.unit", "Parsers.TicketVersion.lemma_synth_ticketVersion_inv", "Parsers.TicketVersion.lemma_synth_ticketVersion_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketVersion_writer: LL.leaf_writer_strong ticketVersion_serializer\nlet ticketVersion_writer =", "completed_definiton": "[@@ inline_let ]let _ =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ()\nin\nLL.write_synth write_ticketVersion_key\n synth_ticketVersion\n synth_ticketVersion_inv\n (fun x -> synth_ticketVersion_inv x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.ticketVersion_parser32", "original_source_type": "val ticketVersion_parser32: LS.parser32 ticketVersion_parser", "source_type": "val ticketVersion_parser32: LS.parser32 ticketVersion_parser", "source_definition": "let ticketVersion_parser32 : LS.parser32 ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n LS.parse32_synth _ synth_ticketVersion (fun x->synth_ticketVersion x) parse32_ticketVersion_key ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 90, "start_col": 2, "end_line": 91, "end_col": 100 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let ticketVersion_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let ticketVersion_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let ticketVersion_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion = x\n\ninline_for_extraction let synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst ticketVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_ticketVersion_inj () : Lemma\n (LP.synth_injective synth_ticketVersion) = ()\n\nlet lemma_synth_ticketVersion_inv () : Lemma\n (LP.synth_inverse synth_ticketVersion synth_ticketVersion_inv) = ()\n\nnoextract let parse_ticketVersion_key : LP.parser _ (LP.enum_key ticketVersion_enum) =\n LP.parse_enum_key ticketVersion_repr_parser ticketVersion_enum\n\nnoextract let serialize_ticketVersion_key : LP.serializer parse_ticketVersion_key =\n LP.serialize_enum_key ticketVersion_repr_parser ticketVersion_repr_serializer ticketVersion_enum\n\nnoextract let ticketVersion_parser : LP.parser _ ticketVersion =\n lemma_synth_ticketVersion_inj ();\n parse_ticketVersion_key `LP.parse_synth` synth_ticketVersion\n\nnoextract let ticketVersion_serializer : LP.serializer ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LP.serialize_synth _ synth_ticketVersion serialize_ticketVersion_key synth_ticketVersion_inv ()\n\nlet ticketVersion_bytesize (x:ticketVersion) : GTot nat = Seq.length (ticketVersion_serializer x)\n\nlet ticketVersion_bytesize_eq x = ()\n\nlet parse32_ticketVersion_key : LS.parser32 parse_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac ticketVersion_repr_parser32 ticketVersion_enum)", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.TicketVersion.ticketVersion_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_enum", "Parsers.TicketVersion.parse_ticketVersion_key", "Parsers.TicketVersion.synth_ticketVersion", "Prims.eq2", "Parsers.TicketVersion.parse32_ticketVersion_key", "Prims.unit", "Parsers.TicketVersion.lemma_synth_ticketVersion_inj", "LowParse.SLow.Base.parser32", "Parsers.TicketVersion.ticketVersion_parser_kind", "Parsers.TicketVersion.ticketVersion_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketVersion_parser32: LS.parser32 ticketVersion_parser\nlet ticketVersion_parser32:LS.parser32 ticketVersion_parser =", "completed_definiton": "lemma_synth_ticketVersion_inj ();\nLS.parse32_synth _ synth_ticketVersion (fun x -> synth_ticketVersion x) parse32_ticketVersion_key ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.ticketVersion_bytesize_eqn", "original_source_type": "val ticketVersion_bytesize_eqn (x: ticketVersion) : Lemma (ticketVersion_bytesize x == 1) [SMTPat (ticketVersion_bytesize x)]", "source_type": "val ticketVersion_bytesize_eqn (x: ticketVersion) : Lemma (ticketVersion_bytesize x == 1) [SMTPat (ticketVersion_bytesize x)]", "source_definition": "let ticketVersion_bytesize_eqn x = ticketVersion_bytesize_eq x; assert (FStar.Seq.length (LP.serialize ticketVersion_serializer x) <= 1); assert (1 <= FStar.Seq.length (LP.serialize ticketVersion_serializer x))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 134, "start_col": 35, "end_line": 134, "end_col": 210 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let ticketVersion_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let ticketVersion_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let ticketVersion_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion = x\n\ninline_for_extraction let synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst ticketVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_ticketVersion_inj () : Lemma\n (LP.synth_injective synth_ticketVersion) = ()\n\nlet lemma_synth_ticketVersion_inv () : Lemma\n (LP.synth_inverse synth_ticketVersion synth_ticketVersion_inv) = ()\n\nnoextract let parse_ticketVersion_key : LP.parser _ (LP.enum_key ticketVersion_enum) =\n LP.parse_enum_key ticketVersion_repr_parser ticketVersion_enum\n\nnoextract let serialize_ticketVersion_key : LP.serializer parse_ticketVersion_key =\n LP.serialize_enum_key ticketVersion_repr_parser ticketVersion_repr_serializer ticketVersion_enum\n\nnoextract let ticketVersion_parser : LP.parser _ ticketVersion =\n lemma_synth_ticketVersion_inj ();\n parse_ticketVersion_key `LP.parse_synth` synth_ticketVersion\n\nnoextract let ticketVersion_serializer : LP.serializer ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LP.serialize_synth _ synth_ticketVersion serialize_ticketVersion_key synth_ticketVersion_inv ()\n\nlet ticketVersion_bytesize (x:ticketVersion) : GTot nat = Seq.length (ticketVersion_serializer x)\n\nlet ticketVersion_bytesize_eq x = ()\n\nlet parse32_ticketVersion_key : LS.parser32 parse_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac ticketVersion_repr_parser32 ticketVersion_enum)\n\nlet ticketVersion_parser32 : LS.parser32 ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n LS.parse32_synth _ synth_ticketVersion (fun x->synth_ticketVersion x) parse32_ticketVersion_key ()\n\nlet serialize32_ticketVersion_key : LS.serializer32 serialize_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n ticketVersion_repr_serializer32 ticketVersion_enum)\n\nlet ticketVersion_serializer32 : LS.serializer32 ticketVersion_serializer =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LS.serialize32_synth _ synth_ticketVersion _ serialize32_ticketVersion_key synth_ticketVersion_inv (fun x->synth_ticketVersion_inv x) ()\n\nlet ticketVersion_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond ticketVersion_serializer 1ul) in\n LSZ.size32_constant ticketVersion_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_ticketVersion_key : LL.validator parse_ticketVersion_key =\n LL.mk_validate_enum_key ticketVersion_repr_validator ticketVersion_repr_reader ticketVersion_enum\n\nlet ticketVersion_validator =\n lemma_synth_ticketVersion_inj ();\n LL.validate_synth validate_ticketVersion_key synth_ticketVersion ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_ticketVersion_key : LL.leaf_reader parse_ticketVersion_key =\n LL.mk_read_enum_key ticketVersion_repr_reader ticketVersion_enum\n\nlet ticketVersion_reader =\n [@inline_let] let _ = lemma_synth_ticketVersion_inj () in\n LL.read_synth' parse_ticketVersion_key synth_ticketVersion read_ticketVersion_key ()\n\ninline_for_extraction let write_ticketVersion_key : LL.leaf_writer_strong serialize_ticketVersion_key =\n LL.write_enum_key ticketVersion_repr_writer ticketVersion_enum (_ by (LP.enum_repr_of_key_tac ticketVersion_enum))\n\ninline_for_extraction let lserialize_ticketVersion_key : LL.serializer32 serialize_ticketVersion_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_ticketVersion_key 1ul ()\n\nlet ticketVersion_writer =\n [@inline_let] let _ = lemma_synth_ticketVersion_inj (); lemma_synth_ticketVersion_inv () in\n LL.write_synth write_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv (fun x -> synth_ticketVersion_inv x) ()\n\nlet ticketVersion_lserializer = LL.serializer32_of_leaf_writer_strong_constant_size ticketVersion_writer 1ul ()", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketVersion.ticketVersion\n -> FStar.Pervasives.Lemma (ensures Parsers.TicketVersion.ticketVersion_bytesize x == 1)\n [SMTPat (Parsers.TicketVersion.ticketVersion_bytesize x)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketVersion.ticketVersion", "Prims._assert", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "Parsers.TicketVersion.ticketVersion_parser_kind", "Parsers.TicketVersion.ticketVersion_parser", "Parsers.TicketVersion.ticketVersion_serializer", "Prims.unit", "Parsers.TicketVersion.ticketVersion_bytesize_eq" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketVersion_bytesize_eqn (x: ticketVersion) : Lemma (ticketVersion_bytesize x == 1) [SMTPat (ticketVersion_bytesize x)]\nlet ticketVersion_bytesize_eqn x =", "completed_definiton": "ticketVersion_bytesize_eq x;\nassert (FStar.Seq.length (LP.serialize ticketVersion_serializer x) <= 1);\nassert (1 <= FStar.Seq.length (LP.serialize ticketVersion_serializer x))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketVersion.fst", "name": "Parsers.TicketVersion.serialize32_ticketVersion_key", "original_source_type": "val serialize32_ticketVersion_key:LS.serializer32 serialize_ticketVersion_key", "source_type": "val serialize32_ticketVersion_key:LS.serializer32 serialize_ticketVersion_key", "source_definition": "let serialize32_ticketVersion_key : LS.serializer32 serialize_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n ticketVersion_repr_serializer32 ticketVersion_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 94, "start_col": 2, "end_line": 95, "end_col": 55 }, "file_context": "module Parsers.TicketVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let ticketVersion_enum : LP.enum ticketVersion U8.t =\n [@inline_let] let e = [\n Ticket12, 0z;\n Ticket13, 1z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let ticketVersion_repr_parser = LPI.parse_u8\n\nnoextract let ticketVersion_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let ticketVersion_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let ticketVersion_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let ticketVersion_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let ticketVersion_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let ticketVersion_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_ticketVersion (x: LP.enum_key ticketVersion_enum) : Tot ticketVersion = x\n\ninline_for_extraction let synth_ticketVersion_inv (x: ticketVersion) : Tot (LP.enum_key ticketVersion_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst ticketVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_ticketVersion_inj () : Lemma\n (LP.synth_injective synth_ticketVersion) = ()\n\nlet lemma_synth_ticketVersion_inv () : Lemma\n (LP.synth_inverse synth_ticketVersion synth_ticketVersion_inv) = ()\n\nnoextract let parse_ticketVersion_key : LP.parser _ (LP.enum_key ticketVersion_enum) =\n LP.parse_enum_key ticketVersion_repr_parser ticketVersion_enum\n\nnoextract let serialize_ticketVersion_key : LP.serializer parse_ticketVersion_key =\n LP.serialize_enum_key ticketVersion_repr_parser ticketVersion_repr_serializer ticketVersion_enum\n\nnoextract let ticketVersion_parser : LP.parser _ ticketVersion =\n lemma_synth_ticketVersion_inj ();\n parse_ticketVersion_key `LP.parse_synth` synth_ticketVersion\n\nnoextract let ticketVersion_serializer : LP.serializer ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LP.serialize_synth _ synth_ticketVersion serialize_ticketVersion_key synth_ticketVersion_inv ()\n\nlet ticketVersion_bytesize (x:ticketVersion) : GTot nat = Seq.length (ticketVersion_serializer x)\n\nlet ticketVersion_bytesize_eq x = ()\n\nlet parse32_ticketVersion_key : LS.parser32 parse_ticketVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac ticketVersion_repr_parser32 ticketVersion_enum)\n\nlet ticketVersion_parser32 : LS.parser32 ticketVersion_parser =\n lemma_synth_ticketVersion_inj ();\n LS.parse32_synth _ synth_ticketVersion (fun x->synth_ticketVersion x) parse32_ticketVersion_key ()", "dependencies": { "source_file": "Parsers.TicketVersion.fst", "checked_file": "Parsers.TicketVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.TicketVersion.serialize_ticketVersion_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Enum.serialize32_enum_key_gen", "LowParse.Spec.Int.parse_u8_kind", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "Parsers.TicketVersion.ticketVersion_repr_serializer32", "Parsers.TicketVersion.ticketVersion_enum", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Enum.enum_key", "Parsers.TicketVersion.parse_ticketVersion_key", "Parsers.TicketVersion.serialize_ticketVersion_key", "LowParse.Spec.Enum.enum_repr_of_key_cons'", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'", "LowParse.Spec.Enum.enum_tail'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize32_ticketVersion_key:LS.serializer32 serialize_ticketVersion_key\nlet serialize32_ticketVersion_key:LS.serializer32 serialize_ticketVersion_key =", "completed_definiton": "FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac ticketVersion_repr_serializer32\n ticketVersion_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_rms.fst", "name": "Parsers.TicketContents13_rms.ticketContents13_rms_bytesize", "original_source_type": "val ticketContents13_rms_bytesize (x:ticketContents13_rms) : GTot nat", "source_type": "val ticketContents13_rms_bytesize (x:ticketContents13_rms) : GTot nat", "source_definition": "let ticketContents13_rms_bytesize (x:ticketContents13_rms) : GTot nat = Seq.length (ticketContents13_rms_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_rms.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 27, "start_col": 72, "end_line": 27, "end_col": 118 }, "file_context": "module Parsers.TicketContents13_rms\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_rms_parser = LP.parse_bounded_vlbytes 32 255\n\nnoextract let ticketContents13_rms_serializer = LP.serialize_bounded_vlbytes 32 255", "dependencies": { "source_file": "Parsers.TicketContents13_rms.fst", "checked_file": "Parsers.TicketContents13_rms.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketContents13_rms.ticketContents13_rms -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketContents13_rms.ticketContents13_rms", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.TicketContents13_rms.ticketContents13_rms_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_rms_bytesize (x:ticketContents13_rms) : GTot nat\nlet ticketContents13_rms_bytesize (x: ticketContents13_rms) : GTot nat =", "completed_definiton": "Seq.length (ticketContents13_rms_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_rms.fst", "name": "Parsers.TicketContents13_rms.ticketContents13_rms_parser32", "original_source_type": "val ticketContents13_rms_parser32: LS.parser32 ticketContents13_rms_parser", "source_type": "val ticketContents13_rms_parser32: LS.parser32 ticketContents13_rms_parser", "source_definition": "let ticketContents13_rms_parser32 = LS.parse32_bounded_vlbytes 32 32ul 255 255ul", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_rms.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 31, "start_col": 36, "end_line": 31, "end_col": 80 }, "file_context": "module Parsers.TicketContents13_rms\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_rms_parser = LP.parse_bounded_vlbytes 32 255\n\nnoextract let ticketContents13_rms_serializer = LP.serialize_bounded_vlbytes 32 255\n\nlet ticketContents13_rms_bytesize (x:ticketContents13_rms) : GTot nat = Seq.length (ticketContents13_rms_serializer x)\n\nlet ticketContents13_rms_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.TicketContents13_rms.fst", "checked_file": "Parsers.TicketContents13_rms.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.TicketContents13_rms.ticketContents13_rms_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Bytes.parse32_bounded_vlbytes", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_rms_parser32: LS.parser32 ticketContents13_rms_parser\nlet ticketContents13_rms_parser32 =", "completed_definiton": "LS.parse32_bounded_vlbytes 32 32ul 255 255ul", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_rms.fst", "name": "Parsers.TicketContents13_rms.ticketContents13_rms_serializer32", "original_source_type": "val ticketContents13_rms_serializer32: LS.serializer32 ticketContents13_rms_serializer", "source_type": "val ticketContents13_rms_serializer32: LS.serializer32 ticketContents13_rms_serializer", "source_definition": "let ticketContents13_rms_serializer32 = LS.serialize32_bounded_vlbytes 32 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_rms.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 33, "start_col": 40, "end_line": 33, "end_col": 77 }, "file_context": "module Parsers.TicketContents13_rms\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_rms_parser = LP.parse_bounded_vlbytes 32 255\n\nnoextract let ticketContents13_rms_serializer = LP.serialize_bounded_vlbytes 32 255\n\nlet ticketContents13_rms_bytesize (x:ticketContents13_rms) : GTot nat = Seq.length (ticketContents13_rms_serializer x)\n\nlet ticketContents13_rms_bytesize_eq x = ()\n\nlet ticketContents13_rms_parser32 = LS.parse32_bounded_vlbytes 32 32ul 255 255ul", "dependencies": { "source_file": "Parsers.TicketContents13_rms.fst", "checked_file": "Parsers.TicketContents13_rms.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.TicketContents13_rms.ticketContents13_rms_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Bytes.serialize32_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_rms_serializer32: LS.serializer32 ticketContents13_rms_serializer\nlet ticketContents13_rms_serializer32 =", "completed_definiton": "LS.serialize32_bounded_vlbytes 32 255", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_rms.fst", "name": "Parsers.TicketContents13_rms.ticketContents13_rms_jumper", "original_source_type": "val ticketContents13_rms_jumper: LL.jumper ticketContents13_rms_parser", "source_type": "val ticketContents13_rms_jumper: LL.jumper ticketContents13_rms_parser", "source_definition": "let ticketContents13_rms_jumper = LL.jump_bounded_vlbytes 32 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_rms.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 39, "start_col": 34, "end_line": 39, "end_col": 64 }, "file_context": "module Parsers.TicketContents13_rms\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_rms_parser = LP.parse_bounded_vlbytes 32 255\n\nnoextract let ticketContents13_rms_serializer = LP.serialize_bounded_vlbytes 32 255\n\nlet ticketContents13_rms_bytesize (x:ticketContents13_rms) : GTot nat = Seq.length (ticketContents13_rms_serializer x)\n\nlet ticketContents13_rms_bytesize_eq x = ()\n\nlet ticketContents13_rms_parser32 = LS.parse32_bounded_vlbytes 32 32ul 255 255ul\n\nlet ticketContents13_rms_serializer32 = LS.serialize32_bounded_vlbytes 32 255\n\nlet ticketContents13_rms_size32 = LSZ.size32_bounded_vlbytes 32 255\n\nlet ticketContents13_rms_validator = LL.validate_bounded_vlbytes 32 255", "dependencies": { "source_file": "Parsers.TicketContents13_rms.fst", "checked_file": "Parsers.TicketContents13_rms.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.TicketContents13_rms.ticketContents13_rms_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Bytes.jump_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_rms_jumper: LL.jumper ticketContents13_rms_parser\nlet ticketContents13_rms_jumper =", "completed_definiton": "LL.jump_bounded_vlbytes 32 255", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_rms.fst", "name": "Parsers.TicketContents13_rms.ticketContents13_rms_size32", "original_source_type": "val ticketContents13_rms_size32: LSZ.size32 ticketContents13_rms_serializer", "source_type": "val ticketContents13_rms_size32: LSZ.size32 ticketContents13_rms_serializer", "source_definition": "let ticketContents13_rms_size32 = LSZ.size32_bounded_vlbytes 32 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_rms.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 35, "start_col": 34, "end_line": 35, "end_col": 67 }, "file_context": "module Parsers.TicketContents13_rms\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_rms_parser = LP.parse_bounded_vlbytes 32 255\n\nnoextract let ticketContents13_rms_serializer = LP.serialize_bounded_vlbytes 32 255\n\nlet ticketContents13_rms_bytesize (x:ticketContents13_rms) : GTot nat = Seq.length (ticketContents13_rms_serializer x)\n\nlet ticketContents13_rms_bytesize_eq x = ()\n\nlet ticketContents13_rms_parser32 = LS.parse32_bounded_vlbytes 32 32ul 255 255ul\n\nlet ticketContents13_rms_serializer32 = LS.serialize32_bounded_vlbytes 32 255", "dependencies": { "source_file": "Parsers.TicketContents13_rms.fst", "checked_file": "Parsers.TicketContents13_rms.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.TicketContents13_rms.ticketContents13_rms_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Bytes.size32_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_rms_size32: LSZ.size32 ticketContents13_rms_serializer\nlet ticketContents13_rms_size32 =", "completed_definiton": "LSZ.size32_bounded_vlbytes 32 255", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_rms.fst", "name": "Parsers.TicketContents13_rms.ticketContents13_rms_parser", "original_source_type": "val ticketContents13_rms_parser: LP.parser ticketContents13_rms_parser_kind ticketContents13_rms", "source_type": "val ticketContents13_rms_parser: LP.parser ticketContents13_rms_parser_kind ticketContents13_rms", "source_definition": "let ticketContents13_rms_parser = LP.parse_bounded_vlbytes 32 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_rms.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 23, "start_col": 44, "end_line": 23, "end_col": 75 }, "file_context": "module Parsers.TicketContents13_rms\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"", "dependencies": { "source_file": "Parsers.TicketContents13_rms.fst", "checked_file": "Parsers.TicketContents13_rms.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind\n Parsers.TicketContents13_rms.ticketContents13_rms", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Bytes.parse_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_rms_parser: LP.parser ticketContents13_rms_parser_kind ticketContents13_rms\nlet ticketContents13_rms_parser =", "completed_definiton": "LP.parse_bounded_vlbytes 32 255", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_rms.fst", "name": "Parsers.TicketContents13_rms.ticketContents13_rms_bytesize_eqn", "original_source_type": "val ticketContents13_rms_bytesize_eqn (x: ticketContents13_rms) : Lemma (ticketContents13_rms_bytesize x == 1 + BY.length x) [SMTPat (ticketContents13_rms_bytesize x)]", "source_type": "val ticketContents13_rms_bytesize_eqn (x: ticketContents13_rms) : Lemma (ticketContents13_rms_bytesize x == 1 + BY.length x) [SMTPat (ticketContents13_rms_bytesize x)]", "source_definition": "let ticketContents13_rms_bytesize_eqn x = LP.length_serialize_bounded_vlbytes 32 255 x", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_rms.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 41, "start_col": 42, "end_line": 41, "end_col": 86 }, "file_context": "module Parsers.TicketContents13_rms\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_rms_parser = LP.parse_bounded_vlbytes 32 255\n\nnoextract let ticketContents13_rms_serializer = LP.serialize_bounded_vlbytes 32 255\n\nlet ticketContents13_rms_bytesize (x:ticketContents13_rms) : GTot nat = Seq.length (ticketContents13_rms_serializer x)\n\nlet ticketContents13_rms_bytesize_eq x = ()\n\nlet ticketContents13_rms_parser32 = LS.parse32_bounded_vlbytes 32 32ul 255 255ul\n\nlet ticketContents13_rms_serializer32 = LS.serialize32_bounded_vlbytes 32 255\n\nlet ticketContents13_rms_size32 = LSZ.size32_bounded_vlbytes 32 255\n\nlet ticketContents13_rms_validator = LL.validate_bounded_vlbytes 32 255\n\nlet ticketContents13_rms_jumper = LL.jump_bounded_vlbytes 32 255", "dependencies": { "source_file": "Parsers.TicketContents13_rms.fst", "checked_file": "Parsers.TicketContents13_rms.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketContents13_rms.ticketContents13_rms\n -> FStar.Pervasives.Lemma\n (ensures\n Parsers.TicketContents13_rms.ticketContents13_rms_bytesize x == 1 + FStar.Bytes.length x)\n [SMTPat (Parsers.TicketContents13_rms.ticketContents13_rms_bytesize x)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketContents13_rms.ticketContents13_rms", "LowParse.Spec.Bytes.length_serialize_bounded_vlbytes", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_rms_bytesize_eqn (x: ticketContents13_rms) : Lemma (ticketContents13_rms_bytesize x == 1 + BY.length x) [SMTPat (ticketContents13_rms_bytesize x)]\nlet ticketContents13_rms_bytesize_eqn x =", "completed_definiton": "LP.length_serialize_bounded_vlbytes 32 255 x", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_rms.fst", "name": "Parsers.TicketContents13_rms.ticketContents13_rms_validator", "original_source_type": "val ticketContents13_rms_validator: LL.validator ticketContents13_rms_parser", "source_type": "val ticketContents13_rms_validator: LL.validator ticketContents13_rms_parser", "source_definition": "let ticketContents13_rms_validator = LL.validate_bounded_vlbytes 32 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_rms.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 37, "start_col": 37, "end_line": 37, "end_col": 71 }, "file_context": "module Parsers.TicketContents13_rms\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_rms_parser = LP.parse_bounded_vlbytes 32 255\n\nnoextract let ticketContents13_rms_serializer = LP.serialize_bounded_vlbytes 32 255\n\nlet ticketContents13_rms_bytesize (x:ticketContents13_rms) : GTot nat = Seq.length (ticketContents13_rms_serializer x)\n\nlet ticketContents13_rms_bytesize_eq x = ()\n\nlet ticketContents13_rms_parser32 = LS.parse32_bounded_vlbytes 32 32ul 255 255ul\n\nlet ticketContents13_rms_serializer32 = LS.serialize32_bounded_vlbytes 32 255\n\nlet ticketContents13_rms_size32 = LSZ.size32_bounded_vlbytes 32 255", "dependencies": { "source_file": "Parsers.TicketContents13_rms.fst", "checked_file": "Parsers.TicketContents13_rms.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.TicketContents13_rms.ticketContents13_rms_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Bytes.validate_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_rms_validator: LL.validator ticketContents13_rms_parser\nlet ticketContents13_rms_validator =", "completed_definiton": "LL.validate_bounded_vlbytes 32 255", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_rms.fst", "name": "Parsers.TicketContents13_rms.ticketContents13_rms_serializer", "original_source_type": "val ticketContents13_rms_serializer: LP.serializer ticketContents13_rms_parser", "source_type": "val ticketContents13_rms_serializer: LP.serializer ticketContents13_rms_parser", "source_definition": "let ticketContents13_rms_serializer = LP.serialize_bounded_vlbytes 32 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_rms.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 25, "start_col": 48, "end_line": 25, "end_col": 83 }, "file_context": "module Parsers.TicketContents13_rms\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_rms_parser = LP.parse_bounded_vlbytes 32 255", "dependencies": { "source_file": "Parsers.TicketContents13_rms.fst", "checked_file": "Parsers.TicketContents13_rms.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.TicketContents13_rms.ticketContents13_rms_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Bytes.serialize_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_rms_serializer: LP.serializer ticketContents13_rms_parser\nlet ticketContents13_rms_serializer =", "completed_definiton": "LP.serialize_bounded_vlbytes 32 255", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_rms.fst", "name": "Parsers.TicketContents13_rms.ticketContents13_rms_length", "original_source_type": "val ticketContents13_rms_length (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid ticketContents13_rms_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents ticketContents13_rms_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v pos + 1 + U32.v res == U32.v (LL.get_valid_pos ticketContents13_rms_parser h input pos) /\\\n res == BY.len x /\\\n LL.bytes_of_slice_from_to h input (pos `U32.add` 1ul) ((pos `U32.add` 1ul) `U32.add` res) == BY.reveal x\n ))", "source_type": "val ticketContents13_rms_length (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid ticketContents13_rms_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents ticketContents13_rms_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v pos + 1 + U32.v res == U32.v (LL.get_valid_pos ticketContents13_rms_parser h input pos) /\\\n res == BY.len x /\\\n LL.bytes_of_slice_from_to h input (pos `U32.add` 1ul) ((pos `U32.add` 1ul) `U32.add` res) == BY.reveal x\n ))", "source_definition": "let ticketContents13_rms_length #_ #_ input pos =\n [@inline_let] let _ = assert_norm (ticketContents13_rms == LP.parse_bounded_vlbytes_t 32 255) in\n LL.bounded_vlbytes_payload_length 32 255 input pos", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_rms.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 44, "start_col": 2, "end_line": 45, "end_col": 52 }, "file_context": "module Parsers.TicketContents13_rms\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_rms_parser = LP.parse_bounded_vlbytes 32 255\n\nnoextract let ticketContents13_rms_serializer = LP.serialize_bounded_vlbytes 32 255\n\nlet ticketContents13_rms_bytesize (x:ticketContents13_rms) : GTot nat = Seq.length (ticketContents13_rms_serializer x)\n\nlet ticketContents13_rms_bytesize_eq x = ()\n\nlet ticketContents13_rms_parser32 = LS.parse32_bounded_vlbytes 32 32ul 255 255ul\n\nlet ticketContents13_rms_serializer32 = LS.serialize32_bounded_vlbytes 32 255\n\nlet ticketContents13_rms_size32 = LSZ.size32_bounded_vlbytes 32 255\n\nlet ticketContents13_rms_validator = LL.validate_bounded_vlbytes 32 255\n\nlet ticketContents13_rms_jumper = LL.jump_bounded_vlbytes 32 255\n\nlet ticketContents13_rms_bytesize_eqn x = LP.length_serialize_bounded_vlbytes 32 255 x", "dependencies": { "source_file": "Parsers.TicketContents13_rms.fst", "checked_file": "Parsers.TicketContents13_rms.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "input: LowParse.Slice.slice rrel rel -> pos: FStar.UInt32.t\n -> FStar.HyperStack.ST.Stack FStar.UInt32.t", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "LowParse.Low.Bytes.bounded_vlbytes_payload_length", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Parsers.TicketContents13_rms.ticketContents13_rms", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_rms_length (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid ticketContents13_rms_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents ticketContents13_rms_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v pos + 1 + U32.v res == U32.v (LL.get_valid_pos ticketContents13_rms_parser h input pos) /\\\n res == BY.len x /\\\n LL.bytes_of_slice_from_to h input (pos `U32.add` 1ul) ((pos `U32.add` 1ul) `U32.add` res) == BY.reveal x\n ))\nlet ticketContents13_rms_length #_ #_ input pos =", "completed_definiton": "[@@ inline_let ]let _ = assert_norm (ticketContents13_rms == LP.parse_bounded_vlbytes_t 32 255) in\nLL.bounded_vlbytes_payload_length 32 255 input pos", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_rms.fst", "name": "Parsers.TicketContents13_rms.ticketContents13_rms_finalize", "original_source_type": "val ticketContents13_rms_finalize (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) (len: U32.t) : HST.Stack U32.t\n\n (requires (fun h ->\n LL.live_slice h input /\\\n 32 <= U32.v len /\\ U32.v len <= 255 /\\\n U32.v pos + 1 + U32.v len <= U32.v input.LL.len /\\\n LL.writable input.LL.base (U32.v pos) (U32.v pos + 1) h\n ))\n (ensures (fun h pos' h' ->\n let pos_payload = pos `U32.add` 1ul in\n B.modifies (LL.loc_slice_from_to input pos pos_payload) h h' /\\\n LL.valid_content_pos ticketContents13_rms_parser h' input pos (BY.hide (LL.bytes_of_slice_from_to h input pos_payload (pos_payload `U32.add` len))) pos' /\\\n U32.v pos' == U32.v pos_payload + U32.v len\n ))", "source_type": "val ticketContents13_rms_finalize (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) (len: U32.t) : HST.Stack U32.t\n\n (requires (fun h ->\n LL.live_slice h input /\\\n 32 <= U32.v len /\\ U32.v len <= 255 /\\\n U32.v pos + 1 + U32.v len <= U32.v input.LL.len /\\\n LL.writable input.LL.base (U32.v pos) (U32.v pos + 1) h\n ))\n (ensures (fun h pos' h' ->\n let pos_payload = pos `U32.add` 1ul in\n B.modifies (LL.loc_slice_from_to input pos pos_payload) h h' /\\\n LL.valid_content_pos ticketContents13_rms_parser h' input pos (BY.hide (LL.bytes_of_slice_from_to h input pos_payload (pos_payload `U32.add` len))) pos' /\\\n U32.v pos' == U32.v pos_payload + U32.v len\n ))", "source_definition": "let ticketContents13_rms_finalize #_ #_ input pos len =\n [@inline_let] let _ = assert_norm (ticketContents13_rms == LP.parse_bounded_vlbytes_t 32 255) in\n LL.finalize_bounded_vlbytes 32 255 input pos len", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_rms.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 48, "start_col": 2, "end_line": 49, "end_col": 50 }, "file_context": "module Parsers.TicketContents13_rms\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let ticketContents13_rms_parser = LP.parse_bounded_vlbytes 32 255\n\nnoextract let ticketContents13_rms_serializer = LP.serialize_bounded_vlbytes 32 255\n\nlet ticketContents13_rms_bytesize (x:ticketContents13_rms) : GTot nat = Seq.length (ticketContents13_rms_serializer x)\n\nlet ticketContents13_rms_bytesize_eq x = ()\n\nlet ticketContents13_rms_parser32 = LS.parse32_bounded_vlbytes 32 32ul 255 255ul\n\nlet ticketContents13_rms_serializer32 = LS.serialize32_bounded_vlbytes 32 255\n\nlet ticketContents13_rms_size32 = LSZ.size32_bounded_vlbytes 32 255\n\nlet ticketContents13_rms_validator = LL.validate_bounded_vlbytes 32 255\n\nlet ticketContents13_rms_jumper = LL.jump_bounded_vlbytes 32 255\n\nlet ticketContents13_rms_bytesize_eqn x = LP.length_serialize_bounded_vlbytes 32 255 x\n\nlet ticketContents13_rms_length #_ #_ input pos =\n [@inline_let] let _ = assert_norm (ticketContents13_rms == LP.parse_bounded_vlbytes_t 32 255) in\n LL.bounded_vlbytes_payload_length 32 255 input pos", "dependencies": { "source_file": "Parsers.TicketContents13_rms.fst", "checked_file": "Parsers.TicketContents13_rms.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "input: LowParse.Slice.slice rrel rel -> pos: FStar.UInt32.t -> len: FStar.UInt32.t\n -> FStar.HyperStack.ST.Stack FStar.UInt32.t", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "LowParse.Low.Bytes.finalize_bounded_vlbytes", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Parsers.TicketContents13_rms.ticketContents13_rms", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_rms_finalize (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) (len: U32.t) : HST.Stack U32.t\n\n (requires (fun h ->\n LL.live_slice h input /\\\n 32 <= U32.v len /\\ U32.v len <= 255 /\\\n U32.v pos + 1 + U32.v len <= U32.v input.LL.len /\\\n LL.writable input.LL.base (U32.v pos) (U32.v pos + 1) h\n ))\n (ensures (fun h pos' h' ->\n let pos_payload = pos `U32.add` 1ul in\n B.modifies (LL.loc_slice_from_to input pos pos_payload) h h' /\\\n LL.valid_content_pos ticketContents13_rms_parser h' input pos (BY.hide (LL.bytes_of_slice_from_to h input pos_payload (pos_payload `U32.add` len))) pos' /\\\n U32.v pos' == U32.v pos_payload + U32.v len\n ))\nlet ticketContents13_rms_finalize #_ #_ input pos len =", "completed_definiton": "[@@ inline_let ]let _ = assert_norm (ticketContents13_rms == LP.parse_bounded_vlbytes_t 32 255) in\nLL.finalize_bounded_vlbytes 32 255 input pos len", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fsti", "name": "Parsers.TicketContents12.ticketContents12_parser_kind", "original_source_type": "", "source_type": "val ticketContents12_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let ticketContents12_parser_kind = LP.strong_parser_kind 53 53 None", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 34, "start_col": 67, "end_line": 34, "end_col": 99 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.ProtocolVersion\nopen Parsers.CipherSuite\nopen Parsers.Boolean\n\n(* Type of field master_secret*)\ninclude Parsers.TicketContents12_master_secret\n\ntype ticketContents12 = {\n pv : protocolVersion;\n cs : cipherSuite;\n ems : boolean;\n master_secret : ticketContents12_master_secret;\n}", "dependencies": { "source_file": "Parsers.TicketContents12.fsti", "checked_file": "Parsers.TicketContents12.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "Parsers.ProtocolVersion.fsti.checked", "Parsers.CipherSuite.fsti.checked", "Parsers.Boolean.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let ticketContents12_parser_kind =", "completed_definiton": "LP.strong_parser_kind 53 53 None", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fsti", "name": "Parsers.TicketContents12.clens_ticketContents12_ems", "original_source_type": "val clens_ticketContents12_ems:LL.clens ticketContents12 boolean", "source_type": "val clens_ticketContents12_ems:LL.clens ticketContents12 boolean", "source_definition": "let clens_ticketContents12_ems : LL.clens ticketContents12 boolean = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.ems);\n}", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 67, "start_col": 2, "end_line": 68, "end_col": 34 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.ProtocolVersion\nopen Parsers.CipherSuite\nopen Parsers.Boolean\n\n(* Type of field master_secret*)\ninclude Parsers.TicketContents12_master_secret\n\ntype ticketContents12 = {\n pv : protocolVersion;\n cs : cipherSuite;\n ems : boolean;\n master_secret : ticketContents12_master_secret;\n}\n\ninline_for_extraction noextract let ticketContents12_parser_kind = LP.strong_parser_kind 53 53 None\n\nnoextract val ticketContents12_parser: LP.parser ticketContents12_parser_kind ticketContents12\n\nnoextract val ticketContents12_serializer: LP.serializer ticketContents12_parser\n\nnoextract val ticketContents12_bytesize (x:ticketContents12) : GTot nat\n\nnoextract val ticketContents12_bytesize_eq (x:ticketContents12) : Lemma (ticketContents12_bytesize x == Seq.length (LP.serialize ticketContents12_serializer x))\n\nval ticketContents12_parser32: LS.parser32 ticketContents12_parser\n\nval ticketContents12_serializer32: LS.serializer32 ticketContents12_serializer\n\nval ticketContents12_size32: LSZ.size32 ticketContents12_serializer\n\nval ticketContents12_validator: LL.validator ticketContents12_parser\n\nlet ticketContents12_jumper: LL.jumper ticketContents12_parser = LL.jump_constant_size ticketContents12_parser 53ul ()\n\nval ticketContents12_bytesize_eqn (x: ticketContents12) : Lemma (ticketContents12_bytesize x == (protocolVersion_bytesize (x.pv)) + (cipherSuite_bytesize (x.cs)) + (boolean_bytesize (x.ems)) + (ticketContents12_master_secret_bytesize (x.master_secret))) [SMTPat (ticketContents12_bytesize x)]\n\nnoextract let clens_ticketContents12_pv : LL.clens ticketContents12 protocolVersion = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.pv);\n}\n\nnoextract let clens_ticketContents12_cs : LL.clens ticketContents12 cipherSuite = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.cs);\n}", "dependencies": { "source_file": "Parsers.TicketContents12.fsti", "checked_file": "Parsers.TicketContents12.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "Parsers.ProtocolVersion.fsti.checked", "Parsers.CipherSuite.fsti.checked", "Parsers.Boolean.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.TicketContents12.ticketContents12 Parsers.Boolean.boolean", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.Mkclens", "Parsers.TicketContents12.ticketContents12", "Parsers.Boolean.boolean", "Prims.l_True", "Parsers.TicketContents12.__proj__MkticketContents12__item__ems" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val clens_ticketContents12_ems:LL.clens ticketContents12 boolean\nlet clens_ticketContents12_ems:LL.clens ticketContents12 boolean =", "completed_definiton": "{ LL.clens_cond = (fun _ -> True); LL.clens_get = (fun x -> x.ems) }", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fsti", "name": "Parsers.TicketContents12.clens_ticketContents12_cs", "original_source_type": "val clens_ticketContents12_cs:LL.clens ticketContents12 cipherSuite", "source_type": "val clens_ticketContents12_cs:LL.clens ticketContents12 cipherSuite", "source_definition": "let clens_ticketContents12_cs : LL.clens ticketContents12 cipherSuite = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.cs);\n}", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 62, "start_col": 2, "end_line": 63, "end_col": 33 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.ProtocolVersion\nopen Parsers.CipherSuite\nopen Parsers.Boolean\n\n(* Type of field master_secret*)\ninclude Parsers.TicketContents12_master_secret\n\ntype ticketContents12 = {\n pv : protocolVersion;\n cs : cipherSuite;\n ems : boolean;\n master_secret : ticketContents12_master_secret;\n}\n\ninline_for_extraction noextract let ticketContents12_parser_kind = LP.strong_parser_kind 53 53 None\n\nnoextract val ticketContents12_parser: LP.parser ticketContents12_parser_kind ticketContents12\n\nnoextract val ticketContents12_serializer: LP.serializer ticketContents12_parser\n\nnoextract val ticketContents12_bytesize (x:ticketContents12) : GTot nat\n\nnoextract val ticketContents12_bytesize_eq (x:ticketContents12) : Lemma (ticketContents12_bytesize x == Seq.length (LP.serialize ticketContents12_serializer x))\n\nval ticketContents12_parser32: LS.parser32 ticketContents12_parser\n\nval ticketContents12_serializer32: LS.serializer32 ticketContents12_serializer\n\nval ticketContents12_size32: LSZ.size32 ticketContents12_serializer\n\nval ticketContents12_validator: LL.validator ticketContents12_parser\n\nlet ticketContents12_jumper: LL.jumper ticketContents12_parser = LL.jump_constant_size ticketContents12_parser 53ul ()\n\nval ticketContents12_bytesize_eqn (x: ticketContents12) : Lemma (ticketContents12_bytesize x == (protocolVersion_bytesize (x.pv)) + (cipherSuite_bytesize (x.cs)) + (boolean_bytesize (x.ems)) + (ticketContents12_master_secret_bytesize (x.master_secret))) [SMTPat (ticketContents12_bytesize x)]\n\nnoextract let clens_ticketContents12_pv : LL.clens ticketContents12 protocolVersion = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.pv);\n}", "dependencies": { "source_file": "Parsers.TicketContents12.fsti", "checked_file": "Parsers.TicketContents12.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "Parsers.ProtocolVersion.fsti.checked", "Parsers.CipherSuite.fsti.checked", "Parsers.Boolean.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.TicketContents12.ticketContents12\n Parsers.CipherSuite.cipherSuite", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.Mkclens", "Parsers.TicketContents12.ticketContents12", "Parsers.CipherSuite.cipherSuite", "Prims.l_True", "Parsers.TicketContents12.__proj__MkticketContents12__item__cs" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val clens_ticketContents12_cs:LL.clens ticketContents12 cipherSuite\nlet clens_ticketContents12_cs:LL.clens ticketContents12 cipherSuite =", "completed_definiton": "{ LL.clens_cond = (fun _ -> True); LL.clens_get = (fun x -> x.cs) }", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fsti", "name": "Parsers.TicketContents12.clens_ticketContents12_pv", "original_source_type": "val clens_ticketContents12_pv:LL.clens ticketContents12 protocolVersion", "source_type": "val clens_ticketContents12_pv:LL.clens ticketContents12 protocolVersion", "source_definition": "let clens_ticketContents12_pv : LL.clens ticketContents12 protocolVersion = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.pv);\n}", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 57, "start_col": 2, "end_line": 58, "end_col": 33 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.ProtocolVersion\nopen Parsers.CipherSuite\nopen Parsers.Boolean\n\n(* Type of field master_secret*)\ninclude Parsers.TicketContents12_master_secret\n\ntype ticketContents12 = {\n pv : protocolVersion;\n cs : cipherSuite;\n ems : boolean;\n master_secret : ticketContents12_master_secret;\n}\n\ninline_for_extraction noextract let ticketContents12_parser_kind = LP.strong_parser_kind 53 53 None\n\nnoextract val ticketContents12_parser: LP.parser ticketContents12_parser_kind ticketContents12\n\nnoextract val ticketContents12_serializer: LP.serializer ticketContents12_parser\n\nnoextract val ticketContents12_bytesize (x:ticketContents12) : GTot nat\n\nnoextract val ticketContents12_bytesize_eq (x:ticketContents12) : Lemma (ticketContents12_bytesize x == Seq.length (LP.serialize ticketContents12_serializer x))\n\nval ticketContents12_parser32: LS.parser32 ticketContents12_parser\n\nval ticketContents12_serializer32: LS.serializer32 ticketContents12_serializer\n\nval ticketContents12_size32: LSZ.size32 ticketContents12_serializer\n\nval ticketContents12_validator: LL.validator ticketContents12_parser\n\nlet ticketContents12_jumper: LL.jumper ticketContents12_parser = LL.jump_constant_size ticketContents12_parser 53ul ()\n\nval ticketContents12_bytesize_eqn (x: ticketContents12) : Lemma (ticketContents12_bytesize x == (protocolVersion_bytesize (x.pv)) + (cipherSuite_bytesize (x.cs)) + (boolean_bytesize (x.ems)) + (ticketContents12_master_secret_bytesize (x.master_secret))) [SMTPat (ticketContents12_bytesize x)]", "dependencies": { "source_file": "Parsers.TicketContents12.fsti", "checked_file": "Parsers.TicketContents12.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "Parsers.ProtocolVersion.fsti.checked", "Parsers.CipherSuite.fsti.checked", "Parsers.Boolean.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.TicketContents12.ticketContents12\n Parsers.ProtocolVersion.protocolVersion", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.Mkclens", "Parsers.TicketContents12.ticketContents12", "Parsers.ProtocolVersion.protocolVersion", "Prims.l_True", "Parsers.TicketContents12.__proj__MkticketContents12__item__pv" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val clens_ticketContents12_pv:LL.clens ticketContents12 protocolVersion\nlet clens_ticketContents12_pv:LL.clens ticketContents12 protocolVersion =", "completed_definiton": "{ LL.clens_cond = (fun _ -> True); LL.clens_get = (fun x -> x.pv) }", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fsti", "name": "Parsers.TicketContents12.clens_ticketContents12_master_secret", "original_source_type": "val clens_ticketContents12_master_secret:LL.clens ticketContents12 ticketContents12_master_secret", "source_type": "val clens_ticketContents12_master_secret:LL.clens ticketContents12 ticketContents12_master_secret", "source_definition": "let clens_ticketContents12_master_secret : LL.clens ticketContents12 ticketContents12_master_secret = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.master_secret);\n}", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 72, "start_col": 2, "end_line": 73, "end_col": 44 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.ProtocolVersion\nopen Parsers.CipherSuite\nopen Parsers.Boolean\n\n(* Type of field master_secret*)\ninclude Parsers.TicketContents12_master_secret\n\ntype ticketContents12 = {\n pv : protocolVersion;\n cs : cipherSuite;\n ems : boolean;\n master_secret : ticketContents12_master_secret;\n}\n\ninline_for_extraction noextract let ticketContents12_parser_kind = LP.strong_parser_kind 53 53 None\n\nnoextract val ticketContents12_parser: LP.parser ticketContents12_parser_kind ticketContents12\n\nnoextract val ticketContents12_serializer: LP.serializer ticketContents12_parser\n\nnoextract val ticketContents12_bytesize (x:ticketContents12) : GTot nat\n\nnoextract val ticketContents12_bytesize_eq (x:ticketContents12) : Lemma (ticketContents12_bytesize x == Seq.length (LP.serialize ticketContents12_serializer x))\n\nval ticketContents12_parser32: LS.parser32 ticketContents12_parser\n\nval ticketContents12_serializer32: LS.serializer32 ticketContents12_serializer\n\nval ticketContents12_size32: LSZ.size32 ticketContents12_serializer\n\nval ticketContents12_validator: LL.validator ticketContents12_parser\n\nlet ticketContents12_jumper: LL.jumper ticketContents12_parser = LL.jump_constant_size ticketContents12_parser 53ul ()\n\nval ticketContents12_bytesize_eqn (x: ticketContents12) : Lemma (ticketContents12_bytesize x == (protocolVersion_bytesize (x.pv)) + (cipherSuite_bytesize (x.cs)) + (boolean_bytesize (x.ems)) + (ticketContents12_master_secret_bytesize (x.master_secret))) [SMTPat (ticketContents12_bytesize x)]\n\nnoextract let clens_ticketContents12_pv : LL.clens ticketContents12 protocolVersion = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.pv);\n}\n\nnoextract let clens_ticketContents12_cs : LL.clens ticketContents12 cipherSuite = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.cs);\n}\n\nnoextract let clens_ticketContents12_ems : LL.clens ticketContents12 boolean = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.ems);\n}", "dependencies": { "source_file": "Parsers.TicketContents12.fsti", "checked_file": "Parsers.TicketContents12.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "Parsers.ProtocolVersion.fsti.checked", "Parsers.CipherSuite.fsti.checked", "Parsers.Boolean.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.TicketContents12.ticketContents12\n Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.Mkclens", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "Prims.l_True", "Parsers.TicketContents12.__proj__MkticketContents12__item__master_secret" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val clens_ticketContents12_master_secret:LL.clens ticketContents12 ticketContents12_master_secret\nlet clens_ticketContents12_master_secret:LL.clens ticketContents12 ticketContents12_master_secret =", "completed_definiton": "{ LL.clens_cond = (fun _ -> True); LL.clens_get = (fun x -> x.master_secret) }", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12.fsti", "name": "Parsers.TicketContents12.ticketContents12_jumper", "original_source_type": "val ticketContents12_jumper:LL.jumper ticketContents12_parser", "source_type": "val ticketContents12_jumper:LL.jumper ticketContents12_parser", "source_definition": "let ticketContents12_jumper: LL.jumper ticketContents12_parser = LL.jump_constant_size ticketContents12_parser 53ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 52, "start_col": 65, "end_line": 52, "end_col": 118 }, "file_context": "module Parsers.TicketContents12\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\nopen Parsers.ProtocolVersion\nopen Parsers.CipherSuite\nopen Parsers.Boolean\n\n(* Type of field master_secret*)\ninclude Parsers.TicketContents12_master_secret\n\ntype ticketContents12 = {\n pv : protocolVersion;\n cs : cipherSuite;\n ems : boolean;\n master_secret : ticketContents12_master_secret;\n}\n\ninline_for_extraction noextract let ticketContents12_parser_kind = LP.strong_parser_kind 53 53 None\n\nnoextract val ticketContents12_parser: LP.parser ticketContents12_parser_kind ticketContents12\n\nnoextract val ticketContents12_serializer: LP.serializer ticketContents12_parser\n\nnoextract val ticketContents12_bytesize (x:ticketContents12) : GTot nat\n\nnoextract val ticketContents12_bytesize_eq (x:ticketContents12) : Lemma (ticketContents12_bytesize x == Seq.length (LP.serialize ticketContents12_serializer x))\n\nval ticketContents12_parser32: LS.parser32 ticketContents12_parser\n\nval ticketContents12_serializer32: LS.serializer32 ticketContents12_serializer\n\nval ticketContents12_size32: LSZ.size32 ticketContents12_serializer\n\nval ticketContents12_validator: LL.validator ticketContents12_parser", "dependencies": { "source_file": "Parsers.TicketContents12.fsti", "checked_file": "Parsers.TicketContents12.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents12_master_secret.fsti.checked", "Parsers.ProtocolVersion.fsti.checked", "Parsers.CipherSuite.fsti.checked", "Parsers.Boolean.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12_master_secret" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.Boolean" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.ProtocolVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.TicketContents12.ticketContents12_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.jump_constant_size", "Parsers.TicketContents12.ticketContents12_parser_kind", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.ticketContents12_parser", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12_jumper:LL.jumper ticketContents12_parser\nlet ticketContents12_jumper:LL.jumper ticketContents12_parser =", "completed_definiton": "LL.jump_constant_size ticketContents12_parser 53ul ()", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.random_sample", "original_source_type": "val random_sample: len:uint32_t -> out:uint8_p ->\n ST unit random_sample_pre random_sample_post", "source_type": "val random_sample: len:uint32_t -> out:uint8_p ->\n ST unit random_sample_pre random_sample_post", "source_definition": "let random_sample len out =\n OpenSSL.random_sample len out", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 42, "start_col": 2, "end_line": 42, "end_col": 31 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "len: EverCrypt.Helpers.uint32_t -> out: EverCrypt.Helpers.uint8_p\n -> FStar.HyperStack.ST.ST Prims.unit", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.Helpers.uint32_t", "EverCrypt.Helpers.uint8_p", "EverCrypt.OpenSSL.random_sample", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val random_sample: len:uint32_t -> out:uint8_p ->\n ST unit random_sample_pre random_sample_post\nlet random_sample len out =", "completed_definiton": "OpenSSL.random_sample len out", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.random_init", "original_source_type": "val random_init: unit ->\n ST uint32_t random_init_pre random_init_post", "source_type": "val random_init: unit ->\n ST uint32_t random_init_pre random_init_post", "source_definition": "let random_init () =\n OpenSSL.random_init ()", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 39, "start_col": 2, "end_line": 39, "end_col": 24 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit -> FStar.HyperStack.ST.ST EverCrypt.Helpers.uint32_t", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Prims.unit", "EverCrypt.OpenSSL.random_init", "EverCrypt.Helpers.uint32_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val random_init: unit ->\n ST uint32_t random_init_pre random_init_post\nlet random_init () =", "completed_definiton": "OpenSSL.random_init ()", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.dh_load_group", "original_source_type": "val dh_load_group:\n dh_p: uint8_p ->\n dh_p_len: uint32_t ->\n dh_g: uint8_p ->\n dh_g_len: uint32_t ->\n dh_q: uint8_p ->\n dh_q_len: uint32_t ->\n ST dh_state\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)", "source_type": "val dh_load_group:\n dh_p: uint8_p ->\n dh_p_len: uint32_t ->\n dh_g: uint8_p ->\n dh_g_len: uint32_t ->\n dh_q: uint8_p ->\n dh_q_len: uint32_t ->\n ST dh_state\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)", "source_definition": "let dh_load_group dh_p dh_p_len dh_g dh_g_len dh_q dh_q_len =\n let st: dh_state_s =\n if openssl () then\n DH_OPENSSL (OpenSSL.dh_load_group dh_p dh_p_len dh_g dh_g_len dh_q dh_q_len)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_load_group)\"\n in\n B.malloc HS.root st 1ul", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 436, "start_col": 61, "end_line": 443, "end_col": 25 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"\n\nlet aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk\n\n[@CAbstractStruct]\nnoeq type aes256_key_s =\n | AES256_OPENSSL: st:Dyn.dyn -> aes256_key_s\n | AES256_BCRYPT: st:Dyn.dyn -> aes256_key_s\n | AES256_HACL: w:uint8_p -> sbox:uint8_p -> aes256_key_s\n\nlet aes256_create k =\n let st =\n if hacl () then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes256_compute k plain cipher =\n let k = !*k in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n Hacl.aes256_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_compute)\"\n\nlet aes256_free pk =\n let k = !*pk in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_free)\";\n B.free pk\n\n/// AES128-GCM\n\n#set-options \"--admit_smt_queries true\"\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes128_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm128_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes128_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm128_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n vale_aes128_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_encrypt)\"\n\nlet aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then\n begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n let r = vale_aes128_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_decrypt)\"\n\n/// AES256-GCM\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes256_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm256_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes256_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm256_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n vale_aes256_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_encrypt)\"\n\nlet aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n let r = vale_aes256_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_decrypt)\"\n\n\n/// AEAD\n\n[@CAbstractStruct]\nprivate noeq type _aead_state =\n | AEAD_OPENSSL: st:Dyn.dyn -> _aead_state\n | AEAD_BCRYPT: st:Dyn.dyn -> _aead_state\n | AEAD_AES128_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_AES256_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_CHACHA20_POLY1305_HACL: k:uint8_p -> _aead_state\n\nlet aead_state_s = _aead_state\n\nlet aead_create alg k =\n let st: aead_state_s =\n match alg with\n | AES128_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 176ul in\n Vale.old_aes128_key_expansion k xk;\n AEAD_AES128_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES128_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES128_GCM)\"\n | AES256_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 240ul in\n Vale.old_aes256_key_expansion k xk;\n AEAD_AES256_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES256_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES256_GCM)\"\n | CHACHA20_POLY1305 ->\n if hacl () then\n let k0 = B.malloc HS.root 0uy 32ul in\n blit k 0ul k0 0ul 32ul;\n AEAD_CHACHA20_POLY1305_HACL k0\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.CHACHA20_POLY1305 k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/CHACHA20_POLY1305)\"\n in\n B.malloc HS.root st 1ul\n\nlet aead_encrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n Hacl.Chacha20Poly1305_32.aead_encrypt key iv adlen ad len plaintext cipher tag\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_encrypt)\"\n\nlet aead_decrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n let r = Hacl.Chacha20Poly1305_32.aead_decrypt key iv adlen ad len plaintext cipher tag in\n U32.(1ul -^ r)\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_decrypt)\"\n\nlet aead_free pk =\n let k = !*pk in\n if AEAD_AES128_GCM_VALE? k then\n let AEAD_AES128_GCM_VALE xk = k in\n B.free xk\n else if AEAD_AES256_GCM_VALE? k then\n let AEAD_AES256_GCM_VALE xk = k in\n B.free xk\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let AEAD_CHACHA20_POLY1305_HACL key = k in\n B.free key\n else if AEAD_OPENSSL? k then\n OpenSSL.aead_free (AEAD_OPENSSL?.st k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_free)\";\n B.free pk\n\n/// DH\n\n[@CAbstractStruct]\nprivate noeq type _dh_state =\n | DH_OPENSSL: st:Dyn.dyn -> _dh_state\n | DH_DUMMY // Necessary placeholder or discriminators are not defined\n\nlet dh_state_s = _dh_state", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n dh_p: EverCrypt.Helpers.uint8_p ->\n dh_p_len: EverCrypt.Helpers.uint32_t ->\n dh_g: EverCrypt.Helpers.uint8_p ->\n dh_g_len: EverCrypt.Helpers.uint32_t ->\n dh_q: EverCrypt.Helpers.uint8_p ->\n dh_q_len: EverCrypt.Helpers.uint32_t\n -> FStar.HyperStack.ST.ST EverCrypt.dh_state", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.Helpers.uint8_p", "EverCrypt.Helpers.uint32_t", "LowStar.Buffer.malloc", "EverCrypt.dh_state_s", "FStar.Monotonic.HyperHeap.root", "FStar.UInt32.__uint_to_t", "LowStar.Monotonic.Buffer.mbuffer", "LowStar.Buffer.trivial_preorder", "Prims.l_and", "Prims.eq2", "Prims.nat", "LowStar.Monotonic.Buffer.length", "FStar.UInt32.v", "Prims.b2t", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "FStar.Monotonic.HyperHeap.rid", "LowStar.Monotonic.Buffer.frameOf", "LowStar.Monotonic.Buffer.freeable", "EverCrypt.DH_OPENSSL", "FStar.Dyn.dyn", "EverCrypt.OpenSSL.dh_load_group", "Prims.bool", "LowStar.Failure.failwith", "EverCrypt.openssl", "EverCrypt.dh_state" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val dh_load_group:\n dh_p: uint8_p ->\n dh_p_len: uint32_t ->\n dh_g: uint8_p ->\n dh_g_len: uint32_t ->\n dh_q: uint8_p ->\n dh_q_len: uint32_t ->\n ST dh_state\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)\nlet dh_load_group dh_p dh_p_len dh_g dh_g_len dh_q dh_q_len =", "completed_definiton": "let st:dh_state_s =\n if openssl ()\n then DH_OPENSSL (OpenSSL.dh_load_group dh_p dh_p_len dh_g dh_g_len dh_q dh_q_len)\n else LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_load_group)\"\nin\nB.malloc HS.root st 1ul", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.ecdh_compute", "original_source_type": "val ecdh_compute:\n st: ecdh_state ->\n inx: uint8_p ->\n iny: uint8_p ->\n out: uint8_p ->\n ST uint32_t\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)", "source_type": "val ecdh_compute:\n st: ecdh_state ->\n inx: uint8_p ->\n iny: uint8_p ->\n out: uint8_p ->\n ST uint32_t\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)", "source_definition": "let ecdh_compute st inx iny out =\n let s = !*st in\n if ECDH_OPENSSL? s then\n OpenSSL.ecdh_compute (ECDH_OPENSSL?.st s) inx iny out\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (ecdh_compute)\"", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 506, "start_col": 33, "end_line": 511, "end_col": 79 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"\n\nlet aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk\n\n[@CAbstractStruct]\nnoeq type aes256_key_s =\n | AES256_OPENSSL: st:Dyn.dyn -> aes256_key_s\n | AES256_BCRYPT: st:Dyn.dyn -> aes256_key_s\n | AES256_HACL: w:uint8_p -> sbox:uint8_p -> aes256_key_s\n\nlet aes256_create k =\n let st =\n if hacl () then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes256_compute k plain cipher =\n let k = !*k in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n Hacl.aes256_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_compute)\"\n\nlet aes256_free pk =\n let k = !*pk in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_free)\";\n B.free pk\n\n/// AES128-GCM\n\n#set-options \"--admit_smt_queries true\"\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes128_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm128_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes128_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm128_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n vale_aes128_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_encrypt)\"\n\nlet aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then\n begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n let r = vale_aes128_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_decrypt)\"\n\n/// AES256-GCM\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes256_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm256_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes256_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm256_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n vale_aes256_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_encrypt)\"\n\nlet aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n let r = vale_aes256_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_decrypt)\"\n\n\n/// AEAD\n\n[@CAbstractStruct]\nprivate noeq type _aead_state =\n | AEAD_OPENSSL: st:Dyn.dyn -> _aead_state\n | AEAD_BCRYPT: st:Dyn.dyn -> _aead_state\n | AEAD_AES128_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_AES256_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_CHACHA20_POLY1305_HACL: k:uint8_p -> _aead_state\n\nlet aead_state_s = _aead_state\n\nlet aead_create alg k =\n let st: aead_state_s =\n match alg with\n | AES128_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 176ul in\n Vale.old_aes128_key_expansion k xk;\n AEAD_AES128_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES128_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES128_GCM)\"\n | AES256_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 240ul in\n Vale.old_aes256_key_expansion k xk;\n AEAD_AES256_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES256_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES256_GCM)\"\n | CHACHA20_POLY1305 ->\n if hacl () then\n let k0 = B.malloc HS.root 0uy 32ul in\n blit k 0ul k0 0ul 32ul;\n AEAD_CHACHA20_POLY1305_HACL k0\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.CHACHA20_POLY1305 k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/CHACHA20_POLY1305)\"\n in\n B.malloc HS.root st 1ul\n\nlet aead_encrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n Hacl.Chacha20Poly1305_32.aead_encrypt key iv adlen ad len plaintext cipher tag\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_encrypt)\"\n\nlet aead_decrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n let r = Hacl.Chacha20Poly1305_32.aead_decrypt key iv adlen ad len plaintext cipher tag in\n U32.(1ul -^ r)\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_decrypt)\"\n\nlet aead_free pk =\n let k = !*pk in\n if AEAD_AES128_GCM_VALE? k then\n let AEAD_AES128_GCM_VALE xk = k in\n B.free xk\n else if AEAD_AES256_GCM_VALE? k then\n let AEAD_AES256_GCM_VALE xk = k in\n B.free xk\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let AEAD_CHACHA20_POLY1305_HACL key = k in\n B.free key\n else if AEAD_OPENSSL? k then\n OpenSSL.aead_free (AEAD_OPENSSL?.st k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_free)\";\n B.free pk\n\n/// DH\n\n[@CAbstractStruct]\nprivate noeq type _dh_state =\n | DH_OPENSSL: st:Dyn.dyn -> _dh_state\n | DH_DUMMY // Necessary placeholder or discriminators are not defined\n\nlet dh_state_s = _dh_state\n\nlet dh_load_group dh_p dh_p_len dh_g dh_g_len dh_q dh_q_len =\n let st: dh_state_s =\n if openssl () then\n DH_OPENSSL (OpenSSL.dh_load_group dh_p dh_p_len dh_g dh_g_len dh_q dh_q_len)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_load_group)\"\n in\n B.malloc HS.root st 1ul\n\nlet dh_free_group st =\n let s : _dh_state = !*st in\n if DH_OPENSSL? s then\n OpenSSL.dh_free_group (DH_OPENSSL?.st s)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_free_group)\";\n B.free st\n\nlet dh_keygen st public =\n let s = !*st in\n if DH_OPENSSL? s then\n OpenSSL.dh_keygen (DH_OPENSSL?.st s) public\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_keygen)\"\n\nlet dh_compute st public public_len out =\n let s = !*st in\n if DH_OPENSSL? s then\n OpenSSL.dh_compute (DH_OPENSSL?.st s) public public_len out\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_compute)\"\n\n/// DH\n\n[@CAbstractStruct]\nprivate noeq type _ecdh_state =\n | ECDH_OPENSSL: st:Dyn.dyn -> _ecdh_state\n | ECDH_DUMMY // Necessary placeholder or discriminators are not defined\n\nlet ecdh_state_s = _ecdh_state\n\nlet ecdh_load_curve g =\n let st: ecdh_state_s =\n if openssl () then\n let g' = match g with\n | ECC_P256 -> OpenSSL.ECC_P256\n | ECC_P384 -> OpenSSL.ECC_P384\n | ECC_P521 -> OpenSSL.ECC_P521\n | ECC_X25519 -> OpenSSL.ECC_X25519\n | ECC_X448 -> OpenSSL.ECC_X448 in\n ECDH_OPENSSL (OpenSSL.ecdh_load_curve g')\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (ecdh_load_curve)\"\n in\n B.malloc HS.root st 1ul\n\nlet ecdh_free_curve st =\n let s : _ecdh_state = !*st in\n if ECDH_OPENSSL? s then\n OpenSSL.ecdh_free_curve (ECDH_OPENSSL?.st s)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (ecdh_free_curve)\";\n B.free st\n\nlet ecdh_keygen st outx outy =\n let s = !*st in\n if ECDH_OPENSSL? s then\n OpenSSL.ecdh_keygen (ECDH_OPENSSL?.st s) outx outy\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (ecdh_keygen)\"", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n st: EverCrypt.ecdh_state ->\n inx: EverCrypt.Helpers.uint8_p ->\n iny: EverCrypt.Helpers.uint8_p ->\n out: EverCrypt.Helpers.uint8_p\n -> FStar.HyperStack.ST.ST EverCrypt.Helpers.uint32_t", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.ecdh_state", "EverCrypt.Helpers.uint8_p", "EverCrypt.uu___is_ECDH_OPENSSL", "EverCrypt.OpenSSL.ecdh_compute", "EverCrypt.__proj__ECDH_OPENSSL__item__st", "EverCrypt.Helpers.uint32_t", "Prims.bool", "LowStar.Failure.failwith", "EverCrypt.ecdh_state_s", "LowStar.BufferOps.op_Bang_Star", "LowStar.Buffer.trivial_preorder" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ecdh_compute:\n st: ecdh_state ->\n inx: uint8_p ->\n iny: uint8_p ->\n out: uint8_p ->\n ST uint32_t\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)\nlet ecdh_compute st inx iny out =", "completed_definiton": "let s = !*st in\nif ECDH_OPENSSL? s\nthen OpenSSL.ecdh_compute (ECDH_OPENSSL?.st s) inx iny out\nelse LowStar.Failure.failwith \"ERROR: inconsistent configuration (ecdh_compute)\"", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.ecdh_state_s", "original_source_type": "val ecdh_state_s: Type0", "source_type": "val ecdh_state_s: Type0", "source_definition": "let ecdh_state_s = _ecdh_state", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 474, "start_col": 19, "end_line": 474, "end_col": 30 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"\n\nlet aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk\n\n[@CAbstractStruct]\nnoeq type aes256_key_s =\n | AES256_OPENSSL: st:Dyn.dyn -> aes256_key_s\n | AES256_BCRYPT: st:Dyn.dyn -> aes256_key_s\n | AES256_HACL: w:uint8_p -> sbox:uint8_p -> aes256_key_s\n\nlet aes256_create k =\n let st =\n if hacl () then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes256_compute k plain cipher =\n let k = !*k in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n Hacl.aes256_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_compute)\"\n\nlet aes256_free pk =\n let k = !*pk in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_free)\";\n B.free pk\n\n/// AES128-GCM\n\n#set-options \"--admit_smt_queries true\"\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes128_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm128_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes128_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm128_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n vale_aes128_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_encrypt)\"\n\nlet aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then\n begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n let r = vale_aes128_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_decrypt)\"\n\n/// AES256-GCM\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes256_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm256_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes256_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm256_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n vale_aes256_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_encrypt)\"\n\nlet aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n let r = vale_aes256_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_decrypt)\"\n\n\n/// AEAD\n\n[@CAbstractStruct]\nprivate noeq type _aead_state =\n | AEAD_OPENSSL: st:Dyn.dyn -> _aead_state\n | AEAD_BCRYPT: st:Dyn.dyn -> _aead_state\n | AEAD_AES128_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_AES256_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_CHACHA20_POLY1305_HACL: k:uint8_p -> _aead_state\n\nlet aead_state_s = _aead_state\n\nlet aead_create alg k =\n let st: aead_state_s =\n match alg with\n | AES128_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 176ul in\n Vale.old_aes128_key_expansion k xk;\n AEAD_AES128_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES128_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES128_GCM)\"\n | AES256_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 240ul in\n Vale.old_aes256_key_expansion k xk;\n AEAD_AES256_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES256_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES256_GCM)\"\n | CHACHA20_POLY1305 ->\n if hacl () then\n let k0 = B.malloc HS.root 0uy 32ul in\n blit k 0ul k0 0ul 32ul;\n AEAD_CHACHA20_POLY1305_HACL k0\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.CHACHA20_POLY1305 k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/CHACHA20_POLY1305)\"\n in\n B.malloc HS.root st 1ul\n\nlet aead_encrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n Hacl.Chacha20Poly1305_32.aead_encrypt key iv adlen ad len plaintext cipher tag\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_encrypt)\"\n\nlet aead_decrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n let r = Hacl.Chacha20Poly1305_32.aead_decrypt key iv adlen ad len plaintext cipher tag in\n U32.(1ul -^ r)\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_decrypt)\"\n\nlet aead_free pk =\n let k = !*pk in\n if AEAD_AES128_GCM_VALE? k then\n let AEAD_AES128_GCM_VALE xk = k in\n B.free xk\n else if AEAD_AES256_GCM_VALE? k then\n let AEAD_AES256_GCM_VALE xk = k in\n B.free xk\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let AEAD_CHACHA20_POLY1305_HACL key = k in\n B.free key\n else if AEAD_OPENSSL? k then\n OpenSSL.aead_free (AEAD_OPENSSL?.st k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_free)\";\n B.free pk\n\n/// DH\n\n[@CAbstractStruct]\nprivate noeq type _dh_state =\n | DH_OPENSSL: st:Dyn.dyn -> _dh_state\n | DH_DUMMY // Necessary placeholder or discriminators are not defined\n\nlet dh_state_s = _dh_state\n\nlet dh_load_group dh_p dh_p_len dh_g dh_g_len dh_q dh_q_len =\n let st: dh_state_s =\n if openssl () then\n DH_OPENSSL (OpenSSL.dh_load_group dh_p dh_p_len dh_g dh_g_len dh_q dh_q_len)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_load_group)\"\n in\n B.malloc HS.root st 1ul\n\nlet dh_free_group st =\n let s : _dh_state = !*st in\n if DH_OPENSSL? s then\n OpenSSL.dh_free_group (DH_OPENSSL?.st s)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_free_group)\";\n B.free st\n\nlet dh_keygen st public =\n let s = !*st in\n if DH_OPENSSL? s then\n OpenSSL.dh_keygen (DH_OPENSSL?.st s) public\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_keygen)\"\n\nlet dh_compute st public public_len out =\n let s = !*st in\n if DH_OPENSSL? s then\n OpenSSL.dh_compute (DH_OPENSSL?.st s) public public_len out\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_compute)\"\n\n/// DH\n\n[@CAbstractStruct]\nprivate noeq type _ecdh_state =\n | ECDH_OPENSSL: st:Dyn.dyn -> _ecdh_state\n | ECDH_DUMMY // Necessary placeholder or discriminators are not defined", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "EverCrypt._ecdh_state" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ecdh_state_s: Type0\nlet ecdh_state_s =", "completed_definiton": "_ecdh_state", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.dh_compute", "original_source_type": "val dh_compute:\n st: dh_state ->\n public: uint8_p ->\n public_len: uint32_t ->\n out: uint8_p ->\n ST uint32_t\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)", "source_type": "val dh_compute:\n st: dh_state ->\n public: uint8_p ->\n public_len: uint32_t ->\n out: uint8_p ->\n ST uint32_t\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)", "source_definition": "let dh_compute st public public_len out =\n let s = !*st in\n if DH_OPENSSL? s then\n OpenSSL.dh_compute (DH_OPENSSL?.st s) public public_len out\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_compute)\"", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 460, "start_col": 41, "end_line": 465, "end_col": 77 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"\n\nlet aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk\n\n[@CAbstractStruct]\nnoeq type aes256_key_s =\n | AES256_OPENSSL: st:Dyn.dyn -> aes256_key_s\n | AES256_BCRYPT: st:Dyn.dyn -> aes256_key_s\n | AES256_HACL: w:uint8_p -> sbox:uint8_p -> aes256_key_s\n\nlet aes256_create k =\n let st =\n if hacl () then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes256_compute k plain cipher =\n let k = !*k in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n Hacl.aes256_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_compute)\"\n\nlet aes256_free pk =\n let k = !*pk in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_free)\";\n B.free pk\n\n/// AES128-GCM\n\n#set-options \"--admit_smt_queries true\"\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes128_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm128_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes128_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm128_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n vale_aes128_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_encrypt)\"\n\nlet aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then\n begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n let r = vale_aes128_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_decrypt)\"\n\n/// AES256-GCM\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes256_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm256_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes256_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm256_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n vale_aes256_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_encrypt)\"\n\nlet aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n let r = vale_aes256_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_decrypt)\"\n\n\n/// AEAD\n\n[@CAbstractStruct]\nprivate noeq type _aead_state =\n | AEAD_OPENSSL: st:Dyn.dyn -> _aead_state\n | AEAD_BCRYPT: st:Dyn.dyn -> _aead_state\n | AEAD_AES128_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_AES256_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_CHACHA20_POLY1305_HACL: k:uint8_p -> _aead_state\n\nlet aead_state_s = _aead_state\n\nlet aead_create alg k =\n let st: aead_state_s =\n match alg with\n | AES128_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 176ul in\n Vale.old_aes128_key_expansion k xk;\n AEAD_AES128_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES128_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES128_GCM)\"\n | AES256_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 240ul in\n Vale.old_aes256_key_expansion k xk;\n AEAD_AES256_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES256_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES256_GCM)\"\n | CHACHA20_POLY1305 ->\n if hacl () then\n let k0 = B.malloc HS.root 0uy 32ul in\n blit k 0ul k0 0ul 32ul;\n AEAD_CHACHA20_POLY1305_HACL k0\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.CHACHA20_POLY1305 k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/CHACHA20_POLY1305)\"\n in\n B.malloc HS.root st 1ul\n\nlet aead_encrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n Hacl.Chacha20Poly1305_32.aead_encrypt key iv adlen ad len plaintext cipher tag\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_encrypt)\"\n\nlet aead_decrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n let r = Hacl.Chacha20Poly1305_32.aead_decrypt key iv adlen ad len plaintext cipher tag in\n U32.(1ul -^ r)\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_decrypt)\"\n\nlet aead_free pk =\n let k = !*pk in\n if AEAD_AES128_GCM_VALE? k then\n let AEAD_AES128_GCM_VALE xk = k in\n B.free xk\n else if AEAD_AES256_GCM_VALE? k then\n let AEAD_AES256_GCM_VALE xk = k in\n B.free xk\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let AEAD_CHACHA20_POLY1305_HACL key = k in\n B.free key\n else if AEAD_OPENSSL? k then\n OpenSSL.aead_free (AEAD_OPENSSL?.st k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_free)\";\n B.free pk\n\n/// DH\n\n[@CAbstractStruct]\nprivate noeq type _dh_state =\n | DH_OPENSSL: st:Dyn.dyn -> _dh_state\n | DH_DUMMY // Necessary placeholder or discriminators are not defined\n\nlet dh_state_s = _dh_state\n\nlet dh_load_group dh_p dh_p_len dh_g dh_g_len dh_q dh_q_len =\n let st: dh_state_s =\n if openssl () then\n DH_OPENSSL (OpenSSL.dh_load_group dh_p dh_p_len dh_g dh_g_len dh_q dh_q_len)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_load_group)\"\n in\n B.malloc HS.root st 1ul\n\nlet dh_free_group st =\n let s : _dh_state = !*st in\n if DH_OPENSSL? s then\n OpenSSL.dh_free_group (DH_OPENSSL?.st s)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_free_group)\";\n B.free st\n\nlet dh_keygen st public =\n let s = !*st in\n if DH_OPENSSL? s then\n OpenSSL.dh_keygen (DH_OPENSSL?.st s) public\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_keygen)\"", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n st: EverCrypt.dh_state ->\n public: EverCrypt.Helpers.uint8_p ->\n public_len: EverCrypt.Helpers.uint32_t ->\n out: EverCrypt.Helpers.uint8_p\n -> FStar.HyperStack.ST.ST EverCrypt.Helpers.uint32_t", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.dh_state", "EverCrypt.Helpers.uint8_p", "EverCrypt.Helpers.uint32_t", "EverCrypt.uu___is_DH_OPENSSL", "EverCrypt.OpenSSL.dh_compute", "EverCrypt.__proj__DH_OPENSSL__item__st", "Prims.bool", "LowStar.Failure.failwith", "EverCrypt.dh_state_s", "LowStar.BufferOps.op_Bang_Star", "LowStar.Buffer.trivial_preorder" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val dh_compute:\n st: dh_state ->\n public: uint8_p ->\n public_len: uint32_t ->\n out: uint8_p ->\n ST uint32_t\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)\nlet dh_compute st public public_len out =", "completed_definiton": "let s = !*st in\nif DH_OPENSSL? s\nthen OpenSSL.dh_compute (DH_OPENSSL?.st s) public public_len out\nelse LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_compute)\"", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.dh_free_group", "original_source_type": "val dh_free_group:\n st: dh_state ->\n ST unit\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)", "source_type": "val dh_free_group:\n st: dh_state ->\n ST unit\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)", "source_definition": "let dh_free_group st =\n let s : _dh_state = !*st in\n if DH_OPENSSL? s then\n OpenSSL.dh_free_group (DH_OPENSSL?.st s)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_free_group)\";\n B.free st", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 445, "start_col": 22, "end_line": 451, "end_col": 11 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"\n\nlet aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk\n\n[@CAbstractStruct]\nnoeq type aes256_key_s =\n | AES256_OPENSSL: st:Dyn.dyn -> aes256_key_s\n | AES256_BCRYPT: st:Dyn.dyn -> aes256_key_s\n | AES256_HACL: w:uint8_p -> sbox:uint8_p -> aes256_key_s\n\nlet aes256_create k =\n let st =\n if hacl () then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes256_compute k plain cipher =\n let k = !*k in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n Hacl.aes256_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_compute)\"\n\nlet aes256_free pk =\n let k = !*pk in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_free)\";\n B.free pk\n\n/// AES128-GCM\n\n#set-options \"--admit_smt_queries true\"\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes128_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm128_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes128_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm128_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n vale_aes128_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_encrypt)\"\n\nlet aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then\n begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n let r = vale_aes128_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_decrypt)\"\n\n/// AES256-GCM\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes256_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm256_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes256_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm256_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n vale_aes256_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_encrypt)\"\n\nlet aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n let r = vale_aes256_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_decrypt)\"\n\n\n/// AEAD\n\n[@CAbstractStruct]\nprivate noeq type _aead_state =\n | AEAD_OPENSSL: st:Dyn.dyn -> _aead_state\n | AEAD_BCRYPT: st:Dyn.dyn -> _aead_state\n | AEAD_AES128_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_AES256_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_CHACHA20_POLY1305_HACL: k:uint8_p -> _aead_state\n\nlet aead_state_s = _aead_state\n\nlet aead_create alg k =\n let st: aead_state_s =\n match alg with\n | AES128_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 176ul in\n Vale.old_aes128_key_expansion k xk;\n AEAD_AES128_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES128_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES128_GCM)\"\n | AES256_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 240ul in\n Vale.old_aes256_key_expansion k xk;\n AEAD_AES256_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES256_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES256_GCM)\"\n | CHACHA20_POLY1305 ->\n if hacl () then\n let k0 = B.malloc HS.root 0uy 32ul in\n blit k 0ul k0 0ul 32ul;\n AEAD_CHACHA20_POLY1305_HACL k0\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.CHACHA20_POLY1305 k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/CHACHA20_POLY1305)\"\n in\n B.malloc HS.root st 1ul\n\nlet aead_encrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n Hacl.Chacha20Poly1305_32.aead_encrypt key iv adlen ad len plaintext cipher tag\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_encrypt)\"\n\nlet aead_decrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n let r = Hacl.Chacha20Poly1305_32.aead_decrypt key iv adlen ad len plaintext cipher tag in\n U32.(1ul -^ r)\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_decrypt)\"\n\nlet aead_free pk =\n let k = !*pk in\n if AEAD_AES128_GCM_VALE? k then\n let AEAD_AES128_GCM_VALE xk = k in\n B.free xk\n else if AEAD_AES256_GCM_VALE? k then\n let AEAD_AES256_GCM_VALE xk = k in\n B.free xk\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let AEAD_CHACHA20_POLY1305_HACL key = k in\n B.free key\n else if AEAD_OPENSSL? k then\n OpenSSL.aead_free (AEAD_OPENSSL?.st k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_free)\";\n B.free pk\n\n/// DH\n\n[@CAbstractStruct]\nprivate noeq type _dh_state =\n | DH_OPENSSL: st:Dyn.dyn -> _dh_state\n | DH_DUMMY // Necessary placeholder or discriminators are not defined\n\nlet dh_state_s = _dh_state\n\nlet dh_load_group dh_p dh_p_len dh_g dh_g_len dh_q dh_q_len =\n let st: dh_state_s =\n if openssl () then\n DH_OPENSSL (OpenSSL.dh_load_group dh_p dh_p_len dh_g dh_g_len dh_q dh_q_len)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_load_group)\"\n in\n B.malloc HS.root st 1ul", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "st: EverCrypt.dh_state -> FStar.HyperStack.ST.ST Prims.unit", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.dh_state", "LowStar.Monotonic.Buffer.free", "EverCrypt.dh_state_s", "LowStar.Buffer.trivial_preorder", "Prims.unit", "EverCrypt.uu___is_DH_OPENSSL", "EverCrypt.OpenSSL.dh_free_group", "EverCrypt.__proj__DH_OPENSSL__item__st", "Prims.bool", "LowStar.Failure.failwith", "EverCrypt._dh_state", "LowStar.BufferOps.op_Bang_Star" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val dh_free_group:\n st: dh_state ->\n ST unit\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)\nlet dh_free_group st =", "completed_definiton": "let s:_dh_state = !*st in\nif DH_OPENSSL? s\nthen OpenSSL.dh_free_group (DH_OPENSSL?.st s)\nelse LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_free_group)\";\nB.free st", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.dh_keygen", "original_source_type": "val dh_keygen:\n st: dh_state ->\n out: uint8_p ->\n ST uint32_t\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)", "source_type": "val dh_keygen:\n st: dh_state ->\n out: uint8_p ->\n ST uint32_t\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)", "source_definition": "let dh_keygen st public =\n let s = !*st in\n if DH_OPENSSL? s then\n OpenSSL.dh_keygen (DH_OPENSSL?.st s) public\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_keygen)\"", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 453, "start_col": 25, "end_line": 458, "end_col": 76 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"\n\nlet aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk\n\n[@CAbstractStruct]\nnoeq type aes256_key_s =\n | AES256_OPENSSL: st:Dyn.dyn -> aes256_key_s\n | AES256_BCRYPT: st:Dyn.dyn -> aes256_key_s\n | AES256_HACL: w:uint8_p -> sbox:uint8_p -> aes256_key_s\n\nlet aes256_create k =\n let st =\n if hacl () then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes256_compute k plain cipher =\n let k = !*k in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n Hacl.aes256_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_compute)\"\n\nlet aes256_free pk =\n let k = !*pk in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_free)\";\n B.free pk\n\n/// AES128-GCM\n\n#set-options \"--admit_smt_queries true\"\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes128_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm128_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes128_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm128_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n vale_aes128_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_encrypt)\"\n\nlet aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then\n begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n let r = vale_aes128_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_decrypt)\"\n\n/// AES256-GCM\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes256_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm256_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes256_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm256_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n vale_aes256_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_encrypt)\"\n\nlet aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n let r = vale_aes256_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_decrypt)\"\n\n\n/// AEAD\n\n[@CAbstractStruct]\nprivate noeq type _aead_state =\n | AEAD_OPENSSL: st:Dyn.dyn -> _aead_state\n | AEAD_BCRYPT: st:Dyn.dyn -> _aead_state\n | AEAD_AES128_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_AES256_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_CHACHA20_POLY1305_HACL: k:uint8_p -> _aead_state\n\nlet aead_state_s = _aead_state\n\nlet aead_create alg k =\n let st: aead_state_s =\n match alg with\n | AES128_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 176ul in\n Vale.old_aes128_key_expansion k xk;\n AEAD_AES128_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES128_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES128_GCM)\"\n | AES256_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 240ul in\n Vale.old_aes256_key_expansion k xk;\n AEAD_AES256_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES256_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES256_GCM)\"\n | CHACHA20_POLY1305 ->\n if hacl () then\n let k0 = B.malloc HS.root 0uy 32ul in\n blit k 0ul k0 0ul 32ul;\n AEAD_CHACHA20_POLY1305_HACL k0\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.CHACHA20_POLY1305 k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/CHACHA20_POLY1305)\"\n in\n B.malloc HS.root st 1ul\n\nlet aead_encrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n Hacl.Chacha20Poly1305_32.aead_encrypt key iv adlen ad len plaintext cipher tag\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_encrypt)\"\n\nlet aead_decrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n let r = Hacl.Chacha20Poly1305_32.aead_decrypt key iv adlen ad len plaintext cipher tag in\n U32.(1ul -^ r)\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_decrypt)\"\n\nlet aead_free pk =\n let k = !*pk in\n if AEAD_AES128_GCM_VALE? k then\n let AEAD_AES128_GCM_VALE xk = k in\n B.free xk\n else if AEAD_AES256_GCM_VALE? k then\n let AEAD_AES256_GCM_VALE xk = k in\n B.free xk\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let AEAD_CHACHA20_POLY1305_HACL key = k in\n B.free key\n else if AEAD_OPENSSL? k then\n OpenSSL.aead_free (AEAD_OPENSSL?.st k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_free)\";\n B.free pk\n\n/// DH\n\n[@CAbstractStruct]\nprivate noeq type _dh_state =\n | DH_OPENSSL: st:Dyn.dyn -> _dh_state\n | DH_DUMMY // Necessary placeholder or discriminators are not defined\n\nlet dh_state_s = _dh_state\n\nlet dh_load_group dh_p dh_p_len dh_g dh_g_len dh_q dh_q_len =\n let st: dh_state_s =\n if openssl () then\n DH_OPENSSL (OpenSSL.dh_load_group dh_p dh_p_len dh_g dh_g_len dh_q dh_q_len)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_load_group)\"\n in\n B.malloc HS.root st 1ul\n\nlet dh_free_group st =\n let s : _dh_state = !*st in\n if DH_OPENSSL? s then\n OpenSSL.dh_free_group (DH_OPENSSL?.st s)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_free_group)\";\n B.free st", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "st: EverCrypt.dh_state -> out: EverCrypt.Helpers.uint8_p\n -> FStar.HyperStack.ST.ST EverCrypt.Helpers.uint32_t", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.dh_state", "EverCrypt.Helpers.uint8_p", "EverCrypt.uu___is_DH_OPENSSL", "EverCrypt.OpenSSL.dh_keygen", "EverCrypt.__proj__DH_OPENSSL__item__st", "EverCrypt.Helpers.uint32_t", "Prims.bool", "LowStar.Failure.failwith", "EverCrypt.dh_state_s", "LowStar.BufferOps.op_Bang_Star", "LowStar.Buffer.trivial_preorder" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val dh_keygen:\n st: dh_state ->\n out: uint8_p ->\n ST uint32_t\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)\nlet dh_keygen st public =", "completed_definiton": "let s = !*st in\nif DH_OPENSSL? s\nthen OpenSSL.dh_keygen (DH_OPENSSL?.st s) public\nelse LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_keygen)\"", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.aead_state_s", "original_source_type": "val aead_state_s: Type0", "source_type": "val aead_state_s: Type0", "source_definition": "let aead_state_s = _aead_state", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 340, "start_col": 19, "end_line": 340, "end_col": 30 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"\n\nlet aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk\n\n[@CAbstractStruct]\nnoeq type aes256_key_s =\n | AES256_OPENSSL: st:Dyn.dyn -> aes256_key_s\n | AES256_BCRYPT: st:Dyn.dyn -> aes256_key_s\n | AES256_HACL: w:uint8_p -> sbox:uint8_p -> aes256_key_s\n\nlet aes256_create k =\n let st =\n if hacl () then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes256_compute k plain cipher =\n let k = !*k in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n Hacl.aes256_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_compute)\"\n\nlet aes256_free pk =\n let k = !*pk in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_free)\";\n B.free pk\n\n/// AES128-GCM\n\n#set-options \"--admit_smt_queries true\"\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes128_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm128_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes128_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm128_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n vale_aes128_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_encrypt)\"\n\nlet aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then\n begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n let r = vale_aes128_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_decrypt)\"\n\n/// AES256-GCM\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes256_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm256_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes256_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm256_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n vale_aes256_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_encrypt)\"\n\nlet aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n let r = vale_aes256_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_decrypt)\"\n\n\n/// AEAD\n\n[@CAbstractStruct]\nprivate noeq type _aead_state =\n | AEAD_OPENSSL: st:Dyn.dyn -> _aead_state\n | AEAD_BCRYPT: st:Dyn.dyn -> _aead_state\n | AEAD_AES128_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_AES256_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_CHACHA20_POLY1305_HACL: k:uint8_p -> _aead_state", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "EverCrypt._aead_state" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val aead_state_s: Type0\nlet aead_state_s =", "completed_definiton": "_aead_state", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.dh_state_s", "original_source_type": "val dh_state_s: Type0", "source_type": "val dh_state_s: Type0", "source_definition": "let dh_state_s = _dh_state", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 434, "start_col": 17, "end_line": 434, "end_col": 26 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"\n\nlet aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk\n\n[@CAbstractStruct]\nnoeq type aes256_key_s =\n | AES256_OPENSSL: st:Dyn.dyn -> aes256_key_s\n | AES256_BCRYPT: st:Dyn.dyn -> aes256_key_s\n | AES256_HACL: w:uint8_p -> sbox:uint8_p -> aes256_key_s\n\nlet aes256_create k =\n let st =\n if hacl () then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes256_compute k plain cipher =\n let k = !*k in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n Hacl.aes256_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_compute)\"\n\nlet aes256_free pk =\n let k = !*pk in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_free)\";\n B.free pk\n\n/// AES128-GCM\n\n#set-options \"--admit_smt_queries true\"\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes128_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm128_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes128_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm128_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n vale_aes128_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_encrypt)\"\n\nlet aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then\n begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n let r = vale_aes128_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_decrypt)\"\n\n/// AES256-GCM\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes256_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm256_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes256_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm256_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n vale_aes256_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_encrypt)\"\n\nlet aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n let r = vale_aes256_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_decrypt)\"\n\n\n/// AEAD\n\n[@CAbstractStruct]\nprivate noeq type _aead_state =\n | AEAD_OPENSSL: st:Dyn.dyn -> _aead_state\n | AEAD_BCRYPT: st:Dyn.dyn -> _aead_state\n | AEAD_AES128_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_AES256_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_CHACHA20_POLY1305_HACL: k:uint8_p -> _aead_state\n\nlet aead_state_s = _aead_state\n\nlet aead_create alg k =\n let st: aead_state_s =\n match alg with\n | AES128_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 176ul in\n Vale.old_aes128_key_expansion k xk;\n AEAD_AES128_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES128_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES128_GCM)\"\n | AES256_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 240ul in\n Vale.old_aes256_key_expansion k xk;\n AEAD_AES256_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES256_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES256_GCM)\"\n | CHACHA20_POLY1305 ->\n if hacl () then\n let k0 = B.malloc HS.root 0uy 32ul in\n blit k 0ul k0 0ul 32ul;\n AEAD_CHACHA20_POLY1305_HACL k0\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.CHACHA20_POLY1305 k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/CHACHA20_POLY1305)\"\n in\n B.malloc HS.root st 1ul\n\nlet aead_encrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n Hacl.Chacha20Poly1305_32.aead_encrypt key iv adlen ad len plaintext cipher tag\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_encrypt)\"\n\nlet aead_decrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n let r = Hacl.Chacha20Poly1305_32.aead_decrypt key iv adlen ad len plaintext cipher tag in\n U32.(1ul -^ r)\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_decrypt)\"\n\nlet aead_free pk =\n let k = !*pk in\n if AEAD_AES128_GCM_VALE? k then\n let AEAD_AES128_GCM_VALE xk = k in\n B.free xk\n else if AEAD_AES256_GCM_VALE? k then\n let AEAD_AES256_GCM_VALE xk = k in\n B.free xk\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let AEAD_CHACHA20_POLY1305_HACL key = k in\n B.free key\n else if AEAD_OPENSSL? k then\n OpenSSL.aead_free (AEAD_OPENSSL?.st k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_free)\";\n B.free pk\n\n/// DH\n\n[@CAbstractStruct]\nprivate noeq type _dh_state =\n | DH_OPENSSL: st:Dyn.dyn -> _dh_state\n | DH_DUMMY // Necessary placeholder or discriminators are not defined", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "EverCrypt._dh_state" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val dh_state_s: Type0\nlet dh_state_s =", "completed_definiton": "_dh_state", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.ecdh_free_curve", "original_source_type": "val ecdh_free_curve:\n st: ecdh_state ->\n ST unit\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)", "source_type": "val ecdh_free_curve:\n st: ecdh_state ->\n ST unit\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)", "source_definition": "let ecdh_free_curve st =\n let s : _ecdh_state = !*st in\n if ECDH_OPENSSL? s then\n OpenSSL.ecdh_free_curve (ECDH_OPENSSL?.st s)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (ecdh_free_curve)\";\n B.free st", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 491, "start_col": 24, "end_line": 497, "end_col": 11 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"\n\nlet aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk\n\n[@CAbstractStruct]\nnoeq type aes256_key_s =\n | AES256_OPENSSL: st:Dyn.dyn -> aes256_key_s\n | AES256_BCRYPT: st:Dyn.dyn -> aes256_key_s\n | AES256_HACL: w:uint8_p -> sbox:uint8_p -> aes256_key_s\n\nlet aes256_create k =\n let st =\n if hacl () then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes256_compute k plain cipher =\n let k = !*k in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n Hacl.aes256_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_compute)\"\n\nlet aes256_free pk =\n let k = !*pk in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_free)\";\n B.free pk\n\n/// AES128-GCM\n\n#set-options \"--admit_smt_queries true\"\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes128_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm128_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes128_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm128_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n vale_aes128_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_encrypt)\"\n\nlet aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then\n begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n let r = vale_aes128_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_decrypt)\"\n\n/// AES256-GCM\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes256_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm256_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes256_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm256_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n vale_aes256_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_encrypt)\"\n\nlet aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n let r = vale_aes256_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_decrypt)\"\n\n\n/// AEAD\n\n[@CAbstractStruct]\nprivate noeq type _aead_state =\n | AEAD_OPENSSL: st:Dyn.dyn -> _aead_state\n | AEAD_BCRYPT: st:Dyn.dyn -> _aead_state\n | AEAD_AES128_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_AES256_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_CHACHA20_POLY1305_HACL: k:uint8_p -> _aead_state\n\nlet aead_state_s = _aead_state\n\nlet aead_create alg k =\n let st: aead_state_s =\n match alg with\n | AES128_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 176ul in\n Vale.old_aes128_key_expansion k xk;\n AEAD_AES128_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES128_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES128_GCM)\"\n | AES256_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 240ul in\n Vale.old_aes256_key_expansion k xk;\n AEAD_AES256_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES256_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES256_GCM)\"\n | CHACHA20_POLY1305 ->\n if hacl () then\n let k0 = B.malloc HS.root 0uy 32ul in\n blit k 0ul k0 0ul 32ul;\n AEAD_CHACHA20_POLY1305_HACL k0\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.CHACHA20_POLY1305 k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/CHACHA20_POLY1305)\"\n in\n B.malloc HS.root st 1ul\n\nlet aead_encrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n Hacl.Chacha20Poly1305_32.aead_encrypt key iv adlen ad len plaintext cipher tag\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_encrypt)\"\n\nlet aead_decrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n let r = Hacl.Chacha20Poly1305_32.aead_decrypt key iv adlen ad len plaintext cipher tag in\n U32.(1ul -^ r)\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_decrypt)\"\n\nlet aead_free pk =\n let k = !*pk in\n if AEAD_AES128_GCM_VALE? k then\n let AEAD_AES128_GCM_VALE xk = k in\n B.free xk\n else if AEAD_AES256_GCM_VALE? k then\n let AEAD_AES256_GCM_VALE xk = k in\n B.free xk\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let AEAD_CHACHA20_POLY1305_HACL key = k in\n B.free key\n else if AEAD_OPENSSL? k then\n OpenSSL.aead_free (AEAD_OPENSSL?.st k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_free)\";\n B.free pk\n\n/// DH\n\n[@CAbstractStruct]\nprivate noeq type _dh_state =\n | DH_OPENSSL: st:Dyn.dyn -> _dh_state\n | DH_DUMMY // Necessary placeholder or discriminators are not defined\n\nlet dh_state_s = _dh_state\n\nlet dh_load_group dh_p dh_p_len dh_g dh_g_len dh_q dh_q_len =\n let st: dh_state_s =\n if openssl () then\n DH_OPENSSL (OpenSSL.dh_load_group dh_p dh_p_len dh_g dh_g_len dh_q dh_q_len)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_load_group)\"\n in\n B.malloc HS.root st 1ul\n\nlet dh_free_group st =\n let s : _dh_state = !*st in\n if DH_OPENSSL? s then\n OpenSSL.dh_free_group (DH_OPENSSL?.st s)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_free_group)\";\n B.free st\n\nlet dh_keygen st public =\n let s = !*st in\n if DH_OPENSSL? s then\n OpenSSL.dh_keygen (DH_OPENSSL?.st s) public\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_keygen)\"\n\nlet dh_compute st public public_len out =\n let s = !*st in\n if DH_OPENSSL? s then\n OpenSSL.dh_compute (DH_OPENSSL?.st s) public public_len out\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_compute)\"\n\n/// DH\n\n[@CAbstractStruct]\nprivate noeq type _ecdh_state =\n | ECDH_OPENSSL: st:Dyn.dyn -> _ecdh_state\n | ECDH_DUMMY // Necessary placeholder or discriminators are not defined\n\nlet ecdh_state_s = _ecdh_state\n\nlet ecdh_load_curve g =\n let st: ecdh_state_s =\n if openssl () then\n let g' = match g with\n | ECC_P256 -> OpenSSL.ECC_P256\n | ECC_P384 -> OpenSSL.ECC_P384\n | ECC_P521 -> OpenSSL.ECC_P521\n | ECC_X25519 -> OpenSSL.ECC_X25519\n | ECC_X448 -> OpenSSL.ECC_X448 in\n ECDH_OPENSSL (OpenSSL.ecdh_load_curve g')\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (ecdh_load_curve)\"\n in\n B.malloc HS.root st 1ul", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "st: EverCrypt.ecdh_state -> FStar.HyperStack.ST.ST Prims.unit", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.ecdh_state", "LowStar.Monotonic.Buffer.free", "EverCrypt.ecdh_state_s", "LowStar.Buffer.trivial_preorder", "Prims.unit", "EverCrypt.uu___is_ECDH_OPENSSL", "EverCrypt.OpenSSL.ecdh_free_curve", "EverCrypt.__proj__ECDH_OPENSSL__item__st", "Prims.bool", "LowStar.Failure.failwith", "EverCrypt._ecdh_state", "LowStar.BufferOps.op_Bang_Star" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ecdh_free_curve:\n st: ecdh_state ->\n ST unit\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)\nlet ecdh_free_curve st =", "completed_definiton": "let s:_ecdh_state = !*st in\nif ECDH_OPENSSL? s\nthen OpenSSL.ecdh_free_curve (ECDH_OPENSSL?.st s)\nelse LowStar.Failure.failwith \"ERROR: inconsistent configuration (ecdh_free_curve)\";\nB.free st", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.ecdh_load_curve", "original_source_type": "val ecdh_load_curve:\n g: ec_curve ->\n ST ecdh_state\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)", "source_type": "val ecdh_load_curve:\n g: ec_curve ->\n ST ecdh_state\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)", "source_definition": "let ecdh_load_curve g =\n let st: ecdh_state_s =\n if openssl () then\n let g' = match g with\n | ECC_P256 -> OpenSSL.ECC_P256\n | ECC_P384 -> OpenSSL.ECC_P384\n | ECC_P521 -> OpenSSL.ECC_P521\n | ECC_X25519 -> OpenSSL.ECC_X25519\n | ECC_X448 -> OpenSSL.ECC_X448 in\n ECDH_OPENSSL (OpenSSL.ecdh_load_curve g')\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (ecdh_load_curve)\"\n in\n B.malloc HS.root st 1ul", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 476, "start_col": 23, "end_line": 489, "end_col": 25 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"\n\nlet aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk\n\n[@CAbstractStruct]\nnoeq type aes256_key_s =\n | AES256_OPENSSL: st:Dyn.dyn -> aes256_key_s\n | AES256_BCRYPT: st:Dyn.dyn -> aes256_key_s\n | AES256_HACL: w:uint8_p -> sbox:uint8_p -> aes256_key_s\n\nlet aes256_create k =\n let st =\n if hacl () then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes256_compute k plain cipher =\n let k = !*k in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n Hacl.aes256_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_compute)\"\n\nlet aes256_free pk =\n let k = !*pk in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_free)\";\n B.free pk\n\n/// AES128-GCM\n\n#set-options \"--admit_smt_queries true\"\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes128_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm128_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes128_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm128_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n vale_aes128_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_encrypt)\"\n\nlet aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then\n begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n let r = vale_aes128_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_decrypt)\"\n\n/// AES256-GCM\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes256_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm256_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes256_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm256_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n vale_aes256_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_encrypt)\"\n\nlet aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n let r = vale_aes256_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_decrypt)\"\n\n\n/// AEAD\n\n[@CAbstractStruct]\nprivate noeq type _aead_state =\n | AEAD_OPENSSL: st:Dyn.dyn -> _aead_state\n | AEAD_BCRYPT: st:Dyn.dyn -> _aead_state\n | AEAD_AES128_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_AES256_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_CHACHA20_POLY1305_HACL: k:uint8_p -> _aead_state\n\nlet aead_state_s = _aead_state\n\nlet aead_create alg k =\n let st: aead_state_s =\n match alg with\n | AES128_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 176ul in\n Vale.old_aes128_key_expansion k xk;\n AEAD_AES128_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES128_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES128_GCM)\"\n | AES256_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 240ul in\n Vale.old_aes256_key_expansion k xk;\n AEAD_AES256_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES256_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES256_GCM)\"\n | CHACHA20_POLY1305 ->\n if hacl () then\n let k0 = B.malloc HS.root 0uy 32ul in\n blit k 0ul k0 0ul 32ul;\n AEAD_CHACHA20_POLY1305_HACL k0\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.CHACHA20_POLY1305 k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/CHACHA20_POLY1305)\"\n in\n B.malloc HS.root st 1ul\n\nlet aead_encrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n Hacl.Chacha20Poly1305_32.aead_encrypt key iv adlen ad len plaintext cipher tag\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_encrypt)\"\n\nlet aead_decrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n let r = Hacl.Chacha20Poly1305_32.aead_decrypt key iv adlen ad len plaintext cipher tag in\n U32.(1ul -^ r)\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_decrypt)\"\n\nlet aead_free pk =\n let k = !*pk in\n if AEAD_AES128_GCM_VALE? k then\n let AEAD_AES128_GCM_VALE xk = k in\n B.free xk\n else if AEAD_AES256_GCM_VALE? k then\n let AEAD_AES256_GCM_VALE xk = k in\n B.free xk\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let AEAD_CHACHA20_POLY1305_HACL key = k in\n B.free key\n else if AEAD_OPENSSL? k then\n OpenSSL.aead_free (AEAD_OPENSSL?.st k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_free)\";\n B.free pk\n\n/// DH\n\n[@CAbstractStruct]\nprivate noeq type _dh_state =\n | DH_OPENSSL: st:Dyn.dyn -> _dh_state\n | DH_DUMMY // Necessary placeholder or discriminators are not defined\n\nlet dh_state_s = _dh_state\n\nlet dh_load_group dh_p dh_p_len dh_g dh_g_len dh_q dh_q_len =\n let st: dh_state_s =\n if openssl () then\n DH_OPENSSL (OpenSSL.dh_load_group dh_p dh_p_len dh_g dh_g_len dh_q dh_q_len)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_load_group)\"\n in\n B.malloc HS.root st 1ul\n\nlet dh_free_group st =\n let s : _dh_state = !*st in\n if DH_OPENSSL? s then\n OpenSSL.dh_free_group (DH_OPENSSL?.st s)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_free_group)\";\n B.free st\n\nlet dh_keygen st public =\n let s = !*st in\n if DH_OPENSSL? s then\n OpenSSL.dh_keygen (DH_OPENSSL?.st s) public\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_keygen)\"\n\nlet dh_compute st public public_len out =\n let s = !*st in\n if DH_OPENSSL? s then\n OpenSSL.dh_compute (DH_OPENSSL?.st s) public public_len out\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_compute)\"\n\n/// DH\n\n[@CAbstractStruct]\nprivate noeq type _ecdh_state =\n | ECDH_OPENSSL: st:Dyn.dyn -> _ecdh_state\n | ECDH_DUMMY // Necessary placeholder or discriminators are not defined\n\nlet ecdh_state_s = _ecdh_state", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "g: EverCrypt.ec_curve -> FStar.HyperStack.ST.ST EverCrypt.ecdh_state", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.ec_curve", "LowStar.Buffer.malloc", "EverCrypt.ecdh_state_s", "FStar.Monotonic.HyperHeap.root", "FStar.UInt32.__uint_to_t", "LowStar.Monotonic.Buffer.mbuffer", "LowStar.Buffer.trivial_preorder", "Prims.l_and", "Prims.eq2", "Prims.nat", "LowStar.Monotonic.Buffer.length", "FStar.UInt32.v", "Prims.b2t", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "FStar.Monotonic.HyperHeap.rid", "LowStar.Monotonic.Buffer.frameOf", "LowStar.Monotonic.Buffer.freeable", "EverCrypt.ECDH_OPENSSL", "FStar.Dyn.dyn", "EverCrypt.OpenSSL.ecdh_load_curve", "EverCrypt.OpenSSL.ec_curve", "EverCrypt.OpenSSL.ECC_P256", "EverCrypt.OpenSSL.ECC_P384", "EverCrypt.OpenSSL.ECC_P521", "EverCrypt.OpenSSL.ECC_X25519", "EverCrypt.OpenSSL.ECC_X448", "Prims.bool", "LowStar.Failure.failwith", "EverCrypt.openssl", "EverCrypt.ecdh_state" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ecdh_load_curve:\n g: ec_curve ->\n ST ecdh_state\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)\nlet ecdh_load_curve g =", "completed_definiton": "let st:ecdh_state_s =\n if openssl ()\n then\n let g' =\n match g with\n | ECC_P256 -> OpenSSL.ECC_P256\n | ECC_P384 -> OpenSSL.ECC_P384\n | ECC_P521 -> OpenSSL.ECC_P521\n | ECC_X25519 -> OpenSSL.ECC_X25519\n | ECC_X448 -> OpenSSL.ECC_X448\n in\n ECDH_OPENSSL (OpenSSL.ecdh_load_curve g')\n else LowStar.Failure.failwith \"ERROR: inconsistent configuration (ecdh_load_curve)\"\nin\nB.malloc HS.root st 1ul", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.ecdh_keygen", "original_source_type": "val ecdh_keygen:\n st: ecdh_state ->\n outx: uint8_p ->\n outy: uint8_p ->\n ST unit\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)", "source_type": "val ecdh_keygen:\n st: ecdh_state ->\n outx: uint8_p ->\n outy: uint8_p ->\n ST unit\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)", "source_definition": "let ecdh_keygen st outx outy =\n let s = !*st in\n if ECDH_OPENSSL? s then\n OpenSSL.ecdh_keygen (ECDH_OPENSSL?.st s) outx outy\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (ecdh_keygen)\"", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 499, "start_col": 30, "end_line": 504, "end_col": 78 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"\n\nlet aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk\n\n[@CAbstractStruct]\nnoeq type aes256_key_s =\n | AES256_OPENSSL: st:Dyn.dyn -> aes256_key_s\n | AES256_BCRYPT: st:Dyn.dyn -> aes256_key_s\n | AES256_HACL: w:uint8_p -> sbox:uint8_p -> aes256_key_s\n\nlet aes256_create k =\n let st =\n if hacl () then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes256_compute k plain cipher =\n let k = !*k in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n Hacl.aes256_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_compute)\"\n\nlet aes256_free pk =\n let k = !*pk in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_free)\";\n B.free pk\n\n/// AES128-GCM\n\n#set-options \"--admit_smt_queries true\"\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes128_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm128_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes128_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm128_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n vale_aes128_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_encrypt)\"\n\nlet aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then\n begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n let r = vale_aes128_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_decrypt)\"\n\n/// AES256-GCM\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes256_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm256_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes256_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm256_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n vale_aes256_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_encrypt)\"\n\nlet aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n let r = vale_aes256_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_decrypt)\"\n\n\n/// AEAD\n\n[@CAbstractStruct]\nprivate noeq type _aead_state =\n | AEAD_OPENSSL: st:Dyn.dyn -> _aead_state\n | AEAD_BCRYPT: st:Dyn.dyn -> _aead_state\n | AEAD_AES128_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_AES256_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_CHACHA20_POLY1305_HACL: k:uint8_p -> _aead_state\n\nlet aead_state_s = _aead_state\n\nlet aead_create alg k =\n let st: aead_state_s =\n match alg with\n | AES128_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 176ul in\n Vale.old_aes128_key_expansion k xk;\n AEAD_AES128_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES128_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES128_GCM)\"\n | AES256_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 240ul in\n Vale.old_aes256_key_expansion k xk;\n AEAD_AES256_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES256_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES256_GCM)\"\n | CHACHA20_POLY1305 ->\n if hacl () then\n let k0 = B.malloc HS.root 0uy 32ul in\n blit k 0ul k0 0ul 32ul;\n AEAD_CHACHA20_POLY1305_HACL k0\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.CHACHA20_POLY1305 k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/CHACHA20_POLY1305)\"\n in\n B.malloc HS.root st 1ul\n\nlet aead_encrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n Hacl.Chacha20Poly1305_32.aead_encrypt key iv adlen ad len plaintext cipher tag\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_encrypt)\"\n\nlet aead_decrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n let r = Hacl.Chacha20Poly1305_32.aead_decrypt key iv adlen ad len plaintext cipher tag in\n U32.(1ul -^ r)\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_decrypt)\"\n\nlet aead_free pk =\n let k = !*pk in\n if AEAD_AES128_GCM_VALE? k then\n let AEAD_AES128_GCM_VALE xk = k in\n B.free xk\n else if AEAD_AES256_GCM_VALE? k then\n let AEAD_AES256_GCM_VALE xk = k in\n B.free xk\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let AEAD_CHACHA20_POLY1305_HACL key = k in\n B.free key\n else if AEAD_OPENSSL? k then\n OpenSSL.aead_free (AEAD_OPENSSL?.st k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_free)\";\n B.free pk\n\n/// DH\n\n[@CAbstractStruct]\nprivate noeq type _dh_state =\n | DH_OPENSSL: st:Dyn.dyn -> _dh_state\n | DH_DUMMY // Necessary placeholder or discriminators are not defined\n\nlet dh_state_s = _dh_state\n\nlet dh_load_group dh_p dh_p_len dh_g dh_g_len dh_q dh_q_len =\n let st: dh_state_s =\n if openssl () then\n DH_OPENSSL (OpenSSL.dh_load_group dh_p dh_p_len dh_g dh_g_len dh_q dh_q_len)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_load_group)\"\n in\n B.malloc HS.root st 1ul\n\nlet dh_free_group st =\n let s : _dh_state = !*st in\n if DH_OPENSSL? s then\n OpenSSL.dh_free_group (DH_OPENSSL?.st s)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_free_group)\";\n B.free st\n\nlet dh_keygen st public =\n let s = !*st in\n if DH_OPENSSL? s then\n OpenSSL.dh_keygen (DH_OPENSSL?.st s) public\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_keygen)\"\n\nlet dh_compute st public public_len out =\n let s = !*st in\n if DH_OPENSSL? s then\n OpenSSL.dh_compute (DH_OPENSSL?.st s) public public_len out\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (dh_compute)\"\n\n/// DH\n\n[@CAbstractStruct]\nprivate noeq type _ecdh_state =\n | ECDH_OPENSSL: st:Dyn.dyn -> _ecdh_state\n | ECDH_DUMMY // Necessary placeholder or discriminators are not defined\n\nlet ecdh_state_s = _ecdh_state\n\nlet ecdh_load_curve g =\n let st: ecdh_state_s =\n if openssl () then\n let g' = match g with\n | ECC_P256 -> OpenSSL.ECC_P256\n | ECC_P384 -> OpenSSL.ECC_P384\n | ECC_P521 -> OpenSSL.ECC_P521\n | ECC_X25519 -> OpenSSL.ECC_X25519\n | ECC_X448 -> OpenSSL.ECC_X448 in\n ECDH_OPENSSL (OpenSSL.ecdh_load_curve g')\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (ecdh_load_curve)\"\n in\n B.malloc HS.root st 1ul\n\nlet ecdh_free_curve st =\n let s : _ecdh_state = !*st in\n if ECDH_OPENSSL? s then\n OpenSSL.ecdh_free_curve (ECDH_OPENSSL?.st s)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (ecdh_free_curve)\";\n B.free st", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "st: EverCrypt.ecdh_state -> outx: EverCrypt.Helpers.uint8_p -> outy: EverCrypt.Helpers.uint8_p\n -> FStar.HyperStack.ST.ST Prims.unit", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.ecdh_state", "EverCrypt.Helpers.uint8_p", "EverCrypt.uu___is_ECDH_OPENSSL", "EverCrypt.OpenSSL.ecdh_keygen", "EverCrypt.__proj__ECDH_OPENSSL__item__st", "Prims.unit", "Prims.bool", "LowStar.Failure.failwith", "EverCrypt.ecdh_state_s", "LowStar.BufferOps.op_Bang_Star", "LowStar.Buffer.trivial_preorder" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ecdh_keygen:\n st: ecdh_state ->\n outx: uint8_p ->\n outy: uint8_p ->\n ST unit\n (requires fun h0 -> False)\n (ensures fun h0 _ h1 -> True)\nlet ecdh_keygen st outx outy =", "completed_definiton": "let s = !*st in\nif ECDH_OPENSSL? s\nthen OpenSSL.ecdh_keygen (ECDH_OPENSSL?.st s) outx outy\nelse LowStar.Failure.failwith \"ERROR: inconsistent configuration (ecdh_keygen)\"", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.aes256_free", "original_source_type": "val aes256_free: aes256_key ->\n ST unit aes256_free_pre aes256_free_post", "source_type": "val aes256_free: aes256_key ->\n ST unit aes256_free_pre aes256_free_post", "source_definition": "let aes256_free pk =\n let k = !*pk in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_free)\";\n B.free pk", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 146, "start_col": 20, "end_line": 158, "end_col": 11 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"\n\nlet aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk\n\n[@CAbstractStruct]\nnoeq type aes256_key_s =\n | AES256_OPENSSL: st:Dyn.dyn -> aes256_key_s\n | AES256_BCRYPT: st:Dyn.dyn -> aes256_key_s\n | AES256_HACL: w:uint8_p -> sbox:uint8_p -> aes256_key_s\n\nlet aes256_create k =\n let st =\n if hacl () then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes256_compute k plain cipher =\n let k = !*k in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n Hacl.aes256_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_compute)\"", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "pk: EverCrypt.aes256_key -> FStar.HyperStack.ST.ST Prims.unit", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.aes256_key", "LowStar.Monotonic.Buffer.free", "EverCrypt.aes256_key_s", "LowStar.Buffer.trivial_preorder", "Prims.unit", "EverCrypt.uu___is_AES256_HACL", "EverCrypt.Helpers.uint8_p", "EverCrypt.Helpers.uint8_t", "Prims.bool", "LowStar.Failure.failwith", "LowStar.BufferOps.op_Bang_Star" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val aes256_free: aes256_key ->\n ST unit aes256_free_pre aes256_free_post\nlet aes256_free pk =", "completed_definiton": "let k = !*pk in\nif AES256_HACL? k\nthen\n let AES256_HACL w sbox = k in\n B.free w;\n B.free sbox\nelse LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_free)\";\nB.free pk", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.aes128_compute", "original_source_type": "val aes128_compute: key:aes128_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes128_compute_pre aes128_compute_post", "source_type": "val aes128_compute: key:aes128_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes128_compute_pre aes128_compute_post", "source_definition": "let aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 78, "start_col": 35, "end_line": 91, "end_col": 81 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "key: EverCrypt.aes128_key -> plain: EverCrypt.Helpers.uint8_p -> cipher: EverCrypt.Helpers.uint8_p\n -> FStar.HyperStack.ST.ST Prims.unit", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.aes128_key", "EverCrypt.Helpers.uint8_p", "EverCrypt.uu___is_AES128_VALE", "EverCrypt.Vale.aes128_encrypt_one_block", "Prims.unit", "EverCrypt.aes128_key_s", "Prims.bool", "EverCrypt.uu___is_AES128_HACL", "EverCrypt.Hacl.aes128_cipher", "LowStar.Failure.failwith", "LowStar.BufferOps.op_Bang_Star", "LowStar.Buffer.trivial_preorder" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val aes128_compute: key:aes128_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes128_compute_pre aes128_compute_post\nlet aes128_compute k plain cipher =", "completed_definiton": "let k = !*k in\nif AES128_VALE? k\nthen\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\nelse\n if AES128_HACL? k\n then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n else LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.aes256_compute", "original_source_type": "val aes256_compute: key:aes256_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes256_compute_pre aes256_compute_post", "source_type": "val aes256_compute: key:aes256_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes256_compute_pre aes256_compute_post", "source_definition": "let aes256_compute k plain cipher =\n let k = !*k in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n Hacl.aes256_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_compute)\"", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 134, "start_col": 35, "end_line": 144, "end_col": 81 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"\n\nlet aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk\n\n[@CAbstractStruct]\nnoeq type aes256_key_s =\n | AES256_OPENSSL: st:Dyn.dyn -> aes256_key_s\n | AES256_BCRYPT: st:Dyn.dyn -> aes256_key_s\n | AES256_HACL: w:uint8_p -> sbox:uint8_p -> aes256_key_s\n\nlet aes256_create k =\n let st =\n if hacl () then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\n in\n B.malloc HS.root st 1ul", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "key: EverCrypt.aes256_key -> plain: EverCrypt.Helpers.uint8_p -> cipher: EverCrypt.Helpers.uint8_p\n -> FStar.HyperStack.ST.ST Prims.unit", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.aes256_key", "EverCrypt.Helpers.uint8_p", "EverCrypt.uu___is_AES256_HACL", "EverCrypt.Hacl.aes256_cipher", "Prims.unit", "EverCrypt.aes256_key_s", "Prims.bool", "LowStar.Failure.failwith", "LowStar.BufferOps.op_Bang_Star", "LowStar.Buffer.trivial_preorder" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val aes256_compute: key:aes256_key ->\n plain: uint8_p -> cipher:uint8_p ->\n ST unit aes256_compute_pre aes256_compute_post\nlet aes256_compute k plain cipher =", "completed_definiton": "let k = !*k in\nif AES256_HACL? k\nthen\n let AES256_HACL w sbox = k in\n Hacl.aes256_cipher cipher plain w sbox\nelse LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_compute)\"", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.aes256_create", "original_source_type": "val aes256_create: key:uint8_p ->\n ST aes256_key aes256_create_pre aes256_create_post", "source_type": "val aes256_create: key:uint8_p ->\n ST aes256_key aes256_create_pre aes256_create_post", "source_definition": "let aes256_create k =\n let st =\n if hacl () then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\n in\n B.malloc HS.root st 1ul", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 117, "start_col": 21, "end_line": 132, "end_col": 25 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"\n\nlet aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk\n\n[@CAbstractStruct]\nnoeq type aes256_key_s =\n | AES256_OPENSSL: st:Dyn.dyn -> aes256_key_s\n | AES256_BCRYPT: st:Dyn.dyn -> aes256_key_s\n | AES256_HACL: w:uint8_p -> sbox:uint8_p -> aes256_key_s", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "key: EverCrypt.Helpers.uint8_p -> FStar.HyperStack.ST.ST EverCrypt.aes256_key", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.Helpers.uint8_p", "LowStar.Buffer.malloc", "EverCrypt.aes256_key_s", "FStar.Monotonic.HyperHeap.root", "FStar.UInt32.__uint_to_t", "LowStar.Monotonic.Buffer.mbuffer", "LowStar.Buffer.trivial_preorder", "Prims.l_and", "Prims.eq2", "Prims.nat", "LowStar.Monotonic.Buffer.length", "FStar.UInt32.v", "Prims.b2t", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "FStar.Monotonic.HyperHeap.rid", "LowStar.Monotonic.Buffer.frameOf", "LowStar.Monotonic.Buffer.freeable", "EverCrypt.AES256_HACL", "Prims.unit", "EverCrypt.Hacl.aes256_keyExpansion", "EverCrypt.Hacl.aes256_mk_sbox", "EverCrypt.Helpers.uint8_t", "FStar.UInt32.uint_to_t", "FStar.UInt32.t", "FStar.UInt8.__uint_to_t", "Prims.bool", "LowStar.Failure.failwith", "EverCrypt.hacl", "EverCrypt.aes256_key" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val aes256_create: key:uint8_p ->\n ST aes256_key aes256_create_pre aes256_create_post\nlet aes256_create k =", "completed_definiton": "let st =\n if hacl ()\n then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n else LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\nin\nB.malloc HS.root st 1ul", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.vale_and_aesni", "original_source_type": "val vale_and_aesni: Prims.unit\n -> Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1)", "source_type": "val vale_and_aesni: Prims.unit\n -> Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1)", "source_definition": "let vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 22, "start_col": 2, "end_line": 22, "end_col": 17 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit -> FStar.HyperStack.ST.Stack Prims.bool", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Prims.unit", "EverCrypt.AutoConfig2.has_aesni", "Prims.bool", "FStar.Monotonic.HyperStack.mem", "Prims.l_True", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_none" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val vale_and_aesni: Prims.unit\n -> Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1)\nlet vale_and_aesni () : Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =", "completed_definiton": "AC.has_aesni ()", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.aes128_free", "original_source_type": "val aes128_free: aes128_key ->\n ST unit aes128_free_pre aes128_free_post", "source_type": "val aes128_free: aes128_key ->\n ST unit aes128_free_pre aes128_free_post", "source_definition": "let aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 93, "start_col": 20, "end_line": 109, "end_col": 11 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "pk: EverCrypt.aes128_key -> FStar.HyperStack.ST.ST Prims.unit", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.aes128_key", "LowStar.Monotonic.Buffer.free", "EverCrypt.aes128_key_s", "LowStar.Buffer.trivial_preorder", "Prims.unit", "EverCrypt.uu___is_AES128_VALE", "EverCrypt.Helpers.uint8_p", "EverCrypt.Helpers.uint8_t", "Prims.bool", "EverCrypt.uu___is_AES128_HACL", "LowStar.Failure.failwith", "LowStar.BufferOps.op_Bang_Star" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val aes128_free: aes128_key ->\n ST unit aes128_free_pre aes128_free_post\nlet aes128_free pk =", "completed_definiton": "let k = !*pk in\nif AES128_VALE? k\nthen\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\nelse\n if AES128_HACL? k\n then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n else LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\nB.free pk", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.aes128_create", "original_source_type": "val aes128_create: key:uint8_p ->\n ST aes128_key aes128_create_pre aes128_create_post", "source_type": "val aes128_create: key:uint8_p ->\n ST aes128_key aes128_create_pre aes128_create_post", "source_definition": "let aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 56, "start_col": 21, "end_line": 76, "end_col": 25 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "key: EverCrypt.Helpers.uint8_p -> FStar.HyperStack.ST.ST EverCrypt.aes128_key", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.Helpers.uint8_p", "LowStar.Buffer.malloc", "EverCrypt.aes128_key_s", "FStar.Monotonic.HyperHeap.root", "FStar.UInt32.__uint_to_t", "LowStar.Monotonic.Buffer.mbuffer", "LowStar.Buffer.trivial_preorder", "Prims.l_and", "Prims.eq2", "Prims.nat", "LowStar.Monotonic.Buffer.length", "FStar.UInt32.v", "Prims.b2t", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "FStar.Monotonic.HyperHeap.rid", "LowStar.Monotonic.Buffer.frameOf", "LowStar.Monotonic.Buffer.freeable", "EverCrypt.AES128_VALE", "Prims.unit", "EverCrypt.Vale.aes128_key_expansion_sbox", "EverCrypt.Helpers.uint8_t", "FStar.UInt32.uint_to_t", "FStar.UInt32.t", "FStar.UInt8.__uint_to_t", "Prims.bool", "EverCrypt.AES128_HACL", "EverCrypt.Hacl.aes128_keyExpansion", "EverCrypt.Hacl.aes128_mk_sbox", "LowStar.Failure.failwith", "EverCrypt.hacl", "EverCrypt.vale_and_aesni", "EverCrypt.aes128_key" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val aes128_create: key:uint8_p ->\n ST aes128_key aes128_create_pre aes128_create_post\nlet aes128_create k =", "completed_definiton": "let st =\n if vale_and_aesni ()\n then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else\n if hacl ()\n then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n else LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\nin\nB.malloc HS.root st 1ul", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.bcrypt", "original_source_type": "val bcrypt: Prims.unit -> Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1)", "source_type": "val bcrypt: Prims.unit -> Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1)", "source_definition": "let bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 34, "start_col": 2, "end_line": 34, "end_col": 7 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit -> FStar.HyperStack.ST.Stack Prims.bool", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Prims.unit", "Prims.bool", "FStar.Monotonic.HyperStack.mem", "Prims.l_True", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_none" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val bcrypt: Prims.unit -> Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1)\nlet bcrypt () : Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =", "completed_definiton": "false", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.hacl", "original_source_type": "val hacl: Prims.unit -> Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1)", "source_type": "val hacl: Prims.unit -> Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1)", "source_definition": "let hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 26, "start_col": 2, "end_line": 26, "end_col": 6 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit -> FStar.HyperStack.ST.Stack Prims.bool", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Prims.unit", "Prims.bool", "FStar.Monotonic.HyperStack.mem", "Prims.l_True", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_none" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hacl: Prims.unit -> Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1)\nlet hacl () : Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =", "completed_definiton": "true", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.vale", "original_source_type": "val vale: Prims.unit -> Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1)", "source_type": "val vale: Prims.unit -> Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1)", "source_definition": "let vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 18, "start_col": 2, "end_line": 18, "end_col": 6 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit -> FStar.HyperStack.ST.Stack Prims.bool", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Prims.unit", "Prims.bool", "FStar.Monotonic.HyperStack.mem", "Prims.l_True", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_none" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val vale: Prims.unit -> Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1)\nlet vale () : Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =", "completed_definiton": "true", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.aes256_gcm_encrypt", "original_source_type": "val aes256_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post", "source_type": "val aes256_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post", "source_definition": "let aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n vale_aes256_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_encrypt)\"", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 303, "start_col": 2, "end_line": 313, "end_col": 85 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"\n\nlet aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk\n\n[@CAbstractStruct]\nnoeq type aes256_key_s =\n | AES256_OPENSSL: st:Dyn.dyn -> aes256_key_s\n | AES256_BCRYPT: st:Dyn.dyn -> aes256_key_s\n | AES256_HACL: w:uint8_p -> sbox:uint8_p -> aes256_key_s\n\nlet aes256_create k =\n let st =\n if hacl () then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes256_compute k plain cipher =\n let k = !*k in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n Hacl.aes256_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_compute)\"\n\nlet aes256_free pk =\n let k = !*pk in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_free)\";\n B.free pk\n\n/// AES128-GCM\n\n#set-options \"--admit_smt_queries true\"\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes128_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm128_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes128_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm128_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n vale_aes128_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_encrypt)\"\n\nlet aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then\n begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n let r = vale_aes128_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_decrypt)\"\n\n/// AES256-GCM\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes256_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm256_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes256_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm256_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n key: EverCrypt.Helpers.uint8_p ->\n iv: EverCrypt.Helpers.uint8_p ->\n ad: EverCrypt.Helpers.uint8_p ->\n adlen: EverCrypt.Helpers.uint32_t ->\n plain: EverCrypt.Helpers.uint8_p ->\n len: EverCrypt.Helpers.uint32_t ->\n cipher: EverCrypt.Helpers.uint8_p ->\n tag: EverCrypt.Helpers.uint8_p\n -> FStar.HyperStack.ST.ST Prims.unit", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.Helpers.uint8_p", "EverCrypt.Helpers.uint32_t", "FStar.HyperStack.ST.pop_frame", "Prims.unit", "EverCrypt.vale_aes256_gcm_encrypt", "EverCrypt.Vale.old_aes256_key_expansion", "LowStar.Monotonic.Buffer.mbuffer", "EverCrypt.Helpers.uint8_t", "LowStar.Buffer.trivial_preorder", "Prims.l_and", "Prims.eq2", "Prims.nat", "LowStar.Monotonic.Buffer.length", "FStar.UInt32.v", "FStar.UInt32.uint_to_t", "FStar.UInt32.t", "Prims.b2t", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "LowStar.Buffer.alloca", "FStar.UInt8.__uint_to_t", "FStar.UInt32.__uint_to_t", "FStar.HyperStack.ST.push_frame", "Prims.bool", "EverCrypt.OpenSSL.aes256_gcm_encrypt", "LowStar.Failure.failwith", "EverCrypt.openssl", "EverCrypt.vale_and_aesni" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val aes256_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post\nlet aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag =", "completed_definiton": "if vale_and_aesni ()\nthen\n (push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n vale_aes256_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ())\nelse\n if openssl ()\n then OpenSSL.aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_encrypt)\"", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.openssl", "original_source_type": "val openssl: Prims.unit -> Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1)", "source_type": "val openssl: Prims.unit -> Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1)", "source_definition": "let openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 30, "start_col": 2, "end_line": 30, "end_col": 6 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit -> FStar.HyperStack.ST.Stack Prims.bool", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Prims.unit", "Prims.bool", "FStar.Monotonic.HyperStack.mem", "Prims.l_True", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_none" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val openssl: Prims.unit -> Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1)\nlet openssl () : Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =", "completed_definiton": "true", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.aes128_gcm_decrypt", "original_source_type": "val aes128_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes128_gcm_decrypt_pre aes128_gcm_decrypt_post", "source_type": "val aes128_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes128_gcm_decrypt_pre aes128_gcm_decrypt_post", "source_definition": "let aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then\n begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n let r = vale_aes128_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_decrypt)\"", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 232, "start_col": 2, "end_line": 244, "end_col": 85 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"\n\nlet aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk\n\n[@CAbstractStruct]\nnoeq type aes256_key_s =\n | AES256_OPENSSL: st:Dyn.dyn -> aes256_key_s\n | AES256_BCRYPT: st:Dyn.dyn -> aes256_key_s\n | AES256_HACL: w:uint8_p -> sbox:uint8_p -> aes256_key_s\n\nlet aes256_create k =\n let st =\n if hacl () then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes256_compute k plain cipher =\n let k = !*k in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n Hacl.aes256_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_compute)\"\n\nlet aes256_free pk =\n let k = !*pk in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_free)\";\n B.free pk\n\n/// AES128-GCM\n\n#set-options \"--admit_smt_queries true\"\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes128_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm128_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes128_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm128_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n vale_aes128_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_encrypt)\"", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n key: EverCrypt.Helpers.uint8_p ->\n iv: EverCrypt.Helpers.uint8_p ->\n ad: EverCrypt.Helpers.uint8_p ->\n adlen: EverCrypt.Helpers.uint32_t ->\n plain: EverCrypt.Helpers.uint8_p ->\n len: EverCrypt.Helpers.uint32_t ->\n cipher: EverCrypt.Helpers.uint8_p ->\n tag: EverCrypt.Helpers.uint8_p\n -> FStar.HyperStack.ST.ST EverCrypt.Helpers.uint32_t", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.Helpers.uint8_p", "EverCrypt.Helpers.uint32_t", "Prims.unit", "FStar.HyperStack.ST.pop_frame", "FStar.UInt32.t", "EverCrypt.vale_aes128_gcm_decrypt", "EverCrypt.Vale.old_aes128_key_expansion", "LowStar.Monotonic.Buffer.mbuffer", "EverCrypt.Helpers.uint8_t", "LowStar.Buffer.trivial_preorder", "Prims.l_and", "Prims.eq2", "Prims.nat", "LowStar.Monotonic.Buffer.length", "FStar.UInt32.v", "FStar.UInt32.uint_to_t", "Prims.b2t", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "LowStar.Buffer.alloca", "FStar.UInt8.__uint_to_t", "FStar.UInt32.__uint_to_t", "FStar.HyperStack.ST.push_frame", "Prims.bool", "EverCrypt.OpenSSL.aes128_gcm_decrypt", "LowStar.Failure.failwith", "EverCrypt.openssl", "EverCrypt.vale_and_aesni" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val aes128_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes128_gcm_decrypt_pre aes128_gcm_decrypt_post\nlet aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag =", "completed_definiton": "if vale_and_aesni ()\nthen\n (push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n let r = vale_aes128_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r)\nelse\n if openssl ()\n then OpenSSL.aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_decrypt)\"", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.aes128_gcm_encrypt", "original_source_type": "val aes128_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post", "source_type": "val aes128_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post", "source_definition": "let aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n vale_aes128_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_encrypt)\"", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 219, "start_col": 2, "end_line": 229, "end_col": 85 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"\n\nlet aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk\n\n[@CAbstractStruct]\nnoeq type aes256_key_s =\n | AES256_OPENSSL: st:Dyn.dyn -> aes256_key_s\n | AES256_BCRYPT: st:Dyn.dyn -> aes256_key_s\n | AES256_HACL: w:uint8_p -> sbox:uint8_p -> aes256_key_s\n\nlet aes256_create k =\n let st =\n if hacl () then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes256_compute k plain cipher =\n let k = !*k in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n Hacl.aes256_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_compute)\"\n\nlet aes256_free pk =\n let k = !*pk in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_free)\";\n B.free pk\n\n/// AES128-GCM\n\n#set-options \"--admit_smt_queries true\"\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes128_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm128_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes128_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm128_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n key: EverCrypt.Helpers.uint8_p ->\n iv: EverCrypt.Helpers.uint8_p ->\n ad: EverCrypt.Helpers.uint8_p ->\n adlen: EverCrypt.Helpers.uint32_t ->\n plain: EverCrypt.Helpers.uint8_p ->\n len: EverCrypt.Helpers.uint32_t ->\n cipher: EverCrypt.Helpers.uint8_p ->\n tag: EverCrypt.Helpers.uint8_p\n -> FStar.HyperStack.ST.ST Prims.unit", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.Helpers.uint8_p", "EverCrypt.Helpers.uint32_t", "FStar.HyperStack.ST.pop_frame", "Prims.unit", "EverCrypt.vale_aes128_gcm_encrypt", "EverCrypt.Vale.old_aes128_key_expansion", "LowStar.Monotonic.Buffer.mbuffer", "EverCrypt.Helpers.uint8_t", "LowStar.Buffer.trivial_preorder", "Prims.l_and", "Prims.eq2", "Prims.nat", "LowStar.Monotonic.Buffer.length", "FStar.UInt32.v", "FStar.UInt32.uint_to_t", "FStar.UInt32.t", "Prims.b2t", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "LowStar.Buffer.alloca", "FStar.UInt8.__uint_to_t", "FStar.UInt32.__uint_to_t", "FStar.HyperStack.ST.push_frame", "Prims.bool", "EverCrypt.OpenSSL.aes128_gcm_encrypt", "LowStar.Failure.failwith", "EverCrypt.openssl", "EverCrypt.vale_and_aesni" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val aes128_gcm_encrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST unit aes256_gcm_encrypt_pre aes256_gcm_encrypt_post\nlet aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag =", "completed_definiton": "if vale_and_aesni ()\nthen\n (push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n vale_aes128_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ())\nelse\n if openssl ()\n then OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_encrypt)\"", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.aes256_gcm_decrypt", "original_source_type": "val aes256_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes256_gcm_decrypt_pre aes256_gcm_decrypt_post", "source_type": "val aes256_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes256_gcm_decrypt_pre aes256_gcm_decrypt_post", "source_definition": "let aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n let r = vale_aes256_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_decrypt)\"", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 316, "start_col": 2, "end_line": 327, "end_col": 85 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"\n\nlet aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk\n\n[@CAbstractStruct]\nnoeq type aes256_key_s =\n | AES256_OPENSSL: st:Dyn.dyn -> aes256_key_s\n | AES256_BCRYPT: st:Dyn.dyn -> aes256_key_s\n | AES256_HACL: w:uint8_p -> sbox:uint8_p -> aes256_key_s\n\nlet aes256_create k =\n let st =\n if hacl () then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes256_compute k plain cipher =\n let k = !*k in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n Hacl.aes256_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_compute)\"\n\nlet aes256_free pk =\n let k = !*pk in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_free)\";\n B.free pk\n\n/// AES128-GCM\n\n#set-options \"--admit_smt_queries true\"\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes128_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm128_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes128_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm128_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n vale_aes128_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_encrypt)\"\n\nlet aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then\n begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n let r = vale_aes128_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_decrypt)\"\n\n/// AES256-GCM\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes256_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm256_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes256_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm256_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n vale_aes256_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_encrypt)\"", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n key: EverCrypt.Helpers.uint8_p ->\n iv: EverCrypt.Helpers.uint8_p ->\n ad: EverCrypt.Helpers.uint8_p ->\n adlen: EverCrypt.Helpers.uint32_t ->\n plain: EverCrypt.Helpers.uint8_p ->\n len: EverCrypt.Helpers.uint32_t ->\n cipher: EverCrypt.Helpers.uint8_p ->\n tag: EverCrypt.Helpers.uint8_p\n -> FStar.HyperStack.ST.ST EverCrypt.Helpers.uint32_t", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.Helpers.uint8_p", "EverCrypt.Helpers.uint32_t", "Prims.unit", "FStar.HyperStack.ST.pop_frame", "FStar.UInt32.t", "EverCrypt.vale_aes256_gcm_decrypt", "EverCrypt.Vale.old_aes256_key_expansion", "LowStar.Monotonic.Buffer.mbuffer", "EverCrypt.Helpers.uint8_t", "LowStar.Buffer.trivial_preorder", "Prims.l_and", "Prims.eq2", "Prims.nat", "LowStar.Monotonic.Buffer.length", "FStar.UInt32.v", "FStar.UInt32.uint_to_t", "Prims.b2t", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "LowStar.Buffer.alloca", "FStar.UInt8.__uint_to_t", "FStar.UInt32.__uint_to_t", "FStar.HyperStack.ST.push_frame", "Prims.bool", "EverCrypt.OpenSSL.aes256_gcm_decrypt", "LowStar.Failure.failwith", "EverCrypt.openssl", "EverCrypt.vale_and_aesni" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val aes256_gcm_decrypt: key:uint8_p -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher: uint8_p -> tag:uint8_p ->\n ST uint32_t aes256_gcm_decrypt_pre aes256_gcm_decrypt_post\nlet aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag =", "completed_definiton": "if vale_and_aesni ()\nthen\n (push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n let r = vale_aes256_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r)\nelse\n if openssl ()\n then OpenSSL.aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_decrypt)\"", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.aead_create", "original_source_type": "val aead_create: a:aead_alg {supported_aead_alg a} -> key:uint8_p ->\n ST aead_state aead_create_pre aead_create_post", "source_type": "val aead_create: a:aead_alg {supported_aead_alg a} -> key:uint8_p ->\n ST aead_state aead_create_pre aead_create_post", "source_definition": "let aead_create alg k =\n let st: aead_state_s =\n match alg with\n | AES128_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 176ul in\n Vale.old_aes128_key_expansion k xk;\n AEAD_AES128_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES128_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES128_GCM)\"\n | AES256_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 240ul in\n Vale.old_aes256_key_expansion k xk;\n AEAD_AES256_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES256_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES256_GCM)\"\n | CHACHA20_POLY1305 ->\n if hacl () then\n let k0 = B.malloc HS.root 0uy 32ul in\n blit k 0ul k0 0ul 32ul;\n AEAD_CHACHA20_POLY1305_HACL k0\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.CHACHA20_POLY1305 k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/CHACHA20_POLY1305)\"\n in\n B.malloc HS.root st 1ul", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 342, "start_col": 23, "end_line": 373, "end_col": 25 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"\n\nlet aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk\n\n[@CAbstractStruct]\nnoeq type aes256_key_s =\n | AES256_OPENSSL: st:Dyn.dyn -> aes256_key_s\n | AES256_BCRYPT: st:Dyn.dyn -> aes256_key_s\n | AES256_HACL: w:uint8_p -> sbox:uint8_p -> aes256_key_s\n\nlet aes256_create k =\n let st =\n if hacl () then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes256_compute k plain cipher =\n let k = !*k in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n Hacl.aes256_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_compute)\"\n\nlet aes256_free pk =\n let k = !*pk in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_free)\";\n B.free pk\n\n/// AES128-GCM\n\n#set-options \"--admit_smt_queries true\"\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes128_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm128_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes128_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm128_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n vale_aes128_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_encrypt)\"\n\nlet aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then\n begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n let r = vale_aes128_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_decrypt)\"\n\n/// AES256-GCM\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes256_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm256_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes256_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm256_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n vale_aes256_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_encrypt)\"\n\nlet aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n let r = vale_aes256_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_decrypt)\"\n\n\n/// AEAD\n\n[@CAbstractStruct]\nprivate noeq type _aead_state =\n | AEAD_OPENSSL: st:Dyn.dyn -> _aead_state\n | AEAD_BCRYPT: st:Dyn.dyn -> _aead_state\n | AEAD_AES128_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_AES256_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_CHACHA20_POLY1305_HACL: k:uint8_p -> _aead_state\n\nlet aead_state_s = _aead_state", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: EverCrypt.aead_alg{EverCrypt.supported_aead_alg a} -> key: EverCrypt.Helpers.uint8_p\n -> FStar.HyperStack.ST.ST EverCrypt.aead_state", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.aead_alg", "Prims.b2t", "EverCrypt.supported_aead_alg", "EverCrypt.Helpers.uint8_p", "LowStar.Buffer.malloc", "EverCrypt.aead_state_s", "FStar.Monotonic.HyperHeap.root", "FStar.UInt32.__uint_to_t", "LowStar.Monotonic.Buffer.mbuffer", "LowStar.Buffer.trivial_preorder", "Prims.l_and", "Prims.eq2", "Prims.nat", "LowStar.Monotonic.Buffer.length", "FStar.UInt32.v", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "FStar.Monotonic.HyperHeap.rid", "LowStar.Monotonic.Buffer.frameOf", "LowStar.Monotonic.Buffer.freeable", "EverCrypt.AEAD_AES128_GCM_VALE", "Prims.unit", "EverCrypt.Vale.old_aes128_key_expansion", "EverCrypt.Helpers.uint8_t", "FStar.UInt32.uint_to_t", "FStar.UInt32.t", "FStar.UInt8.__uint_to_t", "Prims.bool", "EverCrypt.AEAD_OPENSSL", "FStar.Dyn.dyn", "EverCrypt.OpenSSL.aead_create", "EverCrypt.OpenSSL.AES128_GCM", "LowStar.Failure.failwith", "EverCrypt.openssl", "EverCrypt.vale_and_aesni", "EverCrypt.AEAD_AES256_GCM_VALE", "EverCrypt.Vale.old_aes256_key_expansion", "EverCrypt.OpenSSL.AES256_GCM", "EverCrypt.AEAD_CHACHA20_POLY1305_HACL", "LowStar.BufferOps.blit", "EverCrypt.OpenSSL.CHACHA20_POLY1305", "EverCrypt.hacl", "EverCrypt.aead_state" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val aead_create: a:aead_alg {supported_aead_alg a} -> key:uint8_p ->\n ST aead_state aead_create_pre aead_create_post\nlet aead_create alg k =", "completed_definiton": "let st:aead_state_s =\n match alg with\n | AES128_GCM ->\n if vale_and_aesni ()\n then\n let xk = B.malloc HS.root 0uy 176ul in\n Vale.old_aes128_key_expansion k xk;\n AEAD_AES128_GCM_VALE xk\n else\n if openssl ()\n then AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES128_GCM k)\n else LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES128_GCM)\"\n | AES256_GCM ->\n if vale_and_aesni ()\n then\n let xk = B.malloc HS.root 0uy 240ul in\n Vale.old_aes256_key_expansion k xk;\n AEAD_AES256_GCM_VALE xk\n else\n if openssl ()\n then AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES256_GCM k)\n else LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES256_GCM)\"\n | CHACHA20_POLY1305 ->\n if hacl ()\n then\n let k0 = B.malloc HS.root 0uy 32ul in\n blit k 0ul k0 0ul 32ul;\n AEAD_CHACHA20_POLY1305_HACL k0\n else\n if openssl ()\n then AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.CHACHA20_POLY1305 k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/CHACHA20_POLY1305)\"\nin\nB.malloc HS.root st 1ul", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.aead_free", "original_source_type": "val aead_free: aead_state ->\n ST unit aead_free_pre aead_free_post", "source_type": "val aead_free: aead_state ->\n ST unit aead_free_pre aead_free_post", "source_definition": "let aead_free pk =\n let k = !*pk in\n if AEAD_AES128_GCM_VALE? k then\n let AEAD_AES128_GCM_VALE xk = k in\n B.free xk\n else if AEAD_AES256_GCM_VALE? k then\n let AEAD_AES256_GCM_VALE xk = k in\n B.free xk\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let AEAD_CHACHA20_POLY1305_HACL key = k in\n B.free key\n else if AEAD_OPENSSL? k then\n OpenSSL.aead_free (AEAD_OPENSSL?.st k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_free)\";\n B.free pk", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 410, "start_col": 18, "end_line": 425, "end_col": 11 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"\n\nlet aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk\n\n[@CAbstractStruct]\nnoeq type aes256_key_s =\n | AES256_OPENSSL: st:Dyn.dyn -> aes256_key_s\n | AES256_BCRYPT: st:Dyn.dyn -> aes256_key_s\n | AES256_HACL: w:uint8_p -> sbox:uint8_p -> aes256_key_s\n\nlet aes256_create k =\n let st =\n if hacl () then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes256_compute k plain cipher =\n let k = !*k in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n Hacl.aes256_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_compute)\"\n\nlet aes256_free pk =\n let k = !*pk in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_free)\";\n B.free pk\n\n/// AES128-GCM\n\n#set-options \"--admit_smt_queries true\"\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes128_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm128_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes128_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm128_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n vale_aes128_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_encrypt)\"\n\nlet aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then\n begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n let r = vale_aes128_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_decrypt)\"\n\n/// AES256-GCM\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes256_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm256_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes256_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm256_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n vale_aes256_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_encrypt)\"\n\nlet aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n let r = vale_aes256_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_decrypt)\"\n\n\n/// AEAD\n\n[@CAbstractStruct]\nprivate noeq type _aead_state =\n | AEAD_OPENSSL: st:Dyn.dyn -> _aead_state\n | AEAD_BCRYPT: st:Dyn.dyn -> _aead_state\n | AEAD_AES128_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_AES256_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_CHACHA20_POLY1305_HACL: k:uint8_p -> _aead_state\n\nlet aead_state_s = _aead_state\n\nlet aead_create alg k =\n let st: aead_state_s =\n match alg with\n | AES128_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 176ul in\n Vale.old_aes128_key_expansion k xk;\n AEAD_AES128_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES128_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES128_GCM)\"\n | AES256_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 240ul in\n Vale.old_aes256_key_expansion k xk;\n AEAD_AES256_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES256_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES256_GCM)\"\n | CHACHA20_POLY1305 ->\n if hacl () then\n let k0 = B.malloc HS.root 0uy 32ul in\n blit k 0ul k0 0ul 32ul;\n AEAD_CHACHA20_POLY1305_HACL k0\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.CHACHA20_POLY1305 k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/CHACHA20_POLY1305)\"\n in\n B.malloc HS.root st 1ul\n\nlet aead_encrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n Hacl.Chacha20Poly1305_32.aead_encrypt key iv adlen ad len plaintext cipher tag\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_encrypt)\"\n\nlet aead_decrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n let r = Hacl.Chacha20Poly1305_32.aead_decrypt key iv adlen ad len plaintext cipher tag in\n U32.(1ul -^ r)\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_decrypt)\"", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "pk: EverCrypt.aead_state -> FStar.HyperStack.ST.ST Prims.unit", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.aead_state", "LowStar.Monotonic.Buffer.free", "EverCrypt.aead_state_s", "LowStar.Buffer.trivial_preorder", "Prims.unit", "EverCrypt.uu___is_AEAD_AES128_GCM_VALE", "EverCrypt.Helpers.uint8_p", "EverCrypt.Helpers.uint8_t", "Prims.bool", "EverCrypt.uu___is_AEAD_AES256_GCM_VALE", "EverCrypt.uu___is_AEAD_CHACHA20_POLY1305_HACL", "EverCrypt.uu___is_AEAD_OPENSSL", "EverCrypt.OpenSSL.aead_free", "EverCrypt.__proj__AEAD_OPENSSL__item__st", "LowStar.Failure.failwith", "LowStar.BufferOps.op_Bang_Star" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val aead_free: aead_state ->\n ST unit aead_free_pre aead_free_post\nlet aead_free pk =", "completed_definiton": "let k = !*pk in\nif AEAD_AES128_GCM_VALE? k\nthen\n let AEAD_AES128_GCM_VALE xk = k in\n B.free xk\nelse\n if AEAD_AES256_GCM_VALE? k\n then\n let AEAD_AES256_GCM_VALE xk = k in\n B.free xk\n else\n if AEAD_CHACHA20_POLY1305_HACL? k\n then\n let AEAD_CHACHA20_POLY1305_HACL key = k in\n B.free key\n else\n if AEAD_OPENSSL? k\n then OpenSSL.aead_free (AEAD_OPENSSL?.st k)\n else LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_free)\";\nB.free pk", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.aead_encrypt", "original_source_type": "val aead_encrypt: key:aead_state -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher:uint8_p -> tag:uint8_p ->\n ST unit aead_encrypt_pre aead_encrypt_post", "source_type": "val aead_encrypt: key:aead_state -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher:uint8_p -> tag:uint8_p ->\n ST unit aead_encrypt_pre aead_encrypt_post", "source_definition": "let aead_encrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n Hacl.Chacha20Poly1305_32.aead_encrypt key iv adlen ad len plaintext cipher tag\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_encrypt)\"", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 375, "start_col": 60, "end_line": 390, "end_col": 79 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"\n\nlet aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk\n\n[@CAbstractStruct]\nnoeq type aes256_key_s =\n | AES256_OPENSSL: st:Dyn.dyn -> aes256_key_s\n | AES256_BCRYPT: st:Dyn.dyn -> aes256_key_s\n | AES256_HACL: w:uint8_p -> sbox:uint8_p -> aes256_key_s\n\nlet aes256_create k =\n let st =\n if hacl () then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes256_compute k plain cipher =\n let k = !*k in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n Hacl.aes256_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_compute)\"\n\nlet aes256_free pk =\n let k = !*pk in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_free)\";\n B.free pk\n\n/// AES128-GCM\n\n#set-options \"--admit_smt_queries true\"\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes128_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm128_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes128_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm128_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n vale_aes128_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_encrypt)\"\n\nlet aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then\n begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n let r = vale_aes128_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_decrypt)\"\n\n/// AES256-GCM\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes256_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm256_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes256_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm256_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n vale_aes256_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_encrypt)\"\n\nlet aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n let r = vale_aes256_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_decrypt)\"\n\n\n/// AEAD\n\n[@CAbstractStruct]\nprivate noeq type _aead_state =\n | AEAD_OPENSSL: st:Dyn.dyn -> _aead_state\n | AEAD_BCRYPT: st:Dyn.dyn -> _aead_state\n | AEAD_AES128_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_AES256_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_CHACHA20_POLY1305_HACL: k:uint8_p -> _aead_state\n\nlet aead_state_s = _aead_state\n\nlet aead_create alg k =\n let st: aead_state_s =\n match alg with\n | AES128_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 176ul in\n Vale.old_aes128_key_expansion k xk;\n AEAD_AES128_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES128_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES128_GCM)\"\n | AES256_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 240ul in\n Vale.old_aes256_key_expansion k xk;\n AEAD_AES256_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES256_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES256_GCM)\"\n | CHACHA20_POLY1305 ->\n if hacl () then\n let k0 = B.malloc HS.root 0uy 32ul in\n blit k 0ul k0 0ul 32ul;\n AEAD_CHACHA20_POLY1305_HACL k0\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.CHACHA20_POLY1305 k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/CHACHA20_POLY1305)\"\n in\n B.malloc HS.root st 1ul", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n key: EverCrypt.aead_state ->\n iv: EverCrypt.Helpers.uint8_p ->\n ad: EverCrypt.Helpers.uint8_p ->\n adlen: EverCrypt.Helpers.uint32_t ->\n plain: EverCrypt.Helpers.uint8_p ->\n len: EverCrypt.Helpers.uint32_t ->\n cipher: EverCrypt.Helpers.uint8_p ->\n tag: EverCrypt.Helpers.uint8_p\n -> FStar.HyperStack.ST.ST Prims.unit", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.aead_state", "EverCrypt.Helpers.uint8_p", "EverCrypt.Helpers.uint32_t", "EverCrypt.uu___is_AEAD_AES128_GCM_VALE", "EverCrypt.vale_aes128_gcm_encrypt", "Prims.unit", "EverCrypt.__proj__AEAD_AES128_GCM_VALE__item__xkey", "Prims.bool", "EverCrypt.uu___is_AEAD_AES256_GCM_VALE", "EverCrypt.vale_aes256_gcm_encrypt", "EverCrypt.__proj__AEAD_AES256_GCM_VALE__item__xkey", "EverCrypt.uu___is_AEAD_CHACHA20_POLY1305_HACL", "Hacl.Chacha20Poly1305_32.aead_encrypt", "EverCrypt.__proj__AEAD_CHACHA20_POLY1305_HACL__item__k", "EverCrypt.uu___is_AEAD_OPENSSL", "EverCrypt.OpenSSL.aead_encrypt", "FStar.Dyn.dyn", "EverCrypt.__proj__AEAD_OPENSSL__item__st", "LowStar.Failure.failwith", "EverCrypt.aead_state_s", "LowStar.BufferOps.op_Bang_Star", "LowStar.Buffer.trivial_preorder" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val aead_encrypt: key:aead_state -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher:uint8_p -> tag:uint8_p ->\n ST unit aead_encrypt_pre aead_encrypt_post\nlet aead_encrypt pkey iv ad adlen plaintext len cipher tag =", "completed_definiton": "let k = !*pkey in\nif AEAD_AES128_GCM_VALE? k\nthen\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_encrypt xk iv ad adlen plaintext len cipher tag\nelse\n if AEAD_AES256_GCM_VALE? k\n then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else\n if AEAD_CHACHA20_POLY1305_HACL? k\n then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n Hacl.Chacha20Poly1305_32.aead_encrypt key iv adlen ad len plaintext cipher tag\n else\n if AEAD_OPENSSL? k\n then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_encrypt key iv ad adlen plaintext len cipher tag\n else LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_encrypt)\"", "isa_cross_project_example": true }, { "file_name": "EverCrypt.fst", "name": "EverCrypt.aead_decrypt", "original_source_type": "val aead_decrypt: key:aead_state -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher:uint8_p -> tag:uint8_p ->\n ST uint32_t aead_decrypt_pre aead_decrypt_post", "source_type": "val aead_decrypt: key:aead_state -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher:uint8_p -> tag:uint8_p ->\n ST uint32_t aead_decrypt_pre aead_decrypt_post", "source_definition": "let aead_decrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n let r = Hacl.Chacha20Poly1305_32.aead_decrypt key iv adlen ad len plaintext cipher tag in\n U32.(1ul -^ r)\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_decrypt)\"", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/EverCrypt.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 392, "start_col": 60, "end_line": 408, "end_col": 79 }, "file_context": "module EverCrypt\n\nmodule B = LowStar.Buffer\n\nmodule Hacl = EverCrypt.Hacl\nmodule OpenSSL = EverCrypt.OpenSSL\nmodule Vale = EverCrypt.Vale\n\nmodule AC = EverCrypt.AutoConfig2\nmodule U32 = FStar.UInt32\nmodule HS = FStar.HyperStack\n\nopen EverCrypt.Helpers\nopen LowStar.BufferOps\n\ninline_for_extraction\nlet vale (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet vale_and_aesni (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n AC.has_aesni ()\n\ninline_for_extraction\nlet hacl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet openssl (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n true\n\ninline_for_extraction\nlet bcrypt (): Stack bool (fun _ -> True) (fun h0 _ h1 -> B.modifies B.loc_none h0 h1) =\n false\n\n/// Random sampling\n\nlet random_init () =\n OpenSSL.random_init ()\n\nlet random_sample len out =\n OpenSSL.random_sample len out\n\nlet random_cleanup () =\n ()\n\n/// AES128-ECB\n\n[@CAbstractStruct]\nnoeq type aes128_key_s =\n | AES128_OPENSSL: st:Dyn.dyn -> aes128_key_s\n | AES128_BCRYPT: st:Dyn.dyn -> aes128_key_s\n | AES128_VALE: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n | AES128_HACL: w:uint8_p -> sbox:uint8_p -> aes128_key_s\n\nlet aes128_create k =\n let st =\n if vale_and_aesni () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Vale.aes128_key_expansion_sbox k w sbox;\n AES128_VALE w sbox\n else if hacl () then\n let w = B.malloc HS.root 0uy 176ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes128_mk_sbox sbox;\n Hacl.aes128_keyExpansion k w sbox;\n AES128_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes128_compute k plain cipher =\n let k = !*k in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n Vale.aes128_encrypt_one_block cipher plain w sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n Hacl.aes128_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_compute)\"\n\nlet aes128_free pk =\n let k = !*pk in\n if AES128_VALE? k then\n let AES128_VALE w sbox = k in\n B.free w;\n B.free sbox\n else if AES128_HACL? k then\n let AES128_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_free)\";\n B.free pk\n\n[@CAbstractStruct]\nnoeq type aes256_key_s =\n | AES256_OPENSSL: st:Dyn.dyn -> aes256_key_s\n | AES256_BCRYPT: st:Dyn.dyn -> aes256_key_s\n | AES256_HACL: w:uint8_p -> sbox:uint8_p -> aes256_key_s\n\nlet aes256_create k =\n let st =\n if hacl () then\n let w = B.malloc HS.root 0uy 240ul in\n let sbox = B.malloc HS.root 0uy 256ul in\n Hacl.aes256_mk_sbox sbox;\n Hacl.aes256_keyExpansion k w sbox;\n AES256_HACL w sbox\n // else if openssl () then\n // OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n // else if bcrypt () then\n // BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_create)\"\n in\n B.malloc HS.root st 1ul\n\nlet aes256_compute k plain cipher =\n let k = !*k in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n Hacl.aes256_cipher cipher plain w sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_compute)\"\n\nlet aes256_free pk =\n let k = !*pk in\n if AES256_HACL? k then\n let AES256_HACL w sbox = k in\n B.free w;\n B.free sbox\n// else if openssl () then\n// OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n// else if bcrypt () then\n// BCrypt.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_free)\";\n B.free pk\n\n/// AES128-GCM\n\n#set-options \"--admit_smt_queries true\"\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes128_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm128_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes128_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm128_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n vale_aes128_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes128_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_encrypt)\"\n\nlet aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then\n begin\n push_frame ();\n let expanded = B.alloca 0uy 176ul in\n Vale.old_aes128_key_expansion key expanded;\n let r = vale_aes128_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes128_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes128_gcm_decrypt)\"\n\n/// AES256-GCM\n\n// TODO move to ValeGlue\nprivate inline_for_extraction\nlet vale_aes256_gcm_encrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit plaintext 0ul plaintext' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = plaintext';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = cipher';\n tag = tag\n }) 1ul in\n Vale.old_gcm256_encrypt b;\n blit cipher' 0ul cipher 0ul len;\n pop_frame ()\n\nprivate inline_for_extraction\nlet vale_aes256_gcm_decrypt xkey (iv:uint8_p) (ad:uint8_p) (adlen:uint32_t)\n (plaintext:uint8_p) (len:uint32_t) (cipher:uint8_p) (tag:uint8_p) =\n push_frame ();\n let open EverCrypt.Vale in\n let iv' = B.alloca 0uy 16ul in\n let plaintext' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let cipher' = B.alloca 0uy U32.(((len +^ 15ul) /^ 16ul) *^ 16ul) in\n let ad' = B.alloca 0uy U32.(((adlen +^ 15ul) /^ 16ul) *^ 16ul) in\n blit iv 0ul iv' 0ul 12ul;\n blit cipher 0ul cipher' 0ul len;\n blit ad 0ul ad' 0ul adlen;\n let b = B.alloca ({\n plain = cipher';\n plain_len = FStar.Int.Cast.Full.uint32_to_uint64 len;\n aad = ad';\n aad_len = FStar.Int.Cast.Full.uint32_to_uint64 adlen;\n iv = iv';\n expanded_key = xkey;\n cipher = plaintext';\n tag = tag\n }) 1ul in\n let ret = Vale.old_gcm256_decrypt b in\n blit plaintext' 0ul plaintext 0ul len;\n pop_frame ();\n if ret = 0ul then 1ul else 0ul\n\nlet aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n vale_aes256_gcm_encrypt expanded iv ad adlen plaintext len cipher tag;\n pop_frame ()\n end\n else if openssl () then\n OpenSSL.aes256_gcm_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_encrypt)\"\n\nlet aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag =\n if vale_and_aesni () then begin\n push_frame ();\n let expanded = B.alloca 0uy 240ul in\n Vale.old_aes256_key_expansion key expanded;\n let r = vale_aes256_gcm_decrypt expanded iv ad adlen plaintext len cipher tag in\n pop_frame ();\n r\n end\n else if openssl () then\n OpenSSL.aes256_gcm_decrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aes256_gcm_decrypt)\"\n\n\n/// AEAD\n\n[@CAbstractStruct]\nprivate noeq type _aead_state =\n | AEAD_OPENSSL: st:Dyn.dyn -> _aead_state\n | AEAD_BCRYPT: st:Dyn.dyn -> _aead_state\n | AEAD_AES128_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_AES256_GCM_VALE: xkey:uint8_p -> _aead_state\n | AEAD_CHACHA20_POLY1305_HACL: k:uint8_p -> _aead_state\n\nlet aead_state_s = _aead_state\n\nlet aead_create alg k =\n let st: aead_state_s =\n match alg with\n | AES128_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 176ul in\n Vale.old_aes128_key_expansion k xk;\n AEAD_AES128_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES128_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES128_GCM)\"\n | AES256_GCM ->\n if vale_and_aesni () then\n let xk = B.malloc HS.root 0uy 240ul in\n Vale.old_aes256_key_expansion k xk;\n AEAD_AES256_GCM_VALE xk\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.AES256_GCM k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/AES256_GCM)\"\n | CHACHA20_POLY1305 ->\n if hacl () then\n let k0 = B.malloc HS.root 0uy 32ul in\n blit k 0ul k0 0ul 32ul;\n AEAD_CHACHA20_POLY1305_HACL k0\n else if openssl () then\n AEAD_OPENSSL (OpenSSL.aead_create OpenSSL.CHACHA20_POLY1305 k)\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_create/CHACHA20_POLY1305)\"\n in\n B.malloc HS.root st 1ul\n\nlet aead_encrypt pkey iv ad adlen plaintext len cipher tag =\n let k = !*pkey in\n if AEAD_AES128_GCM_VALE? k then\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_AES256_GCM_VALE? k then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_encrypt xk iv ad adlen plaintext len cipher tag\n else if AEAD_CHACHA20_POLY1305_HACL? k then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n Hacl.Chacha20Poly1305_32.aead_encrypt key iv adlen ad len plaintext cipher tag\n else if AEAD_OPENSSL? k then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_encrypt key iv ad adlen plaintext len cipher tag\n else\n LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_encrypt)\"", "dependencies": { "source_file": "EverCrypt.fst", "checked_file": "EverCrypt.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Failure.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Hacl.Chacha20Poly1305_32.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Dyn.fsti.checked", "EverCrypt.Vale.fsti.checked", "EverCrypt.OpenSSL.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Hacl.fsti.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AC", "full_module": "EverCrypt.AutoConfig2" }, { "abbrev": true, "short_module": "Vale", "full_module": "EverCrypt.Vale" }, { "abbrev": true, "short_module": "OpenSSL", "full_module": "EverCrypt.OpenSSL" }, { "abbrev": true, "short_module": "Hacl", "full_module": "EverCrypt.Hacl" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Curve25519" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Poly1305" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.DRBG" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.HMAC" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Hash" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Specs" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n key: EverCrypt.aead_state ->\n iv: EverCrypt.Helpers.uint8_p ->\n ad: EverCrypt.Helpers.uint8_p ->\n adlen: EverCrypt.Helpers.uint32_t ->\n plain: EverCrypt.Helpers.uint8_p ->\n len: EverCrypt.Helpers.uint32_t ->\n cipher: EverCrypt.Helpers.uint8_p ->\n tag: EverCrypt.Helpers.uint8_p\n -> FStar.HyperStack.ST.ST EverCrypt.Helpers.uint32_t", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.aead_state", "EverCrypt.Helpers.uint8_p", "EverCrypt.Helpers.uint32_t", "EverCrypt.uu___is_AEAD_AES128_GCM_VALE", "EverCrypt.vale_aes128_gcm_decrypt", "FStar.UInt32.t", "EverCrypt.__proj__AEAD_AES128_GCM_VALE__item__xkey", "Prims.bool", "EverCrypt.uu___is_AEAD_AES256_GCM_VALE", "EverCrypt.vale_aes256_gcm_decrypt", "EverCrypt.__proj__AEAD_AES256_GCM_VALE__item__xkey", "EverCrypt.uu___is_AEAD_CHACHA20_POLY1305_HACL", "FStar.UInt32.op_Subtraction_Hat", "FStar.UInt32.__uint_to_t", "Hacl.Chacha20Poly1305_32.aead_decrypt", "EverCrypt.__proj__AEAD_CHACHA20_POLY1305_HACL__item__k", "EverCrypt.uu___is_AEAD_OPENSSL", "EverCrypt.OpenSSL.aead_decrypt", "FStar.Dyn.dyn", "EverCrypt.__proj__AEAD_OPENSSL__item__st", "LowStar.Failure.failwith", "EverCrypt.aead_state_s", "LowStar.BufferOps.op_Bang_Star", "LowStar.Buffer.trivial_preorder" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val aead_decrypt: key:aead_state -> iv:uint8_p ->\n ad:uint8_p -> adlen:uint32_t ->\n plain:uint8_p -> len:uint32_t ->\n cipher:uint8_p -> tag:uint8_p ->\n ST uint32_t aead_decrypt_pre aead_decrypt_post\nlet aead_decrypt pkey iv ad adlen plaintext len cipher tag =", "completed_definiton": "let k = !*pkey in\nif AEAD_AES128_GCM_VALE? k\nthen\n let xk = AEAD_AES128_GCM_VALE?.xkey k in\n vale_aes128_gcm_decrypt xk iv ad adlen plaintext len cipher tag\nelse\n if AEAD_AES256_GCM_VALE? k\n then\n let xk = AEAD_AES256_GCM_VALE?.xkey k in\n vale_aes256_gcm_decrypt xk iv ad adlen plaintext len cipher tag\n else\n if AEAD_CHACHA20_POLY1305_HACL? k\n then\n let key = AEAD_CHACHA20_POLY1305_HACL?.k k in\n let r = Hacl.Chacha20Poly1305_32.aead_decrypt key iv adlen ad len plaintext cipher tag in\n let open U32 in 1ul -^ r\n else\n if AEAD_OPENSSL? k\n then\n let key = AEAD_OPENSSL?.st k in\n OpenSSL.aead_decrypt key iv ad adlen plaintext len cipher tag\n else LowStar.Failure.failwith \"ERROR: inconsistent configuration (aead_decrypt)\"", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_custom_data.fsti", "name": "Parsers.TicketContents13_custom_data.min_len", "original_source_type": "", "source_type": "val min_len : Prims.int", "source_definition": "let min_len = 0", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_custom_data.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 21, "start_col": 46, "end_line": 21, "end_col": 47 }, "file_context": "module Parsers.TicketContents13_custom_data\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST", "dependencies": { "source_file": "Parsers.TicketContents13_custom_data.fsti", "checked_file": "Parsers.TicketContents13_custom_data.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.int", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let min_len =", "completed_definiton": "0", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_custom_data.fsti", "name": "Parsers.TicketContents13_custom_data.max_len", "original_source_type": "", "source_type": "val max_len : Prims.int", "source_definition": "let max_len = 65535", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_custom_data.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 22, "start_col": 46, "end_line": 22, "end_col": 51 }, "file_context": "module Parsers.TicketContents13_custom_data\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST", "dependencies": { "source_file": "Parsers.TicketContents13_custom_data.fsti", "checked_file": "Parsers.TicketContents13_custom_data.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.int", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let max_len =", "completed_definiton": "65535", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13_custom_data.fsti", "name": "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "original_source_type": "", "source_type": "val ticketContents13_custom_data_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let ticketContents13_custom_data_parser_kind = LP.strong_parser_kind 2 65537 None", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13_custom_data.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 25, "start_col": 79, "end_line": 25, "end_col": 113 }, "file_context": "module Parsers.TicketContents13_custom_data\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ninline_for_extraction noextract let min_len = 0\ninline_for_extraction noextract let max_len = 65535\ntype ticketContents13_custom_data = b:bytes{0 <= length b /\\ length b <= 65535}", "dependencies": { "source_file": "Parsers.TicketContents13_custom_data.fsti", "checked_file": "Parsers.TicketContents13_custom_data.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let ticketContents13_custom_data_parser_kind =", "completed_definiton": "LP.strong_parser_kind 2 65537 None", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_label.fst", "name": "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_bytesize", "original_source_type": "val hkdfLabel_label_bytesize (x:hkdfLabel_label) : GTot nat", "source_type": "val hkdfLabel_label_bytesize (x:hkdfLabel_label) : GTot nat", "source_definition": "let hkdfLabel_label_bytesize (x:hkdfLabel_label) : GTot nat = Seq.length (hkdfLabel_label_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_label.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 27, "start_col": 62, "end_line": 27, "end_col": 103 }, "file_context": "module Parsers.HKDF.HkdfLabel_label\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let hkdfLabel_label_parser = LP.parse_bounded_vlbytes 7 255\n\nnoextract let hkdfLabel_label_serializer = LP.serialize_bounded_vlbytes 7 255", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_label.fst", "checked_file": "Parsers.HKDF.HkdfLabel_label.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.HKDF.HkdfLabel_label.hkdfLabel_label -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_label_bytesize (x:hkdfLabel_label) : GTot nat\nlet hkdfLabel_label_bytesize (x: hkdfLabel_label) : GTot nat =", "completed_definiton": "Seq.length (hkdfLabel_label_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_label.fst", "name": "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser32", "original_source_type": "val hkdfLabel_label_parser32: LS.parser32 hkdfLabel_label_parser", "source_type": "val hkdfLabel_label_parser32: LS.parser32 hkdfLabel_label_parser", "source_definition": "let hkdfLabel_label_parser32 = LS.parse32_bounded_vlbytes 7 7ul 255 255ul", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_label.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 31, "start_col": 31, "end_line": 31, "end_col": 73 }, "file_context": "module Parsers.HKDF.HkdfLabel_label\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let hkdfLabel_label_parser = LP.parse_bounded_vlbytes 7 255\n\nnoextract let hkdfLabel_label_serializer = LP.serialize_bounded_vlbytes 7 255\n\nlet hkdfLabel_label_bytesize (x:hkdfLabel_label) : GTot nat = Seq.length (hkdfLabel_label_serializer x)\n\nlet hkdfLabel_label_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_label.fst", "checked_file": "Parsers.HKDF.HkdfLabel_label.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Bytes.parse32_bounded_vlbytes", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_label_parser32: LS.parser32 hkdfLabel_label_parser\nlet hkdfLabel_label_parser32 =", "completed_definiton": "LS.parse32_bounded_vlbytes 7 7ul 255 255ul", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_label.fst", "name": "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_serializer", "original_source_type": "val hkdfLabel_label_serializer: LP.serializer hkdfLabel_label_parser", "source_type": "val hkdfLabel_label_serializer: LP.serializer hkdfLabel_label_parser", "source_definition": "let hkdfLabel_label_serializer = LP.serialize_bounded_vlbytes 7 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_label.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 25, "start_col": 43, "end_line": 25, "end_col": 77 }, "file_context": "module Parsers.HKDF.HkdfLabel_label\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let hkdfLabel_label_parser = LP.parse_bounded_vlbytes 7 255", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_label.fst", "checked_file": "Parsers.HKDF.HkdfLabel_label.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Bytes.serialize_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_label_serializer: LP.serializer hkdfLabel_label_parser\nlet hkdfLabel_label_serializer =", "completed_definiton": "LP.serialize_bounded_vlbytes 7 255", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_label.fst", "name": "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser", "original_source_type": "val hkdfLabel_label_parser: LP.parser hkdfLabel_label_parser_kind hkdfLabel_label", "source_type": "val hkdfLabel_label_parser: LP.parser hkdfLabel_label_parser_kind hkdfLabel_label", "source_definition": "let hkdfLabel_label_parser = LP.parse_bounded_vlbytes 7 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_label.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 23, "start_col": 39, "end_line": 23, "end_col": 69 }, "file_context": "module Parsers.HKDF.HkdfLabel_label\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_label.fst", "checked_file": "Parsers.HKDF.HkdfLabel_label.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind\n Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Bytes.parse_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_label_parser: LP.parser hkdfLabel_label_parser_kind hkdfLabel_label\nlet hkdfLabel_label_parser =", "completed_definiton": "LP.parse_bounded_vlbytes 7 255", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_label.fst", "name": "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_jumper", "original_source_type": "val hkdfLabel_label_jumper: LL.jumper hkdfLabel_label_parser", "source_type": "val hkdfLabel_label_jumper: LL.jumper hkdfLabel_label_parser", "source_definition": "let hkdfLabel_label_jumper = LL.jump_bounded_vlbytes 7 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_label.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 39, "start_col": 29, "end_line": 39, "end_col": 58 }, "file_context": "module Parsers.HKDF.HkdfLabel_label\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let hkdfLabel_label_parser = LP.parse_bounded_vlbytes 7 255\n\nnoextract let hkdfLabel_label_serializer = LP.serialize_bounded_vlbytes 7 255\n\nlet hkdfLabel_label_bytesize (x:hkdfLabel_label) : GTot nat = Seq.length (hkdfLabel_label_serializer x)\n\nlet hkdfLabel_label_bytesize_eq x = ()\n\nlet hkdfLabel_label_parser32 = LS.parse32_bounded_vlbytes 7 7ul 255 255ul\n\nlet hkdfLabel_label_serializer32 = LS.serialize32_bounded_vlbytes 7 255\n\nlet hkdfLabel_label_size32 = LSZ.size32_bounded_vlbytes 7 255\n\nlet hkdfLabel_label_validator = LL.validate_bounded_vlbytes 7 255", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_label.fst", "checked_file": "Parsers.HKDF.HkdfLabel_label.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Bytes.jump_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_label_jumper: LL.jumper hkdfLabel_label_parser\nlet hkdfLabel_label_jumper =", "completed_definiton": "LL.jump_bounded_vlbytes 7 255", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_label.fst", "name": "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_serializer32", "original_source_type": "val hkdfLabel_label_serializer32: LS.serializer32 hkdfLabel_label_serializer", "source_type": "val hkdfLabel_label_serializer32: LS.serializer32 hkdfLabel_label_serializer", "source_definition": "let hkdfLabel_label_serializer32 = LS.serialize32_bounded_vlbytes 7 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_label.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 33, "start_col": 35, "end_line": 33, "end_col": 71 }, "file_context": "module Parsers.HKDF.HkdfLabel_label\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let hkdfLabel_label_parser = LP.parse_bounded_vlbytes 7 255\n\nnoextract let hkdfLabel_label_serializer = LP.serialize_bounded_vlbytes 7 255\n\nlet hkdfLabel_label_bytesize (x:hkdfLabel_label) : GTot nat = Seq.length (hkdfLabel_label_serializer x)\n\nlet hkdfLabel_label_bytesize_eq x = ()\n\nlet hkdfLabel_label_parser32 = LS.parse32_bounded_vlbytes 7 7ul 255 255ul", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_label.fst", "checked_file": "Parsers.HKDF.HkdfLabel_label.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Bytes.serialize32_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_label_serializer32: LS.serializer32 hkdfLabel_label_serializer\nlet hkdfLabel_label_serializer32 =", "completed_definiton": "LS.serialize32_bounded_vlbytes 7 255", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_label.fst", "name": "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_validator", "original_source_type": "val hkdfLabel_label_validator: LL.validator hkdfLabel_label_parser", "source_type": "val hkdfLabel_label_validator: LL.validator hkdfLabel_label_parser", "source_definition": "let hkdfLabel_label_validator = LL.validate_bounded_vlbytes 7 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_label.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 37, "start_col": 32, "end_line": 37, "end_col": 65 }, "file_context": "module Parsers.HKDF.HkdfLabel_label\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let hkdfLabel_label_parser = LP.parse_bounded_vlbytes 7 255\n\nnoextract let hkdfLabel_label_serializer = LP.serialize_bounded_vlbytes 7 255\n\nlet hkdfLabel_label_bytesize (x:hkdfLabel_label) : GTot nat = Seq.length (hkdfLabel_label_serializer x)\n\nlet hkdfLabel_label_bytesize_eq x = ()\n\nlet hkdfLabel_label_parser32 = LS.parse32_bounded_vlbytes 7 7ul 255 255ul\n\nlet hkdfLabel_label_serializer32 = LS.serialize32_bounded_vlbytes 7 255\n\nlet hkdfLabel_label_size32 = LSZ.size32_bounded_vlbytes 7 255", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_label.fst", "checked_file": "Parsers.HKDF.HkdfLabel_label.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Bytes.validate_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_label_validator: LL.validator hkdfLabel_label_parser\nlet hkdfLabel_label_validator =", "completed_definiton": "LL.validate_bounded_vlbytes 7 255", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_label.fst", "name": "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_size32", "original_source_type": "val hkdfLabel_label_size32: LSZ.size32 hkdfLabel_label_serializer", "source_type": "val hkdfLabel_label_size32: LSZ.size32 hkdfLabel_label_serializer", "source_definition": "let hkdfLabel_label_size32 = LSZ.size32_bounded_vlbytes 7 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_label.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 35, "start_col": 29, "end_line": 35, "end_col": 61 }, "file_context": "module Parsers.HKDF.HkdfLabel_label\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let hkdfLabel_label_parser = LP.parse_bounded_vlbytes 7 255\n\nnoextract let hkdfLabel_label_serializer = LP.serialize_bounded_vlbytes 7 255\n\nlet hkdfLabel_label_bytesize (x:hkdfLabel_label) : GTot nat = Seq.length (hkdfLabel_label_serializer x)\n\nlet hkdfLabel_label_bytesize_eq x = ()\n\nlet hkdfLabel_label_parser32 = LS.parse32_bounded_vlbytes 7 7ul 255 255ul\n\nlet hkdfLabel_label_serializer32 = LS.serialize32_bounded_vlbytes 7 255", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_label.fst", "checked_file": "Parsers.HKDF.HkdfLabel_label.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Bytes.size32_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_label_size32: LSZ.size32 hkdfLabel_label_serializer\nlet hkdfLabel_label_size32 =", "completed_definiton": "LSZ.size32_bounded_vlbytes 7 255", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_label.fst", "name": "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_bytesize_eqn", "original_source_type": "val hkdfLabel_label_bytesize_eqn (x: hkdfLabel_label) : Lemma (hkdfLabel_label_bytesize x == 1 + BY.length x) [SMTPat (hkdfLabel_label_bytesize x)]", "source_type": "val hkdfLabel_label_bytesize_eqn (x: hkdfLabel_label) : Lemma (hkdfLabel_label_bytesize x == 1 + BY.length x) [SMTPat (hkdfLabel_label_bytesize x)]", "source_definition": "let hkdfLabel_label_bytesize_eqn x = LP.length_serialize_bounded_vlbytes 7 255 x", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_label.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 41, "start_col": 37, "end_line": 41, "end_col": 80 }, "file_context": "module Parsers.HKDF.HkdfLabel_label\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let hkdfLabel_label_parser = LP.parse_bounded_vlbytes 7 255\n\nnoextract let hkdfLabel_label_serializer = LP.serialize_bounded_vlbytes 7 255\n\nlet hkdfLabel_label_bytesize (x:hkdfLabel_label) : GTot nat = Seq.length (hkdfLabel_label_serializer x)\n\nlet hkdfLabel_label_bytesize_eq x = ()\n\nlet hkdfLabel_label_parser32 = LS.parse32_bounded_vlbytes 7 7ul 255 255ul\n\nlet hkdfLabel_label_serializer32 = LS.serialize32_bounded_vlbytes 7 255\n\nlet hkdfLabel_label_size32 = LSZ.size32_bounded_vlbytes 7 255\n\nlet hkdfLabel_label_validator = LL.validate_bounded_vlbytes 7 255\n\nlet hkdfLabel_label_jumper = LL.jump_bounded_vlbytes 7 255", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_label.fst", "checked_file": "Parsers.HKDF.HkdfLabel_label.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.HKDF.HkdfLabel_label.hkdfLabel_label\n -> FStar.Pervasives.Lemma\n (ensures Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_bytesize x == 1 + FStar.Bytes.length x)\n [SMTPat (Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_bytesize x)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "LowParse.Spec.Bytes.length_serialize_bounded_vlbytes", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_label_bytesize_eqn (x: hkdfLabel_label) : Lemma (hkdfLabel_label_bytesize x == 1 + BY.length x) [SMTPat (hkdfLabel_label_bytesize x)]\nlet hkdfLabel_label_bytesize_eqn x =", "completed_definiton": "LP.length_serialize_bounded_vlbytes 7 255 x", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_label.fst", "name": "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_length", "original_source_type": "val hkdfLabel_label_length (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid hkdfLabel_label_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents hkdfLabel_label_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v pos + 1 + U32.v res == U32.v (LL.get_valid_pos hkdfLabel_label_parser h input pos) /\\\n res == BY.len x /\\\n LL.bytes_of_slice_from_to h input (pos `U32.add` 1ul) ((pos `U32.add` 1ul) `U32.add` res) == BY.reveal x\n ))", "source_type": "val hkdfLabel_label_length (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid hkdfLabel_label_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents hkdfLabel_label_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v pos + 1 + U32.v res == U32.v (LL.get_valid_pos hkdfLabel_label_parser h input pos) /\\\n res == BY.len x /\\\n LL.bytes_of_slice_from_to h input (pos `U32.add` 1ul) ((pos `U32.add` 1ul) `U32.add` res) == BY.reveal x\n ))", "source_definition": "let hkdfLabel_label_length #_ #_ input pos =\n [@inline_let] let _ = assert_norm (hkdfLabel_label == LP.parse_bounded_vlbytes_t 7 255) in\n LL.bounded_vlbytes_payload_length 7 255 input pos", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_label.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 44, "start_col": 2, "end_line": 45, "end_col": 51 }, "file_context": "module Parsers.HKDF.HkdfLabel_label\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let hkdfLabel_label_parser = LP.parse_bounded_vlbytes 7 255\n\nnoextract let hkdfLabel_label_serializer = LP.serialize_bounded_vlbytes 7 255\n\nlet hkdfLabel_label_bytesize (x:hkdfLabel_label) : GTot nat = Seq.length (hkdfLabel_label_serializer x)\n\nlet hkdfLabel_label_bytesize_eq x = ()\n\nlet hkdfLabel_label_parser32 = LS.parse32_bounded_vlbytes 7 7ul 255 255ul\n\nlet hkdfLabel_label_serializer32 = LS.serialize32_bounded_vlbytes 7 255\n\nlet hkdfLabel_label_size32 = LSZ.size32_bounded_vlbytes 7 255\n\nlet hkdfLabel_label_validator = LL.validate_bounded_vlbytes 7 255\n\nlet hkdfLabel_label_jumper = LL.jump_bounded_vlbytes 7 255\n\nlet hkdfLabel_label_bytesize_eqn x = LP.length_serialize_bounded_vlbytes 7 255 x", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_label.fst", "checked_file": "Parsers.HKDF.HkdfLabel_label.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "input: LowParse.Slice.slice rrel rel -> pos: FStar.UInt32.t\n -> FStar.HyperStack.ST.Stack FStar.UInt32.t", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "LowParse.Low.Bytes.bounded_vlbytes_payload_length", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_label_length (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid hkdfLabel_label_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents hkdfLabel_label_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v pos + 1 + U32.v res == U32.v (LL.get_valid_pos hkdfLabel_label_parser h input pos) /\\\n res == BY.len x /\\\n LL.bytes_of_slice_from_to h input (pos `U32.add` 1ul) ((pos `U32.add` 1ul) `U32.add` res) == BY.reveal x\n ))\nlet hkdfLabel_label_length #_ #_ input pos =", "completed_definiton": "[@@ inline_let ]let _ = assert_norm (hkdfLabel_label == LP.parse_bounded_vlbytes_t 7 255) in\nLL.bounded_vlbytes_payload_length 7 255 input pos", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_label.fst", "name": "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_finalize", "original_source_type": "val hkdfLabel_label_finalize (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) (len: U32.t) : HST.Stack U32.t\n\n (requires (fun h ->\n LL.live_slice h input /\\\n 7 <= U32.v len /\\ U32.v len <= 255 /\\\n U32.v pos + 1 + U32.v len <= U32.v input.LL.len /\\\n LL.writable input.LL.base (U32.v pos) (U32.v pos + 1) h\n ))\n (ensures (fun h pos' h' ->\n let pos_payload = pos `U32.add` 1ul in\n B.modifies (LL.loc_slice_from_to input pos pos_payload) h h' /\\\n LL.valid_content_pos hkdfLabel_label_parser h' input pos (BY.hide (LL.bytes_of_slice_from_to h input pos_payload (pos_payload `U32.add` len))) pos' /\\\n U32.v pos' == U32.v pos_payload + U32.v len\n ))", "source_type": "val hkdfLabel_label_finalize (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) (len: U32.t) : HST.Stack U32.t\n\n (requires (fun h ->\n LL.live_slice h input /\\\n 7 <= U32.v len /\\ U32.v len <= 255 /\\\n U32.v pos + 1 + U32.v len <= U32.v input.LL.len /\\\n LL.writable input.LL.base (U32.v pos) (U32.v pos + 1) h\n ))\n (ensures (fun h pos' h' ->\n let pos_payload = pos `U32.add` 1ul in\n B.modifies (LL.loc_slice_from_to input pos pos_payload) h h' /\\\n LL.valid_content_pos hkdfLabel_label_parser h' input pos (BY.hide (LL.bytes_of_slice_from_to h input pos_payload (pos_payload `U32.add` len))) pos' /\\\n U32.v pos' == U32.v pos_payload + U32.v len\n ))", "source_definition": "let hkdfLabel_label_finalize #_ #_ input pos len =\n [@inline_let] let _ = assert_norm (hkdfLabel_label == LP.parse_bounded_vlbytes_t 7 255) in\n LL.finalize_bounded_vlbytes 7 255 input pos len", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_label.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 48, "start_col": 2, "end_line": 49, "end_col": 49 }, "file_context": "module Parsers.HKDF.HkdfLabel_label\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nnoextract let hkdfLabel_label_parser = LP.parse_bounded_vlbytes 7 255\n\nnoextract let hkdfLabel_label_serializer = LP.serialize_bounded_vlbytes 7 255\n\nlet hkdfLabel_label_bytesize (x:hkdfLabel_label) : GTot nat = Seq.length (hkdfLabel_label_serializer x)\n\nlet hkdfLabel_label_bytesize_eq x = ()\n\nlet hkdfLabel_label_parser32 = LS.parse32_bounded_vlbytes 7 7ul 255 255ul\n\nlet hkdfLabel_label_serializer32 = LS.serialize32_bounded_vlbytes 7 255\n\nlet hkdfLabel_label_size32 = LSZ.size32_bounded_vlbytes 7 255\n\nlet hkdfLabel_label_validator = LL.validate_bounded_vlbytes 7 255\n\nlet hkdfLabel_label_jumper = LL.jump_bounded_vlbytes 7 255\n\nlet hkdfLabel_label_bytesize_eqn x = LP.length_serialize_bounded_vlbytes 7 255 x\n\nlet hkdfLabel_label_length #_ #_ input pos =\n [@inline_let] let _ = assert_norm (hkdfLabel_label == LP.parse_bounded_vlbytes_t 7 255) in\n LL.bounded_vlbytes_payload_length 7 255 input pos", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_label.fst", "checked_file": "Parsers.HKDF.HkdfLabel_label.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "input: LowParse.Slice.slice rrel rel -> pos: FStar.UInt32.t -> len: FStar.UInt32.t\n -> FStar.HyperStack.ST.Stack FStar.UInt32.t", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "LowParse.Low.Bytes.finalize_bounded_vlbytes", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_label_finalize (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) (len: U32.t) : HST.Stack U32.t\n\n (requires (fun h ->\n LL.live_slice h input /\\\n 7 <= U32.v len /\\ U32.v len <= 255 /\\\n U32.v pos + 1 + U32.v len <= U32.v input.LL.len /\\\n LL.writable input.LL.base (U32.v pos) (U32.v pos + 1) h\n ))\n (ensures (fun h pos' h' ->\n let pos_payload = pos `U32.add` 1ul in\n B.modifies (LL.loc_slice_from_to input pos pos_payload) h h' /\\\n LL.valid_content_pos hkdfLabel_label_parser h' input pos (BY.hide (LL.bytes_of_slice_from_to h input pos_payload (pos_payload `U32.add` len))) pos' /\\\n U32.v pos' == U32.v pos_payload + U32.v len\n ))\nlet hkdfLabel_label_finalize #_ #_ input pos len =", "completed_definiton": "[@@ inline_let ]let _ = assert_norm (hkdfLabel_label == LP.parse_bounded_vlbytes_t 7 255) in\nLL.finalize_bounded_vlbytes 7 255 input pos len", "isa_cross_project_example": true }, { "file_name": "Format.Constants.fst", "name": "Format.Constants.constantByte_parser", "original_source_type": "val constantByte_parser (c: byte) : Tot (LP.parser constantByte_parser_kind (constantByte c))", "source_type": "val constantByte_parser (c: byte) : Tot (LP.parser constantByte_parser_kind (constantByte c))", "source_definition": "let constantByte_parser c =\n LP.parse_filter LP.parse_u8 (is_constantByte c)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.Constants.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 13, "start_col": 2, "end_line": 13, "end_col": 49 }, "file_context": "module Format.Constants\n\nopen FStar.Bytes\n\nmodule LP = LowParse.SLow\nmodule U8 = FStar.UInt8\n\nlet constantByte_parser_kind' = LP.parse_filter_kind LP.parse_u8_kind\n\nlet constantByte_parser_kind_metadata = constantByte_parser_kind'.LP.parser_kind_metadata", "dependencies": { "source_file": "Format.Constants.fst", "checked_file": "Format.Constants.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "c: FStar.Bytes.byte\n -> LowParse.Spec.Base.parser Format.Constants.constantByte_parser_kind\n (Format.Constants.constantByte c)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Bytes.byte", "LowParse.Spec.Combinators.parse_filter", "LowParse.Spec.Int.parse_u8_kind", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "Format.Constants.is_constantByte", "LowParse.Spec.Base.parser", "Format.Constants.constantByte_parser_kind", "Format.Constants.constantByte" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val constantByte_parser (c: byte) : Tot (LP.parser constantByte_parser_kind (constantByte c))\nlet constantByte_parser c =", "completed_definiton": "LP.parse_filter LP.parse_u8 (is_constantByte c)", "isa_cross_project_example": true }, { "file_name": "Format.Constants.fst", "name": "Format.Constants.constantByte_parser_kind_metadata", "original_source_type": "val constantByte_parser_kind_metadata: LP.parser_kind_metadata_t", "source_type": "val constantByte_parser_kind_metadata: LP.parser_kind_metadata_t", "source_definition": "let constantByte_parser_kind_metadata = constantByte_parser_kind'.LP.parser_kind_metadata", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.Constants.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 10, "start_col": 40, "end_line": 10, "end_col": 89 }, "file_context": "module Format.Constants\n\nopen FStar.Bytes\n\nmodule LP = LowParse.SLow\nmodule U8 = FStar.UInt8\n\nlet constantByte_parser_kind' = LP.parse_filter_kind LP.parse_u8_kind", "dependencies": { "source_file": "Format.Constants.fst", "checked_file": "Format.Constants.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind_metadata_t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_metadata", "Format.Constants.constantByte_parser_kind'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val constantByte_parser_kind_metadata: LP.parser_kind_metadata_t\nlet constantByte_parser_kind_metadata =", "completed_definiton": "constantByte_parser_kind'.LP.parser_kind_metadata", "isa_cross_project_example": true }, { "file_name": "Format.Constants.fst", "name": "Format.Constants.constantByte_parser_kind'", "original_source_type": "", "source_type": "val constantByte_parser_kind' : LowParse.Spec.Base.parser_kind", "source_definition": "let constantByte_parser_kind' = LP.parse_filter_kind LP.parse_u8_kind", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.Constants.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 8, "start_col": 32, "end_line": 8, "end_col": 69 }, "file_context": "module Format.Constants\n\nopen FStar.Bytes\n\nmodule LP = LowParse.SLow\nmodule U8 = FStar.UInt8", "dependencies": { "source_file": "Format.Constants.fst", "checked_file": "Format.Constants.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let constantByte_parser_kind' =", "completed_definiton": "LP.parse_filter_kind LP.parse_u8_kind", "isa_cross_project_example": true }, { "file_name": "Format.Constants.fst", "name": "Format.Constants.constantByte_parser32", "original_source_type": "val constantByte_parser32 (c:byte): Tot (LP.parser32 (constantByte_parser c))", "source_type": "val constantByte_parser32 (c:byte): Tot (LP.parser32 (constantByte_parser c))", "source_definition": "let constantByte_parser32 c =\n LP.parse32_filter LP.parse32_u8 (is_constantByte c) (fun x -> is_constantByte c x)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.Constants.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 16, "start_col": 2, "end_line": 16, "end_col": 84 }, "file_context": "module Format.Constants\n\nopen FStar.Bytes\n\nmodule LP = LowParse.SLow\nmodule U8 = FStar.UInt8\n\nlet constantByte_parser_kind' = LP.parse_filter_kind LP.parse_u8_kind\n\nlet constantByte_parser_kind_metadata = constantByte_parser_kind'.LP.parser_kind_metadata\n\nlet constantByte_parser c =\n LP.parse_filter LP.parse_u8 (is_constantByte c)", "dependencies": { "source_file": "Format.Constants.fst", "checked_file": "Format.Constants.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "c: FStar.Bytes.byte -> LowParse.SLow.Base.parser32 (Format.Constants.constantByte_parser c)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Bytes.byte", "LowParse.SLow.Combinators.parse32_filter", "LowParse.Spec.Int.parse_u8_kind", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "LowParse.SLow.Int.parse32_u8", "Format.Constants.is_constantByte", "Prims.bool", "Prims.eq2", "LowParse.SLow.Base.parser32", "Format.Constants.constantByte_parser_kind", "Format.Constants.constantByte", "Format.Constants.constantByte_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val constantByte_parser32 (c:byte): Tot (LP.parser32 (constantByte_parser c))\nlet constantByte_parser32 c =", "completed_definiton": "LP.parse32_filter LP.parse32_u8 (is_constantByte c) (fun x -> is_constantByte c x)", "isa_cross_project_example": true }, { "file_name": "Format.Constants.fst", "name": "Format.Constants.constantByte_serializer", "original_source_type": "val constantByte_serializer (c:byte)\n : Tot (LP.serializer #constantByte_parser_kind #(constantByte c) (constantByte_parser c))", "source_type": "val constantByte_serializer (c:byte)\n : Tot (LP.serializer #constantByte_parser_kind #(constantByte c) (constantByte_parser c))", "source_definition": "let constantByte_serializer c\n = LP.serialize_filter \n #LP.parse_u8_kind #U8.t #LP.parse_u8\n LP.serialize_u8 \n (is_constantByte c)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.Constants.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 19, "start_col": 4, "end_line": 22, "end_col": 25 }, "file_context": "module Format.Constants\n\nopen FStar.Bytes\n\nmodule LP = LowParse.SLow\nmodule U8 = FStar.UInt8\n\nlet constantByte_parser_kind' = LP.parse_filter_kind LP.parse_u8_kind\n\nlet constantByte_parser_kind_metadata = constantByte_parser_kind'.LP.parser_kind_metadata\n\nlet constantByte_parser c =\n LP.parse_filter LP.parse_u8 (is_constantByte c)\n\nlet constantByte_parser32 c =\n LP.parse32_filter LP.parse32_u8 (is_constantByte c) (fun x -> is_constantByte c x)", "dependencies": { "source_file": "Format.Constants.fst", "checked_file": "Format.Constants.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "c: FStar.Bytes.byte -> LowParse.Spec.Base.serializer (Format.Constants.constantByte_parser c)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Bytes.byte", "LowParse.Spec.Combinators.serialize_filter", "LowParse.Spec.Int.parse_u8_kind", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "Format.Constants.is_constantByte", "LowParse.Spec.Base.serializer", "Format.Constants.constantByte_parser_kind", "Format.Constants.constantByte", "Format.Constants.constantByte_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val constantByte_serializer (c:byte)\n : Tot (LP.serializer #constantByte_parser_kind #(constantByte c) (constantByte_parser c))\nlet constantByte_serializer c =", "completed_definiton": "LP.serialize_filter #LP.parse_u8_kind #U8.t #LP.parse_u8 LP.serialize_u8 (is_constantByte c)", "isa_cross_project_example": true }, { "file_name": "Format.Constants.fst", "name": "Format.Constants.constantByte_serializer32", "original_source_type": "val constantByte_serializer32 (c:byte)\n : Tot (LP.serializer32 #constantByte_parser_kind #(constantByte c) #(constantByte_parser c) (constantByte_serializer c))", "source_type": "val constantByte_serializer32 (c:byte)\n : Tot (LP.serializer32 #constantByte_parser_kind #(constantByte c) #(constantByte_parser c) (constantByte_serializer c))", "source_definition": "let constantByte_serializer32 c\n = LP.serialize32_filter \n #LP.parse_u8_kind #U8.t #LP.parse_u8 #LP.serialize_u8\n LP.serialize32_u8\n (is_constantByte c)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.Constants.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 25, "start_col": 4, "end_line": 28, "end_col": 25 }, "file_context": "module Format.Constants\n\nopen FStar.Bytes\n\nmodule LP = LowParse.SLow\nmodule U8 = FStar.UInt8\n\nlet constantByte_parser_kind' = LP.parse_filter_kind LP.parse_u8_kind\n\nlet constantByte_parser_kind_metadata = constantByte_parser_kind'.LP.parser_kind_metadata\n\nlet constantByte_parser c =\n LP.parse_filter LP.parse_u8 (is_constantByte c)\n\nlet constantByte_parser32 c =\n LP.parse32_filter LP.parse32_u8 (is_constantByte c) (fun x -> is_constantByte c x)\n\nlet constantByte_serializer c\n = LP.serialize_filter \n #LP.parse_u8_kind #U8.t #LP.parse_u8\n LP.serialize_u8 \n (is_constantByte c)", "dependencies": { "source_file": "Format.Constants.fst", "checked_file": "Format.Constants.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "c: FStar.Bytes.byte -> LowParse.SLow.Base.serializer32 (Format.Constants.constantByte_serializer c)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Bytes.byte", "LowParse.SLow.Combinators.serialize32_filter", "LowParse.Spec.Int.parse_u8_kind", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "LowParse.SLow.Int.serialize32_u8", "Format.Constants.is_constantByte", "LowParse.SLow.Base.serializer32", "Format.Constants.constantByte_parser_kind", "Format.Constants.constantByte", "Format.Constants.constantByte_parser", "Format.Constants.constantByte_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val constantByte_serializer32 (c:byte)\n : Tot (LP.serializer32 #constantByte_parser_kind #(constantByte c) #(constantByte_parser c) (constantByte_serializer c))\nlet constantByte_serializer32 c =", "completed_definiton": "LP.serialize32_filter #LP.parse_u8_kind\n #U8.t\n #LP.parse_u8\n #LP.serialize_u8\n LP.serialize32_u8\n (is_constantByte c)", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fsti", "name": "Parsers.CompressionMethod.compressionMethod_repr", "original_source_type": "", "source_type": "val compressionMethod_repr : Prims.eqtype", "source_definition": "let compressionMethod_repr = U8.t", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 21, "start_col": 29, "end_line": 21, "end_col": 33 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST", "dependencies": { "source_file": "Parsers.CompressionMethod.fsti", "checked_file": "Parsers.CompressionMethod.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.eqtype", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt8.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let compressionMethod_repr =", "completed_definiton": "U8.t", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fsti", "name": "Parsers.CompressionMethod.known_compressionMethod_repr", "original_source_type": "val known_compressionMethod_repr (v: U8.t) : bool", "source_type": "val known_compressionMethod_repr (v: U8.t) : bool", "source_definition": "let known_compressionMethod_repr (v:U8.t) : bool = v `compressionMethod_repr_eq` 0z || (false)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 23, "start_col": 51, "end_line": 23, "end_col": 94 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet compressionMethod_repr = U8.t", "dependencies": { "source_file": "Parsers.CompressionMethod.fsti", "checked_file": "Parsers.CompressionMethod.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "v: FStar.UInt8.t -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt8.t", "Prims.op_BarBar", "Parsers.CompressionMethod.compressionMethod_repr_eq", "FStar.UInt8.__uint_to_t", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val known_compressionMethod_repr (v: U8.t) : bool\nlet known_compressionMethod_repr (v: U8.t) : bool =", "completed_definiton": "v `compressionMethod_repr_eq` 0uy || (false)", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fsti", "name": "Parsers.CompressionMethod.compressionMethod_repr_eq", "original_source_type": "val compressionMethod_repr_eq (x1 x2: compressionMethod_repr) : Tot bool", "source_type": "val compressionMethod_repr_eq (x1 x2: compressionMethod_repr) : Tot bool", "source_definition": "let compressionMethod_repr_eq (x1 x2: compressionMethod_repr) : Tot bool = (x1 = x2)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 22, "start_col": 97, "end_line": 22, "end_col": 106 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST", "dependencies": { "source_file": "Parsers.CompressionMethod.fsti", "checked_file": "Parsers.CompressionMethod.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x1: Parsers.CompressionMethod.compressionMethod_repr ->\n x2: Parsers.CompressionMethod.compressionMethod_repr\n -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.CompressionMethod.compressionMethod_repr", "Prims.op_Equality", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val compressionMethod_repr_eq (x1 x2: compressionMethod_repr) : Tot bool\nlet compressionMethod_repr_eq (x1 x2: compressionMethod_repr) : Tot bool =", "completed_definiton": "(x1 = x2)", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fsti", "name": "Parsers.CompressionMethod.compressionMethod_parser_kind", "original_source_type": "", "source_type": "val compressionMethod_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let compressionMethod_parser_kind = LP.strong_parser_kind 1 1 (Some LP.ParserKindMetadataTotal)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 33, "start_col": 68, "end_line": 33, "end_col": 127 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet compressionMethod_repr = U8.t\ninline_for_extraction let compressionMethod_repr_eq (x1 x2: compressionMethod_repr) : Tot bool = (x1 = x2)\nlet known_compressionMethod_repr (v:U8.t) : bool = v `compressionMethod_repr_eq` 0z || (false)\n\ntype compressionMethod =\n | NullCompression\n | Unknown_compressionMethod of (v:U8.t{not (known_compressionMethod_repr v)})\n\nlet string_of_compressionMethod = function\n | NullCompression -> \"nullCompression\"\n | Unknown_compressionMethod _ -> \"Unknown_compressionMethod\"", "dependencies": { "source_file": "Parsers.CompressionMethod.fsti", "checked_file": "Parsers.CompressionMethod.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.Some", "LowParse.Spec.Base.parser_kind_metadata_some", "LowParse.Spec.Base.ParserKindMetadataTotal" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let compressionMethod_parser_kind =", "completed_definiton": "LP.strong_parser_kind 1 1 (Some LP.ParserKindMetadataTotal)", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fsti", "name": "Parsers.CompressionMethod.string_of_compressionMethod", "original_source_type": "", "source_type": "val string_of_compressionMethod : _: Parsers.CompressionMethod.compressionMethod -> Prims.string", "source_definition": "let string_of_compressionMethod = function\n | NullCompression -> \"nullCompression\"\n | Unknown_compressionMethod _ -> \"Unknown_compressionMethod\"", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 29, "start_col": 34, "end_line": 31, "end_col": 62 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet compressionMethod_repr = U8.t\ninline_for_extraction let compressionMethod_repr_eq (x1 x2: compressionMethod_repr) : Tot bool = (x1 = x2)\nlet known_compressionMethod_repr (v:U8.t) : bool = v `compressionMethod_repr_eq` 0z || (false)\n\ntype compressionMethod =\n | NullCompression\n | Unknown_compressionMethod of (v:U8.t{not (known_compressionMethod_repr v)})", "dependencies": { "source_file": "Parsers.CompressionMethod.fsti", "checked_file": "Parsers.CompressionMethod.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Parsers.CompressionMethod.compressionMethod -> Prims.string", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.CompressionMethod.compressionMethod", "FStar.UInt8.t", "Prims.b2t", "Prims.op_Negation", "Parsers.CompressionMethod.known_compressionMethod_repr", "Prims.string" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let string_of_compressionMethod =", "completed_definiton": "function\n| NullCompression -> \"nullCompression\"\n| Unknown_compressionMethod _ -> \"Unknown_compressionMethod\"", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fsti", "name": "Parsers.CompressionMethod.compressionMethod_jumper", "original_source_type": "val compressionMethod_jumper:LL.jumper compressionMethod_parser", "source_type": "val compressionMethod_jumper:LL.jumper compressionMethod_parser", "source_definition": "let compressionMethod_jumper: LL.jumper compressionMethod_parser = LL.jump_constant_size compressionMethod_parser 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 51, "start_col": 67, "end_line": 51, "end_col": 120 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet compressionMethod_repr = U8.t\ninline_for_extraction let compressionMethod_repr_eq (x1 x2: compressionMethod_repr) : Tot bool = (x1 = x2)\nlet known_compressionMethod_repr (v:U8.t) : bool = v `compressionMethod_repr_eq` 0z || (false)\n\ntype compressionMethod =\n | NullCompression\n | Unknown_compressionMethod of (v:U8.t{not (known_compressionMethod_repr v)})\n\nlet string_of_compressionMethod = function\n | NullCompression -> \"nullCompression\"\n | Unknown_compressionMethod _ -> \"Unknown_compressionMethod\"\n\ninline_for_extraction noextract let compressionMethod_parser_kind = LP.strong_parser_kind 1 1 (Some LP.ParserKindMetadataTotal)\n\nnoextract val compressionMethod_parser: LP.parser compressionMethod_parser_kind compressionMethod\n\nnoextract val compressionMethod_serializer: LP.serializer compressionMethod_parser\n\nnoextract val compressionMethod_bytesize (x:compressionMethod) : GTot nat\n\nnoextract val compressionMethod_bytesize_eq (x:compressionMethod) : Lemma (compressionMethod_bytesize x == Seq.length (LP.serialize compressionMethod_serializer x))\n\nval compressionMethod_parser32: LS.parser32 compressionMethod_parser\n\nval compressionMethod_serializer32: LS.serializer32 compressionMethod_serializer\n\nval compressionMethod_size32: LSZ.size32 compressionMethod_serializer\n\nlet compressionMethod_validator: LL.validator compressionMethod_parser = LL.validate_total_constant_size compressionMethod_parser 1uL ()", "dependencies": { "source_file": "Parsers.CompressionMethod.fsti", "checked_file": "Parsers.CompressionMethod.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.CompressionMethod.compressionMethod_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.jump_constant_size", "Parsers.CompressionMethod.compressionMethod_parser_kind", "Parsers.CompressionMethod.compressionMethod", "Parsers.CompressionMethod.compressionMethod_parser", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val compressionMethod_jumper:LL.jumper compressionMethod_parser\nlet compressionMethod_jumper:LL.jumper compressionMethod_parser =", "completed_definiton": "LL.jump_constant_size compressionMethod_parser 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.CompressionMethod.fsti", "name": "Parsers.CompressionMethod.compressionMethod_validator", "original_source_type": "val compressionMethod_validator:LL.validator compressionMethod_parser", "source_type": "val compressionMethod_validator:LL.validator compressionMethod_parser", "source_definition": "let compressionMethod_validator: LL.validator compressionMethod_parser = LL.validate_total_constant_size compressionMethod_parser 1uL ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CompressionMethod.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 49, "start_col": 73, "end_line": 49, "end_col": 136 }, "file_context": "module Parsers.CompressionMethod\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet compressionMethod_repr = U8.t\ninline_for_extraction let compressionMethod_repr_eq (x1 x2: compressionMethod_repr) : Tot bool = (x1 = x2)\nlet known_compressionMethod_repr (v:U8.t) : bool = v `compressionMethod_repr_eq` 0z || (false)\n\ntype compressionMethod =\n | NullCompression\n | Unknown_compressionMethod of (v:U8.t{not (known_compressionMethod_repr v)})\n\nlet string_of_compressionMethod = function\n | NullCompression -> \"nullCompression\"\n | Unknown_compressionMethod _ -> \"Unknown_compressionMethod\"\n\ninline_for_extraction noextract let compressionMethod_parser_kind = LP.strong_parser_kind 1 1 (Some LP.ParserKindMetadataTotal)\n\nnoextract val compressionMethod_parser: LP.parser compressionMethod_parser_kind compressionMethod\n\nnoextract val compressionMethod_serializer: LP.serializer compressionMethod_parser\n\nnoextract val compressionMethod_bytesize (x:compressionMethod) : GTot nat\n\nnoextract val compressionMethod_bytesize_eq (x:compressionMethod) : Lemma (compressionMethod_bytesize x == Seq.length (LP.serialize compressionMethod_serializer x))\n\nval compressionMethod_parser32: LS.parser32 compressionMethod_parser\n\nval compressionMethod_serializer32: LS.serializer32 compressionMethod_serializer\n\nval compressionMethod_size32: LSZ.size32 compressionMethod_serializer", "dependencies": { "source_file": "Parsers.CompressionMethod.fsti", "checked_file": "Parsers.CompressionMethod.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.CompressionMethod.compressionMethod_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.validate_total_constant_size", "Parsers.CompressionMethod.compressionMethod_parser_kind", "Parsers.CompressionMethod.compressionMethod", "Parsers.CompressionMethod.compressionMethod_parser", "FStar.UInt64.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val compressionMethod_validator:LL.validator compressionMethod_parser\nlet compressionMethod_validator:LL.validator compressionMethod_parser =", "completed_definiton": "LL.validate_total_constant_size compressionMethod_parser 1uL ()", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.alertLevel_repr_parser32", "original_source_type": "", "source_type": "val alertLevel_repr_parser32 : LowParse.SLow.Base.parser32 LowParse.Spec.Int.parse_u8", "source_definition": "let alertLevel_repr_parser32 = LS.parse32_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 39, "start_col": 63, "end_line": 39, "end_col": 76 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.parse32_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alertLevel_repr_parser32 =", "completed_definiton": "LS.parse32_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.alertLevel_repr_jumper", "original_source_type": "", "source_type": "val alertLevel_repr_jumper : LowParse.Low.Base.jumper LowParse.Spec.Int.parse_u8", "source_definition": "let alertLevel_repr_jumper = LL.jump_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 47, "start_col": 61, "end_line": 47, "end_col": 71 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.jump_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alertLevel_repr_jumper =", "completed_definiton": "LL.jump_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.alertLevel_repr_serializer", "original_source_type": "", "source_type": "val alertLevel_repr_serializer : LowParse.Spec.Base.serializer LowParse.Spec.Int.parse_u8", "source_definition": "let alertLevel_repr_serializer = LPI.serialize_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 37, "start_col": 43, "end_line": 37, "end_col": 59 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Int.serialize_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alertLevel_repr_serializer =", "completed_definiton": "LPI.serialize_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.alertLevel_repr_validator", "original_source_type": "", "source_type": "val alertLevel_repr_validator : LowParse.Low.Base.validator LowParse.Spec.Int.parse_u8", "source_definition": "let alertLevel_repr_validator = (LL.validate_u8 ())", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 45, "start_col": 64, "end_line": 45, "end_col": 83 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.validate_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alertLevel_repr_validator =", "completed_definiton": "(LL.validate_u8 ())", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.alertLevel_repr_reader", "original_source_type": "", "source_type": "val alertLevel_repr_reader : LowParse.Low.Base.leaf_reader LowParse.Spec.Int.parse_u8", "source_definition": "let alertLevel_repr_reader = LL.read_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 49, "start_col": 61, "end_line": 49, "end_col": 71 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertLevel_repr_jumper = LL.jump_u8", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader LowParse.Spec.Int.parse_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.read_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alertLevel_repr_reader =", "completed_definiton": "LL.read_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.alertLevel_repr_writer", "original_source_type": "", "source_type": "val alertLevel_repr_writer : LowParse.Low.Base.leaf_writer_strong LowParse.Spec.Int.serialize_u8", "source_definition": "let alertLevel_repr_writer = LL.write_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 51, "start_col": 61, "end_line": 51, "end_col": 72 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertLevel_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertLevel_repr_reader = LL.read_u8", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong LowParse.Spec.Int.serialize_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.write_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alertLevel_repr_writer =", "completed_definiton": "LL.write_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.alertLevel_repr_serializer32", "original_source_type": "", "source_type": "val alertLevel_repr_serializer32 : LowParse.SLow.Base.serializer32 LowParse.Spec.Int.serialize_u8", "source_definition": "let alertLevel_repr_serializer32 = LS.serialize32_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 41, "start_col": 67, "end_line": 41, "end_col": 84 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 LowParse.Spec.Int.serialize_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.serialize32_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alertLevel_repr_serializer32 =", "completed_definiton": "LS.serialize32_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.alertLevel_repr_size32", "original_source_type": "", "source_type": "val alertLevel_repr_size32 : LowParse.SLow.Base.size32 LowParse.Spec.Int.serialize_u8", "source_definition": "let alertLevel_repr_size32 = LSZ.size32_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 43, "start_col": 61, "end_line": 43, "end_col": 74 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 LowParse.Spec.Int.serialize_u8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.size32_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alertLevel_repr_size32 =", "completed_definiton": "LSZ.size32_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.alertLevel_bytesize", "original_source_type": "val alertLevel_bytesize (x:alertLevel) : GTot nat", "source_type": "val alertLevel_bytesize (x:alertLevel) : GTot nat", "source_definition": "let alertLevel_bytesize (x:alertLevel) : GTot nat = Seq.length (alertLevel_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 82, "start_col": 52, "end_line": 82, "end_col": 88 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertLevel_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertLevel_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertLevel_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel = x\n\ninline_for_extraction let synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertLevel_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertLevel_inj () : Lemma\n (LP.synth_injective synth_alertLevel) = ()\n\nlet lemma_synth_alertLevel_inv () : Lemma\n (LP.synth_inverse synth_alertLevel synth_alertLevel_inv) = ()\n\nnoextract let parse_alertLevel_key : LP.parser _ (LP.enum_key alertLevel_enum) =\n LP.parse_enum_key alertLevel_repr_parser alertLevel_enum\n\nnoextract let serialize_alertLevel_key : LP.serializer parse_alertLevel_key =\n LP.serialize_enum_key alertLevel_repr_parser alertLevel_repr_serializer alertLevel_enum\n\nnoextract let alertLevel_parser : LP.parser _ alertLevel =\n lemma_synth_alertLevel_inj ();\n parse_alertLevel_key `LP.parse_synth` synth_alertLevel\n\nnoextract let alertLevel_serializer : LP.serializer alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LP.serialize_synth _ synth_alertLevel serialize_alertLevel_key synth_alertLevel_inv ()", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.AlertLevel.alertLevel -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.AlertLevel.alertLevel", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.AlertLevel.alertLevel_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertLevel_bytesize (x:alertLevel) : GTot nat\nlet alertLevel_bytesize (x: alertLevel) : GTot nat =", "completed_definiton": "Seq.length (alertLevel_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.alertLevel_repr_parser", "original_source_type": "", "source_type": "val alertLevel_repr_parser : LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u8_kind FStar.UInt8.t", "source_definition": "let alertLevel_repr_parser = LPI.parse_u8", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 35, "start_col": 39, "end_line": 35, "end_col": 51 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u8_kind FStar.UInt8.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Int.parse_u8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alertLevel_repr_parser =", "completed_definiton": "LPI.parse_u8", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.serialize_alertLevel_key", "original_source_type": "val serialize_alertLevel_key:LP.serializer parse_alertLevel_key", "source_type": "val serialize_alertLevel_key:LP.serializer parse_alertLevel_key", "source_definition": "let serialize_alertLevel_key : LP.serializer parse_alertLevel_key =\n LP.serialize_enum_key alertLevel_repr_parser alertLevel_repr_serializer alertLevel_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 71, "start_col": 2, "end_line": 71, "end_col": 89 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertLevel_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertLevel_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertLevel_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel = x\n\ninline_for_extraction let synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertLevel_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertLevel_inj () : Lemma\n (LP.synth_injective synth_alertLevel) = ()\n\nlet lemma_synth_alertLevel_inv () : Lemma\n (LP.synth_inverse synth_alertLevel synth_alertLevel_inv) = ()\n\nnoextract let parse_alertLevel_key : LP.parser _ (LP.enum_key alertLevel_enum) =\n LP.parse_enum_key alertLevel_repr_parser alertLevel_enum", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.AlertLevel.parse_alertLevel_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.serialize_enum_key", "LowParse.Spec.Int.parse_u8_kind", "Parsers.AlertLevel.alertLevel", "FStar.UInt8.t", "Parsers.AlertLevel.alertLevel_repr_parser", "Parsers.AlertLevel.alertLevel_repr_serializer", "Parsers.AlertLevel.alertLevel_enum" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_alertLevel_key:LP.serializer parse_alertLevel_key\nlet serialize_alertLevel_key:LP.serializer parse_alertLevel_key =", "completed_definiton": "LP.serialize_enum_key alertLevel_repr_parser alertLevel_repr_serializer alertLevel_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.alertLevel_enum", "original_source_type": "val alertLevel_enum:LP.enum alertLevel U8.t", "source_type": "val alertLevel_enum:LP.enum alertLevel U8.t", "source_definition": "let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 24, "start_col": 2, "end_line": 33, "end_col": 6 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Enum.enum Parsers.AlertLevel.alertLevel FStar.UInt8.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.b2t", "FStar.List.Tot.Base.noRepeats", "FStar.UInt8.t", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "Parsers.AlertLevel.alertLevel", "FStar.Pervasives.Native.snd", "FStar.Pervasives.Native.fst", "Prims.list", "Prims.Cons", "FStar.Pervasives.Native.Mktuple2", "Parsers.AlertLevel.Warning", "FStar.UInt8.__uint_to_t", "Parsers.AlertLevel.Fatal", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertLevel_enum:LP.enum alertLevel U8.t\nlet alertLevel_enum:LP.enum alertLevel U8.t =", "completed_definiton": "[@@ inline_let ]let e = [Warning, 1uy; Fatal, 2uy] in\n[@@ inline_let ]let _ = assert_norm (L.noRepeats (LP.list_map fst e)) in\n[@@ inline_let ]let _ = assert_norm (L.noRepeats (LP.list_map snd e)) in\ne", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.synth_alertLevel", "original_source_type": "val synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel", "source_type": "val synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel", "source_definition": "let synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel = x", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 53, "start_col": 95, "end_line": 53, "end_col": 96 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertLevel_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertLevel_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertLevel_repr_writer = LL.write_u8", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: LowParse.Spec.Enum.enum_key Parsers.AlertLevel.alertLevel_enum -> Parsers.AlertLevel.alertLevel", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.enum_key", "Parsers.AlertLevel.alertLevel", "FStar.UInt8.t", "Parsers.AlertLevel.alertLevel_enum" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel\nlet synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel =", "completed_definiton": "x", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.validate_alertLevel_key", "original_source_type": "val validate_alertLevel_key:LL.validator parse_alertLevel_key", "source_type": "val validate_alertLevel_key:LL.validator parse_alertLevel_key", "source_definition": "let validate_alertLevel_key : LL.validator parse_alertLevel_key =\n LL.mk_validate_enum_key alertLevel_repr_validator alertLevel_repr_reader alertLevel_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 108, "start_col": 4, "end_line": 108, "end_col": 92 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertLevel_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertLevel_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertLevel_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel = x\n\ninline_for_extraction let synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertLevel_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertLevel_inj () : Lemma\n (LP.synth_injective synth_alertLevel) = ()\n\nlet lemma_synth_alertLevel_inv () : Lemma\n (LP.synth_inverse synth_alertLevel synth_alertLevel_inv) = ()\n\nnoextract let parse_alertLevel_key : LP.parser _ (LP.enum_key alertLevel_enum) =\n LP.parse_enum_key alertLevel_repr_parser alertLevel_enum\n\nnoextract let serialize_alertLevel_key : LP.serializer parse_alertLevel_key =\n LP.serialize_enum_key alertLevel_repr_parser alertLevel_repr_serializer alertLevel_enum\n\nnoextract let alertLevel_parser : LP.parser _ alertLevel =\n lemma_synth_alertLevel_inj ();\n parse_alertLevel_key `LP.parse_synth` synth_alertLevel\n\nnoextract let alertLevel_serializer : LP.serializer alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LP.serialize_synth _ synth_alertLevel serialize_alertLevel_key synth_alertLevel_inv ()\n\nlet alertLevel_bytesize (x:alertLevel) : GTot nat = Seq.length (alertLevel_serializer x)\n\nlet alertLevel_bytesize_eq x = ()\n\nlet parse32_alertLevel_key : LS.parser32 parse_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertLevel_repr_parser32 alertLevel_enum)\n\nlet alertLevel_parser32 : LS.parser32 alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n LS.parse32_synth _ synth_alertLevel (fun x->synth_alertLevel x) parse32_alertLevel_key ()\n\nlet serialize32_alertLevel_key : LS.serializer32 serialize_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertLevel_repr_serializer32 alertLevel_enum)\n\nlet alertLevel_serializer32 : LS.serializer32 alertLevel_serializer =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LS.serialize32_synth _ synth_alertLevel _ serialize32_alertLevel_key synth_alertLevel_inv (fun x->synth_alertLevel_inv x) ()\n\nlet alertLevel_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond alertLevel_serializer 1ul) in\n LSZ.size32_constant alertLevel_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.AlertLevel.parse_alertLevel_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.validate_enum_key", "Parsers.AlertLevel.alertLevel", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "Parsers.AlertLevel.alertLevel_repr_validator", "Parsers.AlertLevel.alertLevel_repr_reader", "Prims.Cons", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.Mktuple2", "Parsers.AlertLevel.Warning", "FStar.UInt8.__uint_to_t", "Parsers.AlertLevel.Fatal", "Prims.Nil", "LowParse.Spec.Enum.maybe_enum_destr_t_intro", "Prims.bool", "LowParse.Spec.Enum.maybe_enum_destr_cons", "LowParse.Spec.Enum.maybe_enum_destr_nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val validate_alertLevel_key:LL.validator parse_alertLevel_key\nlet validate_alertLevel_key:LL.validator parse_alertLevel_key =", "completed_definiton": "LL.mk_validate_enum_key alertLevel_repr_validator alertLevel_repr_reader alertLevel_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.alertLevel_size32", "original_source_type": "val alertLevel_size32: LSZ.size32 alertLevel_serializer", "source_type": "val alertLevel_size32: LSZ.size32 alertLevel_serializer", "source_definition": "let alertLevel_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond alertLevel_serializer 1ul) in\n LSZ.size32_constant alertLevel_serializer 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 103, "start_col": 2, "end_line": 104, "end_col": 50 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertLevel_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertLevel_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertLevel_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel = x\n\ninline_for_extraction let synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertLevel_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertLevel_inj () : Lemma\n (LP.synth_injective synth_alertLevel) = ()\n\nlet lemma_synth_alertLevel_inv () : Lemma\n (LP.synth_inverse synth_alertLevel synth_alertLevel_inv) = ()\n\nnoextract let parse_alertLevel_key : LP.parser _ (LP.enum_key alertLevel_enum) =\n LP.parse_enum_key alertLevel_repr_parser alertLevel_enum\n\nnoextract let serialize_alertLevel_key : LP.serializer parse_alertLevel_key =\n LP.serialize_enum_key alertLevel_repr_parser alertLevel_repr_serializer alertLevel_enum\n\nnoextract let alertLevel_parser : LP.parser _ alertLevel =\n lemma_synth_alertLevel_inj ();\n parse_alertLevel_key `LP.parse_synth` synth_alertLevel\n\nnoextract let alertLevel_serializer : LP.serializer alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LP.serialize_synth _ synth_alertLevel serialize_alertLevel_key synth_alertLevel_inv ()\n\nlet alertLevel_bytesize (x:alertLevel) : GTot nat = Seq.length (alertLevel_serializer x)\n\nlet alertLevel_bytesize_eq x = ()\n\nlet parse32_alertLevel_key : LS.parser32 parse_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertLevel_repr_parser32 alertLevel_enum)\n\nlet alertLevel_parser32 : LS.parser32 alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n LS.parse32_synth _ synth_alertLevel (fun x->synth_alertLevel x) parse32_alertLevel_key ()\n\nlet serialize32_alertLevel_key : LS.serializer32 serialize_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertLevel_repr_serializer32 alertLevel_enum)\n\nlet alertLevel_serializer32 : LS.serializer32 alertLevel_serializer =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LS.serialize32_synth _ synth_alertLevel _ serialize32_alertLevel_key synth_alertLevel_inv (fun x->synth_alertLevel_inv x) ()", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.AlertLevel.alertLevel_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Base.size32_constant", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertLevel.alertLevel", "Parsers.AlertLevel.alertLevel_parser", "Parsers.AlertLevel.alertLevel_serializer", "FStar.UInt32.__uint_to_t", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.SLow.Base.size32_constant_precond" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertLevel_size32: LSZ.size32 alertLevel_serializer\nlet alertLevel_size32 =", "completed_definiton": "[@@ inline_let ]let _ = assert_norm (LSZ.size32_constant_precond alertLevel_serializer 1ul) in\nLSZ.size32_constant alertLevel_serializer 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.write_alertLevel_key", "original_source_type": "val write_alertLevel_key:LL.leaf_writer_strong serialize_alertLevel_key", "source_type": "val write_alertLevel_key:LL.leaf_writer_strong serialize_alertLevel_key", "source_definition": "let write_alertLevel_key : LL.leaf_writer_strong serialize_alertLevel_key =\n LL.write_enum_key alertLevel_repr_writer alertLevel_enum (_ by (LP.enum_repr_of_key_tac alertLevel_enum))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 123, "start_col": 2, "end_line": 123, "end_col": 107 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertLevel_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertLevel_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertLevel_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel = x\n\ninline_for_extraction let synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertLevel_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertLevel_inj () : Lemma\n (LP.synth_injective synth_alertLevel) = ()\n\nlet lemma_synth_alertLevel_inv () : Lemma\n (LP.synth_inverse synth_alertLevel synth_alertLevel_inv) = ()\n\nnoextract let parse_alertLevel_key : LP.parser _ (LP.enum_key alertLevel_enum) =\n LP.parse_enum_key alertLevel_repr_parser alertLevel_enum\n\nnoextract let serialize_alertLevel_key : LP.serializer parse_alertLevel_key =\n LP.serialize_enum_key alertLevel_repr_parser alertLevel_repr_serializer alertLevel_enum\n\nnoextract let alertLevel_parser : LP.parser _ alertLevel =\n lemma_synth_alertLevel_inj ();\n parse_alertLevel_key `LP.parse_synth` synth_alertLevel\n\nnoextract let alertLevel_serializer : LP.serializer alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LP.serialize_synth _ synth_alertLevel serialize_alertLevel_key synth_alertLevel_inv ()\n\nlet alertLevel_bytesize (x:alertLevel) : GTot nat = Seq.length (alertLevel_serializer x)\n\nlet alertLevel_bytesize_eq x = ()\n\nlet parse32_alertLevel_key : LS.parser32 parse_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertLevel_repr_parser32 alertLevel_enum)\n\nlet alertLevel_parser32 : LS.parser32 alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n LS.parse32_synth _ synth_alertLevel (fun x->synth_alertLevel x) parse32_alertLevel_key ()\n\nlet serialize32_alertLevel_key : LS.serializer32 serialize_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertLevel_repr_serializer32 alertLevel_enum)\n\nlet alertLevel_serializer32 : LS.serializer32 alertLevel_serializer =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LS.serialize32_synth _ synth_alertLevel _ serialize32_alertLevel_key synth_alertLevel_inv (fun x->synth_alertLevel_inv x) ()\n\nlet alertLevel_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond alertLevel_serializer 1ul) in\n LSZ.size32_constant alertLevel_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_alertLevel_key : LL.validator parse_alertLevel_key =\n LL.mk_validate_enum_key alertLevel_repr_validator alertLevel_repr_reader alertLevel_enum\n\nlet alertLevel_validator =\n lemma_synth_alertLevel_inj ();\n LL.validate_synth validate_alertLevel_key synth_alertLevel ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_alertLevel_key : LL.leaf_reader parse_alertLevel_key =\n LL.mk_read_enum_key alertLevel_repr_reader alertLevel_enum\n\nlet alertLevel_reader =\n [@inline_let] let _ = lemma_synth_alertLevel_inj () in\n LL.read_synth' parse_alertLevel_key synth_alertLevel read_alertLevel_key ()", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong Parsers.AlertLevel.serialize_alertLevel_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.write_enum_key", "Parsers.AlertLevel.alertLevel", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "Parsers.AlertLevel.alertLevel_repr_writer", "Parsers.AlertLevel.alertLevel_enum", "LowParse.Spec.Enum.enum_repr_of_key_cons'", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'", "LowParse.Spec.Enum.enum_tail'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val write_alertLevel_key:LL.leaf_writer_strong serialize_alertLevel_key\nlet write_alertLevel_key:LL.leaf_writer_strong serialize_alertLevel_key =", "completed_definiton": "LL.write_enum_key alertLevel_repr_writer\n alertLevel_enum\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.enum_repr_of_key_tac alertLevel_enum)))", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.parse32_alertLevel_key", "original_source_type": "val parse32_alertLevel_key:LS.parser32 parse_alertLevel_key", "source_type": "val parse32_alertLevel_key:LS.parser32 parse_alertLevel_key", "source_definition": "let parse32_alertLevel_key : LS.parser32 parse_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertLevel_repr_parser32 alertLevel_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 87, "start_col": 2, "end_line": 87, "end_col": 98 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertLevel_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertLevel_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertLevel_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel = x\n\ninline_for_extraction let synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertLevel_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertLevel_inj () : Lemma\n (LP.synth_injective synth_alertLevel) = ()\n\nlet lemma_synth_alertLevel_inv () : Lemma\n (LP.synth_inverse synth_alertLevel synth_alertLevel_inv) = ()\n\nnoextract let parse_alertLevel_key : LP.parser _ (LP.enum_key alertLevel_enum) =\n LP.parse_enum_key alertLevel_repr_parser alertLevel_enum\n\nnoextract let serialize_alertLevel_key : LP.serializer parse_alertLevel_key =\n LP.serialize_enum_key alertLevel_repr_parser alertLevel_repr_serializer alertLevel_enum\n\nnoextract let alertLevel_parser : LP.parser _ alertLevel =\n lemma_synth_alertLevel_inj ();\n parse_alertLevel_key `LP.parse_synth` synth_alertLevel\n\nnoextract let alertLevel_serializer : LP.serializer alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LP.serialize_synth _ synth_alertLevel serialize_alertLevel_key synth_alertLevel_inv ()\n\nlet alertLevel_bytesize (x:alertLevel) : GTot nat = Seq.length (alertLevel_serializer x)\n\nlet alertLevel_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.AlertLevel.parse_alertLevel_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Enum.parse32_enum_key_gen", "LowParse.Spec.Int.parse_u8_kind", "Parsers.AlertLevel.alertLevel", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "Parsers.AlertLevel.alertLevel_enum", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Enum.enum_key", "Parsers.AlertLevel.parse_alertLevel_key", "LowParse.SLow.Enum.parse32_maybe_enum_key_gen", "Parsers.AlertLevel.alertLevel_repr_parser32", "LowParse.Spec.Enum.maybe_enum_key", "LowParse.Spec.Enum.parse_maybe_enum_key", "LowParse.Spec.Enum.maybe_enum_key_of_repr'_t_cons'", "LowParse.Spec.Enum.maybe_enum_key_of_repr'_t_cons_nil'", "LowParse.Spec.Enum.enum_tail'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse32_alertLevel_key:LS.parser32 parse_alertLevel_key\nlet parse32_alertLevel_key:LS.parser32 parse_alertLevel_key =", "completed_definiton": "FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertLevel_repr_parser32 alertLevel_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.alertLevel_parser32", "original_source_type": "val alertLevel_parser32: LS.parser32 alertLevel_parser", "source_type": "val alertLevel_parser32: LS.parser32 alertLevel_parser", "source_definition": "let alertLevel_parser32 : LS.parser32 alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n LS.parse32_synth _ synth_alertLevel (fun x->synth_alertLevel x) parse32_alertLevel_key ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 90, "start_col": 2, "end_line": 91, "end_col": 91 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertLevel_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertLevel_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertLevel_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel = x\n\ninline_for_extraction let synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertLevel_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertLevel_inj () : Lemma\n (LP.synth_injective synth_alertLevel) = ()\n\nlet lemma_synth_alertLevel_inv () : Lemma\n (LP.synth_inverse synth_alertLevel synth_alertLevel_inv) = ()\n\nnoextract let parse_alertLevel_key : LP.parser _ (LP.enum_key alertLevel_enum) =\n LP.parse_enum_key alertLevel_repr_parser alertLevel_enum\n\nnoextract let serialize_alertLevel_key : LP.serializer parse_alertLevel_key =\n LP.serialize_enum_key alertLevel_repr_parser alertLevel_repr_serializer alertLevel_enum\n\nnoextract let alertLevel_parser : LP.parser _ alertLevel =\n lemma_synth_alertLevel_inj ();\n parse_alertLevel_key `LP.parse_synth` synth_alertLevel\n\nnoextract let alertLevel_serializer : LP.serializer alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LP.serialize_synth _ synth_alertLevel serialize_alertLevel_key synth_alertLevel_inv ()\n\nlet alertLevel_bytesize (x:alertLevel) : GTot nat = Seq.length (alertLevel_serializer x)\n\nlet alertLevel_bytesize_eq x = ()\n\nlet parse32_alertLevel_key : LS.parser32 parse_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertLevel_repr_parser32 alertLevel_enum)", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.AlertLevel.alertLevel_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.AlertLevel.alertLevel", "FStar.UInt8.t", "Parsers.AlertLevel.alertLevel_enum", "Parsers.AlertLevel.parse_alertLevel_key", "Parsers.AlertLevel.synth_alertLevel", "Prims.eq2", "Parsers.AlertLevel.parse32_alertLevel_key", "Prims.unit", "Parsers.AlertLevel.lemma_synth_alertLevel_inj", "LowParse.SLow.Base.parser32", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertLevel.alertLevel_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertLevel_parser32: LS.parser32 alertLevel_parser\nlet alertLevel_parser32:LS.parser32 alertLevel_parser =", "completed_definiton": "lemma_synth_alertLevel_inj ();\nLS.parse32_synth _ synth_alertLevel (fun x -> synth_alertLevel x) parse32_alertLevel_key ()", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.synth_alertLevel_inv", "original_source_type": "val synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum)", "source_type": "val synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum)", "source_definition": "let synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertLevel_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 56, "start_col": 2, "end_line": 59, "end_col": 3 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertLevel_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertLevel_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertLevel_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel = x", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.AlertLevel.alertLevel -> LowParse.Spec.Enum.enum_key Parsers.AlertLevel.alertLevel_enum", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.AlertLevel.alertLevel", "Prims.squash", "Prims.b2t", "LowParse.Spec.Enum.list_mem", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "FStar.UInt8.t", "FStar.Pervasives.Native.fst", "Parsers.AlertLevel.alertLevel_enum", "LowParse.Spec.Enum.enum_key" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum)\nlet synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum) =", "completed_definiton": "[@@ inline_let ]let _:squash (LP.list_mem x (LP.list_map fst alertLevel_enum)) =\n FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.synth_maybe_enum_key_inv_unknown_tac x))\nin\nx", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.alertLevel_validator", "original_source_type": "val alertLevel_validator: LL.validator alertLevel_parser", "source_type": "val alertLevel_validator: LL.validator alertLevel_parser", "source_definition": "let alertLevel_validator =\n lemma_synth_alertLevel_inj ();\n LL.validate_synth validate_alertLevel_key synth_alertLevel ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 111, "start_col": 2, "end_line": 112, "end_col": 63 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertLevel_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertLevel_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertLevel_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel = x\n\ninline_for_extraction let synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertLevel_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertLevel_inj () : Lemma\n (LP.synth_injective synth_alertLevel) = ()\n\nlet lemma_synth_alertLevel_inv () : Lemma\n (LP.synth_inverse synth_alertLevel synth_alertLevel_inv) = ()\n\nnoextract let parse_alertLevel_key : LP.parser _ (LP.enum_key alertLevel_enum) =\n LP.parse_enum_key alertLevel_repr_parser alertLevel_enum\n\nnoextract let serialize_alertLevel_key : LP.serializer parse_alertLevel_key =\n LP.serialize_enum_key alertLevel_repr_parser alertLevel_repr_serializer alertLevel_enum\n\nnoextract let alertLevel_parser : LP.parser _ alertLevel =\n lemma_synth_alertLevel_inj ();\n parse_alertLevel_key `LP.parse_synth` synth_alertLevel\n\nnoextract let alertLevel_serializer : LP.serializer alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LP.serialize_synth _ synth_alertLevel serialize_alertLevel_key synth_alertLevel_inv ()\n\nlet alertLevel_bytesize (x:alertLevel) : GTot nat = Seq.length (alertLevel_serializer x)\n\nlet alertLevel_bytesize_eq x = ()\n\nlet parse32_alertLevel_key : LS.parser32 parse_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertLevel_repr_parser32 alertLevel_enum)\n\nlet alertLevel_parser32 : LS.parser32 alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n LS.parse32_synth _ synth_alertLevel (fun x->synth_alertLevel x) parse32_alertLevel_key ()\n\nlet serialize32_alertLevel_key : LS.serializer32 serialize_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertLevel_repr_serializer32 alertLevel_enum)\n\nlet alertLevel_serializer32 : LS.serializer32 alertLevel_serializer =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LS.serialize32_synth _ synth_alertLevel _ serialize32_alertLevel_key synth_alertLevel_inv (fun x->synth_alertLevel_inv x) ()\n\nlet alertLevel_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond alertLevel_serializer 1ul) in\n LSZ.size32_constant alertLevel_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_alertLevel_key : LL.validator parse_alertLevel_key =\n LL.mk_validate_enum_key alertLevel_repr_validator alertLevel_repr_reader alertLevel_enum", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.AlertLevel.alertLevel_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.validate_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.AlertLevel.alertLevel", "FStar.UInt8.t", "Parsers.AlertLevel.alertLevel_enum", "Parsers.AlertLevel.parse_alertLevel_key", "Parsers.AlertLevel.validate_alertLevel_key", "Parsers.AlertLevel.synth_alertLevel", "Prims.unit", "Parsers.AlertLevel.lemma_synth_alertLevel_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertLevel_validator: LL.validator alertLevel_parser\nlet alertLevel_validator =", "completed_definiton": "lemma_synth_alertLevel_inj ();\nLL.validate_synth validate_alertLevel_key synth_alertLevel ()", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.alertLevel_parser", "original_source_type": "val alertLevel_parser: LP.parser alertLevel_parser_kind alertLevel", "source_type": "val alertLevel_parser: LP.parser alertLevel_parser_kind alertLevel", "source_definition": "let alertLevel_parser : LP.parser _ alertLevel =\n lemma_synth_alertLevel_inj ();\n parse_alertLevel_key `LP.parse_synth` synth_alertLevel", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 74, "start_col": 2, "end_line": 75, "end_col": 56 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertLevel_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertLevel_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertLevel_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel = x\n\ninline_for_extraction let synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertLevel_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertLevel_inj () : Lemma\n (LP.synth_injective synth_alertLevel) = ()\n\nlet lemma_synth_alertLevel_inv () : Lemma\n (LP.synth_inverse synth_alertLevel synth_alertLevel_inv) = ()\n\nnoextract let parse_alertLevel_key : LP.parser _ (LP.enum_key alertLevel_enum) =\n LP.parse_enum_key alertLevel_repr_parser alertLevel_enum\n\nnoextract let serialize_alertLevel_key : LP.serializer parse_alertLevel_key =\n LP.serialize_enum_key alertLevel_repr_parser alertLevel_repr_serializer alertLevel_enum", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.AlertLevel.alertLevel_parser_kind Parsers.AlertLevel.alertLevel", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.AlertLevel.alertLevel", "FStar.UInt8.t", "Parsers.AlertLevel.alertLevel_enum", "Parsers.AlertLevel.parse_alertLevel_key", "Parsers.AlertLevel.synth_alertLevel", "Prims.unit", "Parsers.AlertLevel.lemma_synth_alertLevel_inj", "LowParse.Spec.Base.parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertLevel_parser: LP.parser alertLevel_parser_kind alertLevel\nlet alertLevel_parser:LP.parser _ alertLevel =", "completed_definiton": "lemma_synth_alertLevel_inj ();\nparse_alertLevel_key `LP.parse_synth` synth_alertLevel", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.alertLevel_serializer32", "original_source_type": "val alertLevel_serializer32: LS.serializer32 alertLevel_serializer", "source_type": "val alertLevel_serializer32: LS.serializer32 alertLevel_serializer", "source_definition": "let alertLevel_serializer32 : LS.serializer32 alertLevel_serializer =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LS.serialize32_synth _ synth_alertLevel _ serialize32_alertLevel_key synth_alertLevel_inv (fun x->synth_alertLevel_inv x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 98, "start_col": 2, "end_line": 100, "end_col": 126 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertLevel_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertLevel_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertLevel_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel = x\n\ninline_for_extraction let synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertLevel_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertLevel_inj () : Lemma\n (LP.synth_injective synth_alertLevel) = ()\n\nlet lemma_synth_alertLevel_inv () : Lemma\n (LP.synth_inverse synth_alertLevel synth_alertLevel_inv) = ()\n\nnoextract let parse_alertLevel_key : LP.parser _ (LP.enum_key alertLevel_enum) =\n LP.parse_enum_key alertLevel_repr_parser alertLevel_enum\n\nnoextract let serialize_alertLevel_key : LP.serializer parse_alertLevel_key =\n LP.serialize_enum_key alertLevel_repr_parser alertLevel_repr_serializer alertLevel_enum\n\nnoextract let alertLevel_parser : LP.parser _ alertLevel =\n lemma_synth_alertLevel_inj ();\n parse_alertLevel_key `LP.parse_synth` synth_alertLevel\n\nnoextract let alertLevel_serializer : LP.serializer alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LP.serialize_synth _ synth_alertLevel serialize_alertLevel_key synth_alertLevel_inv ()\n\nlet alertLevel_bytesize (x:alertLevel) : GTot nat = Seq.length (alertLevel_serializer x)\n\nlet alertLevel_bytesize_eq x = ()\n\nlet parse32_alertLevel_key : LS.parser32 parse_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertLevel_repr_parser32 alertLevel_enum)\n\nlet alertLevel_parser32 : LS.parser32 alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n LS.parse32_synth _ synth_alertLevel (fun x->synth_alertLevel x) parse32_alertLevel_key ()\n\nlet serialize32_alertLevel_key : LS.serializer32 serialize_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertLevel_repr_serializer32 alertLevel_enum)", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.AlertLevel.alertLevel_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.AlertLevel.alertLevel", "FStar.UInt8.t", "Parsers.AlertLevel.alertLevel_enum", "Parsers.AlertLevel.parse_alertLevel_key", "Parsers.AlertLevel.synth_alertLevel", "Parsers.AlertLevel.serialize_alertLevel_key", "Parsers.AlertLevel.serialize32_alertLevel_key", "Parsers.AlertLevel.synth_alertLevel_inv", "Prims.eq2", "Prims.unit", "Parsers.AlertLevel.lemma_synth_alertLevel_inv", "Parsers.AlertLevel.lemma_synth_alertLevel_inj", "LowParse.SLow.Base.serializer32", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertLevel.alertLevel_parser", "Parsers.AlertLevel.alertLevel_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertLevel_serializer32: LS.serializer32 alertLevel_serializer\nlet alertLevel_serializer32:LS.serializer32 alertLevel_serializer =", "completed_definiton": "lemma_synth_alertLevel_inj ();\nlemma_synth_alertLevel_inv ();\nLS.serialize32_synth _\n synth_alertLevel\n _\n serialize32_alertLevel_key\n synth_alertLevel_inv\n (fun x -> synth_alertLevel_inv x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.read_alertLevel_key", "original_source_type": "val read_alertLevel_key:LL.leaf_reader parse_alertLevel_key", "source_type": "val read_alertLevel_key:LL.leaf_reader parse_alertLevel_key", "source_definition": "let read_alertLevel_key : LL.leaf_reader parse_alertLevel_key =\n LL.mk_read_enum_key alertLevel_repr_reader alertLevel_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 116, "start_col": 2, "end_line": 116, "end_col": 60 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertLevel_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertLevel_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertLevel_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel = x\n\ninline_for_extraction let synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertLevel_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertLevel_inj () : Lemma\n (LP.synth_injective synth_alertLevel) = ()\n\nlet lemma_synth_alertLevel_inv () : Lemma\n (LP.synth_inverse synth_alertLevel synth_alertLevel_inv) = ()\n\nnoextract let parse_alertLevel_key : LP.parser _ (LP.enum_key alertLevel_enum) =\n LP.parse_enum_key alertLevel_repr_parser alertLevel_enum\n\nnoextract let serialize_alertLevel_key : LP.serializer parse_alertLevel_key =\n LP.serialize_enum_key alertLevel_repr_parser alertLevel_repr_serializer alertLevel_enum\n\nnoextract let alertLevel_parser : LP.parser _ alertLevel =\n lemma_synth_alertLevel_inj ();\n parse_alertLevel_key `LP.parse_synth` synth_alertLevel\n\nnoextract let alertLevel_serializer : LP.serializer alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LP.serialize_synth _ synth_alertLevel serialize_alertLevel_key synth_alertLevel_inv ()\n\nlet alertLevel_bytesize (x:alertLevel) : GTot nat = Seq.length (alertLevel_serializer x)\n\nlet alertLevel_bytesize_eq x = ()\n\nlet parse32_alertLevel_key : LS.parser32 parse_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertLevel_repr_parser32 alertLevel_enum)\n\nlet alertLevel_parser32 : LS.parser32 alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n LS.parse32_synth _ synth_alertLevel (fun x->synth_alertLevel x) parse32_alertLevel_key ()\n\nlet serialize32_alertLevel_key : LS.serializer32 serialize_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertLevel_repr_serializer32 alertLevel_enum)\n\nlet alertLevel_serializer32 : LS.serializer32 alertLevel_serializer =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LS.serialize32_synth _ synth_alertLevel _ serialize32_alertLevel_key synth_alertLevel_inv (fun x->synth_alertLevel_inv x) ()\n\nlet alertLevel_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond alertLevel_serializer 1ul) in\n LSZ.size32_constant alertLevel_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_alertLevel_key : LL.validator parse_alertLevel_key =\n LL.mk_validate_enum_key alertLevel_repr_validator alertLevel_repr_reader alertLevel_enum\n\nlet alertLevel_validator =\n lemma_synth_alertLevel_inj ();\n LL.validate_synth validate_alertLevel_key synth_alertLevel ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader Parsers.AlertLevel.parse_alertLevel_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.read_enum_key", "Parsers.AlertLevel.alertLevel", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "Parsers.AlertLevel.alertLevel_repr_reader", "Prims.Cons", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.Mktuple2", "Parsers.AlertLevel.Warning", "FStar.UInt8.__uint_to_t", "Parsers.AlertLevel.Fatal", "Prims.Nil", "LowParse.Spec.Enum.dep_maybe_enum_destr_t_intro", "LowParse.Low.Enum.read_enum_key_t", "LowParse.Spec.Enum.dep_maybe_enum_destr_cons", "LowParse.Spec.Enum.list_append_rev_cons", "LowParse.Spec.Enum.dep_maybe_enum_destr_nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_alertLevel_key:LL.leaf_reader parse_alertLevel_key\nlet read_alertLevel_key:LL.leaf_reader parse_alertLevel_key =", "completed_definiton": "LL.mk_read_enum_key alertLevel_repr_reader alertLevel_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.alertLevel_reader", "original_source_type": "val alertLevel_reader: LL.leaf_reader alertLevel_parser", "source_type": "val alertLevel_reader: LL.leaf_reader alertLevel_parser", "source_definition": "let alertLevel_reader =\n [@inline_let] let _ = lemma_synth_alertLevel_inj () in\n LL.read_synth' parse_alertLevel_key synth_alertLevel read_alertLevel_key ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 119, "start_col": 1, "end_line": 120, "end_col": 76 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertLevel_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertLevel_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertLevel_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel = x\n\ninline_for_extraction let synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertLevel_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertLevel_inj () : Lemma\n (LP.synth_injective synth_alertLevel) = ()\n\nlet lemma_synth_alertLevel_inv () : Lemma\n (LP.synth_inverse synth_alertLevel synth_alertLevel_inv) = ()\n\nnoextract let parse_alertLevel_key : LP.parser _ (LP.enum_key alertLevel_enum) =\n LP.parse_enum_key alertLevel_repr_parser alertLevel_enum\n\nnoextract let serialize_alertLevel_key : LP.serializer parse_alertLevel_key =\n LP.serialize_enum_key alertLevel_repr_parser alertLevel_repr_serializer alertLevel_enum\n\nnoextract let alertLevel_parser : LP.parser _ alertLevel =\n lemma_synth_alertLevel_inj ();\n parse_alertLevel_key `LP.parse_synth` synth_alertLevel\n\nnoextract let alertLevel_serializer : LP.serializer alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LP.serialize_synth _ synth_alertLevel serialize_alertLevel_key synth_alertLevel_inv ()\n\nlet alertLevel_bytesize (x:alertLevel) : GTot nat = Seq.length (alertLevel_serializer x)\n\nlet alertLevel_bytesize_eq x = ()\n\nlet parse32_alertLevel_key : LS.parser32 parse_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertLevel_repr_parser32 alertLevel_enum)\n\nlet alertLevel_parser32 : LS.parser32 alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n LS.parse32_synth _ synth_alertLevel (fun x->synth_alertLevel x) parse32_alertLevel_key ()\n\nlet serialize32_alertLevel_key : LS.serializer32 serialize_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertLevel_repr_serializer32 alertLevel_enum)\n\nlet alertLevel_serializer32 : LS.serializer32 alertLevel_serializer =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LS.serialize32_synth _ synth_alertLevel _ serialize32_alertLevel_key synth_alertLevel_inv (fun x->synth_alertLevel_inv x) ()\n\nlet alertLevel_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond alertLevel_serializer 1ul) in\n LSZ.size32_constant alertLevel_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_alertLevel_key : LL.validator parse_alertLevel_key =\n LL.mk_validate_enum_key alertLevel_repr_validator alertLevel_repr_reader alertLevel_enum\n\nlet alertLevel_validator =\n lemma_synth_alertLevel_inj ();\n LL.validate_synth validate_alertLevel_key synth_alertLevel ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_alertLevel_key : LL.leaf_reader parse_alertLevel_key =\n LL.mk_read_enum_key alertLevel_repr_reader alertLevel_enum", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader Parsers.AlertLevel.alertLevel_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.read_synth'", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.AlertLevel.alertLevel", "FStar.UInt8.t", "Parsers.AlertLevel.alertLevel_enum", "Parsers.AlertLevel.parse_alertLevel_key", "Parsers.AlertLevel.synth_alertLevel", "Parsers.AlertLevel.read_alertLevel_key", "Prims.unit", "Parsers.AlertLevel.lemma_synth_alertLevel_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertLevel_reader: LL.leaf_reader alertLevel_parser\nlet alertLevel_reader =", "completed_definiton": "[@@ inline_let ]let _ = lemma_synth_alertLevel_inj () in\nLL.read_synth' parse_alertLevel_key synth_alertLevel read_alertLevel_key ()", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.alertLevel_writer", "original_source_type": "val alertLevel_writer: LL.leaf_writer_strong alertLevel_serializer", "source_type": "val alertLevel_writer: LL.leaf_writer_strong alertLevel_serializer", "source_definition": "let alertLevel_writer =\n [@inline_let] let _ = lemma_synth_alertLevel_inj (); lemma_synth_alertLevel_inv () in\n LL.write_synth write_alertLevel_key synth_alertLevel synth_alertLevel_inv (fun x -> synth_alertLevel_inv x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 129, "start_col": 2, "end_line": 130, "end_col": 112 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertLevel_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertLevel_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertLevel_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel = x\n\ninline_for_extraction let synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertLevel_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertLevel_inj () : Lemma\n (LP.synth_injective synth_alertLevel) = ()\n\nlet lemma_synth_alertLevel_inv () : Lemma\n (LP.synth_inverse synth_alertLevel synth_alertLevel_inv) = ()\n\nnoextract let parse_alertLevel_key : LP.parser _ (LP.enum_key alertLevel_enum) =\n LP.parse_enum_key alertLevel_repr_parser alertLevel_enum\n\nnoextract let serialize_alertLevel_key : LP.serializer parse_alertLevel_key =\n LP.serialize_enum_key alertLevel_repr_parser alertLevel_repr_serializer alertLevel_enum\n\nnoextract let alertLevel_parser : LP.parser _ alertLevel =\n lemma_synth_alertLevel_inj ();\n parse_alertLevel_key `LP.parse_synth` synth_alertLevel\n\nnoextract let alertLevel_serializer : LP.serializer alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LP.serialize_synth _ synth_alertLevel serialize_alertLevel_key synth_alertLevel_inv ()\n\nlet alertLevel_bytesize (x:alertLevel) : GTot nat = Seq.length (alertLevel_serializer x)\n\nlet alertLevel_bytesize_eq x = ()\n\nlet parse32_alertLevel_key : LS.parser32 parse_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertLevel_repr_parser32 alertLevel_enum)\n\nlet alertLevel_parser32 : LS.parser32 alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n LS.parse32_synth _ synth_alertLevel (fun x->synth_alertLevel x) parse32_alertLevel_key ()\n\nlet serialize32_alertLevel_key : LS.serializer32 serialize_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertLevel_repr_serializer32 alertLevel_enum)\n\nlet alertLevel_serializer32 : LS.serializer32 alertLevel_serializer =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LS.serialize32_synth _ synth_alertLevel _ serialize32_alertLevel_key synth_alertLevel_inv (fun x->synth_alertLevel_inv x) ()\n\nlet alertLevel_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond alertLevel_serializer 1ul) in\n LSZ.size32_constant alertLevel_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_alertLevel_key : LL.validator parse_alertLevel_key =\n LL.mk_validate_enum_key alertLevel_repr_validator alertLevel_repr_reader alertLevel_enum\n\nlet alertLevel_validator =\n lemma_synth_alertLevel_inj ();\n LL.validate_synth validate_alertLevel_key synth_alertLevel ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_alertLevel_key : LL.leaf_reader parse_alertLevel_key =\n LL.mk_read_enum_key alertLevel_repr_reader alertLevel_enum\n\nlet alertLevel_reader =\n [@inline_let] let _ = lemma_synth_alertLevel_inj () in\n LL.read_synth' parse_alertLevel_key synth_alertLevel read_alertLevel_key ()\n\ninline_for_extraction let write_alertLevel_key : LL.leaf_writer_strong serialize_alertLevel_key =\n LL.write_enum_key alertLevel_repr_writer alertLevel_enum (_ by (LP.enum_repr_of_key_tac alertLevel_enum))\n\ninline_for_extraction let lserialize_alertLevel_key : LL.serializer32 serialize_alertLevel_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_alertLevel_key 1ul ()", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong Parsers.AlertLevel.alertLevel_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.write_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.AlertLevel.alertLevel", "FStar.UInt8.t", "Parsers.AlertLevel.alertLevel_enum", "Parsers.AlertLevel.parse_alertLevel_key", "Parsers.AlertLevel.serialize_alertLevel_key", "Parsers.AlertLevel.write_alertLevel_key", "Parsers.AlertLevel.synth_alertLevel", "Parsers.AlertLevel.synth_alertLevel_inv", "Prims.eq2", "Prims.unit", "Parsers.AlertLevel.lemma_synth_alertLevel_inv", "Parsers.AlertLevel.lemma_synth_alertLevel_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertLevel_writer: LL.leaf_writer_strong alertLevel_serializer\nlet alertLevel_writer =", "completed_definiton": "[@@ inline_let ]let _ =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ()\nin\nLL.write_synth write_alertLevel_key\n synth_alertLevel\n synth_alertLevel_inv\n (fun x -> synth_alertLevel_inv x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.alertLevel_serializer", "original_source_type": "val alertLevel_serializer: LP.serializer alertLevel_parser", "source_type": "val alertLevel_serializer: LP.serializer alertLevel_parser", "source_definition": "let alertLevel_serializer : LP.serializer alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LP.serialize_synth _ synth_alertLevel serialize_alertLevel_key synth_alertLevel_inv ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 78, "start_col": 2, "end_line": 80, "end_col": 88 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertLevel_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertLevel_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertLevel_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel = x\n\ninline_for_extraction let synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertLevel_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertLevel_inj () : Lemma\n (LP.synth_injective synth_alertLevel) = ()\n\nlet lemma_synth_alertLevel_inv () : Lemma\n (LP.synth_inverse synth_alertLevel synth_alertLevel_inv) = ()\n\nnoextract let parse_alertLevel_key : LP.parser _ (LP.enum_key alertLevel_enum) =\n LP.parse_enum_key alertLevel_repr_parser alertLevel_enum\n\nnoextract let serialize_alertLevel_key : LP.serializer parse_alertLevel_key =\n LP.serialize_enum_key alertLevel_repr_parser alertLevel_repr_serializer alertLevel_enum\n\nnoextract let alertLevel_parser : LP.parser _ alertLevel =\n lemma_synth_alertLevel_inj ();\n parse_alertLevel_key `LP.parse_synth` synth_alertLevel", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.AlertLevel.alertLevel_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.AlertLevel.alertLevel", "FStar.UInt8.t", "Parsers.AlertLevel.alertLevel_enum", "Parsers.AlertLevel.parse_alertLevel_key", "Parsers.AlertLevel.synth_alertLevel", "Parsers.AlertLevel.serialize_alertLevel_key", "Parsers.AlertLevel.synth_alertLevel_inv", "Prims.unit", "Parsers.AlertLevel.lemma_synth_alertLevel_inv", "Parsers.AlertLevel.lemma_synth_alertLevel_inj", "LowParse.Spec.Base.serializer", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertLevel.alertLevel_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertLevel_serializer: LP.serializer alertLevel_parser\nlet alertLevel_serializer:LP.serializer alertLevel_parser =", "completed_definiton": "lemma_synth_alertLevel_inj ();\nlemma_synth_alertLevel_inv ();\nLP.serialize_synth _ synth_alertLevel serialize_alertLevel_key synth_alertLevel_inv ()", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.alertLevel_lserializer", "original_source_type": "val alertLevel_lserializer: LL.serializer32 alertLevel_serializer", "source_type": "val alertLevel_lserializer: LL.serializer32 alertLevel_serializer", "source_definition": "let alertLevel_lserializer = LL.serializer32_of_leaf_writer_strong_constant_size alertLevel_writer 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 132, "start_col": 29, "end_line": 132, "end_col": 105 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertLevel_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertLevel_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertLevel_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel = x\n\ninline_for_extraction let synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertLevel_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertLevel_inj () : Lemma\n (LP.synth_injective synth_alertLevel) = ()\n\nlet lemma_synth_alertLevel_inv () : Lemma\n (LP.synth_inverse synth_alertLevel synth_alertLevel_inv) = ()\n\nnoextract let parse_alertLevel_key : LP.parser _ (LP.enum_key alertLevel_enum) =\n LP.parse_enum_key alertLevel_repr_parser alertLevel_enum\n\nnoextract let serialize_alertLevel_key : LP.serializer parse_alertLevel_key =\n LP.serialize_enum_key alertLevel_repr_parser alertLevel_repr_serializer alertLevel_enum\n\nnoextract let alertLevel_parser : LP.parser _ alertLevel =\n lemma_synth_alertLevel_inj ();\n parse_alertLevel_key `LP.parse_synth` synth_alertLevel\n\nnoextract let alertLevel_serializer : LP.serializer alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LP.serialize_synth _ synth_alertLevel serialize_alertLevel_key synth_alertLevel_inv ()\n\nlet alertLevel_bytesize (x:alertLevel) : GTot nat = Seq.length (alertLevel_serializer x)\n\nlet alertLevel_bytesize_eq x = ()\n\nlet parse32_alertLevel_key : LS.parser32 parse_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertLevel_repr_parser32 alertLevel_enum)\n\nlet alertLevel_parser32 : LS.parser32 alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n LS.parse32_synth _ synth_alertLevel (fun x->synth_alertLevel x) parse32_alertLevel_key ()\n\nlet serialize32_alertLevel_key : LS.serializer32 serialize_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertLevel_repr_serializer32 alertLevel_enum)\n\nlet alertLevel_serializer32 : LS.serializer32 alertLevel_serializer =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LS.serialize32_synth _ synth_alertLevel _ serialize32_alertLevel_key synth_alertLevel_inv (fun x->synth_alertLevel_inv x) ()\n\nlet alertLevel_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond alertLevel_serializer 1ul) in\n LSZ.size32_constant alertLevel_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_alertLevel_key : LL.validator parse_alertLevel_key =\n LL.mk_validate_enum_key alertLevel_repr_validator alertLevel_repr_reader alertLevel_enum\n\nlet alertLevel_validator =\n lemma_synth_alertLevel_inj ();\n LL.validate_synth validate_alertLevel_key synth_alertLevel ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_alertLevel_key : LL.leaf_reader parse_alertLevel_key =\n LL.mk_read_enum_key alertLevel_repr_reader alertLevel_enum\n\nlet alertLevel_reader =\n [@inline_let] let _ = lemma_synth_alertLevel_inj () in\n LL.read_synth' parse_alertLevel_key synth_alertLevel read_alertLevel_key ()\n\ninline_for_extraction let write_alertLevel_key : LL.leaf_writer_strong serialize_alertLevel_key =\n LL.write_enum_key alertLevel_repr_writer alertLevel_enum (_ by (LP.enum_repr_of_key_tac alertLevel_enum))\n\ninline_for_extraction let lserialize_alertLevel_key : LL.serializer32 serialize_alertLevel_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_alertLevel_key 1ul ()\n\nlet alertLevel_writer =\n [@inline_let] let _ = lemma_synth_alertLevel_inj (); lemma_synth_alertLevel_inv () in\n LL.write_synth write_alertLevel_key synth_alertLevel synth_alertLevel_inv (fun x -> synth_alertLevel_inv x) ()", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 Parsers.AlertLevel.alertLevel_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.serializer32_of_leaf_writer_strong_constant_size", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertLevel.alertLevel", "Parsers.AlertLevel.alertLevel_parser", "Parsers.AlertLevel.alertLevel_serializer", "Parsers.AlertLevel.alertLevel_writer", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertLevel_lserializer: LL.serializer32 alertLevel_serializer\nlet alertLevel_lserializer =", "completed_definiton": "LL.serializer32_of_leaf_writer_strong_constant_size alertLevel_writer 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.lserialize_alertLevel_key", "original_source_type": "val lserialize_alertLevel_key:LL.serializer32 serialize_alertLevel_key", "source_type": "val lserialize_alertLevel_key:LL.serializer32 serialize_alertLevel_key", "source_definition": "let lserialize_alertLevel_key : LL.serializer32 serialize_alertLevel_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_alertLevel_key 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 126, "start_col": 2, "end_line": 126, "end_col": 81 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertLevel_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertLevel_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertLevel_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel = x\n\ninline_for_extraction let synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertLevel_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertLevel_inj () : Lemma\n (LP.synth_injective synth_alertLevel) = ()\n\nlet lemma_synth_alertLevel_inv () : Lemma\n (LP.synth_inverse synth_alertLevel synth_alertLevel_inv) = ()\n\nnoextract let parse_alertLevel_key : LP.parser _ (LP.enum_key alertLevel_enum) =\n LP.parse_enum_key alertLevel_repr_parser alertLevel_enum\n\nnoextract let serialize_alertLevel_key : LP.serializer parse_alertLevel_key =\n LP.serialize_enum_key alertLevel_repr_parser alertLevel_repr_serializer alertLevel_enum\n\nnoextract let alertLevel_parser : LP.parser _ alertLevel =\n lemma_synth_alertLevel_inj ();\n parse_alertLevel_key `LP.parse_synth` synth_alertLevel\n\nnoextract let alertLevel_serializer : LP.serializer alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LP.serialize_synth _ synth_alertLevel serialize_alertLevel_key synth_alertLevel_inv ()\n\nlet alertLevel_bytesize (x:alertLevel) : GTot nat = Seq.length (alertLevel_serializer x)\n\nlet alertLevel_bytesize_eq x = ()\n\nlet parse32_alertLevel_key : LS.parser32 parse_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertLevel_repr_parser32 alertLevel_enum)\n\nlet alertLevel_parser32 : LS.parser32 alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n LS.parse32_synth _ synth_alertLevel (fun x->synth_alertLevel x) parse32_alertLevel_key ()\n\nlet serialize32_alertLevel_key : LS.serializer32 serialize_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertLevel_repr_serializer32 alertLevel_enum)\n\nlet alertLevel_serializer32 : LS.serializer32 alertLevel_serializer =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LS.serialize32_synth _ synth_alertLevel _ serialize32_alertLevel_key synth_alertLevel_inv (fun x->synth_alertLevel_inv x) ()\n\nlet alertLevel_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond alertLevel_serializer 1ul) in\n LSZ.size32_constant alertLevel_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_alertLevel_key : LL.validator parse_alertLevel_key =\n LL.mk_validate_enum_key alertLevel_repr_validator alertLevel_repr_reader alertLevel_enum\n\nlet alertLevel_validator =\n lemma_synth_alertLevel_inj ();\n LL.validate_synth validate_alertLevel_key synth_alertLevel ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_alertLevel_key : LL.leaf_reader parse_alertLevel_key =\n LL.mk_read_enum_key alertLevel_repr_reader alertLevel_enum\n\nlet alertLevel_reader =\n [@inline_let] let _ = lemma_synth_alertLevel_inj () in\n LL.read_synth' parse_alertLevel_key synth_alertLevel read_alertLevel_key ()\n\ninline_for_extraction let write_alertLevel_key : LL.leaf_writer_strong serialize_alertLevel_key =\n LL.write_enum_key alertLevel_repr_writer alertLevel_enum (_ by (LP.enum_repr_of_key_tac alertLevel_enum))", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 Parsers.AlertLevel.serialize_alertLevel_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.serializer32_of_leaf_writer_strong_constant_size", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.AlertLevel.alertLevel", "FStar.UInt8.t", "Parsers.AlertLevel.alertLevel_enum", "Parsers.AlertLevel.parse_alertLevel_key", "Parsers.AlertLevel.serialize_alertLevel_key", "Parsers.AlertLevel.write_alertLevel_key", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lserialize_alertLevel_key:LL.serializer32 serialize_alertLevel_key\nlet lserialize_alertLevel_key:LL.serializer32 serialize_alertLevel_key =", "completed_definiton": "LL.serializer32_of_leaf_writer_strong_constant_size write_alertLevel_key 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.alertLevel_bytesize_eqn", "original_source_type": "val alertLevel_bytesize_eqn (x: alertLevel) : Lemma (alertLevel_bytesize x == 1) [SMTPat (alertLevel_bytesize x)]", "source_type": "val alertLevel_bytesize_eqn (x: alertLevel) : Lemma (alertLevel_bytesize x == 1) [SMTPat (alertLevel_bytesize x)]", "source_definition": "let alertLevel_bytesize_eqn x = alertLevel_bytesize_eq x; assert (FStar.Seq.length (LP.serialize alertLevel_serializer x) <= 1); assert (1 <= FStar.Seq.length (LP.serialize alertLevel_serializer x))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 134, "start_col": 32, "end_line": 134, "end_col": 198 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertLevel_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertLevel_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertLevel_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel = x\n\ninline_for_extraction let synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertLevel_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertLevel_inj () : Lemma\n (LP.synth_injective synth_alertLevel) = ()\n\nlet lemma_synth_alertLevel_inv () : Lemma\n (LP.synth_inverse synth_alertLevel synth_alertLevel_inv) = ()\n\nnoextract let parse_alertLevel_key : LP.parser _ (LP.enum_key alertLevel_enum) =\n LP.parse_enum_key alertLevel_repr_parser alertLevel_enum\n\nnoextract let serialize_alertLevel_key : LP.serializer parse_alertLevel_key =\n LP.serialize_enum_key alertLevel_repr_parser alertLevel_repr_serializer alertLevel_enum\n\nnoextract let alertLevel_parser : LP.parser _ alertLevel =\n lemma_synth_alertLevel_inj ();\n parse_alertLevel_key `LP.parse_synth` synth_alertLevel\n\nnoextract let alertLevel_serializer : LP.serializer alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LP.serialize_synth _ synth_alertLevel serialize_alertLevel_key synth_alertLevel_inv ()\n\nlet alertLevel_bytesize (x:alertLevel) : GTot nat = Seq.length (alertLevel_serializer x)\n\nlet alertLevel_bytesize_eq x = ()\n\nlet parse32_alertLevel_key : LS.parser32 parse_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertLevel_repr_parser32 alertLevel_enum)\n\nlet alertLevel_parser32 : LS.parser32 alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n LS.parse32_synth _ synth_alertLevel (fun x->synth_alertLevel x) parse32_alertLevel_key ()\n\nlet serialize32_alertLevel_key : LS.serializer32 serialize_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertLevel_repr_serializer32 alertLevel_enum)\n\nlet alertLevel_serializer32 : LS.serializer32 alertLevel_serializer =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LS.serialize32_synth _ synth_alertLevel _ serialize32_alertLevel_key synth_alertLevel_inv (fun x->synth_alertLevel_inv x) ()\n\nlet alertLevel_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond alertLevel_serializer 1ul) in\n LSZ.size32_constant alertLevel_serializer 1ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac)]\ninline_for_extraction let validate_alertLevel_key : LL.validator parse_alertLevel_key =\n LL.mk_validate_enum_key alertLevel_repr_validator alertLevel_repr_reader alertLevel_enum\n\nlet alertLevel_validator =\n lemma_synth_alertLevel_inj ();\n LL.validate_synth validate_alertLevel_key synth_alertLevel ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_alertLevel_key : LL.leaf_reader parse_alertLevel_key =\n LL.mk_read_enum_key alertLevel_repr_reader alertLevel_enum\n\nlet alertLevel_reader =\n [@inline_let] let _ = lemma_synth_alertLevel_inj () in\n LL.read_synth' parse_alertLevel_key synth_alertLevel read_alertLevel_key ()\n\ninline_for_extraction let write_alertLevel_key : LL.leaf_writer_strong serialize_alertLevel_key =\n LL.write_enum_key alertLevel_repr_writer alertLevel_enum (_ by (LP.enum_repr_of_key_tac alertLevel_enum))\n\ninline_for_extraction let lserialize_alertLevel_key : LL.serializer32 serialize_alertLevel_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_alertLevel_key 1ul ()\n\nlet alertLevel_writer =\n [@inline_let] let _ = lemma_synth_alertLevel_inj (); lemma_synth_alertLevel_inv () in\n LL.write_synth write_alertLevel_key synth_alertLevel synth_alertLevel_inv (fun x -> synth_alertLevel_inv x) ()\n\nlet alertLevel_lserializer = LL.serializer32_of_leaf_writer_strong_constant_size alertLevel_writer 1ul ()", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.AlertLevel.alertLevel\n -> FStar.Pervasives.Lemma (ensures Parsers.AlertLevel.alertLevel_bytesize x == 1)\n [SMTPat (Parsers.AlertLevel.alertLevel_bytesize x)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.AlertLevel.alertLevel", "Prims._assert", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertLevel.alertLevel_parser", "Parsers.AlertLevel.alertLevel_serializer", "Prims.unit", "Parsers.AlertLevel.alertLevel_bytesize_eq" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertLevel_bytesize_eqn (x: alertLevel) : Lemma (alertLevel_bytesize x == 1) [SMTPat (alertLevel_bytesize x)]\nlet alertLevel_bytesize_eqn x =", "completed_definiton": "alertLevel_bytesize_eq x;\nassert (FStar.Seq.length (LP.serialize alertLevel_serializer x) <= 1);\nassert (1 <= FStar.Seq.length (LP.serialize alertLevel_serializer x))", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertLevel.fst", "name": "Parsers.AlertLevel.serialize32_alertLevel_key", "original_source_type": "val serialize32_alertLevel_key:LS.serializer32 serialize_alertLevel_key", "source_type": "val serialize32_alertLevel_key:LS.serializer32 serialize_alertLevel_key", "source_definition": "let serialize32_alertLevel_key : LS.serializer32 serialize_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac\n alertLevel_repr_serializer32 alertLevel_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertLevel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 94, "start_col": 2, "end_line": 95, "end_col": 49 }, "file_context": "module Parsers.AlertLevel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let alertLevel_enum : LP.enum alertLevel U8.t =\n [@inline_let] let e = [\n Warning, 1z;\n Fatal, 2z;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let alertLevel_repr_parser = LPI.parse_u8\n\nnoextract let alertLevel_repr_serializer = LPI.serialize_u8\n\ninline_for_extraction noextract let alertLevel_repr_parser32 = LS.parse32_u8\n\ninline_for_extraction noextract let alertLevel_repr_serializer32 = LS.serialize32_u8\n\ninline_for_extraction noextract let alertLevel_repr_size32 = LSZ.size32_u8\n\ninline_for_extraction noextract let alertLevel_repr_validator = (LL.validate_u8 ())\n\ninline_for_extraction noextract let alertLevel_repr_jumper = LL.jump_u8\n\ninline_for_extraction noextract let alertLevel_repr_reader = LL.read_u8\n\ninline_for_extraction noextract let alertLevel_repr_writer = LL.write_u8\n\ninline_for_extraction let synth_alertLevel (x: LP.enum_key alertLevel_enum) : Tot alertLevel = x\n\ninline_for_extraction let synth_alertLevel_inv (x: alertLevel) : Tot (LP.enum_key alertLevel_enum) =\n [@inline_let] let _ : squash (LP.list_mem x (LP.list_map fst alertLevel_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x)\n in\n x\n\nlet lemma_synth_alertLevel_inj () : Lemma\n (LP.synth_injective synth_alertLevel) = ()\n\nlet lemma_synth_alertLevel_inv () : Lemma\n (LP.synth_inverse synth_alertLevel synth_alertLevel_inv) = ()\n\nnoextract let parse_alertLevel_key : LP.parser _ (LP.enum_key alertLevel_enum) =\n LP.parse_enum_key alertLevel_repr_parser alertLevel_enum\n\nnoextract let serialize_alertLevel_key : LP.serializer parse_alertLevel_key =\n LP.serialize_enum_key alertLevel_repr_parser alertLevel_repr_serializer alertLevel_enum\n\nnoextract let alertLevel_parser : LP.parser _ alertLevel =\n lemma_synth_alertLevel_inj ();\n parse_alertLevel_key `LP.parse_synth` synth_alertLevel\n\nnoextract let alertLevel_serializer : LP.serializer alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n lemma_synth_alertLevel_inv ();\n LP.serialize_synth _ synth_alertLevel serialize_alertLevel_key synth_alertLevel_inv ()\n\nlet alertLevel_bytesize (x:alertLevel) : GTot nat = Seq.length (alertLevel_serializer x)\n\nlet alertLevel_bytesize_eq x = ()\n\nlet parse32_alertLevel_key : LS.parser32 parse_alertLevel_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_enum_key_tac alertLevel_repr_parser32 alertLevel_enum)\n\nlet alertLevel_parser32 : LS.parser32 alertLevel_parser =\n lemma_synth_alertLevel_inj ();\n LS.parse32_synth _ synth_alertLevel (fun x->synth_alertLevel x) parse32_alertLevel_key ()", "dependencies": { "source_file": "Parsers.AlertLevel.fst", "checked_file": "Parsers.AlertLevel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.AlertLevel.serialize_alertLevel_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Enum.serialize32_enum_key_gen", "LowParse.Spec.Int.parse_u8_kind", "Parsers.AlertLevel.alertLevel", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "Parsers.AlertLevel.alertLevel_repr_serializer32", "Parsers.AlertLevel.alertLevel_enum", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Enum.enum_key", "Parsers.AlertLevel.parse_alertLevel_key", "Parsers.AlertLevel.serialize_alertLevel_key", "LowParse.Spec.Enum.enum_repr_of_key_cons'", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'", "LowParse.Spec.Enum.enum_tail'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize32_alertLevel_key:LS.serializer32 serialize_alertLevel_key\nlet serialize32_alertLevel_key:LS.serializer32 serialize_alertLevel_key =", "completed_definiton": "FStar.Tactics.synth_by_tactic (LS.serialize32_enum_key_gen_tac alertLevel_repr_serializer32\n alertLevel_enum)", "isa_cross_project_example": true }, { "file_name": "Flags.fst", "name": "Flags.t", "original_source_type": "", "source_type": "val t : Type0", "source_definition": "let t = b:bool {b ==> model}", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/ideal-flags/Flags.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 5, "start_col": 8, "end_line": 5, "end_col": 28 }, "file_context": "module Flags\n\nassume val model: bool // scaffolding", "dependencies": { "source_file": "Flags.fst", "checked_file": "Flags.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.bool", "Prims.l_imp", "Prims.b2t", "Flags.model" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let t =", "completed_definiton": "b: bool{b ==> model}", "isa_cross_project_example": true }, { "file_name": "Flags.fst", "name": "Flags.real", "original_source_type": "", "source_type": "val real : Type0", "source_definition": "let real = b:bool {b ==> ~model}", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/ideal-flags/Flags.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 24, "start_col": 11, "end_line": 24, "end_col": 32 }, "file_context": "module Flags\n\nassume val model: bool // scaffolding\n\nlet t = b:bool {b ==> model} \nassume val ideal_KEF: t\nassume val ideal_Nonce: t\nassume val ideal_Sig: t\nassume val ideal_PMS: t\nassume val ideal_PRF: t\nassume val ideal_AEAD: t\nassume val ideal_HMAC: t // see HMAC.UFCMA\n\nassume val flag_Raw: b:bool{b ==> model}\nassume val flag_KDF: d:nat -> b:bool{b ==> model}\nassume val flag_KEF0: d:nat -> b:bool{b ==> model /\\ flag_KDF d ==> b}\nassume val flag_PRF1: d:nat -> b:bool{flag_KEF0 d ==> b /\\ b ==> model}\nassume val flag_ODH: d:nat -> b:bool {flag_PRF1 d ==> b /\\ b ==> model}\nassume val flag_KEF2: d:nat -> b:bool{flag_KDF d ==> b /\\ b ==> model}\n\n// debug printing flags, one per module; \n// the refinement enables us to leak secrets for printing.", "dependencies": { "source_file": "Flags.fst", "checked_file": "Flags.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.bool", "Prims.l_imp", "Prims.b2t", "Prims.l_not", "Flags.model" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let real =", "completed_definiton": "b: bool{b ==> ~model}", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fsti", "name": "Parsers.AlertDescription.alertDescription_parser_kind", "original_source_type": "", "source_type": "val alertDescription_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let alertDescription_parser_kind = LP.strong_parser_kind 1 1 None", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 79, "start_col": 67, "end_line": 79, "end_col": 97 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ntype alertDescription =\n | Close_notify\n | Unexpected_message\n | Bad_record_mac\n | Record_overflow\n | Handshake_failure\n | Bad_certificate\n | Unsupported_certificate\n | Certificate_revoked\n | Certificate_expired\n | Certificate_unknown\n | Illegal_parameter\n | Unknown_ca\n | Access_denied\n | Decode_error\n | Decrypt_error\n | Protocol_version\n | Insufficient_security\n | Internal_error\n | Inappropriate_fallback\n | User_canceled\n | Missing_extension\n | Unsupported_extension\n | Unrecognized_name\n | Bad_certificate_status_response\n | Unknown_psk_identity\n | Certificate_required\n | No_application_protocol\n\nlet string_of_alertDescription = function\n | Close_notify -> \"close_notify\"\n | Unexpected_message -> \"unexpected_message\"\n | Bad_record_mac -> \"bad_record_mac\"\n | Record_overflow -> \"record_overflow\"\n | Handshake_failure -> \"handshake_failure\"\n | Bad_certificate -> \"bad_certificate\"\n | Unsupported_certificate -> \"unsupported_certificate\"\n | Certificate_revoked -> \"certificate_revoked\"\n | Certificate_expired -> \"certificate_expired\"\n | Certificate_unknown -> \"certificate_unknown\"\n | Illegal_parameter -> \"illegal_parameter\"\n | Unknown_ca -> \"unknown_ca\"\n | Access_denied -> \"access_denied\"\n | Decode_error -> \"decode_error\"\n | Decrypt_error -> \"decrypt_error\"\n | Protocol_version -> \"protocol_version\"\n | Insufficient_security -> \"insufficient_security\"\n | Internal_error -> \"internal_error\"\n | Inappropriate_fallback -> \"inappropriate_fallback\"\n | User_canceled -> \"user_canceled\"\n | Missing_extension -> \"missing_extension\"\n | Unsupported_extension -> \"unsupported_extension\"\n | Unrecognized_name -> \"unrecognized_name\"\n | Bad_certificate_status_response -> \"bad_certificate_status_response\"\n | Unknown_psk_identity -> \"unknown_psk_identity\"\n | Certificate_required -> \"certificate_required\"\n | No_application_protocol -> \"no_application_protocol\"", "dependencies": { "source_file": "Parsers.AlertDescription.fsti", "checked_file": "Parsers.AlertDescription.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alertDescription_parser_kind =", "completed_definiton": "LP.strong_parser_kind 1 1 None", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fsti", "name": "Parsers.AlertDescription.string_of_alertDescription", "original_source_type": "", "source_type": "val string_of_alertDescription : _: Parsers.AlertDescription.alertDescription -> Prims.string", "source_definition": "let string_of_alertDescription = function\n | Close_notify -> \"close_notify\"\n | Unexpected_message -> \"unexpected_message\"\n | Bad_record_mac -> \"bad_record_mac\"\n | Record_overflow -> \"record_overflow\"\n | Handshake_failure -> \"handshake_failure\"\n | Bad_certificate -> \"bad_certificate\"\n | Unsupported_certificate -> \"unsupported_certificate\"\n | Certificate_revoked -> \"certificate_revoked\"\n | Certificate_expired -> \"certificate_expired\"\n | Certificate_unknown -> \"certificate_unknown\"\n | Illegal_parameter -> \"illegal_parameter\"\n | Unknown_ca -> \"unknown_ca\"\n | Access_denied -> \"access_denied\"\n | Decode_error -> \"decode_error\"\n | Decrypt_error -> \"decrypt_error\"\n | Protocol_version -> \"protocol_version\"\n | Insufficient_security -> \"insufficient_security\"\n | Internal_error -> \"internal_error\"\n | Inappropriate_fallback -> \"inappropriate_fallback\"\n | User_canceled -> \"user_canceled\"\n | Missing_extension -> \"missing_extension\"\n | Unsupported_extension -> \"unsupported_extension\"\n | Unrecognized_name -> \"unrecognized_name\"\n | Bad_certificate_status_response -> \"bad_certificate_status_response\"\n | Unknown_psk_identity -> \"unknown_psk_identity\"\n | Certificate_required -> \"certificate_required\"\n | No_application_protocol -> \"no_application_protocol\"", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 50, "start_col": 33, "end_line": 77, "end_col": 56 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ntype alertDescription =\n | Close_notify\n | Unexpected_message\n | Bad_record_mac\n | Record_overflow\n | Handshake_failure\n | Bad_certificate\n | Unsupported_certificate\n | Certificate_revoked\n | Certificate_expired\n | Certificate_unknown\n | Illegal_parameter\n | Unknown_ca\n | Access_denied\n | Decode_error\n | Decrypt_error\n | Protocol_version\n | Insufficient_security\n | Internal_error\n | Inappropriate_fallback\n | User_canceled\n | Missing_extension\n | Unsupported_extension\n | Unrecognized_name\n | Bad_certificate_status_response\n | Unknown_psk_identity\n | Certificate_required\n | No_application_protocol", "dependencies": { "source_file": "Parsers.AlertDescription.fsti", "checked_file": "Parsers.AlertDescription.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Parsers.AlertDescription.alertDescription -> Prims.string", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.AlertDescription.alertDescription", "Prims.string" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let string_of_alertDescription =", "completed_definiton": "function\n| Close_notify -> \"close_notify\"\n| Unexpected_message -> \"unexpected_message\"\n| Bad_record_mac -> \"bad_record_mac\"\n| Record_overflow -> \"record_overflow\"\n| Handshake_failure -> \"handshake_failure\"\n| Bad_certificate -> \"bad_certificate\"\n| Unsupported_certificate -> \"unsupported_certificate\"\n| Certificate_revoked -> \"certificate_revoked\"\n| Certificate_expired -> \"certificate_expired\"\n| Certificate_unknown -> \"certificate_unknown\"\n| Illegal_parameter -> \"illegal_parameter\"\n| Unknown_ca -> \"unknown_ca\"\n| Access_denied -> \"access_denied\"\n| Decode_error -> \"decode_error\"\n| Decrypt_error -> \"decrypt_error\"\n| Protocol_version -> \"protocol_version\"\n| Insufficient_security -> \"insufficient_security\"\n| Internal_error -> \"internal_error\"\n| Inappropriate_fallback -> \"inappropriate_fallback\"\n| User_canceled -> \"user_canceled\"\n| Missing_extension -> \"missing_extension\"\n| Unsupported_extension -> \"unsupported_extension\"\n| Unrecognized_name -> \"unrecognized_name\"\n| Bad_certificate_status_response -> \"bad_certificate_status_response\"\n| Unknown_psk_identity -> \"unknown_psk_identity\"\n| Certificate_required -> \"certificate_required\"\n| No_application_protocol -> \"no_application_protocol\"", "isa_cross_project_example": true }, { "file_name": "Parsers.AlertDescription.fsti", "name": "Parsers.AlertDescription.alertDescription_jumper", "original_source_type": "val alertDescription_jumper:LL.jumper alertDescription_parser", "source_type": "val alertDescription_jumper:LL.jumper alertDescription_parser", "source_definition": "let alertDescription_jumper: LL.jumper alertDescription_parser = LL.jump_constant_size alertDescription_parser 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.AlertDescription.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 97, "start_col": 65, "end_line": 97, "end_col": 117 }, "file_context": "module Parsers.AlertDescription\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ntype alertDescription =\n | Close_notify\n | Unexpected_message\n | Bad_record_mac\n | Record_overflow\n | Handshake_failure\n | Bad_certificate\n | Unsupported_certificate\n | Certificate_revoked\n | Certificate_expired\n | Certificate_unknown\n | Illegal_parameter\n | Unknown_ca\n | Access_denied\n | Decode_error\n | Decrypt_error\n | Protocol_version\n | Insufficient_security\n | Internal_error\n | Inappropriate_fallback\n | User_canceled\n | Missing_extension\n | Unsupported_extension\n | Unrecognized_name\n | Bad_certificate_status_response\n | Unknown_psk_identity\n | Certificate_required\n | No_application_protocol\n\nlet string_of_alertDescription = function\n | Close_notify -> \"close_notify\"\n | Unexpected_message -> \"unexpected_message\"\n | Bad_record_mac -> \"bad_record_mac\"\n | Record_overflow -> \"record_overflow\"\n | Handshake_failure -> \"handshake_failure\"\n | Bad_certificate -> \"bad_certificate\"\n | Unsupported_certificate -> \"unsupported_certificate\"\n | Certificate_revoked -> \"certificate_revoked\"\n | Certificate_expired -> \"certificate_expired\"\n | Certificate_unknown -> \"certificate_unknown\"\n | Illegal_parameter -> \"illegal_parameter\"\n | Unknown_ca -> \"unknown_ca\"\n | Access_denied -> \"access_denied\"\n | Decode_error -> \"decode_error\"\n | Decrypt_error -> \"decrypt_error\"\n | Protocol_version -> \"protocol_version\"\n | Insufficient_security -> \"insufficient_security\"\n | Internal_error -> \"internal_error\"\n | Inappropriate_fallback -> \"inappropriate_fallback\"\n | User_canceled -> \"user_canceled\"\n | Missing_extension -> \"missing_extension\"\n | Unsupported_extension -> \"unsupported_extension\"\n | Unrecognized_name -> \"unrecognized_name\"\n | Bad_certificate_status_response -> \"bad_certificate_status_response\"\n | Unknown_psk_identity -> \"unknown_psk_identity\"\n | Certificate_required -> \"certificate_required\"\n | No_application_protocol -> \"no_application_protocol\"\n\ninline_for_extraction noextract let alertDescription_parser_kind = LP.strong_parser_kind 1 1 None\n\nnoextract val alertDescription_parser: LP.parser alertDescription_parser_kind alertDescription\n\nnoextract val alertDescription_serializer: LP.serializer alertDescription_parser\n\nnoextract val alertDescription_bytesize (x:alertDescription) : GTot nat\n\nnoextract val alertDescription_bytesize_eq (x:alertDescription) : Lemma (alertDescription_bytesize x == Seq.length (LP.serialize alertDescription_serializer x))\n\nval alertDescription_parser32: LS.parser32 alertDescription_parser\n\nval alertDescription_serializer32: LS.serializer32 alertDescription_serializer\n\nval alertDescription_size32: LSZ.size32 alertDescription_serializer\n\nval alertDescription_validator: LL.validator alertDescription_parser", "dependencies": { "source_file": "Parsers.AlertDescription.fsti", "checked_file": "Parsers.AlertDescription.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.AlertDescription.alertDescription_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.jump_constant_size", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.AlertDescription.alertDescription", "Parsers.AlertDescription.alertDescription_parser", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alertDescription_jumper:LL.jumper alertDescription_parser\nlet alertDescription_jumper:LL.jumper alertDescription_parser =", "completed_definiton": "LL.jump_constant_size alertDescription_parser 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fsti", "name": "Parsers.ProtocolVersion.protocolVersion_repr_eq", "original_source_type": "val protocolVersion_repr_eq (x1 x2: protocolVersion_repr) : Tot bool", "source_type": "val protocolVersion_repr_eq (x1 x2: protocolVersion_repr) : Tot bool", "source_definition": "let protocolVersion_repr_eq (x1 x2: protocolVersion_repr) : Tot bool = (x1 = x2)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 22, "start_col": 93, "end_line": 22, "end_col": 102 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST", "dependencies": { "source_file": "Parsers.ProtocolVersion.fsti", "checked_file": "Parsers.ProtocolVersion.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x1: Parsers.ProtocolVersion.protocolVersion_repr -> x2: Parsers.ProtocolVersion.protocolVersion_repr\n -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.ProtocolVersion.protocolVersion_repr", "Prims.op_Equality", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val protocolVersion_repr_eq (x1 x2: protocolVersion_repr) : Tot bool\nlet protocolVersion_repr_eq (x1 x2: protocolVersion_repr) : Tot bool =", "completed_definiton": "(x1 = x2)", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fsti", "name": "Parsers.ProtocolVersion.protocolVersion_repr", "original_source_type": "", "source_type": "val protocolVersion_repr : Prims.eqtype", "source_definition": "let protocolVersion_repr = U16.t", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 21, "start_col": 27, "end_line": 21, "end_col": 32 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST", "dependencies": { "source_file": "Parsers.ProtocolVersion.fsti", "checked_file": "Parsers.ProtocolVersion.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.eqtype", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt16.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let protocolVersion_repr =", "completed_definiton": "U16.t", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fsti", "name": "Parsers.ProtocolVersion.known_protocolVersion_repr", "original_source_type": "val known_protocolVersion_repr (v: U16.t) : bool", "source_type": "val known_protocolVersion_repr (v: U16.t) : bool", "source_definition": "let known_protocolVersion_repr (v:U16.t) : bool = v `protocolVersion_repr_eq` 768us || (v `protocolVersion_repr_eq` 769us || (v `protocolVersion_repr_eq` 770us || (v `protocolVersion_repr_eq` 771us || (v `protocolVersion_repr_eq` 772us || (false)))))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 23, "start_col": 50, "end_line": 23, "end_col": 250 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet protocolVersion_repr = U16.t", "dependencies": { "source_file": "Parsers.ProtocolVersion.fsti", "checked_file": "Parsers.ProtocolVersion.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "v: FStar.UInt16.t -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt16.t", "Prims.op_BarBar", "Parsers.ProtocolVersion.protocolVersion_repr_eq", "FStar.UInt16.__uint_to_t", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val known_protocolVersion_repr (v: U16.t) : bool\nlet known_protocolVersion_repr (v: U16.t) : bool =", "completed_definiton": "v\n`protocolVersion_repr_eq`\n768us ||\n(v\n `protocolVersion_repr_eq`\n 769us ||\n (v\n `protocolVersion_repr_eq`\n 770us ||\n (v `protocolVersion_repr_eq` 771us || (v `protocolVersion_repr_eq` 772us || (false)))))", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fsti", "name": "Parsers.ProtocolVersion.protocolVersion_parser_kind", "original_source_type": "", "source_type": "val protocolVersion_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let protocolVersion_parser_kind = LP.strong_parser_kind 2 2 (Some LP.ParserKindMetadataTotal)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 41, "start_col": 66, "end_line": 41, "end_col": 125 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet protocolVersion_repr = U16.t\ninline_for_extraction let protocolVersion_repr_eq (x1 x2: protocolVersion_repr) : Tot bool = (x1 = x2)\nlet known_protocolVersion_repr (v:U16.t) : bool = v `protocolVersion_repr_eq` 768us || (v `protocolVersion_repr_eq` 769us || (v `protocolVersion_repr_eq` 770us || (v `protocolVersion_repr_eq` 771us || (v `protocolVersion_repr_eq` 772us || (false)))))\n\ntype protocolVersion =\n | SSL_3p0\n | TLS_1p0\n | TLS_1p1\n | TLS_1p2\n | TLS_1p3\n | Unknown_protocolVersion of (v:U16.t{not (known_protocolVersion_repr v)})\n\nlet string_of_protocolVersion = function\n | SSL_3p0 -> \"SSL_3p0\"\n | TLS_1p0 -> \"TLS_1p0\"\n | TLS_1p1 -> \"TLS_1p1\"\n | TLS_1p2 -> \"TLS_1p2\"\n | TLS_1p3 -> \"TLS_1p3\"\n | Unknown_protocolVersion _ -> \"Unknown_protocolVersion\"", "dependencies": { "source_file": "Parsers.ProtocolVersion.fsti", "checked_file": "Parsers.ProtocolVersion.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.Some", "LowParse.Spec.Base.parser_kind_metadata_some", "LowParse.Spec.Base.ParserKindMetadataTotal" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let protocolVersion_parser_kind =", "completed_definiton": "LP.strong_parser_kind 2 2 (Some LP.ParserKindMetadataTotal)", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fsti", "name": "Parsers.ProtocolVersion.string_of_protocolVersion", "original_source_type": "", "source_type": "val string_of_protocolVersion : _: Parsers.ProtocolVersion.protocolVersion -> Prims.string", "source_definition": "let string_of_protocolVersion = function\n | SSL_3p0 -> \"SSL_3p0\"\n | TLS_1p0 -> \"TLS_1p0\"\n | TLS_1p1 -> \"TLS_1p1\"\n | TLS_1p2 -> \"TLS_1p2\"\n | TLS_1p3 -> \"TLS_1p3\"\n | Unknown_protocolVersion _ -> \"Unknown_protocolVersion\"", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 33, "start_col": 32, "end_line": 39, "end_col": 58 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet protocolVersion_repr = U16.t\ninline_for_extraction let protocolVersion_repr_eq (x1 x2: protocolVersion_repr) : Tot bool = (x1 = x2)\nlet known_protocolVersion_repr (v:U16.t) : bool = v `protocolVersion_repr_eq` 768us || (v `protocolVersion_repr_eq` 769us || (v `protocolVersion_repr_eq` 770us || (v `protocolVersion_repr_eq` 771us || (v `protocolVersion_repr_eq` 772us || (false)))))\n\ntype protocolVersion =\n | SSL_3p0\n | TLS_1p0\n | TLS_1p1\n | TLS_1p2\n | TLS_1p3\n | Unknown_protocolVersion of (v:U16.t{not (known_protocolVersion_repr v)})", "dependencies": { "source_file": "Parsers.ProtocolVersion.fsti", "checked_file": "Parsers.ProtocolVersion.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Parsers.ProtocolVersion.protocolVersion -> Prims.string", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.ProtocolVersion.protocolVersion", "FStar.UInt16.t", "Prims.b2t", "Prims.op_Negation", "Parsers.ProtocolVersion.known_protocolVersion_repr", "Prims.string" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let string_of_protocolVersion =", "completed_definiton": "function\n| SSL_3p0 -> \"SSL_3p0\"\n| TLS_1p0 -> \"TLS_1p0\"\n| TLS_1p1 -> \"TLS_1p1\"\n| TLS_1p2 -> \"TLS_1p2\"\n| TLS_1p3 -> \"TLS_1p3\"\n| Unknown_protocolVersion _ -> \"Unknown_protocolVersion\"", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fsti", "name": "Parsers.ProtocolVersion.protocolVersion_validator", "original_source_type": "val protocolVersion_validator:LL.validator protocolVersion_parser", "source_type": "val protocolVersion_validator:LL.validator protocolVersion_parser", "source_definition": "let protocolVersion_validator: LL.validator protocolVersion_parser = LL.validate_total_constant_size protocolVersion_parser 2uL ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 57, "start_col": 69, "end_line": 57, "end_col": 130 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet protocolVersion_repr = U16.t\ninline_for_extraction let protocolVersion_repr_eq (x1 x2: protocolVersion_repr) : Tot bool = (x1 = x2)\nlet known_protocolVersion_repr (v:U16.t) : bool = v `protocolVersion_repr_eq` 768us || (v `protocolVersion_repr_eq` 769us || (v `protocolVersion_repr_eq` 770us || (v `protocolVersion_repr_eq` 771us || (v `protocolVersion_repr_eq` 772us || (false)))))\n\ntype protocolVersion =\n | SSL_3p0\n | TLS_1p0\n | TLS_1p1\n | TLS_1p2\n | TLS_1p3\n | Unknown_protocolVersion of (v:U16.t{not (known_protocolVersion_repr v)})\n\nlet string_of_protocolVersion = function\n | SSL_3p0 -> \"SSL_3p0\"\n | TLS_1p0 -> \"TLS_1p0\"\n | TLS_1p1 -> \"TLS_1p1\"\n | TLS_1p2 -> \"TLS_1p2\"\n | TLS_1p3 -> \"TLS_1p3\"\n | Unknown_protocolVersion _ -> \"Unknown_protocolVersion\"\n\ninline_for_extraction noextract let protocolVersion_parser_kind = LP.strong_parser_kind 2 2 (Some LP.ParserKindMetadataTotal)\n\nnoextract val protocolVersion_parser: LP.parser protocolVersion_parser_kind protocolVersion\n\nnoextract val protocolVersion_serializer: LP.serializer protocolVersion_parser\n\nnoextract val protocolVersion_bytesize (x:protocolVersion) : GTot nat\n\nnoextract val protocolVersion_bytesize_eq (x:protocolVersion) : Lemma (protocolVersion_bytesize x == Seq.length (LP.serialize protocolVersion_serializer x))\n\nval protocolVersion_parser32: LS.parser32 protocolVersion_parser\n\nval protocolVersion_serializer32: LS.serializer32 protocolVersion_serializer\n\nval protocolVersion_size32: LSZ.size32 protocolVersion_serializer", "dependencies": { "source_file": "Parsers.ProtocolVersion.fsti", "checked_file": "Parsers.ProtocolVersion.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.ProtocolVersion.protocolVersion_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.validate_total_constant_size", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.ProtocolVersion.protocolVersion", "Parsers.ProtocolVersion.protocolVersion_parser", "FStar.UInt64.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val protocolVersion_validator:LL.validator protocolVersion_parser\nlet protocolVersion_validator:LL.validator protocolVersion_parser =", "completed_definiton": "LL.validate_total_constant_size protocolVersion_parser 2uL ()", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fsti", "name": "Parsers.ProtocolVersion.protocolVersion_jumper", "original_source_type": "val protocolVersion_jumper:LL.jumper protocolVersion_parser", "source_type": "val protocolVersion_jumper:LL.jumper protocolVersion_parser", "source_definition": "let protocolVersion_jumper: LL.jumper protocolVersion_parser = LL.jump_constant_size protocolVersion_parser 2ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 59, "start_col": 63, "end_line": 59, "end_col": 114 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet protocolVersion_repr = U16.t\ninline_for_extraction let protocolVersion_repr_eq (x1 x2: protocolVersion_repr) : Tot bool = (x1 = x2)\nlet known_protocolVersion_repr (v:U16.t) : bool = v `protocolVersion_repr_eq` 768us || (v `protocolVersion_repr_eq` 769us || (v `protocolVersion_repr_eq` 770us || (v `protocolVersion_repr_eq` 771us || (v `protocolVersion_repr_eq` 772us || (false)))))\n\ntype protocolVersion =\n | SSL_3p0\n | TLS_1p0\n | TLS_1p1\n | TLS_1p2\n | TLS_1p3\n | Unknown_protocolVersion of (v:U16.t{not (known_protocolVersion_repr v)})\n\nlet string_of_protocolVersion = function\n | SSL_3p0 -> \"SSL_3p0\"\n | TLS_1p0 -> \"TLS_1p0\"\n | TLS_1p1 -> \"TLS_1p1\"\n | TLS_1p2 -> \"TLS_1p2\"\n | TLS_1p3 -> \"TLS_1p3\"\n | Unknown_protocolVersion _ -> \"Unknown_protocolVersion\"\n\ninline_for_extraction noextract let protocolVersion_parser_kind = LP.strong_parser_kind 2 2 (Some LP.ParserKindMetadataTotal)\n\nnoextract val protocolVersion_parser: LP.parser protocolVersion_parser_kind protocolVersion\n\nnoextract val protocolVersion_serializer: LP.serializer protocolVersion_parser\n\nnoextract val protocolVersion_bytesize (x:protocolVersion) : GTot nat\n\nnoextract val protocolVersion_bytesize_eq (x:protocolVersion) : Lemma (protocolVersion_bytesize x == Seq.length (LP.serialize protocolVersion_serializer x))\n\nval protocolVersion_parser32: LS.parser32 protocolVersion_parser\n\nval protocolVersion_serializer32: LS.serializer32 protocolVersion_serializer\n\nval protocolVersion_size32: LSZ.size32 protocolVersion_serializer\n\nlet protocolVersion_validator: LL.validator protocolVersion_parser = LL.validate_total_constant_size protocolVersion_parser 2uL ()", "dependencies": { "source_file": "Parsers.ProtocolVersion.fsti", "checked_file": "Parsers.ProtocolVersion.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.ProtocolVersion.protocolVersion_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.jump_constant_size", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.ProtocolVersion.protocolVersion", "Parsers.ProtocolVersion.protocolVersion_parser", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val protocolVersion_jumper:LL.jumper protocolVersion_parser\nlet protocolVersion_jumper:LL.jumper protocolVersion_parser =", "completed_definiton": "LL.jump_constant_size protocolVersion_parser 2ul ()", "isa_cross_project_example": true }, { "file_name": "Test.BufferBytes.fst", "name": "Test.BufferBytes.lbuffer", "original_source_type": "", "source_type": "val lbuffer : l: Prims.nat -> Type0", "source_definition": "let lbuffer (l:nat) = b:Buffer.buffer UInt8.t {Buffer.length b == l}", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Test.BufferBytes.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 12, "start_col": 22, "end_line": 12, "end_col": 68 }, "file_context": "module Test.BufferBytes\n\nopen FStar.Bytes\nopen FStar.Error\nopen FStar.Printf\nopen FStar.HyperStack\nopen FStar.HyperStack.IO\nopen FStar.HyperStack.ST\n\nmodule BB = BufferBytes", "dependencies": { "source_file": "Test.BufferBytes.fst", "checked_file": "Test.BufferBytes.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.IO.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Error.fst.checked", "FStar.Bytes.fsti.checked", "FStar.Buffer.fst.checked", "C.fst.checked", "BufferBytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "BB", "full_module": "BufferBytes" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.IO" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Printf" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Test" }, { "abbrev": false, "short_module": null, "full_module": "Test" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "l: Prims.nat -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "FStar.Buffer.buffer", "FStar.UInt8.t", "Prims.eq2", "FStar.Buffer.length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let lbuffer (l: nat) =", "completed_definiton": "b: Buffer.buffer UInt8.t {Buffer.length b == l}", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fsti", "name": "Parsers.Boolean.boolean_parser_kind", "original_source_type": "", "source_type": "val boolean_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let boolean_parser_kind = LP.strong_parser_kind 1 1 None", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 29, "start_col": 58, "end_line": 29, "end_col": 88 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ntype boolean =\n | B_false\n | B_true\n\nlet string_of_boolean = function\n | B_false -> \"b_false\"\n | B_true -> \"b_true\"", "dependencies": { "source_file": "Parsers.Boolean.fsti", "checked_file": "Parsers.Boolean.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let boolean_parser_kind =", "completed_definiton": "LP.strong_parser_kind 1 1 None", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fsti", "name": "Parsers.Boolean.string_of_boolean", "original_source_type": "", "source_type": "val string_of_boolean : _: Parsers.Boolean.boolean -> Prims.string", "source_definition": "let string_of_boolean = function\n | B_false -> \"b_false\"\n | B_true -> \"b_true\"", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 25, "start_col": 24, "end_line": 27, "end_col": 22 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ntype boolean =\n | B_false\n | B_true", "dependencies": { "source_file": "Parsers.Boolean.fsti", "checked_file": "Parsers.Boolean.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Parsers.Boolean.boolean -> Prims.string", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.Boolean.boolean", "Prims.string" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let string_of_boolean =", "completed_definiton": "function\n| B_false -> \"b_false\"\n| B_true -> \"b_true\"", "isa_cross_project_example": true }, { "file_name": "Parsers.Boolean.fsti", "name": "Parsers.Boolean.boolean_jumper", "original_source_type": "val boolean_jumper:LL.jumper boolean_parser", "source_type": "val boolean_jumper:LL.jumper boolean_parser", "source_definition": "let boolean_jumper: LL.jumper boolean_parser = LL.jump_constant_size boolean_parser 1ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Boolean.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 47, "start_col": 47, "end_line": 47, "end_col": 90 }, "file_context": "module Parsers.Boolean\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ntype boolean =\n | B_false\n | B_true\n\nlet string_of_boolean = function\n | B_false -> \"b_false\"\n | B_true -> \"b_true\"\n\ninline_for_extraction noextract let boolean_parser_kind = LP.strong_parser_kind 1 1 None\n\nnoextract val boolean_parser: LP.parser boolean_parser_kind boolean\n\nnoextract val boolean_serializer: LP.serializer boolean_parser\n\nnoextract val boolean_bytesize (x:boolean) : GTot nat\n\nnoextract val boolean_bytesize_eq (x:boolean) : Lemma (boolean_bytesize x == Seq.length (LP.serialize boolean_serializer x))\n\nval boolean_parser32: LS.parser32 boolean_parser\n\nval boolean_serializer32: LS.serializer32 boolean_serializer\n\nval boolean_size32: LSZ.size32 boolean_serializer\n\nval boolean_validator: LL.validator boolean_parser", "dependencies": { "source_file": "Parsers.Boolean.fsti", "checked_file": "Parsers.Boolean.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.Boolean.boolean_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.jump_constant_size", "Parsers.Boolean.boolean_parser_kind", "Parsers.Boolean.boolean", "Parsers.Boolean.boolean_parser", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val boolean_jumper:LL.jumper boolean_parser\nlet boolean_jumper:LL.jumper boolean_parser =", "completed_definiton": "LL.jump_constant_size boolean_parser 1ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.signatureScheme_repr_validator", "original_source_type": "", "source_type": "val signatureScheme_repr_validator : LowParse.Low.Base.validator LowParse.Spec.Int.parse_u16", "source_definition": "let signatureScheme_repr_validator = (LL.validate_u16 ())", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 61, "start_col": 69, "end_line": 61, "end_col": 89 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator LowParse.Spec.Int.parse_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.validate_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let signatureScheme_repr_validator =", "completed_definiton": "(LL.validate_u16 ())", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.signatureScheme_bytesize", "original_source_type": "val signatureScheme_bytesize (x:signatureScheme) : GTot nat", "source_type": "val signatureScheme_bytesize (x:signatureScheme) : GTot nat", "source_definition": "let signatureScheme_bytesize (x:signatureScheme) : GTot nat = Seq.length (signatureScheme_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 121, "start_col": 62, "end_line": 121, "end_col": 103 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let signatureScheme_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let signatureScheme_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_signatureScheme (x:LP.maybe_enum_key signatureScheme_enum) : signatureScheme = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n Unknown_signatureScheme v\n\ninline_for_extraction let synth_signatureScheme_inv (x:signatureScheme) : LP.maybe_enum_key signatureScheme_enum = \n match x with\n | Unknown_signatureScheme y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : signatureScheme = x in\n [@inline_let] let _ : squash(not (Unknown_signatureScheme? x1) ==> LP.list_mem x1 (LP.list_map fst signatureScheme_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key signatureScheme_enum)\n\nlet lemma_synth_signatureScheme_inv' () : Lemma\n (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme)\n= LP.forall_maybe_enum_key signatureScheme_enum (fun x -> synth_signatureScheme_inv (synth_signatureScheme x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_signatureScheme_inj () : Lemma\n (LP.synth_injective synth_signatureScheme) = \n lemma_synth_signatureScheme_inv' ();\n LP.synth_inverse_synth_injective synth_signatureScheme synth_signatureScheme_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_signatureScheme_inv () : Lemma\n (LP.synth_inverse synth_signatureScheme synth_signatureScheme_inv) = allow_inversion signatureScheme; ()\n\n#pop-options\nnoextract let parse_maybe_signatureScheme_key : LP.parser _ (LP.maybe_enum_key signatureScheme_enum) =\n LP.parse_maybe_enum_key signatureScheme_repr_parser signatureScheme_enum\n\nnoextract let serialize_maybe_signatureScheme_key : LP.serializer parse_maybe_signatureScheme_key =\n LP.serialize_maybe_enum_key signatureScheme_repr_parser signatureScheme_repr_serializer signatureScheme_enum\n\nnoextract let signatureScheme_parser : LP.parser _ signatureScheme =\n lemma_synth_signatureScheme_inj ();\n parse_maybe_signatureScheme_key `LP.parse_synth` synth_signatureScheme\n\nnoextract let signatureScheme_serializer : LP.serializer signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LP.serialize_synth _ synth_signatureScheme serialize_maybe_signatureScheme_key synth_signatureScheme_inv ()", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.SignatureScheme.signatureScheme -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.SignatureScheme.signatureScheme", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.SignatureScheme.signatureScheme_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureScheme_bytesize (x:signatureScheme) : GTot nat\nlet signatureScheme_bytesize (x: signatureScheme) : GTot nat =", "completed_definiton": "Seq.length (signatureScheme_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.signatureScheme_repr_parser32", "original_source_type": "", "source_type": "val signatureScheme_repr_parser32 : LowParse.SLow.Base.parser32 LowParse.Spec.Int.parse_u16", "source_definition": "let signatureScheme_repr_parser32 = LS.parse32_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 55, "start_col": 68, "end_line": 55, "end_col": 82 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 LowParse.Spec.Int.parse_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.parse32_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let signatureScheme_repr_parser32 =", "completed_definiton": "LS.parse32_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.signatureScheme_repr_serializer32", "original_source_type": "", "source_type": "val signatureScheme_repr_serializer32 : LowParse.SLow.Base.serializer32 LowParse.Spec.Int.serialize_u16", "source_definition": "let signatureScheme_repr_serializer32 = LS.serialize32_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 57, "start_col": 72, "end_line": 57, "end_col": 90 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 LowParse.Spec.Int.serialize_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.serialize32_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let signatureScheme_repr_serializer32 =", "completed_definiton": "LS.serialize32_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.signatureScheme_repr_parser", "original_source_type": "", "source_type": "val signatureScheme_repr_parser : LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u16_kind FStar.UInt16.t", "source_definition": "let signatureScheme_repr_parser = LPI.parse_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 51, "start_col": 44, "end_line": 51, "end_col": 57 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u16_kind FStar.UInt16.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Int.parse_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let signatureScheme_repr_parser =", "completed_definiton": "LPI.parse_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.signatureScheme_repr_size32", "original_source_type": "", "source_type": "val signatureScheme_repr_size32 : LowParse.SLow.Base.size32 LowParse.Spec.Int.serialize_u16", "source_definition": "let signatureScheme_repr_size32 = LSZ.size32_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 59, "start_col": 66, "end_line": 59, "end_col": 80 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 LowParse.Spec.Int.serialize_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.size32_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let signatureScheme_repr_size32 =", "completed_definiton": "LSZ.size32_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.signatureScheme_repr_writer", "original_source_type": "", "source_type": "val signatureScheme_repr_writer : LowParse.Low.Base.leaf_writer_strong LowParse.Spec.Int.serialize_u16", "source_definition": "let signatureScheme_repr_writer = LL.write_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 67, "start_col": 66, "end_line": 67, "end_col": 78 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let signatureScheme_repr_reader = LL.read_u16", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong LowParse.Spec.Int.serialize_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.write_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let signatureScheme_repr_writer =", "completed_definiton": "LL.write_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.signatureScheme_repr_serializer", "original_source_type": "", "source_type": "val signatureScheme_repr_serializer : LowParse.Spec.Base.serializer LowParse.Spec.Int.parse_u16", "source_definition": "let signatureScheme_repr_serializer = LPI.serialize_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 53, "start_col": 48, "end_line": 53, "end_col": 65 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer LowParse.Spec.Int.parse_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Int.serialize_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let signatureScheme_repr_serializer =", "completed_definiton": "LPI.serialize_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.signatureScheme_repr_reader", "original_source_type": "", "source_type": "val signatureScheme_repr_reader : LowParse.Low.Base.leaf_reader LowParse.Spec.Int.parse_u16", "source_definition": "let signatureScheme_repr_reader = LL.read_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 65, "start_col": 66, "end_line": 65, "end_col": 77 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader LowParse.Spec.Int.parse_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.read_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let signatureScheme_repr_reader =", "completed_definiton": "LL.read_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.signatureScheme_repr_jumper", "original_source_type": "", "source_type": "val signatureScheme_repr_jumper : LowParse.Low.Base.jumper LowParse.Spec.Int.parse_u16", "source_definition": "let signatureScheme_repr_jumper = LL.jump_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 63, "start_col": 66, "end_line": 63, "end_col": 77 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper LowParse.Spec.Int.parse_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.jump_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let signatureScheme_repr_jumper =", "completed_definiton": "LL.jump_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.signatureScheme_enum", "original_source_type": "val signatureScheme_enum:LP.enum signatureScheme U16.t", "source_type": "val signatureScheme_enum:LP.enum signatureScheme U16.t", "source_definition": "let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 24, "start_col": 2, "end_line": 49, "end_col": 6 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Enum.enum Parsers.SignatureScheme.signatureScheme FStar.UInt16.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.b2t", "FStar.List.Tot.Base.noRepeats", "FStar.UInt16.t", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "Parsers.SignatureScheme.signatureScheme", "FStar.Pervasives.Native.snd", "FStar.Pervasives.Native.fst", "Prims.list", "Prims.Cons", "FStar.Pervasives.Native.Mktuple2", "Parsers.SignatureScheme.Rsa_pkcs1_md5", "FStar.UInt16.__uint_to_t", "Parsers.SignatureScheme.Rsa_pkcs1_sha1", "Parsers.SignatureScheme.Ecdsa_md5", "Parsers.SignatureScheme.Ecdsa_sha1", "Parsers.SignatureScheme.Rsa_pkcs1_sha256", "Parsers.SignatureScheme.Rsa_pkcs1_sha384", "Parsers.SignatureScheme.Rsa_pkcs1_sha512", "Parsers.SignatureScheme.Ecdsa_secp256r1_sha256", "Parsers.SignatureScheme.Ecdsa_secp384r1_sha384", "Parsers.SignatureScheme.Ecdsa_secp521r1_sha512", "Parsers.SignatureScheme.Rsa_pss_rsae_sha256", "Parsers.SignatureScheme.Rsa_pss_rsae_sha384", "Parsers.SignatureScheme.Rsa_pss_rsae_sha512", "Parsers.SignatureScheme.Ed25519", "Parsers.SignatureScheme.Ed448", "Parsers.SignatureScheme.Rsa_pss_pss_sha256", "Parsers.SignatureScheme.Rsa_pss_pss_sha384", "Parsers.SignatureScheme.Rsa_pss_pss_sha512", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureScheme_enum:LP.enum signatureScheme U16.t\nlet signatureScheme_enum:LP.enum signatureScheme U16.t =", "completed_definiton": "[@@ inline_let ]let e =\n [\n Rsa_pkcs1_md5, 257us; Rsa_pkcs1_sha1, 513us; Ecdsa_md5, 259us; Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us; Rsa_pkcs1_sha384, 1281us; Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us; Ecdsa_secp384r1_sha384, 1283us; Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us; Rsa_pss_rsae_sha384, 2053us; Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us; Ed448, 2056us; Rsa_pss_pss_sha256, 2057us; Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us\n ]\nin\n[@@ inline_let ]let _ = assert_norm (L.noRepeats (LP.list_map fst e)) in\n[@@ inline_let ]let _ = assert_norm (L.noRepeats (LP.list_map snd e)) in\ne", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.signatureScheme_size32", "original_source_type": "val signatureScheme_size32: LSZ.size32 signatureScheme_serializer", "source_type": "val signatureScheme_size32: LSZ.size32 signatureScheme_serializer", "source_definition": "let signatureScheme_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond signatureScheme_serializer 2ul) in\n LSZ.size32_constant signatureScheme_serializer 2ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 142, "start_col": 2, "end_line": 143, "end_col": 55 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let signatureScheme_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let signatureScheme_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_signatureScheme (x:LP.maybe_enum_key signatureScheme_enum) : signatureScheme = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n Unknown_signatureScheme v\n\ninline_for_extraction let synth_signatureScheme_inv (x:signatureScheme) : LP.maybe_enum_key signatureScheme_enum = \n match x with\n | Unknown_signatureScheme y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : signatureScheme = x in\n [@inline_let] let _ : squash(not (Unknown_signatureScheme? x1) ==> LP.list_mem x1 (LP.list_map fst signatureScheme_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key signatureScheme_enum)\n\nlet lemma_synth_signatureScheme_inv' () : Lemma\n (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme)\n= LP.forall_maybe_enum_key signatureScheme_enum (fun x -> synth_signatureScheme_inv (synth_signatureScheme x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_signatureScheme_inj () : Lemma\n (LP.synth_injective synth_signatureScheme) = \n lemma_synth_signatureScheme_inv' ();\n LP.synth_inverse_synth_injective synth_signatureScheme synth_signatureScheme_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_signatureScheme_inv () : Lemma\n (LP.synth_inverse synth_signatureScheme synth_signatureScheme_inv) = allow_inversion signatureScheme; ()\n\n#pop-options\nnoextract let parse_maybe_signatureScheme_key : LP.parser _ (LP.maybe_enum_key signatureScheme_enum) =\n LP.parse_maybe_enum_key signatureScheme_repr_parser signatureScheme_enum\n\nnoextract let serialize_maybe_signatureScheme_key : LP.serializer parse_maybe_signatureScheme_key =\n LP.serialize_maybe_enum_key signatureScheme_repr_parser signatureScheme_repr_serializer signatureScheme_enum\n\nnoextract let signatureScheme_parser : LP.parser _ signatureScheme =\n lemma_synth_signatureScheme_inj ();\n parse_maybe_signatureScheme_key `LP.parse_synth` synth_signatureScheme\n\nnoextract let signatureScheme_serializer : LP.serializer signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LP.serialize_synth _ synth_signatureScheme serialize_maybe_signatureScheme_key synth_signatureScheme_inv ()\n\nlet signatureScheme_bytesize (x:signatureScheme) : GTot nat = Seq.length (signatureScheme_serializer x)\n\nlet signatureScheme_bytesize_eq x = ()\n\nlet parse32_maybe_signatureScheme_key : LS.parser32 parse_maybe_signatureScheme_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac signatureScheme_repr_parser32 signatureScheme_enum)\n\nlet signatureScheme_parser32 : LS.parser32 signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n LS.parse32_synth _ synth_signatureScheme (fun x->synth_signatureScheme x) parse32_maybe_signatureScheme_key ()\n\nlet serialize32_maybe_signatureScheme_key : LS.serializer32 serialize_maybe_signatureScheme_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n signatureScheme_repr_serializer32 signatureScheme_enum)\n\nlet signatureScheme_serializer32 : LS.serializer32 signatureScheme_serializer =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LS.serialize32_synth _ synth_signatureScheme _ serialize32_maybe_signatureScheme_key synth_signatureScheme_inv (fun x->synth_signatureScheme_inv x) ()", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.SignatureScheme.signatureScheme_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Base.size32_constant", "Parsers.SignatureScheme.signatureScheme_parser_kind", "Parsers.SignatureScheme.signatureScheme", "Parsers.SignatureScheme.signatureScheme_parser", "Parsers.SignatureScheme.signatureScheme_serializer", "FStar.UInt32.__uint_to_t", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.SLow.Base.size32_constant_precond" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureScheme_size32: LSZ.size32 signatureScheme_serializer\nlet signatureScheme_size32 =", "completed_definiton": "[@@ inline_let ]let _ = assert_norm (LSZ.size32_constant_precond signatureScheme_serializer 2ul) in\nLSZ.size32_constant signatureScheme_serializer 2ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.signatureScheme_serializer", "original_source_type": "val signatureScheme_serializer: LP.serializer signatureScheme_parser", "source_type": "val signatureScheme_serializer: LP.serializer signatureScheme_parser", "source_definition": "let signatureScheme_serializer : LP.serializer signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LP.serialize_synth _ synth_signatureScheme serialize_maybe_signatureScheme_key synth_signatureScheme_inv ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 117, "start_col": 2, "end_line": 119, "end_col": 109 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let signatureScheme_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let signatureScheme_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_signatureScheme (x:LP.maybe_enum_key signatureScheme_enum) : signatureScheme = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n Unknown_signatureScheme v\n\ninline_for_extraction let synth_signatureScheme_inv (x:signatureScheme) : LP.maybe_enum_key signatureScheme_enum = \n match x with\n | Unknown_signatureScheme y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : signatureScheme = x in\n [@inline_let] let _ : squash(not (Unknown_signatureScheme? x1) ==> LP.list_mem x1 (LP.list_map fst signatureScheme_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key signatureScheme_enum)\n\nlet lemma_synth_signatureScheme_inv' () : Lemma\n (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme)\n= LP.forall_maybe_enum_key signatureScheme_enum (fun x -> synth_signatureScheme_inv (synth_signatureScheme x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_signatureScheme_inj () : Lemma\n (LP.synth_injective synth_signatureScheme) = \n lemma_synth_signatureScheme_inv' ();\n LP.synth_inverse_synth_injective synth_signatureScheme synth_signatureScheme_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_signatureScheme_inv () : Lemma\n (LP.synth_inverse synth_signatureScheme synth_signatureScheme_inv) = allow_inversion signatureScheme; ()\n\n#pop-options\nnoextract let parse_maybe_signatureScheme_key : LP.parser _ (LP.maybe_enum_key signatureScheme_enum) =\n LP.parse_maybe_enum_key signatureScheme_repr_parser signatureScheme_enum\n\nnoextract let serialize_maybe_signatureScheme_key : LP.serializer parse_maybe_signatureScheme_key =\n LP.serialize_maybe_enum_key signatureScheme_repr_parser signatureScheme_repr_serializer signatureScheme_enum\n\nnoextract let signatureScheme_parser : LP.parser _ signatureScheme =\n lemma_synth_signatureScheme_inj ();\n parse_maybe_signatureScheme_key `LP.parse_synth` synth_signatureScheme", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.SignatureScheme.signatureScheme_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_synth", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.SignatureScheme.signatureScheme", "FStar.UInt16.t", "Parsers.SignatureScheme.signatureScheme_enum", "Parsers.SignatureScheme.parse_maybe_signatureScheme_key", "Parsers.SignatureScheme.synth_signatureScheme", "Parsers.SignatureScheme.serialize_maybe_signatureScheme_key", "Parsers.SignatureScheme.synth_signatureScheme_inv", "Prims.unit", "Parsers.SignatureScheme.lemma_synth_signatureScheme_inv", "Parsers.SignatureScheme.lemma_synth_signatureScheme_inj", "LowParse.Spec.Base.serializer", "Parsers.SignatureScheme.signatureScheme_parser_kind", "Parsers.SignatureScheme.signatureScheme_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureScheme_serializer: LP.serializer signatureScheme_parser\nlet signatureScheme_serializer:LP.serializer signatureScheme_parser =", "completed_definiton": "lemma_synth_signatureScheme_inj ();\nlemma_synth_signatureScheme_inv ();\nLP.serialize_synth _\n synth_signatureScheme\n serialize_maybe_signatureScheme_key\n synth_signatureScheme_inv\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.signatureScheme_serializer32", "original_source_type": "val signatureScheme_serializer32: LS.serializer32 signatureScheme_serializer", "source_type": "val signatureScheme_serializer32: LS.serializer32 signatureScheme_serializer", "source_definition": "let signatureScheme_serializer32 : LS.serializer32 signatureScheme_serializer =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LS.serialize32_synth _ synth_signatureScheme _ serialize32_maybe_signatureScheme_key synth_signatureScheme_inv (fun x->synth_signatureScheme_inv x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 137, "start_col": 2, "end_line": 139, "end_col": 152 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let signatureScheme_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let signatureScheme_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_signatureScheme (x:LP.maybe_enum_key signatureScheme_enum) : signatureScheme = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n Unknown_signatureScheme v\n\ninline_for_extraction let synth_signatureScheme_inv (x:signatureScheme) : LP.maybe_enum_key signatureScheme_enum = \n match x with\n | Unknown_signatureScheme y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : signatureScheme = x in\n [@inline_let] let _ : squash(not (Unknown_signatureScheme? x1) ==> LP.list_mem x1 (LP.list_map fst signatureScheme_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key signatureScheme_enum)\n\nlet lemma_synth_signatureScheme_inv' () : Lemma\n (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme)\n= LP.forall_maybe_enum_key signatureScheme_enum (fun x -> synth_signatureScheme_inv (synth_signatureScheme x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_signatureScheme_inj () : Lemma\n (LP.synth_injective synth_signatureScheme) = \n lemma_synth_signatureScheme_inv' ();\n LP.synth_inverse_synth_injective synth_signatureScheme synth_signatureScheme_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_signatureScheme_inv () : Lemma\n (LP.synth_inverse synth_signatureScheme synth_signatureScheme_inv) = allow_inversion signatureScheme; ()\n\n#pop-options\nnoextract let parse_maybe_signatureScheme_key : LP.parser _ (LP.maybe_enum_key signatureScheme_enum) =\n LP.parse_maybe_enum_key signatureScheme_repr_parser signatureScheme_enum\n\nnoextract let serialize_maybe_signatureScheme_key : LP.serializer parse_maybe_signatureScheme_key =\n LP.serialize_maybe_enum_key signatureScheme_repr_parser signatureScheme_repr_serializer signatureScheme_enum\n\nnoextract let signatureScheme_parser : LP.parser _ signatureScheme =\n lemma_synth_signatureScheme_inj ();\n parse_maybe_signatureScheme_key `LP.parse_synth` synth_signatureScheme\n\nnoextract let signatureScheme_serializer : LP.serializer signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LP.serialize_synth _ synth_signatureScheme serialize_maybe_signatureScheme_key synth_signatureScheme_inv ()\n\nlet signatureScheme_bytesize (x:signatureScheme) : GTot nat = Seq.length (signatureScheme_serializer x)\n\nlet signatureScheme_bytesize_eq x = ()\n\nlet parse32_maybe_signatureScheme_key : LS.parser32 parse_maybe_signatureScheme_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac signatureScheme_repr_parser32 signatureScheme_enum)\n\nlet signatureScheme_parser32 : LS.parser32 signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n LS.parse32_synth _ synth_signatureScheme (fun x->synth_signatureScheme x) parse32_maybe_signatureScheme_key ()\n\nlet serialize32_maybe_signatureScheme_key : LS.serializer32 serialize_maybe_signatureScheme_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n signatureScheme_repr_serializer32 signatureScheme_enum)", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.SignatureScheme.signatureScheme_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_synth", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.SignatureScheme.signatureScheme", "FStar.UInt16.t", "Parsers.SignatureScheme.signatureScheme_enum", "Parsers.SignatureScheme.parse_maybe_signatureScheme_key", "Parsers.SignatureScheme.synth_signatureScheme", "Parsers.SignatureScheme.serialize_maybe_signatureScheme_key", "Parsers.SignatureScheme.serialize32_maybe_signatureScheme_key", "Parsers.SignatureScheme.synth_signatureScheme_inv", "Prims.eq2", "Prims.unit", "Parsers.SignatureScheme.lemma_synth_signatureScheme_inv", "Parsers.SignatureScheme.lemma_synth_signatureScheme_inj", "LowParse.SLow.Base.serializer32", "Parsers.SignatureScheme.signatureScheme_parser_kind", "Parsers.SignatureScheme.signatureScheme_parser", "Parsers.SignatureScheme.signatureScheme_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureScheme_serializer32: LS.serializer32 signatureScheme_serializer\nlet signatureScheme_serializer32:LS.serializer32 signatureScheme_serializer =", "completed_definiton": "lemma_synth_signatureScheme_inj ();\nlemma_synth_signatureScheme_inv ();\nLS.serialize32_synth _\n synth_signatureScheme\n _\n serialize32_maybe_signatureScheme_key\n synth_signatureScheme_inv\n (fun x -> synth_signatureScheme_inv x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.signatureScheme_parser32", "original_source_type": "val signatureScheme_parser32: LS.parser32 signatureScheme_parser", "source_type": "val signatureScheme_parser32: LS.parser32 signatureScheme_parser", "source_definition": "let signatureScheme_parser32 : LS.parser32 signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n LS.parse32_synth _ synth_signatureScheme (fun x->synth_signatureScheme x) parse32_maybe_signatureScheme_key ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 129, "start_col": 2, "end_line": 130, "end_col": 112 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let signatureScheme_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let signatureScheme_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_signatureScheme (x:LP.maybe_enum_key signatureScheme_enum) : signatureScheme = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n Unknown_signatureScheme v\n\ninline_for_extraction let synth_signatureScheme_inv (x:signatureScheme) : LP.maybe_enum_key signatureScheme_enum = \n match x with\n | Unknown_signatureScheme y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : signatureScheme = x in\n [@inline_let] let _ : squash(not (Unknown_signatureScheme? x1) ==> LP.list_mem x1 (LP.list_map fst signatureScheme_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key signatureScheme_enum)\n\nlet lemma_synth_signatureScheme_inv' () : Lemma\n (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme)\n= LP.forall_maybe_enum_key signatureScheme_enum (fun x -> synth_signatureScheme_inv (synth_signatureScheme x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_signatureScheme_inj () : Lemma\n (LP.synth_injective synth_signatureScheme) = \n lemma_synth_signatureScheme_inv' ();\n LP.synth_inverse_synth_injective synth_signatureScheme synth_signatureScheme_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_signatureScheme_inv () : Lemma\n (LP.synth_inverse synth_signatureScheme synth_signatureScheme_inv) = allow_inversion signatureScheme; ()\n\n#pop-options\nnoextract let parse_maybe_signatureScheme_key : LP.parser _ (LP.maybe_enum_key signatureScheme_enum) =\n LP.parse_maybe_enum_key signatureScheme_repr_parser signatureScheme_enum\n\nnoextract let serialize_maybe_signatureScheme_key : LP.serializer parse_maybe_signatureScheme_key =\n LP.serialize_maybe_enum_key signatureScheme_repr_parser signatureScheme_repr_serializer signatureScheme_enum\n\nnoextract let signatureScheme_parser : LP.parser _ signatureScheme =\n lemma_synth_signatureScheme_inj ();\n parse_maybe_signatureScheme_key `LP.parse_synth` synth_signatureScheme\n\nnoextract let signatureScheme_serializer : LP.serializer signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LP.serialize_synth _ synth_signatureScheme serialize_maybe_signatureScheme_key synth_signatureScheme_inv ()\n\nlet signatureScheme_bytesize (x:signatureScheme) : GTot nat = Seq.length (signatureScheme_serializer x)\n\nlet signatureScheme_bytesize_eq x = ()\n\nlet parse32_maybe_signatureScheme_key : LS.parser32 parse_maybe_signatureScheme_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac signatureScheme_repr_parser32 signatureScheme_enum)", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.SignatureScheme.signatureScheme_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_synth", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.SignatureScheme.signatureScheme", "FStar.UInt16.t", "Parsers.SignatureScheme.signatureScheme_enum", "Parsers.SignatureScheme.parse_maybe_signatureScheme_key", "Parsers.SignatureScheme.synth_signatureScheme", "Prims.eq2", "Parsers.SignatureScheme.parse32_maybe_signatureScheme_key", "Prims.unit", "Parsers.SignatureScheme.lemma_synth_signatureScheme_inj", "LowParse.SLow.Base.parser32", "Parsers.SignatureScheme.signatureScheme_parser_kind", "Parsers.SignatureScheme.signatureScheme_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureScheme_parser32: LS.parser32 signatureScheme_parser\nlet signatureScheme_parser32:LS.parser32 signatureScheme_parser =", "completed_definiton": "lemma_synth_signatureScheme_inj ();\nLS.parse32_synth _\n synth_signatureScheme\n (fun x -> synth_signatureScheme x)\n parse32_maybe_signatureScheme_key\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.read_maybe_signatureScheme_key", "original_source_type": "val read_maybe_signatureScheme_key:LL.leaf_reader parse_maybe_signatureScheme_key", "source_type": "val read_maybe_signatureScheme_key:LL.leaf_reader parse_maybe_signatureScheme_key", "source_definition": "let read_maybe_signatureScheme_key : LL.leaf_reader parse_maybe_signatureScheme_key =\n LL.mk_read_maybe_enum_key signatureScheme_repr_reader signatureScheme_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 147, "start_col": 4, "end_line": 147, "end_col": 78 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let signatureScheme_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let signatureScheme_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_signatureScheme (x:LP.maybe_enum_key signatureScheme_enum) : signatureScheme = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n Unknown_signatureScheme v\n\ninline_for_extraction let synth_signatureScheme_inv (x:signatureScheme) : LP.maybe_enum_key signatureScheme_enum = \n match x with\n | Unknown_signatureScheme y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : signatureScheme = x in\n [@inline_let] let _ : squash(not (Unknown_signatureScheme? x1) ==> LP.list_mem x1 (LP.list_map fst signatureScheme_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key signatureScheme_enum)\n\nlet lemma_synth_signatureScheme_inv' () : Lemma\n (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme)\n= LP.forall_maybe_enum_key signatureScheme_enum (fun x -> synth_signatureScheme_inv (synth_signatureScheme x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_signatureScheme_inj () : Lemma\n (LP.synth_injective synth_signatureScheme) = \n lemma_synth_signatureScheme_inv' ();\n LP.synth_inverse_synth_injective synth_signatureScheme synth_signatureScheme_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_signatureScheme_inv () : Lemma\n (LP.synth_inverse synth_signatureScheme synth_signatureScheme_inv) = allow_inversion signatureScheme; ()\n\n#pop-options\nnoextract let parse_maybe_signatureScheme_key : LP.parser _ (LP.maybe_enum_key signatureScheme_enum) =\n LP.parse_maybe_enum_key signatureScheme_repr_parser signatureScheme_enum\n\nnoextract let serialize_maybe_signatureScheme_key : LP.serializer parse_maybe_signatureScheme_key =\n LP.serialize_maybe_enum_key signatureScheme_repr_parser signatureScheme_repr_serializer signatureScheme_enum\n\nnoextract let signatureScheme_parser : LP.parser _ signatureScheme =\n lemma_synth_signatureScheme_inj ();\n parse_maybe_signatureScheme_key `LP.parse_synth` synth_signatureScheme\n\nnoextract let signatureScheme_serializer : LP.serializer signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LP.serialize_synth _ synth_signatureScheme serialize_maybe_signatureScheme_key synth_signatureScheme_inv ()\n\nlet signatureScheme_bytesize (x:signatureScheme) : GTot nat = Seq.length (signatureScheme_serializer x)\n\nlet signatureScheme_bytesize_eq x = ()\n\nlet parse32_maybe_signatureScheme_key : LS.parser32 parse_maybe_signatureScheme_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac signatureScheme_repr_parser32 signatureScheme_enum)\n\nlet signatureScheme_parser32 : LS.parser32 signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n LS.parse32_synth _ synth_signatureScheme (fun x->synth_signatureScheme x) parse32_maybe_signatureScheme_key ()\n\nlet serialize32_maybe_signatureScheme_key : LS.serializer32 serialize_maybe_signatureScheme_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n signatureScheme_repr_serializer32 signatureScheme_enum)\n\nlet signatureScheme_serializer32 : LS.serializer32 signatureScheme_serializer =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LS.serialize32_synth _ synth_signatureScheme _ serialize32_maybe_signatureScheme_key synth_signatureScheme_inv (fun x->synth_signatureScheme_inv x) ()\n\nlet signatureScheme_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond signatureScheme_serializer 2ul) in\n LSZ.size32_constant signatureScheme_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader Parsers.SignatureScheme.parse_maybe_signatureScheme_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.read_maybe_enum_key", "Parsers.SignatureScheme.signatureScheme", "FStar.UInt16.t", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Int.parse_u16", "Parsers.SignatureScheme.signatureScheme_repr_reader", "Prims.Cons", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.Mktuple2", "Parsers.SignatureScheme.Rsa_pkcs1_md5", "FStar.UInt16.__uint_to_t", "Parsers.SignatureScheme.Rsa_pkcs1_sha1", "Parsers.SignatureScheme.Ecdsa_md5", "Parsers.SignatureScheme.Ecdsa_sha1", "Parsers.SignatureScheme.Rsa_pkcs1_sha256", "Parsers.SignatureScheme.Rsa_pkcs1_sha384", "Parsers.SignatureScheme.Rsa_pkcs1_sha512", "Parsers.SignatureScheme.Ecdsa_secp256r1_sha256", "Parsers.SignatureScheme.Ecdsa_secp384r1_sha384", "Parsers.SignatureScheme.Ecdsa_secp521r1_sha512", "Parsers.SignatureScheme.Rsa_pss_rsae_sha256", "Parsers.SignatureScheme.Rsa_pss_rsae_sha384", "Parsers.SignatureScheme.Rsa_pss_rsae_sha512", "Parsers.SignatureScheme.Ed25519", "Parsers.SignatureScheme.Ed448", "Parsers.SignatureScheme.Rsa_pss_pss_sha256", "Parsers.SignatureScheme.Rsa_pss_pss_sha384", "Parsers.SignatureScheme.Rsa_pss_pss_sha512", "Prims.Nil", "LowParse.Spec.Enum.maybe_enum_destr_t_intro", "LowParse.Spec.Enum.maybe_enum_key", "LowParse.Spec.Enum.maybe_enum_destr_cons", "LowParse.Spec.Enum.maybe_enum_destr_nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_maybe_signatureScheme_key:LL.leaf_reader parse_maybe_signatureScheme_key\nlet read_maybe_signatureScheme_key:LL.leaf_reader parse_maybe_signatureScheme_key =", "completed_definiton": "LL.mk_read_maybe_enum_key signatureScheme_repr_reader signatureScheme_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.serialize_maybe_signatureScheme_key", "original_source_type": "val serialize_maybe_signatureScheme_key:LP.serializer parse_maybe_signatureScheme_key", "source_type": "val serialize_maybe_signatureScheme_key:LP.serializer parse_maybe_signatureScheme_key", "source_definition": "let serialize_maybe_signatureScheme_key : LP.serializer parse_maybe_signatureScheme_key =\n LP.serialize_maybe_enum_key signatureScheme_repr_parser signatureScheme_repr_serializer signatureScheme_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 110, "start_col": 2, "end_line": 110, "end_col": 110 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let signatureScheme_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let signatureScheme_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_signatureScheme (x:LP.maybe_enum_key signatureScheme_enum) : signatureScheme = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n Unknown_signatureScheme v\n\ninline_for_extraction let synth_signatureScheme_inv (x:signatureScheme) : LP.maybe_enum_key signatureScheme_enum = \n match x with\n | Unknown_signatureScheme y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : signatureScheme = x in\n [@inline_let] let _ : squash(not (Unknown_signatureScheme? x1) ==> LP.list_mem x1 (LP.list_map fst signatureScheme_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key signatureScheme_enum)\n\nlet lemma_synth_signatureScheme_inv' () : Lemma\n (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme)\n= LP.forall_maybe_enum_key signatureScheme_enum (fun x -> synth_signatureScheme_inv (synth_signatureScheme x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_signatureScheme_inj () : Lemma\n (LP.synth_injective synth_signatureScheme) = \n lemma_synth_signatureScheme_inv' ();\n LP.synth_inverse_synth_injective synth_signatureScheme synth_signatureScheme_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_signatureScheme_inv () : Lemma\n (LP.synth_inverse synth_signatureScheme synth_signatureScheme_inv) = allow_inversion signatureScheme; ()\n\n#pop-options\nnoextract let parse_maybe_signatureScheme_key : LP.parser _ (LP.maybe_enum_key signatureScheme_enum) =\n LP.parse_maybe_enum_key signatureScheme_repr_parser signatureScheme_enum", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.SignatureScheme.parse_maybe_signatureScheme_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.serialize_maybe_enum_key", "LowParse.Spec.Int.parse_u16_kind", "Parsers.SignatureScheme.signatureScheme", "FStar.UInt16.t", "Parsers.SignatureScheme.signatureScheme_repr_parser", "Parsers.SignatureScheme.signatureScheme_repr_serializer", "Parsers.SignatureScheme.signatureScheme_enum" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_maybe_signatureScheme_key:LP.serializer parse_maybe_signatureScheme_key\nlet serialize_maybe_signatureScheme_key:LP.serializer parse_maybe_signatureScheme_key =", "completed_definiton": "LP.serialize_maybe_enum_key signatureScheme_repr_parser\n signatureScheme_repr_serializer\n signatureScheme_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.signatureScheme_parser", "original_source_type": "val signatureScheme_parser: LP.parser signatureScheme_parser_kind signatureScheme", "source_type": "val signatureScheme_parser: LP.parser signatureScheme_parser_kind signatureScheme", "source_definition": "let signatureScheme_parser : LP.parser _ signatureScheme =\n lemma_synth_signatureScheme_inj ();\n parse_maybe_signatureScheme_key `LP.parse_synth` synth_signatureScheme", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 113, "start_col": 2, "end_line": 114, "end_col": 72 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let signatureScheme_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let signatureScheme_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_signatureScheme (x:LP.maybe_enum_key signatureScheme_enum) : signatureScheme = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n Unknown_signatureScheme v\n\ninline_for_extraction let synth_signatureScheme_inv (x:signatureScheme) : LP.maybe_enum_key signatureScheme_enum = \n match x with\n | Unknown_signatureScheme y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : signatureScheme = x in\n [@inline_let] let _ : squash(not (Unknown_signatureScheme? x1) ==> LP.list_mem x1 (LP.list_map fst signatureScheme_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key signatureScheme_enum)\n\nlet lemma_synth_signatureScheme_inv' () : Lemma\n (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme)\n= LP.forall_maybe_enum_key signatureScheme_enum (fun x -> synth_signatureScheme_inv (synth_signatureScheme x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_signatureScheme_inj () : Lemma\n (LP.synth_injective synth_signatureScheme) = \n lemma_synth_signatureScheme_inv' ();\n LP.synth_inverse_synth_injective synth_signatureScheme synth_signatureScheme_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_signatureScheme_inv () : Lemma\n (LP.synth_inverse synth_signatureScheme synth_signatureScheme_inv) = allow_inversion signatureScheme; ()\n\n#pop-options\nnoextract let parse_maybe_signatureScheme_key : LP.parser _ (LP.maybe_enum_key signatureScheme_enum) =\n LP.parse_maybe_enum_key signatureScheme_repr_parser signatureScheme_enum\n\nnoextract let serialize_maybe_signatureScheme_key : LP.serializer parse_maybe_signatureScheme_key =\n LP.serialize_maybe_enum_key signatureScheme_repr_parser signatureScheme_repr_serializer signatureScheme_enum", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.SignatureScheme.signatureScheme_parser_kind\n Parsers.SignatureScheme.signatureScheme", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.SignatureScheme.signatureScheme", "FStar.UInt16.t", "Parsers.SignatureScheme.signatureScheme_enum", "Parsers.SignatureScheme.parse_maybe_signatureScheme_key", "Parsers.SignatureScheme.synth_signatureScheme", "Prims.unit", "Parsers.SignatureScheme.lemma_synth_signatureScheme_inj", "LowParse.Spec.Base.parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureScheme_parser: LP.parser signatureScheme_parser_kind signatureScheme\nlet signatureScheme_parser:LP.parser _ signatureScheme =", "completed_definiton": "lemma_synth_signatureScheme_inj ();\nparse_maybe_signatureScheme_key `LP.parse_synth` synth_signatureScheme", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.signatureScheme_writer", "original_source_type": "val signatureScheme_writer: LL.leaf_writer_strong signatureScheme_serializer", "source_type": "val signatureScheme_writer: LL.leaf_writer_strong signatureScheme_serializer", "source_definition": "let signatureScheme_writer =\n [@inline_let] let _ = lemma_synth_signatureScheme_inj (); lemma_synth_signatureScheme_inv () in\n LL.write_synth write_maybe_signatureScheme_key synth_signatureScheme synth_signatureScheme_inv (fun x -> synth_signatureScheme_inv x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 160, "start_col": 2, "end_line": 161, "end_col": 138 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let signatureScheme_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let signatureScheme_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_signatureScheme (x:LP.maybe_enum_key signatureScheme_enum) : signatureScheme = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n Unknown_signatureScheme v\n\ninline_for_extraction let synth_signatureScheme_inv (x:signatureScheme) : LP.maybe_enum_key signatureScheme_enum = \n match x with\n | Unknown_signatureScheme y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : signatureScheme = x in\n [@inline_let] let _ : squash(not (Unknown_signatureScheme? x1) ==> LP.list_mem x1 (LP.list_map fst signatureScheme_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key signatureScheme_enum)\n\nlet lemma_synth_signatureScheme_inv' () : Lemma\n (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme)\n= LP.forall_maybe_enum_key signatureScheme_enum (fun x -> synth_signatureScheme_inv (synth_signatureScheme x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_signatureScheme_inj () : Lemma\n (LP.synth_injective synth_signatureScheme) = \n lemma_synth_signatureScheme_inv' ();\n LP.synth_inverse_synth_injective synth_signatureScheme synth_signatureScheme_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_signatureScheme_inv () : Lemma\n (LP.synth_inverse synth_signatureScheme synth_signatureScheme_inv) = allow_inversion signatureScheme; ()\n\n#pop-options\nnoextract let parse_maybe_signatureScheme_key : LP.parser _ (LP.maybe_enum_key signatureScheme_enum) =\n LP.parse_maybe_enum_key signatureScheme_repr_parser signatureScheme_enum\n\nnoextract let serialize_maybe_signatureScheme_key : LP.serializer parse_maybe_signatureScheme_key =\n LP.serialize_maybe_enum_key signatureScheme_repr_parser signatureScheme_repr_serializer signatureScheme_enum\n\nnoextract let signatureScheme_parser : LP.parser _ signatureScheme =\n lemma_synth_signatureScheme_inj ();\n parse_maybe_signatureScheme_key `LP.parse_synth` synth_signatureScheme\n\nnoextract let signatureScheme_serializer : LP.serializer signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LP.serialize_synth _ synth_signatureScheme serialize_maybe_signatureScheme_key synth_signatureScheme_inv ()\n\nlet signatureScheme_bytesize (x:signatureScheme) : GTot nat = Seq.length (signatureScheme_serializer x)\n\nlet signatureScheme_bytesize_eq x = ()\n\nlet parse32_maybe_signatureScheme_key : LS.parser32 parse_maybe_signatureScheme_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac signatureScheme_repr_parser32 signatureScheme_enum)\n\nlet signatureScheme_parser32 : LS.parser32 signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n LS.parse32_synth _ synth_signatureScheme (fun x->synth_signatureScheme x) parse32_maybe_signatureScheme_key ()\n\nlet serialize32_maybe_signatureScheme_key : LS.serializer32 serialize_maybe_signatureScheme_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n signatureScheme_repr_serializer32 signatureScheme_enum)\n\nlet signatureScheme_serializer32 : LS.serializer32 signatureScheme_serializer =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LS.serialize32_synth _ synth_signatureScheme _ serialize32_maybe_signatureScheme_key synth_signatureScheme_inv (fun x->synth_signatureScheme_inv x) ()\n\nlet signatureScheme_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond signatureScheme_serializer 2ul) in\n LSZ.size32_constant signatureScheme_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_signatureScheme_key : LL.leaf_reader parse_maybe_signatureScheme_key =\n LL.mk_read_maybe_enum_key signatureScheme_repr_reader signatureScheme_enum\n\nlet signatureScheme_reader =\n [@inline_let] let _ = lemma_synth_signatureScheme_inj () in\n LL.read_synth' parse_maybe_signatureScheme_key synth_signatureScheme read_maybe_signatureScheme_key ()\n\ninline_for_extraction let write_maybe_signatureScheme_key : LL.leaf_writer_strong serialize_maybe_signatureScheme_key =\n LL.write_maybe_enum_key signatureScheme_repr_writer signatureScheme_enum (_ by (LP.enum_repr_of_key_tac signatureScheme_enum))\n\ninline_for_extraction let lserialize_maybe_signatureScheme_key : LL.serializer32 serialize_maybe_signatureScheme_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_signatureScheme_key 2ul ()", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong Parsers.SignatureScheme.signatureScheme_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.write_synth", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.SignatureScheme.signatureScheme", "FStar.UInt16.t", "Parsers.SignatureScheme.signatureScheme_enum", "Parsers.SignatureScheme.parse_maybe_signatureScheme_key", "Parsers.SignatureScheme.serialize_maybe_signatureScheme_key", "Parsers.SignatureScheme.write_maybe_signatureScheme_key", "Parsers.SignatureScheme.synth_signatureScheme", "Parsers.SignatureScheme.synth_signatureScheme_inv", "Prims.eq2", "Prims.unit", "Parsers.SignatureScheme.lemma_synth_signatureScheme_inv", "Parsers.SignatureScheme.lemma_synth_signatureScheme_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureScheme_writer: LL.leaf_writer_strong signatureScheme_serializer\nlet signatureScheme_writer =", "completed_definiton": "[@@ inline_let ]let _ =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ()\nin\nLL.write_synth write_maybe_signatureScheme_key\n synth_signatureScheme\n synth_signatureScheme_inv\n (fun x -> synth_signatureScheme_inv x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.signatureScheme_reader", "original_source_type": "val signatureScheme_reader: LL.leaf_reader signatureScheme_parser", "source_type": "val signatureScheme_reader: LL.leaf_reader signatureScheme_parser", "source_definition": "let signatureScheme_reader =\n [@inline_let] let _ = lemma_synth_signatureScheme_inj () in\n LL.read_synth' parse_maybe_signatureScheme_key synth_signatureScheme read_maybe_signatureScheme_key ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 150, "start_col": 1, "end_line": 151, "end_col": 103 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let signatureScheme_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let signatureScheme_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_signatureScheme (x:LP.maybe_enum_key signatureScheme_enum) : signatureScheme = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n Unknown_signatureScheme v\n\ninline_for_extraction let synth_signatureScheme_inv (x:signatureScheme) : LP.maybe_enum_key signatureScheme_enum = \n match x with\n | Unknown_signatureScheme y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : signatureScheme = x in\n [@inline_let] let _ : squash(not (Unknown_signatureScheme? x1) ==> LP.list_mem x1 (LP.list_map fst signatureScheme_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key signatureScheme_enum)\n\nlet lemma_synth_signatureScheme_inv' () : Lemma\n (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme)\n= LP.forall_maybe_enum_key signatureScheme_enum (fun x -> synth_signatureScheme_inv (synth_signatureScheme x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_signatureScheme_inj () : Lemma\n (LP.synth_injective synth_signatureScheme) = \n lemma_synth_signatureScheme_inv' ();\n LP.synth_inverse_synth_injective synth_signatureScheme synth_signatureScheme_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_signatureScheme_inv () : Lemma\n (LP.synth_inverse synth_signatureScheme synth_signatureScheme_inv) = allow_inversion signatureScheme; ()\n\n#pop-options\nnoextract let parse_maybe_signatureScheme_key : LP.parser _ (LP.maybe_enum_key signatureScheme_enum) =\n LP.parse_maybe_enum_key signatureScheme_repr_parser signatureScheme_enum\n\nnoextract let serialize_maybe_signatureScheme_key : LP.serializer parse_maybe_signatureScheme_key =\n LP.serialize_maybe_enum_key signatureScheme_repr_parser signatureScheme_repr_serializer signatureScheme_enum\n\nnoextract let signatureScheme_parser : LP.parser _ signatureScheme =\n lemma_synth_signatureScheme_inj ();\n parse_maybe_signatureScheme_key `LP.parse_synth` synth_signatureScheme\n\nnoextract let signatureScheme_serializer : LP.serializer signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LP.serialize_synth _ synth_signatureScheme serialize_maybe_signatureScheme_key synth_signatureScheme_inv ()\n\nlet signatureScheme_bytesize (x:signatureScheme) : GTot nat = Seq.length (signatureScheme_serializer x)\n\nlet signatureScheme_bytesize_eq x = ()\n\nlet parse32_maybe_signatureScheme_key : LS.parser32 parse_maybe_signatureScheme_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac signatureScheme_repr_parser32 signatureScheme_enum)\n\nlet signatureScheme_parser32 : LS.parser32 signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n LS.parse32_synth _ synth_signatureScheme (fun x->synth_signatureScheme x) parse32_maybe_signatureScheme_key ()\n\nlet serialize32_maybe_signatureScheme_key : LS.serializer32 serialize_maybe_signatureScheme_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n signatureScheme_repr_serializer32 signatureScheme_enum)\n\nlet signatureScheme_serializer32 : LS.serializer32 signatureScheme_serializer =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LS.serialize32_synth _ synth_signatureScheme _ serialize32_maybe_signatureScheme_key synth_signatureScheme_inv (fun x->synth_signatureScheme_inv x) ()\n\nlet signatureScheme_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond signatureScheme_serializer 2ul) in\n LSZ.size32_constant signatureScheme_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_signatureScheme_key : LL.leaf_reader parse_maybe_signatureScheme_key =\n LL.mk_read_maybe_enum_key signatureScheme_repr_reader signatureScheme_enum", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader Parsers.SignatureScheme.signatureScheme_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.read_synth'", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.SignatureScheme.signatureScheme", "FStar.UInt16.t", "Parsers.SignatureScheme.signatureScheme_enum", "Parsers.SignatureScheme.parse_maybe_signatureScheme_key", "Parsers.SignatureScheme.synth_signatureScheme", "Parsers.SignatureScheme.read_maybe_signatureScheme_key", "Prims.unit", "Parsers.SignatureScheme.lemma_synth_signatureScheme_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureScheme_reader: LL.leaf_reader signatureScheme_parser\nlet signatureScheme_reader =", "completed_definiton": "[@@ inline_let ]let _ = lemma_synth_signatureScheme_inj () in\nLL.read_synth' parse_maybe_signatureScheme_key\n synth_signatureScheme\n read_maybe_signatureScheme_key\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.lemma_synth_signatureScheme_inj", "original_source_type": "val lemma_synth_signatureScheme_inj: Prims.unit -> Lemma (LP.synth_injective synth_signatureScheme)", "source_type": "val lemma_synth_signatureScheme_inj: Prims.unit -> Lemma (LP.synth_injective synth_signatureScheme)", "source_definition": "let lemma_synth_signatureScheme_inj () : Lemma\n (LP.synth_injective synth_signatureScheme) = \n lemma_synth_signatureScheme_inv' ();\n LP.synth_inverse_synth_injective synth_signatureScheme synth_signatureScheme_inv", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 98, "start_col": 2, "end_line": 99, "end_col": 82 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let signatureScheme_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let signatureScheme_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_signatureScheme (x:LP.maybe_enum_key signatureScheme_enum) : signatureScheme = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n Unknown_signatureScheme v\n\ninline_for_extraction let synth_signatureScheme_inv (x:signatureScheme) : LP.maybe_enum_key signatureScheme_enum = \n match x with\n | Unknown_signatureScheme y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : signatureScheme = x in\n [@inline_let] let _ : squash(not (Unknown_signatureScheme? x1) ==> LP.list_mem x1 (LP.list_map fst signatureScheme_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key signatureScheme_enum)\n\nlet lemma_synth_signatureScheme_inv' () : Lemma\n (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme)\n= LP.forall_maybe_enum_key signatureScheme_enum (fun x -> synth_signatureScheme_inv (synth_signatureScheme x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_signatureScheme_inj () : Lemma", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures LowParse.Spec.Combinators.synth_injective Parsers.SignatureScheme.synth_signatureScheme\n )", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "LowParse.Spec.Combinators.synth_inverse_synth_injective", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.SignatureScheme.signatureScheme", "FStar.UInt16.t", "Parsers.SignatureScheme.signatureScheme_enum", "Parsers.SignatureScheme.synth_signatureScheme", "Parsers.SignatureScheme.synth_signatureScheme_inv", "Parsers.SignatureScheme.lemma_synth_signatureScheme_inv'", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_injective", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_synth_signatureScheme_inj: Prims.unit -> Lemma (LP.synth_injective synth_signatureScheme)\nlet lemma_synth_signatureScheme_inj () : Lemma (LP.synth_injective synth_signatureScheme) =", "completed_definiton": "lemma_synth_signatureScheme_inv' ();\nLP.synth_inverse_synth_injective synth_signatureScheme synth_signatureScheme_inv", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.lemma_synth_signatureScheme_inv", "original_source_type": "val lemma_synth_signatureScheme_inv: Prims.unit\n -> Lemma (LP.synth_inverse synth_signatureScheme synth_signatureScheme_inv)", "source_type": "val lemma_synth_signatureScheme_inv: Prims.unit\n -> Lemma (LP.synth_inverse synth_signatureScheme synth_signatureScheme_inv)", "source_definition": "let lemma_synth_signatureScheme_inv () : Lemma\n (LP.synth_inverse synth_signatureScheme synth_signatureScheme_inv) = allow_inversion signatureScheme; ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 103, "start_col": 71, "end_line": 103, "end_col": 106 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let signatureScheme_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let signatureScheme_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_signatureScheme (x:LP.maybe_enum_key signatureScheme_enum) : signatureScheme = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n Unknown_signatureScheme v\n\ninline_for_extraction let synth_signatureScheme_inv (x:signatureScheme) : LP.maybe_enum_key signatureScheme_enum = \n match x with\n | Unknown_signatureScheme y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : signatureScheme = x in\n [@inline_let] let _ : squash(not (Unknown_signatureScheme? x1) ==> LP.list_mem x1 (LP.list_map fst signatureScheme_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key signatureScheme_enum)\n\nlet lemma_synth_signatureScheme_inv' () : Lemma\n (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme)\n= LP.forall_maybe_enum_key signatureScheme_enum (fun x -> synth_signatureScheme_inv (synth_signatureScheme x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_signatureScheme_inj () : Lemma\n (LP.synth_injective synth_signatureScheme) = \n lemma_synth_signatureScheme_inv' ();\n LP.synth_inverse_synth_injective synth_signatureScheme synth_signatureScheme_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_inverse Parsers.SignatureScheme.synth_signatureScheme\n Parsers.SignatureScheme.synth_signatureScheme_inv)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.allow_inversion", "Parsers.SignatureScheme.signatureScheme", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_inverse", "LowParse.Spec.Enum.maybe_enum_key", "FStar.UInt16.t", "Parsers.SignatureScheme.signatureScheme_enum", "Parsers.SignatureScheme.synth_signatureScheme", "Parsers.SignatureScheme.synth_signatureScheme_inv", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_synth_signatureScheme_inv: Prims.unit\n -> Lemma (LP.synth_inverse synth_signatureScheme synth_signatureScheme_inv)\nlet lemma_synth_signatureScheme_inv ()\n : Lemma (LP.synth_inverse synth_signatureScheme synth_signatureScheme_inv) =", "completed_definiton": "allow_inversion signatureScheme;\n()", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.synth_signatureScheme", "original_source_type": "val synth_signatureScheme (x: LP.maybe_enum_key signatureScheme_enum) : signatureScheme", "source_type": "val synth_signatureScheme (x: LP.maybe_enum_key signatureScheme_enum) : signatureScheme", "source_definition": "let synth_signatureScheme (x:LP.maybe_enum_key signatureScheme_enum) : signatureScheme = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n Unknown_signatureScheme v", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 70, "start_col": 2, "end_line": 75, "end_col": 29 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let signatureScheme_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let signatureScheme_repr_writer = LL.write_u16", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: LowParse.Spec.Enum.maybe_enum_key Parsers.SignatureScheme.signatureScheme_enum\n -> Parsers.SignatureScheme.signatureScheme", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.maybe_enum_key", "Parsers.SignatureScheme.signatureScheme", "FStar.UInt16.t", "Parsers.SignatureScheme.signatureScheme_enum", "LowParse.Spec.Enum.enum_key", "LowParse.Spec.Enum.unknown_enum_repr", "Parsers.SignatureScheme.Unknown_signatureScheme", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.bool", "LowParse.Spec.Enum.list_mem", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.snd", "Parsers.SignatureScheme.known_signatureScheme_repr" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_signatureScheme (x: LP.maybe_enum_key signatureScheme_enum) : signatureScheme\nlet synth_signatureScheme (x: LP.maybe_enum_key signatureScheme_enum) : signatureScheme =", "completed_definiton": "match x with\n| LP.Known k -> k\n| LP.Unknown y ->\n [@@ inline_let ]let v:U16.t = y in\n [@@ inline_let ]let _ =\n assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) ==\n known_signatureScheme_repr v)\n in\n Unknown_signatureScheme v", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.lemma_synth_signatureScheme_inv'", "original_source_type": "val lemma_synth_signatureScheme_inv': Prims.unit\n -> Lemma (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme)", "source_type": "val lemma_synth_signatureScheme_inv': Prims.unit\n -> Lemma (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme)", "source_definition": "let lemma_synth_signatureScheme_inv' () : Lemma\n (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme)\n= LP.forall_maybe_enum_key signatureScheme_enum (fun x -> synth_signatureScheme_inv (synth_signatureScheme x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 92, "start_col": 2, "end_line": 94, "end_col": 52 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let signatureScheme_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let signatureScheme_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_signatureScheme (x:LP.maybe_enum_key signatureScheme_enum) : signatureScheme = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n Unknown_signatureScheme v\n\ninline_for_extraction let synth_signatureScheme_inv (x:signatureScheme) : LP.maybe_enum_key signatureScheme_enum = \n match x with\n | Unknown_signatureScheme y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : signatureScheme = x in\n [@inline_let] let _ : squash(not (Unknown_signatureScheme? x1) ==> LP.list_mem x1 (LP.list_map fst signatureScheme_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key signatureScheme_enum)\n\nlet lemma_synth_signatureScheme_inv' () : Lemma", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_inverse Parsers.SignatureScheme.synth_signatureScheme_inv\n Parsers.SignatureScheme.synth_signatureScheme)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "LowParse.Spec.Enum.forall_maybe_enum_key", "Parsers.SignatureScheme.signatureScheme", "FStar.UInt16.t", "Parsers.SignatureScheme.signatureScheme_enum", "LowParse.Spec.Enum.maybe_enum_key", "Prims.eq2", "Parsers.SignatureScheme.synth_signatureScheme_inv", "Parsers.SignatureScheme.synth_signatureScheme", "Prims.squash", "Prims.l_imp", "Prims.bool", "LowParse.Spec.Enum.list_mem", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.snd", "LowParse.Spec.Enum.Unknown", "Prims.l_True", "LowParse.Spec.Combinators.synth_inverse", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_synth_signatureScheme_inv': Prims.unit\n -> Lemma (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme)\nlet lemma_synth_signatureScheme_inv' ()\n : Lemma (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme) =", "completed_definiton": "LP.forall_maybe_enum_key signatureScheme_enum\n (fun x -> synth_signatureScheme_inv (synth_signatureScheme x) == x)\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.forall_maybe_enum_key_known_tac ())))\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.forall_maybe_enum_key_unknown_tac ())))", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.lserialize_maybe_signatureScheme_key", "original_source_type": "val lserialize_maybe_signatureScheme_key:LL.serializer32 serialize_maybe_signatureScheme_key", "source_type": "val lserialize_maybe_signatureScheme_key:LL.serializer32 serialize_maybe_signatureScheme_key", "source_definition": "let lserialize_maybe_signatureScheme_key : LL.serializer32 serialize_maybe_signatureScheme_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_signatureScheme_key 2ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 157, "start_col": 2, "end_line": 157, "end_col": 92 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let signatureScheme_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let signatureScheme_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_signatureScheme (x:LP.maybe_enum_key signatureScheme_enum) : signatureScheme = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n Unknown_signatureScheme v\n\ninline_for_extraction let synth_signatureScheme_inv (x:signatureScheme) : LP.maybe_enum_key signatureScheme_enum = \n match x with\n | Unknown_signatureScheme y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : signatureScheme = x in\n [@inline_let] let _ : squash(not (Unknown_signatureScheme? x1) ==> LP.list_mem x1 (LP.list_map fst signatureScheme_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key signatureScheme_enum)\n\nlet lemma_synth_signatureScheme_inv' () : Lemma\n (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme)\n= LP.forall_maybe_enum_key signatureScheme_enum (fun x -> synth_signatureScheme_inv (synth_signatureScheme x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_signatureScheme_inj () : Lemma\n (LP.synth_injective synth_signatureScheme) = \n lemma_synth_signatureScheme_inv' ();\n LP.synth_inverse_synth_injective synth_signatureScheme synth_signatureScheme_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_signatureScheme_inv () : Lemma\n (LP.synth_inverse synth_signatureScheme synth_signatureScheme_inv) = allow_inversion signatureScheme; ()\n\n#pop-options\nnoextract let parse_maybe_signatureScheme_key : LP.parser _ (LP.maybe_enum_key signatureScheme_enum) =\n LP.parse_maybe_enum_key signatureScheme_repr_parser signatureScheme_enum\n\nnoextract let serialize_maybe_signatureScheme_key : LP.serializer parse_maybe_signatureScheme_key =\n LP.serialize_maybe_enum_key signatureScheme_repr_parser signatureScheme_repr_serializer signatureScheme_enum\n\nnoextract let signatureScheme_parser : LP.parser _ signatureScheme =\n lemma_synth_signatureScheme_inj ();\n parse_maybe_signatureScheme_key `LP.parse_synth` synth_signatureScheme\n\nnoextract let signatureScheme_serializer : LP.serializer signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LP.serialize_synth _ synth_signatureScheme serialize_maybe_signatureScheme_key synth_signatureScheme_inv ()\n\nlet signatureScheme_bytesize (x:signatureScheme) : GTot nat = Seq.length (signatureScheme_serializer x)\n\nlet signatureScheme_bytesize_eq x = ()\n\nlet parse32_maybe_signatureScheme_key : LS.parser32 parse_maybe_signatureScheme_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac signatureScheme_repr_parser32 signatureScheme_enum)\n\nlet signatureScheme_parser32 : LS.parser32 signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n LS.parse32_synth _ synth_signatureScheme (fun x->synth_signatureScheme x) parse32_maybe_signatureScheme_key ()\n\nlet serialize32_maybe_signatureScheme_key : LS.serializer32 serialize_maybe_signatureScheme_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n signatureScheme_repr_serializer32 signatureScheme_enum)\n\nlet signatureScheme_serializer32 : LS.serializer32 signatureScheme_serializer =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LS.serialize32_synth _ synth_signatureScheme _ serialize32_maybe_signatureScheme_key synth_signatureScheme_inv (fun x->synth_signatureScheme_inv x) ()\n\nlet signatureScheme_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond signatureScheme_serializer 2ul) in\n LSZ.size32_constant signatureScheme_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_signatureScheme_key : LL.leaf_reader parse_maybe_signatureScheme_key =\n LL.mk_read_maybe_enum_key signatureScheme_repr_reader signatureScheme_enum\n\nlet signatureScheme_reader =\n [@inline_let] let _ = lemma_synth_signatureScheme_inj () in\n LL.read_synth' parse_maybe_signatureScheme_key synth_signatureScheme read_maybe_signatureScheme_key ()\n\ninline_for_extraction let write_maybe_signatureScheme_key : LL.leaf_writer_strong serialize_maybe_signatureScheme_key =\n LL.write_maybe_enum_key signatureScheme_repr_writer signatureScheme_enum (_ by (LP.enum_repr_of_key_tac signatureScheme_enum))", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 Parsers.SignatureScheme.serialize_maybe_signatureScheme_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.serializer32_of_leaf_writer_strong_constant_size", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.SignatureScheme.signatureScheme", "FStar.UInt16.t", "Parsers.SignatureScheme.signatureScheme_enum", "Parsers.SignatureScheme.parse_maybe_signatureScheme_key", "Parsers.SignatureScheme.serialize_maybe_signatureScheme_key", "Parsers.SignatureScheme.write_maybe_signatureScheme_key", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lserialize_maybe_signatureScheme_key:LL.serializer32 serialize_maybe_signatureScheme_key\nlet lserialize_maybe_signatureScheme_key:LL.serializer32 serialize_maybe_signatureScheme_key =", "completed_definiton": "LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_signatureScheme_key 2ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.signatureScheme_lserializer", "original_source_type": "val signatureScheme_lserializer: LL.serializer32 signatureScheme_serializer", "source_type": "val signatureScheme_lserializer: LL.serializer32 signatureScheme_serializer", "source_definition": "let signatureScheme_lserializer = LL.serializer32_of_leaf_writer_strong_constant_size signatureScheme_writer 2ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 163, "start_col": 34, "end_line": 163, "end_col": 115 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let signatureScheme_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let signatureScheme_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_signatureScheme (x:LP.maybe_enum_key signatureScheme_enum) : signatureScheme = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n Unknown_signatureScheme v\n\ninline_for_extraction let synth_signatureScheme_inv (x:signatureScheme) : LP.maybe_enum_key signatureScheme_enum = \n match x with\n | Unknown_signatureScheme y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : signatureScheme = x in\n [@inline_let] let _ : squash(not (Unknown_signatureScheme? x1) ==> LP.list_mem x1 (LP.list_map fst signatureScheme_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key signatureScheme_enum)\n\nlet lemma_synth_signatureScheme_inv' () : Lemma\n (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme)\n= LP.forall_maybe_enum_key signatureScheme_enum (fun x -> synth_signatureScheme_inv (synth_signatureScheme x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_signatureScheme_inj () : Lemma\n (LP.synth_injective synth_signatureScheme) = \n lemma_synth_signatureScheme_inv' ();\n LP.synth_inverse_synth_injective synth_signatureScheme synth_signatureScheme_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_signatureScheme_inv () : Lemma\n (LP.synth_inverse synth_signatureScheme synth_signatureScheme_inv) = allow_inversion signatureScheme; ()\n\n#pop-options\nnoextract let parse_maybe_signatureScheme_key : LP.parser _ (LP.maybe_enum_key signatureScheme_enum) =\n LP.parse_maybe_enum_key signatureScheme_repr_parser signatureScheme_enum\n\nnoextract let serialize_maybe_signatureScheme_key : LP.serializer parse_maybe_signatureScheme_key =\n LP.serialize_maybe_enum_key signatureScheme_repr_parser signatureScheme_repr_serializer signatureScheme_enum\n\nnoextract let signatureScheme_parser : LP.parser _ signatureScheme =\n lemma_synth_signatureScheme_inj ();\n parse_maybe_signatureScheme_key `LP.parse_synth` synth_signatureScheme\n\nnoextract let signatureScheme_serializer : LP.serializer signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LP.serialize_synth _ synth_signatureScheme serialize_maybe_signatureScheme_key synth_signatureScheme_inv ()\n\nlet signatureScheme_bytesize (x:signatureScheme) : GTot nat = Seq.length (signatureScheme_serializer x)\n\nlet signatureScheme_bytesize_eq x = ()\n\nlet parse32_maybe_signatureScheme_key : LS.parser32 parse_maybe_signatureScheme_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac signatureScheme_repr_parser32 signatureScheme_enum)\n\nlet signatureScheme_parser32 : LS.parser32 signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n LS.parse32_synth _ synth_signatureScheme (fun x->synth_signatureScheme x) parse32_maybe_signatureScheme_key ()\n\nlet serialize32_maybe_signatureScheme_key : LS.serializer32 serialize_maybe_signatureScheme_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n signatureScheme_repr_serializer32 signatureScheme_enum)\n\nlet signatureScheme_serializer32 : LS.serializer32 signatureScheme_serializer =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LS.serialize32_synth _ synth_signatureScheme _ serialize32_maybe_signatureScheme_key synth_signatureScheme_inv (fun x->synth_signatureScheme_inv x) ()\n\nlet signatureScheme_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond signatureScheme_serializer 2ul) in\n LSZ.size32_constant signatureScheme_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_signatureScheme_key : LL.leaf_reader parse_maybe_signatureScheme_key =\n LL.mk_read_maybe_enum_key signatureScheme_repr_reader signatureScheme_enum\n\nlet signatureScheme_reader =\n [@inline_let] let _ = lemma_synth_signatureScheme_inj () in\n LL.read_synth' parse_maybe_signatureScheme_key synth_signatureScheme read_maybe_signatureScheme_key ()\n\ninline_for_extraction let write_maybe_signatureScheme_key : LL.leaf_writer_strong serialize_maybe_signatureScheme_key =\n LL.write_maybe_enum_key signatureScheme_repr_writer signatureScheme_enum (_ by (LP.enum_repr_of_key_tac signatureScheme_enum))\n\ninline_for_extraction let lserialize_maybe_signatureScheme_key : LL.serializer32 serialize_maybe_signatureScheme_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_signatureScheme_key 2ul ()\n\nlet signatureScheme_writer =\n [@inline_let] let _ = lemma_synth_signatureScheme_inj (); lemma_synth_signatureScheme_inv () in\n LL.write_synth write_maybe_signatureScheme_key synth_signatureScheme synth_signatureScheme_inv (fun x -> synth_signatureScheme_inv x) ()", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 Parsers.SignatureScheme.signatureScheme_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.serializer32_of_leaf_writer_strong_constant_size", "Parsers.SignatureScheme.signatureScheme_parser_kind", "Parsers.SignatureScheme.signatureScheme", "Parsers.SignatureScheme.signatureScheme_parser", "Parsers.SignatureScheme.signatureScheme_serializer", "Parsers.SignatureScheme.signatureScheme_writer", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureScheme_lserializer: LL.serializer32 signatureScheme_serializer\nlet signatureScheme_lserializer =", "completed_definiton": "LL.serializer32_of_leaf_writer_strong_constant_size signatureScheme_writer 2ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.synth_signatureScheme_inv", "original_source_type": "val synth_signatureScheme_inv (x: signatureScheme) : LP.maybe_enum_key signatureScheme_enum", "source_type": "val synth_signatureScheme_inv (x: signatureScheme) : LP.maybe_enum_key signatureScheme_enum", "source_definition": "let synth_signatureScheme_inv (x:signatureScheme) : LP.maybe_enum_key signatureScheme_enum = \n match x with\n | Unknown_signatureScheme y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : signatureScheme = x in\n [@inline_let] let _ : squash(not (Unknown_signatureScheme? x1) ==> LP.list_mem x1 (LP.list_map fst signatureScheme_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key signatureScheme_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 78, "start_col": 2, "end_line": 88, "end_col": 53 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let signatureScheme_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let signatureScheme_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_signatureScheme (x:LP.maybe_enum_key signatureScheme_enum) : signatureScheme = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n Unknown_signatureScheme v", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.SignatureScheme.signatureScheme\n -> LowParse.Spec.Enum.maybe_enum_key Parsers.SignatureScheme.signatureScheme_enum", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.SignatureScheme.signatureScheme", "FStar.UInt16.t", "Prims.b2t", "Prims.op_Negation", "Parsers.SignatureScheme.known_signatureScheme_repr", "LowParse.Spec.Enum.Unknown", "Parsers.SignatureScheme.signatureScheme_enum", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.bool", "LowParse.Spec.Enum.list_mem", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.snd", "LowParse.Spec.Enum.Known", "LowParse.Spec.Enum.enum_key", "Prims.squash", "Prims.l_imp", "Parsers.SignatureScheme.uu___is_Unknown_signatureScheme", "FStar.Pervasives.Native.fst", "LowParse.Spec.Enum.maybe_enum_key" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_signatureScheme_inv (x: signatureScheme) : LP.maybe_enum_key signatureScheme_enum\nlet synth_signatureScheme_inv (x: signatureScheme) : LP.maybe_enum_key signatureScheme_enum =", "completed_definiton": "match x with\n| Unknown_signatureScheme y ->\n [@@ inline_let ]let v:U16.t = y in\n [@@ inline_let ]let _ =\n assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) ==\n known_signatureScheme_repr v)\n in\n LP.Unknown v\n| x ->\n [@@ inline_let ]let x1:signatureScheme = x in\n [@@ inline_let ]let _:squash (not (Unknown_signatureScheme? x1) ==>\n LP.list_mem x1 (LP.list_map fst signatureScheme_enum)) =\n FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.synth_maybe_enum_key_inv_unknown_tac x1))\n in\n LP.Known (x1 <: LP.enum_key signatureScheme_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.write_maybe_signatureScheme_key", "original_source_type": "val write_maybe_signatureScheme_key:LL.leaf_writer_strong serialize_maybe_signatureScheme_key", "source_type": "val write_maybe_signatureScheme_key:LL.leaf_writer_strong serialize_maybe_signatureScheme_key", "source_definition": "let write_maybe_signatureScheme_key : LL.leaf_writer_strong serialize_maybe_signatureScheme_key =\n LL.write_maybe_enum_key signatureScheme_repr_writer signatureScheme_enum (_ by (LP.enum_repr_of_key_tac signatureScheme_enum))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 154, "start_col": 2, "end_line": 154, "end_col": 128 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let signatureScheme_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let signatureScheme_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_signatureScheme (x:LP.maybe_enum_key signatureScheme_enum) : signatureScheme = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n Unknown_signatureScheme v\n\ninline_for_extraction let synth_signatureScheme_inv (x:signatureScheme) : LP.maybe_enum_key signatureScheme_enum = \n match x with\n | Unknown_signatureScheme y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : signatureScheme = x in\n [@inline_let] let _ : squash(not (Unknown_signatureScheme? x1) ==> LP.list_mem x1 (LP.list_map fst signatureScheme_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key signatureScheme_enum)\n\nlet lemma_synth_signatureScheme_inv' () : Lemma\n (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme)\n= LP.forall_maybe_enum_key signatureScheme_enum (fun x -> synth_signatureScheme_inv (synth_signatureScheme x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_signatureScheme_inj () : Lemma\n (LP.synth_injective synth_signatureScheme) = \n lemma_synth_signatureScheme_inv' ();\n LP.synth_inverse_synth_injective synth_signatureScheme synth_signatureScheme_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_signatureScheme_inv () : Lemma\n (LP.synth_inverse synth_signatureScheme synth_signatureScheme_inv) = allow_inversion signatureScheme; ()\n\n#pop-options\nnoextract let parse_maybe_signatureScheme_key : LP.parser _ (LP.maybe_enum_key signatureScheme_enum) =\n LP.parse_maybe_enum_key signatureScheme_repr_parser signatureScheme_enum\n\nnoextract let serialize_maybe_signatureScheme_key : LP.serializer parse_maybe_signatureScheme_key =\n LP.serialize_maybe_enum_key signatureScheme_repr_parser signatureScheme_repr_serializer signatureScheme_enum\n\nnoextract let signatureScheme_parser : LP.parser _ signatureScheme =\n lemma_synth_signatureScheme_inj ();\n parse_maybe_signatureScheme_key `LP.parse_synth` synth_signatureScheme\n\nnoextract let signatureScheme_serializer : LP.serializer signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LP.serialize_synth _ synth_signatureScheme serialize_maybe_signatureScheme_key synth_signatureScheme_inv ()\n\nlet signatureScheme_bytesize (x:signatureScheme) : GTot nat = Seq.length (signatureScheme_serializer x)\n\nlet signatureScheme_bytesize_eq x = ()\n\nlet parse32_maybe_signatureScheme_key : LS.parser32 parse_maybe_signatureScheme_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac signatureScheme_repr_parser32 signatureScheme_enum)\n\nlet signatureScheme_parser32 : LS.parser32 signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n LS.parse32_synth _ synth_signatureScheme (fun x->synth_signatureScheme x) parse32_maybe_signatureScheme_key ()\n\nlet serialize32_maybe_signatureScheme_key : LS.serializer32 serialize_maybe_signatureScheme_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n signatureScheme_repr_serializer32 signatureScheme_enum)\n\nlet signatureScheme_serializer32 : LS.serializer32 signatureScheme_serializer =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LS.serialize32_synth _ synth_signatureScheme _ serialize32_maybe_signatureScheme_key synth_signatureScheme_inv (fun x->synth_signatureScheme_inv x) ()\n\nlet signatureScheme_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond signatureScheme_serializer 2ul) in\n LSZ.size32_constant signatureScheme_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_signatureScheme_key : LL.leaf_reader parse_maybe_signatureScheme_key =\n LL.mk_read_maybe_enum_key signatureScheme_repr_reader signatureScheme_enum\n\nlet signatureScheme_reader =\n [@inline_let] let _ = lemma_synth_signatureScheme_inj () in\n LL.read_synth' parse_maybe_signatureScheme_key synth_signatureScheme read_maybe_signatureScheme_key ()", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong Parsers.SignatureScheme.serialize_maybe_signatureScheme_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.write_maybe_enum_key", "Parsers.SignatureScheme.signatureScheme", "FStar.UInt16.t", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Int.parse_u16", "LowParse.Spec.Int.serialize_u16", "Parsers.SignatureScheme.signatureScheme_repr_writer", "Parsers.SignatureScheme.signatureScheme_enum", "LowParse.Spec.Enum.enum_repr_of_key_cons'", "LowParse.Spec.Enum.enum_tail'", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val write_maybe_signatureScheme_key:LL.leaf_writer_strong serialize_maybe_signatureScheme_key\nlet write_maybe_signatureScheme_key:LL.leaf_writer_strong serialize_maybe_signatureScheme_key =", "completed_definiton": "LL.write_maybe_enum_key signatureScheme_repr_writer\n signatureScheme_enum\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.enum_repr_of_key_tac signatureScheme_enum)))", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.signatureScheme_bytesize_eqn", "original_source_type": "val signatureScheme_bytesize_eqn (x: signatureScheme) : Lemma (signatureScheme_bytesize x == 2) [SMTPat (signatureScheme_bytesize x)]", "source_type": "val signatureScheme_bytesize_eqn (x: signatureScheme) : Lemma (signatureScheme_bytesize x == 2) [SMTPat (signatureScheme_bytesize x)]", "source_definition": "let signatureScheme_bytesize_eqn x = signatureScheme_bytesize_eq x; assert (FStar.Seq.length (LP.serialize signatureScheme_serializer x) <= 2); assert (2 <= FStar.Seq.length (LP.serialize signatureScheme_serializer x))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 165, "start_col": 37, "end_line": 165, "end_col": 218 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let signatureScheme_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let signatureScheme_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_signatureScheme (x:LP.maybe_enum_key signatureScheme_enum) : signatureScheme = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n Unknown_signatureScheme v\n\ninline_for_extraction let synth_signatureScheme_inv (x:signatureScheme) : LP.maybe_enum_key signatureScheme_enum = \n match x with\n | Unknown_signatureScheme y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : signatureScheme = x in\n [@inline_let] let _ : squash(not (Unknown_signatureScheme? x1) ==> LP.list_mem x1 (LP.list_map fst signatureScheme_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key signatureScheme_enum)\n\nlet lemma_synth_signatureScheme_inv' () : Lemma\n (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme)\n= LP.forall_maybe_enum_key signatureScheme_enum (fun x -> synth_signatureScheme_inv (synth_signatureScheme x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_signatureScheme_inj () : Lemma\n (LP.synth_injective synth_signatureScheme) = \n lemma_synth_signatureScheme_inv' ();\n LP.synth_inverse_synth_injective synth_signatureScheme synth_signatureScheme_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_signatureScheme_inv () : Lemma\n (LP.synth_inverse synth_signatureScheme synth_signatureScheme_inv) = allow_inversion signatureScheme; ()\n\n#pop-options\nnoextract let parse_maybe_signatureScheme_key : LP.parser _ (LP.maybe_enum_key signatureScheme_enum) =\n LP.parse_maybe_enum_key signatureScheme_repr_parser signatureScheme_enum\n\nnoextract let serialize_maybe_signatureScheme_key : LP.serializer parse_maybe_signatureScheme_key =\n LP.serialize_maybe_enum_key signatureScheme_repr_parser signatureScheme_repr_serializer signatureScheme_enum\n\nnoextract let signatureScheme_parser : LP.parser _ signatureScheme =\n lemma_synth_signatureScheme_inj ();\n parse_maybe_signatureScheme_key `LP.parse_synth` synth_signatureScheme\n\nnoextract let signatureScheme_serializer : LP.serializer signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LP.serialize_synth _ synth_signatureScheme serialize_maybe_signatureScheme_key synth_signatureScheme_inv ()\n\nlet signatureScheme_bytesize (x:signatureScheme) : GTot nat = Seq.length (signatureScheme_serializer x)\n\nlet signatureScheme_bytesize_eq x = ()\n\nlet parse32_maybe_signatureScheme_key : LS.parser32 parse_maybe_signatureScheme_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac signatureScheme_repr_parser32 signatureScheme_enum)\n\nlet signatureScheme_parser32 : LS.parser32 signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n LS.parse32_synth _ synth_signatureScheme (fun x->synth_signatureScheme x) parse32_maybe_signatureScheme_key ()\n\nlet serialize32_maybe_signatureScheme_key : LS.serializer32 serialize_maybe_signatureScheme_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n signatureScheme_repr_serializer32 signatureScheme_enum)\n\nlet signatureScheme_serializer32 : LS.serializer32 signatureScheme_serializer =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LS.serialize32_synth _ synth_signatureScheme _ serialize32_maybe_signatureScheme_key synth_signatureScheme_inv (fun x->synth_signatureScheme_inv x) ()\n\nlet signatureScheme_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond signatureScheme_serializer 2ul) in\n LSZ.size32_constant signatureScheme_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_signatureScheme_key : LL.leaf_reader parse_maybe_signatureScheme_key =\n LL.mk_read_maybe_enum_key signatureScheme_repr_reader signatureScheme_enum\n\nlet signatureScheme_reader =\n [@inline_let] let _ = lemma_synth_signatureScheme_inj () in\n LL.read_synth' parse_maybe_signatureScheme_key synth_signatureScheme read_maybe_signatureScheme_key ()\n\ninline_for_extraction let write_maybe_signatureScheme_key : LL.leaf_writer_strong serialize_maybe_signatureScheme_key =\n LL.write_maybe_enum_key signatureScheme_repr_writer signatureScheme_enum (_ by (LP.enum_repr_of_key_tac signatureScheme_enum))\n\ninline_for_extraction let lserialize_maybe_signatureScheme_key : LL.serializer32 serialize_maybe_signatureScheme_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_signatureScheme_key 2ul ()\n\nlet signatureScheme_writer =\n [@inline_let] let _ = lemma_synth_signatureScheme_inj (); lemma_synth_signatureScheme_inv () in\n LL.write_synth write_maybe_signatureScheme_key synth_signatureScheme synth_signatureScheme_inv (fun x -> synth_signatureScheme_inv x) ()\n\nlet signatureScheme_lserializer = LL.serializer32_of_leaf_writer_strong_constant_size signatureScheme_writer 2ul ()", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.SignatureScheme.signatureScheme\n -> FStar.Pervasives.Lemma (ensures Parsers.SignatureScheme.signatureScheme_bytesize x == 2)\n [SMTPat (Parsers.SignatureScheme.signatureScheme_bytesize x)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.SignatureScheme.signatureScheme", "Prims._assert", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "Parsers.SignatureScheme.signatureScheme_parser_kind", "Parsers.SignatureScheme.signatureScheme_parser", "Parsers.SignatureScheme.signatureScheme_serializer", "Prims.unit", "Parsers.SignatureScheme.signatureScheme_bytesize_eq" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureScheme_bytesize_eqn (x: signatureScheme) : Lemma (signatureScheme_bytesize x == 2) [SMTPat (signatureScheme_bytesize x)]\nlet signatureScheme_bytesize_eqn x =", "completed_definiton": "signatureScheme_bytesize_eq x;\nassert (FStar.Seq.length (LP.serialize signatureScheme_serializer x) <= 2);\nassert (2 <= FStar.Seq.length (LP.serialize signatureScheme_serializer x))", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.serialize32_maybe_signatureScheme_key", "original_source_type": "val serialize32_maybe_signatureScheme_key:LS.serializer32 serialize_maybe_signatureScheme_key", "source_type": "val serialize32_maybe_signatureScheme_key:LS.serializer32 serialize_maybe_signatureScheme_key", "source_definition": "let serialize32_maybe_signatureScheme_key : LS.serializer32 serialize_maybe_signatureScheme_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n signatureScheme_repr_serializer32 signatureScheme_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 133, "start_col": 2, "end_line": 134, "end_col": 59 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let signatureScheme_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let signatureScheme_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_signatureScheme (x:LP.maybe_enum_key signatureScheme_enum) : signatureScheme = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n Unknown_signatureScheme v\n\ninline_for_extraction let synth_signatureScheme_inv (x:signatureScheme) : LP.maybe_enum_key signatureScheme_enum = \n match x with\n | Unknown_signatureScheme y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : signatureScheme = x in\n [@inline_let] let _ : squash(not (Unknown_signatureScheme? x1) ==> LP.list_mem x1 (LP.list_map fst signatureScheme_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key signatureScheme_enum)\n\nlet lemma_synth_signatureScheme_inv' () : Lemma\n (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme)\n= LP.forall_maybe_enum_key signatureScheme_enum (fun x -> synth_signatureScheme_inv (synth_signatureScheme x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_signatureScheme_inj () : Lemma\n (LP.synth_injective synth_signatureScheme) = \n lemma_synth_signatureScheme_inv' ();\n LP.synth_inverse_synth_injective synth_signatureScheme synth_signatureScheme_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_signatureScheme_inv () : Lemma\n (LP.synth_inverse synth_signatureScheme synth_signatureScheme_inv) = allow_inversion signatureScheme; ()\n\n#pop-options\nnoextract let parse_maybe_signatureScheme_key : LP.parser _ (LP.maybe_enum_key signatureScheme_enum) =\n LP.parse_maybe_enum_key signatureScheme_repr_parser signatureScheme_enum\n\nnoextract let serialize_maybe_signatureScheme_key : LP.serializer parse_maybe_signatureScheme_key =\n LP.serialize_maybe_enum_key signatureScheme_repr_parser signatureScheme_repr_serializer signatureScheme_enum\n\nnoextract let signatureScheme_parser : LP.parser _ signatureScheme =\n lemma_synth_signatureScheme_inj ();\n parse_maybe_signatureScheme_key `LP.parse_synth` synth_signatureScheme\n\nnoextract let signatureScheme_serializer : LP.serializer signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LP.serialize_synth _ synth_signatureScheme serialize_maybe_signatureScheme_key synth_signatureScheme_inv ()\n\nlet signatureScheme_bytesize (x:signatureScheme) : GTot nat = Seq.length (signatureScheme_serializer x)\n\nlet signatureScheme_bytesize_eq x = ()\n\nlet parse32_maybe_signatureScheme_key : LS.parser32 parse_maybe_signatureScheme_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac signatureScheme_repr_parser32 signatureScheme_enum)\n\nlet signatureScheme_parser32 : LS.parser32 signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n LS.parse32_synth _ synth_signatureScheme (fun x->synth_signatureScheme x) parse32_maybe_signatureScheme_key ()", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.SignatureScheme.serialize_maybe_signatureScheme_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Enum.serialize32_maybe_enum_key_gen", "LowParse.Spec.Int.parse_u16_kind", "Parsers.SignatureScheme.signatureScheme", "FStar.UInt16.t", "LowParse.Spec.Int.parse_u16", "LowParse.Spec.Int.serialize_u16", "Parsers.SignatureScheme.signatureScheme_repr_serializer32", "Parsers.SignatureScheme.signatureScheme_enum", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.SignatureScheme.parse_maybe_signatureScheme_key", "Parsers.SignatureScheme.serialize_maybe_signatureScheme_key", "LowParse.Spec.Enum.enum_repr_of_key_cons'", "LowParse.Spec.Enum.enum_tail'", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize32_maybe_signatureScheme_key:LS.serializer32 serialize_maybe_signatureScheme_key\nlet serialize32_maybe_signatureScheme_key:LS.serializer32 serialize_maybe_signatureScheme_key =", "completed_definiton": "FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac signatureScheme_repr_serializer32\n signatureScheme_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureScheme.fst", "name": "Parsers.SignatureScheme.parse32_maybe_signatureScheme_key", "original_source_type": "val parse32_maybe_signatureScheme_key:LS.parser32 parse_maybe_signatureScheme_key", "source_type": "val parse32_maybe_signatureScheme_key:LS.parser32 parse_maybe_signatureScheme_key", "source_definition": "let parse32_maybe_signatureScheme_key : LS.parser32 parse_maybe_signatureScheme_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac signatureScheme_repr_parser32 signatureScheme_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureScheme.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 126, "start_col": 2, "end_line": 126, "end_col": 114 }, "file_context": "module Parsers.SignatureScheme\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let signatureScheme_enum : LP.enum signatureScheme U16.t =\n [@inline_let] let e = [\n Rsa_pkcs1_md5, 257us;\n Rsa_pkcs1_sha1, 513us;\n Ecdsa_md5, 259us;\n Ecdsa_sha1, 515us;\n Rsa_pkcs1_sha256, 1025us;\n Rsa_pkcs1_sha384, 1281us;\n Rsa_pkcs1_sha512, 1537us;\n Ecdsa_secp256r1_sha256, 1027us;\n Ecdsa_secp384r1_sha384, 1283us;\n Ecdsa_secp521r1_sha512, 1539us;\n Rsa_pss_rsae_sha256, 2052us;\n Rsa_pss_rsae_sha384, 2053us;\n Rsa_pss_rsae_sha512, 2054us;\n Ed25519, 2055us;\n Ed448, 2056us;\n Rsa_pss_pss_sha256, 2057us;\n Rsa_pss_pss_sha384, 2058us;\n Rsa_pss_pss_sha512, 2059us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let signatureScheme_repr_parser = LPI.parse_u16\n\nnoextract let signatureScheme_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let signatureScheme_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let signatureScheme_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let signatureScheme_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let signatureScheme_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let signatureScheme_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_signatureScheme (x:LP.maybe_enum_key signatureScheme_enum) : signatureScheme = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n Unknown_signatureScheme v\n\ninline_for_extraction let synth_signatureScheme_inv (x:signatureScheme) : LP.maybe_enum_key signatureScheme_enum = \n match x with\n | Unknown_signatureScheme y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd signatureScheme_enum) == known_signatureScheme_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : signatureScheme = x in\n [@inline_let] let _ : squash(not (Unknown_signatureScheme? x1) ==> LP.list_mem x1 (LP.list_map fst signatureScheme_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key signatureScheme_enum)\n\nlet lemma_synth_signatureScheme_inv' () : Lemma\n (LP.synth_inverse synth_signatureScheme_inv synth_signatureScheme)\n= LP.forall_maybe_enum_key signatureScheme_enum (fun x -> synth_signatureScheme_inv (synth_signatureScheme x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_signatureScheme_inj () : Lemma\n (LP.synth_injective synth_signatureScheme) = \n lemma_synth_signatureScheme_inv' ();\n LP.synth_inverse_synth_injective synth_signatureScheme synth_signatureScheme_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_signatureScheme_inv () : Lemma\n (LP.synth_inverse synth_signatureScheme synth_signatureScheme_inv) = allow_inversion signatureScheme; ()\n\n#pop-options\nnoextract let parse_maybe_signatureScheme_key : LP.parser _ (LP.maybe_enum_key signatureScheme_enum) =\n LP.parse_maybe_enum_key signatureScheme_repr_parser signatureScheme_enum\n\nnoextract let serialize_maybe_signatureScheme_key : LP.serializer parse_maybe_signatureScheme_key =\n LP.serialize_maybe_enum_key signatureScheme_repr_parser signatureScheme_repr_serializer signatureScheme_enum\n\nnoextract let signatureScheme_parser : LP.parser _ signatureScheme =\n lemma_synth_signatureScheme_inj ();\n parse_maybe_signatureScheme_key `LP.parse_synth` synth_signatureScheme\n\nnoextract let signatureScheme_serializer : LP.serializer signatureScheme_parser =\n lemma_synth_signatureScheme_inj ();\n lemma_synth_signatureScheme_inv ();\n LP.serialize_synth _ synth_signatureScheme serialize_maybe_signatureScheme_key synth_signatureScheme_inv ()\n\nlet signatureScheme_bytesize (x:signatureScheme) : GTot nat = Seq.length (signatureScheme_serializer x)\n\nlet signatureScheme_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.SignatureScheme.fst", "checked_file": "Parsers.SignatureScheme.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.SignatureScheme.parse_maybe_signatureScheme_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Enum.parse32_maybe_enum_key_gen", "LowParse.Spec.Int.parse_u16_kind", "Parsers.SignatureScheme.signatureScheme", "FStar.UInt16.t", "LowParse.Spec.Int.parse_u16", "Parsers.SignatureScheme.signatureScheme_repr_parser32", "Parsers.SignatureScheme.signatureScheme_enum", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.SignatureScheme.parse_maybe_signatureScheme_key", "LowParse.Spec.Enum.maybe_enum_key_of_repr'_t_cons'", "LowParse.Spec.Enum.enum_tail'", "LowParse.Spec.Enum.maybe_enum_key_of_repr'_t_cons_nil'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse32_maybe_signatureScheme_key:LS.parser32 parse_maybe_signatureScheme_key\nlet parse32_maybe_signatureScheme_key:LS.parser32 parse_maybe_signatureScheme_key =", "completed_definiton": "FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac signatureScheme_repr_parser32\n signatureScheme_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroupList.fst", "name": "Parsers.NamedGroupList.pre", "original_source_type": "val pre:squash (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true)", "source_type": "val pre:squash (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true)", "source_definition": "let pre : squash (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroupList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 23, "start_col": 97, "end_line": 23, "end_col": 126 }, "file_context": "module Parsers.NamedGroupList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"", "dependencies": { "source_file": "Parsers.NamedGroupList.fst", "checked_file": "Parsers.NamedGroupList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.squash (LowParse.Spec.Array.vldata_vlarray_precond 2\n 65535\n Parsers.NamedGroup.namedGroup_parser\n 1\n 32767 ==\n true)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val pre:squash (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true)\nlet pre:squash (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) =", "completed_definiton": "FStar.Tactics.Effect.synth_by_tactic (fun _ -> (FStar.Tactics.trefl ()))", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroupList.fst", "name": "Parsers.NamedGroupList.namedGroupList_bytesize", "original_source_type": "val namedGroupList_bytesize (x:namedGroupList) : GTot nat", "source_type": "val namedGroupList_bytesize (x:namedGroupList) : GTot nat", "source_definition": "let namedGroupList_bytesize (x:namedGroupList) : GTot nat = Seq.length (namedGroupList_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroupList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 31, "start_col": 60, "end_line": 31, "end_col": 100 }, "file_context": "module Parsers.NamedGroupList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet namedGroupList_parser =\n LP.parse_vlarray 2 65535 namedGroup_serializer 1 32767 ()\n\nlet namedGroupList_serializer =\n LP.serialize_vlarray 2 65535 namedGroup_serializer 1 32767 ()", "dependencies": { "source_file": "Parsers.NamedGroupList.fst", "checked_file": "Parsers.NamedGroupList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.NamedGroupList.namedGroupList -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.NamedGroupList.namedGroupList", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.NamedGroupList.namedGroupList_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroupList_bytesize (x:namedGroupList) : GTot nat\nlet namedGroupList_bytesize (x: namedGroupList) : GTot nat =", "completed_definiton": "Seq.length (namedGroupList_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroupList.fst", "name": "Parsers.NamedGroupList.namedGroupList_parser32", "original_source_type": "val namedGroupList_parser32: LS.parser32 namedGroupList_parser", "source_type": "val namedGroupList_parser32: LS.parser32 namedGroupList_parser", "source_definition": "let namedGroupList_parser32 =\n LS.parse32_vlarray 2 2ul 65535 65535ul namedGroup_serializer namedGroup_parser32 1 32767 ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroupList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 36, "start_col": 2, "end_line": 36, "end_col": 93 }, "file_context": "module Parsers.NamedGroupList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet namedGroupList_parser =\n LP.parse_vlarray 2 65535 namedGroup_serializer 1 32767 ()\n\nlet namedGroupList_serializer =\n LP.serialize_vlarray 2 65535 namedGroup_serializer 1 32767 ()\n\nlet namedGroupList_bytesize (x:namedGroupList) : GTot nat = Seq.length (namedGroupList_serializer x)\n\nlet namedGroupList_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.NamedGroupList.fst", "checked_file": "Parsers.NamedGroupList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.NamedGroupList.namedGroupList_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Array.parse32_vlarray", "FStar.UInt32.__uint_to_t", "Parsers.NamedGroup.namedGroup_parser_kind", "Parsers.NamedGroup.namedGroup", "Parsers.NamedGroup.namedGroup_parser", "Parsers.NamedGroup.namedGroup_serializer", "Parsers.NamedGroup.namedGroup_parser32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroupList_parser32: LS.parser32 namedGroupList_parser\nlet namedGroupList_parser32 =", "completed_definiton": "LS.parse32_vlarray 2 2ul 65535 65535ul namedGroup_serializer namedGroup_parser32 1 32767 ()", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroupList.fst", "name": "Parsers.NamedGroupList.namedGroupList_nth_ghost", "original_source_type": "val namedGroupList_nth_ghost (i: nat) : Tot (LL.gaccessor namedGroupList_parser namedGroup_parser (namedGroupList_clens_nth i))", "source_type": "val namedGroupList_nth_ghost (i: nat) : Tot (LL.gaccessor namedGroupList_parser namedGroup_parser (namedGroupList_clens_nth i))", "source_definition": "let namedGroupList_nth_ghost i = LL.vlarray_nth_ghost 2 65535 namedGroup_serializer 1 32767 i", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroupList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 58, "start_col": 33, "end_line": 58, "end_col": 93 }, "file_context": "module Parsers.NamedGroupList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet namedGroupList_parser =\n LP.parse_vlarray 2 65535 namedGroup_serializer 1 32767 ()\n\nlet namedGroupList_serializer =\n LP.serialize_vlarray 2 65535 namedGroup_serializer 1 32767 ()\n\nlet namedGroupList_bytesize (x:namedGroupList) : GTot nat = Seq.length (namedGroupList_serializer x)\n\nlet namedGroupList_bytesize_eq x = ()\n\nlet namedGroupList_parser32 =\n LS.parse32_vlarray 2 2ul 65535 65535ul namedGroup_serializer namedGroup_parser32 1 32767 ()\n\nlet namedGroupList_serializer32 =\n LS.serialize32_vlarray 2 65535 #_ #_ #_ #namedGroup_serializer namedGroup_serializer32 1 32767 ()\n\nlet namedGroupList_size32 =\n [@inline_let] let _ = assert_norm (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) in\n LSZ.size32_vlarray 2 65535 namedGroup_serializer 1 32767 () 2ul 2ul\n\nlet namedGroupList_validator =\n LL.validate_vlarray 2 65535 namedGroup_serializer namedGroup_validator 1 32767 () 2ul\n\nlet namedGroupList_jumper =\n LL.jump_vlarray 2 65535 namedGroup_serializer 1 32767 () 2ul\n\nlet _ : squash (namedGroupList == LL.vlarray namedGroup 1 32767) = _ by (FStar.Tactics.trefl ())\n\nlet finalize_namedGroupList #_ #_ sl pos pos' =\n LL.finalize_vlarray 2 65535 namedGroup_serializer 1 32767 sl pos pos'\n\nlet namedGroupList_count #_ #_ input pos = LL.vlarray_list_length 2 65535 namedGroup_serializer 1 32767 input pos", "dependencies": { "source_file": "Parsers.NamedGroupList.fst", "checked_file": "Parsers.NamedGroupList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: Prims.nat\n -> LowParse.Low.Base.Spec.gaccessor Parsers.NamedGroupList.namedGroupList_parser\n Parsers.NamedGroup.namedGroup_parser\n (Parsers.NamedGroupList.namedGroupList_clens_nth i)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "LowParse.Low.Array.vlarray_nth_ghost", "Parsers.NamedGroup.namedGroup_parser_kind", "Parsers.NamedGroup.namedGroup", "Parsers.NamedGroup.namedGroup_parser", "Parsers.NamedGroup.namedGroup_serializer", "LowParse.Low.Base.Spec.gaccessor", "Parsers.NamedGroupList.namedGroupList_parser_kind", "Parsers.NamedGroupList.namedGroupList", "Parsers.NamedGroupList.namedGroupList_parser", "Parsers.NamedGroupList.namedGroupList_clens_nth" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroupList_nth_ghost (i: nat) : Tot (LL.gaccessor namedGroupList_parser namedGroup_parser (namedGroupList_clens_nth i))\nlet namedGroupList_nth_ghost i =", "completed_definiton": "LL.vlarray_nth_ghost 2 65535 namedGroup_serializer 1 32767 i", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroupList.fst", "name": "Parsers.NamedGroupList.namedGroupList_serializer", "original_source_type": "val namedGroupList_serializer: LP.serializer namedGroupList_parser", "source_type": "val namedGroupList_serializer: LP.serializer namedGroupList_parser", "source_definition": "let namedGroupList_serializer =\n LP.serialize_vlarray 2 65535 namedGroup_serializer 1 32767 ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroupList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 29, "start_col": 2, "end_line": 29, "end_col": 63 }, "file_context": "module Parsers.NamedGroupList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet namedGroupList_parser =\n LP.parse_vlarray 2 65535 namedGroup_serializer 1 32767 ()", "dependencies": { "source_file": "Parsers.NamedGroupList.fst", "checked_file": "Parsers.NamedGroupList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.NamedGroupList.namedGroupList_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Array.serialize_vlarray", "Parsers.NamedGroup.namedGroup_parser_kind", "Parsers.NamedGroup.namedGroup", "Parsers.NamedGroup.namedGroup_parser", "Parsers.NamedGroup.namedGroup_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroupList_serializer: LP.serializer namedGroupList_parser\nlet namedGroupList_serializer =", "completed_definiton": "LP.serialize_vlarray 2 65535 namedGroup_serializer 1 32767 ()", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroupList.fst", "name": "Parsers.NamedGroupList.namedGroupList_serializer32", "original_source_type": "val namedGroupList_serializer32: LS.serializer32 namedGroupList_serializer", "source_type": "val namedGroupList_serializer32: LS.serializer32 namedGroupList_serializer", "source_definition": "let namedGroupList_serializer32 =\n LS.serialize32_vlarray 2 65535 #_ #_ #_ #namedGroup_serializer namedGroup_serializer32 1 32767 ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroupList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 39, "start_col": 2, "end_line": 39, "end_col": 99 }, "file_context": "module Parsers.NamedGroupList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet namedGroupList_parser =\n LP.parse_vlarray 2 65535 namedGroup_serializer 1 32767 ()\n\nlet namedGroupList_serializer =\n LP.serialize_vlarray 2 65535 namedGroup_serializer 1 32767 ()\n\nlet namedGroupList_bytesize (x:namedGroupList) : GTot nat = Seq.length (namedGroupList_serializer x)\n\nlet namedGroupList_bytesize_eq x = ()\n\nlet namedGroupList_parser32 =\n LS.parse32_vlarray 2 2ul 65535 65535ul namedGroup_serializer namedGroup_parser32 1 32767 ()", "dependencies": { "source_file": "Parsers.NamedGroupList.fst", "checked_file": "Parsers.NamedGroupList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.NamedGroupList.namedGroupList_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Array.serialize32_vlarray", "Parsers.NamedGroup.namedGroup_parser_kind", "Parsers.NamedGroup.namedGroup", "Parsers.NamedGroup.namedGroup_parser", "Parsers.NamedGroup.namedGroup_serializer", "Parsers.NamedGroup.namedGroup_serializer32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroupList_serializer32: LS.serializer32 namedGroupList_serializer\nlet namedGroupList_serializer32 =", "completed_definiton": "LS.serialize32_vlarray 2 65535 #_ #_ #_ #namedGroup_serializer namedGroup_serializer32 1 32767 ()", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroupList.fst", "name": "Parsers.NamedGroupList.namedGroupList_size32", "original_source_type": "val namedGroupList_size32: LSZ.size32 namedGroupList_serializer", "source_type": "val namedGroupList_size32: LSZ.size32 namedGroupList_serializer", "source_definition": "let namedGroupList_size32 =\n [@inline_let] let _ = assert_norm (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) in\n LSZ.size32_vlarray 2 65535 namedGroup_serializer 1 32767 () 2ul 2ul", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroupList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 42, "start_col": 2, "end_line": 43, "end_col": 69 }, "file_context": "module Parsers.NamedGroupList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet namedGroupList_parser =\n LP.parse_vlarray 2 65535 namedGroup_serializer 1 32767 ()\n\nlet namedGroupList_serializer =\n LP.serialize_vlarray 2 65535 namedGroup_serializer 1 32767 ()\n\nlet namedGroupList_bytesize (x:namedGroupList) : GTot nat = Seq.length (namedGroupList_serializer x)\n\nlet namedGroupList_bytesize_eq x = ()\n\nlet namedGroupList_parser32 =\n LS.parse32_vlarray 2 2ul 65535 65535ul namedGroup_serializer namedGroup_parser32 1 32767 ()\n\nlet namedGroupList_serializer32 =\n LS.serialize32_vlarray 2 65535 #_ #_ #_ #namedGroup_serializer namedGroup_serializer32 1 32767 ()", "dependencies": { "source_file": "Parsers.NamedGroupList.fst", "checked_file": "Parsers.NamedGroupList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.NamedGroupList.namedGroupList_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Array.size32_vlarray", "Parsers.NamedGroup.namedGroup_parser_kind", "Parsers.NamedGroup.namedGroup", "Parsers.NamedGroup.namedGroup_parser", "Parsers.NamedGroup.namedGroup_serializer", "FStar.UInt32.__uint_to_t", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.bool", "LowParse.Spec.Array.vldata_vlarray_precond" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroupList_size32: LSZ.size32 namedGroupList_serializer\nlet namedGroupList_size32 =", "completed_definiton": "[@@ inline_let ]let _ =\n assert_norm (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true)\nin\nLSZ.size32_vlarray 2 65535 namedGroup_serializer 1 32767 () 2ul 2ul", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroupList.fst", "name": "Parsers.NamedGroupList.namedGroupList_jumper", "original_source_type": "val namedGroupList_jumper: LL.jumper namedGroupList_parser", "source_type": "val namedGroupList_jumper: LL.jumper namedGroupList_parser", "source_definition": "let namedGroupList_jumper =\n LL.jump_vlarray 2 65535 namedGroup_serializer 1 32767 () 2ul", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroupList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 49, "start_col": 1, "end_line": 49, "end_col": 61 }, "file_context": "module Parsers.NamedGroupList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet namedGroupList_parser =\n LP.parse_vlarray 2 65535 namedGroup_serializer 1 32767 ()\n\nlet namedGroupList_serializer =\n LP.serialize_vlarray 2 65535 namedGroup_serializer 1 32767 ()\n\nlet namedGroupList_bytesize (x:namedGroupList) : GTot nat = Seq.length (namedGroupList_serializer x)\n\nlet namedGroupList_bytesize_eq x = ()\n\nlet namedGroupList_parser32 =\n LS.parse32_vlarray 2 2ul 65535 65535ul namedGroup_serializer namedGroup_parser32 1 32767 ()\n\nlet namedGroupList_serializer32 =\n LS.serialize32_vlarray 2 65535 #_ #_ #_ #namedGroup_serializer namedGroup_serializer32 1 32767 ()\n\nlet namedGroupList_size32 =\n [@inline_let] let _ = assert_norm (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) in\n LSZ.size32_vlarray 2 65535 namedGroup_serializer 1 32767 () 2ul 2ul\n\nlet namedGroupList_validator =\n LL.validate_vlarray 2 65535 namedGroup_serializer namedGroup_validator 1 32767 () 2ul", "dependencies": { "source_file": "Parsers.NamedGroupList.fst", "checked_file": "Parsers.NamedGroupList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.NamedGroupList.namedGroupList_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Array.jump_vlarray", "Parsers.NamedGroup.namedGroup_parser_kind", "Parsers.NamedGroup.namedGroup", "Parsers.NamedGroup.namedGroup_parser", "Parsers.NamedGroup.namedGroup_serializer", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroupList_jumper: LL.jumper namedGroupList_parser\nlet namedGroupList_jumper =", "completed_definiton": "LL.jump_vlarray 2 65535 namedGroup_serializer 1 32767 () 2ul", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroupList.fst", "name": "Parsers.NamedGroupList.namedGroupList_parser", "original_source_type": "val namedGroupList_parser: LP.parser namedGroupList_parser_kind namedGroupList", "source_type": "val namedGroupList_parser: LP.parser namedGroupList_parser_kind namedGroupList", "source_definition": "let namedGroupList_parser =\n LP.parse_vlarray 2 65535 namedGroup_serializer 1 32767 ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroupList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 26, "start_col": 2, "end_line": 26, "end_col": 59 }, "file_context": "module Parsers.NamedGroupList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())", "dependencies": { "source_file": "Parsers.NamedGroupList.fst", "checked_file": "Parsers.NamedGroupList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.NamedGroupList.namedGroupList_parser_kind\n Parsers.NamedGroupList.namedGroupList", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Array.parse_vlarray", "Parsers.NamedGroup.namedGroup_parser_kind", "Parsers.NamedGroup.namedGroup", "Parsers.NamedGroup.namedGroup_parser", "Parsers.NamedGroup.namedGroup_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroupList_parser: LP.parser namedGroupList_parser_kind namedGroupList\nlet namedGroupList_parser =", "completed_definiton": "LP.parse_vlarray 2 65535 namedGroup_serializer 1 32767 ()", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroupList.fst", "name": "Parsers.NamedGroupList.namedGroupList_bytesize_eqn", "original_source_type": "val namedGroupList_bytesize_eqn (x: namedGroupList) : Lemma (namedGroupList_bytesize x == 2 + (L.length x `FStar.Mul.op_Star` 2)) [SMTPat (namedGroupList_bytesize x)]", "source_type": "val namedGroupList_bytesize_eqn (x: namedGroupList) : Lemma (namedGroupList_bytesize x == 2 + (L.length x `FStar.Mul.op_Star` 2)) [SMTPat (namedGroupList_bytesize x)]", "source_definition": "let namedGroupList_bytesize_eqn x = LP.length_serialize_vlarray 2 65535 namedGroup_serializer 1 32767 () x", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroupList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 62, "start_col": 36, "end_line": 62, "end_col": 106 }, "file_context": "module Parsers.NamedGroupList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet namedGroupList_parser =\n LP.parse_vlarray 2 65535 namedGroup_serializer 1 32767 ()\n\nlet namedGroupList_serializer =\n LP.serialize_vlarray 2 65535 namedGroup_serializer 1 32767 ()\n\nlet namedGroupList_bytesize (x:namedGroupList) : GTot nat = Seq.length (namedGroupList_serializer x)\n\nlet namedGroupList_bytesize_eq x = ()\n\nlet namedGroupList_parser32 =\n LS.parse32_vlarray 2 2ul 65535 65535ul namedGroup_serializer namedGroup_parser32 1 32767 ()\n\nlet namedGroupList_serializer32 =\n LS.serialize32_vlarray 2 65535 #_ #_ #_ #namedGroup_serializer namedGroup_serializer32 1 32767 ()\n\nlet namedGroupList_size32 =\n [@inline_let] let _ = assert_norm (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) in\n LSZ.size32_vlarray 2 65535 namedGroup_serializer 1 32767 () 2ul 2ul\n\nlet namedGroupList_validator =\n LL.validate_vlarray 2 65535 namedGroup_serializer namedGroup_validator 1 32767 () 2ul\n\nlet namedGroupList_jumper =\n LL.jump_vlarray 2 65535 namedGroup_serializer 1 32767 () 2ul\n\nlet _ : squash (namedGroupList == LL.vlarray namedGroup 1 32767) = _ by (FStar.Tactics.trefl ())\n\nlet finalize_namedGroupList #_ #_ sl pos pos' =\n LL.finalize_vlarray 2 65535 namedGroup_serializer 1 32767 sl pos pos'\n\nlet namedGroupList_count #_ #_ input pos = LL.vlarray_list_length 2 65535 namedGroup_serializer 1 32767 input pos\n\nlet namedGroupList_nth_ghost i = LL.vlarray_nth_ghost 2 65535 namedGroup_serializer 1 32767 i\n\nlet namedGroupList_nth i = LL.vlarray_nth 2 65535 namedGroup_serializer 1 32767 i", "dependencies": { "source_file": "Parsers.NamedGroupList.fst", "checked_file": "Parsers.NamedGroupList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.NamedGroupList.namedGroupList\n -> FStar.Pervasives.Lemma\n (ensures\n Parsers.NamedGroupList.namedGroupList_bytesize x == 2 + FStar.List.Tot.Base.length x * 2)\n [SMTPat (Parsers.NamedGroupList.namedGroupList_bytesize x)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.NamedGroupList.namedGroupList", "LowParse.Spec.Array.length_serialize_vlarray", "Parsers.NamedGroup.namedGroup_parser_kind", "Parsers.NamedGroup.namedGroup", "Parsers.NamedGroup.namedGroup_parser", "Parsers.NamedGroup.namedGroup_serializer", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroupList_bytesize_eqn (x: namedGroupList) : Lemma (namedGroupList_bytesize x == 2 + (L.length x `FStar.Mul.op_Star` 2)) [SMTPat (namedGroupList_bytesize x)]\nlet namedGroupList_bytesize_eqn x =", "completed_definiton": "LP.length_serialize_vlarray 2 65535 namedGroup_serializer 1 32767 () x", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroupList.fst", "name": "Parsers.NamedGroupList.namedGroupList_validator", "original_source_type": "val namedGroupList_validator: LL.validator namedGroupList_parser", "source_type": "val namedGroupList_validator: LL.validator namedGroupList_parser", "source_definition": "let namedGroupList_validator =\n LL.validate_vlarray 2 65535 namedGroup_serializer namedGroup_validator 1 32767 () 2ul", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroupList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 46, "start_col": 1, "end_line": 46, "end_col": 86 }, "file_context": "module Parsers.NamedGroupList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet namedGroupList_parser =\n LP.parse_vlarray 2 65535 namedGroup_serializer 1 32767 ()\n\nlet namedGroupList_serializer =\n LP.serialize_vlarray 2 65535 namedGroup_serializer 1 32767 ()\n\nlet namedGroupList_bytesize (x:namedGroupList) : GTot nat = Seq.length (namedGroupList_serializer x)\n\nlet namedGroupList_bytesize_eq x = ()\n\nlet namedGroupList_parser32 =\n LS.parse32_vlarray 2 2ul 65535 65535ul namedGroup_serializer namedGroup_parser32 1 32767 ()\n\nlet namedGroupList_serializer32 =\n LS.serialize32_vlarray 2 65535 #_ #_ #_ #namedGroup_serializer namedGroup_serializer32 1 32767 ()\n\nlet namedGroupList_size32 =\n [@inline_let] let _ = assert_norm (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) in\n LSZ.size32_vlarray 2 65535 namedGroup_serializer 1 32767 () 2ul 2ul", "dependencies": { "source_file": "Parsers.NamedGroupList.fst", "checked_file": "Parsers.NamedGroupList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.NamedGroupList.namedGroupList_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Array.validate_vlarray", "Parsers.NamedGroup.namedGroup_parser_kind", "Parsers.NamedGroup.namedGroup", "Parsers.NamedGroup.namedGroup_parser", "Parsers.NamedGroup.namedGroup_serializer", "Parsers.NamedGroup.namedGroup_validator", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroupList_validator: LL.validator namedGroupList_parser\nlet namedGroupList_validator =", "completed_definiton": "LL.validate_vlarray 2 65535 namedGroup_serializer namedGroup_validator 1 32767 () 2ul", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroupList.fst", "name": "Parsers.NamedGroupList.namedGroupList_nth", "original_source_type": "val namedGroupList_nth (i: U32.t) : Tot (LL.accessor (namedGroupList_nth_ghost (U32.v i)))", "source_type": "val namedGroupList_nth (i: U32.t) : Tot (LL.accessor (namedGroupList_nth_ghost (U32.v i)))", "source_definition": "let namedGroupList_nth i = LL.vlarray_nth 2 65535 namedGroup_serializer 1 32767 i", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroupList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 60, "start_col": 27, "end_line": 60, "end_col": 81 }, "file_context": "module Parsers.NamedGroupList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet namedGroupList_parser =\n LP.parse_vlarray 2 65535 namedGroup_serializer 1 32767 ()\n\nlet namedGroupList_serializer =\n LP.serialize_vlarray 2 65535 namedGroup_serializer 1 32767 ()\n\nlet namedGroupList_bytesize (x:namedGroupList) : GTot nat = Seq.length (namedGroupList_serializer x)\n\nlet namedGroupList_bytesize_eq x = ()\n\nlet namedGroupList_parser32 =\n LS.parse32_vlarray 2 2ul 65535 65535ul namedGroup_serializer namedGroup_parser32 1 32767 ()\n\nlet namedGroupList_serializer32 =\n LS.serialize32_vlarray 2 65535 #_ #_ #_ #namedGroup_serializer namedGroup_serializer32 1 32767 ()\n\nlet namedGroupList_size32 =\n [@inline_let] let _ = assert_norm (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) in\n LSZ.size32_vlarray 2 65535 namedGroup_serializer 1 32767 () 2ul 2ul\n\nlet namedGroupList_validator =\n LL.validate_vlarray 2 65535 namedGroup_serializer namedGroup_validator 1 32767 () 2ul\n\nlet namedGroupList_jumper =\n LL.jump_vlarray 2 65535 namedGroup_serializer 1 32767 () 2ul\n\nlet _ : squash (namedGroupList == LL.vlarray namedGroup 1 32767) = _ by (FStar.Tactics.trefl ())\n\nlet finalize_namedGroupList #_ #_ sl pos pos' =\n LL.finalize_vlarray 2 65535 namedGroup_serializer 1 32767 sl pos pos'\n\nlet namedGroupList_count #_ #_ input pos = LL.vlarray_list_length 2 65535 namedGroup_serializer 1 32767 input pos\n\nlet namedGroupList_nth_ghost i = LL.vlarray_nth_ghost 2 65535 namedGroup_serializer 1 32767 i", "dependencies": { "source_file": "Parsers.NamedGroupList.fst", "checked_file": "Parsers.NamedGroupList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: FStar.UInt32.t\n -> LowParse.Low.Base.accessor (Parsers.NamedGroupList.namedGroupList_nth_ghost (FStar.UInt32.v i))", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "LowParse.Low.Array.vlarray_nth", "Parsers.NamedGroup.namedGroup_parser_kind", "Parsers.NamedGroup.namedGroup", "Parsers.NamedGroup.namedGroup_parser", "Parsers.NamedGroup.namedGroup_serializer", "LowParse.Low.Base.accessor", "Parsers.NamedGroupList.namedGroupList_parser_kind", "Parsers.NamedGroupList.namedGroupList", "Parsers.NamedGroupList.namedGroupList_parser", "Parsers.NamedGroupList.namedGroupList_clens_nth", "FStar.UInt32.v", "Parsers.NamedGroupList.namedGroupList_nth_ghost" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroupList_nth (i: U32.t) : Tot (LL.accessor (namedGroupList_nth_ghost (U32.v i)))\nlet namedGroupList_nth i =", "completed_definiton": "LL.vlarray_nth 2 65535 namedGroup_serializer 1 32767 i", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroupList.fst", "name": "Parsers.NamedGroupList.namedGroupList_count", "original_source_type": "val namedGroupList_count (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid namedGroupList_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents namedGroupList_parser h input pos in\n let pos' = LL.get_valid_pos namedGroupList_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v res == L.length x /\\\n U32.v pos' == U32.v pos + 2 + (U32.v res `FStar.Mul.op_Star` 2) /\\\n LL.valid_list namedGroup_parser h input (pos `U32.add` 2ul) pos' /\\\n LL.contents_list namedGroup_parser h input (pos `U32.add` 2ul) pos' == x\n ))", "source_type": "val namedGroupList_count (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid namedGroupList_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents namedGroupList_parser h input pos in\n let pos' = LL.get_valid_pos namedGroupList_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v res == L.length x /\\\n U32.v pos' == U32.v pos + 2 + (U32.v res `FStar.Mul.op_Star` 2) /\\\n LL.valid_list namedGroup_parser h input (pos `U32.add` 2ul) pos' /\\\n LL.contents_list namedGroup_parser h input (pos `U32.add` 2ul) pos' == x\n ))", "source_definition": "let namedGroupList_count #_ #_ input pos = LL.vlarray_list_length 2 65535 namedGroup_serializer 1 32767 input pos", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroupList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 56, "start_col": 43, "end_line": 56, "end_col": 113 }, "file_context": "module Parsers.NamedGroupList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet namedGroupList_parser =\n LP.parse_vlarray 2 65535 namedGroup_serializer 1 32767 ()\n\nlet namedGroupList_serializer =\n LP.serialize_vlarray 2 65535 namedGroup_serializer 1 32767 ()\n\nlet namedGroupList_bytesize (x:namedGroupList) : GTot nat = Seq.length (namedGroupList_serializer x)\n\nlet namedGroupList_bytesize_eq x = ()\n\nlet namedGroupList_parser32 =\n LS.parse32_vlarray 2 2ul 65535 65535ul namedGroup_serializer namedGroup_parser32 1 32767 ()\n\nlet namedGroupList_serializer32 =\n LS.serialize32_vlarray 2 65535 #_ #_ #_ #namedGroup_serializer namedGroup_serializer32 1 32767 ()\n\nlet namedGroupList_size32 =\n [@inline_let] let _ = assert_norm (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) in\n LSZ.size32_vlarray 2 65535 namedGroup_serializer 1 32767 () 2ul 2ul\n\nlet namedGroupList_validator =\n LL.validate_vlarray 2 65535 namedGroup_serializer namedGroup_validator 1 32767 () 2ul\n\nlet namedGroupList_jumper =\n LL.jump_vlarray 2 65535 namedGroup_serializer 1 32767 () 2ul\n\nlet _ : squash (namedGroupList == LL.vlarray namedGroup 1 32767) = _ by (FStar.Tactics.trefl ())\n\nlet finalize_namedGroupList #_ #_ sl pos pos' =\n LL.finalize_vlarray 2 65535 namedGroup_serializer 1 32767 sl pos pos'", "dependencies": { "source_file": "Parsers.NamedGroupList.fst", "checked_file": "Parsers.NamedGroupList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "input: LowParse.Slice.slice rrel rel -> pos: FStar.UInt32.t\n -> FStar.HyperStack.ST.Stack FStar.UInt32.t", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "LowParse.Low.Array.vlarray_list_length", "Parsers.NamedGroup.namedGroup_parser_kind", "Parsers.NamedGroup.namedGroup", "Parsers.NamedGroup.namedGroup_parser", "Parsers.NamedGroup.namedGroup_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroupList_count (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid namedGroupList_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents namedGroupList_parser h input pos in\n let pos' = LL.get_valid_pos namedGroupList_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v res == L.length x /\\\n U32.v pos' == U32.v pos + 2 + (U32.v res `FStar.Mul.op_Star` 2) /\\\n LL.valid_list namedGroup_parser h input (pos `U32.add` 2ul) pos' /\\\n LL.contents_list namedGroup_parser h input (pos `U32.add` 2ul) pos' == x\n ))\nlet namedGroupList_count #_ #_ input pos =", "completed_definiton": "LL.vlarray_list_length 2 65535 namedGroup_serializer 1 32767 input pos", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroupList.fst", "name": "Parsers.NamedGroupList.finalize_namedGroupList", "original_source_type": "val finalize_namedGroupList (#rrel: _) (#rel: _) (sl: LL.slice rrel rel) (pos pos' : U32.t) : HST.Stack unit\n(requires (fun h ->\n U32.v pos + 2 < 4294967296 /\\\n LL.writable sl.LL.base (U32.v pos) (U32.v pos + 2) h /\\\n LL.valid_list namedGroup_parser h sl (pos `U32.add` 2ul) pos' /\\ (\n let count = L.length (LL.contents_list namedGroup_parser h sl (pos `U32.add` 2ul) pos') in\n let len = U32.v pos' - (U32.v pos + 2) in\n ((2 <= len /\\ len <= 65535) \\/ (1 <= count /\\ count <= 32767))\n)))\n(ensures (fun h _ h' ->\n B.modifies (LL.loc_slice_from_to sl pos (pos `U32.add` 2ul)) h h' /\\ (\n let l = LL.contents_list namedGroup_parser h sl (pos `U32.add` 2ul) pos' in\n 1 <= L.length l /\\ L.length l <= 32767 /\\\n LL.valid_content_pos namedGroupList_parser h' sl pos l pos'\n)))", "source_type": "val finalize_namedGroupList (#rrel: _) (#rel: _) (sl: LL.slice rrel rel) (pos pos' : U32.t) : HST.Stack unit\n(requires (fun h ->\n U32.v pos + 2 < 4294967296 /\\\n LL.writable sl.LL.base (U32.v pos) (U32.v pos + 2) h /\\\n LL.valid_list namedGroup_parser h sl (pos `U32.add` 2ul) pos' /\\ (\n let count = L.length (LL.contents_list namedGroup_parser h sl (pos `U32.add` 2ul) pos') in\n let len = U32.v pos' - (U32.v pos + 2) in\n ((2 <= len /\\ len <= 65535) \\/ (1 <= count /\\ count <= 32767))\n)))\n(ensures (fun h _ h' ->\n B.modifies (LL.loc_slice_from_to sl pos (pos `U32.add` 2ul)) h h' /\\ (\n let l = LL.contents_list namedGroup_parser h sl (pos `U32.add` 2ul) pos' in\n 1 <= L.length l /\\ L.length l <= 32767 /\\\n LL.valid_content_pos namedGroupList_parser h' sl pos l pos'\n)))", "source_definition": "let finalize_namedGroupList #_ #_ sl pos pos' =\n LL.finalize_vlarray 2 65535 namedGroup_serializer 1 32767 sl pos pos'", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroupList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 54, "start_col": 2, "end_line": 54, "end_col": 71 }, "file_context": "module Parsers.NamedGroupList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet namedGroupList_parser =\n LP.parse_vlarray 2 65535 namedGroup_serializer 1 32767 ()\n\nlet namedGroupList_serializer =\n LP.serialize_vlarray 2 65535 namedGroup_serializer 1 32767 ()\n\nlet namedGroupList_bytesize (x:namedGroupList) : GTot nat = Seq.length (namedGroupList_serializer x)\n\nlet namedGroupList_bytesize_eq x = ()\n\nlet namedGroupList_parser32 =\n LS.parse32_vlarray 2 2ul 65535 65535ul namedGroup_serializer namedGroup_parser32 1 32767 ()\n\nlet namedGroupList_serializer32 =\n LS.serialize32_vlarray 2 65535 #_ #_ #_ #namedGroup_serializer namedGroup_serializer32 1 32767 ()\n\nlet namedGroupList_size32 =\n [@inline_let] let _ = assert_norm (LP.vldata_vlarray_precond 2 65535 namedGroup_parser 1 32767 == true) in\n LSZ.size32_vlarray 2 65535 namedGroup_serializer 1 32767 () 2ul 2ul\n\nlet namedGroupList_validator =\n LL.validate_vlarray 2 65535 namedGroup_serializer namedGroup_validator 1 32767 () 2ul\n\nlet namedGroupList_jumper =\n LL.jump_vlarray 2 65535 namedGroup_serializer 1 32767 () 2ul\n\nlet _ : squash (namedGroupList == LL.vlarray namedGroup 1 32767) = _ by (FStar.Tactics.trefl ())", "dependencies": { "source_file": "Parsers.NamedGroupList.fst", "checked_file": "Parsers.NamedGroupList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "sl: LowParse.Slice.slice rrel rel -> pos: FStar.UInt32.t -> pos': FStar.UInt32.t\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "LowParse.Low.Array.finalize_vlarray", "Parsers.NamedGroup.namedGroup_parser_kind", "Parsers.NamedGroup.namedGroup", "Parsers.NamedGroup.namedGroup_parser", "Parsers.NamedGroup.namedGroup_serializer", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val finalize_namedGroupList (#rrel: _) (#rel: _) (sl: LL.slice rrel rel) (pos pos' : U32.t) : HST.Stack unit\n(requires (fun h ->\n U32.v pos + 2 < 4294967296 /\\\n LL.writable sl.LL.base (U32.v pos) (U32.v pos + 2) h /\\\n LL.valid_list namedGroup_parser h sl (pos `U32.add` 2ul) pos' /\\ (\n let count = L.length (LL.contents_list namedGroup_parser h sl (pos `U32.add` 2ul) pos') in\n let len = U32.v pos' - (U32.v pos + 2) in\n ((2 <= len /\\ len <= 65535) \\/ (1 <= count /\\ count <= 32767))\n)))\n(ensures (fun h _ h' ->\n B.modifies (LL.loc_slice_from_to sl pos (pos `U32.add` 2ul)) h h' /\\ (\n let l = LL.contents_list namedGroup_parser h sl (pos `U32.add` 2ul) pos' in\n 1 <= L.length l /\\ L.length l <= 32767 /\\\n LL.valid_content_pos namedGroupList_parser h' sl pos l pos'\n)))\nlet finalize_namedGroupList #_ #_ sl pos pos' =", "completed_definiton": "LL.finalize_vlarray 2 65535 namedGroup_serializer 1 32767 sl pos pos'", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.alert'_reader", "original_source_type": "val alert'_reader:LL.leaf_reader alert'_parser", "source_type": "val alert'_reader:LL.leaf_reader alert'_parser", "source_definition": "let alert'_reader : LL.leaf_reader alert'_parser = (LL.read_nondep_then alertLevel_jumper alertLevel_reader alertDescription_reader)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 97, "start_col": 73, "end_line": 97, "end_col": 154 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()\n\ninline_for_extraction let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)\n\nlet alert_parser32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()\n\ninline_for_extraction let alert'_serializer32 : LS.serializer32 alert'_serializer = (alertLevel_serializer32 `LS.serialize32_nondep_then` alertDescription_serializer32)\n\nlet alert_serializer32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.serialize32_synth _ synth_alert _ alert'_serializer32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_size32 : LSZ.size32 alert'_serializer = (alertLevel_size32 `LSZ.size32_nondep_then` alertDescription_size32)\n\nlet alert_size32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LSZ.size32_synth _ synth_alert _ alert'_size32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_validator : LL.validator alert'_parser = (alertLevel_validator `LL.validate_nondep_then` alertDescription_validator)\n\nlet alert_validator =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.validate_synth alert'_validator synth_alert ()", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader Parsers.Alert.alert'_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.read_nondep_then", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertLevel.alertLevel", "Parsers.AlertLevel.alertLevel_parser", "Parsers.AlertLevel.alertLevel_jumper", "Parsers.AlertLevel.alertLevel_reader", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.AlertDescription.alertDescription", "Parsers.AlertDescription.alertDescription_parser", "Parsers.AlertDescription.alertDescription_reader" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alert'_reader:LL.leaf_reader alert'_parser\nlet alert'_reader:LL.leaf_reader alert'_parser =", "completed_definiton": "(LL.read_nondep_then alertLevel_jumper alertLevel_reader alertDescription_reader)", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.alert'_parser_kind", "original_source_type": "", "source_type": "val alert'_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let alert'_parser_kind = LP.get_parser_kind alert'_parser", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 48, "start_col": 35, "end_line": 48, "end_col": 67 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.get_parser_kind", "LowParse.Spec.Combinators.and_then_kind", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.Alert.alert'", "Parsers.Alert.alert'_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let alert'_parser_kind =", "completed_definiton": "LP.get_parser_kind alert'_parser", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.accessor'_alert_level", "original_source_type": "val accessor'_alert_level:LL.accessor gaccessor'_alert_level", "source_type": "val accessor'_alert_level:LL.accessor gaccessor'_alert_level", "source_definition": "let accessor'_alert_level : LL.accessor gaccessor'_alert_level = (LL.accessor_then_fst (LL.accessor_id alert'_parser))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 126, "start_col": 97, "end_line": 126, "end_col": 150 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()\n\ninline_for_extraction let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)\n\nlet alert_parser32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()\n\ninline_for_extraction let alert'_serializer32 : LS.serializer32 alert'_serializer = (alertLevel_serializer32 `LS.serialize32_nondep_then` alertDescription_serializer32)\n\nlet alert_serializer32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.serialize32_synth _ synth_alert _ alert'_serializer32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_size32 : LSZ.size32 alert'_serializer = (alertLevel_size32 `LSZ.size32_nondep_then` alertDescription_size32)\n\nlet alert_size32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LSZ.size32_synth _ synth_alert _ alert'_size32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_validator : LL.validator alert'_parser = (alertLevel_validator `LL.validate_nondep_then` alertDescription_validator)\n\nlet alert_validator =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.validate_synth alert'_validator synth_alert ()\n\ninline_for_extraction let alert'_reader : LL.leaf_reader alert'_parser = (LL.read_nondep_then alertLevel_jumper alertLevel_reader alertDescription_reader)\n\nlet alert_reader =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.read_synth _ synth_alert (fun x -> synth_alert x) alert'_reader ()\n\ninline_for_extraction let alert'_lserializer : LL.serializer32 alert'_serializer = (alertLevel_lserializer `LL.serialize32_nondep_then` alertDescription_lserializer)\n\nlet alert_lserializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.serialize32_synth alert'_lserializer synth_alert synth_alert_recip (fun x -> synth_alert_recip x) ()\n\nlet alert_bytesize_eqn x =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth_eq _ synth_alert alert'_serializer synth_alert_recip () x;\nLP.length_serialize_nondep_then alertLevel_serializer alertDescription_serializer x.level x.description;\n (alertLevel_bytesize_eq (x.level));\n (alertDescription_bytesize_eq (x.description));\n assert(alert_bytesize x == Seq.length (LP.serialize alertLevel_serializer x.level) + Seq.length (LP.serialize alertDescription_serializer x.description))\n\nlet gaccessor'_alert_level : LL.gaccessor alert'_parser alertLevel_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_id alert'_parser))\n\nlet gaccessor'_alert_description : LL.gaccessor alert'_parser alertDescription_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id alert'_parser))", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.Alert.gaccessor'_alert_level", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.accessor_then_fst", "LowParse.Spec.Combinators.and_then_kind", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.Alert.alert'", "Parsers.Alert.alert'_parser", "Parsers.AlertLevel.alertLevel", "Parsers.AlertLevel.alertLevel_parser", "Parsers.AlertDescription.alertDescription", "Parsers.AlertDescription.alertDescription_parser", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Base.Spec.gaccessor_id", "LowParse.Low.Base.accessor_id" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor'_alert_level:LL.accessor gaccessor'_alert_level\nlet accessor'_alert_level:LL.accessor gaccessor'_alert_level =", "completed_definiton": "(LL.accessor_then_fst (LL.accessor_id alert'_parser))", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.accessor'_alert_description", "original_source_type": "val accessor'_alert_description:LL.accessor gaccessor'_alert_description", "source_type": "val accessor'_alert_description:LL.accessor gaccessor'_alert_description", "source_definition": "let accessor'_alert_description : LL.accessor gaccessor'_alert_description = (LL.accessor_then_snd (LL.accessor_id alert'_parser) alertLevel_jumper)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 128, "start_col": 109, "end_line": 128, "end_col": 180 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()\n\ninline_for_extraction let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)\n\nlet alert_parser32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()\n\ninline_for_extraction let alert'_serializer32 : LS.serializer32 alert'_serializer = (alertLevel_serializer32 `LS.serialize32_nondep_then` alertDescription_serializer32)\n\nlet alert_serializer32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.serialize32_synth _ synth_alert _ alert'_serializer32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_size32 : LSZ.size32 alert'_serializer = (alertLevel_size32 `LSZ.size32_nondep_then` alertDescription_size32)\n\nlet alert_size32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LSZ.size32_synth _ synth_alert _ alert'_size32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_validator : LL.validator alert'_parser = (alertLevel_validator `LL.validate_nondep_then` alertDescription_validator)\n\nlet alert_validator =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.validate_synth alert'_validator synth_alert ()\n\ninline_for_extraction let alert'_reader : LL.leaf_reader alert'_parser = (LL.read_nondep_then alertLevel_jumper alertLevel_reader alertDescription_reader)\n\nlet alert_reader =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.read_synth _ synth_alert (fun x -> synth_alert x) alert'_reader ()\n\ninline_for_extraction let alert'_lserializer : LL.serializer32 alert'_serializer = (alertLevel_lserializer `LL.serialize32_nondep_then` alertDescription_lserializer)\n\nlet alert_lserializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.serialize32_synth alert'_lserializer synth_alert synth_alert_recip (fun x -> synth_alert_recip x) ()\n\nlet alert_bytesize_eqn x =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth_eq _ synth_alert alert'_serializer synth_alert_recip () x;\nLP.length_serialize_nondep_then alertLevel_serializer alertDescription_serializer x.level x.description;\n (alertLevel_bytesize_eq (x.level));\n (alertDescription_bytesize_eq (x.description));\n assert(alert_bytesize x == Seq.length (LP.serialize alertLevel_serializer x.level) + Seq.length (LP.serialize alertDescription_serializer x.description))\n\nlet gaccessor'_alert_level : LL.gaccessor alert'_parser alertLevel_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_id alert'_parser))\n\nlet gaccessor'_alert_description : LL.gaccessor alert'_parser alertDescription_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id alert'_parser))\n\ninline_for_extraction noextract let accessor'_alert_level : LL.accessor gaccessor'_alert_level = (LL.accessor_then_fst (LL.accessor_id alert'_parser))", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.Alert.gaccessor'_alert_description", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.accessor_then_snd", "LowParse.Spec.Combinators.and_then_kind", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.Alert.alert'", "Parsers.Alert.alert'_parser", "Parsers.AlertLevel.alertLevel", "Parsers.AlertLevel.alertLevel_parser", "Parsers.AlertDescription.alertDescription", "Parsers.AlertDescription.alertDescription_parser", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Base.Spec.gaccessor_id", "LowParse.Low.Base.accessor_id", "Parsers.AlertLevel.alertLevel_jumper" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor'_alert_description:LL.accessor gaccessor'_alert_description\nlet accessor'_alert_description:LL.accessor gaccessor'_alert_description =", "completed_definiton": "(LL.accessor_then_snd (LL.accessor_id alert'_parser) alertLevel_jumper)", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.alert'_parser32", "original_source_type": "val alert'_parser32:LS.parser32 alert'_parser", "source_type": "val alert'_parser32:LS.parser32 alert'_parser", "source_definition": "let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 67, "start_col": 72, "end_line": 67, "end_col": 144 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.Alert.alert'_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_nondep_then", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertLevel.alertLevel", "Parsers.AlertLevel.alertLevel_parser", "Parsers.AlertLevel.alertLevel_parser32", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.AlertDescription.alertDescription", "Parsers.AlertDescription.alertDescription_parser", "Parsers.AlertDescription.alertDescription_parser32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alert'_parser32:LS.parser32 alert'_parser\nlet alert'_parser32:LS.parser32 alert'_parser =", "completed_definiton": "(alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.clens_alert_alert'", "original_source_type": "val clens_alert_alert':LL.clens alert alert'", "source_type": "val clens_alert_alert':LL.clens alert alert'", "source_definition": "let clens_alert_alert' : LL.clens alert alert' = synth_alert_recip_inverse (); synth_alert_recip_injective (); LL.clens_synth synth_alert_recip synth_alert", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 130, "start_col": 59, "end_line": 130, "end_col": 165 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()\n\ninline_for_extraction let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)\n\nlet alert_parser32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()\n\ninline_for_extraction let alert'_serializer32 : LS.serializer32 alert'_serializer = (alertLevel_serializer32 `LS.serialize32_nondep_then` alertDescription_serializer32)\n\nlet alert_serializer32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.serialize32_synth _ synth_alert _ alert'_serializer32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_size32 : LSZ.size32 alert'_serializer = (alertLevel_size32 `LSZ.size32_nondep_then` alertDescription_size32)\n\nlet alert_size32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LSZ.size32_synth _ synth_alert _ alert'_size32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_validator : LL.validator alert'_parser = (alertLevel_validator `LL.validate_nondep_then` alertDescription_validator)\n\nlet alert_validator =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.validate_synth alert'_validator synth_alert ()\n\ninline_for_extraction let alert'_reader : LL.leaf_reader alert'_parser = (LL.read_nondep_then alertLevel_jumper alertLevel_reader alertDescription_reader)\n\nlet alert_reader =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.read_synth _ synth_alert (fun x -> synth_alert x) alert'_reader ()\n\ninline_for_extraction let alert'_lserializer : LL.serializer32 alert'_serializer = (alertLevel_lserializer `LL.serialize32_nondep_then` alertDescription_lserializer)\n\nlet alert_lserializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.serialize32_synth alert'_lserializer synth_alert synth_alert_recip (fun x -> synth_alert_recip x) ()\n\nlet alert_bytesize_eqn x =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth_eq _ synth_alert alert'_serializer synth_alert_recip () x;\nLP.length_serialize_nondep_then alertLevel_serializer alertDescription_serializer x.level x.description;\n (alertLevel_bytesize_eq (x.level));\n (alertDescription_bytesize_eq (x.description));\n assert(alert_bytesize x == Seq.length (LP.serialize alertLevel_serializer x.level) + Seq.length (LP.serialize alertDescription_serializer x.description))\n\nlet gaccessor'_alert_level : LL.gaccessor alert'_parser alertLevel_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_id alert'_parser))\n\nlet gaccessor'_alert_description : LL.gaccessor alert'_parser alertDescription_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id alert'_parser))\n\ninline_for_extraction noextract let accessor'_alert_level : LL.accessor gaccessor'_alert_level = (LL.accessor_then_fst (LL.accessor_id alert'_parser))\n\ninline_for_extraction noextract let accessor'_alert_description : LL.accessor gaccessor'_alert_description = (LL.accessor_then_snd (LL.accessor_id alert'_parser) alertLevel_jumper)", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.Alert.alert Parsers.Alert.alert'", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.clens_synth", "Parsers.Alert.alert", "Parsers.Alert.alert'", "Parsers.Alert.synth_alert_recip", "Parsers.Alert.synth_alert", "Prims.unit", "Parsers.Alert.synth_alert_recip_injective", "Parsers.Alert.synth_alert_recip_inverse" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val clens_alert_alert':LL.clens alert alert'\nlet clens_alert_alert':LL.clens alert alert' =", "completed_definiton": "synth_alert_recip_inverse ();\nsynth_alert_recip_injective ();\nLL.clens_synth synth_alert_recip synth_alert", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.synth_alert", "original_source_type": "val synth_alert (x: alert') : alert", "source_type": "val synth_alert (x: alert') : alert", "source_definition": "let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 26, "start_col": 2, "end_line": 29, "end_col": 3 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.Alert.alert' -> Parsers.Alert.alert", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.Alert.alert'", "Parsers.AlertLevel.alertLevel", "Parsers.AlertDescription.alertDescription", "Parsers.Alert.Mkalert", "Parsers.Alert.alert" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_alert (x: alert') : alert\nlet synth_alert (x: alert') : alert =", "completed_definiton": "match x with | level, description -> { level = level; description = description }", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.synth_alert_recip", "original_source_type": "val synth_alert_recip (x: alert) : alert'", "source_type": "val synth_alert_recip (x: alert) : alert'", "source_definition": "let synth_alert_recip (x: alert) : alert' = (x.level,x.description)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 31, "start_col": 66, "end_line": 31, "end_col": 89 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.Alert.alert -> Parsers.Alert.alert'", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.Alert.alert", "FStar.Pervasives.Native.Mktuple2", "Parsers.AlertLevel.alertLevel", "Parsers.AlertDescription.alertDescription", "Parsers.Alert.__proj__Mkalert__item__level", "Parsers.Alert.__proj__Mkalert__item__description", "Parsers.Alert.alert'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_alert_recip (x: alert) : alert'\nlet synth_alert_recip (x: alert) : alert' =", "completed_definiton": "(x.level, x.description)", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.alert_bytesize", "original_source_type": "val alert_bytesize (x:alert) : GTot nat", "source_type": "val alert_bytesize (x:alert) : GTot nat", "source_definition": "let alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 63, "start_col": 42, "end_line": 63, "end_col": 73 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.Alert.alert -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.Alert.alert", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.Alert.alert_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alert_bytesize (x:alert) : GTot nat\nlet alert_bytesize (x: alert) : GTot nat =", "completed_definiton": "Seq.length (alert_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.alert'_validator", "original_source_type": "val alert'_validator:LL.validator alert'_parser", "source_type": "val alert'_validator:LL.validator alert'_parser", "source_definition": "let alert'_validator : LL.validator alert'_parser = (alertLevel_validator `LL.validate_nondep_then` alertDescription_validator)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 90, "start_col": 74, "end_line": 90, "end_col": 149 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()\n\ninline_for_extraction let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)\n\nlet alert_parser32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()\n\ninline_for_extraction let alert'_serializer32 : LS.serializer32 alert'_serializer = (alertLevel_serializer32 `LS.serialize32_nondep_then` alertDescription_serializer32)\n\nlet alert_serializer32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.serialize32_synth _ synth_alert _ alert'_serializer32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_size32 : LSZ.size32 alert'_serializer = (alertLevel_size32 `LSZ.size32_nondep_then` alertDescription_size32)\n\nlet alert_size32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LSZ.size32_synth _ synth_alert _ alert'_size32 synth_alert_recip (fun x -> synth_alert_recip x) ()", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.Alert.alert'_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.validate_nondep_then", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertLevel.alertLevel", "Parsers.AlertLevel.alertLevel_parser", "Parsers.AlertLevel.alertLevel_validator", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.AlertDescription.alertDescription", "Parsers.AlertDescription.alertDescription_parser", "Parsers.AlertDescription.alertDescription_validator" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alert'_validator:LL.validator alert'_parser\nlet alert'_validator:LL.validator alert'_parser =", "completed_definiton": "(alertLevel_validator `LL.validate_nondep_then` alertDescription_validator)", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.alert'_lserializer", "original_source_type": "val alert'_lserializer:LL.serializer32 alert'_serializer", "source_type": "val alert'_lserializer:LL.serializer32 alert'_serializer", "source_definition": "let alert'_lserializer : LL.serializer32 alert'_serializer = (alertLevel_lserializer `LL.serialize32_nondep_then` alertDescription_lserializer)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 104, "start_col": 83, "end_line": 104, "end_col": 165 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()\n\ninline_for_extraction let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)\n\nlet alert_parser32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()\n\ninline_for_extraction let alert'_serializer32 : LS.serializer32 alert'_serializer = (alertLevel_serializer32 `LS.serialize32_nondep_then` alertDescription_serializer32)\n\nlet alert_serializer32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.serialize32_synth _ synth_alert _ alert'_serializer32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_size32 : LSZ.size32 alert'_serializer = (alertLevel_size32 `LSZ.size32_nondep_then` alertDescription_size32)\n\nlet alert_size32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LSZ.size32_synth _ synth_alert _ alert'_size32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_validator : LL.validator alert'_parser = (alertLevel_validator `LL.validate_nondep_then` alertDescription_validator)\n\nlet alert_validator =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.validate_synth alert'_validator synth_alert ()\n\ninline_for_extraction let alert'_reader : LL.leaf_reader alert'_parser = (LL.read_nondep_then alertLevel_jumper alertLevel_reader alertDescription_reader)\n\nlet alert_reader =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.read_synth _ synth_alert (fun x -> synth_alert x) alert'_reader ()", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 Parsers.Alert.alert'_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.serialize32_nondep_then", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertLevel.alertLevel", "Parsers.AlertLevel.alertLevel_parser", "Parsers.AlertLevel.alertLevel_serializer", "Parsers.AlertLevel.alertLevel_lserializer", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.AlertDescription.alertDescription", "Parsers.AlertDescription.alertDescription_parser", "Parsers.AlertDescription.alertDescription_serializer", "Parsers.AlertDescription.alertDescription_lserializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alert'_lserializer:LL.serializer32 alert'_serializer\nlet alert'_lserializer:LL.serializer32 alert'_serializer =", "completed_definiton": "(alertLevel_lserializer `LL.serialize32_nondep_then` alertDescription_lserializer)", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.alert_parser", "original_source_type": "val alert_parser: LP.parser alert_parser_kind alert", "source_type": "val alert_parser: LP.parser alert_parser_kind alert", "source_definition": "let alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 51, "start_col": 2, "end_line": 53, "end_col": 44 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.Alert.alert_parser_kind Parsers.Alert.alert", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.Alert.alert'", "Parsers.Alert.alert", "Parsers.Alert.alert'_parser", "Parsers.Alert.synth_alert", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "Parsers.Alert.alert_parser_kind", "Parsers.Alert.alert'_parser_kind", "Parsers.Alert.synth_alert_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alert_parser: LP.parser alert_parser_kind alert\nlet alert_parser =", "completed_definiton": "synth_alert_injective ();\nassert_norm (alert_parser_kind == alert'_parser_kind);\nalert'_parser `LP.parse_synth` synth_alert", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.alert'_serializer32", "original_source_type": "val alert'_serializer32:LS.serializer32 alert'_serializer", "source_type": "val alert'_serializer32:LS.serializer32 alert'_serializer", "source_definition": "let alert'_serializer32 : LS.serializer32 alert'_serializer = (alertLevel_serializer32 `LS.serialize32_nondep_then` alertDescription_serializer32)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 74, "start_col": 84, "end_line": 74, "end_col": 168 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()\n\ninline_for_extraction let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)\n\nlet alert_parser32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.Alert.alert'_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_nondep_then", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertLevel.alertLevel", "Parsers.AlertLevel.alertLevel_parser", "Parsers.AlertLevel.alertLevel_serializer", "Parsers.AlertLevel.alertLevel_serializer32", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.AlertDescription.alertDescription", "Parsers.AlertDescription.alertDescription_parser", "Parsers.AlertDescription.alertDescription_serializer", "Parsers.AlertDescription.alertDescription_serializer32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alert'_serializer32:LS.serializer32 alert'_serializer\nlet alert'_serializer32:LS.serializer32 alert'_serializer =", "completed_definiton": "(alertLevel_serializer32 `LS.serialize32_nondep_then` alertDescription_serializer32)", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.alert_validator", "original_source_type": "val alert_validator: LL.validator alert_parser", "source_type": "val alert_validator: LL.validator alert_parser", "source_definition": "let alert_validator =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.validate_synth alert'_validator synth_alert ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 93, "start_col": 2, "end_line": 95, "end_col": 51 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()\n\ninline_for_extraction let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)\n\nlet alert_parser32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()\n\ninline_for_extraction let alert'_serializer32 : LS.serializer32 alert'_serializer = (alertLevel_serializer32 `LS.serialize32_nondep_then` alertDescription_serializer32)\n\nlet alert_serializer32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.serialize32_synth _ synth_alert _ alert'_serializer32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_size32 : LSZ.size32 alert'_serializer = (alertLevel_size32 `LSZ.size32_nondep_then` alertDescription_size32)\n\nlet alert_size32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LSZ.size32_synth _ synth_alert _ alert'_size32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_validator : LL.validator alert'_parser = (alertLevel_validator `LL.validate_nondep_then` alertDescription_validator)", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.Alert.alert_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.validate_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.Alert.alert'", "Parsers.Alert.alert", "Parsers.Alert.alert'_parser", "Parsers.Alert.alert'_validator", "Parsers.Alert.synth_alert", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "Parsers.Alert.alert_parser_kind", "Parsers.Alert.alert'_parser_kind", "Parsers.Alert.synth_alert_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alert_validator: LL.validator alert_parser\nlet alert_validator =", "completed_definiton": "[@@ inline_let ]let _ = synth_alert_injective () in\n[@@ inline_let ]let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\nLL.validate_synth alert'_validator synth_alert ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.synth_alert_injective", "original_source_type": "val synth_alert_injective: Prims.unit -> Lemma (LP.synth_injective synth_alert)", "source_type": "val synth_alert_injective: Prims.unit -> Lemma (LP.synth_injective synth_alert)", "source_definition": "let synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 36, "start_col": 2, "end_line": 37, "end_col": 30 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures LowParse.Spec.Combinators.synth_injective Parsers.Alert.synth_alert)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "Parsers.Alert.synth_alert_recip_inverse", "LowParse.Spec.Combinators.synth_inverse_synth_injective", "Parsers.Alert.alert", "Parsers.Alert.alert'", "Parsers.Alert.synth_alert_recip", "Parsers.Alert.synth_alert", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_injective", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_alert_injective: Prims.unit -> Lemma (LP.synth_injective synth_alert)\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =", "completed_definiton": "LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\nsynth_alert_recip_inverse ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.gaccessor_alert_level", "original_source_type": "val gaccessor_alert_level : LL.gaccessor alert_parser alertLevel_parser clens_alert_level", "source_type": "val gaccessor_alert_level : LL.gaccessor alert_parser alertLevel_parser clens_alert_level", "source_definition": "let gaccessor_alert_level = LL.gaccessor_ext (gaccessor_alert_alert' `LL.gaccessor_compose` gaccessor'_alert_level) clens_alert_level ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 136, "start_col": 28, "end_line": 136, "end_col": 136 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()\n\ninline_for_extraction let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)\n\nlet alert_parser32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()\n\ninline_for_extraction let alert'_serializer32 : LS.serializer32 alert'_serializer = (alertLevel_serializer32 `LS.serialize32_nondep_then` alertDescription_serializer32)\n\nlet alert_serializer32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.serialize32_synth _ synth_alert _ alert'_serializer32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_size32 : LSZ.size32 alert'_serializer = (alertLevel_size32 `LSZ.size32_nondep_then` alertDescription_size32)\n\nlet alert_size32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LSZ.size32_synth _ synth_alert _ alert'_size32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_validator : LL.validator alert'_parser = (alertLevel_validator `LL.validate_nondep_then` alertDescription_validator)\n\nlet alert_validator =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.validate_synth alert'_validator synth_alert ()\n\ninline_for_extraction let alert'_reader : LL.leaf_reader alert'_parser = (LL.read_nondep_then alertLevel_jumper alertLevel_reader alertDescription_reader)\n\nlet alert_reader =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.read_synth _ synth_alert (fun x -> synth_alert x) alert'_reader ()\n\ninline_for_extraction let alert'_lserializer : LL.serializer32 alert'_serializer = (alertLevel_lserializer `LL.serialize32_nondep_then` alertDescription_lserializer)\n\nlet alert_lserializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.serialize32_synth alert'_lserializer synth_alert synth_alert_recip (fun x -> synth_alert_recip x) ()\n\nlet alert_bytesize_eqn x =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth_eq _ synth_alert alert'_serializer synth_alert_recip () x;\nLP.length_serialize_nondep_then alertLevel_serializer alertDescription_serializer x.level x.description;\n (alertLevel_bytesize_eq (x.level));\n (alertDescription_bytesize_eq (x.description));\n assert(alert_bytesize x == Seq.length (LP.serialize alertLevel_serializer x.level) + Seq.length (LP.serialize alertDescription_serializer x.description))\n\nlet gaccessor'_alert_level : LL.gaccessor alert'_parser alertLevel_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_id alert'_parser))\n\nlet gaccessor'_alert_description : LL.gaccessor alert'_parser alertDescription_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id alert'_parser))\n\ninline_for_extraction noextract let accessor'_alert_level : LL.accessor gaccessor'_alert_level = (LL.accessor_then_fst (LL.accessor_id alert'_parser))\n\ninline_for_extraction noextract let accessor'_alert_description : LL.accessor gaccessor'_alert_description = (LL.accessor_then_snd (LL.accessor_id alert'_parser) alertLevel_jumper)\n\nnoextract let clens_alert_alert' : LL.clens alert alert' = synth_alert_recip_inverse (); synth_alert_recip_injective (); LL.clens_synth synth_alert_recip synth_alert\n\nlet gaccessor_alert_alert' : LL.gaccessor alert_parser alert'_parser clens_alert_alert' = synth_alert_inverse (); synth_alert_injective (); synth_alert_recip_inverse (); LL.gaccessor_synth alert'_parser synth_alert synth_alert_recip ()\n\ninline_for_extraction noextract let accessor_alert_alert' : LL.accessor gaccessor_alert_alert' = synth_alert_inverse (); synth_alert_injective (); synth_alert_recip_inverse (); LL.accessor_synth alert'_parser synth_alert synth_alert_recip ()", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.Alert.alert_parser\n Parsers.AlertLevel.alertLevel_parser\n Parsers.Alert.clens_alert_level", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.gaccessor_ext", "Parsers.Alert.alert_parser_kind", "Parsers.Alert.alert", "Parsers.Alert.alert_parser", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertLevel.alertLevel", "Parsers.AlertLevel.alertLevel_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.Alert.alert'", "Parsers.Alert.clens_alert_alert'", "FStar.Pervasives.Native.tuple2", "Parsers.AlertDescription.alertDescription", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.Alert.alert'_parser", "Parsers.Alert.gaccessor_alert_alert'", "Parsers.Alert.gaccessor'_alert_level", "Parsers.Alert.clens_alert_level" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val gaccessor_alert_level : LL.gaccessor alert_parser alertLevel_parser clens_alert_level\nlet gaccessor_alert_level =", "completed_definiton": "LL.gaccessor_ext (gaccessor_alert_alert' `LL.gaccessor_compose` gaccessor'_alert_level)\n clens_alert_level\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.alert_reader", "original_source_type": "val alert_reader : LL.leaf_reader alert_parser", "source_type": "val alert_reader : LL.leaf_reader alert_parser", "source_definition": "let alert_reader =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.read_synth _ synth_alert (fun x -> synth_alert x) alert'_reader ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 100, "start_col": 2, "end_line": 102, "end_col": 71 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()\n\ninline_for_extraction let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)\n\nlet alert_parser32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()\n\ninline_for_extraction let alert'_serializer32 : LS.serializer32 alert'_serializer = (alertLevel_serializer32 `LS.serialize32_nondep_then` alertDescription_serializer32)\n\nlet alert_serializer32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.serialize32_synth _ synth_alert _ alert'_serializer32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_size32 : LSZ.size32 alert'_serializer = (alertLevel_size32 `LSZ.size32_nondep_then` alertDescription_size32)\n\nlet alert_size32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LSZ.size32_synth _ synth_alert _ alert'_size32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_validator : LL.validator alert'_parser = (alertLevel_validator `LL.validate_nondep_then` alertDescription_validator)\n\nlet alert_validator =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.validate_synth alert'_validator synth_alert ()\n\ninline_for_extraction let alert'_reader : LL.leaf_reader alert'_parser = (LL.read_nondep_then alertLevel_jumper alertLevel_reader alertDescription_reader)", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader Parsers.Alert.alert_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.read_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.Alert.alert'", "Parsers.Alert.alert", "Parsers.Alert.alert'_parser", "Parsers.Alert.synth_alert", "Prims.eq2", "Parsers.Alert.alert'_reader", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.Base.parser_kind", "Parsers.Alert.alert_parser_kind", "Parsers.Alert.alert'_parser_kind", "Parsers.Alert.synth_alert_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alert_reader : LL.leaf_reader alert_parser\nlet alert_reader =", "completed_definiton": "[@@ inline_let ]let _ = synth_alert_injective () in\n[@@ inline_let ]let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\nLL.read_synth _ synth_alert (fun x -> synth_alert x) alert'_reader ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.alert_lserializer", "original_source_type": "val alert_lserializer : LL.serializer32 alert_serializer", "source_type": "val alert_lserializer : LL.serializer32 alert_serializer", "source_definition": "let alert_lserializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.serialize32_synth alert'_lserializer synth_alert synth_alert_recip (fun x -> synth_alert_recip x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 107, "start_col": 2, "end_line": 110, "end_col": 105 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()\n\ninline_for_extraction let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)\n\nlet alert_parser32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()\n\ninline_for_extraction let alert'_serializer32 : LS.serializer32 alert'_serializer = (alertLevel_serializer32 `LS.serialize32_nondep_then` alertDescription_serializer32)\n\nlet alert_serializer32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.serialize32_synth _ synth_alert _ alert'_serializer32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_size32 : LSZ.size32 alert'_serializer = (alertLevel_size32 `LSZ.size32_nondep_then` alertDescription_size32)\n\nlet alert_size32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LSZ.size32_synth _ synth_alert _ alert'_size32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_validator : LL.validator alert'_parser = (alertLevel_validator `LL.validate_nondep_then` alertDescription_validator)\n\nlet alert_validator =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.validate_synth alert'_validator synth_alert ()\n\ninline_for_extraction let alert'_reader : LL.leaf_reader alert'_parser = (LL.read_nondep_then alertLevel_jumper alertLevel_reader alertDescription_reader)\n\nlet alert_reader =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.read_synth _ synth_alert (fun x -> synth_alert x) alert'_reader ()\n\ninline_for_extraction let alert'_lserializer : LL.serializer32 alert'_serializer = (alertLevel_lserializer `LL.serialize32_nondep_then` alertDescription_lserializer)", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 Parsers.Alert.alert_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.serialize32_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.Alert.alert'", "Parsers.Alert.alert'_parser", "Parsers.Alert.alert'_serializer", "Parsers.Alert.alert'_lserializer", "Parsers.Alert.alert", "Parsers.Alert.synth_alert", "Parsers.Alert.synth_alert_recip", "Prims.eq2", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.Base.parser_kind", "Parsers.Alert.alert_parser_kind", "Parsers.Alert.alert'_parser_kind", "Parsers.Alert.synth_alert_inverse", "Parsers.Alert.synth_alert_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alert_lserializer : LL.serializer32 alert_serializer\nlet alert_lserializer =", "completed_definiton": "[@@ inline_let ]let _ = synth_alert_injective () in\n[@@ inline_let ]let _ = synth_alert_inverse () in\n[@@ inline_let ]let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\nLL.serialize32_synth alert'_lserializer\n synth_alert\n synth_alert_recip\n (fun x -> synth_alert_recip x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.alert'_size32", "original_source_type": "val alert'_size32:LSZ.size32 alert'_serializer", "source_type": "val alert'_size32:LSZ.size32 alert'_serializer", "source_definition": "let alert'_size32 : LSZ.size32 alert'_serializer = (alertLevel_size32 `LSZ.size32_nondep_then` alertDescription_size32)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 82, "start_col": 73, "end_line": 82, "end_col": 141 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()\n\ninline_for_extraction let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)\n\nlet alert_parser32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()\n\ninline_for_extraction let alert'_serializer32 : LS.serializer32 alert'_serializer = (alertLevel_serializer32 `LS.serialize32_nondep_then` alertDescription_serializer32)\n\nlet alert_serializer32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.serialize32_synth _ synth_alert _ alert'_serializer32 synth_alert_recip (fun x -> synth_alert_recip x) ()", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.Alert.alert'_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.size32_nondep_then", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertLevel.alertLevel", "Parsers.AlertLevel.alertLevel_parser", "Parsers.AlertLevel.alertLevel_serializer", "Parsers.AlertLevel.alertLevel_size32", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.AlertDescription.alertDescription", "Parsers.AlertDescription.alertDescription_parser", "Parsers.AlertDescription.alertDescription_serializer", "Parsers.AlertDescription.alertDescription_size32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alert'_size32:LSZ.size32 alert'_serializer\nlet alert'_size32:LSZ.size32 alert'_serializer =", "completed_definiton": "(alertLevel_size32 `LSZ.size32_nondep_then` alertDescription_size32)", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.synth_alert_inverse", "original_source_type": "val synth_alert_inverse: Prims.unit -> Lemma (LP.synth_inverse synth_alert synth_alert_recip)", "source_type": "val synth_alert_inverse: Prims.unit -> Lemma (LP.synth_inverse synth_alert synth_alert_recip)", "source_definition": "let synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 40, "start_col": 2, "end_line": 40, "end_col": 62 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_inverse Parsers.Alert.synth_alert\n Parsers.Alert.synth_alert_recip)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.Combinators.synth_inverse", "Parsers.Alert.alert'", "Parsers.Alert.alert", "Parsers.Alert.synth_alert", "Parsers.Alert.synth_alert_recip", "Prims.l_True", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_alert_inverse: Prims.unit -> Lemma (LP.synth_inverse synth_alert synth_alert_recip)\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =", "completed_definiton": "assert_norm (LP.synth_inverse synth_alert synth_alert_recip)", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.alert_serializer", "original_source_type": "val alert_serializer: LP.serializer alert_parser", "source_type": "val alert_serializer: LP.serializer alert_parser", "source_definition": "let alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 58, "start_col": 2, "end_line": 61, "end_col": 73 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.Alert.alert_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.Alert.alert'", "Parsers.Alert.alert", "Parsers.Alert.alert'_parser", "Parsers.Alert.synth_alert", "Parsers.Alert.alert'_serializer", "Parsers.Alert.synth_alert_recip", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "Parsers.Alert.alert_parser_kind", "Parsers.Alert.alert'_parser_kind", "Parsers.Alert.synth_alert_inverse", "Parsers.Alert.synth_alert_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alert_serializer: LP.serializer alert_parser\nlet alert_serializer =", "completed_definiton": "[@@ inline_let ]let _ = synth_alert_injective () in\n[@@ inline_let ]let _ = synth_alert_inverse () in\n[@@ inline_let ]let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\nLP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.alert'_serializer", "original_source_type": "val alert'_serializer:LP.serializer alert'_parser", "source_type": "val alert'_serializer:LP.serializer alert'_parser", "source_definition": "let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 55, "start_col": 64, "end_line": 55, "end_col": 142 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.Alert.alert'_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_nondep_then", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertLevel.alertLevel", "Parsers.AlertLevel.alertLevel_parser", "Parsers.AlertLevel.alertLevel_serializer", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.AlertDescription.alertDescription", "Parsers.AlertDescription.alertDescription_parser", "Parsers.AlertDescription.alertDescription_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alert'_serializer:LP.serializer alert'_parser\nlet alert'_serializer:LP.serializer alert'_parser =", "completed_definiton": "(alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.alert_serializer32", "original_source_type": "val alert_serializer32: LS.serializer32 alert_serializer", "source_type": "val alert_serializer32: LS.serializer32 alert_serializer", "source_definition": "let alert_serializer32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.serialize32_synth _ synth_alert _ alert'_serializer32 synth_alert_recip (fun x -> synth_alert_recip x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 77, "start_col": 2, "end_line": 80, "end_col": 110 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()\n\ninline_for_extraction let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)\n\nlet alert_parser32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()\n\ninline_for_extraction let alert'_serializer32 : LS.serializer32 alert'_serializer = (alertLevel_serializer32 `LS.serialize32_nondep_then` alertDescription_serializer32)", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.Alert.alert_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.Alert.alert'", "Parsers.Alert.alert", "Parsers.Alert.alert'_parser", "Parsers.Alert.synth_alert", "Parsers.Alert.alert'_serializer", "Parsers.Alert.alert'_serializer32", "Parsers.Alert.synth_alert_recip", "Prims.eq2", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.Base.parser_kind", "Parsers.Alert.alert_parser_kind", "Parsers.Alert.alert'_parser_kind", "Parsers.Alert.synth_alert_inverse", "Parsers.Alert.synth_alert_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alert_serializer32: LS.serializer32 alert_serializer\nlet alert_serializer32 =", "completed_definiton": "[@@ inline_let ]let _ = synth_alert_injective () in\n[@@ inline_let ]let _ = synth_alert_inverse () in\n[@@ inline_let ]let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\nLS.serialize32_synth _\n synth_alert\n _\n alert'_serializer32\n synth_alert_recip\n (fun x -> synth_alert_recip x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.gaccessor_alert_description", "original_source_type": "val gaccessor_alert_description : LL.gaccessor alert_parser alertDescription_parser clens_alert_description", "source_type": "val gaccessor_alert_description : LL.gaccessor alert_parser alertDescription_parser clens_alert_description", "source_definition": "let gaccessor_alert_description = LL.gaccessor_ext (gaccessor_alert_alert' `LL.gaccessor_compose` gaccessor'_alert_description) clens_alert_description ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 140, "start_col": 34, "end_line": 140, "end_col": 154 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()\n\ninline_for_extraction let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)\n\nlet alert_parser32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()\n\ninline_for_extraction let alert'_serializer32 : LS.serializer32 alert'_serializer = (alertLevel_serializer32 `LS.serialize32_nondep_then` alertDescription_serializer32)\n\nlet alert_serializer32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.serialize32_synth _ synth_alert _ alert'_serializer32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_size32 : LSZ.size32 alert'_serializer = (alertLevel_size32 `LSZ.size32_nondep_then` alertDescription_size32)\n\nlet alert_size32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LSZ.size32_synth _ synth_alert _ alert'_size32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_validator : LL.validator alert'_parser = (alertLevel_validator `LL.validate_nondep_then` alertDescription_validator)\n\nlet alert_validator =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.validate_synth alert'_validator synth_alert ()\n\ninline_for_extraction let alert'_reader : LL.leaf_reader alert'_parser = (LL.read_nondep_then alertLevel_jumper alertLevel_reader alertDescription_reader)\n\nlet alert_reader =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.read_synth _ synth_alert (fun x -> synth_alert x) alert'_reader ()\n\ninline_for_extraction let alert'_lserializer : LL.serializer32 alert'_serializer = (alertLevel_lserializer `LL.serialize32_nondep_then` alertDescription_lserializer)\n\nlet alert_lserializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.serialize32_synth alert'_lserializer synth_alert synth_alert_recip (fun x -> synth_alert_recip x) ()\n\nlet alert_bytesize_eqn x =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth_eq _ synth_alert alert'_serializer synth_alert_recip () x;\nLP.length_serialize_nondep_then alertLevel_serializer alertDescription_serializer x.level x.description;\n (alertLevel_bytesize_eq (x.level));\n (alertDescription_bytesize_eq (x.description));\n assert(alert_bytesize x == Seq.length (LP.serialize alertLevel_serializer x.level) + Seq.length (LP.serialize alertDescription_serializer x.description))\n\nlet gaccessor'_alert_level : LL.gaccessor alert'_parser alertLevel_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_id alert'_parser))\n\nlet gaccessor'_alert_description : LL.gaccessor alert'_parser alertDescription_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id alert'_parser))\n\ninline_for_extraction noextract let accessor'_alert_level : LL.accessor gaccessor'_alert_level = (LL.accessor_then_fst (LL.accessor_id alert'_parser))\n\ninline_for_extraction noextract let accessor'_alert_description : LL.accessor gaccessor'_alert_description = (LL.accessor_then_snd (LL.accessor_id alert'_parser) alertLevel_jumper)\n\nnoextract let clens_alert_alert' : LL.clens alert alert' = synth_alert_recip_inverse (); synth_alert_recip_injective (); LL.clens_synth synth_alert_recip synth_alert\n\nlet gaccessor_alert_alert' : LL.gaccessor alert_parser alert'_parser clens_alert_alert' = synth_alert_inverse (); synth_alert_injective (); synth_alert_recip_inverse (); LL.gaccessor_synth alert'_parser synth_alert synth_alert_recip ()\n\ninline_for_extraction noextract let accessor_alert_alert' : LL.accessor gaccessor_alert_alert' = synth_alert_inverse (); synth_alert_injective (); synth_alert_recip_inverse (); LL.accessor_synth alert'_parser synth_alert synth_alert_recip ()\n\nlet gaccessor_alert_level = LL.gaccessor_ext (gaccessor_alert_alert' `LL.gaccessor_compose` gaccessor'_alert_level) clens_alert_level ()\n\nlet accessor_alert_level = LL.accessor_ext (LL.accessor_compose accessor_alert_alert' accessor'_alert_level ()) clens_alert_level ()", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.Alert.alert_parser\n Parsers.AlertDescription.alertDescription_parser\n Parsers.Alert.clens_alert_description", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.gaccessor_ext", "Parsers.Alert.alert_parser_kind", "Parsers.Alert.alert", "Parsers.Alert.alert_parser", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.AlertDescription.alertDescription", "Parsers.AlertDescription.alertDescription_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.Alert.alert'", "Parsers.Alert.clens_alert_alert'", "FStar.Pervasives.Native.tuple2", "Parsers.AlertLevel.alertLevel", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.Alert.alert'_parser", "Parsers.Alert.gaccessor_alert_alert'", "Parsers.Alert.gaccessor'_alert_description", "Parsers.Alert.clens_alert_description" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val gaccessor_alert_description : LL.gaccessor alert_parser alertDescription_parser clens_alert_description\nlet gaccessor_alert_description =", "completed_definiton": "LL.gaccessor_ext (gaccessor_alert_alert' `LL.gaccessor_compose` gaccessor'_alert_description)\n clens_alert_description\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.synth_alert_recip_injective", "original_source_type": "val synth_alert_recip_injective: Prims.unit -> Lemma (LP.synth_injective synth_alert_recip)", "source_type": "val synth_alert_recip_injective: Prims.unit -> Lemma (LP.synth_injective synth_alert_recip)", "source_definition": "let synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 43, "start_col": 2, "end_line": 44, "end_col": 64 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures LowParse.Spec.Combinators.synth_injective Parsers.Alert.synth_alert_recip)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "LowParse.Spec.Combinators.synth_inverse_synth_injective", "Parsers.Alert.alert'", "Parsers.Alert.alert", "Parsers.Alert.synth_alert", "Parsers.Alert.synth_alert_recip", "Parsers.Alert.synth_alert_recip_inverse", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_injective", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_alert_recip_injective: Prims.unit -> Lemma (LP.synth_injective synth_alert_recip)\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =", "completed_definiton": "synth_alert_recip_inverse ();\nLP.synth_inverse_synth_injective synth_alert synth_alert_recip", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.alert_parser32", "original_source_type": "val alert_parser32: LS.parser32 alert_parser", "source_type": "val alert_parser32: LS.parser32 alert_parser", "source_definition": "let alert_parser32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 70, "start_col": 2, "end_line": 72, "end_col": 76 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()\n\ninline_for_extraction let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.Alert.alert_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.Alert.alert'", "Parsers.Alert.alert", "Parsers.Alert.alert'_parser", "Parsers.Alert.synth_alert", "Prims.eq2", "Parsers.Alert.alert'_parser32", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.Base.parser_kind", "Parsers.Alert.alert_parser_kind", "Parsers.Alert.alert'_parser_kind", "Parsers.Alert.synth_alert_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alert_parser32: LS.parser32 alert_parser\nlet alert_parser32 =", "completed_definiton": "[@@ inline_let ]let _ = synth_alert_injective () in\n[@@ inline_let ]let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\nLS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.accessor_alert_description", "original_source_type": "val accessor_alert_description : LL.accessor gaccessor_alert_description", "source_type": "val accessor_alert_description : LL.accessor gaccessor_alert_description", "source_definition": "let accessor_alert_description = LL.accessor_ext (LL.accessor_compose accessor_alert_alert' accessor'_alert_description ()) clens_alert_description ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 142, "start_col": 33, "end_line": 142, "end_col": 150 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()\n\ninline_for_extraction let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)\n\nlet alert_parser32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()\n\ninline_for_extraction let alert'_serializer32 : LS.serializer32 alert'_serializer = (alertLevel_serializer32 `LS.serialize32_nondep_then` alertDescription_serializer32)\n\nlet alert_serializer32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.serialize32_synth _ synth_alert _ alert'_serializer32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_size32 : LSZ.size32 alert'_serializer = (alertLevel_size32 `LSZ.size32_nondep_then` alertDescription_size32)\n\nlet alert_size32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LSZ.size32_synth _ synth_alert _ alert'_size32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_validator : LL.validator alert'_parser = (alertLevel_validator `LL.validate_nondep_then` alertDescription_validator)\n\nlet alert_validator =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.validate_synth alert'_validator synth_alert ()\n\ninline_for_extraction let alert'_reader : LL.leaf_reader alert'_parser = (LL.read_nondep_then alertLevel_jumper alertLevel_reader alertDescription_reader)\n\nlet alert_reader =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.read_synth _ synth_alert (fun x -> synth_alert x) alert'_reader ()\n\ninline_for_extraction let alert'_lserializer : LL.serializer32 alert'_serializer = (alertLevel_lserializer `LL.serialize32_nondep_then` alertDescription_lserializer)\n\nlet alert_lserializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.serialize32_synth alert'_lserializer synth_alert synth_alert_recip (fun x -> synth_alert_recip x) ()\n\nlet alert_bytesize_eqn x =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth_eq _ synth_alert alert'_serializer synth_alert_recip () x;\nLP.length_serialize_nondep_then alertLevel_serializer alertDescription_serializer x.level x.description;\n (alertLevel_bytesize_eq (x.level));\n (alertDescription_bytesize_eq (x.description));\n assert(alert_bytesize x == Seq.length (LP.serialize alertLevel_serializer x.level) + Seq.length (LP.serialize alertDescription_serializer x.description))\n\nlet gaccessor'_alert_level : LL.gaccessor alert'_parser alertLevel_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_id alert'_parser))\n\nlet gaccessor'_alert_description : LL.gaccessor alert'_parser alertDescription_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id alert'_parser))\n\ninline_for_extraction noextract let accessor'_alert_level : LL.accessor gaccessor'_alert_level = (LL.accessor_then_fst (LL.accessor_id alert'_parser))\n\ninline_for_extraction noextract let accessor'_alert_description : LL.accessor gaccessor'_alert_description = (LL.accessor_then_snd (LL.accessor_id alert'_parser) alertLevel_jumper)\n\nnoextract let clens_alert_alert' : LL.clens alert alert' = synth_alert_recip_inverse (); synth_alert_recip_injective (); LL.clens_synth synth_alert_recip synth_alert\n\nlet gaccessor_alert_alert' : LL.gaccessor alert_parser alert'_parser clens_alert_alert' = synth_alert_inverse (); synth_alert_injective (); synth_alert_recip_inverse (); LL.gaccessor_synth alert'_parser synth_alert synth_alert_recip ()\n\ninline_for_extraction noextract let accessor_alert_alert' : LL.accessor gaccessor_alert_alert' = synth_alert_inverse (); synth_alert_injective (); synth_alert_recip_inverse (); LL.accessor_synth alert'_parser synth_alert synth_alert_recip ()\n\nlet gaccessor_alert_level = LL.gaccessor_ext (gaccessor_alert_alert' `LL.gaccessor_compose` gaccessor'_alert_level) clens_alert_level ()\n\nlet accessor_alert_level = LL.accessor_ext (LL.accessor_compose accessor_alert_alert' accessor'_alert_level ()) clens_alert_level ()\n\nlet gaccessor_alert_description = LL.gaccessor_ext (gaccessor_alert_alert' `LL.gaccessor_compose` gaccessor'_alert_description) clens_alert_description ()", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.Alert.gaccessor_alert_description", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.accessor_ext", "Parsers.Alert.alert_parser_kind", "Parsers.Alert.alert", "Parsers.Alert.alert_parser", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.AlertDescription.alertDescription", "Parsers.AlertDescription.alertDescription_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.Alert.alert'", "Parsers.Alert.clens_alert_alert'", "FStar.Pervasives.Native.tuple2", "Parsers.AlertLevel.alertLevel", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.Alert.alert'_parser", "Parsers.Alert.gaccessor_alert_alert'", "Parsers.Alert.gaccessor'_alert_description", "LowParse.Low.Base.accessor_compose", "Parsers.Alert.accessor_alert_alert'", "Parsers.Alert.accessor'_alert_description", "Parsers.Alert.clens_alert_description" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor_alert_description : LL.accessor gaccessor_alert_description\nlet accessor_alert_description =", "completed_definiton": "LL.accessor_ext (LL.accessor_compose accessor_alert_alert' accessor'_alert_description ())\n clens_alert_description\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.gaccessor_alert_alert'", "original_source_type": "val gaccessor_alert_alert':LL.gaccessor alert_parser alert'_parser clens_alert_alert'", "source_type": "val gaccessor_alert_alert':LL.gaccessor alert_parser alert'_parser clens_alert_alert'", "source_definition": "let gaccessor_alert_alert' : LL.gaccessor alert_parser alert'_parser clens_alert_alert' = synth_alert_inverse (); synth_alert_injective (); synth_alert_recip_inverse (); LL.gaccessor_synth alert'_parser synth_alert synth_alert_recip ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 132, "start_col": 90, "end_line": 132, "end_col": 235 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()\n\ninline_for_extraction let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)\n\nlet alert_parser32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()\n\ninline_for_extraction let alert'_serializer32 : LS.serializer32 alert'_serializer = (alertLevel_serializer32 `LS.serialize32_nondep_then` alertDescription_serializer32)\n\nlet alert_serializer32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.serialize32_synth _ synth_alert _ alert'_serializer32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_size32 : LSZ.size32 alert'_serializer = (alertLevel_size32 `LSZ.size32_nondep_then` alertDescription_size32)\n\nlet alert_size32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LSZ.size32_synth _ synth_alert _ alert'_size32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_validator : LL.validator alert'_parser = (alertLevel_validator `LL.validate_nondep_then` alertDescription_validator)\n\nlet alert_validator =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.validate_synth alert'_validator synth_alert ()\n\ninline_for_extraction let alert'_reader : LL.leaf_reader alert'_parser = (LL.read_nondep_then alertLevel_jumper alertLevel_reader alertDescription_reader)\n\nlet alert_reader =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.read_synth _ synth_alert (fun x -> synth_alert x) alert'_reader ()\n\ninline_for_extraction let alert'_lserializer : LL.serializer32 alert'_serializer = (alertLevel_lserializer `LL.serialize32_nondep_then` alertDescription_lserializer)\n\nlet alert_lserializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.serialize32_synth alert'_lserializer synth_alert synth_alert_recip (fun x -> synth_alert_recip x) ()\n\nlet alert_bytesize_eqn x =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth_eq _ synth_alert alert'_serializer synth_alert_recip () x;\nLP.length_serialize_nondep_then alertLevel_serializer alertDescription_serializer x.level x.description;\n (alertLevel_bytesize_eq (x.level));\n (alertDescription_bytesize_eq (x.description));\n assert(alert_bytesize x == Seq.length (LP.serialize alertLevel_serializer x.level) + Seq.length (LP.serialize alertDescription_serializer x.description))\n\nlet gaccessor'_alert_level : LL.gaccessor alert'_parser alertLevel_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_id alert'_parser))\n\nlet gaccessor'_alert_description : LL.gaccessor alert'_parser alertDescription_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id alert'_parser))\n\ninline_for_extraction noextract let accessor'_alert_level : LL.accessor gaccessor'_alert_level = (LL.accessor_then_fst (LL.accessor_id alert'_parser))\n\ninline_for_extraction noextract let accessor'_alert_description : LL.accessor gaccessor'_alert_description = (LL.accessor_then_snd (LL.accessor_id alert'_parser) alertLevel_jumper)\n\nnoextract let clens_alert_alert' : LL.clens alert alert' = synth_alert_recip_inverse (); synth_alert_recip_injective (); LL.clens_synth synth_alert_recip synth_alert", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.Alert.alert_parser\n Parsers.Alert.alert'_parser\n Parsers.Alert.clens_alert_alert'", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.gaccessor_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.Alert.alert'", "Parsers.Alert.alert'_parser", "Parsers.Alert.alert", "Parsers.Alert.synth_alert", "Parsers.Alert.synth_alert_recip", "Prims.unit", "Parsers.Alert.synth_alert_recip_inverse", "Parsers.Alert.synth_alert_injective", "Parsers.Alert.synth_alert_inverse" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val gaccessor_alert_alert':LL.gaccessor alert_parser alert'_parser clens_alert_alert'\nlet gaccessor_alert_alert':LL.gaccessor alert_parser alert'_parser clens_alert_alert' =", "completed_definiton": "synth_alert_inverse ();\nsynth_alert_injective ();\nsynth_alert_recip_inverse ();\nLL.gaccessor_synth alert'_parser synth_alert synth_alert_recip ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.alert_size32", "original_source_type": "val alert_size32: LSZ.size32 alert_serializer", "source_type": "val alert_size32: LSZ.size32 alert_serializer", "source_definition": "let alert_size32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LSZ.size32_synth _ synth_alert _ alert'_size32 synth_alert_recip (fun x -> synth_alert_recip x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 85, "start_col": 2, "end_line": 88, "end_col": 100 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()\n\ninline_for_extraction let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)\n\nlet alert_parser32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()\n\ninline_for_extraction let alert'_serializer32 : LS.serializer32 alert'_serializer = (alertLevel_serializer32 `LS.serialize32_nondep_then` alertDescription_serializer32)\n\nlet alert_serializer32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.serialize32_synth _ synth_alert _ alert'_serializer32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_size32 : LSZ.size32 alert'_serializer = (alertLevel_size32 `LSZ.size32_nondep_then` alertDescription_size32)", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.Alert.alert_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.size32_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.Alert.alert'", "Parsers.Alert.alert", "Parsers.Alert.alert'_parser", "Parsers.Alert.synth_alert", "Parsers.Alert.alert'_serializer", "Parsers.Alert.alert'_size32", "Parsers.Alert.synth_alert_recip", "Prims.eq2", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.Base.parser_kind", "Parsers.Alert.alert_parser_kind", "Parsers.Alert.alert'_parser_kind", "Parsers.Alert.synth_alert_inverse", "Parsers.Alert.synth_alert_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alert_size32: LSZ.size32 alert_serializer\nlet alert_size32 =", "completed_definiton": "[@@ inline_let ]let _ = synth_alert_injective () in\n[@@ inline_let ]let _ = synth_alert_inverse () in\n[@@ inline_let ]let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\nLSZ.size32_synth _ synth_alert _ alert'_size32 synth_alert_recip (fun x -> synth_alert_recip x) ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.alert_bytesize_eqn", "original_source_type": "val alert_bytesize_eqn (x: alert) : Lemma (alert_bytesize x == (alertLevel_bytesize (x.level)) + (alertDescription_bytesize (x.description))) [SMTPat (alert_bytesize x)]", "source_type": "val alert_bytesize_eqn (x: alert) : Lemma (alert_bytesize x == (alertLevel_bytesize (x.level)) + (alertDescription_bytesize (x.description))) [SMTPat (alert_bytesize x)]", "source_definition": "let alert_bytesize_eqn x =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth_eq _ synth_alert alert'_serializer synth_alert_recip () x;\nLP.length_serialize_nondep_then alertLevel_serializer alertDescription_serializer x.level x.description;\n (alertLevel_bytesize_eq (x.level));\n (alertDescription_bytesize_eq (x.description));\n assert(alert_bytesize x == Seq.length (LP.serialize alertLevel_serializer x.level) + Seq.length (LP.serialize alertDescription_serializer x.description))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 113, "start_col": 2, "end_line": 120, "end_col": 155 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()\n\ninline_for_extraction let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)\n\nlet alert_parser32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()\n\ninline_for_extraction let alert'_serializer32 : LS.serializer32 alert'_serializer = (alertLevel_serializer32 `LS.serialize32_nondep_then` alertDescription_serializer32)\n\nlet alert_serializer32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.serialize32_synth _ synth_alert _ alert'_serializer32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_size32 : LSZ.size32 alert'_serializer = (alertLevel_size32 `LSZ.size32_nondep_then` alertDescription_size32)\n\nlet alert_size32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LSZ.size32_synth _ synth_alert _ alert'_size32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_validator : LL.validator alert'_parser = (alertLevel_validator `LL.validate_nondep_then` alertDescription_validator)\n\nlet alert_validator =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.validate_synth alert'_validator synth_alert ()\n\ninline_for_extraction let alert'_reader : LL.leaf_reader alert'_parser = (LL.read_nondep_then alertLevel_jumper alertLevel_reader alertDescription_reader)\n\nlet alert_reader =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.read_synth _ synth_alert (fun x -> synth_alert x) alert'_reader ()\n\ninline_for_extraction let alert'_lserializer : LL.serializer32 alert'_serializer = (alertLevel_lserializer `LL.serialize32_nondep_then` alertDescription_lserializer)\n\nlet alert_lserializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.serialize32_synth alert'_lserializer synth_alert synth_alert_recip (fun x -> synth_alert_recip x) ()", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.Alert.alert\n -> FStar.Pervasives.Lemma\n (ensures\n Parsers.Alert.alert_bytesize x ==\n Parsers.AlertLevel.alertLevel_bytesize (Mkalert?.level x) +\n Parsers.AlertDescription.alertDescription_bytesize (Mkalert?.description x))\n [SMTPat (Parsers.Alert.alert_bytesize x)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.Alert.alert", "Prims._assert", "Prims.eq2", "Prims.int", "Parsers.Alert.alert_bytesize", "Prims.op_Addition", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertLevel.alertLevel", "Parsers.AlertLevel.alertLevel_parser", "Parsers.AlertLevel.alertLevel_serializer", "Parsers.Alert.__proj__Mkalert__item__level", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.AlertDescription.alertDescription", "Parsers.AlertDescription.alertDescription_parser", "Parsers.AlertDescription.alertDescription_serializer", "Parsers.Alert.__proj__Mkalert__item__description", "Prims.unit", "Parsers.AlertDescription.alertDescription_bytesize_eq", "Parsers.AlertLevel.alertLevel_bytesize_eq", "LowParse.Spec.Combinators.length_serialize_nondep_then", "LowParse.Spec.Combinators.serialize_synth_eq", "LowParse.Spec.Combinators.and_then_kind", "Parsers.Alert.alert'", "Parsers.Alert.alert'_parser", "Parsers.Alert.synth_alert", "Parsers.Alert.alert'_serializer", "Parsers.Alert.synth_alert_recip", "FStar.Pervasives.assert_norm", "LowParse.Spec.Base.parser_kind", "Parsers.Alert.alert_parser_kind", "Parsers.Alert.alert'_parser_kind", "Parsers.Alert.synth_alert_inverse", "Parsers.Alert.synth_alert_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alert_bytesize_eqn (x: alert) : Lemma (alert_bytesize x == (alertLevel_bytesize (x.level)) + (alertDescription_bytesize (x.description))) [SMTPat (alert_bytesize x)]\nlet alert_bytesize_eqn x =", "completed_definiton": "[@@ inline_let ]let _ = synth_alert_injective () in\n[@@ inline_let ]let _ = synth_alert_inverse () in\n[@@ inline_let ]let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\nLP.serialize_synth_eq _ synth_alert alert'_serializer synth_alert_recip () x;\nLP.length_serialize_nondep_then alertLevel_serializer\n alertDescription_serializer\n x.level\n x.description;\n(alertLevel_bytesize_eq (x.level));\n(alertDescription_bytesize_eq (x.description));\nassert (alert_bytesize x ==\n Seq.length (LP.serialize alertLevel_serializer x.level) +\n Seq.length (LP.serialize alertDescription_serializer x.description))", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.accessor_alert_alert'", "original_source_type": "val accessor_alert_alert':LL.accessor gaccessor_alert_alert'", "source_type": "val accessor_alert_alert':LL.accessor gaccessor_alert_alert'", "source_definition": "let accessor_alert_alert' : LL.accessor gaccessor_alert_alert' = synth_alert_inverse (); synth_alert_injective (); synth_alert_recip_inverse (); LL.accessor_synth alert'_parser synth_alert synth_alert_recip ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 134, "start_col": 97, "end_line": 134, "end_col": 241 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()\n\ninline_for_extraction let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)\n\nlet alert_parser32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()\n\ninline_for_extraction let alert'_serializer32 : LS.serializer32 alert'_serializer = (alertLevel_serializer32 `LS.serialize32_nondep_then` alertDescription_serializer32)\n\nlet alert_serializer32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.serialize32_synth _ synth_alert _ alert'_serializer32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_size32 : LSZ.size32 alert'_serializer = (alertLevel_size32 `LSZ.size32_nondep_then` alertDescription_size32)\n\nlet alert_size32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LSZ.size32_synth _ synth_alert _ alert'_size32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_validator : LL.validator alert'_parser = (alertLevel_validator `LL.validate_nondep_then` alertDescription_validator)\n\nlet alert_validator =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.validate_synth alert'_validator synth_alert ()\n\ninline_for_extraction let alert'_reader : LL.leaf_reader alert'_parser = (LL.read_nondep_then alertLevel_jumper alertLevel_reader alertDescription_reader)\n\nlet alert_reader =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.read_synth _ synth_alert (fun x -> synth_alert x) alert'_reader ()\n\ninline_for_extraction let alert'_lserializer : LL.serializer32 alert'_serializer = (alertLevel_lserializer `LL.serialize32_nondep_then` alertDescription_lserializer)\n\nlet alert_lserializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.serialize32_synth alert'_lserializer synth_alert synth_alert_recip (fun x -> synth_alert_recip x) ()\n\nlet alert_bytesize_eqn x =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth_eq _ synth_alert alert'_serializer synth_alert_recip () x;\nLP.length_serialize_nondep_then alertLevel_serializer alertDescription_serializer x.level x.description;\n (alertLevel_bytesize_eq (x.level));\n (alertDescription_bytesize_eq (x.description));\n assert(alert_bytesize x == Seq.length (LP.serialize alertLevel_serializer x.level) + Seq.length (LP.serialize alertDescription_serializer x.description))\n\nlet gaccessor'_alert_level : LL.gaccessor alert'_parser alertLevel_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_id alert'_parser))\n\nlet gaccessor'_alert_description : LL.gaccessor alert'_parser alertDescription_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id alert'_parser))\n\ninline_for_extraction noextract let accessor'_alert_level : LL.accessor gaccessor'_alert_level = (LL.accessor_then_fst (LL.accessor_id alert'_parser))\n\ninline_for_extraction noextract let accessor'_alert_description : LL.accessor gaccessor'_alert_description = (LL.accessor_then_snd (LL.accessor_id alert'_parser) alertLevel_jumper)\n\nnoextract let clens_alert_alert' : LL.clens alert alert' = synth_alert_recip_inverse (); synth_alert_recip_injective (); LL.clens_synth synth_alert_recip synth_alert\n\nlet gaccessor_alert_alert' : LL.gaccessor alert_parser alert'_parser clens_alert_alert' = synth_alert_inverse (); synth_alert_injective (); synth_alert_recip_inverse (); LL.gaccessor_synth alert'_parser synth_alert synth_alert_recip ()", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.Alert.gaccessor_alert_alert'", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.accessor_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.Alert.alert'", "Parsers.Alert.alert", "Parsers.Alert.alert'_parser", "Parsers.Alert.synth_alert", "Parsers.Alert.synth_alert_recip", "Prims.unit", "Parsers.Alert.synth_alert_recip_inverse", "Parsers.Alert.synth_alert_injective", "Parsers.Alert.synth_alert_inverse" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor_alert_alert':LL.accessor gaccessor_alert_alert'\nlet accessor_alert_alert':LL.accessor gaccessor_alert_alert' =", "completed_definiton": "synth_alert_inverse ();\nsynth_alert_injective ();\nsynth_alert_recip_inverse ();\nLL.accessor_synth alert'_parser synth_alert synth_alert_recip ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.accessor_alert_level", "original_source_type": "val accessor_alert_level : LL.accessor gaccessor_alert_level", "source_type": "val accessor_alert_level : LL.accessor gaccessor_alert_level", "source_definition": "let accessor_alert_level = LL.accessor_ext (LL.accessor_compose accessor_alert_alert' accessor'_alert_level ()) clens_alert_level ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 138, "start_col": 27, "end_line": 138, "end_col": 132 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()\n\ninline_for_extraction let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)\n\nlet alert_parser32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()\n\ninline_for_extraction let alert'_serializer32 : LS.serializer32 alert'_serializer = (alertLevel_serializer32 `LS.serialize32_nondep_then` alertDescription_serializer32)\n\nlet alert_serializer32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.serialize32_synth _ synth_alert _ alert'_serializer32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_size32 : LSZ.size32 alert'_serializer = (alertLevel_size32 `LSZ.size32_nondep_then` alertDescription_size32)\n\nlet alert_size32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LSZ.size32_synth _ synth_alert _ alert'_size32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_validator : LL.validator alert'_parser = (alertLevel_validator `LL.validate_nondep_then` alertDescription_validator)\n\nlet alert_validator =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.validate_synth alert'_validator synth_alert ()\n\ninline_for_extraction let alert'_reader : LL.leaf_reader alert'_parser = (LL.read_nondep_then alertLevel_jumper alertLevel_reader alertDescription_reader)\n\nlet alert_reader =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.read_synth _ synth_alert (fun x -> synth_alert x) alert'_reader ()\n\ninline_for_extraction let alert'_lserializer : LL.serializer32 alert'_serializer = (alertLevel_lserializer `LL.serialize32_nondep_then` alertDescription_lserializer)\n\nlet alert_lserializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.serialize32_synth alert'_lserializer synth_alert synth_alert_recip (fun x -> synth_alert_recip x) ()\n\nlet alert_bytesize_eqn x =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth_eq _ synth_alert alert'_serializer synth_alert_recip () x;\nLP.length_serialize_nondep_then alertLevel_serializer alertDescription_serializer x.level x.description;\n (alertLevel_bytesize_eq (x.level));\n (alertDescription_bytesize_eq (x.description));\n assert(alert_bytesize x == Seq.length (LP.serialize alertLevel_serializer x.level) + Seq.length (LP.serialize alertDescription_serializer x.description))\n\nlet gaccessor'_alert_level : LL.gaccessor alert'_parser alertLevel_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_id alert'_parser))\n\nlet gaccessor'_alert_description : LL.gaccessor alert'_parser alertDescription_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id alert'_parser))\n\ninline_for_extraction noextract let accessor'_alert_level : LL.accessor gaccessor'_alert_level = (LL.accessor_then_fst (LL.accessor_id alert'_parser))\n\ninline_for_extraction noextract let accessor'_alert_description : LL.accessor gaccessor'_alert_description = (LL.accessor_then_snd (LL.accessor_id alert'_parser) alertLevel_jumper)\n\nnoextract let clens_alert_alert' : LL.clens alert alert' = synth_alert_recip_inverse (); synth_alert_recip_injective (); LL.clens_synth synth_alert_recip synth_alert\n\nlet gaccessor_alert_alert' : LL.gaccessor alert_parser alert'_parser clens_alert_alert' = synth_alert_inverse (); synth_alert_injective (); synth_alert_recip_inverse (); LL.gaccessor_synth alert'_parser synth_alert synth_alert_recip ()\n\ninline_for_extraction noextract let accessor_alert_alert' : LL.accessor gaccessor_alert_alert' = synth_alert_inverse (); synth_alert_injective (); synth_alert_recip_inverse (); LL.accessor_synth alert'_parser synth_alert synth_alert_recip ()\n\nlet gaccessor_alert_level = LL.gaccessor_ext (gaccessor_alert_alert' `LL.gaccessor_compose` gaccessor'_alert_level) clens_alert_level ()", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.Alert.gaccessor_alert_level", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.accessor_ext", "Parsers.Alert.alert_parser_kind", "Parsers.Alert.alert", "Parsers.Alert.alert_parser", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertLevel.alertLevel", "Parsers.AlertLevel.alertLevel_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.Alert.alert'", "Parsers.Alert.clens_alert_alert'", "FStar.Pervasives.Native.tuple2", "Parsers.AlertDescription.alertDescription", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.Alert.alert'_parser", "Parsers.Alert.gaccessor_alert_alert'", "Parsers.Alert.gaccessor'_alert_level", "LowParse.Low.Base.accessor_compose", "Parsers.Alert.accessor_alert_alert'", "Parsers.Alert.accessor'_alert_level", "Parsers.Alert.clens_alert_level" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor_alert_level : LL.accessor gaccessor_alert_level\nlet accessor_alert_level =", "completed_definiton": "LL.accessor_ext (LL.accessor_compose accessor_alert_alert' accessor'_alert_level ())\n clens_alert_level\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.Alert.fst", "name": "Parsers.Alert.alert_valid", "original_source_type": "val alert_valid (h:HS.mem) (#rrel: _) (#rel: _) (input:LL.slice rrel rel) (pos0:U32.t) : Lemma\n (requires (\n LL.valid alertLevel_parser h input pos0 /\\ (\n let pos1 = LL.get_valid_pos alertLevel_parser h input pos0 in\n LL.valid alertDescription_parser h input pos1 /\\ (\n let pos2 = LL.get_valid_pos alertDescription_parser h input pos1 in\n True\n ))))\n (ensures (\n let level = LL.contents alertLevel_parser h input pos0 in\n let pos1 = LL.get_valid_pos alertLevel_parser h input pos0 in\n let description = LL.contents alertDescription_parser h input pos1 in\n let pos2 = LL.get_valid_pos alertDescription_parser h input pos1 in\n LL.valid_content_pos alert_parser h input pos0 ({\n level = level;\n description = description;\n }) pos2))", "source_type": "val alert_valid (h:HS.mem) (#rrel: _) (#rel: _) (input:LL.slice rrel rel) (pos0:U32.t) : Lemma\n (requires (\n LL.valid alertLevel_parser h input pos0 /\\ (\n let pos1 = LL.get_valid_pos alertLevel_parser h input pos0 in\n LL.valid alertDescription_parser h input pos1 /\\ (\n let pos2 = LL.get_valid_pos alertDescription_parser h input pos1 in\n True\n ))))\n (ensures (\n let level = LL.contents alertLevel_parser h input pos0 in\n let pos1 = LL.get_valid_pos alertLevel_parser h input pos0 in\n let description = LL.contents alertDescription_parser h input pos1 in\n let pos2 = LL.get_valid_pos alertDescription_parser h input pos1 in\n LL.valid_content_pos alert_parser h input pos0 ({\n level = level;\n description = description;\n }) pos2))", "source_definition": "let alert_valid h #_ #_ input pos0 =\n let level = LL.contents alertLevel_parser h input pos0 in\n let pos1 = LL.get_valid_pos alertLevel_parser h input pos0 in\n let description = LL.contents alertDescription_parser h input pos1 in\n let pos2 = LL.get_valid_pos alertDescription_parser h input pos1 in\n LL.valid_nondep_then_intro h alertLevel_parser alertDescription_parser input pos0;\n assert_norm (alert' == LP.get_parser_type alert'_parser);\n assert_norm (alert_parser_kind == alert'_parser_kind);\n synth_alert_injective ();\n LL.valid_synth_intro h alert'_parser synth_alert input pos0", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.Alert.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 144, "start_col": 36, "end_line": 153, "end_col": 61 }, "file_context": "module Parsers.Alert\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\ntype alert' = (alertLevel & alertDescription)\n\ninline_for_extraction let synth_alert (x: alert') : alert =\n match x with (level,description) -> {\n level = level;\n description = description;\n }\n\ninline_for_extraction let synth_alert_recip (x: alert) : alert' = (x.level,x.description)\n\nlet synth_alert_recip_inverse () : Lemma (LP.synth_inverse synth_alert_recip synth_alert) = ()\n\nlet synth_alert_injective () : Lemma (LP.synth_injective synth_alert) =\n LP.synth_inverse_synth_injective synth_alert_recip synth_alert;\n synth_alert_recip_inverse ()\n\nlet synth_alert_inverse () : Lemma (LP.synth_inverse synth_alert synth_alert_recip) =\n assert_norm (LP.synth_inverse synth_alert synth_alert_recip)\n\nlet synth_alert_recip_injective () : Lemma (LP.synth_injective synth_alert_recip) =\n synth_alert_recip_inverse ();\n LP.synth_inverse_synth_injective synth_alert synth_alert_recip\n\nnoextract let alert'_parser : LP.parser _ alert' = (alertLevel_parser `LP.nondep_then` alertDescription_parser)\n\nnoextract let alert'_parser_kind = LP.get_parser_kind alert'_parser\n\nlet alert_parser =\n synth_alert_injective ();\n assert_norm (alert_parser_kind == alert'_parser_kind);\n alert'_parser `LP.parse_synth` synth_alert\n\nnoextract let alert'_serializer : LP.serializer alert'_parser = (alertLevel_serializer `LP.serialize_nondep_then` alertDescription_serializer)\n\nlet alert_serializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth _ synth_alert alert'_serializer synth_alert_recip ()\n\nlet alert_bytesize (x:alert) : GTot nat = Seq.length (alert_serializer x)\n\nlet alert_bytesize_eq x = ()\n\ninline_for_extraction let alert'_parser32 : LS.parser32 alert'_parser = (alertLevel_parser32 `LS.parse32_nondep_then` alertDescription_parser32)\n\nlet alert_parser32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.parse32_synth _ synth_alert (fun x -> synth_alert x) alert'_parser32 ()\n\ninline_for_extraction let alert'_serializer32 : LS.serializer32 alert'_serializer = (alertLevel_serializer32 `LS.serialize32_nondep_then` alertDescription_serializer32)\n\nlet alert_serializer32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LS.serialize32_synth _ synth_alert _ alert'_serializer32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_size32 : LSZ.size32 alert'_serializer = (alertLevel_size32 `LSZ.size32_nondep_then` alertDescription_size32)\n\nlet alert_size32 =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LSZ.size32_synth _ synth_alert _ alert'_size32 synth_alert_recip (fun x -> synth_alert_recip x) ()\n\ninline_for_extraction let alert'_validator : LL.validator alert'_parser = (alertLevel_validator `LL.validate_nondep_then` alertDescription_validator)\n\nlet alert_validator =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.validate_synth alert'_validator synth_alert ()\n\ninline_for_extraction let alert'_reader : LL.leaf_reader alert'_parser = (LL.read_nondep_then alertLevel_jumper alertLevel_reader alertDescription_reader)\n\nlet alert_reader =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.read_synth _ synth_alert (fun x -> synth_alert x) alert'_reader ()\n\ninline_for_extraction let alert'_lserializer : LL.serializer32 alert'_serializer = (alertLevel_lserializer `LL.serialize32_nondep_then` alertDescription_lserializer)\n\nlet alert_lserializer =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LL.serialize32_synth alert'_lserializer synth_alert synth_alert_recip (fun x -> synth_alert_recip x) ()\n\nlet alert_bytesize_eqn x =\n [@inline_let] let _ = synth_alert_injective () in\n [@inline_let] let _ = synth_alert_inverse () in\n [@inline_let] let _ = assert_norm (alert_parser_kind == alert'_parser_kind) in\n LP.serialize_synth_eq _ synth_alert alert'_serializer synth_alert_recip () x;\nLP.length_serialize_nondep_then alertLevel_serializer alertDescription_serializer x.level x.description;\n (alertLevel_bytesize_eq (x.level));\n (alertDescription_bytesize_eq (x.description));\n assert(alert_bytesize x == Seq.length (LP.serialize alertLevel_serializer x.level) + Seq.length (LP.serialize alertDescription_serializer x.description))\n\nlet gaccessor'_alert_level : LL.gaccessor alert'_parser alertLevel_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_id alert'_parser))\n\nlet gaccessor'_alert_description : LL.gaccessor alert'_parser alertDescription_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id alert'_parser))\n\ninline_for_extraction noextract let accessor'_alert_level : LL.accessor gaccessor'_alert_level = (LL.accessor_then_fst (LL.accessor_id alert'_parser))\n\ninline_for_extraction noextract let accessor'_alert_description : LL.accessor gaccessor'_alert_description = (LL.accessor_then_snd (LL.accessor_id alert'_parser) alertLevel_jumper)\n\nnoextract let clens_alert_alert' : LL.clens alert alert' = synth_alert_recip_inverse (); synth_alert_recip_injective (); LL.clens_synth synth_alert_recip synth_alert\n\nlet gaccessor_alert_alert' : LL.gaccessor alert_parser alert'_parser clens_alert_alert' = synth_alert_inverse (); synth_alert_injective (); synth_alert_recip_inverse (); LL.gaccessor_synth alert'_parser synth_alert synth_alert_recip ()\n\ninline_for_extraction noextract let accessor_alert_alert' : LL.accessor gaccessor_alert_alert' = synth_alert_inverse (); synth_alert_injective (); synth_alert_recip_inverse (); LL.accessor_synth alert'_parser synth_alert synth_alert_recip ()\n\nlet gaccessor_alert_level = LL.gaccessor_ext (gaccessor_alert_alert' `LL.gaccessor_compose` gaccessor'_alert_level) clens_alert_level ()\n\nlet accessor_alert_level = LL.accessor_ext (LL.accessor_compose accessor_alert_alert' accessor'_alert_level ()) clens_alert_level ()\n\nlet gaccessor_alert_description = LL.gaccessor_ext (gaccessor_alert_alert' `LL.gaccessor_compose` gaccessor'_alert_description) clens_alert_description ()\n\nlet accessor_alert_description = LL.accessor_ext (LL.accessor_compose accessor_alert_alert' accessor'_alert_description ()) clens_alert_description ()", "dependencies": { "source_file": "Parsers.Alert.fst", "checked_file": "Parsers.Alert.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertDescription" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.AlertLevel" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: FStar.Monotonic.HyperStack.mem -> input: LowParse.Slice.slice rrel rel -> pos0: FStar.UInt32.t\n -> FStar.Pervasives.Lemma\n (requires\n LowParse.Low.Base.Spec.valid Parsers.AlertLevel.alertLevel_parser h input pos0 /\\\n (let pos1 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.AlertLevel.alertLevel_parser h input pos0\n in\n LowParse.Low.Base.Spec.valid Parsers.AlertDescription.alertDescription_parser h input pos1 /\\\n (let pos2 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.AlertDescription.alertDescription_parser\n h\n input\n pos1\n in\n Prims.l_True)))\n (ensures\n (let level =\n LowParse.Low.Base.Spec.contents Parsers.AlertLevel.alertLevel_parser h input pos0\n in\n let pos1 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.AlertLevel.alertLevel_parser h input pos0\n in\n let description =\n LowParse.Low.Base.Spec.contents Parsers.AlertDescription.alertDescription_parser\n h\n input\n pos1\n in\n let pos2 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.AlertDescription.alertDescription_parser\n h\n input\n pos1\n in\n LowParse.Low.Base.Spec.valid_content_pos Parsers.Alert.alert_parser\n h\n input\n pos0\n (Parsers.Alert.Mkalert level description)\n pos2))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Monotonic.HyperStack.mem", "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "LowParse.Low.Combinators.valid_synth_intro", "LowParse.Spec.Combinators.and_then_kind", "Parsers.AlertLevel.alertLevel_parser_kind", "Parsers.AlertDescription.alertDescription_parser_kind", "Parsers.Alert.alert'", "Parsers.Alert.alert", "Parsers.Alert.alert'_parser", "Parsers.Alert.synth_alert", "Prims.unit", "Parsers.Alert.synth_alert_injective", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "Parsers.Alert.alert_parser_kind", "Parsers.Alert.alert'_parser_kind", "LowParse.Spec.Base.get_parser_type", "LowParse.Low.Combinators.valid_nondep_then_intro", "Parsers.AlertLevel.alertLevel", "Parsers.AlertLevel.alertLevel_parser", "Parsers.AlertDescription.alertDescription", "Parsers.AlertDescription.alertDescription_parser", "LowParse.Low.Base.Spec.get_valid_pos", "LowParse.Low.Base.Spec.contents" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alert_valid (h:HS.mem) (#rrel: _) (#rel: _) (input:LL.slice rrel rel) (pos0:U32.t) : Lemma\n (requires (\n LL.valid alertLevel_parser h input pos0 /\\ (\n let pos1 = LL.get_valid_pos alertLevel_parser h input pos0 in\n LL.valid alertDescription_parser h input pos1 /\\ (\n let pos2 = LL.get_valid_pos alertDescription_parser h input pos1 in\n True\n ))))\n (ensures (\n let level = LL.contents alertLevel_parser h input pos0 in\n let pos1 = LL.get_valid_pos alertLevel_parser h input pos0 in\n let description = LL.contents alertDescription_parser h input pos1 in\n let pos2 = LL.get_valid_pos alertDescription_parser h input pos1 in\n LL.valid_content_pos alert_parser h input pos0 ({\n level = level;\n description = description;\n }) pos2))\nlet alert_valid h #_ #_ input pos0 =", "completed_definiton": "let level = LL.contents alertLevel_parser h input pos0 in\nlet pos1 = LL.get_valid_pos alertLevel_parser h input pos0 in\nlet description = LL.contents alertDescription_parser h input pos1 in\nlet pos2 = LL.get_valid_pos alertDescription_parser h input pos1 in\nLL.valid_nondep_then_intro h alertLevel_parser alertDescription_parser input pos0;\nassert_norm (alert' == LP.get_parser_type alert'_parser);\nassert_norm (alert_parser_kind == alert'_parser_kind);\nsynth_alert_injective ();\nLL.valid_synth_intro h alert'_parser synth_alert input pos0", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12_master_secret.fsti", "name": "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "original_source_type": "", "source_type": "val ticketContents12_master_secret_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let ticketContents12_master_secret_parser_kind = LP.strong_parser_kind 48 48 (Some LP.ParserKindMetadataTotal)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12_master_secret.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 23, "start_col": 81, "end_line": 23, "end_col": 142 }, "file_context": "module Parsers.TicketContents12_master_secret\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ntype ticketContents12_master_secret = lbytes 48", "dependencies": { "source_file": "Parsers.TicketContents12_master_secret.fsti", "checked_file": "Parsers.TicketContents12_master_secret.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.Some", "LowParse.Spec.Base.parser_kind_metadata_some", "LowParse.Spec.Base.ParserKindMetadataTotal" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let ticketContents12_master_secret_parser_kind =", "completed_definiton": "LP.strong_parser_kind 48 48 (Some LP.ParserKindMetadataTotal)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12_master_secret.fsti", "name": "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_validator", "original_source_type": "val ticketContents12_master_secret_validator:LL.validator ticketContents12_master_secret_parser", "source_type": "val ticketContents12_master_secret_validator:LL.validator ticketContents12_master_secret_parser", "source_definition": "let ticketContents12_master_secret_validator: LL.validator ticketContents12_master_secret_parser = LL.validate_total_constant_size ticketContents12_master_secret_parser 48uL ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12_master_secret.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 39, "start_col": 99, "end_line": 39, "end_col": 176 }, "file_context": "module Parsers.TicketContents12_master_secret\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ntype ticketContents12_master_secret = lbytes 48\n\ninline_for_extraction noextract let ticketContents12_master_secret_parser_kind = LP.strong_parser_kind 48 48 (Some LP.ParserKindMetadataTotal)\n\nnoextract val ticketContents12_master_secret_parser: LP.parser ticketContents12_master_secret_parser_kind ticketContents12_master_secret\n\nnoextract val ticketContents12_master_secret_serializer: LP.serializer ticketContents12_master_secret_parser\n\nnoextract val ticketContents12_master_secret_bytesize (x:ticketContents12_master_secret) : GTot nat\n\nnoextract val ticketContents12_master_secret_bytesize_eq (x:ticketContents12_master_secret) : Lemma (ticketContents12_master_secret_bytesize x == Seq.length (LP.serialize ticketContents12_master_secret_serializer x))\n\nval ticketContents12_master_secret_parser32: LS.parser32 ticketContents12_master_secret_parser\n\nval ticketContents12_master_secret_serializer32: LS.serializer32 ticketContents12_master_secret_serializer\n\nval ticketContents12_master_secret_size32: LSZ.size32 ticketContents12_master_secret_serializer", "dependencies": { "source_file": "Parsers.TicketContents12_master_secret.fsti", "checked_file": "Parsers.TicketContents12_master_secret.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser\n", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.validate_total_constant_size", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser", "FStar.UInt64.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12_master_secret_validator:LL.validator ticketContents12_master_secret_parser\nlet ticketContents12_master_secret_validator:LL.validator ticketContents12_master_secret_parser =", "completed_definiton": "LL.validate_total_constant_size ticketContents12_master_secret_parser 48uL ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents12_master_secret.fsti", "name": "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_jumper", "original_source_type": "val ticketContents12_master_secret_jumper:LL.jumper ticketContents12_master_secret_parser", "source_type": "val ticketContents12_master_secret_jumper:LL.jumper ticketContents12_master_secret_parser", "source_definition": "let ticketContents12_master_secret_jumper: LL.jumper ticketContents12_master_secret_parser = LL.jump_constant_size ticketContents12_master_secret_parser 48ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents12_master_secret.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 41, "start_col": 93, "end_line": 41, "end_col": 160 }, "file_context": "module Parsers.TicketContents12_master_secret\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ntype ticketContents12_master_secret = lbytes 48\n\ninline_for_extraction noextract let ticketContents12_master_secret_parser_kind = LP.strong_parser_kind 48 48 (Some LP.ParserKindMetadataTotal)\n\nnoextract val ticketContents12_master_secret_parser: LP.parser ticketContents12_master_secret_parser_kind ticketContents12_master_secret\n\nnoextract val ticketContents12_master_secret_serializer: LP.serializer ticketContents12_master_secret_parser\n\nnoextract val ticketContents12_master_secret_bytesize (x:ticketContents12_master_secret) : GTot nat\n\nnoextract val ticketContents12_master_secret_bytesize_eq (x:ticketContents12_master_secret) : Lemma (ticketContents12_master_secret_bytesize x == Seq.length (LP.serialize ticketContents12_master_secret_serializer x))\n\nval ticketContents12_master_secret_parser32: LS.parser32 ticketContents12_master_secret_parser\n\nval ticketContents12_master_secret_serializer32: LS.serializer32 ticketContents12_master_secret_serializer\n\nval ticketContents12_master_secret_size32: LSZ.size32 ticketContents12_master_secret_serializer\n\nlet ticketContents12_master_secret_validator: LL.validator ticketContents12_master_secret_parser = LL.validate_total_constant_size ticketContents12_master_secret_parser 48uL ()", "dependencies": { "source_file": "Parsers.TicketContents12_master_secret.fsti", "checked_file": "Parsers.TicketContents12_master_secret.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser\n", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.jump_constant_size", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser_kind", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret", "Parsers.TicketContents12_master_secret.ticketContents12_master_secret_parser", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents12_master_secret_jumper:LL.jumper ticketContents12_master_secret_parser\nlet ticketContents12_master_secret_jumper:LL.jumper ticketContents12_master_secret_parser =", "completed_definiton": "LL.jump_constant_size ticketContents12_master_secret_parser 48ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_recip", "original_source_type": "val synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel'", "source_type": "val synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel'", "source_definition": "let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 38, "start_col": 78, "end_line": 38, "end_col": 108 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.HKDF.HkdfLabel.hkdfLabel -> Parsers.HKDF.HkdfLabel.hkdfLabel'", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.HKDF.HkdfLabel.hkdfLabel", "FStar.Pervasives.Native.Mktuple2", "FStar.Pervasives.Native.tuple2", "FStar.UInt16.t", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "Parsers.HKDF.HkdfLabel.__proj__MkhkdfLabel__item__length", "Parsers.HKDF.HkdfLabel.__proj__MkhkdfLabel__item__label", "Parsers.HKDF.HkdfLabel.__proj__MkhkdfLabel__item__context", "Parsers.HKDF.HkdfLabel.hkdfLabel'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel'\nlet synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' =", "completed_definiton": "((x.length, x.label), x.context)", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.hkdfLabel'_validator", "original_source_type": "val hkdfLabel'_validator:LL.validator hkdfLabel'_parser", "source_type": "val hkdfLabel'_validator:LL.validator hkdfLabel'_parser", "source_definition": "let hkdfLabel'_validator : LL.validator hkdfLabel'_parser = (((LL.validate_u16 ()) `LL.validate_nondep_then` hkdfLabel_label_validator) `LL.validate_nondep_then` hkdfLabel_context_validator)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 97, "start_col": 82, "end_line": 97, "end_col": 212 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)\n\nlet hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()\n\ninline_for_extraction let hkdfLabel'_serializer32 : LS.serializer32 hkdfLabel'_serializer = ((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32) `LS.serialize32_nondep_then` hkdfLabel_context_serializer32)\n\nlet hkdfLabel_serializer32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.serialize32_synth _ synth_hkdfLabel _ hkdfLabel'_serializer32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_size32 : LSZ.size32 hkdfLabel'_serializer = ((LSZ.size32_u16 `LSZ.size32_nondep_then` hkdfLabel_label_size32) `LSZ.size32_nondep_then` hkdfLabel_context_size32)\n\nlet hkdfLabel_size32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LSZ.size32_synth _ synth_hkdfLabel _ hkdfLabel'_size32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.validate_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "FStar.Pervasives.Native.tuple2", "FStar.UInt16.t", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Int.parse_u16", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser", "LowParse.Low.Int.validate_u16", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_validator", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_validator" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel'_validator:LL.validator hkdfLabel'_parser\nlet hkdfLabel'_validator:LL.validator hkdfLabel'_parser =", "completed_definiton": "(((LL.validate_u16 ()) `LL.validate_nondep_then` hkdfLabel_label_validator)\n `LL.validate_nondep_then`\n hkdfLabel_context_validator)", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.synth_hkdfLabel", "original_source_type": "val synth_hkdfLabel (x: hkdfLabel') : hkdfLabel", "source_type": "val synth_hkdfLabel (x: hkdfLabel') : hkdfLabel", "source_definition": "let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 32, "start_col": 2, "end_line": 36, "end_col": 3 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.HKDF.HkdfLabel.hkdfLabel' -> Parsers.HKDF.HkdfLabel.hkdfLabel", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.HKDF.HkdfLabel.hkdfLabel'", "FStar.UInt16.t", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "Parsers.HKDF.HkdfLabel.MkhkdfLabel", "Parsers.HKDF.HkdfLabel.hkdfLabel" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_hkdfLabel (x: hkdfLabel') : hkdfLabel\nlet synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =", "completed_definiton": "match x with | (length, label), context -> { length = length; label = label; context = context }", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser32", "original_source_type": "val hkdfLabel'_parser32:LS.parser32 hkdfLabel'_parser", "source_type": "val hkdfLabel'_parser32:LS.parser32 hkdfLabel'_parser", "source_definition": "let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 74, "start_col": 80, "end_line": 74, "end_col": 200 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "FStar.Pervasives.Native.tuple2", "FStar.UInt16.t", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Int.parse_u16", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser", "LowParse.SLow.Int.parse32_u16", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser32", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel'_parser32:LS.parser32 hkdfLabel'_parser\nlet hkdfLabel'_parser32:LS.parser32 hkdfLabel'_parser =", "completed_definiton": "((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32)\n `LS.parse32_nondep_then`\n hkdfLabel_context_parser32)", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.clens_hkdfLabel_hkdfLabel'", "original_source_type": "val clens_hkdfLabel_hkdfLabel':LL.clens hkdfLabel hkdfLabel'", "source_type": "val clens_hkdfLabel_hkdfLabel':LL.clens hkdfLabel hkdfLabel'", "source_definition": "let clens_hkdfLabel_hkdfLabel' : LL.clens hkdfLabel hkdfLabel' = synth_hkdfLabel_recip_inverse (); synth_hkdfLabel_recip_injective (); LL.clens_synth synth_hkdfLabel_recip synth_hkdfLabel", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 135, "start_col": 75, "end_line": 135, "end_col": 197 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)\n\nlet hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()\n\ninline_for_extraction let hkdfLabel'_serializer32 : LS.serializer32 hkdfLabel'_serializer = ((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32) `LS.serialize32_nondep_then` hkdfLabel_context_serializer32)\n\nlet hkdfLabel_serializer32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.serialize32_synth _ synth_hkdfLabel _ hkdfLabel'_serializer32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_size32 : LSZ.size32 hkdfLabel'_serializer = ((LSZ.size32_u16 `LSZ.size32_nondep_then` hkdfLabel_label_size32) `LSZ.size32_nondep_then` hkdfLabel_context_size32)\n\nlet hkdfLabel_size32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LSZ.size32_synth _ synth_hkdfLabel _ hkdfLabel'_size32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_validator : LL.validator hkdfLabel'_parser = (((LL.validate_u16 ()) `LL.validate_nondep_then` hkdfLabel_label_validator) `LL.validate_nondep_then` hkdfLabel_context_validator)\n\nlet hkdfLabel_validator =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.validate_synth hkdfLabel'_validator synth_hkdfLabel ()\n\ninline_for_extraction let hkdfLabel'_jumper : LL.jumper hkdfLabel'_parser = ((LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper) `LL.jump_nondep_then` hkdfLabel_context_jumper)\n\nlet hkdfLabel_jumper =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.jump_synth hkdfLabel'_jumper synth_hkdfLabel ()\n\nlet hkdfLabel_bytesize_eqn x =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth_eq _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip () x;\nLP.length_serialize_nondep_then LPI.serialize_u16 hkdfLabel_label_serializer x.length x.label;\nLP.length_serialize_nondep_then (LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) hkdfLabel_context_serializer (x.length, x.label) x.context;\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u16 (x.length)) == 2));\n (hkdfLabel_label_bytesize_eq (x.label));\n (hkdfLabel_context_bytesize_eq (x.context));\n assert(hkdfLabel_bytesize x == Seq.length (LP.serialize LPI.serialize_u16 x.length) + Seq.length (LP.serialize hkdfLabel_label_serializer x.label) + Seq.length (LP.serialize hkdfLabel_context_serializer x.context))\n\nlet gaccessor'_hkdfLabel_length : LL.gaccessor hkdfLabel'_parser LPI.parse_u16 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_label : LL.gaccessor hkdfLabel'_parser hkdfLabel_label_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_context : LL.gaccessor hkdfLabel'_parser hkdfLabel_context_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id hkdfLabel'_parser))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_length : LL.accessor gaccessor'_hkdfLabel_length = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_label : LL.accessor gaccessor'_hkdfLabel_label = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)) LL.jump_u16)\n\ninline_for_extraction noextract let accessor'_hkdfLabel_context : LL.accessor gaccessor'_hkdfLabel_context = (LL.accessor_then_snd (LL.accessor_id hkdfLabel'_parser) (LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper))", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.HKDF.HkdfLabel.hkdfLabel Parsers.HKDF.HkdfLabel.hkdfLabel'", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.clens_synth", "Parsers.HKDF.HkdfLabel.hkdfLabel", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_recip", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel", "Prims.unit", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_recip_injective", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_recip_inverse" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val clens_hkdfLabel_hkdfLabel':LL.clens hkdfLabel hkdfLabel'\nlet clens_hkdfLabel_hkdfLabel':LL.clens hkdfLabel hkdfLabel' =", "completed_definiton": "synth_hkdfLabel_recip_inverse ();\nsynth_hkdfLabel_recip_injective ();\nLL.clens_synth synth_hkdfLabel_recip synth_hkdfLabel", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.accessor'_hkdfLabel_context", "original_source_type": "val accessor'_hkdfLabel_context:LL.accessor gaccessor'_hkdfLabel_context", "source_type": "val accessor'_hkdfLabel_context:LL.accessor gaccessor'_hkdfLabel_context", "source_definition": "let accessor'_hkdfLabel_context : LL.accessor gaccessor'_hkdfLabel_context = (LL.accessor_then_snd (LL.accessor_id hkdfLabel'_parser) (LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 133, "start_col": 109, "end_line": 133, "end_col": 225 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)\n\nlet hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()\n\ninline_for_extraction let hkdfLabel'_serializer32 : LS.serializer32 hkdfLabel'_serializer = ((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32) `LS.serialize32_nondep_then` hkdfLabel_context_serializer32)\n\nlet hkdfLabel_serializer32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.serialize32_synth _ synth_hkdfLabel _ hkdfLabel'_serializer32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_size32 : LSZ.size32 hkdfLabel'_serializer = ((LSZ.size32_u16 `LSZ.size32_nondep_then` hkdfLabel_label_size32) `LSZ.size32_nondep_then` hkdfLabel_context_size32)\n\nlet hkdfLabel_size32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LSZ.size32_synth _ synth_hkdfLabel _ hkdfLabel'_size32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_validator : LL.validator hkdfLabel'_parser = (((LL.validate_u16 ()) `LL.validate_nondep_then` hkdfLabel_label_validator) `LL.validate_nondep_then` hkdfLabel_context_validator)\n\nlet hkdfLabel_validator =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.validate_synth hkdfLabel'_validator synth_hkdfLabel ()\n\ninline_for_extraction let hkdfLabel'_jumper : LL.jumper hkdfLabel'_parser = ((LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper) `LL.jump_nondep_then` hkdfLabel_context_jumper)\n\nlet hkdfLabel_jumper =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.jump_synth hkdfLabel'_jumper synth_hkdfLabel ()\n\nlet hkdfLabel_bytesize_eqn x =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth_eq _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip () x;\nLP.length_serialize_nondep_then LPI.serialize_u16 hkdfLabel_label_serializer x.length x.label;\nLP.length_serialize_nondep_then (LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) hkdfLabel_context_serializer (x.length, x.label) x.context;\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u16 (x.length)) == 2));\n (hkdfLabel_label_bytesize_eq (x.label));\n (hkdfLabel_context_bytesize_eq (x.context));\n assert(hkdfLabel_bytesize x == Seq.length (LP.serialize LPI.serialize_u16 x.length) + Seq.length (LP.serialize hkdfLabel_label_serializer x.label) + Seq.length (LP.serialize hkdfLabel_context_serializer x.context))\n\nlet gaccessor'_hkdfLabel_length : LL.gaccessor hkdfLabel'_parser LPI.parse_u16 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_label : LL.gaccessor hkdfLabel'_parser hkdfLabel_label_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_context : LL.gaccessor hkdfLabel'_parser hkdfLabel_context_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id hkdfLabel'_parser))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_length : LL.accessor gaccessor'_hkdfLabel_length = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_label : LL.accessor gaccessor'_hkdfLabel_label = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)) LL.jump_u16)", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.HKDF.HkdfLabel.gaccessor'_hkdfLabel_context", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.accessor_then_snd", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "FStar.Pervasives.Native.tuple2", "FStar.UInt16.t", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Int.parse_u16", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Base.Spec.gaccessor_id", "LowParse.Low.Base.accessor_id", "LowParse.Low.Combinators.jump_nondep_then", "LowParse.Low.Int.jump_u16", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_jumper" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor'_hkdfLabel_context:LL.accessor gaccessor'_hkdfLabel_context\nlet accessor'_hkdfLabel_context:LL.accessor gaccessor'_hkdfLabel_context =", "completed_definiton": "(LL.accessor_then_snd (LL.accessor_id hkdfLabel'_parser)\n (LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper))", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.hkdfLabel'_jumper", "original_source_type": "val hkdfLabel'_jumper:LL.jumper hkdfLabel'_parser", "source_type": "val hkdfLabel'_jumper:LL.jumper hkdfLabel'_parser", "source_definition": "let hkdfLabel'_jumper : LL.jumper hkdfLabel'_parser = ((LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper) `LL.jump_nondep_then` hkdfLabel_context_jumper)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 104, "start_col": 76, "end_line": 104, "end_col": 183 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)\n\nlet hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()\n\ninline_for_extraction let hkdfLabel'_serializer32 : LS.serializer32 hkdfLabel'_serializer = ((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32) `LS.serialize32_nondep_then` hkdfLabel_context_serializer32)\n\nlet hkdfLabel_serializer32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.serialize32_synth _ synth_hkdfLabel _ hkdfLabel'_serializer32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_size32 : LSZ.size32 hkdfLabel'_serializer = ((LSZ.size32_u16 `LSZ.size32_nondep_then` hkdfLabel_label_size32) `LSZ.size32_nondep_then` hkdfLabel_context_size32)\n\nlet hkdfLabel_size32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LSZ.size32_synth _ synth_hkdfLabel _ hkdfLabel'_size32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_validator : LL.validator hkdfLabel'_parser = (((LL.validate_u16 ()) `LL.validate_nondep_then` hkdfLabel_label_validator) `LL.validate_nondep_then` hkdfLabel_context_validator)\n\nlet hkdfLabel_validator =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.validate_synth hkdfLabel'_validator synth_hkdfLabel ()", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.jump_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "FStar.Pervasives.Native.tuple2", "FStar.UInt16.t", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Int.parse_u16", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser", "LowParse.Low.Int.jump_u16", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_jumper", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_jumper" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel'_jumper:LL.jumper hkdfLabel'_parser\nlet hkdfLabel'_jumper:LL.jumper hkdfLabel'_parser =", "completed_definiton": "((LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper)\n `LL.jump_nondep_then`\n hkdfLabel_context_jumper)", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.accessor'_hkdfLabel_label", "original_source_type": "val accessor'_hkdfLabel_label:LL.accessor gaccessor'_hkdfLabel_label", "source_type": "val accessor'_hkdfLabel_label:LL.accessor gaccessor'_hkdfLabel_label", "source_definition": "let accessor'_hkdfLabel_label : LL.accessor gaccessor'_hkdfLabel_label = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)) LL.jump_u16)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 131, "start_col": 105, "end_line": 131, "end_col": 197 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)\n\nlet hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()\n\ninline_for_extraction let hkdfLabel'_serializer32 : LS.serializer32 hkdfLabel'_serializer = ((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32) `LS.serialize32_nondep_then` hkdfLabel_context_serializer32)\n\nlet hkdfLabel_serializer32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.serialize32_synth _ synth_hkdfLabel _ hkdfLabel'_serializer32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_size32 : LSZ.size32 hkdfLabel'_serializer = ((LSZ.size32_u16 `LSZ.size32_nondep_then` hkdfLabel_label_size32) `LSZ.size32_nondep_then` hkdfLabel_context_size32)\n\nlet hkdfLabel_size32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LSZ.size32_synth _ synth_hkdfLabel _ hkdfLabel'_size32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_validator : LL.validator hkdfLabel'_parser = (((LL.validate_u16 ()) `LL.validate_nondep_then` hkdfLabel_label_validator) `LL.validate_nondep_then` hkdfLabel_context_validator)\n\nlet hkdfLabel_validator =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.validate_synth hkdfLabel'_validator synth_hkdfLabel ()\n\ninline_for_extraction let hkdfLabel'_jumper : LL.jumper hkdfLabel'_parser = ((LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper) `LL.jump_nondep_then` hkdfLabel_context_jumper)\n\nlet hkdfLabel_jumper =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.jump_synth hkdfLabel'_jumper synth_hkdfLabel ()\n\nlet hkdfLabel_bytesize_eqn x =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth_eq _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip () x;\nLP.length_serialize_nondep_then LPI.serialize_u16 hkdfLabel_label_serializer x.length x.label;\nLP.length_serialize_nondep_then (LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) hkdfLabel_context_serializer (x.length, x.label) x.context;\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u16 (x.length)) == 2));\n (hkdfLabel_label_bytesize_eq (x.label));\n (hkdfLabel_context_bytesize_eq (x.context));\n assert(hkdfLabel_bytesize x == Seq.length (LP.serialize LPI.serialize_u16 x.length) + Seq.length (LP.serialize hkdfLabel_label_serializer x.label) + Seq.length (LP.serialize hkdfLabel_context_serializer x.context))\n\nlet gaccessor'_hkdfLabel_length : LL.gaccessor hkdfLabel'_parser LPI.parse_u16 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_label : LL.gaccessor hkdfLabel'_parser hkdfLabel_label_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_context : LL.gaccessor hkdfLabel'_parser hkdfLabel_context_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id hkdfLabel'_parser))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_length : LL.accessor gaccessor'_hkdfLabel_length = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)))", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.HKDF.HkdfLabel.gaccessor'_hkdfLabel_label", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.accessor_then_snd", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "FStar.UInt16.t", "LowParse.Spec.Int.parse_u16", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser", "LowParse.Low.Base.Spec.clens_compose", "FStar.Pervasives.Native.tuple2", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Combinators.gaccessor_then_fst", "LowParse.Spec.Combinators.nondep_then", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser", "LowParse.Low.Base.Spec.gaccessor_id", "LowParse.Low.Combinators.accessor_then_fst", "LowParse.Low.Base.accessor_id", "LowParse.Low.Int.jump_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor'_hkdfLabel_label:LL.accessor gaccessor'_hkdfLabel_label\nlet accessor'_hkdfLabel_label:LL.accessor gaccessor'_hkdfLabel_label =", "completed_definiton": "(LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)) LL.jump_u16)", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.accessor'_hkdfLabel_length", "original_source_type": "val accessor'_hkdfLabel_length:LL.accessor gaccessor'_hkdfLabel_length", "source_type": "val accessor'_hkdfLabel_length:LL.accessor gaccessor'_hkdfLabel_length", "source_definition": "let accessor'_hkdfLabel_length : LL.accessor gaccessor'_hkdfLabel_length = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 129, "start_col": 107, "end_line": 129, "end_col": 187 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)\n\nlet hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()\n\ninline_for_extraction let hkdfLabel'_serializer32 : LS.serializer32 hkdfLabel'_serializer = ((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32) `LS.serialize32_nondep_then` hkdfLabel_context_serializer32)\n\nlet hkdfLabel_serializer32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.serialize32_synth _ synth_hkdfLabel _ hkdfLabel'_serializer32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_size32 : LSZ.size32 hkdfLabel'_serializer = ((LSZ.size32_u16 `LSZ.size32_nondep_then` hkdfLabel_label_size32) `LSZ.size32_nondep_then` hkdfLabel_context_size32)\n\nlet hkdfLabel_size32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LSZ.size32_synth _ synth_hkdfLabel _ hkdfLabel'_size32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_validator : LL.validator hkdfLabel'_parser = (((LL.validate_u16 ()) `LL.validate_nondep_then` hkdfLabel_label_validator) `LL.validate_nondep_then` hkdfLabel_context_validator)\n\nlet hkdfLabel_validator =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.validate_synth hkdfLabel'_validator synth_hkdfLabel ()\n\ninline_for_extraction let hkdfLabel'_jumper : LL.jumper hkdfLabel'_parser = ((LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper) `LL.jump_nondep_then` hkdfLabel_context_jumper)\n\nlet hkdfLabel_jumper =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.jump_synth hkdfLabel'_jumper synth_hkdfLabel ()\n\nlet hkdfLabel_bytesize_eqn x =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth_eq _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip () x;\nLP.length_serialize_nondep_then LPI.serialize_u16 hkdfLabel_label_serializer x.length x.label;\nLP.length_serialize_nondep_then (LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) hkdfLabel_context_serializer (x.length, x.label) x.context;\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u16 (x.length)) == 2));\n (hkdfLabel_label_bytesize_eq (x.label));\n (hkdfLabel_context_bytesize_eq (x.context));\n assert(hkdfLabel_bytesize x == Seq.length (LP.serialize LPI.serialize_u16 x.length) + Seq.length (LP.serialize hkdfLabel_label_serializer x.label) + Seq.length (LP.serialize hkdfLabel_context_serializer x.context))\n\nlet gaccessor'_hkdfLabel_length : LL.gaccessor hkdfLabel'_parser LPI.parse_u16 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_label : LL.gaccessor hkdfLabel'_parser hkdfLabel_label_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_context : LL.gaccessor hkdfLabel'_parser hkdfLabel_context_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id hkdfLabel'_parser))", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.HKDF.HkdfLabel.gaccessor'_hkdfLabel_length", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.accessor_then_fst", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "FStar.UInt16.t", "LowParse.Spec.Int.parse_u16", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser", "LowParse.Low.Base.Spec.clens_compose", "FStar.Pervasives.Native.tuple2", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Combinators.gaccessor_then_fst", "LowParse.Spec.Combinators.nondep_then", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser", "LowParse.Low.Base.Spec.gaccessor_id", "LowParse.Low.Base.accessor_id" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor'_hkdfLabel_length:LL.accessor gaccessor'_hkdfLabel_length\nlet accessor'_hkdfLabel_length:LL.accessor gaccessor'_hkdfLabel_length =", "completed_definiton": "(LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)))", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser_kind", "original_source_type": "", "source_type": "val hkdfLabel'_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 55, "start_col": 39, "end_line": 55, "end_col": 75 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.get_parser_kind", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let hkdfLabel'_parser_kind =", "completed_definiton": "LP.get_parser_kind hkdfLabel'_parser", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.hkdfLabel_bytesize", "original_source_type": "val hkdfLabel_bytesize (x:hkdfLabel) : GTot nat", "source_type": "val hkdfLabel_bytesize (x:hkdfLabel) : GTot nat", "source_definition": "let hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 70, "start_col": 50, "end_line": 70, "end_col": 85 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.HKDF.HkdfLabel.hkdfLabel -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.HKDF.HkdfLabel.hkdfLabel", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.HKDF.HkdfLabel.hkdfLabel_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_bytesize (x:hkdfLabel) : GTot nat\nlet hkdfLabel_bytesize (x: hkdfLabel) : GTot nat =", "completed_definiton": "Seq.length (hkdfLabel_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.hkdfLabel_serializer", "original_source_type": "val hkdfLabel_serializer: LP.serializer hkdfLabel_parser", "source_type": "val hkdfLabel_serializer: LP.serializer hkdfLabel_parser", "source_definition": "let hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 65, "start_col": 2, "end_line": 68, "end_col": 85 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.HKDF.HkdfLabel.hkdfLabel_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_synth", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.hkdfLabel", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel", "Parsers.HKDF.HkdfLabel.hkdfLabel'_serializer", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_recip", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser_kind", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_inverse", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_serializer: LP.serializer hkdfLabel_parser\nlet hkdfLabel_serializer =", "completed_definiton": "[@@ inline_let ]let _ = synth_hkdfLabel_injective () in\n[@@ inline_let ]let _ = synth_hkdfLabel_inverse () in\n[@@ inline_let ]let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\nLP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.hkdfLabel_jumper", "original_source_type": "val hkdfLabel_jumper: LL.jumper hkdfLabel_parser", "source_type": "val hkdfLabel_jumper: LL.jumper hkdfLabel_parser", "source_definition": "let hkdfLabel_jumper =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.jump_synth hkdfLabel'_jumper synth_hkdfLabel ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 107, "start_col": 2, "end_line": 109, "end_col": 52 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)\n\nlet hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()\n\ninline_for_extraction let hkdfLabel'_serializer32 : LS.serializer32 hkdfLabel'_serializer = ((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32) `LS.serialize32_nondep_then` hkdfLabel_context_serializer32)\n\nlet hkdfLabel_serializer32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.serialize32_synth _ synth_hkdfLabel _ hkdfLabel'_serializer32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_size32 : LSZ.size32 hkdfLabel'_serializer = ((LSZ.size32_u16 `LSZ.size32_nondep_then` hkdfLabel_label_size32) `LSZ.size32_nondep_then` hkdfLabel_context_size32)\n\nlet hkdfLabel_size32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LSZ.size32_synth _ synth_hkdfLabel _ hkdfLabel'_size32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_validator : LL.validator hkdfLabel'_parser = (((LL.validate_u16 ()) `LL.validate_nondep_then` hkdfLabel_label_validator) `LL.validate_nondep_then` hkdfLabel_context_validator)\n\nlet hkdfLabel_validator =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.validate_synth hkdfLabel'_validator synth_hkdfLabel ()\n\ninline_for_extraction let hkdfLabel'_jumper : LL.jumper hkdfLabel'_parser = ((LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper) `LL.jump_nondep_then` hkdfLabel_context_jumper)", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.HKDF.HkdfLabel.hkdfLabel_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.jump_synth", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.hkdfLabel", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "Parsers.HKDF.HkdfLabel.hkdfLabel'_jumper", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser_kind", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_jumper: LL.jumper hkdfLabel_parser\nlet hkdfLabel_jumper =", "completed_definiton": "[@@ inline_let ]let _ = synth_hkdfLabel_injective () in\n[@@ inline_let ]let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\nLL.jump_synth hkdfLabel'_jumper synth_hkdfLabel ()", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_injective", "original_source_type": "val synth_hkdfLabel_injective: Prims.unit -> Lemma (LP.synth_injective synth_hkdfLabel)", "source_type": "val synth_hkdfLabel_injective: Prims.unit -> Lemma (LP.synth_injective synth_hkdfLabel)", "source_definition": "let synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 43, "start_col": 2, "end_line": 44, "end_col": 34 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures LowParse.Spec.Combinators.synth_injective Parsers.HKDF.HkdfLabel.synth_hkdfLabel)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_recip_inverse", "LowParse.Spec.Combinators.synth_inverse_synth_injective", "Parsers.HKDF.HkdfLabel.hkdfLabel", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_recip", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_injective", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_hkdfLabel_injective: Prims.unit -> Lemma (LP.synth_injective synth_hkdfLabel)\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =", "completed_definiton": "LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\nsynth_hkdfLabel_recip_inverse ()", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.hkdfLabel'_serializer", "original_source_type": "val hkdfLabel'_serializer:LP.serializer hkdfLabel'_parser", "source_type": "val hkdfLabel'_serializer:LP.serializer hkdfLabel'_parser", "source_definition": "let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 62, "start_col": 72, "end_line": 62, "end_col": 203 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "FStar.Pervasives.Native.tuple2", "FStar.UInt16.t", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Int.parse_u16", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser", "LowParse.Spec.Int.serialize_u16", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_serializer", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel'_serializer:LP.serializer hkdfLabel'_parser\nlet hkdfLabel'_serializer:LP.serializer hkdfLabel'_parser =", "completed_definiton": "((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer)\n `LP.serialize_nondep_then`\n hkdfLabel_context_serializer)", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.hkdfLabel_validator", "original_source_type": "val hkdfLabel_validator: LL.validator hkdfLabel_parser", "source_type": "val hkdfLabel_validator: LL.validator hkdfLabel_parser", "source_definition": "let hkdfLabel_validator =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.validate_synth hkdfLabel'_validator synth_hkdfLabel ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 100, "start_col": 2, "end_line": 102, "end_col": 59 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)\n\nlet hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()\n\ninline_for_extraction let hkdfLabel'_serializer32 : LS.serializer32 hkdfLabel'_serializer = ((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32) `LS.serialize32_nondep_then` hkdfLabel_context_serializer32)\n\nlet hkdfLabel_serializer32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.serialize32_synth _ synth_hkdfLabel _ hkdfLabel'_serializer32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_size32 : LSZ.size32 hkdfLabel'_serializer = ((LSZ.size32_u16 `LSZ.size32_nondep_then` hkdfLabel_label_size32) `LSZ.size32_nondep_then` hkdfLabel_context_size32)\n\nlet hkdfLabel_size32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LSZ.size32_synth _ synth_hkdfLabel _ hkdfLabel'_size32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_validator : LL.validator hkdfLabel'_parser = (((LL.validate_u16 ()) `LL.validate_nondep_then` hkdfLabel_label_validator) `LL.validate_nondep_then` hkdfLabel_context_validator)", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.HKDF.HkdfLabel.hkdfLabel_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.validate_synth", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.hkdfLabel", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "Parsers.HKDF.HkdfLabel.hkdfLabel'_validator", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser_kind", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_validator: LL.validator hkdfLabel_parser\nlet hkdfLabel_validator =", "completed_definiton": "[@@ inline_let ]let _ = synth_hkdfLabel_injective () in\n[@@ inline_let ]let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\nLL.validate_synth hkdfLabel'_validator synth_hkdfLabel ()", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.hkdfLabel'_size32", "original_source_type": "val hkdfLabel'_size32:LSZ.size32 hkdfLabel'_serializer", "source_type": "val hkdfLabel'_size32:LSZ.size32 hkdfLabel'_serializer", "source_definition": "let hkdfLabel'_size32 : LSZ.size32 hkdfLabel'_serializer = ((LSZ.size32_u16 `LSZ.size32_nondep_then` hkdfLabel_label_size32) `LSZ.size32_nondep_then` hkdfLabel_context_size32)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 89, "start_col": 81, "end_line": 89, "end_col": 197 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)\n\nlet hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()\n\ninline_for_extraction let hkdfLabel'_serializer32 : LS.serializer32 hkdfLabel'_serializer = ((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32) `LS.serialize32_nondep_then` hkdfLabel_context_serializer32)\n\nlet hkdfLabel_serializer32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.serialize32_synth _ synth_hkdfLabel _ hkdfLabel'_serializer32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.HKDF.HkdfLabel.hkdfLabel'_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.size32_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "FStar.Pervasives.Native.tuple2", "FStar.UInt16.t", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Int.parse_u16", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser", "LowParse.Spec.Combinators.serialize_nondep_then", "LowParse.Spec.Int.serialize_u16", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_serializer", "LowParse.SLow.Int.size32_u16", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_size32", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_serializer", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_size32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel'_size32:LSZ.size32 hkdfLabel'_serializer\nlet hkdfLabel'_size32:LSZ.size32 hkdfLabel'_serializer =", "completed_definiton": "((LSZ.size32_u16 `LSZ.size32_nondep_then` hkdfLabel_label_size32)\n `LSZ.size32_nondep_then`\n hkdfLabel_context_size32)", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.hkdfLabel_size32", "original_source_type": "val hkdfLabel_size32: LSZ.size32 hkdfLabel_serializer", "source_type": "val hkdfLabel_size32: LSZ.size32 hkdfLabel_serializer", "source_definition": "let hkdfLabel_size32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LSZ.size32_synth _ synth_hkdfLabel _ hkdfLabel'_size32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 92, "start_col": 2, "end_line": 95, "end_col": 116 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)\n\nlet hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()\n\ninline_for_extraction let hkdfLabel'_serializer32 : LS.serializer32 hkdfLabel'_serializer = ((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32) `LS.serialize32_nondep_then` hkdfLabel_context_serializer32)\n\nlet hkdfLabel_serializer32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.serialize32_synth _ synth_hkdfLabel _ hkdfLabel'_serializer32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_size32 : LSZ.size32 hkdfLabel'_serializer = ((LSZ.size32_u16 `LSZ.size32_nondep_then` hkdfLabel_label_size32) `LSZ.size32_nondep_then` hkdfLabel_context_size32)", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.HKDF.HkdfLabel.hkdfLabel_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.size32_synth", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.hkdfLabel", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel", "Parsers.HKDF.HkdfLabel.hkdfLabel'_serializer", "Parsers.HKDF.HkdfLabel.hkdfLabel'_size32", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_recip", "Prims.eq2", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.Base.parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser_kind", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_inverse", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_size32: LSZ.size32 hkdfLabel_serializer\nlet hkdfLabel_size32 =", "completed_definiton": "[@@ inline_let ]let _ = synth_hkdfLabel_injective () in\n[@@ inline_let ]let _ = synth_hkdfLabel_inverse () in\n[@@ inline_let ]let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\nLSZ.size32_synth _\n synth_hkdfLabel\n _\n hkdfLabel'_size32\n synth_hkdfLabel_recip\n (fun x -> synth_hkdfLabel_recip x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.accessor_hkdfLabel_length", "original_source_type": "val accessor_hkdfLabel_length : LL.accessor gaccessor_hkdfLabel_length", "source_type": "val accessor_hkdfLabel_length : LL.accessor gaccessor_hkdfLabel_length", "source_definition": "let accessor_hkdfLabel_length = LL.accessor_ext (LL.accessor_compose accessor_hkdfLabel_hkdfLabel' accessor'_hkdfLabel_length ()) clens_hkdfLabel_length ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 143, "start_col": 32, "end_line": 143, "end_col": 155 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)\n\nlet hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()\n\ninline_for_extraction let hkdfLabel'_serializer32 : LS.serializer32 hkdfLabel'_serializer = ((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32) `LS.serialize32_nondep_then` hkdfLabel_context_serializer32)\n\nlet hkdfLabel_serializer32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.serialize32_synth _ synth_hkdfLabel _ hkdfLabel'_serializer32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_size32 : LSZ.size32 hkdfLabel'_serializer = ((LSZ.size32_u16 `LSZ.size32_nondep_then` hkdfLabel_label_size32) `LSZ.size32_nondep_then` hkdfLabel_context_size32)\n\nlet hkdfLabel_size32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LSZ.size32_synth _ synth_hkdfLabel _ hkdfLabel'_size32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_validator : LL.validator hkdfLabel'_parser = (((LL.validate_u16 ()) `LL.validate_nondep_then` hkdfLabel_label_validator) `LL.validate_nondep_then` hkdfLabel_context_validator)\n\nlet hkdfLabel_validator =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.validate_synth hkdfLabel'_validator synth_hkdfLabel ()\n\ninline_for_extraction let hkdfLabel'_jumper : LL.jumper hkdfLabel'_parser = ((LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper) `LL.jump_nondep_then` hkdfLabel_context_jumper)\n\nlet hkdfLabel_jumper =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.jump_synth hkdfLabel'_jumper synth_hkdfLabel ()\n\nlet hkdfLabel_bytesize_eqn x =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth_eq _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip () x;\nLP.length_serialize_nondep_then LPI.serialize_u16 hkdfLabel_label_serializer x.length x.label;\nLP.length_serialize_nondep_then (LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) hkdfLabel_context_serializer (x.length, x.label) x.context;\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u16 (x.length)) == 2));\n (hkdfLabel_label_bytesize_eq (x.label));\n (hkdfLabel_context_bytesize_eq (x.context));\n assert(hkdfLabel_bytesize x == Seq.length (LP.serialize LPI.serialize_u16 x.length) + Seq.length (LP.serialize hkdfLabel_label_serializer x.label) + Seq.length (LP.serialize hkdfLabel_context_serializer x.context))\n\nlet gaccessor'_hkdfLabel_length : LL.gaccessor hkdfLabel'_parser LPI.parse_u16 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_label : LL.gaccessor hkdfLabel'_parser hkdfLabel_label_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_context : LL.gaccessor hkdfLabel'_parser hkdfLabel_context_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id hkdfLabel'_parser))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_length : LL.accessor gaccessor'_hkdfLabel_length = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_label : LL.accessor gaccessor'_hkdfLabel_label = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)) LL.jump_u16)\n\ninline_for_extraction noextract let accessor'_hkdfLabel_context : LL.accessor gaccessor'_hkdfLabel_context = (LL.accessor_then_snd (LL.accessor_id hkdfLabel'_parser) (LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper))\n\nnoextract let clens_hkdfLabel_hkdfLabel' : LL.clens hkdfLabel hkdfLabel' = synth_hkdfLabel_recip_inverse (); synth_hkdfLabel_recip_injective (); LL.clens_synth synth_hkdfLabel_recip synth_hkdfLabel\n\nlet gaccessor_hkdfLabel_hkdfLabel' : LL.gaccessor hkdfLabel_parser hkdfLabel'_parser clens_hkdfLabel_hkdfLabel' = synth_hkdfLabel_inverse (); synth_hkdfLabel_injective (); synth_hkdfLabel_recip_inverse (); LL.gaccessor_synth hkdfLabel'_parser synth_hkdfLabel synth_hkdfLabel_recip ()\n\ninline_for_extraction noextract let accessor_hkdfLabel_hkdfLabel' : LL.accessor gaccessor_hkdfLabel_hkdfLabel' = synth_hkdfLabel_inverse (); synth_hkdfLabel_injective (); synth_hkdfLabel_recip_inverse (); LL.accessor_synth hkdfLabel'_parser synth_hkdfLabel synth_hkdfLabel_recip ()\n\nlet gaccessor_hkdfLabel_length = LL.gaccessor_ext (gaccessor_hkdfLabel_hkdfLabel' `LL.gaccessor_compose` gaccessor'_hkdfLabel_length) clens_hkdfLabel_length ()", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.HKDF.HkdfLabel.gaccessor_hkdfLabel_length", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.accessor_ext", "Parsers.HKDF.HkdfLabel.hkdfLabel_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel", "Parsers.HKDF.HkdfLabel.hkdfLabel_parser", "LowParse.Spec.Int.parse_u16_kind", "FStar.UInt16.t", "LowParse.Spec.Int.parse_u16", "LowParse.Low.Base.Spec.clens_compose", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.clens_hkdfLabel_hkdfLabel'", "FStar.Pervasives.Native.tuple2", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "Parsers.HKDF.HkdfLabel.gaccessor_hkdfLabel_hkdfLabel'", "Parsers.HKDF.HkdfLabel.gaccessor'_hkdfLabel_length", "LowParse.Low.Base.accessor_compose", "Parsers.HKDF.HkdfLabel.accessor_hkdfLabel_hkdfLabel'", "Parsers.HKDF.HkdfLabel.accessor'_hkdfLabel_length", "Parsers.HKDF.HkdfLabel.clens_hkdfLabel_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor_hkdfLabel_length : LL.accessor gaccessor_hkdfLabel_length\nlet accessor_hkdfLabel_length =", "completed_definiton": "LL.accessor_ext (LL.accessor_compose accessor_hkdfLabel_hkdfLabel' accessor'_hkdfLabel_length ())\n clens_hkdfLabel_length\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_inverse", "original_source_type": "val synth_hkdfLabel_inverse: Prims.unit\n -> Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)", "source_type": "val synth_hkdfLabel_inverse: Prims.unit\n -> Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)", "source_definition": "let synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 47, "start_col": 2, "end_line": 47, "end_col": 70 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_inverse Parsers.HKDF.HkdfLabel.synth_hkdfLabel\n Parsers.HKDF.HkdfLabel.synth_hkdfLabel_recip)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.Combinators.synth_inverse", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.hkdfLabel", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_recip", "Prims.l_True", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_hkdfLabel_inverse: Prims.unit\n -> Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =", "completed_definiton": "assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.hkdfLabel'_serializer32", "original_source_type": "val hkdfLabel'_serializer32:LS.serializer32 hkdfLabel'_serializer", "source_type": "val hkdfLabel'_serializer32:LS.serializer32 hkdfLabel'_serializer", "source_definition": "let hkdfLabel'_serializer32 : LS.serializer32 hkdfLabel'_serializer = ((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32) `LS.serialize32_nondep_then` hkdfLabel_context_serializer32)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 81, "start_col": 92, "end_line": 81, "end_col": 232 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)\n\nlet hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.HKDF.HkdfLabel.hkdfLabel'_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "FStar.Pervasives.Native.tuple2", "FStar.UInt16.t", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Int.parse_u16", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser", "LowParse.Spec.Combinators.serialize_nondep_then", "LowParse.Spec.Int.serialize_u16", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_serializer", "LowParse.SLow.Int.serialize32_u16", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_serializer32", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_serializer", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_serializer32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel'_serializer32:LS.serializer32 hkdfLabel'_serializer\nlet hkdfLabel'_serializer32:LS.serializer32 hkdfLabel'_serializer =", "completed_definiton": "((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32)\n `LS.serialize32_nondep_then`\n hkdfLabel_context_serializer32)", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.hkdfLabel_parser32", "original_source_type": "val hkdfLabel_parser32: LS.parser32 hkdfLabel_parser", "source_type": "val hkdfLabel_parser32: LS.parser32 hkdfLabel_parser", "source_definition": "let hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 77, "start_col": 2, "end_line": 79, "end_col": 88 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.HKDF.HkdfLabel.hkdfLabel_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_synth", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.hkdfLabel", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel", "Prims.eq2", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser32", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.Base.parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser_kind", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_parser32: LS.parser32 hkdfLabel_parser\nlet hkdfLabel_parser32 =", "completed_definiton": "[@@ inline_let ]let _ = synth_hkdfLabel_injective () in\n[@@ inline_let ]let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\nLS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.gaccessor_hkdfLabel_context", "original_source_type": "val gaccessor_hkdfLabel_context : LL.gaccessor hkdfLabel_parser hkdfLabel_context_parser clens_hkdfLabel_context", "source_type": "val gaccessor_hkdfLabel_context : LL.gaccessor hkdfLabel_parser hkdfLabel_context_parser clens_hkdfLabel_context", "source_definition": "let gaccessor_hkdfLabel_context = LL.gaccessor_ext (gaccessor_hkdfLabel_hkdfLabel' `LL.gaccessor_compose` gaccessor'_hkdfLabel_context) clens_hkdfLabel_context ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 149, "start_col": 34, "end_line": 149, "end_col": 162 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)\n\nlet hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()\n\ninline_for_extraction let hkdfLabel'_serializer32 : LS.serializer32 hkdfLabel'_serializer = ((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32) `LS.serialize32_nondep_then` hkdfLabel_context_serializer32)\n\nlet hkdfLabel_serializer32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.serialize32_synth _ synth_hkdfLabel _ hkdfLabel'_serializer32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_size32 : LSZ.size32 hkdfLabel'_serializer = ((LSZ.size32_u16 `LSZ.size32_nondep_then` hkdfLabel_label_size32) `LSZ.size32_nondep_then` hkdfLabel_context_size32)\n\nlet hkdfLabel_size32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LSZ.size32_synth _ synth_hkdfLabel _ hkdfLabel'_size32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_validator : LL.validator hkdfLabel'_parser = (((LL.validate_u16 ()) `LL.validate_nondep_then` hkdfLabel_label_validator) `LL.validate_nondep_then` hkdfLabel_context_validator)\n\nlet hkdfLabel_validator =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.validate_synth hkdfLabel'_validator synth_hkdfLabel ()\n\ninline_for_extraction let hkdfLabel'_jumper : LL.jumper hkdfLabel'_parser = ((LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper) `LL.jump_nondep_then` hkdfLabel_context_jumper)\n\nlet hkdfLabel_jumper =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.jump_synth hkdfLabel'_jumper synth_hkdfLabel ()\n\nlet hkdfLabel_bytesize_eqn x =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth_eq _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip () x;\nLP.length_serialize_nondep_then LPI.serialize_u16 hkdfLabel_label_serializer x.length x.label;\nLP.length_serialize_nondep_then (LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) hkdfLabel_context_serializer (x.length, x.label) x.context;\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u16 (x.length)) == 2));\n (hkdfLabel_label_bytesize_eq (x.label));\n (hkdfLabel_context_bytesize_eq (x.context));\n assert(hkdfLabel_bytesize x == Seq.length (LP.serialize LPI.serialize_u16 x.length) + Seq.length (LP.serialize hkdfLabel_label_serializer x.label) + Seq.length (LP.serialize hkdfLabel_context_serializer x.context))\n\nlet gaccessor'_hkdfLabel_length : LL.gaccessor hkdfLabel'_parser LPI.parse_u16 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_label : LL.gaccessor hkdfLabel'_parser hkdfLabel_label_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_context : LL.gaccessor hkdfLabel'_parser hkdfLabel_context_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id hkdfLabel'_parser))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_length : LL.accessor gaccessor'_hkdfLabel_length = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_label : LL.accessor gaccessor'_hkdfLabel_label = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)) LL.jump_u16)\n\ninline_for_extraction noextract let accessor'_hkdfLabel_context : LL.accessor gaccessor'_hkdfLabel_context = (LL.accessor_then_snd (LL.accessor_id hkdfLabel'_parser) (LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper))\n\nnoextract let clens_hkdfLabel_hkdfLabel' : LL.clens hkdfLabel hkdfLabel' = synth_hkdfLabel_recip_inverse (); synth_hkdfLabel_recip_injective (); LL.clens_synth synth_hkdfLabel_recip synth_hkdfLabel\n\nlet gaccessor_hkdfLabel_hkdfLabel' : LL.gaccessor hkdfLabel_parser hkdfLabel'_parser clens_hkdfLabel_hkdfLabel' = synth_hkdfLabel_inverse (); synth_hkdfLabel_injective (); synth_hkdfLabel_recip_inverse (); LL.gaccessor_synth hkdfLabel'_parser synth_hkdfLabel synth_hkdfLabel_recip ()\n\ninline_for_extraction noextract let accessor_hkdfLabel_hkdfLabel' : LL.accessor gaccessor_hkdfLabel_hkdfLabel' = synth_hkdfLabel_inverse (); synth_hkdfLabel_injective (); synth_hkdfLabel_recip_inverse (); LL.accessor_synth hkdfLabel'_parser synth_hkdfLabel synth_hkdfLabel_recip ()\n\nlet gaccessor_hkdfLabel_length = LL.gaccessor_ext (gaccessor_hkdfLabel_hkdfLabel' `LL.gaccessor_compose` gaccessor'_hkdfLabel_length) clens_hkdfLabel_length ()\n\nlet accessor_hkdfLabel_length = LL.accessor_ext (LL.accessor_compose accessor_hkdfLabel_hkdfLabel' accessor'_hkdfLabel_length ()) clens_hkdfLabel_length ()\n\nlet gaccessor_hkdfLabel_label = LL.gaccessor_ext (gaccessor_hkdfLabel_hkdfLabel' `LL.gaccessor_compose` gaccessor'_hkdfLabel_label) clens_hkdfLabel_label ()\n\nlet accessor_hkdfLabel_label = LL.accessor_ext (LL.accessor_compose accessor_hkdfLabel_hkdfLabel' accessor'_hkdfLabel_label ()) clens_hkdfLabel_label ()", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.HKDF.HkdfLabel.hkdfLabel_parser\n Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser\n Parsers.HKDF.HkdfLabel.clens_hkdfLabel_context", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.gaccessor_ext", "Parsers.HKDF.HkdfLabel.hkdfLabel_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel", "Parsers.HKDF.HkdfLabel.hkdfLabel_parser", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.clens_hkdfLabel_hkdfLabel'", "FStar.Pervasives.Native.tuple2", "FStar.UInt16.t", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "Parsers.HKDF.HkdfLabel.gaccessor_hkdfLabel_hkdfLabel'", "Parsers.HKDF.HkdfLabel.gaccessor'_hkdfLabel_context", "Parsers.HKDF.HkdfLabel.clens_hkdfLabel_context" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val gaccessor_hkdfLabel_context : LL.gaccessor hkdfLabel_parser hkdfLabel_context_parser clens_hkdfLabel_context\nlet gaccessor_hkdfLabel_context =", "completed_definiton": "LL.gaccessor_ext (gaccessor_hkdfLabel_hkdfLabel' `LL.gaccessor_compose` gaccessor'_hkdfLabel_context\n )\n clens_hkdfLabel_context\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.hkdfLabel_serializer32", "original_source_type": "val hkdfLabel_serializer32: LS.serializer32 hkdfLabel_serializer", "source_type": "val hkdfLabel_serializer32: LS.serializer32 hkdfLabel_serializer", "source_definition": "let hkdfLabel_serializer32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.serialize32_synth _ synth_hkdfLabel _ hkdfLabel'_serializer32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 84, "start_col": 2, "end_line": 87, "end_col": 126 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)\n\nlet hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()\n\ninline_for_extraction let hkdfLabel'_serializer32 : LS.serializer32 hkdfLabel'_serializer = ((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32) `LS.serialize32_nondep_then` hkdfLabel_context_serializer32)", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.HKDF.HkdfLabel.hkdfLabel_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_synth", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.hkdfLabel", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel", "Parsers.HKDF.HkdfLabel.hkdfLabel'_serializer", "Parsers.HKDF.HkdfLabel.hkdfLabel'_serializer32", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_recip", "Prims.eq2", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.Base.parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser_kind", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_inverse", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_serializer32: LS.serializer32 hkdfLabel_serializer\nlet hkdfLabel_serializer32 =", "completed_definiton": "[@@ inline_let ]let _ = synth_hkdfLabel_injective () in\n[@@ inline_let ]let _ = synth_hkdfLabel_inverse () in\n[@@ inline_let ]let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\nLS.serialize32_synth _\n synth_hkdfLabel\n _\n hkdfLabel'_serializer32\n synth_hkdfLabel_recip\n (fun x -> synth_hkdfLabel_recip x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_recip_injective", "original_source_type": "val synth_hkdfLabel_recip_injective: Prims.unit -> Lemma (LP.synth_injective synth_hkdfLabel_recip)", "source_type": "val synth_hkdfLabel_recip_injective: Prims.unit -> Lemma (LP.synth_injective synth_hkdfLabel_recip)", "source_definition": "let synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 50, "start_col": 2, "end_line": 51, "end_col": 72 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures LowParse.Spec.Combinators.synth_injective Parsers.HKDF.HkdfLabel.synth_hkdfLabel_recip)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "LowParse.Spec.Combinators.synth_inverse_synth_injective", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.hkdfLabel", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_recip", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_recip_inverse", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_injective", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_hkdfLabel_recip_injective: Prims.unit -> Lemma (LP.synth_injective synth_hkdfLabel_recip)\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =", "completed_definiton": "synth_hkdfLabel_recip_inverse ();\nLP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.gaccessor_hkdfLabel_label", "original_source_type": "val gaccessor_hkdfLabel_label : LL.gaccessor hkdfLabel_parser hkdfLabel_label_parser clens_hkdfLabel_label", "source_type": "val gaccessor_hkdfLabel_label : LL.gaccessor hkdfLabel_parser hkdfLabel_label_parser clens_hkdfLabel_label", "source_definition": "let gaccessor_hkdfLabel_label = LL.gaccessor_ext (gaccessor_hkdfLabel_hkdfLabel' `LL.gaccessor_compose` gaccessor'_hkdfLabel_label) clens_hkdfLabel_label ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 145, "start_col": 32, "end_line": 145, "end_col": 156 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)\n\nlet hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()\n\ninline_for_extraction let hkdfLabel'_serializer32 : LS.serializer32 hkdfLabel'_serializer = ((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32) `LS.serialize32_nondep_then` hkdfLabel_context_serializer32)\n\nlet hkdfLabel_serializer32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.serialize32_synth _ synth_hkdfLabel _ hkdfLabel'_serializer32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_size32 : LSZ.size32 hkdfLabel'_serializer = ((LSZ.size32_u16 `LSZ.size32_nondep_then` hkdfLabel_label_size32) `LSZ.size32_nondep_then` hkdfLabel_context_size32)\n\nlet hkdfLabel_size32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LSZ.size32_synth _ synth_hkdfLabel _ hkdfLabel'_size32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_validator : LL.validator hkdfLabel'_parser = (((LL.validate_u16 ()) `LL.validate_nondep_then` hkdfLabel_label_validator) `LL.validate_nondep_then` hkdfLabel_context_validator)\n\nlet hkdfLabel_validator =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.validate_synth hkdfLabel'_validator synth_hkdfLabel ()\n\ninline_for_extraction let hkdfLabel'_jumper : LL.jumper hkdfLabel'_parser = ((LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper) `LL.jump_nondep_then` hkdfLabel_context_jumper)\n\nlet hkdfLabel_jumper =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.jump_synth hkdfLabel'_jumper synth_hkdfLabel ()\n\nlet hkdfLabel_bytesize_eqn x =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth_eq _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip () x;\nLP.length_serialize_nondep_then LPI.serialize_u16 hkdfLabel_label_serializer x.length x.label;\nLP.length_serialize_nondep_then (LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) hkdfLabel_context_serializer (x.length, x.label) x.context;\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u16 (x.length)) == 2));\n (hkdfLabel_label_bytesize_eq (x.label));\n (hkdfLabel_context_bytesize_eq (x.context));\n assert(hkdfLabel_bytesize x == Seq.length (LP.serialize LPI.serialize_u16 x.length) + Seq.length (LP.serialize hkdfLabel_label_serializer x.label) + Seq.length (LP.serialize hkdfLabel_context_serializer x.context))\n\nlet gaccessor'_hkdfLabel_length : LL.gaccessor hkdfLabel'_parser LPI.parse_u16 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_label : LL.gaccessor hkdfLabel'_parser hkdfLabel_label_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_context : LL.gaccessor hkdfLabel'_parser hkdfLabel_context_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id hkdfLabel'_parser))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_length : LL.accessor gaccessor'_hkdfLabel_length = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_label : LL.accessor gaccessor'_hkdfLabel_label = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)) LL.jump_u16)\n\ninline_for_extraction noextract let accessor'_hkdfLabel_context : LL.accessor gaccessor'_hkdfLabel_context = (LL.accessor_then_snd (LL.accessor_id hkdfLabel'_parser) (LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper))\n\nnoextract let clens_hkdfLabel_hkdfLabel' : LL.clens hkdfLabel hkdfLabel' = synth_hkdfLabel_recip_inverse (); synth_hkdfLabel_recip_injective (); LL.clens_synth synth_hkdfLabel_recip synth_hkdfLabel\n\nlet gaccessor_hkdfLabel_hkdfLabel' : LL.gaccessor hkdfLabel_parser hkdfLabel'_parser clens_hkdfLabel_hkdfLabel' = synth_hkdfLabel_inverse (); synth_hkdfLabel_injective (); synth_hkdfLabel_recip_inverse (); LL.gaccessor_synth hkdfLabel'_parser synth_hkdfLabel synth_hkdfLabel_recip ()\n\ninline_for_extraction noextract let accessor_hkdfLabel_hkdfLabel' : LL.accessor gaccessor_hkdfLabel_hkdfLabel' = synth_hkdfLabel_inverse (); synth_hkdfLabel_injective (); synth_hkdfLabel_recip_inverse (); LL.accessor_synth hkdfLabel'_parser synth_hkdfLabel synth_hkdfLabel_recip ()\n\nlet gaccessor_hkdfLabel_length = LL.gaccessor_ext (gaccessor_hkdfLabel_hkdfLabel' `LL.gaccessor_compose` gaccessor'_hkdfLabel_length) clens_hkdfLabel_length ()\n\nlet accessor_hkdfLabel_length = LL.accessor_ext (LL.accessor_compose accessor_hkdfLabel_hkdfLabel' accessor'_hkdfLabel_length ()) clens_hkdfLabel_length ()", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.HKDF.HkdfLabel.hkdfLabel_parser\n Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser\n Parsers.HKDF.HkdfLabel.clens_hkdfLabel_label", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.gaccessor_ext", "Parsers.HKDF.HkdfLabel.hkdfLabel_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel", "Parsers.HKDF.HkdfLabel.hkdfLabel_parser", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.clens_hkdfLabel_hkdfLabel'", "FStar.Pervasives.Native.tuple2", "FStar.UInt16.t", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "Parsers.HKDF.HkdfLabel.gaccessor_hkdfLabel_hkdfLabel'", "Parsers.HKDF.HkdfLabel.gaccessor'_hkdfLabel_label", "Parsers.HKDF.HkdfLabel.clens_hkdfLabel_label" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val gaccessor_hkdfLabel_label : LL.gaccessor hkdfLabel_parser hkdfLabel_label_parser clens_hkdfLabel_label\nlet gaccessor_hkdfLabel_label =", "completed_definiton": "LL.gaccessor_ext (gaccessor_hkdfLabel_hkdfLabel' `LL.gaccessor_compose` gaccessor'_hkdfLabel_label)\n clens_hkdfLabel_label\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.accessor_hkdfLabel_label", "original_source_type": "val accessor_hkdfLabel_label : LL.accessor gaccessor_hkdfLabel_label", "source_type": "val accessor_hkdfLabel_label : LL.accessor gaccessor_hkdfLabel_label", "source_definition": "let accessor_hkdfLabel_label = LL.accessor_ext (LL.accessor_compose accessor_hkdfLabel_hkdfLabel' accessor'_hkdfLabel_label ()) clens_hkdfLabel_label ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 147, "start_col": 31, "end_line": 147, "end_col": 152 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)\n\nlet hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()\n\ninline_for_extraction let hkdfLabel'_serializer32 : LS.serializer32 hkdfLabel'_serializer = ((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32) `LS.serialize32_nondep_then` hkdfLabel_context_serializer32)\n\nlet hkdfLabel_serializer32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.serialize32_synth _ synth_hkdfLabel _ hkdfLabel'_serializer32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_size32 : LSZ.size32 hkdfLabel'_serializer = ((LSZ.size32_u16 `LSZ.size32_nondep_then` hkdfLabel_label_size32) `LSZ.size32_nondep_then` hkdfLabel_context_size32)\n\nlet hkdfLabel_size32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LSZ.size32_synth _ synth_hkdfLabel _ hkdfLabel'_size32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_validator : LL.validator hkdfLabel'_parser = (((LL.validate_u16 ()) `LL.validate_nondep_then` hkdfLabel_label_validator) `LL.validate_nondep_then` hkdfLabel_context_validator)\n\nlet hkdfLabel_validator =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.validate_synth hkdfLabel'_validator synth_hkdfLabel ()\n\ninline_for_extraction let hkdfLabel'_jumper : LL.jumper hkdfLabel'_parser = ((LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper) `LL.jump_nondep_then` hkdfLabel_context_jumper)\n\nlet hkdfLabel_jumper =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.jump_synth hkdfLabel'_jumper synth_hkdfLabel ()\n\nlet hkdfLabel_bytesize_eqn x =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth_eq _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip () x;\nLP.length_serialize_nondep_then LPI.serialize_u16 hkdfLabel_label_serializer x.length x.label;\nLP.length_serialize_nondep_then (LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) hkdfLabel_context_serializer (x.length, x.label) x.context;\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u16 (x.length)) == 2));\n (hkdfLabel_label_bytesize_eq (x.label));\n (hkdfLabel_context_bytesize_eq (x.context));\n assert(hkdfLabel_bytesize x == Seq.length (LP.serialize LPI.serialize_u16 x.length) + Seq.length (LP.serialize hkdfLabel_label_serializer x.label) + Seq.length (LP.serialize hkdfLabel_context_serializer x.context))\n\nlet gaccessor'_hkdfLabel_length : LL.gaccessor hkdfLabel'_parser LPI.parse_u16 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_label : LL.gaccessor hkdfLabel'_parser hkdfLabel_label_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_context : LL.gaccessor hkdfLabel'_parser hkdfLabel_context_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id hkdfLabel'_parser))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_length : LL.accessor gaccessor'_hkdfLabel_length = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_label : LL.accessor gaccessor'_hkdfLabel_label = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)) LL.jump_u16)\n\ninline_for_extraction noextract let accessor'_hkdfLabel_context : LL.accessor gaccessor'_hkdfLabel_context = (LL.accessor_then_snd (LL.accessor_id hkdfLabel'_parser) (LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper))\n\nnoextract let clens_hkdfLabel_hkdfLabel' : LL.clens hkdfLabel hkdfLabel' = synth_hkdfLabel_recip_inverse (); synth_hkdfLabel_recip_injective (); LL.clens_synth synth_hkdfLabel_recip synth_hkdfLabel\n\nlet gaccessor_hkdfLabel_hkdfLabel' : LL.gaccessor hkdfLabel_parser hkdfLabel'_parser clens_hkdfLabel_hkdfLabel' = synth_hkdfLabel_inverse (); synth_hkdfLabel_injective (); synth_hkdfLabel_recip_inverse (); LL.gaccessor_synth hkdfLabel'_parser synth_hkdfLabel synth_hkdfLabel_recip ()\n\ninline_for_extraction noextract let accessor_hkdfLabel_hkdfLabel' : LL.accessor gaccessor_hkdfLabel_hkdfLabel' = synth_hkdfLabel_inverse (); synth_hkdfLabel_injective (); synth_hkdfLabel_recip_inverse (); LL.accessor_synth hkdfLabel'_parser synth_hkdfLabel synth_hkdfLabel_recip ()\n\nlet gaccessor_hkdfLabel_length = LL.gaccessor_ext (gaccessor_hkdfLabel_hkdfLabel' `LL.gaccessor_compose` gaccessor'_hkdfLabel_length) clens_hkdfLabel_length ()\n\nlet accessor_hkdfLabel_length = LL.accessor_ext (LL.accessor_compose accessor_hkdfLabel_hkdfLabel' accessor'_hkdfLabel_length ()) clens_hkdfLabel_length ()\n\nlet gaccessor_hkdfLabel_label = LL.gaccessor_ext (gaccessor_hkdfLabel_hkdfLabel' `LL.gaccessor_compose` gaccessor'_hkdfLabel_label) clens_hkdfLabel_label ()", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.HKDF.HkdfLabel.gaccessor_hkdfLabel_label", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.accessor_ext", "Parsers.HKDF.HkdfLabel.hkdfLabel_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel", "Parsers.HKDF.HkdfLabel.hkdfLabel_parser", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.clens_hkdfLabel_hkdfLabel'", "FStar.Pervasives.Native.tuple2", "FStar.UInt16.t", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "Parsers.HKDF.HkdfLabel.gaccessor_hkdfLabel_hkdfLabel'", "Parsers.HKDF.HkdfLabel.gaccessor'_hkdfLabel_label", "LowParse.Low.Base.accessor_compose", "Parsers.HKDF.HkdfLabel.accessor_hkdfLabel_hkdfLabel'", "Parsers.HKDF.HkdfLabel.accessor'_hkdfLabel_label", "Parsers.HKDF.HkdfLabel.clens_hkdfLabel_label" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor_hkdfLabel_label : LL.accessor gaccessor_hkdfLabel_label\nlet accessor_hkdfLabel_label =", "completed_definiton": "LL.accessor_ext (LL.accessor_compose accessor_hkdfLabel_hkdfLabel' accessor'_hkdfLabel_label ())\n clens_hkdfLabel_label\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.hkdfLabel_parser", "original_source_type": "val hkdfLabel_parser: LP.parser hkdfLabel_parser_kind hkdfLabel", "source_type": "val hkdfLabel_parser: LP.parser hkdfLabel_parser_kind hkdfLabel", "source_definition": "let hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 58, "start_col": 2, "end_line": 60, "end_col": 52 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.HKDF.HkdfLabel.hkdfLabel_parser_kind\n Parsers.HKDF.HkdfLabel.hkdfLabel", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.hkdfLabel", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser_kind", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_parser: LP.parser hkdfLabel_parser_kind hkdfLabel\nlet hkdfLabel_parser =", "completed_definiton": "synth_hkdfLabel_injective ();\nassert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\nhkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.accessor_hkdfLabel_context", "original_source_type": "val accessor_hkdfLabel_context : LL.accessor gaccessor_hkdfLabel_context", "source_type": "val accessor_hkdfLabel_context : LL.accessor gaccessor_hkdfLabel_context", "source_definition": "let accessor_hkdfLabel_context = LL.accessor_ext (LL.accessor_compose accessor_hkdfLabel_hkdfLabel' accessor'_hkdfLabel_context ()) clens_hkdfLabel_context ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 151, "start_col": 33, "end_line": 151, "end_col": 158 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)\n\nlet hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()\n\ninline_for_extraction let hkdfLabel'_serializer32 : LS.serializer32 hkdfLabel'_serializer = ((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32) `LS.serialize32_nondep_then` hkdfLabel_context_serializer32)\n\nlet hkdfLabel_serializer32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.serialize32_synth _ synth_hkdfLabel _ hkdfLabel'_serializer32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_size32 : LSZ.size32 hkdfLabel'_serializer = ((LSZ.size32_u16 `LSZ.size32_nondep_then` hkdfLabel_label_size32) `LSZ.size32_nondep_then` hkdfLabel_context_size32)\n\nlet hkdfLabel_size32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LSZ.size32_synth _ synth_hkdfLabel _ hkdfLabel'_size32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_validator : LL.validator hkdfLabel'_parser = (((LL.validate_u16 ()) `LL.validate_nondep_then` hkdfLabel_label_validator) `LL.validate_nondep_then` hkdfLabel_context_validator)\n\nlet hkdfLabel_validator =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.validate_synth hkdfLabel'_validator synth_hkdfLabel ()\n\ninline_for_extraction let hkdfLabel'_jumper : LL.jumper hkdfLabel'_parser = ((LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper) `LL.jump_nondep_then` hkdfLabel_context_jumper)\n\nlet hkdfLabel_jumper =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.jump_synth hkdfLabel'_jumper synth_hkdfLabel ()\n\nlet hkdfLabel_bytesize_eqn x =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth_eq _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip () x;\nLP.length_serialize_nondep_then LPI.serialize_u16 hkdfLabel_label_serializer x.length x.label;\nLP.length_serialize_nondep_then (LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) hkdfLabel_context_serializer (x.length, x.label) x.context;\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u16 (x.length)) == 2));\n (hkdfLabel_label_bytesize_eq (x.label));\n (hkdfLabel_context_bytesize_eq (x.context));\n assert(hkdfLabel_bytesize x == Seq.length (LP.serialize LPI.serialize_u16 x.length) + Seq.length (LP.serialize hkdfLabel_label_serializer x.label) + Seq.length (LP.serialize hkdfLabel_context_serializer x.context))\n\nlet gaccessor'_hkdfLabel_length : LL.gaccessor hkdfLabel'_parser LPI.parse_u16 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_label : LL.gaccessor hkdfLabel'_parser hkdfLabel_label_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_context : LL.gaccessor hkdfLabel'_parser hkdfLabel_context_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id hkdfLabel'_parser))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_length : LL.accessor gaccessor'_hkdfLabel_length = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_label : LL.accessor gaccessor'_hkdfLabel_label = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)) LL.jump_u16)\n\ninline_for_extraction noextract let accessor'_hkdfLabel_context : LL.accessor gaccessor'_hkdfLabel_context = (LL.accessor_then_snd (LL.accessor_id hkdfLabel'_parser) (LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper))\n\nnoextract let clens_hkdfLabel_hkdfLabel' : LL.clens hkdfLabel hkdfLabel' = synth_hkdfLabel_recip_inverse (); synth_hkdfLabel_recip_injective (); LL.clens_synth synth_hkdfLabel_recip synth_hkdfLabel\n\nlet gaccessor_hkdfLabel_hkdfLabel' : LL.gaccessor hkdfLabel_parser hkdfLabel'_parser clens_hkdfLabel_hkdfLabel' = synth_hkdfLabel_inverse (); synth_hkdfLabel_injective (); synth_hkdfLabel_recip_inverse (); LL.gaccessor_synth hkdfLabel'_parser synth_hkdfLabel synth_hkdfLabel_recip ()\n\ninline_for_extraction noextract let accessor_hkdfLabel_hkdfLabel' : LL.accessor gaccessor_hkdfLabel_hkdfLabel' = synth_hkdfLabel_inverse (); synth_hkdfLabel_injective (); synth_hkdfLabel_recip_inverse (); LL.accessor_synth hkdfLabel'_parser synth_hkdfLabel synth_hkdfLabel_recip ()\n\nlet gaccessor_hkdfLabel_length = LL.gaccessor_ext (gaccessor_hkdfLabel_hkdfLabel' `LL.gaccessor_compose` gaccessor'_hkdfLabel_length) clens_hkdfLabel_length ()\n\nlet accessor_hkdfLabel_length = LL.accessor_ext (LL.accessor_compose accessor_hkdfLabel_hkdfLabel' accessor'_hkdfLabel_length ()) clens_hkdfLabel_length ()\n\nlet gaccessor_hkdfLabel_label = LL.gaccessor_ext (gaccessor_hkdfLabel_hkdfLabel' `LL.gaccessor_compose` gaccessor'_hkdfLabel_label) clens_hkdfLabel_label ()\n\nlet accessor_hkdfLabel_label = LL.accessor_ext (LL.accessor_compose accessor_hkdfLabel_hkdfLabel' accessor'_hkdfLabel_label ()) clens_hkdfLabel_label ()\n\nlet gaccessor_hkdfLabel_context = LL.gaccessor_ext (gaccessor_hkdfLabel_hkdfLabel' `LL.gaccessor_compose` gaccessor'_hkdfLabel_context) clens_hkdfLabel_context ()", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.HKDF.HkdfLabel.gaccessor_hkdfLabel_context", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.accessor_ext", "Parsers.HKDF.HkdfLabel.hkdfLabel_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel", "Parsers.HKDF.HkdfLabel.hkdfLabel_parser", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.clens_hkdfLabel_hkdfLabel'", "FStar.Pervasives.Native.tuple2", "FStar.UInt16.t", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "Parsers.HKDF.HkdfLabel.gaccessor_hkdfLabel_hkdfLabel'", "Parsers.HKDF.HkdfLabel.gaccessor'_hkdfLabel_context", "LowParse.Low.Base.accessor_compose", "Parsers.HKDF.HkdfLabel.accessor_hkdfLabel_hkdfLabel'", "Parsers.HKDF.HkdfLabel.accessor'_hkdfLabel_context", "Parsers.HKDF.HkdfLabel.clens_hkdfLabel_context" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor_hkdfLabel_context : LL.accessor gaccessor_hkdfLabel_context\nlet accessor_hkdfLabel_context =", "completed_definiton": "LL.accessor_ext (LL.accessor_compose accessor_hkdfLabel_hkdfLabel' accessor'_hkdfLabel_context ())\n clens_hkdfLabel_context\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.hkdfLabel_bytesize_eqn", "original_source_type": "val hkdfLabel_bytesize_eqn (x: hkdfLabel) : Lemma (hkdfLabel_bytesize x == 2 + (hkdfLabel_label_bytesize (x.label)) + (hkdfLabel_context_bytesize (x.context))) [SMTPat (hkdfLabel_bytesize x)]", "source_type": "val hkdfLabel_bytesize_eqn (x: hkdfLabel) : Lemma (hkdfLabel_bytesize x == 2 + (hkdfLabel_label_bytesize (x.label)) + (hkdfLabel_context_bytesize (x.context))) [SMTPat (hkdfLabel_bytesize x)]", "source_definition": "let hkdfLabel_bytesize_eqn x =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth_eq _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip () x;\nLP.length_serialize_nondep_then LPI.serialize_u16 hkdfLabel_label_serializer x.length x.label;\nLP.length_serialize_nondep_then (LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) hkdfLabel_context_serializer (x.length, x.label) x.context;\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u16 (x.length)) == 2));\n (hkdfLabel_label_bytesize_eq (x.label));\n (hkdfLabel_context_bytesize_eq (x.context));\n assert(hkdfLabel_bytesize x == Seq.length (LP.serialize LPI.serialize_u16 x.length) + Seq.length (LP.serialize hkdfLabel_label_serializer x.label) + Seq.length (LP.serialize hkdfLabel_context_serializer x.context))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 112, "start_col": 2, "end_line": 121, "end_col": 216 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)\n\nlet hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()\n\ninline_for_extraction let hkdfLabel'_serializer32 : LS.serializer32 hkdfLabel'_serializer = ((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32) `LS.serialize32_nondep_then` hkdfLabel_context_serializer32)\n\nlet hkdfLabel_serializer32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.serialize32_synth _ synth_hkdfLabel _ hkdfLabel'_serializer32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_size32 : LSZ.size32 hkdfLabel'_serializer = ((LSZ.size32_u16 `LSZ.size32_nondep_then` hkdfLabel_label_size32) `LSZ.size32_nondep_then` hkdfLabel_context_size32)\n\nlet hkdfLabel_size32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LSZ.size32_synth _ synth_hkdfLabel _ hkdfLabel'_size32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_validator : LL.validator hkdfLabel'_parser = (((LL.validate_u16 ()) `LL.validate_nondep_then` hkdfLabel_label_validator) `LL.validate_nondep_then` hkdfLabel_context_validator)\n\nlet hkdfLabel_validator =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.validate_synth hkdfLabel'_validator synth_hkdfLabel ()\n\ninline_for_extraction let hkdfLabel'_jumper : LL.jumper hkdfLabel'_parser = ((LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper) `LL.jump_nondep_then` hkdfLabel_context_jumper)\n\nlet hkdfLabel_jumper =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.jump_synth hkdfLabel'_jumper synth_hkdfLabel ()", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.HKDF.HkdfLabel.hkdfLabel\n -> FStar.Pervasives.Lemma\n (ensures\n Parsers.HKDF.HkdfLabel.hkdfLabel_bytesize x ==\n 2 + Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_bytesize (MkhkdfLabel?.label x) +\n Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_bytesize (MkhkdfLabel?.context x))\n [SMTPat (Parsers.HKDF.HkdfLabel.hkdfLabel_bytesize x)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.HKDF.HkdfLabel.hkdfLabel", "Prims._assert", "Prims.eq2", "Prims.int", "Parsers.HKDF.HkdfLabel.hkdfLabel_bytesize", "Prims.op_Addition", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "LowParse.Spec.Int.parse_u16_kind", "FStar.UInt16.t", "LowParse.Spec.Int.parse_u16", "LowParse.Spec.Int.serialize_u16", "Parsers.HKDF.HkdfLabel.__proj__MkhkdfLabel__item__length", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_serializer", "Parsers.HKDF.HkdfLabel.__proj__MkhkdfLabel__item__label", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_serializer", "Parsers.HKDF.HkdfLabel.__proj__MkhkdfLabel__item__context", "Prims.unit", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_bytesize_eq", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_bytesize_eq", "LowParse.Spec.Combinators.length_serialize_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Combinators.serialize_nondep_then", "FStar.Pervasives.Native.Mktuple2", "LowParse.Spec.Combinators.serialize_synth_eq", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel", "Parsers.HKDF.HkdfLabel.hkdfLabel'_serializer", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_recip", "FStar.Pervasives.assert_norm", "LowParse.Spec.Base.parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser_kind", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_inverse", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_bytesize_eqn (x: hkdfLabel) : Lemma (hkdfLabel_bytesize x == 2 + (hkdfLabel_label_bytesize (x.label)) + (hkdfLabel_context_bytesize (x.context))) [SMTPat (hkdfLabel_bytesize x)]\nlet hkdfLabel_bytesize_eqn x =", "completed_definiton": "[@@ inline_let ]let _ = synth_hkdfLabel_injective () in\n[@@ inline_let ]let _ = synth_hkdfLabel_inverse () in\n[@@ inline_let ]let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\nLP.serialize_synth_eq _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip () x;\nLP.length_serialize_nondep_then LPI.serialize_u16 hkdfLabel_label_serializer x.length x.label;\nLP.length_serialize_nondep_then (LPI.serialize_u16\n `LP.serialize_nondep_then`\n hkdfLabel_label_serializer)\n hkdfLabel_context_serializer\n (x.length, x.label)\n x.context;\n(assert (FStar.Seq.length (LP.serialize LP.serialize_u16 (x.length)) == 2));\n(hkdfLabel_label_bytesize_eq (x.label));\n(hkdfLabel_context_bytesize_eq (x.context));\nassert (hkdfLabel_bytesize x ==\n Seq.length (LP.serialize LPI.serialize_u16 x.length) +\n Seq.length (LP.serialize hkdfLabel_label_serializer x.label) +\n Seq.length (LP.serialize hkdfLabel_context_serializer x.context))", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.accessor_hkdfLabel_hkdfLabel'", "original_source_type": "val accessor_hkdfLabel_hkdfLabel':LL.accessor gaccessor_hkdfLabel_hkdfLabel'", "source_type": "val accessor_hkdfLabel_hkdfLabel':LL.accessor gaccessor_hkdfLabel_hkdfLabel'", "source_definition": "let accessor_hkdfLabel_hkdfLabel' : LL.accessor gaccessor_hkdfLabel_hkdfLabel' = synth_hkdfLabel_inverse (); synth_hkdfLabel_injective (); synth_hkdfLabel_recip_inverse (); LL.accessor_synth hkdfLabel'_parser synth_hkdfLabel synth_hkdfLabel_recip ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 139, "start_col": 113, "end_line": 139, "end_col": 281 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)\n\nlet hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()\n\ninline_for_extraction let hkdfLabel'_serializer32 : LS.serializer32 hkdfLabel'_serializer = ((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32) `LS.serialize32_nondep_then` hkdfLabel_context_serializer32)\n\nlet hkdfLabel_serializer32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.serialize32_synth _ synth_hkdfLabel _ hkdfLabel'_serializer32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_size32 : LSZ.size32 hkdfLabel'_serializer = ((LSZ.size32_u16 `LSZ.size32_nondep_then` hkdfLabel_label_size32) `LSZ.size32_nondep_then` hkdfLabel_context_size32)\n\nlet hkdfLabel_size32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LSZ.size32_synth _ synth_hkdfLabel _ hkdfLabel'_size32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_validator : LL.validator hkdfLabel'_parser = (((LL.validate_u16 ()) `LL.validate_nondep_then` hkdfLabel_label_validator) `LL.validate_nondep_then` hkdfLabel_context_validator)\n\nlet hkdfLabel_validator =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.validate_synth hkdfLabel'_validator synth_hkdfLabel ()\n\ninline_for_extraction let hkdfLabel'_jumper : LL.jumper hkdfLabel'_parser = ((LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper) `LL.jump_nondep_then` hkdfLabel_context_jumper)\n\nlet hkdfLabel_jumper =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.jump_synth hkdfLabel'_jumper synth_hkdfLabel ()\n\nlet hkdfLabel_bytesize_eqn x =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth_eq _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip () x;\nLP.length_serialize_nondep_then LPI.serialize_u16 hkdfLabel_label_serializer x.length x.label;\nLP.length_serialize_nondep_then (LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) hkdfLabel_context_serializer (x.length, x.label) x.context;\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u16 (x.length)) == 2));\n (hkdfLabel_label_bytesize_eq (x.label));\n (hkdfLabel_context_bytesize_eq (x.context));\n assert(hkdfLabel_bytesize x == Seq.length (LP.serialize LPI.serialize_u16 x.length) + Seq.length (LP.serialize hkdfLabel_label_serializer x.label) + Seq.length (LP.serialize hkdfLabel_context_serializer x.context))\n\nlet gaccessor'_hkdfLabel_length : LL.gaccessor hkdfLabel'_parser LPI.parse_u16 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_label : LL.gaccessor hkdfLabel'_parser hkdfLabel_label_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_context : LL.gaccessor hkdfLabel'_parser hkdfLabel_context_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id hkdfLabel'_parser))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_length : LL.accessor gaccessor'_hkdfLabel_length = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_label : LL.accessor gaccessor'_hkdfLabel_label = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)) LL.jump_u16)\n\ninline_for_extraction noextract let accessor'_hkdfLabel_context : LL.accessor gaccessor'_hkdfLabel_context = (LL.accessor_then_snd (LL.accessor_id hkdfLabel'_parser) (LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper))\n\nnoextract let clens_hkdfLabel_hkdfLabel' : LL.clens hkdfLabel hkdfLabel' = synth_hkdfLabel_recip_inverse (); synth_hkdfLabel_recip_injective (); LL.clens_synth synth_hkdfLabel_recip synth_hkdfLabel\n\nlet gaccessor_hkdfLabel_hkdfLabel' : LL.gaccessor hkdfLabel_parser hkdfLabel'_parser clens_hkdfLabel_hkdfLabel' = synth_hkdfLabel_inverse (); synth_hkdfLabel_injective (); synth_hkdfLabel_recip_inverse (); LL.gaccessor_synth hkdfLabel'_parser synth_hkdfLabel synth_hkdfLabel_recip ()", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.HKDF.HkdfLabel.gaccessor_hkdfLabel_hkdfLabel'", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.accessor_synth", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.hkdfLabel", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_recip", "Prims.unit", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_recip_inverse", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_injective", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_inverse" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor_hkdfLabel_hkdfLabel':LL.accessor gaccessor_hkdfLabel_hkdfLabel'\nlet accessor_hkdfLabel_hkdfLabel':LL.accessor gaccessor_hkdfLabel_hkdfLabel' =", "completed_definiton": "synth_hkdfLabel_inverse ();\nsynth_hkdfLabel_injective ();\nsynth_hkdfLabel_recip_inverse ();\nLL.accessor_synth hkdfLabel'_parser synth_hkdfLabel synth_hkdfLabel_recip ()", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.gaccessor_hkdfLabel_length", "original_source_type": "val gaccessor_hkdfLabel_length : LL.gaccessor hkdfLabel_parser LPI.parse_u16 clens_hkdfLabel_length", "source_type": "val gaccessor_hkdfLabel_length : LL.gaccessor hkdfLabel_parser LPI.parse_u16 clens_hkdfLabel_length", "source_definition": "let gaccessor_hkdfLabel_length = LL.gaccessor_ext (gaccessor_hkdfLabel_hkdfLabel' `LL.gaccessor_compose` gaccessor'_hkdfLabel_length) clens_hkdfLabel_length ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 141, "start_col": 33, "end_line": 141, "end_col": 159 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)\n\nlet hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()\n\ninline_for_extraction let hkdfLabel'_serializer32 : LS.serializer32 hkdfLabel'_serializer = ((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32) `LS.serialize32_nondep_then` hkdfLabel_context_serializer32)\n\nlet hkdfLabel_serializer32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.serialize32_synth _ synth_hkdfLabel _ hkdfLabel'_serializer32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_size32 : LSZ.size32 hkdfLabel'_serializer = ((LSZ.size32_u16 `LSZ.size32_nondep_then` hkdfLabel_label_size32) `LSZ.size32_nondep_then` hkdfLabel_context_size32)\n\nlet hkdfLabel_size32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LSZ.size32_synth _ synth_hkdfLabel _ hkdfLabel'_size32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_validator : LL.validator hkdfLabel'_parser = (((LL.validate_u16 ()) `LL.validate_nondep_then` hkdfLabel_label_validator) `LL.validate_nondep_then` hkdfLabel_context_validator)\n\nlet hkdfLabel_validator =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.validate_synth hkdfLabel'_validator synth_hkdfLabel ()\n\ninline_for_extraction let hkdfLabel'_jumper : LL.jumper hkdfLabel'_parser = ((LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper) `LL.jump_nondep_then` hkdfLabel_context_jumper)\n\nlet hkdfLabel_jumper =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.jump_synth hkdfLabel'_jumper synth_hkdfLabel ()\n\nlet hkdfLabel_bytesize_eqn x =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth_eq _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip () x;\nLP.length_serialize_nondep_then LPI.serialize_u16 hkdfLabel_label_serializer x.length x.label;\nLP.length_serialize_nondep_then (LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) hkdfLabel_context_serializer (x.length, x.label) x.context;\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u16 (x.length)) == 2));\n (hkdfLabel_label_bytesize_eq (x.label));\n (hkdfLabel_context_bytesize_eq (x.context));\n assert(hkdfLabel_bytesize x == Seq.length (LP.serialize LPI.serialize_u16 x.length) + Seq.length (LP.serialize hkdfLabel_label_serializer x.label) + Seq.length (LP.serialize hkdfLabel_context_serializer x.context))\n\nlet gaccessor'_hkdfLabel_length : LL.gaccessor hkdfLabel'_parser LPI.parse_u16 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_label : LL.gaccessor hkdfLabel'_parser hkdfLabel_label_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_context : LL.gaccessor hkdfLabel'_parser hkdfLabel_context_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id hkdfLabel'_parser))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_length : LL.accessor gaccessor'_hkdfLabel_length = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_label : LL.accessor gaccessor'_hkdfLabel_label = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)) LL.jump_u16)\n\ninline_for_extraction noextract let accessor'_hkdfLabel_context : LL.accessor gaccessor'_hkdfLabel_context = (LL.accessor_then_snd (LL.accessor_id hkdfLabel'_parser) (LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper))\n\nnoextract let clens_hkdfLabel_hkdfLabel' : LL.clens hkdfLabel hkdfLabel' = synth_hkdfLabel_recip_inverse (); synth_hkdfLabel_recip_injective (); LL.clens_synth synth_hkdfLabel_recip synth_hkdfLabel\n\nlet gaccessor_hkdfLabel_hkdfLabel' : LL.gaccessor hkdfLabel_parser hkdfLabel'_parser clens_hkdfLabel_hkdfLabel' = synth_hkdfLabel_inverse (); synth_hkdfLabel_injective (); synth_hkdfLabel_recip_inverse (); LL.gaccessor_synth hkdfLabel'_parser synth_hkdfLabel synth_hkdfLabel_recip ()\n\ninline_for_extraction noextract let accessor_hkdfLabel_hkdfLabel' : LL.accessor gaccessor_hkdfLabel_hkdfLabel' = synth_hkdfLabel_inverse (); synth_hkdfLabel_injective (); synth_hkdfLabel_recip_inverse (); LL.accessor_synth hkdfLabel'_parser synth_hkdfLabel synth_hkdfLabel_recip ()", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.HKDF.HkdfLabel.hkdfLabel_parser\n LowParse.Spec.Int.parse_u16\n Parsers.HKDF.HkdfLabel.clens_hkdfLabel_length", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.gaccessor_ext", "Parsers.HKDF.HkdfLabel.hkdfLabel_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel", "Parsers.HKDF.HkdfLabel.hkdfLabel_parser", "LowParse.Spec.Int.parse_u16_kind", "FStar.UInt16.t", "LowParse.Spec.Int.parse_u16", "LowParse.Low.Base.Spec.clens_compose", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.clens_hkdfLabel_hkdfLabel'", "FStar.Pervasives.Native.tuple2", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "Parsers.HKDF.HkdfLabel.gaccessor_hkdfLabel_hkdfLabel'", "Parsers.HKDF.HkdfLabel.gaccessor'_hkdfLabel_length", "Parsers.HKDF.HkdfLabel.clens_hkdfLabel_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val gaccessor_hkdfLabel_length : LL.gaccessor hkdfLabel_parser LPI.parse_u16 clens_hkdfLabel_length\nlet gaccessor_hkdfLabel_length =", "completed_definiton": "LL.gaccessor_ext (gaccessor_hkdfLabel_hkdfLabel' `LL.gaccessor_compose` gaccessor'_hkdfLabel_length)\n clens_hkdfLabel_length\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.gaccessor_hkdfLabel_hkdfLabel'", "original_source_type": "val gaccessor_hkdfLabel_hkdfLabel':LL.gaccessor hkdfLabel_parser\n hkdfLabel'_parser\n clens_hkdfLabel_hkdfLabel'", "source_type": "val gaccessor_hkdfLabel_hkdfLabel':LL.gaccessor hkdfLabel_parser\n hkdfLabel'_parser\n clens_hkdfLabel_hkdfLabel'", "source_definition": "let gaccessor_hkdfLabel_hkdfLabel' : LL.gaccessor hkdfLabel_parser hkdfLabel'_parser clens_hkdfLabel_hkdfLabel' = synth_hkdfLabel_inverse (); synth_hkdfLabel_injective (); synth_hkdfLabel_recip_inverse (); LL.gaccessor_synth hkdfLabel'_parser synth_hkdfLabel synth_hkdfLabel_recip ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 137, "start_col": 114, "end_line": 137, "end_col": 283 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)\n\nlet hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()\n\ninline_for_extraction let hkdfLabel'_serializer32 : LS.serializer32 hkdfLabel'_serializer = ((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32) `LS.serialize32_nondep_then` hkdfLabel_context_serializer32)\n\nlet hkdfLabel_serializer32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.serialize32_synth _ synth_hkdfLabel _ hkdfLabel'_serializer32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_size32 : LSZ.size32 hkdfLabel'_serializer = ((LSZ.size32_u16 `LSZ.size32_nondep_then` hkdfLabel_label_size32) `LSZ.size32_nondep_then` hkdfLabel_context_size32)\n\nlet hkdfLabel_size32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LSZ.size32_synth _ synth_hkdfLabel _ hkdfLabel'_size32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_validator : LL.validator hkdfLabel'_parser = (((LL.validate_u16 ()) `LL.validate_nondep_then` hkdfLabel_label_validator) `LL.validate_nondep_then` hkdfLabel_context_validator)\n\nlet hkdfLabel_validator =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.validate_synth hkdfLabel'_validator synth_hkdfLabel ()\n\ninline_for_extraction let hkdfLabel'_jumper : LL.jumper hkdfLabel'_parser = ((LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper) `LL.jump_nondep_then` hkdfLabel_context_jumper)\n\nlet hkdfLabel_jumper =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.jump_synth hkdfLabel'_jumper synth_hkdfLabel ()\n\nlet hkdfLabel_bytesize_eqn x =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth_eq _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip () x;\nLP.length_serialize_nondep_then LPI.serialize_u16 hkdfLabel_label_serializer x.length x.label;\nLP.length_serialize_nondep_then (LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) hkdfLabel_context_serializer (x.length, x.label) x.context;\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u16 (x.length)) == 2));\n (hkdfLabel_label_bytesize_eq (x.label));\n (hkdfLabel_context_bytesize_eq (x.context));\n assert(hkdfLabel_bytesize x == Seq.length (LP.serialize LPI.serialize_u16 x.length) + Seq.length (LP.serialize hkdfLabel_label_serializer x.label) + Seq.length (LP.serialize hkdfLabel_context_serializer x.context))\n\nlet gaccessor'_hkdfLabel_length : LL.gaccessor hkdfLabel'_parser LPI.parse_u16 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_label : LL.gaccessor hkdfLabel'_parser hkdfLabel_label_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_context : LL.gaccessor hkdfLabel'_parser hkdfLabel_context_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id hkdfLabel'_parser))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_length : LL.accessor gaccessor'_hkdfLabel_length = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_label : LL.accessor gaccessor'_hkdfLabel_label = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)) LL.jump_u16)\n\ninline_for_extraction noextract let accessor'_hkdfLabel_context : LL.accessor gaccessor'_hkdfLabel_context = (LL.accessor_then_snd (LL.accessor_id hkdfLabel'_parser) (LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper))\n\nnoextract let clens_hkdfLabel_hkdfLabel' : LL.clens hkdfLabel hkdfLabel' = synth_hkdfLabel_recip_inverse (); synth_hkdfLabel_recip_injective (); LL.clens_synth synth_hkdfLabel_recip synth_hkdfLabel", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.HKDF.HkdfLabel.hkdfLabel_parser\n Parsers.HKDF.HkdfLabel.hkdfLabel'_parser\n Parsers.HKDF.HkdfLabel.clens_hkdfLabel_hkdfLabel'", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.gaccessor_synth", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "Parsers.HKDF.HkdfLabel.hkdfLabel", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_recip", "Prims.unit", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_recip_inverse", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_injective", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_inverse" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val gaccessor_hkdfLabel_hkdfLabel':LL.gaccessor hkdfLabel_parser\n hkdfLabel'_parser\n clens_hkdfLabel_hkdfLabel'\nlet gaccessor_hkdfLabel_hkdfLabel':LL.gaccessor hkdfLabel_parser\n hkdfLabel'_parser\n clens_hkdfLabel_hkdfLabel' =", "completed_definiton": "synth_hkdfLabel_inverse ();\nsynth_hkdfLabel_injective ();\nsynth_hkdfLabel_recip_inverse ();\nLL.gaccessor_synth hkdfLabel'_parser synth_hkdfLabel synth_hkdfLabel_recip ()", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fst", "name": "Parsers.HKDF.HkdfLabel.hkdfLabel_valid", "original_source_type": "val hkdfLabel_valid (h:HS.mem) (#rrel: _) (#rel: _) (input:LL.slice rrel rel) (pos0:U32.t) : Lemma\n (requires (\n LL.valid LPI.parse_u16 h input pos0 /\\ (\n let pos1 = LL.get_valid_pos LPI.parse_u16 h input pos0 in\n LL.valid hkdfLabel_label_parser h input pos1 /\\ (\n let pos2 = LL.get_valid_pos hkdfLabel_label_parser h input pos1 in\n LL.valid hkdfLabel_context_parser h input pos2 /\\ (\n let pos3 = LL.get_valid_pos hkdfLabel_context_parser h input pos2 in\n True\n )))))\n (ensures (\n let length = LL.contents LPI.parse_u16 h input pos0 in\n let pos1 = LL.get_valid_pos LPI.parse_u16 h input pos0 in\n let label = LL.contents hkdfLabel_label_parser h input pos1 in\n let pos2 = LL.get_valid_pos hkdfLabel_label_parser h input pos1 in\n let context = LL.contents hkdfLabel_context_parser h input pos2 in\n let pos3 = LL.get_valid_pos hkdfLabel_context_parser h input pos2 in\n LL.valid_content_pos hkdfLabel_parser h input pos0 ({\n length = length;\n label = label;\n context = context;\n }) pos3))", "source_type": "val hkdfLabel_valid (h:HS.mem) (#rrel: _) (#rel: _) (input:LL.slice rrel rel) (pos0:U32.t) : Lemma\n (requires (\n LL.valid LPI.parse_u16 h input pos0 /\\ (\n let pos1 = LL.get_valid_pos LPI.parse_u16 h input pos0 in\n LL.valid hkdfLabel_label_parser h input pos1 /\\ (\n let pos2 = LL.get_valid_pos hkdfLabel_label_parser h input pos1 in\n LL.valid hkdfLabel_context_parser h input pos2 /\\ (\n let pos3 = LL.get_valid_pos hkdfLabel_context_parser h input pos2 in\n True\n )))))\n (ensures (\n let length = LL.contents LPI.parse_u16 h input pos0 in\n let pos1 = LL.get_valid_pos LPI.parse_u16 h input pos0 in\n let label = LL.contents hkdfLabel_label_parser h input pos1 in\n let pos2 = LL.get_valid_pos hkdfLabel_label_parser h input pos1 in\n let context = LL.contents hkdfLabel_context_parser h input pos2 in\n let pos3 = LL.get_valid_pos hkdfLabel_context_parser h input pos2 in\n LL.valid_content_pos hkdfLabel_parser h input pos0 ({\n length = length;\n label = label;\n context = context;\n }) pos3))", "source_definition": "let hkdfLabel_valid h #_ #_ input pos0 =\n let length = LL.contents LPI.parse_u16 h input pos0 in\n let pos1 = LL.get_valid_pos LPI.parse_u16 h input pos0 in\n let label = LL.contents hkdfLabel_label_parser h input pos1 in\n let pos2 = LL.get_valid_pos hkdfLabel_label_parser h input pos1 in\n let context = LL.contents hkdfLabel_context_parser h input pos2 in\n let pos3 = LL.get_valid_pos hkdfLabel_context_parser h input pos2 in\n LL.valid_nondep_then_intro h LPI.parse_u16 hkdfLabel_label_parser input pos0;\n LL.valid_nondep_then_intro h (LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) hkdfLabel_context_parser input pos0;\n assert_norm (hkdfLabel' == LP.get_parser_type hkdfLabel'_parser);\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n synth_hkdfLabel_injective ();\n LL.valid_synth_intro h hkdfLabel'_parser synth_hkdfLabel input pos0", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 153, "start_col": 40, "end_line": 165, "end_col": 69 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field label*)\nopen Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\nopen Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel' = ((U16.t & hkdfLabel_label) & hkdfLabel_context)\n\ninline_for_extraction let synth_hkdfLabel (x: hkdfLabel') : hkdfLabel =\n match x with ((length,label),context) -> {\n length = length;\n label = label;\n context = context;\n }\n\ninline_for_extraction let synth_hkdfLabel_recip (x: hkdfLabel) : hkdfLabel' = ((x.length,x.label),x.context)\n\nlet synth_hkdfLabel_recip_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel_recip synth_hkdfLabel) = ()\n\nlet synth_hkdfLabel_injective () : Lemma (LP.synth_injective synth_hkdfLabel) =\n LP.synth_inverse_synth_injective synth_hkdfLabel_recip synth_hkdfLabel;\n synth_hkdfLabel_recip_inverse ()\n\nlet synth_hkdfLabel_inverse () : Lemma (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip) =\n assert_norm (LP.synth_inverse synth_hkdfLabel synth_hkdfLabel_recip)\n\nlet synth_hkdfLabel_recip_injective () : Lemma (LP.synth_injective synth_hkdfLabel_recip) =\n synth_hkdfLabel_recip_inverse ();\n LP.synth_inverse_synth_injective synth_hkdfLabel synth_hkdfLabel_recip\n\nnoextract let hkdfLabel'_parser : LP.parser _ hkdfLabel' = ((LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser) `LP.nondep_then` hkdfLabel_context_parser)\n\nnoextract let hkdfLabel'_parser_kind = LP.get_parser_kind hkdfLabel'_parser\n\nlet hkdfLabel_parser =\n synth_hkdfLabel_injective ();\n assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\n hkdfLabel'_parser `LP.parse_synth` synth_hkdfLabel\n\nnoextract let hkdfLabel'_serializer : LP.serializer hkdfLabel'_parser = ((LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) `LP.serialize_nondep_then` hkdfLabel_context_serializer)\n\nlet hkdfLabel_serializer =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip ()\n\nlet hkdfLabel_bytesize (x:hkdfLabel) : GTot nat = Seq.length (hkdfLabel_serializer x)\n\nlet hkdfLabel_bytesize_eq x = ()\n\ninline_for_extraction let hkdfLabel'_parser32 : LS.parser32 hkdfLabel'_parser = ((LS.parse32_u16 `LS.parse32_nondep_then` hkdfLabel_label_parser32) `LS.parse32_nondep_then` hkdfLabel_context_parser32)\n\nlet hkdfLabel_parser32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.parse32_synth _ synth_hkdfLabel (fun x -> synth_hkdfLabel x) hkdfLabel'_parser32 ()\n\ninline_for_extraction let hkdfLabel'_serializer32 : LS.serializer32 hkdfLabel'_serializer = ((LS.serialize32_u16 `LS.serialize32_nondep_then` hkdfLabel_label_serializer32) `LS.serialize32_nondep_then` hkdfLabel_context_serializer32)\n\nlet hkdfLabel_serializer32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LS.serialize32_synth _ synth_hkdfLabel _ hkdfLabel'_serializer32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_size32 : LSZ.size32 hkdfLabel'_serializer = ((LSZ.size32_u16 `LSZ.size32_nondep_then` hkdfLabel_label_size32) `LSZ.size32_nondep_then` hkdfLabel_context_size32)\n\nlet hkdfLabel_size32 =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LSZ.size32_synth _ synth_hkdfLabel _ hkdfLabel'_size32 synth_hkdfLabel_recip (fun x -> synth_hkdfLabel_recip x) ()\n\ninline_for_extraction let hkdfLabel'_validator : LL.validator hkdfLabel'_parser = (((LL.validate_u16 ()) `LL.validate_nondep_then` hkdfLabel_label_validator) `LL.validate_nondep_then` hkdfLabel_context_validator)\n\nlet hkdfLabel_validator =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.validate_synth hkdfLabel'_validator synth_hkdfLabel ()\n\ninline_for_extraction let hkdfLabel'_jumper : LL.jumper hkdfLabel'_parser = ((LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper) `LL.jump_nondep_then` hkdfLabel_context_jumper)\n\nlet hkdfLabel_jumper =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LL.jump_synth hkdfLabel'_jumper synth_hkdfLabel ()\n\nlet hkdfLabel_bytesize_eqn x =\n [@inline_let] let _ = synth_hkdfLabel_injective () in\n [@inline_let] let _ = synth_hkdfLabel_inverse () in\n [@inline_let] let _ = assert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind) in\n LP.serialize_synth_eq _ synth_hkdfLabel hkdfLabel'_serializer synth_hkdfLabel_recip () x;\nLP.length_serialize_nondep_then LPI.serialize_u16 hkdfLabel_label_serializer x.length x.label;\nLP.length_serialize_nondep_then (LPI.serialize_u16 `LP.serialize_nondep_then` hkdfLabel_label_serializer) hkdfLabel_context_serializer (x.length, x.label) x.context;\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u16 (x.length)) == 2));\n (hkdfLabel_label_bytesize_eq (x.label));\n (hkdfLabel_context_bytesize_eq (x.context));\n assert(hkdfLabel_bytesize x == Seq.length (LP.serialize LPI.serialize_u16 x.length) + Seq.length (LP.serialize hkdfLabel_label_serializer x.label) + Seq.length (LP.serialize hkdfLabel_context_serializer x.context))\n\nlet gaccessor'_hkdfLabel_length : LL.gaccessor hkdfLabel'_parser LPI.parse_u16 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_label : LL.gaccessor hkdfLabel'_parser hkdfLabel_label_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id hkdfLabel'_parser)))\n\nlet gaccessor'_hkdfLabel_context : LL.gaccessor hkdfLabel'_parser hkdfLabel_context_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_id hkdfLabel'_parser))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_length : LL.accessor gaccessor'_hkdfLabel_length = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)))\n\ninline_for_extraction noextract let accessor'_hkdfLabel_label : LL.accessor gaccessor'_hkdfLabel_label = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id hkdfLabel'_parser)) LL.jump_u16)\n\ninline_for_extraction noextract let accessor'_hkdfLabel_context : LL.accessor gaccessor'_hkdfLabel_context = (LL.accessor_then_snd (LL.accessor_id hkdfLabel'_parser) (LL.jump_u16 `LL.jump_nondep_then` hkdfLabel_label_jumper))\n\nnoextract let clens_hkdfLabel_hkdfLabel' : LL.clens hkdfLabel hkdfLabel' = synth_hkdfLabel_recip_inverse (); synth_hkdfLabel_recip_injective (); LL.clens_synth synth_hkdfLabel_recip synth_hkdfLabel\n\nlet gaccessor_hkdfLabel_hkdfLabel' : LL.gaccessor hkdfLabel_parser hkdfLabel'_parser clens_hkdfLabel_hkdfLabel' = synth_hkdfLabel_inverse (); synth_hkdfLabel_injective (); synth_hkdfLabel_recip_inverse (); LL.gaccessor_synth hkdfLabel'_parser synth_hkdfLabel synth_hkdfLabel_recip ()\n\ninline_for_extraction noextract let accessor_hkdfLabel_hkdfLabel' : LL.accessor gaccessor_hkdfLabel_hkdfLabel' = synth_hkdfLabel_inverse (); synth_hkdfLabel_injective (); synth_hkdfLabel_recip_inverse (); LL.accessor_synth hkdfLabel'_parser synth_hkdfLabel synth_hkdfLabel_recip ()\n\nlet gaccessor_hkdfLabel_length = LL.gaccessor_ext (gaccessor_hkdfLabel_hkdfLabel' `LL.gaccessor_compose` gaccessor'_hkdfLabel_length) clens_hkdfLabel_length ()\n\nlet accessor_hkdfLabel_length = LL.accessor_ext (LL.accessor_compose accessor_hkdfLabel_hkdfLabel' accessor'_hkdfLabel_length ()) clens_hkdfLabel_length ()\n\nlet gaccessor_hkdfLabel_label = LL.gaccessor_ext (gaccessor_hkdfLabel_hkdfLabel' `LL.gaccessor_compose` gaccessor'_hkdfLabel_label) clens_hkdfLabel_label ()\n\nlet accessor_hkdfLabel_label = LL.accessor_ext (LL.accessor_compose accessor_hkdfLabel_hkdfLabel' accessor'_hkdfLabel_label ()) clens_hkdfLabel_label ()\n\nlet gaccessor_hkdfLabel_context = LL.gaccessor_ext (gaccessor_hkdfLabel_hkdfLabel' `LL.gaccessor_compose` gaccessor'_hkdfLabel_context) clens_hkdfLabel_context ()\n\nlet accessor_hkdfLabel_context = LL.accessor_ext (LL.accessor_compose accessor_hkdfLabel_hkdfLabel' accessor'_hkdfLabel_context ()) clens_hkdfLabel_context ()", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fst", "checked_file": "Parsers.HKDF.HkdfLabel.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: FStar.Monotonic.HyperStack.mem -> input: LowParse.Slice.slice rrel rel -> pos0: FStar.UInt32.t\n -> FStar.Pervasives.Lemma\n (requires\n LowParse.Low.Base.Spec.valid LowParse.Spec.Int.parse_u16 h input pos0 /\\\n (let pos1 = LowParse.Low.Base.Spec.get_valid_pos LowParse.Spec.Int.parse_u16 h input pos0 in\n LowParse.Low.Base.Spec.valid Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser\n h\n input\n pos1 /\\\n (let pos2 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser\n h\n input\n pos1\n in\n LowParse.Low.Base.Spec.valid Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser\n h\n input\n pos2 /\\\n (let pos3 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser\n h\n input\n pos2\n in\n Prims.l_True))))\n (ensures\n (let length = LowParse.Low.Base.Spec.contents LowParse.Spec.Int.parse_u16 h input pos0 in\n let pos1 =\n LowParse.Low.Base.Spec.get_valid_pos LowParse.Spec.Int.parse_u16 h input pos0\n in\n let label =\n LowParse.Low.Base.Spec.contents Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser\n h\n input\n pos1\n in\n let pos2 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser\n h\n input\n pos1\n in\n let context =\n LowParse.Low.Base.Spec.contents Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser\n h\n input\n pos2\n in\n let pos3 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser\n h\n input\n pos2\n in\n LowParse.Low.Base.Spec.valid_content_pos Parsers.HKDF.HkdfLabel.hkdfLabel_parser\n h\n input\n pos0\n (Parsers.HKDF.HkdfLabel.MkhkdfLabel length label context)\n pos3))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Monotonic.HyperStack.mem", "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "LowParse.Low.Combinators.valid_synth_intro", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u16_kind", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'", "Parsers.HKDF.HkdfLabel.hkdfLabel", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel", "Prims.unit", "Parsers.HKDF.HkdfLabel.synth_hkdfLabel_injective", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel_parser_kind", "Parsers.HKDF.HkdfLabel.hkdfLabel'_parser_kind", "LowParse.Spec.Base.get_parser_type", "LowParse.Low.Combinators.valid_nondep_then_intro", "FStar.Pervasives.Native.tuple2", "FStar.UInt16.t", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Int.parse_u16", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context_parser", "LowParse.Low.Base.Spec.get_valid_pos", "LowParse.Low.Base.Spec.contents" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hkdfLabel_valid (h:HS.mem) (#rrel: _) (#rel: _) (input:LL.slice rrel rel) (pos0:U32.t) : Lemma\n (requires (\n LL.valid LPI.parse_u16 h input pos0 /\\ (\n let pos1 = LL.get_valid_pos LPI.parse_u16 h input pos0 in\n LL.valid hkdfLabel_label_parser h input pos1 /\\ (\n let pos2 = LL.get_valid_pos hkdfLabel_label_parser h input pos1 in\n LL.valid hkdfLabel_context_parser h input pos2 /\\ (\n let pos3 = LL.get_valid_pos hkdfLabel_context_parser h input pos2 in\n True\n )))))\n (ensures (\n let length = LL.contents LPI.parse_u16 h input pos0 in\n let pos1 = LL.get_valid_pos LPI.parse_u16 h input pos0 in\n let label = LL.contents hkdfLabel_label_parser h input pos1 in\n let pos2 = LL.get_valid_pos hkdfLabel_label_parser h input pos1 in\n let context = LL.contents hkdfLabel_context_parser h input pos2 in\n let pos3 = LL.get_valid_pos hkdfLabel_context_parser h input pos2 in\n LL.valid_content_pos hkdfLabel_parser h input pos0 ({\n length = length;\n label = label;\n context = context;\n }) pos3))\nlet hkdfLabel_valid h #_ #_ input pos0 =", "completed_definiton": "let length = LL.contents LPI.parse_u16 h input pos0 in\nlet pos1 = LL.get_valid_pos LPI.parse_u16 h input pos0 in\nlet label = LL.contents hkdfLabel_label_parser h input pos1 in\nlet pos2 = LL.get_valid_pos hkdfLabel_label_parser h input pos1 in\nlet context = LL.contents hkdfLabel_context_parser h input pos2 in\nlet pos3 = LL.get_valid_pos hkdfLabel_context_parser h input pos2 in\nLL.valid_nondep_then_intro h LPI.parse_u16 hkdfLabel_label_parser input pos0;\nLL.valid_nondep_then_intro h\n (LPI.parse_u16 `LP.nondep_then` hkdfLabel_label_parser)\n hkdfLabel_context_parser\n input\n pos0;\nassert_norm (hkdfLabel' == LP.get_parser_type hkdfLabel'_parser);\nassert_norm (hkdfLabel_parser_kind == hkdfLabel'_parser_kind);\nsynth_hkdfLabel_injective ();\nLL.valid_synth_intro h hkdfLabel'_parser synth_hkdfLabel input pos0", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.protocolVersion_repr_writer", "original_source_type": "", "source_type": "val protocolVersion_repr_writer : LowParse.Low.Base.leaf_writer_strong LowParse.Spec.Int.serialize_u16", "source_definition": "let protocolVersion_repr_writer = LL.write_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 54, "start_col": 66, "end_line": 54, "end_col": 78 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let protocolVersion_repr_reader = LL.read_u16", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong LowParse.Spec.Int.serialize_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.write_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let protocolVersion_repr_writer =", "completed_definiton": "LL.write_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.protocolVersion_repr_size32", "original_source_type": "", "source_type": "val protocolVersion_repr_size32 : LowParse.SLow.Base.size32 LowParse.Spec.Int.serialize_u16", "source_definition": "let protocolVersion_repr_size32 = LSZ.size32_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 46, "start_col": 66, "end_line": 46, "end_col": 80 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 LowParse.Spec.Int.serialize_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.size32_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let protocolVersion_repr_size32 =", "completed_definiton": "LSZ.size32_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.protocolVersion_repr_validator", "original_source_type": "", "source_type": "val protocolVersion_repr_validator : LowParse.Low.Base.validator LowParse.Spec.Int.parse_u16", "source_definition": "let protocolVersion_repr_validator = (LL.validate_u16 ())", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 48, "start_col": 69, "end_line": 48, "end_col": 89 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator LowParse.Spec.Int.parse_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.validate_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let protocolVersion_repr_validator =", "completed_definiton": "(LL.validate_u16 ())", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.protocolVersion_repr_serializer", "original_source_type": "", "source_type": "val protocolVersion_repr_serializer : LowParse.Spec.Base.serializer LowParse.Spec.Int.parse_u16", "source_definition": "let protocolVersion_repr_serializer = LPI.serialize_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 40, "start_col": 48, "end_line": 40, "end_col": 65 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer LowParse.Spec.Int.parse_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Int.serialize_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let protocolVersion_repr_serializer =", "completed_definiton": "LPI.serialize_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.protocolVersion_bytesize", "original_source_type": "val protocolVersion_bytesize (x:protocolVersion) : GTot nat", "source_type": "val protocolVersion_bytesize (x:protocolVersion) : GTot nat", "source_definition": "let protocolVersion_bytesize (x:protocolVersion) : GTot nat = Seq.length (protocolVersion_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 108, "start_col": 62, "end_line": 108, "end_col": 103 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let protocolVersion_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let protocolVersion_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_protocolVersion (x:LP.maybe_enum_key protocolVersion_enum) : protocolVersion = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n Unknown_protocolVersion v\n\ninline_for_extraction let synth_protocolVersion_inv (x:protocolVersion) : LP.maybe_enum_key protocolVersion_enum = \n match x with\n | Unknown_protocolVersion y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : protocolVersion = x in\n [@inline_let] let _ : squash(not (Unknown_protocolVersion? x1) ==> LP.list_mem x1 (LP.list_map fst protocolVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key protocolVersion_enum)\n\nlet lemma_synth_protocolVersion_inv' () : Lemma\n (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion)\n= LP.forall_maybe_enum_key protocolVersion_enum (fun x -> synth_protocolVersion_inv (synth_protocolVersion x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_protocolVersion_inj () : Lemma\n (LP.synth_injective synth_protocolVersion) = \n lemma_synth_protocolVersion_inv' ();\n LP.synth_inverse_synth_injective synth_protocolVersion synth_protocolVersion_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_protocolVersion_inv () : Lemma\n (LP.synth_inverse synth_protocolVersion synth_protocolVersion_inv) = allow_inversion protocolVersion; ()\n\n#pop-options\nnoextract let parse_maybe_protocolVersion_key : LP.parser _ (LP.maybe_enum_key protocolVersion_enum) =\n LP.parse_maybe_enum_key protocolVersion_repr_parser protocolVersion_enum\n\nnoextract let serialize_maybe_protocolVersion_key : LP.serializer parse_maybe_protocolVersion_key =\n LP.serialize_maybe_enum_key protocolVersion_repr_parser protocolVersion_repr_serializer protocolVersion_enum\n\nnoextract let protocolVersion_parser : LP.parser _ protocolVersion =\n lemma_synth_protocolVersion_inj ();\n parse_maybe_protocolVersion_key `LP.parse_synth` synth_protocolVersion\n\nnoextract let protocolVersion_serializer : LP.serializer protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LP.serialize_synth _ synth_protocolVersion serialize_maybe_protocolVersion_key synth_protocolVersion_inv ()", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.ProtocolVersion.protocolVersion -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.ProtocolVersion.protocolVersion", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.ProtocolVersion.protocolVersion_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val protocolVersion_bytesize (x:protocolVersion) : GTot nat\nlet protocolVersion_bytesize (x: protocolVersion) : GTot nat =", "completed_definiton": "Seq.length (protocolVersion_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.protocolVersion_repr_jumper", "original_source_type": "", "source_type": "val protocolVersion_repr_jumper : LowParse.Low.Base.jumper LowParse.Spec.Int.parse_u16", "source_definition": "let protocolVersion_repr_jumper = LL.jump_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 50, "start_col": 66, "end_line": 50, "end_col": 77 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper LowParse.Spec.Int.parse_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.jump_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let protocolVersion_repr_jumper =", "completed_definiton": "LL.jump_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.protocolVersion_repr_parser32", "original_source_type": "", "source_type": "val protocolVersion_repr_parser32 : LowParse.SLow.Base.parser32 LowParse.Spec.Int.parse_u16", "source_definition": "let protocolVersion_repr_parser32 = LS.parse32_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 42, "start_col": 68, "end_line": 42, "end_col": 82 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 LowParse.Spec.Int.parse_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.parse32_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let protocolVersion_repr_parser32 =", "completed_definiton": "LS.parse32_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.protocolVersion_repr_reader", "original_source_type": "", "source_type": "val protocolVersion_repr_reader : LowParse.Low.Base.leaf_reader LowParse.Spec.Int.parse_u16", "source_definition": "let protocolVersion_repr_reader = LL.read_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 52, "start_col": 66, "end_line": 52, "end_col": 77 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader LowParse.Spec.Int.parse_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.read_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let protocolVersion_repr_reader =", "completed_definiton": "LL.read_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.protocolVersion_repr_parser", "original_source_type": "", "source_type": "val protocolVersion_repr_parser : LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u16_kind FStar.UInt16.t", "source_definition": "let protocolVersion_repr_parser = LPI.parse_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 38, "start_col": 44, "end_line": 38, "end_col": 57 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u16_kind FStar.UInt16.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Int.parse_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let protocolVersion_repr_parser =", "completed_definiton": "LPI.parse_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.protocolVersion_repr_serializer32", "original_source_type": "", "source_type": "val protocolVersion_repr_serializer32 : LowParse.SLow.Base.serializer32 LowParse.Spec.Int.serialize_u16", "source_definition": "let protocolVersion_repr_serializer32 = LS.serialize32_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 44, "start_col": 72, "end_line": 44, "end_col": 90 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 LowParse.Spec.Int.serialize_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.serialize32_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let protocolVersion_repr_serializer32 =", "completed_definiton": "LS.serialize32_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.read_maybe_protocolVersion_key", "original_source_type": "val read_maybe_protocolVersion_key:LL.leaf_reader parse_maybe_protocolVersion_key", "source_type": "val read_maybe_protocolVersion_key:LL.leaf_reader parse_maybe_protocolVersion_key", "source_definition": "let read_maybe_protocolVersion_key : LL.leaf_reader parse_maybe_protocolVersion_key =\n LL.mk_read_maybe_enum_key protocolVersion_repr_reader protocolVersion_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 134, "start_col": 4, "end_line": 134, "end_col": 78 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let protocolVersion_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let protocolVersion_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_protocolVersion (x:LP.maybe_enum_key protocolVersion_enum) : protocolVersion = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n Unknown_protocolVersion v\n\ninline_for_extraction let synth_protocolVersion_inv (x:protocolVersion) : LP.maybe_enum_key protocolVersion_enum = \n match x with\n | Unknown_protocolVersion y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : protocolVersion = x in\n [@inline_let] let _ : squash(not (Unknown_protocolVersion? x1) ==> LP.list_mem x1 (LP.list_map fst protocolVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key protocolVersion_enum)\n\nlet lemma_synth_protocolVersion_inv' () : Lemma\n (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion)\n= LP.forall_maybe_enum_key protocolVersion_enum (fun x -> synth_protocolVersion_inv (synth_protocolVersion x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_protocolVersion_inj () : Lemma\n (LP.synth_injective synth_protocolVersion) = \n lemma_synth_protocolVersion_inv' ();\n LP.synth_inverse_synth_injective synth_protocolVersion synth_protocolVersion_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_protocolVersion_inv () : Lemma\n (LP.synth_inverse synth_protocolVersion synth_protocolVersion_inv) = allow_inversion protocolVersion; ()\n\n#pop-options\nnoextract let parse_maybe_protocolVersion_key : LP.parser _ (LP.maybe_enum_key protocolVersion_enum) =\n LP.parse_maybe_enum_key protocolVersion_repr_parser protocolVersion_enum\n\nnoextract let serialize_maybe_protocolVersion_key : LP.serializer parse_maybe_protocolVersion_key =\n LP.serialize_maybe_enum_key protocolVersion_repr_parser protocolVersion_repr_serializer protocolVersion_enum\n\nnoextract let protocolVersion_parser : LP.parser _ protocolVersion =\n lemma_synth_protocolVersion_inj ();\n parse_maybe_protocolVersion_key `LP.parse_synth` synth_protocolVersion\n\nnoextract let protocolVersion_serializer : LP.serializer protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LP.serialize_synth _ synth_protocolVersion serialize_maybe_protocolVersion_key synth_protocolVersion_inv ()\n\nlet protocolVersion_bytesize (x:protocolVersion) : GTot nat = Seq.length (protocolVersion_serializer x)\n\nlet protocolVersion_bytesize_eq x = ()\n\nlet parse32_maybe_protocolVersion_key : LS.parser32 parse_maybe_protocolVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac protocolVersion_repr_parser32 protocolVersion_enum)\n\nlet protocolVersion_parser32 : LS.parser32 protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n LS.parse32_synth _ synth_protocolVersion (fun x->synth_protocolVersion x) parse32_maybe_protocolVersion_key ()\n\nlet serialize32_maybe_protocolVersion_key : LS.serializer32 serialize_maybe_protocolVersion_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n protocolVersion_repr_serializer32 protocolVersion_enum)\n\nlet protocolVersion_serializer32 : LS.serializer32 protocolVersion_serializer =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LS.serialize32_synth _ synth_protocolVersion _ serialize32_maybe_protocolVersion_key synth_protocolVersion_inv (fun x->synth_protocolVersion_inv x) ()\n\nlet protocolVersion_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond protocolVersion_serializer 2ul) in\n LSZ.size32_constant protocolVersion_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader Parsers.ProtocolVersion.parse_maybe_protocolVersion_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.read_maybe_enum_key", "Parsers.ProtocolVersion.protocolVersion", "FStar.UInt16.t", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Int.parse_u16", "Parsers.ProtocolVersion.protocolVersion_repr_reader", "Prims.Cons", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.Mktuple2", "Parsers.ProtocolVersion.SSL_3p0", "FStar.UInt16.__uint_to_t", "Parsers.ProtocolVersion.TLS_1p0", "Parsers.ProtocolVersion.TLS_1p1", "Parsers.ProtocolVersion.TLS_1p2", "Parsers.ProtocolVersion.TLS_1p3", "Prims.Nil", "LowParse.Spec.Enum.maybe_enum_destr_t_intro", "LowParse.Spec.Enum.maybe_enum_key", "LowParse.Spec.Enum.maybe_enum_destr_cons", "LowParse.Spec.Enum.maybe_enum_destr_nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_maybe_protocolVersion_key:LL.leaf_reader parse_maybe_protocolVersion_key\nlet read_maybe_protocolVersion_key:LL.leaf_reader parse_maybe_protocolVersion_key =", "completed_definiton": "LL.mk_read_maybe_enum_key protocolVersion_repr_reader protocolVersion_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.protocolVersion_size32", "original_source_type": "val protocolVersion_size32: LSZ.size32 protocolVersion_serializer", "source_type": "val protocolVersion_size32: LSZ.size32 protocolVersion_serializer", "source_definition": "let protocolVersion_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond protocolVersion_serializer 2ul) in\n LSZ.size32_constant protocolVersion_serializer 2ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 129, "start_col": 2, "end_line": 130, "end_col": 55 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let protocolVersion_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let protocolVersion_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_protocolVersion (x:LP.maybe_enum_key protocolVersion_enum) : protocolVersion = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n Unknown_protocolVersion v\n\ninline_for_extraction let synth_protocolVersion_inv (x:protocolVersion) : LP.maybe_enum_key protocolVersion_enum = \n match x with\n | Unknown_protocolVersion y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : protocolVersion = x in\n [@inline_let] let _ : squash(not (Unknown_protocolVersion? x1) ==> LP.list_mem x1 (LP.list_map fst protocolVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key protocolVersion_enum)\n\nlet lemma_synth_protocolVersion_inv' () : Lemma\n (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion)\n= LP.forall_maybe_enum_key protocolVersion_enum (fun x -> synth_protocolVersion_inv (synth_protocolVersion x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_protocolVersion_inj () : Lemma\n (LP.synth_injective synth_protocolVersion) = \n lemma_synth_protocolVersion_inv' ();\n LP.synth_inverse_synth_injective synth_protocolVersion synth_protocolVersion_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_protocolVersion_inv () : Lemma\n (LP.synth_inverse synth_protocolVersion synth_protocolVersion_inv) = allow_inversion protocolVersion; ()\n\n#pop-options\nnoextract let parse_maybe_protocolVersion_key : LP.parser _ (LP.maybe_enum_key protocolVersion_enum) =\n LP.parse_maybe_enum_key protocolVersion_repr_parser protocolVersion_enum\n\nnoextract let serialize_maybe_protocolVersion_key : LP.serializer parse_maybe_protocolVersion_key =\n LP.serialize_maybe_enum_key protocolVersion_repr_parser protocolVersion_repr_serializer protocolVersion_enum\n\nnoextract let protocolVersion_parser : LP.parser _ protocolVersion =\n lemma_synth_protocolVersion_inj ();\n parse_maybe_protocolVersion_key `LP.parse_synth` synth_protocolVersion\n\nnoextract let protocolVersion_serializer : LP.serializer protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LP.serialize_synth _ synth_protocolVersion serialize_maybe_protocolVersion_key synth_protocolVersion_inv ()\n\nlet protocolVersion_bytesize (x:protocolVersion) : GTot nat = Seq.length (protocolVersion_serializer x)\n\nlet protocolVersion_bytesize_eq x = ()\n\nlet parse32_maybe_protocolVersion_key : LS.parser32 parse_maybe_protocolVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac protocolVersion_repr_parser32 protocolVersion_enum)\n\nlet protocolVersion_parser32 : LS.parser32 protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n LS.parse32_synth _ synth_protocolVersion (fun x->synth_protocolVersion x) parse32_maybe_protocolVersion_key ()\n\nlet serialize32_maybe_protocolVersion_key : LS.serializer32 serialize_maybe_protocolVersion_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n protocolVersion_repr_serializer32 protocolVersion_enum)\n\nlet protocolVersion_serializer32 : LS.serializer32 protocolVersion_serializer =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LS.serialize32_synth _ synth_protocolVersion _ serialize32_maybe_protocolVersion_key synth_protocolVersion_inv (fun x->synth_protocolVersion_inv x) ()", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.ProtocolVersion.protocolVersion_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Base.size32_constant", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.ProtocolVersion.protocolVersion", "Parsers.ProtocolVersion.protocolVersion_parser", "Parsers.ProtocolVersion.protocolVersion_serializer", "FStar.UInt32.__uint_to_t", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.SLow.Base.size32_constant_precond" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val protocolVersion_size32: LSZ.size32 protocolVersion_serializer\nlet protocolVersion_size32 =", "completed_definiton": "[@@ inline_let ]let _ = assert_norm (LSZ.size32_constant_precond protocolVersion_serializer 2ul) in\nLSZ.size32_constant protocolVersion_serializer 2ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.protocolVersion_parser", "original_source_type": "val protocolVersion_parser: LP.parser protocolVersion_parser_kind protocolVersion", "source_type": "val protocolVersion_parser: LP.parser protocolVersion_parser_kind protocolVersion", "source_definition": "let protocolVersion_parser : LP.parser _ protocolVersion =\n lemma_synth_protocolVersion_inj ();\n parse_maybe_protocolVersion_key `LP.parse_synth` synth_protocolVersion", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 100, "start_col": 2, "end_line": 101, "end_col": 72 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let protocolVersion_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let protocolVersion_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_protocolVersion (x:LP.maybe_enum_key protocolVersion_enum) : protocolVersion = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n Unknown_protocolVersion v\n\ninline_for_extraction let synth_protocolVersion_inv (x:protocolVersion) : LP.maybe_enum_key protocolVersion_enum = \n match x with\n | Unknown_protocolVersion y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : protocolVersion = x in\n [@inline_let] let _ : squash(not (Unknown_protocolVersion? x1) ==> LP.list_mem x1 (LP.list_map fst protocolVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key protocolVersion_enum)\n\nlet lemma_synth_protocolVersion_inv' () : Lemma\n (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion)\n= LP.forall_maybe_enum_key protocolVersion_enum (fun x -> synth_protocolVersion_inv (synth_protocolVersion x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_protocolVersion_inj () : Lemma\n (LP.synth_injective synth_protocolVersion) = \n lemma_synth_protocolVersion_inv' ();\n LP.synth_inverse_synth_injective synth_protocolVersion synth_protocolVersion_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_protocolVersion_inv () : Lemma\n (LP.synth_inverse synth_protocolVersion synth_protocolVersion_inv) = allow_inversion protocolVersion; ()\n\n#pop-options\nnoextract let parse_maybe_protocolVersion_key : LP.parser _ (LP.maybe_enum_key protocolVersion_enum) =\n LP.parse_maybe_enum_key protocolVersion_repr_parser protocolVersion_enum\n\nnoextract let serialize_maybe_protocolVersion_key : LP.serializer parse_maybe_protocolVersion_key =\n LP.serialize_maybe_enum_key protocolVersion_repr_parser protocolVersion_repr_serializer protocolVersion_enum", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.ProtocolVersion.protocolVersion_parser_kind\n Parsers.ProtocolVersion.protocolVersion", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.ProtocolVersion.protocolVersion", "FStar.UInt16.t", "Parsers.ProtocolVersion.protocolVersion_enum", "Parsers.ProtocolVersion.parse_maybe_protocolVersion_key", "Parsers.ProtocolVersion.synth_protocolVersion", "Prims.unit", "Parsers.ProtocolVersion.lemma_synth_protocolVersion_inj", "LowParse.Spec.Base.parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val protocolVersion_parser: LP.parser protocolVersion_parser_kind protocolVersion\nlet protocolVersion_parser:LP.parser _ protocolVersion =", "completed_definiton": "lemma_synth_protocolVersion_inj ();\nparse_maybe_protocolVersion_key `LP.parse_synth` synth_protocolVersion", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.protocolVersion_serializer32", "original_source_type": "val protocolVersion_serializer32: LS.serializer32 protocolVersion_serializer", "source_type": "val protocolVersion_serializer32: LS.serializer32 protocolVersion_serializer", "source_definition": "let protocolVersion_serializer32 : LS.serializer32 protocolVersion_serializer =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LS.serialize32_synth _ synth_protocolVersion _ serialize32_maybe_protocolVersion_key synth_protocolVersion_inv (fun x->synth_protocolVersion_inv x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 124, "start_col": 2, "end_line": 126, "end_col": 152 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let protocolVersion_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let protocolVersion_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_protocolVersion (x:LP.maybe_enum_key protocolVersion_enum) : protocolVersion = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n Unknown_protocolVersion v\n\ninline_for_extraction let synth_protocolVersion_inv (x:protocolVersion) : LP.maybe_enum_key protocolVersion_enum = \n match x with\n | Unknown_protocolVersion y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : protocolVersion = x in\n [@inline_let] let _ : squash(not (Unknown_protocolVersion? x1) ==> LP.list_mem x1 (LP.list_map fst protocolVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key protocolVersion_enum)\n\nlet lemma_synth_protocolVersion_inv' () : Lemma\n (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion)\n= LP.forall_maybe_enum_key protocolVersion_enum (fun x -> synth_protocolVersion_inv (synth_protocolVersion x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_protocolVersion_inj () : Lemma\n (LP.synth_injective synth_protocolVersion) = \n lemma_synth_protocolVersion_inv' ();\n LP.synth_inverse_synth_injective synth_protocolVersion synth_protocolVersion_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_protocolVersion_inv () : Lemma\n (LP.synth_inverse synth_protocolVersion synth_protocolVersion_inv) = allow_inversion protocolVersion; ()\n\n#pop-options\nnoextract let parse_maybe_protocolVersion_key : LP.parser _ (LP.maybe_enum_key protocolVersion_enum) =\n LP.parse_maybe_enum_key protocolVersion_repr_parser protocolVersion_enum\n\nnoextract let serialize_maybe_protocolVersion_key : LP.serializer parse_maybe_protocolVersion_key =\n LP.serialize_maybe_enum_key protocolVersion_repr_parser protocolVersion_repr_serializer protocolVersion_enum\n\nnoextract let protocolVersion_parser : LP.parser _ protocolVersion =\n lemma_synth_protocolVersion_inj ();\n parse_maybe_protocolVersion_key `LP.parse_synth` synth_protocolVersion\n\nnoextract let protocolVersion_serializer : LP.serializer protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LP.serialize_synth _ synth_protocolVersion serialize_maybe_protocolVersion_key synth_protocolVersion_inv ()\n\nlet protocolVersion_bytesize (x:protocolVersion) : GTot nat = Seq.length (protocolVersion_serializer x)\n\nlet protocolVersion_bytesize_eq x = ()\n\nlet parse32_maybe_protocolVersion_key : LS.parser32 parse_maybe_protocolVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac protocolVersion_repr_parser32 protocolVersion_enum)\n\nlet protocolVersion_parser32 : LS.parser32 protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n LS.parse32_synth _ synth_protocolVersion (fun x->synth_protocolVersion x) parse32_maybe_protocolVersion_key ()\n\nlet serialize32_maybe_protocolVersion_key : LS.serializer32 serialize_maybe_protocolVersion_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n protocolVersion_repr_serializer32 protocolVersion_enum)", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.ProtocolVersion.protocolVersion_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_synth", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.ProtocolVersion.protocolVersion", "FStar.UInt16.t", "Parsers.ProtocolVersion.protocolVersion_enum", "Parsers.ProtocolVersion.parse_maybe_protocolVersion_key", "Parsers.ProtocolVersion.synth_protocolVersion", "Parsers.ProtocolVersion.serialize_maybe_protocolVersion_key", "Parsers.ProtocolVersion.serialize32_maybe_protocolVersion_key", "Parsers.ProtocolVersion.synth_protocolVersion_inv", "Prims.eq2", "Prims.unit", "Parsers.ProtocolVersion.lemma_synth_protocolVersion_inv", "Parsers.ProtocolVersion.lemma_synth_protocolVersion_inj", "LowParse.SLow.Base.serializer32", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.ProtocolVersion.protocolVersion_parser", "Parsers.ProtocolVersion.protocolVersion_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val protocolVersion_serializer32: LS.serializer32 protocolVersion_serializer\nlet protocolVersion_serializer32:LS.serializer32 protocolVersion_serializer =", "completed_definiton": "lemma_synth_protocolVersion_inj ();\nlemma_synth_protocolVersion_inv ();\nLS.serialize32_synth _\n synth_protocolVersion\n _\n serialize32_maybe_protocolVersion_key\n synth_protocolVersion_inv\n (fun x -> synth_protocolVersion_inv x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.protocolVersion_enum", "original_source_type": "val protocolVersion_enum:LP.enum protocolVersion U16.t", "source_type": "val protocolVersion_enum:LP.enum protocolVersion U16.t", "source_definition": "let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 24, "start_col": 2, "end_line": 36, "end_col": 6 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Enum.enum Parsers.ProtocolVersion.protocolVersion FStar.UInt16.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.b2t", "FStar.List.Tot.Base.noRepeats", "FStar.UInt16.t", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "Parsers.ProtocolVersion.protocolVersion", "FStar.Pervasives.Native.snd", "FStar.Pervasives.Native.fst", "Prims.list", "Prims.Cons", "FStar.Pervasives.Native.Mktuple2", "Parsers.ProtocolVersion.SSL_3p0", "FStar.UInt16.__uint_to_t", "Parsers.ProtocolVersion.TLS_1p0", "Parsers.ProtocolVersion.TLS_1p1", "Parsers.ProtocolVersion.TLS_1p2", "Parsers.ProtocolVersion.TLS_1p3", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val protocolVersion_enum:LP.enum protocolVersion U16.t\nlet protocolVersion_enum:LP.enum protocolVersion U16.t =", "completed_definiton": "[@@ inline_let ]let e =\n [SSL_3p0, 768us; TLS_1p0, 769us; TLS_1p1, 770us; TLS_1p2, 771us; TLS_1p3, 772us]\nin\n[@@ inline_let ]let _ = assert_norm (L.noRepeats (LP.list_map fst e)) in\n[@@ inline_let ]let _ = assert_norm (L.noRepeats (LP.list_map snd e)) in\ne", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.serialize_maybe_protocolVersion_key", "original_source_type": "val serialize_maybe_protocolVersion_key:LP.serializer parse_maybe_protocolVersion_key", "source_type": "val serialize_maybe_protocolVersion_key:LP.serializer parse_maybe_protocolVersion_key", "source_definition": "let serialize_maybe_protocolVersion_key : LP.serializer parse_maybe_protocolVersion_key =\n LP.serialize_maybe_enum_key protocolVersion_repr_parser protocolVersion_repr_serializer protocolVersion_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 97, "start_col": 2, "end_line": 97, "end_col": 110 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let protocolVersion_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let protocolVersion_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_protocolVersion (x:LP.maybe_enum_key protocolVersion_enum) : protocolVersion = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n Unknown_protocolVersion v\n\ninline_for_extraction let synth_protocolVersion_inv (x:protocolVersion) : LP.maybe_enum_key protocolVersion_enum = \n match x with\n | Unknown_protocolVersion y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : protocolVersion = x in\n [@inline_let] let _ : squash(not (Unknown_protocolVersion? x1) ==> LP.list_mem x1 (LP.list_map fst protocolVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key protocolVersion_enum)\n\nlet lemma_synth_protocolVersion_inv' () : Lemma\n (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion)\n= LP.forall_maybe_enum_key protocolVersion_enum (fun x -> synth_protocolVersion_inv (synth_protocolVersion x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_protocolVersion_inj () : Lemma\n (LP.synth_injective synth_protocolVersion) = \n lemma_synth_protocolVersion_inv' ();\n LP.synth_inverse_synth_injective synth_protocolVersion synth_protocolVersion_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_protocolVersion_inv () : Lemma\n (LP.synth_inverse synth_protocolVersion synth_protocolVersion_inv) = allow_inversion protocolVersion; ()\n\n#pop-options\nnoextract let parse_maybe_protocolVersion_key : LP.parser _ (LP.maybe_enum_key protocolVersion_enum) =\n LP.parse_maybe_enum_key protocolVersion_repr_parser protocolVersion_enum", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.ProtocolVersion.parse_maybe_protocolVersion_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.serialize_maybe_enum_key", "LowParse.Spec.Int.parse_u16_kind", "Parsers.ProtocolVersion.protocolVersion", "FStar.UInt16.t", "Parsers.ProtocolVersion.protocolVersion_repr_parser", "Parsers.ProtocolVersion.protocolVersion_repr_serializer", "Parsers.ProtocolVersion.protocolVersion_enum" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_maybe_protocolVersion_key:LP.serializer parse_maybe_protocolVersion_key\nlet serialize_maybe_protocolVersion_key:LP.serializer parse_maybe_protocolVersion_key =", "completed_definiton": "LP.serialize_maybe_enum_key protocolVersion_repr_parser\n protocolVersion_repr_serializer\n protocolVersion_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.protocolVersion_serializer", "original_source_type": "val protocolVersion_serializer: LP.serializer protocolVersion_parser", "source_type": "val protocolVersion_serializer: LP.serializer protocolVersion_parser", "source_definition": "let protocolVersion_serializer : LP.serializer protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LP.serialize_synth _ synth_protocolVersion serialize_maybe_protocolVersion_key synth_protocolVersion_inv ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 104, "start_col": 2, "end_line": 106, "end_col": 109 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let protocolVersion_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let protocolVersion_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_protocolVersion (x:LP.maybe_enum_key protocolVersion_enum) : protocolVersion = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n Unknown_protocolVersion v\n\ninline_for_extraction let synth_protocolVersion_inv (x:protocolVersion) : LP.maybe_enum_key protocolVersion_enum = \n match x with\n | Unknown_protocolVersion y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : protocolVersion = x in\n [@inline_let] let _ : squash(not (Unknown_protocolVersion? x1) ==> LP.list_mem x1 (LP.list_map fst protocolVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key protocolVersion_enum)\n\nlet lemma_synth_protocolVersion_inv' () : Lemma\n (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion)\n= LP.forall_maybe_enum_key protocolVersion_enum (fun x -> synth_protocolVersion_inv (synth_protocolVersion x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_protocolVersion_inj () : Lemma\n (LP.synth_injective synth_protocolVersion) = \n lemma_synth_protocolVersion_inv' ();\n LP.synth_inverse_synth_injective synth_protocolVersion synth_protocolVersion_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_protocolVersion_inv () : Lemma\n (LP.synth_inverse synth_protocolVersion synth_protocolVersion_inv) = allow_inversion protocolVersion; ()\n\n#pop-options\nnoextract let parse_maybe_protocolVersion_key : LP.parser _ (LP.maybe_enum_key protocolVersion_enum) =\n LP.parse_maybe_enum_key protocolVersion_repr_parser protocolVersion_enum\n\nnoextract let serialize_maybe_protocolVersion_key : LP.serializer parse_maybe_protocolVersion_key =\n LP.serialize_maybe_enum_key protocolVersion_repr_parser protocolVersion_repr_serializer protocolVersion_enum\n\nnoextract let protocolVersion_parser : LP.parser _ protocolVersion =\n lemma_synth_protocolVersion_inj ();\n parse_maybe_protocolVersion_key `LP.parse_synth` synth_protocolVersion", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.ProtocolVersion.protocolVersion_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_synth", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.ProtocolVersion.protocolVersion", "FStar.UInt16.t", "Parsers.ProtocolVersion.protocolVersion_enum", "Parsers.ProtocolVersion.parse_maybe_protocolVersion_key", "Parsers.ProtocolVersion.synth_protocolVersion", "Parsers.ProtocolVersion.serialize_maybe_protocolVersion_key", "Parsers.ProtocolVersion.synth_protocolVersion_inv", "Prims.unit", "Parsers.ProtocolVersion.lemma_synth_protocolVersion_inv", "Parsers.ProtocolVersion.lemma_synth_protocolVersion_inj", "LowParse.Spec.Base.serializer", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.ProtocolVersion.protocolVersion_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val protocolVersion_serializer: LP.serializer protocolVersion_parser\nlet protocolVersion_serializer:LP.serializer protocolVersion_parser =", "completed_definiton": "lemma_synth_protocolVersion_inj ();\nlemma_synth_protocolVersion_inv ();\nLP.serialize_synth _\n synth_protocolVersion\n serialize_maybe_protocolVersion_key\n synth_protocolVersion_inv\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.protocolVersion_reader", "original_source_type": "val protocolVersion_reader: LL.leaf_reader protocolVersion_parser", "source_type": "val protocolVersion_reader: LL.leaf_reader protocolVersion_parser", "source_definition": "let protocolVersion_reader =\n [@inline_let] let _ = lemma_synth_protocolVersion_inj () in\n LL.read_synth' parse_maybe_protocolVersion_key synth_protocolVersion read_maybe_protocolVersion_key ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 137, "start_col": 1, "end_line": 138, "end_col": 103 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let protocolVersion_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let protocolVersion_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_protocolVersion (x:LP.maybe_enum_key protocolVersion_enum) : protocolVersion = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n Unknown_protocolVersion v\n\ninline_for_extraction let synth_protocolVersion_inv (x:protocolVersion) : LP.maybe_enum_key protocolVersion_enum = \n match x with\n | Unknown_protocolVersion y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : protocolVersion = x in\n [@inline_let] let _ : squash(not (Unknown_protocolVersion? x1) ==> LP.list_mem x1 (LP.list_map fst protocolVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key protocolVersion_enum)\n\nlet lemma_synth_protocolVersion_inv' () : Lemma\n (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion)\n= LP.forall_maybe_enum_key protocolVersion_enum (fun x -> synth_protocolVersion_inv (synth_protocolVersion x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_protocolVersion_inj () : Lemma\n (LP.synth_injective synth_protocolVersion) = \n lemma_synth_protocolVersion_inv' ();\n LP.synth_inverse_synth_injective synth_protocolVersion synth_protocolVersion_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_protocolVersion_inv () : Lemma\n (LP.synth_inverse synth_protocolVersion synth_protocolVersion_inv) = allow_inversion protocolVersion; ()\n\n#pop-options\nnoextract let parse_maybe_protocolVersion_key : LP.parser _ (LP.maybe_enum_key protocolVersion_enum) =\n LP.parse_maybe_enum_key protocolVersion_repr_parser protocolVersion_enum\n\nnoextract let serialize_maybe_protocolVersion_key : LP.serializer parse_maybe_protocolVersion_key =\n LP.serialize_maybe_enum_key protocolVersion_repr_parser protocolVersion_repr_serializer protocolVersion_enum\n\nnoextract let protocolVersion_parser : LP.parser _ protocolVersion =\n lemma_synth_protocolVersion_inj ();\n parse_maybe_protocolVersion_key `LP.parse_synth` synth_protocolVersion\n\nnoextract let protocolVersion_serializer : LP.serializer protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LP.serialize_synth _ synth_protocolVersion serialize_maybe_protocolVersion_key synth_protocolVersion_inv ()\n\nlet protocolVersion_bytesize (x:protocolVersion) : GTot nat = Seq.length (protocolVersion_serializer x)\n\nlet protocolVersion_bytesize_eq x = ()\n\nlet parse32_maybe_protocolVersion_key : LS.parser32 parse_maybe_protocolVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac protocolVersion_repr_parser32 protocolVersion_enum)\n\nlet protocolVersion_parser32 : LS.parser32 protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n LS.parse32_synth _ synth_protocolVersion (fun x->synth_protocolVersion x) parse32_maybe_protocolVersion_key ()\n\nlet serialize32_maybe_protocolVersion_key : LS.serializer32 serialize_maybe_protocolVersion_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n protocolVersion_repr_serializer32 protocolVersion_enum)\n\nlet protocolVersion_serializer32 : LS.serializer32 protocolVersion_serializer =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LS.serialize32_synth _ synth_protocolVersion _ serialize32_maybe_protocolVersion_key synth_protocolVersion_inv (fun x->synth_protocolVersion_inv x) ()\n\nlet protocolVersion_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond protocolVersion_serializer 2ul) in\n LSZ.size32_constant protocolVersion_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_protocolVersion_key : LL.leaf_reader parse_maybe_protocolVersion_key =\n LL.mk_read_maybe_enum_key protocolVersion_repr_reader protocolVersion_enum", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader Parsers.ProtocolVersion.protocolVersion_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.read_synth'", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.ProtocolVersion.protocolVersion", "FStar.UInt16.t", "Parsers.ProtocolVersion.protocolVersion_enum", "Parsers.ProtocolVersion.parse_maybe_protocolVersion_key", "Parsers.ProtocolVersion.synth_protocolVersion", "Parsers.ProtocolVersion.read_maybe_protocolVersion_key", "Prims.unit", "Parsers.ProtocolVersion.lemma_synth_protocolVersion_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val protocolVersion_reader: LL.leaf_reader protocolVersion_parser\nlet protocolVersion_reader =", "completed_definiton": "[@@ inline_let ]let _ = lemma_synth_protocolVersion_inj () in\nLL.read_synth' parse_maybe_protocolVersion_key\n synth_protocolVersion\n read_maybe_protocolVersion_key\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.protocolVersion_parser32", "original_source_type": "val protocolVersion_parser32: LS.parser32 protocolVersion_parser", "source_type": "val protocolVersion_parser32: LS.parser32 protocolVersion_parser", "source_definition": "let protocolVersion_parser32 : LS.parser32 protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n LS.parse32_synth _ synth_protocolVersion (fun x->synth_protocolVersion x) parse32_maybe_protocolVersion_key ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 116, "start_col": 2, "end_line": 117, "end_col": 112 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let protocolVersion_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let protocolVersion_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_protocolVersion (x:LP.maybe_enum_key protocolVersion_enum) : protocolVersion = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n Unknown_protocolVersion v\n\ninline_for_extraction let synth_protocolVersion_inv (x:protocolVersion) : LP.maybe_enum_key protocolVersion_enum = \n match x with\n | Unknown_protocolVersion y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : protocolVersion = x in\n [@inline_let] let _ : squash(not (Unknown_protocolVersion? x1) ==> LP.list_mem x1 (LP.list_map fst protocolVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key protocolVersion_enum)\n\nlet lemma_synth_protocolVersion_inv' () : Lemma\n (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion)\n= LP.forall_maybe_enum_key protocolVersion_enum (fun x -> synth_protocolVersion_inv (synth_protocolVersion x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_protocolVersion_inj () : Lemma\n (LP.synth_injective synth_protocolVersion) = \n lemma_synth_protocolVersion_inv' ();\n LP.synth_inverse_synth_injective synth_protocolVersion synth_protocolVersion_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_protocolVersion_inv () : Lemma\n (LP.synth_inverse synth_protocolVersion synth_protocolVersion_inv) = allow_inversion protocolVersion; ()\n\n#pop-options\nnoextract let parse_maybe_protocolVersion_key : LP.parser _ (LP.maybe_enum_key protocolVersion_enum) =\n LP.parse_maybe_enum_key protocolVersion_repr_parser protocolVersion_enum\n\nnoextract let serialize_maybe_protocolVersion_key : LP.serializer parse_maybe_protocolVersion_key =\n LP.serialize_maybe_enum_key protocolVersion_repr_parser protocolVersion_repr_serializer protocolVersion_enum\n\nnoextract let protocolVersion_parser : LP.parser _ protocolVersion =\n lemma_synth_protocolVersion_inj ();\n parse_maybe_protocolVersion_key `LP.parse_synth` synth_protocolVersion\n\nnoextract let protocolVersion_serializer : LP.serializer protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LP.serialize_synth _ synth_protocolVersion serialize_maybe_protocolVersion_key synth_protocolVersion_inv ()\n\nlet protocolVersion_bytesize (x:protocolVersion) : GTot nat = Seq.length (protocolVersion_serializer x)\n\nlet protocolVersion_bytesize_eq x = ()\n\nlet parse32_maybe_protocolVersion_key : LS.parser32 parse_maybe_protocolVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac protocolVersion_repr_parser32 protocolVersion_enum)", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.ProtocolVersion.protocolVersion_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_synth", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.ProtocolVersion.protocolVersion", "FStar.UInt16.t", "Parsers.ProtocolVersion.protocolVersion_enum", "Parsers.ProtocolVersion.parse_maybe_protocolVersion_key", "Parsers.ProtocolVersion.synth_protocolVersion", "Prims.eq2", "Parsers.ProtocolVersion.parse32_maybe_protocolVersion_key", "Prims.unit", "Parsers.ProtocolVersion.lemma_synth_protocolVersion_inj", "LowParse.SLow.Base.parser32", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.ProtocolVersion.protocolVersion_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val protocolVersion_parser32: LS.parser32 protocolVersion_parser\nlet protocolVersion_parser32:LS.parser32 protocolVersion_parser =", "completed_definiton": "lemma_synth_protocolVersion_inj ();\nLS.parse32_synth _\n synth_protocolVersion\n (fun x -> synth_protocolVersion x)\n parse32_maybe_protocolVersion_key\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.protocolVersion_writer", "original_source_type": "val protocolVersion_writer: LL.leaf_writer_strong protocolVersion_serializer", "source_type": "val protocolVersion_writer: LL.leaf_writer_strong protocolVersion_serializer", "source_definition": "let protocolVersion_writer =\n [@inline_let] let _ = lemma_synth_protocolVersion_inj (); lemma_synth_protocolVersion_inv () in\n LL.write_synth write_maybe_protocolVersion_key synth_protocolVersion synth_protocolVersion_inv (fun x -> synth_protocolVersion_inv x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 147, "start_col": 2, "end_line": 148, "end_col": 138 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let protocolVersion_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let protocolVersion_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_protocolVersion (x:LP.maybe_enum_key protocolVersion_enum) : protocolVersion = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n Unknown_protocolVersion v\n\ninline_for_extraction let synth_protocolVersion_inv (x:protocolVersion) : LP.maybe_enum_key protocolVersion_enum = \n match x with\n | Unknown_protocolVersion y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : protocolVersion = x in\n [@inline_let] let _ : squash(not (Unknown_protocolVersion? x1) ==> LP.list_mem x1 (LP.list_map fst protocolVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key protocolVersion_enum)\n\nlet lemma_synth_protocolVersion_inv' () : Lemma\n (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion)\n= LP.forall_maybe_enum_key protocolVersion_enum (fun x -> synth_protocolVersion_inv (synth_protocolVersion x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_protocolVersion_inj () : Lemma\n (LP.synth_injective synth_protocolVersion) = \n lemma_synth_protocolVersion_inv' ();\n LP.synth_inverse_synth_injective synth_protocolVersion synth_protocolVersion_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_protocolVersion_inv () : Lemma\n (LP.synth_inverse synth_protocolVersion synth_protocolVersion_inv) = allow_inversion protocolVersion; ()\n\n#pop-options\nnoextract let parse_maybe_protocolVersion_key : LP.parser _ (LP.maybe_enum_key protocolVersion_enum) =\n LP.parse_maybe_enum_key protocolVersion_repr_parser protocolVersion_enum\n\nnoextract let serialize_maybe_protocolVersion_key : LP.serializer parse_maybe_protocolVersion_key =\n LP.serialize_maybe_enum_key protocolVersion_repr_parser protocolVersion_repr_serializer protocolVersion_enum\n\nnoextract let protocolVersion_parser : LP.parser _ protocolVersion =\n lemma_synth_protocolVersion_inj ();\n parse_maybe_protocolVersion_key `LP.parse_synth` synth_protocolVersion\n\nnoextract let protocolVersion_serializer : LP.serializer protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LP.serialize_synth _ synth_protocolVersion serialize_maybe_protocolVersion_key synth_protocolVersion_inv ()\n\nlet protocolVersion_bytesize (x:protocolVersion) : GTot nat = Seq.length (protocolVersion_serializer x)\n\nlet protocolVersion_bytesize_eq x = ()\n\nlet parse32_maybe_protocolVersion_key : LS.parser32 parse_maybe_protocolVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac protocolVersion_repr_parser32 protocolVersion_enum)\n\nlet protocolVersion_parser32 : LS.parser32 protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n LS.parse32_synth _ synth_protocolVersion (fun x->synth_protocolVersion x) parse32_maybe_protocolVersion_key ()\n\nlet serialize32_maybe_protocolVersion_key : LS.serializer32 serialize_maybe_protocolVersion_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n protocolVersion_repr_serializer32 protocolVersion_enum)\n\nlet protocolVersion_serializer32 : LS.serializer32 protocolVersion_serializer =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LS.serialize32_synth _ synth_protocolVersion _ serialize32_maybe_protocolVersion_key synth_protocolVersion_inv (fun x->synth_protocolVersion_inv x) ()\n\nlet protocolVersion_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond protocolVersion_serializer 2ul) in\n LSZ.size32_constant protocolVersion_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_protocolVersion_key : LL.leaf_reader parse_maybe_protocolVersion_key =\n LL.mk_read_maybe_enum_key protocolVersion_repr_reader protocolVersion_enum\n\nlet protocolVersion_reader =\n [@inline_let] let _ = lemma_synth_protocolVersion_inj () in\n LL.read_synth' parse_maybe_protocolVersion_key synth_protocolVersion read_maybe_protocolVersion_key ()\n\ninline_for_extraction let write_maybe_protocolVersion_key : LL.leaf_writer_strong serialize_maybe_protocolVersion_key =\n LL.write_maybe_enum_key protocolVersion_repr_writer protocolVersion_enum (_ by (LP.enum_repr_of_key_tac protocolVersion_enum))\n\ninline_for_extraction let lserialize_maybe_protocolVersion_key : LL.serializer32 serialize_maybe_protocolVersion_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_protocolVersion_key 2ul ()", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong Parsers.ProtocolVersion.protocolVersion_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.write_synth", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.ProtocolVersion.protocolVersion", "FStar.UInt16.t", "Parsers.ProtocolVersion.protocolVersion_enum", "Parsers.ProtocolVersion.parse_maybe_protocolVersion_key", "Parsers.ProtocolVersion.serialize_maybe_protocolVersion_key", "Parsers.ProtocolVersion.write_maybe_protocolVersion_key", "Parsers.ProtocolVersion.synth_protocolVersion", "Parsers.ProtocolVersion.synth_protocolVersion_inv", "Prims.eq2", "Prims.unit", "Parsers.ProtocolVersion.lemma_synth_protocolVersion_inv", "Parsers.ProtocolVersion.lemma_synth_protocolVersion_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val protocolVersion_writer: LL.leaf_writer_strong protocolVersion_serializer\nlet protocolVersion_writer =", "completed_definiton": "[@@ inline_let ]let _ =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ()\nin\nLL.write_synth write_maybe_protocolVersion_key\n synth_protocolVersion\n synth_protocolVersion_inv\n (fun x -> synth_protocolVersion_inv x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.write_maybe_protocolVersion_key", "original_source_type": "val write_maybe_protocolVersion_key:LL.leaf_writer_strong serialize_maybe_protocolVersion_key", "source_type": "val write_maybe_protocolVersion_key:LL.leaf_writer_strong serialize_maybe_protocolVersion_key", "source_definition": "let write_maybe_protocolVersion_key : LL.leaf_writer_strong serialize_maybe_protocolVersion_key =\n LL.write_maybe_enum_key protocolVersion_repr_writer protocolVersion_enum (_ by (LP.enum_repr_of_key_tac protocolVersion_enum))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 141, "start_col": 2, "end_line": 141, "end_col": 128 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let protocolVersion_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let protocolVersion_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_protocolVersion (x:LP.maybe_enum_key protocolVersion_enum) : protocolVersion = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n Unknown_protocolVersion v\n\ninline_for_extraction let synth_protocolVersion_inv (x:protocolVersion) : LP.maybe_enum_key protocolVersion_enum = \n match x with\n | Unknown_protocolVersion y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : protocolVersion = x in\n [@inline_let] let _ : squash(not (Unknown_protocolVersion? x1) ==> LP.list_mem x1 (LP.list_map fst protocolVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key protocolVersion_enum)\n\nlet lemma_synth_protocolVersion_inv' () : Lemma\n (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion)\n= LP.forall_maybe_enum_key protocolVersion_enum (fun x -> synth_protocolVersion_inv (synth_protocolVersion x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_protocolVersion_inj () : Lemma\n (LP.synth_injective synth_protocolVersion) = \n lemma_synth_protocolVersion_inv' ();\n LP.synth_inverse_synth_injective synth_protocolVersion synth_protocolVersion_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_protocolVersion_inv () : Lemma\n (LP.synth_inverse synth_protocolVersion synth_protocolVersion_inv) = allow_inversion protocolVersion; ()\n\n#pop-options\nnoextract let parse_maybe_protocolVersion_key : LP.parser _ (LP.maybe_enum_key protocolVersion_enum) =\n LP.parse_maybe_enum_key protocolVersion_repr_parser protocolVersion_enum\n\nnoextract let serialize_maybe_protocolVersion_key : LP.serializer parse_maybe_protocolVersion_key =\n LP.serialize_maybe_enum_key protocolVersion_repr_parser protocolVersion_repr_serializer protocolVersion_enum\n\nnoextract let protocolVersion_parser : LP.parser _ protocolVersion =\n lemma_synth_protocolVersion_inj ();\n parse_maybe_protocolVersion_key `LP.parse_synth` synth_protocolVersion\n\nnoextract let protocolVersion_serializer : LP.serializer protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LP.serialize_synth _ synth_protocolVersion serialize_maybe_protocolVersion_key synth_protocolVersion_inv ()\n\nlet protocolVersion_bytesize (x:protocolVersion) : GTot nat = Seq.length (protocolVersion_serializer x)\n\nlet protocolVersion_bytesize_eq x = ()\n\nlet parse32_maybe_protocolVersion_key : LS.parser32 parse_maybe_protocolVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac protocolVersion_repr_parser32 protocolVersion_enum)\n\nlet protocolVersion_parser32 : LS.parser32 protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n LS.parse32_synth _ synth_protocolVersion (fun x->synth_protocolVersion x) parse32_maybe_protocolVersion_key ()\n\nlet serialize32_maybe_protocolVersion_key : LS.serializer32 serialize_maybe_protocolVersion_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n protocolVersion_repr_serializer32 protocolVersion_enum)\n\nlet protocolVersion_serializer32 : LS.serializer32 protocolVersion_serializer =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LS.serialize32_synth _ synth_protocolVersion _ serialize32_maybe_protocolVersion_key synth_protocolVersion_inv (fun x->synth_protocolVersion_inv x) ()\n\nlet protocolVersion_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond protocolVersion_serializer 2ul) in\n LSZ.size32_constant protocolVersion_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_protocolVersion_key : LL.leaf_reader parse_maybe_protocolVersion_key =\n LL.mk_read_maybe_enum_key protocolVersion_repr_reader protocolVersion_enum\n\nlet protocolVersion_reader =\n [@inline_let] let _ = lemma_synth_protocolVersion_inj () in\n LL.read_synth' parse_maybe_protocolVersion_key synth_protocolVersion read_maybe_protocolVersion_key ()", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong Parsers.ProtocolVersion.serialize_maybe_protocolVersion_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.write_maybe_enum_key", "Parsers.ProtocolVersion.protocolVersion", "FStar.UInt16.t", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Int.parse_u16", "LowParse.Spec.Int.serialize_u16", "Parsers.ProtocolVersion.protocolVersion_repr_writer", "Parsers.ProtocolVersion.protocolVersion_enum", "LowParse.Spec.Enum.enum_repr_of_key_cons'", "LowParse.Spec.Enum.enum_tail'", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val write_maybe_protocolVersion_key:LL.leaf_writer_strong serialize_maybe_protocolVersion_key\nlet write_maybe_protocolVersion_key:LL.leaf_writer_strong serialize_maybe_protocolVersion_key =", "completed_definiton": "LL.write_maybe_enum_key protocolVersion_repr_writer\n protocolVersion_enum\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.enum_repr_of_key_tac protocolVersion_enum)))", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.lemma_synth_protocolVersion_inj", "original_source_type": "val lemma_synth_protocolVersion_inj: Prims.unit -> Lemma (LP.synth_injective synth_protocolVersion)", "source_type": "val lemma_synth_protocolVersion_inj: Prims.unit -> Lemma (LP.synth_injective synth_protocolVersion)", "source_definition": "let lemma_synth_protocolVersion_inj () : Lemma\n (LP.synth_injective synth_protocolVersion) = \n lemma_synth_protocolVersion_inv' ();\n LP.synth_inverse_synth_injective synth_protocolVersion synth_protocolVersion_inv", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 85, "start_col": 2, "end_line": 86, "end_col": 82 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let protocolVersion_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let protocolVersion_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_protocolVersion (x:LP.maybe_enum_key protocolVersion_enum) : protocolVersion = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n Unknown_protocolVersion v\n\ninline_for_extraction let synth_protocolVersion_inv (x:protocolVersion) : LP.maybe_enum_key protocolVersion_enum = \n match x with\n | Unknown_protocolVersion y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : protocolVersion = x in\n [@inline_let] let _ : squash(not (Unknown_protocolVersion? x1) ==> LP.list_mem x1 (LP.list_map fst protocolVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key protocolVersion_enum)\n\nlet lemma_synth_protocolVersion_inv' () : Lemma\n (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion)\n= LP.forall_maybe_enum_key protocolVersion_enum (fun x -> synth_protocolVersion_inv (synth_protocolVersion x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_protocolVersion_inj () : Lemma", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures LowParse.Spec.Combinators.synth_injective Parsers.ProtocolVersion.synth_protocolVersion\n )", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "LowParse.Spec.Combinators.synth_inverse_synth_injective", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.ProtocolVersion.protocolVersion", "FStar.UInt16.t", "Parsers.ProtocolVersion.protocolVersion_enum", "Parsers.ProtocolVersion.synth_protocolVersion", "Parsers.ProtocolVersion.synth_protocolVersion_inv", "Parsers.ProtocolVersion.lemma_synth_protocolVersion_inv'", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_injective", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_synth_protocolVersion_inj: Prims.unit -> Lemma (LP.synth_injective synth_protocolVersion)\nlet lemma_synth_protocolVersion_inj () : Lemma (LP.synth_injective synth_protocolVersion) =", "completed_definiton": "lemma_synth_protocolVersion_inv' ();\nLP.synth_inverse_synth_injective synth_protocolVersion synth_protocolVersion_inv", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.lserialize_maybe_protocolVersion_key", "original_source_type": "val lserialize_maybe_protocolVersion_key:LL.serializer32 serialize_maybe_protocolVersion_key", "source_type": "val lserialize_maybe_protocolVersion_key:LL.serializer32 serialize_maybe_protocolVersion_key", "source_definition": "let lserialize_maybe_protocolVersion_key : LL.serializer32 serialize_maybe_protocolVersion_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_protocolVersion_key 2ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 144, "start_col": 2, "end_line": 144, "end_col": 92 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let protocolVersion_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let protocolVersion_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_protocolVersion (x:LP.maybe_enum_key protocolVersion_enum) : protocolVersion = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n Unknown_protocolVersion v\n\ninline_for_extraction let synth_protocolVersion_inv (x:protocolVersion) : LP.maybe_enum_key protocolVersion_enum = \n match x with\n | Unknown_protocolVersion y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : protocolVersion = x in\n [@inline_let] let _ : squash(not (Unknown_protocolVersion? x1) ==> LP.list_mem x1 (LP.list_map fst protocolVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key protocolVersion_enum)\n\nlet lemma_synth_protocolVersion_inv' () : Lemma\n (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion)\n= LP.forall_maybe_enum_key protocolVersion_enum (fun x -> synth_protocolVersion_inv (synth_protocolVersion x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_protocolVersion_inj () : Lemma\n (LP.synth_injective synth_protocolVersion) = \n lemma_synth_protocolVersion_inv' ();\n LP.synth_inverse_synth_injective synth_protocolVersion synth_protocolVersion_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_protocolVersion_inv () : Lemma\n (LP.synth_inverse synth_protocolVersion synth_protocolVersion_inv) = allow_inversion protocolVersion; ()\n\n#pop-options\nnoextract let parse_maybe_protocolVersion_key : LP.parser _ (LP.maybe_enum_key protocolVersion_enum) =\n LP.parse_maybe_enum_key protocolVersion_repr_parser protocolVersion_enum\n\nnoextract let serialize_maybe_protocolVersion_key : LP.serializer parse_maybe_protocolVersion_key =\n LP.serialize_maybe_enum_key protocolVersion_repr_parser protocolVersion_repr_serializer protocolVersion_enum\n\nnoextract let protocolVersion_parser : LP.parser _ protocolVersion =\n lemma_synth_protocolVersion_inj ();\n parse_maybe_protocolVersion_key `LP.parse_synth` synth_protocolVersion\n\nnoextract let protocolVersion_serializer : LP.serializer protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LP.serialize_synth _ synth_protocolVersion serialize_maybe_protocolVersion_key synth_protocolVersion_inv ()\n\nlet protocolVersion_bytesize (x:protocolVersion) : GTot nat = Seq.length (protocolVersion_serializer x)\n\nlet protocolVersion_bytesize_eq x = ()\n\nlet parse32_maybe_protocolVersion_key : LS.parser32 parse_maybe_protocolVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac protocolVersion_repr_parser32 protocolVersion_enum)\n\nlet protocolVersion_parser32 : LS.parser32 protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n LS.parse32_synth _ synth_protocolVersion (fun x->synth_protocolVersion x) parse32_maybe_protocolVersion_key ()\n\nlet serialize32_maybe_protocolVersion_key : LS.serializer32 serialize_maybe_protocolVersion_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n protocolVersion_repr_serializer32 protocolVersion_enum)\n\nlet protocolVersion_serializer32 : LS.serializer32 protocolVersion_serializer =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LS.serialize32_synth _ synth_protocolVersion _ serialize32_maybe_protocolVersion_key synth_protocolVersion_inv (fun x->synth_protocolVersion_inv x) ()\n\nlet protocolVersion_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond protocolVersion_serializer 2ul) in\n LSZ.size32_constant protocolVersion_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_protocolVersion_key : LL.leaf_reader parse_maybe_protocolVersion_key =\n LL.mk_read_maybe_enum_key protocolVersion_repr_reader protocolVersion_enum\n\nlet protocolVersion_reader =\n [@inline_let] let _ = lemma_synth_protocolVersion_inj () in\n LL.read_synth' parse_maybe_protocolVersion_key synth_protocolVersion read_maybe_protocolVersion_key ()\n\ninline_for_extraction let write_maybe_protocolVersion_key : LL.leaf_writer_strong serialize_maybe_protocolVersion_key =\n LL.write_maybe_enum_key protocolVersion_repr_writer protocolVersion_enum (_ by (LP.enum_repr_of_key_tac protocolVersion_enum))", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 Parsers.ProtocolVersion.serialize_maybe_protocolVersion_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.serializer32_of_leaf_writer_strong_constant_size", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.ProtocolVersion.protocolVersion", "FStar.UInt16.t", "Parsers.ProtocolVersion.protocolVersion_enum", "Parsers.ProtocolVersion.parse_maybe_protocolVersion_key", "Parsers.ProtocolVersion.serialize_maybe_protocolVersion_key", "Parsers.ProtocolVersion.write_maybe_protocolVersion_key", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lserialize_maybe_protocolVersion_key:LL.serializer32 serialize_maybe_protocolVersion_key\nlet lserialize_maybe_protocolVersion_key:LL.serializer32 serialize_maybe_protocolVersion_key =", "completed_definiton": "LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_protocolVersion_key 2ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.lemma_synth_protocolVersion_inv", "original_source_type": "val lemma_synth_protocolVersion_inv: Prims.unit\n -> Lemma (LP.synth_inverse synth_protocolVersion synth_protocolVersion_inv)", "source_type": "val lemma_synth_protocolVersion_inv: Prims.unit\n -> Lemma (LP.synth_inverse synth_protocolVersion synth_protocolVersion_inv)", "source_definition": "let lemma_synth_protocolVersion_inv () : Lemma\n (LP.synth_inverse synth_protocolVersion synth_protocolVersion_inv) = allow_inversion protocolVersion; ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 90, "start_col": 71, "end_line": 90, "end_col": 106 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let protocolVersion_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let protocolVersion_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_protocolVersion (x:LP.maybe_enum_key protocolVersion_enum) : protocolVersion = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n Unknown_protocolVersion v\n\ninline_for_extraction let synth_protocolVersion_inv (x:protocolVersion) : LP.maybe_enum_key protocolVersion_enum = \n match x with\n | Unknown_protocolVersion y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : protocolVersion = x in\n [@inline_let] let _ : squash(not (Unknown_protocolVersion? x1) ==> LP.list_mem x1 (LP.list_map fst protocolVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key protocolVersion_enum)\n\nlet lemma_synth_protocolVersion_inv' () : Lemma\n (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion)\n= LP.forall_maybe_enum_key protocolVersion_enum (fun x -> synth_protocolVersion_inv (synth_protocolVersion x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_protocolVersion_inj () : Lemma\n (LP.synth_injective synth_protocolVersion) = \n lemma_synth_protocolVersion_inv' ();\n LP.synth_inverse_synth_injective synth_protocolVersion synth_protocolVersion_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_inverse Parsers.ProtocolVersion.synth_protocolVersion\n Parsers.ProtocolVersion.synth_protocolVersion_inv)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.allow_inversion", "Parsers.ProtocolVersion.protocolVersion", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_inverse", "LowParse.Spec.Enum.maybe_enum_key", "FStar.UInt16.t", "Parsers.ProtocolVersion.protocolVersion_enum", "Parsers.ProtocolVersion.synth_protocolVersion", "Parsers.ProtocolVersion.synth_protocolVersion_inv", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_synth_protocolVersion_inv: Prims.unit\n -> Lemma (LP.synth_inverse synth_protocolVersion synth_protocolVersion_inv)\nlet lemma_synth_protocolVersion_inv ()\n : Lemma (LP.synth_inverse synth_protocolVersion synth_protocolVersion_inv) =", "completed_definiton": "allow_inversion protocolVersion;\n()", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.protocolVersion_lserializer", "original_source_type": "val protocolVersion_lserializer: LL.serializer32 protocolVersion_serializer", "source_type": "val protocolVersion_lserializer: LL.serializer32 protocolVersion_serializer", "source_definition": "let protocolVersion_lserializer = LL.serializer32_of_leaf_writer_strong_constant_size protocolVersion_writer 2ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 150, "start_col": 34, "end_line": 150, "end_col": 115 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let protocolVersion_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let protocolVersion_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_protocolVersion (x:LP.maybe_enum_key protocolVersion_enum) : protocolVersion = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n Unknown_protocolVersion v\n\ninline_for_extraction let synth_protocolVersion_inv (x:protocolVersion) : LP.maybe_enum_key protocolVersion_enum = \n match x with\n | Unknown_protocolVersion y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : protocolVersion = x in\n [@inline_let] let _ : squash(not (Unknown_protocolVersion? x1) ==> LP.list_mem x1 (LP.list_map fst protocolVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key protocolVersion_enum)\n\nlet lemma_synth_protocolVersion_inv' () : Lemma\n (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion)\n= LP.forall_maybe_enum_key protocolVersion_enum (fun x -> synth_protocolVersion_inv (synth_protocolVersion x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_protocolVersion_inj () : Lemma\n (LP.synth_injective synth_protocolVersion) = \n lemma_synth_protocolVersion_inv' ();\n LP.synth_inverse_synth_injective synth_protocolVersion synth_protocolVersion_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_protocolVersion_inv () : Lemma\n (LP.synth_inverse synth_protocolVersion synth_protocolVersion_inv) = allow_inversion protocolVersion; ()\n\n#pop-options\nnoextract let parse_maybe_protocolVersion_key : LP.parser _ (LP.maybe_enum_key protocolVersion_enum) =\n LP.parse_maybe_enum_key protocolVersion_repr_parser protocolVersion_enum\n\nnoextract let serialize_maybe_protocolVersion_key : LP.serializer parse_maybe_protocolVersion_key =\n LP.serialize_maybe_enum_key protocolVersion_repr_parser protocolVersion_repr_serializer protocolVersion_enum\n\nnoextract let protocolVersion_parser : LP.parser _ protocolVersion =\n lemma_synth_protocolVersion_inj ();\n parse_maybe_protocolVersion_key `LP.parse_synth` synth_protocolVersion\n\nnoextract let protocolVersion_serializer : LP.serializer protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LP.serialize_synth _ synth_protocolVersion serialize_maybe_protocolVersion_key synth_protocolVersion_inv ()\n\nlet protocolVersion_bytesize (x:protocolVersion) : GTot nat = Seq.length (protocolVersion_serializer x)\n\nlet protocolVersion_bytesize_eq x = ()\n\nlet parse32_maybe_protocolVersion_key : LS.parser32 parse_maybe_protocolVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac protocolVersion_repr_parser32 protocolVersion_enum)\n\nlet protocolVersion_parser32 : LS.parser32 protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n LS.parse32_synth _ synth_protocolVersion (fun x->synth_protocolVersion x) parse32_maybe_protocolVersion_key ()\n\nlet serialize32_maybe_protocolVersion_key : LS.serializer32 serialize_maybe_protocolVersion_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n protocolVersion_repr_serializer32 protocolVersion_enum)\n\nlet protocolVersion_serializer32 : LS.serializer32 protocolVersion_serializer =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LS.serialize32_synth _ synth_protocolVersion _ serialize32_maybe_protocolVersion_key synth_protocolVersion_inv (fun x->synth_protocolVersion_inv x) ()\n\nlet protocolVersion_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond protocolVersion_serializer 2ul) in\n LSZ.size32_constant protocolVersion_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_protocolVersion_key : LL.leaf_reader parse_maybe_protocolVersion_key =\n LL.mk_read_maybe_enum_key protocolVersion_repr_reader protocolVersion_enum\n\nlet protocolVersion_reader =\n [@inline_let] let _ = lemma_synth_protocolVersion_inj () in\n LL.read_synth' parse_maybe_protocolVersion_key synth_protocolVersion read_maybe_protocolVersion_key ()\n\ninline_for_extraction let write_maybe_protocolVersion_key : LL.leaf_writer_strong serialize_maybe_protocolVersion_key =\n LL.write_maybe_enum_key protocolVersion_repr_writer protocolVersion_enum (_ by (LP.enum_repr_of_key_tac protocolVersion_enum))\n\ninline_for_extraction let lserialize_maybe_protocolVersion_key : LL.serializer32 serialize_maybe_protocolVersion_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_protocolVersion_key 2ul ()\n\nlet protocolVersion_writer =\n [@inline_let] let _ = lemma_synth_protocolVersion_inj (); lemma_synth_protocolVersion_inv () in\n LL.write_synth write_maybe_protocolVersion_key synth_protocolVersion synth_protocolVersion_inv (fun x -> synth_protocolVersion_inv x) ()", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 Parsers.ProtocolVersion.protocolVersion_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.serializer32_of_leaf_writer_strong_constant_size", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.ProtocolVersion.protocolVersion", "Parsers.ProtocolVersion.protocolVersion_parser", "Parsers.ProtocolVersion.protocolVersion_serializer", "Parsers.ProtocolVersion.protocolVersion_writer", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val protocolVersion_lserializer: LL.serializer32 protocolVersion_serializer\nlet protocolVersion_lserializer =", "completed_definiton": "LL.serializer32_of_leaf_writer_strong_constant_size protocolVersion_writer 2ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.synth_protocolVersion", "original_source_type": "val synth_protocolVersion (x: LP.maybe_enum_key protocolVersion_enum) : protocolVersion", "source_type": "val synth_protocolVersion (x: LP.maybe_enum_key protocolVersion_enum) : protocolVersion", "source_definition": "let synth_protocolVersion (x:LP.maybe_enum_key protocolVersion_enum) : protocolVersion = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n Unknown_protocolVersion v", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 57, "start_col": 2, "end_line": 62, "end_col": 29 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let protocolVersion_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let protocolVersion_repr_writer = LL.write_u16", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: LowParse.Spec.Enum.maybe_enum_key Parsers.ProtocolVersion.protocolVersion_enum\n -> Parsers.ProtocolVersion.protocolVersion", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.maybe_enum_key", "Parsers.ProtocolVersion.protocolVersion", "FStar.UInt16.t", "Parsers.ProtocolVersion.protocolVersion_enum", "LowParse.Spec.Enum.enum_key", "LowParse.Spec.Enum.unknown_enum_repr", "Parsers.ProtocolVersion.Unknown_protocolVersion", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.bool", "LowParse.Spec.Enum.list_mem", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.snd", "Parsers.ProtocolVersion.known_protocolVersion_repr" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_protocolVersion (x: LP.maybe_enum_key protocolVersion_enum) : protocolVersion\nlet synth_protocolVersion (x: LP.maybe_enum_key protocolVersion_enum) : protocolVersion =", "completed_definiton": "match x with\n| LP.Known k -> k\n| LP.Unknown y ->\n [@@ inline_let ]let v:U16.t = y in\n [@@ inline_let ]let _ =\n assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) ==\n known_protocolVersion_repr v)\n in\n Unknown_protocolVersion v", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.lemma_synth_protocolVersion_inv'", "original_source_type": "val lemma_synth_protocolVersion_inv': Prims.unit\n -> Lemma (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion)", "source_type": "val lemma_synth_protocolVersion_inv': Prims.unit\n -> Lemma (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion)", "source_definition": "let lemma_synth_protocolVersion_inv' () : Lemma\n (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion)\n= LP.forall_maybe_enum_key protocolVersion_enum (fun x -> synth_protocolVersion_inv (synth_protocolVersion x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 79, "start_col": 2, "end_line": 81, "end_col": 52 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let protocolVersion_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let protocolVersion_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_protocolVersion (x:LP.maybe_enum_key protocolVersion_enum) : protocolVersion = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n Unknown_protocolVersion v\n\ninline_for_extraction let synth_protocolVersion_inv (x:protocolVersion) : LP.maybe_enum_key protocolVersion_enum = \n match x with\n | Unknown_protocolVersion y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : protocolVersion = x in\n [@inline_let] let _ : squash(not (Unknown_protocolVersion? x1) ==> LP.list_mem x1 (LP.list_map fst protocolVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key protocolVersion_enum)\n\nlet lemma_synth_protocolVersion_inv' () : Lemma", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_inverse Parsers.ProtocolVersion.synth_protocolVersion_inv\n Parsers.ProtocolVersion.synth_protocolVersion)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "LowParse.Spec.Enum.forall_maybe_enum_key", "Parsers.ProtocolVersion.protocolVersion", "FStar.UInt16.t", "Parsers.ProtocolVersion.protocolVersion_enum", "LowParse.Spec.Enum.maybe_enum_key", "Prims.eq2", "Parsers.ProtocolVersion.synth_protocolVersion_inv", "Parsers.ProtocolVersion.synth_protocolVersion", "Prims.squash", "Prims.l_imp", "Prims.bool", "LowParse.Spec.Enum.list_mem", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.snd", "LowParse.Spec.Enum.Unknown", "Prims.l_True", "LowParse.Spec.Combinators.synth_inverse", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_synth_protocolVersion_inv': Prims.unit\n -> Lemma (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion)\nlet lemma_synth_protocolVersion_inv' ()\n : Lemma (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion) =", "completed_definiton": "LP.forall_maybe_enum_key protocolVersion_enum\n (fun x -> synth_protocolVersion_inv (synth_protocolVersion x) == x)\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.forall_maybe_enum_key_known_tac ())))\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.forall_maybe_enum_key_unknown_tac ())))", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.synth_protocolVersion_inv", "original_source_type": "val synth_protocolVersion_inv (x: protocolVersion) : LP.maybe_enum_key protocolVersion_enum", "source_type": "val synth_protocolVersion_inv (x: protocolVersion) : LP.maybe_enum_key protocolVersion_enum", "source_definition": "let synth_protocolVersion_inv (x:protocolVersion) : LP.maybe_enum_key protocolVersion_enum = \n match x with\n | Unknown_protocolVersion y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : protocolVersion = x in\n [@inline_let] let _ : squash(not (Unknown_protocolVersion? x1) ==> LP.list_mem x1 (LP.list_map fst protocolVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key protocolVersion_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 65, "start_col": 2, "end_line": 75, "end_col": 53 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let protocolVersion_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let protocolVersion_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_protocolVersion (x:LP.maybe_enum_key protocolVersion_enum) : protocolVersion = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n Unknown_protocolVersion v", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.ProtocolVersion.protocolVersion\n -> LowParse.Spec.Enum.maybe_enum_key Parsers.ProtocolVersion.protocolVersion_enum", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.ProtocolVersion.protocolVersion", "FStar.UInt16.t", "Prims.b2t", "Prims.op_Negation", "Parsers.ProtocolVersion.known_protocolVersion_repr", "LowParse.Spec.Enum.Unknown", "Parsers.ProtocolVersion.protocolVersion_enum", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.bool", "LowParse.Spec.Enum.list_mem", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.snd", "LowParse.Spec.Enum.Known", "LowParse.Spec.Enum.enum_key", "Prims.squash", "Prims.l_imp", "Parsers.ProtocolVersion.uu___is_Unknown_protocolVersion", "FStar.Pervasives.Native.fst", "LowParse.Spec.Enum.maybe_enum_key" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_protocolVersion_inv (x: protocolVersion) : LP.maybe_enum_key protocolVersion_enum\nlet synth_protocolVersion_inv (x: protocolVersion) : LP.maybe_enum_key protocolVersion_enum =", "completed_definiton": "match x with\n| Unknown_protocolVersion y ->\n [@@ inline_let ]let v:U16.t = y in\n [@@ inline_let ]let _ =\n assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) ==\n known_protocolVersion_repr v)\n in\n LP.Unknown v\n| x ->\n [@@ inline_let ]let x1:protocolVersion = x in\n [@@ inline_let ]let _:squash (not (Unknown_protocolVersion? x1) ==>\n LP.list_mem x1 (LP.list_map fst protocolVersion_enum)) =\n FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.synth_maybe_enum_key_inv_unknown_tac x1))\n in\n LP.Known (x1 <: LP.enum_key protocolVersion_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.protocolVersion_bytesize_eqn", "original_source_type": "val protocolVersion_bytesize_eqn (x: protocolVersion) : Lemma (protocolVersion_bytesize x == 2) [SMTPat (protocolVersion_bytesize x)]", "source_type": "val protocolVersion_bytesize_eqn (x: protocolVersion) : Lemma (protocolVersion_bytesize x == 2) [SMTPat (protocolVersion_bytesize x)]", "source_definition": "let protocolVersion_bytesize_eqn x = protocolVersion_bytesize_eq x; assert (FStar.Seq.length (LP.serialize protocolVersion_serializer x) <= 2); assert (2 <= FStar.Seq.length (LP.serialize protocolVersion_serializer x))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 152, "start_col": 37, "end_line": 152, "end_col": 218 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let protocolVersion_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let protocolVersion_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_protocolVersion (x:LP.maybe_enum_key protocolVersion_enum) : protocolVersion = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n Unknown_protocolVersion v\n\ninline_for_extraction let synth_protocolVersion_inv (x:protocolVersion) : LP.maybe_enum_key protocolVersion_enum = \n match x with\n | Unknown_protocolVersion y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : protocolVersion = x in\n [@inline_let] let _ : squash(not (Unknown_protocolVersion? x1) ==> LP.list_mem x1 (LP.list_map fst protocolVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key protocolVersion_enum)\n\nlet lemma_synth_protocolVersion_inv' () : Lemma\n (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion)\n= LP.forall_maybe_enum_key protocolVersion_enum (fun x -> synth_protocolVersion_inv (synth_protocolVersion x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_protocolVersion_inj () : Lemma\n (LP.synth_injective synth_protocolVersion) = \n lemma_synth_protocolVersion_inv' ();\n LP.synth_inverse_synth_injective synth_protocolVersion synth_protocolVersion_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_protocolVersion_inv () : Lemma\n (LP.synth_inverse synth_protocolVersion synth_protocolVersion_inv) = allow_inversion protocolVersion; ()\n\n#pop-options\nnoextract let parse_maybe_protocolVersion_key : LP.parser _ (LP.maybe_enum_key protocolVersion_enum) =\n LP.parse_maybe_enum_key protocolVersion_repr_parser protocolVersion_enum\n\nnoextract let serialize_maybe_protocolVersion_key : LP.serializer parse_maybe_protocolVersion_key =\n LP.serialize_maybe_enum_key protocolVersion_repr_parser protocolVersion_repr_serializer protocolVersion_enum\n\nnoextract let protocolVersion_parser : LP.parser _ protocolVersion =\n lemma_synth_protocolVersion_inj ();\n parse_maybe_protocolVersion_key `LP.parse_synth` synth_protocolVersion\n\nnoextract let protocolVersion_serializer : LP.serializer protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LP.serialize_synth _ synth_protocolVersion serialize_maybe_protocolVersion_key synth_protocolVersion_inv ()\n\nlet protocolVersion_bytesize (x:protocolVersion) : GTot nat = Seq.length (protocolVersion_serializer x)\n\nlet protocolVersion_bytesize_eq x = ()\n\nlet parse32_maybe_protocolVersion_key : LS.parser32 parse_maybe_protocolVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac protocolVersion_repr_parser32 protocolVersion_enum)\n\nlet protocolVersion_parser32 : LS.parser32 protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n LS.parse32_synth _ synth_protocolVersion (fun x->synth_protocolVersion x) parse32_maybe_protocolVersion_key ()\n\nlet serialize32_maybe_protocolVersion_key : LS.serializer32 serialize_maybe_protocolVersion_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n protocolVersion_repr_serializer32 protocolVersion_enum)\n\nlet protocolVersion_serializer32 : LS.serializer32 protocolVersion_serializer =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LS.serialize32_synth _ synth_protocolVersion _ serialize32_maybe_protocolVersion_key synth_protocolVersion_inv (fun x->synth_protocolVersion_inv x) ()\n\nlet protocolVersion_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond protocolVersion_serializer 2ul) in\n LSZ.size32_constant protocolVersion_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_protocolVersion_key : LL.leaf_reader parse_maybe_protocolVersion_key =\n LL.mk_read_maybe_enum_key protocolVersion_repr_reader protocolVersion_enum\n\nlet protocolVersion_reader =\n [@inline_let] let _ = lemma_synth_protocolVersion_inj () in\n LL.read_synth' parse_maybe_protocolVersion_key synth_protocolVersion read_maybe_protocolVersion_key ()\n\ninline_for_extraction let write_maybe_protocolVersion_key : LL.leaf_writer_strong serialize_maybe_protocolVersion_key =\n LL.write_maybe_enum_key protocolVersion_repr_writer protocolVersion_enum (_ by (LP.enum_repr_of_key_tac protocolVersion_enum))\n\ninline_for_extraction let lserialize_maybe_protocolVersion_key : LL.serializer32 serialize_maybe_protocolVersion_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_protocolVersion_key 2ul ()\n\nlet protocolVersion_writer =\n [@inline_let] let _ = lemma_synth_protocolVersion_inj (); lemma_synth_protocolVersion_inv () in\n LL.write_synth write_maybe_protocolVersion_key synth_protocolVersion synth_protocolVersion_inv (fun x -> synth_protocolVersion_inv x) ()\n\nlet protocolVersion_lserializer = LL.serializer32_of_leaf_writer_strong_constant_size protocolVersion_writer 2ul ()", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.ProtocolVersion.protocolVersion\n -> FStar.Pervasives.Lemma (ensures Parsers.ProtocolVersion.protocolVersion_bytesize x == 2)\n [SMTPat (Parsers.ProtocolVersion.protocolVersion_bytesize x)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.ProtocolVersion.protocolVersion", "Prims._assert", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "Parsers.ProtocolVersion.protocolVersion_parser_kind", "Parsers.ProtocolVersion.protocolVersion_parser", "Parsers.ProtocolVersion.protocolVersion_serializer", "Prims.unit", "Parsers.ProtocolVersion.protocolVersion_bytesize_eq" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val protocolVersion_bytesize_eqn (x: protocolVersion) : Lemma (protocolVersion_bytesize x == 2) [SMTPat (protocolVersion_bytesize x)]\nlet protocolVersion_bytesize_eqn x =", "completed_definiton": "protocolVersion_bytesize_eq x;\nassert (FStar.Seq.length (LP.serialize protocolVersion_serializer x) <= 2);\nassert (2 <= FStar.Seq.length (LP.serialize protocolVersion_serializer x))", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.serialize32_maybe_protocolVersion_key", "original_source_type": "val serialize32_maybe_protocolVersion_key:LS.serializer32 serialize_maybe_protocolVersion_key", "source_type": "val serialize32_maybe_protocolVersion_key:LS.serializer32 serialize_maybe_protocolVersion_key", "source_definition": "let serialize32_maybe_protocolVersion_key : LS.serializer32 serialize_maybe_protocolVersion_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n protocolVersion_repr_serializer32 protocolVersion_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 120, "start_col": 2, "end_line": 121, "end_col": 59 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let protocolVersion_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let protocolVersion_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_protocolVersion (x:LP.maybe_enum_key protocolVersion_enum) : protocolVersion = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n Unknown_protocolVersion v\n\ninline_for_extraction let synth_protocolVersion_inv (x:protocolVersion) : LP.maybe_enum_key protocolVersion_enum = \n match x with\n | Unknown_protocolVersion y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : protocolVersion = x in\n [@inline_let] let _ : squash(not (Unknown_protocolVersion? x1) ==> LP.list_mem x1 (LP.list_map fst protocolVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key protocolVersion_enum)\n\nlet lemma_synth_protocolVersion_inv' () : Lemma\n (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion)\n= LP.forall_maybe_enum_key protocolVersion_enum (fun x -> synth_protocolVersion_inv (synth_protocolVersion x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_protocolVersion_inj () : Lemma\n (LP.synth_injective synth_protocolVersion) = \n lemma_synth_protocolVersion_inv' ();\n LP.synth_inverse_synth_injective synth_protocolVersion synth_protocolVersion_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_protocolVersion_inv () : Lemma\n (LP.synth_inverse synth_protocolVersion synth_protocolVersion_inv) = allow_inversion protocolVersion; ()\n\n#pop-options\nnoextract let parse_maybe_protocolVersion_key : LP.parser _ (LP.maybe_enum_key protocolVersion_enum) =\n LP.parse_maybe_enum_key protocolVersion_repr_parser protocolVersion_enum\n\nnoextract let serialize_maybe_protocolVersion_key : LP.serializer parse_maybe_protocolVersion_key =\n LP.serialize_maybe_enum_key protocolVersion_repr_parser protocolVersion_repr_serializer protocolVersion_enum\n\nnoextract let protocolVersion_parser : LP.parser _ protocolVersion =\n lemma_synth_protocolVersion_inj ();\n parse_maybe_protocolVersion_key `LP.parse_synth` synth_protocolVersion\n\nnoextract let protocolVersion_serializer : LP.serializer protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LP.serialize_synth _ synth_protocolVersion serialize_maybe_protocolVersion_key synth_protocolVersion_inv ()\n\nlet protocolVersion_bytesize (x:protocolVersion) : GTot nat = Seq.length (protocolVersion_serializer x)\n\nlet protocolVersion_bytesize_eq x = ()\n\nlet parse32_maybe_protocolVersion_key : LS.parser32 parse_maybe_protocolVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac protocolVersion_repr_parser32 protocolVersion_enum)\n\nlet protocolVersion_parser32 : LS.parser32 protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n LS.parse32_synth _ synth_protocolVersion (fun x->synth_protocolVersion x) parse32_maybe_protocolVersion_key ()", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.ProtocolVersion.serialize_maybe_protocolVersion_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Enum.serialize32_maybe_enum_key_gen", "LowParse.Spec.Int.parse_u16_kind", "Parsers.ProtocolVersion.protocolVersion", "FStar.UInt16.t", "LowParse.Spec.Int.parse_u16", "LowParse.Spec.Int.serialize_u16", "Parsers.ProtocolVersion.protocolVersion_repr_serializer32", "Parsers.ProtocolVersion.protocolVersion_enum", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.ProtocolVersion.parse_maybe_protocolVersion_key", "Parsers.ProtocolVersion.serialize_maybe_protocolVersion_key", "LowParse.Spec.Enum.enum_repr_of_key_cons'", "LowParse.Spec.Enum.enum_tail'", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize32_maybe_protocolVersion_key:LS.serializer32 serialize_maybe_protocolVersion_key\nlet serialize32_maybe_protocolVersion_key:LS.serializer32 serialize_maybe_protocolVersion_key =", "completed_definiton": "FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac protocolVersion_repr_serializer32\n protocolVersion_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.ProtocolVersion.fst", "name": "Parsers.ProtocolVersion.parse32_maybe_protocolVersion_key", "original_source_type": "val parse32_maybe_protocolVersion_key:LS.parser32 parse_maybe_protocolVersion_key", "source_type": "val parse32_maybe_protocolVersion_key:LS.parser32 parse_maybe_protocolVersion_key", "source_definition": "let parse32_maybe_protocolVersion_key : LS.parser32 parse_maybe_protocolVersion_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac protocolVersion_repr_parser32 protocolVersion_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.ProtocolVersion.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 113, "start_col": 2, "end_line": 113, "end_col": 114 }, "file_context": "module Parsers.ProtocolVersion\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let protocolVersion_enum : LP.enum protocolVersion U16.t =\n [@inline_let] let e = [\n SSL_3p0, 768us;\n TLS_1p0, 769us;\n TLS_1p1, 770us;\n TLS_1p2, 771us;\n TLS_1p3, 772us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let protocolVersion_repr_parser = LPI.parse_u16\n\nnoextract let protocolVersion_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let protocolVersion_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let protocolVersion_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let protocolVersion_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let protocolVersion_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let protocolVersion_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_protocolVersion (x:LP.maybe_enum_key protocolVersion_enum) : protocolVersion = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n Unknown_protocolVersion v\n\ninline_for_extraction let synth_protocolVersion_inv (x:protocolVersion) : LP.maybe_enum_key protocolVersion_enum = \n match x with\n | Unknown_protocolVersion y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd protocolVersion_enum) == known_protocolVersion_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : protocolVersion = x in\n [@inline_let] let _ : squash(not (Unknown_protocolVersion? x1) ==> LP.list_mem x1 (LP.list_map fst protocolVersion_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key protocolVersion_enum)\n\nlet lemma_synth_protocolVersion_inv' () : Lemma\n (LP.synth_inverse synth_protocolVersion_inv synth_protocolVersion)\n= LP.forall_maybe_enum_key protocolVersion_enum (fun x -> synth_protocolVersion_inv (synth_protocolVersion x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_protocolVersion_inj () : Lemma\n (LP.synth_injective synth_protocolVersion) = \n lemma_synth_protocolVersion_inv' ();\n LP.synth_inverse_synth_injective synth_protocolVersion synth_protocolVersion_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_protocolVersion_inv () : Lemma\n (LP.synth_inverse synth_protocolVersion synth_protocolVersion_inv) = allow_inversion protocolVersion; ()\n\n#pop-options\nnoextract let parse_maybe_protocolVersion_key : LP.parser _ (LP.maybe_enum_key protocolVersion_enum) =\n LP.parse_maybe_enum_key protocolVersion_repr_parser protocolVersion_enum\n\nnoextract let serialize_maybe_protocolVersion_key : LP.serializer parse_maybe_protocolVersion_key =\n LP.serialize_maybe_enum_key protocolVersion_repr_parser protocolVersion_repr_serializer protocolVersion_enum\n\nnoextract let protocolVersion_parser : LP.parser _ protocolVersion =\n lemma_synth_protocolVersion_inj ();\n parse_maybe_protocolVersion_key `LP.parse_synth` synth_protocolVersion\n\nnoextract let protocolVersion_serializer : LP.serializer protocolVersion_parser =\n lemma_synth_protocolVersion_inj ();\n lemma_synth_protocolVersion_inv ();\n LP.serialize_synth _ synth_protocolVersion serialize_maybe_protocolVersion_key synth_protocolVersion_inv ()\n\nlet protocolVersion_bytesize (x:protocolVersion) : GTot nat = Seq.length (protocolVersion_serializer x)\n\nlet protocolVersion_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.ProtocolVersion.fst", "checked_file": "Parsers.ProtocolVersion.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.ProtocolVersion.parse_maybe_protocolVersion_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Enum.parse32_maybe_enum_key_gen", "LowParse.Spec.Int.parse_u16_kind", "Parsers.ProtocolVersion.protocolVersion", "FStar.UInt16.t", "LowParse.Spec.Int.parse_u16", "Parsers.ProtocolVersion.protocolVersion_repr_parser32", "Parsers.ProtocolVersion.protocolVersion_enum", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.ProtocolVersion.parse_maybe_protocolVersion_key", "LowParse.Spec.Enum.maybe_enum_key_of_repr'_t_cons'", "LowParse.Spec.Enum.enum_tail'", "LowParse.Spec.Enum.maybe_enum_key_of_repr'_t_cons_nil'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse32_maybe_protocolVersion_key:LS.parser32 parse_maybe_protocolVersion_key\nlet parse32_maybe_protocolVersion_key:LS.parser32 parse_maybe_protocolVersion_key =", "completed_definiton": "FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac protocolVersion_repr_parser32\n protocolVersion_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_bytesize", "original_source_type": "val ticketContents_bytesize (x:ticketContents) : GTot nat", "source_type": "val ticketContents_bytesize (x:ticketContents) : GTot nat", "source_definition": "let ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 141, "start_col": 60, "end_line": 141, "end_col": 100 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketContents.ticketContents -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketContents.ticketContents", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.TicketContents.ticketContents_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_bytesize (x:ticketContents) : GTot nat\nlet ticketContents_bytesize (x: ticketContents) : GTot nat =", "completed_definiton": "Seq.length (ticketContents_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_gaccessor_ticket13", "original_source_type": "val ticketContents_gaccessor_ticket13 : LL.gaccessor ticketContents_parser ticketContents13_parser ticketContents_clens_ticket13", "source_type": "val ticketContents_gaccessor_ticket13 : LL.gaccessor ticketContents_parser ticketContents13_parser ticketContents_clens_ticket13", "source_definition": "let ticketContents_gaccessor_ticket13 =\n LL.gaccessor_ext\n ticketContents_gaccessor'_ticket13\n ticketContents_clens_ticket13\n ticketContents_clens_eq_ticket13", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 273, "start_col": 2, "end_line": 276, "end_col": 36 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))\n\nlet ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_size32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LSZ.size32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_size32 serialize_ticketContents_cases size32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_validator =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.validate_sum ticketContents_sum ticketVersion_repr_validator ticketVersion_repr_reader parse_ticketContents_cases validate_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet ticketContents_jumper =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.jump_sum ticketContents_sum ticketVersion_repr_jumper ticketVersion_repr_reader parse_ticketContents_cases jump_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet lemma_valid_ticketContents_valid_ticketVersion #_ #_ s pos h =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.valid_sum_elim_tag h ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases s pos;\n lemma_synth_ticketVersion_inj ();\n LL.valid_synth h parse_ticketVersion_key synth_ticketVersion s pos\n\nlet ticketContents_gaccessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.gaccessor_ext\n (LL.gaccessor_compose\n (LL.gaccessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.gaccessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_accessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.accessor_ext\n (LL.accessor_compose\n (LL.accessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.accessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n ()\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_bytesize_eqn_ticket12 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket12 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket12 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents12_bytesize_eq (x))\n\nlet ticketContents_bytesize_eqn_ticket13 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket13 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket13 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents13_bytesize_eq (x))\n\nnoextract let ticketContents_clens'_ticket12 : LL.clens ticketContents ticketContents12 = LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket12)\n\nlet ticketContents_gaccessor'_ticket12 : LL.gaccessor ticketContents_parser ticketContents12_parser ticketContents_clens'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.gaccessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)\n\ninline_for_extraction\nlet ticketContents_accessor'_ticket12 : LL.accessor ticketContents_gaccessor'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.accessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_jumper\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)\n\nlet ticketContents_clens_eq_ticket12 : squash (LL.clens_eq ticketContents_clens'_ticket12 ticketContents_clens_ticket12) =\n (_ by (LL.sum_accessor_ext (`ticketContents)))\n\nlet ticketContents_gaccessor_ticket12 =\n LL.gaccessor_ext\n ticketContents_gaccessor'_ticket12\n ticketContents_clens_ticket12\n ticketContents_clens_eq_ticket12\n\nlet ticketContents_accessor_ticket12 =\n LL.accessor_ext\n ticketContents_accessor'_ticket12\n ticketContents_clens_ticket12\n ticketContents_clens_eq_ticket12\n\nnoextract let ticketContents_clens'_ticket13 : LL.clens ticketContents ticketContents13 = LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket13)\n\nlet ticketContents_gaccessor'_ticket13 : LL.gaccessor ticketContents_parser ticketContents13_parser ticketContents_clens'_ticket13 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.gaccessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket13)\n\ninline_for_extraction\nlet ticketContents_accessor'_ticket13 : LL.accessor ticketContents_gaccessor'_ticket13 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.accessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_jumper\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket13)\n\nlet ticketContents_clens_eq_ticket13 : squash (LL.clens_eq ticketContents_clens'_ticket13 ticketContents_clens_ticket13) =\n (_ by (LL.sum_accessor_ext (`ticketContents)))", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.TicketContents.ticketContents_parser\n Parsers.TicketContents13.ticketContents13_parser\n Parsers.TicketContents.ticketContents_clens_ticket13", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.gaccessor_ext", "Parsers.TicketContents.ticketContents_parser_kind", "Parsers.TicketContents.ticketContents", "Parsers.TicketContents.ticketContents_parser", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13_parser", "Parsers.TicketContents.ticketContents_clens'_ticket13", "Parsers.TicketContents.ticketContents_gaccessor'_ticket13", "Parsers.TicketContents.ticketContents_clens_ticket13", "Parsers.TicketContents.ticketContents_clens_eq_ticket13" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_gaccessor_ticket13 : LL.gaccessor ticketContents_parser ticketContents13_parser ticketContents_clens_ticket13\nlet ticketContents_gaccessor_ticket13 =", "completed_definiton": "LL.gaccessor_ext ticketContents_gaccessor'_ticket13\n ticketContents_clens_ticket13\n ticketContents_clens_eq_ticket13", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_accessor_ticket12", "original_source_type": "val ticketContents_accessor_ticket12 : LL.accessor ticketContents_gaccessor_ticket12", "source_type": "val ticketContents_accessor_ticket12 : LL.accessor ticketContents_gaccessor_ticket12", "source_definition": "let ticketContents_accessor_ticket12 =\n LL.accessor_ext\n ticketContents_accessor'_ticket12\n ticketContents_clens_ticket12\n ticketContents_clens_eq_ticket12", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 243, "start_col": 2, "end_line": 246, "end_col": 36 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))\n\nlet ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_size32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LSZ.size32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_size32 serialize_ticketContents_cases size32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_validator =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.validate_sum ticketContents_sum ticketVersion_repr_validator ticketVersion_repr_reader parse_ticketContents_cases validate_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet ticketContents_jumper =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.jump_sum ticketContents_sum ticketVersion_repr_jumper ticketVersion_repr_reader parse_ticketContents_cases jump_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet lemma_valid_ticketContents_valid_ticketVersion #_ #_ s pos h =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.valid_sum_elim_tag h ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases s pos;\n lemma_synth_ticketVersion_inj ();\n LL.valid_synth h parse_ticketVersion_key synth_ticketVersion s pos\n\nlet ticketContents_gaccessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.gaccessor_ext\n (LL.gaccessor_compose\n (LL.gaccessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.gaccessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_accessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.accessor_ext\n (LL.accessor_compose\n (LL.accessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.accessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n ()\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_bytesize_eqn_ticket12 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket12 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket12 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents12_bytesize_eq (x))\n\nlet ticketContents_bytesize_eqn_ticket13 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket13 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket13 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents13_bytesize_eq (x))\n\nnoextract let ticketContents_clens'_ticket12 : LL.clens ticketContents ticketContents12 = LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket12)\n\nlet ticketContents_gaccessor'_ticket12 : LL.gaccessor ticketContents_parser ticketContents12_parser ticketContents_clens'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.gaccessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)\n\ninline_for_extraction\nlet ticketContents_accessor'_ticket12 : LL.accessor ticketContents_gaccessor'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.accessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_jumper\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)\n\nlet ticketContents_clens_eq_ticket12 : squash (LL.clens_eq ticketContents_clens'_ticket12 ticketContents_clens_ticket12) =\n (_ by (LL.sum_accessor_ext (`ticketContents)))\n\nlet ticketContents_gaccessor_ticket12 =\n LL.gaccessor_ext\n ticketContents_gaccessor'_ticket12\n ticketContents_clens_ticket12\n ticketContents_clens_eq_ticket12", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents.ticketContents_gaccessor_ticket12", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.accessor_ext", "Parsers.TicketContents.ticketContents_parser_kind", "Parsers.TicketContents.ticketContents", "Parsers.TicketContents.ticketContents_parser", "Parsers.TicketContents12.ticketContents12_parser_kind", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.ticketContents12_parser", "Parsers.TicketContents.ticketContents_clens'_ticket12", "Parsers.TicketContents.ticketContents_gaccessor'_ticket12", "Parsers.TicketContents.ticketContents_accessor'_ticket12", "Parsers.TicketContents.ticketContents_clens_ticket12", "Parsers.TicketContents.ticketContents_clens_eq_ticket12" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_accessor_ticket12 : LL.accessor ticketContents_gaccessor_ticket12\nlet ticketContents_accessor_ticket12 =", "completed_definiton": "LL.accessor_ext ticketContents_accessor'_ticket12\n ticketContents_clens_ticket12\n ticketContents_clens_eq_ticket12", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_clens'_ticket13", "original_source_type": "val ticketContents_clens'_ticket13:LL.clens ticketContents ticketContents13", "source_type": "val ticketContents_clens'_ticket13:LL.clens ticketContents ticketContents13", "source_definition": "let ticketContents_clens'_ticket13 : LL.clens ticketContents ticketContents13 = LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket13)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 248, "start_col": 90, "end_line": 248, "end_col": 166 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))\n\nlet ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_size32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LSZ.size32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_size32 serialize_ticketContents_cases size32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_validator =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.validate_sum ticketContents_sum ticketVersion_repr_validator ticketVersion_repr_reader parse_ticketContents_cases validate_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet ticketContents_jumper =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.jump_sum ticketContents_sum ticketVersion_repr_jumper ticketVersion_repr_reader parse_ticketContents_cases jump_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet lemma_valid_ticketContents_valid_ticketVersion #_ #_ s pos h =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.valid_sum_elim_tag h ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases s pos;\n lemma_synth_ticketVersion_inj ();\n LL.valid_synth h parse_ticketVersion_key synth_ticketVersion s pos\n\nlet ticketContents_gaccessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.gaccessor_ext\n (LL.gaccessor_compose\n (LL.gaccessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.gaccessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_accessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.accessor_ext\n (LL.accessor_compose\n (LL.accessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.accessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n ()\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_bytesize_eqn_ticket12 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket12 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket12 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents12_bytesize_eq (x))\n\nlet ticketContents_bytesize_eqn_ticket13 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket13 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket13 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents13_bytesize_eq (x))\n\nnoextract let ticketContents_clens'_ticket12 : LL.clens ticketContents ticketContents12 = LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket12)\n\nlet ticketContents_gaccessor'_ticket12 : LL.gaccessor ticketContents_parser ticketContents12_parser ticketContents_clens'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.gaccessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)\n\ninline_for_extraction\nlet ticketContents_accessor'_ticket12 : LL.accessor ticketContents_gaccessor'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.accessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_jumper\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)\n\nlet ticketContents_clens_eq_ticket12 : squash (LL.clens_eq ticketContents_clens'_ticket12 ticketContents_clens_ticket12) =\n (_ by (LL.sum_accessor_ext (`ticketContents)))\n\nlet ticketContents_gaccessor_ticket12 =\n LL.gaccessor_ext\n ticketContents_gaccessor'_ticket12\n ticketContents_clens_ticket12\n ticketContents_clens_eq_ticket12\n\nlet ticketContents_accessor_ticket12 =\n LL.accessor_ext\n ticketContents_accessor'_ticket12\n ticketContents_clens_ticket12\n ticketContents_clens_eq_ticket12", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.TicketContents.ticketContents\n Parsers.TicketContents13.ticketContents13", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Sum.clens_sum_payload", "Parsers.TicketContents.ticketContents_sum", "Parsers.TicketContents.ticketVersion_as_enum_key", "Parsers.TicketVersion.Ticket13" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_clens'_ticket13:LL.clens ticketContents ticketContents13\nlet ticketContents_clens'_ticket13:LL.clens ticketContents ticketContents13 =", "completed_definiton": "LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket13)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_clens'_ticket12", "original_source_type": "val ticketContents_clens'_ticket12:LL.clens ticketContents ticketContents12", "source_type": "val ticketContents_clens'_ticket12:LL.clens ticketContents ticketContents12", "source_definition": "let ticketContents_clens'_ticket12 : LL.clens ticketContents ticketContents12 = LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket12)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 212, "start_col": 90, "end_line": 212, "end_col": 166 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))\n\nlet ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_size32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LSZ.size32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_size32 serialize_ticketContents_cases size32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_validator =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.validate_sum ticketContents_sum ticketVersion_repr_validator ticketVersion_repr_reader parse_ticketContents_cases validate_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet ticketContents_jumper =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.jump_sum ticketContents_sum ticketVersion_repr_jumper ticketVersion_repr_reader parse_ticketContents_cases jump_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet lemma_valid_ticketContents_valid_ticketVersion #_ #_ s pos h =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.valid_sum_elim_tag h ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases s pos;\n lemma_synth_ticketVersion_inj ();\n LL.valid_synth h parse_ticketVersion_key synth_ticketVersion s pos\n\nlet ticketContents_gaccessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.gaccessor_ext\n (LL.gaccessor_compose\n (LL.gaccessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.gaccessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_accessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.accessor_ext\n (LL.accessor_compose\n (LL.accessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.accessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n ()\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_bytesize_eqn_ticket12 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket12 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket12 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents12_bytesize_eq (x))\n\nlet ticketContents_bytesize_eqn_ticket13 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket13 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket13 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents13_bytesize_eq (x))", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.TicketContents.ticketContents\n Parsers.TicketContents12.ticketContents12", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Sum.clens_sum_payload", "Parsers.TicketContents.ticketContents_sum", "Parsers.TicketContents.ticketVersion_as_enum_key", "Parsers.TicketVersion.Ticket12" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_clens'_ticket12:LL.clens ticketContents ticketContents12\nlet ticketContents_clens'_ticket12:LL.clens ticketContents ticketContents12 =", "completed_definiton": "LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket12)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_accessor_ticket13", "original_source_type": "val ticketContents_accessor_ticket13 : LL.accessor ticketContents_gaccessor_ticket13", "source_type": "val ticketContents_accessor_ticket13 : LL.accessor ticketContents_gaccessor_ticket13", "source_definition": "let ticketContents_accessor_ticket13 =\n LL.accessor_ext\n ticketContents_accessor'_ticket13\n ticketContents_clens_ticket13\n ticketContents_clens_eq_ticket13", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 279, "start_col": 2, "end_line": 282, "end_col": 36 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))\n\nlet ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_size32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LSZ.size32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_size32 serialize_ticketContents_cases size32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_validator =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.validate_sum ticketContents_sum ticketVersion_repr_validator ticketVersion_repr_reader parse_ticketContents_cases validate_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet ticketContents_jumper =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.jump_sum ticketContents_sum ticketVersion_repr_jumper ticketVersion_repr_reader parse_ticketContents_cases jump_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet lemma_valid_ticketContents_valid_ticketVersion #_ #_ s pos h =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.valid_sum_elim_tag h ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases s pos;\n lemma_synth_ticketVersion_inj ();\n LL.valid_synth h parse_ticketVersion_key synth_ticketVersion s pos\n\nlet ticketContents_gaccessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.gaccessor_ext\n (LL.gaccessor_compose\n (LL.gaccessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.gaccessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_accessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.accessor_ext\n (LL.accessor_compose\n (LL.accessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.accessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n ()\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_bytesize_eqn_ticket12 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket12 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket12 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents12_bytesize_eq (x))\n\nlet ticketContents_bytesize_eqn_ticket13 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket13 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket13 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents13_bytesize_eq (x))\n\nnoextract let ticketContents_clens'_ticket12 : LL.clens ticketContents ticketContents12 = LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket12)\n\nlet ticketContents_gaccessor'_ticket12 : LL.gaccessor ticketContents_parser ticketContents12_parser ticketContents_clens'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.gaccessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)\n\ninline_for_extraction\nlet ticketContents_accessor'_ticket12 : LL.accessor ticketContents_gaccessor'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.accessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_jumper\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)\n\nlet ticketContents_clens_eq_ticket12 : squash (LL.clens_eq ticketContents_clens'_ticket12 ticketContents_clens_ticket12) =\n (_ by (LL.sum_accessor_ext (`ticketContents)))\n\nlet ticketContents_gaccessor_ticket12 =\n LL.gaccessor_ext\n ticketContents_gaccessor'_ticket12\n ticketContents_clens_ticket12\n ticketContents_clens_eq_ticket12\n\nlet ticketContents_accessor_ticket12 =\n LL.accessor_ext\n ticketContents_accessor'_ticket12\n ticketContents_clens_ticket12\n ticketContents_clens_eq_ticket12\n\nnoextract let ticketContents_clens'_ticket13 : LL.clens ticketContents ticketContents13 = LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket13)\n\nlet ticketContents_gaccessor'_ticket13 : LL.gaccessor ticketContents_parser ticketContents13_parser ticketContents_clens'_ticket13 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.gaccessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket13)\n\ninline_for_extraction\nlet ticketContents_accessor'_ticket13 : LL.accessor ticketContents_gaccessor'_ticket13 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.accessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_jumper\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket13)\n\nlet ticketContents_clens_eq_ticket13 : squash (LL.clens_eq ticketContents_clens'_ticket13 ticketContents_clens_ticket13) =\n (_ by (LL.sum_accessor_ext (`ticketContents)))\n\nlet ticketContents_gaccessor_ticket13 =\n LL.gaccessor_ext\n ticketContents_gaccessor'_ticket13\n ticketContents_clens_ticket13\n ticketContents_clens_eq_ticket13", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents.ticketContents_gaccessor_ticket13", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.accessor_ext", "Parsers.TicketContents.ticketContents_parser_kind", "Parsers.TicketContents.ticketContents", "Parsers.TicketContents.ticketContents_parser", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13_parser", "Parsers.TicketContents.ticketContents_clens'_ticket13", "Parsers.TicketContents.ticketContents_gaccessor'_ticket13", "Parsers.TicketContents.ticketContents_accessor'_ticket13", "Parsers.TicketContents.ticketContents_clens_ticket13", "Parsers.TicketContents.ticketContents_clens_eq_ticket13" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_accessor_ticket13 : LL.accessor ticketContents_gaccessor_ticket13\nlet ticketContents_accessor_ticket13 =", "completed_definiton": "LL.accessor_ext ticketContents_accessor'_ticket13\n ticketContents_clens_ticket13\n ticketContents_clens_eq_ticket13", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_gaccessor_ticket12", "original_source_type": "val ticketContents_gaccessor_ticket12 : LL.gaccessor ticketContents_parser ticketContents12_parser ticketContents_clens_ticket12", "source_type": "val ticketContents_gaccessor_ticket12 : LL.gaccessor ticketContents_parser ticketContents12_parser ticketContents_clens_ticket12", "source_definition": "let ticketContents_gaccessor_ticket12 =\n LL.gaccessor_ext\n ticketContents_gaccessor'_ticket12\n ticketContents_clens_ticket12\n ticketContents_clens_eq_ticket12", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 237, "start_col": 2, "end_line": 240, "end_col": 36 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))\n\nlet ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_size32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LSZ.size32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_size32 serialize_ticketContents_cases size32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_validator =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.validate_sum ticketContents_sum ticketVersion_repr_validator ticketVersion_repr_reader parse_ticketContents_cases validate_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet ticketContents_jumper =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.jump_sum ticketContents_sum ticketVersion_repr_jumper ticketVersion_repr_reader parse_ticketContents_cases jump_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet lemma_valid_ticketContents_valid_ticketVersion #_ #_ s pos h =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.valid_sum_elim_tag h ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases s pos;\n lemma_synth_ticketVersion_inj ();\n LL.valid_synth h parse_ticketVersion_key synth_ticketVersion s pos\n\nlet ticketContents_gaccessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.gaccessor_ext\n (LL.gaccessor_compose\n (LL.gaccessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.gaccessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_accessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.accessor_ext\n (LL.accessor_compose\n (LL.accessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.accessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n ()\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_bytesize_eqn_ticket12 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket12 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket12 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents12_bytesize_eq (x))\n\nlet ticketContents_bytesize_eqn_ticket13 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket13 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket13 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents13_bytesize_eq (x))\n\nnoextract let ticketContents_clens'_ticket12 : LL.clens ticketContents ticketContents12 = LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket12)\n\nlet ticketContents_gaccessor'_ticket12 : LL.gaccessor ticketContents_parser ticketContents12_parser ticketContents_clens'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.gaccessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)\n\ninline_for_extraction\nlet ticketContents_accessor'_ticket12 : LL.accessor ticketContents_gaccessor'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.accessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_jumper\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)\n\nlet ticketContents_clens_eq_ticket12 : squash (LL.clens_eq ticketContents_clens'_ticket12 ticketContents_clens_ticket12) =\n (_ by (LL.sum_accessor_ext (`ticketContents)))", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.TicketContents.ticketContents_parser\n Parsers.TicketContents12.ticketContents12_parser\n Parsers.TicketContents.ticketContents_clens_ticket12", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.gaccessor_ext", "Parsers.TicketContents.ticketContents_parser_kind", "Parsers.TicketContents.ticketContents", "Parsers.TicketContents.ticketContents_parser", "Parsers.TicketContents12.ticketContents12_parser_kind", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.ticketContents12_parser", "Parsers.TicketContents.ticketContents_clens'_ticket12", "Parsers.TicketContents.ticketContents_gaccessor'_ticket12", "Parsers.TicketContents.ticketContents_clens_ticket12", "Parsers.TicketContents.ticketContents_clens_eq_ticket12" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_gaccessor_ticket12 : LL.gaccessor ticketContents_parser ticketContents12_parser ticketContents_clens_ticket12\nlet ticketContents_gaccessor_ticket12 =", "completed_definiton": "LL.gaccessor_ext ticketContents_gaccessor'_ticket12\n ticketContents_clens_ticket12\n ticketContents_clens_eq_ticket12", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_sum", "original_source_type": "", "source_type": "val ticketContents_sum : LowParse.Spec.Sum.sum", "source_definition": "let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 79, "start_col": 47, "end_line": 82, "end_col": 48 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Sum.sum", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Sum.make_sum'", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_enum", "Parsers.TicketContents.ticketContents", "Parsers.TicketContents.key_of_ticketContents", "Parsers.TicketContents.ticketContents_case_of_ticketVersion", "Parsers.TicketContents.synth_ticketContents_cases", "Parsers.TicketContents.synth_ticketContents_cases_recip", "Prims.squash", "LowParse.Spec.Sum.synth_case_recip_synth_case_post", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents13.ticketContents13", "Prims.eq2", "LowParse.Spec.Sum.synth_case_recip'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let ticketContents_sum =", "completed_definiton": "LP.make_sum' ticketVersion_enum\n key_of_ticketContents\n ticketContents_case_of_ticketVersion\n synth_ticketContents_cases\n synth_ticketContents_cases_recip\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.make_sum_synth_case_recip_synth_case_tac ())))\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.synth_case_synth_case_recip_tac ())))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.key_of_ticketContents", "original_source_type": "val key_of_ticketContents (x: ticketContents) : LP.enum_key ticketVersion_enum", "source_type": "val key_of_ticketContents (x: ticketContents) : LP.enum_key ticketVersion_enum", "source_definition": "let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 33, "start_col": 2, "end_line": 35, "end_col": 54 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketContents.ticketContents\n -> LowParse.Spec.Enum.enum_key Parsers.TicketVersion.ticketVersion_enum", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketContents.ticketContents", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents.ticketVersion_as_enum_key", "Parsers.TicketVersion.Ticket12", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketVersion.Ticket13", "LowParse.Spec.Enum.enum_key", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_enum" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val key_of_ticketContents (x: ticketContents) : LP.enum_key ticketVersion_enum\nlet key_of_ticketContents (x: ticketContents) : LP.enum_key ticketVersion_enum =", "completed_definiton": "match x with\n| T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n| T_ticket13 _ -> ticketVersion_as_enum_key Ticket13", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.synth_ticketContents_cases_recip_pre", "original_source_type": "val synth_ticketContents_cases_recip_pre\n (k: LP.enum_key ticketVersion_enum)\n (x: LP.refine_with_tag key_of_ticketContents k)\n : GTot bool", "source_type": "val synth_ticketContents_cases_recip_pre\n (k: LP.enum_key ticketVersion_enum)\n (x: LP.refine_with_tag key_of_ticketContents k)\n : GTot bool", "source_definition": "let synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 63, "start_col": 2, "end_line": 65, "end_col": 29 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n k: LowParse.Spec.Enum.enum_key Parsers.TicketVersion.ticketVersion_enum ->\n x: LowParse.Spec.Base.refine_with_tag Parsers.TicketContents.key_of_ticketContents k\n -> Prims.GTot Prims.bool", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.enum_key", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_enum", "LowParse.Spec.Base.refine_with_tag", "Parsers.TicketContents.ticketContents", "Parsers.TicketContents.key_of_ticketContents", "Parsers.TicketContents.uu___is_T_ticket12", "Parsers.TicketContents.uu___is_T_ticket13", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_ticketContents_cases_recip_pre\n (k: LP.enum_key ticketVersion_enum)\n (x: LP.refine_with_tag key_of_ticketContents k)\n : GTot bool\nlet synth_ticketContents_cases_recip_pre\n (k: LP.enum_key ticketVersion_enum)\n (x: LP.refine_with_tag key_of_ticketContents k)\n : GTot bool =", "completed_definiton": "match k with\n| Ticket12 -> T_ticket12? x\n| Ticket13 -> T_ticket13? x", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.synth_ticketContents_cases_recip_pre_intro", "original_source_type": "val synth_ticketContents_cases_recip_pre_intro\n (k: LP.enum_key ticketVersion_enum)\n (x: LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true)", "source_type": "val synth_ticketContents_cases_recip_pre_intro\n (k: LP.enum_key ticketVersion_enum)\n (x: LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true)", "source_definition": "let synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 69, "start_col": 2, "end_line": 69, "end_col": 68 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n k: LowParse.Spec.Enum.enum_key Parsers.TicketVersion.ticketVersion_enum ->\n x: LowParse.Spec.Base.refine_with_tag Parsers.TicketContents.key_of_ticketContents k\n -> FStar.Pervasives.Lemma\n (ensures Parsers.TicketContents.synth_ticketContents_cases_recip_pre k x == true)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.enum_key", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_enum", "LowParse.Spec.Base.refine_with_tag", "Parsers.TicketContents.ticketContents", "Parsers.TicketContents.key_of_ticketContents", "FStar.Pervasives.norm_spec", "Prims.Cons", "FStar.Pervasives.norm_step", "FStar.Pervasives.delta", "FStar.Pervasives.iota", "Prims.Nil", "Prims.bool", "Parsers.TicketContents.synth_ticketContents_cases_recip_pre", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_ticketContents_cases_recip_pre_intro\n (k: LP.enum_key ticketVersion_enum)\n (x: LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true)\nlet synth_ticketContents_cases_recip_pre_intro\n (k: LP.enum_key ticketVersion_enum)\n (x: LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =", "completed_definiton": "norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_clens_eq_ticket13", "original_source_type": "val ticketContents_clens_eq_ticket13:squash (LL.clens_eq ticketContents_clens'_ticket13\n ticketContents_clens_ticket13)", "source_type": "val ticketContents_clens_eq_ticket13:squash (LL.clens_eq ticketContents_clens'_ticket13\n ticketContents_clens_ticket13)", "source_definition": "let ticketContents_clens_eq_ticket13 : squash (LL.clens_eq ticketContents_clens'_ticket13 ticketContents_clens_ticket13) =\n (_ by (LL.sum_accessor_ext (`ticketContents)))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 270, "start_col": 4, "end_line": 270, "end_col": 50 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))\n\nlet ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_size32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LSZ.size32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_size32 serialize_ticketContents_cases size32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_validator =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.validate_sum ticketContents_sum ticketVersion_repr_validator ticketVersion_repr_reader parse_ticketContents_cases validate_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet ticketContents_jumper =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.jump_sum ticketContents_sum ticketVersion_repr_jumper ticketVersion_repr_reader parse_ticketContents_cases jump_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet lemma_valid_ticketContents_valid_ticketVersion #_ #_ s pos h =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.valid_sum_elim_tag h ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases s pos;\n lemma_synth_ticketVersion_inj ();\n LL.valid_synth h parse_ticketVersion_key synth_ticketVersion s pos\n\nlet ticketContents_gaccessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.gaccessor_ext\n (LL.gaccessor_compose\n (LL.gaccessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.gaccessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_accessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.accessor_ext\n (LL.accessor_compose\n (LL.accessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.accessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n ()\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_bytesize_eqn_ticket12 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket12 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket12 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents12_bytesize_eq (x))\n\nlet ticketContents_bytesize_eqn_ticket13 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket13 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket13 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents13_bytesize_eq (x))\n\nnoextract let ticketContents_clens'_ticket12 : LL.clens ticketContents ticketContents12 = LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket12)\n\nlet ticketContents_gaccessor'_ticket12 : LL.gaccessor ticketContents_parser ticketContents12_parser ticketContents_clens'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.gaccessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)\n\ninline_for_extraction\nlet ticketContents_accessor'_ticket12 : LL.accessor ticketContents_gaccessor'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.accessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_jumper\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)\n\nlet ticketContents_clens_eq_ticket12 : squash (LL.clens_eq ticketContents_clens'_ticket12 ticketContents_clens_ticket12) =\n (_ by (LL.sum_accessor_ext (`ticketContents)))\n\nlet ticketContents_gaccessor_ticket12 =\n LL.gaccessor_ext\n ticketContents_gaccessor'_ticket12\n ticketContents_clens_ticket12\n ticketContents_clens_eq_ticket12\n\nlet ticketContents_accessor_ticket12 =\n LL.accessor_ext\n ticketContents_accessor'_ticket12\n ticketContents_clens_ticket12\n ticketContents_clens_eq_ticket12\n\nnoextract let ticketContents_clens'_ticket13 : LL.clens ticketContents ticketContents13 = LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket13)\n\nlet ticketContents_gaccessor'_ticket13 : LL.gaccessor ticketContents_parser ticketContents13_parser ticketContents_clens'_ticket13 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.gaccessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket13)\n\ninline_for_extraction\nlet ticketContents_accessor'_ticket13 : LL.accessor ticketContents_gaccessor'_ticket13 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.accessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_jumper\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket13)", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.squash (LowParse.Low.Base.Spec.clens_eq Parsers.TicketContents.ticketContents_clens'_ticket13\n Parsers.TicketContents.ticketContents_clens_ticket13)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.clens_eq_intro'", "Parsers.TicketContents.ticketContents", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents.ticketContents_clens'_ticket13", "Parsers.TicketContents.ticketContents_clens_ticket13", "Parsers.TicketContents12.ticketContents12", "Prims.squash", "Prims.l_and", "Prims.l_imp", "Prims.eq2", "Parsers.TicketVersion.ticketVersion", "Prims.bool", "Prims.op_BarBar", "Prims.op_Equality", "Parsers.TicketVersion.Ticket12", "Parsers.TicketVersion.Ticket13", "Parsers.TicketContents.ticketVersion_as_enum_key", "Parsers.TicketContents.T_ticket12", "Parsers.TicketContents.from_ticketContents_case_of_ticketVersion" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_clens_eq_ticket13:squash (LL.clens_eq ticketContents_clens'_ticket13\n ticketContents_clens_ticket13)\nlet ticketContents_clens_eq_ticket13:squash (LL.clens_eq ticketContents_clens'_ticket13\n ticketContents_clens_ticket13) =", "completed_definiton": "(FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LL.sum_accessor_ext (`ticketContents))))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketVersion_as_enum_key", "original_source_type": "val ticketVersion_as_enum_key (x: ticketVersion)\n : Pure (LP.enum_key ticketVersion_enum)\n (requires\n norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) ==\n true)\n (ensures fun _ -> True)", "source_type": "val ticketVersion_as_enum_key (x: ticketVersion)\n : Pure (LP.enum_key ticketVersion_enum)\n (requires\n norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) ==\n true)\n (ensures fun _ -> True)", "source_definition": "let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 30, "start_col": 2, "end_line": 30, "end_col": 120 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketVersion.ticketVersion\n -> Prims.Pure (LowParse.Spec.Enum.enum_key Parsers.TicketVersion.ticketVersion_enum)", "effect": "Prims.Pure", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Parsers.TicketVersion.ticketVersion", "Prims.unit", "FStar.Pervasives.norm_spec", "Prims.Cons", "FStar.Pervasives.norm_step", "FStar.Pervasives.delta", "FStar.Pervasives.zeta", "FStar.Pervasives.iota", "FStar.Pervasives.primops", "Prims.Nil", "Prims.bool", "Prims.l_iff", "Prims.eq2", "FStar.List.Tot.Base.mem", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "FStar.UInt8.t", "FStar.Pervasives.Native.fst", "Parsers.TicketVersion.ticketVersion_enum", "LowParse.Spec.Enum.list_mem", "LowParse.Spec.Enum.enum_key", "FStar.Pervasives.norm", "Prims.l_True" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketVersion_as_enum_key (x: ticketVersion)\n : Pure (LP.enum_key ticketVersion_enum)\n (requires\n norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) ==\n true)\n (ensures fun _ -> True)\nlet ticketVersion_as_enum_key (x: ticketVersion)\n : Pure (LP.enum_key ticketVersion_enum)\n (requires\n norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) ==\n true)\n (ensures fun _ -> True) =", "completed_definiton": "[@@ inline_let ]let _ =\n norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum))\nin\nx", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_case_of_ticketVersion", "original_source_type": "val ticketContents_case_of_ticketVersion (x: ticketVersion) : Type0", "source_type": "val ticketContents_case_of_ticketVersion (x: ticketVersion) : Type0", "source_definition": "let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 38, "start_col": 2, "end_line": 40, "end_col": 32 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketVersion.ticketVersion -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketVersion.ticketVersion", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents13.ticketContents13" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_case_of_ticketVersion (x: ticketVersion) : Type0\nlet ticketContents_case_of_ticketVersion (x: ticketVersion) : Type0 =", "completed_definiton": "match x with\n| Ticket12 -> ticketContents12\n| Ticket13 -> ticketContents13", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.synth_ticketContents_cases_recip", "original_source_type": "val synth_ticketContents_cases_recip\n (k: LP.enum_key ticketVersion_enum)\n (x: LP.refine_with_tag key_of_ticketContents k)\n : (ticketContents_case_of_ticketVersion k)", "source_type": "val synth_ticketContents_cases_recip\n (k: LP.enum_key ticketVersion_enum)\n (x: LP.refine_with_tag key_of_ticketContents k)\n : (ticketContents_case_of_ticketVersion k)", "source_definition": "let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 73, "start_col": 2, "end_line": 77, "end_col": 89 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n k: LowParse.Spec.Enum.enum_key Parsers.TicketVersion.ticketVersion_enum ->\n x: LowParse.Spec.Base.refine_with_tag Parsers.TicketContents.key_of_ticketContents k\n -> Parsers.TicketContents.ticketContents_case_of_ticketVersion k", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.enum_key", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_enum", "LowParse.Spec.Base.refine_with_tag", "Parsers.TicketContents.ticketContents", "Parsers.TicketContents.key_of_ticketContents", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents.from_ticketContents_case_of_ticketVersion", "Parsers.TicketVersion.Ticket12", "Parsers.TicketContents.ticketContents_case_of_ticketVersion", "Prims.unit", "Parsers.TicketContents.synth_ticketContents_cases_recip_pre_intro", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketVersion.Ticket13" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_ticketContents_cases_recip\n (k: LP.enum_key ticketVersion_enum)\n (x: LP.refine_with_tag key_of_ticketContents k)\n : (ticketContents_case_of_ticketVersion k)\nlet synth_ticketContents_cases_recip\n (k: LP.enum_key ticketVersion_enum)\n (x: LP.refine_with_tag key_of_ticketContents k)\n : (ticketContents_case_of_ticketVersion k) =", "completed_definiton": "match k with\n| Ticket12 ->\n [@@ inline_let ]let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with | T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n| Ticket13 ->\n [@@ inline_let ]let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with | T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_clens_eq_ticket12", "original_source_type": "val ticketContents_clens_eq_ticket12:squash (LL.clens_eq ticketContents_clens'_ticket12\n ticketContents_clens_ticket12)", "source_type": "val ticketContents_clens_eq_ticket12:squash (LL.clens_eq ticketContents_clens'_ticket12\n ticketContents_clens_ticket12)", "source_definition": "let ticketContents_clens_eq_ticket12 : squash (LL.clens_eq ticketContents_clens'_ticket12 ticketContents_clens_ticket12) =\n (_ by (LL.sum_accessor_ext (`ticketContents)))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 234, "start_col": 4, "end_line": 234, "end_col": 50 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))\n\nlet ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_size32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LSZ.size32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_size32 serialize_ticketContents_cases size32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_validator =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.validate_sum ticketContents_sum ticketVersion_repr_validator ticketVersion_repr_reader parse_ticketContents_cases validate_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet ticketContents_jumper =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.jump_sum ticketContents_sum ticketVersion_repr_jumper ticketVersion_repr_reader parse_ticketContents_cases jump_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet lemma_valid_ticketContents_valid_ticketVersion #_ #_ s pos h =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.valid_sum_elim_tag h ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases s pos;\n lemma_synth_ticketVersion_inj ();\n LL.valid_synth h parse_ticketVersion_key synth_ticketVersion s pos\n\nlet ticketContents_gaccessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.gaccessor_ext\n (LL.gaccessor_compose\n (LL.gaccessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.gaccessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_accessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.accessor_ext\n (LL.accessor_compose\n (LL.accessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.accessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n ()\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_bytesize_eqn_ticket12 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket12 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket12 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents12_bytesize_eq (x))\n\nlet ticketContents_bytesize_eqn_ticket13 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket13 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket13 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents13_bytesize_eq (x))\n\nnoextract let ticketContents_clens'_ticket12 : LL.clens ticketContents ticketContents12 = LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket12)\n\nlet ticketContents_gaccessor'_ticket12 : LL.gaccessor ticketContents_parser ticketContents12_parser ticketContents_clens'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.gaccessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)\n\ninline_for_extraction\nlet ticketContents_accessor'_ticket12 : LL.accessor ticketContents_gaccessor'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.accessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_jumper\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.squash (LowParse.Low.Base.Spec.clens_eq Parsers.TicketContents.ticketContents_clens'_ticket12\n Parsers.TicketContents.ticketContents_clens_ticket12)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.clens_eq_intro'", "Parsers.TicketContents.ticketContents", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents.ticketContents_clens'_ticket12", "Parsers.TicketContents.ticketContents_clens_ticket12", "Parsers.TicketContents13.ticketContents13", "Prims.squash", "Prims.l_and", "Prims.l_imp", "Prims.eq2", "Parsers.TicketVersion.ticketVersion", "Prims.bool", "Prims.op_BarBar", "Prims.op_Equality", "Parsers.TicketVersion.Ticket12", "Parsers.TicketVersion.Ticket13", "Parsers.TicketContents.ticketVersion_as_enum_key", "Parsers.TicketContents.T_ticket13", "Parsers.TicketContents.from_ticketContents_case_of_ticketVersion" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_clens_eq_ticket12:squash (LL.clens_eq ticketContents_clens'_ticket12\n ticketContents_clens_ticket12)\nlet ticketContents_clens_eq_ticket12:squash (LL.clens_eq ticketContents_clens'_ticket12\n ticketContents_clens_ticket12) =", "completed_definiton": "(FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LL.sum_accessor_ext (`ticketContents))))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_gaccessor'_ticket12", "original_source_type": "val ticketContents_gaccessor'_ticket12:LL.gaccessor ticketContents_parser\n ticketContents12_parser\n ticketContents_clens'_ticket12", "source_type": "val ticketContents_gaccessor'_ticket12:LL.gaccessor ticketContents_parser\n ticketContents12_parser\n ticketContents_clens'_ticket12", "source_definition": "let ticketContents_gaccessor'_ticket12 : LL.gaccessor ticketContents_parser ticketContents12_parser ticketContents_clens'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.gaccessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 215, "start_col": 0, "end_line": 221, "end_col": 40 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))\n\nlet ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_size32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LSZ.size32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_size32 serialize_ticketContents_cases size32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_validator =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.validate_sum ticketContents_sum ticketVersion_repr_validator ticketVersion_repr_reader parse_ticketContents_cases validate_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet ticketContents_jumper =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.jump_sum ticketContents_sum ticketVersion_repr_jumper ticketVersion_repr_reader parse_ticketContents_cases jump_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet lemma_valid_ticketContents_valid_ticketVersion #_ #_ s pos h =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.valid_sum_elim_tag h ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases s pos;\n lemma_synth_ticketVersion_inj ();\n LL.valid_synth h parse_ticketVersion_key synth_ticketVersion s pos\n\nlet ticketContents_gaccessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.gaccessor_ext\n (LL.gaccessor_compose\n (LL.gaccessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.gaccessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_accessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.accessor_ext\n (LL.accessor_compose\n (LL.accessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.accessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n ()\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_bytesize_eqn_ticket12 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket12 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket12 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents12_bytesize_eq (x))\n\nlet ticketContents_bytesize_eqn_ticket13 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket13 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket13 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents13_bytesize_eq (x))\n\nnoextract let ticketContents_clens'_ticket12 : LL.clens ticketContents ticketContents12 = LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket12)", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.TicketContents.ticketContents_parser\n Parsers.TicketContents12.ticketContents12_parser\n Parsers.TicketContents.ticketContents_clens'_ticket12", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Sum.gaccessor_clens_sum_payload", "Parsers.TicketContents.ticketContents_sum", "LowParse.Spec.Int.parse_u8_kind", "Parsers.TicketVersion.ticketVersion_repr_parser", "Parsers.TicketContents.parse_ticketContents_cases", "Parsers.TicketContents.ticketVersion_as_enum_key", "Parsers.TicketVersion.Ticket12", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Sum.parse_sum_kind", "LowParse.Spec.Base.get_parser_kind", "FStar.UInt8.t", "Parsers.TicketContents.ticketContents_parser_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_gaccessor'_ticket12:LL.gaccessor ticketContents_parser\n ticketContents12_parser\n ticketContents_clens'_ticket12\nlet ticketContents_gaccessor'_ticket12:LL.gaccessor ticketContents_parser\n ticketContents12_parser\n ticketContents_clens'_ticket12 =", "completed_definiton": "[@@ inline_let ]let _ =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser)\n ticketContents_sum\n parse_ticketContents_cases ==\n ticketContents_parser_kind);\n ()\nin\nLL.gaccessor_clens_sum_payload ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_parser32", "original_source_type": "val ticketContents_parser32: LS.parser32 ticketContents_parser", "source_type": "val ticketContents_parser32: LS.parser32 ticketContents_parser", "source_definition": "let ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 146, "start_col": 2, "end_line": 147, "end_col": 250 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.TicketContents.ticketContents_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Sum.parse32_sum2", "LowParse.Spec.Int.parse_u8_kind", "Parsers.TicketContents.ticketContents_sum", "Parsers.TicketVersion.ticketVersion_repr_parser", "Parsers.TicketVersion.ticketVersion_repr_parser32", "Parsers.TicketContents.parse_ticketContents_cases", "Parsers.TicketContents.parse32_ticketContents_cases", "LowParse.Spec.Enum.enum_destr_cons'", "FStar.Pervasives.Native.option", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Sum.sum_type", "FStar.UInt32.t", "LowParse.Spec.Sum.sum_key_type", "LowParse.Spec.Sum.sum_repr_type", "LowParse.Spec.Sum.sum_enum", "LowParse.Spec.Enum.enum_destr_cons_nil'", "LowParse.Spec.Enum.enum_tail", "LowParse.Spec.Enum.maybe_enum_key_of_repr'_t_cons'", "LowParse.Spec.Enum.maybe_enum_key_of_repr'_t_cons_nil'", "LowParse.Spec.Enum.enum_tail'", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Sum.parse_sum_kind", "LowParse.Spec.Base.get_parser_kind", "FStar.UInt8.t", "Parsers.TicketContents.ticketContents_parser_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_parser32: LS.parser32 ticketContents_parser\nlet ticketContents_parser32 =", "completed_definiton": "assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser)\n ticketContents_sum\n parse_ticketContents_cases ==\n ticketContents_parser_kind);\nLS.parse32_sum2 ticketContents_sum\n ticketVersion_repr_parser\n ticketVersion_repr_parser32\n parse_ticketContents_cases\n parse32_ticketContents_cases\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.enum_destr_tac ticketVersion_enum)))\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.maybe_enum_key_of_repr_tac ticketVersion_enum)\n ))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_serializer", "original_source_type": "val ticketContents_serializer: LP.serializer ticketContents_parser", "source_type": "val ticketContents_serializer: LP.serializer ticketContents_parser", "source_definition": "let ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 138, "start_col": 2, "end_line": 139, "end_col": 98 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.TicketContents.ticketContents_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Sum.serialize_sum", "LowParse.Spec.Int.parse_u8_kind", "Parsers.TicketContents.ticketContents_sum", "LowParse.Spec.Int.parse_u8", "Parsers.TicketVersion.ticketVersion_repr_serializer", "Parsers.TicketContents.parse_ticketContents_cases", "Parsers.TicketContents.serialize_ticketContents_cases", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Sum.parse_sum_kind", "LowParse.Spec.Base.get_parser_kind", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_repr_parser", "Parsers.TicketContents.ticketContents_parser_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_serializer: LP.serializer ticketContents_parser\nlet ticketContents_serializer =", "completed_definiton": "assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser)\n ticketContents_sum\n parse_ticketContents_cases ==\n ticketContents_parser_kind);\nLP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.synth_ticketContents_cases", "original_source_type": "val synth_ticketContents_cases\n (x: LP.enum_key ticketVersion_enum)\n (y: ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x", "source_type": "val synth_ticketContents_cases\n (x: LP.enum_key ticketVersion_enum)\n (y: ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x", "source_definition": "let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 52, "start_col": 2, "end_line": 54, "end_col": 105 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x: LowParse.Spec.Enum.enum_key Parsers.TicketVersion.ticketVersion_enum ->\n y: Parsers.TicketContents.ticketContents_case_of_ticketVersion x\n -> LowParse.Spec.Base.refine_with_tag Parsers.TicketContents.key_of_ticketContents x", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.enum_key", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_enum", "Parsers.TicketContents.ticketContents_case_of_ticketVersion", "Parsers.TicketContents.ticketContents_refine", "Parsers.TicketContents.T_ticket12", "Parsers.TicketContents.to_ticketContents_case_of_ticketVersion", "Parsers.TicketVersion.Ticket12", "Parsers.TicketContents.T_ticket13", "Parsers.TicketVersion.Ticket13", "LowParse.Spec.Base.refine_with_tag", "Parsers.TicketContents.ticketContents", "Parsers.TicketContents.key_of_ticketContents" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_ticketContents_cases\n (x: LP.enum_key ticketVersion_enum)\n (y: ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x\nlet synth_ticketContents_cases\n (x: LP.enum_key ticketVersion_enum)\n (y: ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =", "completed_definiton": "match x with\n| Ticket12 ->\n ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n| Ticket13 ->\n ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_gaccessor'_ticket13", "original_source_type": "val ticketContents_gaccessor'_ticket13:LL.gaccessor ticketContents_parser\n ticketContents13_parser\n ticketContents_clens'_ticket13", "source_type": "val ticketContents_gaccessor'_ticket13:LL.gaccessor ticketContents_parser\n ticketContents13_parser\n ticketContents_clens'_ticket13", "source_definition": "let ticketContents_gaccessor'_ticket13 : LL.gaccessor ticketContents_parser ticketContents13_parser ticketContents_clens'_ticket13 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.gaccessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket13)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 251, "start_col": 0, "end_line": 257, "end_col": 40 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))\n\nlet ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_size32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LSZ.size32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_size32 serialize_ticketContents_cases size32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_validator =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.validate_sum ticketContents_sum ticketVersion_repr_validator ticketVersion_repr_reader parse_ticketContents_cases validate_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet ticketContents_jumper =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.jump_sum ticketContents_sum ticketVersion_repr_jumper ticketVersion_repr_reader parse_ticketContents_cases jump_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet lemma_valid_ticketContents_valid_ticketVersion #_ #_ s pos h =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.valid_sum_elim_tag h ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases s pos;\n lemma_synth_ticketVersion_inj ();\n LL.valid_synth h parse_ticketVersion_key synth_ticketVersion s pos\n\nlet ticketContents_gaccessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.gaccessor_ext\n (LL.gaccessor_compose\n (LL.gaccessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.gaccessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_accessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.accessor_ext\n (LL.accessor_compose\n (LL.accessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.accessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n ()\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_bytesize_eqn_ticket12 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket12 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket12 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents12_bytesize_eq (x))\n\nlet ticketContents_bytesize_eqn_ticket13 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket13 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket13 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents13_bytesize_eq (x))\n\nnoextract let ticketContents_clens'_ticket12 : LL.clens ticketContents ticketContents12 = LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket12)\n\nlet ticketContents_gaccessor'_ticket12 : LL.gaccessor ticketContents_parser ticketContents12_parser ticketContents_clens'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.gaccessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)\n\ninline_for_extraction\nlet ticketContents_accessor'_ticket12 : LL.accessor ticketContents_gaccessor'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.accessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_jumper\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)\n\nlet ticketContents_clens_eq_ticket12 : squash (LL.clens_eq ticketContents_clens'_ticket12 ticketContents_clens_ticket12) =\n (_ by (LL.sum_accessor_ext (`ticketContents)))\n\nlet ticketContents_gaccessor_ticket12 =\n LL.gaccessor_ext\n ticketContents_gaccessor'_ticket12\n ticketContents_clens_ticket12\n ticketContents_clens_eq_ticket12\n\nlet ticketContents_accessor_ticket12 =\n LL.accessor_ext\n ticketContents_accessor'_ticket12\n ticketContents_clens_ticket12\n ticketContents_clens_eq_ticket12\n\nnoextract let ticketContents_clens'_ticket13 : LL.clens ticketContents ticketContents13 = LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket13)", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.TicketContents.ticketContents_parser\n Parsers.TicketContents13.ticketContents13_parser\n Parsers.TicketContents.ticketContents_clens'_ticket13", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Sum.gaccessor_clens_sum_payload", "Parsers.TicketContents.ticketContents_sum", "LowParse.Spec.Int.parse_u8_kind", "Parsers.TicketVersion.ticketVersion_repr_parser", "Parsers.TicketContents.parse_ticketContents_cases", "Parsers.TicketContents.ticketVersion_as_enum_key", "Parsers.TicketVersion.Ticket13", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Sum.parse_sum_kind", "LowParse.Spec.Base.get_parser_kind", "FStar.UInt8.t", "Parsers.TicketContents.ticketContents_parser_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_gaccessor'_ticket13:LL.gaccessor ticketContents_parser\n ticketContents13_parser\n ticketContents_clens'_ticket13\nlet ticketContents_gaccessor'_ticket13:LL.gaccessor ticketContents_parser\n ticketContents13_parser\n ticketContents_clens'_ticket13 =", "completed_definiton": "[@@ inline_let ]let _ =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser)\n ticketContents_sum\n parse_ticketContents_cases ==\n ticketContents_parser_kind);\n ()\nin\nLL.gaccessor_clens_sum_payload ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket13)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_parser", "original_source_type": "val ticketContents_parser: LP.parser ticketContents_parser_kind ticketContents", "source_type": "val ticketContents_parser: LP.parser ticketContents_parser_kind ticketContents", "source_definition": "let ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 134, "start_col": 2, "end_line": 135, "end_col": 86 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.TicketContents.ticketContents_parser_kind\n Parsers.TicketContents.ticketContents", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Sum.parse_sum", "LowParse.Spec.Int.parse_u8_kind", "Parsers.TicketContents.ticketContents_sum", "Parsers.TicketVersion.ticketVersion_repr_parser", "Parsers.TicketContents.parse_ticketContents_cases", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Sum.parse_sum_kind", "LowParse.Spec.Base.get_parser_kind", "FStar.UInt8.t", "Parsers.TicketContents.ticketContents_parser_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_parser: LP.parser ticketContents_parser_kind ticketContents\nlet ticketContents_parser =", "completed_definiton": "assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser)\n ticketContents_sum\n parse_ticketContents_cases ==\n ticketContents_parser_kind);\nLP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_jumper", "original_source_type": "val ticketContents_jumper: LL.jumper ticketContents_parser", "source_type": "val ticketContents_jumper: LL.jumper ticketContents_parser", "source_definition": "let ticketContents_jumper =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.jump_sum ticketContents_sum ticketVersion_repr_jumper ticketVersion_repr_reader parse_ticketContents_cases jump_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 164, "start_col": 2, "end_line": 165, "end_col": 179 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))\n\nlet ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_size32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LSZ.size32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_size32 serialize_ticketContents_cases size32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_validator =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.validate_sum ticketContents_sum ticketVersion_repr_validator ticketVersion_repr_reader parse_ticketContents_cases validate_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.TicketContents.ticketContents_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Sum.jump_sum", "Parsers.TicketContents.ticketContents_sum", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "Parsers.TicketVersion.ticketVersion_repr_jumper", "Parsers.TicketVersion.ticketVersion_repr_reader", "Parsers.TicketContents.parse_ticketContents_cases", "Parsers.TicketContents.jump_ticketContents_cases", "LowParse.Spec.Enum.dep_maybe_enum_destr_t_intro", "LowParse.Spec.Sum.sum_key_type", "LowParse.Spec.Sum.sum_repr_type", "LowParse.Spec.Sum.sum_enum", "LowParse.Low.Sum.jump_sum_aux_payload_t", "LowParse.Spec.Enum.dep_maybe_enum_destr_cons", "Prims.Nil", "FStar.Pervasives.Native.tuple2", "Prims.Cons", "LowParse.Spec.Enum.list_hd", "LowParse.Spec.Enum.list_tl", "LowParse.Spec.Enum.list_append_rev_cons", "LowParse.Spec.Enum.dep_maybe_enum_destr_nil", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Sum.parse_sum_kind", "LowParse.Spec.Base.get_parser_kind", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_repr_parser", "Parsers.TicketContents.ticketContents_parser_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_jumper: LL.jumper ticketContents_parser\nlet ticketContents_jumper =", "completed_definiton": "assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser)\n ticketContents_sum\n parse_ticketContents_cases ==\n ticketContents_parser_kind);\nLL.jump_sum ticketContents_sum\n ticketVersion_repr_jumper\n ticketVersion_repr_reader\n parse_ticketContents_cases\n jump_ticketContents_cases\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.dep_maybe_enum_destr_t_tac ())))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_validator", "original_source_type": "val ticketContents_validator: LL.validator ticketContents_parser", "source_type": "val ticketContents_validator: LL.validator ticketContents_parser", "source_definition": "let ticketContents_validator =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.validate_sum ticketContents_sum ticketVersion_repr_validator ticketVersion_repr_reader parse_ticketContents_cases validate_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 160, "start_col": 2, "end_line": 161, "end_col": 190 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))\n\nlet ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_size32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LSZ.size32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_size32 serialize_ticketContents_cases size32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.TicketContents.ticketContents_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Sum.validate_sum", "Parsers.TicketContents.ticketContents_sum", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "Parsers.TicketVersion.ticketVersion_repr_validator", "Parsers.TicketVersion.ticketVersion_repr_reader", "Parsers.TicketContents.parse_ticketContents_cases", "Parsers.TicketContents.validate_ticketContents_cases", "LowParse.Spec.Enum.dep_maybe_enum_destr_t_intro", "LowParse.Spec.Sum.sum_key_type", "LowParse.Spec.Sum.sum_repr_type", "LowParse.Spec.Sum.sum_enum", "LowParse.Low.Sum.validate_sum_aux_payload_t", "LowParse.Spec.Enum.dep_maybe_enum_destr_cons", "Prims.Nil", "FStar.Pervasives.Native.tuple2", "Prims.Cons", "LowParse.Spec.Enum.list_hd", "LowParse.Spec.Enum.list_tl", "LowParse.Spec.Enum.list_append_rev_cons", "LowParse.Spec.Enum.dep_maybe_enum_destr_nil", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Sum.parse_sum_kind", "LowParse.Spec.Base.get_parser_kind", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_repr_parser", "Parsers.TicketContents.ticketContents_parser_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_validator: LL.validator ticketContents_parser\nlet ticketContents_validator =", "completed_definiton": "assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser)\n ticketContents_sum\n parse_ticketContents_cases ==\n ticketContents_parser_kind);\nLL.validate_sum ticketContents_sum\n ticketVersion_repr_validator\n ticketVersion_repr_reader\n parse_ticketContents_cases\n validate_ticketContents_cases\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.dep_maybe_enum_destr_t_tac ())))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_serializer32", "original_source_type": "val ticketContents_serializer32: LS.serializer32 ticketContents_serializer", "source_type": "val ticketContents_serializer32: LS.serializer32 ticketContents_serializer", "source_definition": "let ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 150, "start_col": 2, "end_line": 152, "end_col": 255 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.TicketContents.ticketContents_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Sum.serialize32_sum2", "LowParse.Spec.Int.parse_u8_kind", "Parsers.TicketContents.ticketContents_sum", "LowParse.Spec.Int.parse_u8", "Parsers.TicketVersion.ticketVersion_repr_serializer", "Parsers.TicketVersion.ticketVersion_repr_serializer32", "Parsers.TicketContents.parse_ticketContents_cases", "Parsers.TicketContents.serialize_ticketContents_cases", "Parsers.TicketContents.serialize32_ticketContents_cases", "LowParse.Spec.Enum.dep_enum_destr_cons", "LowParse.Spec.Sum.sum_key_type", "LowParse.Spec.Sum.sum_repr_type", "LowParse.Spec.Sum.sum_enum", "LowParse.SLow.Sum.serialize32_sum_destr_codom", "LowParse.Spec.Enum.dep_enum_destr_cons_nil", "LowParse.Spec.Enum.enum_tail", "LowParse.Spec.Enum.enum_key", "LowParse.Spec.Enum.enum_repr_of_key_cons'", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'", "LowParse.Spec.Enum.enum_tail'", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.SLow.Sum.serializer32_sum_gen_precond", "LowParse.Spec.Base.get_parser_kind", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_repr_parser", "LowParse.Spec.Sum.weaken_parse_cases_kind", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Sum.parse_sum_kind", "Parsers.TicketContents.ticketContents_parser_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_serializer32: LS.serializer32 ticketContents_serializer\nlet ticketContents_serializer32 =", "completed_definiton": "assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser)\n ticketContents_sum\n parse_ticketContents_cases ==\n ticketContents_parser_kind);\nassert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser)\n (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\nLS.serialize32_sum2 ticketContents_sum\n ticketVersion_repr_serializer\n ticketVersion_repr_serializer32\n serialize_ticketContents_cases\n serialize32_ticketContents_cases\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.dep_enum_destr_tac ())))\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.enum_repr_of_key_tac ticketVersion_enum)))\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_bytesize_eqn_ticket13", "original_source_type": "val ticketContents_bytesize_eqn_ticket13 (x: ticketContents13) : Lemma (ticketContents_bytesize (T_ticket13 x) == 1 + (ticketContents13_bytesize (x))) [SMTPat (ticketContents_bytesize (T_ticket13 x))]", "source_type": "val ticketContents_bytesize_eqn_ticket13 (x: ticketContents13) : Lemma (ticketContents_bytesize (T_ticket13 x) == 1 + (ticketContents13_bytesize (x))) [SMTPat (ticketContents_bytesize (T_ticket13 x))]", "source_definition": "let ticketContents_bytesize_eqn_ticket13 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket13 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket13 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents13_bytesize_eq (x))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 206, "start_col": 4, "end_line": 210, "end_col": 36 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))\n\nlet ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_size32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LSZ.size32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_size32 serialize_ticketContents_cases size32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_validator =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.validate_sum ticketContents_sum ticketVersion_repr_validator ticketVersion_repr_reader parse_ticketContents_cases validate_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet ticketContents_jumper =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.jump_sum ticketContents_sum ticketVersion_repr_jumper ticketVersion_repr_reader parse_ticketContents_cases jump_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet lemma_valid_ticketContents_valid_ticketVersion #_ #_ s pos h =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.valid_sum_elim_tag h ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases s pos;\n lemma_synth_ticketVersion_inj ();\n LL.valid_synth h parse_ticketVersion_key synth_ticketVersion s pos\n\nlet ticketContents_gaccessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.gaccessor_ext\n (LL.gaccessor_compose\n (LL.gaccessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.gaccessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_accessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.accessor_ext\n (LL.accessor_compose\n (LL.accessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.accessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n ()\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_bytesize_eqn_ticket12 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket12 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket12 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents12_bytesize_eq (x))", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketContents13.ticketContents13\n -> FStar.Pervasives.Lemma\n (ensures\n Parsers.TicketContents.ticketContents_bytesize (Parsers.TicketContents.T_ticket13 x) ==\n 1 + Parsers.TicketContents13.ticketContents13_bytesize x)\n [\n SMTPat (Parsers.TicketContents.ticketContents_bytesize (Parsers.TicketContents.T_ticket13 x)\n )\n ]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13_bytesize_eq", "Prims.unit", "Prims._assert", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.nat", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "LowParse.Spec.Sum.sum_key_type", "Parsers.TicketContents.ticketContents_sum", "FStar.UInt8.t", "LowParse.Spec.Sum.sum_enum", "LowParse.Spec.Enum.parse_enum_key", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Enum.serialize_enum_key", "Parsers.TicketVersion.ticketVersion_repr_serializer", "Parsers.TicketContents.key_of_ticketContents", "Parsers.TicketContents.T_ticket13", "LowParse.Spec.Sum.serialize_sum_eq", "Parsers.TicketContents.parse_ticketContents_cases", "Parsers.TicketContents.serialize_ticketContents_cases", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Sum.parse_sum_kind", "LowParse.Spec.Base.get_parser_kind", "Parsers.TicketVersion.ticketVersion_repr_parser", "Parsers.TicketContents.ticketContents_parser_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_bytesize_eqn_ticket13 (x: ticketContents13) : Lemma (ticketContents_bytesize (T_ticket13 x) == 1 + (ticketContents13_bytesize (x))) [SMTPat (ticketContents_bytesize (T_ticket13 x))]\nlet ticketContents_bytesize_eqn_ticket13 x =", "completed_definiton": "assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser)\n ticketContents_sum\n parse_ticketContents_cases ==\n ticketContents_parser_kind);\nLP.serialize_sum_eq ticketContents_sum\n ticketVersion_repr_serializer\n serialize_ticketContents_cases\n (T_ticket13 x);\n(let ln =\n FStar.Seq.length (LP.serialize (LP.serialize_enum_key _\n ticketVersion_repr_serializer\n (LP.sum_enum ticketContents_sum))\n (key_of_ticketContents (T_ticket13 x)))\n in\n assert (1 <= ln /\\ ln <= 1));\n(ticketContents13_bytesize_eq (x))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_size32", "original_source_type": "val ticketContents_size32: LSZ.size32 ticketContents_serializer", "source_type": "val ticketContents_size32: LSZ.size32 ticketContents_serializer", "source_definition": "let ticketContents_size32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LSZ.size32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_size32 serialize_ticketContents_cases size32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 155, "start_col": 2, "end_line": 157, "end_col": 240 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))\n\nlet ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.TicketContents.ticketContents_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Sum.size32_sum2", "LowParse.Spec.Int.parse_u8_kind", "Parsers.TicketContents.ticketContents_sum", "LowParse.Spec.Int.parse_u8", "Parsers.TicketVersion.ticketVersion_repr_serializer", "Parsers.TicketVersion.ticketVersion_repr_size32", "Parsers.TicketContents.parse_ticketContents_cases", "Parsers.TicketContents.serialize_ticketContents_cases", "Parsers.TicketContents.size32_ticketContents_cases", "LowParse.Spec.Enum.dep_enum_destr_cons", "LowParse.Spec.Sum.sum_key_type", "LowParse.Spec.Sum.sum_repr_type", "LowParse.Spec.Sum.sum_enum", "LowParse.SLow.Sum.size32_sum_destr_codom", "LowParse.Spec.Enum.dep_enum_destr_cons_nil", "LowParse.Spec.Enum.enum_tail", "LowParse.Spec.Enum.enum_key", "LowParse.Spec.Enum.enum_repr_of_key_cons'", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'", "LowParse.Spec.Enum.enum_tail'", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.SLow.Sum.size32_sum_gen_precond", "LowParse.Spec.Base.get_parser_kind", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_repr_parser", "LowParse.Spec.Sum.weaken_parse_cases_kind", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Sum.parse_sum_kind", "Parsers.TicketContents.ticketContents_parser_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_size32: LSZ.size32 ticketContents_serializer\nlet ticketContents_size32 =", "completed_definiton": "assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser)\n ticketContents_sum\n parse_ticketContents_cases ==\n ticketContents_parser_kind);\nassert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser)\n (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\nLSZ.size32_sum2 ticketContents_sum\n ticketVersion_repr_serializer\n ticketVersion_repr_size32\n serialize_ticketContents_cases\n size32_ticketContents_cases\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.dep_enum_destr_tac ())))\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.enum_repr_of_key_tac ticketVersion_enum)))\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.parse_ticketContents_cases", "original_source_type": "val parse_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x)", "source_type": "val parse_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x)", "source_definition": "let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 86, "start_col": 2, "end_line": 89, "end_col": 32 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: LowParse.Spec.Sum.sum_key Parsers.TicketContents.ticketContents_sum\n -> Prims.dtuple2 LowParse.Spec.Base.parser_kind\n (fun k ->\n LowParse.Spec.Base.parser k\n (Parsers.TicketContents.ticketContents_case_of_ticketVersion x))", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Sum.sum_key", "Parsers.TicketContents.ticketContents_sum", "Prims.dtuple2", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.parser", "Parsers.TicketContents.ticketContents_case_of_ticketVersion", "Parsers.TicketVersion.Ticket12", "Prims.Mkdtuple2", "Parsers.TicketContents12.ticketContents12_parser_kind", "Parsers.TicketContents12.ticketContents12_parser", "Parsers.TicketVersion.Ticket13", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13_parser", "Parsers.TicketVersion.ticketVersion", "LowParse.Spec.Combinators.parse_false_kind", "LowParse.Spec.Combinators.parse_false" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x)\nlet parse_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =", "completed_definiton": "match x with\n| Ticket12 ->\n [@@ inline_let ]let u:(k: LP.parser_kind &\n LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) =\n (| _, ticketContents12_parser |)\n in\n u\n| Ticket13 ->\n [@@ inline_let ]let u:(k: LP.parser_kind &\n LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) =\n (| _, ticketContents13_parser |)\n in\n u\n| _ -> (| _, LP.parse_false |)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_bytesize_eqn_ticket12", "original_source_type": "val ticketContents_bytesize_eqn_ticket12 (x: ticketContents12) : Lemma (ticketContents_bytesize (T_ticket12 x) == 1 + (ticketContents12_bytesize (x))) [SMTPat (ticketContents_bytesize (T_ticket12 x))]", "source_type": "val ticketContents_bytesize_eqn_ticket12 (x: ticketContents12) : Lemma (ticketContents_bytesize (T_ticket12 x) == 1 + (ticketContents12_bytesize (x))) [SMTPat (ticketContents_bytesize (T_ticket12 x))]", "source_definition": "let ticketContents_bytesize_eqn_ticket12 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket12 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket12 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents12_bytesize_eq (x))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 199, "start_col": 4, "end_line": 203, "end_col": 36 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))\n\nlet ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_size32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LSZ.size32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_size32 serialize_ticketContents_cases size32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_validator =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.validate_sum ticketContents_sum ticketVersion_repr_validator ticketVersion_repr_reader parse_ticketContents_cases validate_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet ticketContents_jumper =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.jump_sum ticketContents_sum ticketVersion_repr_jumper ticketVersion_repr_reader parse_ticketContents_cases jump_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet lemma_valid_ticketContents_valid_ticketVersion #_ #_ s pos h =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.valid_sum_elim_tag h ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases s pos;\n lemma_synth_ticketVersion_inj ();\n LL.valid_synth h parse_ticketVersion_key synth_ticketVersion s pos\n\nlet ticketContents_gaccessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.gaccessor_ext\n (LL.gaccessor_compose\n (LL.gaccessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.gaccessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_accessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.accessor_ext\n (LL.accessor_compose\n (LL.accessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.accessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n ()\n )\n ticketContents_clens_tag\n ()", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketContents12.ticketContents12\n -> FStar.Pervasives.Lemma\n (ensures\n Parsers.TicketContents.ticketContents_bytesize (Parsers.TicketContents.T_ticket12 x) ==\n 1 + Parsers.TicketContents12.ticketContents12_bytesize x)\n [\n SMTPat (Parsers.TicketContents.ticketContents_bytesize (Parsers.TicketContents.T_ticket12 x)\n )\n ]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents12.ticketContents12_bytesize_eq", "Prims.unit", "Prims._assert", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.nat", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "LowParse.Spec.Sum.sum_key_type", "Parsers.TicketContents.ticketContents_sum", "FStar.UInt8.t", "LowParse.Spec.Sum.sum_enum", "LowParse.Spec.Enum.parse_enum_key", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Enum.serialize_enum_key", "Parsers.TicketVersion.ticketVersion_repr_serializer", "Parsers.TicketContents.key_of_ticketContents", "Parsers.TicketContents.T_ticket12", "LowParse.Spec.Sum.serialize_sum_eq", "Parsers.TicketContents.parse_ticketContents_cases", "Parsers.TicketContents.serialize_ticketContents_cases", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Sum.parse_sum_kind", "LowParse.Spec.Base.get_parser_kind", "Parsers.TicketVersion.ticketVersion_repr_parser", "Parsers.TicketContents.ticketContents_parser_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_bytesize_eqn_ticket12 (x: ticketContents12) : Lemma (ticketContents_bytesize (T_ticket12 x) == 1 + (ticketContents12_bytesize (x))) [SMTPat (ticketContents_bytesize (T_ticket12 x))]\nlet ticketContents_bytesize_eqn_ticket12 x =", "completed_definiton": "assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser)\n ticketContents_sum\n parse_ticketContents_cases ==\n ticketContents_parser_kind);\nLP.serialize_sum_eq ticketContents_sum\n ticketVersion_repr_serializer\n serialize_ticketContents_cases\n (T_ticket12 x);\n(let ln =\n FStar.Seq.length (LP.serialize (LP.serialize_enum_key _\n ticketVersion_repr_serializer\n (LP.sum_enum ticketContents_sum))\n (key_of_ticketContents (T_ticket12 x)))\n in\n assert (1 <= ln /\\ ln <= 1));\n(ticketContents12_bytesize_eq (x))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.to_ticketContents_case_of_ticketVersion", "original_source_type": "val to_ticketContents_case_of_ticketVersion\n (x #x': ticketVersion)\n (y: ticketContents_case_of_ticketVersion x')\n : Pure\n (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota]\n (ticketContents_case_of_ticketVersion x))\n (requires (x == x'))\n (ensures (fun y' -> y' == y))", "source_type": "val to_ticketContents_case_of_ticketVersion\n (x #x': ticketVersion)\n (y: ticketContents_case_of_ticketVersion x')\n : Pure\n (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota]\n (ticketContents_case_of_ticketVersion x))\n (requires (x == x'))\n (ensures (fun y' -> y' == y))", "source_definition": "let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 44, "start_col": 2, "end_line": 44, "end_col": 142 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x: Parsers.TicketVersion.ticketVersion ->\n y: Parsers.TicketContents.ticketContents_case_of_ticketVersion x'\n -> Prims.Pure\n (FStar.Pervasives.norm [\n FStar.Pervasives.delta_only [\n \"Parsers.TicketContents.ticketContents_case_of_ticketVersion\"\n ];\n FStar.Pervasives.iota\n ]\n (Parsers.TicketContents.ticketContents_case_of_ticketVersion x))", "effect": "Prims.Pure", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Parsers.TicketVersion.ticketVersion", "Parsers.TicketContents.ticketContents_case_of_ticketVersion", "Prims.unit", "FStar.Pervasives.norm_spec", "Prims.Cons", "FStar.Pervasives.norm_step", "FStar.Pervasives.delta_only", "Prims.string", "Prims.Nil", "FStar.Pervasives.iota", "FStar.Pervasives.norm", "Prims.eq2", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents13.ticketContents13" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val to_ticketContents_case_of_ticketVersion\n (x #x': ticketVersion)\n (y: ticketContents_case_of_ticketVersion x')\n : Pure\n (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota]\n (ticketContents_case_of_ticketVersion x))\n (requires (x == x'))\n (ensures (fun y' -> y' == y))\nlet to_ticketContents_case_of_ticketVersion\n (x #x': ticketVersion)\n (y: ticketContents_case_of_ticketVersion x')\n : Pure\n (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota]\n (ticketContents_case_of_ticketVersion x))\n (requires (x == x'))\n (ensures (fun y' -> y' == y)) =", "completed_definiton": "[@@ inline_let ]let _ =\n norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota]\n (ticketContents_case_of_ticketVersion x)\nin\ny", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.serialize_ticketContents_cases", "original_source_type": "val serialize_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x))", "source_type": "val serialize_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x))", "source_definition": "let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 93, "start_col": 2, "end_line": 96, "end_col": 27 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: LowParse.Spec.Sum.sum_key Parsers.TicketContents.ticketContents_sum\n -> LowParse.Spec.Base.serializer (FStar.Pervasives.dsnd (Parsers.TicketContents.parse_ticketContents_cases\n x))", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Sum.sum_key", "Parsers.TicketContents.ticketContents_sum", "LowParse.Spec.Base.serializer", "Prims.__proj__Mkdtuple2__item___1", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.parser", "Parsers.TicketContents.ticketContents_case_of_ticketVersion", "Parsers.TicketVersion.Ticket12", "Parsers.TicketContents.parse_ticketContents_cases", "FStar.Pervasives.dsnd", "Parsers.TicketContents12.ticketContents12_serializer", "Parsers.TicketVersion.Ticket13", "Parsers.TicketContents13.ticketContents13_serializer", "Parsers.TicketVersion.ticketVersion", "LowParse.Spec.Combinators.serialize_false" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x))\nlet serialize_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =", "completed_definiton": "match x with\n| Ticket12 ->\n [@@ inline_let ]let u:LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) =\n ticketContents12_serializer\n in\n u\n| Ticket13 ->\n [@@ inline_let ]let u:LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) =\n ticketContents13_serializer\n in\n u\n| _ -> LP.serialize_false", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_accessor'_ticket12", "original_source_type": "val ticketContents_accessor'_ticket12:LL.accessor ticketContents_gaccessor'_ticket12", "source_type": "val ticketContents_accessor'_ticket12:LL.accessor ticketContents_gaccessor'_ticket12", "source_definition": "let ticketContents_accessor'_ticket12 : LL.accessor ticketContents_gaccessor'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.accessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_jumper\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 225, "start_col": 0, "end_line": 231, "end_col": 40 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))\n\nlet ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_size32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LSZ.size32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_size32 serialize_ticketContents_cases size32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_validator =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.validate_sum ticketContents_sum ticketVersion_repr_validator ticketVersion_repr_reader parse_ticketContents_cases validate_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet ticketContents_jumper =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.jump_sum ticketContents_sum ticketVersion_repr_jumper ticketVersion_repr_reader parse_ticketContents_cases jump_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet lemma_valid_ticketContents_valid_ticketVersion #_ #_ s pos h =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.valid_sum_elim_tag h ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases s pos;\n lemma_synth_ticketVersion_inj ();\n LL.valid_synth h parse_ticketVersion_key synth_ticketVersion s pos\n\nlet ticketContents_gaccessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.gaccessor_ext\n (LL.gaccessor_compose\n (LL.gaccessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.gaccessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_accessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.accessor_ext\n (LL.accessor_compose\n (LL.accessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.accessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n ()\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_bytesize_eqn_ticket12 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket12 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket12 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents12_bytesize_eq (x))\n\nlet ticketContents_bytesize_eqn_ticket13 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket13 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket13 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents13_bytesize_eq (x))\n\nnoextract let ticketContents_clens'_ticket12 : LL.clens ticketContents ticketContents12 = LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket12)\n\nlet ticketContents_gaccessor'_ticket12 : LL.gaccessor ticketContents_parser ticketContents12_parser ticketContents_clens'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.gaccessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)\n\ninline_for_extraction", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents.ticketContents_gaccessor'_ticket12", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Sum.accessor_clens_sum_payload", "Parsers.TicketContents.ticketContents_sum", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "Parsers.TicketVersion.ticketVersion_repr_jumper", "Parsers.TicketContents.parse_ticketContents_cases", "Parsers.TicketContents.ticketVersion_as_enum_key", "Parsers.TicketVersion.Ticket12", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Sum.parse_sum_kind", "LowParse.Spec.Base.get_parser_kind", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_repr_parser", "Parsers.TicketContents.ticketContents_parser_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_accessor'_ticket12:LL.accessor ticketContents_gaccessor'_ticket12\nlet ticketContents_accessor'_ticket12:LL.accessor ticketContents_gaccessor'_ticket12 =", "completed_definiton": "[@@ inline_let ]let _ =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser)\n ticketContents_sum\n parse_ticketContents_cases ==\n ticketContents_parser_kind);\n ()\nin\nLL.accessor_clens_sum_payload ticketContents_sum\n ticketVersion_repr_jumper\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.from_ticketContents_case_of_ticketVersion", "original_source_type": "val from_ticketContents_case_of_ticketVersion\n (#x' x: ticketVersion)\n (y:\n norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota]\n (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x')\n (requires (x == x'))\n (ensures (fun y' -> y' == y))", "source_type": "val from_ticketContents_case_of_ticketVersion\n (#x' x: ticketVersion)\n (y:\n norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota]\n (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x')\n (requires (x == x'))\n (ensures (fun y' -> y' == y))", "source_definition": "let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 59, "start_col": 2, "end_line": 59, "end_col": 142 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x: Parsers.TicketVersion.ticketVersion ->\n y:\n FStar.Pervasives.norm [\n FStar.Pervasives.delta_only [\n \"Parsers.TicketContents.ticketContents_case_of_ticketVersion\"\n ];\n FStar.Pervasives.iota\n ]\n (Parsers.TicketContents.ticketContents_case_of_ticketVersion x)\n -> Prims.Pure (Parsers.TicketContents.ticketContents_case_of_ticketVersion x')", "effect": "Prims.Pure", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Parsers.TicketVersion.ticketVersion", "FStar.Pervasives.norm", "Prims.Cons", "FStar.Pervasives.norm_step", "FStar.Pervasives.delta_only", "Prims.string", "Prims.Nil", "FStar.Pervasives.iota", "Parsers.TicketContents.ticketContents_case_of_ticketVersion", "Prims.unit", "FStar.Pervasives.norm_spec", "Prims.eq2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val from_ticketContents_case_of_ticketVersion\n (#x' x: ticketVersion)\n (y:\n norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota]\n (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x')\n (requires (x == x'))\n (ensures (fun y' -> y' == y))\nlet from_ticketContents_case_of_ticketVersion\n (#x' x: ticketVersion)\n (y:\n norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota]\n (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x')\n (requires (x == x'))\n (ensures (fun y' -> y' == y)) =", "completed_definiton": "[@@ inline_let ]let _ =\n norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota]\n (ticketContents_case_of_ticketVersion x)\nin\ny", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.parse32_ticketContents_cases", "original_source_type": "val parse32_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x))", "source_type": "val parse32_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x))", "source_definition": "let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 100, "start_col": 2, "end_line": 103, "end_col": 25 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: LowParse.Spec.Sum.sum_key Parsers.TicketContents.ticketContents_sum\n -> LowParse.SLow.Base.parser32 (FStar.Pervasives.dsnd (Parsers.TicketContents.parse_ticketContents_cases\n x))", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Sum.sum_key", "Parsers.TicketContents.ticketContents_sum", "LowParse.SLow.Base.parser32", "Prims.__proj__Mkdtuple2__item___1", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.parser", "Parsers.TicketContents.ticketContents_case_of_ticketVersion", "Parsers.TicketVersion.Ticket12", "Parsers.TicketContents.parse_ticketContents_cases", "FStar.Pervasives.dsnd", "Parsers.TicketContents12.ticketContents12_parser32", "Parsers.TicketVersion.Ticket13", "Parsers.TicketContents13.ticketContents13_parser32", "Parsers.TicketVersion.ticketVersion", "LowParse.SLow.Combinators.parse32_false" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse32_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x))\nlet parse32_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =", "completed_definiton": "match x with\n| Ticket12 ->\n [@@ inline_let ]let u:LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) =\n ticketContents12_parser32\n in\n u\n| Ticket13 ->\n [@@ inline_let ]let u:LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) =\n ticketContents13_parser32\n in\n u\n| _ -> LS.parse32_false", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.validate_ticketContents_cases", "original_source_type": "val validate_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x))", "source_type": "val validate_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x))", "source_definition": "let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 121, "start_col": 2, "end_line": 124, "end_col": 29 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: LowParse.Spec.Sum.sum_key Parsers.TicketContents.ticketContents_sum\n -> LowParse.Low.Base.validator (FStar.Pervasives.dsnd (Parsers.TicketContents.parse_ticketContents_cases\n x))", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Sum.sum_key", "Parsers.TicketContents.ticketContents_sum", "LowParse.Low.Base.validator", "Prims.__proj__Mkdtuple2__item___1", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.parser", "Parsers.TicketContents.ticketContents_case_of_ticketVersion", "Parsers.TicketVersion.Ticket12", "Parsers.TicketContents.parse_ticketContents_cases", "FStar.Pervasives.dsnd", "Parsers.TicketContents12.ticketContents12_validator", "Parsers.TicketVersion.Ticket13", "Parsers.TicketContents13.ticketContents13_validator", "Parsers.TicketVersion.ticketVersion", "LowParse.Low.Combinators.validate_false" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val validate_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x))\nlet validate_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =", "completed_definiton": "match x with\n| Ticket12 ->\n [@@ inline_let ]let u:LL.validator (dsnd (parse_ticketContents_cases Ticket12)) =\n ticketContents12_validator\n in\n u\n| Ticket13 ->\n [@@ inline_let ]let u:LL.validator (dsnd (parse_ticketContents_cases Ticket13)) =\n ticketContents13_validator\n in\n u\n| _ -> LL.validate_false ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_accessor'_ticket13", "original_source_type": "val ticketContents_accessor'_ticket13:LL.accessor ticketContents_gaccessor'_ticket13", "source_type": "val ticketContents_accessor'_ticket13:LL.accessor ticketContents_gaccessor'_ticket13", "source_definition": "let ticketContents_accessor'_ticket13 : LL.accessor ticketContents_gaccessor'_ticket13 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.accessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_jumper\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket13)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 261, "start_col": 0, "end_line": 267, "end_col": 40 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))\n\nlet ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_size32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LSZ.size32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_size32 serialize_ticketContents_cases size32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_validator =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.validate_sum ticketContents_sum ticketVersion_repr_validator ticketVersion_repr_reader parse_ticketContents_cases validate_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet ticketContents_jumper =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.jump_sum ticketContents_sum ticketVersion_repr_jumper ticketVersion_repr_reader parse_ticketContents_cases jump_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet lemma_valid_ticketContents_valid_ticketVersion #_ #_ s pos h =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.valid_sum_elim_tag h ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases s pos;\n lemma_synth_ticketVersion_inj ();\n LL.valid_synth h parse_ticketVersion_key synth_ticketVersion s pos\n\nlet ticketContents_gaccessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.gaccessor_ext\n (LL.gaccessor_compose\n (LL.gaccessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.gaccessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_accessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.accessor_ext\n (LL.accessor_compose\n (LL.accessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.accessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n ()\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_bytesize_eqn_ticket12 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket12 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket12 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents12_bytesize_eq (x))\n\nlet ticketContents_bytesize_eqn_ticket13 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket13 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket13 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents13_bytesize_eq (x))\n\nnoextract let ticketContents_clens'_ticket12 : LL.clens ticketContents ticketContents12 = LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket12)\n\nlet ticketContents_gaccessor'_ticket12 : LL.gaccessor ticketContents_parser ticketContents12_parser ticketContents_clens'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.gaccessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)\n\ninline_for_extraction\nlet ticketContents_accessor'_ticket12 : LL.accessor ticketContents_gaccessor'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.accessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_jumper\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)\n\nlet ticketContents_clens_eq_ticket12 : squash (LL.clens_eq ticketContents_clens'_ticket12 ticketContents_clens_ticket12) =\n (_ by (LL.sum_accessor_ext (`ticketContents)))\n\nlet ticketContents_gaccessor_ticket12 =\n LL.gaccessor_ext\n ticketContents_gaccessor'_ticket12\n ticketContents_clens_ticket12\n ticketContents_clens_eq_ticket12\n\nlet ticketContents_accessor_ticket12 =\n LL.accessor_ext\n ticketContents_accessor'_ticket12\n ticketContents_clens_ticket12\n ticketContents_clens_eq_ticket12\n\nnoextract let ticketContents_clens'_ticket13 : LL.clens ticketContents ticketContents13 = LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket13)\n\nlet ticketContents_gaccessor'_ticket13 : LL.gaccessor ticketContents_parser ticketContents13_parser ticketContents_clens'_ticket13 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.gaccessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket13)\n\ninline_for_extraction", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents.ticketContents_gaccessor'_ticket13", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Sum.accessor_clens_sum_payload", "Parsers.TicketContents.ticketContents_sum", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "Parsers.TicketVersion.ticketVersion_repr_jumper", "Parsers.TicketContents.parse_ticketContents_cases", "Parsers.TicketContents.ticketVersion_as_enum_key", "Parsers.TicketVersion.Ticket13", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Sum.parse_sum_kind", "LowParse.Spec.Base.get_parser_kind", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_repr_parser", "Parsers.TicketContents.ticketContents_parser_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_accessor'_ticket13:LL.accessor ticketContents_gaccessor'_ticket13\nlet ticketContents_accessor'_ticket13:LL.accessor ticketContents_gaccessor'_ticket13 =", "completed_definiton": "[@@ inline_let ]let _ =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser)\n ticketContents_sum\n parse_ticketContents_cases ==\n ticketContents_parser_kind);\n ()\nin\nLL.accessor_clens_sum_payload ticketContents_sum\n ticketVersion_repr_jumper\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket13)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.serialize32_ticketContents_cases", "original_source_type": "val serialize32_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x)", "source_type": "val serialize32_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x)", "source_definition": "let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 107, "start_col": 2, "end_line": 110, "end_col": 29 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: LowParse.Spec.Sum.sum_key Parsers.TicketContents.ticketContents_sum\n -> LowParse.SLow.Base.serializer32 (Parsers.TicketContents.serialize_ticketContents_cases x)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Sum.sum_key", "Parsers.TicketContents.ticketContents_sum", "LowParse.SLow.Base.serializer32", "Prims.__proj__Mkdtuple2__item___1", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.parser", "Parsers.TicketContents.ticketContents_case_of_ticketVersion", "Parsers.TicketVersion.Ticket12", "Parsers.TicketContents.parse_ticketContents_cases", "FStar.Pervasives.dsnd", "Parsers.TicketContents.serialize_ticketContents_cases", "Parsers.TicketContents12.ticketContents12_serializer32", "Parsers.TicketVersion.Ticket13", "Parsers.TicketContents13.ticketContents13_serializer32", "Parsers.TicketVersion.ticketVersion", "LowParse.SLow.Combinators.serialize32_false" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize32_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x)\nlet serialize32_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =", "completed_definiton": "match x with\n| Ticket12 ->\n [@@ inline_let ]let u:LS.serializer32 (serialize_ticketContents_cases Ticket12) =\n ticketContents12_serializer32\n in\n u\n| Ticket13 ->\n [@@ inline_let ]let u:LS.serializer32 (serialize_ticketContents_cases Ticket13) =\n ticketContents13_serializer32\n in\n u\n| _ -> LS.serialize32_false", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.size32_ticketContents_cases", "original_source_type": "val size32_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x)", "source_type": "val size32_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x)", "source_definition": "let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 114, "start_col": 2, "end_line": 117, "end_col": 25 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: LowParse.Spec.Sum.sum_key Parsers.TicketContents.ticketContents_sum\n -> LowParse.SLow.Base.size32 (Parsers.TicketContents.serialize_ticketContents_cases x)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Sum.sum_key", "Parsers.TicketContents.ticketContents_sum", "LowParse.SLow.Base.size32", "Prims.__proj__Mkdtuple2__item___1", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.parser", "Parsers.TicketContents.ticketContents_case_of_ticketVersion", "Parsers.TicketVersion.Ticket12", "Parsers.TicketContents.parse_ticketContents_cases", "FStar.Pervasives.dsnd", "Parsers.TicketContents.serialize_ticketContents_cases", "Parsers.TicketContents12.ticketContents12_size32", "Parsers.TicketVersion.Ticket13", "Parsers.TicketContents13.ticketContents13_size32", "Parsers.TicketVersion.ticketVersion", "LowParse.SLow.Combinators.size32_false" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val size32_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x)\nlet size32_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =", "completed_definiton": "match x with\n| Ticket12 ->\n [@@ inline_let ]let u:LSZ.size32 (serialize_ticketContents_cases Ticket12) =\n ticketContents12_size32\n in\n u\n| Ticket13 ->\n [@@ inline_let ]let u:LSZ.size32 (serialize_ticketContents_cases Ticket13) =\n ticketContents13_size32\n in\n u\n| _ -> LSZ.size32_false", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.jump_ticketContents_cases", "original_source_type": "val jump_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x))", "source_type": "val jump_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x))", "source_definition": "let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 128, "start_col": 2, "end_line": 131, "end_col": 22 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: LowParse.Spec.Sum.sum_key Parsers.TicketContents.ticketContents_sum\n -> LowParse.Low.Base.jumper (FStar.Pervasives.dsnd (Parsers.TicketContents.parse_ticketContents_cases\n x))", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Sum.sum_key", "Parsers.TicketContents.ticketContents_sum", "LowParse.Low.Base.jumper", "Prims.__proj__Mkdtuple2__item___1", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.parser", "Parsers.TicketContents.ticketContents_case_of_ticketVersion", "Parsers.TicketVersion.Ticket12", "Parsers.TicketContents.parse_ticketContents_cases", "FStar.Pervasives.dsnd", "Parsers.TicketContents12.ticketContents12_jumper", "Parsers.TicketVersion.Ticket13", "Parsers.TicketContents13.ticketContents13_jumper", "Parsers.TicketVersion.ticketVersion", "LowParse.Low.Combinators.jump_false" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val jump_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x))\nlet jump_ticketContents_cases (x: LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =", "completed_definiton": "match x with\n| Ticket12 ->\n [@@ inline_let ]let u:LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) =\n ticketContents12_jumper\n in\n u\n| Ticket13 ->\n [@@ inline_let ]let u:LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) =\n ticketContents13_jumper\n in\n u\n| _ -> LL.jump_false", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_refine", "original_source_type": "val ticketContents_refine (k: LP.enum_key ticketVersion_enum) (x: ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k)\n (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k)\n (ensures (fun y -> y == x))", "source_type": "val ticketContents_refine (k: LP.enum_key ticketVersion_enum) (x: ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k)\n (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k)\n (ensures (fun y -> y == x))", "source_definition": "let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 48, "start_col": 2, "end_line": 48, "end_col": 84 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n k: LowParse.Spec.Enum.enum_key Parsers.TicketVersion.ticketVersion_enum ->\n x: Parsers.TicketContents.ticketContents\n -> Prims.Pure (LowParse.Spec.Base.refine_with_tag Parsers.TicketContents.key_of_ticketContents k)", "effect": "Prims.Pure", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.enum_key", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_enum", "Parsers.TicketContents.ticketContents", "Prims.unit", "FStar.Pervasives.norm_spec", "Prims.Cons", "FStar.Pervasives.norm_step", "FStar.Pervasives.delta", "FStar.Pervasives.iota", "FStar.Pervasives.zeta", "Prims.Nil", "Parsers.TicketContents.key_of_ticketContents", "LowParse.Spec.Base.refine_with_tag", "Prims.eq2", "FStar.Pervasives.norm", "Parsers.TicketContents12.ticketContents12", "Parsers.TicketContents.ticketVersion_as_enum_key", "Parsers.TicketVersion.Ticket12", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketVersion.Ticket13" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_refine (k: LP.enum_key ticketVersion_enum) (x: ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k)\n (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k)\n (ensures (fun y -> y == x))\nlet ticketContents_refine (k: LP.enum_key ticketVersion_enum) (x: ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k)\n (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k)\n (ensures (fun y -> y == x)) =", "completed_definiton": "[@@ inline_let ]let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in\nx", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.lemma_valid_ticketContents_valid_ticketVersion", "original_source_type": "val lemma_valid_ticketContents_valid_ticketVersion: #rrel: _ -> #rel: _ -> s:LL.slice rrel rel -> pos:U32.t -> h:HyperStack.mem -> Lemma\n (requires LL.valid ticketContents_parser h s pos)\n (ensures (LL.valid ticketVersion_parser h s pos /\\ LL.contents ticketVersion_parser h s pos == tag_of_ticketContents (LL.contents ticketContents_parser h s pos)))\n [SMTPat (LL.valid ticketContents_parser h s pos)]", "source_type": "val lemma_valid_ticketContents_valid_ticketVersion: #rrel: _ -> #rel: _ -> s:LL.slice rrel rel -> pos:U32.t -> h:HyperStack.mem -> Lemma\n (requires LL.valid ticketContents_parser h s pos)\n (ensures (LL.valid ticketVersion_parser h s pos /\\ LL.contents ticketVersion_parser h s pos == tag_of_ticketContents (LL.contents ticketContents_parser h s pos)))\n [SMTPat (LL.valid ticketContents_parser h s pos)]", "source_definition": "let lemma_valid_ticketContents_valid_ticketVersion #_ #_ s pos h =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.valid_sum_elim_tag h ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases s pos;\n lemma_synth_ticketVersion_inj ();\n LL.valid_synth h parse_ticketVersion_key synth_ticketVersion s pos", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 168, "start_col": 2, "end_line": 171, "end_col": 68 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))\n\nlet ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_size32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LSZ.size32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_size32 serialize_ticketContents_cases size32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_validator =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.validate_sum ticketContents_sum ticketVersion_repr_validator ticketVersion_repr_reader parse_ticketContents_cases validate_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet ticketContents_jumper =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.jump_sum ticketContents_sum ticketVersion_repr_jumper ticketVersion_repr_reader parse_ticketContents_cases jump_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: LowParse.Slice.slice rrel rel -> pos: FStar.UInt32.t -> h: FStar.Monotonic.HyperStack.mem\n -> FStar.Pervasives.Lemma\n (requires LowParse.Low.Base.Spec.valid Parsers.TicketContents.ticketContents_parser h s pos)\n (ensures\n LowParse.Low.Base.Spec.valid Parsers.TicketVersion.ticketVersion_parser h s pos /\\\n LowParse.Low.Base.Spec.contents Parsers.TicketVersion.ticketVersion_parser h s pos ==\n Parsers.TicketContents.tag_of_ticketContents (LowParse.Low.Base.Spec.contents Parsers.TicketContents.ticketContents_parser\n h\n s\n pos))\n [SMTPat (LowParse.Low.Base.Spec.valid Parsers.TicketContents.ticketContents_parser h s pos)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "FStar.Monotonic.HyperStack.mem", "LowParse.Low.Combinators.valid_synth", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Enum.enum_key", "Parsers.TicketVersion.ticketVersion", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_enum", "Parsers.TicketVersion.parse_ticketVersion_key", "Parsers.TicketVersion.synth_ticketVersion", "Prims.unit", "Parsers.TicketVersion.lemma_synth_ticketVersion_inj", "LowParse.Low.Sum.valid_sum_elim_tag", "Parsers.TicketContents.ticketContents_sum", "Parsers.TicketVersion.ticketVersion_repr_parser", "Parsers.TicketContents.parse_ticketContents_cases", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Sum.parse_sum_kind", "LowParse.Spec.Base.get_parser_kind", "Parsers.TicketContents.ticketContents_parser_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_valid_ticketContents_valid_ticketVersion: #rrel: _ -> #rel: _ -> s:LL.slice rrel rel -> pos:U32.t -> h:HyperStack.mem -> Lemma\n (requires LL.valid ticketContents_parser h s pos)\n (ensures (LL.valid ticketVersion_parser h s pos /\\ LL.contents ticketVersion_parser h s pos == tag_of_ticketContents (LL.contents ticketContents_parser h s pos)))\n [SMTPat (LL.valid ticketContents_parser h s pos)]\nlet lemma_valid_ticketContents_valid_ticketVersion #_ #_ s pos h =", "completed_definiton": "assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser)\n ticketContents_sum\n parse_ticketContents_cases ==\n ticketContents_parser_kind);\nLL.valid_sum_elim_tag h\n ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n s\n pos;\nlemma_synth_ticketVersion_inj ();\nLL.valid_synth h parse_ticketVersion_key synth_ticketVersion s pos", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.finalize_ticketContents_ticket12", "original_source_type": "val finalize_ticketContents_ticket12 (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack unit\n (requires (fun h ->\n assert_norm (pow2 32 == 4294967296);\nU32.v pos + 1 < 4294967296 /\\ LL.valid ticketContents12_parser h input (pos `U32.add` 1ul) /\\ LL.writable input.LL.base (U32.v pos) (U32.v pos + 1) h))\n (ensures (fun h _ h' ->\n assert_norm (pow2 32 == 4294967296);\n let pos_payload = pos `U32.add` 1ul in\n B.modifies (LL.loc_slice_from_to input pos pos_payload) h h' /\\\n LL.valid_content_pos ticketContents_parser h' input pos (T_ticket12 (LL.contents ticketContents12_parser h input pos_payload)) (LL.get_valid_pos ticketContents12_parser h input pos_payload)\n ))", "source_type": "val finalize_ticketContents_ticket12 (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack unit\n (requires (fun h ->\n assert_norm (pow2 32 == 4294967296);\nU32.v pos + 1 < 4294967296 /\\ LL.valid ticketContents12_parser h input (pos `U32.add` 1ul) /\\ LL.writable input.LL.base (U32.v pos) (U32.v pos + 1) h))\n (ensures (fun h _ h' ->\n assert_norm (pow2 32 == 4294967296);\n let pos_payload = pos `U32.add` 1ul in\n B.modifies (LL.loc_slice_from_to input pos pos_payload) h h' /\\\n LL.valid_content_pos ticketContents_parser h' input pos (T_ticket12 (LL.contents ticketContents12_parser h input pos_payload)) (LL.get_valid_pos ticketContents12_parser h input pos_payload)\n ))", "source_definition": "let finalize_ticketContents_ticket12 #_ #_ input pos =\n [@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n let tg = ticketVersion_as_enum_key Ticket12 in\n let len = LL.serialized_length (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) tg in\n let pk = LP.get_parser_kind (LP.parse_enum_key ticketVersion_repr_parser (LP.sum_enum ticketContents_sum)) in\n assert_norm (pk.LP.parser_kind_low == 1 /\\ pk.LP.parser_kind_high == Some 1);\n assert (1 <= len /\\ len <= 1);\n assert_norm (pow2 32 == 4294967296)\n in\n LL.finalize_sum_case ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_writer parse_ticketContents_cases (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) (ticketVersion_as_enum_key Ticket12) input pos", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 285, "start_col": 2, "end_line": 293, "end_col": 223 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))\n\nlet ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_size32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LSZ.size32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_size32 serialize_ticketContents_cases size32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_validator =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.validate_sum ticketContents_sum ticketVersion_repr_validator ticketVersion_repr_reader parse_ticketContents_cases validate_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet ticketContents_jumper =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.jump_sum ticketContents_sum ticketVersion_repr_jumper ticketVersion_repr_reader parse_ticketContents_cases jump_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet lemma_valid_ticketContents_valid_ticketVersion #_ #_ s pos h =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.valid_sum_elim_tag h ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases s pos;\n lemma_synth_ticketVersion_inj ();\n LL.valid_synth h parse_ticketVersion_key synth_ticketVersion s pos\n\nlet ticketContents_gaccessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.gaccessor_ext\n (LL.gaccessor_compose\n (LL.gaccessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.gaccessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_accessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.accessor_ext\n (LL.accessor_compose\n (LL.accessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.accessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n ()\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_bytesize_eqn_ticket12 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket12 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket12 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents12_bytesize_eq (x))\n\nlet ticketContents_bytesize_eqn_ticket13 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket13 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket13 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents13_bytesize_eq (x))\n\nnoextract let ticketContents_clens'_ticket12 : LL.clens ticketContents ticketContents12 = LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket12)\n\nlet ticketContents_gaccessor'_ticket12 : LL.gaccessor ticketContents_parser ticketContents12_parser ticketContents_clens'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.gaccessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)\n\ninline_for_extraction\nlet ticketContents_accessor'_ticket12 : LL.accessor ticketContents_gaccessor'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.accessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_jumper\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)\n\nlet ticketContents_clens_eq_ticket12 : squash (LL.clens_eq ticketContents_clens'_ticket12 ticketContents_clens_ticket12) =\n (_ by (LL.sum_accessor_ext (`ticketContents)))\n\nlet ticketContents_gaccessor_ticket12 =\n LL.gaccessor_ext\n ticketContents_gaccessor'_ticket12\n ticketContents_clens_ticket12\n ticketContents_clens_eq_ticket12\n\nlet ticketContents_accessor_ticket12 =\n LL.accessor_ext\n ticketContents_accessor'_ticket12\n ticketContents_clens_ticket12\n ticketContents_clens_eq_ticket12\n\nnoextract let ticketContents_clens'_ticket13 : LL.clens ticketContents ticketContents13 = LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket13)\n\nlet ticketContents_gaccessor'_ticket13 : LL.gaccessor ticketContents_parser ticketContents13_parser ticketContents_clens'_ticket13 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.gaccessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket13)\n\ninline_for_extraction\nlet ticketContents_accessor'_ticket13 : LL.accessor ticketContents_gaccessor'_ticket13 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.accessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_jumper\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket13)\n\nlet ticketContents_clens_eq_ticket13 : squash (LL.clens_eq ticketContents_clens'_ticket13 ticketContents_clens_ticket13) =\n (_ by (LL.sum_accessor_ext (`ticketContents)))\n\nlet ticketContents_gaccessor_ticket13 =\n LL.gaccessor_ext\n ticketContents_gaccessor'_ticket13\n ticketContents_clens_ticket13\n ticketContents_clens_eq_ticket13\n\nlet ticketContents_accessor_ticket13 =\n LL.accessor_ext\n ticketContents_accessor'_ticket13\n ticketContents_clens_ticket13\n ticketContents_clens_eq_ticket13", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "input: LowParse.Slice.slice rrel rel -> pos: FStar.UInt32.t -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "LowParse.Low.Sum.finalize_sum_case", "Parsers.TicketContents.ticketContents_sum", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "Parsers.TicketVersion.ticketVersion_repr_serializer", "Parsers.TicketVersion.ticketVersion_repr_writer", "Parsers.TicketContents.parse_ticketContents_cases", "LowParse.Spec.Enum.enum_repr_of_key_cons'", "LowParse.Spec.Sum.sum_key_type", "LowParse.Spec.Sum.sum_repr_type", "LowParse.Spec.Sum.sum_enum", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'", "LowParse.Spec.Enum.enum_tail'", "Parsers.TicketContents.ticketVersion_as_enum_key", "Parsers.TicketVersion.Ticket12", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.int", "Prims.pow2", "Prims._assert", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_low", "FStar.Pervasives.Native.option", "Prims.nat", "LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_high", "FStar.Pervasives.Native.Some", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.get_parser_kind", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Enum.enum_key", "FStar.UInt8.t", "LowParse.Spec.Enum.parse_enum_key", "Parsers.TicketVersion.ticketVersion_repr_parser", "LowParse.Low.Base.Spec.serialized_length", "LowParse.Spec.Enum.serialize_enum_key", "Parsers.TicketVersion.ticketVersion", "Parsers.TicketVersion.ticketVersion_enum", "LowParse.Spec.Sum.parse_sum_kind", "Parsers.TicketContents.ticketContents_parser_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val finalize_ticketContents_ticket12 (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack unit\n (requires (fun h ->\n assert_norm (pow2 32 == 4294967296);\nU32.v pos + 1 < 4294967296 /\\ LL.valid ticketContents12_parser h input (pos `U32.add` 1ul) /\\ LL.writable input.LL.base (U32.v pos) (U32.v pos + 1) h))\n (ensures (fun h _ h' ->\n assert_norm (pow2 32 == 4294967296);\n let pos_payload = pos `U32.add` 1ul in\n B.modifies (LL.loc_slice_from_to input pos pos_payload) h h' /\\\n LL.valid_content_pos ticketContents_parser h' input pos (T_ticket12 (LL.contents ticketContents12_parser h input pos_payload)) (LL.get_valid_pos ticketContents12_parser h input pos_payload)\n ))\nlet finalize_ticketContents_ticket12 #_ #_ input pos =", "completed_definiton": "[@@ inline_let ]let _ =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser)\n ticketContents_sum\n parse_ticketContents_cases ==\n ticketContents_parser_kind);\n let tg = ticketVersion_as_enum_key Ticket12 in\n let len =\n LL.serialized_length (LP.serialize_enum_key _\n ticketVersion_repr_serializer\n (LP.sum_enum ticketContents_sum))\n tg\n in\n let pk =\n LP.get_parser_kind (LP.parse_enum_key ticketVersion_repr_parser (LP.sum_enum ticketContents_sum)\n )\n in\n assert_norm (pk.LP.parser_kind_low == 1 /\\ pk.LP.parser_kind_high == Some 1);\n assert (1 <= len /\\ len <= 1);\n assert_norm (pow2 32 == 4294967296)\nin\nLL.finalize_sum_case ticketContents_sum\n ticketVersion_repr_serializer\n ticketVersion_repr_writer\n parse_ticketContents_cases\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.enum_repr_of_key_tac ticketVersion_enum)))\n (ticketVersion_as_enum_key Ticket12)\n input\n pos", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.finalize_ticketContents_ticket13", "original_source_type": "val finalize_ticketContents_ticket13 (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack unit\n (requires (fun h ->\n assert_norm (pow2 32 == 4294967296);\nU32.v pos + 1 < 4294967296 /\\ LL.valid ticketContents13_parser h input (pos `U32.add` 1ul) /\\ LL.writable input.LL.base (U32.v pos) (U32.v pos + 1) h))\n (ensures (fun h _ h' ->\n assert_norm (pow2 32 == 4294967296);\n let pos_payload = pos `U32.add` 1ul in\n B.modifies (LL.loc_slice_from_to input pos pos_payload) h h' /\\\n LL.valid_content_pos ticketContents_parser h' input pos (T_ticket13 (LL.contents ticketContents13_parser h input pos_payload)) (LL.get_valid_pos ticketContents13_parser h input pos_payload)\n ))", "source_type": "val finalize_ticketContents_ticket13 (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack unit\n (requires (fun h ->\n assert_norm (pow2 32 == 4294967296);\nU32.v pos + 1 < 4294967296 /\\ LL.valid ticketContents13_parser h input (pos `U32.add` 1ul) /\\ LL.writable input.LL.base (U32.v pos) (U32.v pos + 1) h))\n (ensures (fun h _ h' ->\n assert_norm (pow2 32 == 4294967296);\n let pos_payload = pos `U32.add` 1ul in\n B.modifies (LL.loc_slice_from_to input pos pos_payload) h h' /\\\n LL.valid_content_pos ticketContents_parser h' input pos (T_ticket13 (LL.contents ticketContents13_parser h input pos_payload)) (LL.get_valid_pos ticketContents13_parser h input pos_payload)\n ))", "source_definition": "let finalize_ticketContents_ticket13 #_ #_ input pos =\n [@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n let tg = ticketVersion_as_enum_key Ticket13 in\n let len = LL.serialized_length (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) tg in\n let pk = LP.get_parser_kind (LP.parse_enum_key ticketVersion_repr_parser (LP.sum_enum ticketContents_sum)) in\n assert_norm (pk.LP.parser_kind_low == 1 /\\ pk.LP.parser_kind_high == Some 1);\n assert (1 <= len /\\ len <= 1);\n assert_norm (pow2 32 == 4294967296)\n in\n LL.finalize_sum_case ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_writer parse_ticketContents_cases (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) (ticketVersion_as_enum_key Ticket13) input pos", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 296, "start_col": 2, "end_line": 304, "end_col": 223 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))\n\nlet ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_size32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LSZ.size32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_size32 serialize_ticketContents_cases size32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_validator =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.validate_sum ticketContents_sum ticketVersion_repr_validator ticketVersion_repr_reader parse_ticketContents_cases validate_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet ticketContents_jumper =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.jump_sum ticketContents_sum ticketVersion_repr_jumper ticketVersion_repr_reader parse_ticketContents_cases jump_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet lemma_valid_ticketContents_valid_ticketVersion #_ #_ s pos h =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.valid_sum_elim_tag h ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases s pos;\n lemma_synth_ticketVersion_inj ();\n LL.valid_synth h parse_ticketVersion_key synth_ticketVersion s pos\n\nlet ticketContents_gaccessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.gaccessor_ext\n (LL.gaccessor_compose\n (LL.gaccessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.gaccessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_accessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.accessor_ext\n (LL.accessor_compose\n (LL.accessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.accessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n ()\n )\n ticketContents_clens_tag\n ()\n\nlet ticketContents_bytesize_eqn_ticket12 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket12 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket12 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents12_bytesize_eq (x))\n\nlet ticketContents_bytesize_eqn_ticket13 x =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n\n LP.serialize_sum_eq ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases (T_ticket13 x);\n (let ln = FStar.Seq.length (LP.serialize (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) (key_of_ticketContents (T_ticket13 x))) in assert (1 <= ln /\\ ln <= 1));\n (ticketContents13_bytesize_eq (x))\n\nnoextract let ticketContents_clens'_ticket12 : LL.clens ticketContents ticketContents12 = LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket12)\n\nlet ticketContents_gaccessor'_ticket12 : LL.gaccessor ticketContents_parser ticketContents12_parser ticketContents_clens'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.gaccessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)\n\ninline_for_extraction\nlet ticketContents_accessor'_ticket12 : LL.accessor ticketContents_gaccessor'_ticket12 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.accessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_jumper\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket12)\n\nlet ticketContents_clens_eq_ticket12 : squash (LL.clens_eq ticketContents_clens'_ticket12 ticketContents_clens_ticket12) =\n (_ by (LL.sum_accessor_ext (`ticketContents)))\n\nlet ticketContents_gaccessor_ticket12 =\n LL.gaccessor_ext\n ticketContents_gaccessor'_ticket12\n ticketContents_clens_ticket12\n ticketContents_clens_eq_ticket12\n\nlet ticketContents_accessor_ticket12 =\n LL.accessor_ext\n ticketContents_accessor'_ticket12\n ticketContents_clens_ticket12\n ticketContents_clens_eq_ticket12\n\nnoextract let ticketContents_clens'_ticket13 : LL.clens ticketContents ticketContents13 = LL.clens_sum_payload ticketContents_sum (ticketVersion_as_enum_key Ticket13)\n\nlet ticketContents_gaccessor'_ticket13 : LL.gaccessor ticketContents_parser ticketContents13_parser ticketContents_clens'_ticket13 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.gaccessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket13)\n\ninline_for_extraction\nlet ticketContents_accessor'_ticket13 : LL.accessor ticketContents_gaccessor'_ticket13 =\n[@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n () in\n LL.accessor_clens_sum_payload\n ticketContents_sum\n ticketVersion_repr_jumper\n parse_ticketContents_cases\n (ticketVersion_as_enum_key Ticket13)\n\nlet ticketContents_clens_eq_ticket13 : squash (LL.clens_eq ticketContents_clens'_ticket13 ticketContents_clens_ticket13) =\n (_ by (LL.sum_accessor_ext (`ticketContents)))\n\nlet ticketContents_gaccessor_ticket13 =\n LL.gaccessor_ext\n ticketContents_gaccessor'_ticket13\n ticketContents_clens_ticket13\n ticketContents_clens_eq_ticket13\n\nlet ticketContents_accessor_ticket13 =\n LL.accessor_ext\n ticketContents_accessor'_ticket13\n ticketContents_clens_ticket13\n ticketContents_clens_eq_ticket13\n\nlet finalize_ticketContents_ticket12 #_ #_ input pos =\n [@inline_let] let _ = assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n let tg = ticketVersion_as_enum_key Ticket12 in\n let len = LL.serialized_length (LP.serialize_enum_key _ ticketVersion_repr_serializer (LP.sum_enum ticketContents_sum)) tg in\n let pk = LP.get_parser_kind (LP.parse_enum_key ticketVersion_repr_parser (LP.sum_enum ticketContents_sum)) in\n assert_norm (pk.LP.parser_kind_low == 1 /\\ pk.LP.parser_kind_high == Some 1);\n assert (1 <= len /\\ len <= 1);\n assert_norm (pow2 32 == 4294967296)\n in\n LL.finalize_sum_case ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_writer parse_ticketContents_cases (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) (ticketVersion_as_enum_key Ticket12) input pos", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "input: LowParse.Slice.slice rrel rel -> pos: FStar.UInt32.t -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "LowParse.Low.Sum.finalize_sum_case", "Parsers.TicketContents.ticketContents_sum", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "Parsers.TicketVersion.ticketVersion_repr_serializer", "Parsers.TicketVersion.ticketVersion_repr_writer", "Parsers.TicketContents.parse_ticketContents_cases", "LowParse.Spec.Enum.enum_repr_of_key_cons'", "LowParse.Spec.Sum.sum_key_type", "LowParse.Spec.Sum.sum_repr_type", "LowParse.Spec.Sum.sum_enum", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'", "LowParse.Spec.Enum.enum_tail'", "Parsers.TicketContents.ticketVersion_as_enum_key", "Parsers.TicketVersion.Ticket13", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.int", "Prims.pow2", "Prims._assert", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_low", "FStar.Pervasives.Native.option", "Prims.nat", "LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_high", "FStar.Pervasives.Native.Some", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.get_parser_kind", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Enum.enum_key", "FStar.UInt8.t", "LowParse.Spec.Enum.parse_enum_key", "Parsers.TicketVersion.ticketVersion_repr_parser", "LowParse.Low.Base.Spec.serialized_length", "LowParse.Spec.Enum.serialize_enum_key", "Parsers.TicketVersion.ticketVersion", "Parsers.TicketVersion.ticketVersion_enum", "LowParse.Spec.Sum.parse_sum_kind", "Parsers.TicketContents.ticketContents_parser_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val finalize_ticketContents_ticket13 (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack unit\n (requires (fun h ->\n assert_norm (pow2 32 == 4294967296);\nU32.v pos + 1 < 4294967296 /\\ LL.valid ticketContents13_parser h input (pos `U32.add` 1ul) /\\ LL.writable input.LL.base (U32.v pos) (U32.v pos + 1) h))\n (ensures (fun h _ h' ->\n assert_norm (pow2 32 == 4294967296);\n let pos_payload = pos `U32.add` 1ul in\n B.modifies (LL.loc_slice_from_to input pos pos_payload) h h' /\\\n LL.valid_content_pos ticketContents_parser h' input pos (T_ticket13 (LL.contents ticketContents13_parser h input pos_payload)) (LL.get_valid_pos ticketContents13_parser h input pos_payload)\n ))\nlet finalize_ticketContents_ticket13 #_ #_ input pos =", "completed_definiton": "[@@ inline_let ]let _ =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser)\n ticketContents_sum\n parse_ticketContents_cases ==\n ticketContents_parser_kind);\n let tg = ticketVersion_as_enum_key Ticket13 in\n let len =\n LL.serialized_length (LP.serialize_enum_key _\n ticketVersion_repr_serializer\n (LP.sum_enum ticketContents_sum))\n tg\n in\n let pk =\n LP.get_parser_kind (LP.parse_enum_key ticketVersion_repr_parser (LP.sum_enum ticketContents_sum)\n )\n in\n assert_norm (pk.LP.parser_kind_low == 1 /\\ pk.LP.parser_kind_high == Some 1);\n assert (1 <= len /\\ len <= 1);\n assert_norm (pow2 32 == 4294967296)\nin\nLL.finalize_sum_case ticketContents_sum\n ticketVersion_repr_serializer\n ticketVersion_repr_writer\n parse_ticketContents_cases\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.enum_repr_of_key_tac ticketVersion_enum)))\n (ticketVersion_as_enum_key Ticket13)\n input\n pos", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_accessor_tag", "original_source_type": "val ticketContents_accessor_tag : LL.accessor ticketContents_gaccessor_tag", "source_type": "val ticketContents_accessor_tag : LL.accessor ticketContents_gaccessor_tag", "source_definition": "let ticketContents_accessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.accessor_ext\n (LL.accessor_compose\n (LL.accessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.accessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n ()\n )\n ticketContents_clens_tag\n ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 186, "start_col": 2, "end_line": 196, "end_col": 6 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))\n\nlet ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_size32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LSZ.size32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_size32 serialize_ticketContents_cases size32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_validator =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.validate_sum ticketContents_sum ticketVersion_repr_validator ticketVersion_repr_reader parse_ticketContents_cases validate_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet ticketContents_jumper =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.jump_sum ticketContents_sum ticketVersion_repr_jumper ticketVersion_repr_reader parse_ticketContents_cases jump_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet lemma_valid_ticketContents_valid_ticketVersion #_ #_ s pos h =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.valid_sum_elim_tag h ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases s pos;\n lemma_synth_ticketVersion_inj ();\n LL.valid_synth h parse_ticketVersion_key synth_ticketVersion s pos\n\nlet ticketContents_gaccessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.gaccessor_ext\n (LL.gaccessor_compose\n (LL.gaccessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.gaccessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n )\n ticketContents_clens_tag\n ()", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents.ticketContents_gaccessor_tag", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.accessor_ext", "LowParse.Spec.Sum.parse_sum_kind", "LowParse.Spec.Int.parse_u8_kind", "Parsers.TicketContents.ticketContents_sum", "Parsers.TicketContents.parse_ticketContents_cases", "LowParse.Spec.Sum.sum_type", "LowParse.Spec.Sum.parse_sum", "Parsers.TicketVersion.ticketVersion_repr_parser", "LowParse.Spec.Combinators.parse_filter_kind", "Parsers.TicketVersion.ticketVersion", "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.Enum.enum_key", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_enum", "Parsers.TicketVersion.parse_ticketVersion_key", "Parsers.TicketVersion.synth_ticketVersion", "LowParse.Low.Base.Spec.clens_compose", "LowParse.Spec.Sum.sum_key_type", "LowParse.Spec.Sum.sum_repr_type", "LowParse.Spec.Sum.sum_enum", "LowParse.Low.Sum.clens_sum_tag", "LowParse.Low.Combinators.clens_synth_inv", "Parsers.TicketVersion.synth_ticketVersion_inv", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Enum.parse_enum_key", "LowParse.Low.Sum.gaccessor_sum_tag", "LowParse.Low.Combinators.gaccessor_synth_inv", "LowParse.Low.Base.accessor_compose", "LowParse.Low.Sum.accessor_sum_tag", "LowParse.Low.Combinators.accessor_synth_inv", "Parsers.TicketContents.ticketContents_clens_tag", "Prims.unit", "Parsers.TicketVersion.lemma_synth_ticketVersion_inv", "Parsers.TicketVersion.lemma_synth_ticketVersion_inj", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.get_parser_kind", "Parsers.TicketContents.ticketContents_parser_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_accessor_tag : LL.accessor ticketContents_gaccessor_tag\nlet ticketContents_accessor_tag =", "completed_definiton": "assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser)\n ticketContents_sum\n parse_ticketContents_cases ==\n ticketContents_parser_kind);\nlemma_synth_ticketVersion_inj ();\nlemma_synth_ticketVersion_inv ();\nLL.accessor_ext (LL.accessor_compose (LL.accessor_sum_tag ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases)\n (LL.accessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n ())\n ticketContents_clens_tag\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents.fst", "name": "Parsers.TicketContents.ticketContents_gaccessor_tag", "original_source_type": "val ticketContents_gaccessor_tag : LL.gaccessor ticketContents_parser ticketVersion_parser ticketContents_clens_tag", "source_type": "val ticketContents_gaccessor_tag : LL.gaccessor ticketContents_parser ticketVersion_parser ticketContents_clens_tag", "source_definition": "let ticketContents_gaccessor_tag =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n lemma_synth_ticketVersion_inj ();\n lemma_synth_ticketVersion_inv ();\n LL.gaccessor_ext\n (LL.gaccessor_compose\n (LL.gaccessor_sum_tag ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases)\n (LL.gaccessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ())\n )\n ticketContents_clens_tag\n ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 174, "start_col": 2, "end_line": 183, "end_col": 6 }, "file_context": "module Parsers.TicketContents\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nfriend Parsers.TicketVersion\n\n// Need high Z3 limits for large sum types\n#set-options \"--z3rlimit 120\"\n\ninline_for_extraction unfold let ticketVersion_as_enum_key (x:ticketVersion) : Pure (LP.enum_key ticketVersion_enum)\n (requires norm [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) == true) (ensures fun _ -> True) =\n [@inline_let] let _ = norm_spec [delta; zeta; iota; primops] (LP.list_mem x (LP.list_map fst ticketVersion_enum)) in x\n\ninline_for_extraction let key_of_ticketContents (x:ticketContents) : LP.enum_key ticketVersion_enum =\n match x with\n | T_ticket12 _ -> ticketVersion_as_enum_key Ticket12\n | T_ticket13 _ -> ticketVersion_as_enum_key Ticket13\n\ninline_for_extraction let ticketContents_case_of_ticketVersion (x:ticketVersion) : Type0 =\n match x with\n | Ticket12 -> ticketContents12\n | Ticket13 -> ticketContents13\n\nunfold inline_for_extraction let to_ticketContents_case_of_ticketVersion (x:ticketVersion) (#x':ticketVersion) (y:ticketContents_case_of_ticketVersion x') : Pure (norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nunfold inline_for_extraction let ticketContents_refine (k:LP.enum_key ticketVersion_enum) (x:ticketContents)\n : Pure (LP.refine_with_tag key_of_ticketContents k) (requires norm [delta; iota; zeta] (key_of_ticketContents x) == k) (ensures (fun y -> y == x)) =\n [@inline_let] let _ = norm_spec [delta; iota; zeta] (key_of_ticketContents x) in x\n\ninline_for_extraction let synth_ticketContents_cases (x:LP.enum_key ticketVersion_enum) (y:ticketContents_case_of_ticketVersion x)\n : LP.refine_with_tag key_of_ticketContents x =\n match x with\n | Ticket12 -> ticketContents_refine x (T_ticket12 (to_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> ticketContents_refine x (T_ticket13 (to_ticketContents_case_of_ticketVersion Ticket13 y))\n\nunfold inline_for_extraction let from_ticketContents_case_of_ticketVersion (#x':ticketVersion) (x:ticketVersion)\n (y: norm [delta_only [(`%ticketContents_case_of_ticketVersion)]; iota] (ticketContents_case_of_ticketVersion x))\n : Pure (ticketContents_case_of_ticketVersion x') (requires (x == x')) (ensures (fun y' -> y' == y)) =\n [@inline_let] let _ = norm_spec [delta_only [(`%ticketContents_case_of_ticketVersion)] ; iota] (ticketContents_case_of_ticketVersion x) in y\n\nlet synth_ticketContents_cases_recip_pre (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : GTot bool =\n match k with\n | Ticket12 -> T_ticket12? x\n | Ticket13 -> T_ticket13? x\n\nlet synth_ticketContents_cases_recip_pre_intro (k:LP.enum_key ticketVersion_enum) (x:LP.refine_with_tag key_of_ticketContents k)\n : Lemma (synth_ticketContents_cases_recip_pre k x == true) =\n norm_spec [delta; iota] (synth_ticketContents_cases_recip_pre k x)\n\ninline_for_extraction let synth_ticketContents_cases_recip (k:LP.enum_key ticketVersion_enum)\n (x:LP.refine_with_tag key_of_ticketContents k) : (ticketContents_case_of_ticketVersion k) =\n match k with\n | Ticket12 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket12 x in\n (match x with T_ticket12 y -> (from_ticketContents_case_of_ticketVersion Ticket12 y))\n | Ticket13 -> [@inline_let] let _ = synth_ticketContents_cases_recip_pre_intro Ticket13 x in\n (match x with T_ticket13 y -> (from_ticketContents_case_of_ticketVersion Ticket13 y))\n\ninline_for_extraction let ticketContents_sum = LP.make_sum' ticketVersion_enum key_of_ticketContents\n ticketContents_case_of_ticketVersion synth_ticketContents_cases synth_ticketContents_cases_recip\n (_ by (LP.make_sum_synth_case_recip_synth_case_tac ()))\n (_ by (LP.synth_case_synth_case_recip_tac ()))\n\nnoextract let parse_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : k:LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion x) =\n match x with\n | Ticket12 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket12)) = (| _, ticketContents12_parser |) in u\n | Ticket13 -> [@inline_let] let u : (k: LP.parser_kind & LP.parser k (ticketContents_case_of_ticketVersion Ticket13)) = (| _, ticketContents13_parser |) in u\n | _ -> (| _, LP.parse_false |)\n\nnoextract let serialize_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LP.serializer (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_serializer in u\n | Ticket13 -> [@inline_let] let u : LP.serializer (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_serializer in u\n | _ -> LP.serialize_false\n\ninline_for_extraction noextract let parse32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.parser32 (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_parser32 in u\n | Ticket13 -> [@inline_let] let u : LS.parser32 (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_parser32 in u\n | _ -> LS.parse32_false\n\ninline_for_extraction noextract let serialize32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LS.serializer32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket12) = ticketContents12_serializer32 in u\n | Ticket13 -> [@inline_let] let u : LS.serializer32 (serialize_ticketContents_cases Ticket13) = ticketContents13_serializer32 in u\n | _ -> LS.serialize32_false\n\ninline_for_extraction noextract let size32_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LSZ.size32 (serialize_ticketContents_cases x) =\n match x with\n | Ticket12 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket12) = ticketContents12_size32 in u\n | Ticket13 -> [@inline_let] let u : LSZ.size32 (serialize_ticketContents_cases Ticket13) = ticketContents13_size32 in u\n | _ -> LSZ.size32_false\n\ninline_for_extraction noextract let validate_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.validator (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_validator in u\n | Ticket13 -> [@inline_let] let u : LL.validator (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_validator in u\n | _ -> LL.validate_false ()\n\ninline_for_extraction noextract let jump_ticketContents_cases (x:LP.sum_key ticketContents_sum)\n : LL.jumper (dsnd (parse_ticketContents_cases x)) =\n match x with\n | Ticket12 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket12)) = ticketContents12_jumper in u\n | Ticket13 -> [@inline_let] let u : LL.jumper (dsnd (parse_ticketContents_cases Ticket13)) = ticketContents13_jumper in u\n | _ -> LL.jump_false\n\nlet ticketContents_parser =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.parse_sum ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases\n\nlet ticketContents_serializer =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LP.serialize_sum ticketContents_sum ticketVersion_repr_serializer serialize_ticketContents_cases\n\nlet ticketContents_bytesize (x:ticketContents) : GTot nat = Seq.length (ticketContents_serializer x)\n\nlet ticketContents_bytesize_eq x = ()\n\nlet ticketContents_parser32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LS.parse32_sum2 ticketContents_sum ticketVersion_repr_parser ticketVersion_repr_parser32 parse_ticketContents_cases parse32_ticketContents_cases (_ by (LP.enum_destr_tac ticketVersion_enum)) (_ by (LP.maybe_enum_key_of_repr_tac ticketVersion_enum))\n\nlet ticketContents_serializer32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LS.serializer32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LS.serialize32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_serializer32 serialize_ticketContents_cases serialize32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_size32 =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n assert_norm (LSZ.size32_sum_gen_precond (LP.get_parser_kind ticketVersion_repr_parser) (LP.weaken_parse_cases_kind ticketContents_sum parse_ticketContents_cases));\n LSZ.size32_sum2 ticketContents_sum ticketVersion_repr_serializer ticketVersion_repr_size32 serialize_ticketContents_cases size32_ticketContents_cases (_ by (LP.dep_enum_destr_tac ())) (_ by (LP.enum_repr_of_key_tac ticketVersion_enum)) ()\n\nlet ticketContents_validator =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.validate_sum ticketContents_sum ticketVersion_repr_validator ticketVersion_repr_reader parse_ticketContents_cases validate_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet ticketContents_jumper =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.jump_sum ticketContents_sum ticketVersion_repr_jumper ticketVersion_repr_reader parse_ticketContents_cases jump_ticketContents_cases (_ by (LP.dep_maybe_enum_destr_t_tac ()))\n\nlet lemma_valid_ticketContents_valid_ticketVersion #_ #_ s pos h =\n assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser) ticketContents_sum parse_ticketContents_cases == ticketContents_parser_kind);\n LL.valid_sum_elim_tag h ticketContents_sum ticketVersion_repr_parser parse_ticketContents_cases s pos;\n lemma_synth_ticketVersion_inj ();\n LL.valid_synth h parse_ticketVersion_key synth_ticketVersion s pos", "dependencies": { "source_file": "Parsers.TicketContents.fst", "checked_file": "Parsers.TicketContents.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketVersion.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents12" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketVersion" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 120, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.TicketContents.ticketContents_parser\n Parsers.TicketVersion.ticketVersion_parser\n Parsers.TicketContents.ticketContents_clens_tag", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.gaccessor_ext", "LowParse.Spec.Sum.parse_sum_kind", "LowParse.Spec.Int.parse_u8_kind", "Parsers.TicketContents.ticketContents_sum", "Parsers.TicketContents.parse_ticketContents_cases", "LowParse.Spec.Sum.sum_type", "LowParse.Spec.Sum.parse_sum", "Parsers.TicketVersion.ticketVersion_repr_parser", "LowParse.Spec.Combinators.parse_filter_kind", "Parsers.TicketVersion.ticketVersion", "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.Enum.enum_key", "FStar.UInt8.t", "Parsers.TicketVersion.ticketVersion_enum", "Parsers.TicketVersion.parse_ticketVersion_key", "Parsers.TicketVersion.synth_ticketVersion", "LowParse.Low.Base.Spec.clens_compose", "LowParse.Spec.Sum.sum_key_type", "LowParse.Spec.Sum.sum_repr_type", "LowParse.Spec.Sum.sum_enum", "LowParse.Low.Sum.clens_sum_tag", "LowParse.Low.Combinators.clens_synth_inv", "Parsers.TicketVersion.synth_ticketVersion_inv", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Enum.parse_enum_key", "LowParse.Low.Sum.gaccessor_sum_tag", "LowParse.Low.Combinators.gaccessor_synth_inv", "Parsers.TicketContents.ticketContents_clens_tag", "Prims.unit", "Parsers.TicketVersion.lemma_synth_ticketVersion_inv", "Parsers.TicketVersion.lemma_synth_ticketVersion_inj", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.get_parser_kind", "Parsers.TicketContents.ticketContents_parser_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents_gaccessor_tag : LL.gaccessor ticketContents_parser ticketVersion_parser ticketContents_clens_tag\nlet ticketContents_gaccessor_tag =", "completed_definiton": "assert_norm (LP.parse_sum_kind (LP.get_parser_kind ticketVersion_repr_parser)\n ticketContents_sum\n parse_ticketContents_cases ==\n ticketContents_parser_kind);\nlemma_synth_ticketVersion_inj ();\nlemma_synth_ticketVersion_inv ();\nLL.gaccessor_ext (LL.gaccessor_compose (LL.gaccessor_sum_tag ticketContents_sum\n ticketVersion_repr_parser\n parse_ticketContents_cases)\n (LL.gaccessor_synth_inv parse_ticketVersion_key synth_ticketVersion synth_ticketVersion_inv ()\n ))\n ticketContents_clens_tag\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.namedGroup_repr_serializer32", "original_source_type": "", "source_type": "val namedGroup_repr_serializer32 : LowParse.SLow.Base.serializer32 LowParse.Spec.Int.serialize_u16", "source_definition": "let namedGroup_repr_serializer32 = LS.serialize32_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 61, "start_col": 67, "end_line": 61, "end_col": 85 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 LowParse.Spec.Int.serialize_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.serialize32_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let namedGroup_repr_serializer32 =", "completed_definiton": "LS.serialize32_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.namedGroup_repr_serializer", "original_source_type": "", "source_type": "val namedGroup_repr_serializer : LowParse.Spec.Base.serializer LowParse.Spec.Int.parse_u16", "source_definition": "let namedGroup_repr_serializer = LPI.serialize_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 57, "start_col": 43, "end_line": 57, "end_col": 60 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer LowParse.Spec.Int.parse_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Int.serialize_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let namedGroup_repr_serializer =", "completed_definiton": "LPI.serialize_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.namedGroup_repr_size32", "original_source_type": "", "source_type": "val namedGroup_repr_size32 : LowParse.SLow.Base.size32 LowParse.Spec.Int.serialize_u16", "source_definition": "let namedGroup_repr_size32 = LSZ.size32_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 63, "start_col": 61, "end_line": 63, "end_col": 75 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 LowParse.Spec.Int.serialize_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.size32_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let namedGroup_repr_size32 =", "completed_definiton": "LSZ.size32_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.namedGroup_repr_jumper", "original_source_type": "", "source_type": "val namedGroup_repr_jumper : LowParse.Low.Base.jumper LowParse.Spec.Int.parse_u16", "source_definition": "let namedGroup_repr_jumper = LL.jump_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 67, "start_col": 61, "end_line": 67, "end_col": 72 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper LowParse.Spec.Int.parse_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.jump_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let namedGroup_repr_jumper =", "completed_definiton": "LL.jump_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.namedGroup_repr_reader", "original_source_type": "", "source_type": "val namedGroup_repr_reader : LowParse.Low.Base.leaf_reader LowParse.Spec.Int.parse_u16", "source_definition": "let namedGroup_repr_reader = LL.read_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 69, "start_col": 61, "end_line": 69, "end_col": 72 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader LowParse.Spec.Int.parse_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.read_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let namedGroup_repr_reader =", "completed_definiton": "LL.read_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.namedGroup_repr_parser", "original_source_type": "", "source_type": "val namedGroup_repr_parser : LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u16_kind FStar.UInt16.t", "source_definition": "let namedGroup_repr_parser = LPI.parse_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 55, "start_col": 39, "end_line": 55, "end_col": 52 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u16_kind FStar.UInt16.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Int.parse_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let namedGroup_repr_parser =", "completed_definiton": "LPI.parse_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.namedGroup_repr_parser32", "original_source_type": "", "source_type": "val namedGroup_repr_parser32 : LowParse.SLow.Base.parser32 LowParse.Spec.Int.parse_u16", "source_definition": "let namedGroup_repr_parser32 = LS.parse32_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 59, "start_col": 63, "end_line": 59, "end_col": 77 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 LowParse.Spec.Int.parse_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.parse32_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let namedGroup_repr_parser32 =", "completed_definiton": "LS.parse32_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.namedGroup_repr_validator", "original_source_type": "", "source_type": "val namedGroup_repr_validator : LowParse.Low.Base.validator LowParse.Spec.Int.parse_u16", "source_definition": "let namedGroup_repr_validator = (LL.validate_u16 ())", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 65, "start_col": 64, "end_line": 65, "end_col": 84 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator LowParse.Spec.Int.parse_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.validate_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let namedGroup_repr_validator =", "completed_definiton": "(LL.validate_u16 ())", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.namedGroup_bytesize", "original_source_type": "val namedGroup_bytesize (x:namedGroup) : GTot nat", "source_type": "val namedGroup_bytesize (x:namedGroup) : GTot nat", "source_definition": "let namedGroup_bytesize (x:namedGroup) : GTot nat = Seq.length (namedGroup_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 125, "start_col": 52, "end_line": 125, "end_col": 88 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let namedGroup_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let namedGroup_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_namedGroup (x:LP.maybe_enum_key namedGroup_enum) : namedGroup = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n Unknown_namedGroup v\n\ninline_for_extraction let synth_namedGroup_inv (x:namedGroup) : LP.maybe_enum_key namedGroup_enum = \n match x with\n | Unknown_namedGroup y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : namedGroup = x in\n [@inline_let] let _ : squash(not (Unknown_namedGroup? x1) ==> LP.list_mem x1 (LP.list_map fst namedGroup_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key namedGroup_enum)\n\nlet lemma_synth_namedGroup_inv' () : Lemma\n (LP.synth_inverse synth_namedGroup_inv synth_namedGroup)\n= LP.forall_maybe_enum_key namedGroup_enum (fun x -> synth_namedGroup_inv (synth_namedGroup x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_namedGroup_inj () : Lemma\n (LP.synth_injective synth_namedGroup) = \n lemma_synth_namedGroup_inv' ();\n LP.synth_inverse_synth_injective synth_namedGroup synth_namedGroup_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_namedGroup_inv () : Lemma\n (LP.synth_inverse synth_namedGroup synth_namedGroup_inv) = allow_inversion namedGroup; ()\n\n#pop-options\nnoextract let parse_maybe_namedGroup_key : LP.parser _ (LP.maybe_enum_key namedGroup_enum) =\n LP.parse_maybe_enum_key namedGroup_repr_parser namedGroup_enum\n\nnoextract let serialize_maybe_namedGroup_key : LP.serializer parse_maybe_namedGroup_key =\n LP.serialize_maybe_enum_key namedGroup_repr_parser namedGroup_repr_serializer namedGroup_enum\n\nnoextract let namedGroup_parser : LP.parser _ namedGroup =\n lemma_synth_namedGroup_inj ();\n parse_maybe_namedGroup_key `LP.parse_synth` synth_namedGroup\n\nnoextract let namedGroup_serializer : LP.serializer namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LP.serialize_synth _ synth_namedGroup serialize_maybe_namedGroup_key synth_namedGroup_inv ()", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.NamedGroup.namedGroup -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.NamedGroup.namedGroup", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.NamedGroup.namedGroup_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroup_bytesize (x:namedGroup) : GTot nat\nlet namedGroup_bytesize (x: namedGroup) : GTot nat =", "completed_definiton": "Seq.length (namedGroup_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.namedGroup_repr_writer", "original_source_type": "", "source_type": "val namedGroup_repr_writer : LowParse.Low.Base.leaf_writer_strong LowParse.Spec.Int.serialize_u16", "source_definition": "let namedGroup_repr_writer = LL.write_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 71, "start_col": 61, "end_line": 71, "end_col": 73 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let namedGroup_repr_reader = LL.read_u16", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong LowParse.Spec.Int.serialize_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.write_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let namedGroup_repr_writer =", "completed_definiton": "LL.write_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.namedGroup_serializer", "original_source_type": "val namedGroup_serializer: LP.serializer namedGroup_parser", "source_type": "val namedGroup_serializer: LP.serializer namedGroup_parser", "source_definition": "let namedGroup_serializer : LP.serializer namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LP.serialize_synth _ synth_namedGroup serialize_maybe_namedGroup_key synth_namedGroup_inv ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 121, "start_col": 2, "end_line": 123, "end_col": 94 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let namedGroup_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let namedGroup_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_namedGroup (x:LP.maybe_enum_key namedGroup_enum) : namedGroup = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n Unknown_namedGroup v\n\ninline_for_extraction let synth_namedGroup_inv (x:namedGroup) : LP.maybe_enum_key namedGroup_enum = \n match x with\n | Unknown_namedGroup y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : namedGroup = x in\n [@inline_let] let _ : squash(not (Unknown_namedGroup? x1) ==> LP.list_mem x1 (LP.list_map fst namedGroup_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key namedGroup_enum)\n\nlet lemma_synth_namedGroup_inv' () : Lemma\n (LP.synth_inverse synth_namedGroup_inv synth_namedGroup)\n= LP.forall_maybe_enum_key namedGroup_enum (fun x -> synth_namedGroup_inv (synth_namedGroup x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_namedGroup_inj () : Lemma\n (LP.synth_injective synth_namedGroup) = \n lemma_synth_namedGroup_inv' ();\n LP.synth_inverse_synth_injective synth_namedGroup synth_namedGroup_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_namedGroup_inv () : Lemma\n (LP.synth_inverse synth_namedGroup synth_namedGroup_inv) = allow_inversion namedGroup; ()\n\n#pop-options\nnoextract let parse_maybe_namedGroup_key : LP.parser _ (LP.maybe_enum_key namedGroup_enum) =\n LP.parse_maybe_enum_key namedGroup_repr_parser namedGroup_enum\n\nnoextract let serialize_maybe_namedGroup_key : LP.serializer parse_maybe_namedGroup_key =\n LP.serialize_maybe_enum_key namedGroup_repr_parser namedGroup_repr_serializer namedGroup_enum\n\nnoextract let namedGroup_parser : LP.parser _ namedGroup =\n lemma_synth_namedGroup_inj ();\n parse_maybe_namedGroup_key `LP.parse_synth` synth_namedGroup", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.NamedGroup.namedGroup_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_synth", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.NamedGroup.namedGroup", "FStar.UInt16.t", "Parsers.NamedGroup.namedGroup_enum", "Parsers.NamedGroup.parse_maybe_namedGroup_key", "Parsers.NamedGroup.synth_namedGroup", "Parsers.NamedGroup.serialize_maybe_namedGroup_key", "Parsers.NamedGroup.synth_namedGroup_inv", "Prims.unit", "Parsers.NamedGroup.lemma_synth_namedGroup_inv", "Parsers.NamedGroup.lemma_synth_namedGroup_inj", "LowParse.Spec.Base.serializer", "Parsers.NamedGroup.namedGroup_parser_kind", "Parsers.NamedGroup.namedGroup_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroup_serializer: LP.serializer namedGroup_parser\nlet namedGroup_serializer:LP.serializer namedGroup_parser =", "completed_definiton": "lemma_synth_namedGroup_inj ();\nlemma_synth_namedGroup_inv ();\nLP.serialize_synth _ synth_namedGroup serialize_maybe_namedGroup_key synth_namedGroup_inv ()", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.namedGroup_size32", "original_source_type": "val namedGroup_size32: LSZ.size32 namedGroup_serializer", "source_type": "val namedGroup_size32: LSZ.size32 namedGroup_serializer", "source_definition": "let namedGroup_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond namedGroup_serializer 2ul) in\n LSZ.size32_constant namedGroup_serializer 2ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 146, "start_col": 2, "end_line": 147, "end_col": 50 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let namedGroup_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let namedGroup_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_namedGroup (x:LP.maybe_enum_key namedGroup_enum) : namedGroup = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n Unknown_namedGroup v\n\ninline_for_extraction let synth_namedGroup_inv (x:namedGroup) : LP.maybe_enum_key namedGroup_enum = \n match x with\n | Unknown_namedGroup y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : namedGroup = x in\n [@inline_let] let _ : squash(not (Unknown_namedGroup? x1) ==> LP.list_mem x1 (LP.list_map fst namedGroup_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key namedGroup_enum)\n\nlet lemma_synth_namedGroup_inv' () : Lemma\n (LP.synth_inverse synth_namedGroup_inv synth_namedGroup)\n= LP.forall_maybe_enum_key namedGroup_enum (fun x -> synth_namedGroup_inv (synth_namedGroup x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_namedGroup_inj () : Lemma\n (LP.synth_injective synth_namedGroup) = \n lemma_synth_namedGroup_inv' ();\n LP.synth_inverse_synth_injective synth_namedGroup synth_namedGroup_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_namedGroup_inv () : Lemma\n (LP.synth_inverse synth_namedGroup synth_namedGroup_inv) = allow_inversion namedGroup; ()\n\n#pop-options\nnoextract let parse_maybe_namedGroup_key : LP.parser _ (LP.maybe_enum_key namedGroup_enum) =\n LP.parse_maybe_enum_key namedGroup_repr_parser namedGroup_enum\n\nnoextract let serialize_maybe_namedGroup_key : LP.serializer parse_maybe_namedGroup_key =\n LP.serialize_maybe_enum_key namedGroup_repr_parser namedGroup_repr_serializer namedGroup_enum\n\nnoextract let namedGroup_parser : LP.parser _ namedGroup =\n lemma_synth_namedGroup_inj ();\n parse_maybe_namedGroup_key `LP.parse_synth` synth_namedGroup\n\nnoextract let namedGroup_serializer : LP.serializer namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LP.serialize_synth _ synth_namedGroup serialize_maybe_namedGroup_key synth_namedGroup_inv ()\n\nlet namedGroup_bytesize (x:namedGroup) : GTot nat = Seq.length (namedGroup_serializer x)\n\nlet namedGroup_bytesize_eq x = ()\n\nlet parse32_maybe_namedGroup_key : LS.parser32 parse_maybe_namedGroup_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac namedGroup_repr_parser32 namedGroup_enum)\n\nlet namedGroup_parser32 : LS.parser32 namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n LS.parse32_synth _ synth_namedGroup (fun x->synth_namedGroup x) parse32_maybe_namedGroup_key ()\n\nlet serialize32_maybe_namedGroup_key : LS.serializer32 serialize_maybe_namedGroup_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n namedGroup_repr_serializer32 namedGroup_enum)\n\nlet namedGroup_serializer32 : LS.serializer32 namedGroup_serializer =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LS.serialize32_synth _ synth_namedGroup _ serialize32_maybe_namedGroup_key synth_namedGroup_inv (fun x->synth_namedGroup_inv x) ()", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.NamedGroup.namedGroup_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Base.size32_constant", "Parsers.NamedGroup.namedGroup_parser_kind", "Parsers.NamedGroup.namedGroup", "Parsers.NamedGroup.namedGroup_parser", "Parsers.NamedGroup.namedGroup_serializer", "FStar.UInt32.__uint_to_t", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.SLow.Base.size32_constant_precond" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroup_size32: LSZ.size32 namedGroup_serializer\nlet namedGroup_size32 =", "completed_definiton": "[@@ inline_let ]let _ = assert_norm (LSZ.size32_constant_precond namedGroup_serializer 2ul) in\nLSZ.size32_constant namedGroup_serializer 2ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.namedGroup_parser", "original_source_type": "val namedGroup_parser: LP.parser namedGroup_parser_kind namedGroup", "source_type": "val namedGroup_parser: LP.parser namedGroup_parser_kind namedGroup", "source_definition": "let namedGroup_parser : LP.parser _ namedGroup =\n lemma_synth_namedGroup_inj ();\n parse_maybe_namedGroup_key `LP.parse_synth` synth_namedGroup", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 117, "start_col": 2, "end_line": 118, "end_col": 62 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let namedGroup_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let namedGroup_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_namedGroup (x:LP.maybe_enum_key namedGroup_enum) : namedGroup = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n Unknown_namedGroup v\n\ninline_for_extraction let synth_namedGroup_inv (x:namedGroup) : LP.maybe_enum_key namedGroup_enum = \n match x with\n | Unknown_namedGroup y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : namedGroup = x in\n [@inline_let] let _ : squash(not (Unknown_namedGroup? x1) ==> LP.list_mem x1 (LP.list_map fst namedGroup_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key namedGroup_enum)\n\nlet lemma_synth_namedGroup_inv' () : Lemma\n (LP.synth_inverse synth_namedGroup_inv synth_namedGroup)\n= LP.forall_maybe_enum_key namedGroup_enum (fun x -> synth_namedGroup_inv (synth_namedGroup x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_namedGroup_inj () : Lemma\n (LP.synth_injective synth_namedGroup) = \n lemma_synth_namedGroup_inv' ();\n LP.synth_inverse_synth_injective synth_namedGroup synth_namedGroup_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_namedGroup_inv () : Lemma\n (LP.synth_inverse synth_namedGroup synth_namedGroup_inv) = allow_inversion namedGroup; ()\n\n#pop-options\nnoextract let parse_maybe_namedGroup_key : LP.parser _ (LP.maybe_enum_key namedGroup_enum) =\n LP.parse_maybe_enum_key namedGroup_repr_parser namedGroup_enum\n\nnoextract let serialize_maybe_namedGroup_key : LP.serializer parse_maybe_namedGroup_key =\n LP.serialize_maybe_enum_key namedGroup_repr_parser namedGroup_repr_serializer namedGroup_enum", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.NamedGroup.namedGroup_parser_kind Parsers.NamedGroup.namedGroup", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.NamedGroup.namedGroup", "FStar.UInt16.t", "Parsers.NamedGroup.namedGroup_enum", "Parsers.NamedGroup.parse_maybe_namedGroup_key", "Parsers.NamedGroup.synth_namedGroup", "Prims.unit", "Parsers.NamedGroup.lemma_synth_namedGroup_inj", "LowParse.Spec.Base.parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroup_parser: LP.parser namedGroup_parser_kind namedGroup\nlet namedGroup_parser:LP.parser _ namedGroup =", "completed_definiton": "lemma_synth_namedGroup_inj ();\nparse_maybe_namedGroup_key `LP.parse_synth` synth_namedGroup", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.serialize_maybe_namedGroup_key", "original_source_type": "val serialize_maybe_namedGroup_key:LP.serializer parse_maybe_namedGroup_key", "source_type": "val serialize_maybe_namedGroup_key:LP.serializer parse_maybe_namedGroup_key", "source_definition": "let serialize_maybe_namedGroup_key : LP.serializer parse_maybe_namedGroup_key =\n LP.serialize_maybe_enum_key namedGroup_repr_parser namedGroup_repr_serializer namedGroup_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 114, "start_col": 2, "end_line": 114, "end_col": 95 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let namedGroup_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let namedGroup_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_namedGroup (x:LP.maybe_enum_key namedGroup_enum) : namedGroup = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n Unknown_namedGroup v\n\ninline_for_extraction let synth_namedGroup_inv (x:namedGroup) : LP.maybe_enum_key namedGroup_enum = \n match x with\n | Unknown_namedGroup y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : namedGroup = x in\n [@inline_let] let _ : squash(not (Unknown_namedGroup? x1) ==> LP.list_mem x1 (LP.list_map fst namedGroup_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key namedGroup_enum)\n\nlet lemma_synth_namedGroup_inv' () : Lemma\n (LP.synth_inverse synth_namedGroup_inv synth_namedGroup)\n= LP.forall_maybe_enum_key namedGroup_enum (fun x -> synth_namedGroup_inv (synth_namedGroup x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_namedGroup_inj () : Lemma\n (LP.synth_injective synth_namedGroup) = \n lemma_synth_namedGroup_inv' ();\n LP.synth_inverse_synth_injective synth_namedGroup synth_namedGroup_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_namedGroup_inv () : Lemma\n (LP.synth_inverse synth_namedGroup synth_namedGroup_inv) = allow_inversion namedGroup; ()\n\n#pop-options\nnoextract let parse_maybe_namedGroup_key : LP.parser _ (LP.maybe_enum_key namedGroup_enum) =\n LP.parse_maybe_enum_key namedGroup_repr_parser namedGroup_enum", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.NamedGroup.parse_maybe_namedGroup_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.serialize_maybe_enum_key", "LowParse.Spec.Int.parse_u16_kind", "Parsers.NamedGroup.namedGroup", "FStar.UInt16.t", "Parsers.NamedGroup.namedGroup_repr_parser", "Parsers.NamedGroup.namedGroup_repr_serializer", "Parsers.NamedGroup.namedGroup_enum" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_maybe_namedGroup_key:LP.serializer parse_maybe_namedGroup_key\nlet serialize_maybe_namedGroup_key:LP.serializer parse_maybe_namedGroup_key =", "completed_definiton": "LP.serialize_maybe_enum_key namedGroup_repr_parser namedGroup_repr_serializer namedGroup_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.namedGroup_serializer32", "original_source_type": "val namedGroup_serializer32: LS.serializer32 namedGroup_serializer", "source_type": "val namedGroup_serializer32: LS.serializer32 namedGroup_serializer", "source_definition": "let namedGroup_serializer32 : LS.serializer32 namedGroup_serializer =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LS.serialize32_synth _ synth_namedGroup _ serialize32_maybe_namedGroup_key synth_namedGroup_inv (fun x->synth_namedGroup_inv x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 141, "start_col": 2, "end_line": 143, "end_col": 132 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let namedGroup_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let namedGroup_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_namedGroup (x:LP.maybe_enum_key namedGroup_enum) : namedGroup = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n Unknown_namedGroup v\n\ninline_for_extraction let synth_namedGroup_inv (x:namedGroup) : LP.maybe_enum_key namedGroup_enum = \n match x with\n | Unknown_namedGroup y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : namedGroup = x in\n [@inline_let] let _ : squash(not (Unknown_namedGroup? x1) ==> LP.list_mem x1 (LP.list_map fst namedGroup_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key namedGroup_enum)\n\nlet lemma_synth_namedGroup_inv' () : Lemma\n (LP.synth_inverse synth_namedGroup_inv synth_namedGroup)\n= LP.forall_maybe_enum_key namedGroup_enum (fun x -> synth_namedGroup_inv (synth_namedGroup x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_namedGroup_inj () : Lemma\n (LP.synth_injective synth_namedGroup) = \n lemma_synth_namedGroup_inv' ();\n LP.synth_inverse_synth_injective synth_namedGroup synth_namedGroup_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_namedGroup_inv () : Lemma\n (LP.synth_inverse synth_namedGroup synth_namedGroup_inv) = allow_inversion namedGroup; ()\n\n#pop-options\nnoextract let parse_maybe_namedGroup_key : LP.parser _ (LP.maybe_enum_key namedGroup_enum) =\n LP.parse_maybe_enum_key namedGroup_repr_parser namedGroup_enum\n\nnoextract let serialize_maybe_namedGroup_key : LP.serializer parse_maybe_namedGroup_key =\n LP.serialize_maybe_enum_key namedGroup_repr_parser namedGroup_repr_serializer namedGroup_enum\n\nnoextract let namedGroup_parser : LP.parser _ namedGroup =\n lemma_synth_namedGroup_inj ();\n parse_maybe_namedGroup_key `LP.parse_synth` synth_namedGroup\n\nnoextract let namedGroup_serializer : LP.serializer namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LP.serialize_synth _ synth_namedGroup serialize_maybe_namedGroup_key synth_namedGroup_inv ()\n\nlet namedGroup_bytesize (x:namedGroup) : GTot nat = Seq.length (namedGroup_serializer x)\n\nlet namedGroup_bytesize_eq x = ()\n\nlet parse32_maybe_namedGroup_key : LS.parser32 parse_maybe_namedGroup_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac namedGroup_repr_parser32 namedGroup_enum)\n\nlet namedGroup_parser32 : LS.parser32 namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n LS.parse32_synth _ synth_namedGroup (fun x->synth_namedGroup x) parse32_maybe_namedGroup_key ()\n\nlet serialize32_maybe_namedGroup_key : LS.serializer32 serialize_maybe_namedGroup_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n namedGroup_repr_serializer32 namedGroup_enum)", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.NamedGroup.namedGroup_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_synth", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.NamedGroup.namedGroup", "FStar.UInt16.t", "Parsers.NamedGroup.namedGroup_enum", "Parsers.NamedGroup.parse_maybe_namedGroup_key", "Parsers.NamedGroup.synth_namedGroup", "Parsers.NamedGroup.serialize_maybe_namedGroup_key", "Parsers.NamedGroup.serialize32_maybe_namedGroup_key", "Parsers.NamedGroup.synth_namedGroup_inv", "Prims.eq2", "Prims.unit", "Parsers.NamedGroup.lemma_synth_namedGroup_inv", "Parsers.NamedGroup.lemma_synth_namedGroup_inj", "LowParse.SLow.Base.serializer32", "Parsers.NamedGroup.namedGroup_parser_kind", "Parsers.NamedGroup.namedGroup_parser", "Parsers.NamedGroup.namedGroup_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroup_serializer32: LS.serializer32 namedGroup_serializer\nlet namedGroup_serializer32:LS.serializer32 namedGroup_serializer =", "completed_definiton": "lemma_synth_namedGroup_inj ();\nlemma_synth_namedGroup_inv ();\nLS.serialize32_synth _\n synth_namedGroup\n _\n serialize32_maybe_namedGroup_key\n synth_namedGroup_inv\n (fun x -> synth_namedGroup_inv x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.namedGroup_parser32", "original_source_type": "val namedGroup_parser32: LS.parser32 namedGroup_parser", "source_type": "val namedGroup_parser32: LS.parser32 namedGroup_parser", "source_definition": "let namedGroup_parser32 : LS.parser32 namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n LS.parse32_synth _ synth_namedGroup (fun x->synth_namedGroup x) parse32_maybe_namedGroup_key ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 133, "start_col": 2, "end_line": 134, "end_col": 97 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let namedGroup_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let namedGroup_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_namedGroup (x:LP.maybe_enum_key namedGroup_enum) : namedGroup = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n Unknown_namedGroup v\n\ninline_for_extraction let synth_namedGroup_inv (x:namedGroup) : LP.maybe_enum_key namedGroup_enum = \n match x with\n | Unknown_namedGroup y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : namedGroup = x in\n [@inline_let] let _ : squash(not (Unknown_namedGroup? x1) ==> LP.list_mem x1 (LP.list_map fst namedGroup_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key namedGroup_enum)\n\nlet lemma_synth_namedGroup_inv' () : Lemma\n (LP.synth_inverse synth_namedGroup_inv synth_namedGroup)\n= LP.forall_maybe_enum_key namedGroup_enum (fun x -> synth_namedGroup_inv (synth_namedGroup x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_namedGroup_inj () : Lemma\n (LP.synth_injective synth_namedGroup) = \n lemma_synth_namedGroup_inv' ();\n LP.synth_inverse_synth_injective synth_namedGroup synth_namedGroup_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_namedGroup_inv () : Lemma\n (LP.synth_inverse synth_namedGroup synth_namedGroup_inv) = allow_inversion namedGroup; ()\n\n#pop-options\nnoextract let parse_maybe_namedGroup_key : LP.parser _ (LP.maybe_enum_key namedGroup_enum) =\n LP.parse_maybe_enum_key namedGroup_repr_parser namedGroup_enum\n\nnoextract let serialize_maybe_namedGroup_key : LP.serializer parse_maybe_namedGroup_key =\n LP.serialize_maybe_enum_key namedGroup_repr_parser namedGroup_repr_serializer namedGroup_enum\n\nnoextract let namedGroup_parser : LP.parser _ namedGroup =\n lemma_synth_namedGroup_inj ();\n parse_maybe_namedGroup_key `LP.parse_synth` synth_namedGroup\n\nnoextract let namedGroup_serializer : LP.serializer namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LP.serialize_synth _ synth_namedGroup serialize_maybe_namedGroup_key synth_namedGroup_inv ()\n\nlet namedGroup_bytesize (x:namedGroup) : GTot nat = Seq.length (namedGroup_serializer x)\n\nlet namedGroup_bytesize_eq x = ()\n\nlet parse32_maybe_namedGroup_key : LS.parser32 parse_maybe_namedGroup_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac namedGroup_repr_parser32 namedGroup_enum)", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.NamedGroup.namedGroup_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_synth", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.NamedGroup.namedGroup", "FStar.UInt16.t", "Parsers.NamedGroup.namedGroup_enum", "Parsers.NamedGroup.parse_maybe_namedGroup_key", "Parsers.NamedGroup.synth_namedGroup", "Prims.eq2", "Parsers.NamedGroup.parse32_maybe_namedGroup_key", "Prims.unit", "Parsers.NamedGroup.lemma_synth_namedGroup_inj", "LowParse.SLow.Base.parser32", "Parsers.NamedGroup.namedGroup_parser_kind", "Parsers.NamedGroup.namedGroup_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroup_parser32: LS.parser32 namedGroup_parser\nlet namedGroup_parser32:LS.parser32 namedGroup_parser =", "completed_definiton": "lemma_synth_namedGroup_inj ();\nLS.parse32_synth _ synth_namedGroup (fun x -> synth_namedGroup x) parse32_maybe_namedGroup_key ()", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.read_maybe_namedGroup_key", "original_source_type": "val read_maybe_namedGroup_key:LL.leaf_reader parse_maybe_namedGroup_key", "source_type": "val read_maybe_namedGroup_key:LL.leaf_reader parse_maybe_namedGroup_key", "source_definition": "let read_maybe_namedGroup_key : LL.leaf_reader parse_maybe_namedGroup_key =\n LL.mk_read_maybe_enum_key namedGroup_repr_reader namedGroup_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 151, "start_col": 4, "end_line": 151, "end_col": 68 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let namedGroup_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let namedGroup_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_namedGroup (x:LP.maybe_enum_key namedGroup_enum) : namedGroup = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n Unknown_namedGroup v\n\ninline_for_extraction let synth_namedGroup_inv (x:namedGroup) : LP.maybe_enum_key namedGroup_enum = \n match x with\n | Unknown_namedGroup y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : namedGroup = x in\n [@inline_let] let _ : squash(not (Unknown_namedGroup? x1) ==> LP.list_mem x1 (LP.list_map fst namedGroup_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key namedGroup_enum)\n\nlet lemma_synth_namedGroup_inv' () : Lemma\n (LP.synth_inverse synth_namedGroup_inv synth_namedGroup)\n= LP.forall_maybe_enum_key namedGroup_enum (fun x -> synth_namedGroup_inv (synth_namedGroup x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_namedGroup_inj () : Lemma\n (LP.synth_injective synth_namedGroup) = \n lemma_synth_namedGroup_inv' ();\n LP.synth_inverse_synth_injective synth_namedGroup synth_namedGroup_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_namedGroup_inv () : Lemma\n (LP.synth_inverse synth_namedGroup synth_namedGroup_inv) = allow_inversion namedGroup; ()\n\n#pop-options\nnoextract let parse_maybe_namedGroup_key : LP.parser _ (LP.maybe_enum_key namedGroup_enum) =\n LP.parse_maybe_enum_key namedGroup_repr_parser namedGroup_enum\n\nnoextract let serialize_maybe_namedGroup_key : LP.serializer parse_maybe_namedGroup_key =\n LP.serialize_maybe_enum_key namedGroup_repr_parser namedGroup_repr_serializer namedGroup_enum\n\nnoextract let namedGroup_parser : LP.parser _ namedGroup =\n lemma_synth_namedGroup_inj ();\n parse_maybe_namedGroup_key `LP.parse_synth` synth_namedGroup\n\nnoextract let namedGroup_serializer : LP.serializer namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LP.serialize_synth _ synth_namedGroup serialize_maybe_namedGroup_key synth_namedGroup_inv ()\n\nlet namedGroup_bytesize (x:namedGroup) : GTot nat = Seq.length (namedGroup_serializer x)\n\nlet namedGroup_bytesize_eq x = ()\n\nlet parse32_maybe_namedGroup_key : LS.parser32 parse_maybe_namedGroup_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac namedGroup_repr_parser32 namedGroup_enum)\n\nlet namedGroup_parser32 : LS.parser32 namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n LS.parse32_synth _ synth_namedGroup (fun x->synth_namedGroup x) parse32_maybe_namedGroup_key ()\n\nlet serialize32_maybe_namedGroup_key : LS.serializer32 serialize_maybe_namedGroup_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n namedGroup_repr_serializer32 namedGroup_enum)\n\nlet namedGroup_serializer32 : LS.serializer32 namedGroup_serializer =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LS.serialize32_synth _ synth_namedGroup _ serialize32_maybe_namedGroup_key synth_namedGroup_inv (fun x->synth_namedGroup_inv x) ()\n\nlet namedGroup_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond namedGroup_serializer 2ul) in\n LSZ.size32_constant namedGroup_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader Parsers.NamedGroup.parse_maybe_namedGroup_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.read_maybe_enum_key", "Parsers.NamedGroup.namedGroup", "FStar.UInt16.t", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Int.parse_u16", "Parsers.NamedGroup.namedGroup_repr_reader", "Prims.Cons", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.Mktuple2", "Parsers.NamedGroup.Sect233k1", "FStar.UInt16.__uint_to_t", "Parsers.NamedGroup.Sect233r1", "Parsers.NamedGroup.Sect239k1", "Parsers.NamedGroup.Sect283k1", "Parsers.NamedGroup.Sect283r1", "Parsers.NamedGroup.Sect409k1", "Parsers.NamedGroup.Sect409r1", "Parsers.NamedGroup.Sect571k1", "Parsers.NamedGroup.Sect571r1", "Parsers.NamedGroup.Secp224k1", "Parsers.NamedGroup.Secp224r1", "Parsers.NamedGroup.Secp256k1", "Parsers.NamedGroup.Secp256r1", "Parsers.NamedGroup.Secp384r1", "Parsers.NamedGroup.Secp521r1", "Parsers.NamedGroup.X25519", "Parsers.NamedGroup.X448", "Parsers.NamedGroup.Ffdhe2048", "Parsers.NamedGroup.Ffdhe3072", "Parsers.NamedGroup.Ffdhe4096", "Parsers.NamedGroup.Ffdhe6144", "Parsers.NamedGroup.Ffdhe8192", "Prims.Nil", "LowParse.Spec.Enum.maybe_enum_destr_t_intro", "LowParse.Spec.Enum.maybe_enum_key", "LowParse.Spec.Enum.maybe_enum_destr_cons", "LowParse.Spec.Enum.maybe_enum_destr_nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_maybe_namedGroup_key:LL.leaf_reader parse_maybe_namedGroup_key\nlet read_maybe_namedGroup_key:LL.leaf_reader parse_maybe_namedGroup_key =", "completed_definiton": "LL.mk_read_maybe_enum_key namedGroup_repr_reader namedGroup_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.namedGroup_enum", "original_source_type": "val namedGroup_enum:LP.enum namedGroup U16.t", "source_type": "val namedGroup_enum:LP.enum namedGroup U16.t", "source_definition": "let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 24, "start_col": 2, "end_line": 53, "end_col": 6 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Enum.enum Parsers.NamedGroup.namedGroup FStar.UInt16.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.b2t", "FStar.List.Tot.Base.noRepeats", "FStar.UInt16.t", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "Parsers.NamedGroup.namedGroup", "FStar.Pervasives.Native.snd", "FStar.Pervasives.Native.fst", "Prims.list", "Prims.Cons", "FStar.Pervasives.Native.Mktuple2", "Parsers.NamedGroup.Sect233k1", "FStar.UInt16.__uint_to_t", "Parsers.NamedGroup.Sect233r1", "Parsers.NamedGroup.Sect239k1", "Parsers.NamedGroup.Sect283k1", "Parsers.NamedGroup.Sect283r1", "Parsers.NamedGroup.Sect409k1", "Parsers.NamedGroup.Sect409r1", "Parsers.NamedGroup.Sect571k1", "Parsers.NamedGroup.Sect571r1", "Parsers.NamedGroup.Secp224k1", "Parsers.NamedGroup.Secp224r1", "Parsers.NamedGroup.Secp256k1", "Parsers.NamedGroup.Secp256r1", "Parsers.NamedGroup.Secp384r1", "Parsers.NamedGroup.Secp521r1", "Parsers.NamedGroup.X25519", "Parsers.NamedGroup.X448", "Parsers.NamedGroup.Ffdhe2048", "Parsers.NamedGroup.Ffdhe3072", "Parsers.NamedGroup.Ffdhe4096", "Parsers.NamedGroup.Ffdhe6144", "Parsers.NamedGroup.Ffdhe8192", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroup_enum:LP.enum namedGroup U16.t\nlet namedGroup_enum:LP.enum namedGroup U16.t =", "completed_definiton": "[@@ inline_let ]let e =\n [\n Sect233k1, 6us; Sect233r1, 7us; Sect239k1, 8us; Sect283k1, 9us; Sect283r1, 10us; Sect409k1, 11us;\n Sect409r1, 12us; Sect571k1, 13us; Sect571r1, 14us; Secp224k1, 20us; Secp224r1, 21us;\n Secp256k1, 22us; Secp256r1, 23us; Secp384r1, 24us; Secp521r1, 25us; X25519, 29us; X448, 30us;\n Ffdhe2048, 256us; Ffdhe3072, 257us; Ffdhe4096, 258us; Ffdhe6144, 259us; Ffdhe8192, 260us\n ]\nin\n[@@ inline_let ]let _ = assert_norm (L.noRepeats (LP.list_map fst e)) in\n[@@ inline_let ]let _ = assert_norm (L.noRepeats (LP.list_map snd e)) in\ne", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.namedGroup_reader", "original_source_type": "val namedGroup_reader: LL.leaf_reader namedGroup_parser", "source_type": "val namedGroup_reader: LL.leaf_reader namedGroup_parser", "source_definition": "let namedGroup_reader =\n [@inline_let] let _ = lemma_synth_namedGroup_inj () in\n LL.read_synth' parse_maybe_namedGroup_key synth_namedGroup read_maybe_namedGroup_key ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 154, "start_col": 1, "end_line": 155, "end_col": 88 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let namedGroup_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let namedGroup_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_namedGroup (x:LP.maybe_enum_key namedGroup_enum) : namedGroup = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n Unknown_namedGroup v\n\ninline_for_extraction let synth_namedGroup_inv (x:namedGroup) : LP.maybe_enum_key namedGroup_enum = \n match x with\n | Unknown_namedGroup y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : namedGroup = x in\n [@inline_let] let _ : squash(not (Unknown_namedGroup? x1) ==> LP.list_mem x1 (LP.list_map fst namedGroup_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key namedGroup_enum)\n\nlet lemma_synth_namedGroup_inv' () : Lemma\n (LP.synth_inverse synth_namedGroup_inv synth_namedGroup)\n= LP.forall_maybe_enum_key namedGroup_enum (fun x -> synth_namedGroup_inv (synth_namedGroup x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_namedGroup_inj () : Lemma\n (LP.synth_injective synth_namedGroup) = \n lemma_synth_namedGroup_inv' ();\n LP.synth_inverse_synth_injective synth_namedGroup synth_namedGroup_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_namedGroup_inv () : Lemma\n (LP.synth_inverse synth_namedGroup synth_namedGroup_inv) = allow_inversion namedGroup; ()\n\n#pop-options\nnoextract let parse_maybe_namedGroup_key : LP.parser _ (LP.maybe_enum_key namedGroup_enum) =\n LP.parse_maybe_enum_key namedGroup_repr_parser namedGroup_enum\n\nnoextract let serialize_maybe_namedGroup_key : LP.serializer parse_maybe_namedGroup_key =\n LP.serialize_maybe_enum_key namedGroup_repr_parser namedGroup_repr_serializer namedGroup_enum\n\nnoextract let namedGroup_parser : LP.parser _ namedGroup =\n lemma_synth_namedGroup_inj ();\n parse_maybe_namedGroup_key `LP.parse_synth` synth_namedGroup\n\nnoextract let namedGroup_serializer : LP.serializer namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LP.serialize_synth _ synth_namedGroup serialize_maybe_namedGroup_key synth_namedGroup_inv ()\n\nlet namedGroup_bytesize (x:namedGroup) : GTot nat = Seq.length (namedGroup_serializer x)\n\nlet namedGroup_bytesize_eq x = ()\n\nlet parse32_maybe_namedGroup_key : LS.parser32 parse_maybe_namedGroup_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac namedGroup_repr_parser32 namedGroup_enum)\n\nlet namedGroup_parser32 : LS.parser32 namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n LS.parse32_synth _ synth_namedGroup (fun x->synth_namedGroup x) parse32_maybe_namedGroup_key ()\n\nlet serialize32_maybe_namedGroup_key : LS.serializer32 serialize_maybe_namedGroup_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n namedGroup_repr_serializer32 namedGroup_enum)\n\nlet namedGroup_serializer32 : LS.serializer32 namedGroup_serializer =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LS.serialize32_synth _ synth_namedGroup _ serialize32_maybe_namedGroup_key synth_namedGroup_inv (fun x->synth_namedGroup_inv x) ()\n\nlet namedGroup_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond namedGroup_serializer 2ul) in\n LSZ.size32_constant namedGroup_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_namedGroup_key : LL.leaf_reader parse_maybe_namedGroup_key =\n LL.mk_read_maybe_enum_key namedGroup_repr_reader namedGroup_enum", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader Parsers.NamedGroup.namedGroup_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.read_synth'", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.NamedGroup.namedGroup", "FStar.UInt16.t", "Parsers.NamedGroup.namedGroup_enum", "Parsers.NamedGroup.parse_maybe_namedGroup_key", "Parsers.NamedGroup.synth_namedGroup", "Parsers.NamedGroup.read_maybe_namedGroup_key", "Prims.unit", "Parsers.NamedGroup.lemma_synth_namedGroup_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroup_reader: LL.leaf_reader namedGroup_parser\nlet namedGroup_reader =", "completed_definiton": "[@@ inline_let ]let _ = lemma_synth_namedGroup_inj () in\nLL.read_synth' parse_maybe_namedGroup_key synth_namedGroup read_maybe_namedGroup_key ()", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.lemma_synth_namedGroup_inj", "original_source_type": "val lemma_synth_namedGroup_inj: Prims.unit -> Lemma (LP.synth_injective synth_namedGroup)", "source_type": "val lemma_synth_namedGroup_inj: Prims.unit -> Lemma (LP.synth_injective synth_namedGroup)", "source_definition": "let lemma_synth_namedGroup_inj () : Lemma\n (LP.synth_injective synth_namedGroup) = \n lemma_synth_namedGroup_inv' ();\n LP.synth_inverse_synth_injective synth_namedGroup synth_namedGroup_inv", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 102, "start_col": 2, "end_line": 103, "end_col": 72 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let namedGroup_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let namedGroup_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_namedGroup (x:LP.maybe_enum_key namedGroup_enum) : namedGroup = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n Unknown_namedGroup v\n\ninline_for_extraction let synth_namedGroup_inv (x:namedGroup) : LP.maybe_enum_key namedGroup_enum = \n match x with\n | Unknown_namedGroup y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : namedGroup = x in\n [@inline_let] let _ : squash(not (Unknown_namedGroup? x1) ==> LP.list_mem x1 (LP.list_map fst namedGroup_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key namedGroup_enum)\n\nlet lemma_synth_namedGroup_inv' () : Lemma\n (LP.synth_inverse synth_namedGroup_inv synth_namedGroup)\n= LP.forall_maybe_enum_key namedGroup_enum (fun x -> synth_namedGroup_inv (synth_namedGroup x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_namedGroup_inj () : Lemma", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures LowParse.Spec.Combinators.synth_injective Parsers.NamedGroup.synth_namedGroup)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "LowParse.Spec.Combinators.synth_inverse_synth_injective", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.NamedGroup.namedGroup", "FStar.UInt16.t", "Parsers.NamedGroup.namedGroup_enum", "Parsers.NamedGroup.synth_namedGroup", "Parsers.NamedGroup.synth_namedGroup_inv", "Parsers.NamedGroup.lemma_synth_namedGroup_inv'", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_injective", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_synth_namedGroup_inj: Prims.unit -> Lemma (LP.synth_injective synth_namedGroup)\nlet lemma_synth_namedGroup_inj () : Lemma (LP.synth_injective synth_namedGroup) =", "completed_definiton": "lemma_synth_namedGroup_inv' ();\nLP.synth_inverse_synth_injective synth_namedGroup synth_namedGroup_inv", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.namedGroup_writer", "original_source_type": "val namedGroup_writer: LL.leaf_writer_strong namedGroup_serializer", "source_type": "val namedGroup_writer: LL.leaf_writer_strong namedGroup_serializer", "source_definition": "let namedGroup_writer =\n [@inline_let] let _ = lemma_synth_namedGroup_inj (); lemma_synth_namedGroup_inv () in\n LL.write_synth write_maybe_namedGroup_key synth_namedGroup synth_namedGroup_inv (fun x -> synth_namedGroup_inv x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 164, "start_col": 2, "end_line": 165, "end_col": 118 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let namedGroup_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let namedGroup_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_namedGroup (x:LP.maybe_enum_key namedGroup_enum) : namedGroup = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n Unknown_namedGroup v\n\ninline_for_extraction let synth_namedGroup_inv (x:namedGroup) : LP.maybe_enum_key namedGroup_enum = \n match x with\n | Unknown_namedGroup y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : namedGroup = x in\n [@inline_let] let _ : squash(not (Unknown_namedGroup? x1) ==> LP.list_mem x1 (LP.list_map fst namedGroup_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key namedGroup_enum)\n\nlet lemma_synth_namedGroup_inv' () : Lemma\n (LP.synth_inverse synth_namedGroup_inv synth_namedGroup)\n= LP.forall_maybe_enum_key namedGroup_enum (fun x -> synth_namedGroup_inv (synth_namedGroup x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_namedGroup_inj () : Lemma\n (LP.synth_injective synth_namedGroup) = \n lemma_synth_namedGroup_inv' ();\n LP.synth_inverse_synth_injective synth_namedGroup synth_namedGroup_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_namedGroup_inv () : Lemma\n (LP.synth_inverse synth_namedGroup synth_namedGroup_inv) = allow_inversion namedGroup; ()\n\n#pop-options\nnoextract let parse_maybe_namedGroup_key : LP.parser _ (LP.maybe_enum_key namedGroup_enum) =\n LP.parse_maybe_enum_key namedGroup_repr_parser namedGroup_enum\n\nnoextract let serialize_maybe_namedGroup_key : LP.serializer parse_maybe_namedGroup_key =\n LP.serialize_maybe_enum_key namedGroup_repr_parser namedGroup_repr_serializer namedGroup_enum\n\nnoextract let namedGroup_parser : LP.parser _ namedGroup =\n lemma_synth_namedGroup_inj ();\n parse_maybe_namedGroup_key `LP.parse_synth` synth_namedGroup\n\nnoextract let namedGroup_serializer : LP.serializer namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LP.serialize_synth _ synth_namedGroup serialize_maybe_namedGroup_key synth_namedGroup_inv ()\n\nlet namedGroup_bytesize (x:namedGroup) : GTot nat = Seq.length (namedGroup_serializer x)\n\nlet namedGroup_bytesize_eq x = ()\n\nlet parse32_maybe_namedGroup_key : LS.parser32 parse_maybe_namedGroup_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac namedGroup_repr_parser32 namedGroup_enum)\n\nlet namedGroup_parser32 : LS.parser32 namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n LS.parse32_synth _ synth_namedGroup (fun x->synth_namedGroup x) parse32_maybe_namedGroup_key ()\n\nlet serialize32_maybe_namedGroup_key : LS.serializer32 serialize_maybe_namedGroup_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n namedGroup_repr_serializer32 namedGroup_enum)\n\nlet namedGroup_serializer32 : LS.serializer32 namedGroup_serializer =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LS.serialize32_synth _ synth_namedGroup _ serialize32_maybe_namedGroup_key synth_namedGroup_inv (fun x->synth_namedGroup_inv x) ()\n\nlet namedGroup_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond namedGroup_serializer 2ul) in\n LSZ.size32_constant namedGroup_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_namedGroup_key : LL.leaf_reader parse_maybe_namedGroup_key =\n LL.mk_read_maybe_enum_key namedGroup_repr_reader namedGroup_enum\n\nlet namedGroup_reader =\n [@inline_let] let _ = lemma_synth_namedGroup_inj () in\n LL.read_synth' parse_maybe_namedGroup_key synth_namedGroup read_maybe_namedGroup_key ()\n\ninline_for_extraction let write_maybe_namedGroup_key : LL.leaf_writer_strong serialize_maybe_namedGroup_key =\n LL.write_maybe_enum_key namedGroup_repr_writer namedGroup_enum (_ by (LP.enum_repr_of_key_tac namedGroup_enum))\n\ninline_for_extraction let lserialize_maybe_namedGroup_key : LL.serializer32 serialize_maybe_namedGroup_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_namedGroup_key 2ul ()", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong Parsers.NamedGroup.namedGroup_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.write_synth", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.NamedGroup.namedGroup", "FStar.UInt16.t", "Parsers.NamedGroup.namedGroup_enum", "Parsers.NamedGroup.parse_maybe_namedGroup_key", "Parsers.NamedGroup.serialize_maybe_namedGroup_key", "Parsers.NamedGroup.write_maybe_namedGroup_key", "Parsers.NamedGroup.synth_namedGroup", "Parsers.NamedGroup.synth_namedGroup_inv", "Prims.eq2", "Prims.unit", "Parsers.NamedGroup.lemma_synth_namedGroup_inv", "Parsers.NamedGroup.lemma_synth_namedGroup_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroup_writer: LL.leaf_writer_strong namedGroup_serializer\nlet namedGroup_writer =", "completed_definiton": "[@@ inline_let ]let _ =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ()\nin\nLL.write_synth write_maybe_namedGroup_key\n synth_namedGroup\n synth_namedGroup_inv\n (fun x -> synth_namedGroup_inv x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.synth_namedGroup", "original_source_type": "val synth_namedGroup (x: LP.maybe_enum_key namedGroup_enum) : namedGroup", "source_type": "val synth_namedGroup (x: LP.maybe_enum_key namedGroup_enum) : namedGroup", "source_definition": "let synth_namedGroup (x:LP.maybe_enum_key namedGroup_enum) : namedGroup = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n Unknown_namedGroup v", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 74, "start_col": 2, "end_line": 79, "end_col": 24 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let namedGroup_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let namedGroup_repr_writer = LL.write_u16", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: LowParse.Spec.Enum.maybe_enum_key Parsers.NamedGroup.namedGroup_enum\n -> Parsers.NamedGroup.namedGroup", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.maybe_enum_key", "Parsers.NamedGroup.namedGroup", "FStar.UInt16.t", "Parsers.NamedGroup.namedGroup_enum", "LowParse.Spec.Enum.enum_key", "LowParse.Spec.Enum.unknown_enum_repr", "Parsers.NamedGroup.Unknown_namedGroup", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.bool", "LowParse.Spec.Enum.list_mem", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.snd", "Parsers.NamedGroup.known_namedGroup_repr" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_namedGroup (x: LP.maybe_enum_key namedGroup_enum) : namedGroup\nlet synth_namedGroup (x: LP.maybe_enum_key namedGroup_enum) : namedGroup =", "completed_definiton": "match x with\n| LP.Known k -> k\n| LP.Unknown y ->\n [@@ inline_let ]let v:U16.t = y in\n [@@ inline_let ]let _ =\n assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v)\n in\n Unknown_namedGroup v", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.lemma_synth_namedGroup_inv", "original_source_type": "val lemma_synth_namedGroup_inv: Prims.unit\n -> Lemma (LP.synth_inverse synth_namedGroup synth_namedGroup_inv)", "source_type": "val lemma_synth_namedGroup_inv: Prims.unit\n -> Lemma (LP.synth_inverse synth_namedGroup synth_namedGroup_inv)", "source_definition": "let lemma_synth_namedGroup_inv () : Lemma\n (LP.synth_inverse synth_namedGroup synth_namedGroup_inv) = allow_inversion namedGroup; ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 107, "start_col": 61, "end_line": 107, "end_col": 91 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let namedGroup_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let namedGroup_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_namedGroup (x:LP.maybe_enum_key namedGroup_enum) : namedGroup = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n Unknown_namedGroup v\n\ninline_for_extraction let synth_namedGroup_inv (x:namedGroup) : LP.maybe_enum_key namedGroup_enum = \n match x with\n | Unknown_namedGroup y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : namedGroup = x in\n [@inline_let] let _ : squash(not (Unknown_namedGroup? x1) ==> LP.list_mem x1 (LP.list_map fst namedGroup_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key namedGroup_enum)\n\nlet lemma_synth_namedGroup_inv' () : Lemma\n (LP.synth_inverse synth_namedGroup_inv synth_namedGroup)\n= LP.forall_maybe_enum_key namedGroup_enum (fun x -> synth_namedGroup_inv (synth_namedGroup x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_namedGroup_inj () : Lemma\n (LP.synth_injective synth_namedGroup) = \n lemma_synth_namedGroup_inv' ();\n LP.synth_inverse_synth_injective synth_namedGroup synth_namedGroup_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_inverse Parsers.NamedGroup.synth_namedGroup\n Parsers.NamedGroup.synth_namedGroup_inv)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.allow_inversion", "Parsers.NamedGroup.namedGroup", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_inverse", "LowParse.Spec.Enum.maybe_enum_key", "FStar.UInt16.t", "Parsers.NamedGroup.namedGroup_enum", "Parsers.NamedGroup.synth_namedGroup", "Parsers.NamedGroup.synth_namedGroup_inv", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_synth_namedGroup_inv: Prims.unit\n -> Lemma (LP.synth_inverse synth_namedGroup synth_namedGroup_inv)\nlet lemma_synth_namedGroup_inv () : Lemma (LP.synth_inverse synth_namedGroup synth_namedGroup_inv) =", "completed_definiton": "allow_inversion namedGroup;\n()", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.lemma_synth_namedGroup_inv'", "original_source_type": "val lemma_synth_namedGroup_inv': Prims.unit\n -> Lemma (LP.synth_inverse synth_namedGroup_inv synth_namedGroup)", "source_type": "val lemma_synth_namedGroup_inv': Prims.unit\n -> Lemma (LP.synth_inverse synth_namedGroup_inv synth_namedGroup)", "source_definition": "let lemma_synth_namedGroup_inv' () : Lemma\n (LP.synth_inverse synth_namedGroup_inv synth_namedGroup)\n= LP.forall_maybe_enum_key namedGroup_enum (fun x -> synth_namedGroup_inv (synth_namedGroup x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 96, "start_col": 2, "end_line": 98, "end_col": 52 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let namedGroup_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let namedGroup_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_namedGroup (x:LP.maybe_enum_key namedGroup_enum) : namedGroup = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n Unknown_namedGroup v\n\ninline_for_extraction let synth_namedGroup_inv (x:namedGroup) : LP.maybe_enum_key namedGroup_enum = \n match x with\n | Unknown_namedGroup y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : namedGroup = x in\n [@inline_let] let _ : squash(not (Unknown_namedGroup? x1) ==> LP.list_mem x1 (LP.list_map fst namedGroup_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key namedGroup_enum)\n\nlet lemma_synth_namedGroup_inv' () : Lemma", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_inverse Parsers.NamedGroup.synth_namedGroup_inv\n Parsers.NamedGroup.synth_namedGroup)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "LowParse.Spec.Enum.forall_maybe_enum_key", "Parsers.NamedGroup.namedGroup", "FStar.UInt16.t", "Parsers.NamedGroup.namedGroup_enum", "LowParse.Spec.Enum.maybe_enum_key", "Prims.eq2", "Parsers.NamedGroup.synth_namedGroup_inv", "Parsers.NamedGroup.synth_namedGroup", "Prims.squash", "Prims.l_imp", "Prims.bool", "LowParse.Spec.Enum.list_mem", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.snd", "LowParse.Spec.Enum.Unknown", "Prims.l_True", "LowParse.Spec.Combinators.synth_inverse", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_synth_namedGroup_inv': Prims.unit\n -> Lemma (LP.synth_inverse synth_namedGroup_inv synth_namedGroup)\nlet lemma_synth_namedGroup_inv' () : Lemma (LP.synth_inverse synth_namedGroup_inv synth_namedGroup) =", "completed_definiton": "LP.forall_maybe_enum_key namedGroup_enum\n (fun x -> synth_namedGroup_inv (synth_namedGroup x) == x)\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.forall_maybe_enum_key_known_tac ())))\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.forall_maybe_enum_key_unknown_tac ())))", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.namedGroup_lserializer", "original_source_type": "val namedGroup_lserializer: LL.serializer32 namedGroup_serializer", "source_type": "val namedGroup_lserializer: LL.serializer32 namedGroup_serializer", "source_definition": "let namedGroup_lserializer = LL.serializer32_of_leaf_writer_strong_constant_size namedGroup_writer 2ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 167, "start_col": 29, "end_line": 167, "end_col": 105 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let namedGroup_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let namedGroup_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_namedGroup (x:LP.maybe_enum_key namedGroup_enum) : namedGroup = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n Unknown_namedGroup v\n\ninline_for_extraction let synth_namedGroup_inv (x:namedGroup) : LP.maybe_enum_key namedGroup_enum = \n match x with\n | Unknown_namedGroup y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : namedGroup = x in\n [@inline_let] let _ : squash(not (Unknown_namedGroup? x1) ==> LP.list_mem x1 (LP.list_map fst namedGroup_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key namedGroup_enum)\n\nlet lemma_synth_namedGroup_inv' () : Lemma\n (LP.synth_inverse synth_namedGroup_inv synth_namedGroup)\n= LP.forall_maybe_enum_key namedGroup_enum (fun x -> synth_namedGroup_inv (synth_namedGroup x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_namedGroup_inj () : Lemma\n (LP.synth_injective synth_namedGroup) = \n lemma_synth_namedGroup_inv' ();\n LP.synth_inverse_synth_injective synth_namedGroup synth_namedGroup_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_namedGroup_inv () : Lemma\n (LP.synth_inverse synth_namedGroup synth_namedGroup_inv) = allow_inversion namedGroup; ()\n\n#pop-options\nnoextract let parse_maybe_namedGroup_key : LP.parser _ (LP.maybe_enum_key namedGroup_enum) =\n LP.parse_maybe_enum_key namedGroup_repr_parser namedGroup_enum\n\nnoextract let serialize_maybe_namedGroup_key : LP.serializer parse_maybe_namedGroup_key =\n LP.serialize_maybe_enum_key namedGroup_repr_parser namedGroup_repr_serializer namedGroup_enum\n\nnoextract let namedGroup_parser : LP.parser _ namedGroup =\n lemma_synth_namedGroup_inj ();\n parse_maybe_namedGroup_key `LP.parse_synth` synth_namedGroup\n\nnoextract let namedGroup_serializer : LP.serializer namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LP.serialize_synth _ synth_namedGroup serialize_maybe_namedGroup_key synth_namedGroup_inv ()\n\nlet namedGroup_bytesize (x:namedGroup) : GTot nat = Seq.length (namedGroup_serializer x)\n\nlet namedGroup_bytesize_eq x = ()\n\nlet parse32_maybe_namedGroup_key : LS.parser32 parse_maybe_namedGroup_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac namedGroup_repr_parser32 namedGroup_enum)\n\nlet namedGroup_parser32 : LS.parser32 namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n LS.parse32_synth _ synth_namedGroup (fun x->synth_namedGroup x) parse32_maybe_namedGroup_key ()\n\nlet serialize32_maybe_namedGroup_key : LS.serializer32 serialize_maybe_namedGroup_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n namedGroup_repr_serializer32 namedGroup_enum)\n\nlet namedGroup_serializer32 : LS.serializer32 namedGroup_serializer =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LS.serialize32_synth _ synth_namedGroup _ serialize32_maybe_namedGroup_key synth_namedGroup_inv (fun x->synth_namedGroup_inv x) ()\n\nlet namedGroup_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond namedGroup_serializer 2ul) in\n LSZ.size32_constant namedGroup_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_namedGroup_key : LL.leaf_reader parse_maybe_namedGroup_key =\n LL.mk_read_maybe_enum_key namedGroup_repr_reader namedGroup_enum\n\nlet namedGroup_reader =\n [@inline_let] let _ = lemma_synth_namedGroup_inj () in\n LL.read_synth' parse_maybe_namedGroup_key synth_namedGroup read_maybe_namedGroup_key ()\n\ninline_for_extraction let write_maybe_namedGroup_key : LL.leaf_writer_strong serialize_maybe_namedGroup_key =\n LL.write_maybe_enum_key namedGroup_repr_writer namedGroup_enum (_ by (LP.enum_repr_of_key_tac namedGroup_enum))\n\ninline_for_extraction let lserialize_maybe_namedGroup_key : LL.serializer32 serialize_maybe_namedGroup_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_namedGroup_key 2ul ()\n\nlet namedGroup_writer =\n [@inline_let] let _ = lemma_synth_namedGroup_inj (); lemma_synth_namedGroup_inv () in\n LL.write_synth write_maybe_namedGroup_key synth_namedGroup synth_namedGroup_inv (fun x -> synth_namedGroup_inv x) ()", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 Parsers.NamedGroup.namedGroup_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.serializer32_of_leaf_writer_strong_constant_size", "Parsers.NamedGroup.namedGroup_parser_kind", "Parsers.NamedGroup.namedGroup", "Parsers.NamedGroup.namedGroup_parser", "Parsers.NamedGroup.namedGroup_serializer", "Parsers.NamedGroup.namedGroup_writer", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroup_lserializer: LL.serializer32 namedGroup_serializer\nlet namedGroup_lserializer =", "completed_definiton": "LL.serializer32_of_leaf_writer_strong_constant_size namedGroup_writer 2ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.lserialize_maybe_namedGroup_key", "original_source_type": "val lserialize_maybe_namedGroup_key:LL.serializer32 serialize_maybe_namedGroup_key", "source_type": "val lserialize_maybe_namedGroup_key:LL.serializer32 serialize_maybe_namedGroup_key", "source_definition": "let lserialize_maybe_namedGroup_key : LL.serializer32 serialize_maybe_namedGroup_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_namedGroup_key 2ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 161, "start_col": 2, "end_line": 161, "end_col": 87 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let namedGroup_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let namedGroup_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_namedGroup (x:LP.maybe_enum_key namedGroup_enum) : namedGroup = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n Unknown_namedGroup v\n\ninline_for_extraction let synth_namedGroup_inv (x:namedGroup) : LP.maybe_enum_key namedGroup_enum = \n match x with\n | Unknown_namedGroup y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : namedGroup = x in\n [@inline_let] let _ : squash(not (Unknown_namedGroup? x1) ==> LP.list_mem x1 (LP.list_map fst namedGroup_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key namedGroup_enum)\n\nlet lemma_synth_namedGroup_inv' () : Lemma\n (LP.synth_inverse synth_namedGroup_inv synth_namedGroup)\n= LP.forall_maybe_enum_key namedGroup_enum (fun x -> synth_namedGroup_inv (synth_namedGroup x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_namedGroup_inj () : Lemma\n (LP.synth_injective synth_namedGroup) = \n lemma_synth_namedGroup_inv' ();\n LP.synth_inverse_synth_injective synth_namedGroup synth_namedGroup_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_namedGroup_inv () : Lemma\n (LP.synth_inverse synth_namedGroup synth_namedGroup_inv) = allow_inversion namedGroup; ()\n\n#pop-options\nnoextract let parse_maybe_namedGroup_key : LP.parser _ (LP.maybe_enum_key namedGroup_enum) =\n LP.parse_maybe_enum_key namedGroup_repr_parser namedGroup_enum\n\nnoextract let serialize_maybe_namedGroup_key : LP.serializer parse_maybe_namedGroup_key =\n LP.serialize_maybe_enum_key namedGroup_repr_parser namedGroup_repr_serializer namedGroup_enum\n\nnoextract let namedGroup_parser : LP.parser _ namedGroup =\n lemma_synth_namedGroup_inj ();\n parse_maybe_namedGroup_key `LP.parse_synth` synth_namedGroup\n\nnoextract let namedGroup_serializer : LP.serializer namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LP.serialize_synth _ synth_namedGroup serialize_maybe_namedGroup_key synth_namedGroup_inv ()\n\nlet namedGroup_bytesize (x:namedGroup) : GTot nat = Seq.length (namedGroup_serializer x)\n\nlet namedGroup_bytesize_eq x = ()\n\nlet parse32_maybe_namedGroup_key : LS.parser32 parse_maybe_namedGroup_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac namedGroup_repr_parser32 namedGroup_enum)\n\nlet namedGroup_parser32 : LS.parser32 namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n LS.parse32_synth _ synth_namedGroup (fun x->synth_namedGroup x) parse32_maybe_namedGroup_key ()\n\nlet serialize32_maybe_namedGroup_key : LS.serializer32 serialize_maybe_namedGroup_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n namedGroup_repr_serializer32 namedGroup_enum)\n\nlet namedGroup_serializer32 : LS.serializer32 namedGroup_serializer =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LS.serialize32_synth _ synth_namedGroup _ serialize32_maybe_namedGroup_key synth_namedGroup_inv (fun x->synth_namedGroup_inv x) ()\n\nlet namedGroup_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond namedGroup_serializer 2ul) in\n LSZ.size32_constant namedGroup_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_namedGroup_key : LL.leaf_reader parse_maybe_namedGroup_key =\n LL.mk_read_maybe_enum_key namedGroup_repr_reader namedGroup_enum\n\nlet namedGroup_reader =\n [@inline_let] let _ = lemma_synth_namedGroup_inj () in\n LL.read_synth' parse_maybe_namedGroup_key synth_namedGroup read_maybe_namedGroup_key ()\n\ninline_for_extraction let write_maybe_namedGroup_key : LL.leaf_writer_strong serialize_maybe_namedGroup_key =\n LL.write_maybe_enum_key namedGroup_repr_writer namedGroup_enum (_ by (LP.enum_repr_of_key_tac namedGroup_enum))", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 Parsers.NamedGroup.serialize_maybe_namedGroup_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.serializer32_of_leaf_writer_strong_constant_size", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.NamedGroup.namedGroup", "FStar.UInt16.t", "Parsers.NamedGroup.namedGroup_enum", "Parsers.NamedGroup.parse_maybe_namedGroup_key", "Parsers.NamedGroup.serialize_maybe_namedGroup_key", "Parsers.NamedGroup.write_maybe_namedGroup_key", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lserialize_maybe_namedGroup_key:LL.serializer32 serialize_maybe_namedGroup_key\nlet lserialize_maybe_namedGroup_key:LL.serializer32 serialize_maybe_namedGroup_key =", "completed_definiton": "LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_namedGroup_key 2ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.synth_namedGroup_inv", "original_source_type": "val synth_namedGroup_inv (x: namedGroup) : LP.maybe_enum_key namedGroup_enum", "source_type": "val synth_namedGroup_inv (x: namedGroup) : LP.maybe_enum_key namedGroup_enum", "source_definition": "let synth_namedGroup_inv (x:namedGroup) : LP.maybe_enum_key namedGroup_enum = \n match x with\n | Unknown_namedGroup y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : namedGroup = x in\n [@inline_let] let _ : squash(not (Unknown_namedGroup? x1) ==> LP.list_mem x1 (LP.list_map fst namedGroup_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key namedGroup_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 82, "start_col": 2, "end_line": 92, "end_col": 48 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let namedGroup_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let namedGroup_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_namedGroup (x:LP.maybe_enum_key namedGroup_enum) : namedGroup = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n Unknown_namedGroup v", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.NamedGroup.namedGroup\n -> LowParse.Spec.Enum.maybe_enum_key Parsers.NamedGroup.namedGroup_enum", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.NamedGroup.namedGroup", "FStar.UInt16.t", "Prims.b2t", "Prims.op_Negation", "Parsers.NamedGroup.known_namedGroup_repr", "LowParse.Spec.Enum.Unknown", "Parsers.NamedGroup.namedGroup_enum", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.bool", "LowParse.Spec.Enum.list_mem", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.snd", "LowParse.Spec.Enum.Known", "LowParse.Spec.Enum.enum_key", "Prims.squash", "Prims.l_imp", "Parsers.NamedGroup.uu___is_Unknown_namedGroup", "FStar.Pervasives.Native.fst", "LowParse.Spec.Enum.maybe_enum_key" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_namedGroup_inv (x: namedGroup) : LP.maybe_enum_key namedGroup_enum\nlet synth_namedGroup_inv (x: namedGroup) : LP.maybe_enum_key namedGroup_enum =", "completed_definiton": "match x with\n| Unknown_namedGroup y ->\n [@@ inline_let ]let v:U16.t = y in\n [@@ inline_let ]let _ =\n assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v)\n in\n LP.Unknown v\n| x ->\n [@@ inline_let ]let x1:namedGroup = x in\n [@@ inline_let ]let _:squash (not (Unknown_namedGroup? x1) ==>\n LP.list_mem x1 (LP.list_map fst namedGroup_enum)) =\n FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.synth_maybe_enum_key_inv_unknown_tac x1))\n in\n LP.Known (x1 <: LP.enum_key namedGroup_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.namedGroup_bytesize_eqn", "original_source_type": "val namedGroup_bytesize_eqn (x: namedGroup) : Lemma (namedGroup_bytesize x == 2) [SMTPat (namedGroup_bytesize x)]", "source_type": "val namedGroup_bytesize_eqn (x: namedGroup) : Lemma (namedGroup_bytesize x == 2) [SMTPat (namedGroup_bytesize x)]", "source_definition": "let namedGroup_bytesize_eqn x = namedGroup_bytesize_eq x; assert (FStar.Seq.length (LP.serialize namedGroup_serializer x) <= 2); assert (2 <= FStar.Seq.length (LP.serialize namedGroup_serializer x))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 169, "start_col": 32, "end_line": 169, "end_col": 198 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let namedGroup_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let namedGroup_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_namedGroup (x:LP.maybe_enum_key namedGroup_enum) : namedGroup = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n Unknown_namedGroup v\n\ninline_for_extraction let synth_namedGroup_inv (x:namedGroup) : LP.maybe_enum_key namedGroup_enum = \n match x with\n | Unknown_namedGroup y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : namedGroup = x in\n [@inline_let] let _ : squash(not (Unknown_namedGroup? x1) ==> LP.list_mem x1 (LP.list_map fst namedGroup_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key namedGroup_enum)\n\nlet lemma_synth_namedGroup_inv' () : Lemma\n (LP.synth_inverse synth_namedGroup_inv synth_namedGroup)\n= LP.forall_maybe_enum_key namedGroup_enum (fun x -> synth_namedGroup_inv (synth_namedGroup x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_namedGroup_inj () : Lemma\n (LP.synth_injective synth_namedGroup) = \n lemma_synth_namedGroup_inv' ();\n LP.synth_inverse_synth_injective synth_namedGroup synth_namedGroup_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_namedGroup_inv () : Lemma\n (LP.synth_inverse synth_namedGroup synth_namedGroup_inv) = allow_inversion namedGroup; ()\n\n#pop-options\nnoextract let parse_maybe_namedGroup_key : LP.parser _ (LP.maybe_enum_key namedGroup_enum) =\n LP.parse_maybe_enum_key namedGroup_repr_parser namedGroup_enum\n\nnoextract let serialize_maybe_namedGroup_key : LP.serializer parse_maybe_namedGroup_key =\n LP.serialize_maybe_enum_key namedGroup_repr_parser namedGroup_repr_serializer namedGroup_enum\n\nnoextract let namedGroup_parser : LP.parser _ namedGroup =\n lemma_synth_namedGroup_inj ();\n parse_maybe_namedGroup_key `LP.parse_synth` synth_namedGroup\n\nnoextract let namedGroup_serializer : LP.serializer namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LP.serialize_synth _ synth_namedGroup serialize_maybe_namedGroup_key synth_namedGroup_inv ()\n\nlet namedGroup_bytesize (x:namedGroup) : GTot nat = Seq.length (namedGroup_serializer x)\n\nlet namedGroup_bytesize_eq x = ()\n\nlet parse32_maybe_namedGroup_key : LS.parser32 parse_maybe_namedGroup_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac namedGroup_repr_parser32 namedGroup_enum)\n\nlet namedGroup_parser32 : LS.parser32 namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n LS.parse32_synth _ synth_namedGroup (fun x->synth_namedGroup x) parse32_maybe_namedGroup_key ()\n\nlet serialize32_maybe_namedGroup_key : LS.serializer32 serialize_maybe_namedGroup_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n namedGroup_repr_serializer32 namedGroup_enum)\n\nlet namedGroup_serializer32 : LS.serializer32 namedGroup_serializer =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LS.serialize32_synth _ synth_namedGroup _ serialize32_maybe_namedGroup_key synth_namedGroup_inv (fun x->synth_namedGroup_inv x) ()\n\nlet namedGroup_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond namedGroup_serializer 2ul) in\n LSZ.size32_constant namedGroup_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_namedGroup_key : LL.leaf_reader parse_maybe_namedGroup_key =\n LL.mk_read_maybe_enum_key namedGroup_repr_reader namedGroup_enum\n\nlet namedGroup_reader =\n [@inline_let] let _ = lemma_synth_namedGroup_inj () in\n LL.read_synth' parse_maybe_namedGroup_key synth_namedGroup read_maybe_namedGroup_key ()\n\ninline_for_extraction let write_maybe_namedGroup_key : LL.leaf_writer_strong serialize_maybe_namedGroup_key =\n LL.write_maybe_enum_key namedGroup_repr_writer namedGroup_enum (_ by (LP.enum_repr_of_key_tac namedGroup_enum))\n\ninline_for_extraction let lserialize_maybe_namedGroup_key : LL.serializer32 serialize_maybe_namedGroup_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_namedGroup_key 2ul ()\n\nlet namedGroup_writer =\n [@inline_let] let _ = lemma_synth_namedGroup_inj (); lemma_synth_namedGroup_inv () in\n LL.write_synth write_maybe_namedGroup_key synth_namedGroup synth_namedGroup_inv (fun x -> synth_namedGroup_inv x) ()\n\nlet namedGroup_lserializer = LL.serializer32_of_leaf_writer_strong_constant_size namedGroup_writer 2ul ()", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.NamedGroup.namedGroup\n -> FStar.Pervasives.Lemma (ensures Parsers.NamedGroup.namedGroup_bytesize x == 2)\n [SMTPat (Parsers.NamedGroup.namedGroup_bytesize x)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.NamedGroup.namedGroup", "Prims._assert", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "Parsers.NamedGroup.namedGroup_parser_kind", "Parsers.NamedGroup.namedGroup_parser", "Parsers.NamedGroup.namedGroup_serializer", "Prims.unit", "Parsers.NamedGroup.namedGroup_bytesize_eq" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val namedGroup_bytesize_eqn (x: namedGroup) : Lemma (namedGroup_bytesize x == 2) [SMTPat (namedGroup_bytesize x)]\nlet namedGroup_bytesize_eqn x =", "completed_definiton": "namedGroup_bytesize_eq x;\nassert (FStar.Seq.length (LP.serialize namedGroup_serializer x) <= 2);\nassert (2 <= FStar.Seq.length (LP.serialize namedGroup_serializer x))", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.write_maybe_namedGroup_key", "original_source_type": "val write_maybe_namedGroup_key:LL.leaf_writer_strong serialize_maybe_namedGroup_key", "source_type": "val write_maybe_namedGroup_key:LL.leaf_writer_strong serialize_maybe_namedGroup_key", "source_definition": "let write_maybe_namedGroup_key : LL.leaf_writer_strong serialize_maybe_namedGroup_key =\n LL.write_maybe_enum_key namedGroup_repr_writer namedGroup_enum (_ by (LP.enum_repr_of_key_tac namedGroup_enum))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 158, "start_col": 2, "end_line": 158, "end_col": 113 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let namedGroup_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let namedGroup_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_namedGroup (x:LP.maybe_enum_key namedGroup_enum) : namedGroup = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n Unknown_namedGroup v\n\ninline_for_extraction let synth_namedGroup_inv (x:namedGroup) : LP.maybe_enum_key namedGroup_enum = \n match x with\n | Unknown_namedGroup y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : namedGroup = x in\n [@inline_let] let _ : squash(not (Unknown_namedGroup? x1) ==> LP.list_mem x1 (LP.list_map fst namedGroup_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key namedGroup_enum)\n\nlet lemma_synth_namedGroup_inv' () : Lemma\n (LP.synth_inverse synth_namedGroup_inv synth_namedGroup)\n= LP.forall_maybe_enum_key namedGroup_enum (fun x -> synth_namedGroup_inv (synth_namedGroup x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_namedGroup_inj () : Lemma\n (LP.synth_injective synth_namedGroup) = \n lemma_synth_namedGroup_inv' ();\n LP.synth_inverse_synth_injective synth_namedGroup synth_namedGroup_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_namedGroup_inv () : Lemma\n (LP.synth_inverse synth_namedGroup synth_namedGroup_inv) = allow_inversion namedGroup; ()\n\n#pop-options\nnoextract let parse_maybe_namedGroup_key : LP.parser _ (LP.maybe_enum_key namedGroup_enum) =\n LP.parse_maybe_enum_key namedGroup_repr_parser namedGroup_enum\n\nnoextract let serialize_maybe_namedGroup_key : LP.serializer parse_maybe_namedGroup_key =\n LP.serialize_maybe_enum_key namedGroup_repr_parser namedGroup_repr_serializer namedGroup_enum\n\nnoextract let namedGroup_parser : LP.parser _ namedGroup =\n lemma_synth_namedGroup_inj ();\n parse_maybe_namedGroup_key `LP.parse_synth` synth_namedGroup\n\nnoextract let namedGroup_serializer : LP.serializer namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LP.serialize_synth _ synth_namedGroup serialize_maybe_namedGroup_key synth_namedGroup_inv ()\n\nlet namedGroup_bytesize (x:namedGroup) : GTot nat = Seq.length (namedGroup_serializer x)\n\nlet namedGroup_bytesize_eq x = ()\n\nlet parse32_maybe_namedGroup_key : LS.parser32 parse_maybe_namedGroup_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac namedGroup_repr_parser32 namedGroup_enum)\n\nlet namedGroup_parser32 : LS.parser32 namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n LS.parse32_synth _ synth_namedGroup (fun x->synth_namedGroup x) parse32_maybe_namedGroup_key ()\n\nlet serialize32_maybe_namedGroup_key : LS.serializer32 serialize_maybe_namedGroup_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n namedGroup_repr_serializer32 namedGroup_enum)\n\nlet namedGroup_serializer32 : LS.serializer32 namedGroup_serializer =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LS.serialize32_synth _ synth_namedGroup _ serialize32_maybe_namedGroup_key synth_namedGroup_inv (fun x->synth_namedGroup_inv x) ()\n\nlet namedGroup_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond namedGroup_serializer 2ul) in\n LSZ.size32_constant namedGroup_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_namedGroup_key : LL.leaf_reader parse_maybe_namedGroup_key =\n LL.mk_read_maybe_enum_key namedGroup_repr_reader namedGroup_enum\n\nlet namedGroup_reader =\n [@inline_let] let _ = lemma_synth_namedGroup_inj () in\n LL.read_synth' parse_maybe_namedGroup_key synth_namedGroup read_maybe_namedGroup_key ()", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong Parsers.NamedGroup.serialize_maybe_namedGroup_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.write_maybe_enum_key", "Parsers.NamedGroup.namedGroup", "FStar.UInt16.t", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Int.parse_u16", "LowParse.Spec.Int.serialize_u16", "Parsers.NamedGroup.namedGroup_repr_writer", "Parsers.NamedGroup.namedGroup_enum", "LowParse.Spec.Enum.enum_repr_of_key_cons'", "LowParse.Spec.Enum.enum_tail'", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val write_maybe_namedGroup_key:LL.leaf_writer_strong serialize_maybe_namedGroup_key\nlet write_maybe_namedGroup_key:LL.leaf_writer_strong serialize_maybe_namedGroup_key =", "completed_definiton": "LL.write_maybe_enum_key namedGroup_repr_writer\n namedGroup_enum\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.enum_repr_of_key_tac namedGroup_enum)))", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.parse32_maybe_namedGroup_key", "original_source_type": "val parse32_maybe_namedGroup_key:LS.parser32 parse_maybe_namedGroup_key", "source_type": "val parse32_maybe_namedGroup_key:LS.parser32 parse_maybe_namedGroup_key", "source_definition": "let parse32_maybe_namedGroup_key : LS.parser32 parse_maybe_namedGroup_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac namedGroup_repr_parser32 namedGroup_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 130, "start_col": 2, "end_line": 130, "end_col": 104 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let namedGroup_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let namedGroup_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_namedGroup (x:LP.maybe_enum_key namedGroup_enum) : namedGroup = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n Unknown_namedGroup v\n\ninline_for_extraction let synth_namedGroup_inv (x:namedGroup) : LP.maybe_enum_key namedGroup_enum = \n match x with\n | Unknown_namedGroup y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : namedGroup = x in\n [@inline_let] let _ : squash(not (Unknown_namedGroup? x1) ==> LP.list_mem x1 (LP.list_map fst namedGroup_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key namedGroup_enum)\n\nlet lemma_synth_namedGroup_inv' () : Lemma\n (LP.synth_inverse synth_namedGroup_inv synth_namedGroup)\n= LP.forall_maybe_enum_key namedGroup_enum (fun x -> synth_namedGroup_inv (synth_namedGroup x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_namedGroup_inj () : Lemma\n (LP.synth_injective synth_namedGroup) = \n lemma_synth_namedGroup_inv' ();\n LP.synth_inverse_synth_injective synth_namedGroup synth_namedGroup_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_namedGroup_inv () : Lemma\n (LP.synth_inverse synth_namedGroup synth_namedGroup_inv) = allow_inversion namedGroup; ()\n\n#pop-options\nnoextract let parse_maybe_namedGroup_key : LP.parser _ (LP.maybe_enum_key namedGroup_enum) =\n LP.parse_maybe_enum_key namedGroup_repr_parser namedGroup_enum\n\nnoextract let serialize_maybe_namedGroup_key : LP.serializer parse_maybe_namedGroup_key =\n LP.serialize_maybe_enum_key namedGroup_repr_parser namedGroup_repr_serializer namedGroup_enum\n\nnoextract let namedGroup_parser : LP.parser _ namedGroup =\n lemma_synth_namedGroup_inj ();\n parse_maybe_namedGroup_key `LP.parse_synth` synth_namedGroup\n\nnoextract let namedGroup_serializer : LP.serializer namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LP.serialize_synth _ synth_namedGroup serialize_maybe_namedGroup_key synth_namedGroup_inv ()\n\nlet namedGroup_bytesize (x:namedGroup) : GTot nat = Seq.length (namedGroup_serializer x)\n\nlet namedGroup_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.NamedGroup.parse_maybe_namedGroup_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Enum.parse32_maybe_enum_key_gen", "LowParse.Spec.Int.parse_u16_kind", "Parsers.NamedGroup.namedGroup", "FStar.UInt16.t", "LowParse.Spec.Int.parse_u16", "Parsers.NamedGroup.namedGroup_repr_parser32", "Parsers.NamedGroup.namedGroup_enum", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.NamedGroup.parse_maybe_namedGroup_key", "LowParse.Spec.Enum.maybe_enum_key_of_repr'_t_cons'", "LowParse.Spec.Enum.enum_tail'", "LowParse.Spec.Enum.maybe_enum_key_of_repr'_t_cons_nil'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse32_maybe_namedGroup_key:LS.parser32 parse_maybe_namedGroup_key\nlet parse32_maybe_namedGroup_key:LS.parser32 parse_maybe_namedGroup_key =", "completed_definiton": "FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac namedGroup_repr_parser32\n namedGroup_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.NamedGroup.fst", "name": "Parsers.NamedGroup.serialize32_maybe_namedGroup_key", "original_source_type": "val serialize32_maybe_namedGroup_key:LS.serializer32 serialize_maybe_namedGroup_key", "source_type": "val serialize32_maybe_namedGroup_key:LS.serializer32 serialize_maybe_namedGroup_key", "source_definition": "let serialize32_maybe_namedGroup_key : LS.serializer32 serialize_maybe_namedGroup_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n namedGroup_repr_serializer32 namedGroup_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.NamedGroup.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 137, "start_col": 2, "end_line": 138, "end_col": 49 }, "file_context": "module Parsers.NamedGroup\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let namedGroup_enum : LP.enum namedGroup U16.t =\n [@inline_let] let e = [\n Sect233k1, 6us;\n Sect233r1, 7us;\n Sect239k1, 8us;\n Sect283k1, 9us;\n Sect283r1, 10us;\n Sect409k1, 11us;\n Sect409r1, 12us;\n Sect571k1, 13us;\n Sect571r1, 14us;\n Secp224k1, 20us;\n Secp224r1, 21us;\n Secp256k1, 22us;\n Secp256r1, 23us;\n Secp384r1, 24us;\n Secp521r1, 25us;\n X25519, 29us;\n X448, 30us;\n Ffdhe2048, 256us;\n Ffdhe3072, 257us;\n Ffdhe4096, 258us;\n Ffdhe6144, 259us;\n Ffdhe8192, 260us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let namedGroup_repr_parser = LPI.parse_u16\n\nnoextract let namedGroup_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let namedGroup_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let namedGroup_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let namedGroup_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let namedGroup_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let namedGroup_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let namedGroup_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let namedGroup_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_namedGroup (x:LP.maybe_enum_key namedGroup_enum) : namedGroup = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n Unknown_namedGroup v\n\ninline_for_extraction let synth_namedGroup_inv (x:namedGroup) : LP.maybe_enum_key namedGroup_enum = \n match x with\n | Unknown_namedGroup y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd namedGroup_enum) == known_namedGroup_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : namedGroup = x in\n [@inline_let] let _ : squash(not (Unknown_namedGroup? x1) ==> LP.list_mem x1 (LP.list_map fst namedGroup_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key namedGroup_enum)\n\nlet lemma_synth_namedGroup_inv' () : Lemma\n (LP.synth_inverse synth_namedGroup_inv synth_namedGroup)\n= LP.forall_maybe_enum_key namedGroup_enum (fun x -> synth_namedGroup_inv (synth_namedGroup x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_namedGroup_inj () : Lemma\n (LP.synth_injective synth_namedGroup) = \n lemma_synth_namedGroup_inv' ();\n LP.synth_inverse_synth_injective synth_namedGroup synth_namedGroup_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_namedGroup_inv () : Lemma\n (LP.synth_inverse synth_namedGroup synth_namedGroup_inv) = allow_inversion namedGroup; ()\n\n#pop-options\nnoextract let parse_maybe_namedGroup_key : LP.parser _ (LP.maybe_enum_key namedGroup_enum) =\n LP.parse_maybe_enum_key namedGroup_repr_parser namedGroup_enum\n\nnoextract let serialize_maybe_namedGroup_key : LP.serializer parse_maybe_namedGroup_key =\n LP.serialize_maybe_enum_key namedGroup_repr_parser namedGroup_repr_serializer namedGroup_enum\n\nnoextract let namedGroup_parser : LP.parser _ namedGroup =\n lemma_synth_namedGroup_inj ();\n parse_maybe_namedGroup_key `LP.parse_synth` synth_namedGroup\n\nnoextract let namedGroup_serializer : LP.serializer namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n lemma_synth_namedGroup_inv ();\n LP.serialize_synth _ synth_namedGroup serialize_maybe_namedGroup_key synth_namedGroup_inv ()\n\nlet namedGroup_bytesize (x:namedGroup) : GTot nat = Seq.length (namedGroup_serializer x)\n\nlet namedGroup_bytesize_eq x = ()\n\nlet parse32_maybe_namedGroup_key : LS.parser32 parse_maybe_namedGroup_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac namedGroup_repr_parser32 namedGroup_enum)\n\nlet namedGroup_parser32 : LS.parser32 namedGroup_parser =\n lemma_synth_namedGroup_inj ();\n LS.parse32_synth _ synth_namedGroup (fun x->synth_namedGroup x) parse32_maybe_namedGroup_key ()", "dependencies": { "source_file": "Parsers.NamedGroup.fst", "checked_file": "Parsers.NamedGroup.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.NamedGroup.serialize_maybe_namedGroup_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Enum.serialize32_maybe_enum_key_gen", "LowParse.Spec.Int.parse_u16_kind", "Parsers.NamedGroup.namedGroup", "FStar.UInt16.t", "LowParse.Spec.Int.parse_u16", "LowParse.Spec.Int.serialize_u16", "Parsers.NamedGroup.namedGroup_repr_serializer32", "Parsers.NamedGroup.namedGroup_enum", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.NamedGroup.parse_maybe_namedGroup_key", "Parsers.NamedGroup.serialize_maybe_namedGroup_key", "LowParse.Spec.Enum.enum_repr_of_key_cons'", "LowParse.Spec.Enum.enum_tail'", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize32_maybe_namedGroup_key:LS.serializer32 serialize_maybe_namedGroup_key\nlet serialize32_maybe_namedGroup_key:LS.serializer32 serialize_maybe_namedGroup_key =", "completed_definiton": "FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac namedGroup_repr_serializer32\n namedGroup_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_label.fsti", "name": "Parsers.HKDF.HkdfLabel_label.max_len", "original_source_type": "", "source_type": "val max_len : Prims.int", "source_definition": "let max_len = 255", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_label.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 22, "start_col": 46, "end_line": 22, "end_col": 49 }, "file_context": "module Parsers.HKDF.HkdfLabel_label\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_label.fsti", "checked_file": "Parsers.HKDF.HkdfLabel_label.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.int", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let max_len =", "completed_definiton": "255", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_label.fsti", "name": "Parsers.HKDF.HkdfLabel_label.min_len", "original_source_type": "", "source_type": "val min_len : Prims.int", "source_definition": "let min_len = 7", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_label.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 21, "start_col": 46, "end_line": 21, "end_col": 47 }, "file_context": "module Parsers.HKDF.HkdfLabel_label\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_label.fsti", "checked_file": "Parsers.HKDF.HkdfLabel_label.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.int", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let min_len =", "completed_definiton": "7", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel_label.fsti", "name": "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label_parser_kind", "original_source_type": "", "source_type": "val hkdfLabel_label_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let hkdfLabel_label_parser_kind = LP.strong_parser_kind 8 256 None", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel_label.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 25, "start_col": 66, "end_line": 25, "end_col": 98 }, "file_context": "module Parsers.HKDF.HkdfLabel_label\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\ninline_for_extraction noextract let min_len = 7\ninline_for_extraction noextract let max_len = 255\ntype hkdfLabel_label = b:bytes{7 <= length b /\\ length b <= 255}", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel_label.fsti", "checked_file": "Parsers.HKDF.HkdfLabel_label.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let hkdfLabel_label_parser_kind =", "completed_definiton": "LP.strong_parser_kind 8 256 None", "isa_cross_project_example": true }, { "file_name": "DebugFlags.fst", "name": "DebugFlags.debug_KS", "original_source_type": "", "source_type": "val debug_KS : Prims.bool", "source_definition": "let debug_KS = debug", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/concrete-flags/Debug/DebugFlags.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 11, "start_col": 37, "end_line": 11, "end_col": 42 }, "file_context": "module DebugFlags\n\n// debug printing flags, one per module\ninline_for_extraction let debug = true\ninline_for_extraction let debug_QUIC = debug\ninline_for_extraction let debug_CDH = debug\ninline_for_extraction let debug_Epochs = debug\ninline_for_extraction let debug_FFI = debug\ninline_for_extraction let debug_HS = debug", "dependencies": { "source_file": "DebugFlags.fst", "checked_file": "DebugFlags.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "DebugFlags.debug" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let debug_KS =", "completed_definiton": "debug", "isa_cross_project_example": true }, { "file_name": "DebugFlags.fst", "name": "DebugFlags.debug_QUIC", "original_source_type": "", "source_type": "val debug_QUIC : Prims.bool", "source_definition": "let debug_QUIC = debug", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/concrete-flags/Debug/DebugFlags.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 5, "start_col": 39, "end_line": 5, "end_col": 44 }, "file_context": "module DebugFlags\n\n// debug printing flags, one per module", "dependencies": { "source_file": "DebugFlags.fst", "checked_file": "DebugFlags.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "DebugFlags.debug" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let debug_QUIC =", "completed_definiton": "debug", "isa_cross_project_example": true }, { "file_name": "DebugFlags.fst", "name": "DebugFlags.debug_NGO", "original_source_type": "", "source_type": "val debug_NGO : Prims.bool", "source_definition": "let debug_NGO = debug", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/concrete-flags/Debug/DebugFlags.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 12, "start_col": 38, "end_line": 12, "end_col": 43 }, "file_context": "module DebugFlags\n\n// debug printing flags, one per module\ninline_for_extraction let debug = true\ninline_for_extraction let debug_QUIC = debug\ninline_for_extraction let debug_CDH = debug\ninline_for_extraction let debug_Epochs = debug\ninline_for_extraction let debug_FFI = debug\ninline_for_extraction let debug_HS = debug\ninline_for_extraction let debug_HSL = debug", "dependencies": { "source_file": "DebugFlags.fst", "checked_file": "DebugFlags.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "DebugFlags.debug" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let debug_NGO =", "completed_definiton": "debug", "isa_cross_project_example": true }, { "file_name": "DebugFlags.fst", "name": "DebugFlags.debug_CDH", "original_source_type": "", "source_type": "val debug_CDH : Prims.bool", "source_definition": "let debug_CDH = debug", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/concrete-flags/Debug/DebugFlags.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 6, "start_col": 38, "end_line": 6, "end_col": 43 }, "file_context": "module DebugFlags\n\n// debug printing flags, one per module\ninline_for_extraction let debug = true", "dependencies": { "source_file": "DebugFlags.fst", "checked_file": "DebugFlags.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "DebugFlags.debug" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let debug_CDH =", "completed_definiton": "debug", "isa_cross_project_example": true }, { "file_name": "DebugFlags.fst", "name": "DebugFlags.debug_TLS", "original_source_type": "", "source_type": "val debug_TLS : Prims.bool", "source_definition": "let debug_TLS = debug", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/concrete-flags/Debug/DebugFlags.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 14, "start_col": 38, "end_line": 14, "end_col": 43 }, "file_context": "module DebugFlags\n\n// debug printing flags, one per module\ninline_for_extraction let debug = true\ninline_for_extraction let debug_QUIC = debug\ninline_for_extraction let debug_CDH = debug\ninline_for_extraction let debug_Epochs = debug\ninline_for_extraction let debug_FFI = debug\ninline_for_extraction let debug_HS = debug\ninline_for_extraction let debug_HSL = debug\ninline_for_extraction let debug_KS = debug\ninline_for_extraction let debug_NGO = debug", "dependencies": { "source_file": "DebugFlags.fst", "checked_file": "DebugFlags.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "DebugFlags.debug" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let debug_TLS =", "completed_definiton": "debug", "isa_cross_project_example": true }, { "file_name": "DebugFlags.fst", "name": "DebugFlags.debug_FFI", "original_source_type": "", "source_type": "val debug_FFI : Prims.bool", "source_definition": "let debug_FFI = debug", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/concrete-flags/Debug/DebugFlags.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 8, "start_col": 38, "end_line": 8, "end_col": 43 }, "file_context": "module DebugFlags\n\n// debug printing flags, one per module\ninline_for_extraction let debug = true\ninline_for_extraction let debug_QUIC = debug\ninline_for_extraction let debug_CDH = debug", "dependencies": { "source_file": "DebugFlags.fst", "checked_file": "DebugFlags.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "DebugFlags.debug" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let debug_FFI =", "completed_definiton": "debug", "isa_cross_project_example": true }, { "file_name": "DebugFlags.fst", "name": "DebugFlags.debug_AEP", "original_source_type": "", "source_type": "val debug_AEP : Prims.bool", "source_definition": "let debug_AEP = debug", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/concrete-flags/Debug/DebugFlags.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 15, "start_col": 38, "end_line": 15, "end_col": 43 }, "file_context": "module DebugFlags\n\n// debug printing flags, one per module\ninline_for_extraction let debug = true\ninline_for_extraction let debug_QUIC = debug\ninline_for_extraction let debug_CDH = debug\ninline_for_extraction let debug_Epochs = debug\ninline_for_extraction let debug_FFI = debug\ninline_for_extraction let debug_HS = debug\ninline_for_extraction let debug_HSL = debug\ninline_for_extraction let debug_KS = debug\ninline_for_extraction let debug_NGO = debug\ninline_for_extraction let debug_Record = debug", "dependencies": { "source_file": "DebugFlags.fst", "checked_file": "DebugFlags.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "DebugFlags.debug" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let debug_AEP =", "completed_definiton": "debug", "isa_cross_project_example": true }, { "file_name": "DebugFlags.fst", "name": "DebugFlags.debug_Epochs", "original_source_type": "", "source_type": "val debug_Epochs : Prims.bool", "source_definition": "let debug_Epochs = debug", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/concrete-flags/Debug/DebugFlags.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 7, "start_col": 41, "end_line": 7, "end_col": 46 }, "file_context": "module DebugFlags\n\n// debug printing flags, one per module\ninline_for_extraction let debug = true\ninline_for_extraction let debug_QUIC = debug", "dependencies": { "source_file": "DebugFlags.fst", "checked_file": "DebugFlags.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "DebugFlags.debug" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let debug_Epochs =", "completed_definiton": "debug", "isa_cross_project_example": true }, { "file_name": "DebugFlags.fst", "name": "DebugFlags.debug_HS", "original_source_type": "", "source_type": "val debug_HS : Prims.bool", "source_definition": "let debug_HS = debug", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/concrete-flags/Debug/DebugFlags.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 9, "start_col": 37, "end_line": 9, "end_col": 42 }, "file_context": "module DebugFlags\n\n// debug printing flags, one per module\ninline_for_extraction let debug = true\ninline_for_extraction let debug_QUIC = debug\ninline_for_extraction let debug_CDH = debug\ninline_for_extraction let debug_Epochs = debug", "dependencies": { "source_file": "DebugFlags.fst", "checked_file": "DebugFlags.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "DebugFlags.debug" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let debug_HS =", "completed_definiton": "debug", "isa_cross_project_example": true }, { "file_name": "DebugFlags.fst", "name": "DebugFlags.debug", "original_source_type": "", "source_type": "val debug : Prims.bool", "source_definition": "let debug = true", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/concrete-flags/Debug/DebugFlags.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 4, "start_col": 34, "end_line": 4, "end_col": 38 }, "file_context": "module DebugFlags", "dependencies": { "source_file": "DebugFlags.fst", "checked_file": "DebugFlags.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let debug =", "completed_definiton": "true", "isa_cross_project_example": true }, { "file_name": "DebugFlags.fst", "name": "DebugFlags.debug_HSL", "original_source_type": "", "source_type": "val debug_HSL : Prims.bool", "source_definition": "let debug_HSL = debug", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/concrete-flags/Debug/DebugFlags.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 10, "start_col": 38, "end_line": 10, "end_col": 43 }, "file_context": "module DebugFlags\n\n// debug printing flags, one per module\ninline_for_extraction let debug = true\ninline_for_extraction let debug_QUIC = debug\ninline_for_extraction let debug_CDH = debug\ninline_for_extraction let debug_Epochs = debug\ninline_for_extraction let debug_FFI = debug", "dependencies": { "source_file": "DebugFlags.fst", "checked_file": "DebugFlags.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "DebugFlags.debug" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let debug_HSL =", "completed_definiton": "debug", "isa_cross_project_example": true }, { "file_name": "DebugFlags.fst", "name": "DebugFlags.debug_Record", "original_source_type": "", "source_type": "val debug_Record : Prims.bool", "source_definition": "let debug_Record = debug", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/concrete-flags/Debug/DebugFlags.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 13, "start_col": 41, "end_line": 13, "end_col": 46 }, "file_context": "module DebugFlags\n\n// debug printing flags, one per module\ninline_for_extraction let debug = true\ninline_for_extraction let debug_QUIC = debug\ninline_for_extraction let debug_CDH = debug\ninline_for_extraction let debug_Epochs = debug\ninline_for_extraction let debug_FFI = debug\ninline_for_extraction let debug_HS = debug\ninline_for_extraction let debug_HSL = debug\ninline_for_extraction let debug_KS = debug", "dependencies": { "source_file": "DebugFlags.fst", "checked_file": "DebugFlags.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "DebugFlags.debug" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let debug_Record =", "completed_definiton": "debug", "isa_cross_project_example": true }, { "file_name": "FStar.Test.fst", "name": "FStar.Test.dummy", "original_source_type": "val dummy: Prims.unit\n -> St (option string * FStar.Error.optResult string unit * FStar.Tcp.recv_result 0)", "source_type": "val dummy: Prims.unit\n -> St (option string * FStar.Error.optResult string unit * FStar.Tcp.recv_result 0)", "source_definition": "let dummy (): St (\n // This one needed by KaRaMeL FStar.Bytes\n option string *\n // These two needed by transport.h\n FStar.Error.optResult string unit *\n FStar.Tcp.recv_result 0\n) =\n Some \"\",\n FStar.Error.Correct (),\n FStar.Tcp.RecvWouldBlock", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/FStar.Test.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 15, "start_col": 2, "end_line": 17, "end_col": 26 }, "file_context": "module FStar.Test\n\nopen FStar.HyperStack.ST\nopen FStar.HyperStack.IO\n\n(* Force enough monomorphizations to appear in FStar.h so that hand-written headers have the right\n * definitions in scope. *)\nlet dummy (): St (\n // This one needed by KaRaMeL FStar.Bytes\n option string *\n // These two needed by transport.h\n FStar.Error.optResult string unit *\n FStar.Tcp.recv_result 0", "dependencies": { "source_file": "FStar.Test.fst", "checked_file": "FStar.Test.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Tcp.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.IO.fst.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.IO" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar" }, { "abbrev": false, "short_module": null, "full_module": "FStar" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.HyperStack.ST.St\n ((FStar.Pervasives.Native.option Prims.string * FStar.Error.optResult Prims.string Prims.unit) *\n FStar.Tcp.recv_result 0)", "effect": "FStar.HyperStack.ST.St", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.Native.Mktuple3", "FStar.Pervasives.Native.option", "Prims.string", "FStar.Error.optResult", "FStar.Tcp.recv_result", "FStar.Pervasives.Native.Some", "FStar.Error.Correct", "FStar.Tcp.RecvWouldBlock", "FStar.Pervasives.Native.tuple3" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val dummy: Prims.unit\n -> St (option string * FStar.Error.optResult string unit * FStar.Tcp.recv_result 0)\nlet dummy () : St (option string * FStar.Error.optResult string unit * FStar.Tcp.recv_result 0) =", "completed_definiton": "Some \"\", FStar.Error.Correct (), FStar.Tcp.RecvWouldBlock", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fsti", "name": "Parsers.HKDF.HkdfLabel.clens_hkdfLabel_context", "original_source_type": "val clens_hkdfLabel_context:LL.clens hkdfLabel hkdfLabel_context", "source_type": "val clens_hkdfLabel_context:LL.clens hkdfLabel hkdfLabel_context", "source_definition": "let clens_hkdfLabel_context : LL.clens hkdfLabel hkdfLabel_context = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.context);\n}", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 66, "start_col": 2, "end_line": 67, "end_col": 38 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\n(* Type of field label*)\ninclude Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\ninclude Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel = {\n length : U16.t;\n label : hkdfLabel_label;\n context : hkdfLabel_context;\n}\n\ninline_for_extraction noextract let hkdfLabel_parser_kind = LP.strong_parser_kind 11 514 None\n\nnoextract val hkdfLabel_parser: LP.parser hkdfLabel_parser_kind hkdfLabel\n\nnoextract val hkdfLabel_serializer: LP.serializer hkdfLabel_parser\n\nnoextract val hkdfLabel_bytesize (x:hkdfLabel) : GTot nat\n\nnoextract val hkdfLabel_bytesize_eq (x:hkdfLabel) : Lemma (hkdfLabel_bytesize x == Seq.length (LP.serialize hkdfLabel_serializer x))\n\nval hkdfLabel_parser32: LS.parser32 hkdfLabel_parser\n\nval hkdfLabel_serializer32: LS.serializer32 hkdfLabel_serializer\n\nval hkdfLabel_size32: LSZ.size32 hkdfLabel_serializer\n\nval hkdfLabel_validator: LL.validator hkdfLabel_parser\n\nval hkdfLabel_jumper: LL.jumper hkdfLabel_parser\n\nval hkdfLabel_bytesize_eqn (x: hkdfLabel) : Lemma (hkdfLabel_bytesize x == 2 + (hkdfLabel_label_bytesize (x.label)) + (hkdfLabel_context_bytesize (x.context))) [SMTPat (hkdfLabel_bytesize x)]\n\nnoextract let clens_hkdfLabel_length : LL.clens hkdfLabel U16.t = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.length);\n}\n\nnoextract let clens_hkdfLabel_label : LL.clens hkdfLabel hkdfLabel_label = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.label);\n}", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fsti", "checked_file": "Parsers.HKDF.HkdfLabel.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.HKDF.HkdfLabel.hkdfLabel\n Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.Mkclens", "Parsers.HKDF.HkdfLabel.hkdfLabel", "Parsers.HKDF.HkdfLabel_context.hkdfLabel_context", "Prims.l_True", "Parsers.HKDF.HkdfLabel.__proj__MkhkdfLabel__item__context" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val clens_hkdfLabel_context:LL.clens hkdfLabel hkdfLabel_context\nlet clens_hkdfLabel_context:LL.clens hkdfLabel hkdfLabel_context =", "completed_definiton": "{ LL.clens_cond = (fun _ -> True); LL.clens_get = (fun x -> x.context) }", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fsti", "name": "Parsers.HKDF.HkdfLabel.hkdfLabel_parser_kind", "original_source_type": "", "source_type": "val hkdfLabel_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let hkdfLabel_parser_kind = LP.strong_parser_kind 11 514 None", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 33, "start_col": 60, "end_line": 33, "end_col": 93 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\n(* Type of field label*)\ninclude Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\ninclude Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel = {\n length : U16.t;\n label : hkdfLabel_label;\n context : hkdfLabel_context;\n}", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fsti", "checked_file": "Parsers.HKDF.HkdfLabel.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let hkdfLabel_parser_kind =", "completed_definiton": "LP.strong_parser_kind 11 514 None", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fsti", "name": "Parsers.HKDF.HkdfLabel.clens_hkdfLabel_label", "original_source_type": "val clens_hkdfLabel_label:LL.clens hkdfLabel hkdfLabel_label", "source_type": "val clens_hkdfLabel_label:LL.clens hkdfLabel hkdfLabel_label", "source_definition": "let clens_hkdfLabel_label : LL.clens hkdfLabel hkdfLabel_label = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.label);\n}", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 61, "start_col": 2, "end_line": 62, "end_col": 36 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\n(* Type of field label*)\ninclude Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\ninclude Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel = {\n length : U16.t;\n label : hkdfLabel_label;\n context : hkdfLabel_context;\n}\n\ninline_for_extraction noextract let hkdfLabel_parser_kind = LP.strong_parser_kind 11 514 None\n\nnoextract val hkdfLabel_parser: LP.parser hkdfLabel_parser_kind hkdfLabel\n\nnoextract val hkdfLabel_serializer: LP.serializer hkdfLabel_parser\n\nnoextract val hkdfLabel_bytesize (x:hkdfLabel) : GTot nat\n\nnoextract val hkdfLabel_bytesize_eq (x:hkdfLabel) : Lemma (hkdfLabel_bytesize x == Seq.length (LP.serialize hkdfLabel_serializer x))\n\nval hkdfLabel_parser32: LS.parser32 hkdfLabel_parser\n\nval hkdfLabel_serializer32: LS.serializer32 hkdfLabel_serializer\n\nval hkdfLabel_size32: LSZ.size32 hkdfLabel_serializer\n\nval hkdfLabel_validator: LL.validator hkdfLabel_parser\n\nval hkdfLabel_jumper: LL.jumper hkdfLabel_parser\n\nval hkdfLabel_bytesize_eqn (x: hkdfLabel) : Lemma (hkdfLabel_bytesize x == 2 + (hkdfLabel_label_bytesize (x.label)) + (hkdfLabel_context_bytesize (x.context))) [SMTPat (hkdfLabel_bytesize x)]\n\nnoextract let clens_hkdfLabel_length : LL.clens hkdfLabel U16.t = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.length);\n}", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fsti", "checked_file": "Parsers.HKDF.HkdfLabel.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.HKDF.HkdfLabel.hkdfLabel\n Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.Mkclens", "Parsers.HKDF.HkdfLabel.hkdfLabel", "Parsers.HKDF.HkdfLabel_label.hkdfLabel_label", "Prims.l_True", "Parsers.HKDF.HkdfLabel.__proj__MkhkdfLabel__item__label" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val clens_hkdfLabel_label:LL.clens hkdfLabel hkdfLabel_label\nlet clens_hkdfLabel_label:LL.clens hkdfLabel hkdfLabel_label =", "completed_definiton": "{ LL.clens_cond = (fun _ -> True); LL.clens_get = (fun x -> x.label) }", "isa_cross_project_example": true }, { "file_name": "Parsers.HKDF.HkdfLabel.fsti", "name": "Parsers.HKDF.HkdfLabel.clens_hkdfLabel_length", "original_source_type": "val clens_hkdfLabel_length:LL.clens hkdfLabel U16.t", "source_type": "val clens_hkdfLabel_length:LL.clens hkdfLabel U16.t", "source_definition": "let clens_hkdfLabel_length : LL.clens hkdfLabel U16.t = {\n LL.clens_cond = (fun _ -> True);\n LL.clens_get = (fun x -> x.length);\n}", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.HKDF.HkdfLabel.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 56, "start_col": 2, "end_line": 57, "end_col": 37 }, "file_context": "module Parsers.HKDF.HkdfLabel\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\n(* Type of field label*)\ninclude Parsers.HKDF.HkdfLabel_label\n\n(* Type of field context*)\ninclude Parsers.HKDF.HkdfLabel_context\n\ntype hkdfLabel = {\n length : U16.t;\n label : hkdfLabel_label;\n context : hkdfLabel_context;\n}\n\ninline_for_extraction noextract let hkdfLabel_parser_kind = LP.strong_parser_kind 11 514 None\n\nnoextract val hkdfLabel_parser: LP.parser hkdfLabel_parser_kind hkdfLabel\n\nnoextract val hkdfLabel_serializer: LP.serializer hkdfLabel_parser\n\nnoextract val hkdfLabel_bytesize (x:hkdfLabel) : GTot nat\n\nnoextract val hkdfLabel_bytesize_eq (x:hkdfLabel) : Lemma (hkdfLabel_bytesize x == Seq.length (LP.serialize hkdfLabel_serializer x))\n\nval hkdfLabel_parser32: LS.parser32 hkdfLabel_parser\n\nval hkdfLabel_serializer32: LS.serializer32 hkdfLabel_serializer\n\nval hkdfLabel_size32: LSZ.size32 hkdfLabel_serializer\n\nval hkdfLabel_validator: LL.validator hkdfLabel_parser\n\nval hkdfLabel_jumper: LL.jumper hkdfLabel_parser\n\nval hkdfLabel_bytesize_eqn (x: hkdfLabel) : Lemma (hkdfLabel_bytesize x == 2 + (hkdfLabel_label_bytesize (x.label)) + (hkdfLabel_context_bytesize (x.context))) [SMTPat (hkdfLabel_bytesize x)]", "dependencies": { "source_file": "Parsers.HKDF.HkdfLabel.fsti", "checked_file": "Parsers.HKDF.HkdfLabel.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Parsers.HKDF.HkdfLabel_label.fsti.checked", "Parsers.HKDF.HkdfLabel_context.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_context" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF.HkdfLabel_label" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.HKDF" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.HKDF.HkdfLabel.hkdfLabel FStar.UInt16.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.Mkclens", "Parsers.HKDF.HkdfLabel.hkdfLabel", "FStar.UInt16.t", "Prims.l_True", "Parsers.HKDF.HkdfLabel.__proj__MkhkdfLabel__item__length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val clens_hkdfLabel_length:LL.clens hkdfLabel U16.t\nlet clens_hkdfLabel_length:LL.clens hkdfLabel U16.t =", "completed_definiton": "{ LL.clens_cond = (fun _ -> True); LL.clens_get = (fun x -> x.length) }", "isa_cross_project_example": true }, { "file_name": "List.Helpers.fst", "name": "List.Helpers.exists_b_aux", "original_source_type": "", "source_type": "val exists_b_aux : env: b -> f: (_: b -> _: a -> Prims.bool) -> l: Prims.list a -> Prims.bool", "source_definition": "let exists_b_aux (#a:Type) (#b:Type) (env:b) (f:b -> a -> Tot bool) (l:list a) =\n Some? (find_aux env f l)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/List.Helpers.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 43, "start_col": 2, "end_line": 43, "end_col": 26 }, "file_context": "module List.Helpers\n\nopen FStar.List.Tot\n\n(* Some basic utility functions for closure converting arguments\n to the higher-order combinators in the list library ...\n for use with KaRaMeL extraction *)\nlet rec filter_aux (#a:Type)\n (#b:Type)\n (env:b)\n (f:(b -> a -> Tot bool))\n (l: list a)\n : Tot (m:list a{forall x. memP x m ==> f env x}) =\n match l with\n | [] -> []\n | hd::tl -> if f env hd then hd::filter_aux env f tl else filter_aux env f tl\n\nlet rec find_aux (#a:Type)\n (#b:Type)\n (env:b)\n (f:(b -> a -> Tot bool))\n (l:list a)\n : (option (x:a{f env x})) =\n match l with\n | [] -> None #(x:a{f env x}) //These type annotations are only present because it makes bootstrapping go much faster\n | hd::tl -> if f env hd then Some #(x:a{f env x}) hd else find_aux env f tl\n\nlet rec choose_aux (#a:Type)\n (#b:Type)\n (#c:Type)\n (env:c)\n (f:(c -> a -> Tot (option b)))\n (l:list a)\n : list b =\n match l with\n | [] -> []\n | hd::tl ->\n match f env hd with\n | Some i -> i :: choose_aux env f tl\n | None -> choose_aux env f tl", "dependencies": { "source_file": "List.Helpers.fst", "checked_file": "List.Helpers.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.List.Tot" }, { "abbrev": false, "short_module": null, "full_module": "List" }, { "abbrev": false, "short_module": null, "full_module": "List" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "env: b -> f: (_: b -> _: a -> Prims.bool) -> l: Prims.list a -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.bool", "Prims.list", "FStar.Pervasives.Native.uu___is_Some", "Prims.b2t", "List.Helpers.find_aux" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let exists_b_aux (#a #b: Type) (env: b) (f: (b -> a -> Tot bool)) (l: list a) =", "completed_definiton": "Some? (find_aux env f l)", "isa_cross_project_example": true }, { "file_name": "List.Helpers.fst", "name": "List.Helpers.mem_rev", "original_source_type": "", "source_type": "val mem_rev : l: Prims.list a -> x: a -> Prims.bool", "source_definition": "let mem_rev (#a:eqtype) (l:list a) (x:a) = List.Tot.mem x l", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/List.Helpers.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 45, "start_col": 43, "end_line": 45, "end_col": 59 }, "file_context": "module List.Helpers\n\nopen FStar.List.Tot\n\n(* Some basic utility functions for closure converting arguments\n to the higher-order combinators in the list library ...\n for use with KaRaMeL extraction *)\nlet rec filter_aux (#a:Type)\n (#b:Type)\n (env:b)\n (f:(b -> a -> Tot bool))\n (l: list a)\n : Tot (m:list a{forall x. memP x m ==> f env x}) =\n match l with\n | [] -> []\n | hd::tl -> if f env hd then hd::filter_aux env f tl else filter_aux env f tl\n\nlet rec find_aux (#a:Type)\n (#b:Type)\n (env:b)\n (f:(b -> a -> Tot bool))\n (l:list a)\n : (option (x:a{f env x})) =\n match l with\n | [] -> None #(x:a{f env x}) //These type annotations are only present because it makes bootstrapping go much faster\n | hd::tl -> if f env hd then Some #(x:a{f env x}) hd else find_aux env f tl\n\nlet rec choose_aux (#a:Type)\n (#b:Type)\n (#c:Type)\n (env:c)\n (f:(c -> a -> Tot (option b)))\n (l:list a)\n : list b =\n match l with\n | [] -> []\n | hd::tl ->\n match f env hd with\n | Some i -> i :: choose_aux env f tl\n | None -> choose_aux env f tl\n\nlet exists_b_aux (#a:Type) (#b:Type) (env:b) (f:b -> a -> Tot bool) (l:list a) =\n Some? (find_aux env f l)", "dependencies": { "source_file": "List.Helpers.fst", "checked_file": "List.Helpers.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.List.Tot" }, { "abbrev": false, "short_module": null, "full_module": "List" }, { "abbrev": false, "short_module": null, "full_module": "List" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "l: Prims.list a -> x: a -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.eqtype", "Prims.list", "FStar.List.Tot.Base.mem", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let mem_rev (#a: eqtype) (l: list a) (x: a) =", "completed_definiton": "List.Tot.mem x l", "isa_cross_project_example": true }, { "file_name": "List.Helpers.fst", "name": "List.Helpers.choose_aux", "original_source_type": "val choose_aux (#a #b #c: Type) (env: c) (f: (c -> a -> Tot (option b))) (l: list a) : list b", "source_type": "val choose_aux (#a #b #c: Type) (env: c) (f: (c -> a -> Tot (option b))) (l: list a) : list b", "source_definition": "let rec choose_aux (#a:Type)\n (#b:Type)\n (#c:Type)\n (env:c)\n (f:(c -> a -> Tot (option b)))\n (l:list a)\n : list b =\n match l with\n | [] -> []\n | hd::tl ->\n match f env hd with\n | Some i -> i :: choose_aux env f tl\n | None -> choose_aux env f tl", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/List.Helpers.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 35, "start_col": 6, "end_line": 40, "end_col": 37 }, "file_context": "module List.Helpers\n\nopen FStar.List.Tot\n\n(* Some basic utility functions for closure converting arguments\n to the higher-order combinators in the list library ...\n for use with KaRaMeL extraction *)\nlet rec filter_aux (#a:Type)\n (#b:Type)\n (env:b)\n (f:(b -> a -> Tot bool))\n (l: list a)\n : Tot (m:list a{forall x. memP x m ==> f env x}) =\n match l with\n | [] -> []\n | hd::tl -> if f env hd then hd::filter_aux env f tl else filter_aux env f tl\n\nlet rec find_aux (#a:Type)\n (#b:Type)\n (env:b)\n (f:(b -> a -> Tot bool))\n (l:list a)\n : (option (x:a{f env x})) =\n match l with\n | [] -> None #(x:a{f env x}) //These type annotations are only present because it makes bootstrapping go much faster\n | hd::tl -> if f env hd then Some #(x:a{f env x}) hd else find_aux env f tl\n\nlet rec choose_aux (#a:Type)\n (#b:Type)\n (#c:Type)\n (env:c)\n (f:(c -> a -> Tot (option b)))\n (l:list a)", "dependencies": { "source_file": "List.Helpers.fst", "checked_file": "List.Helpers.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.List.Tot" }, { "abbrev": false, "short_module": null, "full_module": "List" }, { "abbrev": false, "short_module": null, "full_module": "List" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "env: c -> f: (_: c -> _: a -> FStar.Pervasives.Native.option b) -> l: Prims.list a -> Prims.list b", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Pervasives.Native.option", "Prims.list", "Prims.Nil", "Prims.Cons", "List.Helpers.choose_aux" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val choose_aux (#a #b #c: Type) (env: c) (f: (c -> a -> Tot (option b))) (l: list a) : list b\nlet rec choose_aux (#a #b #c: Type) (env: c) (f: (c -> a -> Tot (option b))) (l: list a) : list b =", "completed_definiton": "match l with\n| [] -> []\n| hd :: tl ->\n match f env hd with\n | Some i -> i :: choose_aux env f tl\n | None -> choose_aux env f tl", "isa_cross_project_example": true }, { "file_name": "List.Helpers.fst", "name": "List.Helpers.find_aux", "original_source_type": "val find_aux (#a #b: Type) (env: b) (f: (b -> a -> Tot bool)) (l: list a) : (option (x: a{f env x}))", "source_type": "val find_aux (#a #b: Type) (env: b) (f: (b -> a -> Tot bool)) (l: list a) : (option (x: a{f env x}))", "source_definition": "let rec find_aux (#a:Type)\n (#b:Type)\n (env:b)\n (f:(b -> a -> Tot bool))\n (l:list a)\n : (option (x:a{f env x})) =\n match l with\n | [] -> None #(x:a{f env x}) //These type annotations are only present because it makes bootstrapping go much faster\n | hd::tl -> if f env hd then Some #(x:a{f env x}) hd else find_aux env f tl", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/List.Helpers.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 24, "start_col": 6, "end_line": 26, "end_col": 81 }, "file_context": "module List.Helpers\n\nopen FStar.List.Tot\n\n(* Some basic utility functions for closure converting arguments\n to the higher-order combinators in the list library ...\n for use with KaRaMeL extraction *)\nlet rec filter_aux (#a:Type)\n (#b:Type)\n (env:b)\n (f:(b -> a -> Tot bool))\n (l: list a)\n : Tot (m:list a{forall x. memP x m ==> f env x}) =\n match l with\n | [] -> []\n | hd::tl -> if f env hd then hd::filter_aux env f tl else filter_aux env f tl\n\nlet rec find_aux (#a:Type)\n (#b:Type)\n (env:b)\n (f:(b -> a -> Tot bool))\n (l:list a)", "dependencies": { "source_file": "List.Helpers.fst", "checked_file": "List.Helpers.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.List.Tot" }, { "abbrev": false, "short_module": null, "full_module": "List" }, { "abbrev": false, "short_module": null, "full_module": "List" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "env: b -> f: (_: b -> _: a -> Prims.bool) -> l: Prims.list a\n -> FStar.Pervasives.Native.option (x: a{f env x})", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.bool", "Prims.list", "FStar.Pervasives.Native.None", "Prims.b2t", "FStar.Pervasives.Native.Some", "List.Helpers.find_aux", "FStar.Pervasives.Native.option" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val find_aux (#a #b: Type) (env: b) (f: (b -> a -> Tot bool)) (l: list a) : (option (x: a{f env x}))\nlet rec find_aux (#a #b: Type) (env: b) (f: (b -> a -> Tot bool)) (l: list a)\n : (option (x: a{f env x})) =", "completed_definiton": "match l with\n| [] -> None #(x: a{f env x})\n| hd :: tl -> if f env hd then Some #(x: a{f env x}) hd else find_aux env f tl", "isa_cross_project_example": true }, { "file_name": "List.Helpers.fst", "name": "List.Helpers.forall_aux", "original_source_type": "val forall_aux (#a #b: Type) (env: b) (f: (b -> a -> Tot bool)) (l: list a) : Tot bool", "source_type": "val forall_aux (#a #b: Type) (env: b) (f: (b -> a -> Tot bool)) (l: list a) : Tot bool", "source_definition": "let rec forall_aux (#a:Type) (#b:Type) (env:b) (f: b -> a -> Tot bool) (l:list a)\n : Tot bool\n = match l with\n | [] -> true\n | hd::tl -> if f env hd then forall_aux env f tl else false", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/List.Helpers.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 49, "start_col": 4, "end_line": 51, "end_col": 63 }, "file_context": "module List.Helpers\n\nopen FStar.List.Tot\n\n(* Some basic utility functions for closure converting arguments\n to the higher-order combinators in the list library ...\n for use with KaRaMeL extraction *)\nlet rec filter_aux (#a:Type)\n (#b:Type)\n (env:b)\n (f:(b -> a -> Tot bool))\n (l: list a)\n : Tot (m:list a{forall x. memP x m ==> f env x}) =\n match l with\n | [] -> []\n | hd::tl -> if f env hd then hd::filter_aux env f tl else filter_aux env f tl\n\nlet rec find_aux (#a:Type)\n (#b:Type)\n (env:b)\n (f:(b -> a -> Tot bool))\n (l:list a)\n : (option (x:a{f env x})) =\n match l with\n | [] -> None #(x:a{f env x}) //These type annotations are only present because it makes bootstrapping go much faster\n | hd::tl -> if f env hd then Some #(x:a{f env x}) hd else find_aux env f tl\n\nlet rec choose_aux (#a:Type)\n (#b:Type)\n (#c:Type)\n (env:c)\n (f:(c -> a -> Tot (option b)))\n (l:list a)\n : list b =\n match l with\n | [] -> []\n | hd::tl ->\n match f env hd with\n | Some i -> i :: choose_aux env f tl\n | None -> choose_aux env f tl\n\nlet exists_b_aux (#a:Type) (#b:Type) (env:b) (f:b -> a -> Tot bool) (l:list a) =\n Some? (find_aux env f l)\n\nlet mem_rev (#a:eqtype) (l:list a) (x:a) = List.Tot.mem x l\n\nlet rec forall_aux (#a:Type) (#b:Type) (env:b) (f: b -> a -> Tot bool) (l:list a)", "dependencies": { "source_file": "List.Helpers.fst", "checked_file": "List.Helpers.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.List.Tot" }, { "abbrev": false, "short_module": null, "full_module": "List" }, { "abbrev": false, "short_module": null, "full_module": "List" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "env: b -> f: (_: b -> _: a -> Prims.bool) -> l: Prims.list a -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.bool", "Prims.list", "List.Helpers.forall_aux" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val forall_aux (#a #b: Type) (env: b) (f: (b -> a -> Tot bool)) (l: list a) : Tot bool\nlet rec forall_aux (#a #b: Type) (env: b) (f: (b -> a -> Tot bool)) (l: list a) : Tot bool =", "completed_definiton": "match l with\n| [] -> true\n| hd :: tl -> if f env hd then forall_aux env f tl else false", "isa_cross_project_example": true }, { "file_name": "List.Helpers.fst", "name": "List.Helpers.filter_aux", "original_source_type": "val filter_aux (#a #b: Type) (env: b) (f: (b -> a -> Tot bool)) (l: list a)\n : Tot (m: list a {forall x. memP x m ==> f env x})", "source_type": "val filter_aux (#a #b: Type) (env: b) (f: (b -> a -> Tot bool)) (l: list a)\n : Tot (m: list a {forall x. memP x m ==> f env x})", "source_definition": "let rec filter_aux (#a:Type)\n (#b:Type)\n (env:b)\n (f:(b -> a -> Tot bool))\n (l: list a)\n : Tot (m:list a{forall x. memP x m ==> f env x}) =\n match l with\n | [] -> []\n | hd::tl -> if f env hd then hd::filter_aux env f tl else filter_aux env f tl", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/List.Helpers.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 14, "start_col": 6, "end_line": 16, "end_col": 83 }, "file_context": "module List.Helpers\n\nopen FStar.List.Tot\n\n(* Some basic utility functions for closure converting arguments\n to the higher-order combinators in the list library ...\n for use with KaRaMeL extraction *)\nlet rec filter_aux (#a:Type)\n (#b:Type)\n (env:b)\n (f:(b -> a -> Tot bool))\n (l: list a)", "dependencies": { "source_file": "List.Helpers.fst", "checked_file": "List.Helpers.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.List.Tot" }, { "abbrev": false, "short_module": null, "full_module": "List" }, { "abbrev": false, "short_module": null, "full_module": "List" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "env: b -> f: (_: b -> _: a -> Prims.bool) -> l: Prims.list a\n -> m: Prims.list a {forall (x: a). FStar.List.Tot.Base.memP x m ==> f env x}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.bool", "Prims.list", "Prims.Nil", "Prims.Cons", "List.Helpers.filter_aux", "Prims.l_Forall", "Prims.l_imp", "FStar.List.Tot.Base.memP", "Prims.b2t" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val filter_aux (#a #b: Type) (env: b) (f: (b -> a -> Tot bool)) (l: list a)\n : Tot (m: list a {forall x. memP x m ==> f env x})\nlet rec filter_aux (#a #b: Type) (env: b) (f: (b -> a -> Tot bool)) (l: list a)\n : Tot (m: list a {forall x. memP x m ==> f env x}) =", "completed_definiton": "match l with\n| [] -> []\n| hd :: tl -> if f env hd then hd :: filter_aux env f tl else filter_aux env f tl", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.synth_ticketContents13", "original_source_type": "val synth_ticketContents13 (x: ticketContents13') : ticketContents13", "source_type": "val synth_ticketContents13 (x: ticketContents13') : ticketContents13", "source_definition": "let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 35, "start_col": 2, "end_line": 42, "end_col": 3 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketContents13.ticketContents13' -> Parsers.TicketContents13.ticketContents13", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketContents13.ticketContents13'", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "FStar.UInt32.t", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "Parsers.TicketContents13.MkticketContents13", "Parsers.TicketContents13.ticketContents13" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_ticketContents13 (x: ticketContents13') : ticketContents13\nlet synth_ticketContents13 (x: ticketContents13') : ticketContents13 =", "completed_definiton": "match x with\n| ((cs, rms), (nonce, creation_time)), (age_add, custom_data) ->\n {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data\n }", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.ticketContents13'_parser_kind", "original_source_type": "", "source_type": "val ticketContents13'_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 61, "start_col": 46, "end_line": 61, "end_col": 89 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.get_parser_kind", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.ticketContents13'_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let ticketContents13'_parser_kind =", "completed_definiton": "LP.get_parser_kind ticketContents13'_parser", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.ticketContents13_bytesize", "original_source_type": "val ticketContents13_bytesize (x:ticketContents13) : GTot nat", "source_type": "val ticketContents13_bytesize (x:ticketContents13) : GTot nat", "source_definition": "let ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 76, "start_col": 64, "end_line": 76, "end_col": 106 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketContents13.ticketContents13 -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketContents13.ticketContents13", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.TicketContents13.ticketContents13_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_bytesize (x:ticketContents13) : GTot nat\nlet ticketContents13_bytesize (x: ticketContents13) : GTot nat =", "completed_definiton": "Seq.length (ticketContents13_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.synth_ticketContents13_recip", "original_source_type": "val synth_ticketContents13_recip (x: ticketContents13) : ticketContents13'", "source_type": "val synth_ticketContents13_recip (x: ticketContents13) : ticketContents13'", "source_definition": "let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 44, "start_col": 99, "end_line": 44, "end_col": 167 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketContents13.ticketContents13 -> Parsers.TicketContents13.ticketContents13'", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketContents13.ticketContents13", "FStar.Pervasives.Native.Mktuple2", "FStar.Pervasives.Native.tuple2", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "FStar.UInt32.t", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "Parsers.TicketContents13.__proj__MkticketContents13__item__cs", "Parsers.TicketContents13.__proj__MkticketContents13__item__rms", "Parsers.TicketContents13.__proj__MkticketContents13__item__nonce", "Parsers.TicketContents13.__proj__MkticketContents13__item__creation_time", "Parsers.TicketContents13.__proj__MkticketContents13__item__age_add", "Parsers.TicketContents13.__proj__MkticketContents13__item__custom_data", "Parsers.TicketContents13.ticketContents13'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_ticketContents13_recip (x: ticketContents13) : ticketContents13'\nlet synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' =", "completed_definiton": "(((x.cs, x.rms), (x.nonce, x.creation_time)), (x.age_add, x.custom_data))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.ticketContents13'_jumper", "original_source_type": "val ticketContents13'_jumper:LL.jumper ticketContents13'_parser", "source_type": "val ticketContents13'_jumper:LL.jumper ticketContents13'_parser", "source_definition": "let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 110, "start_col": 90, "end_line": 110, "end_col": 346 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.TicketContents13.ticketContents13'_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.jump_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "FStar.Pervasives.Native.tuple2", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "FStar.UInt32.t", "LowParse.Spec.Combinators.nondep_then", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.TicketContents13_rms.ticketContents13_rms_parser", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser", "LowParse.Spec.Int.parse_u32", "Parsers.CipherSuite.cipherSuite_jumper", "Parsers.TicketContents13_rms.ticketContents13_rms_jumper", "Parsers.TicketContents13_nonce.ticketContents13_nonce_jumper", "LowParse.Low.Int.jump_u32", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_jumper" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13'_jumper:LL.jumper ticketContents13'_parser\nlet ticketContents13'_jumper:LL.jumper ticketContents13'_parser =", "completed_definiton": "(((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)\n `LL.jump_nondep_then`\n (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))\n `LL.jump_nondep_then`\n (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.accessor'_ticketContents13_age_add", "original_source_type": "val accessor'_ticketContents13_age_add:LL.accessor gaccessor'_ticketContents13_age_add", "source_type": "val accessor'_ticketContents13_age_add:LL.accessor gaccessor'_ticketContents13_age_add", "source_definition": "let accessor'_ticketContents13_age_add : LL.accessor gaccessor'_ticketContents13_age_add = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 155, "start_col": 123, "end_line": 155, "end_col": 371 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()\n\nlet ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))\n\nlet gaccessor'_ticketContents13_cs : LL.gaccessor ticketContents13'_parser cipherSuite_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_rms : LL.gaccessor ticketContents13'_parser ticketContents13_rms_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_nonce : LL.gaccessor ticketContents13'_parser ticketContents13_nonce_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_creation_time : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_age_add : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\nlet gaccessor'_ticketContents13_custom_data : LL.gaccessor ticketContents13'_parser ticketContents13_custom_data_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_cs : LL.accessor gaccessor'_ticketContents13_cs = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_rms : LL.accessor gaccessor'_ticketContents13_rms = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))) cipherSuite_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_nonce : LL.accessor gaccessor'_ticketContents13_nonce = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_creation_time : LL.accessor gaccessor'_ticketContents13_creation_time = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)) ticketContents13_nonce_jumper)", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents13.gaccessor'_ticketContents13_age_add", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.accessor_then_fst", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.ticketContents13'_parser", "FStar.UInt32.t", "LowParse.Spec.Int.parse_u32", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser", "LowParse.Low.Base.Spec.clens_compose", "FStar.Pervasives.Native.tuple2", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Combinators.gaccessor_then_snd", "LowParse.Spec.Combinators.nondep_then", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.TicketContents13_rms.ticketContents13_rms_parser", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser", "LowParse.Low.Base.Spec.gaccessor_id", "LowParse.Low.Combinators.accessor_then_snd", "LowParse.Low.Base.accessor_id", "LowParse.Low.Combinators.jump_nondep_then", "Parsers.CipherSuite.cipherSuite_jumper", "Parsers.TicketContents13_rms.ticketContents13_rms_jumper", "Parsers.TicketContents13_nonce.ticketContents13_nonce_jumper", "LowParse.Low.Int.jump_u32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor'_ticketContents13_age_add:LL.accessor gaccessor'_ticketContents13_age_add\nlet accessor'_ticketContents13_age_add:LL.accessor gaccessor'_ticketContents13_age_add =", "completed_definiton": "(LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser)\n ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)\n `LL.jump_nondep_then`\n (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.accessor'_ticketContents13_cs", "original_source_type": "val accessor'_ticketContents13_cs:LL.accessor gaccessor'_ticketContents13_cs", "source_type": "val accessor'_ticketContents13_cs:LL.accessor gaccessor'_ticketContents13_cs", "source_definition": "let accessor'_ticketContents13_cs : LL.accessor gaccessor'_ticketContents13_cs = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 147, "start_col": 113, "end_line": 147, "end_col": 223 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()\n\nlet ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))\n\nlet gaccessor'_ticketContents13_cs : LL.gaccessor ticketContents13'_parser cipherSuite_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_rms : LL.gaccessor ticketContents13'_parser ticketContents13_rms_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_nonce : LL.gaccessor ticketContents13'_parser ticketContents13_nonce_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_creation_time : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_age_add : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\nlet gaccessor'_ticketContents13_custom_data : LL.gaccessor ticketContents13'_parser ticketContents13_custom_data_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents13.gaccessor'_ticketContents13_cs", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.accessor_then_fst", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.CipherSuite.cipherSuite", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_rms.ticketContents13_rms_parser", "LowParse.Low.Base.Spec.clens_compose", "FStar.Pervasives.Native.tuple2", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "FStar.UInt32.t", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Combinators.gaccessor_then_fst", "LowParse.Spec.Combinators.nondep_then", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser", "LowParse.Spec.Int.parse_u32", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser", "LowParse.Low.Base.Spec.gaccessor_id", "LowParse.Low.Base.accessor_id" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor'_ticketContents13_cs:LL.accessor gaccessor'_ticketContents13_cs\nlet accessor'_ticketContents13_cs:LL.accessor gaccessor'_ticketContents13_cs =", "completed_definiton": "(LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser\n ))))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.clens_ticketContents13_ticketContents13'", "original_source_type": "val clens_ticketContents13_ticketContents13':LL.clens ticketContents13 ticketContents13'", "source_type": "val clens_ticketContents13_ticketContents13':LL.clens ticketContents13 ticketContents13'", "source_definition": "let clens_ticketContents13_ticketContents13' : LL.clens ticketContents13 ticketContents13' = synth_ticketContents13_recip_inverse (); synth_ticketContents13_recip_injective (); LL.clens_synth synth_ticketContents13_recip synth_ticketContents13", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 159, "start_col": 103, "end_line": 159, "end_col": 253 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()\n\nlet ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))\n\nlet gaccessor'_ticketContents13_cs : LL.gaccessor ticketContents13'_parser cipherSuite_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_rms : LL.gaccessor ticketContents13'_parser ticketContents13_rms_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_nonce : LL.gaccessor ticketContents13'_parser ticketContents13_nonce_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_creation_time : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_age_add : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\nlet gaccessor'_ticketContents13_custom_data : LL.gaccessor ticketContents13'_parser ticketContents13_custom_data_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_cs : LL.accessor gaccessor'_ticketContents13_cs = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_rms : LL.accessor gaccessor'_ticketContents13_rms = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))) cipherSuite_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_nonce : LL.accessor gaccessor'_ticketContents13_nonce = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_creation_time : LL.accessor gaccessor'_ticketContents13_creation_time = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)) ticketContents13_nonce_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_age_add : LL.accessor gaccessor'_ticketContents13_age_add = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_custom_data : LL.accessor gaccessor'_ticketContents13_custom_data = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))) LL.jump_u32)", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.clens Parsers.TicketContents13.ticketContents13\n Parsers.TicketContents13.ticketContents13'", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.clens_synth", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.synth_ticketContents13_recip", "Parsers.TicketContents13.synth_ticketContents13", "Prims.unit", "Parsers.TicketContents13.synth_ticketContents13_recip_injective", "Parsers.TicketContents13.synth_ticketContents13_recip_inverse" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val clens_ticketContents13_ticketContents13':LL.clens ticketContents13 ticketContents13'\nlet clens_ticketContents13_ticketContents13':LL.clens ticketContents13 ticketContents13' =", "completed_definiton": "synth_ticketContents13_recip_inverse ();\nsynth_ticketContents13_recip_injective ();\nLL.clens_synth synth_ticketContents13_recip synth_ticketContents13", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.accessor'_ticketContents13_creation_time", "original_source_type": "val accessor'_ticketContents13_creation_time:LL.accessor gaccessor'_ticketContents13_creation_time", "source_type": "val accessor'_ticketContents13_creation_time:LL.accessor gaccessor'_ticketContents13_creation_time", "source_definition": "let accessor'_ticketContents13_creation_time : LL.accessor gaccessor'_ticketContents13_creation_time = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)) ticketContents13_nonce_jumper)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 153, "start_col": 135, "end_line": 153, "end_col": 346 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()\n\nlet ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))\n\nlet gaccessor'_ticketContents13_cs : LL.gaccessor ticketContents13'_parser cipherSuite_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_rms : LL.gaccessor ticketContents13'_parser ticketContents13_rms_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_nonce : LL.gaccessor ticketContents13'_parser ticketContents13_nonce_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_creation_time : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_age_add : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\nlet gaccessor'_ticketContents13_custom_data : LL.gaccessor ticketContents13'_parser ticketContents13_custom_data_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_cs : LL.accessor gaccessor'_ticketContents13_cs = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_rms : LL.accessor gaccessor'_ticketContents13_rms = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))) cipherSuite_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_nonce : LL.accessor gaccessor'_ticketContents13_nonce = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)))", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents13.gaccessor'_ticketContents13_creation_time", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.accessor_then_snd", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser", "FStar.UInt32.t", "LowParse.Spec.Int.parse_u32", "LowParse.Low.Base.Spec.clens_compose", "FStar.Pervasives.Native.tuple2", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Combinators.gaccessor_then_snd", "LowParse.Spec.Combinators.nondep_then", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.TicketContents13_rms.ticketContents13_rms_parser", "LowParse.Low.Combinators.gaccessor_then_fst", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser", "LowParse.Low.Base.Spec.gaccessor_id", "LowParse.Low.Combinators.accessor_then_fst", "LowParse.Low.Base.accessor_id", "LowParse.Low.Combinators.jump_nondep_then", "Parsers.CipherSuite.cipherSuite_jumper", "Parsers.TicketContents13_rms.ticketContents13_rms_jumper", "Parsers.TicketContents13_nonce.ticketContents13_nonce_jumper" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor'_ticketContents13_creation_time:LL.accessor gaccessor'_ticketContents13_creation_time\nlet accessor'_ticketContents13_creation_time:LL.accessor gaccessor'_ticketContents13_creation_time =", "completed_definiton": "(LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser\n ))\n (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper))\n ticketContents13_nonce_jumper)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.accessor'_ticketContents13_custom_data", "original_source_type": "val accessor'_ticketContents13_custom_data:LL.accessor gaccessor'_ticketContents13_custom_data", "source_type": "val accessor'_ticketContents13_custom_data:LL.accessor gaccessor'_ticketContents13_custom_data", "source_definition": "let accessor'_ticketContents13_custom_data : LL.accessor gaccessor'_ticketContents13_custom_data = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))) LL.jump_u32)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 157, "start_col": 131, "end_line": 157, "end_col": 391 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()\n\nlet ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))\n\nlet gaccessor'_ticketContents13_cs : LL.gaccessor ticketContents13'_parser cipherSuite_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_rms : LL.gaccessor ticketContents13'_parser ticketContents13_rms_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_nonce : LL.gaccessor ticketContents13'_parser ticketContents13_nonce_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_creation_time : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_age_add : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\nlet gaccessor'_ticketContents13_custom_data : LL.gaccessor ticketContents13'_parser ticketContents13_custom_data_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_cs : LL.accessor gaccessor'_ticketContents13_cs = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_rms : LL.accessor gaccessor'_ticketContents13_rms = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))) cipherSuite_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_nonce : LL.accessor gaccessor'_ticketContents13_nonce = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_creation_time : LL.accessor gaccessor'_ticketContents13_creation_time = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)) ticketContents13_nonce_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_age_add : LL.accessor gaccessor'_ticketContents13_age_add = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))))", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents13.gaccessor'_ticketContents13_custom_data", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.accessor_then_snd", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.ticketContents13'_parser", "FStar.UInt32.t", "LowParse.Spec.Int.parse_u32", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser", "LowParse.Low.Base.Spec.clens_compose", "FStar.Pervasives.Native.tuple2", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Combinators.gaccessor_then_snd", "LowParse.Spec.Combinators.nondep_then", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.TicketContents13_rms.ticketContents13_rms_parser", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser", "LowParse.Low.Base.Spec.gaccessor_id", "LowParse.Low.Base.accessor_id", "LowParse.Low.Combinators.jump_nondep_then", "Parsers.CipherSuite.cipherSuite_jumper", "Parsers.TicketContents13_rms.ticketContents13_rms_jumper", "Parsers.TicketContents13_nonce.ticketContents13_nonce_jumper", "LowParse.Low.Int.jump_u32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor'_ticketContents13_custom_data:LL.accessor gaccessor'_ticketContents13_custom_data\nlet accessor'_ticketContents13_custom_data:LL.accessor gaccessor'_ticketContents13_custom_data =", "completed_definiton": "(LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser)\n ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)\n `LL.jump_nondep_then`\n (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)))\n LL.jump_u32)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.ticketContents13'_parser32", "original_source_type": "val ticketContents13'_parser32:LS.parser32 ticketContents13'_parser", "source_type": "val ticketContents13'_parser32:LS.parser32 ticketContents13'_parser", "source_definition": "let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 80, "start_col": 94, "end_line": 80, "end_col": 379 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.TicketContents13.ticketContents13'_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "FStar.Pervasives.Native.tuple2", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "FStar.UInt32.t", "LowParse.Spec.Combinators.nondep_then", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.TicketContents13_rms.ticketContents13_rms_parser", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser", "LowParse.Spec.Int.parse_u32", "Parsers.CipherSuite.cipherSuite_parser32", "Parsers.TicketContents13_rms.ticketContents13_rms_parser32", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser32", "LowParse.SLow.Int.parse32_u32", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13'_parser32:LS.parser32 ticketContents13'_parser\nlet ticketContents13'_parser32:LS.parser32 ticketContents13'_parser =", "completed_definiton": "(((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32)\n `LS.parse32_nondep_then`\n (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32))\n `LS.parse32_nondep_then`\n (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.accessor'_ticketContents13_nonce", "original_source_type": "val accessor'_ticketContents13_nonce:LL.accessor gaccessor'_ticketContents13_nonce", "source_type": "val accessor'_ticketContents13_nonce:LL.accessor gaccessor'_ticketContents13_nonce", "source_definition": "let accessor'_ticketContents13_nonce : LL.accessor gaccessor'_ticketContents13_nonce = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 151, "start_col": 119, "end_line": 151, "end_col": 300 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()\n\nlet ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))\n\nlet gaccessor'_ticketContents13_cs : LL.gaccessor ticketContents13'_parser cipherSuite_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_rms : LL.gaccessor ticketContents13'_parser ticketContents13_rms_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_nonce : LL.gaccessor ticketContents13'_parser ticketContents13_nonce_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_creation_time : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_age_add : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\nlet gaccessor'_ticketContents13_custom_data : LL.gaccessor ticketContents13'_parser ticketContents13_custom_data_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_cs : LL.accessor gaccessor'_ticketContents13_cs = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_rms : LL.accessor gaccessor'_ticketContents13_rms = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))) cipherSuite_jumper)", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents13.gaccessor'_ticketContents13_nonce", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.accessor_then_fst", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser", "FStar.UInt32.t", "LowParse.Spec.Int.parse_u32", "LowParse.Low.Base.Spec.clens_compose", "FStar.Pervasives.Native.tuple2", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Combinators.gaccessor_then_snd", "LowParse.Spec.Combinators.nondep_then", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.TicketContents13_rms.ticketContents13_rms_parser", "LowParse.Low.Combinators.gaccessor_then_fst", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser", "LowParse.Low.Base.Spec.gaccessor_id", "LowParse.Low.Combinators.accessor_then_snd", "LowParse.Low.Base.accessor_id", "LowParse.Low.Combinators.jump_nondep_then", "Parsers.CipherSuite.cipherSuite_jumper", "Parsers.TicketContents13_rms.ticketContents13_rms_jumper" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor'_ticketContents13_nonce:LL.accessor gaccessor'_ticketContents13_nonce\nlet accessor'_ticketContents13_nonce:LL.accessor gaccessor'_ticketContents13_nonce =", "completed_definiton": "(LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser\n ))\n (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.accessor'_ticketContents13_rms", "original_source_type": "val accessor'_ticketContents13_rms:LL.accessor gaccessor'_ticketContents13_rms", "source_type": "val accessor'_ticketContents13_rms:LL.accessor gaccessor'_ticketContents13_rms", "source_definition": "let accessor'_ticketContents13_rms : LL.accessor gaccessor'_ticketContents13_rms = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))) cipherSuite_jumper)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 149, "start_col": 115, "end_line": 149, "end_col": 244 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()\n\nlet ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))\n\nlet gaccessor'_ticketContents13_cs : LL.gaccessor ticketContents13'_parser cipherSuite_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_rms : LL.gaccessor ticketContents13'_parser ticketContents13_rms_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_nonce : LL.gaccessor ticketContents13'_parser ticketContents13_nonce_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_creation_time : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_age_add : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\nlet gaccessor'_ticketContents13_custom_data : LL.gaccessor ticketContents13'_parser ticketContents13_custom_data_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_cs : LL.accessor gaccessor'_ticketContents13_cs = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))))", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents13.gaccessor'_ticketContents13_rms", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.accessor_then_snd", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.CipherSuite.cipherSuite", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_rms.ticketContents13_rms_parser", "LowParse.Low.Base.Spec.clens_compose", "FStar.Pervasives.Native.tuple2", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "FStar.UInt32.t", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Combinators.gaccessor_then_fst", "LowParse.Spec.Combinators.nondep_then", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser", "LowParse.Spec.Int.parse_u32", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser", "LowParse.Low.Base.Spec.gaccessor_id", "LowParse.Low.Combinators.accessor_then_fst", "LowParse.Low.Base.accessor_id", "Parsers.CipherSuite.cipherSuite_jumper" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor'_ticketContents13_rms:LL.accessor gaccessor'_ticketContents13_rms\nlet accessor'_ticketContents13_rms:LL.accessor gaccessor'_ticketContents13_rms =", "completed_definiton": "(LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser\n )))\n cipherSuite_jumper)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.ticketContents13'_validator", "original_source_type": "val ticketContents13'_validator:LL.validator ticketContents13'_parser", "source_type": "val ticketContents13'_validator:LL.validator ticketContents13'_parser", "source_definition": "let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 103, "start_col": 96, "end_line": 103, "end_col": 402 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.TicketContents13.ticketContents13'_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.validate_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "FStar.Pervasives.Native.tuple2", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "FStar.UInt32.t", "LowParse.Spec.Combinators.nondep_then", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.TicketContents13_rms.ticketContents13_rms_parser", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser", "LowParse.Spec.Int.parse_u32", "Parsers.CipherSuite.cipherSuite_validator", "Parsers.TicketContents13_rms.ticketContents13_rms_validator", "Parsers.TicketContents13_nonce.ticketContents13_nonce_validator", "LowParse.Low.Int.validate_u32", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_validator" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13'_validator:LL.validator ticketContents13'_parser\nlet ticketContents13'_validator:LL.validator ticketContents13'_parser =", "completed_definiton": "(((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator)\n `LL.validate_nondep_then`\n (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ())))\n `LL.validate_nondep_then`\n ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.ticketContents13_serializer", "original_source_type": "val ticketContents13_serializer: LP.serializer ticketContents13_parser", "source_type": "val ticketContents13_serializer: LP.serializer ticketContents13_parser", "source_definition": "let ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 71, "start_col": 2, "end_line": 74, "end_col": 106 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.TicketContents13.ticketContents13_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.synth_ticketContents13", "Parsers.TicketContents13.ticketContents13'_serializer", "Parsers.TicketContents13.synth_ticketContents13_recip", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13'_parser_kind", "Parsers.TicketContents13.synth_ticketContents13_inverse", "Parsers.TicketContents13.synth_ticketContents13_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_serializer: LP.serializer ticketContents13_parser\nlet ticketContents13_serializer =", "completed_definiton": "[@@ inline_let ]let _ = synth_ticketContents13_injective () in\n[@@ inline_let ]let _ = synth_ticketContents13_inverse () in\n[@@ inline_let ]let _ =\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind)\nin\nLP.serialize_synth _\n synth_ticketContents13\n ticketContents13'_serializer\n synth_ticketContents13_recip\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.ticketContents13_parser", "original_source_type": "val ticketContents13_parser: LP.parser ticketContents13_parser_kind ticketContents13", "source_type": "val ticketContents13_parser: LP.parser ticketContents13_parser_kind ticketContents13", "source_definition": "let ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 64, "start_col": 2, "end_line": 66, "end_col": 66 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.TicketContents13.ticketContents13_parser_kind\n Parsers.TicketContents13.ticketContents13", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.synth_ticketContents13", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13'_parser_kind", "Parsers.TicketContents13.synth_ticketContents13_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_parser: LP.parser ticketContents13_parser_kind ticketContents13\nlet ticketContents13_parser =", "completed_definiton": "synth_ticketContents13_injective ();\nassert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\nticketContents13'_parser `LP.parse_synth` synth_ticketContents13", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.ticketContents13_serializer32", "original_source_type": "val ticketContents13_serializer32: LS.serializer32 ticketContents13_serializer", "source_type": "val ticketContents13_serializer32: LS.serializer32 ticketContents13_serializer", "source_definition": "let ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 90, "start_col": 2, "end_line": 93, "end_col": 154 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.TicketContents13.ticketContents13_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.synth_ticketContents13", "Parsers.TicketContents13.ticketContents13'_serializer", "Parsers.TicketContents13.ticketContents13'_serializer32", "Parsers.TicketContents13.synth_ticketContents13_recip", "Prims.eq2", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.Base.parser_kind", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13'_parser_kind", "Parsers.TicketContents13.synth_ticketContents13_inverse", "Parsers.TicketContents13.synth_ticketContents13_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_serializer32: LS.serializer32 ticketContents13_serializer\nlet ticketContents13_serializer32 =", "completed_definiton": "[@@ inline_let ]let _ = synth_ticketContents13_injective () in\n[@@ inline_let ]let _ = synth_ticketContents13_inverse () in\n[@@ inline_let ]let _ =\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind)\nin\nLS.serialize32_synth _\n synth_ticketContents13\n _\n ticketContents13'_serializer32\n synth_ticketContents13_recip\n (fun x -> synth_ticketContents13_recip x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.synth_ticketContents13_inverse", "original_source_type": "val synth_ticketContents13_inverse: Prims.unit\n -> Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)", "source_type": "val synth_ticketContents13_inverse: Prims.unit\n -> Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)", "source_definition": "let synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 53, "start_col": 2, "end_line": 53, "end_col": 84 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_inverse Parsers.TicketContents13.synth_ticketContents13\n Parsers.TicketContents13.synth_ticketContents13_recip)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.Combinators.synth_inverse", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.synth_ticketContents13", "Parsers.TicketContents13.synth_ticketContents13_recip", "Prims.l_True", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_ticketContents13_inverse: Prims.unit\n -> Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\nlet synth_ticketContents13_inverse ()\n : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =", "completed_definiton": "assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.ticketContents13_parser32", "original_source_type": "val ticketContents13_parser32: LS.parser32 ticketContents13_parser", "source_type": "val ticketContents13_parser32: LS.parser32 ticketContents13_parser", "source_definition": "let ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 83, "start_col": 2, "end_line": 85, "end_col": 109 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.TicketContents13.ticketContents13_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.synth_ticketContents13", "Prims.eq2", "Parsers.TicketContents13.ticketContents13'_parser32", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.Base.parser_kind", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13'_parser_kind", "Parsers.TicketContents13.synth_ticketContents13_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_parser32: LS.parser32 ticketContents13_parser\nlet ticketContents13_parser32 =", "completed_definiton": "[@@ inline_let ]let _ = synth_ticketContents13_injective () in\n[@@ inline_let ]let _ =\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind)\nin\nLS.parse32_synth _\n synth_ticketContents13\n (fun x -> synth_ticketContents13 x)\n ticketContents13'_parser32\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.ticketContents13_jumper", "original_source_type": "val ticketContents13_jumper: LL.jumper ticketContents13_parser", "source_type": "val ticketContents13_jumper: LL.jumper ticketContents13_parser", "source_definition": "let ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 113, "start_col": 2, "end_line": 115, "end_col": 66 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.TicketContents13.ticketContents13_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.jump_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.ticketContents13'_jumper", "Parsers.TicketContents13.synth_ticketContents13", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13'_parser_kind", "Parsers.TicketContents13.synth_ticketContents13_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_jumper: LL.jumper ticketContents13_parser\nlet ticketContents13_jumper =", "completed_definiton": "[@@ inline_let ]let _ = synth_ticketContents13_injective () in\n[@@ inline_let ]let _ =\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind)\nin\nLL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.ticketContents13'_serializer", "original_source_type": "val ticketContents13'_serializer:LP.serializer ticketContents13'_parser", "source_type": "val ticketContents13'_serializer:LP.serializer ticketContents13'_parser", "source_definition": "let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 68, "start_col": 86, "end_line": 68, "end_col": 395 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.TicketContents13.ticketContents13'_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "FStar.Pervasives.Native.tuple2", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "FStar.UInt32.t", "LowParse.Spec.Combinators.nondep_then", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.TicketContents13_rms.ticketContents13_rms_parser", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser", "LowParse.Spec.Int.parse_u32", "Parsers.CipherSuite.cipherSuite_serializer", "Parsers.TicketContents13_rms.ticketContents13_rms_serializer", "Parsers.TicketContents13_nonce.ticketContents13_nonce_serializer", "LowParse.Spec.Int.serialize_u32", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13'_serializer:LP.serializer ticketContents13'_parser\nlet ticketContents13'_serializer:LP.serializer ticketContents13'_parser =", "completed_definiton": "(((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer)\n `LP.serialize_nondep_then`\n (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32))\n `LP.serialize_nondep_then`\n (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.synth_ticketContents13_injective", "original_source_type": "val synth_ticketContents13_injective: Prims.unit\n -> Lemma (LP.synth_injective synth_ticketContents13)", "source_type": "val synth_ticketContents13_injective: Prims.unit\n -> Lemma (LP.synth_injective synth_ticketContents13)", "source_definition": "let synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 49, "start_col": 2, "end_line": 50, "end_col": 41 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_injective Parsers.TicketContents13.synth_ticketContents13)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "Parsers.TicketContents13.synth_ticketContents13_recip_inverse", "LowParse.Spec.Combinators.synth_inverse_synth_injective", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.synth_ticketContents13_recip", "Parsers.TicketContents13.synth_ticketContents13", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_injective", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_ticketContents13_injective: Prims.unit\n -> Lemma (LP.synth_injective synth_ticketContents13)\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =", "completed_definiton": "LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\nsynth_ticketContents13_recip_inverse ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.synth_ticketContents13_recip_injective", "original_source_type": "val synth_ticketContents13_recip_injective: Prims.unit\n -> Lemma (LP.synth_injective synth_ticketContents13_recip)", "source_type": "val synth_ticketContents13_recip_injective: Prims.unit\n -> Lemma (LP.synth_injective synth_ticketContents13_recip)", "source_definition": "let synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 56, "start_col": 2, "end_line": 57, "end_col": 86 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_injective Parsers.TicketContents13.synth_ticketContents13_recip\n )", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "LowParse.Spec.Combinators.synth_inverse_synth_injective", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.synth_ticketContents13", "Parsers.TicketContents13.synth_ticketContents13_recip", "Parsers.TicketContents13.synth_ticketContents13_recip_inverse", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_injective", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_ticketContents13_recip_injective: Prims.unit\n -> Lemma (LP.synth_injective synth_ticketContents13_recip)\nlet synth_ticketContents13_recip_injective ()\n : Lemma (LP.synth_injective synth_ticketContents13_recip) =", "completed_definiton": "synth_ticketContents13_recip_inverse ();\nLP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.ticketContents13_size32", "original_source_type": "val ticketContents13_size32: LSZ.size32 ticketContents13_serializer", "source_type": "val ticketContents13_size32: LSZ.size32 ticketContents13_serializer", "source_definition": "let ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 98, "start_col": 2, "end_line": 101, "end_col": 144 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.TicketContents13.ticketContents13_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.size32_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.synth_ticketContents13", "Parsers.TicketContents13.ticketContents13'_serializer", "Parsers.TicketContents13.ticketContents13'_size32", "Parsers.TicketContents13.synth_ticketContents13_recip", "Prims.eq2", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.Base.parser_kind", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13'_parser_kind", "Parsers.TicketContents13.synth_ticketContents13_inverse", "Parsers.TicketContents13.synth_ticketContents13_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_size32: LSZ.size32 ticketContents13_serializer\nlet ticketContents13_size32 =", "completed_definiton": "[@@ inline_let ]let _ = synth_ticketContents13_injective () in\n[@@ inline_let ]let _ = synth_ticketContents13_inverse () in\n[@@ inline_let ]let _ =\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind)\nin\nLSZ.size32_synth _\n synth_ticketContents13\n _\n ticketContents13'_size32\n synth_ticketContents13_recip\n (fun x -> synth_ticketContents13_recip x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.ticketContents13_validator", "original_source_type": "val ticketContents13_validator: LL.validator ticketContents13_parser", "source_type": "val ticketContents13_validator: LL.validator ticketContents13_parser", "source_definition": "let ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 106, "start_col": 2, "end_line": 108, "end_col": 73 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.TicketContents13.ticketContents13_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.validate_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.ticketContents13'_validator", "Parsers.TicketContents13.synth_ticketContents13", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13'_parser_kind", "Parsers.TicketContents13.synth_ticketContents13_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_validator: LL.validator ticketContents13_parser\nlet ticketContents13_validator =", "completed_definiton": "[@@ inline_let ]let _ = synth_ticketContents13_injective () in\n[@@ inline_let ]let _ =\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind)\nin\nLL.validate_synth ticketContents13'_validator synth_ticketContents13 ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.gaccessor_ticketContents13_custom_data", "original_source_type": "val gaccessor_ticketContents13_custom_data : LL.gaccessor ticketContents13_parser ticketContents13_custom_data_parser clens_ticketContents13_custom_data", "source_type": "val gaccessor_ticketContents13_custom_data : LL.gaccessor ticketContents13_parser ticketContents13_custom_data_parser clens_ticketContents13_custom_data", "source_definition": "let gaccessor_ticketContents13_custom_data = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_custom_data) clens_ticketContents13_custom_data ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 185, "start_col": 45, "end_line": 185, "end_col": 209 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()\n\nlet ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))\n\nlet gaccessor'_ticketContents13_cs : LL.gaccessor ticketContents13'_parser cipherSuite_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_rms : LL.gaccessor ticketContents13'_parser ticketContents13_rms_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_nonce : LL.gaccessor ticketContents13'_parser ticketContents13_nonce_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_creation_time : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_age_add : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\nlet gaccessor'_ticketContents13_custom_data : LL.gaccessor ticketContents13'_parser ticketContents13_custom_data_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_cs : LL.accessor gaccessor'_ticketContents13_cs = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_rms : LL.accessor gaccessor'_ticketContents13_rms = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))) cipherSuite_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_nonce : LL.accessor gaccessor'_ticketContents13_nonce = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_creation_time : LL.accessor gaccessor'_ticketContents13_creation_time = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)) ticketContents13_nonce_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_age_add : LL.accessor gaccessor'_ticketContents13_age_add = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_custom_data : LL.accessor gaccessor'_ticketContents13_custom_data = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))) LL.jump_u32)\n\nnoextract let clens_ticketContents13_ticketContents13' : LL.clens ticketContents13 ticketContents13' = synth_ticketContents13_recip_inverse (); synth_ticketContents13_recip_injective (); LL.clens_synth synth_ticketContents13_recip synth_ticketContents13\n\nlet gaccessor_ticketContents13_ticketContents13' : LL.gaccessor ticketContents13_parser ticketContents13'_parser clens_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.gaccessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\ninline_for_extraction noextract let accessor_ticketContents13_ticketContents13' : LL.accessor gaccessor_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.accessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\nlet gaccessor_ticketContents13_cs = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_cs) clens_ticketContents13_cs ()\n\nlet accessor_ticketContents13_cs = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_cs ()) clens_ticketContents13_cs ()\n\nlet gaccessor_ticketContents13_rms = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_rms) clens_ticketContents13_rms ()\n\nlet accessor_ticketContents13_rms = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_rms ()) clens_ticketContents13_rms ()\n\nlet gaccessor_ticketContents13_nonce = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_nonce) clens_ticketContents13_nonce ()\n\nlet accessor_ticketContents13_nonce = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_nonce ()) clens_ticketContents13_nonce ()\n\nlet gaccessor_ticketContents13_creation_time = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_creation_time) clens_ticketContents13_creation_time ()\n\nlet accessor_ticketContents13_creation_time = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_creation_time ()) clens_ticketContents13_creation_time ()\n\nlet gaccessor_ticketContents13_age_add = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_age_add) clens_ticketContents13_age_add ()\n\nlet accessor_ticketContents13_age_add = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_age_add ()) clens_ticketContents13_age_add ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.TicketContents13.ticketContents13_parser\n Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser\n Parsers.TicketContents13.clens_ticketContents13_custom_data", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.gaccessor_ext", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13_parser", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.clens_ticketContents13_ticketContents13'", "FStar.Pervasives.Native.tuple2", "FStar.UInt32.t", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.gaccessor_ticketContents13_ticketContents13'", "Parsers.TicketContents13.gaccessor'_ticketContents13_custom_data", "Parsers.TicketContents13.clens_ticketContents13_custom_data" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val gaccessor_ticketContents13_custom_data : LL.gaccessor ticketContents13_parser ticketContents13_custom_data_parser clens_ticketContents13_custom_data\nlet gaccessor_ticketContents13_custom_data =", "completed_definiton": "LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13'\n `LL.gaccessor_compose`\n gaccessor'_ticketContents13_custom_data)\n clens_ticketContents13_custom_data\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.accessor_ticketContents13_custom_data", "original_source_type": "val accessor_ticketContents13_custom_data : LL.accessor gaccessor_ticketContents13_custom_data", "source_type": "val accessor_ticketContents13_custom_data : LL.accessor gaccessor_ticketContents13_custom_data", "source_definition": "let accessor_ticketContents13_custom_data = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_custom_data ()) clens_ticketContents13_custom_data ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 187, "start_col": 44, "end_line": 187, "end_col": 205 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()\n\nlet ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))\n\nlet gaccessor'_ticketContents13_cs : LL.gaccessor ticketContents13'_parser cipherSuite_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_rms : LL.gaccessor ticketContents13'_parser ticketContents13_rms_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_nonce : LL.gaccessor ticketContents13'_parser ticketContents13_nonce_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_creation_time : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_age_add : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\nlet gaccessor'_ticketContents13_custom_data : LL.gaccessor ticketContents13'_parser ticketContents13_custom_data_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_cs : LL.accessor gaccessor'_ticketContents13_cs = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_rms : LL.accessor gaccessor'_ticketContents13_rms = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))) cipherSuite_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_nonce : LL.accessor gaccessor'_ticketContents13_nonce = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_creation_time : LL.accessor gaccessor'_ticketContents13_creation_time = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)) ticketContents13_nonce_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_age_add : LL.accessor gaccessor'_ticketContents13_age_add = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_custom_data : LL.accessor gaccessor'_ticketContents13_custom_data = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))) LL.jump_u32)\n\nnoextract let clens_ticketContents13_ticketContents13' : LL.clens ticketContents13 ticketContents13' = synth_ticketContents13_recip_inverse (); synth_ticketContents13_recip_injective (); LL.clens_synth synth_ticketContents13_recip synth_ticketContents13\n\nlet gaccessor_ticketContents13_ticketContents13' : LL.gaccessor ticketContents13_parser ticketContents13'_parser clens_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.gaccessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\ninline_for_extraction noextract let accessor_ticketContents13_ticketContents13' : LL.accessor gaccessor_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.accessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\nlet gaccessor_ticketContents13_cs = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_cs) clens_ticketContents13_cs ()\n\nlet accessor_ticketContents13_cs = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_cs ()) clens_ticketContents13_cs ()\n\nlet gaccessor_ticketContents13_rms = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_rms) clens_ticketContents13_rms ()\n\nlet accessor_ticketContents13_rms = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_rms ()) clens_ticketContents13_rms ()\n\nlet gaccessor_ticketContents13_nonce = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_nonce) clens_ticketContents13_nonce ()\n\nlet accessor_ticketContents13_nonce = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_nonce ()) clens_ticketContents13_nonce ()\n\nlet gaccessor_ticketContents13_creation_time = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_creation_time) clens_ticketContents13_creation_time ()\n\nlet accessor_ticketContents13_creation_time = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_creation_time ()) clens_ticketContents13_creation_time ()\n\nlet gaccessor_ticketContents13_age_add = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_age_add) clens_ticketContents13_age_add ()\n\nlet accessor_ticketContents13_age_add = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_age_add ()) clens_ticketContents13_age_add ()\n\nlet gaccessor_ticketContents13_custom_data = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_custom_data) clens_ticketContents13_custom_data ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents13.gaccessor_ticketContents13_custom_data", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.accessor_ext", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13_parser", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.clens_ticketContents13_ticketContents13'", "FStar.Pervasives.Native.tuple2", "FStar.UInt32.t", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.gaccessor_ticketContents13_ticketContents13'", "Parsers.TicketContents13.gaccessor'_ticketContents13_custom_data", "LowParse.Low.Base.accessor_compose", "Parsers.TicketContents13.accessor_ticketContents13_ticketContents13'", "Parsers.TicketContents13.accessor'_ticketContents13_custom_data", "Parsers.TicketContents13.clens_ticketContents13_custom_data" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor_ticketContents13_custom_data : LL.accessor gaccessor_ticketContents13_custom_data\nlet accessor_ticketContents13_custom_data =", "completed_definiton": "LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13'\n accessor'_ticketContents13_custom_data\n ())\n clens_ticketContents13_custom_data\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.accessor_ticketContents13_age_add", "original_source_type": "val accessor_ticketContents13_age_add : LL.accessor gaccessor_ticketContents13_age_add", "source_type": "val accessor_ticketContents13_age_add : LL.accessor gaccessor_ticketContents13_age_add", "source_definition": "let accessor_ticketContents13_age_add = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_age_add ()) clens_ticketContents13_age_add ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 183, "start_col": 40, "end_line": 183, "end_col": 193 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()\n\nlet ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))\n\nlet gaccessor'_ticketContents13_cs : LL.gaccessor ticketContents13'_parser cipherSuite_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_rms : LL.gaccessor ticketContents13'_parser ticketContents13_rms_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_nonce : LL.gaccessor ticketContents13'_parser ticketContents13_nonce_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_creation_time : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_age_add : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\nlet gaccessor'_ticketContents13_custom_data : LL.gaccessor ticketContents13'_parser ticketContents13_custom_data_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_cs : LL.accessor gaccessor'_ticketContents13_cs = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_rms : LL.accessor gaccessor'_ticketContents13_rms = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))) cipherSuite_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_nonce : LL.accessor gaccessor'_ticketContents13_nonce = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_creation_time : LL.accessor gaccessor'_ticketContents13_creation_time = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)) ticketContents13_nonce_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_age_add : LL.accessor gaccessor'_ticketContents13_age_add = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_custom_data : LL.accessor gaccessor'_ticketContents13_custom_data = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))) LL.jump_u32)\n\nnoextract let clens_ticketContents13_ticketContents13' : LL.clens ticketContents13 ticketContents13' = synth_ticketContents13_recip_inverse (); synth_ticketContents13_recip_injective (); LL.clens_synth synth_ticketContents13_recip synth_ticketContents13\n\nlet gaccessor_ticketContents13_ticketContents13' : LL.gaccessor ticketContents13_parser ticketContents13'_parser clens_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.gaccessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\ninline_for_extraction noextract let accessor_ticketContents13_ticketContents13' : LL.accessor gaccessor_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.accessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\nlet gaccessor_ticketContents13_cs = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_cs) clens_ticketContents13_cs ()\n\nlet accessor_ticketContents13_cs = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_cs ()) clens_ticketContents13_cs ()\n\nlet gaccessor_ticketContents13_rms = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_rms) clens_ticketContents13_rms ()\n\nlet accessor_ticketContents13_rms = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_rms ()) clens_ticketContents13_rms ()\n\nlet gaccessor_ticketContents13_nonce = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_nonce) clens_ticketContents13_nonce ()\n\nlet accessor_ticketContents13_nonce = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_nonce ()) clens_ticketContents13_nonce ()\n\nlet gaccessor_ticketContents13_creation_time = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_creation_time) clens_ticketContents13_creation_time ()\n\nlet accessor_ticketContents13_creation_time = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_creation_time ()) clens_ticketContents13_creation_time ()\n\nlet gaccessor_ticketContents13_age_add = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_age_add) clens_ticketContents13_age_add ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents13.gaccessor_ticketContents13_age_add", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.accessor_ext", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13_parser", "LowParse.Spec.Int.parse_u32_kind", "FStar.UInt32.t", "LowParse.Spec.Int.parse_u32", "LowParse.Low.Base.Spec.clens_compose", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.clens_ticketContents13_ticketContents13'", "FStar.Pervasives.Native.tuple2", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.gaccessor_ticketContents13_ticketContents13'", "Parsers.TicketContents13.gaccessor'_ticketContents13_age_add", "LowParse.Low.Base.accessor_compose", "Parsers.TicketContents13.accessor_ticketContents13_ticketContents13'", "Parsers.TicketContents13.accessor'_ticketContents13_age_add", "Parsers.TicketContents13.clens_ticketContents13_age_add" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor_ticketContents13_age_add : LL.accessor gaccessor_ticketContents13_age_add\nlet accessor_ticketContents13_age_add =", "completed_definiton": "LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13'\n accessor'_ticketContents13_age_add\n ())\n clens_ticketContents13_age_add\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.ticketContents13'_serializer32", "original_source_type": "val ticketContents13'_serializer32:LS.serializer32 ticketContents13'_serializer", "source_type": "val ticketContents13'_serializer32:LS.serializer32 ticketContents13'_serializer", "source_definition": "let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 87, "start_col": 106, "end_line": 87, "end_col": 435 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.TicketContents13.ticketContents13'_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "FStar.Pervasives.Native.tuple2", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "FStar.UInt32.t", "LowParse.Spec.Combinators.nondep_then", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.TicketContents13_rms.ticketContents13_rms_parser", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser", "LowParse.Spec.Int.parse_u32", "LowParse.Spec.Combinators.serialize_nondep_then", "Parsers.CipherSuite.cipherSuite_serializer", "Parsers.TicketContents13_rms.ticketContents13_rms_serializer", "Parsers.TicketContents13_nonce.ticketContents13_nonce_serializer", "LowParse.Spec.Int.serialize_u32", "Parsers.CipherSuite.cipherSuite_serializer32", "Parsers.TicketContents13_rms.ticketContents13_rms_serializer32", "Parsers.TicketContents13_nonce.ticketContents13_nonce_serializer32", "LowParse.SLow.Int.serialize32_u32", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_serializer", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_serializer32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13'_serializer32:LS.serializer32 ticketContents13'_serializer\nlet ticketContents13'_serializer32:LS.serializer32 ticketContents13'_serializer =", "completed_definiton": "(((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32)\n `LS.serialize32_nondep_then`\n (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32))\n `LS.serialize32_nondep_then`\n (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.gaccessor_ticketContents13_age_add", "original_source_type": "val gaccessor_ticketContents13_age_add : LL.gaccessor ticketContents13_parser LPI.parse_u32 clens_ticketContents13_age_add", "source_type": "val gaccessor_ticketContents13_age_add : LL.gaccessor ticketContents13_parser LPI.parse_u32 clens_ticketContents13_age_add", "source_definition": "let gaccessor_ticketContents13_age_add = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_age_add) clens_ticketContents13_age_add ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 181, "start_col": 41, "end_line": 181, "end_col": 197 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()\n\nlet ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))\n\nlet gaccessor'_ticketContents13_cs : LL.gaccessor ticketContents13'_parser cipherSuite_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_rms : LL.gaccessor ticketContents13'_parser ticketContents13_rms_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_nonce : LL.gaccessor ticketContents13'_parser ticketContents13_nonce_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_creation_time : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_age_add : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\nlet gaccessor'_ticketContents13_custom_data : LL.gaccessor ticketContents13'_parser ticketContents13_custom_data_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_cs : LL.accessor gaccessor'_ticketContents13_cs = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_rms : LL.accessor gaccessor'_ticketContents13_rms = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))) cipherSuite_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_nonce : LL.accessor gaccessor'_ticketContents13_nonce = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_creation_time : LL.accessor gaccessor'_ticketContents13_creation_time = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)) ticketContents13_nonce_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_age_add : LL.accessor gaccessor'_ticketContents13_age_add = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_custom_data : LL.accessor gaccessor'_ticketContents13_custom_data = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))) LL.jump_u32)\n\nnoextract let clens_ticketContents13_ticketContents13' : LL.clens ticketContents13 ticketContents13' = synth_ticketContents13_recip_inverse (); synth_ticketContents13_recip_injective (); LL.clens_synth synth_ticketContents13_recip synth_ticketContents13\n\nlet gaccessor_ticketContents13_ticketContents13' : LL.gaccessor ticketContents13_parser ticketContents13'_parser clens_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.gaccessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\ninline_for_extraction noextract let accessor_ticketContents13_ticketContents13' : LL.accessor gaccessor_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.accessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\nlet gaccessor_ticketContents13_cs = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_cs) clens_ticketContents13_cs ()\n\nlet accessor_ticketContents13_cs = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_cs ()) clens_ticketContents13_cs ()\n\nlet gaccessor_ticketContents13_rms = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_rms) clens_ticketContents13_rms ()\n\nlet accessor_ticketContents13_rms = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_rms ()) clens_ticketContents13_rms ()\n\nlet gaccessor_ticketContents13_nonce = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_nonce) clens_ticketContents13_nonce ()\n\nlet accessor_ticketContents13_nonce = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_nonce ()) clens_ticketContents13_nonce ()\n\nlet gaccessor_ticketContents13_creation_time = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_creation_time) clens_ticketContents13_creation_time ()\n\nlet accessor_ticketContents13_creation_time = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_creation_time ()) clens_ticketContents13_creation_time ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.TicketContents13.ticketContents13_parser\n LowParse.Spec.Int.parse_u32\n Parsers.TicketContents13.clens_ticketContents13_age_add", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.gaccessor_ext", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13_parser", "LowParse.Spec.Int.parse_u32_kind", "FStar.UInt32.t", "LowParse.Spec.Int.parse_u32", "LowParse.Low.Base.Spec.clens_compose", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.clens_ticketContents13_ticketContents13'", "FStar.Pervasives.Native.tuple2", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.gaccessor_ticketContents13_ticketContents13'", "Parsers.TicketContents13.gaccessor'_ticketContents13_age_add", "Parsers.TicketContents13.clens_ticketContents13_age_add" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val gaccessor_ticketContents13_age_add : LL.gaccessor ticketContents13_parser LPI.parse_u32 clens_ticketContents13_age_add\nlet gaccessor_ticketContents13_age_add =", "completed_definiton": "LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13'\n `LL.gaccessor_compose`\n gaccessor'_ticketContents13_age_add)\n clens_ticketContents13_age_add\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.gaccessor_ticketContents13_cs", "original_source_type": "val gaccessor_ticketContents13_cs : LL.gaccessor ticketContents13_parser cipherSuite_parser clens_ticketContents13_cs", "source_type": "val gaccessor_ticketContents13_cs : LL.gaccessor ticketContents13_parser cipherSuite_parser clens_ticketContents13_cs", "source_definition": "let gaccessor_ticketContents13_cs = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_cs) clens_ticketContents13_cs ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 165, "start_col": 36, "end_line": 165, "end_col": 182 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()\n\nlet ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))\n\nlet gaccessor'_ticketContents13_cs : LL.gaccessor ticketContents13'_parser cipherSuite_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_rms : LL.gaccessor ticketContents13'_parser ticketContents13_rms_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_nonce : LL.gaccessor ticketContents13'_parser ticketContents13_nonce_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_creation_time : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_age_add : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\nlet gaccessor'_ticketContents13_custom_data : LL.gaccessor ticketContents13'_parser ticketContents13_custom_data_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_cs : LL.accessor gaccessor'_ticketContents13_cs = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_rms : LL.accessor gaccessor'_ticketContents13_rms = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))) cipherSuite_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_nonce : LL.accessor gaccessor'_ticketContents13_nonce = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_creation_time : LL.accessor gaccessor'_ticketContents13_creation_time = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)) ticketContents13_nonce_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_age_add : LL.accessor gaccessor'_ticketContents13_age_add = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_custom_data : LL.accessor gaccessor'_ticketContents13_custom_data = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))) LL.jump_u32)\n\nnoextract let clens_ticketContents13_ticketContents13' : LL.clens ticketContents13 ticketContents13' = synth_ticketContents13_recip_inverse (); synth_ticketContents13_recip_injective (); LL.clens_synth synth_ticketContents13_recip synth_ticketContents13\n\nlet gaccessor_ticketContents13_ticketContents13' : LL.gaccessor ticketContents13_parser ticketContents13'_parser clens_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.gaccessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\ninline_for_extraction noextract let accessor_ticketContents13_ticketContents13' : LL.accessor gaccessor_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.accessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.TicketContents13.ticketContents13_parser\n Parsers.CipherSuite.cipherSuite_parser\n Parsers.TicketContents13.clens_ticketContents13_cs", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.gaccessor_ext", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13_parser", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.CipherSuite.cipherSuite", "Parsers.CipherSuite.cipherSuite_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.clens_ticketContents13_ticketContents13'", "FStar.Pervasives.Native.tuple2", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "FStar.UInt32.t", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.gaccessor_ticketContents13_ticketContents13'", "Parsers.TicketContents13.gaccessor'_ticketContents13_cs", "Parsers.TicketContents13.clens_ticketContents13_cs" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val gaccessor_ticketContents13_cs : LL.gaccessor ticketContents13_parser cipherSuite_parser clens_ticketContents13_cs\nlet gaccessor_ticketContents13_cs =", "completed_definiton": "LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13'\n `LL.gaccessor_compose`\n gaccessor'_ticketContents13_cs)\n clens_ticketContents13_cs\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.accessor_ticketContents13_ticketContents13'", "original_source_type": "val accessor_ticketContents13_ticketContents13':LL.accessor gaccessor_ticketContents13_ticketContents13'", "source_type": "val accessor_ticketContents13_ticketContents13':LL.accessor gaccessor_ticketContents13_ticketContents13'", "source_definition": "let accessor_ticketContents13_ticketContents13' : LL.accessor gaccessor_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.accessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 163, "start_col": 141, "end_line": 163, "end_col": 351 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()\n\nlet ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))\n\nlet gaccessor'_ticketContents13_cs : LL.gaccessor ticketContents13'_parser cipherSuite_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_rms : LL.gaccessor ticketContents13'_parser ticketContents13_rms_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_nonce : LL.gaccessor ticketContents13'_parser ticketContents13_nonce_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_creation_time : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_age_add : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\nlet gaccessor'_ticketContents13_custom_data : LL.gaccessor ticketContents13'_parser ticketContents13_custom_data_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_cs : LL.accessor gaccessor'_ticketContents13_cs = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_rms : LL.accessor gaccessor'_ticketContents13_rms = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))) cipherSuite_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_nonce : LL.accessor gaccessor'_ticketContents13_nonce = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_creation_time : LL.accessor gaccessor'_ticketContents13_creation_time = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)) ticketContents13_nonce_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_age_add : LL.accessor gaccessor'_ticketContents13_age_add = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_custom_data : LL.accessor gaccessor'_ticketContents13_custom_data = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))) LL.jump_u32)\n\nnoextract let clens_ticketContents13_ticketContents13' : LL.clens ticketContents13 ticketContents13' = synth_ticketContents13_recip_inverse (); synth_ticketContents13_recip_injective (); LL.clens_synth synth_ticketContents13_recip synth_ticketContents13\n\nlet gaccessor_ticketContents13_ticketContents13' : LL.gaccessor ticketContents13_parser ticketContents13'_parser clens_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.gaccessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents13.gaccessor_ticketContents13_ticketContents13'", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.accessor_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.synth_ticketContents13", "Parsers.TicketContents13.synth_ticketContents13_recip", "Prims.unit", "Parsers.TicketContents13.synth_ticketContents13_recip_inverse", "Parsers.TicketContents13.synth_ticketContents13_injective", "Parsers.TicketContents13.synth_ticketContents13_inverse" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor_ticketContents13_ticketContents13':LL.accessor gaccessor_ticketContents13_ticketContents13'\nlet accessor_ticketContents13_ticketContents13':LL.accessor gaccessor_ticketContents13_ticketContents13'\n =", "completed_definiton": "synth_ticketContents13_inverse ();\nsynth_ticketContents13_injective ();\nsynth_ticketContents13_recip_inverse ();\nLL.accessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.accessor_ticketContents13_rms", "original_source_type": "val accessor_ticketContents13_rms : LL.accessor gaccessor_ticketContents13_rms", "source_type": "val accessor_ticketContents13_rms : LL.accessor gaccessor_ticketContents13_rms", "source_definition": "let accessor_ticketContents13_rms = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_rms ()) clens_ticketContents13_rms ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 171, "start_col": 36, "end_line": 171, "end_col": 181 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()\n\nlet ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))\n\nlet gaccessor'_ticketContents13_cs : LL.gaccessor ticketContents13'_parser cipherSuite_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_rms : LL.gaccessor ticketContents13'_parser ticketContents13_rms_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_nonce : LL.gaccessor ticketContents13'_parser ticketContents13_nonce_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_creation_time : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_age_add : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\nlet gaccessor'_ticketContents13_custom_data : LL.gaccessor ticketContents13'_parser ticketContents13_custom_data_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_cs : LL.accessor gaccessor'_ticketContents13_cs = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_rms : LL.accessor gaccessor'_ticketContents13_rms = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))) cipherSuite_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_nonce : LL.accessor gaccessor'_ticketContents13_nonce = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_creation_time : LL.accessor gaccessor'_ticketContents13_creation_time = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)) ticketContents13_nonce_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_age_add : LL.accessor gaccessor'_ticketContents13_age_add = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_custom_data : LL.accessor gaccessor'_ticketContents13_custom_data = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))) LL.jump_u32)\n\nnoextract let clens_ticketContents13_ticketContents13' : LL.clens ticketContents13 ticketContents13' = synth_ticketContents13_recip_inverse (); synth_ticketContents13_recip_injective (); LL.clens_synth synth_ticketContents13_recip synth_ticketContents13\n\nlet gaccessor_ticketContents13_ticketContents13' : LL.gaccessor ticketContents13_parser ticketContents13'_parser clens_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.gaccessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\ninline_for_extraction noextract let accessor_ticketContents13_ticketContents13' : LL.accessor gaccessor_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.accessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\nlet gaccessor_ticketContents13_cs = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_cs) clens_ticketContents13_cs ()\n\nlet accessor_ticketContents13_cs = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_cs ()) clens_ticketContents13_cs ()\n\nlet gaccessor_ticketContents13_rms = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_rms) clens_ticketContents13_rms ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents13.gaccessor_ticketContents13_rms", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.accessor_ext", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13_parser", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_rms.ticketContents13_rms_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.clens_ticketContents13_ticketContents13'", "FStar.Pervasives.Native.tuple2", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "FStar.UInt32.t", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.gaccessor_ticketContents13_ticketContents13'", "Parsers.TicketContents13.gaccessor'_ticketContents13_rms", "LowParse.Low.Base.accessor_compose", "Parsers.TicketContents13.accessor_ticketContents13_ticketContents13'", "Parsers.TicketContents13.accessor'_ticketContents13_rms", "Parsers.TicketContents13.clens_ticketContents13_rms" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor_ticketContents13_rms : LL.accessor gaccessor_ticketContents13_rms\nlet accessor_ticketContents13_rms =", "completed_definiton": "LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13'\n accessor'_ticketContents13_rms\n ())\n clens_ticketContents13_rms\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.accessor_ticketContents13_cs", "original_source_type": "val accessor_ticketContents13_cs : LL.accessor gaccessor_ticketContents13_cs", "source_type": "val accessor_ticketContents13_cs : LL.accessor gaccessor_ticketContents13_cs", "source_definition": "let accessor_ticketContents13_cs = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_cs ()) clens_ticketContents13_cs ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 167, "start_col": 35, "end_line": 167, "end_col": 178 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()\n\nlet ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))\n\nlet gaccessor'_ticketContents13_cs : LL.gaccessor ticketContents13'_parser cipherSuite_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_rms : LL.gaccessor ticketContents13'_parser ticketContents13_rms_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_nonce : LL.gaccessor ticketContents13'_parser ticketContents13_nonce_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_creation_time : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_age_add : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\nlet gaccessor'_ticketContents13_custom_data : LL.gaccessor ticketContents13'_parser ticketContents13_custom_data_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_cs : LL.accessor gaccessor'_ticketContents13_cs = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_rms : LL.accessor gaccessor'_ticketContents13_rms = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))) cipherSuite_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_nonce : LL.accessor gaccessor'_ticketContents13_nonce = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_creation_time : LL.accessor gaccessor'_ticketContents13_creation_time = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)) ticketContents13_nonce_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_age_add : LL.accessor gaccessor'_ticketContents13_age_add = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_custom_data : LL.accessor gaccessor'_ticketContents13_custom_data = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))) LL.jump_u32)\n\nnoextract let clens_ticketContents13_ticketContents13' : LL.clens ticketContents13 ticketContents13' = synth_ticketContents13_recip_inverse (); synth_ticketContents13_recip_injective (); LL.clens_synth synth_ticketContents13_recip synth_ticketContents13\n\nlet gaccessor_ticketContents13_ticketContents13' : LL.gaccessor ticketContents13_parser ticketContents13'_parser clens_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.gaccessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\ninline_for_extraction noextract let accessor_ticketContents13_ticketContents13' : LL.accessor gaccessor_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.accessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\nlet gaccessor_ticketContents13_cs = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_cs) clens_ticketContents13_cs ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents13.gaccessor_ticketContents13_cs", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.accessor_ext", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13_parser", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.CipherSuite.cipherSuite", "Parsers.CipherSuite.cipherSuite_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.clens_ticketContents13_ticketContents13'", "FStar.Pervasives.Native.tuple2", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "FStar.UInt32.t", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.gaccessor_ticketContents13_ticketContents13'", "Parsers.TicketContents13.gaccessor'_ticketContents13_cs", "LowParse.Low.Base.accessor_compose", "Parsers.TicketContents13.accessor_ticketContents13_ticketContents13'", "Parsers.TicketContents13.accessor'_ticketContents13_cs", "Parsers.TicketContents13.clens_ticketContents13_cs" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor_ticketContents13_cs : LL.accessor gaccessor_ticketContents13_cs\nlet accessor_ticketContents13_cs =", "completed_definiton": "LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13'\n accessor'_ticketContents13_cs\n ())\n clens_ticketContents13_cs\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.gaccessor_ticketContents13_nonce", "original_source_type": "val gaccessor_ticketContents13_nonce : LL.gaccessor ticketContents13_parser ticketContents13_nonce_parser clens_ticketContents13_nonce", "source_type": "val gaccessor_ticketContents13_nonce : LL.gaccessor ticketContents13_parser ticketContents13_nonce_parser clens_ticketContents13_nonce", "source_definition": "let gaccessor_ticketContents13_nonce = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_nonce) clens_ticketContents13_nonce ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 173, "start_col": 39, "end_line": 173, "end_col": 191 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()\n\nlet ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))\n\nlet gaccessor'_ticketContents13_cs : LL.gaccessor ticketContents13'_parser cipherSuite_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_rms : LL.gaccessor ticketContents13'_parser ticketContents13_rms_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_nonce : LL.gaccessor ticketContents13'_parser ticketContents13_nonce_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_creation_time : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_age_add : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\nlet gaccessor'_ticketContents13_custom_data : LL.gaccessor ticketContents13'_parser ticketContents13_custom_data_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_cs : LL.accessor gaccessor'_ticketContents13_cs = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_rms : LL.accessor gaccessor'_ticketContents13_rms = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))) cipherSuite_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_nonce : LL.accessor gaccessor'_ticketContents13_nonce = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_creation_time : LL.accessor gaccessor'_ticketContents13_creation_time = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)) ticketContents13_nonce_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_age_add : LL.accessor gaccessor'_ticketContents13_age_add = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_custom_data : LL.accessor gaccessor'_ticketContents13_custom_data = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))) LL.jump_u32)\n\nnoextract let clens_ticketContents13_ticketContents13' : LL.clens ticketContents13 ticketContents13' = synth_ticketContents13_recip_inverse (); synth_ticketContents13_recip_injective (); LL.clens_synth synth_ticketContents13_recip synth_ticketContents13\n\nlet gaccessor_ticketContents13_ticketContents13' : LL.gaccessor ticketContents13_parser ticketContents13'_parser clens_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.gaccessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\ninline_for_extraction noextract let accessor_ticketContents13_ticketContents13' : LL.accessor gaccessor_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.accessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\nlet gaccessor_ticketContents13_cs = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_cs) clens_ticketContents13_cs ()\n\nlet accessor_ticketContents13_cs = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_cs ()) clens_ticketContents13_cs ()\n\nlet gaccessor_ticketContents13_rms = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_rms) clens_ticketContents13_rms ()\n\nlet accessor_ticketContents13_rms = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_rms ()) clens_ticketContents13_rms ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.TicketContents13.ticketContents13_parser\n Parsers.TicketContents13_nonce.ticketContents13_nonce_parser\n Parsers.TicketContents13.clens_ticketContents13_nonce", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.gaccessor_ext", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13_parser", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.clens_ticketContents13_ticketContents13'", "FStar.Pervasives.Native.tuple2", "FStar.UInt32.t", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.gaccessor_ticketContents13_ticketContents13'", "Parsers.TicketContents13.gaccessor'_ticketContents13_nonce", "Parsers.TicketContents13.clens_ticketContents13_nonce" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val gaccessor_ticketContents13_nonce : LL.gaccessor ticketContents13_parser ticketContents13_nonce_parser clens_ticketContents13_nonce\nlet gaccessor_ticketContents13_nonce =", "completed_definiton": "LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13'\n `LL.gaccessor_compose`\n gaccessor'_ticketContents13_nonce)\n clens_ticketContents13_nonce\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.ticketContents13_bytesize_eqn", "original_source_type": "val ticketContents13_bytesize_eqn (x: ticketContents13) : Lemma (ticketContents13_bytesize x == (cipherSuite_bytesize (x.cs)) + (ticketContents13_rms_bytesize (x.rms)) + (ticketContents13_nonce_bytesize (x.nonce)) + 4 + 4 + (ticketContents13_custom_data_bytesize (x.custom_data))) [SMTPat (ticketContents13_bytesize x)]", "source_type": "val ticketContents13_bytesize_eqn (x: ticketContents13) : Lemma (ticketContents13_bytesize x == (cipherSuite_bytesize (x.cs)) + (ticketContents13_rms_bytesize (x.rms)) + (ticketContents13_nonce_bytesize (x.nonce)) + 4 + 4 + (ticketContents13_custom_data_bytesize (x.custom_data))) [SMTPat (ticketContents13_bytesize x)]", "source_definition": "let ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 118, "start_col": 2, "end_line": 133, "end_col": 430 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.TicketContents13.ticketContents13\n -> FStar.Pervasives.Lemma\n (ensures\n Parsers.TicketContents13.ticketContents13_bytesize x ==\n Parsers.CipherSuite.cipherSuite_bytesize (MkticketContents13?.cs x) +\n Parsers.TicketContents13_rms.ticketContents13_rms_bytesize (MkticketContents13?.rms x) +\n Parsers.TicketContents13_nonce.ticketContents13_nonce_bytesize (MkticketContents13?.nonce x) +\n 4 +\n 4 +\n Parsers.TicketContents13_custom_data.ticketContents13_custom_data_bytesize (MkticketContents13?.custom_data\n x)) [SMTPat (Parsers.TicketContents13.ticketContents13_bytesize x)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.TicketContents13.ticketContents13", "Prims._assert", "Prims.eq2", "Prims.int", "Parsers.TicketContents13.ticketContents13_bytesize", "Prims.op_Addition", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.CipherSuite.cipherSuite", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.CipherSuite.cipherSuite_serializer", "Parsers.TicketContents13.__proj__MkticketContents13__item__cs", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_rms.ticketContents13_rms_parser", "Parsers.TicketContents13_rms.ticketContents13_rms_serializer", "Parsers.TicketContents13.__proj__MkticketContents13__item__rms", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser", "Parsers.TicketContents13_nonce.ticketContents13_nonce_serializer", "Parsers.TicketContents13.__proj__MkticketContents13__item__nonce", "LowParse.Spec.Int.parse_u32_kind", "FStar.UInt32.t", "LowParse.Spec.Int.parse_u32", "LowParse.Spec.Int.serialize_u32", "Parsers.TicketContents13.__proj__MkticketContents13__item__creation_time", "Parsers.TicketContents13.__proj__MkticketContents13__item__age_add", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_serializer", "Parsers.TicketContents13.__proj__MkticketContents13__item__custom_data", "Prims.unit", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_bytesize_eq", "Parsers.TicketContents13_nonce.ticketContents13_nonce_bytesize_eq", "Parsers.TicketContents13_rms.ticketContents13_rms_bytesize_eq", "Parsers.CipherSuite.cipherSuite_bytesize_eq", "LowParse.Spec.Combinators.length_serialize_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Combinators.serialize_nondep_then", "FStar.Pervasives.Native.Mktuple2", "LowParse.Spec.Combinators.serialize_synth_eq", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.synth_ticketContents13", "Parsers.TicketContents13.ticketContents13'_serializer", "Parsers.TicketContents13.synth_ticketContents13_recip", "FStar.Pervasives.assert_norm", "LowParse.Spec.Base.parser_kind", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13'_parser_kind", "Parsers.TicketContents13.synth_ticketContents13_inverse", "Parsers.TicketContents13.synth_ticketContents13_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_bytesize_eqn (x: ticketContents13) : Lemma (ticketContents13_bytesize x == (cipherSuite_bytesize (x.cs)) + (ticketContents13_rms_bytesize (x.rms)) + (ticketContents13_nonce_bytesize (x.nonce)) + 4 + 4 + (ticketContents13_custom_data_bytesize (x.custom_data))) [SMTPat (ticketContents13_bytesize x)]\nlet ticketContents13_bytesize_eqn x =", "completed_definiton": "[@@ inline_let ]let _ = synth_ticketContents13_injective () in\n[@@ inline_let ]let _ = synth_ticketContents13_inverse () in\n[@@ inline_let ]let _ =\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind)\nin\nLP.serialize_synth_eq _\n synth_ticketContents13\n ticketContents13'_serializer\n synth_ticketContents13_recip\n ()\n x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer\n LPI.serialize_u32\n x.nonce\n x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer\n `LP.serialize_nondep_then`\n ticketContents13_rms_serializer)\n (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)\n (x.cs, x.rms)\n (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32\n ticketContents13_custom_data_serializer\n x.age_add\n x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer\n `LP.serialize_nondep_then`\n ticketContents13_rms_serializer)\n `LP.serialize_nondep_then`\n (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32))\n (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer)\n ((x.cs, x.rms), (x.nonce, x.creation_time))\n (x.age_add, x.custom_data);\n(cipherSuite_bytesize_eq (x.cs));\n(ticketContents13_rms_bytesize_eq (x.rms));\n(ticketContents13_nonce_bytesize_eq (x.nonce));\n(assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n(assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n(ticketContents13_custom_data_bytesize_eq (x.custom_data));\nassert (ticketContents13_bytesize x ==\n Seq.length (LP.serialize cipherSuite_serializer x.cs) +\n Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) +\n Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) +\n Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) +\n Seq.length (LP.serialize LPI.serialize_u32 x.age_add) +\n Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.gaccessor_ticketContents13_ticketContents13'", "original_source_type": "val gaccessor_ticketContents13_ticketContents13':LL.gaccessor ticketContents13_parser\n ticketContents13'_parser\n clens_ticketContents13_ticketContents13'", "source_type": "val gaccessor_ticketContents13_ticketContents13':LL.gaccessor ticketContents13_parser\n ticketContents13'_parser\n clens_ticketContents13_ticketContents13'", "source_definition": "let gaccessor_ticketContents13_ticketContents13' : LL.gaccessor ticketContents13_parser ticketContents13'_parser clens_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.gaccessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 161, "start_col": 156, "end_line": 161, "end_col": 367 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()\n\nlet ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))\n\nlet gaccessor'_ticketContents13_cs : LL.gaccessor ticketContents13'_parser cipherSuite_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_rms : LL.gaccessor ticketContents13'_parser ticketContents13_rms_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_nonce : LL.gaccessor ticketContents13'_parser ticketContents13_nonce_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_creation_time : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_age_add : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\nlet gaccessor'_ticketContents13_custom_data : LL.gaccessor ticketContents13'_parser ticketContents13_custom_data_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_cs : LL.accessor gaccessor'_ticketContents13_cs = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_rms : LL.accessor gaccessor'_ticketContents13_rms = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))) cipherSuite_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_nonce : LL.accessor gaccessor'_ticketContents13_nonce = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_creation_time : LL.accessor gaccessor'_ticketContents13_creation_time = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)) ticketContents13_nonce_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_age_add : LL.accessor gaccessor'_ticketContents13_age_add = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_custom_data : LL.accessor gaccessor'_ticketContents13_custom_data = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))) LL.jump_u32)\n\nnoextract let clens_ticketContents13_ticketContents13' : LL.clens ticketContents13 ticketContents13' = synth_ticketContents13_recip_inverse (); synth_ticketContents13_recip_injective (); LL.clens_synth synth_ticketContents13_recip synth_ticketContents13", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.TicketContents13.ticketContents13_parser\n Parsers.TicketContents13.ticketContents13'_parser\n Parsers.TicketContents13.clens_ticketContents13_ticketContents13'", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.gaccessor_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.synth_ticketContents13", "Parsers.TicketContents13.synth_ticketContents13_recip", "Prims.unit", "Parsers.TicketContents13.synth_ticketContents13_recip_inverse", "Parsers.TicketContents13.synth_ticketContents13_injective", "Parsers.TicketContents13.synth_ticketContents13_inverse" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val gaccessor_ticketContents13_ticketContents13':LL.gaccessor ticketContents13_parser\n ticketContents13'_parser\n clens_ticketContents13_ticketContents13'\nlet gaccessor_ticketContents13_ticketContents13':LL.gaccessor ticketContents13_parser\n ticketContents13'_parser\n clens_ticketContents13_ticketContents13' =", "completed_definiton": "synth_ticketContents13_inverse ();\nsynth_ticketContents13_injective ();\nsynth_ticketContents13_recip_inverse ();\nLL.gaccessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.gaccessor_ticketContents13_creation_time", "original_source_type": "val gaccessor_ticketContents13_creation_time : LL.gaccessor ticketContents13_parser LPI.parse_u32 clens_ticketContents13_creation_time", "source_type": "val gaccessor_ticketContents13_creation_time : LL.gaccessor ticketContents13_parser LPI.parse_u32 clens_ticketContents13_creation_time", "source_definition": "let gaccessor_ticketContents13_creation_time = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_creation_time) clens_ticketContents13_creation_time ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 177, "start_col": 47, "end_line": 177, "end_col": 215 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()\n\nlet ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))\n\nlet gaccessor'_ticketContents13_cs : LL.gaccessor ticketContents13'_parser cipherSuite_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_rms : LL.gaccessor ticketContents13'_parser ticketContents13_rms_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_nonce : LL.gaccessor ticketContents13'_parser ticketContents13_nonce_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_creation_time : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_age_add : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\nlet gaccessor'_ticketContents13_custom_data : LL.gaccessor ticketContents13'_parser ticketContents13_custom_data_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_cs : LL.accessor gaccessor'_ticketContents13_cs = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_rms : LL.accessor gaccessor'_ticketContents13_rms = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))) cipherSuite_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_nonce : LL.accessor gaccessor'_ticketContents13_nonce = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_creation_time : LL.accessor gaccessor'_ticketContents13_creation_time = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)) ticketContents13_nonce_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_age_add : LL.accessor gaccessor'_ticketContents13_age_add = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_custom_data : LL.accessor gaccessor'_ticketContents13_custom_data = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))) LL.jump_u32)\n\nnoextract let clens_ticketContents13_ticketContents13' : LL.clens ticketContents13 ticketContents13' = synth_ticketContents13_recip_inverse (); synth_ticketContents13_recip_injective (); LL.clens_synth synth_ticketContents13_recip synth_ticketContents13\n\nlet gaccessor_ticketContents13_ticketContents13' : LL.gaccessor ticketContents13_parser ticketContents13'_parser clens_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.gaccessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\ninline_for_extraction noextract let accessor_ticketContents13_ticketContents13' : LL.accessor gaccessor_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.accessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\nlet gaccessor_ticketContents13_cs = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_cs) clens_ticketContents13_cs ()\n\nlet accessor_ticketContents13_cs = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_cs ()) clens_ticketContents13_cs ()\n\nlet gaccessor_ticketContents13_rms = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_rms) clens_ticketContents13_rms ()\n\nlet accessor_ticketContents13_rms = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_rms ()) clens_ticketContents13_rms ()\n\nlet gaccessor_ticketContents13_nonce = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_nonce) clens_ticketContents13_nonce ()\n\nlet accessor_ticketContents13_nonce = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_nonce ()) clens_ticketContents13_nonce ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.TicketContents13.ticketContents13_parser\n LowParse.Spec.Int.parse_u32\n Parsers.TicketContents13.clens_ticketContents13_creation_time", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.gaccessor_ext", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13_parser", "LowParse.Spec.Int.parse_u32_kind", "FStar.UInt32.t", "LowParse.Spec.Int.parse_u32", "LowParse.Low.Base.Spec.clens_compose", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.clens_ticketContents13_ticketContents13'", "FStar.Pervasives.Native.tuple2", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.gaccessor_ticketContents13_ticketContents13'", "Parsers.TicketContents13.gaccessor'_ticketContents13_creation_time", "Parsers.TicketContents13.clens_ticketContents13_creation_time" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val gaccessor_ticketContents13_creation_time : LL.gaccessor ticketContents13_parser LPI.parse_u32 clens_ticketContents13_creation_time\nlet gaccessor_ticketContents13_creation_time =", "completed_definiton": "LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13'\n `LL.gaccessor_compose`\n gaccessor'_ticketContents13_creation_time)\n clens_ticketContents13_creation_time\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.accessor_ticketContents13_creation_time", "original_source_type": "val accessor_ticketContents13_creation_time : LL.accessor gaccessor_ticketContents13_creation_time", "source_type": "val accessor_ticketContents13_creation_time : LL.accessor gaccessor_ticketContents13_creation_time", "source_definition": "let accessor_ticketContents13_creation_time = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_creation_time ()) clens_ticketContents13_creation_time ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 179, "start_col": 46, "end_line": 179, "end_col": 211 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()\n\nlet ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))\n\nlet gaccessor'_ticketContents13_cs : LL.gaccessor ticketContents13'_parser cipherSuite_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_rms : LL.gaccessor ticketContents13'_parser ticketContents13_rms_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_nonce : LL.gaccessor ticketContents13'_parser ticketContents13_nonce_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_creation_time : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_age_add : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\nlet gaccessor'_ticketContents13_custom_data : LL.gaccessor ticketContents13'_parser ticketContents13_custom_data_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_cs : LL.accessor gaccessor'_ticketContents13_cs = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_rms : LL.accessor gaccessor'_ticketContents13_rms = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))) cipherSuite_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_nonce : LL.accessor gaccessor'_ticketContents13_nonce = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_creation_time : LL.accessor gaccessor'_ticketContents13_creation_time = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)) ticketContents13_nonce_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_age_add : LL.accessor gaccessor'_ticketContents13_age_add = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_custom_data : LL.accessor gaccessor'_ticketContents13_custom_data = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))) LL.jump_u32)\n\nnoextract let clens_ticketContents13_ticketContents13' : LL.clens ticketContents13 ticketContents13' = synth_ticketContents13_recip_inverse (); synth_ticketContents13_recip_injective (); LL.clens_synth synth_ticketContents13_recip synth_ticketContents13\n\nlet gaccessor_ticketContents13_ticketContents13' : LL.gaccessor ticketContents13_parser ticketContents13'_parser clens_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.gaccessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\ninline_for_extraction noextract let accessor_ticketContents13_ticketContents13' : LL.accessor gaccessor_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.accessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\nlet gaccessor_ticketContents13_cs = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_cs) clens_ticketContents13_cs ()\n\nlet accessor_ticketContents13_cs = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_cs ()) clens_ticketContents13_cs ()\n\nlet gaccessor_ticketContents13_rms = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_rms) clens_ticketContents13_rms ()\n\nlet accessor_ticketContents13_rms = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_rms ()) clens_ticketContents13_rms ()\n\nlet gaccessor_ticketContents13_nonce = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_nonce) clens_ticketContents13_nonce ()\n\nlet accessor_ticketContents13_nonce = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_nonce ()) clens_ticketContents13_nonce ()\n\nlet gaccessor_ticketContents13_creation_time = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_creation_time) clens_ticketContents13_creation_time ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents13.gaccessor_ticketContents13_creation_time", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.accessor_ext", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13_parser", "LowParse.Spec.Int.parse_u32_kind", "FStar.UInt32.t", "LowParse.Spec.Int.parse_u32", "LowParse.Low.Base.Spec.clens_compose", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.clens_ticketContents13_ticketContents13'", "FStar.Pervasives.Native.tuple2", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.gaccessor_ticketContents13_ticketContents13'", "Parsers.TicketContents13.gaccessor'_ticketContents13_creation_time", "LowParse.Low.Base.accessor_compose", "Parsers.TicketContents13.accessor_ticketContents13_ticketContents13'", "Parsers.TicketContents13.accessor'_ticketContents13_creation_time", "Parsers.TicketContents13.clens_ticketContents13_creation_time" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor_ticketContents13_creation_time : LL.accessor gaccessor_ticketContents13_creation_time\nlet accessor_ticketContents13_creation_time =", "completed_definiton": "LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13'\n accessor'_ticketContents13_creation_time\n ())\n clens_ticketContents13_creation_time\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.accessor_ticketContents13_nonce", "original_source_type": "val accessor_ticketContents13_nonce : LL.accessor gaccessor_ticketContents13_nonce", "source_type": "val accessor_ticketContents13_nonce : LL.accessor gaccessor_ticketContents13_nonce", "source_definition": "let accessor_ticketContents13_nonce = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_nonce ()) clens_ticketContents13_nonce ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 175, "start_col": 38, "end_line": 175, "end_col": 187 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()\n\nlet ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))\n\nlet gaccessor'_ticketContents13_cs : LL.gaccessor ticketContents13'_parser cipherSuite_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_rms : LL.gaccessor ticketContents13'_parser ticketContents13_rms_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_nonce : LL.gaccessor ticketContents13'_parser ticketContents13_nonce_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_creation_time : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_age_add : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\nlet gaccessor'_ticketContents13_custom_data : LL.gaccessor ticketContents13'_parser ticketContents13_custom_data_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_cs : LL.accessor gaccessor'_ticketContents13_cs = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_rms : LL.accessor gaccessor'_ticketContents13_rms = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))) cipherSuite_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_nonce : LL.accessor gaccessor'_ticketContents13_nonce = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_creation_time : LL.accessor gaccessor'_ticketContents13_creation_time = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)) ticketContents13_nonce_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_age_add : LL.accessor gaccessor'_ticketContents13_age_add = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_custom_data : LL.accessor gaccessor'_ticketContents13_custom_data = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))) LL.jump_u32)\n\nnoextract let clens_ticketContents13_ticketContents13' : LL.clens ticketContents13 ticketContents13' = synth_ticketContents13_recip_inverse (); synth_ticketContents13_recip_injective (); LL.clens_synth synth_ticketContents13_recip synth_ticketContents13\n\nlet gaccessor_ticketContents13_ticketContents13' : LL.gaccessor ticketContents13_parser ticketContents13'_parser clens_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.gaccessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\ninline_for_extraction noextract let accessor_ticketContents13_ticketContents13' : LL.accessor gaccessor_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.accessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\nlet gaccessor_ticketContents13_cs = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_cs) clens_ticketContents13_cs ()\n\nlet accessor_ticketContents13_cs = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_cs ()) clens_ticketContents13_cs ()\n\nlet gaccessor_ticketContents13_rms = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_rms) clens_ticketContents13_rms ()\n\nlet accessor_ticketContents13_rms = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_rms ()) clens_ticketContents13_rms ()\n\nlet gaccessor_ticketContents13_nonce = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_nonce) clens_ticketContents13_nonce ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.accessor Parsers.TicketContents13.gaccessor_ticketContents13_nonce", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.accessor_ext", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13_parser", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.clens_ticketContents13_ticketContents13'", "FStar.Pervasives.Native.tuple2", "FStar.UInt32.t", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.gaccessor_ticketContents13_ticketContents13'", "Parsers.TicketContents13.gaccessor'_ticketContents13_nonce", "LowParse.Low.Base.accessor_compose", "Parsers.TicketContents13.accessor_ticketContents13_ticketContents13'", "Parsers.TicketContents13.accessor'_ticketContents13_nonce", "Parsers.TicketContents13.clens_ticketContents13_nonce" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val accessor_ticketContents13_nonce : LL.accessor gaccessor_ticketContents13_nonce\nlet accessor_ticketContents13_nonce =", "completed_definiton": "LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13'\n accessor'_ticketContents13_nonce\n ())\n clens_ticketContents13_nonce\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.gaccessor_ticketContents13_rms", "original_source_type": "val gaccessor_ticketContents13_rms : LL.gaccessor ticketContents13_parser ticketContents13_rms_parser clens_ticketContents13_rms", "source_type": "val gaccessor_ticketContents13_rms : LL.gaccessor ticketContents13_parser ticketContents13_rms_parser clens_ticketContents13_rms", "source_definition": "let gaccessor_ticketContents13_rms = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_rms) clens_ticketContents13_rms ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 169, "start_col": 37, "end_line": 169, "end_col": 185 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()\n\nlet ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))\n\nlet gaccessor'_ticketContents13_cs : LL.gaccessor ticketContents13'_parser cipherSuite_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_rms : LL.gaccessor ticketContents13'_parser ticketContents13_rms_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_nonce : LL.gaccessor ticketContents13'_parser ticketContents13_nonce_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_creation_time : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_age_add : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\nlet gaccessor'_ticketContents13_custom_data : LL.gaccessor ticketContents13'_parser ticketContents13_custom_data_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_cs : LL.accessor gaccessor'_ticketContents13_cs = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_rms : LL.accessor gaccessor'_ticketContents13_rms = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))) cipherSuite_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_nonce : LL.accessor gaccessor'_ticketContents13_nonce = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_creation_time : LL.accessor gaccessor'_ticketContents13_creation_time = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)) ticketContents13_nonce_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_age_add : LL.accessor gaccessor'_ticketContents13_age_add = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_custom_data : LL.accessor gaccessor'_ticketContents13_custom_data = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))) LL.jump_u32)\n\nnoextract let clens_ticketContents13_ticketContents13' : LL.clens ticketContents13 ticketContents13' = synth_ticketContents13_recip_inverse (); synth_ticketContents13_recip_injective (); LL.clens_synth synth_ticketContents13_recip synth_ticketContents13\n\nlet gaccessor_ticketContents13_ticketContents13' : LL.gaccessor ticketContents13_parser ticketContents13'_parser clens_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.gaccessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\ninline_for_extraction noextract let accessor_ticketContents13_ticketContents13' : LL.accessor gaccessor_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.accessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\nlet gaccessor_ticketContents13_cs = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_cs) clens_ticketContents13_cs ()\n\nlet accessor_ticketContents13_cs = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_cs ()) clens_ticketContents13_cs ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.Spec.gaccessor Parsers.TicketContents13.ticketContents13_parser\n Parsers.TicketContents13_rms.ticketContents13_rms_parser\n Parsers.TicketContents13.clens_ticketContents13_rms", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.Spec.gaccessor_ext", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13_parser", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_rms.ticketContents13_rms_parser", "LowParse.Low.Base.Spec.clens_compose", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.clens_ticketContents13_ticketContents13'", "FStar.Pervasives.Native.tuple2", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "FStar.UInt32.t", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "LowParse.Low.Base.Spec.clens_id", "LowParse.Low.Combinators.clens_fst", "LowParse.Low.Combinators.clens_snd", "LowParse.Low.Base.Spec.gaccessor_compose", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.gaccessor_ticketContents13_ticketContents13'", "Parsers.TicketContents13.gaccessor'_ticketContents13_rms", "Parsers.TicketContents13.clens_ticketContents13_rms" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val gaccessor_ticketContents13_rms : LL.gaccessor ticketContents13_parser ticketContents13_rms_parser clens_ticketContents13_rms\nlet gaccessor_ticketContents13_rms =", "completed_definiton": "LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13'\n `LL.gaccessor_compose`\n gaccessor'_ticketContents13_rms)\n clens_ticketContents13_rms\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.ticketContents13_valid", "original_source_type": "val ticketContents13_valid (h:HS.mem) (#rrel: _) (#rel: _) (input:LL.slice rrel rel) (pos0:U32.t) : Lemma\n (requires (\n LL.valid cipherSuite_parser h input pos0 /\\ (\n let pos1 = LL.get_valid_pos cipherSuite_parser h input pos0 in\n LL.valid ticketContents13_rms_parser h input pos1 /\\ (\n let pos2 = LL.get_valid_pos ticketContents13_rms_parser h input pos1 in\n LL.valid ticketContents13_nonce_parser h input pos2 /\\ (\n let pos3 = LL.get_valid_pos ticketContents13_nonce_parser h input pos2 in\n LL.valid LPI.parse_u32 h input pos3 /\\ (\n let pos4 = LL.get_valid_pos LPI.parse_u32 h input pos3 in\n LL.valid LPI.parse_u32 h input pos4 /\\ (\n let pos5 = LL.get_valid_pos LPI.parse_u32 h input pos4 in\n LL.valid ticketContents13_custom_data_parser h input pos5 /\\ (\n let pos6 = LL.get_valid_pos ticketContents13_custom_data_parser h input pos5 in\n True\n ))))))))\n (ensures (\n let cs = LL.contents cipherSuite_parser h input pos0 in\n let pos1 = LL.get_valid_pos cipherSuite_parser h input pos0 in\n let rms = LL.contents ticketContents13_rms_parser h input pos1 in\n let pos2 = LL.get_valid_pos ticketContents13_rms_parser h input pos1 in\n let nonce = LL.contents ticketContents13_nonce_parser h input pos2 in\n let pos3 = LL.get_valid_pos ticketContents13_nonce_parser h input pos2 in\n let creation_time = LL.contents LPI.parse_u32 h input pos3 in\n let pos4 = LL.get_valid_pos LPI.parse_u32 h input pos3 in\n let age_add = LL.contents LPI.parse_u32 h input pos4 in\n let pos5 = LL.get_valid_pos LPI.parse_u32 h input pos4 in\n let custom_data = LL.contents ticketContents13_custom_data_parser h input pos5 in\n let pos6 = LL.get_valid_pos ticketContents13_custom_data_parser h input pos5 in\n LL.valid_content_pos ticketContents13_parser h input pos0 ({\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }) pos6))", "source_type": "val ticketContents13_valid (h:HS.mem) (#rrel: _) (#rel: _) (input:LL.slice rrel rel) (pos0:U32.t) : Lemma\n (requires (\n LL.valid cipherSuite_parser h input pos0 /\\ (\n let pos1 = LL.get_valid_pos cipherSuite_parser h input pos0 in\n LL.valid ticketContents13_rms_parser h input pos1 /\\ (\n let pos2 = LL.get_valid_pos ticketContents13_rms_parser h input pos1 in\n LL.valid ticketContents13_nonce_parser h input pos2 /\\ (\n let pos3 = LL.get_valid_pos ticketContents13_nonce_parser h input pos2 in\n LL.valid LPI.parse_u32 h input pos3 /\\ (\n let pos4 = LL.get_valid_pos LPI.parse_u32 h input pos3 in\n LL.valid LPI.parse_u32 h input pos4 /\\ (\n let pos5 = LL.get_valid_pos LPI.parse_u32 h input pos4 in\n LL.valid ticketContents13_custom_data_parser h input pos5 /\\ (\n let pos6 = LL.get_valid_pos ticketContents13_custom_data_parser h input pos5 in\n True\n ))))))))\n (ensures (\n let cs = LL.contents cipherSuite_parser h input pos0 in\n let pos1 = LL.get_valid_pos cipherSuite_parser h input pos0 in\n let rms = LL.contents ticketContents13_rms_parser h input pos1 in\n let pos2 = LL.get_valid_pos ticketContents13_rms_parser h input pos1 in\n let nonce = LL.contents ticketContents13_nonce_parser h input pos2 in\n let pos3 = LL.get_valid_pos ticketContents13_nonce_parser h input pos2 in\n let creation_time = LL.contents LPI.parse_u32 h input pos3 in\n let pos4 = LL.get_valid_pos LPI.parse_u32 h input pos3 in\n let age_add = LL.contents LPI.parse_u32 h input pos4 in\n let pos5 = LL.get_valid_pos LPI.parse_u32 h input pos4 in\n let custom_data = LL.contents ticketContents13_custom_data_parser h input pos5 in\n let pos6 = LL.get_valid_pos ticketContents13_custom_data_parser h input pos5 in\n LL.valid_content_pos ticketContents13_parser h input pos0 ({\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }) pos6))", "source_definition": "let ticketContents13_valid h #_ #_ input pos0 =\n let cs = LL.contents cipherSuite_parser h input pos0 in\n let pos1 = LL.get_valid_pos cipherSuite_parser h input pos0 in\n let rms = LL.contents ticketContents13_rms_parser h input pos1 in\n let pos2 = LL.get_valid_pos ticketContents13_rms_parser h input pos1 in\n let nonce = LL.contents ticketContents13_nonce_parser h input pos2 in\n let pos3 = LL.get_valid_pos ticketContents13_nonce_parser h input pos2 in\n let creation_time = LL.contents LPI.parse_u32 h input pos3 in\n let pos4 = LL.get_valid_pos LPI.parse_u32 h input pos3 in\n let age_add = LL.contents LPI.parse_u32 h input pos4 in\n let pos5 = LL.get_valid_pos LPI.parse_u32 h input pos4 in\n let custom_data = LL.contents ticketContents13_custom_data_parser h input pos5 in\n let pos6 = LL.get_valid_pos ticketContents13_custom_data_parser h input pos5 in\n LL.valid_nondep_then_intro h cipherSuite_parser ticketContents13_rms_parser input pos0;\n LL.valid_nondep_then_intro h ticketContents13_nonce_parser LPI.parse_u32 input pos2;\n LL.valid_nondep_then_intro h (cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32) input pos0;\n LL.valid_nondep_then_intro h LPI.parse_u32 ticketContents13_custom_data_parser input pos4;\n LL.valid_nondep_then_intro h ((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser) input pos0;\n assert_norm (ticketContents13' == LP.get_parser_type ticketContents13'_parser);\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n synth_ticketContents13_injective ();\n LL.valid_synth_intro h ticketContents13'_parser synth_ticketContents13 input pos0", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 189, "start_col": 47, "end_line": 210, "end_col": 83 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))\n\nlet ticketContents13_size32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LSZ.size32_synth _ synth_ticketContents13 _ ticketContents13'_size32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()\n\ninline_for_extraction let ticketContents13'_validator : LL.validator ticketContents13'_parser = (((cipherSuite_validator `LL.validate_nondep_then` ticketContents13_rms_validator) `LL.validate_nondep_then` (ticketContents13_nonce_validator `LL.validate_nondep_then` (LL.validate_u32 ()))) `LL.validate_nondep_then` ((LL.validate_u32 ()) `LL.validate_nondep_then` ticketContents13_custom_data_validator))\n\nlet ticketContents13_validator =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.validate_synth ticketContents13'_validator synth_ticketContents13 ()\n\ninline_for_extraction let ticketContents13'_jumper : LL.jumper ticketContents13'_parser = (((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32)) `LL.jump_nondep_then` (LL.jump_u32 `LL.jump_nondep_then` ticketContents13_custom_data_jumper))\n\nlet ticketContents13_jumper =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LL.jump_synth ticketContents13'_jumper synth_ticketContents13 ()\n\nlet ticketContents13_bytesize_eqn x =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth_eq _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip () x;\nLP.length_serialize_nondep_then cipherSuite_serializer ticketContents13_rms_serializer x.cs x.rms;\nLP.length_serialize_nondep_then ticketContents13_nonce_serializer LPI.serialize_u32 x.nonce x.creation_time;\nLP.length_serialize_nondep_then (cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32) (x.cs, x.rms) (x.nonce, x.creation_time);\nLP.length_serialize_nondep_then LPI.serialize_u32 ticketContents13_custom_data_serializer x.age_add x.custom_data;\nLP.length_serialize_nondep_then ((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer) ((x.cs, x.rms), (x.nonce, x.creation_time)) (x.age_add, x.custom_data);\n (cipherSuite_bytesize_eq (x.cs));\n (ticketContents13_rms_bytesize_eq (x.rms));\n (ticketContents13_nonce_bytesize_eq (x.nonce));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.creation_time)) == 4));\n (assert (FStar.Seq.length (LP.serialize LP.serialize_u32 (x.age_add)) == 4));\n (ticketContents13_custom_data_bytesize_eq (x.custom_data));\n assert(ticketContents13_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x.cs) + Seq.length (LP.serialize ticketContents13_rms_serializer x.rms) + Seq.length (LP.serialize ticketContents13_nonce_serializer x.nonce) + Seq.length (LP.serialize LPI.serialize_u32 x.creation_time) + Seq.length (LP.serialize LPI.serialize_u32 x.age_add) + Seq.length (LP.serialize ticketContents13_custom_data_serializer x.custom_data))\n\nlet gaccessor'_ticketContents13_cs : LL.gaccessor ticketContents13'_parser cipherSuite_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_rms : LL.gaccessor ticketContents13'_parser ticketContents13_rms_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_nonce : LL.gaccessor ticketContents13'_parser ticketContents13_nonce_parser _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_creation_time : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_then_fst (LL.gaccessor_id ticketContents13'_parser))))\n\nlet gaccessor'_ticketContents13_age_add : LL.gaccessor ticketContents13'_parser LPI.parse_u32 _ = (LL.gaccessor_then_fst (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\nlet gaccessor'_ticketContents13_custom_data : LL.gaccessor ticketContents13'_parser ticketContents13_custom_data_parser _ = (LL.gaccessor_then_snd (LL.gaccessor_then_snd (LL.gaccessor_id ticketContents13'_parser)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_cs : LL.accessor gaccessor'_ticketContents13_cs = (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_rms : LL.accessor gaccessor'_ticketContents13_rms = (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser))) cipherSuite_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_nonce : LL.accessor gaccessor'_ticketContents13_nonce = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)))\n\ninline_for_extraction noextract let accessor'_ticketContents13_creation_time : LL.accessor gaccessor'_ticketContents13_creation_time = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_then_fst (LL.accessor_id ticketContents13'_parser)) (cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper)) ticketContents13_nonce_jumper)\n\ninline_for_extraction noextract let accessor'_ticketContents13_age_add : LL.accessor gaccessor'_ticketContents13_age_add = (LL.accessor_then_fst (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))))\n\ninline_for_extraction noextract let accessor'_ticketContents13_custom_data : LL.accessor gaccessor'_ticketContents13_custom_data = (LL.accessor_then_snd (LL.accessor_then_snd (LL.accessor_id ticketContents13'_parser) ((cipherSuite_jumper `LL.jump_nondep_then` ticketContents13_rms_jumper) `LL.jump_nondep_then` (ticketContents13_nonce_jumper `LL.jump_nondep_then` LL.jump_u32))) LL.jump_u32)\n\nnoextract let clens_ticketContents13_ticketContents13' : LL.clens ticketContents13 ticketContents13' = synth_ticketContents13_recip_inverse (); synth_ticketContents13_recip_injective (); LL.clens_synth synth_ticketContents13_recip synth_ticketContents13\n\nlet gaccessor_ticketContents13_ticketContents13' : LL.gaccessor ticketContents13_parser ticketContents13'_parser clens_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.gaccessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\ninline_for_extraction noextract let accessor_ticketContents13_ticketContents13' : LL.accessor gaccessor_ticketContents13_ticketContents13' = synth_ticketContents13_inverse (); synth_ticketContents13_injective (); synth_ticketContents13_recip_inverse (); LL.accessor_synth ticketContents13'_parser synth_ticketContents13 synth_ticketContents13_recip ()\n\nlet gaccessor_ticketContents13_cs = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_cs) clens_ticketContents13_cs ()\n\nlet accessor_ticketContents13_cs = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_cs ()) clens_ticketContents13_cs ()\n\nlet gaccessor_ticketContents13_rms = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_rms) clens_ticketContents13_rms ()\n\nlet accessor_ticketContents13_rms = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_rms ()) clens_ticketContents13_rms ()\n\nlet gaccessor_ticketContents13_nonce = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_nonce) clens_ticketContents13_nonce ()\n\nlet accessor_ticketContents13_nonce = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_nonce ()) clens_ticketContents13_nonce ()\n\nlet gaccessor_ticketContents13_creation_time = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_creation_time) clens_ticketContents13_creation_time ()\n\nlet accessor_ticketContents13_creation_time = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_creation_time ()) clens_ticketContents13_creation_time ()\n\nlet gaccessor_ticketContents13_age_add = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_age_add) clens_ticketContents13_age_add ()\n\nlet accessor_ticketContents13_age_add = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_age_add ()) clens_ticketContents13_age_add ()\n\nlet gaccessor_ticketContents13_custom_data = LL.gaccessor_ext (gaccessor_ticketContents13_ticketContents13' `LL.gaccessor_compose` gaccessor'_ticketContents13_custom_data) clens_ticketContents13_custom_data ()\n\nlet accessor_ticketContents13_custom_data = LL.accessor_ext (LL.accessor_compose accessor_ticketContents13_ticketContents13' accessor'_ticketContents13_custom_data ()) clens_ticketContents13_custom_data ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: FStar.Monotonic.HyperStack.mem -> input: LowParse.Slice.slice rrel rel -> pos0: FStar.UInt32.t\n -> FStar.Pervasives.Lemma\n (requires\n LowParse.Low.Base.Spec.valid Parsers.CipherSuite.cipherSuite_parser h input pos0 /\\\n (let pos1 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.CipherSuite.cipherSuite_parser h input pos0\n in\n LowParse.Low.Base.Spec.valid Parsers.TicketContents13_rms.ticketContents13_rms_parser\n h\n input\n pos1 /\\\n (let pos2 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.TicketContents13_rms.ticketContents13_rms_parser\n h\n input\n pos1\n in\n LowParse.Low.Base.Spec.valid Parsers.TicketContents13_nonce.ticketContents13_nonce_parser\n h\n input\n pos2 /\\\n (let pos3 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.TicketContents13_nonce.ticketContents13_nonce_parser\n h\n input\n pos2\n in\n LowParse.Low.Base.Spec.valid LowParse.Spec.Int.parse_u32 h input pos3 /\\\n (let pos4 =\n LowParse.Low.Base.Spec.get_valid_pos LowParse.Spec.Int.parse_u32 h input pos3\n in\n LowParse.Low.Base.Spec.valid LowParse.Spec.Int.parse_u32 h input pos4 /\\\n (let pos5 =\n LowParse.Low.Base.Spec.get_valid_pos LowParse.Spec.Int.parse_u32 h input pos4\n in\n LowParse.Low.Base.Spec.valid Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser\n h\n input\n pos5 /\\\n (let pos6 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser\n h\n input\n pos5\n in\n Prims.l_True)))))))\n (ensures\n (let cs =\n LowParse.Low.Base.Spec.contents Parsers.CipherSuite.cipherSuite_parser h input pos0\n in\n let pos1 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.CipherSuite.cipherSuite_parser h input pos0\n in\n let rms =\n LowParse.Low.Base.Spec.contents Parsers.TicketContents13_rms.ticketContents13_rms_parser\n h\n input\n pos1\n in\n let pos2 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.TicketContents13_rms.ticketContents13_rms_parser\n h\n input\n pos1\n in\n let nonce =\n LowParse.Low.Base.Spec.contents Parsers.TicketContents13_nonce.ticketContents13_nonce_parser\n h\n input\n pos2\n in\n let pos3 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.TicketContents13_nonce.ticketContents13_nonce_parser\n h\n input\n pos2\n in\n let creation_time =\n LowParse.Low.Base.Spec.contents LowParse.Spec.Int.parse_u32 h input pos3\n in\n let pos4 =\n LowParse.Low.Base.Spec.get_valid_pos LowParse.Spec.Int.parse_u32 h input pos3\n in\n let age_add = LowParse.Low.Base.Spec.contents LowParse.Spec.Int.parse_u32 h input pos4 in\n let pos5 =\n LowParse.Low.Base.Spec.get_valid_pos LowParse.Spec.Int.parse_u32 h input pos4\n in\n let custom_data =\n LowParse.Low.Base.Spec.contents Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser\n h\n input\n pos5\n in\n let pos6 =\n LowParse.Low.Base.Spec.get_valid_pos Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser\n h\n input\n pos5\n in\n LowParse.Low.Base.Spec.valid_content_pos Parsers.TicketContents13.ticketContents13_parser\n h\n input\n pos0\n (Parsers.TicketContents13.MkticketContents13 cs\n rms\n nonce\n creation_time\n age_add\n custom_data)\n pos6))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Monotonic.HyperStack.mem", "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "LowParse.Low.Combinators.valid_synth_intro", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13.ticketContents13'", "Parsers.TicketContents13.ticketContents13", "Parsers.TicketContents13.ticketContents13'_parser", "Parsers.TicketContents13.synth_ticketContents13", "Prims.unit", "Parsers.TicketContents13.synth_ticketContents13_injective", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "Parsers.TicketContents13.ticketContents13_parser_kind", "Parsers.TicketContents13.ticketContents13'_parser_kind", "LowParse.Spec.Base.get_parser_type", "LowParse.Low.Combinators.valid_nondep_then_intro", "FStar.Pervasives.Native.tuple2", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "LowParse.Spec.Combinators.nondep_then", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.TicketContents13_rms.ticketContents13_rms_parser", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser", "LowParse.Spec.Int.parse_u32", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser", "LowParse.Low.Base.Spec.get_valid_pos", "LowParse.Low.Base.Spec.contents" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13_valid (h:HS.mem) (#rrel: _) (#rel: _) (input:LL.slice rrel rel) (pos0:U32.t) : Lemma\n (requires (\n LL.valid cipherSuite_parser h input pos0 /\\ (\n let pos1 = LL.get_valid_pos cipherSuite_parser h input pos0 in\n LL.valid ticketContents13_rms_parser h input pos1 /\\ (\n let pos2 = LL.get_valid_pos ticketContents13_rms_parser h input pos1 in\n LL.valid ticketContents13_nonce_parser h input pos2 /\\ (\n let pos3 = LL.get_valid_pos ticketContents13_nonce_parser h input pos2 in\n LL.valid LPI.parse_u32 h input pos3 /\\ (\n let pos4 = LL.get_valid_pos LPI.parse_u32 h input pos3 in\n LL.valid LPI.parse_u32 h input pos4 /\\ (\n let pos5 = LL.get_valid_pos LPI.parse_u32 h input pos4 in\n LL.valid ticketContents13_custom_data_parser h input pos5 /\\ (\n let pos6 = LL.get_valid_pos ticketContents13_custom_data_parser h input pos5 in\n True\n ))))))))\n (ensures (\n let cs = LL.contents cipherSuite_parser h input pos0 in\n let pos1 = LL.get_valid_pos cipherSuite_parser h input pos0 in\n let rms = LL.contents ticketContents13_rms_parser h input pos1 in\n let pos2 = LL.get_valid_pos ticketContents13_rms_parser h input pos1 in\n let nonce = LL.contents ticketContents13_nonce_parser h input pos2 in\n let pos3 = LL.get_valid_pos ticketContents13_nonce_parser h input pos2 in\n let creation_time = LL.contents LPI.parse_u32 h input pos3 in\n let pos4 = LL.get_valid_pos LPI.parse_u32 h input pos3 in\n let age_add = LL.contents LPI.parse_u32 h input pos4 in\n let pos5 = LL.get_valid_pos LPI.parse_u32 h input pos4 in\n let custom_data = LL.contents ticketContents13_custom_data_parser h input pos5 in\n let pos6 = LL.get_valid_pos ticketContents13_custom_data_parser h input pos5 in\n LL.valid_content_pos ticketContents13_parser h input pos0 ({\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }) pos6))\nlet ticketContents13_valid h #_ #_ input pos0 =", "completed_definiton": "let cs = LL.contents cipherSuite_parser h input pos0 in\nlet pos1 = LL.get_valid_pos cipherSuite_parser h input pos0 in\nlet rms = LL.contents ticketContents13_rms_parser h input pos1 in\nlet pos2 = LL.get_valid_pos ticketContents13_rms_parser h input pos1 in\nlet nonce = LL.contents ticketContents13_nonce_parser h input pos2 in\nlet pos3 = LL.get_valid_pos ticketContents13_nonce_parser h input pos2 in\nlet creation_time = LL.contents LPI.parse_u32 h input pos3 in\nlet pos4 = LL.get_valid_pos LPI.parse_u32 h input pos3 in\nlet age_add = LL.contents LPI.parse_u32 h input pos4 in\nlet pos5 = LL.get_valid_pos LPI.parse_u32 h input pos4 in\nlet custom_data = LL.contents ticketContents13_custom_data_parser h input pos5 in\nlet pos6 = LL.get_valid_pos ticketContents13_custom_data_parser h input pos5 in\nLL.valid_nondep_then_intro h cipherSuite_parser ticketContents13_rms_parser input pos0;\nLL.valid_nondep_then_intro h ticketContents13_nonce_parser LPI.parse_u32 input pos2;\nLL.valid_nondep_then_intro h\n (cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser)\n (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)\n input\n pos0;\nLL.valid_nondep_then_intro h LPI.parse_u32 ticketContents13_custom_data_parser input pos4;\nLL.valid_nondep_then_intro h\n ((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser)\n `LP.nondep_then`\n (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32))\n (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser)\n input\n pos0;\nassert_norm (ticketContents13' == LP.get_parser_type ticketContents13'_parser);\nassert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\nsynth_ticketContents13_injective ();\nLL.valid_synth_intro h ticketContents13'_parser synth_ticketContents13 input pos0", "isa_cross_project_example": true }, { "file_name": "Parsers.TicketContents13.fst", "name": "Parsers.TicketContents13.ticketContents13'_size32", "original_source_type": "val ticketContents13'_size32:LSZ.size32 ticketContents13'_serializer", "source_type": "val ticketContents13'_size32:LSZ.size32 ticketContents13'_serializer", "source_definition": "let ticketContents13'_size32 : LSZ.size32 ticketContents13'_serializer = (((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32) `LSZ.size32_nondep_then` (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32)) `LSZ.size32_nondep_then` (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.TicketContents13.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 95, "start_col": 95, "end_line": 95, "end_col": 372 }, "file_context": "module Parsers.TicketContents13\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n(* Type of field rms*)\nopen Parsers.TicketContents13_rms\n\n(* Type of field nonce*)\nopen Parsers.TicketContents13_nonce\n\n(* Type of field custom_data*)\nopen Parsers.TicketContents13_custom_data\n\ntype ticketContents13' = (((cipherSuite & ticketContents13_rms) & (ticketContents13_nonce & U32.t)) & (U32.t & ticketContents13_custom_data))\n\ninline_for_extraction let synth_ticketContents13 (x: ticketContents13') : ticketContents13 =\n match x with (((cs,rms),(nonce,creation_time)),(age_add,custom_data)) -> {\n cs = cs;\n rms = rms;\n nonce = nonce;\n creation_time = creation_time;\n age_add = age_add;\n custom_data = custom_data;\n }\n\ninline_for_extraction let synth_ticketContents13_recip (x: ticketContents13) : ticketContents13' = (((x.cs,x.rms),(x.nonce,x.creation_time)),(x.age_add,x.custom_data))\n\nlet synth_ticketContents13_recip_inverse () : Lemma (LP.synth_inverse synth_ticketContents13_recip synth_ticketContents13) = ()\n\nlet synth_ticketContents13_injective () : Lemma (LP.synth_injective synth_ticketContents13) =\n LP.synth_inverse_synth_injective synth_ticketContents13_recip synth_ticketContents13;\n synth_ticketContents13_recip_inverse ()\n\nlet synth_ticketContents13_inverse () : Lemma (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip) =\n assert_norm (LP.synth_inverse synth_ticketContents13 synth_ticketContents13_recip)\n\nlet synth_ticketContents13_recip_injective () : Lemma (LP.synth_injective synth_ticketContents13_recip) =\n synth_ticketContents13_recip_inverse ();\n LP.synth_inverse_synth_injective synth_ticketContents13 synth_ticketContents13_recip\n\nnoextract let ticketContents13'_parser : LP.parser _ ticketContents13' = (((cipherSuite_parser `LP.nondep_then` ticketContents13_rms_parser) `LP.nondep_then` (ticketContents13_nonce_parser `LP.nondep_then` LPI.parse_u32)) `LP.nondep_then` (LPI.parse_u32 `LP.nondep_then` ticketContents13_custom_data_parser))\n\nnoextract let ticketContents13'_parser_kind = LP.get_parser_kind ticketContents13'_parser\n\nlet ticketContents13_parser =\n synth_ticketContents13_injective ();\n assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind);\n ticketContents13'_parser `LP.parse_synth` synth_ticketContents13\n\nnoextract let ticketContents13'_serializer : LP.serializer ticketContents13'_parser = (((cipherSuite_serializer `LP.serialize_nondep_then` ticketContents13_rms_serializer) `LP.serialize_nondep_then` (ticketContents13_nonce_serializer `LP.serialize_nondep_then` LPI.serialize_u32)) `LP.serialize_nondep_then` (LPI.serialize_u32 `LP.serialize_nondep_then` ticketContents13_custom_data_serializer))\n\nlet ticketContents13_serializer =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LP.serialize_synth _ synth_ticketContents13 ticketContents13'_serializer synth_ticketContents13_recip ()\n\nlet ticketContents13_bytesize (x:ticketContents13) : GTot nat = Seq.length (ticketContents13_serializer x)\n\nlet ticketContents13_bytesize_eq x = ()\n\ninline_for_extraction let ticketContents13'_parser32 : LS.parser32 ticketContents13'_parser = (((cipherSuite_parser32 `LS.parse32_nondep_then` ticketContents13_rms_parser32) `LS.parse32_nondep_then` (ticketContents13_nonce_parser32 `LS.parse32_nondep_then` LS.parse32_u32)) `LS.parse32_nondep_then` (LS.parse32_u32 `LS.parse32_nondep_then` ticketContents13_custom_data_parser32))\n\nlet ticketContents13_parser32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.parse32_synth _ synth_ticketContents13 (fun x -> synth_ticketContents13 x) ticketContents13'_parser32 ()\n\ninline_for_extraction let ticketContents13'_serializer32 : LS.serializer32 ticketContents13'_serializer = (((cipherSuite_serializer32 `LS.serialize32_nondep_then` ticketContents13_rms_serializer32) `LS.serialize32_nondep_then` (ticketContents13_nonce_serializer32 `LS.serialize32_nondep_then` LS.serialize32_u32)) `LS.serialize32_nondep_then` (LS.serialize32_u32 `LS.serialize32_nondep_then` ticketContents13_custom_data_serializer32))\n\nlet ticketContents13_serializer32 =\n [@inline_let] let _ = synth_ticketContents13_injective () in\n [@inline_let] let _ = synth_ticketContents13_inverse () in\n [@inline_let] let _ = assert_norm (ticketContents13_parser_kind == ticketContents13'_parser_kind) in\n LS.serialize32_synth _ synth_ticketContents13 _ ticketContents13'_serializer32 synth_ticketContents13_recip (fun x -> synth_ticketContents13_recip x) ()", "dependencies": { "source_file": "Parsers.TicketContents13.fst", "checked_file": "Parsers.TicketContents13.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.TicketContents13_rms.fsti.checked", "Parsers.TicketContents13_nonce.fsti.checked", "Parsers.TicketContents13_custom_data.fsti.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_custom_data" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_nonce" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.TicketContents13_rms" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.CipherSuite" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.TicketContents13.ticketContents13'_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.size32_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.TicketContents13_rms.ticketContents13_rms_parser_kind", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser_kind", "LowParse.Spec.Int.parse_u32_kind", "FStar.Pervasives.Native.tuple2", "Parsers.CipherSuite.cipherSuite", "Parsers.TicketContents13_rms.ticketContents13_rms", "Parsers.TicketContents13_nonce.ticketContents13_nonce", "FStar.UInt32.t", "LowParse.Spec.Combinators.nondep_then", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.TicketContents13_rms.ticketContents13_rms_parser", "Parsers.TicketContents13_nonce.ticketContents13_nonce_parser", "LowParse.Spec.Int.parse_u32", "LowParse.Spec.Combinators.serialize_nondep_then", "Parsers.CipherSuite.cipherSuite_serializer", "Parsers.TicketContents13_rms.ticketContents13_rms_serializer", "Parsers.TicketContents13_nonce.ticketContents13_nonce_serializer", "LowParse.Spec.Int.serialize_u32", "Parsers.CipherSuite.cipherSuite_size32", "Parsers.TicketContents13_rms.ticketContents13_rms_size32", "Parsers.TicketContents13_nonce.ticketContents13_nonce_size32", "LowParse.SLow.Int.size32_u32", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser_kind", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_parser", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_serializer", "Parsers.TicketContents13_custom_data.ticketContents13_custom_data_size32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ticketContents13'_size32:LSZ.size32 ticketContents13'_serializer\nlet ticketContents13'_size32:LSZ.size32 ticketContents13'_serializer =", "completed_definiton": "(((cipherSuite_size32 `LSZ.size32_nondep_then` ticketContents13_rms_size32)\n `LSZ.size32_nondep_then`\n (ticketContents13_nonce_size32 `LSZ.size32_nondep_then` LSZ.size32_u32))\n `LSZ.size32_nondep_then`\n (LSZ.size32_u32 `LSZ.size32_nondep_then` ticketContents13_custom_data_size32))", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureSchemeList.fst", "name": "Parsers.SignatureSchemeList.pre", "original_source_type": "val pre:squash (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true)", "source_type": "val pre:squash (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true)", "source_definition": "let pre : squash (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureSchemeList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 23, "start_col": 102, "end_line": 23, "end_col": 131 }, "file_context": "module Parsers.SignatureSchemeList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"", "dependencies": { "source_file": "Parsers.SignatureSchemeList.fst", "checked_file": "Parsers.SignatureSchemeList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.SignatureScheme" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.squash (LowParse.Spec.Array.vldata_vlarray_precond 2\n 65534\n Parsers.SignatureScheme.signatureScheme_parser\n 1\n 32767 ==\n true)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val pre:squash (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true)\nlet pre:squash (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) =", "completed_definiton": "FStar.Tactics.Effect.synth_by_tactic (fun _ -> (FStar.Tactics.trefl ()))", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureSchemeList.fst", "name": "Parsers.SignatureSchemeList.signatureSchemeList_bytesize", "original_source_type": "val signatureSchemeList_bytesize (x:signatureSchemeList) : GTot nat", "source_type": "val signatureSchemeList_bytesize (x:signatureSchemeList) : GTot nat", "source_definition": "let signatureSchemeList_bytesize (x:signatureSchemeList) : GTot nat = Seq.length (signatureSchemeList_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureSchemeList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 31, "start_col": 70, "end_line": 31, "end_col": 115 }, "file_context": "module Parsers.SignatureSchemeList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet signatureSchemeList_parser =\n LP.parse_vlarray 2 65534 signatureScheme_serializer 1 32767 ()\n\nlet signatureSchemeList_serializer =\n LP.serialize_vlarray 2 65534 signatureScheme_serializer 1 32767 ()", "dependencies": { "source_file": "Parsers.SignatureSchemeList.fst", "checked_file": "Parsers.SignatureSchemeList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.SignatureScheme" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.SignatureSchemeList.signatureSchemeList -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.SignatureSchemeList.signatureSchemeList", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.SignatureSchemeList.signatureSchemeList_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureSchemeList_bytesize (x:signatureSchemeList) : GTot nat\nlet signatureSchemeList_bytesize (x: signatureSchemeList) : GTot nat =", "completed_definiton": "Seq.length (signatureSchemeList_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureSchemeList.fst", "name": "Parsers.SignatureSchemeList.signatureSchemeList_serializer32", "original_source_type": "val signatureSchemeList_serializer32: LS.serializer32 signatureSchemeList_serializer", "source_type": "val signatureSchemeList_serializer32: LS.serializer32 signatureSchemeList_serializer", "source_definition": "let signatureSchemeList_serializer32 =\n LS.serialize32_vlarray 2 65534 #_ #_ #_ #signatureScheme_serializer signatureScheme_serializer32 1 32767 ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureSchemeList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 39, "start_col": 2, "end_line": 39, "end_col": 109 }, "file_context": "module Parsers.SignatureSchemeList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet signatureSchemeList_parser =\n LP.parse_vlarray 2 65534 signatureScheme_serializer 1 32767 ()\n\nlet signatureSchemeList_serializer =\n LP.serialize_vlarray 2 65534 signatureScheme_serializer 1 32767 ()\n\nlet signatureSchemeList_bytesize (x:signatureSchemeList) : GTot nat = Seq.length (signatureSchemeList_serializer x)\n\nlet signatureSchemeList_bytesize_eq x = ()\n\nlet signatureSchemeList_parser32 =\n LS.parse32_vlarray 2 2ul 65534 65534ul signatureScheme_serializer signatureScheme_parser32 1 32767 ()", "dependencies": { "source_file": "Parsers.SignatureSchemeList.fst", "checked_file": "Parsers.SignatureSchemeList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.SignatureScheme" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.SignatureSchemeList.signatureSchemeList_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Array.serialize32_vlarray", "Parsers.SignatureScheme.signatureScheme_parser_kind", "Parsers.SignatureScheme.signatureScheme", "Parsers.SignatureScheme.signatureScheme_parser", "Parsers.SignatureScheme.signatureScheme_serializer", "Parsers.SignatureScheme.signatureScheme_serializer32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureSchemeList_serializer32: LS.serializer32 signatureSchemeList_serializer\nlet signatureSchemeList_serializer32 =", "completed_definiton": "LS.serialize32_vlarray 2 65534 #_ #_ #_ #signatureScheme_serializer signatureScheme_serializer32 1\n 32767 ()", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureSchemeList.fst", "name": "Parsers.SignatureSchemeList.signatureSchemeList_parser", "original_source_type": "val signatureSchemeList_parser: LP.parser signatureSchemeList_parser_kind signatureSchemeList", "source_type": "val signatureSchemeList_parser: LP.parser signatureSchemeList_parser_kind signatureSchemeList", "source_definition": "let signatureSchemeList_parser =\n LP.parse_vlarray 2 65534 signatureScheme_serializer 1 32767 ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureSchemeList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 26, "start_col": 2, "end_line": 26, "end_col": 64 }, "file_context": "module Parsers.SignatureSchemeList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())", "dependencies": { "source_file": "Parsers.SignatureSchemeList.fst", "checked_file": "Parsers.SignatureSchemeList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.SignatureScheme" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.SignatureSchemeList.signatureSchemeList_parser_kind\n Parsers.SignatureSchemeList.signatureSchemeList", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Array.parse_vlarray", "Parsers.SignatureScheme.signatureScheme_parser_kind", "Parsers.SignatureScheme.signatureScheme", "Parsers.SignatureScheme.signatureScheme_parser", "Parsers.SignatureScheme.signatureScheme_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureSchemeList_parser: LP.parser signatureSchemeList_parser_kind signatureSchemeList\nlet signatureSchemeList_parser =", "completed_definiton": "LP.parse_vlarray 2 65534 signatureScheme_serializer 1 32767 ()", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureSchemeList.fst", "name": "Parsers.SignatureSchemeList.signatureSchemeList_nth_ghost", "original_source_type": "val signatureSchemeList_nth_ghost (i: nat) : Tot (LL.gaccessor signatureSchemeList_parser signatureScheme_parser (signatureSchemeList_clens_nth i))", "source_type": "val signatureSchemeList_nth_ghost (i: nat) : Tot (LL.gaccessor signatureSchemeList_parser signatureScheme_parser (signatureSchemeList_clens_nth i))", "source_definition": "let signatureSchemeList_nth_ghost i = LL.vlarray_nth_ghost 2 65534 signatureScheme_serializer 1 32767 i", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureSchemeList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 58, "start_col": 38, "end_line": 58, "end_col": 103 }, "file_context": "module Parsers.SignatureSchemeList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet signatureSchemeList_parser =\n LP.parse_vlarray 2 65534 signatureScheme_serializer 1 32767 ()\n\nlet signatureSchemeList_serializer =\n LP.serialize_vlarray 2 65534 signatureScheme_serializer 1 32767 ()\n\nlet signatureSchemeList_bytesize (x:signatureSchemeList) : GTot nat = Seq.length (signatureSchemeList_serializer x)\n\nlet signatureSchemeList_bytesize_eq x = ()\n\nlet signatureSchemeList_parser32 =\n LS.parse32_vlarray 2 2ul 65534 65534ul signatureScheme_serializer signatureScheme_parser32 1 32767 ()\n\nlet signatureSchemeList_serializer32 =\n LS.serialize32_vlarray 2 65534 #_ #_ #_ #signatureScheme_serializer signatureScheme_serializer32 1 32767 ()\n\nlet signatureSchemeList_size32 =\n [@inline_let] let _ = assert_norm (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) in\n LSZ.size32_vlarray 2 65534 signatureScheme_serializer 1 32767 () 2ul 2ul\n\nlet signatureSchemeList_validator =\n LL.validate_vlarray 2 65534 signatureScheme_serializer signatureScheme_validator 1 32767 () 2ul\n\nlet signatureSchemeList_jumper =\n LL.jump_vlarray 2 65534 signatureScheme_serializer 1 32767 () 2ul\n\nlet _ : squash (signatureSchemeList == LL.vlarray signatureScheme 1 32767) = _ by (FStar.Tactics.trefl ())\n\nlet finalize_signatureSchemeList #_ #_ sl pos pos' =\n LL.finalize_vlarray 2 65534 signatureScheme_serializer 1 32767 sl pos pos'\n\nlet signatureSchemeList_count #_ #_ input pos = LL.vlarray_list_length 2 65534 signatureScheme_serializer 1 32767 input pos", "dependencies": { "source_file": "Parsers.SignatureSchemeList.fst", "checked_file": "Parsers.SignatureSchemeList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.SignatureScheme" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: Prims.nat\n -> LowParse.Low.Base.Spec.gaccessor Parsers.SignatureSchemeList.signatureSchemeList_parser\n Parsers.SignatureScheme.signatureScheme_parser\n (Parsers.SignatureSchemeList.signatureSchemeList_clens_nth i)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "LowParse.Low.Array.vlarray_nth_ghost", "Parsers.SignatureScheme.signatureScheme_parser_kind", "Parsers.SignatureScheme.signatureScheme", "Parsers.SignatureScheme.signatureScheme_parser", "Parsers.SignatureScheme.signatureScheme_serializer", "LowParse.Low.Base.Spec.gaccessor", "Parsers.SignatureSchemeList.signatureSchemeList_parser_kind", "Parsers.SignatureSchemeList.signatureSchemeList", "Parsers.SignatureSchemeList.signatureSchemeList_parser", "Parsers.SignatureSchemeList.signatureSchemeList_clens_nth" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureSchemeList_nth_ghost (i: nat) : Tot (LL.gaccessor signatureSchemeList_parser signatureScheme_parser (signatureSchemeList_clens_nth i))\nlet signatureSchemeList_nth_ghost i =", "completed_definiton": "LL.vlarray_nth_ghost 2 65534 signatureScheme_serializer 1 32767 i", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureSchemeList.fst", "name": "Parsers.SignatureSchemeList.signatureSchemeList_validator", "original_source_type": "val signatureSchemeList_validator: LL.validator signatureSchemeList_parser", "source_type": "val signatureSchemeList_validator: LL.validator signatureSchemeList_parser", "source_definition": "let signatureSchemeList_validator =\n LL.validate_vlarray 2 65534 signatureScheme_serializer signatureScheme_validator 1 32767 () 2ul", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureSchemeList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 46, "start_col": 1, "end_line": 46, "end_col": 96 }, "file_context": "module Parsers.SignatureSchemeList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet signatureSchemeList_parser =\n LP.parse_vlarray 2 65534 signatureScheme_serializer 1 32767 ()\n\nlet signatureSchemeList_serializer =\n LP.serialize_vlarray 2 65534 signatureScheme_serializer 1 32767 ()\n\nlet signatureSchemeList_bytesize (x:signatureSchemeList) : GTot nat = Seq.length (signatureSchemeList_serializer x)\n\nlet signatureSchemeList_bytesize_eq x = ()\n\nlet signatureSchemeList_parser32 =\n LS.parse32_vlarray 2 2ul 65534 65534ul signatureScheme_serializer signatureScheme_parser32 1 32767 ()\n\nlet signatureSchemeList_serializer32 =\n LS.serialize32_vlarray 2 65534 #_ #_ #_ #signatureScheme_serializer signatureScheme_serializer32 1 32767 ()\n\nlet signatureSchemeList_size32 =\n [@inline_let] let _ = assert_norm (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) in\n LSZ.size32_vlarray 2 65534 signatureScheme_serializer 1 32767 () 2ul 2ul", "dependencies": { "source_file": "Parsers.SignatureSchemeList.fst", "checked_file": "Parsers.SignatureSchemeList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.SignatureScheme" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.SignatureSchemeList.signatureSchemeList_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Array.validate_vlarray", "Parsers.SignatureScheme.signatureScheme_parser_kind", "Parsers.SignatureScheme.signatureScheme", "Parsers.SignatureScheme.signatureScheme_parser", "Parsers.SignatureScheme.signatureScheme_serializer", "Parsers.SignatureScheme.signatureScheme_validator", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureSchemeList_validator: LL.validator signatureSchemeList_parser\nlet signatureSchemeList_validator =", "completed_definiton": "LL.validate_vlarray 2 65534 signatureScheme_serializer signatureScheme_validator 1 32767 () 2ul", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureSchemeList.fst", "name": "Parsers.SignatureSchemeList.signatureSchemeList_serializer", "original_source_type": "val signatureSchemeList_serializer: LP.serializer signatureSchemeList_parser", "source_type": "val signatureSchemeList_serializer: LP.serializer signatureSchemeList_parser", "source_definition": "let signatureSchemeList_serializer =\n LP.serialize_vlarray 2 65534 signatureScheme_serializer 1 32767 ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureSchemeList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 29, "start_col": 2, "end_line": 29, "end_col": 68 }, "file_context": "module Parsers.SignatureSchemeList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet signatureSchemeList_parser =\n LP.parse_vlarray 2 65534 signatureScheme_serializer 1 32767 ()", "dependencies": { "source_file": "Parsers.SignatureSchemeList.fst", "checked_file": "Parsers.SignatureSchemeList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.SignatureScheme" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.SignatureSchemeList.signatureSchemeList_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Array.serialize_vlarray", "Parsers.SignatureScheme.signatureScheme_parser_kind", "Parsers.SignatureScheme.signatureScheme", "Parsers.SignatureScheme.signatureScheme_parser", "Parsers.SignatureScheme.signatureScheme_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureSchemeList_serializer: LP.serializer signatureSchemeList_parser\nlet signatureSchemeList_serializer =", "completed_definiton": "LP.serialize_vlarray 2 65534 signatureScheme_serializer 1 32767 ()", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureSchemeList.fst", "name": "Parsers.SignatureSchemeList.signatureSchemeList_jumper", "original_source_type": "val signatureSchemeList_jumper: LL.jumper signatureSchemeList_parser", "source_type": "val signatureSchemeList_jumper: LL.jumper signatureSchemeList_parser", "source_definition": "let signatureSchemeList_jumper =\n LL.jump_vlarray 2 65534 signatureScheme_serializer 1 32767 () 2ul", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureSchemeList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 49, "start_col": 1, "end_line": 49, "end_col": 66 }, "file_context": "module Parsers.SignatureSchemeList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet signatureSchemeList_parser =\n LP.parse_vlarray 2 65534 signatureScheme_serializer 1 32767 ()\n\nlet signatureSchemeList_serializer =\n LP.serialize_vlarray 2 65534 signatureScheme_serializer 1 32767 ()\n\nlet signatureSchemeList_bytesize (x:signatureSchemeList) : GTot nat = Seq.length (signatureSchemeList_serializer x)\n\nlet signatureSchemeList_bytesize_eq x = ()\n\nlet signatureSchemeList_parser32 =\n LS.parse32_vlarray 2 2ul 65534 65534ul signatureScheme_serializer signatureScheme_parser32 1 32767 ()\n\nlet signatureSchemeList_serializer32 =\n LS.serialize32_vlarray 2 65534 #_ #_ #_ #signatureScheme_serializer signatureScheme_serializer32 1 32767 ()\n\nlet signatureSchemeList_size32 =\n [@inline_let] let _ = assert_norm (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) in\n LSZ.size32_vlarray 2 65534 signatureScheme_serializer 1 32767 () 2ul 2ul\n\nlet signatureSchemeList_validator =\n LL.validate_vlarray 2 65534 signatureScheme_serializer signatureScheme_validator 1 32767 () 2ul", "dependencies": { "source_file": "Parsers.SignatureSchemeList.fst", "checked_file": "Parsers.SignatureSchemeList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.SignatureScheme" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.SignatureSchemeList.signatureSchemeList_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Array.jump_vlarray", "Parsers.SignatureScheme.signatureScheme_parser_kind", "Parsers.SignatureScheme.signatureScheme", "Parsers.SignatureScheme.signatureScheme_parser", "Parsers.SignatureScheme.signatureScheme_serializer", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureSchemeList_jumper: LL.jumper signatureSchemeList_parser\nlet signatureSchemeList_jumper =", "completed_definiton": "LL.jump_vlarray 2 65534 signatureScheme_serializer 1 32767 () 2ul", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureSchemeList.fst", "name": "Parsers.SignatureSchemeList.signatureSchemeList_parser32", "original_source_type": "val signatureSchemeList_parser32: LS.parser32 signatureSchemeList_parser", "source_type": "val signatureSchemeList_parser32: LS.parser32 signatureSchemeList_parser", "source_definition": "let signatureSchemeList_parser32 =\n LS.parse32_vlarray 2 2ul 65534 65534ul signatureScheme_serializer signatureScheme_parser32 1 32767 ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureSchemeList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 36, "start_col": 2, "end_line": 36, "end_col": 103 }, "file_context": "module Parsers.SignatureSchemeList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet signatureSchemeList_parser =\n LP.parse_vlarray 2 65534 signatureScheme_serializer 1 32767 ()\n\nlet signatureSchemeList_serializer =\n LP.serialize_vlarray 2 65534 signatureScheme_serializer 1 32767 ()\n\nlet signatureSchemeList_bytesize (x:signatureSchemeList) : GTot nat = Seq.length (signatureSchemeList_serializer x)\n\nlet signatureSchemeList_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.SignatureSchemeList.fst", "checked_file": "Parsers.SignatureSchemeList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.SignatureScheme" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.SignatureSchemeList.signatureSchemeList_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Array.parse32_vlarray", "FStar.UInt32.__uint_to_t", "Parsers.SignatureScheme.signatureScheme_parser_kind", "Parsers.SignatureScheme.signatureScheme", "Parsers.SignatureScheme.signatureScheme_parser", "Parsers.SignatureScheme.signatureScheme_serializer", "Parsers.SignatureScheme.signatureScheme_parser32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureSchemeList_parser32: LS.parser32 signatureSchemeList_parser\nlet signatureSchemeList_parser32 =", "completed_definiton": "LS.parse32_vlarray 2\n 2ul\n 65534\n 65534ul\n signatureScheme_serializer\n signatureScheme_parser32\n 1\n 32767\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureSchemeList.fst", "name": "Parsers.SignatureSchemeList.signatureSchemeList_size32", "original_source_type": "val signatureSchemeList_size32: LSZ.size32 signatureSchemeList_serializer", "source_type": "val signatureSchemeList_size32: LSZ.size32 signatureSchemeList_serializer", "source_definition": "let signatureSchemeList_size32 =\n [@inline_let] let _ = assert_norm (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) in\n LSZ.size32_vlarray 2 65534 signatureScheme_serializer 1 32767 () 2ul 2ul", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureSchemeList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 42, "start_col": 2, "end_line": 43, "end_col": 74 }, "file_context": "module Parsers.SignatureSchemeList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet signatureSchemeList_parser =\n LP.parse_vlarray 2 65534 signatureScheme_serializer 1 32767 ()\n\nlet signatureSchemeList_serializer =\n LP.serialize_vlarray 2 65534 signatureScheme_serializer 1 32767 ()\n\nlet signatureSchemeList_bytesize (x:signatureSchemeList) : GTot nat = Seq.length (signatureSchemeList_serializer x)\n\nlet signatureSchemeList_bytesize_eq x = ()\n\nlet signatureSchemeList_parser32 =\n LS.parse32_vlarray 2 2ul 65534 65534ul signatureScheme_serializer signatureScheme_parser32 1 32767 ()\n\nlet signatureSchemeList_serializer32 =\n LS.serialize32_vlarray 2 65534 #_ #_ #_ #signatureScheme_serializer signatureScheme_serializer32 1 32767 ()", "dependencies": { "source_file": "Parsers.SignatureSchemeList.fst", "checked_file": "Parsers.SignatureSchemeList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.SignatureScheme" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.SignatureSchemeList.signatureSchemeList_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Array.size32_vlarray", "Parsers.SignatureScheme.signatureScheme_parser_kind", "Parsers.SignatureScheme.signatureScheme", "Parsers.SignatureScheme.signatureScheme_parser", "Parsers.SignatureScheme.signatureScheme_serializer", "FStar.UInt32.__uint_to_t", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.bool", "LowParse.Spec.Array.vldata_vlarray_precond" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureSchemeList_size32: LSZ.size32 signatureSchemeList_serializer\nlet signatureSchemeList_size32 =", "completed_definiton": "[@@ inline_let ]let _ =\n assert_norm (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true)\nin\nLSZ.size32_vlarray 2 65534 signatureScheme_serializer 1 32767 () 2ul 2ul", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureSchemeList.fst", "name": "Parsers.SignatureSchemeList.signatureSchemeList_bytesize_eqn", "original_source_type": "val signatureSchemeList_bytesize_eqn (x: signatureSchemeList) : Lemma (signatureSchemeList_bytesize x == 2 + (L.length x `FStar.Mul.op_Star` 2)) [SMTPat (signatureSchemeList_bytesize x)]", "source_type": "val signatureSchemeList_bytesize_eqn (x: signatureSchemeList) : Lemma (signatureSchemeList_bytesize x == 2 + (L.length x `FStar.Mul.op_Star` 2)) [SMTPat (signatureSchemeList_bytesize x)]", "source_definition": "let signatureSchemeList_bytesize_eqn x = LP.length_serialize_vlarray 2 65534 signatureScheme_serializer 1 32767 () x", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureSchemeList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 62, "start_col": 41, "end_line": 62, "end_col": 116 }, "file_context": "module Parsers.SignatureSchemeList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet signatureSchemeList_parser =\n LP.parse_vlarray 2 65534 signatureScheme_serializer 1 32767 ()\n\nlet signatureSchemeList_serializer =\n LP.serialize_vlarray 2 65534 signatureScheme_serializer 1 32767 ()\n\nlet signatureSchemeList_bytesize (x:signatureSchemeList) : GTot nat = Seq.length (signatureSchemeList_serializer x)\n\nlet signatureSchemeList_bytesize_eq x = ()\n\nlet signatureSchemeList_parser32 =\n LS.parse32_vlarray 2 2ul 65534 65534ul signatureScheme_serializer signatureScheme_parser32 1 32767 ()\n\nlet signatureSchemeList_serializer32 =\n LS.serialize32_vlarray 2 65534 #_ #_ #_ #signatureScheme_serializer signatureScheme_serializer32 1 32767 ()\n\nlet signatureSchemeList_size32 =\n [@inline_let] let _ = assert_norm (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) in\n LSZ.size32_vlarray 2 65534 signatureScheme_serializer 1 32767 () 2ul 2ul\n\nlet signatureSchemeList_validator =\n LL.validate_vlarray 2 65534 signatureScheme_serializer signatureScheme_validator 1 32767 () 2ul\n\nlet signatureSchemeList_jumper =\n LL.jump_vlarray 2 65534 signatureScheme_serializer 1 32767 () 2ul\n\nlet _ : squash (signatureSchemeList == LL.vlarray signatureScheme 1 32767) = _ by (FStar.Tactics.trefl ())\n\nlet finalize_signatureSchemeList #_ #_ sl pos pos' =\n LL.finalize_vlarray 2 65534 signatureScheme_serializer 1 32767 sl pos pos'\n\nlet signatureSchemeList_count #_ #_ input pos = LL.vlarray_list_length 2 65534 signatureScheme_serializer 1 32767 input pos\n\nlet signatureSchemeList_nth_ghost i = LL.vlarray_nth_ghost 2 65534 signatureScheme_serializer 1 32767 i\n\nlet signatureSchemeList_nth i = LL.vlarray_nth 2 65534 signatureScheme_serializer 1 32767 i", "dependencies": { "source_file": "Parsers.SignatureSchemeList.fst", "checked_file": "Parsers.SignatureSchemeList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.SignatureScheme" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.SignatureSchemeList.signatureSchemeList\n -> FStar.Pervasives.Lemma\n (ensures\n Parsers.SignatureSchemeList.signatureSchemeList_bytesize x ==\n 2 + FStar.List.Tot.Base.length x * 2)\n [SMTPat (Parsers.SignatureSchemeList.signatureSchemeList_bytesize x)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.SignatureSchemeList.signatureSchemeList", "LowParse.Spec.Array.length_serialize_vlarray", "Parsers.SignatureScheme.signatureScheme_parser_kind", "Parsers.SignatureScheme.signatureScheme", "Parsers.SignatureScheme.signatureScheme_parser", "Parsers.SignatureScheme.signatureScheme_serializer", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureSchemeList_bytesize_eqn (x: signatureSchemeList) : Lemma (signatureSchemeList_bytesize x == 2 + (L.length x `FStar.Mul.op_Star` 2)) [SMTPat (signatureSchemeList_bytesize x)]\nlet signatureSchemeList_bytesize_eqn x =", "completed_definiton": "LP.length_serialize_vlarray 2 65534 signatureScheme_serializer 1 32767 () x", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureSchemeList.fst", "name": "Parsers.SignatureSchemeList.signatureSchemeList_nth", "original_source_type": "val signatureSchemeList_nth (i: U32.t) : Tot (LL.accessor (signatureSchemeList_nth_ghost (U32.v i)))", "source_type": "val signatureSchemeList_nth (i: U32.t) : Tot (LL.accessor (signatureSchemeList_nth_ghost (U32.v i)))", "source_definition": "let signatureSchemeList_nth i = LL.vlarray_nth 2 65534 signatureScheme_serializer 1 32767 i", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureSchemeList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 60, "start_col": 32, "end_line": 60, "end_col": 91 }, "file_context": "module Parsers.SignatureSchemeList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet signatureSchemeList_parser =\n LP.parse_vlarray 2 65534 signatureScheme_serializer 1 32767 ()\n\nlet signatureSchemeList_serializer =\n LP.serialize_vlarray 2 65534 signatureScheme_serializer 1 32767 ()\n\nlet signatureSchemeList_bytesize (x:signatureSchemeList) : GTot nat = Seq.length (signatureSchemeList_serializer x)\n\nlet signatureSchemeList_bytesize_eq x = ()\n\nlet signatureSchemeList_parser32 =\n LS.parse32_vlarray 2 2ul 65534 65534ul signatureScheme_serializer signatureScheme_parser32 1 32767 ()\n\nlet signatureSchemeList_serializer32 =\n LS.serialize32_vlarray 2 65534 #_ #_ #_ #signatureScheme_serializer signatureScheme_serializer32 1 32767 ()\n\nlet signatureSchemeList_size32 =\n [@inline_let] let _ = assert_norm (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) in\n LSZ.size32_vlarray 2 65534 signatureScheme_serializer 1 32767 () 2ul 2ul\n\nlet signatureSchemeList_validator =\n LL.validate_vlarray 2 65534 signatureScheme_serializer signatureScheme_validator 1 32767 () 2ul\n\nlet signatureSchemeList_jumper =\n LL.jump_vlarray 2 65534 signatureScheme_serializer 1 32767 () 2ul\n\nlet _ : squash (signatureSchemeList == LL.vlarray signatureScheme 1 32767) = _ by (FStar.Tactics.trefl ())\n\nlet finalize_signatureSchemeList #_ #_ sl pos pos' =\n LL.finalize_vlarray 2 65534 signatureScheme_serializer 1 32767 sl pos pos'\n\nlet signatureSchemeList_count #_ #_ input pos = LL.vlarray_list_length 2 65534 signatureScheme_serializer 1 32767 input pos\n\nlet signatureSchemeList_nth_ghost i = LL.vlarray_nth_ghost 2 65534 signatureScheme_serializer 1 32767 i", "dependencies": { "source_file": "Parsers.SignatureSchemeList.fst", "checked_file": "Parsers.SignatureSchemeList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.SignatureScheme" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: FStar.UInt32.t\n -> LowParse.Low.Base.accessor (Parsers.SignatureSchemeList.signatureSchemeList_nth_ghost (FStar.UInt32.v\n i))", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "LowParse.Low.Array.vlarray_nth", "Parsers.SignatureScheme.signatureScheme_parser_kind", "Parsers.SignatureScheme.signatureScheme", "Parsers.SignatureScheme.signatureScheme_parser", "Parsers.SignatureScheme.signatureScheme_serializer", "LowParse.Low.Base.accessor", "Parsers.SignatureSchemeList.signatureSchemeList_parser_kind", "Parsers.SignatureSchemeList.signatureSchemeList", "Parsers.SignatureSchemeList.signatureSchemeList_parser", "Parsers.SignatureSchemeList.signatureSchemeList_clens_nth", "FStar.UInt32.v", "Parsers.SignatureSchemeList.signatureSchemeList_nth_ghost" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureSchemeList_nth (i: U32.t) : Tot (LL.accessor (signatureSchemeList_nth_ghost (U32.v i)))\nlet signatureSchemeList_nth i =", "completed_definiton": "LL.vlarray_nth 2 65534 signatureScheme_serializer 1 32767 i", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureSchemeList.fst", "name": "Parsers.SignatureSchemeList.signatureSchemeList_count", "original_source_type": "val signatureSchemeList_count (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid signatureSchemeList_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents signatureSchemeList_parser h input pos in\n let pos' = LL.get_valid_pos signatureSchemeList_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v res == L.length x /\\\n U32.v pos' == U32.v pos + 2 + (U32.v res `FStar.Mul.op_Star` 2) /\\\n LL.valid_list signatureScheme_parser h input (pos `U32.add` 2ul) pos' /\\\n LL.contents_list signatureScheme_parser h input (pos `U32.add` 2ul) pos' == x\n ))", "source_type": "val signatureSchemeList_count (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid signatureSchemeList_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents signatureSchemeList_parser h input pos in\n let pos' = LL.get_valid_pos signatureSchemeList_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v res == L.length x /\\\n U32.v pos' == U32.v pos + 2 + (U32.v res `FStar.Mul.op_Star` 2) /\\\n LL.valid_list signatureScheme_parser h input (pos `U32.add` 2ul) pos' /\\\n LL.contents_list signatureScheme_parser h input (pos `U32.add` 2ul) pos' == x\n ))", "source_definition": "let signatureSchemeList_count #_ #_ input pos = LL.vlarray_list_length 2 65534 signatureScheme_serializer 1 32767 input pos", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureSchemeList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 56, "start_col": 48, "end_line": 56, "end_col": 123 }, "file_context": "module Parsers.SignatureSchemeList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet signatureSchemeList_parser =\n LP.parse_vlarray 2 65534 signatureScheme_serializer 1 32767 ()\n\nlet signatureSchemeList_serializer =\n LP.serialize_vlarray 2 65534 signatureScheme_serializer 1 32767 ()\n\nlet signatureSchemeList_bytesize (x:signatureSchemeList) : GTot nat = Seq.length (signatureSchemeList_serializer x)\n\nlet signatureSchemeList_bytesize_eq x = ()\n\nlet signatureSchemeList_parser32 =\n LS.parse32_vlarray 2 2ul 65534 65534ul signatureScheme_serializer signatureScheme_parser32 1 32767 ()\n\nlet signatureSchemeList_serializer32 =\n LS.serialize32_vlarray 2 65534 #_ #_ #_ #signatureScheme_serializer signatureScheme_serializer32 1 32767 ()\n\nlet signatureSchemeList_size32 =\n [@inline_let] let _ = assert_norm (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) in\n LSZ.size32_vlarray 2 65534 signatureScheme_serializer 1 32767 () 2ul 2ul\n\nlet signatureSchemeList_validator =\n LL.validate_vlarray 2 65534 signatureScheme_serializer signatureScheme_validator 1 32767 () 2ul\n\nlet signatureSchemeList_jumper =\n LL.jump_vlarray 2 65534 signatureScheme_serializer 1 32767 () 2ul\n\nlet _ : squash (signatureSchemeList == LL.vlarray signatureScheme 1 32767) = _ by (FStar.Tactics.trefl ())\n\nlet finalize_signatureSchemeList #_ #_ sl pos pos' =\n LL.finalize_vlarray 2 65534 signatureScheme_serializer 1 32767 sl pos pos'", "dependencies": { "source_file": "Parsers.SignatureSchemeList.fst", "checked_file": "Parsers.SignatureSchemeList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.SignatureScheme" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "input: LowParse.Slice.slice rrel rel -> pos: FStar.UInt32.t\n -> FStar.HyperStack.ST.Stack FStar.UInt32.t", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "LowParse.Low.Array.vlarray_list_length", "Parsers.SignatureScheme.signatureScheme_parser_kind", "Parsers.SignatureScheme.signatureScheme", "Parsers.SignatureScheme.signatureScheme_parser", "Parsers.SignatureScheme.signatureScheme_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val signatureSchemeList_count (#rrel: _) (#rel: _) (input: LL.slice rrel rel) (pos: U32.t) : HST.Stack U32.t\n (requires (fun h -> LL.valid signatureSchemeList_parser h input pos))\n (ensures (fun h res h' ->\n let x = LL.contents signatureSchemeList_parser h input pos in\n let pos' = LL.get_valid_pos signatureSchemeList_parser h input pos in\n B.modifies B.loc_none h h' /\\\n U32.v res == L.length x /\\\n U32.v pos' == U32.v pos + 2 + (U32.v res `FStar.Mul.op_Star` 2) /\\\n LL.valid_list signatureScheme_parser h input (pos `U32.add` 2ul) pos' /\\\n LL.contents_list signatureScheme_parser h input (pos `U32.add` 2ul) pos' == x\n ))\nlet signatureSchemeList_count #_ #_ input pos =", "completed_definiton": "LL.vlarray_list_length 2 65534 signatureScheme_serializer 1 32767 input pos", "isa_cross_project_example": true }, { "file_name": "Parsers.SignatureSchemeList.fst", "name": "Parsers.SignatureSchemeList.finalize_signatureSchemeList", "original_source_type": "val finalize_signatureSchemeList (#rrel: _) (#rel: _) (sl: LL.slice rrel rel) (pos pos' : U32.t) : HST.Stack unit\n(requires (fun h ->\n U32.v pos + 2 < 4294967296 /\\\n LL.writable sl.LL.base (U32.v pos) (U32.v pos + 2) h /\\\n LL.valid_list signatureScheme_parser h sl (pos `U32.add` 2ul) pos' /\\ (\n let count = L.length (LL.contents_list signatureScheme_parser h sl (pos `U32.add` 2ul) pos') in\n let len = U32.v pos' - (U32.v pos + 2) in\n ((2 <= len /\\ len <= 65534) \\/ (1 <= count /\\ count <= 32767))\n)))\n(ensures (fun h _ h' ->\n B.modifies (LL.loc_slice_from_to sl pos (pos `U32.add` 2ul)) h h' /\\ (\n let l = LL.contents_list signatureScheme_parser h sl (pos `U32.add` 2ul) pos' in\n 1 <= L.length l /\\ L.length l <= 32767 /\\\n LL.valid_content_pos signatureSchemeList_parser h' sl pos l pos'\n)))", "source_type": "val finalize_signatureSchemeList (#rrel: _) (#rel: _) (sl: LL.slice rrel rel) (pos pos' : U32.t) : HST.Stack unit\n(requires (fun h ->\n U32.v pos + 2 < 4294967296 /\\\n LL.writable sl.LL.base (U32.v pos) (U32.v pos + 2) h /\\\n LL.valid_list signatureScheme_parser h sl (pos `U32.add` 2ul) pos' /\\ (\n let count = L.length (LL.contents_list signatureScheme_parser h sl (pos `U32.add` 2ul) pos') in\n let len = U32.v pos' - (U32.v pos + 2) in\n ((2 <= len /\\ len <= 65534) \\/ (1 <= count /\\ count <= 32767))\n)))\n(ensures (fun h _ h' ->\n B.modifies (LL.loc_slice_from_to sl pos (pos `U32.add` 2ul)) h h' /\\ (\n let l = LL.contents_list signatureScheme_parser h sl (pos `U32.add` 2ul) pos' in\n 1 <= L.length l /\\ L.length l <= 32767 /\\\n LL.valid_content_pos signatureSchemeList_parser h' sl pos l pos'\n)))", "source_definition": "let finalize_signatureSchemeList #_ #_ sl pos pos' =\n LL.finalize_vlarray 2 65534 signatureScheme_serializer 1 32767 sl pos pos'", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.SignatureSchemeList.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 54, "start_col": 2, "end_line": 54, "end_col": 76 }, "file_context": "module Parsers.SignatureSchemeList\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\nprivate let pre : squash (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) = _ by (FStar.Tactics.trefl ())\n\nlet signatureSchemeList_parser =\n LP.parse_vlarray 2 65534 signatureScheme_serializer 1 32767 ()\n\nlet signatureSchemeList_serializer =\n LP.serialize_vlarray 2 65534 signatureScheme_serializer 1 32767 ()\n\nlet signatureSchemeList_bytesize (x:signatureSchemeList) : GTot nat = Seq.length (signatureSchemeList_serializer x)\n\nlet signatureSchemeList_bytesize_eq x = ()\n\nlet signatureSchemeList_parser32 =\n LS.parse32_vlarray 2 2ul 65534 65534ul signatureScheme_serializer signatureScheme_parser32 1 32767 ()\n\nlet signatureSchemeList_serializer32 =\n LS.serialize32_vlarray 2 65534 #_ #_ #_ #signatureScheme_serializer signatureScheme_serializer32 1 32767 ()\n\nlet signatureSchemeList_size32 =\n [@inline_let] let _ = assert_norm (LP.vldata_vlarray_precond 2 65534 signatureScheme_parser 1 32767 == true) in\n LSZ.size32_vlarray 2 65534 signatureScheme_serializer 1 32767 () 2ul 2ul\n\nlet signatureSchemeList_validator =\n LL.validate_vlarray 2 65534 signatureScheme_serializer signatureScheme_validator 1 32767 () 2ul\n\nlet signatureSchemeList_jumper =\n LL.jump_vlarray 2 65534 signatureScheme_serializer 1 32767 () 2ul\n\nlet _ : squash (signatureSchemeList == LL.vlarray signatureScheme 1 32767) = _ by (FStar.Tactics.trefl ())", "dependencies": { "source_file": "Parsers.SignatureSchemeList.fst", "checked_file": "Parsers.SignatureSchemeList.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.SignatureScheme" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "sl: LowParse.Slice.slice rrel rel -> pos: FStar.UInt32.t -> pos': FStar.UInt32.t\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "LowParse.Low.Array.finalize_vlarray", "Parsers.SignatureScheme.signatureScheme_parser_kind", "Parsers.SignatureScheme.signatureScheme", "Parsers.SignatureScheme.signatureScheme_parser", "Parsers.SignatureScheme.signatureScheme_serializer", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val finalize_signatureSchemeList (#rrel: _) (#rel: _) (sl: LL.slice rrel rel) (pos pos' : U32.t) : HST.Stack unit\n(requires (fun h ->\n U32.v pos + 2 < 4294967296 /\\\n LL.writable sl.LL.base (U32.v pos) (U32.v pos + 2) h /\\\n LL.valid_list signatureScheme_parser h sl (pos `U32.add` 2ul) pos' /\\ (\n let count = L.length (LL.contents_list signatureScheme_parser h sl (pos `U32.add` 2ul) pos') in\n let len = U32.v pos' - (U32.v pos + 2) in\n ((2 <= len /\\ len <= 65534) \\/ (1 <= count /\\ count <= 32767))\n)))\n(ensures (fun h _ h' ->\n B.modifies (LL.loc_slice_from_to sl pos (pos `U32.add` 2ul)) h h' /\\ (\n let l = LL.contents_list signatureScheme_parser h sl (pos `U32.add` 2ul) pos' in\n 1 <= L.length l /\\ L.length l <= 32767 /\\\n LL.valid_content_pos signatureSchemeList_parser h' sl pos l pos'\n)))\nlet finalize_signatureSchemeList #_ #_ sl pos pos' =", "completed_definiton": "LL.finalize_vlarray 2 65534 signatureScheme_serializer 1 32767 sl pos pos'", "isa_cross_project_example": true }, { "file_name": "Format.KeyShareEntry.fst", "name": "Format.KeyShareEntry.keyShareEntry_parser_kind_metadata", "original_source_type": "val keyShareEntry_parser_kind_metadata : LP.parser_kind_metadata_t", "source_type": "val keyShareEntry_parser_kind_metadata : LP.parser_kind_metadata_t", "source_definition": "let keyShareEntry_parser_kind_metadata = keyShareEntry_parser_kind'.LP.parser_kind_metadata", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.KeyShareEntry.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 29, "start_col": 41, "end_line": 29, "end_col": 91 }, "file_context": "module Format.KeyShareEntry\n\nopen Parsers.NamedGroup\nopen Format.UncompressedPointRepresentation\n\nmodule B = FStar.Bytes\nmodule LP = LowParse.SLow\nmodule U32 = FStar.UInt32\n\n\n(* Parsers, validators *)\n\ninline_for_extraction\nlet synth_keyShareEntry (r:namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)): Tot keyShareEntry = { group=(fst r); key_exchange=(snd r) }\n\ninline_for_extraction\nlet unsynth_keyShareEntry (e:keyShareEntry): Tot (namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)) = e.group, e.key_exchange\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics'\"\nlet lemma_synth_keyShareEntry_is_injective () \n : Lemma (LP.synth_injective synth_keyShareEntry) \n = LP.synth_injective_intro synth_keyShareEntry\n#reset-options\n\ninline_for_extraction\nlet keyShareEntry_parser_kind' =\n LP.and_then_kind namedGroup_parser_kind (LP.parse_bounded_vlbytes_kind 1 65535)", "dependencies": { "source_file": "Format.KeyShareEntry.fst", "checked_file": "Format.KeyShareEntry.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.NamedGroup.fsti.checked", "LowParse.Spec.Bytes.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.UncompressedPointRepresentation.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": false, "short_module": null, "full_module": "Format.UncompressedPointRepresentation" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind_metadata_t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_metadata", "Format.KeyShareEntry.keyShareEntry_parser_kind'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val keyShareEntry_parser_kind_metadata : LP.parser_kind_metadata_t\nlet keyShareEntry_parser_kind_metadata =", "completed_definiton": "keyShareEntry_parser_kind'.LP.parser_kind_metadata", "isa_cross_project_example": true }, { "file_name": "Format.KeyShareEntry.fst", "name": "Format.KeyShareEntry.keyShareEntry_parser_kind'", "original_source_type": "", "source_type": "val keyShareEntry_parser_kind' : LowParse.Spec.Base.parser_kind", "source_definition": "let keyShareEntry_parser_kind' =\n LP.and_then_kind namedGroup_parser_kind (LP.parse_bounded_vlbytes_kind 1 65535)", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.KeyShareEntry.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 27, "start_col": 2, "end_line": 27, "end_col": 81 }, "file_context": "module Format.KeyShareEntry\n\nopen Parsers.NamedGroup\nopen Format.UncompressedPointRepresentation\n\nmodule B = FStar.Bytes\nmodule LP = LowParse.SLow\nmodule U32 = FStar.UInt32\n\n\n(* Parsers, validators *)\n\ninline_for_extraction\nlet synth_keyShareEntry (r:namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)): Tot keyShareEntry = { group=(fst r); key_exchange=(snd r) }\n\ninline_for_extraction\nlet unsynth_keyShareEntry (e:keyShareEntry): Tot (namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)) = e.group, e.key_exchange\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics'\"\nlet lemma_synth_keyShareEntry_is_injective () \n : Lemma (LP.synth_injective synth_keyShareEntry) \n = LP.synth_injective_intro synth_keyShareEntry\n#reset-options\n\ninline_for_extraction", "dependencies": { "source_file": "Format.KeyShareEntry.fst", "checked_file": "Format.KeyShareEntry.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.NamedGroup.fsti.checked", "LowParse.Spec.Bytes.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.UncompressedPointRepresentation.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format.UncompressedPointRepresentation" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.and_then_kind", "Parsers.NamedGroup.namedGroup_parser_kind", "LowParse.Spec.Bytes.parse_bounded_vlbytes_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let keyShareEntry_parser_kind' =", "completed_definiton": "LP.and_then_kind namedGroup_parser_kind (LP.parse_bounded_vlbytes_kind 1 65535)", "isa_cross_project_example": true }, { "file_name": "Format.KeyShareEntry.fst", "name": "Format.KeyShareEntry.synth_keyShareEntry", "original_source_type": "val synth_keyShareEntry (r: (namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)))\n : Tot keyShareEntry", "source_type": "val synth_keyShareEntry (r: (namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)))\n : Tot keyShareEntry", "source_definition": "let synth_keyShareEntry (r:namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)): Tot keyShareEntry = { group=(fst r); key_exchange=(snd r) }", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.KeyShareEntry.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 14, "start_col": 118, "end_line": 14, "end_col": 153 }, "file_context": "module Format.KeyShareEntry\n\nopen Parsers.NamedGroup\nopen Format.UncompressedPointRepresentation\n\nmodule B = FStar.Bytes\nmodule LP = LowParse.SLow\nmodule U32 = FStar.UInt32\n\n\n(* Parsers, validators *)", "dependencies": { "source_file": "Format.KeyShareEntry.fst", "checked_file": "Format.KeyShareEntry.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.NamedGroup.fsti.checked", "LowParse.Spec.Bytes.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.UncompressedPointRepresentation.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format.UncompressedPointRepresentation" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "r: (Parsers.NamedGroup.namedGroup * LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)\n -> Format.KeyShareEntry.keyShareEntry", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Pervasives.Native.tuple2", "Parsers.NamedGroup.namedGroup", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "Format.KeyShareEntry.MkkeyShareEntry", "FStar.Pervasives.Native.fst", "FStar.Pervasives.Native.snd", "Format.KeyShareEntry.keyShareEntry" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_keyShareEntry (r: (namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)))\n : Tot keyShareEntry\nlet synth_keyShareEntry (r: namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535))\n : Tot keyShareEntry =", "completed_definiton": "{ group = (fst r); key_exchange = (snd r) }", "isa_cross_project_example": true }, { "file_name": "Format.KeyShareEntry.fst", "name": "Format.KeyShareEntry.unsynth_keyShareEntry", "original_source_type": "val unsynth_keyShareEntry (e: keyShareEntry)\n : Tot (namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535))", "source_type": "val unsynth_keyShareEntry (e: keyShareEntry)\n : Tot (namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535))", "source_definition": "let unsynth_keyShareEntry (e:keyShareEntry): Tot (namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)) = e.group, e.key_exchange", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.KeyShareEntry.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 17, "start_col": 120, "end_line": 17, "end_col": 143 }, "file_context": "module Format.KeyShareEntry\n\nopen Parsers.NamedGroup\nopen Format.UncompressedPointRepresentation\n\nmodule B = FStar.Bytes\nmodule LP = LowParse.SLow\nmodule U32 = FStar.UInt32\n\n\n(* Parsers, validators *)\n\ninline_for_extraction\nlet synth_keyShareEntry (r:namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)): Tot keyShareEntry = { group=(fst r); key_exchange=(snd r) }", "dependencies": { "source_file": "Format.KeyShareEntry.fst", "checked_file": "Format.KeyShareEntry.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.NamedGroup.fsti.checked", "LowParse.Spec.Bytes.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.UncompressedPointRepresentation.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format.UncompressedPointRepresentation" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "e: Format.KeyShareEntry.keyShareEntry\n -> Parsers.NamedGroup.namedGroup * LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Format.KeyShareEntry.keyShareEntry", "FStar.Pervasives.Native.Mktuple2", "Parsers.NamedGroup.namedGroup", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "Format.KeyShareEntry.__proj__MkkeyShareEntry__item__group", "Format.KeyShareEntry.__proj__MkkeyShareEntry__item__key_exchange", "FStar.Pervasives.Native.tuple2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val unsynth_keyShareEntry (e: keyShareEntry)\n : Tot (namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535))\nlet unsynth_keyShareEntry (e: keyShareEntry)\n : Tot (namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)) =", "completed_definiton": "e.group, e.key_exchange", "isa_cross_project_example": true }, { "file_name": "Format.KeyShareEntry.fst", "name": "Format.KeyShareEntry.lemma_synth_keyShareEntry_of_unsynth_keyShareEntry", "original_source_type": "val lemma_synth_keyShareEntry_of_unsynth_keyShareEntry: Prims.unit\n -> Lemma (LP.synth_inverse synth_keyShareEntry unsynth_keyShareEntry)", "source_type": "val lemma_synth_keyShareEntry_of_unsynth_keyShareEntry: Prims.unit\n -> Lemma (LP.synth_inverse synth_keyShareEntry unsynth_keyShareEntry)", "source_definition": "let lemma_synth_keyShareEntry_of_unsynth_keyShareEntry () \n : Lemma (LP.synth_inverse synth_keyShareEntry unsynth_keyShareEntry)\n = LP.synth_inverse_intro synth_keyShareEntry unsynth_keyShareEntry", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.KeyShareEntry.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 56, "start_col": 4, "end_line": 56, "end_col": 68 }, "file_context": "module Format.KeyShareEntry\n\nopen Parsers.NamedGroup\nopen Format.UncompressedPointRepresentation\n\nmodule B = FStar.Bytes\nmodule LP = LowParse.SLow\nmodule U32 = FStar.UInt32\n\n\n(* Parsers, validators *)\n\ninline_for_extraction\nlet synth_keyShareEntry (r:namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)): Tot keyShareEntry = { group=(fst r); key_exchange=(snd r) }\n\ninline_for_extraction\nlet unsynth_keyShareEntry (e:keyShareEntry): Tot (namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)) = e.group, e.key_exchange\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics'\"\nlet lemma_synth_keyShareEntry_is_injective () \n : Lemma (LP.synth_injective synth_keyShareEntry) \n = LP.synth_injective_intro synth_keyShareEntry\n#reset-options\n\ninline_for_extraction\nlet keyShareEntry_parser_kind' =\n LP.and_then_kind namedGroup_parser_kind (LP.parse_bounded_vlbytes_kind 1 65535)\n\nlet keyShareEntry_parser_kind_metadata = keyShareEntry_parser_kind'.LP.parser_kind_metadata\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics'\"\n\nlet keyShareEntry_parser =\n lemma_synth_keyShareEntry_is_injective ();\n assert_norm (keyShareEntry_parser_kind' == keyShareEntry_parser_kind);\n LP.parse_synth \n (namedGroup_parser `LP.nondep_then` (LP.parse_bounded_vlbytes 1 65535))\n synth_keyShareEntry\n\nlet keyShareEntry_parser32 =\n lemma_synth_keyShareEntry_is_injective ();\n assert_norm (keyShareEntry_parser_kind' == keyShareEntry_parser_kind);\n LP.parse32_synth\n _\n synth_keyShareEntry\n (fun x -> synth_keyShareEntry x)\n (LP.parse32_nondep_then namedGroup_parser32 (LP.parse32_bounded_vlbytes 1 1ul 65535 65535ul))\n ()\n \n\n(* Serialization *)\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics'\"\nlet lemma_synth_keyShareEntry_of_unsynth_keyShareEntry ()", "dependencies": { "source_file": "Format.KeyShareEntry.fst", "checked_file": "Format.KeyShareEntry.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.NamedGroup.fsti.checked", "LowParse.Spec.Bytes.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.UncompressedPointRepresentation.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format.UncompressedPointRepresentation" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_inverse Format.KeyShareEntry.synth_keyShareEntry\n Format.KeyShareEntry.unsynth_keyShareEntry)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "LowParse.Spec.Combinators.synth_inverse_intro", "FStar.Pervasives.Native.tuple2", "Parsers.NamedGroup.namedGroup", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "Format.KeyShareEntry.keyShareEntry", "Format.KeyShareEntry.synth_keyShareEntry", "Format.KeyShareEntry.unsynth_keyShareEntry", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_inverse", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_synth_keyShareEntry_of_unsynth_keyShareEntry: Prims.unit\n -> Lemma (LP.synth_inverse synth_keyShareEntry unsynth_keyShareEntry)\nlet lemma_synth_keyShareEntry_of_unsynth_keyShareEntry ()\n : Lemma (LP.synth_inverse synth_keyShareEntry unsynth_keyShareEntry) =", "completed_definiton": "LP.synth_inverse_intro synth_keyShareEntry unsynth_keyShareEntry", "isa_cross_project_example": true }, { "file_name": "Format.KeyShareEntry.fst", "name": "Format.KeyShareEntry.lemma_synth_keyShareEntry_is_injective", "original_source_type": "val lemma_synth_keyShareEntry_is_injective: Prims.unit\n -> Lemma (LP.synth_injective synth_keyShareEntry)", "source_type": "val lemma_synth_keyShareEntry_is_injective: Prims.unit\n -> Lemma (LP.synth_injective synth_keyShareEntry)", "source_definition": "let lemma_synth_keyShareEntry_is_injective () \n : Lemma (LP.synth_injective synth_keyShareEntry) \n = LP.synth_injective_intro synth_keyShareEntry", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.KeyShareEntry.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 22, "start_col": 4, "end_line": 22, "end_col": 48 }, "file_context": "module Format.KeyShareEntry\n\nopen Parsers.NamedGroup\nopen Format.UncompressedPointRepresentation\n\nmodule B = FStar.Bytes\nmodule LP = LowParse.SLow\nmodule U32 = FStar.UInt32\n\n\n(* Parsers, validators *)\n\ninline_for_extraction\nlet synth_keyShareEntry (r:namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)): Tot keyShareEntry = { group=(fst r); key_exchange=(snd r) }\n\ninline_for_extraction\nlet unsynth_keyShareEntry (e:keyShareEntry): Tot (namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)) = e.group, e.key_exchange\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics'\"\nlet lemma_synth_keyShareEntry_is_injective ()", "dependencies": { "source_file": "Format.KeyShareEntry.fst", "checked_file": "Format.KeyShareEntry.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.NamedGroup.fsti.checked", "LowParse.Spec.Bytes.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.UncompressedPointRepresentation.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Format.UncompressedPointRepresentation" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures LowParse.Spec.Combinators.synth_injective Format.KeyShareEntry.synth_keyShareEntry)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "LowParse.Spec.Combinators.synth_injective_intro", "FStar.Pervasives.Native.tuple2", "Parsers.NamedGroup.namedGroup", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "Format.KeyShareEntry.keyShareEntry", "Format.KeyShareEntry.synth_keyShareEntry", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_injective", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_synth_keyShareEntry_is_injective: Prims.unit\n -> Lemma (LP.synth_injective synth_keyShareEntry)\nlet lemma_synth_keyShareEntry_is_injective () : Lemma (LP.synth_injective synth_keyShareEntry) =", "completed_definiton": "LP.synth_injective_intro synth_keyShareEntry", "isa_cross_project_example": true }, { "file_name": "Format.KeyShareEntry.fst", "name": "Format.KeyShareEntry.keyShareEntry_parser32", "original_source_type": "val keyShareEntry_parser32: LP.parser32 keyShareEntry_parser", "source_type": "val keyShareEntry_parser32: LP.parser32 keyShareEntry_parser", "source_definition": "let keyShareEntry_parser32 =\n lemma_synth_keyShareEntry_is_injective ();\n assert_norm (keyShareEntry_parser_kind' == keyShareEntry_parser_kind);\n LP.parse32_synth\n _\n synth_keyShareEntry\n (fun x -> synth_keyShareEntry x)\n (LP.parse32_nondep_then namedGroup_parser32 (LP.parse32_bounded_vlbytes 1 1ul 65535 65535ul))\n ()", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.KeyShareEntry.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 41, "start_col": 2, "end_line": 48, "end_col": 6 }, "file_context": "module Format.KeyShareEntry\n\nopen Parsers.NamedGroup\nopen Format.UncompressedPointRepresentation\n\nmodule B = FStar.Bytes\nmodule LP = LowParse.SLow\nmodule U32 = FStar.UInt32\n\n\n(* Parsers, validators *)\n\ninline_for_extraction\nlet synth_keyShareEntry (r:namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)): Tot keyShareEntry = { group=(fst r); key_exchange=(snd r) }\n\ninline_for_extraction\nlet unsynth_keyShareEntry (e:keyShareEntry): Tot (namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)) = e.group, e.key_exchange\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics'\"\nlet lemma_synth_keyShareEntry_is_injective () \n : Lemma (LP.synth_injective synth_keyShareEntry) \n = LP.synth_injective_intro synth_keyShareEntry\n#reset-options\n\ninline_for_extraction\nlet keyShareEntry_parser_kind' =\n LP.and_then_kind namedGroup_parser_kind (LP.parse_bounded_vlbytes_kind 1 65535)\n\nlet keyShareEntry_parser_kind_metadata = keyShareEntry_parser_kind'.LP.parser_kind_metadata\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics'\"\n\nlet keyShareEntry_parser =\n lemma_synth_keyShareEntry_is_injective ();\n assert_norm (keyShareEntry_parser_kind' == keyShareEntry_parser_kind);\n LP.parse_synth \n (namedGroup_parser `LP.nondep_then` (LP.parse_bounded_vlbytes 1 65535))\n synth_keyShareEntry", "dependencies": { "source_file": "Format.KeyShareEntry.fst", "checked_file": "Format.KeyShareEntry.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.NamedGroup.fsti.checked", "LowParse.Spec.Bytes.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.UncompressedPointRepresentation.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": false, "short_module": null, "full_module": "Format.UncompressedPointRepresentation" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Format.KeyShareEntry.keyShareEntry_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.NamedGroup.namedGroup_parser_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "FStar.Pervasives.Native.tuple2", "Parsers.NamedGroup.namedGroup", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "Format.KeyShareEntry.keyShareEntry", "LowParse.Spec.Combinators.nondep_then", "Parsers.NamedGroup.namedGroup_parser", "LowParse.Spec.Bytes.parse_bounded_vlbytes", "Format.KeyShareEntry.synth_keyShareEntry", "Prims.eq2", "LowParse.SLow.Combinators.parse32_nondep_then", "Parsers.NamedGroup.namedGroup_parser32", "LowParse.SLow.Bytes.parse32_bounded_vlbytes", "FStar.UInt32.__uint_to_t", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.Base.parser_kind", "Format.KeyShareEntry.keyShareEntry_parser_kind'", "Format.KeyShareEntry.keyShareEntry_parser_kind", "Format.KeyShareEntry.lemma_synth_keyShareEntry_is_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val keyShareEntry_parser32: LP.parser32 keyShareEntry_parser\nlet keyShareEntry_parser32 =", "completed_definiton": "lemma_synth_keyShareEntry_is_injective ();\nassert_norm (keyShareEntry_parser_kind' == keyShareEntry_parser_kind);\nLP.parse32_synth _\n synth_keyShareEntry\n (fun x -> synth_keyShareEntry x)\n (LP.parse32_nondep_then namedGroup_parser32 (LP.parse32_bounded_vlbytes 1 1ul 65535 65535ul))\n ()", "isa_cross_project_example": true }, { "file_name": "Format.KeyShareEntry.fst", "name": "Format.KeyShareEntry.keyShareEntry_serializer", "original_source_type": "val keyShareEntry_serializer: LP.serializer keyShareEntry_parser", "source_type": "val keyShareEntry_serializer: LP.serializer keyShareEntry_parser", "source_definition": "let keyShareEntry_serializer =\n lemma_synth_keyShareEntry_is_injective ();\n lemma_synth_keyShareEntry_of_unsynth_keyShareEntry ();\n assert_norm (keyShareEntry_parser_kind' == keyShareEntry_parser_kind);\n LP.serialize_synth\n _\n synth_keyShareEntry\n (LP.serialize_nondep_then namedGroup_serializer\n (LP.serialize_bounded_vlbytes 1 65535))\n unsynth_keyShareEntry\n ()", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.KeyShareEntry.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 61, "start_col": 2, "end_line": 70, "end_col": 6 }, "file_context": "module Format.KeyShareEntry\n\nopen Parsers.NamedGroup\nopen Format.UncompressedPointRepresentation\n\nmodule B = FStar.Bytes\nmodule LP = LowParse.SLow\nmodule U32 = FStar.UInt32\n\n\n(* Parsers, validators *)\n\ninline_for_extraction\nlet synth_keyShareEntry (r:namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)): Tot keyShareEntry = { group=(fst r); key_exchange=(snd r) }\n\ninline_for_extraction\nlet unsynth_keyShareEntry (e:keyShareEntry): Tot (namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)) = e.group, e.key_exchange\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics'\"\nlet lemma_synth_keyShareEntry_is_injective () \n : Lemma (LP.synth_injective synth_keyShareEntry) \n = LP.synth_injective_intro synth_keyShareEntry\n#reset-options\n\ninline_for_extraction\nlet keyShareEntry_parser_kind' =\n LP.and_then_kind namedGroup_parser_kind (LP.parse_bounded_vlbytes_kind 1 65535)\n\nlet keyShareEntry_parser_kind_metadata = keyShareEntry_parser_kind'.LP.parser_kind_metadata\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics'\"\n\nlet keyShareEntry_parser =\n lemma_synth_keyShareEntry_is_injective ();\n assert_norm (keyShareEntry_parser_kind' == keyShareEntry_parser_kind);\n LP.parse_synth \n (namedGroup_parser `LP.nondep_then` (LP.parse_bounded_vlbytes 1 65535))\n synth_keyShareEntry\n\nlet keyShareEntry_parser32 =\n lemma_synth_keyShareEntry_is_injective ();\n assert_norm (keyShareEntry_parser_kind' == keyShareEntry_parser_kind);\n LP.parse32_synth\n _\n synth_keyShareEntry\n (fun x -> synth_keyShareEntry x)\n (LP.parse32_nondep_then namedGroup_parser32 (LP.parse32_bounded_vlbytes 1 1ul 65535 65535ul))\n ()\n \n\n(* Serialization *)\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics'\"\nlet lemma_synth_keyShareEntry_of_unsynth_keyShareEntry () \n : Lemma (LP.synth_inverse synth_keyShareEntry unsynth_keyShareEntry)\n = LP.synth_inverse_intro synth_keyShareEntry unsynth_keyShareEntry\n#reset-options\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics'\"", "dependencies": { "source_file": "Format.KeyShareEntry.fst", "checked_file": "Format.KeyShareEntry.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.NamedGroup.fsti.checked", "LowParse.Spec.Bytes.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.UncompressedPointRepresentation.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": false, "short_module": null, "full_module": "Format.UncompressedPointRepresentation" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Format.KeyShareEntry.keyShareEntry_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.NamedGroup.namedGroup_parser_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "FStar.Pervasives.Native.tuple2", "Parsers.NamedGroup.namedGroup", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "Format.KeyShareEntry.keyShareEntry", "LowParse.Spec.Combinators.nondep_then", "Parsers.NamedGroup.namedGroup_parser", "LowParse.Spec.Bytes.parse_bounded_vlbytes", "Format.KeyShareEntry.synth_keyShareEntry", "LowParse.Spec.Combinators.serialize_nondep_then", "Parsers.NamedGroup.namedGroup_serializer", "LowParse.Spec.Bytes.serialize_bounded_vlbytes", "Format.KeyShareEntry.unsynth_keyShareEntry", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "Format.KeyShareEntry.keyShareEntry_parser_kind'", "Format.KeyShareEntry.keyShareEntry_parser_kind", "Format.KeyShareEntry.lemma_synth_keyShareEntry_of_unsynth_keyShareEntry", "Format.KeyShareEntry.lemma_synth_keyShareEntry_is_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val keyShareEntry_serializer: LP.serializer keyShareEntry_parser\nlet keyShareEntry_serializer =", "completed_definiton": "lemma_synth_keyShareEntry_is_injective ();\nlemma_synth_keyShareEntry_of_unsynth_keyShareEntry ();\nassert_norm (keyShareEntry_parser_kind' == keyShareEntry_parser_kind);\nLP.serialize_synth _\n synth_keyShareEntry\n (LP.serialize_nondep_then namedGroup_serializer (LP.serialize_bounded_vlbytes 1 65535))\n unsynth_keyShareEntry\n ()", "isa_cross_project_example": true }, { "file_name": "Format.KeyShareEntry.fst", "name": "Format.KeyShareEntry.keyShareEntry_parser", "original_source_type": "val keyShareEntry_parser: LP.parser keyShareEntry_parser_kind keyShareEntry", "source_type": "val keyShareEntry_parser: LP.parser keyShareEntry_parser_kind keyShareEntry", "source_definition": "let keyShareEntry_parser =\n lemma_synth_keyShareEntry_is_injective ();\n assert_norm (keyShareEntry_parser_kind' == keyShareEntry_parser_kind);\n LP.parse_synth \n (namedGroup_parser `LP.nondep_then` (LP.parse_bounded_vlbytes 1 65535))\n synth_keyShareEntry", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.KeyShareEntry.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 34, "start_col": 2, "end_line": 38, "end_col": 23 }, "file_context": "module Format.KeyShareEntry\n\nopen Parsers.NamedGroup\nopen Format.UncompressedPointRepresentation\n\nmodule B = FStar.Bytes\nmodule LP = LowParse.SLow\nmodule U32 = FStar.UInt32\n\n\n(* Parsers, validators *)\n\ninline_for_extraction\nlet synth_keyShareEntry (r:namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)): Tot keyShareEntry = { group=(fst r); key_exchange=(snd r) }\n\ninline_for_extraction\nlet unsynth_keyShareEntry (e:keyShareEntry): Tot (namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)) = e.group, e.key_exchange\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics'\"\nlet lemma_synth_keyShareEntry_is_injective () \n : Lemma (LP.synth_injective synth_keyShareEntry) \n = LP.synth_injective_intro synth_keyShareEntry\n#reset-options\n\ninline_for_extraction\nlet keyShareEntry_parser_kind' =\n LP.and_then_kind namedGroup_parser_kind (LP.parse_bounded_vlbytes_kind 1 65535)\n\nlet keyShareEntry_parser_kind_metadata = keyShareEntry_parser_kind'.LP.parser_kind_metadata\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics'\"", "dependencies": { "source_file": "Format.KeyShareEntry.fst", "checked_file": "Format.KeyShareEntry.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.NamedGroup.fsti.checked", "LowParse.Spec.Bytes.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.UncompressedPointRepresentation.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": false, "short_module": null, "full_module": "Format.UncompressedPointRepresentation" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Format.KeyShareEntry.keyShareEntry_parser_kind\n Format.KeyShareEntry.keyShareEntry", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.NamedGroup.namedGroup_parser_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "FStar.Pervasives.Native.tuple2", "Parsers.NamedGroup.namedGroup", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "Format.KeyShareEntry.keyShareEntry", "LowParse.Spec.Combinators.nondep_then", "Parsers.NamedGroup.namedGroup_parser", "LowParse.Spec.Bytes.parse_bounded_vlbytes", "Format.KeyShareEntry.synth_keyShareEntry", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.Base.parser_kind", "Format.KeyShareEntry.keyShareEntry_parser_kind'", "Format.KeyShareEntry.keyShareEntry_parser_kind", "Format.KeyShareEntry.lemma_synth_keyShareEntry_is_injective" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val keyShareEntry_parser: LP.parser keyShareEntry_parser_kind keyShareEntry\nlet keyShareEntry_parser =", "completed_definiton": "lemma_synth_keyShareEntry_is_injective ();\nassert_norm (keyShareEntry_parser_kind' == keyShareEntry_parser_kind);\nLP.parse_synth (namedGroup_parser `LP.nondep_then` (LP.parse_bounded_vlbytes 1 65535))\n synth_keyShareEntry", "isa_cross_project_example": true }, { "file_name": "Format.KeyShareEntry.fst", "name": "Format.KeyShareEntry.keyShareEntry_serializer32", "original_source_type": "val keyShareEntry_serializer32: LP.serializer32 keyShareEntry_serializer", "source_type": "val keyShareEntry_serializer32: LP.serializer32 keyShareEntry_serializer", "source_definition": "let keyShareEntry_serializer32: LP.serializer32 keyShareEntry_serializer =\n lemma_synth_keyShareEntry_is_injective ();\n lemma_synth_keyShareEntry_of_unsynth_keyShareEntry ();\n assert_norm (keyShareEntry_parser_kind' == keyShareEntry_parser_kind);\n LP.serialize32_synth\n (LP.nondep_then namedGroup_parser (LP.parse_bounded_vlbytes 1 65535))\n synth_keyShareEntry\n (LP.serialize_nondep_then namedGroup_serializer\n (LP.serialize_bounded_vlbytes 1 65535))\n (LP.serialize32_nondep_then namedGroup_serializer32\n (LP.serialize32_bounded_vlbytes 1 65535))\n unsynth_keyShareEntry\n (fun x -> unsynth_keyShareEntry x)\n ()", "source": { "project_name": "mitls-fstar", "file_name": "src/tls/Format.KeyShareEntry.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 73, "start_col": 2, "end_line": 85, "end_col": 6 }, "file_context": "module Format.KeyShareEntry\n\nopen Parsers.NamedGroup\nopen Format.UncompressedPointRepresentation\n\nmodule B = FStar.Bytes\nmodule LP = LowParse.SLow\nmodule U32 = FStar.UInt32\n\n\n(* Parsers, validators *)\n\ninline_for_extraction\nlet synth_keyShareEntry (r:namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)): Tot keyShareEntry = { group=(fst r); key_exchange=(snd r) }\n\ninline_for_extraction\nlet unsynth_keyShareEntry (e:keyShareEntry): Tot (namedGroup * (LowParse.Spec.Bytes.parse_bounded_vlbytes_t 1 65535)) = e.group, e.key_exchange\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics'\"\nlet lemma_synth_keyShareEntry_is_injective () \n : Lemma (LP.synth_injective synth_keyShareEntry) \n = LP.synth_injective_intro synth_keyShareEntry\n#reset-options\n\ninline_for_extraction\nlet keyShareEntry_parser_kind' =\n LP.and_then_kind namedGroup_parser_kind (LP.parse_bounded_vlbytes_kind 1 65535)\n\nlet keyShareEntry_parser_kind_metadata = keyShareEntry_parser_kind'.LP.parser_kind_metadata\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics'\"\n\nlet keyShareEntry_parser =\n lemma_synth_keyShareEntry_is_injective ();\n assert_norm (keyShareEntry_parser_kind' == keyShareEntry_parser_kind);\n LP.parse_synth \n (namedGroup_parser `LP.nondep_then` (LP.parse_bounded_vlbytes 1 65535))\n synth_keyShareEntry\n\nlet keyShareEntry_parser32 =\n lemma_synth_keyShareEntry_is_injective ();\n assert_norm (keyShareEntry_parser_kind' == keyShareEntry_parser_kind);\n LP.parse32_synth\n _\n synth_keyShareEntry\n (fun x -> synth_keyShareEntry x)\n (LP.parse32_nondep_then namedGroup_parser32 (LP.parse32_bounded_vlbytes 1 1ul 65535 65535ul))\n ()\n \n\n(* Serialization *)\n\n#reset-options \"--using_facts_from '* -LowParse -FStar.Reflection -FStar.Tactics'\"\nlet lemma_synth_keyShareEntry_of_unsynth_keyShareEntry () \n : Lemma (LP.synth_inverse synth_keyShareEntry unsynth_keyShareEntry)\n = LP.synth_inverse_intro synth_keyShareEntry unsynth_keyShareEntry\n#reset-options\n\n#reset-options \"--using_facts_from '* -FStar.Reflection -FStar.Tactics'\"\nlet keyShareEntry_serializer =\n lemma_synth_keyShareEntry_is_injective ();\n lemma_synth_keyShareEntry_of_unsynth_keyShareEntry ();\n assert_norm (keyShareEntry_parser_kind' == keyShareEntry_parser_kind);\n LP.serialize_synth\n _\n synth_keyShareEntry\n (LP.serialize_nondep_then namedGroup_serializer\n (LP.serialize_bounded_vlbytes 1 65535))\n unsynth_keyShareEntry\n ()", "dependencies": { "source_file": "Format.KeyShareEntry.fst", "checked_file": "Format.KeyShareEntry.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Parsers.NamedGroup.fsti.checked", "LowParse.Spec.Bytes.fst.checked", "LowParse.SLow.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked", "Format.UncompressedPointRepresentation.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": false, "short_module": null, "full_module": "Format.UncompressedPointRepresentation" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "B", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers.NamedGroup" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "Format" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Format.KeyShareEntry.keyShareEntry_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_synth", "LowParse.Spec.Combinators.and_then_kind", "Parsers.NamedGroup.namedGroup_parser_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "FStar.Pervasives.Native.tuple2", "Parsers.NamedGroup.namedGroup", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "Format.KeyShareEntry.keyShareEntry", "LowParse.Spec.Combinators.nondep_then", "Parsers.NamedGroup.namedGroup_parser", "LowParse.Spec.Bytes.parse_bounded_vlbytes", "Format.KeyShareEntry.synth_keyShareEntry", "LowParse.Spec.Combinators.serialize_nondep_then", "Parsers.NamedGroup.namedGroup_serializer", "LowParse.Spec.Bytes.serialize_bounded_vlbytes", "LowParse.SLow.Combinators.serialize32_nondep_then", "Parsers.NamedGroup.namedGroup_serializer32", "LowParse.SLow.Bytes.serialize32_bounded_vlbytes", "Format.KeyShareEntry.unsynth_keyShareEntry", "Prims.eq2", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.Base.parser_kind", "Format.KeyShareEntry.keyShareEntry_parser_kind'", "Format.KeyShareEntry.keyShareEntry_parser_kind", "Format.KeyShareEntry.lemma_synth_keyShareEntry_of_unsynth_keyShareEntry", "Format.KeyShareEntry.lemma_synth_keyShareEntry_is_injective", "LowParse.SLow.Base.serializer32", "Format.KeyShareEntry.keyShareEntry_parser", "Format.KeyShareEntry.keyShareEntry_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val keyShareEntry_serializer32: LP.serializer32 keyShareEntry_serializer\nlet keyShareEntry_serializer32:LP.serializer32 keyShareEntry_serializer =", "completed_definiton": "lemma_synth_keyShareEntry_is_injective ();\nlemma_synth_keyShareEntry_of_unsynth_keyShareEntry ();\nassert_norm (keyShareEntry_parser_kind' == keyShareEntry_parser_kind);\nLP.serialize32_synth (LP.nondep_then namedGroup_parser (LP.parse_bounded_vlbytes 1 65535))\n synth_keyShareEntry\n (LP.serialize_nondep_then namedGroup_serializer (LP.serialize_bounded_vlbytes 1 65535))\n (LP.serialize32_nondep_then namedGroup_serializer32 (LP.serialize32_bounded_vlbytes 1 65535))\n unsynth_keyShareEntry\n (fun x -> unsynth_keyShareEntry x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.cipherSuite_repr_jumper", "original_source_type": "", "source_type": "val cipherSuite_repr_jumper : LowParse.Low.Base.jumper LowParse.Spec.Int.parse_u16", "source_definition": "let cipherSuite_repr_jumper = LL.jump_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 105, "start_col": 62, "end_line": 105, "end_col": 73 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper LowParse.Spec.Int.parse_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.jump_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let cipherSuite_repr_jumper =", "completed_definiton": "LL.jump_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.cipherSuite_repr_reader", "original_source_type": "", "source_type": "val cipherSuite_repr_reader : LowParse.Low.Base.leaf_reader LowParse.Spec.Int.parse_u16", "source_definition": "let cipherSuite_repr_reader = LL.read_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 107, "start_col": 62, "end_line": 107, "end_col": 73 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader LowParse.Spec.Int.parse_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.read_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let cipherSuite_repr_reader =", "completed_definiton": "LL.read_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.cipherSuite_repr_serializer", "original_source_type": "", "source_type": "val cipherSuite_repr_serializer : LowParse.Spec.Base.serializer LowParse.Spec.Int.parse_u16", "source_definition": "let cipherSuite_repr_serializer = LPI.serialize_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 95, "start_col": 44, "end_line": 95, "end_col": 61 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer LowParse.Spec.Int.parse_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Int.serialize_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let cipherSuite_repr_serializer =", "completed_definiton": "LPI.serialize_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.cipherSuite_bytesize", "original_source_type": "val cipherSuite_bytesize (x:cipherSuite) : GTot nat", "source_type": "val cipherSuite_bytesize (x:cipherSuite) : GTot nat", "source_definition": "let cipherSuite_bytesize (x:cipherSuite) : GTot nat = Seq.length (cipherSuite_serializer x)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 163, "start_col": 54, "end_line": 163, "end_col": 91 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let cipherSuite_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let cipherSuite_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_cipherSuite (x:LP.maybe_enum_key cipherSuite_enum) : cipherSuite = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n Unknown_cipherSuite v\n\ninline_for_extraction let synth_cipherSuite_inv (x:cipherSuite) : LP.maybe_enum_key cipherSuite_enum = \n match x with\n | Unknown_cipherSuite y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : cipherSuite = x in\n [@inline_let] let _ : squash(not (Unknown_cipherSuite? x1) ==> LP.list_mem x1 (LP.list_map fst cipherSuite_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key cipherSuite_enum)\n\nlet lemma_synth_cipherSuite_inv' () : Lemma\n (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite)\n= LP.forall_maybe_enum_key cipherSuite_enum (fun x -> synth_cipherSuite_inv (synth_cipherSuite x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_cipherSuite_inj () : Lemma\n (LP.synth_injective synth_cipherSuite) = \n lemma_synth_cipherSuite_inv' ();\n LP.synth_inverse_synth_injective synth_cipherSuite synth_cipherSuite_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_cipherSuite_inv () : Lemma\n (LP.synth_inverse synth_cipherSuite synth_cipherSuite_inv) = allow_inversion cipherSuite; ()\n\n#pop-options\nnoextract let parse_maybe_cipherSuite_key : LP.parser _ (LP.maybe_enum_key cipherSuite_enum) =\n LP.parse_maybe_enum_key cipherSuite_repr_parser cipherSuite_enum\n\nnoextract let serialize_maybe_cipherSuite_key : LP.serializer parse_maybe_cipherSuite_key =\n LP.serialize_maybe_enum_key cipherSuite_repr_parser cipherSuite_repr_serializer cipherSuite_enum\n\nnoextract let cipherSuite_parser : LP.parser _ cipherSuite =\n lemma_synth_cipherSuite_inj ();\n parse_maybe_cipherSuite_key `LP.parse_synth` synth_cipherSuite\n\nnoextract let cipherSuite_serializer : LP.serializer cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LP.serialize_synth _ synth_cipherSuite serialize_maybe_cipherSuite_key synth_cipherSuite_inv ()", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.CipherSuite.cipherSuite -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Parsers.CipherSuite.cipherSuite", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Parsers.CipherSuite.cipherSuite_serializer", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val cipherSuite_bytesize (x:cipherSuite) : GTot nat\nlet cipherSuite_bytesize (x: cipherSuite) : GTot nat =", "completed_definiton": "Seq.length (cipherSuite_serializer x)", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.cipherSuite_repr_writer", "original_source_type": "", "source_type": "val cipherSuite_repr_writer : LowParse.Low.Base.leaf_writer_strong LowParse.Spec.Int.serialize_u16", "source_definition": "let cipherSuite_repr_writer = LL.write_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 109, "start_col": 62, "end_line": 109, "end_col": 74 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let cipherSuite_repr_reader = LL.read_u16", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong LowParse.Spec.Int.serialize_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.write_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let cipherSuite_repr_writer =", "completed_definiton": "LL.write_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.cipherSuite_repr_size32", "original_source_type": "", "source_type": "val cipherSuite_repr_size32 : LowParse.SLow.Base.size32 LowParse.Spec.Int.serialize_u16", "source_definition": "let cipherSuite_repr_size32 = LSZ.size32_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 101, "start_col": 62, "end_line": 101, "end_col": 76 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 LowParse.Spec.Int.serialize_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.size32_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let cipherSuite_repr_size32 =", "completed_definiton": "LSZ.size32_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.cipherSuite_repr_parser", "original_source_type": "", "source_type": "val cipherSuite_repr_parser : LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u16_kind FStar.UInt16.t", "source_definition": "let cipherSuite_repr_parser = LPI.parse_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 93, "start_col": 40, "end_line": 93, "end_col": 53 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u16_kind FStar.UInt16.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Int.parse_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let cipherSuite_repr_parser =", "completed_definiton": "LPI.parse_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.cipherSuite_repr_serializer32", "original_source_type": "", "source_type": "val cipherSuite_repr_serializer32 : LowParse.SLow.Base.serializer32 LowParse.Spec.Int.serialize_u16", "source_definition": "let cipherSuite_repr_serializer32 = LS.serialize32_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 99, "start_col": 68, "end_line": 99, "end_col": 86 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 LowParse.Spec.Int.serialize_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.serialize32_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let cipherSuite_repr_serializer32 =", "completed_definiton": "LS.serialize32_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.cipherSuite_repr_parser32", "original_source_type": "", "source_type": "val cipherSuite_repr_parser32 : LowParse.SLow.Base.parser32 LowParse.Spec.Int.parse_u16", "source_definition": "let cipherSuite_repr_parser32 = LS.parse32_u16", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 97, "start_col": 64, "end_line": 97, "end_col": 78 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 LowParse.Spec.Int.parse_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Int.parse32_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let cipherSuite_repr_parser32 =", "completed_definiton": "LS.parse32_u16", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.cipherSuite_repr_validator", "original_source_type": "", "source_type": "val cipherSuite_repr_validator : LowParse.Low.Base.validator LowParse.Spec.Int.parse_u16", "source_definition": "let cipherSuite_repr_validator = (LL.validate_u16 ())", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 103, "start_col": 65, "end_line": 103, "end_col": 85 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator LowParse.Spec.Int.parse_u16", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Int.validate_u16" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let cipherSuite_repr_validator =", "completed_definiton": "(LL.validate_u16 ())", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.cipherSuite_serializer", "original_source_type": "val cipherSuite_serializer: LP.serializer cipherSuite_parser", "source_type": "val cipherSuite_serializer: LP.serializer cipherSuite_parser", "source_definition": "let cipherSuite_serializer : LP.serializer cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LP.serialize_synth _ synth_cipherSuite serialize_maybe_cipherSuite_key synth_cipherSuite_inv ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 159, "start_col": 2, "end_line": 161, "end_col": 97 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let cipherSuite_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let cipherSuite_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_cipherSuite (x:LP.maybe_enum_key cipherSuite_enum) : cipherSuite = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n Unknown_cipherSuite v\n\ninline_for_extraction let synth_cipherSuite_inv (x:cipherSuite) : LP.maybe_enum_key cipherSuite_enum = \n match x with\n | Unknown_cipherSuite y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : cipherSuite = x in\n [@inline_let] let _ : squash(not (Unknown_cipherSuite? x1) ==> LP.list_mem x1 (LP.list_map fst cipherSuite_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key cipherSuite_enum)\n\nlet lemma_synth_cipherSuite_inv' () : Lemma\n (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite)\n= LP.forall_maybe_enum_key cipherSuite_enum (fun x -> synth_cipherSuite_inv (synth_cipherSuite x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_cipherSuite_inj () : Lemma\n (LP.synth_injective synth_cipherSuite) = \n lemma_synth_cipherSuite_inv' ();\n LP.synth_inverse_synth_injective synth_cipherSuite synth_cipherSuite_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_cipherSuite_inv () : Lemma\n (LP.synth_inverse synth_cipherSuite synth_cipherSuite_inv) = allow_inversion cipherSuite; ()\n\n#pop-options\nnoextract let parse_maybe_cipherSuite_key : LP.parser _ (LP.maybe_enum_key cipherSuite_enum) =\n LP.parse_maybe_enum_key cipherSuite_repr_parser cipherSuite_enum\n\nnoextract let serialize_maybe_cipherSuite_key : LP.serializer parse_maybe_cipherSuite_key =\n LP.serialize_maybe_enum_key cipherSuite_repr_parser cipherSuite_repr_serializer cipherSuite_enum\n\nnoextract let cipherSuite_parser : LP.parser _ cipherSuite =\n lemma_synth_cipherSuite_inj ();\n parse_maybe_cipherSuite_key `LP.parse_synth` synth_cipherSuite", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.CipherSuite.cipherSuite_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_synth", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.CipherSuite.cipherSuite", "FStar.UInt16.t", "Parsers.CipherSuite.cipherSuite_enum", "Parsers.CipherSuite.parse_maybe_cipherSuite_key", "Parsers.CipherSuite.synth_cipherSuite", "Parsers.CipherSuite.serialize_maybe_cipherSuite_key", "Parsers.CipherSuite.synth_cipherSuite_inv", "Prims.unit", "Parsers.CipherSuite.lemma_synth_cipherSuite_inv", "Parsers.CipherSuite.lemma_synth_cipherSuite_inj", "LowParse.Spec.Base.serializer", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.CipherSuite.cipherSuite_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val cipherSuite_serializer: LP.serializer cipherSuite_parser\nlet cipherSuite_serializer:LP.serializer cipherSuite_parser =", "completed_definiton": "lemma_synth_cipherSuite_inj ();\nlemma_synth_cipherSuite_inv ();\nLP.serialize_synth _ synth_cipherSuite serialize_maybe_cipherSuite_key synth_cipherSuite_inv ()", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.cipherSuite_parser", "original_source_type": "val cipherSuite_parser: LP.parser cipherSuite_parser_kind cipherSuite", "source_type": "val cipherSuite_parser: LP.parser cipherSuite_parser_kind cipherSuite", "source_definition": "let cipherSuite_parser : LP.parser _ cipherSuite =\n lemma_synth_cipherSuite_inj ();\n parse_maybe_cipherSuite_key `LP.parse_synth` synth_cipherSuite", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 155, "start_col": 2, "end_line": 156, "end_col": 64 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let cipherSuite_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let cipherSuite_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_cipherSuite (x:LP.maybe_enum_key cipherSuite_enum) : cipherSuite = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n Unknown_cipherSuite v\n\ninline_for_extraction let synth_cipherSuite_inv (x:cipherSuite) : LP.maybe_enum_key cipherSuite_enum = \n match x with\n | Unknown_cipherSuite y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : cipherSuite = x in\n [@inline_let] let _ : squash(not (Unknown_cipherSuite? x1) ==> LP.list_mem x1 (LP.list_map fst cipherSuite_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key cipherSuite_enum)\n\nlet lemma_synth_cipherSuite_inv' () : Lemma\n (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite)\n= LP.forall_maybe_enum_key cipherSuite_enum (fun x -> synth_cipherSuite_inv (synth_cipherSuite x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_cipherSuite_inj () : Lemma\n (LP.synth_injective synth_cipherSuite) = \n lemma_synth_cipherSuite_inv' ();\n LP.synth_inverse_synth_injective synth_cipherSuite synth_cipherSuite_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_cipherSuite_inv () : Lemma\n (LP.synth_inverse synth_cipherSuite synth_cipherSuite_inv) = allow_inversion cipherSuite; ()\n\n#pop-options\nnoextract let parse_maybe_cipherSuite_key : LP.parser _ (LP.maybe_enum_key cipherSuite_enum) =\n LP.parse_maybe_enum_key cipherSuite_repr_parser cipherSuite_enum\n\nnoextract let serialize_maybe_cipherSuite_key : LP.serializer parse_maybe_cipherSuite_key =\n LP.serialize_maybe_enum_key cipherSuite_repr_parser cipherSuite_repr_serializer cipherSuite_enum", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser Parsers.CipherSuite.cipherSuite_parser_kind\n Parsers.CipherSuite.cipherSuite", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.CipherSuite.cipherSuite", "FStar.UInt16.t", "Parsers.CipherSuite.cipherSuite_enum", "Parsers.CipherSuite.parse_maybe_cipherSuite_key", "Parsers.CipherSuite.synth_cipherSuite", "Prims.unit", "Parsers.CipherSuite.lemma_synth_cipherSuite_inj", "LowParse.Spec.Base.parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val cipherSuite_parser: LP.parser cipherSuite_parser_kind cipherSuite\nlet cipherSuite_parser:LP.parser _ cipherSuite =", "completed_definiton": "lemma_synth_cipherSuite_inj ();\nparse_maybe_cipherSuite_key `LP.parse_synth` synth_cipherSuite", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.cipherSuite_parser32", "original_source_type": "val cipherSuite_parser32: LS.parser32 cipherSuite_parser", "source_type": "val cipherSuite_parser32: LS.parser32 cipherSuite_parser", "source_definition": "let cipherSuite_parser32 : LS.parser32 cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n LS.parse32_synth _ synth_cipherSuite (fun x->synth_cipherSuite x) parse32_maybe_cipherSuite_key ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 171, "start_col": 2, "end_line": 172, "end_col": 100 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let cipherSuite_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let cipherSuite_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_cipherSuite (x:LP.maybe_enum_key cipherSuite_enum) : cipherSuite = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n Unknown_cipherSuite v\n\ninline_for_extraction let synth_cipherSuite_inv (x:cipherSuite) : LP.maybe_enum_key cipherSuite_enum = \n match x with\n | Unknown_cipherSuite y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : cipherSuite = x in\n [@inline_let] let _ : squash(not (Unknown_cipherSuite? x1) ==> LP.list_mem x1 (LP.list_map fst cipherSuite_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key cipherSuite_enum)\n\nlet lemma_synth_cipherSuite_inv' () : Lemma\n (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite)\n= LP.forall_maybe_enum_key cipherSuite_enum (fun x -> synth_cipherSuite_inv (synth_cipherSuite x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_cipherSuite_inj () : Lemma\n (LP.synth_injective synth_cipherSuite) = \n lemma_synth_cipherSuite_inv' ();\n LP.synth_inverse_synth_injective synth_cipherSuite synth_cipherSuite_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_cipherSuite_inv () : Lemma\n (LP.synth_inverse synth_cipherSuite synth_cipherSuite_inv) = allow_inversion cipherSuite; ()\n\n#pop-options\nnoextract let parse_maybe_cipherSuite_key : LP.parser _ (LP.maybe_enum_key cipherSuite_enum) =\n LP.parse_maybe_enum_key cipherSuite_repr_parser cipherSuite_enum\n\nnoextract let serialize_maybe_cipherSuite_key : LP.serializer parse_maybe_cipherSuite_key =\n LP.serialize_maybe_enum_key cipherSuite_repr_parser cipherSuite_repr_serializer cipherSuite_enum\n\nnoextract let cipherSuite_parser : LP.parser _ cipherSuite =\n lemma_synth_cipherSuite_inj ();\n parse_maybe_cipherSuite_key `LP.parse_synth` synth_cipherSuite\n\nnoextract let cipherSuite_serializer : LP.serializer cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LP.serialize_synth _ synth_cipherSuite serialize_maybe_cipherSuite_key synth_cipherSuite_inv ()\n\nlet cipherSuite_bytesize (x:cipherSuite) : GTot nat = Seq.length (cipherSuite_serializer x)\n\nlet cipherSuite_bytesize_eq x = ()\n\nlet parse32_maybe_cipherSuite_key : LS.parser32 parse_maybe_cipherSuite_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac cipherSuite_repr_parser32 cipherSuite_enum)", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.CipherSuite.cipherSuite_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_synth", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.CipherSuite.cipherSuite", "FStar.UInt16.t", "Parsers.CipherSuite.cipherSuite_enum", "Parsers.CipherSuite.parse_maybe_cipherSuite_key", "Parsers.CipherSuite.synth_cipherSuite", "Prims.eq2", "Parsers.CipherSuite.parse32_maybe_cipherSuite_key", "Prims.unit", "Parsers.CipherSuite.lemma_synth_cipherSuite_inj", "LowParse.SLow.Base.parser32", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.CipherSuite.cipherSuite_parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val cipherSuite_parser32: LS.parser32 cipherSuite_parser\nlet cipherSuite_parser32:LS.parser32 cipherSuite_parser =", "completed_definiton": "lemma_synth_cipherSuite_inj ();\nLS.parse32_synth _ synth_cipherSuite (fun x -> synth_cipherSuite x) parse32_maybe_cipherSuite_key ()", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.serialize_maybe_cipherSuite_key", "original_source_type": "val serialize_maybe_cipherSuite_key:LP.serializer parse_maybe_cipherSuite_key", "source_type": "val serialize_maybe_cipherSuite_key:LP.serializer parse_maybe_cipherSuite_key", "source_definition": "let serialize_maybe_cipherSuite_key : LP.serializer parse_maybe_cipherSuite_key =\n LP.serialize_maybe_enum_key cipherSuite_repr_parser cipherSuite_repr_serializer cipherSuite_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 152, "start_col": 2, "end_line": 152, "end_col": 98 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let cipherSuite_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let cipherSuite_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_cipherSuite (x:LP.maybe_enum_key cipherSuite_enum) : cipherSuite = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n Unknown_cipherSuite v\n\ninline_for_extraction let synth_cipherSuite_inv (x:cipherSuite) : LP.maybe_enum_key cipherSuite_enum = \n match x with\n | Unknown_cipherSuite y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : cipherSuite = x in\n [@inline_let] let _ : squash(not (Unknown_cipherSuite? x1) ==> LP.list_mem x1 (LP.list_map fst cipherSuite_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key cipherSuite_enum)\n\nlet lemma_synth_cipherSuite_inv' () : Lemma\n (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite)\n= LP.forall_maybe_enum_key cipherSuite_enum (fun x -> synth_cipherSuite_inv (synth_cipherSuite x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_cipherSuite_inj () : Lemma\n (LP.synth_injective synth_cipherSuite) = \n lemma_synth_cipherSuite_inv' ();\n LP.synth_inverse_synth_injective synth_cipherSuite synth_cipherSuite_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_cipherSuite_inv () : Lemma\n (LP.synth_inverse synth_cipherSuite synth_cipherSuite_inv) = allow_inversion cipherSuite; ()\n\n#pop-options\nnoextract let parse_maybe_cipherSuite_key : LP.parser _ (LP.maybe_enum_key cipherSuite_enum) =\n LP.parse_maybe_enum_key cipherSuite_repr_parser cipherSuite_enum", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer Parsers.CipherSuite.parse_maybe_cipherSuite_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.serialize_maybe_enum_key", "LowParse.Spec.Int.parse_u16_kind", "Parsers.CipherSuite.cipherSuite", "FStar.UInt16.t", "Parsers.CipherSuite.cipherSuite_repr_parser", "Parsers.CipherSuite.cipherSuite_repr_serializer", "Parsers.CipherSuite.cipherSuite_enum" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_maybe_cipherSuite_key:LP.serializer parse_maybe_cipherSuite_key\nlet serialize_maybe_cipherSuite_key:LP.serializer parse_maybe_cipherSuite_key =", "completed_definiton": "LP.serialize_maybe_enum_key cipherSuite_repr_parser cipherSuite_repr_serializer cipherSuite_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.cipherSuite_size32", "original_source_type": "val cipherSuite_size32: LSZ.size32 cipherSuite_serializer", "source_type": "val cipherSuite_size32: LSZ.size32 cipherSuite_serializer", "source_definition": "let cipherSuite_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond cipherSuite_serializer 2ul) in\n LSZ.size32_constant cipherSuite_serializer 2ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 184, "start_col": 2, "end_line": 185, "end_col": 51 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let cipherSuite_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let cipherSuite_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_cipherSuite (x:LP.maybe_enum_key cipherSuite_enum) : cipherSuite = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n Unknown_cipherSuite v\n\ninline_for_extraction let synth_cipherSuite_inv (x:cipherSuite) : LP.maybe_enum_key cipherSuite_enum = \n match x with\n | Unknown_cipherSuite y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : cipherSuite = x in\n [@inline_let] let _ : squash(not (Unknown_cipherSuite? x1) ==> LP.list_mem x1 (LP.list_map fst cipherSuite_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key cipherSuite_enum)\n\nlet lemma_synth_cipherSuite_inv' () : Lemma\n (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite)\n= LP.forall_maybe_enum_key cipherSuite_enum (fun x -> synth_cipherSuite_inv (synth_cipherSuite x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_cipherSuite_inj () : Lemma\n (LP.synth_injective synth_cipherSuite) = \n lemma_synth_cipherSuite_inv' ();\n LP.synth_inverse_synth_injective synth_cipherSuite synth_cipherSuite_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_cipherSuite_inv () : Lemma\n (LP.synth_inverse synth_cipherSuite synth_cipherSuite_inv) = allow_inversion cipherSuite; ()\n\n#pop-options\nnoextract let parse_maybe_cipherSuite_key : LP.parser _ (LP.maybe_enum_key cipherSuite_enum) =\n LP.parse_maybe_enum_key cipherSuite_repr_parser cipherSuite_enum\n\nnoextract let serialize_maybe_cipherSuite_key : LP.serializer parse_maybe_cipherSuite_key =\n LP.serialize_maybe_enum_key cipherSuite_repr_parser cipherSuite_repr_serializer cipherSuite_enum\n\nnoextract let cipherSuite_parser : LP.parser _ cipherSuite =\n lemma_synth_cipherSuite_inj ();\n parse_maybe_cipherSuite_key `LP.parse_synth` synth_cipherSuite\n\nnoextract let cipherSuite_serializer : LP.serializer cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LP.serialize_synth _ synth_cipherSuite serialize_maybe_cipherSuite_key synth_cipherSuite_inv ()\n\nlet cipherSuite_bytesize (x:cipherSuite) : GTot nat = Seq.length (cipherSuite_serializer x)\n\nlet cipherSuite_bytesize_eq x = ()\n\nlet parse32_maybe_cipherSuite_key : LS.parser32 parse_maybe_cipherSuite_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac cipherSuite_repr_parser32 cipherSuite_enum)\n\nlet cipherSuite_parser32 : LS.parser32 cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n LS.parse32_synth _ synth_cipherSuite (fun x->synth_cipherSuite x) parse32_maybe_cipherSuite_key ()\n\nlet serialize32_maybe_cipherSuite_key : LS.serializer32 serialize_maybe_cipherSuite_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n cipherSuite_repr_serializer32 cipherSuite_enum)\n\nlet cipherSuite_serializer32 : LS.serializer32 cipherSuite_serializer =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LS.serialize32_synth _ synth_cipherSuite _ serialize32_maybe_cipherSuite_key synth_cipherSuite_inv (fun x->synth_cipherSuite_inv x) ()", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.size32 Parsers.CipherSuite.cipherSuite_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Base.size32_constant", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.CipherSuite.cipherSuite", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.CipherSuite.cipherSuite_serializer", "FStar.UInt32.__uint_to_t", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.SLow.Base.size32_constant_precond" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val cipherSuite_size32: LSZ.size32 cipherSuite_serializer\nlet cipherSuite_size32 =", "completed_definiton": "[@@ inline_let ]let _ = assert_norm (LSZ.size32_constant_precond cipherSuite_serializer 2ul) in\nLSZ.size32_constant cipherSuite_serializer 2ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.cipherSuite_serializer32", "original_source_type": "val cipherSuite_serializer32: LS.serializer32 cipherSuite_serializer", "source_type": "val cipherSuite_serializer32: LS.serializer32 cipherSuite_serializer", "source_definition": "let cipherSuite_serializer32 : LS.serializer32 cipherSuite_serializer =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LS.serialize32_synth _ synth_cipherSuite _ serialize32_maybe_cipherSuite_key synth_cipherSuite_inv (fun x->synth_cipherSuite_inv x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 179, "start_col": 2, "end_line": 181, "end_col": 136 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let cipherSuite_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let cipherSuite_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_cipherSuite (x:LP.maybe_enum_key cipherSuite_enum) : cipherSuite = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n Unknown_cipherSuite v\n\ninline_for_extraction let synth_cipherSuite_inv (x:cipherSuite) : LP.maybe_enum_key cipherSuite_enum = \n match x with\n | Unknown_cipherSuite y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : cipherSuite = x in\n [@inline_let] let _ : squash(not (Unknown_cipherSuite? x1) ==> LP.list_mem x1 (LP.list_map fst cipherSuite_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key cipherSuite_enum)\n\nlet lemma_synth_cipherSuite_inv' () : Lemma\n (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite)\n= LP.forall_maybe_enum_key cipherSuite_enum (fun x -> synth_cipherSuite_inv (synth_cipherSuite x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_cipherSuite_inj () : Lemma\n (LP.synth_injective synth_cipherSuite) = \n lemma_synth_cipherSuite_inv' ();\n LP.synth_inverse_synth_injective synth_cipherSuite synth_cipherSuite_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_cipherSuite_inv () : Lemma\n (LP.synth_inverse synth_cipherSuite synth_cipherSuite_inv) = allow_inversion cipherSuite; ()\n\n#pop-options\nnoextract let parse_maybe_cipherSuite_key : LP.parser _ (LP.maybe_enum_key cipherSuite_enum) =\n LP.parse_maybe_enum_key cipherSuite_repr_parser cipherSuite_enum\n\nnoextract let serialize_maybe_cipherSuite_key : LP.serializer parse_maybe_cipherSuite_key =\n LP.serialize_maybe_enum_key cipherSuite_repr_parser cipherSuite_repr_serializer cipherSuite_enum\n\nnoextract let cipherSuite_parser : LP.parser _ cipherSuite =\n lemma_synth_cipherSuite_inj ();\n parse_maybe_cipherSuite_key `LP.parse_synth` synth_cipherSuite\n\nnoextract let cipherSuite_serializer : LP.serializer cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LP.serialize_synth _ synth_cipherSuite serialize_maybe_cipherSuite_key synth_cipherSuite_inv ()\n\nlet cipherSuite_bytesize (x:cipherSuite) : GTot nat = Seq.length (cipherSuite_serializer x)\n\nlet cipherSuite_bytesize_eq x = ()\n\nlet parse32_maybe_cipherSuite_key : LS.parser32 parse_maybe_cipherSuite_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac cipherSuite_repr_parser32 cipherSuite_enum)\n\nlet cipherSuite_parser32 : LS.parser32 cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n LS.parse32_synth _ synth_cipherSuite (fun x->synth_cipherSuite x) parse32_maybe_cipherSuite_key ()\n\nlet serialize32_maybe_cipherSuite_key : LS.serializer32 serialize_maybe_cipherSuite_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n cipherSuite_repr_serializer32 cipherSuite_enum)", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.CipherSuite.cipherSuite_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_synth", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.CipherSuite.cipherSuite", "FStar.UInt16.t", "Parsers.CipherSuite.cipherSuite_enum", "Parsers.CipherSuite.parse_maybe_cipherSuite_key", "Parsers.CipherSuite.synth_cipherSuite", "Parsers.CipherSuite.serialize_maybe_cipherSuite_key", "Parsers.CipherSuite.serialize32_maybe_cipherSuite_key", "Parsers.CipherSuite.synth_cipherSuite_inv", "Prims.eq2", "Prims.unit", "Parsers.CipherSuite.lemma_synth_cipherSuite_inv", "Parsers.CipherSuite.lemma_synth_cipherSuite_inj", "LowParse.SLow.Base.serializer32", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.CipherSuite.cipherSuite_serializer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val cipherSuite_serializer32: LS.serializer32 cipherSuite_serializer\nlet cipherSuite_serializer32:LS.serializer32 cipherSuite_serializer =", "completed_definiton": "lemma_synth_cipherSuite_inj ();\nlemma_synth_cipherSuite_inv ();\nLS.serialize32_synth _\n synth_cipherSuite\n _\n serialize32_maybe_cipherSuite_key\n synth_cipherSuite_inv\n (fun x -> synth_cipherSuite_inv x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.read_maybe_cipherSuite_key", "original_source_type": "val read_maybe_cipherSuite_key:LL.leaf_reader parse_maybe_cipherSuite_key", "source_type": "val read_maybe_cipherSuite_key:LL.leaf_reader parse_maybe_cipherSuite_key", "source_definition": "let read_maybe_cipherSuite_key : LL.leaf_reader parse_maybe_cipherSuite_key =\n LL.mk_read_maybe_enum_key cipherSuite_repr_reader cipherSuite_enum", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 189, "start_col": 4, "end_line": 189, "end_col": 70 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let cipherSuite_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let cipherSuite_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_cipherSuite (x:LP.maybe_enum_key cipherSuite_enum) : cipherSuite = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n Unknown_cipherSuite v\n\ninline_for_extraction let synth_cipherSuite_inv (x:cipherSuite) : LP.maybe_enum_key cipherSuite_enum = \n match x with\n | Unknown_cipherSuite y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : cipherSuite = x in\n [@inline_let] let _ : squash(not (Unknown_cipherSuite? x1) ==> LP.list_mem x1 (LP.list_map fst cipherSuite_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key cipherSuite_enum)\n\nlet lemma_synth_cipherSuite_inv' () : Lemma\n (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite)\n= LP.forall_maybe_enum_key cipherSuite_enum (fun x -> synth_cipherSuite_inv (synth_cipherSuite x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_cipherSuite_inj () : Lemma\n (LP.synth_injective synth_cipherSuite) = \n lemma_synth_cipherSuite_inv' ();\n LP.synth_inverse_synth_injective synth_cipherSuite synth_cipherSuite_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_cipherSuite_inv () : Lemma\n (LP.synth_inverse synth_cipherSuite synth_cipherSuite_inv) = allow_inversion cipherSuite; ()\n\n#pop-options\nnoextract let parse_maybe_cipherSuite_key : LP.parser _ (LP.maybe_enum_key cipherSuite_enum) =\n LP.parse_maybe_enum_key cipherSuite_repr_parser cipherSuite_enum\n\nnoextract let serialize_maybe_cipherSuite_key : LP.serializer parse_maybe_cipherSuite_key =\n LP.serialize_maybe_enum_key cipherSuite_repr_parser cipherSuite_repr_serializer cipherSuite_enum\n\nnoextract let cipherSuite_parser : LP.parser _ cipherSuite =\n lemma_synth_cipherSuite_inj ();\n parse_maybe_cipherSuite_key `LP.parse_synth` synth_cipherSuite\n\nnoextract let cipherSuite_serializer : LP.serializer cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LP.serialize_synth _ synth_cipherSuite serialize_maybe_cipherSuite_key synth_cipherSuite_inv ()\n\nlet cipherSuite_bytesize (x:cipherSuite) : GTot nat = Seq.length (cipherSuite_serializer x)\n\nlet cipherSuite_bytesize_eq x = ()\n\nlet parse32_maybe_cipherSuite_key : LS.parser32 parse_maybe_cipherSuite_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac cipherSuite_repr_parser32 cipherSuite_enum)\n\nlet cipherSuite_parser32 : LS.parser32 cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n LS.parse32_synth _ synth_cipherSuite (fun x->synth_cipherSuite x) parse32_maybe_cipherSuite_key ()\n\nlet serialize32_maybe_cipherSuite_key : LS.serializer32 serialize_maybe_cipherSuite_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n cipherSuite_repr_serializer32 cipherSuite_enum)\n\nlet cipherSuite_serializer32 : LS.serializer32 cipherSuite_serializer =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LS.serialize32_synth _ synth_cipherSuite _ serialize32_maybe_cipherSuite_key synth_cipherSuite_inv (fun x->synth_cipherSuite_inv x) ()\n\nlet cipherSuite_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond cipherSuite_serializer 2ul) in\n LSZ.size32_constant cipherSuite_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader Parsers.CipherSuite.parse_maybe_cipherSuite_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.read_maybe_enum_key", "Parsers.CipherSuite.cipherSuite", "FStar.UInt16.t", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Int.parse_u16", "Parsers.CipherSuite.cipherSuite_repr_reader", "Prims.Cons", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.Mktuple2", "Parsers.CipherSuite.TLS_NULL_WITH_NULL_NULL", "FStar.UInt16.__uint_to_t", "Parsers.CipherSuite.TLS_RSA_WITH_NULL_MD5", "Parsers.CipherSuite.TLS_RSA_WITH_NULL_SHA", "Parsers.CipherSuite.TLS_RSA_WITH_RC4_128_MD5", "Parsers.CipherSuite.TLS_RSA_WITH_RC4_128_SHA", "Parsers.CipherSuite.TLS_RSA_WITH_3DES_EDE_CBC_SHA", "Parsers.CipherSuite.TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA", "Parsers.CipherSuite.TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA", "Parsers.CipherSuite.TLS_DH_anon_WITH_RC4_128_MD5", "Parsers.CipherSuite.TLS_DH_anon_WITH_3DES_EDE_CBC_SHA", "Parsers.CipherSuite.TLS_RSA_WITH_AES_128_CBC_SHA", "Parsers.CipherSuite.TLS_DHE_DSS_WITH_AES_128_CBC_SHA", "Parsers.CipherSuite.TLS_DHE_RSA_WITH_AES_128_CBC_SHA", "Parsers.CipherSuite.TLS_DH_anon_WITH_AES_128_CBC_SHA", "Parsers.CipherSuite.TLS_RSA_WITH_AES_256_CBC_SHA", "Parsers.CipherSuite.TLS_DHE_DSS_WITH_AES_256_CBC_SHA", "Parsers.CipherSuite.TLS_DHE_RSA_WITH_AES_256_CBC_SHA", "Parsers.CipherSuite.TLS_DH_anon_WITH_AES_256_CBC_SHA", "Parsers.CipherSuite.TLS_RSA_WITH_NULL_SHA256", "Parsers.CipherSuite.TLS_RSA_WITH_AES_128_CBC_SHA256", "Parsers.CipherSuite.TLS_RSA_WITH_AES_256_CBC_SHA256", "Parsers.CipherSuite.TLS_DHE_DSS_WITH_AES_128_CBC_SHA256", "Parsers.CipherSuite.TLS_DHE_RSA_WITH_AES_128_CBC_SHA256", "Parsers.CipherSuite.TLS_DHE_DSS_WITH_AES_256_CBC_SHA256", "Parsers.CipherSuite.TLS_DHE_RSA_WITH_AES_256_CBC_SHA256", "Parsers.CipherSuite.TLS_DH_anon_WITH_AES_128_CBC_SHA256", "Parsers.CipherSuite.TLS_DH_anon_WITH_AES_256_CBC_SHA256", "Parsers.CipherSuite.TLS_RSA_WITH_AES_128_GCM_SHA256", "Parsers.CipherSuite.TLS_RSA_WITH_AES_256_GCM_SHA384", "Parsers.CipherSuite.TLS_DHE_RSA_WITH_AES_128_GCM_SHA256", "Parsers.CipherSuite.TLS_DHE_RSA_WITH_AES_256_GCM_SHA384", "Parsers.CipherSuite.TLS_DH_RSA_WITH_AES_128_GCM_SHA256", "Parsers.CipherSuite.TLS_DH_RSA_WITH_AES_256_GCM_SHA384", "Parsers.CipherSuite.TLS_DHE_DSS_WITH_AES_128_GCM_SHA256", "Parsers.CipherSuite.TLS_DHE_DSS_WITH_AES_256_GCM_SHA384", "Parsers.CipherSuite.TLS_DH_DSS_WITH_AES_128_GCM_SHA256", "Parsers.CipherSuite.TLS_DH_DSS_WITH_AES_256_GCM_SHA384", "Parsers.CipherSuite.TLS_DH_anon_WITH_AES_128_GCM_SHA256", "Parsers.CipherSuite.TLS_DH_anon_WITH_AES_256_GCM_SHA384", "Parsers.CipherSuite.TLS_AES_128_GCM_SHA256", "Parsers.CipherSuite.TLS_AES_256_GCM_SHA384", "Parsers.CipherSuite.TLS_CHACHA20_POLY1305_SHA256", "Parsers.CipherSuite.TLS_AES_128_CCM_SHA256", "Parsers.CipherSuite.TLS_AES_128_CCM_8_SHA256", "Parsers.CipherSuite.TLS_ECDHE_RSA_WITH_RC4_128_SHA", "Parsers.CipherSuite.TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA", "Parsers.CipherSuite.TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA", "Parsers.CipherSuite.TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA", "Parsers.CipherSuite.TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256", "Parsers.CipherSuite.TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384", "Parsers.CipherSuite.TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256", "Parsers.CipherSuite.TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384", "Parsers.CipherSuite.TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256", "Parsers.CipherSuite.TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384", "Parsers.CipherSuite.TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256", "Parsers.CipherSuite.TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256", "Parsers.CipherSuite.TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256", "Parsers.CipherSuite.TLS_PSK_WITH_CHACHA20_POLY1305_SHA256", "Parsers.CipherSuite.TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256", "Parsers.CipherSuite.TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256", "Prims.Nil", "LowParse.Spec.Enum.maybe_enum_destr_t_intro", "LowParse.Spec.Enum.maybe_enum_key", "LowParse.Spec.Enum.maybe_enum_destr_cons", "LowParse.Spec.Enum.maybe_enum_destr_nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_maybe_cipherSuite_key:LL.leaf_reader parse_maybe_cipherSuite_key\nlet read_maybe_cipherSuite_key:LL.leaf_reader parse_maybe_cipherSuite_key =", "completed_definiton": "LL.mk_read_maybe_enum_key cipherSuite_repr_reader cipherSuite_enum", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.lemma_synth_cipherSuite_inj", "original_source_type": "val lemma_synth_cipherSuite_inj: Prims.unit -> Lemma (LP.synth_injective synth_cipherSuite)", "source_type": "val lemma_synth_cipherSuite_inj: Prims.unit -> Lemma (LP.synth_injective synth_cipherSuite)", "source_definition": "let lemma_synth_cipherSuite_inj () : Lemma\n (LP.synth_injective synth_cipherSuite) = \n lemma_synth_cipherSuite_inv' ();\n LP.synth_inverse_synth_injective synth_cipherSuite synth_cipherSuite_inv", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 140, "start_col": 2, "end_line": 141, "end_col": 74 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let cipherSuite_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let cipherSuite_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_cipherSuite (x:LP.maybe_enum_key cipherSuite_enum) : cipherSuite = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n Unknown_cipherSuite v\n\ninline_for_extraction let synth_cipherSuite_inv (x:cipherSuite) : LP.maybe_enum_key cipherSuite_enum = \n match x with\n | Unknown_cipherSuite y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : cipherSuite = x in\n [@inline_let] let _ : squash(not (Unknown_cipherSuite? x1) ==> LP.list_mem x1 (LP.list_map fst cipherSuite_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key cipherSuite_enum)\n\nlet lemma_synth_cipherSuite_inv' () : Lemma\n (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite)\n= LP.forall_maybe_enum_key cipherSuite_enum (fun x -> synth_cipherSuite_inv (synth_cipherSuite x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_cipherSuite_inj () : Lemma", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures LowParse.Spec.Combinators.synth_injective Parsers.CipherSuite.synth_cipherSuite)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "LowParse.Spec.Combinators.synth_inverse_synth_injective", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.CipherSuite.cipherSuite", "FStar.UInt16.t", "Parsers.CipherSuite.cipherSuite_enum", "Parsers.CipherSuite.synth_cipherSuite", "Parsers.CipherSuite.synth_cipherSuite_inv", "Parsers.CipherSuite.lemma_synth_cipherSuite_inv'", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_injective", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_synth_cipherSuite_inj: Prims.unit -> Lemma (LP.synth_injective synth_cipherSuite)\nlet lemma_synth_cipherSuite_inj () : Lemma (LP.synth_injective synth_cipherSuite) =", "completed_definiton": "lemma_synth_cipherSuite_inv' ();\nLP.synth_inverse_synth_injective synth_cipherSuite synth_cipherSuite_inv", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.lemma_synth_cipherSuite_inv", "original_source_type": "val lemma_synth_cipherSuite_inv: Prims.unit\n -> Lemma (LP.synth_inverse synth_cipherSuite synth_cipherSuite_inv)", "source_type": "val lemma_synth_cipherSuite_inv: Prims.unit\n -> Lemma (LP.synth_inverse synth_cipherSuite synth_cipherSuite_inv)", "source_definition": "let lemma_synth_cipherSuite_inv () : Lemma\n (LP.synth_inverse synth_cipherSuite synth_cipherSuite_inv) = allow_inversion cipherSuite; ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 145, "start_col": 63, "end_line": 145, "end_col": 94 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let cipherSuite_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let cipherSuite_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_cipherSuite (x:LP.maybe_enum_key cipherSuite_enum) : cipherSuite = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n Unknown_cipherSuite v\n\ninline_for_extraction let synth_cipherSuite_inv (x:cipherSuite) : LP.maybe_enum_key cipherSuite_enum = \n match x with\n | Unknown_cipherSuite y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : cipherSuite = x in\n [@inline_let] let _ : squash(not (Unknown_cipherSuite? x1) ==> LP.list_mem x1 (LP.list_map fst cipherSuite_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key cipherSuite_enum)\n\nlet lemma_synth_cipherSuite_inv' () : Lemma\n (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite)\n= LP.forall_maybe_enum_key cipherSuite_enum (fun x -> synth_cipherSuite_inv (synth_cipherSuite x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_cipherSuite_inj () : Lemma\n (LP.synth_injective synth_cipherSuite) = \n lemma_synth_cipherSuite_inv' ();\n LP.synth_inverse_synth_injective synth_cipherSuite synth_cipherSuite_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_inverse Parsers.CipherSuite.synth_cipherSuite\n Parsers.CipherSuite.synth_cipherSuite_inv)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.allow_inversion", "Parsers.CipherSuite.cipherSuite", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_inverse", "LowParse.Spec.Enum.maybe_enum_key", "FStar.UInt16.t", "Parsers.CipherSuite.cipherSuite_enum", "Parsers.CipherSuite.synth_cipherSuite", "Parsers.CipherSuite.synth_cipherSuite_inv", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_synth_cipherSuite_inv: Prims.unit\n -> Lemma (LP.synth_inverse synth_cipherSuite synth_cipherSuite_inv)\nlet lemma_synth_cipherSuite_inv ()\n : Lemma (LP.synth_inverse synth_cipherSuite synth_cipherSuite_inv) =", "completed_definiton": "allow_inversion cipherSuite;\n()", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.cipherSuite_enum", "original_source_type": "val cipherSuite_enum:LP.enum cipherSuite U16.t", "source_type": "val cipherSuite_enum:LP.enum cipherSuite U16.t", "source_definition": "let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 24, "start_col": 2, "end_line": 91, "end_col": 6 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Enum.enum Parsers.CipherSuite.cipherSuite FStar.UInt16.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.b2t", "FStar.List.Tot.Base.noRepeats", "FStar.UInt16.t", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "Parsers.CipherSuite.cipherSuite", "FStar.Pervasives.Native.snd", "FStar.Pervasives.Native.fst", "Prims.list", "Prims.Cons", "FStar.Pervasives.Native.Mktuple2", "Parsers.CipherSuite.TLS_NULL_WITH_NULL_NULL", "FStar.UInt16.__uint_to_t", "Parsers.CipherSuite.TLS_RSA_WITH_NULL_MD5", "Parsers.CipherSuite.TLS_RSA_WITH_NULL_SHA", "Parsers.CipherSuite.TLS_RSA_WITH_RC4_128_MD5", "Parsers.CipherSuite.TLS_RSA_WITH_RC4_128_SHA", "Parsers.CipherSuite.TLS_RSA_WITH_3DES_EDE_CBC_SHA", "Parsers.CipherSuite.TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA", "Parsers.CipherSuite.TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA", "Parsers.CipherSuite.TLS_DH_anon_WITH_RC4_128_MD5", "Parsers.CipherSuite.TLS_DH_anon_WITH_3DES_EDE_CBC_SHA", "Parsers.CipherSuite.TLS_RSA_WITH_AES_128_CBC_SHA", "Parsers.CipherSuite.TLS_DHE_DSS_WITH_AES_128_CBC_SHA", "Parsers.CipherSuite.TLS_DHE_RSA_WITH_AES_128_CBC_SHA", "Parsers.CipherSuite.TLS_DH_anon_WITH_AES_128_CBC_SHA", "Parsers.CipherSuite.TLS_RSA_WITH_AES_256_CBC_SHA", "Parsers.CipherSuite.TLS_DHE_DSS_WITH_AES_256_CBC_SHA", "Parsers.CipherSuite.TLS_DHE_RSA_WITH_AES_256_CBC_SHA", "Parsers.CipherSuite.TLS_DH_anon_WITH_AES_256_CBC_SHA", "Parsers.CipherSuite.TLS_RSA_WITH_NULL_SHA256", "Parsers.CipherSuite.TLS_RSA_WITH_AES_128_CBC_SHA256", "Parsers.CipherSuite.TLS_RSA_WITH_AES_256_CBC_SHA256", "Parsers.CipherSuite.TLS_DHE_DSS_WITH_AES_128_CBC_SHA256", "Parsers.CipherSuite.TLS_DHE_RSA_WITH_AES_128_CBC_SHA256", "Parsers.CipherSuite.TLS_DHE_DSS_WITH_AES_256_CBC_SHA256", "Parsers.CipherSuite.TLS_DHE_RSA_WITH_AES_256_CBC_SHA256", "Parsers.CipherSuite.TLS_DH_anon_WITH_AES_128_CBC_SHA256", "Parsers.CipherSuite.TLS_DH_anon_WITH_AES_256_CBC_SHA256", "Parsers.CipherSuite.TLS_RSA_WITH_AES_128_GCM_SHA256", "Parsers.CipherSuite.TLS_RSA_WITH_AES_256_GCM_SHA384", "Parsers.CipherSuite.TLS_DHE_RSA_WITH_AES_128_GCM_SHA256", "Parsers.CipherSuite.TLS_DHE_RSA_WITH_AES_256_GCM_SHA384", "Parsers.CipherSuite.TLS_DH_RSA_WITH_AES_128_GCM_SHA256", "Parsers.CipherSuite.TLS_DH_RSA_WITH_AES_256_GCM_SHA384", "Parsers.CipherSuite.TLS_DHE_DSS_WITH_AES_128_GCM_SHA256", "Parsers.CipherSuite.TLS_DHE_DSS_WITH_AES_256_GCM_SHA384", "Parsers.CipherSuite.TLS_DH_DSS_WITH_AES_128_GCM_SHA256", "Parsers.CipherSuite.TLS_DH_DSS_WITH_AES_256_GCM_SHA384", "Parsers.CipherSuite.TLS_DH_anon_WITH_AES_128_GCM_SHA256", "Parsers.CipherSuite.TLS_DH_anon_WITH_AES_256_GCM_SHA384", "Parsers.CipherSuite.TLS_AES_128_GCM_SHA256", "Parsers.CipherSuite.TLS_AES_256_GCM_SHA384", "Parsers.CipherSuite.TLS_CHACHA20_POLY1305_SHA256", "Parsers.CipherSuite.TLS_AES_128_CCM_SHA256", "Parsers.CipherSuite.TLS_AES_128_CCM_8_SHA256", "Parsers.CipherSuite.TLS_ECDHE_RSA_WITH_RC4_128_SHA", "Parsers.CipherSuite.TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA", "Parsers.CipherSuite.TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA", "Parsers.CipherSuite.TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA", "Parsers.CipherSuite.TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256", "Parsers.CipherSuite.TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384", "Parsers.CipherSuite.TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256", "Parsers.CipherSuite.TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384", "Parsers.CipherSuite.TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256", "Parsers.CipherSuite.TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384", "Parsers.CipherSuite.TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256", "Parsers.CipherSuite.TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256", "Parsers.CipherSuite.TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256", "Parsers.CipherSuite.TLS_PSK_WITH_CHACHA20_POLY1305_SHA256", "Parsers.CipherSuite.TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256", "Parsers.CipherSuite.TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val cipherSuite_enum:LP.enum cipherSuite U16.t\nlet cipherSuite_enum:LP.enum cipherSuite U16.t =", "completed_definiton": "[@@ inline_let ]let e =\n [\n TLS_NULL_WITH_NULL_NULL, 0us; TLS_RSA_WITH_NULL_MD5, 1us; TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us; TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us; TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us; TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us; TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us; TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us; TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us; TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us; TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us; TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us; TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us; TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us; TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us; TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us; TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us; TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us; TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us; TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us; TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us; TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us; TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us; TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us; TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us; TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us; TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us; TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us\n ]\nin\n[@@ inline_let ]let _ = assert_norm (L.noRepeats (LP.list_map fst e)) in\n[@@ inline_let ]let _ = assert_norm (L.noRepeats (LP.list_map snd e)) in\ne", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.synth_cipherSuite", "original_source_type": "val synth_cipherSuite (x: LP.maybe_enum_key cipherSuite_enum) : cipherSuite", "source_type": "val synth_cipherSuite (x: LP.maybe_enum_key cipherSuite_enum) : cipherSuite", "source_definition": "let synth_cipherSuite (x:LP.maybe_enum_key cipherSuite_enum) : cipherSuite = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n Unknown_cipherSuite v", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 112, "start_col": 2, "end_line": 117, "end_col": 25 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let cipherSuite_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let cipherSuite_repr_writer = LL.write_u16", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: LowParse.Spec.Enum.maybe_enum_key Parsers.CipherSuite.cipherSuite_enum\n -> Parsers.CipherSuite.cipherSuite", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Enum.maybe_enum_key", "Parsers.CipherSuite.cipherSuite", "FStar.UInt16.t", "Parsers.CipherSuite.cipherSuite_enum", "LowParse.Spec.Enum.enum_key", "LowParse.Spec.Enum.unknown_enum_repr", "Parsers.CipherSuite.Unknown_cipherSuite", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.bool", "LowParse.Spec.Enum.list_mem", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.snd", "Parsers.CipherSuite.known_cipherSuite_repr" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_cipherSuite (x: LP.maybe_enum_key cipherSuite_enum) : cipherSuite\nlet synth_cipherSuite (x: LP.maybe_enum_key cipherSuite_enum) : cipherSuite =", "completed_definiton": "match x with\n| LP.Known k -> k\n| LP.Unknown y ->\n [@@ inline_let ]let v:U16.t = y in\n [@@ inline_let ]let _ =\n assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v)\n in\n Unknown_cipherSuite v", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.lemma_synth_cipherSuite_inv'", "original_source_type": "val lemma_synth_cipherSuite_inv': Prims.unit\n -> Lemma (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite)", "source_type": "val lemma_synth_cipherSuite_inv': Prims.unit\n -> Lemma (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite)", "source_definition": "let lemma_synth_cipherSuite_inv' () : Lemma\n (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite)\n= LP.forall_maybe_enum_key cipherSuite_enum (fun x -> synth_cipherSuite_inv (synth_cipherSuite x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 134, "start_col": 2, "end_line": 136, "end_col": 52 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let cipherSuite_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let cipherSuite_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_cipherSuite (x:LP.maybe_enum_key cipherSuite_enum) : cipherSuite = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n Unknown_cipherSuite v\n\ninline_for_extraction let synth_cipherSuite_inv (x:cipherSuite) : LP.maybe_enum_key cipherSuite_enum = \n match x with\n | Unknown_cipherSuite y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : cipherSuite = x in\n [@inline_let] let _ : squash(not (Unknown_cipherSuite? x1) ==> LP.list_mem x1 (LP.list_map fst cipherSuite_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key cipherSuite_enum)\n\nlet lemma_synth_cipherSuite_inv' () : Lemma", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_inverse Parsers.CipherSuite.synth_cipherSuite_inv\n Parsers.CipherSuite.synth_cipherSuite)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "LowParse.Spec.Enum.forall_maybe_enum_key", "Parsers.CipherSuite.cipherSuite", "FStar.UInt16.t", "Parsers.CipherSuite.cipherSuite_enum", "LowParse.Spec.Enum.maybe_enum_key", "Prims.eq2", "Parsers.CipherSuite.synth_cipherSuite_inv", "Parsers.CipherSuite.synth_cipherSuite", "Prims.squash", "Prims.l_imp", "Prims.bool", "LowParse.Spec.Enum.list_mem", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.snd", "LowParse.Spec.Enum.Unknown", "Prims.l_True", "LowParse.Spec.Combinators.synth_inverse", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_synth_cipherSuite_inv': Prims.unit\n -> Lemma (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite)\nlet lemma_synth_cipherSuite_inv' ()\n : Lemma (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite) =", "completed_definiton": "LP.forall_maybe_enum_key cipherSuite_enum\n (fun x -> synth_cipherSuite_inv (synth_cipherSuite x) == x)\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.forall_maybe_enum_key_known_tac ())))\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.forall_maybe_enum_key_unknown_tac ())))", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.synth_cipherSuite_inv", "original_source_type": "val synth_cipherSuite_inv (x: cipherSuite) : LP.maybe_enum_key cipherSuite_enum", "source_type": "val synth_cipherSuite_inv (x: cipherSuite) : LP.maybe_enum_key cipherSuite_enum", "source_definition": "let synth_cipherSuite_inv (x:cipherSuite) : LP.maybe_enum_key cipherSuite_enum = \n match x with\n | Unknown_cipherSuite y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : cipherSuite = x in\n [@inline_let] let _ : squash(not (Unknown_cipherSuite? x1) ==> LP.list_mem x1 (LP.list_map fst cipherSuite_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key cipherSuite_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 120, "start_col": 2, "end_line": 130, "end_col": 49 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let cipherSuite_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let cipherSuite_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_cipherSuite (x:LP.maybe_enum_key cipherSuite_enum) : cipherSuite = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n Unknown_cipherSuite v", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.CipherSuite.cipherSuite\n -> LowParse.Spec.Enum.maybe_enum_key Parsers.CipherSuite.cipherSuite_enum", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.CipherSuite.cipherSuite", "FStar.UInt16.t", "Prims.b2t", "Prims.op_Negation", "Parsers.CipherSuite.known_cipherSuite_repr", "LowParse.Spec.Enum.Unknown", "Parsers.CipherSuite.cipherSuite_enum", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.bool", "LowParse.Spec.Enum.list_mem", "LowParse.Spec.Enum.list_map", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.snd", "LowParse.Spec.Enum.Known", "LowParse.Spec.Enum.enum_key", "Prims.squash", "Prims.l_imp", "Parsers.CipherSuite.uu___is_Unknown_cipherSuite", "FStar.Pervasives.Native.fst", "LowParse.Spec.Enum.maybe_enum_key" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_cipherSuite_inv (x: cipherSuite) : LP.maybe_enum_key cipherSuite_enum\nlet synth_cipherSuite_inv (x: cipherSuite) : LP.maybe_enum_key cipherSuite_enum =", "completed_definiton": "match x with\n| Unknown_cipherSuite y ->\n [@@ inline_let ]let v:U16.t = y in\n [@@ inline_let ]let _ =\n assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v)\n in\n LP.Unknown v\n| x ->\n [@@ inline_let ]let x1:cipherSuite = x in\n [@@ inline_let ]let _:squash (not (Unknown_cipherSuite? x1) ==>\n LP.list_mem x1 (LP.list_map fst cipherSuite_enum)) =\n FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.synth_maybe_enum_key_inv_unknown_tac x1))\n in\n LP.Known (x1 <: LP.enum_key cipherSuite_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.cipherSuite_reader", "original_source_type": "val cipherSuite_reader: LL.leaf_reader cipherSuite_parser", "source_type": "val cipherSuite_reader: LL.leaf_reader cipherSuite_parser", "source_definition": "let cipherSuite_reader =\n [@inline_let] let _ = lemma_synth_cipherSuite_inj () in\n LL.read_synth' parse_maybe_cipherSuite_key synth_cipherSuite read_maybe_cipherSuite_key ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 192, "start_col": 1, "end_line": 193, "end_col": 91 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let cipherSuite_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let cipherSuite_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_cipherSuite (x:LP.maybe_enum_key cipherSuite_enum) : cipherSuite = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n Unknown_cipherSuite v\n\ninline_for_extraction let synth_cipherSuite_inv (x:cipherSuite) : LP.maybe_enum_key cipherSuite_enum = \n match x with\n | Unknown_cipherSuite y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : cipherSuite = x in\n [@inline_let] let _ : squash(not (Unknown_cipherSuite? x1) ==> LP.list_mem x1 (LP.list_map fst cipherSuite_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key cipherSuite_enum)\n\nlet lemma_synth_cipherSuite_inv' () : Lemma\n (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite)\n= LP.forall_maybe_enum_key cipherSuite_enum (fun x -> synth_cipherSuite_inv (synth_cipherSuite x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_cipherSuite_inj () : Lemma\n (LP.synth_injective synth_cipherSuite) = \n lemma_synth_cipherSuite_inv' ();\n LP.synth_inverse_synth_injective synth_cipherSuite synth_cipherSuite_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_cipherSuite_inv () : Lemma\n (LP.synth_inverse synth_cipherSuite synth_cipherSuite_inv) = allow_inversion cipherSuite; ()\n\n#pop-options\nnoextract let parse_maybe_cipherSuite_key : LP.parser _ (LP.maybe_enum_key cipherSuite_enum) =\n LP.parse_maybe_enum_key cipherSuite_repr_parser cipherSuite_enum\n\nnoextract let serialize_maybe_cipherSuite_key : LP.serializer parse_maybe_cipherSuite_key =\n LP.serialize_maybe_enum_key cipherSuite_repr_parser cipherSuite_repr_serializer cipherSuite_enum\n\nnoextract let cipherSuite_parser : LP.parser _ cipherSuite =\n lemma_synth_cipherSuite_inj ();\n parse_maybe_cipherSuite_key `LP.parse_synth` synth_cipherSuite\n\nnoextract let cipherSuite_serializer : LP.serializer cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LP.serialize_synth _ synth_cipherSuite serialize_maybe_cipherSuite_key synth_cipherSuite_inv ()\n\nlet cipherSuite_bytesize (x:cipherSuite) : GTot nat = Seq.length (cipherSuite_serializer x)\n\nlet cipherSuite_bytesize_eq x = ()\n\nlet parse32_maybe_cipherSuite_key : LS.parser32 parse_maybe_cipherSuite_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac cipherSuite_repr_parser32 cipherSuite_enum)\n\nlet cipherSuite_parser32 : LS.parser32 cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n LS.parse32_synth _ synth_cipherSuite (fun x->synth_cipherSuite x) parse32_maybe_cipherSuite_key ()\n\nlet serialize32_maybe_cipherSuite_key : LS.serializer32 serialize_maybe_cipherSuite_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n cipherSuite_repr_serializer32 cipherSuite_enum)\n\nlet cipherSuite_serializer32 : LS.serializer32 cipherSuite_serializer =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LS.serialize32_synth _ synth_cipherSuite _ serialize32_maybe_cipherSuite_key synth_cipherSuite_inv (fun x->synth_cipherSuite_inv x) ()\n\nlet cipherSuite_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond cipherSuite_serializer 2ul) in\n LSZ.size32_constant cipherSuite_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_cipherSuite_key : LL.leaf_reader parse_maybe_cipherSuite_key =\n LL.mk_read_maybe_enum_key cipherSuite_repr_reader cipherSuite_enum", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader Parsers.CipherSuite.cipherSuite_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.read_synth'", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.CipherSuite.cipherSuite", "FStar.UInt16.t", "Parsers.CipherSuite.cipherSuite_enum", "Parsers.CipherSuite.parse_maybe_cipherSuite_key", "Parsers.CipherSuite.synth_cipherSuite", "Parsers.CipherSuite.read_maybe_cipherSuite_key", "Prims.unit", "Parsers.CipherSuite.lemma_synth_cipherSuite_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val cipherSuite_reader: LL.leaf_reader cipherSuite_parser\nlet cipherSuite_reader =", "completed_definiton": "[@@ inline_let ]let _ = lemma_synth_cipherSuite_inj () in\nLL.read_synth' parse_maybe_cipherSuite_key synth_cipherSuite read_maybe_cipherSuite_key ()", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.cipherSuite_writer", "original_source_type": "val cipherSuite_writer: LL.leaf_writer_strong cipherSuite_serializer", "source_type": "val cipherSuite_writer: LL.leaf_writer_strong cipherSuite_serializer", "source_definition": "let cipherSuite_writer =\n [@inline_let] let _ = lemma_synth_cipherSuite_inj (); lemma_synth_cipherSuite_inv () in\n LL.write_synth write_maybe_cipherSuite_key synth_cipherSuite synth_cipherSuite_inv (fun x -> synth_cipherSuite_inv x) ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 202, "start_col": 2, "end_line": 203, "end_col": 122 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let cipherSuite_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let cipherSuite_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_cipherSuite (x:LP.maybe_enum_key cipherSuite_enum) : cipherSuite = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n Unknown_cipherSuite v\n\ninline_for_extraction let synth_cipherSuite_inv (x:cipherSuite) : LP.maybe_enum_key cipherSuite_enum = \n match x with\n | Unknown_cipherSuite y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : cipherSuite = x in\n [@inline_let] let _ : squash(not (Unknown_cipherSuite? x1) ==> LP.list_mem x1 (LP.list_map fst cipherSuite_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key cipherSuite_enum)\n\nlet lemma_synth_cipherSuite_inv' () : Lemma\n (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite)\n= LP.forall_maybe_enum_key cipherSuite_enum (fun x -> synth_cipherSuite_inv (synth_cipherSuite x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_cipherSuite_inj () : Lemma\n (LP.synth_injective synth_cipherSuite) = \n lemma_synth_cipherSuite_inv' ();\n LP.synth_inverse_synth_injective synth_cipherSuite synth_cipherSuite_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_cipherSuite_inv () : Lemma\n (LP.synth_inverse synth_cipherSuite synth_cipherSuite_inv) = allow_inversion cipherSuite; ()\n\n#pop-options\nnoextract let parse_maybe_cipherSuite_key : LP.parser _ (LP.maybe_enum_key cipherSuite_enum) =\n LP.parse_maybe_enum_key cipherSuite_repr_parser cipherSuite_enum\n\nnoextract let serialize_maybe_cipherSuite_key : LP.serializer parse_maybe_cipherSuite_key =\n LP.serialize_maybe_enum_key cipherSuite_repr_parser cipherSuite_repr_serializer cipherSuite_enum\n\nnoextract let cipherSuite_parser : LP.parser _ cipherSuite =\n lemma_synth_cipherSuite_inj ();\n parse_maybe_cipherSuite_key `LP.parse_synth` synth_cipherSuite\n\nnoextract let cipherSuite_serializer : LP.serializer cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LP.serialize_synth _ synth_cipherSuite serialize_maybe_cipherSuite_key synth_cipherSuite_inv ()\n\nlet cipherSuite_bytesize (x:cipherSuite) : GTot nat = Seq.length (cipherSuite_serializer x)\n\nlet cipherSuite_bytesize_eq x = ()\n\nlet parse32_maybe_cipherSuite_key : LS.parser32 parse_maybe_cipherSuite_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac cipherSuite_repr_parser32 cipherSuite_enum)\n\nlet cipherSuite_parser32 : LS.parser32 cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n LS.parse32_synth _ synth_cipherSuite (fun x->synth_cipherSuite x) parse32_maybe_cipherSuite_key ()\n\nlet serialize32_maybe_cipherSuite_key : LS.serializer32 serialize_maybe_cipherSuite_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n cipherSuite_repr_serializer32 cipherSuite_enum)\n\nlet cipherSuite_serializer32 : LS.serializer32 cipherSuite_serializer =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LS.serialize32_synth _ synth_cipherSuite _ serialize32_maybe_cipherSuite_key synth_cipherSuite_inv (fun x->synth_cipherSuite_inv x) ()\n\nlet cipherSuite_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond cipherSuite_serializer 2ul) in\n LSZ.size32_constant cipherSuite_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_cipherSuite_key : LL.leaf_reader parse_maybe_cipherSuite_key =\n LL.mk_read_maybe_enum_key cipherSuite_repr_reader cipherSuite_enum\n\nlet cipherSuite_reader =\n [@inline_let] let _ = lemma_synth_cipherSuite_inj () in\n LL.read_synth' parse_maybe_cipherSuite_key synth_cipherSuite read_maybe_cipherSuite_key ()\n\ninline_for_extraction let write_maybe_cipherSuite_key : LL.leaf_writer_strong serialize_maybe_cipherSuite_key =\n LL.write_maybe_enum_key cipherSuite_repr_writer cipherSuite_enum (_ by (LP.enum_repr_of_key_tac cipherSuite_enum))\n\ninline_for_extraction let lserialize_maybe_cipherSuite_key : LL.serializer32 serialize_maybe_cipherSuite_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_cipherSuite_key 2ul ()", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong Parsers.CipherSuite.cipherSuite_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.write_synth", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.CipherSuite.cipherSuite", "FStar.UInt16.t", "Parsers.CipherSuite.cipherSuite_enum", "Parsers.CipherSuite.parse_maybe_cipherSuite_key", "Parsers.CipherSuite.serialize_maybe_cipherSuite_key", "Parsers.CipherSuite.write_maybe_cipherSuite_key", "Parsers.CipherSuite.synth_cipherSuite", "Parsers.CipherSuite.synth_cipherSuite_inv", "Prims.eq2", "Prims.unit", "Parsers.CipherSuite.lemma_synth_cipherSuite_inv", "Parsers.CipherSuite.lemma_synth_cipherSuite_inj" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val cipherSuite_writer: LL.leaf_writer_strong cipherSuite_serializer\nlet cipherSuite_writer =", "completed_definiton": "[@@ inline_let ]let _ =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ()\nin\nLL.write_synth write_maybe_cipherSuite_key\n synth_cipherSuite\n synth_cipherSuite_inv\n (fun x -> synth_cipherSuite_inv x)\n ()", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.lserialize_maybe_cipherSuite_key", "original_source_type": "val lserialize_maybe_cipherSuite_key:LL.serializer32 serialize_maybe_cipherSuite_key", "source_type": "val lserialize_maybe_cipherSuite_key:LL.serializer32 serialize_maybe_cipherSuite_key", "source_definition": "let lserialize_maybe_cipherSuite_key : LL.serializer32 serialize_maybe_cipherSuite_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_cipherSuite_key 2ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 199, "start_col": 2, "end_line": 199, "end_col": 88 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let cipherSuite_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let cipherSuite_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_cipherSuite (x:LP.maybe_enum_key cipherSuite_enum) : cipherSuite = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n Unknown_cipherSuite v\n\ninline_for_extraction let synth_cipherSuite_inv (x:cipherSuite) : LP.maybe_enum_key cipherSuite_enum = \n match x with\n | Unknown_cipherSuite y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : cipherSuite = x in\n [@inline_let] let _ : squash(not (Unknown_cipherSuite? x1) ==> LP.list_mem x1 (LP.list_map fst cipherSuite_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key cipherSuite_enum)\n\nlet lemma_synth_cipherSuite_inv' () : Lemma\n (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite)\n= LP.forall_maybe_enum_key cipherSuite_enum (fun x -> synth_cipherSuite_inv (synth_cipherSuite x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_cipherSuite_inj () : Lemma\n (LP.synth_injective synth_cipherSuite) = \n lemma_synth_cipherSuite_inv' ();\n LP.synth_inverse_synth_injective synth_cipherSuite synth_cipherSuite_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_cipherSuite_inv () : Lemma\n (LP.synth_inverse synth_cipherSuite synth_cipherSuite_inv) = allow_inversion cipherSuite; ()\n\n#pop-options\nnoextract let parse_maybe_cipherSuite_key : LP.parser _ (LP.maybe_enum_key cipherSuite_enum) =\n LP.parse_maybe_enum_key cipherSuite_repr_parser cipherSuite_enum\n\nnoextract let serialize_maybe_cipherSuite_key : LP.serializer parse_maybe_cipherSuite_key =\n LP.serialize_maybe_enum_key cipherSuite_repr_parser cipherSuite_repr_serializer cipherSuite_enum\n\nnoextract let cipherSuite_parser : LP.parser _ cipherSuite =\n lemma_synth_cipherSuite_inj ();\n parse_maybe_cipherSuite_key `LP.parse_synth` synth_cipherSuite\n\nnoextract let cipherSuite_serializer : LP.serializer cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LP.serialize_synth _ synth_cipherSuite serialize_maybe_cipherSuite_key synth_cipherSuite_inv ()\n\nlet cipherSuite_bytesize (x:cipherSuite) : GTot nat = Seq.length (cipherSuite_serializer x)\n\nlet cipherSuite_bytesize_eq x = ()\n\nlet parse32_maybe_cipherSuite_key : LS.parser32 parse_maybe_cipherSuite_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac cipherSuite_repr_parser32 cipherSuite_enum)\n\nlet cipherSuite_parser32 : LS.parser32 cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n LS.parse32_synth _ synth_cipherSuite (fun x->synth_cipherSuite x) parse32_maybe_cipherSuite_key ()\n\nlet serialize32_maybe_cipherSuite_key : LS.serializer32 serialize_maybe_cipherSuite_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n cipherSuite_repr_serializer32 cipherSuite_enum)\n\nlet cipherSuite_serializer32 : LS.serializer32 cipherSuite_serializer =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LS.serialize32_synth _ synth_cipherSuite _ serialize32_maybe_cipherSuite_key synth_cipherSuite_inv (fun x->synth_cipherSuite_inv x) ()\n\nlet cipherSuite_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond cipherSuite_serializer 2ul) in\n LSZ.size32_constant cipherSuite_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_cipherSuite_key : LL.leaf_reader parse_maybe_cipherSuite_key =\n LL.mk_read_maybe_enum_key cipherSuite_repr_reader cipherSuite_enum\n\nlet cipherSuite_reader =\n [@inline_let] let _ = lemma_synth_cipherSuite_inj () in\n LL.read_synth' parse_maybe_cipherSuite_key synth_cipherSuite read_maybe_cipherSuite_key ()\n\ninline_for_extraction let write_maybe_cipherSuite_key : LL.leaf_writer_strong serialize_maybe_cipherSuite_key =\n LL.write_maybe_enum_key cipherSuite_repr_writer cipherSuite_enum (_ by (LP.enum_repr_of_key_tac cipherSuite_enum))", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 Parsers.CipherSuite.serialize_maybe_cipherSuite_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.serializer32_of_leaf_writer_strong_constant_size", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.CipherSuite.cipherSuite", "FStar.UInt16.t", "Parsers.CipherSuite.cipherSuite_enum", "Parsers.CipherSuite.parse_maybe_cipherSuite_key", "Parsers.CipherSuite.serialize_maybe_cipherSuite_key", "Parsers.CipherSuite.write_maybe_cipherSuite_key", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lserialize_maybe_cipherSuite_key:LL.serializer32 serialize_maybe_cipherSuite_key\nlet lserialize_maybe_cipherSuite_key:LL.serializer32 serialize_maybe_cipherSuite_key =", "completed_definiton": "LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_cipherSuite_key 2ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.cipherSuite_lserializer", "original_source_type": "val cipherSuite_lserializer: LL.serializer32 cipherSuite_serializer", "source_type": "val cipherSuite_lserializer: LL.serializer32 cipherSuite_serializer", "source_definition": "let cipherSuite_lserializer = LL.serializer32_of_leaf_writer_strong_constant_size cipherSuite_writer 2ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 205, "start_col": 30, "end_line": 205, "end_col": 107 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let cipherSuite_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let cipherSuite_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_cipherSuite (x:LP.maybe_enum_key cipherSuite_enum) : cipherSuite = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n Unknown_cipherSuite v\n\ninline_for_extraction let synth_cipherSuite_inv (x:cipherSuite) : LP.maybe_enum_key cipherSuite_enum = \n match x with\n | Unknown_cipherSuite y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : cipherSuite = x in\n [@inline_let] let _ : squash(not (Unknown_cipherSuite? x1) ==> LP.list_mem x1 (LP.list_map fst cipherSuite_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key cipherSuite_enum)\n\nlet lemma_synth_cipherSuite_inv' () : Lemma\n (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite)\n= LP.forall_maybe_enum_key cipherSuite_enum (fun x -> synth_cipherSuite_inv (synth_cipherSuite x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_cipherSuite_inj () : Lemma\n (LP.synth_injective synth_cipherSuite) = \n lemma_synth_cipherSuite_inv' ();\n LP.synth_inverse_synth_injective synth_cipherSuite synth_cipherSuite_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_cipherSuite_inv () : Lemma\n (LP.synth_inverse synth_cipherSuite synth_cipherSuite_inv) = allow_inversion cipherSuite; ()\n\n#pop-options\nnoextract let parse_maybe_cipherSuite_key : LP.parser _ (LP.maybe_enum_key cipherSuite_enum) =\n LP.parse_maybe_enum_key cipherSuite_repr_parser cipherSuite_enum\n\nnoextract let serialize_maybe_cipherSuite_key : LP.serializer parse_maybe_cipherSuite_key =\n LP.serialize_maybe_enum_key cipherSuite_repr_parser cipherSuite_repr_serializer cipherSuite_enum\n\nnoextract let cipherSuite_parser : LP.parser _ cipherSuite =\n lemma_synth_cipherSuite_inj ();\n parse_maybe_cipherSuite_key `LP.parse_synth` synth_cipherSuite\n\nnoextract let cipherSuite_serializer : LP.serializer cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LP.serialize_synth _ synth_cipherSuite serialize_maybe_cipherSuite_key synth_cipherSuite_inv ()\n\nlet cipherSuite_bytesize (x:cipherSuite) : GTot nat = Seq.length (cipherSuite_serializer x)\n\nlet cipherSuite_bytesize_eq x = ()\n\nlet parse32_maybe_cipherSuite_key : LS.parser32 parse_maybe_cipherSuite_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac cipherSuite_repr_parser32 cipherSuite_enum)\n\nlet cipherSuite_parser32 : LS.parser32 cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n LS.parse32_synth _ synth_cipherSuite (fun x->synth_cipherSuite x) parse32_maybe_cipherSuite_key ()\n\nlet serialize32_maybe_cipherSuite_key : LS.serializer32 serialize_maybe_cipherSuite_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n cipherSuite_repr_serializer32 cipherSuite_enum)\n\nlet cipherSuite_serializer32 : LS.serializer32 cipherSuite_serializer =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LS.serialize32_synth _ synth_cipherSuite _ serialize32_maybe_cipherSuite_key synth_cipherSuite_inv (fun x->synth_cipherSuite_inv x) ()\n\nlet cipherSuite_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond cipherSuite_serializer 2ul) in\n LSZ.size32_constant cipherSuite_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_cipherSuite_key : LL.leaf_reader parse_maybe_cipherSuite_key =\n LL.mk_read_maybe_enum_key cipherSuite_repr_reader cipherSuite_enum\n\nlet cipherSuite_reader =\n [@inline_let] let _ = lemma_synth_cipherSuite_inj () in\n LL.read_synth' parse_maybe_cipherSuite_key synth_cipherSuite read_maybe_cipherSuite_key ()\n\ninline_for_extraction let write_maybe_cipherSuite_key : LL.leaf_writer_strong serialize_maybe_cipherSuite_key =\n LL.write_maybe_enum_key cipherSuite_repr_writer cipherSuite_enum (_ by (LP.enum_repr_of_key_tac cipherSuite_enum))\n\ninline_for_extraction let lserialize_maybe_cipherSuite_key : LL.serializer32 serialize_maybe_cipherSuite_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_cipherSuite_key 2ul ()\n\nlet cipherSuite_writer =\n [@inline_let] let _ = lemma_synth_cipherSuite_inj (); lemma_synth_cipherSuite_inv () in\n LL.write_synth write_maybe_cipherSuite_key synth_cipherSuite synth_cipherSuite_inv (fun x -> synth_cipherSuite_inv x) ()", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 Parsers.CipherSuite.cipherSuite_serializer", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.serializer32_of_leaf_writer_strong_constant_size", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.CipherSuite.cipherSuite", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.CipherSuite.cipherSuite_serializer", "Parsers.CipherSuite.cipherSuite_writer", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val cipherSuite_lserializer: LL.serializer32 cipherSuite_serializer\nlet cipherSuite_lserializer =", "completed_definiton": "LL.serializer32_of_leaf_writer_strong_constant_size cipherSuite_writer 2ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.cipherSuite_bytesize_eqn", "original_source_type": "val cipherSuite_bytesize_eqn (x: cipherSuite) : Lemma (cipherSuite_bytesize x == 2) [SMTPat (cipherSuite_bytesize x)]", "source_type": "val cipherSuite_bytesize_eqn (x: cipherSuite) : Lemma (cipherSuite_bytesize x == 2) [SMTPat (cipherSuite_bytesize x)]", "source_definition": "let cipherSuite_bytesize_eqn x = cipherSuite_bytesize_eq x; assert (FStar.Seq.length (LP.serialize cipherSuite_serializer x) <= 2); assert (2 <= FStar.Seq.length (LP.serialize cipherSuite_serializer x))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 207, "start_col": 33, "end_line": 207, "end_col": 202 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let cipherSuite_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let cipherSuite_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_cipherSuite (x:LP.maybe_enum_key cipherSuite_enum) : cipherSuite = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n Unknown_cipherSuite v\n\ninline_for_extraction let synth_cipherSuite_inv (x:cipherSuite) : LP.maybe_enum_key cipherSuite_enum = \n match x with\n | Unknown_cipherSuite y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : cipherSuite = x in\n [@inline_let] let _ : squash(not (Unknown_cipherSuite? x1) ==> LP.list_mem x1 (LP.list_map fst cipherSuite_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key cipherSuite_enum)\n\nlet lemma_synth_cipherSuite_inv' () : Lemma\n (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite)\n= LP.forall_maybe_enum_key cipherSuite_enum (fun x -> synth_cipherSuite_inv (synth_cipherSuite x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_cipherSuite_inj () : Lemma\n (LP.synth_injective synth_cipherSuite) = \n lemma_synth_cipherSuite_inv' ();\n LP.synth_inverse_synth_injective synth_cipherSuite synth_cipherSuite_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_cipherSuite_inv () : Lemma\n (LP.synth_inverse synth_cipherSuite synth_cipherSuite_inv) = allow_inversion cipherSuite; ()\n\n#pop-options\nnoextract let parse_maybe_cipherSuite_key : LP.parser _ (LP.maybe_enum_key cipherSuite_enum) =\n LP.parse_maybe_enum_key cipherSuite_repr_parser cipherSuite_enum\n\nnoextract let serialize_maybe_cipherSuite_key : LP.serializer parse_maybe_cipherSuite_key =\n LP.serialize_maybe_enum_key cipherSuite_repr_parser cipherSuite_repr_serializer cipherSuite_enum\n\nnoextract let cipherSuite_parser : LP.parser _ cipherSuite =\n lemma_synth_cipherSuite_inj ();\n parse_maybe_cipherSuite_key `LP.parse_synth` synth_cipherSuite\n\nnoextract let cipherSuite_serializer : LP.serializer cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LP.serialize_synth _ synth_cipherSuite serialize_maybe_cipherSuite_key synth_cipherSuite_inv ()\n\nlet cipherSuite_bytesize (x:cipherSuite) : GTot nat = Seq.length (cipherSuite_serializer x)\n\nlet cipherSuite_bytesize_eq x = ()\n\nlet parse32_maybe_cipherSuite_key : LS.parser32 parse_maybe_cipherSuite_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac cipherSuite_repr_parser32 cipherSuite_enum)\n\nlet cipherSuite_parser32 : LS.parser32 cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n LS.parse32_synth _ synth_cipherSuite (fun x->synth_cipherSuite x) parse32_maybe_cipherSuite_key ()\n\nlet serialize32_maybe_cipherSuite_key : LS.serializer32 serialize_maybe_cipherSuite_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n cipherSuite_repr_serializer32 cipherSuite_enum)\n\nlet cipherSuite_serializer32 : LS.serializer32 cipherSuite_serializer =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LS.serialize32_synth _ synth_cipherSuite _ serialize32_maybe_cipherSuite_key synth_cipherSuite_inv (fun x->synth_cipherSuite_inv x) ()\n\nlet cipherSuite_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond cipherSuite_serializer 2ul) in\n LSZ.size32_constant cipherSuite_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_cipherSuite_key : LL.leaf_reader parse_maybe_cipherSuite_key =\n LL.mk_read_maybe_enum_key cipherSuite_repr_reader cipherSuite_enum\n\nlet cipherSuite_reader =\n [@inline_let] let _ = lemma_synth_cipherSuite_inj () in\n LL.read_synth' parse_maybe_cipherSuite_key synth_cipherSuite read_maybe_cipherSuite_key ()\n\ninline_for_extraction let write_maybe_cipherSuite_key : LL.leaf_writer_strong serialize_maybe_cipherSuite_key =\n LL.write_maybe_enum_key cipherSuite_repr_writer cipherSuite_enum (_ by (LP.enum_repr_of_key_tac cipherSuite_enum))\n\ninline_for_extraction let lserialize_maybe_cipherSuite_key : LL.serializer32 serialize_maybe_cipherSuite_key =\n LL.serializer32_of_leaf_writer_strong_constant_size write_maybe_cipherSuite_key 2ul ()\n\nlet cipherSuite_writer =\n [@inline_let] let _ = lemma_synth_cipherSuite_inj (); lemma_synth_cipherSuite_inv () in\n LL.write_synth write_maybe_cipherSuite_key synth_cipherSuite synth_cipherSuite_inv (fun x -> synth_cipherSuite_inv x) ()\n\nlet cipherSuite_lserializer = LL.serializer32_of_leaf_writer_strong_constant_size cipherSuite_writer 2ul ()", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Parsers.CipherSuite.cipherSuite\n -> FStar.Pervasives.Lemma (ensures Parsers.CipherSuite.cipherSuite_bytesize x == 2)\n [SMTPat (Parsers.CipherSuite.cipherSuite_bytesize x)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Parsers.CipherSuite.cipherSuite", "Prims._assert", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.CipherSuite.cipherSuite_parser", "Parsers.CipherSuite.cipherSuite_serializer", "Prims.unit", "Parsers.CipherSuite.cipherSuite_bytesize_eq" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val cipherSuite_bytesize_eqn (x: cipherSuite) : Lemma (cipherSuite_bytesize x == 2) [SMTPat (cipherSuite_bytesize x)]\nlet cipherSuite_bytesize_eqn x =", "completed_definiton": "cipherSuite_bytesize_eq x;\nassert (FStar.Seq.length (LP.serialize cipherSuite_serializer x) <= 2);\nassert (2 <= FStar.Seq.length (LP.serialize cipherSuite_serializer x))", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.parse32_maybe_cipherSuite_key", "original_source_type": "val parse32_maybe_cipherSuite_key:LS.parser32 parse_maybe_cipherSuite_key", "source_type": "val parse32_maybe_cipherSuite_key:LS.parser32 parse_maybe_cipherSuite_key", "source_definition": "let parse32_maybe_cipherSuite_key : LS.parser32 parse_maybe_cipherSuite_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac cipherSuite_repr_parser32 cipherSuite_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 168, "start_col": 2, "end_line": 168, "end_col": 106 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let cipherSuite_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let cipherSuite_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_cipherSuite (x:LP.maybe_enum_key cipherSuite_enum) : cipherSuite = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n Unknown_cipherSuite v\n\ninline_for_extraction let synth_cipherSuite_inv (x:cipherSuite) : LP.maybe_enum_key cipherSuite_enum = \n match x with\n | Unknown_cipherSuite y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : cipherSuite = x in\n [@inline_let] let _ : squash(not (Unknown_cipherSuite? x1) ==> LP.list_mem x1 (LP.list_map fst cipherSuite_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key cipherSuite_enum)\n\nlet lemma_synth_cipherSuite_inv' () : Lemma\n (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite)\n= LP.forall_maybe_enum_key cipherSuite_enum (fun x -> synth_cipherSuite_inv (synth_cipherSuite x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_cipherSuite_inj () : Lemma\n (LP.synth_injective synth_cipherSuite) = \n lemma_synth_cipherSuite_inv' ();\n LP.synth_inverse_synth_injective synth_cipherSuite synth_cipherSuite_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_cipherSuite_inv () : Lemma\n (LP.synth_inverse synth_cipherSuite synth_cipherSuite_inv) = allow_inversion cipherSuite; ()\n\n#pop-options\nnoextract let parse_maybe_cipherSuite_key : LP.parser _ (LP.maybe_enum_key cipherSuite_enum) =\n LP.parse_maybe_enum_key cipherSuite_repr_parser cipherSuite_enum\n\nnoextract let serialize_maybe_cipherSuite_key : LP.serializer parse_maybe_cipherSuite_key =\n LP.serialize_maybe_enum_key cipherSuite_repr_parser cipherSuite_repr_serializer cipherSuite_enum\n\nnoextract let cipherSuite_parser : LP.parser _ cipherSuite =\n lemma_synth_cipherSuite_inj ();\n parse_maybe_cipherSuite_key `LP.parse_synth` synth_cipherSuite\n\nnoextract let cipherSuite_serializer : LP.serializer cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LP.serialize_synth _ synth_cipherSuite serialize_maybe_cipherSuite_key synth_cipherSuite_inv ()\n\nlet cipherSuite_bytesize (x:cipherSuite) : GTot nat = Seq.length (cipherSuite_serializer x)\n\nlet cipherSuite_bytesize_eq x = ()", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 Parsers.CipherSuite.parse_maybe_cipherSuite_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Enum.parse32_maybe_enum_key_gen", "LowParse.Spec.Int.parse_u16_kind", "Parsers.CipherSuite.cipherSuite", "FStar.UInt16.t", "LowParse.Spec.Int.parse_u16", "Parsers.CipherSuite.cipherSuite_repr_parser32", "Parsers.CipherSuite.cipherSuite_enum", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.CipherSuite.parse_maybe_cipherSuite_key", "LowParse.Spec.Enum.maybe_enum_key_of_repr'_t_cons'", "LowParse.Spec.Enum.enum_tail'", "LowParse.Spec.Enum.maybe_enum_key_of_repr'_t_cons_nil'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse32_maybe_cipherSuite_key:LS.parser32 parse_maybe_cipherSuite_key\nlet parse32_maybe_cipherSuite_key:LS.parser32 parse_maybe_cipherSuite_key =", "completed_definiton": "FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac cipherSuite_repr_parser32\n cipherSuite_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.serialize32_maybe_cipherSuite_key", "original_source_type": "val serialize32_maybe_cipherSuite_key:LS.serializer32 serialize_maybe_cipherSuite_key", "source_type": "val serialize32_maybe_cipherSuite_key:LS.serializer32 serialize_maybe_cipherSuite_key", "source_definition": "let serialize32_maybe_cipherSuite_key : LS.serializer32 serialize_maybe_cipherSuite_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n cipherSuite_repr_serializer32 cipherSuite_enum)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 175, "start_col": 2, "end_line": 176, "end_col": 51 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let cipherSuite_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let cipherSuite_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_cipherSuite (x:LP.maybe_enum_key cipherSuite_enum) : cipherSuite = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n Unknown_cipherSuite v\n\ninline_for_extraction let synth_cipherSuite_inv (x:cipherSuite) : LP.maybe_enum_key cipherSuite_enum = \n match x with\n | Unknown_cipherSuite y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : cipherSuite = x in\n [@inline_let] let _ : squash(not (Unknown_cipherSuite? x1) ==> LP.list_mem x1 (LP.list_map fst cipherSuite_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key cipherSuite_enum)\n\nlet lemma_synth_cipherSuite_inv' () : Lemma\n (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite)\n= LP.forall_maybe_enum_key cipherSuite_enum (fun x -> synth_cipherSuite_inv (synth_cipherSuite x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_cipherSuite_inj () : Lemma\n (LP.synth_injective synth_cipherSuite) = \n lemma_synth_cipherSuite_inv' ();\n LP.synth_inverse_synth_injective synth_cipherSuite synth_cipherSuite_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_cipherSuite_inv () : Lemma\n (LP.synth_inverse synth_cipherSuite synth_cipherSuite_inv) = allow_inversion cipherSuite; ()\n\n#pop-options\nnoextract let parse_maybe_cipherSuite_key : LP.parser _ (LP.maybe_enum_key cipherSuite_enum) =\n LP.parse_maybe_enum_key cipherSuite_repr_parser cipherSuite_enum\n\nnoextract let serialize_maybe_cipherSuite_key : LP.serializer parse_maybe_cipherSuite_key =\n LP.serialize_maybe_enum_key cipherSuite_repr_parser cipherSuite_repr_serializer cipherSuite_enum\n\nnoextract let cipherSuite_parser : LP.parser _ cipherSuite =\n lemma_synth_cipherSuite_inj ();\n parse_maybe_cipherSuite_key `LP.parse_synth` synth_cipherSuite\n\nnoextract let cipherSuite_serializer : LP.serializer cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LP.serialize_synth _ synth_cipherSuite serialize_maybe_cipherSuite_key synth_cipherSuite_inv ()\n\nlet cipherSuite_bytesize (x:cipherSuite) : GTot nat = Seq.length (cipherSuite_serializer x)\n\nlet cipherSuite_bytesize_eq x = ()\n\nlet parse32_maybe_cipherSuite_key : LS.parser32 parse_maybe_cipherSuite_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac cipherSuite_repr_parser32 cipherSuite_enum)\n\nlet cipherSuite_parser32 : LS.parser32 cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n LS.parse32_synth _ synth_cipherSuite (fun x->synth_cipherSuite x) parse32_maybe_cipherSuite_key ()", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 Parsers.CipherSuite.serialize_maybe_cipherSuite_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Enum.serialize32_maybe_enum_key_gen", "LowParse.Spec.Int.parse_u16_kind", "Parsers.CipherSuite.cipherSuite", "FStar.UInt16.t", "LowParse.Spec.Int.parse_u16", "LowParse.Spec.Int.serialize_u16", "Parsers.CipherSuite.cipherSuite_repr_serializer32", "Parsers.CipherSuite.cipherSuite_enum", "LowParse.Spec.Enum.maybe_enum_key", "Parsers.CipherSuite.parse_maybe_cipherSuite_key", "Parsers.CipherSuite.serialize_maybe_cipherSuite_key", "LowParse.Spec.Enum.enum_repr_of_key_cons'", "LowParse.Spec.Enum.enum_tail'", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize32_maybe_cipherSuite_key:LS.serializer32 serialize_maybe_cipherSuite_key\nlet serialize32_maybe_cipherSuite_key:LS.serializer32 serialize_maybe_cipherSuite_key =", "completed_definiton": "FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac cipherSuite_repr_serializer32\n cipherSuite_enum)", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fst", "name": "Parsers.CipherSuite.write_maybe_cipherSuite_key", "original_source_type": "val write_maybe_cipherSuite_key:LL.leaf_writer_strong serialize_maybe_cipherSuite_key", "source_type": "val write_maybe_cipherSuite_key:LL.leaf_writer_strong serialize_maybe_cipherSuite_key", "source_definition": "let write_maybe_cipherSuite_key : LL.leaf_writer_strong serialize_maybe_cipherSuite_key =\n LL.write_maybe_enum_key cipherSuite_repr_writer cipherSuite_enum (_ by (LP.enum_repr_of_key_tac cipherSuite_enum))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fst", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 196, "start_col": 2, "end_line": 196, "end_col": 116 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec\nmodule LT = LowParse.TacLib\nmodule LS = LowParse.SLow\nmodule LSZ = LowParse.SLow\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n#reset-options \"--using_facts_from '* -FStar.Tactics -FStar.Reflection' --z3rlimit 16 --z3cliopt smt.arith.nl=false --max_fuel 2 --max_ifuel 2\"\n\n[@LT.Norm] inline_for_extraction let cipherSuite_enum : LP.enum cipherSuite U16.t =\n [@inline_let] let e = [\n TLS_NULL_WITH_NULL_NULL, 0us;\n TLS_RSA_WITH_NULL_MD5, 1us;\n TLS_RSA_WITH_NULL_SHA, 2us;\n TLS_RSA_WITH_RC4_128_MD5, 4us;\n TLS_RSA_WITH_RC4_128_SHA, 5us;\n TLS_RSA_WITH_3DES_EDE_CBC_SHA, 10us;\n TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, 19us;\n TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA, 22us;\n TLS_DH_anon_WITH_RC4_128_MD5, 24us;\n TLS_DH_anon_WITH_3DES_EDE_CBC_SHA, 27us;\n TLS_RSA_WITH_AES_128_CBC_SHA, 47us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA, 50us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA, 51us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA, 52us;\n TLS_RSA_WITH_AES_256_CBC_SHA, 53us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA, 56us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA, 57us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA, 58us;\n TLS_RSA_WITH_NULL_SHA256, 59us;\n TLS_RSA_WITH_AES_128_CBC_SHA256, 60us;\n TLS_RSA_WITH_AES_256_CBC_SHA256, 61us;\n TLS_DHE_DSS_WITH_AES_128_CBC_SHA256, 64us;\n TLS_DHE_RSA_WITH_AES_128_CBC_SHA256, 103us;\n TLS_DHE_DSS_WITH_AES_256_CBC_SHA256, 106us;\n TLS_DHE_RSA_WITH_AES_256_CBC_SHA256, 107us;\n TLS_DH_anon_WITH_AES_128_CBC_SHA256, 108us;\n TLS_DH_anon_WITH_AES_256_CBC_SHA256, 109us;\n TLS_RSA_WITH_AES_128_GCM_SHA256, 156us;\n TLS_RSA_WITH_AES_256_GCM_SHA384, 157us;\n TLS_DHE_RSA_WITH_AES_128_GCM_SHA256, 158us;\n TLS_DHE_RSA_WITH_AES_256_GCM_SHA384, 159us;\n TLS_DH_RSA_WITH_AES_128_GCM_SHA256, 160us;\n TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 161us;\n TLS_DHE_DSS_WITH_AES_128_GCM_SHA256, 162us;\n TLS_DHE_DSS_WITH_AES_256_GCM_SHA384, 163us;\n TLS_DH_DSS_WITH_AES_128_GCM_SHA256, 164us;\n TLS_DH_DSS_WITH_AES_256_GCM_SHA384, 165us;\n TLS_DH_anon_WITH_AES_128_GCM_SHA256, 166us;\n TLS_DH_anon_WITH_AES_256_GCM_SHA384, 167us;\n TLS_AES_128_GCM_SHA256, 4865us;\n TLS_AES_256_GCM_SHA384, 4866us;\n TLS_CHACHA20_POLY1305_SHA256, 4867us;\n TLS_AES_128_CCM_SHA256, 4868us;\n TLS_AES_128_CCM_8_SHA256, 4869us;\n TLS_ECDHE_RSA_WITH_RC4_128_SHA, 49169us;\n TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA, 49170us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA, 49171us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA, 49172us;\n TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256, 49191us;\n TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384, 49192us;\n TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256, 49195us;\n TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384, 49196us;\n TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, 49199us;\n TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, 49200us;\n TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52392us;\n TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256, 52393us;\n TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256, 52394us;\n TLS_PSK_WITH_CHACHA20_POLY1305_SHA256, 52395us;\n TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52396us;\n TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256, 52397us;\n ] in\n [@inline_let] let _ =\n assert_norm (L.noRepeats (LP.list_map fst e))\n in\n [@inline_let] let _ = \n assert_norm (L.noRepeats (LP.list_map snd e))\n in e\n\nnoextract let cipherSuite_repr_parser = LPI.parse_u16\n\nnoextract let cipherSuite_repr_serializer = LPI.serialize_u16\n\ninline_for_extraction noextract let cipherSuite_repr_parser32 = LS.parse32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_serializer32 = LS.serialize32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_size32 = LSZ.size32_u16\n\ninline_for_extraction noextract let cipherSuite_repr_validator = (LL.validate_u16 ())\n\ninline_for_extraction noextract let cipherSuite_repr_jumper = LL.jump_u16\n\ninline_for_extraction noextract let cipherSuite_repr_reader = LL.read_u16\n\ninline_for_extraction noextract let cipherSuite_repr_writer = LL.write_u16\n\ninline_for_extraction let synth_cipherSuite (x:LP.maybe_enum_key cipherSuite_enum) : cipherSuite = \n match x with\n | LP.Known k -> k\n | LP.Unknown y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n Unknown_cipherSuite v\n\ninline_for_extraction let synth_cipherSuite_inv (x:cipherSuite) : LP.maybe_enum_key cipherSuite_enum = \n match x with\n | Unknown_cipherSuite y ->\n [@inline_let] let v : U16.t = y in\n [@inline_let] let _ = assert_norm (LP.list_mem v (LP.list_map snd cipherSuite_enum) == known_cipherSuite_repr v) in\n LP.Unknown v\n | x ->\n [@inline_let] let x1 : cipherSuite = x in\n [@inline_let] let _ : squash(not (Unknown_cipherSuite? x1) ==> LP.list_mem x1 (LP.list_map fst cipherSuite_enum)) =\n _ by (LP.synth_maybe_enum_key_inv_unknown_tac x1)\n in\n LP.Known (x1 <: LP.enum_key cipherSuite_enum)\n\nlet lemma_synth_cipherSuite_inv' () : Lemma\n (LP.synth_inverse synth_cipherSuite_inv synth_cipherSuite)\n= LP.forall_maybe_enum_key cipherSuite_enum (fun x -> synth_cipherSuite_inv (synth_cipherSuite x) == x)\n (_ by (LP.forall_maybe_enum_key_known_tac ()))\n (_ by (LP.forall_maybe_enum_key_unknown_tac ()))\n\nlet lemma_synth_cipherSuite_inj () : Lemma\n (LP.synth_injective synth_cipherSuite) = \n lemma_synth_cipherSuite_inv' ();\n LP.synth_inverse_synth_injective synth_cipherSuite synth_cipherSuite_inv\n\n#push-options \"--max_ifuel 0 --initial_ifuel 0 --max_fuel 0 --max_ifuel 0\"\nlet lemma_synth_cipherSuite_inv () : Lemma\n (LP.synth_inverse synth_cipherSuite synth_cipherSuite_inv) = allow_inversion cipherSuite; ()\n\n#pop-options\nnoextract let parse_maybe_cipherSuite_key : LP.parser _ (LP.maybe_enum_key cipherSuite_enum) =\n LP.parse_maybe_enum_key cipherSuite_repr_parser cipherSuite_enum\n\nnoextract let serialize_maybe_cipherSuite_key : LP.serializer parse_maybe_cipherSuite_key =\n LP.serialize_maybe_enum_key cipherSuite_repr_parser cipherSuite_repr_serializer cipherSuite_enum\n\nnoextract let cipherSuite_parser : LP.parser _ cipherSuite =\n lemma_synth_cipherSuite_inj ();\n parse_maybe_cipherSuite_key `LP.parse_synth` synth_cipherSuite\n\nnoextract let cipherSuite_serializer : LP.serializer cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LP.serialize_synth _ synth_cipherSuite serialize_maybe_cipherSuite_key synth_cipherSuite_inv ()\n\nlet cipherSuite_bytesize (x:cipherSuite) : GTot nat = Seq.length (cipherSuite_serializer x)\n\nlet cipherSuite_bytesize_eq x = ()\n\nlet parse32_maybe_cipherSuite_key : LS.parser32 parse_maybe_cipherSuite_key =\n FStar.Tactics.synth_by_tactic (LS.parse32_maybe_enum_key_tac cipherSuite_repr_parser32 cipherSuite_enum)\n\nlet cipherSuite_parser32 : LS.parser32 cipherSuite_parser =\n lemma_synth_cipherSuite_inj ();\n LS.parse32_synth _ synth_cipherSuite (fun x->synth_cipherSuite x) parse32_maybe_cipherSuite_key ()\n\nlet serialize32_maybe_cipherSuite_key : LS.serializer32 serialize_maybe_cipherSuite_key =\n FStar.Tactics.synth_by_tactic (LS.serialize32_maybe_enum_key_tac\n cipherSuite_repr_serializer32 cipherSuite_enum)\n\nlet cipherSuite_serializer32 : LS.serializer32 cipherSuite_serializer =\n lemma_synth_cipherSuite_inj ();\n lemma_synth_cipherSuite_inv ();\n LS.serialize32_synth _ synth_cipherSuite _ serialize32_maybe_cipherSuite_key synth_cipherSuite_inv (fun x->synth_cipherSuite_inv x) ()\n\nlet cipherSuite_size32 =\n [@inline_let] let _ = assert_norm (LSZ.size32_constant_precond cipherSuite_serializer 2ul) in\n LSZ.size32_constant cipherSuite_serializer 2ul ()\n\n[@@ (LT.postprocess_with LT.pp_norm_tac) ]\ninline_for_extraction let read_maybe_cipherSuite_key : LL.leaf_reader parse_maybe_cipherSuite_key =\n LL.mk_read_maybe_enum_key cipherSuite_repr_reader cipherSuite_enum\n\nlet cipherSuite_reader =\n [@inline_let] let _ = lemma_synth_cipherSuite_inj () in\n LL.read_synth' parse_maybe_cipherSuite_key synth_cipherSuite read_maybe_cipherSuite_key ()", "dependencies": { "source_file": "Parsers.CipherSuite.fst", "checked_file": "Parsers.CipherSuite.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.Spec.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_writer_strong Parsers.CipherSuite.serialize_maybe_cipherSuite_key", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Enum.write_maybe_enum_key", "Parsers.CipherSuite.cipherSuite", "FStar.UInt16.t", "LowParse.Spec.Int.parse_u16_kind", "LowParse.Spec.Int.parse_u16", "LowParse.Spec.Int.serialize_u16", "Parsers.CipherSuite.cipherSuite_repr_writer", "Parsers.CipherSuite.cipherSuite_enum", "LowParse.Spec.Enum.enum_repr_of_key_cons'", "LowParse.Spec.Enum.enum_tail'", "LowParse.Spec.Enum.enum_repr_of_key_cons_nil'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val write_maybe_cipherSuite_key:LL.leaf_writer_strong serialize_maybe_cipherSuite_key\nlet write_maybe_cipherSuite_key:LL.leaf_writer_strong serialize_maybe_cipherSuite_key =", "completed_definiton": "LL.write_maybe_enum_key cipherSuite_repr_writer\n cipherSuite_enum\n (FStar.Tactics.Effect.synth_by_tactic (fun _ -> (LP.enum_repr_of_key_tac cipherSuite_enum)))", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fsti", "name": "Parsers.CipherSuite.cipherSuite_repr_eq", "original_source_type": "val cipherSuite_repr_eq (x1 x2: cipherSuite_repr) : Tot bool", "source_type": "val cipherSuite_repr_eq (x1 x2: cipherSuite_repr) : Tot bool", "source_definition": "let cipherSuite_repr_eq (x1 x2: cipherSuite_repr) : Tot bool = (x1 = x2)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 22, "start_col": 85, "end_line": 22, "end_col": 94 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST", "dependencies": { "source_file": "Parsers.CipherSuite.fsti", "checked_file": "Parsers.CipherSuite.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x1: Parsers.CipherSuite.cipherSuite_repr -> x2: Parsers.CipherSuite.cipherSuite_repr -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.CipherSuite.cipherSuite_repr", "Prims.op_Equality", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val cipherSuite_repr_eq (x1 x2: cipherSuite_repr) : Tot bool\nlet cipherSuite_repr_eq (x1 x2: cipherSuite_repr) : Tot bool =", "completed_definiton": "(x1 = x2)", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fsti", "name": "Parsers.CipherSuite.cipherSuite_repr", "original_source_type": "", "source_type": "val cipherSuite_repr : Prims.eqtype", "source_definition": "let cipherSuite_repr = U16.t", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 21, "start_col": 23, "end_line": 21, "end_col": 28 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST", "dependencies": { "source_file": "Parsers.CipherSuite.fsti", "checked_file": "Parsers.CipherSuite.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.eqtype", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt16.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let cipherSuite_repr =", "completed_definiton": "U16.t", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fsti", "name": "Parsers.CipherSuite.cipherSuite_parser_kind", "original_source_type": "", "source_type": "val cipherSuite_parser_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let cipherSuite_parser_kind = LP.strong_parser_kind 2 2 (Some LP.ParserKindMetadataTotal)", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 151, "start_col": 62, "end_line": 151, "end_col": 121 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet cipherSuite_repr = U16.t\ninline_for_extraction let cipherSuite_repr_eq (x1 x2: cipherSuite_repr) : Tot bool = (x1 = x2)\nlet known_cipherSuite_repr (v:U16.t) : bool = v `cipherSuite_repr_eq` 0us || (v `cipherSuite_repr_eq` 1us || (v `cipherSuite_repr_eq` 2us || (v `cipherSuite_repr_eq` 4us || (v `cipherSuite_repr_eq` 5us || (v `cipherSuite_repr_eq` 10us || (v `cipherSuite_repr_eq` 19us || (v `cipherSuite_repr_eq` 22us || (v `cipherSuite_repr_eq` 24us || (v `cipherSuite_repr_eq` 27us || (v `cipherSuite_repr_eq` 47us || (v `cipherSuite_repr_eq` 50us || (v `cipherSuite_repr_eq` 51us || (v `cipherSuite_repr_eq` 52us || (v `cipherSuite_repr_eq` 53us || (v `cipherSuite_repr_eq` 56us || (v `cipherSuite_repr_eq` 57us || (v `cipherSuite_repr_eq` 58us || (v `cipherSuite_repr_eq` 59us || (v `cipherSuite_repr_eq` 60us || (v `cipherSuite_repr_eq` 61us || (v `cipherSuite_repr_eq` 64us || (v `cipherSuite_repr_eq` 103us || (v `cipherSuite_repr_eq` 106us || (v `cipherSuite_repr_eq` 107us || (v `cipherSuite_repr_eq` 108us || (v `cipherSuite_repr_eq` 109us || (v `cipherSuite_repr_eq` 156us || (v `cipherSuite_repr_eq` 157us || (v `cipherSuite_repr_eq` 158us || (v `cipherSuite_repr_eq` 159us || (v `cipherSuite_repr_eq` 160us || (v `cipherSuite_repr_eq` 161us || (v `cipherSuite_repr_eq` 162us || (v `cipherSuite_repr_eq` 163us || (v `cipherSuite_repr_eq` 164us || (v `cipherSuite_repr_eq` 165us || (v `cipherSuite_repr_eq` 166us || (v `cipherSuite_repr_eq` 167us || (v `cipherSuite_repr_eq` 4865us || (v `cipherSuite_repr_eq` 4866us || (v `cipherSuite_repr_eq` 4867us || (v `cipherSuite_repr_eq` 4868us || (v `cipherSuite_repr_eq` 4869us || (v `cipherSuite_repr_eq` 49169us || (v `cipherSuite_repr_eq` 49170us || (v `cipherSuite_repr_eq` 49171us || (v `cipherSuite_repr_eq` 49172us || (v `cipherSuite_repr_eq` 49191us || (v `cipherSuite_repr_eq` 49192us || (v `cipherSuite_repr_eq` 49195us || (v `cipherSuite_repr_eq` 49196us || (v `cipherSuite_repr_eq` 49199us || (v `cipherSuite_repr_eq` 49200us || (v `cipherSuite_repr_eq` 52392us || (v `cipherSuite_repr_eq` 52393us || (v `cipherSuite_repr_eq` 52394us || (v `cipherSuite_repr_eq` 52395us || (v `cipherSuite_repr_eq` 52396us || (v `cipherSuite_repr_eq` 52397us || (false))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))\n\ntype cipherSuite =\n | TLS_NULL_WITH_NULL_NULL\n | TLS_RSA_WITH_NULL_MD5\n | TLS_RSA_WITH_NULL_SHA\n | TLS_RSA_WITH_RC4_128_MD5\n | TLS_RSA_WITH_RC4_128_SHA\n | TLS_RSA_WITH_3DES_EDE_CBC_SHA\n | TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA\n | TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA\n | TLS_DH_anon_WITH_RC4_128_MD5\n | TLS_DH_anon_WITH_3DES_EDE_CBC_SHA\n | TLS_RSA_WITH_AES_128_CBC_SHA\n | TLS_DHE_DSS_WITH_AES_128_CBC_SHA\n | TLS_DHE_RSA_WITH_AES_128_CBC_SHA\n | TLS_DH_anon_WITH_AES_128_CBC_SHA\n | TLS_RSA_WITH_AES_256_CBC_SHA\n | TLS_DHE_DSS_WITH_AES_256_CBC_SHA\n | TLS_DHE_RSA_WITH_AES_256_CBC_SHA\n | TLS_DH_anon_WITH_AES_256_CBC_SHA\n | TLS_RSA_WITH_NULL_SHA256\n | TLS_RSA_WITH_AES_128_CBC_SHA256\n | TLS_RSA_WITH_AES_256_CBC_SHA256\n | TLS_DHE_DSS_WITH_AES_128_CBC_SHA256\n | TLS_DHE_RSA_WITH_AES_128_CBC_SHA256\n | TLS_DHE_DSS_WITH_AES_256_CBC_SHA256\n | TLS_DHE_RSA_WITH_AES_256_CBC_SHA256\n | TLS_DH_anon_WITH_AES_128_CBC_SHA256\n | TLS_DH_anon_WITH_AES_256_CBC_SHA256\n | TLS_RSA_WITH_AES_128_GCM_SHA256\n | TLS_RSA_WITH_AES_256_GCM_SHA384\n | TLS_DHE_RSA_WITH_AES_128_GCM_SHA256\n | TLS_DHE_RSA_WITH_AES_256_GCM_SHA384\n | TLS_DH_RSA_WITH_AES_128_GCM_SHA256\n | TLS_DH_RSA_WITH_AES_256_GCM_SHA384\n | TLS_DHE_DSS_WITH_AES_128_GCM_SHA256\n | TLS_DHE_DSS_WITH_AES_256_GCM_SHA384\n | TLS_DH_DSS_WITH_AES_128_GCM_SHA256\n | TLS_DH_DSS_WITH_AES_256_GCM_SHA384\n | TLS_DH_anon_WITH_AES_128_GCM_SHA256\n | TLS_DH_anon_WITH_AES_256_GCM_SHA384\n | TLS_AES_128_GCM_SHA256\n | TLS_AES_256_GCM_SHA384\n | TLS_CHACHA20_POLY1305_SHA256\n | TLS_AES_128_CCM_SHA256\n | TLS_AES_128_CCM_8_SHA256\n | TLS_ECDHE_RSA_WITH_RC4_128_SHA\n | TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA\n | TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA\n | TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA\n | TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256\n | TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384\n | TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256\n | TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384\n | TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256\n | TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384\n | TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256\n | TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256\n | TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256\n | TLS_PSK_WITH_CHACHA20_POLY1305_SHA256\n | TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256\n | TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256\n | Unknown_cipherSuite of (v:U16.t{not (known_cipherSuite_repr v)})\n\nlet string_of_cipherSuite = function\n | TLS_NULL_WITH_NULL_NULL -> \"TLS_NULL_WITH_NULL_NULL\"\n | TLS_RSA_WITH_NULL_MD5 -> \"TLS_RSA_WITH_NULL_MD5\"\n | TLS_RSA_WITH_NULL_SHA -> \"TLS_RSA_WITH_NULL_SHA\"\n | TLS_RSA_WITH_RC4_128_MD5 -> \"TLS_RSA_WITH_RC4_128_MD5\"\n | TLS_RSA_WITH_RC4_128_SHA -> \"TLS_RSA_WITH_RC4_128_SHA\"\n | TLS_RSA_WITH_3DES_EDE_CBC_SHA -> \"TLS_RSA_WITH_3DES_EDE_CBC_SHA\"\n | TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA -> \"TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA\"\n | TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA -> \"TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA\"\n | TLS_DH_anon_WITH_RC4_128_MD5 -> \"TLS_DH_anon_WITH_RC4_128_MD5\"\n | TLS_DH_anon_WITH_3DES_EDE_CBC_SHA -> \"TLS_DH_anon_WITH_3DES_EDE_CBC_SHA\"\n | TLS_RSA_WITH_AES_128_CBC_SHA -> \"TLS_RSA_WITH_AES_128_CBC_SHA\"\n | TLS_DHE_DSS_WITH_AES_128_CBC_SHA -> \"TLS_DHE_DSS_WITH_AES_128_CBC_SHA\"\n | TLS_DHE_RSA_WITH_AES_128_CBC_SHA -> \"TLS_DHE_RSA_WITH_AES_128_CBC_SHA\"\n | TLS_DH_anon_WITH_AES_128_CBC_SHA -> \"TLS_DH_anon_WITH_AES_128_CBC_SHA\"\n | TLS_RSA_WITH_AES_256_CBC_SHA -> \"TLS_RSA_WITH_AES_256_CBC_SHA\"\n | TLS_DHE_DSS_WITH_AES_256_CBC_SHA -> \"TLS_DHE_DSS_WITH_AES_256_CBC_SHA\"\n | TLS_DHE_RSA_WITH_AES_256_CBC_SHA -> \"TLS_DHE_RSA_WITH_AES_256_CBC_SHA\"\n | TLS_DH_anon_WITH_AES_256_CBC_SHA -> \"TLS_DH_anon_WITH_AES_256_CBC_SHA\"\n | TLS_RSA_WITH_NULL_SHA256 -> \"TLS_RSA_WITH_NULL_SHA256\"\n | TLS_RSA_WITH_AES_128_CBC_SHA256 -> \"TLS_RSA_WITH_AES_128_CBC_SHA256\"\n | TLS_RSA_WITH_AES_256_CBC_SHA256 -> \"TLS_RSA_WITH_AES_256_CBC_SHA256\"\n | TLS_DHE_DSS_WITH_AES_128_CBC_SHA256 -> \"TLS_DHE_DSS_WITH_AES_128_CBC_SHA256\"\n | TLS_DHE_RSA_WITH_AES_128_CBC_SHA256 -> \"TLS_DHE_RSA_WITH_AES_128_CBC_SHA256\"\n | TLS_DHE_DSS_WITH_AES_256_CBC_SHA256 -> \"TLS_DHE_DSS_WITH_AES_256_CBC_SHA256\"\n | TLS_DHE_RSA_WITH_AES_256_CBC_SHA256 -> \"TLS_DHE_RSA_WITH_AES_256_CBC_SHA256\"\n | TLS_DH_anon_WITH_AES_128_CBC_SHA256 -> \"TLS_DH_anon_WITH_AES_128_CBC_SHA256\"\n | TLS_DH_anon_WITH_AES_256_CBC_SHA256 -> \"TLS_DH_anon_WITH_AES_256_CBC_SHA256\"\n | TLS_RSA_WITH_AES_128_GCM_SHA256 -> \"TLS_RSA_WITH_AES_128_GCM_SHA256\"\n | TLS_RSA_WITH_AES_256_GCM_SHA384 -> \"TLS_RSA_WITH_AES_256_GCM_SHA384\"\n | TLS_DHE_RSA_WITH_AES_128_GCM_SHA256 -> \"TLS_DHE_RSA_WITH_AES_128_GCM_SHA256\"\n | TLS_DHE_RSA_WITH_AES_256_GCM_SHA384 -> \"TLS_DHE_RSA_WITH_AES_256_GCM_SHA384\"\n | TLS_DH_RSA_WITH_AES_128_GCM_SHA256 -> \"TLS_DH_RSA_WITH_AES_128_GCM_SHA256\"\n | TLS_DH_RSA_WITH_AES_256_GCM_SHA384 -> \"TLS_DH_RSA_WITH_AES_256_GCM_SHA384\"\n | TLS_DHE_DSS_WITH_AES_128_GCM_SHA256 -> \"TLS_DHE_DSS_WITH_AES_128_GCM_SHA256\"\n | TLS_DHE_DSS_WITH_AES_256_GCM_SHA384 -> \"TLS_DHE_DSS_WITH_AES_256_GCM_SHA384\"\n | TLS_DH_DSS_WITH_AES_128_GCM_SHA256 -> \"TLS_DH_DSS_WITH_AES_128_GCM_SHA256\"\n | TLS_DH_DSS_WITH_AES_256_GCM_SHA384 -> \"TLS_DH_DSS_WITH_AES_256_GCM_SHA384\"\n | TLS_DH_anon_WITH_AES_128_GCM_SHA256 -> \"TLS_DH_anon_WITH_AES_128_GCM_SHA256\"\n | TLS_DH_anon_WITH_AES_256_GCM_SHA384 -> \"TLS_DH_anon_WITH_AES_256_GCM_SHA384\"\n | TLS_AES_128_GCM_SHA256 -> \"TLS_AES_128_GCM_SHA256\"\n | TLS_AES_256_GCM_SHA384 -> \"TLS_AES_256_GCM_SHA384\"\n | TLS_CHACHA20_POLY1305_SHA256 -> \"TLS_CHACHA20_POLY1305_SHA256\"\n | TLS_AES_128_CCM_SHA256 -> \"TLS_AES_128_CCM_SHA256\"\n | TLS_AES_128_CCM_8_SHA256 -> \"TLS_AES_128_CCM_8_SHA256\"\n | TLS_ECDHE_RSA_WITH_RC4_128_SHA -> \"TLS_ECDHE_RSA_WITH_RC4_128_SHA\"\n | TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA -> \"TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA\"\n | TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA -> \"TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA\"\n | TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA -> \"TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA\"\n | TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256 -> \"TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256\"\n | TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384 -> \"TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384\"\n | TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256 -> \"TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256\"\n | TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384 -> \"TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384\"\n | TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256 -> \"TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256\"\n | TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384 -> \"TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384\"\n | TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256\"\n | TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256\"\n | TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256\"\n | TLS_PSK_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_PSK_WITH_CHACHA20_POLY1305_SHA256\"\n | TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256\"\n | TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256\"\n | Unknown_cipherSuite _ -> \"Unknown_cipherSuite\"", "dependencies": { "source_file": "Parsers.CipherSuite.fsti", "checked_file": "Parsers.CipherSuite.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.Some", "LowParse.Spec.Base.parser_kind_metadata_some", "LowParse.Spec.Base.ParserKindMetadataTotal" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let cipherSuite_parser_kind =", "completed_definiton": "LP.strong_parser_kind 2 2 (Some LP.ParserKindMetadataTotal)", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fsti", "name": "Parsers.CipherSuite.known_cipherSuite_repr", "original_source_type": "val known_cipherSuite_repr (v: U16.t) : bool", "source_type": "val known_cipherSuite_repr (v: U16.t) : bool", "source_definition": "let known_cipherSuite_repr (v:U16.t) : bool = v `cipherSuite_repr_eq` 0us || (v `cipherSuite_repr_eq` 1us || (v `cipherSuite_repr_eq` 2us || (v `cipherSuite_repr_eq` 4us || (v `cipherSuite_repr_eq` 5us || (v `cipherSuite_repr_eq` 10us || (v `cipherSuite_repr_eq` 19us || (v `cipherSuite_repr_eq` 22us || (v `cipherSuite_repr_eq` 24us || (v `cipherSuite_repr_eq` 27us || (v `cipherSuite_repr_eq` 47us || (v `cipherSuite_repr_eq` 50us || (v `cipherSuite_repr_eq` 51us || (v `cipherSuite_repr_eq` 52us || (v `cipherSuite_repr_eq` 53us || (v `cipherSuite_repr_eq` 56us || (v `cipherSuite_repr_eq` 57us || (v `cipherSuite_repr_eq` 58us || (v `cipherSuite_repr_eq` 59us || (v `cipherSuite_repr_eq` 60us || (v `cipherSuite_repr_eq` 61us || (v `cipherSuite_repr_eq` 64us || (v `cipherSuite_repr_eq` 103us || (v `cipherSuite_repr_eq` 106us || (v `cipherSuite_repr_eq` 107us || (v `cipherSuite_repr_eq` 108us || (v `cipherSuite_repr_eq` 109us || (v `cipherSuite_repr_eq` 156us || (v `cipherSuite_repr_eq` 157us || (v `cipherSuite_repr_eq` 158us || (v `cipherSuite_repr_eq` 159us || (v `cipherSuite_repr_eq` 160us || (v `cipherSuite_repr_eq` 161us || (v `cipherSuite_repr_eq` 162us || (v `cipherSuite_repr_eq` 163us || (v `cipherSuite_repr_eq` 164us || (v `cipherSuite_repr_eq` 165us || (v `cipherSuite_repr_eq` 166us || (v `cipherSuite_repr_eq` 167us || (v `cipherSuite_repr_eq` 4865us || (v `cipherSuite_repr_eq` 4866us || (v `cipherSuite_repr_eq` 4867us || (v `cipherSuite_repr_eq` 4868us || (v `cipherSuite_repr_eq` 4869us || (v `cipherSuite_repr_eq` 49169us || (v `cipherSuite_repr_eq` 49170us || (v `cipherSuite_repr_eq` 49171us || (v `cipherSuite_repr_eq` 49172us || (v `cipherSuite_repr_eq` 49191us || (v `cipherSuite_repr_eq` 49192us || (v `cipherSuite_repr_eq` 49195us || (v `cipherSuite_repr_eq` 49196us || (v `cipherSuite_repr_eq` 49199us || (v `cipherSuite_repr_eq` 49200us || (v `cipherSuite_repr_eq` 52392us || (v `cipherSuite_repr_eq` 52393us || (v `cipherSuite_repr_eq` 52394us || (v `cipherSuite_repr_eq` 52395us || (v `cipherSuite_repr_eq` 52396us || (v `cipherSuite_repr_eq` 52397us || (false))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 23, "start_col": 46, "end_line": 23, "end_col": 2161 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet cipherSuite_repr = U16.t", "dependencies": { "source_file": "Parsers.CipherSuite.fsti", "checked_file": "Parsers.CipherSuite.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "v: FStar.UInt16.t -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt16.t", "Prims.op_BarBar", "Parsers.CipherSuite.cipherSuite_repr_eq", "FStar.UInt16.__uint_to_t", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val known_cipherSuite_repr (v: U16.t) : bool\nlet known_cipherSuite_repr (v: U16.t) : bool =", "completed_definiton": "v\n`cipherSuite_repr_eq`\n0us ||\n(v\n `cipherSuite_repr_eq`\n 1us ||\n (v\n `cipherSuite_repr_eq`\n 2us ||\n (v\n `cipherSuite_repr_eq`\n 4us ||\n (v\n `cipherSuite_repr_eq`\n 5us ||\n (v\n `cipherSuite_repr_eq`\n 10us ||\n (v\n `cipherSuite_repr_eq`\n 19us ||\n (v\n `cipherSuite_repr_eq`\n 22us ||\n (v\n `cipherSuite_repr_eq`\n 24us ||\n (v\n `cipherSuite_repr_eq`\n 27us ||\n (v\n `cipherSuite_repr_eq`\n 47us ||\n (v\n `cipherSuite_repr_eq`\n 50us ||\n (v\n `cipherSuite_repr_eq`\n 51us ||\n (v\n `cipherSuite_repr_eq`\n 52us ||\n (v\n `cipherSuite_repr_eq`\n 53us ||\n (v\n `cipherSuite_repr_eq`\n 56us ||\n (v\n `cipherSuite_repr_eq`\n 57us ||\n (v\n `cipherSuite_repr_eq`\n 58us ||\n (v\n `cipherSuite_repr_eq`\n 59us ||\n (v\n `cipherSuite_repr_eq`\n 60us ||\n (v\n `cipherSuite_repr_eq`\n 61us ||\n (v\n `cipherSuite_repr_eq`\n 64us ||\n (v\n `cipherSuite_repr_eq`\n 103us ||\n (v\n `cipherSuite_repr_eq`\n 106us ||\n (v\n `cipherSuite_repr_eq`\n 107us ||\n (v\n `cipherSuite_repr_eq`\n 108us ||\n (v\n `cipherSuite_repr_eq`\n 109us ||\n (v\n `cipherSuite_repr_eq`\n 156us ||\n (v\n `cipherSuite_repr_eq`\n 157us ||\n (v\n `cipherSuite_repr_eq`\n 158us ||\n (v\n `cipherSuite_repr_eq`\n 159us ||\n (v\n `cipherSuite_repr_eq`\n 160us ||\n (v\n `cipherSuite_repr_eq`\n 161us ||\n (v\n `cipherSuite_repr_eq`\n 162us ||\n (v\n `cipherSuite_repr_eq`\n 163us ||\n (v\n `cipherSuite_repr_eq`\n 164us ||\n (v\n `cipherSuite_repr_eq`\n 165us ||\n (v\n `cipherSuite_repr_eq`\n 166us ||\n (v\n `cipherSuite_repr_eq`\n 167us ||\n (v\n `cipherSuite_repr_eq`\n 4865us ||\n (v\n `cipherSuite_repr_eq`\n 4866us ||\n (v\n `cipherSuite_repr_eq`\n 4867us ||\n (v\n `cipherSuite_repr_eq`\n 4868us ||\n (v\n `cipherSuite_repr_eq`\n 4869us ||\n (v\n `cipherSuite_repr_eq`\n 49169us ||\n (v\n `cipherSuite_repr_eq`\n 49170us ||\n (v\n `cipherSuite_repr_eq`\n 49171us ||\n (v\n `cipherSuite_repr_eq`\n 49172us ||\n (v\n `cipherSuite_repr_eq`\n 49191us ||\n (v\n `cipherSuite_repr_eq`\n 49192us ||\n (v\n `cipherSuite_repr_eq`\n 49195us ||\n (\n v\n `cipherSuite_repr_eq`\n 49196us ||\n (\n v\n `cipherSuite_repr_eq`\n 49199us ||\n (\n v\n `cipherSuite_repr_eq`\n 49200us ||\n (\n v\n `cipherSuite_repr_eq`\n 52392us ||\n (\n v\n `cipherSuite_repr_eq`\n 52393us ||\n (\n v\n `cipherSuite_repr_eq`\n 52394us ||\n (\n v\n `cipherSuite_repr_eq`\n 52395us ||\n (\n v\n `cipherSuite_repr_eq`\n 52396us ||\n (\n v\n `cipherSuite_repr_eq`\n 52397us ||\n (\n false\n )\n )\n )\n )\n )\n )\n )\n )\n )\n )\n ))\n ))))))\n ))))))))))))))))))\n ))))))))))))))))))))))))", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fsti", "name": "Parsers.CipherSuite.cipherSuite_jumper", "original_source_type": "val cipherSuite_jumper:LL.jumper cipherSuite_parser", "source_type": "val cipherSuite_jumper:LL.jumper cipherSuite_parser", "source_definition": "let cipherSuite_jumper: LL.jumper cipherSuite_parser = LL.jump_constant_size cipherSuite_parser 2ul ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 169, "start_col": 55, "end_line": 169, "end_col": 102 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet cipherSuite_repr = U16.t\ninline_for_extraction let cipherSuite_repr_eq (x1 x2: cipherSuite_repr) : Tot bool = (x1 = x2)\nlet known_cipherSuite_repr (v:U16.t) : bool = v `cipherSuite_repr_eq` 0us || (v `cipherSuite_repr_eq` 1us || (v `cipherSuite_repr_eq` 2us || (v `cipherSuite_repr_eq` 4us || (v `cipherSuite_repr_eq` 5us || (v `cipherSuite_repr_eq` 10us || (v `cipherSuite_repr_eq` 19us || (v `cipherSuite_repr_eq` 22us || (v `cipherSuite_repr_eq` 24us || (v `cipherSuite_repr_eq` 27us || (v `cipherSuite_repr_eq` 47us || (v `cipherSuite_repr_eq` 50us || (v `cipherSuite_repr_eq` 51us || (v `cipherSuite_repr_eq` 52us || (v `cipherSuite_repr_eq` 53us || (v `cipherSuite_repr_eq` 56us || (v `cipherSuite_repr_eq` 57us || (v `cipherSuite_repr_eq` 58us || (v `cipherSuite_repr_eq` 59us || (v `cipherSuite_repr_eq` 60us || (v `cipherSuite_repr_eq` 61us || (v `cipherSuite_repr_eq` 64us || (v `cipherSuite_repr_eq` 103us || (v `cipherSuite_repr_eq` 106us || (v `cipherSuite_repr_eq` 107us || (v `cipherSuite_repr_eq` 108us || (v `cipherSuite_repr_eq` 109us || (v `cipherSuite_repr_eq` 156us || (v `cipherSuite_repr_eq` 157us || (v `cipherSuite_repr_eq` 158us || (v `cipherSuite_repr_eq` 159us || (v `cipherSuite_repr_eq` 160us || (v `cipherSuite_repr_eq` 161us || (v `cipherSuite_repr_eq` 162us || (v `cipherSuite_repr_eq` 163us || (v `cipherSuite_repr_eq` 164us || (v `cipherSuite_repr_eq` 165us || (v `cipherSuite_repr_eq` 166us || (v `cipherSuite_repr_eq` 167us || (v `cipherSuite_repr_eq` 4865us || (v `cipherSuite_repr_eq` 4866us || (v `cipherSuite_repr_eq` 4867us || (v `cipherSuite_repr_eq` 4868us || (v `cipherSuite_repr_eq` 4869us || (v `cipherSuite_repr_eq` 49169us || (v `cipherSuite_repr_eq` 49170us || (v `cipherSuite_repr_eq` 49171us || (v `cipherSuite_repr_eq` 49172us || (v `cipherSuite_repr_eq` 49191us || (v `cipherSuite_repr_eq` 49192us || (v `cipherSuite_repr_eq` 49195us || (v `cipherSuite_repr_eq` 49196us || (v `cipherSuite_repr_eq` 49199us || (v `cipherSuite_repr_eq` 49200us || (v `cipherSuite_repr_eq` 52392us || (v `cipherSuite_repr_eq` 52393us || (v `cipherSuite_repr_eq` 52394us || (v `cipherSuite_repr_eq` 52395us || (v `cipherSuite_repr_eq` 52396us || (v `cipherSuite_repr_eq` 52397us || (false))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))\n\ntype cipherSuite =\n | TLS_NULL_WITH_NULL_NULL\n | TLS_RSA_WITH_NULL_MD5\n | TLS_RSA_WITH_NULL_SHA\n | TLS_RSA_WITH_RC4_128_MD5\n | TLS_RSA_WITH_RC4_128_SHA\n | TLS_RSA_WITH_3DES_EDE_CBC_SHA\n | TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA\n | TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA\n | TLS_DH_anon_WITH_RC4_128_MD5\n | TLS_DH_anon_WITH_3DES_EDE_CBC_SHA\n | TLS_RSA_WITH_AES_128_CBC_SHA\n | TLS_DHE_DSS_WITH_AES_128_CBC_SHA\n | TLS_DHE_RSA_WITH_AES_128_CBC_SHA\n | TLS_DH_anon_WITH_AES_128_CBC_SHA\n | TLS_RSA_WITH_AES_256_CBC_SHA\n | TLS_DHE_DSS_WITH_AES_256_CBC_SHA\n | TLS_DHE_RSA_WITH_AES_256_CBC_SHA\n | TLS_DH_anon_WITH_AES_256_CBC_SHA\n | TLS_RSA_WITH_NULL_SHA256\n | TLS_RSA_WITH_AES_128_CBC_SHA256\n | TLS_RSA_WITH_AES_256_CBC_SHA256\n | TLS_DHE_DSS_WITH_AES_128_CBC_SHA256\n | TLS_DHE_RSA_WITH_AES_128_CBC_SHA256\n | TLS_DHE_DSS_WITH_AES_256_CBC_SHA256\n | TLS_DHE_RSA_WITH_AES_256_CBC_SHA256\n | TLS_DH_anon_WITH_AES_128_CBC_SHA256\n | TLS_DH_anon_WITH_AES_256_CBC_SHA256\n | TLS_RSA_WITH_AES_128_GCM_SHA256\n | TLS_RSA_WITH_AES_256_GCM_SHA384\n | TLS_DHE_RSA_WITH_AES_128_GCM_SHA256\n | TLS_DHE_RSA_WITH_AES_256_GCM_SHA384\n | TLS_DH_RSA_WITH_AES_128_GCM_SHA256\n | TLS_DH_RSA_WITH_AES_256_GCM_SHA384\n | TLS_DHE_DSS_WITH_AES_128_GCM_SHA256\n | TLS_DHE_DSS_WITH_AES_256_GCM_SHA384\n | TLS_DH_DSS_WITH_AES_128_GCM_SHA256\n | TLS_DH_DSS_WITH_AES_256_GCM_SHA384\n | TLS_DH_anon_WITH_AES_128_GCM_SHA256\n | TLS_DH_anon_WITH_AES_256_GCM_SHA384\n | TLS_AES_128_GCM_SHA256\n | TLS_AES_256_GCM_SHA384\n | TLS_CHACHA20_POLY1305_SHA256\n | TLS_AES_128_CCM_SHA256\n | TLS_AES_128_CCM_8_SHA256\n | TLS_ECDHE_RSA_WITH_RC4_128_SHA\n | TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA\n | TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA\n | TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA\n | TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256\n | TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384\n | TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256\n | TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384\n | TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256\n | TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384\n | TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256\n | TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256\n | TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256\n | TLS_PSK_WITH_CHACHA20_POLY1305_SHA256\n | TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256\n | TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256\n | Unknown_cipherSuite of (v:U16.t{not (known_cipherSuite_repr v)})\n\nlet string_of_cipherSuite = function\n | TLS_NULL_WITH_NULL_NULL -> \"TLS_NULL_WITH_NULL_NULL\"\n | TLS_RSA_WITH_NULL_MD5 -> \"TLS_RSA_WITH_NULL_MD5\"\n | TLS_RSA_WITH_NULL_SHA -> \"TLS_RSA_WITH_NULL_SHA\"\n | TLS_RSA_WITH_RC4_128_MD5 -> \"TLS_RSA_WITH_RC4_128_MD5\"\n | TLS_RSA_WITH_RC4_128_SHA -> \"TLS_RSA_WITH_RC4_128_SHA\"\n | TLS_RSA_WITH_3DES_EDE_CBC_SHA -> \"TLS_RSA_WITH_3DES_EDE_CBC_SHA\"\n | TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA -> \"TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA\"\n | TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA -> \"TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA\"\n | TLS_DH_anon_WITH_RC4_128_MD5 -> \"TLS_DH_anon_WITH_RC4_128_MD5\"\n | TLS_DH_anon_WITH_3DES_EDE_CBC_SHA -> \"TLS_DH_anon_WITH_3DES_EDE_CBC_SHA\"\n | TLS_RSA_WITH_AES_128_CBC_SHA -> \"TLS_RSA_WITH_AES_128_CBC_SHA\"\n | TLS_DHE_DSS_WITH_AES_128_CBC_SHA -> \"TLS_DHE_DSS_WITH_AES_128_CBC_SHA\"\n | TLS_DHE_RSA_WITH_AES_128_CBC_SHA -> \"TLS_DHE_RSA_WITH_AES_128_CBC_SHA\"\n | TLS_DH_anon_WITH_AES_128_CBC_SHA -> \"TLS_DH_anon_WITH_AES_128_CBC_SHA\"\n | TLS_RSA_WITH_AES_256_CBC_SHA -> \"TLS_RSA_WITH_AES_256_CBC_SHA\"\n | TLS_DHE_DSS_WITH_AES_256_CBC_SHA -> \"TLS_DHE_DSS_WITH_AES_256_CBC_SHA\"\n | TLS_DHE_RSA_WITH_AES_256_CBC_SHA -> \"TLS_DHE_RSA_WITH_AES_256_CBC_SHA\"\n | TLS_DH_anon_WITH_AES_256_CBC_SHA -> \"TLS_DH_anon_WITH_AES_256_CBC_SHA\"\n | TLS_RSA_WITH_NULL_SHA256 -> \"TLS_RSA_WITH_NULL_SHA256\"\n | TLS_RSA_WITH_AES_128_CBC_SHA256 -> \"TLS_RSA_WITH_AES_128_CBC_SHA256\"\n | TLS_RSA_WITH_AES_256_CBC_SHA256 -> \"TLS_RSA_WITH_AES_256_CBC_SHA256\"\n | TLS_DHE_DSS_WITH_AES_128_CBC_SHA256 -> \"TLS_DHE_DSS_WITH_AES_128_CBC_SHA256\"\n | TLS_DHE_RSA_WITH_AES_128_CBC_SHA256 -> \"TLS_DHE_RSA_WITH_AES_128_CBC_SHA256\"\n | TLS_DHE_DSS_WITH_AES_256_CBC_SHA256 -> \"TLS_DHE_DSS_WITH_AES_256_CBC_SHA256\"\n | TLS_DHE_RSA_WITH_AES_256_CBC_SHA256 -> \"TLS_DHE_RSA_WITH_AES_256_CBC_SHA256\"\n | TLS_DH_anon_WITH_AES_128_CBC_SHA256 -> \"TLS_DH_anon_WITH_AES_128_CBC_SHA256\"\n | TLS_DH_anon_WITH_AES_256_CBC_SHA256 -> \"TLS_DH_anon_WITH_AES_256_CBC_SHA256\"\n | TLS_RSA_WITH_AES_128_GCM_SHA256 -> \"TLS_RSA_WITH_AES_128_GCM_SHA256\"\n | TLS_RSA_WITH_AES_256_GCM_SHA384 -> \"TLS_RSA_WITH_AES_256_GCM_SHA384\"\n | TLS_DHE_RSA_WITH_AES_128_GCM_SHA256 -> \"TLS_DHE_RSA_WITH_AES_128_GCM_SHA256\"\n | TLS_DHE_RSA_WITH_AES_256_GCM_SHA384 -> \"TLS_DHE_RSA_WITH_AES_256_GCM_SHA384\"\n | TLS_DH_RSA_WITH_AES_128_GCM_SHA256 -> \"TLS_DH_RSA_WITH_AES_128_GCM_SHA256\"\n | TLS_DH_RSA_WITH_AES_256_GCM_SHA384 -> \"TLS_DH_RSA_WITH_AES_256_GCM_SHA384\"\n | TLS_DHE_DSS_WITH_AES_128_GCM_SHA256 -> \"TLS_DHE_DSS_WITH_AES_128_GCM_SHA256\"\n | TLS_DHE_DSS_WITH_AES_256_GCM_SHA384 -> \"TLS_DHE_DSS_WITH_AES_256_GCM_SHA384\"\n | TLS_DH_DSS_WITH_AES_128_GCM_SHA256 -> \"TLS_DH_DSS_WITH_AES_128_GCM_SHA256\"\n | TLS_DH_DSS_WITH_AES_256_GCM_SHA384 -> \"TLS_DH_DSS_WITH_AES_256_GCM_SHA384\"\n | TLS_DH_anon_WITH_AES_128_GCM_SHA256 -> \"TLS_DH_anon_WITH_AES_128_GCM_SHA256\"\n | TLS_DH_anon_WITH_AES_256_GCM_SHA384 -> \"TLS_DH_anon_WITH_AES_256_GCM_SHA384\"\n | TLS_AES_128_GCM_SHA256 -> \"TLS_AES_128_GCM_SHA256\"\n | TLS_AES_256_GCM_SHA384 -> \"TLS_AES_256_GCM_SHA384\"\n | TLS_CHACHA20_POLY1305_SHA256 -> \"TLS_CHACHA20_POLY1305_SHA256\"\n | TLS_AES_128_CCM_SHA256 -> \"TLS_AES_128_CCM_SHA256\"\n | TLS_AES_128_CCM_8_SHA256 -> \"TLS_AES_128_CCM_8_SHA256\"\n | TLS_ECDHE_RSA_WITH_RC4_128_SHA -> \"TLS_ECDHE_RSA_WITH_RC4_128_SHA\"\n | TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA -> \"TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA\"\n | TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA -> \"TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA\"\n | TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA -> \"TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA\"\n | TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256 -> \"TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256\"\n | TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384 -> \"TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384\"\n | TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256 -> \"TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256\"\n | TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384 -> \"TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384\"\n | TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256 -> \"TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256\"\n | TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384 -> \"TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384\"\n | TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256\"\n | TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256\"\n | TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256\"\n | TLS_PSK_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_PSK_WITH_CHACHA20_POLY1305_SHA256\"\n | TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256\"\n | TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256\"\n | Unknown_cipherSuite _ -> \"Unknown_cipherSuite\"\n\ninline_for_extraction noextract let cipherSuite_parser_kind = LP.strong_parser_kind 2 2 (Some LP.ParserKindMetadataTotal)\n\nnoextract val cipherSuite_parser: LP.parser cipherSuite_parser_kind cipherSuite\n\nnoextract val cipherSuite_serializer: LP.serializer cipherSuite_parser\n\nnoextract val cipherSuite_bytesize (x:cipherSuite) : GTot nat\n\nnoextract val cipherSuite_bytesize_eq (x:cipherSuite) : Lemma (cipherSuite_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x))\n\nval cipherSuite_parser32: LS.parser32 cipherSuite_parser\n\nval cipherSuite_serializer32: LS.serializer32 cipherSuite_serializer\n\nval cipherSuite_size32: LSZ.size32 cipherSuite_serializer\n\nlet cipherSuite_validator: LL.validator cipherSuite_parser = LL.validate_total_constant_size cipherSuite_parser 2uL ()", "dependencies": { "source_file": "Parsers.CipherSuite.fsti", "checked_file": "Parsers.CipherSuite.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper Parsers.CipherSuite.cipherSuite_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.jump_constant_size", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.CipherSuite.cipherSuite", "Parsers.CipherSuite.cipherSuite_parser", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val cipherSuite_jumper:LL.jumper cipherSuite_parser\nlet cipherSuite_jumper:LL.jumper cipherSuite_parser =", "completed_definiton": "LL.jump_constant_size cipherSuite_parser 2ul ()", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fsti", "name": "Parsers.CipherSuite.cipherSuite_validator", "original_source_type": "val cipherSuite_validator:LL.validator cipherSuite_parser", "source_type": "val cipherSuite_validator:LL.validator cipherSuite_parser", "source_definition": "let cipherSuite_validator: LL.validator cipherSuite_parser = LL.validate_total_constant_size cipherSuite_parser 2uL ()", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 167, "start_col": 61, "end_line": 167, "end_col": 118 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet cipherSuite_repr = U16.t\ninline_for_extraction let cipherSuite_repr_eq (x1 x2: cipherSuite_repr) : Tot bool = (x1 = x2)\nlet known_cipherSuite_repr (v:U16.t) : bool = v `cipherSuite_repr_eq` 0us || (v `cipherSuite_repr_eq` 1us || (v `cipherSuite_repr_eq` 2us || (v `cipherSuite_repr_eq` 4us || (v `cipherSuite_repr_eq` 5us || (v `cipherSuite_repr_eq` 10us || (v `cipherSuite_repr_eq` 19us || (v `cipherSuite_repr_eq` 22us || (v `cipherSuite_repr_eq` 24us || (v `cipherSuite_repr_eq` 27us || (v `cipherSuite_repr_eq` 47us || (v `cipherSuite_repr_eq` 50us || (v `cipherSuite_repr_eq` 51us || (v `cipherSuite_repr_eq` 52us || (v `cipherSuite_repr_eq` 53us || (v `cipherSuite_repr_eq` 56us || (v `cipherSuite_repr_eq` 57us || (v `cipherSuite_repr_eq` 58us || (v `cipherSuite_repr_eq` 59us || (v `cipherSuite_repr_eq` 60us || (v `cipherSuite_repr_eq` 61us || (v `cipherSuite_repr_eq` 64us || (v `cipherSuite_repr_eq` 103us || (v `cipherSuite_repr_eq` 106us || (v `cipherSuite_repr_eq` 107us || (v `cipherSuite_repr_eq` 108us || (v `cipherSuite_repr_eq` 109us || (v `cipherSuite_repr_eq` 156us || (v `cipherSuite_repr_eq` 157us || (v `cipherSuite_repr_eq` 158us || (v `cipherSuite_repr_eq` 159us || (v `cipherSuite_repr_eq` 160us || (v `cipherSuite_repr_eq` 161us || (v `cipherSuite_repr_eq` 162us || (v `cipherSuite_repr_eq` 163us || (v `cipherSuite_repr_eq` 164us || (v `cipherSuite_repr_eq` 165us || (v `cipherSuite_repr_eq` 166us || (v `cipherSuite_repr_eq` 167us || (v `cipherSuite_repr_eq` 4865us || (v `cipherSuite_repr_eq` 4866us || (v `cipherSuite_repr_eq` 4867us || (v `cipherSuite_repr_eq` 4868us || (v `cipherSuite_repr_eq` 4869us || (v `cipherSuite_repr_eq` 49169us || (v `cipherSuite_repr_eq` 49170us || (v `cipherSuite_repr_eq` 49171us || (v `cipherSuite_repr_eq` 49172us || (v `cipherSuite_repr_eq` 49191us || (v `cipherSuite_repr_eq` 49192us || (v `cipherSuite_repr_eq` 49195us || (v `cipherSuite_repr_eq` 49196us || (v `cipherSuite_repr_eq` 49199us || (v `cipherSuite_repr_eq` 49200us || (v `cipherSuite_repr_eq` 52392us || (v `cipherSuite_repr_eq` 52393us || (v `cipherSuite_repr_eq` 52394us || (v `cipherSuite_repr_eq` 52395us || (v `cipherSuite_repr_eq` 52396us || (v `cipherSuite_repr_eq` 52397us || (false))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))\n\ntype cipherSuite =\n | TLS_NULL_WITH_NULL_NULL\n | TLS_RSA_WITH_NULL_MD5\n | TLS_RSA_WITH_NULL_SHA\n | TLS_RSA_WITH_RC4_128_MD5\n | TLS_RSA_WITH_RC4_128_SHA\n | TLS_RSA_WITH_3DES_EDE_CBC_SHA\n | TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA\n | TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA\n | TLS_DH_anon_WITH_RC4_128_MD5\n | TLS_DH_anon_WITH_3DES_EDE_CBC_SHA\n | TLS_RSA_WITH_AES_128_CBC_SHA\n | TLS_DHE_DSS_WITH_AES_128_CBC_SHA\n | TLS_DHE_RSA_WITH_AES_128_CBC_SHA\n | TLS_DH_anon_WITH_AES_128_CBC_SHA\n | TLS_RSA_WITH_AES_256_CBC_SHA\n | TLS_DHE_DSS_WITH_AES_256_CBC_SHA\n | TLS_DHE_RSA_WITH_AES_256_CBC_SHA\n | TLS_DH_anon_WITH_AES_256_CBC_SHA\n | TLS_RSA_WITH_NULL_SHA256\n | TLS_RSA_WITH_AES_128_CBC_SHA256\n | TLS_RSA_WITH_AES_256_CBC_SHA256\n | TLS_DHE_DSS_WITH_AES_128_CBC_SHA256\n | TLS_DHE_RSA_WITH_AES_128_CBC_SHA256\n | TLS_DHE_DSS_WITH_AES_256_CBC_SHA256\n | TLS_DHE_RSA_WITH_AES_256_CBC_SHA256\n | TLS_DH_anon_WITH_AES_128_CBC_SHA256\n | TLS_DH_anon_WITH_AES_256_CBC_SHA256\n | TLS_RSA_WITH_AES_128_GCM_SHA256\n | TLS_RSA_WITH_AES_256_GCM_SHA384\n | TLS_DHE_RSA_WITH_AES_128_GCM_SHA256\n | TLS_DHE_RSA_WITH_AES_256_GCM_SHA384\n | TLS_DH_RSA_WITH_AES_128_GCM_SHA256\n | TLS_DH_RSA_WITH_AES_256_GCM_SHA384\n | TLS_DHE_DSS_WITH_AES_128_GCM_SHA256\n | TLS_DHE_DSS_WITH_AES_256_GCM_SHA384\n | TLS_DH_DSS_WITH_AES_128_GCM_SHA256\n | TLS_DH_DSS_WITH_AES_256_GCM_SHA384\n | TLS_DH_anon_WITH_AES_128_GCM_SHA256\n | TLS_DH_anon_WITH_AES_256_GCM_SHA384\n | TLS_AES_128_GCM_SHA256\n | TLS_AES_256_GCM_SHA384\n | TLS_CHACHA20_POLY1305_SHA256\n | TLS_AES_128_CCM_SHA256\n | TLS_AES_128_CCM_8_SHA256\n | TLS_ECDHE_RSA_WITH_RC4_128_SHA\n | TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA\n | TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA\n | TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA\n | TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256\n | TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384\n | TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256\n | TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384\n | TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256\n | TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384\n | TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256\n | TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256\n | TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256\n | TLS_PSK_WITH_CHACHA20_POLY1305_SHA256\n | TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256\n | TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256\n | Unknown_cipherSuite of (v:U16.t{not (known_cipherSuite_repr v)})\n\nlet string_of_cipherSuite = function\n | TLS_NULL_WITH_NULL_NULL -> \"TLS_NULL_WITH_NULL_NULL\"\n | TLS_RSA_WITH_NULL_MD5 -> \"TLS_RSA_WITH_NULL_MD5\"\n | TLS_RSA_WITH_NULL_SHA -> \"TLS_RSA_WITH_NULL_SHA\"\n | TLS_RSA_WITH_RC4_128_MD5 -> \"TLS_RSA_WITH_RC4_128_MD5\"\n | TLS_RSA_WITH_RC4_128_SHA -> \"TLS_RSA_WITH_RC4_128_SHA\"\n | TLS_RSA_WITH_3DES_EDE_CBC_SHA -> \"TLS_RSA_WITH_3DES_EDE_CBC_SHA\"\n | TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA -> \"TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA\"\n | TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA -> \"TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA\"\n | TLS_DH_anon_WITH_RC4_128_MD5 -> \"TLS_DH_anon_WITH_RC4_128_MD5\"\n | TLS_DH_anon_WITH_3DES_EDE_CBC_SHA -> \"TLS_DH_anon_WITH_3DES_EDE_CBC_SHA\"\n | TLS_RSA_WITH_AES_128_CBC_SHA -> \"TLS_RSA_WITH_AES_128_CBC_SHA\"\n | TLS_DHE_DSS_WITH_AES_128_CBC_SHA -> \"TLS_DHE_DSS_WITH_AES_128_CBC_SHA\"\n | TLS_DHE_RSA_WITH_AES_128_CBC_SHA -> \"TLS_DHE_RSA_WITH_AES_128_CBC_SHA\"\n | TLS_DH_anon_WITH_AES_128_CBC_SHA -> \"TLS_DH_anon_WITH_AES_128_CBC_SHA\"\n | TLS_RSA_WITH_AES_256_CBC_SHA -> \"TLS_RSA_WITH_AES_256_CBC_SHA\"\n | TLS_DHE_DSS_WITH_AES_256_CBC_SHA -> \"TLS_DHE_DSS_WITH_AES_256_CBC_SHA\"\n | TLS_DHE_RSA_WITH_AES_256_CBC_SHA -> \"TLS_DHE_RSA_WITH_AES_256_CBC_SHA\"\n | TLS_DH_anon_WITH_AES_256_CBC_SHA -> \"TLS_DH_anon_WITH_AES_256_CBC_SHA\"\n | TLS_RSA_WITH_NULL_SHA256 -> \"TLS_RSA_WITH_NULL_SHA256\"\n | TLS_RSA_WITH_AES_128_CBC_SHA256 -> \"TLS_RSA_WITH_AES_128_CBC_SHA256\"\n | TLS_RSA_WITH_AES_256_CBC_SHA256 -> \"TLS_RSA_WITH_AES_256_CBC_SHA256\"\n | TLS_DHE_DSS_WITH_AES_128_CBC_SHA256 -> \"TLS_DHE_DSS_WITH_AES_128_CBC_SHA256\"\n | TLS_DHE_RSA_WITH_AES_128_CBC_SHA256 -> \"TLS_DHE_RSA_WITH_AES_128_CBC_SHA256\"\n | TLS_DHE_DSS_WITH_AES_256_CBC_SHA256 -> \"TLS_DHE_DSS_WITH_AES_256_CBC_SHA256\"\n | TLS_DHE_RSA_WITH_AES_256_CBC_SHA256 -> \"TLS_DHE_RSA_WITH_AES_256_CBC_SHA256\"\n | TLS_DH_anon_WITH_AES_128_CBC_SHA256 -> \"TLS_DH_anon_WITH_AES_128_CBC_SHA256\"\n | TLS_DH_anon_WITH_AES_256_CBC_SHA256 -> \"TLS_DH_anon_WITH_AES_256_CBC_SHA256\"\n | TLS_RSA_WITH_AES_128_GCM_SHA256 -> \"TLS_RSA_WITH_AES_128_GCM_SHA256\"\n | TLS_RSA_WITH_AES_256_GCM_SHA384 -> \"TLS_RSA_WITH_AES_256_GCM_SHA384\"\n | TLS_DHE_RSA_WITH_AES_128_GCM_SHA256 -> \"TLS_DHE_RSA_WITH_AES_128_GCM_SHA256\"\n | TLS_DHE_RSA_WITH_AES_256_GCM_SHA384 -> \"TLS_DHE_RSA_WITH_AES_256_GCM_SHA384\"\n | TLS_DH_RSA_WITH_AES_128_GCM_SHA256 -> \"TLS_DH_RSA_WITH_AES_128_GCM_SHA256\"\n | TLS_DH_RSA_WITH_AES_256_GCM_SHA384 -> \"TLS_DH_RSA_WITH_AES_256_GCM_SHA384\"\n | TLS_DHE_DSS_WITH_AES_128_GCM_SHA256 -> \"TLS_DHE_DSS_WITH_AES_128_GCM_SHA256\"\n | TLS_DHE_DSS_WITH_AES_256_GCM_SHA384 -> \"TLS_DHE_DSS_WITH_AES_256_GCM_SHA384\"\n | TLS_DH_DSS_WITH_AES_128_GCM_SHA256 -> \"TLS_DH_DSS_WITH_AES_128_GCM_SHA256\"\n | TLS_DH_DSS_WITH_AES_256_GCM_SHA384 -> \"TLS_DH_DSS_WITH_AES_256_GCM_SHA384\"\n | TLS_DH_anon_WITH_AES_128_GCM_SHA256 -> \"TLS_DH_anon_WITH_AES_128_GCM_SHA256\"\n | TLS_DH_anon_WITH_AES_256_GCM_SHA384 -> \"TLS_DH_anon_WITH_AES_256_GCM_SHA384\"\n | TLS_AES_128_GCM_SHA256 -> \"TLS_AES_128_GCM_SHA256\"\n | TLS_AES_256_GCM_SHA384 -> \"TLS_AES_256_GCM_SHA384\"\n | TLS_CHACHA20_POLY1305_SHA256 -> \"TLS_CHACHA20_POLY1305_SHA256\"\n | TLS_AES_128_CCM_SHA256 -> \"TLS_AES_128_CCM_SHA256\"\n | TLS_AES_128_CCM_8_SHA256 -> \"TLS_AES_128_CCM_8_SHA256\"\n | TLS_ECDHE_RSA_WITH_RC4_128_SHA -> \"TLS_ECDHE_RSA_WITH_RC4_128_SHA\"\n | TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA -> \"TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA\"\n | TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA -> \"TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA\"\n | TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA -> \"TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA\"\n | TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256 -> \"TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256\"\n | TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384 -> \"TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384\"\n | TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256 -> \"TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256\"\n | TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384 -> \"TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384\"\n | TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256 -> \"TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256\"\n | TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384 -> \"TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384\"\n | TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256\"\n | TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256\"\n | TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256\"\n | TLS_PSK_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_PSK_WITH_CHACHA20_POLY1305_SHA256\"\n | TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256\"\n | TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256\"\n | Unknown_cipherSuite _ -> \"Unknown_cipherSuite\"\n\ninline_for_extraction noextract let cipherSuite_parser_kind = LP.strong_parser_kind 2 2 (Some LP.ParserKindMetadataTotal)\n\nnoextract val cipherSuite_parser: LP.parser cipherSuite_parser_kind cipherSuite\n\nnoextract val cipherSuite_serializer: LP.serializer cipherSuite_parser\n\nnoextract val cipherSuite_bytesize (x:cipherSuite) : GTot nat\n\nnoextract val cipherSuite_bytesize_eq (x:cipherSuite) : Lemma (cipherSuite_bytesize x == Seq.length (LP.serialize cipherSuite_serializer x))\n\nval cipherSuite_parser32: LS.parser32 cipherSuite_parser\n\nval cipherSuite_serializer32: LS.serializer32 cipherSuite_serializer\n\nval cipherSuite_size32: LSZ.size32 cipherSuite_serializer", "dependencies": { "source_file": "Parsers.CipherSuite.fsti", "checked_file": "Parsers.CipherSuite.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator Parsers.CipherSuite.cipherSuite_parser", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Base.validate_total_constant_size", "Parsers.CipherSuite.cipherSuite_parser_kind", "Parsers.CipherSuite.cipherSuite", "Parsers.CipherSuite.cipherSuite_parser", "FStar.UInt64.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val cipherSuite_validator:LL.validator cipherSuite_parser\nlet cipherSuite_validator:LL.validator cipherSuite_parser =", "completed_definiton": "LL.validate_total_constant_size cipherSuite_parser 2uL ()", "isa_cross_project_example": true }, { "file_name": "Parsers.CipherSuite.fsti", "name": "Parsers.CipherSuite.string_of_cipherSuite", "original_source_type": "", "source_type": "val string_of_cipherSuite : _: Parsers.CipherSuite.cipherSuite -> Prims.string", "source_definition": "let string_of_cipherSuite = function\n | TLS_NULL_WITH_NULL_NULL -> \"TLS_NULL_WITH_NULL_NULL\"\n | TLS_RSA_WITH_NULL_MD5 -> \"TLS_RSA_WITH_NULL_MD5\"\n | TLS_RSA_WITH_NULL_SHA -> \"TLS_RSA_WITH_NULL_SHA\"\n | TLS_RSA_WITH_RC4_128_MD5 -> \"TLS_RSA_WITH_RC4_128_MD5\"\n | TLS_RSA_WITH_RC4_128_SHA -> \"TLS_RSA_WITH_RC4_128_SHA\"\n | TLS_RSA_WITH_3DES_EDE_CBC_SHA -> \"TLS_RSA_WITH_3DES_EDE_CBC_SHA\"\n | TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA -> \"TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA\"\n | TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA -> \"TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA\"\n | TLS_DH_anon_WITH_RC4_128_MD5 -> \"TLS_DH_anon_WITH_RC4_128_MD5\"\n | TLS_DH_anon_WITH_3DES_EDE_CBC_SHA -> \"TLS_DH_anon_WITH_3DES_EDE_CBC_SHA\"\n | TLS_RSA_WITH_AES_128_CBC_SHA -> \"TLS_RSA_WITH_AES_128_CBC_SHA\"\n | TLS_DHE_DSS_WITH_AES_128_CBC_SHA -> \"TLS_DHE_DSS_WITH_AES_128_CBC_SHA\"\n | TLS_DHE_RSA_WITH_AES_128_CBC_SHA -> \"TLS_DHE_RSA_WITH_AES_128_CBC_SHA\"\n | TLS_DH_anon_WITH_AES_128_CBC_SHA -> \"TLS_DH_anon_WITH_AES_128_CBC_SHA\"\n | TLS_RSA_WITH_AES_256_CBC_SHA -> \"TLS_RSA_WITH_AES_256_CBC_SHA\"\n | TLS_DHE_DSS_WITH_AES_256_CBC_SHA -> \"TLS_DHE_DSS_WITH_AES_256_CBC_SHA\"\n | TLS_DHE_RSA_WITH_AES_256_CBC_SHA -> \"TLS_DHE_RSA_WITH_AES_256_CBC_SHA\"\n | TLS_DH_anon_WITH_AES_256_CBC_SHA -> \"TLS_DH_anon_WITH_AES_256_CBC_SHA\"\n | TLS_RSA_WITH_NULL_SHA256 -> \"TLS_RSA_WITH_NULL_SHA256\"\n | TLS_RSA_WITH_AES_128_CBC_SHA256 -> \"TLS_RSA_WITH_AES_128_CBC_SHA256\"\n | TLS_RSA_WITH_AES_256_CBC_SHA256 -> \"TLS_RSA_WITH_AES_256_CBC_SHA256\"\n | TLS_DHE_DSS_WITH_AES_128_CBC_SHA256 -> \"TLS_DHE_DSS_WITH_AES_128_CBC_SHA256\"\n | TLS_DHE_RSA_WITH_AES_128_CBC_SHA256 -> \"TLS_DHE_RSA_WITH_AES_128_CBC_SHA256\"\n | TLS_DHE_DSS_WITH_AES_256_CBC_SHA256 -> \"TLS_DHE_DSS_WITH_AES_256_CBC_SHA256\"\n | TLS_DHE_RSA_WITH_AES_256_CBC_SHA256 -> \"TLS_DHE_RSA_WITH_AES_256_CBC_SHA256\"\n | TLS_DH_anon_WITH_AES_128_CBC_SHA256 -> \"TLS_DH_anon_WITH_AES_128_CBC_SHA256\"\n | TLS_DH_anon_WITH_AES_256_CBC_SHA256 -> \"TLS_DH_anon_WITH_AES_256_CBC_SHA256\"\n | TLS_RSA_WITH_AES_128_GCM_SHA256 -> \"TLS_RSA_WITH_AES_128_GCM_SHA256\"\n | TLS_RSA_WITH_AES_256_GCM_SHA384 -> \"TLS_RSA_WITH_AES_256_GCM_SHA384\"\n | TLS_DHE_RSA_WITH_AES_128_GCM_SHA256 -> \"TLS_DHE_RSA_WITH_AES_128_GCM_SHA256\"\n | TLS_DHE_RSA_WITH_AES_256_GCM_SHA384 -> \"TLS_DHE_RSA_WITH_AES_256_GCM_SHA384\"\n | TLS_DH_RSA_WITH_AES_128_GCM_SHA256 -> \"TLS_DH_RSA_WITH_AES_128_GCM_SHA256\"\n | TLS_DH_RSA_WITH_AES_256_GCM_SHA384 -> \"TLS_DH_RSA_WITH_AES_256_GCM_SHA384\"\n | TLS_DHE_DSS_WITH_AES_128_GCM_SHA256 -> \"TLS_DHE_DSS_WITH_AES_128_GCM_SHA256\"\n | TLS_DHE_DSS_WITH_AES_256_GCM_SHA384 -> \"TLS_DHE_DSS_WITH_AES_256_GCM_SHA384\"\n | TLS_DH_DSS_WITH_AES_128_GCM_SHA256 -> \"TLS_DH_DSS_WITH_AES_128_GCM_SHA256\"\n | TLS_DH_DSS_WITH_AES_256_GCM_SHA384 -> \"TLS_DH_DSS_WITH_AES_256_GCM_SHA384\"\n | TLS_DH_anon_WITH_AES_128_GCM_SHA256 -> \"TLS_DH_anon_WITH_AES_128_GCM_SHA256\"\n | TLS_DH_anon_WITH_AES_256_GCM_SHA384 -> \"TLS_DH_anon_WITH_AES_256_GCM_SHA384\"\n | TLS_AES_128_GCM_SHA256 -> \"TLS_AES_128_GCM_SHA256\"\n | TLS_AES_256_GCM_SHA384 -> \"TLS_AES_256_GCM_SHA384\"\n | TLS_CHACHA20_POLY1305_SHA256 -> \"TLS_CHACHA20_POLY1305_SHA256\"\n | TLS_AES_128_CCM_SHA256 -> \"TLS_AES_128_CCM_SHA256\"\n | TLS_AES_128_CCM_8_SHA256 -> \"TLS_AES_128_CCM_8_SHA256\"\n | TLS_ECDHE_RSA_WITH_RC4_128_SHA -> \"TLS_ECDHE_RSA_WITH_RC4_128_SHA\"\n | TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA -> \"TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA\"\n | TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA -> \"TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA\"\n | TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA -> \"TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA\"\n | TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256 -> \"TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256\"\n | TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384 -> \"TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384\"\n | TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256 -> \"TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256\"\n | TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384 -> \"TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384\"\n | TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256 -> \"TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256\"\n | TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384 -> \"TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384\"\n | TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256\"\n | TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256\"\n | TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256\"\n | TLS_PSK_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_PSK_WITH_CHACHA20_POLY1305_SHA256\"\n | TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256\"\n | TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256\"\n | Unknown_cipherSuite _ -> \"Unknown_cipherSuite\"", "source": { "project_name": "mitls-fstar", "file_name": "src/parsers/generated/Parsers.CipherSuite.fsti", "git_rev": "756f89ccbecf9a38a07378c1ce46bf6e180a183d", "git_url": "https://github.com/project-everest/mitls-fstar.git" }, "source_range": { "start_line": 88, "start_col": 28, "end_line": 149, "end_col": 50 }, "file_context": "module Parsers.CipherSuite\n\n(* This file has been automatically generated by EverParse. *)\nopen FStar.Bytes\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.Base\nmodule LS = LowParse.SLow.Base\nmodule LSZ = LowParse.SLow.Base\nmodule LPI = LowParse.Spec.AllIntegers\nmodule LL = LowParse.Low.Base\nmodule L = FStar.List.Tot\nmodule B = LowStar.Buffer\nmodule BY = FStar.Bytes\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nlet cipherSuite_repr = U16.t\ninline_for_extraction let cipherSuite_repr_eq (x1 x2: cipherSuite_repr) : Tot bool = (x1 = x2)\nlet known_cipherSuite_repr (v:U16.t) : bool = v `cipherSuite_repr_eq` 0us || (v `cipherSuite_repr_eq` 1us || (v `cipherSuite_repr_eq` 2us || (v `cipherSuite_repr_eq` 4us || (v `cipherSuite_repr_eq` 5us || (v `cipherSuite_repr_eq` 10us || (v `cipherSuite_repr_eq` 19us || (v `cipherSuite_repr_eq` 22us || (v `cipherSuite_repr_eq` 24us || (v `cipherSuite_repr_eq` 27us || (v `cipherSuite_repr_eq` 47us || (v `cipherSuite_repr_eq` 50us || (v `cipherSuite_repr_eq` 51us || (v `cipherSuite_repr_eq` 52us || (v `cipherSuite_repr_eq` 53us || (v `cipherSuite_repr_eq` 56us || (v `cipherSuite_repr_eq` 57us || (v `cipherSuite_repr_eq` 58us || (v `cipherSuite_repr_eq` 59us || (v `cipherSuite_repr_eq` 60us || (v `cipherSuite_repr_eq` 61us || (v `cipherSuite_repr_eq` 64us || (v `cipherSuite_repr_eq` 103us || (v `cipherSuite_repr_eq` 106us || (v `cipherSuite_repr_eq` 107us || (v `cipherSuite_repr_eq` 108us || (v `cipherSuite_repr_eq` 109us || (v `cipherSuite_repr_eq` 156us || (v `cipherSuite_repr_eq` 157us || (v `cipherSuite_repr_eq` 158us || (v `cipherSuite_repr_eq` 159us || (v `cipherSuite_repr_eq` 160us || (v `cipherSuite_repr_eq` 161us || (v `cipherSuite_repr_eq` 162us || (v `cipherSuite_repr_eq` 163us || (v `cipherSuite_repr_eq` 164us || (v `cipherSuite_repr_eq` 165us || (v `cipherSuite_repr_eq` 166us || (v `cipherSuite_repr_eq` 167us || (v `cipherSuite_repr_eq` 4865us || (v `cipherSuite_repr_eq` 4866us || (v `cipherSuite_repr_eq` 4867us || (v `cipherSuite_repr_eq` 4868us || (v `cipherSuite_repr_eq` 4869us || (v `cipherSuite_repr_eq` 49169us || (v `cipherSuite_repr_eq` 49170us || (v `cipherSuite_repr_eq` 49171us || (v `cipherSuite_repr_eq` 49172us || (v `cipherSuite_repr_eq` 49191us || (v `cipherSuite_repr_eq` 49192us || (v `cipherSuite_repr_eq` 49195us || (v `cipherSuite_repr_eq` 49196us || (v `cipherSuite_repr_eq` 49199us || (v `cipherSuite_repr_eq` 49200us || (v `cipherSuite_repr_eq` 52392us || (v `cipherSuite_repr_eq` 52393us || (v `cipherSuite_repr_eq` 52394us || (v `cipherSuite_repr_eq` 52395us || (v `cipherSuite_repr_eq` 52396us || (v `cipherSuite_repr_eq` 52397us || (false))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))\n\ntype cipherSuite =\n | TLS_NULL_WITH_NULL_NULL\n | TLS_RSA_WITH_NULL_MD5\n | TLS_RSA_WITH_NULL_SHA\n | TLS_RSA_WITH_RC4_128_MD5\n | TLS_RSA_WITH_RC4_128_SHA\n | TLS_RSA_WITH_3DES_EDE_CBC_SHA\n | TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA\n | TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA\n | TLS_DH_anon_WITH_RC4_128_MD5\n | TLS_DH_anon_WITH_3DES_EDE_CBC_SHA\n | TLS_RSA_WITH_AES_128_CBC_SHA\n | TLS_DHE_DSS_WITH_AES_128_CBC_SHA\n | TLS_DHE_RSA_WITH_AES_128_CBC_SHA\n | TLS_DH_anon_WITH_AES_128_CBC_SHA\n | TLS_RSA_WITH_AES_256_CBC_SHA\n | TLS_DHE_DSS_WITH_AES_256_CBC_SHA\n | TLS_DHE_RSA_WITH_AES_256_CBC_SHA\n | TLS_DH_anon_WITH_AES_256_CBC_SHA\n | TLS_RSA_WITH_NULL_SHA256\n | TLS_RSA_WITH_AES_128_CBC_SHA256\n | TLS_RSA_WITH_AES_256_CBC_SHA256\n | TLS_DHE_DSS_WITH_AES_128_CBC_SHA256\n | TLS_DHE_RSA_WITH_AES_128_CBC_SHA256\n | TLS_DHE_DSS_WITH_AES_256_CBC_SHA256\n | TLS_DHE_RSA_WITH_AES_256_CBC_SHA256\n | TLS_DH_anon_WITH_AES_128_CBC_SHA256\n | TLS_DH_anon_WITH_AES_256_CBC_SHA256\n | TLS_RSA_WITH_AES_128_GCM_SHA256\n | TLS_RSA_WITH_AES_256_GCM_SHA384\n | TLS_DHE_RSA_WITH_AES_128_GCM_SHA256\n | TLS_DHE_RSA_WITH_AES_256_GCM_SHA384\n | TLS_DH_RSA_WITH_AES_128_GCM_SHA256\n | TLS_DH_RSA_WITH_AES_256_GCM_SHA384\n | TLS_DHE_DSS_WITH_AES_128_GCM_SHA256\n | TLS_DHE_DSS_WITH_AES_256_GCM_SHA384\n | TLS_DH_DSS_WITH_AES_128_GCM_SHA256\n | TLS_DH_DSS_WITH_AES_256_GCM_SHA384\n | TLS_DH_anon_WITH_AES_128_GCM_SHA256\n | TLS_DH_anon_WITH_AES_256_GCM_SHA384\n | TLS_AES_128_GCM_SHA256\n | TLS_AES_256_GCM_SHA384\n | TLS_CHACHA20_POLY1305_SHA256\n | TLS_AES_128_CCM_SHA256\n | TLS_AES_128_CCM_8_SHA256\n | TLS_ECDHE_RSA_WITH_RC4_128_SHA\n | TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA\n | TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA\n | TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA\n | TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256\n | TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384\n | TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256\n | TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384\n | TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256\n | TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384\n | TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256\n | TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256\n | TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256\n | TLS_PSK_WITH_CHACHA20_POLY1305_SHA256\n | TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256\n | TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256\n | Unknown_cipherSuite of (v:U16.t{not (known_cipherSuite_repr v)})", "dependencies": { "source_file": "Parsers.CipherSuite.fsti", "checked_file": "Parsers.CipherSuite.fsti.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.Spec.AllIntegers.fst.checked", "LowParse.SLow.Base.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "BY", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LPI", "full_module": "LowParse.Spec.AllIntegers" }, { "abbrev": true, "short_module": "LSZ", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LS", "full_module": "LowParse.SLow.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "Parsers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": false, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Parsers.CipherSuite.cipherSuite -> Prims.string", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Parsers.CipherSuite.cipherSuite", "FStar.UInt16.t", "Prims.b2t", "Prims.op_Negation", "Parsers.CipherSuite.known_cipherSuite_repr", "Prims.string" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let string_of_cipherSuite =", "completed_definiton": "function\n| TLS_NULL_WITH_NULL_NULL -> \"TLS_NULL_WITH_NULL_NULL\"\n| TLS_RSA_WITH_NULL_MD5 -> \"TLS_RSA_WITH_NULL_MD5\"\n| TLS_RSA_WITH_NULL_SHA -> \"TLS_RSA_WITH_NULL_SHA\"\n| TLS_RSA_WITH_RC4_128_MD5 -> \"TLS_RSA_WITH_RC4_128_MD5\"\n| TLS_RSA_WITH_RC4_128_SHA -> \"TLS_RSA_WITH_RC4_128_SHA\"\n| TLS_RSA_WITH_3DES_EDE_CBC_SHA -> \"TLS_RSA_WITH_3DES_EDE_CBC_SHA\"\n| TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA -> \"TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA\"\n| TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA -> \"TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA\"\n| TLS_DH_anon_WITH_RC4_128_MD5 -> \"TLS_DH_anon_WITH_RC4_128_MD5\"\n| TLS_DH_anon_WITH_3DES_EDE_CBC_SHA -> \"TLS_DH_anon_WITH_3DES_EDE_CBC_SHA\"\n| TLS_RSA_WITH_AES_128_CBC_SHA -> \"TLS_RSA_WITH_AES_128_CBC_SHA\"\n| TLS_DHE_DSS_WITH_AES_128_CBC_SHA -> \"TLS_DHE_DSS_WITH_AES_128_CBC_SHA\"\n| TLS_DHE_RSA_WITH_AES_128_CBC_SHA -> \"TLS_DHE_RSA_WITH_AES_128_CBC_SHA\"\n| TLS_DH_anon_WITH_AES_128_CBC_SHA -> \"TLS_DH_anon_WITH_AES_128_CBC_SHA\"\n| TLS_RSA_WITH_AES_256_CBC_SHA -> \"TLS_RSA_WITH_AES_256_CBC_SHA\"\n| TLS_DHE_DSS_WITH_AES_256_CBC_SHA -> \"TLS_DHE_DSS_WITH_AES_256_CBC_SHA\"\n| TLS_DHE_RSA_WITH_AES_256_CBC_SHA -> \"TLS_DHE_RSA_WITH_AES_256_CBC_SHA\"\n| TLS_DH_anon_WITH_AES_256_CBC_SHA -> \"TLS_DH_anon_WITH_AES_256_CBC_SHA\"\n| TLS_RSA_WITH_NULL_SHA256 -> \"TLS_RSA_WITH_NULL_SHA256\"\n| TLS_RSA_WITH_AES_128_CBC_SHA256 -> \"TLS_RSA_WITH_AES_128_CBC_SHA256\"\n| TLS_RSA_WITH_AES_256_CBC_SHA256 -> \"TLS_RSA_WITH_AES_256_CBC_SHA256\"\n| TLS_DHE_DSS_WITH_AES_128_CBC_SHA256 -> \"TLS_DHE_DSS_WITH_AES_128_CBC_SHA256\"\n| TLS_DHE_RSA_WITH_AES_128_CBC_SHA256 -> \"TLS_DHE_RSA_WITH_AES_128_CBC_SHA256\"\n| TLS_DHE_DSS_WITH_AES_256_CBC_SHA256 -> \"TLS_DHE_DSS_WITH_AES_256_CBC_SHA256\"\n| TLS_DHE_RSA_WITH_AES_256_CBC_SHA256 -> \"TLS_DHE_RSA_WITH_AES_256_CBC_SHA256\"\n| TLS_DH_anon_WITH_AES_128_CBC_SHA256 -> \"TLS_DH_anon_WITH_AES_128_CBC_SHA256\"\n| TLS_DH_anon_WITH_AES_256_CBC_SHA256 -> \"TLS_DH_anon_WITH_AES_256_CBC_SHA256\"\n| TLS_RSA_WITH_AES_128_GCM_SHA256 -> \"TLS_RSA_WITH_AES_128_GCM_SHA256\"\n| TLS_RSA_WITH_AES_256_GCM_SHA384 -> \"TLS_RSA_WITH_AES_256_GCM_SHA384\"\n| TLS_DHE_RSA_WITH_AES_128_GCM_SHA256 -> \"TLS_DHE_RSA_WITH_AES_128_GCM_SHA256\"\n| TLS_DHE_RSA_WITH_AES_256_GCM_SHA384 -> \"TLS_DHE_RSA_WITH_AES_256_GCM_SHA384\"\n| TLS_DH_RSA_WITH_AES_128_GCM_SHA256 -> \"TLS_DH_RSA_WITH_AES_128_GCM_SHA256\"\n| TLS_DH_RSA_WITH_AES_256_GCM_SHA384 -> \"TLS_DH_RSA_WITH_AES_256_GCM_SHA384\"\n| TLS_DHE_DSS_WITH_AES_128_GCM_SHA256 -> \"TLS_DHE_DSS_WITH_AES_128_GCM_SHA256\"\n| TLS_DHE_DSS_WITH_AES_256_GCM_SHA384 -> \"TLS_DHE_DSS_WITH_AES_256_GCM_SHA384\"\n| TLS_DH_DSS_WITH_AES_128_GCM_SHA256 -> \"TLS_DH_DSS_WITH_AES_128_GCM_SHA256\"\n| TLS_DH_DSS_WITH_AES_256_GCM_SHA384 -> \"TLS_DH_DSS_WITH_AES_256_GCM_SHA384\"\n| TLS_DH_anon_WITH_AES_128_GCM_SHA256 -> \"TLS_DH_anon_WITH_AES_128_GCM_SHA256\"\n| TLS_DH_anon_WITH_AES_256_GCM_SHA384 -> \"TLS_DH_anon_WITH_AES_256_GCM_SHA384\"\n| TLS_AES_128_GCM_SHA256 -> \"TLS_AES_128_GCM_SHA256\"\n| TLS_AES_256_GCM_SHA384 -> \"TLS_AES_256_GCM_SHA384\"\n| TLS_CHACHA20_POLY1305_SHA256 -> \"TLS_CHACHA20_POLY1305_SHA256\"\n| TLS_AES_128_CCM_SHA256 -> \"TLS_AES_128_CCM_SHA256\"\n| TLS_AES_128_CCM_8_SHA256 -> \"TLS_AES_128_CCM_8_SHA256\"\n| TLS_ECDHE_RSA_WITH_RC4_128_SHA -> \"TLS_ECDHE_RSA_WITH_RC4_128_SHA\"\n| TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA -> \"TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA\"\n| TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA -> \"TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA\"\n| TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA -> \"TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA\"\n| TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256 -> \"TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256\"\n| TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384 -> \"TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384\"\n| TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256 -> \"TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256\"\n| TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384 -> \"TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384\"\n| TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256 -> \"TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256\"\n| TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384 -> \"TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384\"\n| TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256\"\n| TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256\"\n| TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256\"\n| TLS_PSK_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_PSK_WITH_CHACHA20_POLY1305_SHA256\"\n| TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256\"\n| TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256 -> \"TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256\"\n| Unknown_cipherSuite _ -> \"Unknown_cipherSuite\"", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.fst", "name": "QUIC.Spec.payload_encrypt", "original_source_type": "val payload_encrypt (a: ea) (k: AEAD.kv a) (siv: iv_t a) (h: header{~(is_retry h)}) (plain: pbytes)\n : GTot (cbytes)", "source_type": "val payload_encrypt (a: ea) (k: AEAD.kv a) (siv: iv_t a) (h: header{~(is_retry h)}) (plain: pbytes)\n : GTot (cbytes)", "source_definition": "let payload_encrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: iv_t a)\n (h: header { ~ (is_retry h) })\n (plain: pbytes)\n: GTot (cbytes)\n=\n let aad = Parse.format_header h in\n let iv = iv_for_encrypt_decrypt a siv h in\n Seq.seq_reveal (AEAD.encrypt #a k iv (Seq.seq_hide aad) (Seq.seq_hide plain))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 39, "start_col": 1, "end_line": 42, "end_col": 79 }, "file_context": "module QUIC.Spec\n\nopen QUIC.Spec.Lemmas\nopen QUIC.Spec.Header.Base\n\nmodule Seq = QUIC.Secret.Seq\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule H = Spec.Agile.Hash\nmodule HD = Spec.Hash.Definitions\nmodule Cipher = Spec.Agile.Cipher\nmodule AEAD = Spec.Agile.AEAD\nmodule HKDF = Spec.Agile.HKDF\nmodule Parse = QUIC.Spec.Header.Parse\nmodule H = QUIC.Spec.Header\nmodule Secret = QUIC.Secret.Int\n\n/// encryption of a packet\n\nlet iv_for_encrypt_decrypt\n (a: ea)\n (siv: iv_t a)\n (h: header { ~ (is_retry h) })\n: GTot (iv_t a)\n=\n let pn_len = Secret.v (pn_length h) - 1 in\n let seqn = packet_number h in\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pnb = FStar.Endianness.n_to_be 12 (Secret.v seqn) in\n Seq.seq_hide #Secret.U8 (xor_inplace pnb (Seq.seq_reveal siv) 0)\n\nlet payload_encrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: iv_t a)\n (h: header { ~ (is_retry h) })\n (plain: pbytes)", "dependencies": { "source_file": "QUIC.Spec.fst", "checked_file": "QUIC.Spec.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "H", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "HKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "H", "full_module": "Spec.Agile.Hash" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n k: Spec.Agile.AEAD.kv a ->\n siv: QUIC.Spec.iv_t a ->\n h: QUIC.Spec.Header.Base.header{~(QUIC.Spec.Header.Base.is_retry h)} ->\n plain: QUIC.Spec.Crypto.pbytes\n -> Prims.GTot QUIC.Spec.Crypto.cbytes", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.AEAD.kv", "QUIC.Spec.iv_t", "QUIC.Spec.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Spec.Header.Base.is_retry", "QUIC.Spec.Crypto.pbytes", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "Spec.Agile.AEAD.encrypt", "QUIC.Secret.Seq.seq_hide", "QUIC.Spec.iv_for_encrypt_decrypt", "QUIC.Spec.Base.lbytes", "QUIC.Spec.Header.Base.header_len", "QUIC.Spec.Header.Parse.format_header", "QUIC.Spec.Crypto.cbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val payload_encrypt (a: ea) (k: AEAD.kv a) (siv: iv_t a) (h: header{~(is_retry h)}) (plain: pbytes)\n : GTot (cbytes)\nlet payload_encrypt (a: ea) (k: AEAD.kv a) (siv: iv_t a) (h: header{~(is_retry h)}) (plain: pbytes)\n : GTot (cbytes) =", "completed_definiton": "let aad = Parse.format_header h in\nlet iv = iv_for_encrypt_decrypt a siv h in\nSeq.seq_reveal (AEAD.encrypt #a k iv (Seq.seq_hide aad) (Seq.seq_hide plain))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.fst", "name": "QUIC.Spec.encrypt", "original_source_type": "val encrypt:\n a: ea ->\n k: AEAD.kv a ->\n static_iv: iv_t a ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n h: header ->\n plain: pbytes' (is_retry h) ->\n GTot packet", "source_type": "val encrypt:\n a: ea ->\n k: AEAD.kv a ->\n static_iv: iv_t a ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n h: header ->\n plain: pbytes' (is_retry h) ->\n GTot packet", "source_definition": "let encrypt\n a k siv hpk h plain\n=\n let cipher =\n if is_retry h\n then plain\n else payload_encrypt a k siv h plain\n in\n H.header_encrypt a hpk h cipher", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 46, "start_col": 1, "end_line": 52, "end_col": 33 }, "file_context": "module QUIC.Spec\n\nopen QUIC.Spec.Lemmas\nopen QUIC.Spec.Header.Base\n\nmodule Seq = QUIC.Secret.Seq\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule H = Spec.Agile.Hash\nmodule HD = Spec.Hash.Definitions\nmodule Cipher = Spec.Agile.Cipher\nmodule AEAD = Spec.Agile.AEAD\nmodule HKDF = Spec.Agile.HKDF\nmodule Parse = QUIC.Spec.Header.Parse\nmodule H = QUIC.Spec.Header\nmodule Secret = QUIC.Secret.Int\n\n/// encryption of a packet\n\nlet iv_for_encrypt_decrypt\n (a: ea)\n (siv: iv_t a)\n (h: header { ~ (is_retry h) })\n: GTot (iv_t a)\n=\n let pn_len = Secret.v (pn_length h) - 1 in\n let seqn = packet_number h in\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pnb = FStar.Endianness.n_to_be 12 (Secret.v seqn) in\n Seq.seq_hide #Secret.U8 (xor_inplace pnb (Seq.seq_reveal siv) 0)\n\nlet payload_encrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: iv_t a)\n (h: header { ~ (is_retry h) })\n (plain: pbytes)\n: GTot (cbytes)\n=\n let aad = Parse.format_header h in\n let iv = iv_for_encrypt_decrypt a siv h in\n Seq.seq_reveal (AEAD.encrypt #a k iv (Seq.seq_hide aad) (Seq.seq_hide plain))\n\nlet encrypt", "dependencies": { "source_file": "QUIC.Spec.fst", "checked_file": "QUIC.Spec.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "H", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "HKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "H", "full_module": "Spec.Agile.Hash" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n k: Spec.Agile.AEAD.kv a ->\n static_iv: QUIC.Spec.iv_t a ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n h: QUIC.Spec.Header.Base.header ->\n plain: QUIC.Spec.Crypto.pbytes' (QUIC.Spec.Header.Base.is_retry h)\n -> Prims.GTot QUIC.Spec.Crypto.packet", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.AEAD.kv", "QUIC.Spec.iv_t", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "QUIC.Spec.Header.Base.header", "QUIC.Spec.Crypto.pbytes'", "QUIC.Spec.Header.Base.is_retry", "QUIC.Spec.Header.header_encrypt", "QUIC.Spec.Crypto.cbytes'", "Prims.bool", "QUIC.Spec.payload_encrypt", "QUIC.Spec.Crypto.packet" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val encrypt:\n a: ea ->\n k: AEAD.kv a ->\n static_iv: iv_t a ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n h: header ->\n plain: pbytes' (is_retry h) ->\n GTot packet\nlet encrypt a k siv hpk h plain =", "completed_definiton": "let cipher = if is_retry h then plain else payload_encrypt a k siv h plain in\nH.header_encrypt a hpk h cipher", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.fst", "name": "QUIC.Spec.iv_for_encrypt_decrypt", "original_source_type": "val iv_for_encrypt_decrypt (a: ea) (siv: iv_t a) (h: header{~(is_retry h)}) : GTot (iv_t a)", "source_type": "val iv_for_encrypt_decrypt (a: ea) (siv: iv_t a) (h: header{~(is_retry h)}) : GTot (iv_t a)", "source_definition": "let iv_for_encrypt_decrypt\n (a: ea)\n (siv: iv_t a)\n (h: header { ~ (is_retry h) })\n: GTot (iv_t a)\n=\n let pn_len = Secret.v (pn_length h) - 1 in\n let seqn = packet_number h in\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pnb = FStar.Endianness.n_to_be 12 (Secret.v seqn) in\n Seq.seq_hide #Secret.U8 (xor_inplace pnb (Seq.seq_reveal siv) 0)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 25, "start_col": 1, "end_line": 30, "end_col": 66 }, "file_context": "module QUIC.Spec\n\nopen QUIC.Spec.Lemmas\nopen QUIC.Spec.Header.Base\n\nmodule Seq = QUIC.Secret.Seq\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule H = Spec.Agile.Hash\nmodule HD = Spec.Hash.Definitions\nmodule Cipher = Spec.Agile.Cipher\nmodule AEAD = Spec.Agile.AEAD\nmodule HKDF = Spec.Agile.HKDF\nmodule Parse = QUIC.Spec.Header.Parse\nmodule H = QUIC.Spec.Header\nmodule Secret = QUIC.Secret.Int\n\n/// encryption of a packet\n\nlet iv_for_encrypt_decrypt\n (a: ea)\n (siv: iv_t a)\n (h: header { ~ (is_retry h) })", "dependencies": { "source_file": "QUIC.Spec.fst", "checked_file": "QUIC.Spec.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "H", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "HKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "H", "full_module": "Spec.Agile.Hash" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n siv: QUIC.Spec.iv_t a ->\n h: QUIC.Spec.Header.Base.header{~(QUIC.Spec.Header.Base.is_retry h)}\n -> Prims.GTot (QUIC.Spec.iv_t a)", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "QUIC.Spec.iv_t", "QUIC.Spec.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Spec.Header.Base.is_retry", "QUIC.Secret.Seq.seq_hide", "Lib.IntTypes.U8", "QUIC.Spec.Lemmas.xor_inplace", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.SEC", "FStar.Endianness.bytes", "Prims.l_and", "Prims.eq2", "Prims.nat", "FStar.Seq.Base.length", "FStar.UInt8.t", "Lib.IntTypes.v", "Lib.IntTypes.U64", "FStar.Endianness.be_to_n", "FStar.Endianness.n_to_be", "QUIC.Secret.Int.Base.v", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.op_LessThan", "Prims.pow2", "Prims.op_Multiply", "QUIC.Spec.PacketNumber.Base.packet_number_t", "QUIC.Spec.Header.Base.packet_number", "Prims.int", "Prims.op_Subtraction", "Lib.IntTypes.U32", "QUIC.Spec.Header.Base.pn_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val iv_for_encrypt_decrypt (a: ea) (siv: iv_t a) (h: header{~(is_retry h)}) : GTot (iv_t a)\nlet iv_for_encrypt_decrypt (a: ea) (siv: iv_t a) (h: header{~(is_retry h)}) : GTot (iv_t a) =", "completed_definiton": "let pn_len = Secret.v (pn_length h) - 1 in\nlet seqn = packet_number h in\nlet _ = assert_norm (pow2 62 < pow2 (8 `op_Multiply` 12)) in\nlet pnb = FStar.Endianness.n_to_be 12 (Secret.v seqn) in\nSeq.seq_hide #Secret.U8 (xor_inplace pnb (Seq.seq_reveal siv) 0)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.fst", "name": "QUIC.Spec.decrypt", "original_source_type": "val decrypt:\n a: ea ->\n k: AEAD.kv a ->\n static_iv: iv_t a ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n last: nat{last+1 < pow2 62} ->\n cid_len: nat { cid_len <= 20 } ->\n packet: packet ->\n GTot (r: result {\n match r with\n | Failure -> True\n | Success h _ rem ->\n is_valid_header h cid_len last /\\\n Seq.length rem <= Seq.length packet /\\\n rem `Seq.equal` Seq.slice packet (Seq.length packet - Seq.length rem) (Seq.length packet)\n })", "source_type": "val decrypt:\n a: ea ->\n k: AEAD.kv a ->\n static_iv: iv_t a ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n last: nat{last+1 < pow2 62} ->\n cid_len: nat { cid_len <= 20 } ->\n packet: packet ->\n GTot (r: result {\n match r with\n | Failure -> True\n | Success h _ rem ->\n is_valid_header h cid_len last /\\\n Seq.length rem <= Seq.length packet /\\\n rem `Seq.equal` Seq.slice packet (Seq.length packet - Seq.length rem) (Seq.length packet)\n })", "source_definition": "let decrypt\n a k siv hpk last cid_len packet\n=\n let open FStar.Math.Lemmas in\n let open FStar.Endianness in\n match H.header_decrypt a hpk cid_len last packet with\n | H.H_Failure -> Failure\n | H.H_Success h c rem ->\n if is_retry h\n then Success h c rem\n else\n match payload_decrypt a k siv h (Seq.seq_hide c) with\n | None -> Failure\n | Some plain -> Success h (Seq.seq_reveal plain) rem", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 81, "start_col": 2, "end_line": 91, "end_col": 58 }, "file_context": "module QUIC.Spec\n\nopen QUIC.Spec.Lemmas\nopen QUIC.Spec.Header.Base\n\nmodule Seq = QUIC.Secret.Seq\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule H = Spec.Agile.Hash\nmodule HD = Spec.Hash.Definitions\nmodule Cipher = Spec.Agile.Cipher\nmodule AEAD = Spec.Agile.AEAD\nmodule HKDF = Spec.Agile.HKDF\nmodule Parse = QUIC.Spec.Header.Parse\nmodule H = QUIC.Spec.Header\nmodule Secret = QUIC.Secret.Int\n\n/// encryption of a packet\n\nlet iv_for_encrypt_decrypt\n (a: ea)\n (siv: iv_t a)\n (h: header { ~ (is_retry h) })\n: GTot (iv_t a)\n=\n let pn_len = Secret.v (pn_length h) - 1 in\n let seqn = packet_number h in\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pnb = FStar.Endianness.n_to_be 12 (Secret.v seqn) in\n Seq.seq_hide #Secret.U8 (xor_inplace pnb (Seq.seq_reveal siv) 0)\n\nlet payload_encrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: iv_t a)\n (h: header { ~ (is_retry h) })\n (plain: pbytes)\n: GTot (cbytes)\n=\n let aad = Parse.format_header h in\n let iv = iv_for_encrypt_decrypt a siv h in\n Seq.seq_reveal (AEAD.encrypt #a k iv (Seq.seq_hide aad) (Seq.seq_hide plain))\n\nlet encrypt\n a k siv hpk h plain\n=\n let cipher =\n if is_retry h\n then plain\n else payload_encrypt a k siv h plain\n in\n H.header_encrypt a hpk h cipher\n\nlet encrypt_length\n a k siv hpk h plain\n=\n let c =\n if is_retry h\n then plain\n else payload_encrypt a k siv h plain\n in\n H.header_encrypt_length a hpk h c\n\n#restart-solver\n\nlet payload_decrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: iv_t a)\n (h: header { ~ (is_retry h) })\n (c: Seq.seq Secret.uint8 { 16 <= Seq.length c /\\ Seq.length c < max_cipher_length })\n: GTot (option (AEAD.decrypted c))\n= \n let iv = iv_for_encrypt_decrypt a siv h in\n let aad = Parse.format_header h in\n AEAD.decrypt #a k iv (Seq.seq_hide aad) c\n\nlet decrypt\n a k siv hpk last cid_len packet", "dependencies": { "source_file": "QUIC.Spec.fst", "checked_file": "QUIC.Spec.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "H", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "HKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "H", "full_module": "Spec.Agile.Hash" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n k: Spec.Agile.AEAD.kv a ->\n static_iv: QUIC.Spec.iv_t a ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n last: Prims.nat{last + 1 < Prims.pow2 62} ->\n cid_len: Prims.nat{cid_len <= 20} ->\n packet: QUIC.Spec.Crypto.packet\n -> Prims.GTot\n (r:\n QUIC.Spec.result\n { (match r with\n | QUIC.Spec.Failure -> Prims.l_True\n | QUIC.Spec.Success h _ rem ->\n QUIC.Spec.Header.Base.is_valid_header h cid_len last /\\\n FStar.Seq.Base.length rem <= FStar.Seq.Base.length packet /\\\n FStar.Seq.Base.equal rem\n (FStar.Seq.Base.slice packet\n (FStar.Seq.Base.length packet - FStar.Seq.Base.length rem)\n (FStar.Seq.Base.length packet)))\n <:\n Type0 })", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.AEAD.kv", "QUIC.Spec.iv_t", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Prims.op_Addition", "Prims.pow2", "Prims.op_LessThanOrEqual", "QUIC.Spec.Crypto.packet", "QUIC.Spec.Header.header_decrypt", "QUIC.Spec.Failure", "QUIC.Spec.Header.Base.header", "QUIC.Spec.Base.bytes", "QUIC.Spec.Header.Base.is_retry", "Prims.eq2", "Prims.int", "Prims.bool", "Prims.l_and", "QUIC.Spec.Crypto.max_cipher_length", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "QUIC.Spec.Success", "QUIC.Spec.payload_decrypt", "QUIC.Secret.Seq.seq_hide", "Lib.IntTypes.U8", "Spec.Agile.AEAD.decrypted", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.SEC", "QUIC.Spec.result", "Prims.l_True", "QUIC.Spec.Header.Base.is_valid_header", "FStar.Seq.Base.equal", "FStar.Seq.Base.slice", "Prims.op_Subtraction" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val decrypt:\n a: ea ->\n k: AEAD.kv a ->\n static_iv: iv_t a ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n last: nat{last+1 < pow2 62} ->\n cid_len: nat { cid_len <= 20 } ->\n packet: packet ->\n GTot (r: result {\n match r with\n | Failure -> True\n | Success h _ rem ->\n is_valid_header h cid_len last /\\\n Seq.length rem <= Seq.length packet /\\\n rem `Seq.equal` Seq.slice packet (Seq.length packet - Seq.length rem) (Seq.length packet)\n })\nlet decrypt a k siv hpk last cid_len packet =", "completed_definiton": "let open FStar.Math.Lemmas in\nlet open FStar.Endianness in\nmatch H.header_decrypt a hpk cid_len last packet with\n| H.H_Failure -> Failure\n| H.H_Success h c rem ->\n if is_retry h\n then Success h c rem\n else\n match payload_decrypt a k siv h (Seq.seq_hide c) with\n | None -> Failure\n | Some plain -> Success h (Seq.seq_reveal plain) rem", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.fst", "name": "QUIC.Spec.encrypt_length", "original_source_type": "val encrypt_length:\n a: ea ->\n k: AEAD.kv a ->\n static_iv: iv_t a ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n h: header ->\n plain: pbytes' (is_retry h) ->\n Lemma\n (ensures (\n Seq.length (encrypt a k static_iv hpk h plain) ==\n header_len h +\n begin if is_retry h\n then Seq.length plain\n else AEAD.tag_length a + Seq.length plain\n end\n ))", "source_type": "val encrypt_length:\n a: ea ->\n k: AEAD.kv a ->\n static_iv: iv_t a ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n h: header ->\n plain: pbytes' (is_retry h) ->\n Lemma\n (ensures (\n Seq.length (encrypt a k static_iv hpk h plain) ==\n header_len h +\n begin if is_retry h\n then Seq.length plain\n else AEAD.tag_length a + Seq.length plain\n end\n ))", "source_definition": "let encrypt_length\n a k siv hpk h plain\n=\n let c =\n if is_retry h\n then plain\n else payload_encrypt a k siv h plain\n in\n H.header_encrypt_length a hpk h c", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 56, "start_col": 1, "end_line": 62, "end_col": 35 }, "file_context": "module QUIC.Spec\n\nopen QUIC.Spec.Lemmas\nopen QUIC.Spec.Header.Base\n\nmodule Seq = QUIC.Secret.Seq\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule H = Spec.Agile.Hash\nmodule HD = Spec.Hash.Definitions\nmodule Cipher = Spec.Agile.Cipher\nmodule AEAD = Spec.Agile.AEAD\nmodule HKDF = Spec.Agile.HKDF\nmodule Parse = QUIC.Spec.Header.Parse\nmodule H = QUIC.Spec.Header\nmodule Secret = QUIC.Secret.Int\n\n/// encryption of a packet\n\nlet iv_for_encrypt_decrypt\n (a: ea)\n (siv: iv_t a)\n (h: header { ~ (is_retry h) })\n: GTot (iv_t a)\n=\n let pn_len = Secret.v (pn_length h) - 1 in\n let seqn = packet_number h in\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pnb = FStar.Endianness.n_to_be 12 (Secret.v seqn) in\n Seq.seq_hide #Secret.U8 (xor_inplace pnb (Seq.seq_reveal siv) 0)\n\nlet payload_encrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: iv_t a)\n (h: header { ~ (is_retry h) })\n (plain: pbytes)\n: GTot (cbytes)\n=\n let aad = Parse.format_header h in\n let iv = iv_for_encrypt_decrypt a siv h in\n Seq.seq_reveal (AEAD.encrypt #a k iv (Seq.seq_hide aad) (Seq.seq_hide plain))\n\nlet encrypt\n a k siv hpk h plain\n=\n let cipher =\n if is_retry h\n then plain\n else payload_encrypt a k siv h plain\n in\n H.header_encrypt a hpk h cipher\n\nlet encrypt_length", "dependencies": { "source_file": "QUIC.Spec.fst", "checked_file": "QUIC.Spec.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "H", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "HKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "H", "full_module": "Spec.Agile.Hash" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n k: Spec.Agile.AEAD.kv a ->\n static_iv: QUIC.Spec.iv_t a ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n h: QUIC.Spec.Header.Base.header ->\n plain: QUIC.Spec.Crypto.pbytes' (QUIC.Spec.Header.Base.is_retry h)\n -> FStar.Pervasives.Lemma\n (ensures\n FStar.Seq.Base.length (QUIC.Spec.encrypt a k static_iv hpk h plain) ==\n QUIC.Spec.Header.Base.header_len h +\n (match QUIC.Spec.Header.Base.is_retry h with\n | true -> FStar.Seq.Base.length plain\n | _ -> Spec.Agile.AEAD.tag_length a + FStar.Seq.Base.length plain))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.AEAD.kv", "QUIC.Spec.iv_t", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "QUIC.Spec.Header.Base.header", "QUIC.Spec.Crypto.pbytes'", "QUIC.Spec.Header.Base.is_retry", "QUIC.Spec.Header.header_encrypt_length", "QUIC.Spec.Crypto.cbytes'", "Prims.bool", "QUIC.Spec.payload_encrypt", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val encrypt_length:\n a: ea ->\n k: AEAD.kv a ->\n static_iv: iv_t a ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n h: header ->\n plain: pbytes' (is_retry h) ->\n Lemma\n (ensures (\n Seq.length (encrypt a k static_iv hpk h plain) ==\n header_len h +\n begin if is_retry h\n then Seq.length plain\n else AEAD.tag_length a + Seq.length plain\n end\n ))\nlet encrypt_length a k siv hpk h plain =", "completed_definiton": "let c = if is_retry h then plain else payload_encrypt a k siv h plain in\nH.header_encrypt_length a hpk h c", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.fst", "name": "QUIC.Spec.lemma_encrypt_correct", "original_source_type": "val lemma_encrypt_correct:\n a: ea ->\n k: AEAD.kv a ->\n siv: iv_t a ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n h: header ->\n cid_len: nat { cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h) } ->\n last: nat{last+1 < pow2 62 } ->\n p: pbytes' (is_retry h) { has_payload_length h ==> Secret.v (payload_length h) == Seq.length p + AEAD.tag_length a } -> Lemma\n (requires (\n (~ (is_retry h)) ==> (\n PN.in_window (Secret.v (pn_length h) - 1) last (Secret.v (packet_number h))\n )))\n (ensures (\n decrypt a k siv hpk last cid_len\n (encrypt a k siv hpk h p)\n == Success h p Seq.empty\n ))", "source_type": "val lemma_encrypt_correct:\n a: ea ->\n k: AEAD.kv a ->\n siv: iv_t a ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n h: header ->\n cid_len: nat { cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h) } ->\n last: nat{last+1 < pow2 62 } ->\n p: pbytes' (is_retry h) { has_payload_length h ==> Secret.v (payload_length h) == Seq.length p + AEAD.tag_length a } -> Lemma\n (requires (\n (~ (is_retry h)) ==> (\n PN.in_window (Secret.v (pn_length h) - 1) last (Secret.v (packet_number h))\n )))\n (ensures (\n decrypt a k siv hpk last cid_len\n (encrypt a k siv hpk h p)\n == Success h p Seq.empty\n ))", "source_definition": "let lemma_encrypt_correct\n a k siv hpk h cid_len last plain\n=\n let packet = encrypt a k siv hpk h plain in\n let aad = Seq.seq_hide (Parse.format_header h) in\n let cipher = if is_retry h then plain else\n let iv = iv_for_encrypt_decrypt a siv h in\n Seq.seq_reveal (AEAD.encrypt #a k iv aad (Seq.seq_hide plain))\n in\n assert (packet == H.header_encrypt a hpk h cipher);\n H.lemma_header_encryption_correct a hpk h cid_len last cipher;\n if is_retry h\n then ()\n else begin\n let iv = iv_for_encrypt_decrypt a siv h in\n let dc = H.header_decrypt a hpk cid_len last packet in\n assert (H.H_Success? dc);\n let H.H_Success h' c' rem' = dc in\n assert (h == h' /\\ cipher == c');\n let clen = Seq.length cipher in\n assert (19 <= clen && clen < max_cipher_length);\n AEAD.correctness #a k iv aad (Seq.seq_hide plain)\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 97, "start_col": 1, "end_line": 117, "end_col": 5 }, "file_context": "module QUIC.Spec\n\nopen QUIC.Spec.Lemmas\nopen QUIC.Spec.Header.Base\n\nmodule Seq = QUIC.Secret.Seq\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule H = Spec.Agile.Hash\nmodule HD = Spec.Hash.Definitions\nmodule Cipher = Spec.Agile.Cipher\nmodule AEAD = Spec.Agile.AEAD\nmodule HKDF = Spec.Agile.HKDF\nmodule Parse = QUIC.Spec.Header.Parse\nmodule H = QUIC.Spec.Header\nmodule Secret = QUIC.Secret.Int\n\n/// encryption of a packet\n\nlet iv_for_encrypt_decrypt\n (a: ea)\n (siv: iv_t a)\n (h: header { ~ (is_retry h) })\n: GTot (iv_t a)\n=\n let pn_len = Secret.v (pn_length h) - 1 in\n let seqn = packet_number h in\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pnb = FStar.Endianness.n_to_be 12 (Secret.v seqn) in\n Seq.seq_hide #Secret.U8 (xor_inplace pnb (Seq.seq_reveal siv) 0)\n\nlet payload_encrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: iv_t a)\n (h: header { ~ (is_retry h) })\n (plain: pbytes)\n: GTot (cbytes)\n=\n let aad = Parse.format_header h in\n let iv = iv_for_encrypt_decrypt a siv h in\n Seq.seq_reveal (AEAD.encrypt #a k iv (Seq.seq_hide aad) (Seq.seq_hide plain))\n\nlet encrypt\n a k siv hpk h plain\n=\n let cipher =\n if is_retry h\n then plain\n else payload_encrypt a k siv h plain\n in\n H.header_encrypt a hpk h cipher\n\nlet encrypt_length\n a k siv hpk h plain\n=\n let c =\n if is_retry h\n then plain\n else payload_encrypt a k siv h plain\n in\n H.header_encrypt_length a hpk h c\n\n#restart-solver\n\nlet payload_decrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: iv_t a)\n (h: header { ~ (is_retry h) })\n (c: Seq.seq Secret.uint8 { 16 <= Seq.length c /\\ Seq.length c < max_cipher_length })\n: GTot (option (AEAD.decrypted c))\n= \n let iv = iv_for_encrypt_decrypt a siv h in\n let aad = Parse.format_header h in\n AEAD.decrypt #a k iv (Seq.seq_hide aad) c\n\nlet decrypt\n a k siv hpk last cid_len packet\n=\n let open FStar.Math.Lemmas in\n let open FStar.Endianness in\n match H.header_decrypt a hpk cid_len last packet with\n | H.H_Failure -> Failure\n | H.H_Success h c rem ->\n if is_retry h\n then Success h c rem\n else\n match payload_decrypt a k siv h (Seq.seq_hide c) with\n | None -> Failure\n | Some plain -> Success h (Seq.seq_reveal plain) rem\n\n#push-options \"--z3rlimit 20\"\n\nlet lemma_encrypt_correct", "dependencies": { "source_file": "QUIC.Spec.fst", "checked_file": "QUIC.Spec.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "H", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "HKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "H", "full_module": "Spec.Agile.Hash" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 20, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n k: Spec.Agile.AEAD.kv a ->\n siv: QUIC.Spec.iv_t a ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n h: QUIC.Spec.Header.Base.header ->\n cid_len: Prims.nat{cid_len <= 20 /\\ (MShort? h ==> cid_len == QUIC.Spec.Header.Base.dcid_len h)} ->\n last: Prims.nat{last + 1 < Prims.pow2 62} ->\n p:\n QUIC.Spec.Crypto.pbytes' (QUIC.Spec.Header.Base.is_retry h)\n { QUIC.Spec.Header.Base.has_payload_length h ==>\n QUIC.Secret.Int.Base.v (QUIC.Spec.Header.Base.payload_length h) ==\n FStar.Seq.Base.length p + Spec.Agile.AEAD.tag_length a }\n -> FStar.Pervasives.Lemma\n (requires\n ~(QUIC.Spec.Header.Base.is_retry h) ==>\n QUIC.Spec.PacketNumber.Base.in_window (QUIC.Secret.Int.Base.v (QUIC.Spec.Header.Base.pn_length\n h) -\n 1)\n last\n (QUIC.Secret.Int.Base.v (QUIC.Spec.Header.Base.packet_number h)))\n (ensures\n QUIC.Spec.decrypt a k siv hpk last cid_len (QUIC.Spec.encrypt a k siv hpk h p) ==\n QUIC.Spec.Success h p FStar.Seq.Base.empty)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.AEAD.kv", "QUIC.Spec.iv_t", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "QUIC.Spec.Header.Base.header", "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.l_imp", "QUIC.Spec.Header.Base.uu___is_MShort", "Prims.eq2", "QUIC.Spec.Header.Base.dcid_len", "Prims.op_LessThan", "Prims.op_Addition", "Prims.pow2", "QUIC.Spec.Crypto.pbytes'", "QUIC.Spec.Header.Base.is_retry", "QUIC.Spec.Header.Base.has_payload_length", "Prims.int", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "QUIC.Spec.Header.Base.payload_length", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "Spec.Agile.AEAD.tag_length", "Prims.bool", "QUIC.Spec.Base.bytes", "QUIC.Spec.Crypto.max_cipher_length", "Spec.Agile.AEAD.correctness", "QUIC.Secret.Seq.seq_hide", "Lib.IntTypes.U8", "Prims.unit", "Prims._assert", "Prims.op_AmpAmp", "FStar.Seq.Base.seq", "Prims.l_or", "Prims.logical", "Lib.IntTypes.range", "Prims.op_GreaterThanOrEqual", "QUIC.Spec.Header.h_result", "Prims.l_True", "QUIC.Spec.Header.Base.is_valid_header", "FStar.Seq.Base.equal", "FStar.Seq.Base.slice", "Prims.op_Subtraction", "QUIC.Spec.Header.uu___is_H_Success", "QUIC.Spec.Header.header_decrypt", "QUIC.Spec.iv_for_encrypt_decrypt", "QUIC.Spec.Header.lemma_header_encryption_correct", "QUIC.Spec.Crypto.packet", "QUIC.Spec.Header.header_encrypt", "Lib.IntTypes.v", "QUIC.Secret.Seq.seq_reveal", "Spec.Agile.AEAD.encrypt", "Lib.IntTypes.int_t", "QUIC.Spec.Header.Parse.format_header", "QUIC.Spec.encrypt" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_encrypt_correct:\n a: ea ->\n k: AEAD.kv a ->\n siv: iv_t a ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n h: header ->\n cid_len: nat { cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h) } ->\n last: nat{last+1 < pow2 62 } ->\n p: pbytes' (is_retry h) { has_payload_length h ==> Secret.v (payload_length h) == Seq.length p + AEAD.tag_length a } -> Lemma\n (requires (\n (~ (is_retry h)) ==> (\n PN.in_window (Secret.v (pn_length h) - 1) last (Secret.v (packet_number h))\n )))\n (ensures (\n decrypt a k siv hpk last cid_len\n (encrypt a k siv hpk h p)\n == Success h p Seq.empty\n ))\nlet lemma_encrypt_correct a k siv hpk h cid_len last plain =", "completed_definiton": "let packet = encrypt a k siv hpk h plain in\nlet aad = Seq.seq_hide (Parse.format_header h) in\nlet cipher =\n if is_retry h\n then plain\n else\n let iv = iv_for_encrypt_decrypt a siv h in\n Seq.seq_reveal (AEAD.encrypt #a k iv aad (Seq.seq_hide plain))\nin\nassert (packet == H.header_encrypt a hpk h cipher);\nH.lemma_header_encryption_correct a hpk h cid_len last cipher;\nif is_retry h\nthen ()\nelse\n let iv = iv_for_encrypt_decrypt a siv h in\n let dc = H.header_decrypt a hpk cid_len last packet in\n assert (H.H_Success? dc);\n let H.H_Success h' c' rem' = dc in\n assert (h == h' /\\ cipher == c');\n let clen = Seq.length cipher in\n assert (19 <= clen && clen < max_cipher_length);\n AEAD.correctness #a k iv aad (Seq.seq_hide plain)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Aux.fst", "name": "QUIC.Secret.Int.Aux.logor_one_bit", "original_source_type": "val logor_one_bit\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n (y: int_t t sec {v y == 0 \\/ v y == 1})\n : Tot (z: int_t t sec {v z == (if v x = 1 || v y = 1 then 1 else 0)})", "source_type": "val logor_one_bit\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n (y: int_t t sec {v y == 0 \\/ v y == 1})\n : Tot (z: int_t t sec {v z == (if v x = 1 || v y = 1 then 1 else 0)})", "source_definition": "let logor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 || v y = 1 then 1 else 0) })\n= logor_one_bit' x y;\n x `logor` y", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Aux.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 99, "start_col": 2, "end_line": 100, "end_col": 13 }, "file_context": "module QUIC.Secret.Int.Aux\ninclude QUIC.Secret.Int.Base\n\nmodule U = FStar.UInt\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoextract noeq type must_inline =\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\n= x `mul` y\n\nlet logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logor 0uy 0uy == 0uy);\n assert (U8.logor 0uy 1uy == 1uy);\n assert (U8.logor 1uy 0uy == 1uy);\n assert (U8.logor 1uy 1uy == 1uy)\n\nlet logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logor 0us 0us == 0us);\n assert (U16.logor 0us 1us == 1us);\n assert (U16.logor 1us 0us == 1us);\n assert (U16.logor 1us 1us == 1us)\n\nlet logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logor 0ul 0ul == 0ul);\n assert (U32.logor 0ul 1ul == 1ul);\n assert (U32.logor 1ul 0ul == 1ul);\n assert (U32.logor 1ul 1ul == 1ul)\n\nlet logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logor 0uL 0uL == 0uL);\n assert (U64.logor 0uL 1uL == 1uL);\n assert (U64.logor 1uL 0uL == 1uL);\n assert (U64.logor 1uL 1uL == 1uL)\n\nlet logor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= match t with\n | U8 -> logor_one_bit_8 sec x y\n | U16 -> logor_one_bit_16 sec x y\n | U32 -> logor_one_bit_32 sec x y\n | U64 -> logor_one_bit_64 sec x y\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nnoextract\nlet logor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })", "dependencies": { "source_file": "QUIC.Secret.Int.Aux.fst", "checked_file": "QUIC.Secret.Int.Aux.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x: Lib.IntTypes.int_t t sec {QUIC.Secret.Int.Base.v x == 0 \\/ QUIC.Secret.Int.Base.v x == 1} ->\n y: Lib.IntTypes.int_t t sec {QUIC.Secret.Int.Base.v y == 0 \\/ QUIC.Secret.Int.Base.v y == 1}\n -> z:\n Lib.IntTypes.int_t t sec\n { QUIC.Secret.Int.Base.v z ==\n (match QUIC.Secret.Int.Base.v x = 1 || QUIC.Secret.Int.Base.v y = 1 with\n | true -> 1\n | _ -> 0) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "QUIC.Secret.Int.Base.supported_type", "Lib.IntTypes.secrecy_level", "Lib.IntTypes.int_t", "Prims.l_or", "Prims.eq2", "Prims.int", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.logor", "Prims.unit", "QUIC.Secret.Int.Aux.logor_one_bit'", "Prims.op_BarBar", "Prims.op_Equality", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val logor_one_bit\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n (y: int_t t sec {v y == 0 \\/ v y == 1})\n : Tot (z: int_t t sec {v z == (if v x = 1 || v y = 1 then 1 else 0)})\nlet logor_one_bit\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n (y: int_t t sec {v y == 0 \\/ v y == 1})\n : Tot (z: int_t t sec {v z == (if v x = 1 || v y = 1 then 1 else 0)}) =", "completed_definiton": "logor_one_bit' x y;\nx `logor` y", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Aux.fst", "name": "QUIC.Secret.Int.Aux.logxor_one_bit", "original_source_type": "val logxor_one_bit\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n (y: int_t t sec {v y == 0 \\/ v y == 1})\n : Tot (z: int_t t sec {v z == (if v x = v y then 0 else 1)})", "source_type": "val logxor_one_bit\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n (y: int_t t sec {v y == 0 \\/ v y == 1})\n : Tot (z: int_t t sec {v z == (if v x = v y then 0 else 1)})", "source_definition": "let logxor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = v y then 0 else 1) })\n= logxor_one_bit' x y;\n x `logxor` y", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Aux.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 178, "start_col": 2, "end_line": 179, "end_col": 14 }, "file_context": "module QUIC.Secret.Int.Aux\ninclude QUIC.Secret.Int.Base\n\nmodule U = FStar.UInt\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoextract noeq type must_inline =\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\n= x `mul` y\n\nlet logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logor 0uy 0uy == 0uy);\n assert (U8.logor 0uy 1uy == 1uy);\n assert (U8.logor 1uy 0uy == 1uy);\n assert (U8.logor 1uy 1uy == 1uy)\n\nlet logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logor 0us 0us == 0us);\n assert (U16.logor 0us 1us == 1us);\n assert (U16.logor 1us 0us == 1us);\n assert (U16.logor 1us 1us == 1us)\n\nlet logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logor 0ul 0ul == 0ul);\n assert (U32.logor 0ul 1ul == 1ul);\n assert (U32.logor 1ul 0ul == 1ul);\n assert (U32.logor 1ul 1ul == 1ul)\n\nlet logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logor 0uL 0uL == 0uL);\n assert (U64.logor 0uL 1uL == 1uL);\n assert (U64.logor 1uL 0uL == 1uL);\n assert (U64.logor 1uL 1uL == 1uL)\n\nlet logor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= match t with\n | U8 -> logor_one_bit_8 sec x y\n | U16 -> logor_one_bit_16 sec x y\n | U32 -> logor_one_bit_32 sec x y\n | U64 -> logor_one_bit_64 sec x y\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nnoextract\nlet logor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 || v y = 1 then 1 else 0) })\n= logor_one_bit' x y;\n x `logor` y\n\n\n\nlet logxor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logxor 0uy 0uy == 0uy);\n assert (U8.logxor 0uy 1uy == 1uy);\n assert (U8.logxor 1uy 0uy == 1uy);\n assert (U8.logxor 1uy 1uy == 0uy)\n\nlet logxor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logxor 0us 0us == 0us);\n assert (U16.logxor 0us 1us == 1us);\n assert (U16.logxor 1us 0us == 1us);\n assert (U16.logxor 1us 1us == 0us)\n\nlet logxor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logxor 0ul 0ul == 0ul);\n assert (U32.logxor 0ul 1ul == 1ul);\n assert (U32.logxor 1ul 0ul == 1ul);\n assert (U32.logxor 1ul 1ul == 0ul)\n\nlet logxor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logxor 0uL 0uL == 0uL);\n assert (U64.logxor 0uL 1uL == 1uL);\n assert (U64.logxor 1uL 0uL == 1uL);\n assert (U64.logxor 1uL 1uL == 0uL)\n\nlet logxor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= match t with\n | U8 -> logxor_one_bit_8 sec x y\n | U16 -> logxor_one_bit_16 sec x y\n | U32 -> logxor_one_bit_32 sec x y\n | U64 -> logxor_one_bit_64 sec x y\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logxor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })", "dependencies": { "source_file": "QUIC.Secret.Int.Aux.fst", "checked_file": "QUIC.Secret.Int.Aux.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x: Lib.IntTypes.int_t t sec {QUIC.Secret.Int.Base.v x == 0 \\/ QUIC.Secret.Int.Base.v x == 1} ->\n y: Lib.IntTypes.int_t t sec {QUIC.Secret.Int.Base.v y == 0 \\/ QUIC.Secret.Int.Base.v y == 1}\n -> z:\n Lib.IntTypes.int_t t sec\n { QUIC.Secret.Int.Base.v z ==\n (match QUIC.Secret.Int.Base.v x = QUIC.Secret.Int.Base.v y with\n | true -> 0\n | _ -> 1) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "QUIC.Secret.Int.Base.supported_type", "Lib.IntTypes.secrecy_level", "Lib.IntTypes.int_t", "Prims.l_or", "Prims.eq2", "Prims.int", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.logxor", "Prims.unit", "QUIC.Secret.Int.Aux.logxor_one_bit'", "Prims.op_Equality", "Lib.IntTypes.range_t", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val logxor_one_bit\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n (y: int_t t sec {v y == 0 \\/ v y == 1})\n : Tot (z: int_t t sec {v z == (if v x = v y then 0 else 1)})\nlet logxor_one_bit\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n (y: int_t t sec {v y == 0 \\/ v y == 1})\n : Tot (z: int_t t sec {v z == (if v x = v y then 0 else 1)}) =", "completed_definiton": "logxor_one_bit' x y;\nx `logxor` y", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Aux.fst", "name": "QUIC.Secret.Int.Aux.lognot_one_bit", "original_source_type": "val lognot_one_bit\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n : Tot (z: int_t t sec {v z == (if v x = 1 then 0 else 1)})", "source_type": "val lognot_one_bit\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n : Tot (z: int_t t sec {v z == (if v x = 1 then 0 else 1)})", "source_definition": "let lognot_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 then 0 else 1) })\n= x `logxor_one_bit` secret_bool true", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Aux.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 200, "start_col": 2, "end_line": 200, "end_col": 37 }, "file_context": "module QUIC.Secret.Int.Aux\ninclude QUIC.Secret.Int.Base\n\nmodule U = FStar.UInt\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoextract noeq type must_inline =\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\n= x `mul` y\n\nlet logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logor 0uy 0uy == 0uy);\n assert (U8.logor 0uy 1uy == 1uy);\n assert (U8.logor 1uy 0uy == 1uy);\n assert (U8.logor 1uy 1uy == 1uy)\n\nlet logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logor 0us 0us == 0us);\n assert (U16.logor 0us 1us == 1us);\n assert (U16.logor 1us 0us == 1us);\n assert (U16.logor 1us 1us == 1us)\n\nlet logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logor 0ul 0ul == 0ul);\n assert (U32.logor 0ul 1ul == 1ul);\n assert (U32.logor 1ul 0ul == 1ul);\n assert (U32.logor 1ul 1ul == 1ul)\n\nlet logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logor 0uL 0uL == 0uL);\n assert (U64.logor 0uL 1uL == 1uL);\n assert (U64.logor 1uL 0uL == 1uL);\n assert (U64.logor 1uL 1uL == 1uL)\n\nlet logor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= match t with\n | U8 -> logor_one_bit_8 sec x y\n | U16 -> logor_one_bit_16 sec x y\n | U32 -> logor_one_bit_32 sec x y\n | U64 -> logor_one_bit_64 sec x y\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nnoextract\nlet logor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 || v y = 1 then 1 else 0) })\n= logor_one_bit' x y;\n x `logor` y\n\n\n\nlet logxor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logxor 0uy 0uy == 0uy);\n assert (U8.logxor 0uy 1uy == 1uy);\n assert (U8.logxor 1uy 0uy == 1uy);\n assert (U8.logxor 1uy 1uy == 0uy)\n\nlet logxor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logxor 0us 0us == 0us);\n assert (U16.logxor 0us 1us == 1us);\n assert (U16.logxor 1us 0us == 1us);\n assert (U16.logxor 1us 1us == 0us)\n\nlet logxor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logxor 0ul 0ul == 0ul);\n assert (U32.logxor 0ul 1ul == 1ul);\n assert (U32.logxor 1ul 0ul == 1ul);\n assert (U32.logxor 1ul 1ul == 0ul)\n\nlet logxor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logxor 0uL 0uL == 0uL);\n assert (U64.logxor 0uL 1uL == 1uL);\n assert (U64.logxor 1uL 0uL == 1uL);\n assert (U64.logxor 1uL 1uL == 0uL)\n\nlet logxor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= match t with\n | U8 -> logxor_one_bit_8 sec x y\n | U16 -> logxor_one_bit_16 sec x y\n | U32 -> logxor_one_bit_32 sec x y\n | U64 -> logxor_one_bit_64 sec x y\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logxor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = v y then 0 else 1) })\n= logxor_one_bit' x y;\n x `logxor` y\n\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet secret_bool\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: bool)\n: Tot (z: int_t t sec { v z == (if x then 1 else 0) })\n= cast t sec (if x then 1uy else 0uy)\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet lognot_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })", "dependencies": { "source_file": "QUIC.Secret.Int.Aux.fst", "checked_file": "QUIC.Secret.Int.Aux.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Lib.IntTypes.int_t t sec {QUIC.Secret.Int.Base.v x == 0 \\/ QUIC.Secret.Int.Base.v x == 1}\n -> z:\n Lib.IntTypes.int_t t sec\n { QUIC.Secret.Int.Base.v z ==\n (match QUIC.Secret.Int.Base.v x = 1 with\n | true -> 0\n | _ -> 1) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "QUIC.Secret.Int.Base.supported_type", "Lib.IntTypes.secrecy_level", "Lib.IntTypes.int_t", "Prims.l_or", "Prims.eq2", "Prims.int", "QUIC.Secret.Int.Base.v", "QUIC.Secret.Int.Aux.logxor_one_bit", "QUIC.Secret.Int.Aux.secret_bool", "Prims.op_Equality", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lognot_one_bit\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n : Tot (z: int_t t sec {v z == (if v x = 1 then 0 else 1)})\nlet lognot_one_bit\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n : Tot (z: int_t t sec {v z == (if v x = 1 then 0 else 1)}) =", "completed_definiton": "x `logxor_one_bit` (secret_bool true)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Aux.fst", "name": "QUIC.Secret.Int.Aux.min64", "original_source_type": "val min64\n (x y: uint64)\n: Tot (z: uint64 { v z == (if v x <= v y then v x else v y) })", "source_type": "val min64\n (x y: uint64)\n: Tot (z: uint64 { v z == (if v x <= v y then v x else v y) })", "source_definition": "let min64\n x y\n= min x y", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Aux.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 267, "start_col": 2, "end_line": 267, "end_col": 9 }, "file_context": "module QUIC.Secret.Int.Aux\ninclude QUIC.Secret.Int.Base\n\nmodule U = FStar.UInt\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoextract noeq type must_inline =\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\n= x `mul` y\n\nlet logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logor 0uy 0uy == 0uy);\n assert (U8.logor 0uy 1uy == 1uy);\n assert (U8.logor 1uy 0uy == 1uy);\n assert (U8.logor 1uy 1uy == 1uy)\n\nlet logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logor 0us 0us == 0us);\n assert (U16.logor 0us 1us == 1us);\n assert (U16.logor 1us 0us == 1us);\n assert (U16.logor 1us 1us == 1us)\n\nlet logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logor 0ul 0ul == 0ul);\n assert (U32.logor 0ul 1ul == 1ul);\n assert (U32.logor 1ul 0ul == 1ul);\n assert (U32.logor 1ul 1ul == 1ul)\n\nlet logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logor 0uL 0uL == 0uL);\n assert (U64.logor 0uL 1uL == 1uL);\n assert (U64.logor 1uL 0uL == 1uL);\n assert (U64.logor 1uL 1uL == 1uL)\n\nlet logor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= match t with\n | U8 -> logor_one_bit_8 sec x y\n | U16 -> logor_one_bit_16 sec x y\n | U32 -> logor_one_bit_32 sec x y\n | U64 -> logor_one_bit_64 sec x y\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nnoextract\nlet logor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 || v y = 1 then 1 else 0) })\n= logor_one_bit' x y;\n x `logor` y\n\n\n\nlet logxor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logxor 0uy 0uy == 0uy);\n assert (U8.logxor 0uy 1uy == 1uy);\n assert (U8.logxor 1uy 0uy == 1uy);\n assert (U8.logxor 1uy 1uy == 0uy)\n\nlet logxor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logxor 0us 0us == 0us);\n assert (U16.logxor 0us 1us == 1us);\n assert (U16.logxor 1us 0us == 1us);\n assert (U16.logxor 1us 1us == 0us)\n\nlet logxor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logxor 0ul 0ul == 0ul);\n assert (U32.logxor 0ul 1ul == 1ul);\n assert (U32.logxor 1ul 0ul == 1ul);\n assert (U32.logxor 1ul 1ul == 0ul)\n\nlet logxor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logxor 0uL 0uL == 0uL);\n assert (U64.logxor 0uL 1uL == 1uL);\n assert (U64.logxor 1uL 0uL == 1uL);\n assert (U64.logxor 1uL 1uL == 0uL)\n\nlet logxor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= match t with\n | U8 -> logxor_one_bit_8 sec x y\n | U16 -> logxor_one_bit_16 sec x y\n | U32 -> logxor_one_bit_32 sec x y\n | U64 -> logxor_one_bit_64 sec x y\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logxor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = v y then 0 else 1) })\n= logxor_one_bit' x y;\n x `logxor` y\n\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet secret_bool\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: bool)\n: Tot (z: int_t t sec { v z == (if x then 1 else 0) })\n= cast t sec (if x then 1uy else 0uy)\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet lognot_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 then 0 else 1) })\n= x `logxor_one_bit` secret_bool true\n\n#push-options \"--z3rlimit 32\"\n\n[@\"opaque_to_smt\"]\nnoextract\ninline_for_extraction\nlet ff00_to_10\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == U.ones (bits t) })\n: Tot (y: int_t t sec { v y == (if v x = 0 then 0 else 1) })\n= logand_zeros (mk_int #t #sec 1);\n logand_ones (mk_int #t #sec 1);\n mk_int 1 `logand` x\n\n#pop-options\n\n[@\"opaque_to_smt\"]\nnoextract\ninline_for_extraction\nlet secrets_are_equal\n (#t: inttype { supported_type t })\n (x: int_t t SEC)\n (y: int_t t SEC)\n: Tot (z: int_t t SEC { v z == (if v x = v y then 1 else 0) })\n (decreases (size))\n= ff00_to_10 (eq_mask x y)\n\n[@\"opaque_to_smt\"]\nnoextract\ninline_for_extraction\nlet secret_is_lt\n (#t: inttype { supported_type t })\n (x: int_t t SEC)\n (y: int_t t SEC)\n: Tot (z: int_t t SEC { v z == (if v x < v y then 1 else 0) })\n (decreases (size))\n= ff00_to_10 (lt_mask x y)\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\" must_inline]\nlet min\n (#t: inttype { supported_type t })\n (x y: uint_t t SEC)\n: Tot (z: uint_t t SEC { v z == (if v x <= v y then v x else v y) })\n=\n let cond = secret_is_lt x y in\n (cond `mul` x) `add` (lognot_one_bit cond `mul` y)\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\" must_inline]\nlet max\n (#t: inttype { supported_type t })\n (x y: uint_t t SEC)\n: Tot (z: uint_t t SEC { v z == (if v y <= v x then v x else v y) })\n= let cond = secret_is_lt y x in\n (cond `mul` x) `add` (lognot_one_bit cond `mul` y)\n\nval min64\n (x y: uint64)\n: Tot (z: uint64 { v z == (if v x <= v y then v x else v y) })\n\nlet min64", "dependencies": { "source_file": "QUIC.Secret.Int.Aux.fst", "checked_file": "QUIC.Secret.Int.Aux.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Lib.IntTypes.uint64 -> y: Lib.IntTypes.uint64\n -> z:\n Lib.IntTypes.uint64\n { QUIC.Secret.Int.Base.v z ==\n (match QUIC.Secret.Int.Base.v x <= QUIC.Secret.Int.Base.v y with\n | true -> QUIC.Secret.Int.Base.v x\n | _ -> QUIC.Secret.Int.Base.v y) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.uint64", "QUIC.Secret.Int.Aux.min", "Lib.IntTypes.U64", "Prims.eq2", "Lib.IntTypes.range_t", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.SEC", "Prims.op_LessThanOrEqual", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val min64\n (x y: uint64)\n: Tot (z: uint64 { v z == (if v x <= v y then v x else v y) })\nlet min64 x y =", "completed_definiton": "min x y", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Aux.fst", "name": "QUIC.Secret.Int.Aux.secret_is_lt", "original_source_type": "val secret_is_lt (#t: inttype{supported_type t}) (x y: int_t t SEC)\n : Tot (z: int_t t SEC {v z == (if v x < v y then 1 else 0)}) (decreases (size))", "source_type": "val secret_is_lt (#t: inttype{supported_type t}) (x y: int_t t SEC)\n : Tot (z: int_t t SEC {v z == (if v x < v y then 1 else 0)}) (decreases (size))", "source_definition": "let secret_is_lt\n (#t: inttype { supported_type t })\n (x: int_t t SEC)\n (y: int_t t SEC)\n: Tot (z: int_t t SEC { v z == (if v x < v y then 1 else 0) })\n (decreases (size))\n= ff00_to_10 (lt_mask x y)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Aux.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 238, "start_col": 2, "end_line": 238, "end_col": 26 }, "file_context": "module QUIC.Secret.Int.Aux\ninclude QUIC.Secret.Int.Base\n\nmodule U = FStar.UInt\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoextract noeq type must_inline =\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\n= x `mul` y\n\nlet logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logor 0uy 0uy == 0uy);\n assert (U8.logor 0uy 1uy == 1uy);\n assert (U8.logor 1uy 0uy == 1uy);\n assert (U8.logor 1uy 1uy == 1uy)\n\nlet logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logor 0us 0us == 0us);\n assert (U16.logor 0us 1us == 1us);\n assert (U16.logor 1us 0us == 1us);\n assert (U16.logor 1us 1us == 1us)\n\nlet logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logor 0ul 0ul == 0ul);\n assert (U32.logor 0ul 1ul == 1ul);\n assert (U32.logor 1ul 0ul == 1ul);\n assert (U32.logor 1ul 1ul == 1ul)\n\nlet logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logor 0uL 0uL == 0uL);\n assert (U64.logor 0uL 1uL == 1uL);\n assert (U64.logor 1uL 0uL == 1uL);\n assert (U64.logor 1uL 1uL == 1uL)\n\nlet logor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= match t with\n | U8 -> logor_one_bit_8 sec x y\n | U16 -> logor_one_bit_16 sec x y\n | U32 -> logor_one_bit_32 sec x y\n | U64 -> logor_one_bit_64 sec x y\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nnoextract\nlet logor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 || v y = 1 then 1 else 0) })\n= logor_one_bit' x y;\n x `logor` y\n\n\n\nlet logxor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logxor 0uy 0uy == 0uy);\n assert (U8.logxor 0uy 1uy == 1uy);\n assert (U8.logxor 1uy 0uy == 1uy);\n assert (U8.logxor 1uy 1uy == 0uy)\n\nlet logxor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logxor 0us 0us == 0us);\n assert (U16.logxor 0us 1us == 1us);\n assert (U16.logxor 1us 0us == 1us);\n assert (U16.logxor 1us 1us == 0us)\n\nlet logxor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logxor 0ul 0ul == 0ul);\n assert (U32.logxor 0ul 1ul == 1ul);\n assert (U32.logxor 1ul 0ul == 1ul);\n assert (U32.logxor 1ul 1ul == 0ul)\n\nlet logxor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logxor 0uL 0uL == 0uL);\n assert (U64.logxor 0uL 1uL == 1uL);\n assert (U64.logxor 1uL 0uL == 1uL);\n assert (U64.logxor 1uL 1uL == 0uL)\n\nlet logxor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= match t with\n | U8 -> logxor_one_bit_8 sec x y\n | U16 -> logxor_one_bit_16 sec x y\n | U32 -> logxor_one_bit_32 sec x y\n | U64 -> logxor_one_bit_64 sec x y\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logxor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = v y then 0 else 1) })\n= logxor_one_bit' x y;\n x `logxor` y\n\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet secret_bool\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: bool)\n: Tot (z: int_t t sec { v z == (if x then 1 else 0) })\n= cast t sec (if x then 1uy else 0uy)\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet lognot_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 then 0 else 1) })\n= x `logxor_one_bit` secret_bool true\n\n#push-options \"--z3rlimit 32\"\n\n[@\"opaque_to_smt\"]\nnoextract\ninline_for_extraction\nlet ff00_to_10\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == U.ones (bits t) })\n: Tot (y: int_t t sec { v y == (if v x = 0 then 0 else 1) })\n= logand_zeros (mk_int #t #sec 1);\n logand_ones (mk_int #t #sec 1);\n mk_int 1 `logand` x\n\n#pop-options\n\n[@\"opaque_to_smt\"]\nnoextract\ninline_for_extraction\nlet secrets_are_equal\n (#t: inttype { supported_type t })\n (x: int_t t SEC)\n (y: int_t t SEC)\n: Tot (z: int_t t SEC { v z == (if v x = v y then 1 else 0) })\n (decreases (size))\n= ff00_to_10 (eq_mask x y)\n\n[@\"opaque_to_smt\"]\nnoextract\ninline_for_extraction\nlet secret_is_lt\n (#t: inttype { supported_type t })\n (x: int_t t SEC)\n (y: int_t t SEC)\n: Tot (z: int_t t SEC { v z == (if v x < v y then 1 else 0) })", "dependencies": { "source_file": "QUIC.Secret.Int.Aux.fst", "checked_file": "QUIC.Secret.Int.Aux.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Lib.IntTypes.int_t t Lib.IntTypes.SEC -> y: Lib.IntTypes.int_t t Lib.IntTypes.SEC\n -> Prims.Tot\n (z:\n Lib.IntTypes.int_t t Lib.IntTypes.SEC\n { QUIC.Secret.Int.Base.v z ==\n (match QUIC.Secret.Int.Base.v x < QUIC.Secret.Int.Base.v y with\n | true -> 1\n | _ -> 0) })", "effect": "Prims.Tot", "effect_flags": [ "total", "" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "QUIC.Secret.Int.Base.supported_type", "Lib.IntTypes.int_t", "Lib.IntTypes.SEC", "QUIC.Secret.Int.Aux.ff00_to_10", "Lib.IntTypes.lt_mask", "Prims.eq2", "Prims.int", "QUIC.Secret.Int.Base.v", "Prims.op_LessThan", "Prims.bool", "Lib.IntTypes.size" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val secret_is_lt (#t: inttype{supported_type t}) (x y: int_t t SEC)\n : Tot (z: int_t t SEC {v z == (if v x < v y then 1 else 0)}) (decreases (size))\nlet secret_is_lt (#t: inttype{supported_type t}) (x y: int_t t SEC)\n : Tot (z: int_t t SEC {v z == (if v x < v y then 1 else 0)}) (decreases (size)) =", "completed_definiton": "ff00_to_10 (lt_mask x y)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Aux.fst", "name": "QUIC.Secret.Int.Aux.logxor_one_bit_8", "original_source_type": "val logxor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec {v x == 0 \\/ v x == 1})\n (y: int_t U8 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logxor` y) == (if v x = v y then 0 else 1))", "source_type": "val logxor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec {v x == 0 \\/ v x == 1})\n (y: int_t U8 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logxor` y) == (if v x = v y then 0 else 1))", "source_definition": "let logxor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logxor 0uy 0uy == 0uy);\n assert (U8.logxor 0uy 1uy == 1uy);\n assert (U8.logxor 1uy 0uy == 1uy);\n assert (U8.logxor 1uy 1uy == 0uy)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Aux.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 110, "start_col": 2, "end_line": 115, "end_col": 35 }, "file_context": "module QUIC.Secret.Int.Aux\ninclude QUIC.Secret.Int.Base\n\nmodule U = FStar.UInt\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoextract noeq type must_inline =\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\n= x `mul` y\n\nlet logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logor 0uy 0uy == 0uy);\n assert (U8.logor 0uy 1uy == 1uy);\n assert (U8.logor 1uy 0uy == 1uy);\n assert (U8.logor 1uy 1uy == 1uy)\n\nlet logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logor 0us 0us == 0us);\n assert (U16.logor 0us 1us == 1us);\n assert (U16.logor 1us 0us == 1us);\n assert (U16.logor 1us 1us == 1us)\n\nlet logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logor 0ul 0ul == 0ul);\n assert (U32.logor 0ul 1ul == 1ul);\n assert (U32.logor 1ul 0ul == 1ul);\n assert (U32.logor 1ul 1ul == 1ul)\n\nlet logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logor 0uL 0uL == 0uL);\n assert (U64.logor 0uL 1uL == 1uL);\n assert (U64.logor 1uL 0uL == 1uL);\n assert (U64.logor 1uL 1uL == 1uL)\n\nlet logor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= match t with\n | U8 -> logor_one_bit_8 sec x y\n | U16 -> logor_one_bit_16 sec x y\n | U32 -> logor_one_bit_32 sec x y\n | U64 -> logor_one_bit_64 sec x y\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nnoextract\nlet logor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 || v y = 1 then 1 else 0) })\n= logor_one_bit' x y;\n x `logor` y\n\n\n\nlet logxor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma", "dependencies": { "source_file": "QUIC.Secret.Int.Aux.fst", "checked_file": "QUIC.Secret.Int.Aux.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n sec: Lib.IntTypes.secrecy_level ->\n x:\n Lib.IntTypes.int_t Lib.IntTypes.U8 sec\n {QUIC.Secret.Int.Base.v x == 0 \\/ QUIC.Secret.Int.Base.v x == 1} ->\n y:\n Lib.IntTypes.int_t Lib.IntTypes.U8 sec\n {QUIC.Secret.Int.Base.v y == 0 \\/ QUIC.Secret.Int.Base.v y == 1}\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Secret.Int.Base.v (Lib.IntTypes.logxor x y) ==\n (match QUIC.Secret.Int.Base.v x = QUIC.Secret.Int.Base.v y with\n | true -> 0\n | _ -> 1))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.secrecy_level", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "Prims.l_or", "Prims.eq2", "Prims.int", "QUIC.Secret.Int.Base.v", "Prims._assert", "FStar.UInt8.t", "FStar.UInt8.logxor", "FStar.UInt8.__uint_to_t", "Prims.unit", "FStar.Pervasives.allow_inversion", "Lib.IntTypes.logxor_spec", "Prims.l_True", "Prims.squash", "Lib.IntTypes.logxor", "Prims.op_Equality", "Lib.IntTypes.range_t", "Prims.bool", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val logxor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec {v x == 0 \\/ v x == 1})\n (y: int_t U8 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logxor` y) == (if v x = v y then 0 else 1))\nlet logxor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec {v x == 0 \\/ v x == 1})\n (y: int_t U8 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logxor` y) == (if v x = v y then 0 else 1)) =", "completed_definiton": "logxor_spec x y;\nallow_inversion secrecy_level;\nassert (U8.logxor 0uy 0uy == 0uy);\nassert (U8.logxor 0uy 1uy == 1uy);\nassert (U8.logxor 1uy 0uy == 1uy);\nassert (U8.logxor 1uy 1uy == 0uy)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Aux.fst", "name": "QUIC.Secret.Int.Aux.max64", "original_source_type": "val max64\n (x y: uint64)\n: Tot (z: uint64 { v z == (if v y <= v x then v x else v y) })", "source_type": "val max64\n (x y: uint64)\n: Tot (z: uint64 { v z == (if v y <= v x then v x else v y) })", "source_definition": "let max64\n x y\n= max x y", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Aux.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 275, "start_col": 2, "end_line": 275, "end_col": 9 }, "file_context": "module QUIC.Secret.Int.Aux\ninclude QUIC.Secret.Int.Base\n\nmodule U = FStar.UInt\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoextract noeq type must_inline =\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\n= x `mul` y\n\nlet logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logor 0uy 0uy == 0uy);\n assert (U8.logor 0uy 1uy == 1uy);\n assert (U8.logor 1uy 0uy == 1uy);\n assert (U8.logor 1uy 1uy == 1uy)\n\nlet logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logor 0us 0us == 0us);\n assert (U16.logor 0us 1us == 1us);\n assert (U16.logor 1us 0us == 1us);\n assert (U16.logor 1us 1us == 1us)\n\nlet logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logor 0ul 0ul == 0ul);\n assert (U32.logor 0ul 1ul == 1ul);\n assert (U32.logor 1ul 0ul == 1ul);\n assert (U32.logor 1ul 1ul == 1ul)\n\nlet logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logor 0uL 0uL == 0uL);\n assert (U64.logor 0uL 1uL == 1uL);\n assert (U64.logor 1uL 0uL == 1uL);\n assert (U64.logor 1uL 1uL == 1uL)\n\nlet logor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= match t with\n | U8 -> logor_one_bit_8 sec x y\n | U16 -> logor_one_bit_16 sec x y\n | U32 -> logor_one_bit_32 sec x y\n | U64 -> logor_one_bit_64 sec x y\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nnoextract\nlet logor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 || v y = 1 then 1 else 0) })\n= logor_one_bit' x y;\n x `logor` y\n\n\n\nlet logxor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logxor 0uy 0uy == 0uy);\n assert (U8.logxor 0uy 1uy == 1uy);\n assert (U8.logxor 1uy 0uy == 1uy);\n assert (U8.logxor 1uy 1uy == 0uy)\n\nlet logxor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logxor 0us 0us == 0us);\n assert (U16.logxor 0us 1us == 1us);\n assert (U16.logxor 1us 0us == 1us);\n assert (U16.logxor 1us 1us == 0us)\n\nlet logxor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logxor 0ul 0ul == 0ul);\n assert (U32.logxor 0ul 1ul == 1ul);\n assert (U32.logxor 1ul 0ul == 1ul);\n assert (U32.logxor 1ul 1ul == 0ul)\n\nlet logxor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logxor 0uL 0uL == 0uL);\n assert (U64.logxor 0uL 1uL == 1uL);\n assert (U64.logxor 1uL 0uL == 1uL);\n assert (U64.logxor 1uL 1uL == 0uL)\n\nlet logxor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= match t with\n | U8 -> logxor_one_bit_8 sec x y\n | U16 -> logxor_one_bit_16 sec x y\n | U32 -> logxor_one_bit_32 sec x y\n | U64 -> logxor_one_bit_64 sec x y\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logxor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = v y then 0 else 1) })\n= logxor_one_bit' x y;\n x `logxor` y\n\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet secret_bool\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: bool)\n: Tot (z: int_t t sec { v z == (if x then 1 else 0) })\n= cast t sec (if x then 1uy else 0uy)\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet lognot_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 then 0 else 1) })\n= x `logxor_one_bit` secret_bool true\n\n#push-options \"--z3rlimit 32\"\n\n[@\"opaque_to_smt\"]\nnoextract\ninline_for_extraction\nlet ff00_to_10\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == U.ones (bits t) })\n: Tot (y: int_t t sec { v y == (if v x = 0 then 0 else 1) })\n= logand_zeros (mk_int #t #sec 1);\n logand_ones (mk_int #t #sec 1);\n mk_int 1 `logand` x\n\n#pop-options\n\n[@\"opaque_to_smt\"]\nnoextract\ninline_for_extraction\nlet secrets_are_equal\n (#t: inttype { supported_type t })\n (x: int_t t SEC)\n (y: int_t t SEC)\n: Tot (z: int_t t SEC { v z == (if v x = v y then 1 else 0) })\n (decreases (size))\n= ff00_to_10 (eq_mask x y)\n\n[@\"opaque_to_smt\"]\nnoextract\ninline_for_extraction\nlet secret_is_lt\n (#t: inttype { supported_type t })\n (x: int_t t SEC)\n (y: int_t t SEC)\n: Tot (z: int_t t SEC { v z == (if v x < v y then 1 else 0) })\n (decreases (size))\n= ff00_to_10 (lt_mask x y)\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\" must_inline]\nlet min\n (#t: inttype { supported_type t })\n (x y: uint_t t SEC)\n: Tot (z: uint_t t SEC { v z == (if v x <= v y then v x else v y) })\n=\n let cond = secret_is_lt x y in\n (cond `mul` x) `add` (lognot_one_bit cond `mul` y)\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\" must_inline]\nlet max\n (#t: inttype { supported_type t })\n (x y: uint_t t SEC)\n: Tot (z: uint_t t SEC { v z == (if v y <= v x then v x else v y) })\n= let cond = secret_is_lt y x in\n (cond `mul` x) `add` (lognot_one_bit cond `mul` y)\n\nval min64\n (x y: uint64)\n: Tot (z: uint64 { v z == (if v x <= v y then v x else v y) })\n\nlet min64\n x y\n= min x y\n\nval max64\n (x y: uint64)\n: Tot (z: uint64 { v z == (if v y <= v x then v x else v y) })\n\nlet max64", "dependencies": { "source_file": "QUIC.Secret.Int.Aux.fst", "checked_file": "QUIC.Secret.Int.Aux.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Lib.IntTypes.uint64 -> y: Lib.IntTypes.uint64\n -> z:\n Lib.IntTypes.uint64\n { QUIC.Secret.Int.Base.v z ==\n (match QUIC.Secret.Int.Base.v y <= QUIC.Secret.Int.Base.v x with\n | true -> QUIC.Secret.Int.Base.v x\n | _ -> QUIC.Secret.Int.Base.v y) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.uint64", "QUIC.Secret.Int.Aux.max", "Lib.IntTypes.U64", "Prims.eq2", "Lib.IntTypes.range_t", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.SEC", "Prims.op_LessThanOrEqual", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val max64\n (x y: uint64)\n: Tot (z: uint64 { v z == (if v y <= v x then v x else v y) })\nlet max64 x y =", "completed_definiton": "max x y", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Aux.fst", "name": "QUIC.Secret.Int.Aux.logor_one_bit_16", "original_source_type": "val logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec {v x == 0 \\/ v x == 1})\n (y: int_t U16 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))", "source_type": "val logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec {v x == 0 \\/ v x == 1})\n (y: int_t U16 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))", "source_definition": "let logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logor 0us 0us == 0us);\n assert (U16.logor 0us 1us == 1us);\n assert (U16.logor 1us 0us == 1us);\n assert (U16.logor 1us 1us == 1us)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Aux.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 44, "start_col": 2, "end_line": 49, "end_col": 35 }, "file_context": "module QUIC.Secret.Int.Aux\ninclude QUIC.Secret.Int.Base\n\nmodule U = FStar.UInt\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoextract noeq type must_inline =\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\n= x `mul` y\n\nlet logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logor 0uy 0uy == 0uy);\n assert (U8.logor 0uy 1uy == 1uy);\n assert (U8.logor 1uy 0uy == 1uy);\n assert (U8.logor 1uy 1uy == 1uy)\n\nlet logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma", "dependencies": { "source_file": "QUIC.Secret.Int.Aux.fst", "checked_file": "QUIC.Secret.Int.Aux.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n sec: Lib.IntTypes.secrecy_level ->\n x:\n Lib.IntTypes.int_t Lib.IntTypes.U16 sec\n {QUIC.Secret.Int.Base.v x == 0 \\/ QUIC.Secret.Int.Base.v x == 1} ->\n y:\n Lib.IntTypes.int_t Lib.IntTypes.U16 sec\n {QUIC.Secret.Int.Base.v y == 0 \\/ QUIC.Secret.Int.Base.v y == 1}\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Secret.Int.Base.v (Lib.IntTypes.logor x y) ==\n (match QUIC.Secret.Int.Base.v x = 1 || QUIC.Secret.Int.Base.v y = 1 with\n | true -> 1\n | _ -> 0))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.secrecy_level", "Lib.IntTypes.int_t", "Lib.IntTypes.U16", "Prims.l_or", "Prims.eq2", "Prims.int", "QUIC.Secret.Int.Base.v", "Prims._assert", "FStar.UInt16.t", "FStar.UInt16.logor", "FStar.UInt16.__uint_to_t", "Prims.unit", "FStar.Pervasives.allow_inversion", "Lib.IntTypes.logor_spec", "Prims.l_True", "Prims.squash", "Lib.IntTypes.logor", "Prims.op_BarBar", "Prims.op_Equality", "Prims.bool", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec {v x == 0 \\/ v x == 1})\n (y: int_t U16 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\nlet logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec {v x == 0 \\/ v x == 1})\n (y: int_t U16 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0)) =", "completed_definiton": "logor_spec x y;\nallow_inversion secrecy_level;\nassert (U16.logor 0us 0us == 0us);\nassert (U16.logor 0us 1us == 1us);\nassert (U16.logor 1us 0us == 1us);\nassert (U16.logor 1us 1us == 1us)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Aux.fst", "name": "QUIC.Secret.Int.Aux.logxor_one_bit_16", "original_source_type": "val logxor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec {v x == 0 \\/ v x == 1})\n (y: int_t U16 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logxor` y) == (if v x = v y then 0 else 1))", "source_type": "val logxor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec {v x == 0 \\/ v x == 1})\n (y: int_t U16 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logxor` y) == (if v x = v y then 0 else 1))", "source_definition": "let logxor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logxor 0us 0us == 0us);\n assert (U16.logxor 0us 1us == 1us);\n assert (U16.logxor 1us 0us == 1us);\n assert (U16.logxor 1us 1us == 0us)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Aux.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 123, "start_col": 2, "end_line": 128, "end_col": 36 }, "file_context": "module QUIC.Secret.Int.Aux\ninclude QUIC.Secret.Int.Base\n\nmodule U = FStar.UInt\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoextract noeq type must_inline =\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\n= x `mul` y\n\nlet logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logor 0uy 0uy == 0uy);\n assert (U8.logor 0uy 1uy == 1uy);\n assert (U8.logor 1uy 0uy == 1uy);\n assert (U8.logor 1uy 1uy == 1uy)\n\nlet logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logor 0us 0us == 0us);\n assert (U16.logor 0us 1us == 1us);\n assert (U16.logor 1us 0us == 1us);\n assert (U16.logor 1us 1us == 1us)\n\nlet logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logor 0ul 0ul == 0ul);\n assert (U32.logor 0ul 1ul == 1ul);\n assert (U32.logor 1ul 0ul == 1ul);\n assert (U32.logor 1ul 1ul == 1ul)\n\nlet logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logor 0uL 0uL == 0uL);\n assert (U64.logor 0uL 1uL == 1uL);\n assert (U64.logor 1uL 0uL == 1uL);\n assert (U64.logor 1uL 1uL == 1uL)\n\nlet logor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= match t with\n | U8 -> logor_one_bit_8 sec x y\n | U16 -> logor_one_bit_16 sec x y\n | U32 -> logor_one_bit_32 sec x y\n | U64 -> logor_one_bit_64 sec x y\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nnoextract\nlet logor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 || v y = 1 then 1 else 0) })\n= logor_one_bit' x y;\n x `logor` y\n\n\n\nlet logxor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logxor 0uy 0uy == 0uy);\n assert (U8.logxor 0uy 1uy == 1uy);\n assert (U8.logxor 1uy 0uy == 1uy);\n assert (U8.logxor 1uy 1uy == 0uy)\n\nlet logxor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma", "dependencies": { "source_file": "QUIC.Secret.Int.Aux.fst", "checked_file": "QUIC.Secret.Int.Aux.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n sec: Lib.IntTypes.secrecy_level ->\n x:\n Lib.IntTypes.int_t Lib.IntTypes.U16 sec\n {QUIC.Secret.Int.Base.v x == 0 \\/ QUIC.Secret.Int.Base.v x == 1} ->\n y:\n Lib.IntTypes.int_t Lib.IntTypes.U16 sec\n {QUIC.Secret.Int.Base.v y == 0 \\/ QUIC.Secret.Int.Base.v y == 1}\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Secret.Int.Base.v (Lib.IntTypes.logxor x y) ==\n (match QUIC.Secret.Int.Base.v x = QUIC.Secret.Int.Base.v y with\n | true -> 0\n | _ -> 1))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.secrecy_level", "Lib.IntTypes.int_t", "Lib.IntTypes.U16", "Prims.l_or", "Prims.eq2", "Prims.int", "QUIC.Secret.Int.Base.v", "Prims._assert", "FStar.UInt16.t", "FStar.UInt16.logxor", "FStar.UInt16.__uint_to_t", "Prims.unit", "FStar.Pervasives.allow_inversion", "Lib.IntTypes.logxor_spec", "Prims.l_True", "Prims.squash", "Lib.IntTypes.logxor", "Prims.op_Equality", "Lib.IntTypes.range_t", "Prims.bool", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val logxor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec {v x == 0 \\/ v x == 1})\n (y: int_t U16 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logxor` y) == (if v x = v y then 0 else 1))\nlet logxor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec {v x == 0 \\/ v x == 1})\n (y: int_t U16 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logxor` y) == (if v x = v y then 0 else 1)) =", "completed_definiton": "logxor_spec x y;\nallow_inversion secrecy_level;\nassert (U16.logxor 0us 0us == 0us);\nassert (U16.logxor 0us 1us == 1us);\nassert (U16.logxor 1us 0us == 1us);\nassert (U16.logxor 1us 1us == 0us)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Aux.fst", "name": "QUIC.Secret.Int.Aux.logor_one_bit'", "original_source_type": "val logor_one_bit'\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n (y: int_t t sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))", "source_type": "val logor_one_bit'\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n (y: int_t t sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))", "source_definition": "let logor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= match t with\n | U8 -> logor_one_bit_8 sec x y\n | U16 -> logor_one_bit_16 sec x y\n | U32 -> logor_one_bit_32 sec x y\n | U64 -> logor_one_bit_64 sec x y", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Aux.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 84, "start_col": 2, "end_line": 88, "end_col": 35 }, "file_context": "module QUIC.Secret.Int.Aux\ninclude QUIC.Secret.Int.Base\n\nmodule U = FStar.UInt\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoextract noeq type must_inline =\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\n= x `mul` y\n\nlet logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logor 0uy 0uy == 0uy);\n assert (U8.logor 0uy 1uy == 1uy);\n assert (U8.logor 1uy 0uy == 1uy);\n assert (U8.logor 1uy 1uy == 1uy)\n\nlet logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logor 0us 0us == 0us);\n assert (U16.logor 0us 1us == 1us);\n assert (U16.logor 1us 0us == 1us);\n assert (U16.logor 1us 1us == 1us)\n\nlet logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logor 0ul 0ul == 0ul);\n assert (U32.logor 0ul 1ul == 1ul);\n assert (U32.logor 1ul 0ul == 1ul);\n assert (U32.logor 1ul 1ul == 1ul)\n\nlet logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logor 0uL 0uL == 0uL);\n assert (U64.logor 0uL 1uL == 1uL);\n assert (U64.logor 1uL 0uL == 1uL);\n assert (U64.logor 1uL 1uL == 1uL)\n\nlet logor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma", "dependencies": { "source_file": "QUIC.Secret.Int.Aux.fst", "checked_file": "QUIC.Secret.Int.Aux.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x: Lib.IntTypes.int_t t sec {QUIC.Secret.Int.Base.v x == 0 \\/ QUIC.Secret.Int.Base.v x == 1} ->\n y: Lib.IntTypes.int_t t sec {QUIC.Secret.Int.Base.v y == 0 \\/ QUIC.Secret.Int.Base.v y == 1}\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Secret.Int.Base.v (Lib.IntTypes.logor x y) ==\n (match QUIC.Secret.Int.Base.v x = 1 || QUIC.Secret.Int.Base.v y = 1 with\n | true -> 1\n | _ -> 0))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "QUIC.Secret.Int.Base.supported_type", "Lib.IntTypes.secrecy_level", "Lib.IntTypes.int_t", "Prims.l_or", "Prims.eq2", "Prims.int", "QUIC.Secret.Int.Base.v", "QUIC.Secret.Int.Aux.logor_one_bit_8", "QUIC.Secret.Int.Aux.logor_one_bit_16", "QUIC.Secret.Int.Aux.logor_one_bit_32", "QUIC.Secret.Int.Aux.logor_one_bit_64", "Prims.unit", "Prims.l_True", "Prims.squash", "Lib.IntTypes.logor", "Prims.op_BarBar", "Prims.op_Equality", "Prims.bool", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val logor_one_bit'\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n (y: int_t t sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\nlet logor_one_bit'\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n (y: int_t t sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0)) =", "completed_definiton": "match t with\n| U8 -> logor_one_bit_8 sec x y\n| U16 -> logor_one_bit_16 sec x y\n| U32 -> logor_one_bit_32 sec x y\n| U64 -> logor_one_bit_64 sec x y", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Aux.fst", "name": "QUIC.Secret.Int.Aux.logor_one_bit_8", "original_source_type": "val logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec {v x == 0 \\/ v x == 1})\n (y: int_t U8 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))", "source_type": "val logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec {v x == 0 \\/ v x == 1})\n (y: int_t U8 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))", "source_definition": "let logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logor 0uy 0uy == 0uy);\n assert (U8.logor 0uy 1uy == 1uy);\n assert (U8.logor 1uy 0uy == 1uy);\n assert (U8.logor 1uy 1uy == 1uy)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Aux.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 31, "start_col": 2, "end_line": 36, "end_col": 34 }, "file_context": "module QUIC.Secret.Int.Aux\ninclude QUIC.Secret.Int.Base\n\nmodule U = FStar.UInt\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoextract noeq type must_inline =\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\n= x `mul` y\n\nlet logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma", "dependencies": { "source_file": "QUIC.Secret.Int.Aux.fst", "checked_file": "QUIC.Secret.Int.Aux.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n sec: Lib.IntTypes.secrecy_level ->\n x:\n Lib.IntTypes.int_t Lib.IntTypes.U8 sec\n {QUIC.Secret.Int.Base.v x == 0 \\/ QUIC.Secret.Int.Base.v x == 1} ->\n y:\n Lib.IntTypes.int_t Lib.IntTypes.U8 sec\n {QUIC.Secret.Int.Base.v y == 0 \\/ QUIC.Secret.Int.Base.v y == 1}\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Secret.Int.Base.v (Lib.IntTypes.logor x y) ==\n (match QUIC.Secret.Int.Base.v x = 1 || QUIC.Secret.Int.Base.v y = 1 with\n | true -> 1\n | _ -> 0))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.secrecy_level", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "Prims.l_or", "Prims.eq2", "Prims.int", "QUIC.Secret.Int.Base.v", "Prims._assert", "FStar.UInt8.t", "FStar.UInt8.logor", "FStar.UInt8.__uint_to_t", "Prims.unit", "FStar.Pervasives.allow_inversion", "Lib.IntTypes.logor_spec", "Prims.l_True", "Prims.squash", "Lib.IntTypes.logor", "Prims.op_BarBar", "Prims.op_Equality", "Prims.bool", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec {v x == 0 \\/ v x == 1})\n (y: int_t U8 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\nlet logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec {v x == 0 \\/ v x == 1})\n (y: int_t U8 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0)) =", "completed_definiton": "logor_spec x y;\nallow_inversion secrecy_level;\nassert (U8.logor 0uy 0uy == 0uy);\nassert (U8.logor 0uy 1uy == 1uy);\nassert (U8.logor 1uy 0uy == 1uy);\nassert (U8.logor 1uy 1uy == 1uy)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Aux.fst", "name": "QUIC.Secret.Int.Aux.logxor_one_bit'", "original_source_type": "val logxor_one_bit'\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n (y: int_t t sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logxor` y) == (if v x = v y then 0 else 1))", "source_type": "val logxor_one_bit'\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n (y: int_t t sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logxor` y) == (if v x = v y then 0 else 1))", "source_definition": "let logxor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= match t with\n | U8 -> logxor_one_bit_8 sec x y\n | U16 -> logxor_one_bit_16 sec x y\n | U32 -> logxor_one_bit_32 sec x y\n | U64 -> logxor_one_bit_64 sec x y", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Aux.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 163, "start_col": 2, "end_line": 167, "end_col": 36 }, "file_context": "module QUIC.Secret.Int.Aux\ninclude QUIC.Secret.Int.Base\n\nmodule U = FStar.UInt\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoextract noeq type must_inline =\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\n= x `mul` y\n\nlet logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logor 0uy 0uy == 0uy);\n assert (U8.logor 0uy 1uy == 1uy);\n assert (U8.logor 1uy 0uy == 1uy);\n assert (U8.logor 1uy 1uy == 1uy)\n\nlet logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logor 0us 0us == 0us);\n assert (U16.logor 0us 1us == 1us);\n assert (U16.logor 1us 0us == 1us);\n assert (U16.logor 1us 1us == 1us)\n\nlet logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logor 0ul 0ul == 0ul);\n assert (U32.logor 0ul 1ul == 1ul);\n assert (U32.logor 1ul 0ul == 1ul);\n assert (U32.logor 1ul 1ul == 1ul)\n\nlet logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logor 0uL 0uL == 0uL);\n assert (U64.logor 0uL 1uL == 1uL);\n assert (U64.logor 1uL 0uL == 1uL);\n assert (U64.logor 1uL 1uL == 1uL)\n\nlet logor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= match t with\n | U8 -> logor_one_bit_8 sec x y\n | U16 -> logor_one_bit_16 sec x y\n | U32 -> logor_one_bit_32 sec x y\n | U64 -> logor_one_bit_64 sec x y\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nnoextract\nlet logor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 || v y = 1 then 1 else 0) })\n= logor_one_bit' x y;\n x `logor` y\n\n\n\nlet logxor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logxor 0uy 0uy == 0uy);\n assert (U8.logxor 0uy 1uy == 1uy);\n assert (U8.logxor 1uy 0uy == 1uy);\n assert (U8.logxor 1uy 1uy == 0uy)\n\nlet logxor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logxor 0us 0us == 0us);\n assert (U16.logxor 0us 1us == 1us);\n assert (U16.logxor 1us 0us == 1us);\n assert (U16.logxor 1us 1us == 0us)\n\nlet logxor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logxor 0ul 0ul == 0ul);\n assert (U32.logxor 0ul 1ul == 1ul);\n assert (U32.logxor 1ul 0ul == 1ul);\n assert (U32.logxor 1ul 1ul == 0ul)\n\nlet logxor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logxor 0uL 0uL == 0uL);\n assert (U64.logxor 0uL 1uL == 1uL);\n assert (U64.logxor 1uL 0uL == 1uL);\n assert (U64.logxor 1uL 1uL == 0uL)\n\nlet logxor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma", "dependencies": { "source_file": "QUIC.Secret.Int.Aux.fst", "checked_file": "QUIC.Secret.Int.Aux.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x: Lib.IntTypes.int_t t sec {QUIC.Secret.Int.Base.v x == 0 \\/ QUIC.Secret.Int.Base.v x == 1} ->\n y: Lib.IntTypes.int_t t sec {QUIC.Secret.Int.Base.v y == 0 \\/ QUIC.Secret.Int.Base.v y == 1}\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Secret.Int.Base.v (Lib.IntTypes.logxor x y) ==\n (match QUIC.Secret.Int.Base.v x = QUIC.Secret.Int.Base.v y with\n | true -> 0\n | _ -> 1))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "QUIC.Secret.Int.Base.supported_type", "Lib.IntTypes.secrecy_level", "Lib.IntTypes.int_t", "Prims.l_or", "Prims.eq2", "Prims.int", "QUIC.Secret.Int.Base.v", "QUIC.Secret.Int.Aux.logxor_one_bit_8", "QUIC.Secret.Int.Aux.logxor_one_bit_16", "QUIC.Secret.Int.Aux.logxor_one_bit_32", "QUIC.Secret.Int.Aux.logxor_one_bit_64", "Prims.unit", "Prims.l_True", "Prims.squash", "Lib.IntTypes.logxor", "Prims.op_Equality", "Lib.IntTypes.range_t", "Prims.bool", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val logxor_one_bit'\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n (y: int_t t sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logxor` y) == (if v x = v y then 0 else 1))\nlet logxor_one_bit'\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n (y: int_t t sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logxor` y) == (if v x = v y then 0 else 1)) =", "completed_definiton": "match t with\n| U8 -> logxor_one_bit_8 sec x y\n| U16 -> logxor_one_bit_16 sec x y\n| U32 -> logxor_one_bit_32 sec x y\n| U64 -> logxor_one_bit_64 sec x y", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Aux.fst", "name": "QUIC.Secret.Int.Aux.secrets_are_equal", "original_source_type": "val secrets_are_equal (#t: inttype{supported_type t}) (x y: int_t t SEC)\n : Tot (z: int_t t SEC {v z == (if v x = v y then 1 else 0)}) (decreases (size))", "source_type": "val secrets_are_equal (#t: inttype{supported_type t}) (x y: int_t t SEC)\n : Tot (z: int_t t SEC {v z == (if v x = v y then 1 else 0)}) (decreases (size))", "source_definition": "let secrets_are_equal\n (#t: inttype { supported_type t })\n (x: int_t t SEC)\n (y: int_t t SEC)\n: Tot (z: int_t t SEC { v z == (if v x = v y then 1 else 0) })\n (decreases (size))\n= ff00_to_10 (eq_mask x y)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Aux.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 227, "start_col": 2, "end_line": 227, "end_col": 26 }, "file_context": "module QUIC.Secret.Int.Aux\ninclude QUIC.Secret.Int.Base\n\nmodule U = FStar.UInt\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoextract noeq type must_inline =\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\n= x `mul` y\n\nlet logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logor 0uy 0uy == 0uy);\n assert (U8.logor 0uy 1uy == 1uy);\n assert (U8.logor 1uy 0uy == 1uy);\n assert (U8.logor 1uy 1uy == 1uy)\n\nlet logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logor 0us 0us == 0us);\n assert (U16.logor 0us 1us == 1us);\n assert (U16.logor 1us 0us == 1us);\n assert (U16.logor 1us 1us == 1us)\n\nlet logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logor 0ul 0ul == 0ul);\n assert (U32.logor 0ul 1ul == 1ul);\n assert (U32.logor 1ul 0ul == 1ul);\n assert (U32.logor 1ul 1ul == 1ul)\n\nlet logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logor 0uL 0uL == 0uL);\n assert (U64.logor 0uL 1uL == 1uL);\n assert (U64.logor 1uL 0uL == 1uL);\n assert (U64.logor 1uL 1uL == 1uL)\n\nlet logor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= match t with\n | U8 -> logor_one_bit_8 sec x y\n | U16 -> logor_one_bit_16 sec x y\n | U32 -> logor_one_bit_32 sec x y\n | U64 -> logor_one_bit_64 sec x y\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nnoextract\nlet logor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 || v y = 1 then 1 else 0) })\n= logor_one_bit' x y;\n x `logor` y\n\n\n\nlet logxor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logxor 0uy 0uy == 0uy);\n assert (U8.logxor 0uy 1uy == 1uy);\n assert (U8.logxor 1uy 0uy == 1uy);\n assert (U8.logxor 1uy 1uy == 0uy)\n\nlet logxor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logxor 0us 0us == 0us);\n assert (U16.logxor 0us 1us == 1us);\n assert (U16.logxor 1us 0us == 1us);\n assert (U16.logxor 1us 1us == 0us)\n\nlet logxor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logxor 0ul 0ul == 0ul);\n assert (U32.logxor 0ul 1ul == 1ul);\n assert (U32.logxor 1ul 0ul == 1ul);\n assert (U32.logxor 1ul 1ul == 0ul)\n\nlet logxor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logxor 0uL 0uL == 0uL);\n assert (U64.logxor 0uL 1uL == 1uL);\n assert (U64.logxor 1uL 0uL == 1uL);\n assert (U64.logxor 1uL 1uL == 0uL)\n\nlet logxor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= match t with\n | U8 -> logxor_one_bit_8 sec x y\n | U16 -> logxor_one_bit_16 sec x y\n | U32 -> logxor_one_bit_32 sec x y\n | U64 -> logxor_one_bit_64 sec x y\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logxor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = v y then 0 else 1) })\n= logxor_one_bit' x y;\n x `logxor` y\n\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet secret_bool\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: bool)\n: Tot (z: int_t t sec { v z == (if x then 1 else 0) })\n= cast t sec (if x then 1uy else 0uy)\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet lognot_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 then 0 else 1) })\n= x `logxor_one_bit` secret_bool true\n\n#push-options \"--z3rlimit 32\"\n\n[@\"opaque_to_smt\"]\nnoextract\ninline_for_extraction\nlet ff00_to_10\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == U.ones (bits t) })\n: Tot (y: int_t t sec { v y == (if v x = 0 then 0 else 1) })\n= logand_zeros (mk_int #t #sec 1);\n logand_ones (mk_int #t #sec 1);\n mk_int 1 `logand` x\n\n#pop-options\n\n[@\"opaque_to_smt\"]\nnoextract\ninline_for_extraction\nlet secrets_are_equal\n (#t: inttype { supported_type t })\n (x: int_t t SEC)\n (y: int_t t SEC)\n: Tot (z: int_t t SEC { v z == (if v x = v y then 1 else 0) })", "dependencies": { "source_file": "QUIC.Secret.Int.Aux.fst", "checked_file": "QUIC.Secret.Int.Aux.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Lib.IntTypes.int_t t Lib.IntTypes.SEC -> y: Lib.IntTypes.int_t t Lib.IntTypes.SEC\n -> Prims.Tot\n (z:\n Lib.IntTypes.int_t t Lib.IntTypes.SEC\n { QUIC.Secret.Int.Base.v z ==\n (match QUIC.Secret.Int.Base.v x = QUIC.Secret.Int.Base.v y with\n | true -> 1\n | _ -> 0) })", "effect": "Prims.Tot", "effect_flags": [ "total", "" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "QUIC.Secret.Int.Base.supported_type", "Lib.IntTypes.int_t", "Lib.IntTypes.SEC", "QUIC.Secret.Int.Aux.ff00_to_10", "Lib.IntTypes.eq_mask", "Prims.eq2", "Prims.int", "QUIC.Secret.Int.Base.v", "Prims.op_Equality", "Lib.IntTypes.range_t", "Prims.bool", "Lib.IntTypes.size" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val secrets_are_equal (#t: inttype{supported_type t}) (x y: int_t t SEC)\n : Tot (z: int_t t SEC {v z == (if v x = v y then 1 else 0)}) (decreases (size))\nlet secrets_are_equal (#t: inttype{supported_type t}) (x y: int_t t SEC)\n : Tot (z: int_t t SEC {v z == (if v x = v y then 1 else 0)}) (decreases (size)) =", "completed_definiton": "ff00_to_10 (eq_mask x y)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Aux.fst", "name": "QUIC.Secret.Int.Aux.logxor_one_bit_32", "original_source_type": "val logxor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec {v x == 0 \\/ v x == 1})\n (y: int_t U32 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logxor` y) == (if v x = v y then 0 else 1))", "source_type": "val logxor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec {v x == 0 \\/ v x == 1})\n (y: int_t U32 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logxor` y) == (if v x = v y then 0 else 1))", "source_definition": "let logxor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logxor 0ul 0ul == 0ul);\n assert (U32.logxor 0ul 1ul == 1ul);\n assert (U32.logxor 1ul 0ul == 1ul);\n assert (U32.logxor 1ul 1ul == 0ul)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Aux.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 136, "start_col": 2, "end_line": 141, "end_col": 36 }, "file_context": "module QUIC.Secret.Int.Aux\ninclude QUIC.Secret.Int.Base\n\nmodule U = FStar.UInt\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoextract noeq type must_inline =\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\n= x `mul` y\n\nlet logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logor 0uy 0uy == 0uy);\n assert (U8.logor 0uy 1uy == 1uy);\n assert (U8.logor 1uy 0uy == 1uy);\n assert (U8.logor 1uy 1uy == 1uy)\n\nlet logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logor 0us 0us == 0us);\n assert (U16.logor 0us 1us == 1us);\n assert (U16.logor 1us 0us == 1us);\n assert (U16.logor 1us 1us == 1us)\n\nlet logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logor 0ul 0ul == 0ul);\n assert (U32.logor 0ul 1ul == 1ul);\n assert (U32.logor 1ul 0ul == 1ul);\n assert (U32.logor 1ul 1ul == 1ul)\n\nlet logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logor 0uL 0uL == 0uL);\n assert (U64.logor 0uL 1uL == 1uL);\n assert (U64.logor 1uL 0uL == 1uL);\n assert (U64.logor 1uL 1uL == 1uL)\n\nlet logor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= match t with\n | U8 -> logor_one_bit_8 sec x y\n | U16 -> logor_one_bit_16 sec x y\n | U32 -> logor_one_bit_32 sec x y\n | U64 -> logor_one_bit_64 sec x y\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nnoextract\nlet logor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 || v y = 1 then 1 else 0) })\n= logor_one_bit' x y;\n x `logor` y\n\n\n\nlet logxor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logxor 0uy 0uy == 0uy);\n assert (U8.logxor 0uy 1uy == 1uy);\n assert (U8.logxor 1uy 0uy == 1uy);\n assert (U8.logxor 1uy 1uy == 0uy)\n\nlet logxor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logxor 0us 0us == 0us);\n assert (U16.logxor 0us 1us == 1us);\n assert (U16.logxor 1us 0us == 1us);\n assert (U16.logxor 1us 1us == 0us)\n\nlet logxor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma", "dependencies": { "source_file": "QUIC.Secret.Int.Aux.fst", "checked_file": "QUIC.Secret.Int.Aux.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n sec: Lib.IntTypes.secrecy_level ->\n x:\n Lib.IntTypes.int_t Lib.IntTypes.U32 sec\n {QUIC.Secret.Int.Base.v x == 0 \\/ QUIC.Secret.Int.Base.v x == 1} ->\n y:\n Lib.IntTypes.int_t Lib.IntTypes.U32 sec\n {QUIC.Secret.Int.Base.v y == 0 \\/ QUIC.Secret.Int.Base.v y == 1}\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Secret.Int.Base.v (Lib.IntTypes.logxor x y) ==\n (match QUIC.Secret.Int.Base.v x = QUIC.Secret.Int.Base.v y with\n | true -> 0\n | _ -> 1))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.secrecy_level", "Lib.IntTypes.int_t", "Lib.IntTypes.U32", "Prims.l_or", "Prims.eq2", "Prims.int", "QUIC.Secret.Int.Base.v", "Prims._assert", "FStar.UInt32.t", "FStar.UInt32.logxor", "FStar.UInt32.__uint_to_t", "Prims.unit", "FStar.Pervasives.allow_inversion", "Lib.IntTypes.logxor_spec", "Prims.l_True", "Prims.squash", "Lib.IntTypes.logxor", "Prims.op_Equality", "Lib.IntTypes.range_t", "Prims.bool", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val logxor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec {v x == 0 \\/ v x == 1})\n (y: int_t U32 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logxor` y) == (if v x = v y then 0 else 1))\nlet logxor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec {v x == 0 \\/ v x == 1})\n (y: int_t U32 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logxor` y) == (if v x = v y then 0 else 1)) =", "completed_definiton": "logxor_spec x y;\nallow_inversion secrecy_level;\nassert (U32.logxor 0ul 0ul == 0ul);\nassert (U32.logxor 0ul 1ul == 1ul);\nassert (U32.logxor 1ul 0ul == 1ul);\nassert (U32.logxor 1ul 1ul == 0ul)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Aux.fst", "name": "QUIC.Secret.Int.Aux.logor_one_bit_32", "original_source_type": "val logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec {v x == 0 \\/ v x == 1})\n (y: int_t U32 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))", "source_type": "val logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec {v x == 0 \\/ v x == 1})\n (y: int_t U32 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))", "source_definition": "let logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logor 0ul 0ul == 0ul);\n assert (U32.logor 0ul 1ul == 1ul);\n assert (U32.logor 1ul 0ul == 1ul);\n assert (U32.logor 1ul 1ul == 1ul)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Aux.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 57, "start_col": 2, "end_line": 62, "end_col": 35 }, "file_context": "module QUIC.Secret.Int.Aux\ninclude QUIC.Secret.Int.Base\n\nmodule U = FStar.UInt\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoextract noeq type must_inline =\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\n= x `mul` y\n\nlet logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logor 0uy 0uy == 0uy);\n assert (U8.logor 0uy 1uy == 1uy);\n assert (U8.logor 1uy 0uy == 1uy);\n assert (U8.logor 1uy 1uy == 1uy)\n\nlet logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logor 0us 0us == 0us);\n assert (U16.logor 0us 1us == 1us);\n assert (U16.logor 1us 0us == 1us);\n assert (U16.logor 1us 1us == 1us)\n\nlet logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma", "dependencies": { "source_file": "QUIC.Secret.Int.Aux.fst", "checked_file": "QUIC.Secret.Int.Aux.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n sec: Lib.IntTypes.secrecy_level ->\n x:\n Lib.IntTypes.int_t Lib.IntTypes.U32 sec\n {QUIC.Secret.Int.Base.v x == 0 \\/ QUIC.Secret.Int.Base.v x == 1} ->\n y:\n Lib.IntTypes.int_t Lib.IntTypes.U32 sec\n {QUIC.Secret.Int.Base.v y == 0 \\/ QUIC.Secret.Int.Base.v y == 1}\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Secret.Int.Base.v (Lib.IntTypes.logor x y) ==\n (match QUIC.Secret.Int.Base.v x = 1 || QUIC.Secret.Int.Base.v y = 1 with\n | true -> 1\n | _ -> 0))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.secrecy_level", "Lib.IntTypes.int_t", "Lib.IntTypes.U32", "Prims.l_or", "Prims.eq2", "Prims.int", "QUIC.Secret.Int.Base.v", "Prims._assert", "FStar.UInt32.t", "FStar.UInt32.logor", "FStar.UInt32.__uint_to_t", "Prims.unit", "FStar.Pervasives.allow_inversion", "Lib.IntTypes.logor_spec", "Prims.l_True", "Prims.squash", "Lib.IntTypes.logor", "Prims.op_BarBar", "Prims.op_Equality", "Prims.bool", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec {v x == 0 \\/ v x == 1})\n (y: int_t U32 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\nlet logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec {v x == 0 \\/ v x == 1})\n (y: int_t U32 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0)) =", "completed_definiton": "logor_spec x y;\nallow_inversion secrecy_level;\nassert (U32.logor 0ul 0ul == 0ul);\nassert (U32.logor 0ul 1ul == 1ul);\nassert (U32.logor 1ul 0ul == 1ul);\nassert (U32.logor 1ul 1ul == 1ul)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Aux.fst", "name": "QUIC.Secret.Int.Aux.logor_one_bit_64", "original_source_type": "val logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec {v x == 0 \\/ v x == 1})\n (y: int_t U64 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))", "source_type": "val logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec {v x == 0 \\/ v x == 1})\n (y: int_t U64 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))", "source_definition": "let logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logor 0uL 0uL == 0uL);\n assert (U64.logor 0uL 1uL == 1uL);\n assert (U64.logor 1uL 0uL == 1uL);\n assert (U64.logor 1uL 1uL == 1uL)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Aux.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 70, "start_col": 2, "end_line": 75, "end_col": 35 }, "file_context": "module QUIC.Secret.Int.Aux\ninclude QUIC.Secret.Int.Base\n\nmodule U = FStar.UInt\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoextract noeq type must_inline =\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\n= x `mul` y\n\nlet logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logor 0uy 0uy == 0uy);\n assert (U8.logor 0uy 1uy == 1uy);\n assert (U8.logor 1uy 0uy == 1uy);\n assert (U8.logor 1uy 1uy == 1uy)\n\nlet logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logor 0us 0us == 0us);\n assert (U16.logor 0us 1us == 1us);\n assert (U16.logor 1us 0us == 1us);\n assert (U16.logor 1us 1us == 1us)\n\nlet logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logor 0ul 0ul == 0ul);\n assert (U32.logor 0ul 1ul == 1ul);\n assert (U32.logor 1ul 0ul == 1ul);\n assert (U32.logor 1ul 1ul == 1ul)\n\nlet logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma", "dependencies": { "source_file": "QUIC.Secret.Int.Aux.fst", "checked_file": "QUIC.Secret.Int.Aux.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n sec: Lib.IntTypes.secrecy_level ->\n x:\n Lib.IntTypes.int_t Lib.IntTypes.U64 sec\n {QUIC.Secret.Int.Base.v x == 0 \\/ QUIC.Secret.Int.Base.v x == 1} ->\n y:\n Lib.IntTypes.int_t Lib.IntTypes.U64 sec\n {QUIC.Secret.Int.Base.v y == 0 \\/ QUIC.Secret.Int.Base.v y == 1}\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Secret.Int.Base.v (Lib.IntTypes.logor x y) ==\n (match QUIC.Secret.Int.Base.v x = 1 || QUIC.Secret.Int.Base.v y = 1 with\n | true -> 1\n | _ -> 0))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.secrecy_level", "Lib.IntTypes.int_t", "Lib.IntTypes.U64", "Prims.l_or", "Prims.eq2", "Prims.int", "QUIC.Secret.Int.Base.v", "Prims._assert", "FStar.UInt64.t", "FStar.UInt64.logor", "FStar.UInt64.__uint_to_t", "Prims.unit", "FStar.Pervasives.allow_inversion", "Lib.IntTypes.logor_spec", "Prims.l_True", "Prims.squash", "Lib.IntTypes.logor", "Prims.op_BarBar", "Prims.op_Equality", "Prims.bool", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec {v x == 0 \\/ v x == 1})\n (y: int_t U64 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\nlet logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec {v x == 0 \\/ v x == 1})\n (y: int_t U64 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0)) =", "completed_definiton": "logor_spec x y;\nallow_inversion secrecy_level;\nassert (U64.logor 0uL 0uL == 0uL);\nassert (U64.logor 0uL 1uL == 1uL);\nassert (U64.logor 1uL 0uL == 1uL);\nassert (U64.logor 1uL 1uL == 1uL)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Aux.fst", "name": "QUIC.Secret.Int.Aux.logxor_one_bit_64", "original_source_type": "val logxor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec {v x == 0 \\/ v x == 1})\n (y: int_t U64 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logxor` y) == (if v x = v y then 0 else 1))", "source_type": "val logxor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec {v x == 0 \\/ v x == 1})\n (y: int_t U64 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logxor` y) == (if v x = v y then 0 else 1))", "source_definition": "let logxor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logxor 0uL 0uL == 0uL);\n assert (U64.logxor 0uL 1uL == 1uL);\n assert (U64.logxor 1uL 0uL == 1uL);\n assert (U64.logxor 1uL 1uL == 0uL)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Aux.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 149, "start_col": 2, "end_line": 154, "end_col": 36 }, "file_context": "module QUIC.Secret.Int.Aux\ninclude QUIC.Secret.Int.Base\n\nmodule U = FStar.UInt\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoextract noeq type must_inline =\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\n= x `mul` y\n\nlet logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logor 0uy 0uy == 0uy);\n assert (U8.logor 0uy 1uy == 1uy);\n assert (U8.logor 1uy 0uy == 1uy);\n assert (U8.logor 1uy 1uy == 1uy)\n\nlet logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logor 0us 0us == 0us);\n assert (U16.logor 0us 1us == 1us);\n assert (U16.logor 1us 0us == 1us);\n assert (U16.logor 1us 1us == 1us)\n\nlet logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logor 0ul 0ul == 0ul);\n assert (U32.logor 0ul 1ul == 1ul);\n assert (U32.logor 1ul 0ul == 1ul);\n assert (U32.logor 1ul 1ul == 1ul)\n\nlet logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logor 0uL 0uL == 0uL);\n assert (U64.logor 0uL 1uL == 1uL);\n assert (U64.logor 1uL 0uL == 1uL);\n assert (U64.logor 1uL 1uL == 1uL)\n\nlet logor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= match t with\n | U8 -> logor_one_bit_8 sec x y\n | U16 -> logor_one_bit_16 sec x y\n | U32 -> logor_one_bit_32 sec x y\n | U64 -> logor_one_bit_64 sec x y\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nnoextract\nlet logor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 || v y = 1 then 1 else 0) })\n= logor_one_bit' x y;\n x `logor` y\n\n\n\nlet logxor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logxor 0uy 0uy == 0uy);\n assert (U8.logxor 0uy 1uy == 1uy);\n assert (U8.logxor 1uy 0uy == 1uy);\n assert (U8.logxor 1uy 1uy == 0uy)\n\nlet logxor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logxor 0us 0us == 0us);\n assert (U16.logxor 0us 1us == 1us);\n assert (U16.logxor 1us 0us == 1us);\n assert (U16.logxor 1us 1us == 0us)\n\nlet logxor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logxor 0ul 0ul == 0ul);\n assert (U32.logxor 0ul 1ul == 1ul);\n assert (U32.logxor 1ul 0ul == 1ul);\n assert (U32.logxor 1ul 1ul == 0ul)\n\nlet logxor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma", "dependencies": { "source_file": "QUIC.Secret.Int.Aux.fst", "checked_file": "QUIC.Secret.Int.Aux.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n sec: Lib.IntTypes.secrecy_level ->\n x:\n Lib.IntTypes.int_t Lib.IntTypes.U64 sec\n {QUIC.Secret.Int.Base.v x == 0 \\/ QUIC.Secret.Int.Base.v x == 1} ->\n y:\n Lib.IntTypes.int_t Lib.IntTypes.U64 sec\n {QUIC.Secret.Int.Base.v y == 0 \\/ QUIC.Secret.Int.Base.v y == 1}\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Secret.Int.Base.v (Lib.IntTypes.logxor x y) ==\n (match QUIC.Secret.Int.Base.v x = QUIC.Secret.Int.Base.v y with\n | true -> 0\n | _ -> 1))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.secrecy_level", "Lib.IntTypes.int_t", "Lib.IntTypes.U64", "Prims.l_or", "Prims.eq2", "Prims.int", "QUIC.Secret.Int.Base.v", "Prims._assert", "FStar.UInt64.t", "FStar.UInt64.logxor", "FStar.UInt64.__uint_to_t", "Prims.unit", "FStar.Pervasives.allow_inversion", "Lib.IntTypes.logxor_spec", "Prims.l_True", "Prims.squash", "Lib.IntTypes.logxor", "Prims.op_Equality", "Lib.IntTypes.range_t", "Prims.bool", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val logxor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec {v x == 0 \\/ v x == 1})\n (y: int_t U64 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logxor` y) == (if v x = v y then 0 else 1))\nlet logxor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec {v x == 0 \\/ v x == 1})\n (y: int_t U64 sec {v y == 0 \\/ v y == 1})\n : Lemma (v (x `logxor` y) == (if v x = v y then 0 else 1)) =", "completed_definiton": "logxor_spec x y;\nallow_inversion secrecy_level;\nassert (U64.logxor 0uL 0uL == 0uL);\nassert (U64.logxor 0uL 1uL == 1uL);\nassert (U64.logxor 1uL 0uL == 1uL);\nassert (U64.logxor 1uL 1uL == 0uL)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Aux.fst", "name": "QUIC.Secret.Int.Aux.logand_one_bit", "original_source_type": "val logand_one_bit\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n (y: int_t t sec {v y == 0 \\/ v y == 1})\n : Tot (z: int_t t sec {v z == (if v x = 1 && v y = 1 then 1 else 0)})", "source_type": "val logand_one_bit\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n (y: int_t t sec {v y == 0 \\/ v y == 1})\n : Tot (z: int_t t sec {v z == (if v x = 1 && v y = 1 then 1 else 0)})", "source_definition": "let logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\n= x `mul` y", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Aux.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 23, "start_col": 2, "end_line": 23, "end_col": 11 }, "file_context": "module QUIC.Secret.Int.Aux\ninclude QUIC.Secret.Int.Base\n\nmodule U = FStar.UInt\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoextract noeq type must_inline =\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })", "dependencies": { "source_file": "QUIC.Secret.Int.Aux.fst", "checked_file": "QUIC.Secret.Int.Aux.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x: Lib.IntTypes.int_t t sec {QUIC.Secret.Int.Base.v x == 0 \\/ QUIC.Secret.Int.Base.v x == 1} ->\n y: Lib.IntTypes.int_t t sec {QUIC.Secret.Int.Base.v y == 0 \\/ QUIC.Secret.Int.Base.v y == 1}\n -> z:\n Lib.IntTypes.int_t t sec\n { QUIC.Secret.Int.Base.v z ==\n (match QUIC.Secret.Int.Base.v x = 1 && QUIC.Secret.Int.Base.v y = 1 with\n | true -> 1\n | _ -> 0) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "QUIC.Secret.Int.Base.supported_type", "Lib.IntTypes.secrecy_level", "Lib.IntTypes.int_t", "Prims.l_or", "Prims.eq2", "Prims.int", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.mul", "Prims.op_AmpAmp", "Prims.op_Equality", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val logand_one_bit\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n (y: int_t t sec {v y == 0 \\/ v y == 1})\n : Tot (z: int_t t sec {v z == (if v x = 1 && v y = 1 then 1 else 0)})\nlet logand_one_bit\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == 1})\n (y: int_t t sec {v y == 0 \\/ v y == 1})\n : Tot (z: int_t t sec {v z == (if v x = 1 && v y = 1 then 1 else 0)}) =", "completed_definiton": "x `mul` y", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Aux.fst", "name": "QUIC.Secret.Int.Aux.secret_bool", "original_source_type": "val secret_bool (#t: inttype{supported_type t}) (#sec: secrecy_level) (x: bool)\n : Tot (z: int_t t sec {v z == (if x then 1 else 0)})", "source_type": "val secret_bool (#t: inttype{supported_type t}) (#sec: secrecy_level) (x: bool)\n : Tot (z: int_t t sec {v z == (if x then 1 else 0)})", "source_definition": "let secret_bool\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: bool)\n: Tot (z: int_t t sec { v z == (if x then 1 else 0) })\n= cast t sec (if x then 1uy else 0uy)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Aux.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 190, "start_col": 2, "end_line": 190, "end_col": 37 }, "file_context": "module QUIC.Secret.Int.Aux\ninclude QUIC.Secret.Int.Base\n\nmodule U = FStar.UInt\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoextract noeq type must_inline =\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\n= x `mul` y\n\nlet logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logor 0uy 0uy == 0uy);\n assert (U8.logor 0uy 1uy == 1uy);\n assert (U8.logor 1uy 0uy == 1uy);\n assert (U8.logor 1uy 1uy == 1uy)\n\nlet logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logor 0us 0us == 0us);\n assert (U16.logor 0us 1us == 1us);\n assert (U16.logor 1us 0us == 1us);\n assert (U16.logor 1us 1us == 1us)\n\nlet logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logor 0ul 0ul == 0ul);\n assert (U32.logor 0ul 1ul == 1ul);\n assert (U32.logor 1ul 0ul == 1ul);\n assert (U32.logor 1ul 1ul == 1ul)\n\nlet logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logor 0uL 0uL == 0uL);\n assert (U64.logor 0uL 1uL == 1uL);\n assert (U64.logor 1uL 0uL == 1uL);\n assert (U64.logor 1uL 1uL == 1uL)\n\nlet logor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= match t with\n | U8 -> logor_one_bit_8 sec x y\n | U16 -> logor_one_bit_16 sec x y\n | U32 -> logor_one_bit_32 sec x y\n | U64 -> logor_one_bit_64 sec x y\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nnoextract\nlet logor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 || v y = 1 then 1 else 0) })\n= logor_one_bit' x y;\n x `logor` y\n\n\n\nlet logxor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logxor 0uy 0uy == 0uy);\n assert (U8.logxor 0uy 1uy == 1uy);\n assert (U8.logxor 1uy 0uy == 1uy);\n assert (U8.logxor 1uy 1uy == 0uy)\n\nlet logxor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logxor 0us 0us == 0us);\n assert (U16.logxor 0us 1us == 1us);\n assert (U16.logxor 1us 0us == 1us);\n assert (U16.logxor 1us 1us == 0us)\n\nlet logxor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logxor 0ul 0ul == 0ul);\n assert (U32.logxor 0ul 1ul == 1ul);\n assert (U32.logxor 1ul 0ul == 1ul);\n assert (U32.logxor 1ul 1ul == 0ul)\n\nlet logxor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logxor 0uL 0uL == 0uL);\n assert (U64.logxor 0uL 1uL == 1uL);\n assert (U64.logxor 1uL 0uL == 1uL);\n assert (U64.logxor 1uL 1uL == 0uL)\n\nlet logxor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= match t with\n | U8 -> logxor_one_bit_8 sec x y\n | U16 -> logxor_one_bit_16 sec x y\n | U32 -> logxor_one_bit_32 sec x y\n | U64 -> logxor_one_bit_64 sec x y\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logxor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = v y then 0 else 1) })\n= logxor_one_bit' x y;\n x `logxor` y\n\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet secret_bool\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: bool)", "dependencies": { "source_file": "QUIC.Secret.Int.Aux.fst", "checked_file": "QUIC.Secret.Int.Aux.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Prims.bool\n -> z:\n Lib.IntTypes.int_t t sec\n { QUIC.Secret.Int.Base.v z ==\n (match x with\n | true -> 1\n | _ -> 0) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "QUIC.Secret.Int.Base.supported_type", "Lib.IntTypes.secrecy_level", "Prims.bool", "Lib.IntTypes.cast", "Lib.IntTypes.U1", "Lib.IntTypes.PUB", "FStar.UInt8.__uint_to_t", "Lib.IntTypes.int_t", "Prims.l_or", "Lib.IntTypes.unsigned", "Lib.IntTypes.range", "Lib.IntTypes.v", "Prims.eq2", "Prims.int", "QUIC.Secret.Int.Base.v" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val secret_bool (#t: inttype{supported_type t}) (#sec: secrecy_level) (x: bool)\n : Tot (z: int_t t sec {v z == (if x then 1 else 0)})\nlet secret_bool (#t: inttype{supported_type t}) (#sec: secrecy_level) (x: bool)\n : Tot (z: int_t t sec {v z == (if x then 1 else 0)}) =", "completed_definiton": "cast t sec (if x then 1uy else 0uy)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Aux.fst", "name": "QUIC.Secret.Int.Aux.ff00_to_10", "original_source_type": "val ff00_to_10\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == U.ones (bits t)})\n : Tot (y: int_t t sec {v y == (if v x = 0 then 0 else 1)})", "source_type": "val ff00_to_10\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == U.ones (bits t)})\n : Tot (y: int_t t sec {v y == (if v x = 0 then 0 else 1)})", "source_definition": "let ff00_to_10\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == U.ones (bits t) })\n: Tot (y: int_t t sec { v y == (if v x = 0 then 0 else 1) })\n= logand_zeros (mk_int #t #sec 1);\n logand_ones (mk_int #t #sec 1);\n mk_int 1 `logand` x", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Aux.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 212, "start_col": 2, "end_line": 214, "end_col": 21 }, "file_context": "module QUIC.Secret.Int.Aux\ninclude QUIC.Secret.Int.Base\n\nmodule U = FStar.UInt\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoextract noeq type must_inline =\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\n= x `mul` y\n\nlet logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logor 0uy 0uy == 0uy);\n assert (U8.logor 0uy 1uy == 1uy);\n assert (U8.logor 1uy 0uy == 1uy);\n assert (U8.logor 1uy 1uy == 1uy)\n\nlet logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logor 0us 0us == 0us);\n assert (U16.logor 0us 1us == 1us);\n assert (U16.logor 1us 0us == 1us);\n assert (U16.logor 1us 1us == 1us)\n\nlet logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logor 0ul 0ul == 0ul);\n assert (U32.logor 0ul 1ul == 1ul);\n assert (U32.logor 1ul 0ul == 1ul);\n assert (U32.logor 1ul 1ul == 1ul)\n\nlet logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logor 0uL 0uL == 0uL);\n assert (U64.logor 0uL 1uL == 1uL);\n assert (U64.logor 1uL 0uL == 1uL);\n assert (U64.logor 1uL 1uL == 1uL)\n\nlet logor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= match t with\n | U8 -> logor_one_bit_8 sec x y\n | U16 -> logor_one_bit_16 sec x y\n | U32 -> logor_one_bit_32 sec x y\n | U64 -> logor_one_bit_64 sec x y\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nnoextract\nlet logor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 || v y = 1 then 1 else 0) })\n= logor_one_bit' x y;\n x `logor` y\n\n\n\nlet logxor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logxor 0uy 0uy == 0uy);\n assert (U8.logxor 0uy 1uy == 1uy);\n assert (U8.logxor 1uy 0uy == 1uy);\n assert (U8.logxor 1uy 1uy == 0uy)\n\nlet logxor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logxor 0us 0us == 0us);\n assert (U16.logxor 0us 1us == 1us);\n assert (U16.logxor 1us 0us == 1us);\n assert (U16.logxor 1us 1us == 0us)\n\nlet logxor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logxor 0ul 0ul == 0ul);\n assert (U32.logxor 0ul 1ul == 1ul);\n assert (U32.logxor 1ul 0ul == 1ul);\n assert (U32.logxor 1ul 1ul == 0ul)\n\nlet logxor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logxor 0uL 0uL == 0uL);\n assert (U64.logxor 0uL 1uL == 1uL);\n assert (U64.logxor 1uL 0uL == 1uL);\n assert (U64.logxor 1uL 1uL == 0uL)\n\nlet logxor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= match t with\n | U8 -> logxor_one_bit_8 sec x y\n | U16 -> logxor_one_bit_16 sec x y\n | U32 -> logxor_one_bit_32 sec x y\n | U64 -> logxor_one_bit_64 sec x y\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logxor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = v y then 0 else 1) })\n= logxor_one_bit' x y;\n x `logxor` y\n\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet secret_bool\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: bool)\n: Tot (z: int_t t sec { v z == (if x then 1 else 0) })\n= cast t sec (if x then 1uy else 0uy)\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet lognot_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 then 0 else 1) })\n= x `logxor_one_bit` secret_bool true\n\n#push-options \"--z3rlimit 32\"\n\n[@\"opaque_to_smt\"]\nnoextract\ninline_for_extraction\nlet ff00_to_10\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == U.ones (bits t) })", "dependencies": { "source_file": "QUIC.Secret.Int.Aux.fst", "checked_file": "QUIC.Secret.Int.Aux.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x:\n Lib.IntTypes.int_t t sec\n { QUIC.Secret.Int.Base.v x == 0 \\/\n QUIC.Secret.Int.Base.v x == FStar.UInt.ones (Lib.IntTypes.bits t) }\n -> y:\n Lib.IntTypes.int_t t sec\n { QUIC.Secret.Int.Base.v y ==\n (match QUIC.Secret.Int.Base.v x = 0 with\n | true -> 0\n | _ -> 1) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "QUIC.Secret.Int.Base.supported_type", "Lib.IntTypes.secrecy_level", "Lib.IntTypes.int_t", "Prims.l_or", "Prims.eq2", "Prims.int", "QUIC.Secret.Int.Base.v", "FStar.UInt.size", "Lib.IntTypes.bits", "Lib.IntTypes.range", "FStar.UInt.ones", "Lib.IntTypes.logand", "Lib.IntTypes.mk_int", "Prims.unit", "Lib.IntTypes.logand_ones", "Lib.IntTypes.logand_zeros", "Prims.op_Equality", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ff00_to_10\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == U.ones (bits t)})\n : Tot (y: int_t t sec {v y == (if v x = 0 then 0 else 1)})\nlet ff00_to_10\n (#t: inttype{supported_type t})\n (#sec: secrecy_level)\n (x: int_t t sec {v x == 0 \\/ v x == U.ones (bits t)})\n : Tot (y: int_t t sec {v y == (if v x = 0 then 0 else 1)}) =", "completed_definiton": "logand_zeros (mk_int #t #sec 1);\nlogand_ones (mk_int #t #sec 1);\n(mk_int 1) `logand` x", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Aux.fst", "name": "QUIC.Secret.Int.Aux.min", "original_source_type": "val min (#t: inttype{supported_type t}) (x y: uint_t t SEC)\n : Tot (z: uint_t t SEC {v z == (if v x <= v y then v x else v y)})", "source_type": "val min (#t: inttype{supported_type t}) (x y: uint_t t SEC)\n : Tot (z: uint_t t SEC {v z == (if v x <= v y then v x else v y)})", "source_definition": "let min\n (#t: inttype { supported_type t })\n (x y: uint_t t SEC)\n: Tot (z: uint_t t SEC { v z == (if v x <= v y then v x else v y) })\n=\n let cond = secret_is_lt x y in\n (cond `mul` x) `add` (lognot_one_bit cond `mul` y)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Aux.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 247, "start_col": 1, "end_line": 249, "end_col": 52 }, "file_context": "module QUIC.Secret.Int.Aux\ninclude QUIC.Secret.Int.Base\n\nmodule U = FStar.UInt\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoextract noeq type must_inline =\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\n= x `mul` y\n\nlet logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logor 0uy 0uy == 0uy);\n assert (U8.logor 0uy 1uy == 1uy);\n assert (U8.logor 1uy 0uy == 1uy);\n assert (U8.logor 1uy 1uy == 1uy)\n\nlet logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logor 0us 0us == 0us);\n assert (U16.logor 0us 1us == 1us);\n assert (U16.logor 1us 0us == 1us);\n assert (U16.logor 1us 1us == 1us)\n\nlet logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logor 0ul 0ul == 0ul);\n assert (U32.logor 0ul 1ul == 1ul);\n assert (U32.logor 1ul 0ul == 1ul);\n assert (U32.logor 1ul 1ul == 1ul)\n\nlet logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logor 0uL 0uL == 0uL);\n assert (U64.logor 0uL 1uL == 1uL);\n assert (U64.logor 1uL 0uL == 1uL);\n assert (U64.logor 1uL 1uL == 1uL)\n\nlet logor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= match t with\n | U8 -> logor_one_bit_8 sec x y\n | U16 -> logor_one_bit_16 sec x y\n | U32 -> logor_one_bit_32 sec x y\n | U64 -> logor_one_bit_64 sec x y\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nnoextract\nlet logor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 || v y = 1 then 1 else 0) })\n= logor_one_bit' x y;\n x `logor` y\n\n\n\nlet logxor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logxor 0uy 0uy == 0uy);\n assert (U8.logxor 0uy 1uy == 1uy);\n assert (U8.logxor 1uy 0uy == 1uy);\n assert (U8.logxor 1uy 1uy == 0uy)\n\nlet logxor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logxor 0us 0us == 0us);\n assert (U16.logxor 0us 1us == 1us);\n assert (U16.logxor 1us 0us == 1us);\n assert (U16.logxor 1us 1us == 0us)\n\nlet logxor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logxor 0ul 0ul == 0ul);\n assert (U32.logxor 0ul 1ul == 1ul);\n assert (U32.logxor 1ul 0ul == 1ul);\n assert (U32.logxor 1ul 1ul == 0ul)\n\nlet logxor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logxor 0uL 0uL == 0uL);\n assert (U64.logxor 0uL 1uL == 1uL);\n assert (U64.logxor 1uL 0uL == 1uL);\n assert (U64.logxor 1uL 1uL == 0uL)\n\nlet logxor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= match t with\n | U8 -> logxor_one_bit_8 sec x y\n | U16 -> logxor_one_bit_16 sec x y\n | U32 -> logxor_one_bit_32 sec x y\n | U64 -> logxor_one_bit_64 sec x y\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logxor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = v y then 0 else 1) })\n= logxor_one_bit' x y;\n x `logxor` y\n\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet secret_bool\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: bool)\n: Tot (z: int_t t sec { v z == (if x then 1 else 0) })\n= cast t sec (if x then 1uy else 0uy)\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet lognot_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 then 0 else 1) })\n= x `logxor_one_bit` secret_bool true\n\n#push-options \"--z3rlimit 32\"\n\n[@\"opaque_to_smt\"]\nnoextract\ninline_for_extraction\nlet ff00_to_10\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == U.ones (bits t) })\n: Tot (y: int_t t sec { v y == (if v x = 0 then 0 else 1) })\n= logand_zeros (mk_int #t #sec 1);\n logand_ones (mk_int #t #sec 1);\n mk_int 1 `logand` x\n\n#pop-options\n\n[@\"opaque_to_smt\"]\nnoextract\ninline_for_extraction\nlet secrets_are_equal\n (#t: inttype { supported_type t })\n (x: int_t t SEC)\n (y: int_t t SEC)\n: Tot (z: int_t t SEC { v z == (if v x = v y then 1 else 0) })\n (decreases (size))\n= ff00_to_10 (eq_mask x y)\n\n[@\"opaque_to_smt\"]\nnoextract\ninline_for_extraction\nlet secret_is_lt\n (#t: inttype { supported_type t })\n (x: int_t t SEC)\n (y: int_t t SEC)\n: Tot (z: int_t t SEC { v z == (if v x < v y then 1 else 0) })\n (decreases (size))\n= ff00_to_10 (lt_mask x y)\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\" must_inline]\nlet min\n (#t: inttype { supported_type t })\n (x y: uint_t t SEC)", "dependencies": { "source_file": "QUIC.Secret.Int.Aux.fst", "checked_file": "QUIC.Secret.Int.Aux.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Lib.IntTypes.uint_t t Lib.IntTypes.SEC -> y: Lib.IntTypes.uint_t t Lib.IntTypes.SEC\n -> z:\n Lib.IntTypes.uint_t t Lib.IntTypes.SEC\n { QUIC.Secret.Int.Base.v z ==\n (match QUIC.Secret.Int.Base.v x <= QUIC.Secret.Int.Base.v y with\n | true -> QUIC.Secret.Int.Base.v x\n | _ -> QUIC.Secret.Int.Base.v y) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "QUIC.Secret.Int.Base.supported_type", "Lib.IntTypes.uint_t", "Lib.IntTypes.SEC", "Lib.IntTypes.add", "Lib.IntTypes.mul", "QUIC.Secret.Int.Aux.lognot_one_bit", "Lib.IntTypes.int_t", "Prims.eq2", "Prims.int", "Lib.IntTypes.v", "Prims.op_LessThan", "Prims.bool", "QUIC.Secret.Int.Aux.secret_is_lt", "Lib.IntTypes.range_t", "QUIC.Secret.Int.Base.v", "Prims.op_LessThanOrEqual" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val min (#t: inttype{supported_type t}) (x y: uint_t t SEC)\n : Tot (z: uint_t t SEC {v z == (if v x <= v y then v x else v y)})\nlet min (#t: inttype{supported_type t}) (x y: uint_t t SEC)\n : Tot (z: uint_t t SEC {v z == (if v x <= v y then v x else v y)}) =", "completed_definiton": "let cond = secret_is_lt x y in\n(cond `mul` x) `add` ((lognot_one_bit cond) `mul` y)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Aux.fst", "name": "QUIC.Secret.Int.Aux.max", "original_source_type": "val max (#t: inttype{supported_type t}) (x y: uint_t t SEC)\n : Tot (z: uint_t t SEC {v z == (if v y <= v x then v x else v y)})", "source_type": "val max (#t: inttype{supported_type t}) (x y: uint_t t SEC)\n : Tot (z: uint_t t SEC {v z == (if v y <= v x then v x else v y)})", "source_definition": "let max\n (#t: inttype { supported_type t })\n (x y: uint_t t SEC)\n: Tot (z: uint_t t SEC { v z == (if v y <= v x then v x else v y) })\n= let cond = secret_is_lt y x in\n (cond `mul` x) `add` (lognot_one_bit cond `mul` y)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Aux.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 258, "start_col": 1, "end_line": 259, "end_col": 52 }, "file_context": "module QUIC.Secret.Int.Aux\ninclude QUIC.Secret.Int.Base\n\nmodule U = FStar.UInt\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoextract noeq type must_inline =\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\n= x `mul` y\n\nlet logor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logor 0uy 0uy == 0uy);\n assert (U8.logor 0uy 1uy == 1uy);\n assert (U8.logor 1uy 0uy == 1uy);\n assert (U8.logor 1uy 1uy == 1uy)\n\nlet logor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logor 0us 0us == 0us);\n assert (U16.logor 0us 1us == 1us);\n assert (U16.logor 1us 0us == 1us);\n assert (U16.logor 1us 1us == 1us)\n\nlet logor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logor 0ul 0ul == 0ul);\n assert (U32.logor 0ul 1ul == 1ul);\n assert (U32.logor 1ul 0ul == 1ul);\n assert (U32.logor 1ul 1ul == 1ul)\n\nlet logor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= logor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logor 0uL 0uL == 0uL);\n assert (U64.logor 0uL 1uL == 1uL);\n assert (U64.logor 1uL 0uL == 1uL);\n assert (U64.logor 1uL 1uL == 1uL)\n\nlet logor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logor` y) == (if v x = 1 || v y = 1 then 1 else 0))\n= match t with\n | U8 -> logor_one_bit_8 sec x y\n | U16 -> logor_one_bit_16 sec x y\n | U32 -> logor_one_bit_32 sec x y\n | U64 -> logor_one_bit_64 sec x y\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nnoextract\nlet logor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 || v y = 1 then 1 else 0) })\n= logor_one_bit' x y;\n x `logor` y\n\n\n\nlet logxor_one_bit_8\n (sec: secrecy_level)\n (x: int_t U8 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U8 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U8.logxor 0uy 0uy == 0uy);\n assert (U8.logxor 0uy 1uy == 1uy);\n assert (U8.logxor 1uy 0uy == 1uy);\n assert (U8.logxor 1uy 1uy == 0uy)\n\nlet logxor_one_bit_16\n (sec: secrecy_level)\n (x: int_t U16 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U16 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U16.logxor 0us 0us == 0us);\n assert (U16.logxor 0us 1us == 1us);\n assert (U16.logxor 1us 0us == 1us);\n assert (U16.logxor 1us 1us == 0us)\n\nlet logxor_one_bit_32\n (sec: secrecy_level)\n (x: int_t U32 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U32 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U32.logxor 0ul 0ul == 0ul);\n assert (U32.logxor 0ul 1ul == 1ul);\n assert (U32.logxor 1ul 0ul == 1ul);\n assert (U32.logxor 1ul 1ul == 0ul)\n\nlet logxor_one_bit_64\n (sec: secrecy_level)\n (x: int_t U64 sec { v x == 0 \\/ v x == 1 })\n (y: int_t U64 sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= logxor_spec x y;\n allow_inversion secrecy_level;\n assert (U64.logxor 0uL 0uL == 0uL);\n assert (U64.logxor 0uL 1uL == 1uL);\n assert (U64.logxor 1uL 0uL == 1uL);\n assert (U64.logxor 1uL 1uL == 0uL)\n\nlet logxor_one_bit'\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Lemma\n (v (x `logxor` y) == (if v x = v y then 0 else 1))\n= match t with\n | U8 -> logxor_one_bit_8 sec x y\n | U16 -> logxor_one_bit_16 sec x y\n | U32 -> logxor_one_bit_32 sec x y\n | U64 -> logxor_one_bit_64 sec x y\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet logxor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = v y then 0 else 1) })\n= logxor_one_bit' x y;\n x `logxor` y\n\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet secret_bool\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: bool)\n: Tot (z: int_t t sec { v z == (if x then 1 else 0) })\n= cast t sec (if x then 1uy else 0uy)\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\"]\nlet lognot_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 then 0 else 1) })\n= x `logxor_one_bit` secret_bool true\n\n#push-options \"--z3rlimit 32\"\n\n[@\"opaque_to_smt\"]\nnoextract\ninline_for_extraction\nlet ff00_to_10\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == U.ones (bits t) })\n: Tot (y: int_t t sec { v y == (if v x = 0 then 0 else 1) })\n= logand_zeros (mk_int #t #sec 1);\n logand_ones (mk_int #t #sec 1);\n mk_int 1 `logand` x\n\n#pop-options\n\n[@\"opaque_to_smt\"]\nnoextract\ninline_for_extraction\nlet secrets_are_equal\n (#t: inttype { supported_type t })\n (x: int_t t SEC)\n (y: int_t t SEC)\n: Tot (z: int_t t SEC { v z == (if v x = v y then 1 else 0) })\n (decreases (size))\n= ff00_to_10 (eq_mask x y)\n\n[@\"opaque_to_smt\"]\nnoextract\ninline_for_extraction\nlet secret_is_lt\n (#t: inttype { supported_type t })\n (x: int_t t SEC)\n (y: int_t t SEC)\n: Tot (z: int_t t SEC { v z == (if v x < v y then 1 else 0) })\n (decreases (size))\n= ff00_to_10 (lt_mask x y)\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\" must_inline]\nlet min\n (#t: inttype { supported_type t })\n (x y: uint_t t SEC)\n: Tot (z: uint_t t SEC { v z == (if v x <= v y then v x else v y) })\n=\n let cond = secret_is_lt x y in\n (cond `mul` x) `add` (lognot_one_bit cond `mul` y)\n\ninline_for_extraction\nnoextract\n[@\"opaque_to_smt\" must_inline]\nlet max\n (#t: inttype { supported_type t })\n (x y: uint_t t SEC)", "dependencies": { "source_file": "QUIC.Secret.Int.Aux.fst", "checked_file": "QUIC.Secret.Int.Aux.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Lib.IntTypes.uint_t t Lib.IntTypes.SEC -> y: Lib.IntTypes.uint_t t Lib.IntTypes.SEC\n -> z:\n Lib.IntTypes.uint_t t Lib.IntTypes.SEC\n { QUIC.Secret.Int.Base.v z ==\n (match QUIC.Secret.Int.Base.v y <= QUIC.Secret.Int.Base.v x with\n | true -> QUIC.Secret.Int.Base.v x\n | _ -> QUIC.Secret.Int.Base.v y) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "QUIC.Secret.Int.Base.supported_type", "Lib.IntTypes.uint_t", "Lib.IntTypes.SEC", "Lib.IntTypes.add", "Lib.IntTypes.mul", "QUIC.Secret.Int.Aux.lognot_one_bit", "Lib.IntTypes.int_t", "Prims.eq2", "Prims.int", "Lib.IntTypes.v", "Prims.op_LessThan", "Prims.bool", "QUIC.Secret.Int.Aux.secret_is_lt", "Lib.IntTypes.range_t", "QUIC.Secret.Int.Base.v", "Prims.op_LessThanOrEqual" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val max (#t: inttype{supported_type t}) (x y: uint_t t SEC)\n : Tot (z: uint_t t SEC {v z == (if v y <= v x then v x else v y)})\nlet max (#t: inttype{supported_type t}) (x y: uint_t t SEC)\n : Tot (z: uint_t t SEC {v z == (if v y <= v x then v x else v y)}) =", "completed_definiton": "let cond = secret_is_lt y x in\n(cond `mul` x) `add` ((lognot_one_bit cond) `mul` y)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Parse.fst", "name": "QUIC.Impl.Header.Parse.header_p", "original_source_type": "val header_p (h: Public.header) : Tot header", "source_type": "val header_p (h: Public.header) : Tot header", "source_definition": "let header_p\n (h: Public.header)\n: Tot header\n= match h with\n | Public.PShort pb spin cid cid_len ->\n let rb = impl_protected_bits_reserved true pb in\n let phase = impl_protected_bits_key_phase pb in\n let pnl = impl_protected_bits_pn_length true pb in\n BShort rb spin phase cid cid_len pnl\n | Public.PLong pb version dcid dcil scid scil spec ->\n let rb = impl_protected_bits_reserved false pb in\n let pnl = impl_protected_bits_pn_length false pb in\n BLong version dcid dcil scid scil\n begin match spec with\n | Public.PInitial payload_and_pn_length token token_length ->\n BInitial rb payload_and_pn_length pnl token token_length\n | Public.PHandshake payload_and_pn_length ->\n BHandshake rb payload_and_pn_length pnl\n | Public.PZeroRTT payload_and_pn_length ->\n BZeroRTT rb payload_and_pn_length pnl\n | Public.PRetry odcid odcil ->\n BRetry pb odcid odcil\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 241, "start_col": 2, "end_line": 260, "end_col": 7 }, "file_context": "module QUIC.Impl.Header.Parse\n\nopen QUIC.Spec.Header.Parse\nopen QUIC.Impl.Header.Base\n\nfriend QUIC.Spec.Header.Parse\n\nmodule LP = LowParse.Low.Base\nmodule Public = QUIC.Impl.Header.Public\nmodule U8 = FStar.UInt8\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule Spec = QUIC.Spec.Header.Parse\nmodule PN = QUIC.Impl.PacketNumber\n\n[@\"opaque_to_smt\"]\nlet impl_short_protected_bits\n (reserved_bits: secret_bitfield 2)\n (key_phase: secret_bitfield 1)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_short_protected_bits (Secret.reveal reserved_bits) (Secret.v key_phase = 1) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\nSecret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 3ul key_phase) 3ul 5ul reserved_bits\n\n[@\"opaque_to_smt\"]\nlet impl_long_protected_bits\n (reserved_bits: secret_bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_long_protected_bits (Secret.reveal reserved_bits) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\n Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 4ul reserved_bits\n\nlet p_header\n (h: header)\n: Tot Public.header\n= match h with\n | BShort rb spin phase cid cid_len pnl ->\n Public.PShort (impl_short_protected_bits rb phase pnl) spin cid cid_len\n | BLong version dcid dcil scid scil spec ->\n begin match spec with\n | BInitial rb payload_and_pn_length pnl token token_length ->\n let spec' = (Public.PInitial payload_and_pn_length token token_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BZeroRTT rb payload_and_pn_length pnl ->\n let spec' = (Public.PZeroRTT payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BHandshake rb payload_and_pn_length pnl ->\n let spec' = (Public.PHandshake payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BRetry unused odcid odcil ->\n let spec' = (Public.PRetry odcid odcil) in\n Public.PLong unused version dcid dcil scid scil spec'\n end\n\nlet public_header_len_correct\n (h: header)\n: Lemma\n (public_header_len h == Public.header_len (p_header h))\n= ()\n\n#push-options \"--z3rlimit 1024 --query_stats\"\n\nlet public_g_header_p_header\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph\n )\n= ()\n\nlet public_header_len_correct'\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph /\\\n U32.v (public_header_len h) == Seq.length (LP.serialize (Public.serialize_header cid_len) ph) \n )\n= public_header_len_correct h;\n public_g_header_p_header h m pn;\n Public.header_len_correct (dcid_len h) m (p_header h)\n\n#restart-solver\n\nlet public_header_len_is_pn_offset\n h m pn\n= public_header_len_correct' h m pn\n\n#pop-options\n\n#push-options \"--z3rlimit 16 --query_stats --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\nlet header_len_correct\n h m pn\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n public_g_header_p_header h m pn;\n assert (Public.g_header (p_header h) m == ph);\n serialize_header_eq cid_len last gh;\n Public.header_len_correct cid_len m (p_header h);\n public_header_len_correct h;\n public_header_len_correct' h m pn;\n assert (Seq.length (LP.serialize (Public.serialize_header cid_len) ph) == U32.v (public_header_len h));\n if is_retry h\n then begin\n header_len_is_retry h;\n assert (Secret.v (header_len h) == Spec.header_len (g_header h m pn))\n end else begin\n header_len_not_is_retry h;\n assert (pn_offset gh + Secret.v (Spec.pn_length gh) == Spec.header_len gh);\n assert (pn_offset gh == Seq.length (LP.serialize (Public.serialize_header cid_len) ph));\n assert (Secret.v (header_len h) == Spec.header_len (g_header h m pn))\n end\n\n#pop-options\n\nlet last_pn\n (is_retry: bool)\n (pn: PN.packet_number_t)\n: Tot PN.last_packet_number_t\n= if is_retry\n then Secret.to_u64 0uL\n else\n let cond = Secret.lognot_one_bit (pn `Secret.secrets_are_equal_62` Secret.to_u64 0uL) in\n pn `Secret.sub` cond\n\n#push-options \"--z3rlimit 64 --query_stats\"\n\nlet last_pn_correct\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma\n (last_packet_number (g_header h m pn) == last_pn (is_retry h) pn)\n= ()\n\n#pop-options\n\n#push-options \"--z3rlimit 128 --query_stats\"\n\n#restart-solver\n\nlet write_header\n h pn out out_len\n= let m = HST.get () in\n header_len_correct h m pn;\n public_header_len_correct' h m pn;\n let cid_len = dcid_len h in\n let last = last_pn (is_retry h) pn in\n last_pn_correct h m pn;\n let ph = p_header h in\n in_window_last_packet_number (g_header h m pn);\n serialize_header_eq cid_len last (g_header h m pn);\n let len = Public.write_header cid_len ph out out_len in\n if is_retry h\n then ()\n else begin\n assert (len == Public.header_len ph);\n let pn_len = pn_length h in\n let m1 = HST.get () in\n SecretBuffer.with_buffer_hide\n #unit\n out\n len\n (len `U32.add` 4ul)\n m1\n B.loc_none\n B.loc_none\n 1ul 0ul 0ul 4ul 1ul 0ul\n (fun _ contl cont _ _ ->\n contl == LP.serialize (Public.serialize_header cid_len) (Public.g_header ph m) /\\\n Seq.slice cont 0 (Secret.v pn_len) `Seq.equal` LP.serialize (PN.serialize_packet_number last pn_len) pn\n )\n (fun _ _ bs _ ->\n PN.write_packet_number last pn_len pn bs\n )\n end\n \n#pop-options\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet putative_pn_offset\n cid_len b b_len\n=\n let h = HST.get () in\n let input = LP.make_slice b b_len in\n assert (LP.bytes_of_slice_from h input 0ul `Seq.equal` B.as_seq h b);\n LP.valid_facts (Public.parse_header cid_len) h input 0ul;\n let res = Public.validate_header cid_len input 0uL in\n if LP.is_error res\n then None\n else Some (LP.uint64_to_uint32 res)\n\n#pop-options\n\nlet impl_protected_bits_pn_length\n (is_short: bool)\n (pb: secret_bitfield (if is_short then 5 else 4))\n: Tot (y: PN.packet_number_length_t { y == protected_bits_pn_length is_short (Secret.reveal pb) })\n= // https://github.com/FStarLang/karamel/issues/102\n let bf = Secret.get_bitfield #Secret.U8 pb 0ul 2ul in\n Secret.to_u32 #Secret.U8 (Secret.to_u8 1uy `Secret.add` bf)\n\nlet impl_protected_bits_reserved\n (is_short: bool)\n (pb: secret_bitfield (if is_short then 5 else 4))\n: Tot (y: secret_bitfield 2 { Secret.reveal y == protected_bits_reserved is_short (Secret.reveal pb) })\n= if is_short\n then Secret.get_bitfield #Secret.U8 pb 3ul 5ul\n else Secret.get_bitfield #Secret.U8 pb 2ul 4ul\n\nlet impl_protected_bits_key_phase\n (x: secret_bitfield 5)\n: Tot (y: secret_bitfield 1 { protected_bits_key_phase (Secret.reveal x) == (Secret.v y = 1) })\n= Secret.get_bitfield #Secret.U8 x 2ul 3ul\n\nlet header_p\n (h: Public.header)", "dependencies": { "source_file": "QUIC.Impl.Header.Parse.fst", "checked_file": "QUIC.Impl.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.PacketNumber.fsti.checked", "QUIC.Impl.Header.Public.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Impl.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Impl.Header.Public" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Impl.Header.Public.header -> QUIC.Impl.Header.Base.header", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Public.header", "QUIC.Spec.Base.secret_bitfield", "Prims.bool", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.op_LessThanOrEqual", "FStar.UInt.uint_t", "FStar.UInt32.v", "QUIC.Impl.Header.Base.BShort", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.Header.Parse.protected_bits_pn_length", "QUIC.Secret.Int.reveal", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "QUIC.Impl.Header.Parse.impl_protected_bits_pn_length", "QUIC.Spec.Header.Parse.protected_bits_key_phase", "Prims.op_Equality", "Lib.IntTypes.v", "QUIC.Impl.Header.Parse.impl_protected_bits_key_phase", "Lib.IntTypes.range", "Lib.IntTypes.PUB", "Prims.op_LessThan", "FStar.UInt8.v", "Prims.pow2", "QUIC.Spec.Header.Parse.protected_bits_reserved", "QUIC.Impl.Header.Parse.impl_protected_bits_reserved", "QUIC.Impl.Header.Public.long_header_specifics", "QUIC.Impl.Header.Base.BLong", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Base.token_max_len", "QUIC.Impl.Header.Base.BInitial", "QUIC.Impl.Header.Base.BHandshake", "QUIC.Impl.Header.Base.BZeroRTT", "QUIC.Impl.Header.Base.BRetry", "QUIC.Impl.Header.Base.long_header_specifics", "QUIC.Impl.Header.Base.header" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val header_p (h: Public.header) : Tot header\nlet header_p (h: Public.header) : Tot header =", "completed_definiton": "match h with\n| Public.PShort pb spin cid cid_len ->\n let rb = impl_protected_bits_reserved true pb in\n let phase = impl_protected_bits_key_phase pb in\n let pnl = impl_protected_bits_pn_length true pb in\n BShort rb spin phase cid cid_len pnl\n| Public.PLong pb version dcid dcil scid scil spec ->\n let rb = impl_protected_bits_reserved false pb in\n let pnl = impl_protected_bits_pn_length false pb in\n BLong version\n dcid\n dcil\n scid\n scil\n (match spec with\n | Public.PInitial payload_and_pn_length token token_length ->\n BInitial rb payload_and_pn_length pnl token token_length\n | Public.PHandshake payload_and_pn_length -> BHandshake rb payload_and_pn_length pnl\n | Public.PZeroRTT payload_and_pn_length -> BZeroRTT rb payload_and_pn_length pnl\n | Public.PRetry odcid odcil -> BRetry pb odcid odcil)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Parse.fst", "name": "QUIC.Impl.Header.Parse.last_pn", "original_source_type": "val last_pn (is_retry: bool) (pn: PN.packet_number_t) : Tot PN.last_packet_number_t", "source_type": "val last_pn (is_retry: bool) (pn: PN.packet_number_t) : Tot PN.last_packet_number_t", "source_definition": "let last_pn\n (is_retry: bool)\n (pn: PN.packet_number_t)\n: Tot PN.last_packet_number_t\n= if is_retry\n then Secret.to_u64 0uL\n else\n let cond = Secret.lognot_one_bit (pn `Secret.secrets_are_equal_62` Secret.to_u64 0uL) in\n pn `Secret.sub` cond", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 139, "start_col": 2, "end_line": 143, "end_col": 24 }, "file_context": "module QUIC.Impl.Header.Parse\n\nopen QUIC.Spec.Header.Parse\nopen QUIC.Impl.Header.Base\n\nfriend QUIC.Spec.Header.Parse\n\nmodule LP = LowParse.Low.Base\nmodule Public = QUIC.Impl.Header.Public\nmodule U8 = FStar.UInt8\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule Spec = QUIC.Spec.Header.Parse\nmodule PN = QUIC.Impl.PacketNumber\n\n[@\"opaque_to_smt\"]\nlet impl_short_protected_bits\n (reserved_bits: secret_bitfield 2)\n (key_phase: secret_bitfield 1)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_short_protected_bits (Secret.reveal reserved_bits) (Secret.v key_phase = 1) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\nSecret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 3ul key_phase) 3ul 5ul reserved_bits\n\n[@\"opaque_to_smt\"]\nlet impl_long_protected_bits\n (reserved_bits: secret_bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_long_protected_bits (Secret.reveal reserved_bits) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\n Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 4ul reserved_bits\n\nlet p_header\n (h: header)\n: Tot Public.header\n= match h with\n | BShort rb spin phase cid cid_len pnl ->\n Public.PShort (impl_short_protected_bits rb phase pnl) spin cid cid_len\n | BLong version dcid dcil scid scil spec ->\n begin match spec with\n | BInitial rb payload_and_pn_length pnl token token_length ->\n let spec' = (Public.PInitial payload_and_pn_length token token_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BZeroRTT rb payload_and_pn_length pnl ->\n let spec' = (Public.PZeroRTT payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BHandshake rb payload_and_pn_length pnl ->\n let spec' = (Public.PHandshake payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BRetry unused odcid odcil ->\n let spec' = (Public.PRetry odcid odcil) in\n Public.PLong unused version dcid dcil scid scil spec'\n end\n\nlet public_header_len_correct\n (h: header)\n: Lemma\n (public_header_len h == Public.header_len (p_header h))\n= ()\n\n#push-options \"--z3rlimit 1024 --query_stats\"\n\nlet public_g_header_p_header\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph\n )\n= ()\n\nlet public_header_len_correct'\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph /\\\n U32.v (public_header_len h) == Seq.length (LP.serialize (Public.serialize_header cid_len) ph) \n )\n= public_header_len_correct h;\n public_g_header_p_header h m pn;\n Public.header_len_correct (dcid_len h) m (p_header h)\n\n#restart-solver\n\nlet public_header_len_is_pn_offset\n h m pn\n= public_header_len_correct' h m pn\n\n#pop-options\n\n#push-options \"--z3rlimit 16 --query_stats --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\nlet header_len_correct\n h m pn\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n public_g_header_p_header h m pn;\n assert (Public.g_header (p_header h) m == ph);\n serialize_header_eq cid_len last gh;\n Public.header_len_correct cid_len m (p_header h);\n public_header_len_correct h;\n public_header_len_correct' h m pn;\n assert (Seq.length (LP.serialize (Public.serialize_header cid_len) ph) == U32.v (public_header_len h));\n if is_retry h\n then begin\n header_len_is_retry h;\n assert (Secret.v (header_len h) == Spec.header_len (g_header h m pn))\n end else begin\n header_len_not_is_retry h;\n assert (pn_offset gh + Secret.v (Spec.pn_length gh) == Spec.header_len gh);\n assert (pn_offset gh == Seq.length (LP.serialize (Public.serialize_header cid_len) ph));\n assert (Secret.v (header_len h) == Spec.header_len (g_header h m pn))\n end\n\n#pop-options\n\nlet last_pn\n (is_retry: bool)\n (pn: PN.packet_number_t)", "dependencies": { "source_file": "QUIC.Impl.Header.Parse.fst", "checked_file": "QUIC.Impl.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.PacketNumber.fsti.checked", "QUIC.Impl.Header.Public.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Impl.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Impl.Header.Public" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "is_retry: Prims.bool -> pn: QUIC.Spec.PacketNumber.Base.packet_number_t\n -> QUIC.Spec.PacketNumber.Base.last_packet_number_t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.bool", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Lib.IntTypes.to_u64", "Lib.IntTypes.U64", "Lib.IntTypes.PUB", "FStar.UInt64.__uint_to_t", "Lib.IntTypes.sub", "Lib.IntTypes.SEC", "Lib.IntTypes.int_t", "Prims.eq2", "Prims.int", "Lib.IntTypes.v", "Prims.op_Equality", "QUIC.Secret.Int.secrets_are_equal_62", "Lib.IntTypes.cast", "FStar.UInt64.uint_to_t", "FStar.UInt64.t", "QUIC.Secret.Int.lognot_one_bit", "QUIC.Spec.PacketNumber.Base.last_packet_number_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val last_pn (is_retry: bool) (pn: PN.packet_number_t) : Tot PN.last_packet_number_t\nlet last_pn (is_retry: bool) (pn: PN.packet_number_t) : Tot PN.last_packet_number_t =", "completed_definiton": "if is_retry\nthen Secret.to_u64 0uL\nelse\n let cond = Secret.lognot_one_bit (pn `Secret.secrets_are_equal_62` (Secret.to_u64 0uL)) in\n pn `Secret.sub` cond", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Parse.fst", "name": "QUIC.Impl.Header.Parse.parse_public_header_consumes", "original_source_type": "val parse_public_header_consumes\n (cid_len: short_dcid_len_t)\n (x: bytes)\n (ph: Public.header)\n (m: HS.mem)\n : Lemma\n (requires\n (match LP.parse (Public.parse_header cid_len) x with\n | None -> False\n | Some (ph0, _) -> Public.g_header ph m == ph0))\n (ensures\n (let Some (ph0, consumed) = LP.parse (Public.parse_header cid_len) x in\n consumed == U32.v (Public.header_len ph)))", "source_type": "val parse_public_header_consumes\n (cid_len: short_dcid_len_t)\n (x: bytes)\n (ph: Public.header)\n (m: HS.mem)\n : Lemma\n (requires\n (match LP.parse (Public.parse_header cid_len) x with\n | None -> False\n | Some (ph0, _) -> Public.g_header ph m == ph0))\n (ensures\n (let Some (ph0, consumed) = LP.parse (Public.parse_header cid_len) x in\n consumed == U32.v (Public.header_len ph)))", "source_definition": "let parse_public_header_consumes\n (cid_len: short_dcid_len_t)\n (x: bytes)\n (ph: Public.header)\n (m: HS.mem)\n: Lemma\n (requires (\n match LP.parse (Public.parse_header cid_len) x with\n | None -> False\n | Some (ph0, _) -> Public.g_header ph m == ph0\n ))\n (ensures (\n let Some (ph0, consumed) = LP.parse (Public.parse_header cid_len) x in\n consumed == U32.v (Public.header_len ph)\n ))\n= let Some (ph0, consumed) = LP.parse (Public.parse_header cid_len) x in\n Public.header_len_correct cid_len m ph;\n LP.parse_serialize (Public.serialize_header cid_len) ph0;\n LP.parse_injective (Public.parse_header cid_len) x (LP.serialize (Public.serialize_header cid_len) ph0)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 304, "start_col": 1, "end_line": 307, "end_col": 105 }, "file_context": "module QUIC.Impl.Header.Parse\n\nopen QUIC.Spec.Header.Parse\nopen QUIC.Impl.Header.Base\n\nfriend QUIC.Spec.Header.Parse\n\nmodule LP = LowParse.Low.Base\nmodule Public = QUIC.Impl.Header.Public\nmodule U8 = FStar.UInt8\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule Spec = QUIC.Spec.Header.Parse\nmodule PN = QUIC.Impl.PacketNumber\n\n[@\"opaque_to_smt\"]\nlet impl_short_protected_bits\n (reserved_bits: secret_bitfield 2)\n (key_phase: secret_bitfield 1)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_short_protected_bits (Secret.reveal reserved_bits) (Secret.v key_phase = 1) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\nSecret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 3ul key_phase) 3ul 5ul reserved_bits\n\n[@\"opaque_to_smt\"]\nlet impl_long_protected_bits\n (reserved_bits: secret_bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_long_protected_bits (Secret.reveal reserved_bits) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\n Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 4ul reserved_bits\n\nlet p_header\n (h: header)\n: Tot Public.header\n= match h with\n | BShort rb spin phase cid cid_len pnl ->\n Public.PShort (impl_short_protected_bits rb phase pnl) spin cid cid_len\n | BLong version dcid dcil scid scil spec ->\n begin match spec with\n | BInitial rb payload_and_pn_length pnl token token_length ->\n let spec' = (Public.PInitial payload_and_pn_length token token_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BZeroRTT rb payload_and_pn_length pnl ->\n let spec' = (Public.PZeroRTT payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BHandshake rb payload_and_pn_length pnl ->\n let spec' = (Public.PHandshake payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BRetry unused odcid odcil ->\n let spec' = (Public.PRetry odcid odcil) in\n Public.PLong unused version dcid dcil scid scil spec'\n end\n\nlet public_header_len_correct\n (h: header)\n: Lemma\n (public_header_len h == Public.header_len (p_header h))\n= ()\n\n#push-options \"--z3rlimit 1024 --query_stats\"\n\nlet public_g_header_p_header\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph\n )\n= ()\n\nlet public_header_len_correct'\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph /\\\n U32.v (public_header_len h) == Seq.length (LP.serialize (Public.serialize_header cid_len) ph) \n )\n= public_header_len_correct h;\n public_g_header_p_header h m pn;\n Public.header_len_correct (dcid_len h) m (p_header h)\n\n#restart-solver\n\nlet public_header_len_is_pn_offset\n h m pn\n= public_header_len_correct' h m pn\n\n#pop-options\n\n#push-options \"--z3rlimit 16 --query_stats --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\nlet header_len_correct\n h m pn\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n public_g_header_p_header h m pn;\n assert (Public.g_header (p_header h) m == ph);\n serialize_header_eq cid_len last gh;\n Public.header_len_correct cid_len m (p_header h);\n public_header_len_correct h;\n public_header_len_correct' h m pn;\n assert (Seq.length (LP.serialize (Public.serialize_header cid_len) ph) == U32.v (public_header_len h));\n if is_retry h\n then begin\n header_len_is_retry h;\n assert (Secret.v (header_len h) == Spec.header_len (g_header h m pn))\n end else begin\n header_len_not_is_retry h;\n assert (pn_offset gh + Secret.v (Spec.pn_length gh) == Spec.header_len gh);\n assert (pn_offset gh == Seq.length (LP.serialize (Public.serialize_header cid_len) ph));\n assert (Secret.v (header_len h) == Spec.header_len (g_header h m pn))\n end\n\n#pop-options\n\nlet last_pn\n (is_retry: bool)\n (pn: PN.packet_number_t)\n: Tot PN.last_packet_number_t\n= if is_retry\n then Secret.to_u64 0uL\n else\n let cond = Secret.lognot_one_bit (pn `Secret.secrets_are_equal_62` Secret.to_u64 0uL) in\n pn `Secret.sub` cond\n\n#push-options \"--z3rlimit 64 --query_stats\"\n\nlet last_pn_correct\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma\n (last_packet_number (g_header h m pn) == last_pn (is_retry h) pn)\n= ()\n\n#pop-options\n\n#push-options \"--z3rlimit 128 --query_stats\"\n\n#restart-solver\n\nlet write_header\n h pn out out_len\n= let m = HST.get () in\n header_len_correct h m pn;\n public_header_len_correct' h m pn;\n let cid_len = dcid_len h in\n let last = last_pn (is_retry h) pn in\n last_pn_correct h m pn;\n let ph = p_header h in\n in_window_last_packet_number (g_header h m pn);\n serialize_header_eq cid_len last (g_header h m pn);\n let len = Public.write_header cid_len ph out out_len in\n if is_retry h\n then ()\n else begin\n assert (len == Public.header_len ph);\n let pn_len = pn_length h in\n let m1 = HST.get () in\n SecretBuffer.with_buffer_hide\n #unit\n out\n len\n (len `U32.add` 4ul)\n m1\n B.loc_none\n B.loc_none\n 1ul 0ul 0ul 4ul 1ul 0ul\n (fun _ contl cont _ _ ->\n contl == LP.serialize (Public.serialize_header cid_len) (Public.g_header ph m) /\\\n Seq.slice cont 0 (Secret.v pn_len) `Seq.equal` LP.serialize (PN.serialize_packet_number last pn_len) pn\n )\n (fun _ _ bs _ ->\n PN.write_packet_number last pn_len pn bs\n )\n end\n \n#pop-options\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet putative_pn_offset\n cid_len b b_len\n=\n let h = HST.get () in\n let input = LP.make_slice b b_len in\n assert (LP.bytes_of_slice_from h input 0ul `Seq.equal` B.as_seq h b);\n LP.valid_facts (Public.parse_header cid_len) h input 0ul;\n let res = Public.validate_header cid_len input 0uL in\n if LP.is_error res\n then None\n else Some (LP.uint64_to_uint32 res)\n\n#pop-options\n\nlet impl_protected_bits_pn_length\n (is_short: bool)\n (pb: secret_bitfield (if is_short then 5 else 4))\n: Tot (y: PN.packet_number_length_t { y == protected_bits_pn_length is_short (Secret.reveal pb) })\n= // https://github.com/FStarLang/karamel/issues/102\n let bf = Secret.get_bitfield #Secret.U8 pb 0ul 2ul in\n Secret.to_u32 #Secret.U8 (Secret.to_u8 1uy `Secret.add` bf)\n\nlet impl_protected_bits_reserved\n (is_short: bool)\n (pb: secret_bitfield (if is_short then 5 else 4))\n: Tot (y: secret_bitfield 2 { Secret.reveal y == protected_bits_reserved is_short (Secret.reveal pb) })\n= if is_short\n then Secret.get_bitfield #Secret.U8 pb 3ul 5ul\n else Secret.get_bitfield #Secret.U8 pb 2ul 4ul\n\nlet impl_protected_bits_key_phase\n (x: secret_bitfield 5)\n: Tot (y: secret_bitfield 1 { protected_bits_key_phase (Secret.reveal x) == (Secret.v y = 1) })\n= Secret.get_bitfield #Secret.U8 x 2ul 3ul\n\nlet header_p\n (h: Public.header)\n: Tot header\n= match h with\n | Public.PShort pb spin cid cid_len ->\n let rb = impl_protected_bits_reserved true pb in\n let phase = impl_protected_bits_key_phase pb in\n let pnl = impl_protected_bits_pn_length true pb in\n BShort rb spin phase cid cid_len pnl\n | Public.PLong pb version dcid dcil scid scil spec ->\n let rb = impl_protected_bits_reserved false pb in\n let pnl = impl_protected_bits_pn_length false pb in\n BLong version dcid dcil scid scil\n begin match spec with\n | Public.PInitial payload_and_pn_length token token_length ->\n BInitial rb payload_and_pn_length pnl token token_length\n | Public.PHandshake payload_and_pn_length ->\n BHandshake rb payload_and_pn_length pnl\n | Public.PZeroRTT payload_and_pn_length ->\n BZeroRTT rb payload_and_pn_length pnl\n | Public.PRetry odcid odcil ->\n BRetry pb odcid odcil\n end\n\n#push-options \"--z3rlimit 16\"\n\nlet g_header_header_p\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: HS.mem)\n (ph: Public.header { Public.parse_header_prop cid_len (Public.g_header ph m) })\n (pn: PN.packet_number_t)\n: Lemma (\n let h = header_p ph in\n let gh = Public.g_header ph m in\n if\n if Public.is_retry ph\n then true\n else\n let pn_len = pn_length h in\n PN.in_window (Secret.v pn_len - 1) (Secret.v last) (Secret.v pn)\n then\n let h' = synth_header cid_len last (| gh, (if Public.is_retry ph then () else pn) |) in\n g_header (header_p ph) m pn == h'\n else\n True\n )\n= ()\n\n#pop-options\n\nlet parse_public_header_consumes\n (cid_len: short_dcid_len_t)\n (x: bytes)\n (ph: Public.header)\n (m: HS.mem)\n: Lemma\n (requires (\n match LP.parse (Public.parse_header cid_len) x with\n | None -> False\n | Some (ph0, _) -> Public.g_header ph m == ph0\n ))\n (ensures (\n let Some (ph0, consumed) = LP.parse (Public.parse_header cid_len) x in\n consumed == U32.v (Public.header_len ph)", "dependencies": { "source_file": "QUIC.Impl.Header.Parse.fst", "checked_file": "QUIC.Impl.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.PacketNumber.fsti.checked", "QUIC.Impl.Header.Public.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Impl.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Impl.Header.Public" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n cid_len: QUIC.Spec.Base.short_dcid_len_t ->\n x: QUIC.Spec.Base.bytes ->\n ph: QUIC.Impl.Header.Public.header ->\n m: FStar.Monotonic.HyperStack.mem\n -> FStar.Pervasives.Lemma\n (requires\n ((match LowParse.Spec.Base.parse (QUIC.Spec.Header.Public.parse_header cid_len) x with\n | FStar.Pervasives.Native.None #_ -> Prims.l_False\n | FStar.Pervasives.Native.Some #_ (FStar.Pervasives.Native.Mktuple2 #_ #_ ph0 _) ->\n QUIC.Impl.Header.Public.g_header ph m == ph0)\n <:\n Type0))\n (ensures\n (let _ = LowParse.Spec.Base.parse (QUIC.Spec.Header.Public.parse_header cid_len) x in\n (let FStar.Pervasives.Native.Some #_ (FStar.Pervasives.Native.Mktuple2 #_ #_ _ consumed) =\n _\n in\n consumed == FStar.UInt32.v (QUIC.Impl.Header.Public.header_len ph))\n <:\n Type0))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.Base.bytes", "QUIC.Impl.Header.Public.header", "FStar.Monotonic.HyperStack.mem", "QUIC.Spec.Header.Public.header'", "LowParse.Spec.Base.consumed_length", "LowParse.Spec.Base.parse_injective", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Public.serialize_header", "Prims.unit", "LowParse.Spec.Base.parse_serialize", "QUIC.Impl.Header.Public.header_len_correct", "FStar.Pervasives.Native.option", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Base.parse", "Prims.l_False", "Prims.eq2", "QUIC.Spec.Header.Public.header", "QUIC.Impl.Header.Public.g_header", "Prims.squash", "Prims.int", "Prims.l_or", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "FStar.UInt.size", "FStar.UInt32.n", "FStar.UInt32.v", "QUIC.Impl.Header.Public.header_len", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_public_header_consumes\n (cid_len: short_dcid_len_t)\n (x: bytes)\n (ph: Public.header)\n (m: HS.mem)\n : Lemma\n (requires\n (match LP.parse (Public.parse_header cid_len) x with\n | None -> False\n | Some (ph0, _) -> Public.g_header ph m == ph0))\n (ensures\n (let Some (ph0, consumed) = LP.parse (Public.parse_header cid_len) x in\n consumed == U32.v (Public.header_len ph)))\nlet parse_public_header_consumes\n (cid_len: short_dcid_len_t)\n (x: bytes)\n (ph: Public.header)\n (m: HS.mem)\n : Lemma\n (requires\n (match LP.parse (Public.parse_header cid_len) x with\n | None -> False\n | Some (ph0, _) -> Public.g_header ph m == ph0))\n (ensures\n (let Some (ph0, consumed) = LP.parse (Public.parse_header cid_len) x in\n consumed == U32.v (Public.header_len ph))) =", "completed_definiton": "let Some (ph0, consumed) = LP.parse (Public.parse_header cid_len) x in\nPublic.header_len_correct cid_len m ph;\nLP.parse_serialize (Public.serialize_header cid_len) ph0;\nLP.parse_injective (Public.parse_header cid_len)\n x\n (LP.serialize (Public.serialize_header cid_len) ph0)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Parse.fst", "name": "QUIC.Impl.Header.Parse.impl_protected_bits_reserved", "original_source_type": "val impl_protected_bits_reserved (is_short: bool) (pb: secret_bitfield (if is_short then 5 else 4))\n : Tot\n (y: secret_bitfield 2 {Secret.reveal y == protected_bits_reserved is_short (Secret.reveal pb)})", "source_type": "val impl_protected_bits_reserved (is_short: bool) (pb: secret_bitfield (if is_short then 5 else 4))\n : Tot\n (y: secret_bitfield 2 {Secret.reveal y == protected_bits_reserved is_short (Secret.reveal pb)})", "source_definition": "let impl_protected_bits_reserved\n (is_short: bool)\n (pb: secret_bitfield (if is_short then 5 else 4))\n: Tot (y: secret_bitfield 2 { Secret.reveal y == protected_bits_reserved is_short (Secret.reveal pb) })\n= if is_short\n then Secret.get_bitfield #Secret.U8 pb 3ul 5ul\n else Secret.get_bitfield #Secret.U8 pb 2ul 4ul", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 229, "start_col": 2, "end_line": 231, "end_col": 48 }, "file_context": "module QUIC.Impl.Header.Parse\n\nopen QUIC.Spec.Header.Parse\nopen QUIC.Impl.Header.Base\n\nfriend QUIC.Spec.Header.Parse\n\nmodule LP = LowParse.Low.Base\nmodule Public = QUIC.Impl.Header.Public\nmodule U8 = FStar.UInt8\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule Spec = QUIC.Spec.Header.Parse\nmodule PN = QUIC.Impl.PacketNumber\n\n[@\"opaque_to_smt\"]\nlet impl_short_protected_bits\n (reserved_bits: secret_bitfield 2)\n (key_phase: secret_bitfield 1)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_short_protected_bits (Secret.reveal reserved_bits) (Secret.v key_phase = 1) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\nSecret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 3ul key_phase) 3ul 5ul reserved_bits\n\n[@\"opaque_to_smt\"]\nlet impl_long_protected_bits\n (reserved_bits: secret_bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_long_protected_bits (Secret.reveal reserved_bits) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\n Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 4ul reserved_bits\n\nlet p_header\n (h: header)\n: Tot Public.header\n= match h with\n | BShort rb spin phase cid cid_len pnl ->\n Public.PShort (impl_short_protected_bits rb phase pnl) spin cid cid_len\n | BLong version dcid dcil scid scil spec ->\n begin match spec with\n | BInitial rb payload_and_pn_length pnl token token_length ->\n let spec' = (Public.PInitial payload_and_pn_length token token_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BZeroRTT rb payload_and_pn_length pnl ->\n let spec' = (Public.PZeroRTT payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BHandshake rb payload_and_pn_length pnl ->\n let spec' = (Public.PHandshake payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BRetry unused odcid odcil ->\n let spec' = (Public.PRetry odcid odcil) in\n Public.PLong unused version dcid dcil scid scil spec'\n end\n\nlet public_header_len_correct\n (h: header)\n: Lemma\n (public_header_len h == Public.header_len (p_header h))\n= ()\n\n#push-options \"--z3rlimit 1024 --query_stats\"\n\nlet public_g_header_p_header\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph\n )\n= ()\n\nlet public_header_len_correct'\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph /\\\n U32.v (public_header_len h) == Seq.length (LP.serialize (Public.serialize_header cid_len) ph) \n )\n= public_header_len_correct h;\n public_g_header_p_header h m pn;\n Public.header_len_correct (dcid_len h) m (p_header h)\n\n#restart-solver\n\nlet public_header_len_is_pn_offset\n h m pn\n= public_header_len_correct' h m pn\n\n#pop-options\n\n#push-options \"--z3rlimit 16 --query_stats --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\nlet header_len_correct\n h m pn\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n public_g_header_p_header h m pn;\n assert (Public.g_header (p_header h) m == ph);\n serialize_header_eq cid_len last gh;\n Public.header_len_correct cid_len m (p_header h);\n public_header_len_correct h;\n public_header_len_correct' h m pn;\n assert (Seq.length (LP.serialize (Public.serialize_header cid_len) ph) == U32.v (public_header_len h));\n if is_retry h\n then begin\n header_len_is_retry h;\n assert (Secret.v (header_len h) == Spec.header_len (g_header h m pn))\n end else begin\n header_len_not_is_retry h;\n assert (pn_offset gh + Secret.v (Spec.pn_length gh) == Spec.header_len gh);\n assert (pn_offset gh == Seq.length (LP.serialize (Public.serialize_header cid_len) ph));\n assert (Secret.v (header_len h) == Spec.header_len (g_header h m pn))\n end\n\n#pop-options\n\nlet last_pn\n (is_retry: bool)\n (pn: PN.packet_number_t)\n: Tot PN.last_packet_number_t\n= if is_retry\n then Secret.to_u64 0uL\n else\n let cond = Secret.lognot_one_bit (pn `Secret.secrets_are_equal_62` Secret.to_u64 0uL) in\n pn `Secret.sub` cond\n\n#push-options \"--z3rlimit 64 --query_stats\"\n\nlet last_pn_correct\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma\n (last_packet_number (g_header h m pn) == last_pn (is_retry h) pn)\n= ()\n\n#pop-options\n\n#push-options \"--z3rlimit 128 --query_stats\"\n\n#restart-solver\n\nlet write_header\n h pn out out_len\n= let m = HST.get () in\n header_len_correct h m pn;\n public_header_len_correct' h m pn;\n let cid_len = dcid_len h in\n let last = last_pn (is_retry h) pn in\n last_pn_correct h m pn;\n let ph = p_header h in\n in_window_last_packet_number (g_header h m pn);\n serialize_header_eq cid_len last (g_header h m pn);\n let len = Public.write_header cid_len ph out out_len in\n if is_retry h\n then ()\n else begin\n assert (len == Public.header_len ph);\n let pn_len = pn_length h in\n let m1 = HST.get () in\n SecretBuffer.with_buffer_hide\n #unit\n out\n len\n (len `U32.add` 4ul)\n m1\n B.loc_none\n B.loc_none\n 1ul 0ul 0ul 4ul 1ul 0ul\n (fun _ contl cont _ _ ->\n contl == LP.serialize (Public.serialize_header cid_len) (Public.g_header ph m) /\\\n Seq.slice cont 0 (Secret.v pn_len) `Seq.equal` LP.serialize (PN.serialize_packet_number last pn_len) pn\n )\n (fun _ _ bs _ ->\n PN.write_packet_number last pn_len pn bs\n )\n end\n \n#pop-options\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet putative_pn_offset\n cid_len b b_len\n=\n let h = HST.get () in\n let input = LP.make_slice b b_len in\n assert (LP.bytes_of_slice_from h input 0ul `Seq.equal` B.as_seq h b);\n LP.valid_facts (Public.parse_header cid_len) h input 0ul;\n let res = Public.validate_header cid_len input 0uL in\n if LP.is_error res\n then None\n else Some (LP.uint64_to_uint32 res)\n\n#pop-options\n\nlet impl_protected_bits_pn_length\n (is_short: bool)\n (pb: secret_bitfield (if is_short then 5 else 4))\n: Tot (y: PN.packet_number_length_t { y == protected_bits_pn_length is_short (Secret.reveal pb) })\n= // https://github.com/FStarLang/karamel/issues/102\n let bf = Secret.get_bitfield #Secret.U8 pb 0ul 2ul in\n Secret.to_u32 #Secret.U8 (Secret.to_u8 1uy `Secret.add` bf)\n\nlet impl_protected_bits_reserved\n (is_short: bool)\n (pb: secret_bitfield (if is_short then 5 else 4))", "dependencies": { "source_file": "QUIC.Impl.Header.Parse.fst", "checked_file": "QUIC.Impl.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.PacketNumber.fsti.checked", "QUIC.Impl.Header.Public.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Impl.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Impl.Header.Public" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n is_short: Prims.bool ->\n pb:\n QUIC.Spec.Base.secret_bitfield (match is_short with\n | true -> 5\n | _ -> 4)\n -> y:\n QUIC.Spec.Base.secret_bitfield 2\n { QUIC.Secret.Int.reveal y ==\n QUIC.Spec.Header.Parse.protected_bits_reserved is_short (QUIC.Secret.Int.reveal pb) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.bool", "QUIC.Spec.Base.secret_bitfield", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "QUIC.Secret.Int.get_bitfield", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "FStar.UInt32.__uint_to_t", "Prims.eq2", "FStar.UInt8.t", "Prims.l_or", "Lib.IntTypes.range_t", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.PUB", "Prims.op_LessThan", "FStar.UInt8.v", "Prims.pow2", "QUIC.Secret.Int.reveal", "QUIC.Spec.Header.Parse.protected_bits_reserved" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val impl_protected_bits_reserved (is_short: bool) (pb: secret_bitfield (if is_short then 5 else 4))\n : Tot\n (y: secret_bitfield 2 {Secret.reveal y == protected_bits_reserved is_short (Secret.reveal pb)})\nlet impl_protected_bits_reserved (is_short: bool) (pb: secret_bitfield (if is_short then 5 else 4))\n : Tot\n (y: secret_bitfield 2 {Secret.reveal y == protected_bits_reserved is_short (Secret.reveal pb)}) =", "completed_definiton": "if is_short\nthen Secret.get_bitfield #Secret.U8 pb 3ul 5ul\nelse Secret.get_bitfield #Secret.U8 pb 2ul 4ul", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Parse.fst", "name": "QUIC.Impl.Header.Parse.impl_protected_bits_key_phase", "original_source_type": "val impl_protected_bits_key_phase (x: secret_bitfield 5)\n : Tot (y: secret_bitfield 1 {protected_bits_key_phase (Secret.reveal x) == (Secret.v y = 1)})", "source_type": "val impl_protected_bits_key_phase (x: secret_bitfield 5)\n : Tot (y: secret_bitfield 1 {protected_bits_key_phase (Secret.reveal x) == (Secret.v y = 1)})", "source_definition": "let impl_protected_bits_key_phase\n (x: secret_bitfield 5)\n: Tot (y: secret_bitfield 1 { protected_bits_key_phase (Secret.reveal x) == (Secret.v y = 1) })\n= Secret.get_bitfield #Secret.U8 x 2ul 3ul", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 236, "start_col": 2, "end_line": 236, "end_col": 42 }, "file_context": "module QUIC.Impl.Header.Parse\n\nopen QUIC.Spec.Header.Parse\nopen QUIC.Impl.Header.Base\n\nfriend QUIC.Spec.Header.Parse\n\nmodule LP = LowParse.Low.Base\nmodule Public = QUIC.Impl.Header.Public\nmodule U8 = FStar.UInt8\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule Spec = QUIC.Spec.Header.Parse\nmodule PN = QUIC.Impl.PacketNumber\n\n[@\"opaque_to_smt\"]\nlet impl_short_protected_bits\n (reserved_bits: secret_bitfield 2)\n (key_phase: secret_bitfield 1)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_short_protected_bits (Secret.reveal reserved_bits) (Secret.v key_phase = 1) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\nSecret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 3ul key_phase) 3ul 5ul reserved_bits\n\n[@\"opaque_to_smt\"]\nlet impl_long_protected_bits\n (reserved_bits: secret_bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_long_protected_bits (Secret.reveal reserved_bits) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\n Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 4ul reserved_bits\n\nlet p_header\n (h: header)\n: Tot Public.header\n= match h with\n | BShort rb spin phase cid cid_len pnl ->\n Public.PShort (impl_short_protected_bits rb phase pnl) spin cid cid_len\n | BLong version dcid dcil scid scil spec ->\n begin match spec with\n | BInitial rb payload_and_pn_length pnl token token_length ->\n let spec' = (Public.PInitial payload_and_pn_length token token_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BZeroRTT rb payload_and_pn_length pnl ->\n let spec' = (Public.PZeroRTT payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BHandshake rb payload_and_pn_length pnl ->\n let spec' = (Public.PHandshake payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BRetry unused odcid odcil ->\n let spec' = (Public.PRetry odcid odcil) in\n Public.PLong unused version dcid dcil scid scil spec'\n end\n\nlet public_header_len_correct\n (h: header)\n: Lemma\n (public_header_len h == Public.header_len (p_header h))\n= ()\n\n#push-options \"--z3rlimit 1024 --query_stats\"\n\nlet public_g_header_p_header\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph\n )\n= ()\n\nlet public_header_len_correct'\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph /\\\n U32.v (public_header_len h) == Seq.length (LP.serialize (Public.serialize_header cid_len) ph) \n )\n= public_header_len_correct h;\n public_g_header_p_header h m pn;\n Public.header_len_correct (dcid_len h) m (p_header h)\n\n#restart-solver\n\nlet public_header_len_is_pn_offset\n h m pn\n= public_header_len_correct' h m pn\n\n#pop-options\n\n#push-options \"--z3rlimit 16 --query_stats --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\nlet header_len_correct\n h m pn\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n public_g_header_p_header h m pn;\n assert (Public.g_header (p_header h) m == ph);\n serialize_header_eq cid_len last gh;\n Public.header_len_correct cid_len m (p_header h);\n public_header_len_correct h;\n public_header_len_correct' h m pn;\n assert (Seq.length (LP.serialize (Public.serialize_header cid_len) ph) == U32.v (public_header_len h));\n if is_retry h\n then begin\n header_len_is_retry h;\n assert (Secret.v (header_len h) == Spec.header_len (g_header h m pn))\n end else begin\n header_len_not_is_retry h;\n assert (pn_offset gh + Secret.v (Spec.pn_length gh) == Spec.header_len gh);\n assert (pn_offset gh == Seq.length (LP.serialize (Public.serialize_header cid_len) ph));\n assert (Secret.v (header_len h) == Spec.header_len (g_header h m pn))\n end\n\n#pop-options\n\nlet last_pn\n (is_retry: bool)\n (pn: PN.packet_number_t)\n: Tot PN.last_packet_number_t\n= if is_retry\n then Secret.to_u64 0uL\n else\n let cond = Secret.lognot_one_bit (pn `Secret.secrets_are_equal_62` Secret.to_u64 0uL) in\n pn `Secret.sub` cond\n\n#push-options \"--z3rlimit 64 --query_stats\"\n\nlet last_pn_correct\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma\n (last_packet_number (g_header h m pn) == last_pn (is_retry h) pn)\n= ()\n\n#pop-options\n\n#push-options \"--z3rlimit 128 --query_stats\"\n\n#restart-solver\n\nlet write_header\n h pn out out_len\n= let m = HST.get () in\n header_len_correct h m pn;\n public_header_len_correct' h m pn;\n let cid_len = dcid_len h in\n let last = last_pn (is_retry h) pn in\n last_pn_correct h m pn;\n let ph = p_header h in\n in_window_last_packet_number (g_header h m pn);\n serialize_header_eq cid_len last (g_header h m pn);\n let len = Public.write_header cid_len ph out out_len in\n if is_retry h\n then ()\n else begin\n assert (len == Public.header_len ph);\n let pn_len = pn_length h in\n let m1 = HST.get () in\n SecretBuffer.with_buffer_hide\n #unit\n out\n len\n (len `U32.add` 4ul)\n m1\n B.loc_none\n B.loc_none\n 1ul 0ul 0ul 4ul 1ul 0ul\n (fun _ contl cont _ _ ->\n contl == LP.serialize (Public.serialize_header cid_len) (Public.g_header ph m) /\\\n Seq.slice cont 0 (Secret.v pn_len) `Seq.equal` LP.serialize (PN.serialize_packet_number last pn_len) pn\n )\n (fun _ _ bs _ ->\n PN.write_packet_number last pn_len pn bs\n )\n end\n \n#pop-options\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet putative_pn_offset\n cid_len b b_len\n=\n let h = HST.get () in\n let input = LP.make_slice b b_len in\n assert (LP.bytes_of_slice_from h input 0ul `Seq.equal` B.as_seq h b);\n LP.valid_facts (Public.parse_header cid_len) h input 0ul;\n let res = Public.validate_header cid_len input 0uL in\n if LP.is_error res\n then None\n else Some (LP.uint64_to_uint32 res)\n\n#pop-options\n\nlet impl_protected_bits_pn_length\n (is_short: bool)\n (pb: secret_bitfield (if is_short then 5 else 4))\n: Tot (y: PN.packet_number_length_t { y == protected_bits_pn_length is_short (Secret.reveal pb) })\n= // https://github.com/FStarLang/karamel/issues/102\n let bf = Secret.get_bitfield #Secret.U8 pb 0ul 2ul in\n Secret.to_u32 #Secret.U8 (Secret.to_u8 1uy `Secret.add` bf)\n\nlet impl_protected_bits_reserved\n (is_short: bool)\n (pb: secret_bitfield (if is_short then 5 else 4))\n: Tot (y: secret_bitfield 2 { Secret.reveal y == protected_bits_reserved is_short (Secret.reveal pb) })\n= if is_short\n then Secret.get_bitfield #Secret.U8 pb 3ul 5ul\n else Secret.get_bitfield #Secret.U8 pb 2ul 4ul\n\nlet impl_protected_bits_key_phase\n (x: secret_bitfield 5)", "dependencies": { "source_file": "QUIC.Impl.Header.Parse.fst", "checked_file": "QUIC.Impl.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.PacketNumber.fsti.checked", "QUIC.Impl.Header.Public.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Impl.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Impl.Header.Public" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: QUIC.Spec.Base.secret_bitfield 5\n -> y:\n QUIC.Spec.Base.secret_bitfield 1\n { QUIC.Spec.Header.Parse.protected_bits_key_phase (QUIC.Secret.Int.reveal x) ==\n (QUIC.Secret.Int.Base.v y = 1) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.secret_bitfield", "QUIC.Secret.Int.get_bitfield", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "FStar.UInt32.__uint_to_t", "Prims.eq2", "Prims.bool", "QUIC.Spec.Header.Parse.protected_bits_key_phase", "QUIC.Secret.Int.reveal", "Prims.op_Equality", "Prims.int", "QUIC.Secret.Int.Base.v" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val impl_protected_bits_key_phase (x: secret_bitfield 5)\n : Tot (y: secret_bitfield 1 {protected_bits_key_phase (Secret.reveal x) == (Secret.v y = 1)})\nlet impl_protected_bits_key_phase (x: secret_bitfield 5)\n : Tot (y: secret_bitfield 1 {protected_bits_key_phase (Secret.reveal x) == (Secret.v y = 1)}) =", "completed_definiton": "Secret.get_bitfield #Secret.U8 x 2ul 3ul", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Parse.fst", "name": "QUIC.Impl.Header.Parse.p_header", "original_source_type": "val p_header (h: header) : Tot Public.header", "source_type": "val p_header (h: header) : Tot Public.header", "source_definition": "let p_header\n (h: header)\n: Tot Public.header\n= match h with\n | BShort rb spin phase cid cid_len pnl ->\n Public.PShort (impl_short_protected_bits rb phase pnl) spin cid cid_len\n | BLong version dcid dcil scid scil spec ->\n begin match spec with\n | BInitial rb payload_and_pn_length pnl token token_length ->\n let spec' = (Public.PInitial payload_and_pn_length token token_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BZeroRTT rb payload_and_pn_length pnl ->\n let spec' = (Public.PZeroRTT payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BHandshake rb payload_and_pn_length pnl ->\n let spec' = (Public.PHandshake payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BRetry unused odcid odcil ->\n let spec' = (Public.PRetry odcid odcil) in\n Public.PLong unused version dcid dcil scid scil spec'\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 37, "start_col": 2, "end_line": 54, "end_col": 7 }, "file_context": "module QUIC.Impl.Header.Parse\n\nopen QUIC.Spec.Header.Parse\nopen QUIC.Impl.Header.Base\n\nfriend QUIC.Spec.Header.Parse\n\nmodule LP = LowParse.Low.Base\nmodule Public = QUIC.Impl.Header.Public\nmodule U8 = FStar.UInt8\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule Spec = QUIC.Spec.Header.Parse\nmodule PN = QUIC.Impl.PacketNumber\n\n[@\"opaque_to_smt\"]\nlet impl_short_protected_bits\n (reserved_bits: secret_bitfield 2)\n (key_phase: secret_bitfield 1)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_short_protected_bits (Secret.reveal reserved_bits) (Secret.v key_phase = 1) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\nSecret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 3ul key_phase) 3ul 5ul reserved_bits\n\n[@\"opaque_to_smt\"]\nlet impl_long_protected_bits\n (reserved_bits: secret_bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_long_protected_bits (Secret.reveal reserved_bits) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\n Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 4ul reserved_bits\n\nlet p_header\n (h: header)", "dependencies": { "source_file": "QUIC.Impl.Header.Parse.fst", "checked_file": "QUIC.Impl.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.PacketNumber.fsti.checked", "QUIC.Impl.Header.Public.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Impl.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Impl.Header.Public" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Impl.Header.Base.header -> QUIC.Impl.Header.Public.header", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Base.header", "QUIC.Spec.Base.secret_bitfield", "Prims.bool", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.op_LessThanOrEqual", "FStar.UInt.uint_t", "FStar.UInt32.v", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Impl.Header.Public.PShort", "QUIC.Impl.Header.Parse.impl_short_protected_bits", "QUIC.Impl.Header.Base.long_header_specifics", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Base.token_max_len", "QUIC.Impl.Header.Public.PLong", "QUIC.Impl.Header.Parse.impl_long_protected_bits", "QUIC.Impl.Header.Public.long_header_specifics", "QUIC.Impl.Header.Public.PInitial", "QUIC.Impl.Header.Public.PZeroRTT", "QUIC.Impl.Header.Public.PHandshake", "Prims.op_Equality", "QUIC.Impl.Header.Public.PRetry", "QUIC.Impl.Header.Public.header" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val p_header (h: header) : Tot Public.header\nlet p_header (h: header) : Tot Public.header =", "completed_definiton": "match h with\n| BShort rb spin phase cid cid_len pnl ->\n Public.PShort (impl_short_protected_bits rb phase pnl) spin cid cid_len\n| BLong version dcid dcil scid scil spec ->\n match spec with\n | BInitial rb payload_and_pn_length pnl token token_length ->\n let spec' = (Public.PInitial payload_and_pn_length token token_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BZeroRTT rb payload_and_pn_length pnl ->\n let spec' = (Public.PZeroRTT payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BHandshake rb payload_and_pn_length pnl ->\n let spec' = (Public.PHandshake payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BRetry unused odcid odcil ->\n let spec' = (Public.PRetry odcid odcil) in\n Public.PLong unused version dcid dcil scid scil spec'", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Parse.fst", "name": "QUIC.Impl.Header.Parse.impl_long_protected_bits", "original_source_type": "val impl_long_protected_bits (reserved_bits: secret_bitfield 2) (pnl: PN.packet_number_length_t)\n : Tot\n (x: Secret.uint8{Secret.reveal x == mk_long_protected_bits (Secret.reveal reserved_bits) pnl})", "source_type": "val impl_long_protected_bits (reserved_bits: secret_bitfield 2) (pnl: PN.packet_number_length_t)\n : Tot\n (x: Secret.uint8{Secret.reveal x == mk_long_protected_bits (Secret.reveal reserved_bits) pnl})", "source_definition": "let impl_long_protected_bits\n (reserved_bits: secret_bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_long_protected_bits (Secret.reveal reserved_bits) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\n Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 4ul reserved_bits", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 30, "start_col": 1, "end_line": 32, "end_col": 122 }, "file_context": "module QUIC.Impl.Header.Parse\n\nopen QUIC.Spec.Header.Parse\nopen QUIC.Impl.Header.Base\n\nfriend QUIC.Spec.Header.Parse\n\nmodule LP = LowParse.Low.Base\nmodule Public = QUIC.Impl.Header.Public\nmodule U8 = FStar.UInt8\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule Spec = QUIC.Spec.Header.Parse\nmodule PN = QUIC.Impl.PacketNumber\n\n[@\"opaque_to_smt\"]\nlet impl_short_protected_bits\n (reserved_bits: secret_bitfield 2)\n (key_phase: secret_bitfield 1)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_short_protected_bits (Secret.reveal reserved_bits) (Secret.v key_phase = 1) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\nSecret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 3ul key_phase) 3ul 5ul reserved_bits\n\n[@\"opaque_to_smt\"]\nlet impl_long_protected_bits\n (reserved_bits: secret_bitfield 2)\n (pnl: PN.packet_number_length_t)", "dependencies": { "source_file": "QUIC.Impl.Header.Parse.fst", "checked_file": "QUIC.Impl.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.PacketNumber.fsti.checked", "QUIC.Impl.Header.Public.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Impl.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Impl.Header.Public" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n reserved_bits: QUIC.Spec.Base.secret_bitfield 2 ->\n pnl: QUIC.Spec.PacketNumber.Base.packet_number_length_t\n -> x:\n Lib.IntTypes.uint8\n { QUIC.Secret.Int.reveal x ==\n QUIC.Spec.Header.Parse.mk_long_protected_bits (QUIC.Secret.Int.reveal reserved_bits) pnl }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.secret_bitfield", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Secret.Int.set_bitfield", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "Lib.IntTypes.to_u8", "Lib.IntTypes.U1", "Lib.IntTypes.PUB", "FStar.UInt8.__uint_to_t", "FStar.UInt32.__uint_to_t", "Lib.IntTypes.int_t", "Lib.IntTypes.sub", "Lib.IntTypes.U32", "Lib.IntTypes.uint8", "Prims.eq2", "FStar.UInt8.t", "Prims.l_or", "Lib.IntTypes.range_t", "QUIC.Secret.Int.Base.v", "Prims.b2t", "Prims.op_LessThan", "FStar.UInt8.v", "Prims.pow2", "QUIC.Secret.Int.reveal", "QUIC.Spec.Header.Parse.mk_long_protected_bits" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val impl_long_protected_bits (reserved_bits: secret_bitfield 2) (pnl: PN.packet_number_length_t)\n : Tot\n (x: Secret.uint8{Secret.reveal x == mk_long_protected_bits (Secret.reveal reserved_bits) pnl})\nlet impl_long_protected_bits (reserved_bits: secret_bitfield 2) (pnl: PN.packet_number_length_t)\n : Tot\n (x: Secret.uint8{Secret.reveal x == mk_long_protected_bits (Secret.reveal reserved_bits) pnl}) =", "completed_definiton": "let pnl_1 = (Secret.to_u8 pnl) `Secret.sub` (Secret.to_u8 1uy) in\nSecret.set_bitfield #Secret.U8\n (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1))\n 2ul\n 4ul\n reserved_bits", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Parse.fst", "name": "QUIC.Impl.Header.Parse.impl_protected_bits_pn_length", "original_source_type": "val impl_protected_bits_pn_length (is_short: bool) (pb: secret_bitfield (if is_short then 5 else 4))\n : Tot (y: PN.packet_number_length_t{y == protected_bits_pn_length is_short (Secret.reveal pb)})", "source_type": "val impl_protected_bits_pn_length (is_short: bool) (pb: secret_bitfield (if is_short then 5 else 4))\n : Tot (y: PN.packet_number_length_t{y == protected_bits_pn_length is_short (Secret.reveal pb)})", "source_definition": "let impl_protected_bits_pn_length\n (is_short: bool)\n (pb: secret_bitfield (if is_short then 5 else 4))\n: Tot (y: PN.packet_number_length_t { y == protected_bits_pn_length is_short (Secret.reveal pb) })\n= // https://github.com/FStarLang/karamel/issues/102\n let bf = Secret.get_bitfield #Secret.U8 pb 0ul 2ul in\n Secret.to_u32 #Secret.U8 (Secret.to_u8 1uy `Secret.add` bf)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 221, "start_col": 1, "end_line": 223, "end_col": 61 }, "file_context": "module QUIC.Impl.Header.Parse\n\nopen QUIC.Spec.Header.Parse\nopen QUIC.Impl.Header.Base\n\nfriend QUIC.Spec.Header.Parse\n\nmodule LP = LowParse.Low.Base\nmodule Public = QUIC.Impl.Header.Public\nmodule U8 = FStar.UInt8\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule Spec = QUIC.Spec.Header.Parse\nmodule PN = QUIC.Impl.PacketNumber\n\n[@\"opaque_to_smt\"]\nlet impl_short_protected_bits\n (reserved_bits: secret_bitfield 2)\n (key_phase: secret_bitfield 1)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_short_protected_bits (Secret.reveal reserved_bits) (Secret.v key_phase = 1) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\nSecret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 3ul key_phase) 3ul 5ul reserved_bits\n\n[@\"opaque_to_smt\"]\nlet impl_long_protected_bits\n (reserved_bits: secret_bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_long_protected_bits (Secret.reveal reserved_bits) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\n Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 4ul reserved_bits\n\nlet p_header\n (h: header)\n: Tot Public.header\n= match h with\n | BShort rb spin phase cid cid_len pnl ->\n Public.PShort (impl_short_protected_bits rb phase pnl) spin cid cid_len\n | BLong version dcid dcil scid scil spec ->\n begin match spec with\n | BInitial rb payload_and_pn_length pnl token token_length ->\n let spec' = (Public.PInitial payload_and_pn_length token token_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BZeroRTT rb payload_and_pn_length pnl ->\n let spec' = (Public.PZeroRTT payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BHandshake rb payload_and_pn_length pnl ->\n let spec' = (Public.PHandshake payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BRetry unused odcid odcil ->\n let spec' = (Public.PRetry odcid odcil) in\n Public.PLong unused version dcid dcil scid scil spec'\n end\n\nlet public_header_len_correct\n (h: header)\n: Lemma\n (public_header_len h == Public.header_len (p_header h))\n= ()\n\n#push-options \"--z3rlimit 1024 --query_stats\"\n\nlet public_g_header_p_header\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph\n )\n= ()\n\nlet public_header_len_correct'\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph /\\\n U32.v (public_header_len h) == Seq.length (LP.serialize (Public.serialize_header cid_len) ph) \n )\n= public_header_len_correct h;\n public_g_header_p_header h m pn;\n Public.header_len_correct (dcid_len h) m (p_header h)\n\n#restart-solver\n\nlet public_header_len_is_pn_offset\n h m pn\n= public_header_len_correct' h m pn\n\n#pop-options\n\n#push-options \"--z3rlimit 16 --query_stats --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\nlet header_len_correct\n h m pn\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n public_g_header_p_header h m pn;\n assert (Public.g_header (p_header h) m == ph);\n serialize_header_eq cid_len last gh;\n Public.header_len_correct cid_len m (p_header h);\n public_header_len_correct h;\n public_header_len_correct' h m pn;\n assert (Seq.length (LP.serialize (Public.serialize_header cid_len) ph) == U32.v (public_header_len h));\n if is_retry h\n then begin\n header_len_is_retry h;\n assert (Secret.v (header_len h) == Spec.header_len (g_header h m pn))\n end else begin\n header_len_not_is_retry h;\n assert (pn_offset gh + Secret.v (Spec.pn_length gh) == Spec.header_len gh);\n assert (pn_offset gh == Seq.length (LP.serialize (Public.serialize_header cid_len) ph));\n assert (Secret.v (header_len h) == Spec.header_len (g_header h m pn))\n end\n\n#pop-options\n\nlet last_pn\n (is_retry: bool)\n (pn: PN.packet_number_t)\n: Tot PN.last_packet_number_t\n= if is_retry\n then Secret.to_u64 0uL\n else\n let cond = Secret.lognot_one_bit (pn `Secret.secrets_are_equal_62` Secret.to_u64 0uL) in\n pn `Secret.sub` cond\n\n#push-options \"--z3rlimit 64 --query_stats\"\n\nlet last_pn_correct\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma\n (last_packet_number (g_header h m pn) == last_pn (is_retry h) pn)\n= ()\n\n#pop-options\n\n#push-options \"--z3rlimit 128 --query_stats\"\n\n#restart-solver\n\nlet write_header\n h pn out out_len\n= let m = HST.get () in\n header_len_correct h m pn;\n public_header_len_correct' h m pn;\n let cid_len = dcid_len h in\n let last = last_pn (is_retry h) pn in\n last_pn_correct h m pn;\n let ph = p_header h in\n in_window_last_packet_number (g_header h m pn);\n serialize_header_eq cid_len last (g_header h m pn);\n let len = Public.write_header cid_len ph out out_len in\n if is_retry h\n then ()\n else begin\n assert (len == Public.header_len ph);\n let pn_len = pn_length h in\n let m1 = HST.get () in\n SecretBuffer.with_buffer_hide\n #unit\n out\n len\n (len `U32.add` 4ul)\n m1\n B.loc_none\n B.loc_none\n 1ul 0ul 0ul 4ul 1ul 0ul\n (fun _ contl cont _ _ ->\n contl == LP.serialize (Public.serialize_header cid_len) (Public.g_header ph m) /\\\n Seq.slice cont 0 (Secret.v pn_len) `Seq.equal` LP.serialize (PN.serialize_packet_number last pn_len) pn\n )\n (fun _ _ bs _ ->\n PN.write_packet_number last pn_len pn bs\n )\n end\n \n#pop-options\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet putative_pn_offset\n cid_len b b_len\n=\n let h = HST.get () in\n let input = LP.make_slice b b_len in\n assert (LP.bytes_of_slice_from h input 0ul `Seq.equal` B.as_seq h b);\n LP.valid_facts (Public.parse_header cid_len) h input 0ul;\n let res = Public.validate_header cid_len input 0uL in\n if LP.is_error res\n then None\n else Some (LP.uint64_to_uint32 res)\n\n#pop-options\n\nlet impl_protected_bits_pn_length\n (is_short: bool)\n (pb: secret_bitfield (if is_short then 5 else 4))", "dependencies": { "source_file": "QUIC.Impl.Header.Parse.fst", "checked_file": "QUIC.Impl.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.PacketNumber.fsti.checked", "QUIC.Impl.Header.Public.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Impl.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Impl.Header.Public" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n is_short: Prims.bool ->\n pb:\n QUIC.Spec.Base.secret_bitfield (match is_short with\n | true -> 5\n | _ -> 4)\n -> y:\n QUIC.Spec.PacketNumber.Base.packet_number_length_t\n {y == QUIC.Spec.Header.Parse.protected_bits_pn_length is_short (QUIC.Secret.Int.reveal pb)}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.bool", "QUIC.Spec.Base.secret_bitfield", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "Lib.IntTypes.to_u32", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "Lib.IntTypes.add", "Lib.IntTypes.to_u8", "Lib.IntTypes.U1", "Lib.IntTypes.PUB", "FStar.UInt8.__uint_to_t", "Lib.IntTypes.int_t", "Prims.eq2", "Prims.int", "Prims.l_or", "Lib.IntTypes.range", "Prims.l_and", "FStar.UInt.size", "Prims.op_LessThan", "Prims.pow2", "Prims.op_Subtraction", "FStar.UInt32.v", "FStar.UInt32.uint_to_t", "FStar.UInt32.t", "Lib.IntTypes.v", "LowParse.BitFields.get_bitfield", "QUIC.Secret.Int.get_bitfield", "FStar.UInt32.__uint_to_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.Header.Parse.protected_bits_pn_length", "QUIC.Secret.Int.reveal" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val impl_protected_bits_pn_length (is_short: bool) (pb: secret_bitfield (if is_short then 5 else 4))\n : Tot (y: PN.packet_number_length_t{y == protected_bits_pn_length is_short (Secret.reveal pb)})\nlet impl_protected_bits_pn_length (is_short: bool) (pb: secret_bitfield (if is_short then 5 else 4))\n : Tot (y: PN.packet_number_length_t{y == protected_bits_pn_length is_short (Secret.reveal pb)}) =", "completed_definiton": "let bf = Secret.get_bitfield #Secret.U8 pb 0ul 2ul in\nSecret.to_u32 #Secret.U8 ((Secret.to_u8 1uy) `Secret.add` bf)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Parse.fst", "name": "QUIC.Impl.Header.Parse.putative_pn_offset", "original_source_type": "val putative_pn_offset\n (cid_len: short_dcid_len_t)\n (b: B.buffer U8.t)\n (b_len: U32.t { U32.v b_len == B.length b })\n: HST.Stack (option U32.t)\n (requires (fun h ->\n B.live h b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match Spec.putative_pn_offset (U32.v cid_len) (B.as_seq h b), res with\n | None, None -> True\n | Some off, Some off' -> U32.v off' == off\n | _ -> False\n end\n ))", "source_type": "val putative_pn_offset\n (cid_len: short_dcid_len_t)\n (b: B.buffer U8.t)\n (b_len: U32.t { U32.v b_len == B.length b })\n: HST.Stack (option U32.t)\n (requires (fun h ->\n B.live h b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match Spec.putative_pn_offset (U32.v cid_len) (B.as_seq h b), res with\n | None, None -> True\n | Some off, Some off' -> U32.v off' == off\n | _ -> False\n end\n ))", "source_definition": "let putative_pn_offset\n cid_len b b_len\n=\n let h = HST.get () in\n let input = LP.make_slice b b_len in\n assert (LP.bytes_of_slice_from h input 0ul `Seq.equal` B.as_seq h b);\n LP.valid_facts (Public.parse_header cid_len) h input 0ul;\n let res = Public.validate_header cid_len input 0uL in\n if LP.is_error res\n then None\n else Some (LP.uint64_to_uint32 res)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 205, "start_col": 1, "end_line": 213, "end_col": 37 }, "file_context": "module QUIC.Impl.Header.Parse\n\nopen QUIC.Spec.Header.Parse\nopen QUIC.Impl.Header.Base\n\nfriend QUIC.Spec.Header.Parse\n\nmodule LP = LowParse.Low.Base\nmodule Public = QUIC.Impl.Header.Public\nmodule U8 = FStar.UInt8\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule Spec = QUIC.Spec.Header.Parse\nmodule PN = QUIC.Impl.PacketNumber\n\n[@\"opaque_to_smt\"]\nlet impl_short_protected_bits\n (reserved_bits: secret_bitfield 2)\n (key_phase: secret_bitfield 1)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_short_protected_bits (Secret.reveal reserved_bits) (Secret.v key_phase = 1) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\nSecret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 3ul key_phase) 3ul 5ul reserved_bits\n\n[@\"opaque_to_smt\"]\nlet impl_long_protected_bits\n (reserved_bits: secret_bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_long_protected_bits (Secret.reveal reserved_bits) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\n Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 4ul reserved_bits\n\nlet p_header\n (h: header)\n: Tot Public.header\n= match h with\n | BShort rb spin phase cid cid_len pnl ->\n Public.PShort (impl_short_protected_bits rb phase pnl) spin cid cid_len\n | BLong version dcid dcil scid scil spec ->\n begin match spec with\n | BInitial rb payload_and_pn_length pnl token token_length ->\n let spec' = (Public.PInitial payload_and_pn_length token token_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BZeroRTT rb payload_and_pn_length pnl ->\n let spec' = (Public.PZeroRTT payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BHandshake rb payload_and_pn_length pnl ->\n let spec' = (Public.PHandshake payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BRetry unused odcid odcil ->\n let spec' = (Public.PRetry odcid odcil) in\n Public.PLong unused version dcid dcil scid scil spec'\n end\n\nlet public_header_len_correct\n (h: header)\n: Lemma\n (public_header_len h == Public.header_len (p_header h))\n= ()\n\n#push-options \"--z3rlimit 1024 --query_stats\"\n\nlet public_g_header_p_header\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph\n )\n= ()\n\nlet public_header_len_correct'\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph /\\\n U32.v (public_header_len h) == Seq.length (LP.serialize (Public.serialize_header cid_len) ph) \n )\n= public_header_len_correct h;\n public_g_header_p_header h m pn;\n Public.header_len_correct (dcid_len h) m (p_header h)\n\n#restart-solver\n\nlet public_header_len_is_pn_offset\n h m pn\n= public_header_len_correct' h m pn\n\n#pop-options\n\n#push-options \"--z3rlimit 16 --query_stats --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\nlet header_len_correct\n h m pn\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n public_g_header_p_header h m pn;\n assert (Public.g_header (p_header h) m == ph);\n serialize_header_eq cid_len last gh;\n Public.header_len_correct cid_len m (p_header h);\n public_header_len_correct h;\n public_header_len_correct' h m pn;\n assert (Seq.length (LP.serialize (Public.serialize_header cid_len) ph) == U32.v (public_header_len h));\n if is_retry h\n then begin\n header_len_is_retry h;\n assert (Secret.v (header_len h) == Spec.header_len (g_header h m pn))\n end else begin\n header_len_not_is_retry h;\n assert (pn_offset gh + Secret.v (Spec.pn_length gh) == Spec.header_len gh);\n assert (pn_offset gh == Seq.length (LP.serialize (Public.serialize_header cid_len) ph));\n assert (Secret.v (header_len h) == Spec.header_len (g_header h m pn))\n end\n\n#pop-options\n\nlet last_pn\n (is_retry: bool)\n (pn: PN.packet_number_t)\n: Tot PN.last_packet_number_t\n= if is_retry\n then Secret.to_u64 0uL\n else\n let cond = Secret.lognot_one_bit (pn `Secret.secrets_are_equal_62` Secret.to_u64 0uL) in\n pn `Secret.sub` cond\n\n#push-options \"--z3rlimit 64 --query_stats\"\n\nlet last_pn_correct\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma\n (last_packet_number (g_header h m pn) == last_pn (is_retry h) pn)\n= ()\n\n#pop-options\n\n#push-options \"--z3rlimit 128 --query_stats\"\n\n#restart-solver\n\nlet write_header\n h pn out out_len\n= let m = HST.get () in\n header_len_correct h m pn;\n public_header_len_correct' h m pn;\n let cid_len = dcid_len h in\n let last = last_pn (is_retry h) pn in\n last_pn_correct h m pn;\n let ph = p_header h in\n in_window_last_packet_number (g_header h m pn);\n serialize_header_eq cid_len last (g_header h m pn);\n let len = Public.write_header cid_len ph out out_len in\n if is_retry h\n then ()\n else begin\n assert (len == Public.header_len ph);\n let pn_len = pn_length h in\n let m1 = HST.get () in\n SecretBuffer.with_buffer_hide\n #unit\n out\n len\n (len `U32.add` 4ul)\n m1\n B.loc_none\n B.loc_none\n 1ul 0ul 0ul 4ul 1ul 0ul\n (fun _ contl cont _ _ ->\n contl == LP.serialize (Public.serialize_header cid_len) (Public.g_header ph m) /\\\n Seq.slice cont 0 (Secret.v pn_len) `Seq.equal` LP.serialize (PN.serialize_packet_number last pn_len) pn\n )\n (fun _ _ bs _ ->\n PN.write_packet_number last pn_len pn bs\n )\n end\n \n#pop-options\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet putative_pn_offset", "dependencies": { "source_file": "QUIC.Impl.Header.Parse.fst", "checked_file": "QUIC.Impl.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.PacketNumber.fsti.checked", "QUIC.Impl.Header.Public.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Impl.PacketNumber" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Impl.Header.Public" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n cid_len: QUIC.Spec.Base.short_dcid_len_t ->\n b: LowStar.Buffer.buffer FStar.UInt8.t ->\n b_len: FStar.UInt32.t{FStar.UInt32.v b_len == LowStar.Monotonic.Buffer.length b}\n -> FStar.HyperStack.ST.Stack (FStar.Pervasives.Native.option FStar.UInt32.t)", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "FStar.UInt32.v", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "LowParse.Low.ErrorCode.is_error", "FStar.Pervasives.Native.None", "Prims.bool", "FStar.Pervasives.Native.Some", "LowParse.Low.ErrorCode.uint64_to_uint32", "FStar.Pervasives.Native.option", "FStar.UInt64.t", "QUIC.Impl.Header.Public.validate_header", "LowParse.Slice.srel_of_buffer_srel", "LowParse.Bytes.byte", "FStar.UInt64.__uint_to_t", "Prims.unit", "LowParse.Low.Base.Spec.valid_facts", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.parse_header", "FStar.UInt32.__uint_to_t", "Prims._assert", "FStar.Seq.Base.equal", "LowParse.Slice.bytes_of_slice_from", "LowStar.Monotonic.Buffer.as_seq", "LowParse.Slice.slice", "LowParse.Slice.make_slice", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val putative_pn_offset\n (cid_len: short_dcid_len_t)\n (b: B.buffer U8.t)\n (b_len: U32.t { U32.v b_len == B.length b })\n: HST.Stack (option U32.t)\n (requires (fun h ->\n B.live h b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match Spec.putative_pn_offset (U32.v cid_len) (B.as_seq h b), res with\n | None, None -> True\n | Some off, Some off' -> U32.v off' == off\n | _ -> False\n end\n ))\nlet putative_pn_offset cid_len b b_len =", "completed_definiton": "let h = HST.get () in\nlet input = LP.make_slice b b_len in\nassert ((LP.bytes_of_slice_from h input 0ul) `Seq.equal` (B.as_seq h b));\nLP.valid_facts (Public.parse_header cid_len) h input 0ul;\nlet res = Public.validate_header cid_len input 0uL in\nif LP.is_error res then None else Some (LP.uint64_to_uint32 res)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Parse.fst", "name": "QUIC.Impl.Header.Parse.impl_short_protected_bits", "original_source_type": "val impl_short_protected_bits\n (reserved_bits: secret_bitfield 2)\n (key_phase: secret_bitfield 1)\n (pnl: PN.packet_number_length_t)\n : Tot\n (x:\n Secret.uint8\n { Secret.reveal x ==\n mk_short_protected_bits (Secret.reveal reserved_bits) (Secret.v key_phase = 1) pnl })", "source_type": "val impl_short_protected_bits\n (reserved_bits: secret_bitfield 2)\n (key_phase: secret_bitfield 1)\n (pnl: PN.packet_number_length_t)\n : Tot\n (x:\n Secret.uint8\n { Secret.reveal x ==\n mk_short_protected_bits (Secret.reveal reserved_bits) (Secret.v key_phase = 1) pnl })", "source_definition": "let impl_short_protected_bits\n (reserved_bits: secret_bitfield 2)\n (key_phase: secret_bitfield 1)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_short_protected_bits (Secret.reveal reserved_bits) (Secret.v key_phase = 1) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\nSecret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 3ul key_phase) 3ul 5ul reserved_bits", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 21, "start_col": 1, "end_line": 23, "end_col": 171 }, "file_context": "module QUIC.Impl.Header.Parse\n\nopen QUIC.Spec.Header.Parse\nopen QUIC.Impl.Header.Base\n\nfriend QUIC.Spec.Header.Parse\n\nmodule LP = LowParse.Low.Base\nmodule Public = QUIC.Impl.Header.Public\nmodule U8 = FStar.UInt8\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule Spec = QUIC.Spec.Header.Parse\nmodule PN = QUIC.Impl.PacketNumber\n\n[@\"opaque_to_smt\"]\nlet impl_short_protected_bits\n (reserved_bits: secret_bitfield 2)\n (key_phase: secret_bitfield 1)\n (pnl: PN.packet_number_length_t)", "dependencies": { "source_file": "QUIC.Impl.Header.Parse.fst", "checked_file": "QUIC.Impl.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.PacketNumber.fsti.checked", "QUIC.Impl.Header.Public.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Impl.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Impl.Header.Public" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n reserved_bits: QUIC.Spec.Base.secret_bitfield 2 ->\n key_phase: QUIC.Spec.Base.secret_bitfield 1 ->\n pnl: QUIC.Spec.PacketNumber.Base.packet_number_length_t\n -> x:\n Lib.IntTypes.uint8\n { QUIC.Secret.Int.reveal x ==\n QUIC.Spec.Header.Parse.mk_short_protected_bits (QUIC.Secret.Int.reveal reserved_bits)\n (QUIC.Secret.Int.Base.v key_phase = 1)\n pnl }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.secret_bitfield", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Secret.Int.set_bitfield", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "Lib.IntTypes.to_u8", "Lib.IntTypes.U1", "Lib.IntTypes.PUB", "FStar.UInt8.__uint_to_t", "FStar.UInt32.__uint_to_t", "Lib.IntTypes.int_t", "Lib.IntTypes.sub", "Lib.IntTypes.U32", "Lib.IntTypes.uint8", "Prims.eq2", "FStar.UInt8.t", "Prims.l_or", "Lib.IntTypes.range_t", "QUIC.Secret.Int.Base.v", "Prims.b2t", "Prims.op_LessThan", "FStar.UInt8.v", "Prims.pow2", "QUIC.Secret.Int.reveal", "QUIC.Spec.Header.Parse.mk_short_protected_bits", "Prims.op_Equality", "Prims.int" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val impl_short_protected_bits\n (reserved_bits: secret_bitfield 2)\n (key_phase: secret_bitfield 1)\n (pnl: PN.packet_number_length_t)\n : Tot\n (x:\n Secret.uint8\n { Secret.reveal x ==\n mk_short_protected_bits (Secret.reveal reserved_bits) (Secret.v key_phase = 1) pnl })\nlet impl_short_protected_bits\n (reserved_bits: secret_bitfield 2)\n (key_phase: secret_bitfield 1)\n (pnl: PN.packet_number_length_t)\n : Tot\n (x:\n Secret.uint8\n { Secret.reveal x ==\n mk_short_protected_bits (Secret.reveal reserved_bits) (Secret.v key_phase = 1) pnl }) =", "completed_definiton": "let pnl_1 = (Secret.to_u8 pnl) `Secret.sub` (Secret.to_u8 1uy) in\nSecret.set_bitfield #Secret.U8\n (Secret.set_bitfield #Secret.U8\n (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1))\n 2ul\n 3ul\n key_phase)\n 3ul\n 5ul\n reserved_bits", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Parse.fst", "name": "QUIC.Impl.Header.Parse.header_len_correct", "original_source_type": "val header_len_correct\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma\n (Secret.v (header_len h) == Spec.header_len (g_header h m pn))", "source_type": "val header_len_correct\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma\n (Secret.v (header_len h) == Spec.header_len (g_header h m pn))", "source_definition": "let header_len_correct\n h m pn\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n public_g_header_p_header h m pn;\n assert (Public.g_header (p_header h) m == ph);\n serialize_header_eq cid_len last gh;\n Public.header_len_correct cid_len m (p_header h);\n public_header_len_correct h;\n public_header_len_correct' h m pn;\n assert (Seq.length (LP.serialize (Public.serialize_header cid_len) ph) == U32.v (public_header_len h));\n if is_retry h\n then begin\n header_len_is_retry h;\n assert (Secret.v (header_len h) == Spec.header_len (g_header h m pn))\n end else begin\n header_len_not_is_retry h;\n assert (pn_offset gh + Secret.v (Spec.pn_length gh) == Spec.header_len gh);\n assert (pn_offset gh == Seq.length (LP.serialize (Public.serialize_header cid_len) ph));\n assert (Secret.v (header_len h) == Spec.header_len (g_header h m pn))\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 108, "start_col": 2, "end_line": 131, "end_col": 5 }, "file_context": "module QUIC.Impl.Header.Parse\n\nopen QUIC.Spec.Header.Parse\nopen QUIC.Impl.Header.Base\n\nfriend QUIC.Spec.Header.Parse\n\nmodule LP = LowParse.Low.Base\nmodule Public = QUIC.Impl.Header.Public\nmodule U8 = FStar.UInt8\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule Spec = QUIC.Spec.Header.Parse\nmodule PN = QUIC.Impl.PacketNumber\n\n[@\"opaque_to_smt\"]\nlet impl_short_protected_bits\n (reserved_bits: secret_bitfield 2)\n (key_phase: secret_bitfield 1)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_short_protected_bits (Secret.reveal reserved_bits) (Secret.v key_phase = 1) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\nSecret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 3ul key_phase) 3ul 5ul reserved_bits\n\n[@\"opaque_to_smt\"]\nlet impl_long_protected_bits\n (reserved_bits: secret_bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_long_protected_bits (Secret.reveal reserved_bits) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\n Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 4ul reserved_bits\n\nlet p_header\n (h: header)\n: Tot Public.header\n= match h with\n | BShort rb spin phase cid cid_len pnl ->\n Public.PShort (impl_short_protected_bits rb phase pnl) spin cid cid_len\n | BLong version dcid dcil scid scil spec ->\n begin match spec with\n | BInitial rb payload_and_pn_length pnl token token_length ->\n let spec' = (Public.PInitial payload_and_pn_length token token_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BZeroRTT rb payload_and_pn_length pnl ->\n let spec' = (Public.PZeroRTT payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BHandshake rb payload_and_pn_length pnl ->\n let spec' = (Public.PHandshake payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BRetry unused odcid odcil ->\n let spec' = (Public.PRetry odcid odcil) in\n Public.PLong unused version dcid dcil scid scil spec'\n end\n\nlet public_header_len_correct\n (h: header)\n: Lemma\n (public_header_len h == Public.header_len (p_header h))\n= ()\n\n#push-options \"--z3rlimit 1024 --query_stats\"\n\nlet public_g_header_p_header\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph\n )\n= ()\n\nlet public_header_len_correct'\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph /\\\n U32.v (public_header_len h) == Seq.length (LP.serialize (Public.serialize_header cid_len) ph) \n )\n= public_header_len_correct h;\n public_g_header_p_header h m pn;\n Public.header_len_correct (dcid_len h) m (p_header h)\n\n#restart-solver\n\nlet public_header_len_is_pn_offset\n h m pn\n= public_header_len_correct' h m pn\n\n#pop-options\n\n#push-options \"--z3rlimit 16 --query_stats --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\nlet header_len_correct\n h m pn", "dependencies": { "source_file": "QUIC.Impl.Header.Parse.fst", "checked_file": "QUIC.Impl.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.PacketNumber.fsti.checked", "QUIC.Impl.Header.Public.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Impl.PacketNumber" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Impl.Header.Public" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n h: QUIC.Impl.Header.Base.header ->\n m: FStar.Monotonic.HyperStack.mem ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Secret.Int.Base.v (QUIC.Impl.Header.Base.header_len h) ==\n QUIC.Spec.Header.Base.header_len (QUIC.Impl.Header.Base.g_header h m pn))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Base.header", "FStar.Monotonic.HyperStack.mem", "QUIC.Spec.PacketNumber.Base.packet_number_t", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "QUIC.Impl.Header.Base.is_retry", "Prims._assert", "Prims.eq2", "Prims.int", "Prims.l_or", "Lib.IntTypes.range", "Lib.IntTypes.U32", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThan", "Prims.op_LessThanOrEqual", "QUIC.Spec.Base.header_len_bound", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.SEC", "QUIC.Impl.Header.Base.header_len", "QUIC.Spec.Header.Base.header_len", "QUIC.Impl.Header.Base.g_header", "Prims.unit", "QUIC.Impl.Header.Base.header_len_is_retry", "Prims.bool", "Prims.nat", "QUIC.Spec.Header.Parse.pn_offset", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "Prims.op_Addition", "QUIC.Spec.Header.Base.pn_length", "QUIC.Impl.Header.Base.header_len_not_is_retry", "Prims.op_GreaterThanOrEqual", "FStar.UInt.size", "FStar.UInt32.n", "FStar.UInt32.v", "QUIC.Impl.Header.Base.public_header_len", "QUIC.Impl.Header.Parse.public_header_len_correct'", "QUIC.Impl.Header.Parse.public_header_len_correct", "QUIC.Impl.Header.Public.header_len_correct", "QUIC.Impl.Header.Parse.p_header", "QUIC.Spec.Header.Parse.serialize_header_eq", "QUIC.Spec.Header.Public.header", "QUIC.Impl.Header.Public.g_header", "QUIC.Impl.Header.Parse.public_g_header_p_header", "Prims.dtuple2", "QUIC.Spec.Header.Parse.synth_header_recip", "QUIC.Spec.Header.Parse.in_window_last_packet_number", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Parse.last_packet_number", "FStar.UInt32.t", "QUIC.Impl.Header.Base.dcid_len", "QUIC.Spec.Header.Base.header", "FStar.Pervasives.allow_inversion", "QUIC.Impl.Header.Base.long_header_specifics" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_len_correct\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma\n (Secret.v (header_len h) == Spec.header_len (g_header h m pn))\nlet header_len_correct h m pn =", "completed_definiton": "allow_inversion header;\nallow_inversion long_header_specifics;\nlet gh = g_header h m pn in\nlet cid_len = dcid_len h in\nlet last = last_packet_number gh in\nin_window_last_packet_number gh;\nlet (| ph , pn' |) = synth_header_recip cid_len last gh in\npublic_g_header_p_header h m pn;\nassert (Public.g_header (p_header h) m == ph);\nserialize_header_eq cid_len last gh;\nPublic.header_len_correct cid_len m (p_header h);\npublic_header_len_correct h;\npublic_header_len_correct' h m pn;\nassert (Seq.length (LP.serialize (Public.serialize_header cid_len) ph) ==\n U32.v (public_header_len h));\nif is_retry h\nthen\n (header_len_is_retry h;\n assert (Secret.v (header_len h) == Spec.header_len (g_header h m pn)))\nelse\n (header_len_not_is_retry h;\n assert (pn_offset gh + Secret.v (Spec.pn_length gh) == Spec.header_len gh);\n assert (pn_offset gh == Seq.length (LP.serialize (Public.serialize_header cid_len) ph));\n assert (Secret.v (header_len h) == Spec.header_len (g_header h m pn)))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Parse.fst", "name": "QUIC.Impl.Header.Parse.public_header_len_is_pn_offset", "original_source_type": "val public_header_len_is_pn_offset\n (h: header { ~ (is_retry h) })\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma\n (U32.v (public_header_len h) == pn_offset (g_header h m pn))", "source_type": "val public_header_len_is_pn_offset\n (h: header { ~ (is_retry h) })\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma\n (U32.v (public_header_len h) == pn_offset (g_header h m pn))", "source_definition": "let public_header_len_is_pn_offset\n h m pn\n= public_header_len_correct' h m pn", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 97, "start_col": 2, "end_line": 97, "end_col": 35 }, "file_context": "module QUIC.Impl.Header.Parse\n\nopen QUIC.Spec.Header.Parse\nopen QUIC.Impl.Header.Base\n\nfriend QUIC.Spec.Header.Parse\n\nmodule LP = LowParse.Low.Base\nmodule Public = QUIC.Impl.Header.Public\nmodule U8 = FStar.UInt8\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule Spec = QUIC.Spec.Header.Parse\nmodule PN = QUIC.Impl.PacketNumber\n\n[@\"opaque_to_smt\"]\nlet impl_short_protected_bits\n (reserved_bits: secret_bitfield 2)\n (key_phase: secret_bitfield 1)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_short_protected_bits (Secret.reveal reserved_bits) (Secret.v key_phase = 1) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\nSecret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 3ul key_phase) 3ul 5ul reserved_bits\n\n[@\"opaque_to_smt\"]\nlet impl_long_protected_bits\n (reserved_bits: secret_bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_long_protected_bits (Secret.reveal reserved_bits) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\n Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 4ul reserved_bits\n\nlet p_header\n (h: header)\n: Tot Public.header\n= match h with\n | BShort rb spin phase cid cid_len pnl ->\n Public.PShort (impl_short_protected_bits rb phase pnl) spin cid cid_len\n | BLong version dcid dcil scid scil spec ->\n begin match spec with\n | BInitial rb payload_and_pn_length pnl token token_length ->\n let spec' = (Public.PInitial payload_and_pn_length token token_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BZeroRTT rb payload_and_pn_length pnl ->\n let spec' = (Public.PZeroRTT payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BHandshake rb payload_and_pn_length pnl ->\n let spec' = (Public.PHandshake payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BRetry unused odcid odcil ->\n let spec' = (Public.PRetry odcid odcil) in\n Public.PLong unused version dcid dcil scid scil spec'\n end\n\nlet public_header_len_correct\n (h: header)\n: Lemma\n (public_header_len h == Public.header_len (p_header h))\n= ()\n\n#push-options \"--z3rlimit 1024 --query_stats\"\n\nlet public_g_header_p_header\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph\n )\n= ()\n\nlet public_header_len_correct'\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph /\\\n U32.v (public_header_len h) == Seq.length (LP.serialize (Public.serialize_header cid_len) ph) \n )\n= public_header_len_correct h;\n public_g_header_p_header h m pn;\n Public.header_len_correct (dcid_len h) m (p_header h)\n\n#restart-solver\n\nlet public_header_len_is_pn_offset", "dependencies": { "source_file": "QUIC.Impl.Header.Parse.fst", "checked_file": "QUIC.Impl.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.PacketNumber.fsti.checked", "QUIC.Impl.Header.Public.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Impl.PacketNumber" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Impl.Header.Public" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 1024, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n h: QUIC.Impl.Header.Base.header{~(QUIC.Impl.Header.Base.is_retry h)} ->\n m: FStar.Monotonic.HyperStack.mem ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t\n -> FStar.Pervasives.Lemma\n (ensures\n FStar.UInt32.v (QUIC.Impl.Header.Base.public_header_len h) ==\n QUIC.Spec.Header.Parse.pn_offset (QUIC.Impl.Header.Base.g_header h m pn))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Impl.Header.Base.is_retry", "FStar.Monotonic.HyperStack.mem", "QUIC.Spec.PacketNumber.Base.packet_number_t", "QUIC.Impl.Header.Parse.public_header_len_correct'", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val public_header_len_is_pn_offset\n (h: header { ~ (is_retry h) })\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma\n (U32.v (public_header_len h) == pn_offset (g_header h m pn))\nlet public_header_len_is_pn_offset h m pn =", "completed_definiton": "public_header_len_correct' h m pn", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Parse.fst", "name": "QUIC.Impl.Header.Parse.public_header_len_correct'", "original_source_type": "val public_header_len_correct' (h: header) (m: HS.mem) (pn: PN.packet_number_t)\n : Lemma\n (let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph , pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph /\\\n U32.v (public_header_len h) == Seq.length (LP.serialize (Public.serialize_header cid_len) ph))", "source_type": "val public_header_len_correct' (h: header) (m: HS.mem) (pn: PN.packet_number_t)\n : Lemma\n (let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph , pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph /\\\n U32.v (public_header_len h) == Seq.length (LP.serialize (Public.serialize_header cid_len) ph))", "source_definition": "let public_header_len_correct'\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph /\\\n U32.v (public_header_len h) == Seq.length (LP.serialize (Public.serialize_header cid_len) ph) \n )\n= public_header_len_correct h;\n public_g_header_p_header h m pn;\n Public.header_len_correct (dcid_len h) m (p_header h)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 89, "start_col": 2, "end_line": 91, "end_col": 55 }, "file_context": "module QUIC.Impl.Header.Parse\n\nopen QUIC.Spec.Header.Parse\nopen QUIC.Impl.Header.Base\n\nfriend QUIC.Spec.Header.Parse\n\nmodule LP = LowParse.Low.Base\nmodule Public = QUIC.Impl.Header.Public\nmodule U8 = FStar.UInt8\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule Spec = QUIC.Spec.Header.Parse\nmodule PN = QUIC.Impl.PacketNumber\n\n[@\"opaque_to_smt\"]\nlet impl_short_protected_bits\n (reserved_bits: secret_bitfield 2)\n (key_phase: secret_bitfield 1)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_short_protected_bits (Secret.reveal reserved_bits) (Secret.v key_phase = 1) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\nSecret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 3ul key_phase) 3ul 5ul reserved_bits\n\n[@\"opaque_to_smt\"]\nlet impl_long_protected_bits\n (reserved_bits: secret_bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_long_protected_bits (Secret.reveal reserved_bits) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\n Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 4ul reserved_bits\n\nlet p_header\n (h: header)\n: Tot Public.header\n= match h with\n | BShort rb spin phase cid cid_len pnl ->\n Public.PShort (impl_short_protected_bits rb phase pnl) spin cid cid_len\n | BLong version dcid dcil scid scil spec ->\n begin match spec with\n | BInitial rb payload_and_pn_length pnl token token_length ->\n let spec' = (Public.PInitial payload_and_pn_length token token_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BZeroRTT rb payload_and_pn_length pnl ->\n let spec' = (Public.PZeroRTT payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BHandshake rb payload_and_pn_length pnl ->\n let spec' = (Public.PHandshake payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BRetry unused odcid odcil ->\n let spec' = (Public.PRetry odcid odcil) in\n Public.PLong unused version dcid dcil scid scil spec'\n end\n\nlet public_header_len_correct\n (h: header)\n: Lemma\n (public_header_len h == Public.header_len (p_header h))\n= ()\n\n#push-options \"--z3rlimit 1024 --query_stats\"\n\nlet public_g_header_p_header\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph\n )\n= ()\n\nlet public_header_len_correct'\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph /\\\n U32.v (public_header_len h) == Seq.length (LP.serialize (Public.serialize_header cid_len) ph)", "dependencies": { "source_file": "QUIC.Impl.Header.Parse.fst", "checked_file": "QUIC.Impl.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.PacketNumber.fsti.checked", "QUIC.Impl.Header.Public.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Impl.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Impl.Header.Public" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 1024, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n h: QUIC.Impl.Header.Base.header ->\n m: FStar.Monotonic.HyperStack.mem ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t\n -> FStar.Pervasives.Lemma\n (ensures\n (let gh = QUIC.Impl.Header.Base.g_header h m pn in\n let cid_len = QUIC.Impl.Header.Base.dcid_len h in\n let last = QUIC.Spec.Header.Parse.last_packet_number gh in\n let _ = QUIC.Spec.Header.Parse.synth_header_recip cid_len last gh in\n (let Prims.Mkdtuple2 #_ #_ ph _ = _ in\n QUIC.Impl.Header.Public.g_header (QUIC.Impl.Header.Parse.p_header h) m == ph /\\\n FStar.UInt32.v (QUIC.Impl.Header.Base.public_header_len h) ==\n FStar.Seq.Base.length (LowParse.Spec.Base.serialize (QUIC.Spec.Header.Public.serialize_header\n cid_len)\n ph))\n <:\n Type0))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Base.header", "FStar.Monotonic.HyperStack.mem", "QUIC.Spec.PacketNumber.Base.packet_number_t", "QUIC.Impl.Header.Public.header_len_correct", "QUIC.Impl.Header.Base.dcid_len", "QUIC.Impl.Header.Parse.p_header", "Prims.unit", "QUIC.Impl.Header.Parse.public_g_header_p_header", "QUIC.Impl.Header.Parse.public_header_len_correct", "Prims.l_True", "Prims.squash", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "Prims.l_and", "Prims.eq2", "QUIC.Spec.Header.Public.header", "QUIC.Impl.Header.Public.g_header", "Prims.int", "Prims.l_or", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "FStar.UInt.size", "FStar.UInt32.n", "FStar.UInt32.v", "QUIC.Impl.Header.Base.public_header_len", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "Prims.dtuple2", "QUIC.Spec.Header.Parse.synth_header_recip", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Parse.last_packet_number", "FStar.UInt32.t", "QUIC.Spec.Header.Base.header", "QUIC.Impl.Header.Base.g_header", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val public_header_len_correct' (h: header) (m: HS.mem) (pn: PN.packet_number_t)\n : Lemma\n (let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph , pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph /\\\n U32.v (public_header_len h) == Seq.length (LP.serialize (Public.serialize_header cid_len) ph))\nlet public_header_len_correct' (h: header) (m: HS.mem) (pn: PN.packet_number_t)\n : Lemma\n (let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph , pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph /\\\n U32.v (public_header_len h) == Seq.length (LP.serialize (Public.serialize_header cid_len) ph)) =", "completed_definiton": "public_header_len_correct h;\npublic_g_header_p_header h m pn;\nPublic.header_len_correct (dcid_len h) m (p_header h)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Parse.fst", "name": "QUIC.Impl.Header.Parse.read_header", "original_source_type": "val read_header\n (packet: B.buffer U8.t)\n (packet_len: U32.t { let v = U32.v packet_len in v == B.length packet })\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (last: PN.last_packet_number_t)\n: HST.Stack (header & PN.packet_number_t)\n (requires (fun h ->\n B.live h packet /\\\n begin match Spec.putative_pn_offset (U32.v cid_len) (B.as_seq h packet) with\n | None -> False\n | Some off -> (~ (packet_is_retry (B.as_seq h packet))) ==> off + 4 <= B.length packet\n end\n ))\n (ensures (fun h (x, pn) h' ->\n B.modifies B.loc_none h h' /\\\n begin match parse_header (U32.v cid_len) (Secret.v last) (B.as_seq h packet) with\n | H_Success hd _ ->\n let len = public_header_len x in\n U32.v len <= B.length packet /\\\n header_live x h' /\\\n B.loc_buffer (B.gsub packet 0ul len) `B.loc_includes` header_footprint x /\\\n g_header x h' pn == hd\n | _ -> False\n end\n ))", "source_type": "val read_header\n (packet: B.buffer U8.t)\n (packet_len: U32.t { let v = U32.v packet_len in v == B.length packet })\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (last: PN.last_packet_number_t)\n: HST.Stack (header & PN.packet_number_t)\n (requires (fun h ->\n B.live h packet /\\\n begin match Spec.putative_pn_offset (U32.v cid_len) (B.as_seq h packet) with\n | None -> False\n | Some off -> (~ (packet_is_retry (B.as_seq h packet))) ==> off + 4 <= B.length packet\n end\n ))\n (ensures (fun h (x, pn) h' ->\n B.modifies B.loc_none h h' /\\\n begin match parse_header (U32.v cid_len) (Secret.v last) (B.as_seq h packet) with\n | H_Success hd _ ->\n let len = public_header_len x in\n U32.v len <= B.length packet /\\\n header_live x h' /\\\n B.loc_buffer (B.gsub packet 0ul len) `B.loc_includes` header_footprint x /\\\n g_header x h' pn == hd\n | _ -> False\n end\n ))", "source_definition": "let read_header\n packet packet_len cid_len last\n=\n let m = HST.get () in\n assert (Some? (Spec.putative_pn_offset (U32.v cid_len) (B.as_seq m packet)));\n parse_header_exists (U32.v cid_len) (Secret.v last) (B.as_seq m packet);\n lp_parse_header_eq cid_len last (B.as_seq m packet);\n let ph = Public.read_header packet packet_len cid_len in\n let m1 = HST.get () in\n public_header_len_complete ph;\n parse_public_header_consumes cid_len (B.as_seq m packet) ph m1;\n let h = header_p ph in\n if Public.is_retry ph\n then begin\n g_header_header_p cid_len last m ph last;\n (h, last)\n end else begin\n let len = Public.header_len ph in\n LP.parsed_data_is_serialize (Public.serialize_header cid_len) (B.as_seq m packet);\n assert (Seq.index (B.as_seq m packet) 0 == Seq.index (LP.serialize (Public.serialize_header cid_len) (Public.g_header ph m1)) 0);\n Public.serialize_header_is_retry cid_len (Public.g_header ph m1);\n assert (U32.v len + 4 <= B.length packet);\n let pn_len = pn_length h in\n let pn = SecretBuffer.with_buffer_hide\n #PN.packet_number_t\n packet\n len\n packet_len\n m1\n B.loc_none\n B.loc_none\n 1ul 0ul 1ul 0ul 1ul 0ul\n (fun pn _ cont _ _ ->\n match LP.parse (PN.parse_packet_number last pn_len) cont with\n | None -> False\n | Some (pn', _) -> pn == pn'\n )\n (fun _ _ bs _ ->\n PN.read_packet_number last pn_len bs\n )\n in\n (h, pn)\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 319, "start_col": 1, "end_line": 359, "end_col": 5 }, "file_context": "module QUIC.Impl.Header.Parse\n\nopen QUIC.Spec.Header.Parse\nopen QUIC.Impl.Header.Base\n\nfriend QUIC.Spec.Header.Parse\n\nmodule LP = LowParse.Low.Base\nmodule Public = QUIC.Impl.Header.Public\nmodule U8 = FStar.UInt8\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule Spec = QUIC.Spec.Header.Parse\nmodule PN = QUIC.Impl.PacketNumber\n\n[@\"opaque_to_smt\"]\nlet impl_short_protected_bits\n (reserved_bits: secret_bitfield 2)\n (key_phase: secret_bitfield 1)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_short_protected_bits (Secret.reveal reserved_bits) (Secret.v key_phase = 1) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\nSecret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 3ul key_phase) 3ul 5ul reserved_bits\n\n[@\"opaque_to_smt\"]\nlet impl_long_protected_bits\n (reserved_bits: secret_bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_long_protected_bits (Secret.reveal reserved_bits) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\n Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 4ul reserved_bits\n\nlet p_header\n (h: header)\n: Tot Public.header\n= match h with\n | BShort rb spin phase cid cid_len pnl ->\n Public.PShort (impl_short_protected_bits rb phase pnl) spin cid cid_len\n | BLong version dcid dcil scid scil spec ->\n begin match spec with\n | BInitial rb payload_and_pn_length pnl token token_length ->\n let spec' = (Public.PInitial payload_and_pn_length token token_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BZeroRTT rb payload_and_pn_length pnl ->\n let spec' = (Public.PZeroRTT payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BHandshake rb payload_and_pn_length pnl ->\n let spec' = (Public.PHandshake payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BRetry unused odcid odcil ->\n let spec' = (Public.PRetry odcid odcil) in\n Public.PLong unused version dcid dcil scid scil spec'\n end\n\nlet public_header_len_correct\n (h: header)\n: Lemma\n (public_header_len h == Public.header_len (p_header h))\n= ()\n\n#push-options \"--z3rlimit 1024 --query_stats\"\n\nlet public_g_header_p_header\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph\n )\n= ()\n\nlet public_header_len_correct'\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph /\\\n U32.v (public_header_len h) == Seq.length (LP.serialize (Public.serialize_header cid_len) ph) \n )\n= public_header_len_correct h;\n public_g_header_p_header h m pn;\n Public.header_len_correct (dcid_len h) m (p_header h)\n\n#restart-solver\n\nlet public_header_len_is_pn_offset\n h m pn\n= public_header_len_correct' h m pn\n\n#pop-options\n\n#push-options \"--z3rlimit 16 --query_stats --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\nlet header_len_correct\n h m pn\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n public_g_header_p_header h m pn;\n assert (Public.g_header (p_header h) m == ph);\n serialize_header_eq cid_len last gh;\n Public.header_len_correct cid_len m (p_header h);\n public_header_len_correct h;\n public_header_len_correct' h m pn;\n assert (Seq.length (LP.serialize (Public.serialize_header cid_len) ph) == U32.v (public_header_len h));\n if is_retry h\n then begin\n header_len_is_retry h;\n assert (Secret.v (header_len h) == Spec.header_len (g_header h m pn))\n end else begin\n header_len_not_is_retry h;\n assert (pn_offset gh + Secret.v (Spec.pn_length gh) == Spec.header_len gh);\n assert (pn_offset gh == Seq.length (LP.serialize (Public.serialize_header cid_len) ph));\n assert (Secret.v (header_len h) == Spec.header_len (g_header h m pn))\n end\n\n#pop-options\n\nlet last_pn\n (is_retry: bool)\n (pn: PN.packet_number_t)\n: Tot PN.last_packet_number_t\n= if is_retry\n then Secret.to_u64 0uL\n else\n let cond = Secret.lognot_one_bit (pn `Secret.secrets_are_equal_62` Secret.to_u64 0uL) in\n pn `Secret.sub` cond\n\n#push-options \"--z3rlimit 64 --query_stats\"\n\nlet last_pn_correct\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma\n (last_packet_number (g_header h m pn) == last_pn (is_retry h) pn)\n= ()\n\n#pop-options\n\n#push-options \"--z3rlimit 128 --query_stats\"\n\n#restart-solver\n\nlet write_header\n h pn out out_len\n= let m = HST.get () in\n header_len_correct h m pn;\n public_header_len_correct' h m pn;\n let cid_len = dcid_len h in\n let last = last_pn (is_retry h) pn in\n last_pn_correct h m pn;\n let ph = p_header h in\n in_window_last_packet_number (g_header h m pn);\n serialize_header_eq cid_len last (g_header h m pn);\n let len = Public.write_header cid_len ph out out_len in\n if is_retry h\n then ()\n else begin\n assert (len == Public.header_len ph);\n let pn_len = pn_length h in\n let m1 = HST.get () in\n SecretBuffer.with_buffer_hide\n #unit\n out\n len\n (len `U32.add` 4ul)\n m1\n B.loc_none\n B.loc_none\n 1ul 0ul 0ul 4ul 1ul 0ul\n (fun _ contl cont _ _ ->\n contl == LP.serialize (Public.serialize_header cid_len) (Public.g_header ph m) /\\\n Seq.slice cont 0 (Secret.v pn_len) `Seq.equal` LP.serialize (PN.serialize_packet_number last pn_len) pn\n )\n (fun _ _ bs _ ->\n PN.write_packet_number last pn_len pn bs\n )\n end\n \n#pop-options\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet putative_pn_offset\n cid_len b b_len\n=\n let h = HST.get () in\n let input = LP.make_slice b b_len in\n assert (LP.bytes_of_slice_from h input 0ul `Seq.equal` B.as_seq h b);\n LP.valid_facts (Public.parse_header cid_len) h input 0ul;\n let res = Public.validate_header cid_len input 0uL in\n if LP.is_error res\n then None\n else Some (LP.uint64_to_uint32 res)\n\n#pop-options\n\nlet impl_protected_bits_pn_length\n (is_short: bool)\n (pb: secret_bitfield (if is_short then 5 else 4))\n: Tot (y: PN.packet_number_length_t { y == protected_bits_pn_length is_short (Secret.reveal pb) })\n= // https://github.com/FStarLang/karamel/issues/102\n let bf = Secret.get_bitfield #Secret.U8 pb 0ul 2ul in\n Secret.to_u32 #Secret.U8 (Secret.to_u8 1uy `Secret.add` bf)\n\nlet impl_protected_bits_reserved\n (is_short: bool)\n (pb: secret_bitfield (if is_short then 5 else 4))\n: Tot (y: secret_bitfield 2 { Secret.reveal y == protected_bits_reserved is_short (Secret.reveal pb) })\n= if is_short\n then Secret.get_bitfield #Secret.U8 pb 3ul 5ul\n else Secret.get_bitfield #Secret.U8 pb 2ul 4ul\n\nlet impl_protected_bits_key_phase\n (x: secret_bitfield 5)\n: Tot (y: secret_bitfield 1 { protected_bits_key_phase (Secret.reveal x) == (Secret.v y = 1) })\n= Secret.get_bitfield #Secret.U8 x 2ul 3ul\n\nlet header_p\n (h: Public.header)\n: Tot header\n= match h with\n | Public.PShort pb spin cid cid_len ->\n let rb = impl_protected_bits_reserved true pb in\n let phase = impl_protected_bits_key_phase pb in\n let pnl = impl_protected_bits_pn_length true pb in\n BShort rb spin phase cid cid_len pnl\n | Public.PLong pb version dcid dcil scid scil spec ->\n let rb = impl_protected_bits_reserved false pb in\n let pnl = impl_protected_bits_pn_length false pb in\n BLong version dcid dcil scid scil\n begin match spec with\n | Public.PInitial payload_and_pn_length token token_length ->\n BInitial rb payload_and_pn_length pnl token token_length\n | Public.PHandshake payload_and_pn_length ->\n BHandshake rb payload_and_pn_length pnl\n | Public.PZeroRTT payload_and_pn_length ->\n BZeroRTT rb payload_and_pn_length pnl\n | Public.PRetry odcid odcil ->\n BRetry pb odcid odcil\n end\n\n#push-options \"--z3rlimit 16\"\n\nlet g_header_header_p\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: HS.mem)\n (ph: Public.header { Public.parse_header_prop cid_len (Public.g_header ph m) })\n (pn: PN.packet_number_t)\n: Lemma (\n let h = header_p ph in\n let gh = Public.g_header ph m in\n if\n if Public.is_retry ph\n then true\n else\n let pn_len = pn_length h in\n PN.in_window (Secret.v pn_len - 1) (Secret.v last) (Secret.v pn)\n then\n let h' = synth_header cid_len last (| gh, (if Public.is_retry ph then () else pn) |) in\n g_header (header_p ph) m pn == h'\n else\n True\n )\n= ()\n\n#pop-options\n\nlet parse_public_header_consumes\n (cid_len: short_dcid_len_t)\n (x: bytes)\n (ph: Public.header)\n (m: HS.mem)\n: Lemma\n (requires (\n match LP.parse (Public.parse_header cid_len) x with\n | None -> False\n | Some (ph0, _) -> Public.g_header ph m == ph0\n ))\n (ensures (\n let Some (ph0, consumed) = LP.parse (Public.parse_header cid_len) x in\n consumed == U32.v (Public.header_len ph)\n ))\n= let Some (ph0, consumed) = LP.parse (Public.parse_header cid_len) x in\n Public.header_len_correct cid_len m ph;\n LP.parse_serialize (Public.serialize_header cid_len) ph0;\n LP.parse_injective (Public.parse_header cid_len) x (LP.serialize (Public.serialize_header cid_len) ph0)\n\nlet public_header_len_complete\n (h: Public.header)\n: Lemma\n (public_header_len (header_p h) == Public.header_len h)\n= ()\n\n#push-options \"--z3rlimit 64\"\n\nlet read_header", "dependencies": { "source_file": "QUIC.Impl.Header.Parse.fst", "checked_file": "QUIC.Impl.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.PacketNumber.fsti.checked", "QUIC.Impl.Header.Public.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Impl.PacketNumber" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Impl.Header.Public" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n packet: LowStar.Buffer.buffer FStar.UInt8.t ->\n packet_len:\n FStar.UInt32.t\n { let v = FStar.UInt32.v packet_len in\n v == LowStar.Monotonic.Buffer.length packet } ->\n cid_len: FStar.UInt32.t{FStar.UInt32.v cid_len <= 20} ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t\n -> FStar.HyperStack.ST.Stack\n (QUIC.Impl.Header.Base.header * QUIC.Spec.PacketNumber.Base.packet_number_t)", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "FStar.UInt.uint_t", "FStar.UInt32.v", "Prims.op_LessThanOrEqual", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Impl.Header.Public.is_retry", "FStar.Pervasives.Native.Mktuple2", "QUIC.Impl.Header.Base.header", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Prims.unit", "QUIC.Impl.Header.Parse.g_header_header_p", "FStar.Pervasives.Native.tuple2", "Prims.bool", "QUIC.Secret.Buffer.with_buffer_hide", "FStar.Ghost.hide", "LowStar.Monotonic.Buffer.loc", "LowStar.Monotonic.Buffer.loc_none", "FStar.UInt32.__uint_to_t", "FStar.Seq.Properties.lseq", "Prims.op_Subtraction", "FStar.Monotonic.HyperStack.mem", "LowParse.Spec.Base.parse", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "QUIC.Spec.PacketNumber.parse_packet_number", "Prims.l_False", "LowParse.Spec.Base.consumed_length", "FStar.Ghost.erased", "Lib.IntTypes.uint8", "QUIC.Impl.PacketNumber.read_packet_number", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Impl.Header.Base.pn_length", "Prims._assert", "Prims.op_Addition", "QUIC.Spec.Header.Public.serialize_header_is_retry", "QUIC.Impl.Header.Public.g_header", "FStar.Seq.Base.index", "LowStar.Monotonic.Buffer.as_seq", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "LowParse.Spec.Base.parsed_data_is_serialize", "QUIC.Impl.Header.Public.header_len", "QUIC.Impl.Header.Parse.header_p", "QUIC.Impl.Header.Parse.parse_public_header_consumes", "QUIC.Impl.Header.Parse.public_header_len_complete", "FStar.HyperStack.ST.get", "QUIC.Impl.Header.Public.header", "QUIC.Impl.Header.Public.read_header", "QUIC.Spec.Header.Parse.lp_parse_header_eq", "QUIC.Spec.Header.Parse.parse_header_exists", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "FStar.Pervasives.Native.uu___is_Some", "Prims.nat", "QUIC.Spec.Header.Parse.putative_pn_offset" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_header\n (packet: B.buffer U8.t)\n (packet_len: U32.t { let v = U32.v packet_len in v == B.length packet })\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (last: PN.last_packet_number_t)\n: HST.Stack (header & PN.packet_number_t)\n (requires (fun h ->\n B.live h packet /\\\n begin match Spec.putative_pn_offset (U32.v cid_len) (B.as_seq h packet) with\n | None -> False\n | Some off -> (~ (packet_is_retry (B.as_seq h packet))) ==> off + 4 <= B.length packet\n end\n ))\n (ensures (fun h (x, pn) h' ->\n B.modifies B.loc_none h h' /\\\n begin match parse_header (U32.v cid_len) (Secret.v last) (B.as_seq h packet) with\n | H_Success hd _ ->\n let len = public_header_len x in\n U32.v len <= B.length packet /\\\n header_live x h' /\\\n B.loc_buffer (B.gsub packet 0ul len) `B.loc_includes` header_footprint x /\\\n g_header x h' pn == hd\n | _ -> False\n end\n ))\nlet read_header packet packet_len cid_len last =", "completed_definiton": "let m = HST.get () in\nassert (Some? (Spec.putative_pn_offset (U32.v cid_len) (B.as_seq m packet)));\nparse_header_exists (U32.v cid_len) (Secret.v last) (B.as_seq m packet);\nlp_parse_header_eq cid_len last (B.as_seq m packet);\nlet ph = Public.read_header packet packet_len cid_len in\nlet m1 = HST.get () in\npublic_header_len_complete ph;\nparse_public_header_consumes cid_len (B.as_seq m packet) ph m1;\nlet h = header_p ph in\nif Public.is_retry ph\nthen\n (g_header_header_p cid_len last m ph last;\n (h, last))\nelse\n let len = Public.header_len ph in\n LP.parsed_data_is_serialize (Public.serialize_header cid_len) (B.as_seq m packet);\n assert (Seq.index (B.as_seq m packet) 0 ==\n Seq.index (LP.serialize (Public.serialize_header cid_len) (Public.g_header ph m1)) 0);\n Public.serialize_header_is_retry cid_len (Public.g_header ph m1);\n assert (U32.v len + 4 <= B.length packet);\n let pn_len = pn_length h in\n let pn =\n SecretBuffer.with_buffer_hide #PN.packet_number_t packet len packet_len m1 B.loc_none B.loc_none\n 1ul 0ul 1ul 0ul 1ul 0ul\n (fun pn _ cont _ _ ->\n match LP.parse (PN.parse_packet_number last pn_len) cont with\n | None -> False\n | Some (pn', _) -> pn == pn') (fun _ _ bs _ -> PN.read_packet_number last pn_len bs)\n in\n (h, pn)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Parse.fst", "name": "QUIC.Impl.Header.Parse.write_header", "original_source_type": "val write_header\n (h: header)\n (pn: PN.packet_number_t)\n (out: B.buffer U8.t)\n (out_len: U32.t { U32.v out_len <= B.length out })\n: HST.Stack unit\n (requires (fun h0 ->\n header_live h h0 /\\\n B.live h0 out /\\\n B.loc_disjoint (header_footprint h) (B.loc_buffer out) /\\\n U32.v (public_header_len h) + (if is_retry h then 0 else 4) <= U32.v out_len // needs more space than just pn_length to write pn in constant time\n ))\n (ensures (fun h0 _ h1 ->\n let gh = g_header h h0 pn in\n let s = format_header gh in\n let len = header_len h in\n B.modifies (B.loc_buffer out) h0 h1 /\\\n Secret.v len <= U32.v out_len /\\\n Seq.slice (B.as_seq h1 out) 0 (Secret.v len) `Seq.equal` s \n ))", "source_type": "val write_header\n (h: header)\n (pn: PN.packet_number_t)\n (out: B.buffer U8.t)\n (out_len: U32.t { U32.v out_len <= B.length out })\n: HST.Stack unit\n (requires (fun h0 ->\n header_live h h0 /\\\n B.live h0 out /\\\n B.loc_disjoint (header_footprint h) (B.loc_buffer out) /\\\n U32.v (public_header_len h) + (if is_retry h then 0 else 4) <= U32.v out_len // needs more space than just pn_length to write pn in constant time\n ))\n (ensures (fun h0 _ h1 ->\n let gh = g_header h h0 pn in\n let s = format_header gh in\n let len = header_len h in\n B.modifies (B.loc_buffer out) h0 h1 /\\\n Secret.v len <= U32.v out_len /\\\n Seq.slice (B.as_seq h1 out) 0 (Secret.v len) `Seq.equal` s \n ))", "source_definition": "let write_header\n h pn out out_len\n= let m = HST.get () in\n header_len_correct h m pn;\n public_header_len_correct' h m pn;\n let cid_len = dcid_len h in\n let last = last_pn (is_retry h) pn in\n last_pn_correct h m pn;\n let ph = p_header h in\n in_window_last_packet_number (g_header h m pn);\n serialize_header_eq cid_len last (g_header h m pn);\n let len = Public.write_header cid_len ph out out_len in\n if is_retry h\n then ()\n else begin\n assert (len == Public.header_len ph);\n let pn_len = pn_length h in\n let m1 = HST.get () in\n SecretBuffer.with_buffer_hide\n #unit\n out\n len\n (len `U32.add` 4ul)\n m1\n B.loc_none\n B.loc_none\n 1ul 0ul 0ul 4ul 1ul 0ul\n (fun _ contl cont _ _ ->\n contl == LP.serialize (Public.serialize_header cid_len) (Public.g_header ph m) /\\\n Seq.slice cont 0 (Secret.v pn_len) `Seq.equal` LP.serialize (PN.serialize_packet_number last pn_len) pn\n )\n (fun _ _ bs _ ->\n PN.write_packet_number last pn_len pn bs\n )\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 163, "start_col": 1, "end_line": 195, "end_col": 5 }, "file_context": "module QUIC.Impl.Header.Parse\n\nopen QUIC.Spec.Header.Parse\nopen QUIC.Impl.Header.Base\n\nfriend QUIC.Spec.Header.Parse\n\nmodule LP = LowParse.Low.Base\nmodule Public = QUIC.Impl.Header.Public\nmodule U8 = FStar.UInt8\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule Spec = QUIC.Spec.Header.Parse\nmodule PN = QUIC.Impl.PacketNumber\n\n[@\"opaque_to_smt\"]\nlet impl_short_protected_bits\n (reserved_bits: secret_bitfield 2)\n (key_phase: secret_bitfield 1)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_short_protected_bits (Secret.reveal reserved_bits) (Secret.v key_phase = 1) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\nSecret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 3ul key_phase) 3ul 5ul reserved_bits\n\n[@\"opaque_to_smt\"]\nlet impl_long_protected_bits\n (reserved_bits: secret_bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (x: Secret.uint8 { Secret.reveal x == mk_long_protected_bits (Secret.reveal reserved_bits) pnl })\n= // https://github.com/FStarLang/karamel/issues/1024\n let pnl_1 = Secret.to_u8 pnl `Secret.sub` Secret.to_u8 1uy in\n Secret.set_bitfield #Secret.U8 (Secret.set_bitfield #Secret.U8 (Secret.to_u8 0uy) 0ul 2ul (pnl_1)) 2ul 4ul reserved_bits\n\nlet p_header\n (h: header)\n: Tot Public.header\n= match h with\n | BShort rb spin phase cid cid_len pnl ->\n Public.PShort (impl_short_protected_bits rb phase pnl) spin cid cid_len\n | BLong version dcid dcil scid scil spec ->\n begin match spec with\n | BInitial rb payload_and_pn_length pnl token token_length ->\n let spec' = (Public.PInitial payload_and_pn_length token token_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BZeroRTT rb payload_and_pn_length pnl ->\n let spec' = (Public.PZeroRTT payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BHandshake rb payload_and_pn_length pnl ->\n let spec' = (Public.PHandshake payload_and_pn_length) in\n Public.PLong (impl_long_protected_bits rb pnl) version dcid dcil scid scil spec'\n | BRetry unused odcid odcil ->\n let spec' = (Public.PRetry odcid odcil) in\n Public.PLong unused version dcid dcil scid scil spec'\n end\n\nlet public_header_len_correct\n (h: header)\n: Lemma\n (public_header_len h == Public.header_len (p_header h))\n= ()\n\n#push-options \"--z3rlimit 1024 --query_stats\"\n\nlet public_g_header_p_header\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph\n )\n= ()\n\nlet public_header_len_correct'\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma (\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n Public.g_header (p_header h) m == ph /\\\n U32.v (public_header_len h) == Seq.length (LP.serialize (Public.serialize_header cid_len) ph) \n )\n= public_header_len_correct h;\n public_g_header_p_header h m pn;\n Public.header_len_correct (dcid_len h) m (p_header h)\n\n#restart-solver\n\nlet public_header_len_is_pn_offset\n h m pn\n= public_header_len_correct' h m pn\n\n#pop-options\n\n#push-options \"--z3rlimit 16 --query_stats --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\nlet header_len_correct\n h m pn\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let gh = g_header h m pn in\n let cid_len = dcid_len h in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n public_g_header_p_header h m pn;\n assert (Public.g_header (p_header h) m == ph);\n serialize_header_eq cid_len last gh;\n Public.header_len_correct cid_len m (p_header h);\n public_header_len_correct h;\n public_header_len_correct' h m pn;\n assert (Seq.length (LP.serialize (Public.serialize_header cid_len) ph) == U32.v (public_header_len h));\n if is_retry h\n then begin\n header_len_is_retry h;\n assert (Secret.v (header_len h) == Spec.header_len (g_header h m pn))\n end else begin\n header_len_not_is_retry h;\n assert (pn_offset gh + Secret.v (Spec.pn_length gh) == Spec.header_len gh);\n assert (pn_offset gh == Seq.length (LP.serialize (Public.serialize_header cid_len) ph));\n assert (Secret.v (header_len h) == Spec.header_len (g_header h m pn))\n end\n\n#pop-options\n\nlet last_pn\n (is_retry: bool)\n (pn: PN.packet_number_t)\n: Tot PN.last_packet_number_t\n= if is_retry\n then Secret.to_u64 0uL\n else\n let cond = Secret.lognot_one_bit (pn `Secret.secrets_are_equal_62` Secret.to_u64 0uL) in\n pn `Secret.sub` cond\n\n#push-options \"--z3rlimit 64 --query_stats\"\n\nlet last_pn_correct\n (h: header)\n (m: HS.mem)\n (pn: PN.packet_number_t)\n: Lemma\n (last_packet_number (g_header h m pn) == last_pn (is_retry h) pn)\n= ()\n\n#pop-options\n\n#push-options \"--z3rlimit 128 --query_stats\"\n\n#restart-solver\n\nlet write_header", "dependencies": { "source_file": "QUIC.Impl.Header.Parse.fst", "checked_file": "QUIC.Impl.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.PacketNumber.fsti.checked", "QUIC.Impl.Header.Public.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Impl.PacketNumber" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Impl.Header.Public" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n h: QUIC.Impl.Header.Base.header ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t ->\n out: LowStar.Buffer.buffer FStar.UInt8.t ->\n out_len: FStar.UInt32.t{FStar.UInt32.v out_len <= LowStar.Monotonic.Buffer.length out}\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Base.header", "QUIC.Spec.PacketNumber.Base.packet_number_t", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "QUIC.Impl.Header.Base.is_retry", "Prims.unit", "Prims.bool", "QUIC.Secret.Buffer.with_buffer_hide", "FStar.UInt32.add", "FStar.UInt32.__uint_to_t", "FStar.Ghost.hide", "LowStar.Monotonic.Buffer.loc", "LowStar.Monotonic.Buffer.loc_none", "FStar.Seq.Properties.lseq", "Prims.op_Subtraction", "FStar.Monotonic.HyperStack.mem", "Prims.l_and", "Prims.eq2", "FStar.Seq.Base.seq", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "QUIC.Impl.Header.Public.g_header", "FStar.Seq.Base.equal", "FStar.Seq.Base.slice", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "QUIC.Spec.PacketNumber.parse_packet_number_kind", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "QUIC.Spec.PacketNumber.parse_packet_number", "QUIC.Spec.PacketNumber.serialize_packet_number", "FStar.Ghost.erased", "Prims.int", "Prims.l_or", "Prims.op_GreaterThanOrEqual", "FStar.UInt.size", "FStar.UInt32.n", "Lib.IntTypes.uint8", "QUIC.Impl.PacketNumber.write_packet_number", "FStar.HyperStack.ST.get", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Impl.Header.Base.pn_length", "Prims._assert", "QUIC.Impl.Header.Public.header_len", "QUIC.Impl.Header.Public.write_header", "QUIC.Spec.Header.Parse.serialize_header_eq", "QUIC.Impl.Header.Base.g_header", "QUIC.Spec.Header.Parse.in_window_last_packet_number", "QUIC.Impl.Header.Public.header", "QUIC.Impl.Header.Parse.p_header", "QUIC.Impl.Header.Parse.last_pn_correct", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Impl.Header.Parse.last_pn", "QUIC.Impl.Header.Base.dcid_len", "QUIC.Impl.Header.Parse.public_header_len_correct'", "QUIC.Impl.Header.Parse.header_len_correct" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val write_header\n (h: header)\n (pn: PN.packet_number_t)\n (out: B.buffer U8.t)\n (out_len: U32.t { U32.v out_len <= B.length out })\n: HST.Stack unit\n (requires (fun h0 ->\n header_live h h0 /\\\n B.live h0 out /\\\n B.loc_disjoint (header_footprint h) (B.loc_buffer out) /\\\n U32.v (public_header_len h) + (if is_retry h then 0 else 4) <= U32.v out_len // needs more space than just pn_length to write pn in constant time\n ))\n (ensures (fun h0 _ h1 ->\n let gh = g_header h h0 pn in\n let s = format_header gh in\n let len = header_len h in\n B.modifies (B.loc_buffer out) h0 h1 /\\\n Secret.v len <= U32.v out_len /\\\n Seq.slice (B.as_seq h1 out) 0 (Secret.v len) `Seq.equal` s \n ))\nlet write_header h pn out out_len =", "completed_definiton": "let m = HST.get () in\nheader_len_correct h m pn;\npublic_header_len_correct' h m pn;\nlet cid_len = dcid_len h in\nlet last = last_pn (is_retry h) pn in\nlast_pn_correct h m pn;\nlet ph = p_header h in\nin_window_last_packet_number (g_header h m pn);\nserialize_header_eq cid_len last (g_header h m pn);\nlet len = Public.write_header cid_len ph out out_len in\nif is_retry h\nthen ()\nelse\n (assert (len == Public.header_len ph);\n let pn_len = pn_length h in\n let m1 = HST.get () in\n SecretBuffer.with_buffer_hide #unit out len (len `U32.add` 4ul) m1 B.loc_none B.loc_none 1ul 0ul\n 0ul 4ul 1ul 0ul\n (fun _ contl cont _ _ ->\n contl == LP.serialize (Public.serialize_header cid_len) (Public.g_header ph m) /\\\n (Seq.slice cont 0 (Secret.v pn_len))\n `Seq.equal`\n (LP.serialize (PN.serialize_packet_number last pn_len) pn))\n (fun _ _ bs _ -> PN.write_packet_number last pn_len pn bs))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.VarInt.fst", "name": "QUIC.Impl.VarInt.jump_bounded_varint", "original_source_type": "val jump_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LL.jumper (parse_bounded_varint min max))", "source_type": "val jump_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LL.jumper (parse_bounded_varint min max))", "source_definition": "let jump_bounded_varint\n min max\n= LC.jump_synth\n (LC.jump_filter\n jump_varint\n (varint_in_bounds min max))\n (synth_bounded_varint min max)\n ()", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 256, "start_col": 2, "end_line": 261, "end_col": 6 }, "file_context": "module QUIC.Impl.VarInt\nfriend QUIC.Spec.VarInt\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\nmodule HST = FStar.HyperStack.ST\nmodule LL = LowParse.Low.BoundedInt\nmodule LI = LowParse.Low.Int\nmodule LC = LowParse.Low.Combinators\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\n#push-options \"--z3rlimit 128\"\n\nlet validate_varint #rrel #rel sl pos =\n let h = HST.get () in\n let pos0 = pos in\n let pos = LL.uint64_to_uint32 pos in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.validate_u8 () sl pos0 in\n if LL.is_error pos1\n then pos1\n else\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then pos1\n else\n let pos1' = pos1 in\n let pos1 = LL.uint64_to_uint32 pos1 in\n if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n let pos2 = LI.validate_u8 () sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let lsb = LI.read_u8 sl pos1 in\n let z = synth_u14 msb lsb in\n if filter_u14 z\n then pos2\n else LL.validator_error_generic\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n let pos2 = LL.validate_bounded_integer 3 sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let lsb = LL.read_bounded_integer 3 sl pos1 in\n let z = synth_u30 msb lsb in\n if filter_u30 z\n then pos2\n else LL.validator_error_generic \n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n let pos2 = LC.validate_nondep_then (LI.validate_u32 ()) (LL.validate_bounded_integer 3) sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let pos_hi = LC.accessor_fst LL.parse_u32 () (LL.parse_bounded_integer 3) sl pos1 in\n let hi = LI.read_u32 sl pos_hi in\n let pos_lo = LC.accessor_snd LI.jump_u32 (LL.parse_bounded_integer 3) sl pos1 in\n let lo = LL.read_bounded_integer 3 sl pos_lo in\n let z = synth_u62 msb (hi, lo) in\n if filter_u62 z\n then pos2\n else LL.validator_error_generic\n end\n\nlet read_varint #rrel #rel sl pos =\n let h = HST.get () in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.jump_u8 sl pos in\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then msb\n else if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n let lsb = LI.read_u8 sl pos1 in\n synth_u14 msb lsb\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n let lsb = LL.read_bounded_integer 3 sl pos1 in\n synth_u30 msb lsb\n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n let pos_hi = LC.accessor_fst LL.parse_u32 () (LL.parse_bounded_integer 3) sl pos1 in\n let hi = LI.read_u32 sl pos_hi in\n let pos_lo = LC.accessor_snd LI.jump_u32 (LL.parse_bounded_integer 3) sl pos1 in\n let lo = LL.read_bounded_integer 3 sl pos_lo in\n synth_u62 msb (hi, lo)\n end\n\nlet jump_varint #rrel #rel sl pos =\n let h = HST.get () in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.jump_u8 sl pos in\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then pos1\n else if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n LI.jump_u8 sl pos1\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n LL.jump_bounded_integer 3 sl pos1\n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n LC.jump_nondep_then (LI.jump_u32) (LL.jump_bounded_integer 3) sl pos1\n end\n\nmodule B = LowStar.Buffer\n\nlet seq_slice_i_j_k\n (#a: Type)\n (s: Seq.seq a)\n (i j k: nat)\n: Lemma\n (requires (i <= j /\\ j <= k /\\ k <= Seq.length s))\n (ensures (Seq.slice s i k `Seq.equal` (Seq.slice s i j `Seq.append` Seq.slice s j k)))\n= ()\n\nlet write_varint\n x #rrel #rel b pos\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n let fb = get_first_byte x in\n let gpos' = Ghost.hide (pos `U32.add` U32.uint_to_t (Seq.length (serialize serialize_varint x))) in\n let len1 = LL.frame_serializer32 LI.serialize32_u8 fb b (Ghost.hide pos) gpos' pos in\n let pos1 = pos `U32.add` len1 in\n if x `U64.lt` 64uL\n then len1\n else begin\n let len2 =\n if x `U64.lt` 16384uL\n then\n LL.frame_serializer32 LI.serialize32_u8 (Cast.uint64_to_uint8 x) b (Ghost.hide pos) gpos' pos1\n else if x `U64.lt` 1073741824uL\n then\n LL.frame_serializer32 (LL.serialize32_bounded_integer_3 ()) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL)) b (Ghost.hide pos) gpos' pos1\n else\n LL.frame_serializer32 (LC.serialize32_nondep_then LI.serialize32_u32 (LL.serialize32_bounded_integer_3 ())) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL)) b (Ghost.hide pos) gpos' pos1\n in\n let res = len1 `U32.add` len2 in\n let h' = HST.get () in\n seq_slice_i_j_k (B.as_seq h' b) (U32.v pos) (U32.v pos1) (U32.v pos + U32.v res);\n res\n end\n\n#pop-options\n\nlet validate_bounded_varint\n min max\n= \n LC.validate_synth\n (LC.validate_filter\n validate_varint\n read_varint\n (varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max))\n (synth_bounded_varint (U32.v min) (U32.v max))\n ()\n\nlet read_bounded_varint\n min max\n= LC.read_synth\n _\n (synth_bounded_varint min max)\n (fun x -> synth_bounded_varint min max x)\n (LC.read_filter\n read_varint\n (varint_in_bounds min max))\n ()\n\nlet jump_bounded_varint", "dependencies": { "source_file": "QUIC.Impl.VarInt.fst", "checked_file": "QUIC.Impl.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.Low.Int.fsti.checked", "LowParse.Low.Combinators.fsti.checked", "LowParse.Low.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LC", "full_module": "LowParse.Low.Combinators" }, { "abbrev": true, "short_module": "LI", "full_module": "LowParse.Low.Int" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.BoundedInt" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.VarInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "min: Prims.nat -> max: Prims.nat{min <= max /\\ max < 4294967296}\n -> LowParse.Low.Base.jumper (QUIC.Spec.VarInt.parse_bounded_varint min max)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "LowParse.Low.Combinators.jump_synth", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.UInt62.t", "QUIC.Spec.VarInt.varint_in_bounds", "LowParse.Spec.BoundedInt.bounded_int32", "LowParse.Spec.Combinators.parse_filter", "QUIC.Spec.VarInt.parse_varint", "LowParse.Low.Combinators.jump_filter", "QUIC.Impl.VarInt.jump_varint", "QUIC.Spec.VarInt.synth_bounded_varint", "LowParse.Low.Base.jumper", "QUIC.Spec.VarInt.parse_bounded_varint" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val jump_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LL.jumper (parse_bounded_varint min max))\nlet jump_bounded_varint min max =", "completed_definiton": "LC.jump_synth (LC.jump_filter jump_varint (varint_in_bounds min max))\n (synth_bounded_varint min max)\n ()", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.VarInt.fst", "name": "QUIC.Impl.VarInt.validate_bounded_varint", "original_source_type": "val validate_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LL.validator (parse_bounded_varint (U32.v min) (U32.v max)))", "source_type": "val validate_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LL.validator (parse_bounded_varint (U32.v min) (U32.v max)))", "source_definition": "let validate_bounded_varint\n min max\n= \n LC.validate_synth\n (LC.validate_filter\n validate_varint\n read_varint\n (varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max))\n (synth_bounded_varint (U32.v min) (U32.v max))\n ()", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 234, "start_col": 2, "end_line": 241, "end_col": 6 }, "file_context": "module QUIC.Impl.VarInt\nfriend QUIC.Spec.VarInt\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\nmodule HST = FStar.HyperStack.ST\nmodule LL = LowParse.Low.BoundedInt\nmodule LI = LowParse.Low.Int\nmodule LC = LowParse.Low.Combinators\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\n#push-options \"--z3rlimit 128\"\n\nlet validate_varint #rrel #rel sl pos =\n let h = HST.get () in\n let pos0 = pos in\n let pos = LL.uint64_to_uint32 pos in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.validate_u8 () sl pos0 in\n if LL.is_error pos1\n then pos1\n else\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then pos1\n else\n let pos1' = pos1 in\n let pos1 = LL.uint64_to_uint32 pos1 in\n if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n let pos2 = LI.validate_u8 () sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let lsb = LI.read_u8 sl pos1 in\n let z = synth_u14 msb lsb in\n if filter_u14 z\n then pos2\n else LL.validator_error_generic\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n let pos2 = LL.validate_bounded_integer 3 sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let lsb = LL.read_bounded_integer 3 sl pos1 in\n let z = synth_u30 msb lsb in\n if filter_u30 z\n then pos2\n else LL.validator_error_generic \n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n let pos2 = LC.validate_nondep_then (LI.validate_u32 ()) (LL.validate_bounded_integer 3) sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let pos_hi = LC.accessor_fst LL.parse_u32 () (LL.parse_bounded_integer 3) sl pos1 in\n let hi = LI.read_u32 sl pos_hi in\n let pos_lo = LC.accessor_snd LI.jump_u32 (LL.parse_bounded_integer 3) sl pos1 in\n let lo = LL.read_bounded_integer 3 sl pos_lo in\n let z = synth_u62 msb (hi, lo) in\n if filter_u62 z\n then pos2\n else LL.validator_error_generic\n end\n\nlet read_varint #rrel #rel sl pos =\n let h = HST.get () in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.jump_u8 sl pos in\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then msb\n else if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n let lsb = LI.read_u8 sl pos1 in\n synth_u14 msb lsb\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n let lsb = LL.read_bounded_integer 3 sl pos1 in\n synth_u30 msb lsb\n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n let pos_hi = LC.accessor_fst LL.parse_u32 () (LL.parse_bounded_integer 3) sl pos1 in\n let hi = LI.read_u32 sl pos_hi in\n let pos_lo = LC.accessor_snd LI.jump_u32 (LL.parse_bounded_integer 3) sl pos1 in\n let lo = LL.read_bounded_integer 3 sl pos_lo in\n synth_u62 msb (hi, lo)\n end\n\nlet jump_varint #rrel #rel sl pos =\n let h = HST.get () in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.jump_u8 sl pos in\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then pos1\n else if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n LI.jump_u8 sl pos1\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n LL.jump_bounded_integer 3 sl pos1\n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n LC.jump_nondep_then (LI.jump_u32) (LL.jump_bounded_integer 3) sl pos1\n end\n\nmodule B = LowStar.Buffer\n\nlet seq_slice_i_j_k\n (#a: Type)\n (s: Seq.seq a)\n (i j k: nat)\n: Lemma\n (requires (i <= j /\\ j <= k /\\ k <= Seq.length s))\n (ensures (Seq.slice s i k `Seq.equal` (Seq.slice s i j `Seq.append` Seq.slice s j k)))\n= ()\n\nlet write_varint\n x #rrel #rel b pos\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n let fb = get_first_byte x in\n let gpos' = Ghost.hide (pos `U32.add` U32.uint_to_t (Seq.length (serialize serialize_varint x))) in\n let len1 = LL.frame_serializer32 LI.serialize32_u8 fb b (Ghost.hide pos) gpos' pos in\n let pos1 = pos `U32.add` len1 in\n if x `U64.lt` 64uL\n then len1\n else begin\n let len2 =\n if x `U64.lt` 16384uL\n then\n LL.frame_serializer32 LI.serialize32_u8 (Cast.uint64_to_uint8 x) b (Ghost.hide pos) gpos' pos1\n else if x `U64.lt` 1073741824uL\n then\n LL.frame_serializer32 (LL.serialize32_bounded_integer_3 ()) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL)) b (Ghost.hide pos) gpos' pos1\n else\n LL.frame_serializer32 (LC.serialize32_nondep_then LI.serialize32_u32 (LL.serialize32_bounded_integer_3 ())) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL)) b (Ghost.hide pos) gpos' pos1\n in\n let res = len1 `U32.add` len2 in\n let h' = HST.get () in\n seq_slice_i_j_k (B.as_seq h' b) (U32.v pos) (U32.v pos1) (U32.v pos + U32.v res);\n res\n end\n\n#pop-options\n\nlet validate_bounded_varint\n min max", "dependencies": { "source_file": "QUIC.Impl.VarInt.fst", "checked_file": "QUIC.Impl.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.Low.Int.fsti.checked", "LowParse.Low.Combinators.fsti.checked", "LowParse.Low.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LC", "full_module": "LowParse.Low.Combinators" }, { "abbrev": true, "short_module": "LI", "full_module": "LowParse.Low.Int" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.BoundedInt" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.VarInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "min: FStar.UInt32.t -> max: FStar.UInt32.t{FStar.UInt32.v min <= FStar.UInt32.v max}\n -> LowParse.Low.Base.validator (QUIC.Spec.VarInt.parse_bounded_varint (FStar.UInt32.v min)\n (FStar.UInt32.v max))", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "LowParse.Low.Combinators.validate_synth", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.UInt62.t", "QUIC.Spec.VarInt.varint_in_bounds", "LowParse.Spec.BoundedInt.bounded_int32", "LowParse.Spec.Combinators.parse_filter", "QUIC.Spec.VarInt.parse_varint", "LowParse.Low.Combinators.validate_filter", "QUIC.Impl.VarInt.validate_varint", "QUIC.Impl.VarInt.read_varint", "Prims.op_AmpAmp", "FStar.UInt64.lte", "FStar.Int.Cast.uint32_to_uint64", "Prims.bool", "Prims.eq2", "QUIC.Spec.VarInt.synth_bounded_varint", "LowParse.Low.Base.validator", "QUIC.Spec.VarInt.parse_bounded_varint" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val validate_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LL.validator (parse_bounded_varint (U32.v min) (U32.v max)))\nlet validate_bounded_varint min max =", "completed_definiton": "LC.validate_synth (LC.validate_filter validate_varint\n read_varint\n (varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> (Cast.uint32_to_uint64 min) `U64.lte` x && x `U64.lte` (Cast.uint32_to_uint64 max)))\n (synth_bounded_varint (U32.v min) (U32.v max))\n ()", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.VarInt.fst", "name": "QUIC.Impl.VarInt.read_bounded_varint", "original_source_type": "val read_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LL.leaf_reader (parse_bounded_varint min max))", "source_type": "val read_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LL.leaf_reader (parse_bounded_varint min max))", "source_definition": "let read_bounded_varint\n min max\n= LC.read_synth\n _\n (synth_bounded_varint min max)\n (fun x -> synth_bounded_varint min max x)\n (LC.read_filter\n read_varint\n (varint_in_bounds min max))\n ()", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 245, "start_col": 2, "end_line": 252, "end_col": 6 }, "file_context": "module QUIC.Impl.VarInt\nfriend QUIC.Spec.VarInt\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\nmodule HST = FStar.HyperStack.ST\nmodule LL = LowParse.Low.BoundedInt\nmodule LI = LowParse.Low.Int\nmodule LC = LowParse.Low.Combinators\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\n#push-options \"--z3rlimit 128\"\n\nlet validate_varint #rrel #rel sl pos =\n let h = HST.get () in\n let pos0 = pos in\n let pos = LL.uint64_to_uint32 pos in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.validate_u8 () sl pos0 in\n if LL.is_error pos1\n then pos1\n else\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then pos1\n else\n let pos1' = pos1 in\n let pos1 = LL.uint64_to_uint32 pos1 in\n if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n let pos2 = LI.validate_u8 () sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let lsb = LI.read_u8 sl pos1 in\n let z = synth_u14 msb lsb in\n if filter_u14 z\n then pos2\n else LL.validator_error_generic\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n let pos2 = LL.validate_bounded_integer 3 sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let lsb = LL.read_bounded_integer 3 sl pos1 in\n let z = synth_u30 msb lsb in\n if filter_u30 z\n then pos2\n else LL.validator_error_generic \n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n let pos2 = LC.validate_nondep_then (LI.validate_u32 ()) (LL.validate_bounded_integer 3) sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let pos_hi = LC.accessor_fst LL.parse_u32 () (LL.parse_bounded_integer 3) sl pos1 in\n let hi = LI.read_u32 sl pos_hi in\n let pos_lo = LC.accessor_snd LI.jump_u32 (LL.parse_bounded_integer 3) sl pos1 in\n let lo = LL.read_bounded_integer 3 sl pos_lo in\n let z = synth_u62 msb (hi, lo) in\n if filter_u62 z\n then pos2\n else LL.validator_error_generic\n end\n\nlet read_varint #rrel #rel sl pos =\n let h = HST.get () in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.jump_u8 sl pos in\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then msb\n else if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n let lsb = LI.read_u8 sl pos1 in\n synth_u14 msb lsb\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n let lsb = LL.read_bounded_integer 3 sl pos1 in\n synth_u30 msb lsb\n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n let pos_hi = LC.accessor_fst LL.parse_u32 () (LL.parse_bounded_integer 3) sl pos1 in\n let hi = LI.read_u32 sl pos_hi in\n let pos_lo = LC.accessor_snd LI.jump_u32 (LL.parse_bounded_integer 3) sl pos1 in\n let lo = LL.read_bounded_integer 3 sl pos_lo in\n synth_u62 msb (hi, lo)\n end\n\nlet jump_varint #rrel #rel sl pos =\n let h = HST.get () in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.jump_u8 sl pos in\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then pos1\n else if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n LI.jump_u8 sl pos1\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n LL.jump_bounded_integer 3 sl pos1\n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n LC.jump_nondep_then (LI.jump_u32) (LL.jump_bounded_integer 3) sl pos1\n end\n\nmodule B = LowStar.Buffer\n\nlet seq_slice_i_j_k\n (#a: Type)\n (s: Seq.seq a)\n (i j k: nat)\n: Lemma\n (requires (i <= j /\\ j <= k /\\ k <= Seq.length s))\n (ensures (Seq.slice s i k `Seq.equal` (Seq.slice s i j `Seq.append` Seq.slice s j k)))\n= ()\n\nlet write_varint\n x #rrel #rel b pos\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n let fb = get_first_byte x in\n let gpos' = Ghost.hide (pos `U32.add` U32.uint_to_t (Seq.length (serialize serialize_varint x))) in\n let len1 = LL.frame_serializer32 LI.serialize32_u8 fb b (Ghost.hide pos) gpos' pos in\n let pos1 = pos `U32.add` len1 in\n if x `U64.lt` 64uL\n then len1\n else begin\n let len2 =\n if x `U64.lt` 16384uL\n then\n LL.frame_serializer32 LI.serialize32_u8 (Cast.uint64_to_uint8 x) b (Ghost.hide pos) gpos' pos1\n else if x `U64.lt` 1073741824uL\n then\n LL.frame_serializer32 (LL.serialize32_bounded_integer_3 ()) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL)) b (Ghost.hide pos) gpos' pos1\n else\n LL.frame_serializer32 (LC.serialize32_nondep_then LI.serialize32_u32 (LL.serialize32_bounded_integer_3 ())) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL)) b (Ghost.hide pos) gpos' pos1\n in\n let res = len1 `U32.add` len2 in\n let h' = HST.get () in\n seq_slice_i_j_k (B.as_seq h' b) (U32.v pos) (U32.v pos1) (U32.v pos + U32.v res);\n res\n end\n\n#pop-options\n\nlet validate_bounded_varint\n min max\n= \n LC.validate_synth\n (LC.validate_filter\n validate_varint\n read_varint\n (varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max))\n (synth_bounded_varint (U32.v min) (U32.v max))\n ()\n\nlet read_bounded_varint", "dependencies": { "source_file": "QUIC.Impl.VarInt.fst", "checked_file": "QUIC.Impl.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.Low.Int.fsti.checked", "LowParse.Low.Combinators.fsti.checked", "LowParse.Low.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LC", "full_module": "LowParse.Low.Combinators" }, { "abbrev": true, "short_module": "LI", "full_module": "LowParse.Low.Int" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.BoundedInt" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.VarInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "min: Prims.nat -> max: Prims.nat{min <= max /\\ max < 4294967296}\n -> LowParse.Low.Base.leaf_reader (QUIC.Spec.VarInt.parse_bounded_varint min max)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "LowParse.Low.Combinators.read_synth", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.UInt62.t", "QUIC.Spec.VarInt.varint_in_bounds", "LowParse.Spec.BoundedInt.bounded_int32", "LowParse.Spec.Combinators.parse_filter", "QUIC.Spec.VarInt.parse_varint", "QUIC.Spec.VarInt.synth_bounded_varint", "Prims.eq2", "LowParse.Low.Combinators.read_filter", "QUIC.Impl.VarInt.read_varint", "LowParse.Low.Base.leaf_reader", "QUIC.Spec.VarInt.parse_bounded_varint" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LL.leaf_reader (parse_bounded_varint min max))\nlet read_bounded_varint min max =", "completed_definiton": "LC.read_synth _\n (synth_bounded_varint min max)\n (fun x -> synth_bounded_varint min max x)\n (LC.read_filter read_varint (varint_in_bounds min max))\n ()", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.VarInt.fst", "name": "QUIC.Impl.VarInt.write_bounded_varint", "original_source_type": "val write_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LL.serializer32 (serialize_bounded_varint min max))", "source_type": "val write_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LL.serializer32 (serialize_bounded_varint min max))", "source_definition": "let write_bounded_varint\n min max\n= LC.serialize32_synth\n (LC.serialize32_filter\n write_varint\n (varint_in_bounds min max))\n (synth_bounded_varint min max)\n (synth_bounded_varint_recip min max)\n (fun x -> synth_bounded_varint_recip min max x)\n ()", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 265, "start_col": 2, "end_line": 272, "end_col": 6 }, "file_context": "module QUIC.Impl.VarInt\nfriend QUIC.Spec.VarInt\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\nmodule HST = FStar.HyperStack.ST\nmodule LL = LowParse.Low.BoundedInt\nmodule LI = LowParse.Low.Int\nmodule LC = LowParse.Low.Combinators\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\n#push-options \"--z3rlimit 128\"\n\nlet validate_varint #rrel #rel sl pos =\n let h = HST.get () in\n let pos0 = pos in\n let pos = LL.uint64_to_uint32 pos in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.validate_u8 () sl pos0 in\n if LL.is_error pos1\n then pos1\n else\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then pos1\n else\n let pos1' = pos1 in\n let pos1 = LL.uint64_to_uint32 pos1 in\n if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n let pos2 = LI.validate_u8 () sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let lsb = LI.read_u8 sl pos1 in\n let z = synth_u14 msb lsb in\n if filter_u14 z\n then pos2\n else LL.validator_error_generic\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n let pos2 = LL.validate_bounded_integer 3 sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let lsb = LL.read_bounded_integer 3 sl pos1 in\n let z = synth_u30 msb lsb in\n if filter_u30 z\n then pos2\n else LL.validator_error_generic \n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n let pos2 = LC.validate_nondep_then (LI.validate_u32 ()) (LL.validate_bounded_integer 3) sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let pos_hi = LC.accessor_fst LL.parse_u32 () (LL.parse_bounded_integer 3) sl pos1 in\n let hi = LI.read_u32 sl pos_hi in\n let pos_lo = LC.accessor_snd LI.jump_u32 (LL.parse_bounded_integer 3) sl pos1 in\n let lo = LL.read_bounded_integer 3 sl pos_lo in\n let z = synth_u62 msb (hi, lo) in\n if filter_u62 z\n then pos2\n else LL.validator_error_generic\n end\n\nlet read_varint #rrel #rel sl pos =\n let h = HST.get () in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.jump_u8 sl pos in\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then msb\n else if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n let lsb = LI.read_u8 sl pos1 in\n synth_u14 msb lsb\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n let lsb = LL.read_bounded_integer 3 sl pos1 in\n synth_u30 msb lsb\n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n let pos_hi = LC.accessor_fst LL.parse_u32 () (LL.parse_bounded_integer 3) sl pos1 in\n let hi = LI.read_u32 sl pos_hi in\n let pos_lo = LC.accessor_snd LI.jump_u32 (LL.parse_bounded_integer 3) sl pos1 in\n let lo = LL.read_bounded_integer 3 sl pos_lo in\n synth_u62 msb (hi, lo)\n end\n\nlet jump_varint #rrel #rel sl pos =\n let h = HST.get () in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.jump_u8 sl pos in\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then pos1\n else if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n LI.jump_u8 sl pos1\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n LL.jump_bounded_integer 3 sl pos1\n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n LC.jump_nondep_then (LI.jump_u32) (LL.jump_bounded_integer 3) sl pos1\n end\n\nmodule B = LowStar.Buffer\n\nlet seq_slice_i_j_k\n (#a: Type)\n (s: Seq.seq a)\n (i j k: nat)\n: Lemma\n (requires (i <= j /\\ j <= k /\\ k <= Seq.length s))\n (ensures (Seq.slice s i k `Seq.equal` (Seq.slice s i j `Seq.append` Seq.slice s j k)))\n= ()\n\nlet write_varint\n x #rrel #rel b pos\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n let fb = get_first_byte x in\n let gpos' = Ghost.hide (pos `U32.add` U32.uint_to_t (Seq.length (serialize serialize_varint x))) in\n let len1 = LL.frame_serializer32 LI.serialize32_u8 fb b (Ghost.hide pos) gpos' pos in\n let pos1 = pos `U32.add` len1 in\n if x `U64.lt` 64uL\n then len1\n else begin\n let len2 =\n if x `U64.lt` 16384uL\n then\n LL.frame_serializer32 LI.serialize32_u8 (Cast.uint64_to_uint8 x) b (Ghost.hide pos) gpos' pos1\n else if x `U64.lt` 1073741824uL\n then\n LL.frame_serializer32 (LL.serialize32_bounded_integer_3 ()) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL)) b (Ghost.hide pos) gpos' pos1\n else\n LL.frame_serializer32 (LC.serialize32_nondep_then LI.serialize32_u32 (LL.serialize32_bounded_integer_3 ())) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL)) b (Ghost.hide pos) gpos' pos1\n in\n let res = len1 `U32.add` len2 in\n let h' = HST.get () in\n seq_slice_i_j_k (B.as_seq h' b) (U32.v pos) (U32.v pos1) (U32.v pos + U32.v res);\n res\n end\n\n#pop-options\n\nlet validate_bounded_varint\n min max\n= \n LC.validate_synth\n (LC.validate_filter\n validate_varint\n read_varint\n (varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max))\n (synth_bounded_varint (U32.v min) (U32.v max))\n ()\n\nlet read_bounded_varint\n min max\n= LC.read_synth\n _\n (synth_bounded_varint min max)\n (fun x -> synth_bounded_varint min max x)\n (LC.read_filter\n read_varint\n (varint_in_bounds min max))\n ()\n\nlet jump_bounded_varint\n min max\n= LC.jump_synth\n (LC.jump_filter\n jump_varint\n (varint_in_bounds min max))\n (synth_bounded_varint min max)\n ()\n\nlet write_bounded_varint", "dependencies": { "source_file": "QUIC.Impl.VarInt.fst", "checked_file": "QUIC.Impl.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.Low.Int.fsti.checked", "LowParse.Low.Combinators.fsti.checked", "LowParse.Low.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LC", "full_module": "LowParse.Low.Combinators" }, { "abbrev": true, "short_module": "LI", "full_module": "LowParse.Low.Int" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.BoundedInt" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.VarInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "min: Prims.nat -> max: Prims.nat{min <= max /\\ max < 4294967296}\n -> LowParse.Low.Base.serializer32 (QUIC.Spec.VarInt.serialize_bounded_varint min max)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "LowParse.Low.Combinators.serialize32_synth", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.UInt62.t", "QUIC.Spec.VarInt.varint_in_bounds", "LowParse.Spec.Combinators.parse_filter", "QUIC.Spec.VarInt.parse_varint", "LowParse.Spec.Combinators.serialize_filter", "QUIC.Spec.VarInt.serialize_varint", "LowParse.Low.Combinators.serialize32_filter", "QUIC.Impl.VarInt.write_varint", "LowParse.Spec.BoundedInt.bounded_int32", "QUIC.Spec.VarInt.synth_bounded_varint", "QUIC.Spec.VarInt.synth_bounded_varint_recip", "Prims.eq2", "LowParse.Low.Base.serializer32", "QUIC.Spec.VarInt.parse_bounded_varint", "QUIC.Spec.VarInt.serialize_bounded_varint" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val write_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LL.serializer32 (serialize_bounded_varint min max))\nlet write_bounded_varint min max =", "completed_definiton": "LC.serialize32_synth (LC.serialize32_filter write_varint (varint_in_bounds min max))\n (synth_bounded_varint min max)\n (synth_bounded_varint_recip min max)\n (fun x -> synth_bounded_varint_recip min max x)\n ()", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.VarInt.fst", "name": "QUIC.Impl.VarInt.bounded_varint_len_correct", "original_source_type": "val bounded_varint_len_correct\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: LP.bounded_int32 min max)\n: Lemma\n (U32.v (varint_len (Cast.uint32_to_uint64 x)) == FStar.Seq.length (LP.serialize (QUIC.Spec.VarInt.serialize_bounded_varint min max) x))", "source_type": "val bounded_varint_len_correct\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: LP.bounded_int32 min max)\n: Lemma\n (U32.v (varint_len (Cast.uint32_to_uint64 x)) == FStar.Seq.length (LP.serialize (QUIC.Spec.VarInt.serialize_bounded_varint min max) x))", "source_definition": "let bounded_varint_len_correct\n min max x\n= serialize_synth_eq\n _\n (synth_bounded_varint min max)\n (QUIC.Spec.VarInt.serialize_varint `serialize_filter` varint_in_bounds min max)\n (synth_bounded_varint_recip min max)\n ()\n x;\n varint_len_correct (Cast.uint32_to_uint64 x)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 284, "start_col": 2, "end_line": 291, "end_col": 46 }, "file_context": "module QUIC.Impl.VarInt\nfriend QUIC.Spec.VarInt\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\nmodule HST = FStar.HyperStack.ST\nmodule LL = LowParse.Low.BoundedInt\nmodule LI = LowParse.Low.Int\nmodule LC = LowParse.Low.Combinators\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\n#push-options \"--z3rlimit 128\"\n\nlet validate_varint #rrel #rel sl pos =\n let h = HST.get () in\n let pos0 = pos in\n let pos = LL.uint64_to_uint32 pos in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.validate_u8 () sl pos0 in\n if LL.is_error pos1\n then pos1\n else\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then pos1\n else\n let pos1' = pos1 in\n let pos1 = LL.uint64_to_uint32 pos1 in\n if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n let pos2 = LI.validate_u8 () sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let lsb = LI.read_u8 sl pos1 in\n let z = synth_u14 msb lsb in\n if filter_u14 z\n then pos2\n else LL.validator_error_generic\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n let pos2 = LL.validate_bounded_integer 3 sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let lsb = LL.read_bounded_integer 3 sl pos1 in\n let z = synth_u30 msb lsb in\n if filter_u30 z\n then pos2\n else LL.validator_error_generic \n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n let pos2 = LC.validate_nondep_then (LI.validate_u32 ()) (LL.validate_bounded_integer 3) sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let pos_hi = LC.accessor_fst LL.parse_u32 () (LL.parse_bounded_integer 3) sl pos1 in\n let hi = LI.read_u32 sl pos_hi in\n let pos_lo = LC.accessor_snd LI.jump_u32 (LL.parse_bounded_integer 3) sl pos1 in\n let lo = LL.read_bounded_integer 3 sl pos_lo in\n let z = synth_u62 msb (hi, lo) in\n if filter_u62 z\n then pos2\n else LL.validator_error_generic\n end\n\nlet read_varint #rrel #rel sl pos =\n let h = HST.get () in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.jump_u8 sl pos in\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then msb\n else if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n let lsb = LI.read_u8 sl pos1 in\n synth_u14 msb lsb\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n let lsb = LL.read_bounded_integer 3 sl pos1 in\n synth_u30 msb lsb\n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n let pos_hi = LC.accessor_fst LL.parse_u32 () (LL.parse_bounded_integer 3) sl pos1 in\n let hi = LI.read_u32 sl pos_hi in\n let pos_lo = LC.accessor_snd LI.jump_u32 (LL.parse_bounded_integer 3) sl pos1 in\n let lo = LL.read_bounded_integer 3 sl pos_lo in\n synth_u62 msb (hi, lo)\n end\n\nlet jump_varint #rrel #rel sl pos =\n let h = HST.get () in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.jump_u8 sl pos in\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then pos1\n else if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n LI.jump_u8 sl pos1\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n LL.jump_bounded_integer 3 sl pos1\n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n LC.jump_nondep_then (LI.jump_u32) (LL.jump_bounded_integer 3) sl pos1\n end\n\nmodule B = LowStar.Buffer\n\nlet seq_slice_i_j_k\n (#a: Type)\n (s: Seq.seq a)\n (i j k: nat)\n: Lemma\n (requires (i <= j /\\ j <= k /\\ k <= Seq.length s))\n (ensures (Seq.slice s i k `Seq.equal` (Seq.slice s i j `Seq.append` Seq.slice s j k)))\n= ()\n\nlet write_varint\n x #rrel #rel b pos\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n let fb = get_first_byte x in\n let gpos' = Ghost.hide (pos `U32.add` U32.uint_to_t (Seq.length (serialize serialize_varint x))) in\n let len1 = LL.frame_serializer32 LI.serialize32_u8 fb b (Ghost.hide pos) gpos' pos in\n let pos1 = pos `U32.add` len1 in\n if x `U64.lt` 64uL\n then len1\n else begin\n let len2 =\n if x `U64.lt` 16384uL\n then\n LL.frame_serializer32 LI.serialize32_u8 (Cast.uint64_to_uint8 x) b (Ghost.hide pos) gpos' pos1\n else if x `U64.lt` 1073741824uL\n then\n LL.frame_serializer32 (LL.serialize32_bounded_integer_3 ()) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL)) b (Ghost.hide pos) gpos' pos1\n else\n LL.frame_serializer32 (LC.serialize32_nondep_then LI.serialize32_u32 (LL.serialize32_bounded_integer_3 ())) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL)) b (Ghost.hide pos) gpos' pos1\n in\n let res = len1 `U32.add` len2 in\n let h' = HST.get () in\n seq_slice_i_j_k (B.as_seq h' b) (U32.v pos) (U32.v pos1) (U32.v pos + U32.v res);\n res\n end\n\n#pop-options\n\nlet validate_bounded_varint\n min max\n= \n LC.validate_synth\n (LC.validate_filter\n validate_varint\n read_varint\n (varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max))\n (synth_bounded_varint (U32.v min) (U32.v max))\n ()\n\nlet read_bounded_varint\n min max\n= LC.read_synth\n _\n (synth_bounded_varint min max)\n (fun x -> synth_bounded_varint min max x)\n (LC.read_filter\n read_varint\n (varint_in_bounds min max))\n ()\n\nlet jump_bounded_varint\n min max\n= LC.jump_synth\n (LC.jump_filter\n jump_varint\n (varint_in_bounds min max))\n (synth_bounded_varint min max)\n ()\n\nlet write_bounded_varint\n min max\n= LC.serialize32_synth\n (LC.serialize32_filter\n write_varint\n (varint_in_bounds min max))\n (synth_bounded_varint min max)\n (synth_bounded_varint_recip min max)\n (fun x -> synth_bounded_varint_recip min max x)\n ()\n\n#push-options \"--z3rlimit 16\"\n\nlet varint_len_correct\n x\n= ()\n\n#pop-options\n\nlet bounded_varint_len_correct", "dependencies": { "source_file": "QUIC.Impl.VarInt.fst", "checked_file": "QUIC.Impl.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.Low.Int.fsti.checked", "LowParse.Low.Combinators.fsti.checked", "LowParse.Low.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LC", "full_module": "LowParse.Low.Combinators" }, { "abbrev": true, "short_module": "LI", "full_module": "LowParse.Low.Int" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.BoundedInt" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.VarInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n min: Prims.nat ->\n max: Prims.nat{min <= max /\\ max < 4294967296} ->\n x: LowParse.Spec.BoundedInt.bounded_int32 min max\n -> FStar.Pervasives.Lemma\n (ensures\n FStar.UInt32.v (QUIC.Impl.Base.varint_len (FStar.Int.Cast.uint32_to_uint64 x)) ==\n FStar.Seq.Base.length (LowParse.Spec.Base.serialize (QUIC.Spec.VarInt.serialize_bounded_varint\n min\n max)\n x))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "LowParse.Spec.BoundedInt.bounded_int32", "QUIC.Impl.VarInt.varint_len_correct", "FStar.Int.Cast.uint32_to_uint64", "Prims.unit", "LowParse.Spec.Combinators.serialize_synth_eq", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.UInt62.t", "QUIC.Spec.VarInt.varint_in_bounds", "LowParse.Spec.Combinators.parse_filter", "QUIC.Spec.VarInt.parse_varint", "QUIC.Spec.VarInt.synth_bounded_varint", "LowParse.Spec.Combinators.serialize_filter", "QUIC.Spec.VarInt.serialize_varint", "QUIC.Spec.VarInt.synth_bounded_varint_recip" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val bounded_varint_len_correct\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: LP.bounded_int32 min max)\n: Lemma\n (U32.v (varint_len (Cast.uint32_to_uint64 x)) == FStar.Seq.length (LP.serialize (QUIC.Spec.VarInt.serialize_bounded_varint min max) x))\nlet bounded_varint_len_correct min max x =", "completed_definiton": "serialize_synth_eq _\n (synth_bounded_varint min max)\n (QUIC.Spec.VarInt.serialize_varint `serialize_filter` (varint_in_bounds min max))\n (synth_bounded_varint_recip min max)\n ()\n x;\nvarint_len_correct (Cast.uint32_to_uint64 x)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.VarInt.fst", "name": "QUIC.Impl.VarInt.read_varint", "original_source_type": "val read_varint: LL.leaf_reader parse_varint", "source_type": "val read_varint: LL.leaf_reader parse_varint", "source_definition": "let read_varint #rrel #rel sl pos =\n let h = HST.get () in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.jump_u8 sl pos in\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then msb\n else if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n let lsb = LI.read_u8 sl pos1 in\n synth_u14 msb lsb\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n let lsb = LL.read_bounded_integer 3 sl pos1 in\n synth_u30 msb lsb\n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n let pos_hi = LC.accessor_fst LL.parse_u32 () (LL.parse_bounded_integer 3) sl pos1 in\n let hi = LI.read_u32 sl pos_hi in\n let pos_lo = LC.accessor_snd LI.jump_u32 (LL.parse_bounded_integer 3) sl pos1 in\n let lo = LL.read_bounded_integer 3 sl pos_lo in\n synth_u62 msb (hi, lo)\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 97, "start_col": 35, "end_line": 143, "end_col": 5 }, "file_context": "module QUIC.Impl.VarInt\nfriend QUIC.Spec.VarInt\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\nmodule HST = FStar.HyperStack.ST\nmodule LL = LowParse.Low.BoundedInt\nmodule LI = LowParse.Low.Int\nmodule LC = LowParse.Low.Combinators\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\n#push-options \"--z3rlimit 128\"\n\nlet validate_varint #rrel #rel sl pos =\n let h = HST.get () in\n let pos0 = pos in\n let pos = LL.uint64_to_uint32 pos in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.validate_u8 () sl pos0 in\n if LL.is_error pos1\n then pos1\n else\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then pos1\n else\n let pos1' = pos1 in\n let pos1 = LL.uint64_to_uint32 pos1 in\n if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n let pos2 = LI.validate_u8 () sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let lsb = LI.read_u8 sl pos1 in\n let z = synth_u14 msb lsb in\n if filter_u14 z\n then pos2\n else LL.validator_error_generic\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n let pos2 = LL.validate_bounded_integer 3 sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let lsb = LL.read_bounded_integer 3 sl pos1 in\n let z = synth_u30 msb lsb in\n if filter_u30 z\n then pos2\n else LL.validator_error_generic \n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n let pos2 = LC.validate_nondep_then (LI.validate_u32 ()) (LL.validate_bounded_integer 3) sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let pos_hi = LC.accessor_fst LL.parse_u32 () (LL.parse_bounded_integer 3) sl pos1 in\n let hi = LI.read_u32 sl pos_hi in\n let pos_lo = LC.accessor_snd LI.jump_u32 (LL.parse_bounded_integer 3) sl pos1 in\n let lo = LL.read_bounded_integer 3 sl pos_lo in\n let z = synth_u62 msb (hi, lo) in\n if filter_u62 z\n then pos2\n else LL.validator_error_generic\n end", "dependencies": { "source_file": "QUIC.Impl.VarInt.fst", "checked_file": "QUIC.Impl.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.Low.Int.fsti.checked", "LowParse.Low.Combinators.fsti.checked", "LowParse.Low.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LC", "full_module": "LowParse.Low.Combinators" }, { "abbrev": true, "short_module": "LI", "full_module": "LowParse.Low.Int" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.BoundedInt" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.VarInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader QUIC.Spec.VarInt.parse_varint", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "Prims.op_Equality", "FStar.UInt8.t", "FStar.UInt8.__uint_to_t", "QUIC.UInt62.t", "Prims.bool", "QUIC.Spec.VarInt.synth_u14", "LowParse.Low.Int.read_u8", "Prims.unit", "LowParse.Low.Base.Spec.valid_facts", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "QUIC.Spec.VarInt.synth_u30", "LowParse.Spec.BoundedInt.bounded_integer", "LowParse.Low.BoundedInt.read_bounded_integer", "LowParse.Spec.BoundedInt.parse_bounded_integer_kind", "LowParse.Spec.BoundedInt.parse_bounded_integer", "QUIC.Spec.VarInt.synth_u62", "FStar.Pervasives.Native.Mktuple2", "LowParse.Low.Combinators.accessor_snd", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.Int.parse_u32", "LowParse.Low.Int.jump_u32", "LowParse.Low.Int.read_u32", "LowParse.Low.Combinators.accessor_fst", "LowParse.Spec.Combinators.and_then_kind", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Combinators.nondep_then", "FStar.UInt64.t", "Prims.b2t", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt64.v", "FStar.UInt8.v", "FStar.Int.Cast.uint8_to_uint64", "Prims.eq2", "FStar.UInt.uint_t", "LowParse.BitFields.__proj__Mkuint_t__item__v", "LowParse.BitFields.uint8", "LowParse.BitFields.get_bitfield", "LowParse.BitFields.__proj__Mkuint_t__item__get_bitfield", "LowParse.Low.Int.jump_u8", "QUIC.Spec.VarInt.parse_varint_eq", "LowParse.Slice.bytes_of_slice_from", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.VarInt.parse_varint", "FStar.Pervasives.assert_norm", "Prims.pow2", "Prims._assert", "Prims.op_GreaterThan", "FStar.UInt64.n", "QUIC.UInt62.bound", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val read_varint: LL.leaf_reader parse_varint\nlet read_varint #rrel #rel sl pos =", "completed_definiton": "let h = HST.get () in\n[@@ inline_let ]let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\nin\nlet pos1 = LI.jump_u8 sl pos in\nlet b = LI.read_u8 sl pos in\nlet kd = uint8.get_bitfield b 6 8 in\nlet msb8 = uint8.get_bitfield b 0 6 in\nlet msb = Cast.uint8_to_uint64 (msb8) in\nif kd = 0uy\nthen msb\nelse\n if kd = 1uy\n then\n [@@ inline_let ]let _ = LL.valid_facts parse_u8 h sl pos1 in\n let lsb = LI.read_u8 sl pos1 in\n synth_u14 msb lsb\n else\n if kd = 2uy\n then\n [@@ inline_let ]let _ = LL.valid_facts (parse_bounded_integer 3) h sl pos1 in\n let lsb = LL.read_bounded_integer 3 sl pos1 in\n synth_u30 msb lsb\n else\n [@@ inline_let ]let _ =\n LL.valid_facts (parse_u32 `nondep_then` (parse_bounded_integer 3)) h sl pos1\n in\n let pos_hi = LC.accessor_fst LL.parse_u32 () (LL.parse_bounded_integer 3) sl pos1 in\n let hi = LI.read_u32 sl pos_hi in\n let pos_lo = LC.accessor_snd LI.jump_u32 (LL.parse_bounded_integer 3) sl pos1 in\n let lo = LL.read_bounded_integer 3 sl pos_lo in\n synth_u62 msb (hi, lo)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.VarInt.fst", "name": "QUIC.Impl.VarInt.jump_varint", "original_source_type": "val jump_varint: LL.jumper parse_varint", "source_type": "val jump_varint: LL.jumper parse_varint", "source_definition": "let jump_varint #rrel #rel sl pos =\n let h = HST.get () in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.jump_u8 sl pos in\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then pos1\n else if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n LI.jump_u8 sl pos1\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n LL.jump_bounded_integer 3 sl pos1\n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n LC.jump_nondep_then (LI.jump_u32) (LL.jump_bounded_integer 3) sl pos1\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 145, "start_col": 35, "end_line": 185, "end_col": 5 }, "file_context": "module QUIC.Impl.VarInt\nfriend QUIC.Spec.VarInt\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\nmodule HST = FStar.HyperStack.ST\nmodule LL = LowParse.Low.BoundedInt\nmodule LI = LowParse.Low.Int\nmodule LC = LowParse.Low.Combinators\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\n#push-options \"--z3rlimit 128\"\n\nlet validate_varint #rrel #rel sl pos =\n let h = HST.get () in\n let pos0 = pos in\n let pos = LL.uint64_to_uint32 pos in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.validate_u8 () sl pos0 in\n if LL.is_error pos1\n then pos1\n else\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then pos1\n else\n let pos1' = pos1 in\n let pos1 = LL.uint64_to_uint32 pos1 in\n if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n let pos2 = LI.validate_u8 () sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let lsb = LI.read_u8 sl pos1 in\n let z = synth_u14 msb lsb in\n if filter_u14 z\n then pos2\n else LL.validator_error_generic\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n let pos2 = LL.validate_bounded_integer 3 sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let lsb = LL.read_bounded_integer 3 sl pos1 in\n let z = synth_u30 msb lsb in\n if filter_u30 z\n then pos2\n else LL.validator_error_generic \n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n let pos2 = LC.validate_nondep_then (LI.validate_u32 ()) (LL.validate_bounded_integer 3) sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let pos_hi = LC.accessor_fst LL.parse_u32 () (LL.parse_bounded_integer 3) sl pos1 in\n let hi = LI.read_u32 sl pos_hi in\n let pos_lo = LC.accessor_snd LI.jump_u32 (LL.parse_bounded_integer 3) sl pos1 in\n let lo = LL.read_bounded_integer 3 sl pos_lo in\n let z = synth_u62 msb (hi, lo) in\n if filter_u62 z\n then pos2\n else LL.validator_error_generic\n end\n\nlet read_varint #rrel #rel sl pos =\n let h = HST.get () in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.jump_u8 sl pos in\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then msb\n else if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n let lsb = LI.read_u8 sl pos1 in\n synth_u14 msb lsb\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n let lsb = LL.read_bounded_integer 3 sl pos1 in\n synth_u30 msb lsb\n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n let pos_hi = LC.accessor_fst LL.parse_u32 () (LL.parse_bounded_integer 3) sl pos1 in\n let hi = LI.read_u32 sl pos_hi in\n let pos_lo = LC.accessor_snd LI.jump_u32 (LL.parse_bounded_integer 3) sl pos1 in\n let lo = LL.read_bounded_integer 3 sl pos_lo in\n synth_u62 msb (hi, lo)\n end", "dependencies": { "source_file": "QUIC.Impl.VarInt.fst", "checked_file": "QUIC.Impl.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.Low.Int.fsti.checked", "LowParse.Low.Combinators.fsti.checked", "LowParse.Low.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LC", "full_module": "LowParse.Low.Combinators" }, { "abbrev": true, "short_module": "LI", "full_module": "LowParse.Low.Int" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.BoundedInt" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.VarInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.jumper QUIC.Spec.VarInt.parse_varint", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "Prims.op_Equality", "FStar.UInt8.t", "FStar.UInt8.__uint_to_t", "Prims.bool", "LowParse.Low.Int.jump_u8", "Prims.unit", "LowParse.Low.Base.Spec.valid_facts", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "LowParse.Low.BoundedInt.jump_bounded_integer", "LowParse.Spec.BoundedInt.parse_bounded_integer_kind", "LowParse.Spec.BoundedInt.bounded_integer", "LowParse.Spec.BoundedInt.parse_bounded_integer", "LowParse.Low.Combinators.jump_nondep_then", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.Int.parse_u32", "LowParse.Low.Int.jump_u32", "LowParse.Spec.Combinators.and_then_kind", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Combinators.nondep_then", "FStar.UInt64.t", "Prims.b2t", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt64.v", "FStar.UInt8.v", "FStar.Int.Cast.uint8_to_uint64", "Prims.eq2", "FStar.UInt.uint_t", "LowParse.BitFields.__proj__Mkuint_t__item__v", "LowParse.BitFields.uint8", "LowParse.BitFields.get_bitfield", "LowParse.BitFields.__proj__Mkuint_t__item__get_bitfield", "LowParse.Low.Int.read_u8", "QUIC.Spec.VarInt.parse_varint_eq", "LowParse.Slice.bytes_of_slice_from", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.UInt62.t", "QUIC.Spec.VarInt.parse_varint", "FStar.Pervasives.assert_norm", "Prims.pow2", "Prims._assert", "Prims.op_GreaterThan", "FStar.UInt64.n", "QUIC.UInt62.bound", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val jump_varint: LL.jumper parse_varint\nlet jump_varint #rrel #rel sl pos =", "completed_definiton": "let h = HST.get () in\n[@@ inline_let ]let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\nin\nlet pos1 = LI.jump_u8 sl pos in\nlet b = LI.read_u8 sl pos in\nlet kd = uint8.get_bitfield b 6 8 in\nlet msb8 = uint8.get_bitfield b 0 6 in\nlet msb = Cast.uint8_to_uint64 (msb8) in\nif kd = 0uy\nthen pos1\nelse\n if kd = 1uy\n then\n [@@ inline_let ]let _ = LL.valid_facts parse_u8 h sl pos1 in\n LI.jump_u8 sl pos1\n else\n if kd = 2uy\n then\n [@@ inline_let ]let _ = LL.valid_facts (parse_bounded_integer 3) h sl pos1 in\n LL.jump_bounded_integer 3 sl pos1\n else\n [@@ inline_let ]let _ =\n LL.valid_facts (parse_u32 `nondep_then` (parse_bounded_integer 3)) h sl pos1\n in\n LC.jump_nondep_then (LI.jump_u32) (LL.jump_bounded_integer 3) sl pos1", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.VarInt.fst", "name": "QUIC.Impl.VarInt.validate_varint", "original_source_type": "val validate_varint: LL.validator parse_varint", "source_type": "val validate_varint: LL.validator parse_varint", "source_definition": "let validate_varint #rrel #rel sl pos =\n let h = HST.get () in\n let pos0 = pos in\n let pos = LL.uint64_to_uint32 pos in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.validate_u8 () sl pos0 in\n if LL.is_error pos1\n then pos1\n else\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then pos1\n else\n let pos1' = pos1 in\n let pos1 = LL.uint64_to_uint32 pos1 in\n if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n let pos2 = LI.validate_u8 () sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let lsb = LI.read_u8 sl pos1 in\n let z = synth_u14 msb lsb in\n if filter_u14 z\n then pos2\n else LL.validator_error_generic\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n let pos2 = LL.validate_bounded_integer 3 sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let lsb = LL.read_bounded_integer 3 sl pos1 in\n let z = synth_u30 msb lsb in\n if filter_u30 z\n then pos2\n else LL.validator_error_generic \n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n let pos2 = LC.validate_nondep_then (LI.validate_u32 ()) (LL.validate_bounded_integer 3) sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let pos_hi = LC.accessor_fst LL.parse_u32 () (LL.parse_bounded_integer 3) sl pos1 in\n let hi = LI.read_u32 sl pos_hi in\n let pos_lo = LC.accessor_snd LI.jump_u32 (LL.parse_bounded_integer 3) sl pos1 in\n let lo = LL.read_bounded_integer 3 sl pos_lo in\n let z = synth_u62 msb (hi, lo) in\n if filter_u62 z\n then pos2\n else LL.validator_error_generic\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 20, "start_col": 39, "end_line": 95, "end_col": 7 }, "file_context": "module QUIC.Impl.VarInt\nfriend QUIC.Spec.VarInt\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\nmodule HST = FStar.HyperStack.ST\nmodule LL = LowParse.Low.BoundedInt\nmodule LI = LowParse.Low.Int\nmodule LC = LowParse.Low.Combinators\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\n#push-options \"--z3rlimit 128\"", "dependencies": { "source_file": "QUIC.Impl.VarInt.fst", "checked_file": "QUIC.Impl.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.Low.Int.fsti.checked", "LowParse.Low.Combinators.fsti.checked", "LowParse.Low.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LC", "full_module": "LowParse.Low.Combinators" }, { "abbrev": true, "short_module": "LI", "full_module": "LowParse.Low.Int" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.BoundedInt" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.VarInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator QUIC.Spec.VarInt.parse_varint", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt64.t", "LowParse.Low.ErrorCode.is_error", "Prims.bool", "Prims.op_Equality", "FStar.UInt8.t", "FStar.UInt8.__uint_to_t", "QUIC.Spec.VarInt.filter_u14", "LowParse.Low.ErrorCode.validator_error_generic", "QUIC.UInt62.t", "QUIC.Spec.VarInt.synth_u14", "LowParse.Low.Int.read_u8", "LowParse.Low.Int.validate_u8", "Prims.unit", "LowParse.Low.Base.Spec.valid_facts", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "QUIC.Spec.VarInt.filter_u30", "QUIC.Spec.VarInt.synth_u30", "LowParse.Spec.BoundedInt.bounded_integer", "LowParse.Low.BoundedInt.read_bounded_integer", "LowParse.Low.BoundedInt.validate_bounded_integer", "LowParse.Spec.BoundedInt.parse_bounded_integer_kind", "LowParse.Spec.BoundedInt.parse_bounded_integer", "QUIC.Spec.VarInt.filter_u62", "QUIC.Spec.VarInt.synth_u62", "FStar.Pervasives.Native.Mktuple2", "FStar.UInt32.t", "LowParse.Low.Combinators.accessor_snd", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.Int.parse_u32", "LowParse.Low.Int.jump_u32", "LowParse.Low.Int.read_u32", "LowParse.Low.Combinators.accessor_fst", "LowParse.Low.Combinators.validate_nondep_then", "LowParse.Low.Int.validate_u32", "LowParse.Spec.Combinators.and_then_kind", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Combinators.nondep_then", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.v", "FStar.UInt64.v", "LowParse.Low.ErrorCode.uint64_to_uint32", "Prims.b2t", "FStar.UInt8.v", "FStar.Int.Cast.uint8_to_uint64", "FStar.UInt.uint_t", "LowParse.BitFields.__proj__Mkuint_t__item__v", "LowParse.BitFields.uint8", "LowParse.BitFields.get_bitfield", "LowParse.BitFields.__proj__Mkuint_t__item__get_bitfield", "QUIC.Spec.VarInt.parse_varint_eq", "LowParse.Slice.bytes_of_slice_from", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.VarInt.parse_varint", "FStar.Pervasives.assert_norm", "Prims.pow2", "Prims._assert", "Prims.op_GreaterThan", "FStar.UInt64.n", "QUIC.UInt62.bound", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val validate_varint: LL.validator parse_varint\nlet validate_varint #rrel #rel sl pos =", "completed_definiton": "let h = HST.get () in\nlet pos0 = pos in\nlet pos = LL.uint64_to_uint32 pos in\n[@@ inline_let ]let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\nin\nlet pos1 = LI.validate_u8 () sl pos0 in\nif LL.is_error pos1\nthen pos1\nelse\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then pos1\n else\n let pos1' = pos1 in\n let pos1 = LL.uint64_to_uint32 pos1 in\n if kd = 1uy\n then\n [@@ inline_let ]let _ = LL.valid_facts parse_u8 h sl pos1 in\n let pos2 = LI.validate_u8 () sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let lsb = LI.read_u8 sl pos1 in\n let z = synth_u14 msb lsb in\n if filter_u14 z then pos2 else LL.validator_error_generic\n else\n if kd = 2uy\n then\n [@@ inline_let ]let _ = LL.valid_facts (parse_bounded_integer 3) h sl pos1 in\n let pos2 = LL.validate_bounded_integer 3 sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let lsb = LL.read_bounded_integer 3 sl pos1 in\n let z = synth_u30 msb lsb in\n if filter_u30 z then pos2 else LL.validator_error_generic\n else\n [@@ inline_let ]let _ =\n LL.valid_facts (parse_u32 `nondep_then` (parse_bounded_integer 3)) h sl pos1\n in\n let pos2 =\n LC.validate_nondep_then (LI.validate_u32 ()) (LL.validate_bounded_integer 3) sl pos1'\n in\n if LL.is_error pos2\n then pos2\n else\n let pos_hi = LC.accessor_fst LL.parse_u32 () (LL.parse_bounded_integer 3) sl pos1 in\n let hi = LI.read_u32 sl pos_hi in\n let pos_lo = LC.accessor_snd LI.jump_u32 (LL.parse_bounded_integer 3) sl pos1 in\n let lo = LL.read_bounded_integer 3 sl pos_lo in\n let z = synth_u62 msb (hi, lo) in\n if filter_u62 z then pos2 else LL.validator_error_generic", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.VarInt.fst", "name": "QUIC.Impl.VarInt.write_varint", "original_source_type": "val write_varint: LL.serializer32 serialize_varint", "source_type": "val write_varint: LL.serializer32 serialize_varint", "source_definition": "let write_varint\n x #rrel #rel b pos\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n let fb = get_first_byte x in\n let gpos' = Ghost.hide (pos `U32.add` U32.uint_to_t (Seq.length (serialize serialize_varint x))) in\n let len1 = LL.frame_serializer32 LI.serialize32_u8 fb b (Ghost.hide pos) gpos' pos in\n let pos1 = pos `U32.add` len1 in\n if x `U64.lt` 64uL\n then len1\n else begin\n let len2 =\n if x `U64.lt` 16384uL\n then\n LL.frame_serializer32 LI.serialize32_u8 (Cast.uint64_to_uint8 x) b (Ghost.hide pos) gpos' pos1\n else if x `U64.lt` 1073741824uL\n then\n LL.frame_serializer32 (LL.serialize32_bounded_integer_3 ()) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL)) b (Ghost.hide pos) gpos' pos1\n else\n LL.frame_serializer32 (LC.serialize32_nondep_then LI.serialize32_u32 (LL.serialize32_bounded_integer_3 ())) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL)) b (Ghost.hide pos) gpos' pos1\n in\n let res = len1 `U32.add` len2 in\n let h' = HST.get () in\n seq_slice_i_j_k (B.as_seq h' b) (U32.v pos) (U32.v pos1) (U32.v pos + U32.v res);\n res\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 201, "start_col": 2, "end_line": 227, "end_col": 5 }, "file_context": "module QUIC.Impl.VarInt\nfriend QUIC.Spec.VarInt\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\nmodule HST = FStar.HyperStack.ST\nmodule LL = LowParse.Low.BoundedInt\nmodule LI = LowParse.Low.Int\nmodule LC = LowParse.Low.Combinators\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\n#push-options \"--z3rlimit 128\"\n\nlet validate_varint #rrel #rel sl pos =\n let h = HST.get () in\n let pos0 = pos in\n let pos = LL.uint64_to_uint32 pos in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.validate_u8 () sl pos0 in\n if LL.is_error pos1\n then pos1\n else\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then pos1\n else\n let pos1' = pos1 in\n let pos1 = LL.uint64_to_uint32 pos1 in\n if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n let pos2 = LI.validate_u8 () sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let lsb = LI.read_u8 sl pos1 in\n let z = synth_u14 msb lsb in\n if filter_u14 z\n then pos2\n else LL.validator_error_generic\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n let pos2 = LL.validate_bounded_integer 3 sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let lsb = LL.read_bounded_integer 3 sl pos1 in\n let z = synth_u30 msb lsb in\n if filter_u30 z\n then pos2\n else LL.validator_error_generic \n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n let pos2 = LC.validate_nondep_then (LI.validate_u32 ()) (LL.validate_bounded_integer 3) sl pos1' in\n if LL.is_error pos2\n then pos2\n else\n let pos_hi = LC.accessor_fst LL.parse_u32 () (LL.parse_bounded_integer 3) sl pos1 in\n let hi = LI.read_u32 sl pos_hi in\n let pos_lo = LC.accessor_snd LI.jump_u32 (LL.parse_bounded_integer 3) sl pos1 in\n let lo = LL.read_bounded_integer 3 sl pos_lo in\n let z = synth_u62 msb (hi, lo) in\n if filter_u62 z\n then pos2\n else LL.validator_error_generic\n end\n\nlet read_varint #rrel #rel sl pos =\n let h = HST.get () in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.jump_u8 sl pos in\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then msb\n else if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n let lsb = LI.read_u8 sl pos1 in\n synth_u14 msb lsb\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n let lsb = LL.read_bounded_integer 3 sl pos1 in\n synth_u30 msb lsb\n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n let pos_hi = LC.accessor_fst LL.parse_u32 () (LL.parse_bounded_integer 3) sl pos1 in\n let hi = LI.read_u32 sl pos_hi in\n let pos_lo = LC.accessor_snd LI.jump_u32 (LL.parse_bounded_integer 3) sl pos1 in\n let lo = LL.read_bounded_integer 3 sl pos_lo in\n synth_u62 msb (hi, lo)\n end\n\nlet jump_varint #rrel #rel sl pos =\n let h = HST.get () in\n [@inline_let]\n let _ =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n LL.valid_facts parse_varint h sl pos;\n parse_varint_eq (LL.bytes_of_slice_from h sl pos);\n LL.valid_facts parse_u8 h sl pos\n in\n let pos1 = LI.jump_u8 sl pos in\n let b = LI.read_u8 sl pos in\n let kd = uint8.get_bitfield b 6 8 in\n let msb8 = uint8.get_bitfield b 0 6 in\n let msb = Cast.uint8_to_uint64 (msb8) in\n if kd = 0uy\n then pos1\n else if kd = 1uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts parse_u8 h sl pos1\n in\n LI.jump_u8 sl pos1\n end else if kd = 2uy\n then begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_bounded_integer 3) h sl pos1\n in\n LL.jump_bounded_integer 3 sl pos1\n end else begin\n [@inline_let]\n let _ =\n LL.valid_facts (parse_u32 `nondep_then` parse_bounded_integer 3) h sl pos1\n in\n LC.jump_nondep_then (LI.jump_u32) (LL.jump_bounded_integer 3) sl pos1\n end\n\nmodule B = LowStar.Buffer\n\nlet seq_slice_i_j_k\n (#a: Type)\n (s: Seq.seq a)\n (i j k: nat)\n: Lemma\n (requires (i <= j /\\ j <= k /\\ k <= Seq.length s))\n (ensures (Seq.slice s i k `Seq.equal` (Seq.slice s i j `Seq.append` Seq.slice s j k)))\n= ()\n\nlet write_varint\n x #rrel #rel b pos", "dependencies": { "source_file": "QUIC.Impl.VarInt.fst", "checked_file": "QUIC.Impl.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.Low.Int.fsti.checked", "LowParse.Low.Combinators.fsti.checked", "LowParse.Low.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LC", "full_module": "LowParse.Low.Combinators" }, { "abbrev": true, "short_module": "LI", "full_module": "LowParse.Low.Int" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.BoundedInt" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "LL", "full_module": "LowParse.Low.Base" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.VarInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.serializer32 QUIC.Spec.VarInt.serialize_varint", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.UInt62.t", "LowStar.Monotonic.Buffer.srel", "LowParse.Bytes.byte", "LowStar.Monotonic.Buffer.mbuffer", "FStar.UInt32.t", "FStar.UInt64.lt", "FStar.UInt64.__uint_to_t", "Prims.bool", "Prims.unit", "QUIC.Impl.VarInt.seq_slice_i_j_k", "LowStar.Monotonic.Buffer.as_seq", "FStar.UInt32.v", "Prims.op_Addition", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "FStar.UInt32.add", "LowParse.Low.Base.frame_serializer32", "LowParse.Spec.Int.parse_u8_kind", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "LowParse.Low.Int.serialize32_u8", "FStar.Int.Cast.uint64_to_uint8", "FStar.Ghost.hide", "LowParse.Spec.BoundedInt.parse_bounded_integer_kind", "LowParse.Spec.BoundedInt.bounded_integer", "LowParse.Spec.BoundedInt.parse_bounded_integer", "LowParse.Spec.BoundedInt.serialize_bounded_integer", "LowParse.Low.BoundedInt.serialize32_bounded_integer_3", "FStar.Int.Cast.uint64_to_uint32", "FStar.UInt64.rem", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Int.parse_u32", "LowParse.Spec.Combinators.serialize_nondep_then", "LowParse.Spec.Int.serialize_u32", "LowParse.Low.Combinators.serialize32_nondep_then", "LowParse.Low.Int.serialize32_u32", "FStar.Pervasives.Native.Mktuple2", "FStar.UInt64.div", "FStar.Ghost.erased", "FStar.UInt32.uint_to_t", "FStar.Seq.Base.length", "LowParse.Spec.Base.serialize", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.VarInt.parse_varint", "QUIC.Spec.VarInt.serialize_varint", "QUIC.Spec.VarInt.get_first_byte", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.int", "Prims.pow2", "Prims._assert", "Prims.l_or", "Prims.b2t", "Prims.op_GreaterThan", "FStar.UInt.size", "FStar.UInt64.n", "FStar.UInt64.v", "QUIC.UInt62.bound" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val write_varint: LL.serializer32 serialize_varint\nlet write_varint x #rrel #rel b pos =", "completed_definiton": "assert_norm (pow2 8 == 256);\nassert_norm (pow2 6 == 64);\nassert (pow2 62 == U64.v U62.bound);\nassert_norm (pow2 24 == 16777216);\nassert_norm (pow2 32 == 4294967296);\nlet fb = get_first_byte x in\nlet gpos' =\n Ghost.hide (pos `U32.add` (U32.uint_to_t (Seq.length (serialize serialize_varint x))))\nin\nlet len1 = LL.frame_serializer32 LI.serialize32_u8 fb b (Ghost.hide pos) gpos' pos in\nlet pos1 = pos `U32.add` len1 in\nif x `U64.lt` 64uL\nthen len1\nelse\n let len2 =\n if x `U64.lt` 16384uL\n then\n LL.frame_serializer32 LI.serialize32_u8 (Cast.uint64_to_uint8 x) b (Ghost.hide pos) gpos' pos1\n else\n if x `U64.lt` 1073741824uL\n then\n LL.frame_serializer32 (LL.serialize32_bounded_integer_3 ())\n (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n b\n (Ghost.hide pos)\n gpos'\n pos1\n else\n LL.frame_serializer32 (LC.serialize32_nondep_then LI.serialize32_u32\n (LL.serialize32_bounded_integer_3 ()))\n (Cast.uint64_to_uint32 (x `U64.div` 16777216uL),\n Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n b\n (Ghost.hide pos)\n gpos'\n pos1\n in\n let res = len1 `U32.add` len2 in\n let h' = HST.get () in\n seq_slice_i_j_k (B.as_seq h' b) (U32.v pos) (U32.v pos1) (U32.v pos + U32.v res);\n res", "isa_cross_project_example": true }, { "file_name": "QUICTest.fst", "name": "QUICTest.plain_length_correct", "original_source_type": "val plain_length_correct:squash (plain_length == L.length _plain)", "source_type": "val plain_length_correct:squash (plain_length == L.length _plain)", "source_definition": "let plain_length_correct : squash (plain_length == L.length _plain) =\n assert_norm (plain_length == L.length _plain)", "source": { "project_name": "everquic-crypto", "file_name": "test/QUICTest.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 50, "start_col": 2, "end_line": 50, "end_col": 47 }, "file_context": "module QUICTest\nmodule B = LowStar.Buffer\nmodule U62 = QUIC.UInt62\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule L = FStar.List.Tot\nmodule Secret = QUIC.Secret.Int\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Seq = QUIC.Secret.Seq\nmodule Q = QUIC.State\nmodule QS = QUIC.Spec\n\n(* declassification for post tests *)\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet idx = {\n Q.hash_alg = Spec.Hash.Definitions.SHA2_256;\n Q.aead_alg = Spec.Agile.AEAD.CHACHA20_POLY1305;\n}\n\ninline_for_extraction\nnoextract\nlet _traffic_secret: list Secret.uint8 = [\n Secret.hide #Secret.U8 0x48uy; Secret.hide #Secret.U8 0xc4uy; Secret.hide #Secret.U8 0x30uy; Secret.hide #Secret.U8 0x9buy; Secret.hide #Secret.U8 0x5fuy; Secret.hide #Secret.U8 0x27uy; Secret.hide #Secret.U8 0x52uy; Secret.hide #Secret.U8 0xe8uy;\n Secret.hide #Secret.U8 0x12uy; Secret.hide #Secret.U8 0x7buy; Secret.hide #Secret.U8 0x1uy; Secret.hide #Secret.U8 0x66uy; Secret.hide #Secret.U8 0x5uy; Secret.hide #Secret.U8 0x5auy; Secret.hide #Secret.U8 0x9auy; Secret.hide #Secret.U8 0x56uy;\n Secret.hide #Secret.U8 0xe5uy; Secret.hide #Secret.U8 0xf9uy; Secret.hide #Secret.U8 0x6uy; Secret.hide #Secret.U8 0x31uy; Secret.hide #Secret.U8 0xe0uy; Secret.hide #Secret.U8 0x84uy; Secret.hide #Secret.U8 0x85uy; Secret.hide #Secret.U8 0xe0uy;\n Secret.hide #Secret.U8 0xf8uy; Secret.hide #Secret.U8 0x9euy; Secret.hide #Secret.U8 0x9cuy; Secret.hide #Secret.U8 0xecuy; Secret.hide #Secret.U8 0x4auy; Secret.hide #Secret.U8 0xdeuy; Secret.hide #Secret.U8 0xb6uy; Secret.hide #Secret.U8 0x50uy;\n]\n\ninline_for_extraction\nnoextract\nlet traffic_secret_length = norm [delta; zeta; iota; primops] (L.length _traffic_secret)\n\nlet traffic_secret_length_correct : squash (traffic_secret_length == L.length _traffic_secret) =\n assert_norm (traffic_secret_length == L.length _traffic_secret)\n\ninline_for_extraction\nnoextract\nlet _plain: list Secret.uint8 = [\n Secret.hide #Secret.U8 0uy;Secret.hide #Secret.U8 1uy;Secret.hide #Secret.U8 2uy;Secret.hide #Secret.U8 3uy;Secret.hide #Secret.U8 4uy;Secret.hide #Secret.U8 5uy;Secret.hide #Secret.U8 6uy;Secret.hide #Secret.U8 7uy;Secret.hide #Secret.U8 8uy;Secret.hide #Secret.U8 9uy;\n]\n\ninline_for_extraction\nnoextract\nlet plain_length = norm [delta; zeta; iota; primops] (L.length _plain)", "dependencies": { "source_file": "QUICTest.fst", "checked_file": "QUICTest.fst.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.State.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Printf.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked", "C.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Q", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.squash (QUICTest.plain_length == FStar.List.Tot.Base.length QUICTest._plain)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.nat", "QUICTest.plain_length", "FStar.List.Tot.Base.length", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "QUICTest._plain" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": true, "is_type": null, "partial_definition": "val plain_length_correct:squash (plain_length == L.length _plain)\nlet plain_length_correct:squash (plain_length == L.length _plain) =", "completed_definiton": "assert_norm (plain_length == L.length _plain)", "isa_cross_project_example": true }, { "file_name": "QUICTest.fst", "name": "QUICTest.plain_length", "original_source_type": "", "source_type": "val plain_length : Prims.nat", "source_definition": "let plain_length = norm [delta; zeta; iota; primops] (L.length _plain)", "source": { "project_name": "everquic-crypto", "file_name": "test/QUICTest.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 47, "start_col": 19, "end_line": 47, "end_col": 70 }, "file_context": "module QUICTest\nmodule B = LowStar.Buffer\nmodule U62 = QUIC.UInt62\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule L = FStar.List.Tot\nmodule Secret = QUIC.Secret.Int\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Seq = QUIC.Secret.Seq\nmodule Q = QUIC.State\nmodule QS = QUIC.Spec\n\n(* declassification for post tests *)\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet idx = {\n Q.hash_alg = Spec.Hash.Definitions.SHA2_256;\n Q.aead_alg = Spec.Agile.AEAD.CHACHA20_POLY1305;\n}\n\ninline_for_extraction\nnoextract\nlet _traffic_secret: list Secret.uint8 = [\n Secret.hide #Secret.U8 0x48uy; Secret.hide #Secret.U8 0xc4uy; Secret.hide #Secret.U8 0x30uy; Secret.hide #Secret.U8 0x9buy; Secret.hide #Secret.U8 0x5fuy; Secret.hide #Secret.U8 0x27uy; Secret.hide #Secret.U8 0x52uy; Secret.hide #Secret.U8 0xe8uy;\n Secret.hide #Secret.U8 0x12uy; Secret.hide #Secret.U8 0x7buy; Secret.hide #Secret.U8 0x1uy; Secret.hide #Secret.U8 0x66uy; Secret.hide #Secret.U8 0x5uy; Secret.hide #Secret.U8 0x5auy; Secret.hide #Secret.U8 0x9auy; Secret.hide #Secret.U8 0x56uy;\n Secret.hide #Secret.U8 0xe5uy; Secret.hide #Secret.U8 0xf9uy; Secret.hide #Secret.U8 0x6uy; Secret.hide #Secret.U8 0x31uy; Secret.hide #Secret.U8 0xe0uy; Secret.hide #Secret.U8 0x84uy; Secret.hide #Secret.U8 0x85uy; Secret.hide #Secret.U8 0xe0uy;\n Secret.hide #Secret.U8 0xf8uy; Secret.hide #Secret.U8 0x9euy; Secret.hide #Secret.U8 0x9cuy; Secret.hide #Secret.U8 0xecuy; Secret.hide #Secret.U8 0x4auy; Secret.hide #Secret.U8 0xdeuy; Secret.hide #Secret.U8 0xb6uy; Secret.hide #Secret.U8 0x50uy;\n]\n\ninline_for_extraction\nnoextract\nlet traffic_secret_length = norm [delta; zeta; iota; primops] (L.length _traffic_secret)\n\nlet traffic_secret_length_correct : squash (traffic_secret_length == L.length _traffic_secret) =\n assert_norm (traffic_secret_length == L.length _traffic_secret)\n\ninline_for_extraction\nnoextract\nlet _plain: list Secret.uint8 = [\n Secret.hide #Secret.U8 0uy;Secret.hide #Secret.U8 1uy;Secret.hide #Secret.U8 2uy;Secret.hide #Secret.U8 3uy;Secret.hide #Secret.U8 4uy;Secret.hide #Secret.U8 5uy;Secret.hide #Secret.U8 6uy;Secret.hide #Secret.U8 7uy;Secret.hide #Secret.U8 8uy;Secret.hide #Secret.U8 9uy;\n]\n\ninline_for_extraction", "dependencies": { "source_file": "QUICTest.fst", "checked_file": "QUICTest.fst.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.State.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Printf.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked", "C.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Q", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.nat", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Pervasives.norm", "Prims.Cons", "FStar.Pervasives.norm_step", "FStar.Pervasives.delta", "FStar.Pervasives.zeta", "FStar.Pervasives.iota", "FStar.Pervasives.primops", "Prims.Nil", "Prims.nat", "FStar.List.Tot.Base.length", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "QUICTest._plain" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let plain_length =", "completed_definiton": "norm [delta; zeta; iota; primops] (L.length _plain)", "isa_cross_project_example": true }, { "file_name": "QUICTest.fst", "name": "QUICTest._plain", "original_source_type": "val _plain:list Secret.uint8", "source_type": "val _plain:list Secret.uint8", "source_definition": "let _plain: list Secret.uint8 = [\n Secret.hide #Secret.U8 0uy;Secret.hide #Secret.U8 1uy;Secret.hide #Secret.U8 2uy;Secret.hide #Secret.U8 3uy;Secret.hide #Secret.U8 4uy;Secret.hide #Secret.U8 5uy;Secret.hide #Secret.U8 6uy;Secret.hide #Secret.U8 7uy;Secret.hide #Secret.U8 8uy;Secret.hide #Secret.U8 9uy;\n]", "source": { "project_name": "everquic-crypto", "file_name": "test/QUICTest.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 41, "start_col": 32, "end_line": 43, "end_col": 1 }, "file_context": "module QUICTest\nmodule B = LowStar.Buffer\nmodule U62 = QUIC.UInt62\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule L = FStar.List.Tot\nmodule Secret = QUIC.Secret.Int\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Seq = QUIC.Secret.Seq\nmodule Q = QUIC.State\nmodule QS = QUIC.Spec\n\n(* declassification for post tests *)\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet idx = {\n Q.hash_alg = Spec.Hash.Definitions.SHA2_256;\n Q.aead_alg = Spec.Agile.AEAD.CHACHA20_POLY1305;\n}\n\ninline_for_extraction\nnoextract\nlet _traffic_secret: list Secret.uint8 = [\n Secret.hide #Secret.U8 0x48uy; Secret.hide #Secret.U8 0xc4uy; Secret.hide #Secret.U8 0x30uy; Secret.hide #Secret.U8 0x9buy; Secret.hide #Secret.U8 0x5fuy; Secret.hide #Secret.U8 0x27uy; Secret.hide #Secret.U8 0x52uy; Secret.hide #Secret.U8 0xe8uy;\n Secret.hide #Secret.U8 0x12uy; Secret.hide #Secret.U8 0x7buy; Secret.hide #Secret.U8 0x1uy; Secret.hide #Secret.U8 0x66uy; Secret.hide #Secret.U8 0x5uy; Secret.hide #Secret.U8 0x5auy; Secret.hide #Secret.U8 0x9auy; Secret.hide #Secret.U8 0x56uy;\n Secret.hide #Secret.U8 0xe5uy; Secret.hide #Secret.U8 0xf9uy; Secret.hide #Secret.U8 0x6uy; Secret.hide #Secret.U8 0x31uy; Secret.hide #Secret.U8 0xe0uy; Secret.hide #Secret.U8 0x84uy; Secret.hide #Secret.U8 0x85uy; Secret.hide #Secret.U8 0xe0uy;\n Secret.hide #Secret.U8 0xf8uy; Secret.hide #Secret.U8 0x9euy; Secret.hide #Secret.U8 0x9cuy; Secret.hide #Secret.U8 0xecuy; Secret.hide #Secret.U8 0x4auy; Secret.hide #Secret.U8 0xdeuy; Secret.hide #Secret.U8 0xb6uy; Secret.hide #Secret.U8 0x50uy;\n]\n\ninline_for_extraction\nnoextract\nlet traffic_secret_length = norm [delta; zeta; iota; primops] (L.length _traffic_secret)\n\nlet traffic_secret_length_correct : squash (traffic_secret_length == L.length _traffic_secret) =\n assert_norm (traffic_secret_length == L.length _traffic_secret)\n\ninline_for_extraction", "dependencies": { "source_file": "QUICTest.fst", "checked_file": "QUICTest.fst.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.State.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Printf.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked", "C.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Q", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.list (Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.SEC)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.Cons", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "QUIC.Secret.Int.hide", "Lib.IntTypes.PUB", "FStar.UInt8.__uint_to_t", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val _plain:list Secret.uint8\nlet _plain:list Secret.uint8 =", "completed_definiton": "[\n Secret.hide #Secret.U8 0uy; Secret.hide #Secret.U8 1uy; Secret.hide #Secret.U8 2uy;\n Secret.hide #Secret.U8 3uy; Secret.hide #Secret.U8 4uy; Secret.hide #Secret.U8 5uy;\n Secret.hide #Secret.U8 6uy; Secret.hide #Secret.U8 7uy; Secret.hide #Secret.U8 8uy;\n Secret.hide #Secret.U8 9uy\n]", "isa_cross_project_example": true }, { "file_name": "QUICTest.fst", "name": "QUICTest.traffic_secret_length", "original_source_type": "", "source_type": "val traffic_secret_length : Prims.nat", "source_definition": "let traffic_secret_length = norm [delta; zeta; iota; primops] (L.length _traffic_secret)", "source": { "project_name": "everquic-crypto", "file_name": "test/QUICTest.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 34, "start_col": 28, "end_line": 34, "end_col": 88 }, "file_context": "module QUICTest\nmodule B = LowStar.Buffer\nmodule U62 = QUIC.UInt62\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule L = FStar.List.Tot\nmodule Secret = QUIC.Secret.Int\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Seq = QUIC.Secret.Seq\nmodule Q = QUIC.State\nmodule QS = QUIC.Spec\n\n(* declassification for post tests *)\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet idx = {\n Q.hash_alg = Spec.Hash.Definitions.SHA2_256;\n Q.aead_alg = Spec.Agile.AEAD.CHACHA20_POLY1305;\n}\n\ninline_for_extraction\nnoextract\nlet _traffic_secret: list Secret.uint8 = [\n Secret.hide #Secret.U8 0x48uy; Secret.hide #Secret.U8 0xc4uy; Secret.hide #Secret.U8 0x30uy; Secret.hide #Secret.U8 0x9buy; Secret.hide #Secret.U8 0x5fuy; Secret.hide #Secret.U8 0x27uy; Secret.hide #Secret.U8 0x52uy; Secret.hide #Secret.U8 0xe8uy;\n Secret.hide #Secret.U8 0x12uy; Secret.hide #Secret.U8 0x7buy; Secret.hide #Secret.U8 0x1uy; Secret.hide #Secret.U8 0x66uy; Secret.hide #Secret.U8 0x5uy; Secret.hide #Secret.U8 0x5auy; Secret.hide #Secret.U8 0x9auy; Secret.hide #Secret.U8 0x56uy;\n Secret.hide #Secret.U8 0xe5uy; Secret.hide #Secret.U8 0xf9uy; Secret.hide #Secret.U8 0x6uy; Secret.hide #Secret.U8 0x31uy; Secret.hide #Secret.U8 0xe0uy; Secret.hide #Secret.U8 0x84uy; Secret.hide #Secret.U8 0x85uy; Secret.hide #Secret.U8 0xe0uy;\n Secret.hide #Secret.U8 0xf8uy; Secret.hide #Secret.U8 0x9euy; Secret.hide #Secret.U8 0x9cuy; Secret.hide #Secret.U8 0xecuy; Secret.hide #Secret.U8 0x4auy; Secret.hide #Secret.U8 0xdeuy; Secret.hide #Secret.U8 0xb6uy; Secret.hide #Secret.U8 0x50uy;\n]\n\ninline_for_extraction", "dependencies": { "source_file": "QUICTest.fst", "checked_file": "QUICTest.fst.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.State.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Printf.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked", "C.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Q", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.nat", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Pervasives.norm", "Prims.Cons", "FStar.Pervasives.norm_step", "FStar.Pervasives.delta", "FStar.Pervasives.zeta", "FStar.Pervasives.iota", "FStar.Pervasives.primops", "Prims.Nil", "Prims.nat", "FStar.List.Tot.Base.length", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "QUICTest._traffic_secret" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let traffic_secret_length =", "completed_definiton": "norm [delta; zeta; iota; primops] (L.length _traffic_secret)", "isa_cross_project_example": true }, { "file_name": "QUICTest.fst", "name": "QUICTest.traffic_secret_length_correct", "original_source_type": "val traffic_secret_length_correct:squash (traffic_secret_length == L.length _traffic_secret)", "source_type": "val traffic_secret_length_correct:squash (traffic_secret_length == L.length _traffic_secret)", "source_definition": "let traffic_secret_length_correct : squash (traffic_secret_length == L.length _traffic_secret) =\n assert_norm (traffic_secret_length == L.length _traffic_secret)", "source": { "project_name": "everquic-crypto", "file_name": "test/QUICTest.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 37, "start_col": 2, "end_line": 37, "end_col": 65 }, "file_context": "module QUICTest\nmodule B = LowStar.Buffer\nmodule U62 = QUIC.UInt62\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule L = FStar.List.Tot\nmodule Secret = QUIC.Secret.Int\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Seq = QUIC.Secret.Seq\nmodule Q = QUIC.State\nmodule QS = QUIC.Spec\n\n(* declassification for post tests *)\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet idx = {\n Q.hash_alg = Spec.Hash.Definitions.SHA2_256;\n Q.aead_alg = Spec.Agile.AEAD.CHACHA20_POLY1305;\n}\n\ninline_for_extraction\nnoextract\nlet _traffic_secret: list Secret.uint8 = [\n Secret.hide #Secret.U8 0x48uy; Secret.hide #Secret.U8 0xc4uy; Secret.hide #Secret.U8 0x30uy; Secret.hide #Secret.U8 0x9buy; Secret.hide #Secret.U8 0x5fuy; Secret.hide #Secret.U8 0x27uy; Secret.hide #Secret.U8 0x52uy; Secret.hide #Secret.U8 0xe8uy;\n Secret.hide #Secret.U8 0x12uy; Secret.hide #Secret.U8 0x7buy; Secret.hide #Secret.U8 0x1uy; Secret.hide #Secret.U8 0x66uy; Secret.hide #Secret.U8 0x5uy; Secret.hide #Secret.U8 0x5auy; Secret.hide #Secret.U8 0x9auy; Secret.hide #Secret.U8 0x56uy;\n Secret.hide #Secret.U8 0xe5uy; Secret.hide #Secret.U8 0xf9uy; Secret.hide #Secret.U8 0x6uy; Secret.hide #Secret.U8 0x31uy; Secret.hide #Secret.U8 0xe0uy; Secret.hide #Secret.U8 0x84uy; Secret.hide #Secret.U8 0x85uy; Secret.hide #Secret.U8 0xe0uy;\n Secret.hide #Secret.U8 0xf8uy; Secret.hide #Secret.U8 0x9euy; Secret.hide #Secret.U8 0x9cuy; Secret.hide #Secret.U8 0xecuy; Secret.hide #Secret.U8 0x4auy; Secret.hide #Secret.U8 0xdeuy; Secret.hide #Secret.U8 0xb6uy; Secret.hide #Secret.U8 0x50uy;\n]\n\ninline_for_extraction\nnoextract\nlet traffic_secret_length = norm [delta; zeta; iota; primops] (L.length _traffic_secret)", "dependencies": { "source_file": "QUICTest.fst", "checked_file": "QUICTest.fst.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.State.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Printf.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked", "C.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Q", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.squash (QUICTest.traffic_secret_length == FStar.List.Tot.Base.length QUICTest._traffic_secret)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.nat", "QUICTest.traffic_secret_length", "FStar.List.Tot.Base.length", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "QUICTest._traffic_secret" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": true, "is_type": null, "partial_definition": "val traffic_secret_length_correct:squash (traffic_secret_length == L.length _traffic_secret)\nlet traffic_secret_length_correct:squash (traffic_secret_length == L.length _traffic_secret) =", "completed_definiton": "assert_norm (traffic_secret_length == L.length _traffic_secret)", "isa_cross_project_example": true }, { "file_name": "QUICTest.fst", "name": "QUICTest._traffic_secret", "original_source_type": "val _traffic_secret:list Secret.uint8", "source_type": "val _traffic_secret:list Secret.uint8", "source_definition": "let _traffic_secret: list Secret.uint8 = [\n Secret.hide #Secret.U8 0x48uy; Secret.hide #Secret.U8 0xc4uy; Secret.hide #Secret.U8 0x30uy; Secret.hide #Secret.U8 0x9buy; Secret.hide #Secret.U8 0x5fuy; Secret.hide #Secret.U8 0x27uy; Secret.hide #Secret.U8 0x52uy; Secret.hide #Secret.U8 0xe8uy;\n Secret.hide #Secret.U8 0x12uy; Secret.hide #Secret.U8 0x7buy; Secret.hide #Secret.U8 0x1uy; Secret.hide #Secret.U8 0x66uy; Secret.hide #Secret.U8 0x5uy; Secret.hide #Secret.U8 0x5auy; Secret.hide #Secret.U8 0x9auy; Secret.hide #Secret.U8 0x56uy;\n Secret.hide #Secret.U8 0xe5uy; Secret.hide #Secret.U8 0xf9uy; Secret.hide #Secret.U8 0x6uy; Secret.hide #Secret.U8 0x31uy; Secret.hide #Secret.U8 0xe0uy; Secret.hide #Secret.U8 0x84uy; Secret.hide #Secret.U8 0x85uy; Secret.hide #Secret.U8 0xe0uy;\n Secret.hide #Secret.U8 0xf8uy; Secret.hide #Secret.U8 0x9euy; Secret.hide #Secret.U8 0x9cuy; Secret.hide #Secret.U8 0xecuy; Secret.hide #Secret.U8 0x4auy; Secret.hide #Secret.U8 0xdeuy; Secret.hide #Secret.U8 0xb6uy; Secret.hide #Secret.U8 0x50uy;\n]", "source": { "project_name": "everquic-crypto", "file_name": "test/QUICTest.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 25, "start_col": 41, "end_line": 30, "end_col": 1 }, "file_context": "module QUICTest\nmodule B = LowStar.Buffer\nmodule U62 = QUIC.UInt62\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule L = FStar.List.Tot\nmodule Secret = QUIC.Secret.Int\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Seq = QUIC.Secret.Seq\nmodule Q = QUIC.State\nmodule QS = QUIC.Spec\n\n(* declassification for post tests *)\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet idx = {\n Q.hash_alg = Spec.Hash.Definitions.SHA2_256;\n Q.aead_alg = Spec.Agile.AEAD.CHACHA20_POLY1305;\n}\n\ninline_for_extraction", "dependencies": { "source_file": "QUICTest.fst", "checked_file": "QUICTest.fst.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.State.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Printf.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked", "C.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Q", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.list (Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.SEC)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.Cons", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "QUIC.Secret.Int.hide", "Lib.IntTypes.PUB", "FStar.UInt8.__uint_to_t", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val _traffic_secret:list Secret.uint8\nlet _traffic_secret:list Secret.uint8 =", "completed_definiton": "[\n Secret.hide #Secret.U8 0x48uy; Secret.hide #Secret.U8 0xc4uy; Secret.hide #Secret.U8 0x30uy;\n Secret.hide #Secret.U8 0x9buy; Secret.hide #Secret.U8 0x5fuy; Secret.hide #Secret.U8 0x27uy;\n Secret.hide #Secret.U8 0x52uy; Secret.hide #Secret.U8 0xe8uy; Secret.hide #Secret.U8 0x12uy;\n Secret.hide #Secret.U8 0x7buy; Secret.hide #Secret.U8 0x1uy; Secret.hide #Secret.U8 0x66uy;\n Secret.hide #Secret.U8 0x5uy; Secret.hide #Secret.U8 0x5auy; Secret.hide #Secret.U8 0x9auy;\n Secret.hide #Secret.U8 0x56uy; Secret.hide #Secret.U8 0xe5uy; Secret.hide #Secret.U8 0xf9uy;\n Secret.hide #Secret.U8 0x6uy; Secret.hide #Secret.U8 0x31uy; Secret.hide #Secret.U8 0xe0uy;\n Secret.hide #Secret.U8 0x84uy; Secret.hide #Secret.U8 0x85uy; Secret.hide #Secret.U8 0xe0uy;\n Secret.hide #Secret.U8 0xf8uy; Secret.hide #Secret.U8 0x9euy; Secret.hide #Secret.U8 0x9cuy;\n Secret.hide #Secret.U8 0xecuy; Secret.hide #Secret.U8 0x4auy; Secret.hide #Secret.U8 0xdeuy;\n Secret.hide #Secret.U8 0xb6uy; Secret.hide #Secret.U8 0x50uy\n]", "isa_cross_project_example": true }, { "file_name": "QUICTest.fst", "name": "QUICTest.idx", "original_source_type": "", "source_type": "val idx : QUIC.State.index", "source_definition": "let idx = {\n Q.hash_alg = Spec.Hash.Definitions.SHA2_256;\n Q.aead_alg = Spec.Agile.AEAD.CHACHA20_POLY1305;\n}", "source": { "project_name": "everquic-crypto", "file_name": "test/QUICTest.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 19, "start_col": 2, "end_line": 20, "end_col": 49 }, "file_context": "module QUICTest\nmodule B = LowStar.Buffer\nmodule U62 = QUIC.UInt62\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule L = FStar.List.Tot\nmodule Secret = QUIC.Secret.Int\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Seq = QUIC.Secret.Seq\nmodule Q = QUIC.State\nmodule QS = QUIC.Spec\n\n(* declassification for post tests *)\nmodule ADMITDeclassify = Lib.RawIntTypes", "dependencies": { "source_file": "QUICTest.fst", "checked_file": "QUICTest.fst.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.State.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Printf.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked", "C.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Q", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "QUIC.State.index", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.State.Mkindex", "Spec.Hash.Definitions.SHA2_256", "Spec.Agile.AEAD.CHACHA20_POLY1305" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let idx =", "completed_definiton": "{ Q.hash_alg = Spec.Hash.Definitions.SHA2_256; Q.aead_alg = Spec.Agile.AEAD.CHACHA20_POLY1305 }", "isa_cross_project_example": true }, { "file_name": "QUICTest.fst", "name": "QUICTest.is_success", "original_source_type": "val is_success (s: string) (e: E.error_code)\n : HST.Stack bool\n (requires (fun _ -> True))\n (ensures (fun h r h' -> h == h' /\\ r == (E.Success? e)))", "source_type": "val is_success (s: string) (e: E.error_code)\n : HST.Stack bool\n (requires (fun _ -> True))\n (ensures (fun h r h' -> h == h' /\\ r == (E.Success? e)))", "source_definition": "let is_success (s: string) (e: E.error_code) : HST.Stack bool\n (requires (fun _ -> True))\n (ensures (fun h r h' -> h == h' /\\ r == (E.Success? e)))\n= PF.print_string \"Performing \";\n PF.print_string s;\n PF.print_string \": \";\n is_success_body e", "source": { "project_name": "everquic-crypto", "file_name": "test/QUICTest.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 86, "start_col": 2, "end_line": 89, "end_col": 19 }, "file_context": "module QUICTest\nmodule B = LowStar.Buffer\nmodule U62 = QUIC.UInt62\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule L = FStar.List.Tot\nmodule Secret = QUIC.Secret.Int\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Seq = QUIC.Secret.Seq\nmodule Q = QUIC.State\nmodule QS = QUIC.Spec\n\n(* declassification for post tests *)\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet idx = {\n Q.hash_alg = Spec.Hash.Definitions.SHA2_256;\n Q.aead_alg = Spec.Agile.AEAD.CHACHA20_POLY1305;\n}\n\ninline_for_extraction\nnoextract\nlet _traffic_secret: list Secret.uint8 = [\n Secret.hide #Secret.U8 0x48uy; Secret.hide #Secret.U8 0xc4uy; Secret.hide #Secret.U8 0x30uy; Secret.hide #Secret.U8 0x9buy; Secret.hide #Secret.U8 0x5fuy; Secret.hide #Secret.U8 0x27uy; Secret.hide #Secret.U8 0x52uy; Secret.hide #Secret.U8 0xe8uy;\n Secret.hide #Secret.U8 0x12uy; Secret.hide #Secret.U8 0x7buy; Secret.hide #Secret.U8 0x1uy; Secret.hide #Secret.U8 0x66uy; Secret.hide #Secret.U8 0x5uy; Secret.hide #Secret.U8 0x5auy; Secret.hide #Secret.U8 0x9auy; Secret.hide #Secret.U8 0x56uy;\n Secret.hide #Secret.U8 0xe5uy; Secret.hide #Secret.U8 0xf9uy; Secret.hide #Secret.U8 0x6uy; Secret.hide #Secret.U8 0x31uy; Secret.hide #Secret.U8 0xe0uy; Secret.hide #Secret.U8 0x84uy; Secret.hide #Secret.U8 0x85uy; Secret.hide #Secret.U8 0xe0uy;\n Secret.hide #Secret.U8 0xf8uy; Secret.hide #Secret.U8 0x9euy; Secret.hide #Secret.U8 0x9cuy; Secret.hide #Secret.U8 0xecuy; Secret.hide #Secret.U8 0x4auy; Secret.hide #Secret.U8 0xdeuy; Secret.hide #Secret.U8 0xb6uy; Secret.hide #Secret.U8 0x50uy;\n]\n\ninline_for_extraction\nnoextract\nlet traffic_secret_length = norm [delta; zeta; iota; primops] (L.length _traffic_secret)\n\nlet traffic_secret_length_correct : squash (traffic_secret_length == L.length _traffic_secret) =\n assert_norm (traffic_secret_length == L.length _traffic_secret)\n\ninline_for_extraction\nnoextract\nlet _plain: list Secret.uint8 = [\n Secret.hide #Secret.U8 0uy;Secret.hide #Secret.U8 1uy;Secret.hide #Secret.U8 2uy;Secret.hide #Secret.U8 3uy;Secret.hide #Secret.U8 4uy;Secret.hide #Secret.U8 5uy;Secret.hide #Secret.U8 6uy;Secret.hide #Secret.U8 7uy;Secret.hide #Secret.U8 8uy;Secret.hide #Secret.U8 9uy;\n]\n\ninline_for_extraction\nnoextract\nlet plain_length = norm [delta; zeta; iota; primops] (L.length _plain)\n\nlet plain_length_correct : squash (plain_length == L.length _plain) =\n assert_norm (plain_length == L.length _plain)\n\nmodule E = EverCrypt.Error\nmodule PF = LowStar.Printf\n\nlet is_success_body (e: E.error_code) : HST.Stack bool\n (requires (fun _ -> True))\n (ensures (fun h r h' -> h == h' /\\ r == (E.Success? e)))\n= match e with\n | E.UnsupportedAlgorithm ->\n PF.print_string \"unsupported algorithm\\n\";\n false\n | E.InvalidKey ->\n PF.print_string \"invalid key\\n\";\n false\n | E.AuthenticationFailure ->\n PF.print_string \"auth failure\\n\";\n false\n | E.InvalidIVLength ->\n PF.print_string \"invalid IV length\\n\";\n false\n | E.DecodeError ->\n PF.print_string \"decode error\\n\";\n false\n | E.Success ->\n PF.print_string \"success\\n\";\n true\n | _ ->\n PF.print_string \"unknown error\\n\";\n false\n\ninline_for_extraction\nnoextract\nlet is_success (s: string) (e: E.error_code) : HST.Stack bool\n (requires (fun _ -> True))", "dependencies": { "source_file": "QUICTest.fst", "checked_file": "QUICTest.fst.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.State.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Printf.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked", "C.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "PF", "full_module": "LowStar.Printf" }, { "abbrev": true, "short_module": "E", "full_module": "EverCrypt.Error" }, { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Q", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: Prims.string -> e: EverCrypt.Error.error_code -> FStar.HyperStack.ST.Stack Prims.bool", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Prims.string", "EverCrypt.Error.error_code", "QUICTest.is_success_body", "Prims.bool", "Prims.unit", "LowStar.Printf.print_string", "FStar.Monotonic.HyperStack.mem", "Prims.l_True", "Prims.l_and", "Prims.eq2", "EverCrypt.Error.uu___is_Success" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val is_success (s: string) (e: E.error_code)\n : HST.Stack bool\n (requires (fun _ -> True))\n (ensures (fun h r h' -> h == h' /\\ r == (E.Success? e)))\nlet is_success (s: string) (e: E.error_code)\n : HST.Stack bool\n (requires (fun _ -> True))\n (ensures (fun h r h' -> h == h' /\\ r == (E.Success? e))) =", "completed_definiton": "PF.print_string \"Performing \";\nPF.print_string s;\nPF.print_string \": \";\nis_success_body e", "isa_cross_project_example": true }, { "file_name": "QUICTest.fst", "name": "QUICTest.used_in_not_unused_in_disjoint", "original_source_type": "val used_in_not_unused_in_disjoint: Prims.unit\n -> HST.Stack unit\n (requires (fun _ -> True))\n (ensures (fun h _ h' -> h' == h /\\ B.loc_disjoint (B.loc_unused_in h) (B.loc_not_unused_in h))\n )", "source_type": "val used_in_not_unused_in_disjoint: Prims.unit\n -> HST.Stack unit\n (requires (fun _ -> True))\n (ensures (fun h _ h' -> h' == h /\\ B.loc_disjoint (B.loc_unused_in h) (B.loc_not_unused_in h))\n )", "source_definition": "let used_in_not_unused_in_disjoint\n ()\n: HST.Stack unit\n (requires (fun _ -> True))\n (ensures (fun h _ h' ->\n h' == h /\\\n B.loc_disjoint (B.loc_unused_in h) (B.loc_not_unused_in h)\n ))\n= let h = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint h", "source": { "project_name": "everquic-crypto", "file_name": "test/QUICTest.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 139, "start_col": 1, "end_line": 140, "end_col": 42 }, "file_context": "module QUICTest\nmodule B = LowStar.Buffer\nmodule U62 = QUIC.UInt62\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule L = FStar.List.Tot\nmodule Secret = QUIC.Secret.Int\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Seq = QUIC.Secret.Seq\nmodule Q = QUIC.State\nmodule QS = QUIC.Spec\n\n(* declassification for post tests *)\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet idx = {\n Q.hash_alg = Spec.Hash.Definitions.SHA2_256;\n Q.aead_alg = Spec.Agile.AEAD.CHACHA20_POLY1305;\n}\n\ninline_for_extraction\nnoextract\nlet _traffic_secret: list Secret.uint8 = [\n Secret.hide #Secret.U8 0x48uy; Secret.hide #Secret.U8 0xc4uy; Secret.hide #Secret.U8 0x30uy; Secret.hide #Secret.U8 0x9buy; Secret.hide #Secret.U8 0x5fuy; Secret.hide #Secret.U8 0x27uy; Secret.hide #Secret.U8 0x52uy; Secret.hide #Secret.U8 0xe8uy;\n Secret.hide #Secret.U8 0x12uy; Secret.hide #Secret.U8 0x7buy; Secret.hide #Secret.U8 0x1uy; Secret.hide #Secret.U8 0x66uy; Secret.hide #Secret.U8 0x5uy; Secret.hide #Secret.U8 0x5auy; Secret.hide #Secret.U8 0x9auy; Secret.hide #Secret.U8 0x56uy;\n Secret.hide #Secret.U8 0xe5uy; Secret.hide #Secret.U8 0xf9uy; Secret.hide #Secret.U8 0x6uy; Secret.hide #Secret.U8 0x31uy; Secret.hide #Secret.U8 0xe0uy; Secret.hide #Secret.U8 0x84uy; Secret.hide #Secret.U8 0x85uy; Secret.hide #Secret.U8 0xe0uy;\n Secret.hide #Secret.U8 0xf8uy; Secret.hide #Secret.U8 0x9euy; Secret.hide #Secret.U8 0x9cuy; Secret.hide #Secret.U8 0xecuy; Secret.hide #Secret.U8 0x4auy; Secret.hide #Secret.U8 0xdeuy; Secret.hide #Secret.U8 0xb6uy; Secret.hide #Secret.U8 0x50uy;\n]\n\ninline_for_extraction\nnoextract\nlet traffic_secret_length = norm [delta; zeta; iota; primops] (L.length _traffic_secret)\n\nlet traffic_secret_length_correct : squash (traffic_secret_length == L.length _traffic_secret) =\n assert_norm (traffic_secret_length == L.length _traffic_secret)\n\ninline_for_extraction\nnoextract\nlet _plain: list Secret.uint8 = [\n Secret.hide #Secret.U8 0uy;Secret.hide #Secret.U8 1uy;Secret.hide #Secret.U8 2uy;Secret.hide #Secret.U8 3uy;Secret.hide #Secret.U8 4uy;Secret.hide #Secret.U8 5uy;Secret.hide #Secret.U8 6uy;Secret.hide #Secret.U8 7uy;Secret.hide #Secret.U8 8uy;Secret.hide #Secret.U8 9uy;\n]\n\ninline_for_extraction\nnoextract\nlet plain_length = norm [delta; zeta; iota; primops] (L.length _plain)\n\nlet plain_length_correct : squash (plain_length == L.length _plain) =\n assert_norm (plain_length == L.length _plain)\n\nmodule E = EverCrypt.Error\nmodule PF = LowStar.Printf\n\nlet is_success_body (e: E.error_code) : HST.Stack bool\n (requires (fun _ -> True))\n (ensures (fun h r h' -> h == h' /\\ r == (E.Success? e)))\n= match e with\n | E.UnsupportedAlgorithm ->\n PF.print_string \"unsupported algorithm\\n\";\n false\n | E.InvalidKey ->\n PF.print_string \"invalid key\\n\";\n false\n | E.AuthenticationFailure ->\n PF.print_string \"auth failure\\n\";\n false\n | E.InvalidIVLength ->\n PF.print_string \"invalid IV length\\n\";\n false\n | E.DecodeError ->\n PF.print_string \"decode error\\n\";\n false\n | E.Success ->\n PF.print_string \"success\\n\";\n true\n | _ ->\n PF.print_string \"unknown error\\n\";\n false\n\ninline_for_extraction\nnoextract\nlet is_success (s: string) (e: E.error_code) : HST.Stack bool\n (requires (fun _ -> True))\n (ensures (fun h r h' -> h == h' /\\ r == (E.Success? e)))\n= PF.print_string \"Performing \";\n PF.print_string s;\n PF.print_string \": \";\n is_success_body e\n\nlet check_is_true_body\n (e: bool)\n: HST.Stack bool\n (requires (fun _ -> True))\n (ensures (fun h r h' -> h == h' /\\ r == e))\n= if e then PF.print_string \"OK\\n\" else PF.print_string \"KO\\n\";\n e\n\ninline_for_extraction\nnoextract\nlet check_is_true\n (s: string)\n (e: bool)\n: HST.Stack bool\n (requires (fun _ -> True))\n (ensures (fun h r h' -> h == h' /\\ r == e))\n= PF.print_string \"Checking \";\n PF.print_string s;\n PF.print_string \": \";\n check_is_true_body e\n\nassume (* implemented in main.c *)\nval is_equal\n (b1: B.buffer U8.t)\n (b2: B.buffer Secret.uint8)\n (len: U32.t)\n: HST.Stack bool\n (requires (fun h ->\n B.live h b1 /\\\n B.live h b2 /\\\n U32.v len <= B.length b1 /\\\n U32.v len <= B.length b2\n ))\n (ensures (fun h res h' ->\n h' == h /\\\n (res == true <==> Seq.slice (Seq.seq_hide #Secret.U8 (B.as_seq h b1)) 0 (U32.v len) == Seq.slice (B.as_seq h b2) 0 (U32.v len))\n ))\n\ninline_for_extraction\nnoextract\nlet used_in_not_unused_in_disjoint\n ()\n: HST.Stack unit\n (requires (fun _ -> True))\n (ensures (fun h _ h' ->\n h' == h /\\\n B.loc_disjoint (B.loc_unused_in h) (B.loc_not_unused_in h)", "dependencies": { "source_file": "QUICTest.fst", "checked_file": "QUICTest.fst.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.State.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Printf.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked", "C.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "PF", "full_module": "LowStar.Printf" }, { "abbrev": true, "short_module": "E", "full_module": "EverCrypt.Error" }, { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Q", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Prims.unit", "LowStar.Monotonic.Buffer.loc_unused_in_not_unused_in_disjoint", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "Prims.l_True", "Prims.l_and", "Prims.eq2", "LowStar.Monotonic.Buffer.loc_disjoint", "LowStar.Monotonic.Buffer.loc_unused_in", "LowStar.Monotonic.Buffer.loc_not_unused_in" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val used_in_not_unused_in_disjoint: Prims.unit\n -> HST.Stack unit\n (requires (fun _ -> True))\n (ensures (fun h _ h' -> h' == h /\\ B.loc_disjoint (B.loc_unused_in h) (B.loc_not_unused_in h))\n )\nlet used_in_not_unused_in_disjoint ()\n : HST.Stack unit\n (requires (fun _ -> True))\n (ensures (fun h _ h' -> h' == h /\\ B.loc_disjoint (B.loc_unused_in h) (B.loc_not_unused_in h))\n ) =", "completed_definiton": "let h = HST.get () in\nB.loc_unused_in_not_unused_in_disjoint h", "isa_cross_project_example": true }, { "file_name": "QUICTest.fst", "name": "QUICTest.check_is_true", "original_source_type": "val check_is_true (s: string) (e: bool)\n : HST.Stack bool (requires (fun _ -> True)) (ensures (fun h r h' -> h == h' /\\ r == e))", "source_type": "val check_is_true (s: string) (e: bool)\n : HST.Stack bool (requires (fun _ -> True)) (ensures (fun h r h' -> h == h' /\\ r == e))", "source_definition": "let check_is_true\n (s: string)\n (e: bool)\n: HST.Stack bool\n (requires (fun _ -> True))\n (ensures (fun h r h' -> h == h' /\\ r == e))\n= PF.print_string \"Checking \";\n PF.print_string s;\n PF.print_string \": \";\n check_is_true_body e", "source": { "project_name": "everquic-crypto", "file_name": "test/QUICTest.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 107, "start_col": 2, "end_line": 110, "end_col": 22 }, "file_context": "module QUICTest\nmodule B = LowStar.Buffer\nmodule U62 = QUIC.UInt62\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule L = FStar.List.Tot\nmodule Secret = QUIC.Secret.Int\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Seq = QUIC.Secret.Seq\nmodule Q = QUIC.State\nmodule QS = QUIC.Spec\n\n(* declassification for post tests *)\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet idx = {\n Q.hash_alg = Spec.Hash.Definitions.SHA2_256;\n Q.aead_alg = Spec.Agile.AEAD.CHACHA20_POLY1305;\n}\n\ninline_for_extraction\nnoextract\nlet _traffic_secret: list Secret.uint8 = [\n Secret.hide #Secret.U8 0x48uy; Secret.hide #Secret.U8 0xc4uy; Secret.hide #Secret.U8 0x30uy; Secret.hide #Secret.U8 0x9buy; Secret.hide #Secret.U8 0x5fuy; Secret.hide #Secret.U8 0x27uy; Secret.hide #Secret.U8 0x52uy; Secret.hide #Secret.U8 0xe8uy;\n Secret.hide #Secret.U8 0x12uy; Secret.hide #Secret.U8 0x7buy; Secret.hide #Secret.U8 0x1uy; Secret.hide #Secret.U8 0x66uy; Secret.hide #Secret.U8 0x5uy; Secret.hide #Secret.U8 0x5auy; Secret.hide #Secret.U8 0x9auy; Secret.hide #Secret.U8 0x56uy;\n Secret.hide #Secret.U8 0xe5uy; Secret.hide #Secret.U8 0xf9uy; Secret.hide #Secret.U8 0x6uy; Secret.hide #Secret.U8 0x31uy; Secret.hide #Secret.U8 0xe0uy; Secret.hide #Secret.U8 0x84uy; Secret.hide #Secret.U8 0x85uy; Secret.hide #Secret.U8 0xe0uy;\n Secret.hide #Secret.U8 0xf8uy; Secret.hide #Secret.U8 0x9euy; Secret.hide #Secret.U8 0x9cuy; Secret.hide #Secret.U8 0xecuy; Secret.hide #Secret.U8 0x4auy; Secret.hide #Secret.U8 0xdeuy; Secret.hide #Secret.U8 0xb6uy; Secret.hide #Secret.U8 0x50uy;\n]\n\ninline_for_extraction\nnoextract\nlet traffic_secret_length = norm [delta; zeta; iota; primops] (L.length _traffic_secret)\n\nlet traffic_secret_length_correct : squash (traffic_secret_length == L.length _traffic_secret) =\n assert_norm (traffic_secret_length == L.length _traffic_secret)\n\ninline_for_extraction\nnoextract\nlet _plain: list Secret.uint8 = [\n Secret.hide #Secret.U8 0uy;Secret.hide #Secret.U8 1uy;Secret.hide #Secret.U8 2uy;Secret.hide #Secret.U8 3uy;Secret.hide #Secret.U8 4uy;Secret.hide #Secret.U8 5uy;Secret.hide #Secret.U8 6uy;Secret.hide #Secret.U8 7uy;Secret.hide #Secret.U8 8uy;Secret.hide #Secret.U8 9uy;\n]\n\ninline_for_extraction\nnoextract\nlet plain_length = norm [delta; zeta; iota; primops] (L.length _plain)\n\nlet plain_length_correct : squash (plain_length == L.length _plain) =\n assert_norm (plain_length == L.length _plain)\n\nmodule E = EverCrypt.Error\nmodule PF = LowStar.Printf\n\nlet is_success_body (e: E.error_code) : HST.Stack bool\n (requires (fun _ -> True))\n (ensures (fun h r h' -> h == h' /\\ r == (E.Success? e)))\n= match e with\n | E.UnsupportedAlgorithm ->\n PF.print_string \"unsupported algorithm\\n\";\n false\n | E.InvalidKey ->\n PF.print_string \"invalid key\\n\";\n false\n | E.AuthenticationFailure ->\n PF.print_string \"auth failure\\n\";\n false\n | E.InvalidIVLength ->\n PF.print_string \"invalid IV length\\n\";\n false\n | E.DecodeError ->\n PF.print_string \"decode error\\n\";\n false\n | E.Success ->\n PF.print_string \"success\\n\";\n true\n | _ ->\n PF.print_string \"unknown error\\n\";\n false\n\ninline_for_extraction\nnoextract\nlet is_success (s: string) (e: E.error_code) : HST.Stack bool\n (requires (fun _ -> True))\n (ensures (fun h r h' -> h == h' /\\ r == (E.Success? e)))\n= PF.print_string \"Performing \";\n PF.print_string s;\n PF.print_string \": \";\n is_success_body e\n\nlet check_is_true_body\n (e: bool)\n: HST.Stack bool\n (requires (fun _ -> True))\n (ensures (fun h r h' -> h == h' /\\ r == e))\n= if e then PF.print_string \"OK\\n\" else PF.print_string \"KO\\n\";\n e\n\ninline_for_extraction\nnoextract\nlet check_is_true\n (s: string)\n (e: bool)\n: HST.Stack bool\n (requires (fun _ -> True))", "dependencies": { "source_file": "QUICTest.fst", "checked_file": "QUICTest.fst.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.State.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Printf.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked", "C.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "PF", "full_module": "LowStar.Printf" }, { "abbrev": true, "short_module": "E", "full_module": "EverCrypt.Error" }, { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Q", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: Prims.string -> e: Prims.bool -> FStar.HyperStack.ST.Stack Prims.bool", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Prims.string", "Prims.bool", "QUICTest.check_is_true_body", "Prims.unit", "LowStar.Printf.print_string", "FStar.Monotonic.HyperStack.mem", "Prims.l_True", "Prims.l_and", "Prims.eq2" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val check_is_true (s: string) (e: bool)\n : HST.Stack bool (requires (fun _ -> True)) (ensures (fun h r h' -> h == h' /\\ r == e))\nlet check_is_true (s: string) (e: bool)\n : HST.Stack bool (requires (fun _ -> True)) (ensures (fun h r h' -> h == h' /\\ r == e)) =", "completed_definiton": "PF.print_string \"Checking \";\nPF.print_string s;\nPF.print_string \": \";\ncheck_is_true_body e", "isa_cross_project_example": true }, { "file_name": "QUICTest.fst", "name": "QUICTest.check_is_true_body", "original_source_type": "val check_is_true_body (e: bool)\n : HST.Stack bool (requires (fun _ -> True)) (ensures (fun h r h' -> h == h' /\\ r == e))", "source_type": "val check_is_true_body (e: bool)\n : HST.Stack bool (requires (fun _ -> True)) (ensures (fun h r h' -> h == h' /\\ r == e))", "source_definition": "let check_is_true_body\n (e: bool)\n: HST.Stack bool\n (requires (fun _ -> True))\n (ensures (fun h r h' -> h == h' /\\ r == e))\n= if e then PF.print_string \"OK\\n\" else PF.print_string \"KO\\n\";\n e", "source": { "project_name": "everquic-crypto", "file_name": "test/QUICTest.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 96, "start_col": 2, "end_line": 97, "end_col": 3 }, "file_context": "module QUICTest\nmodule B = LowStar.Buffer\nmodule U62 = QUIC.UInt62\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule L = FStar.List.Tot\nmodule Secret = QUIC.Secret.Int\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Seq = QUIC.Secret.Seq\nmodule Q = QUIC.State\nmodule QS = QUIC.Spec\n\n(* declassification for post tests *)\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet idx = {\n Q.hash_alg = Spec.Hash.Definitions.SHA2_256;\n Q.aead_alg = Spec.Agile.AEAD.CHACHA20_POLY1305;\n}\n\ninline_for_extraction\nnoextract\nlet _traffic_secret: list Secret.uint8 = [\n Secret.hide #Secret.U8 0x48uy; Secret.hide #Secret.U8 0xc4uy; Secret.hide #Secret.U8 0x30uy; Secret.hide #Secret.U8 0x9buy; Secret.hide #Secret.U8 0x5fuy; Secret.hide #Secret.U8 0x27uy; Secret.hide #Secret.U8 0x52uy; Secret.hide #Secret.U8 0xe8uy;\n Secret.hide #Secret.U8 0x12uy; Secret.hide #Secret.U8 0x7buy; Secret.hide #Secret.U8 0x1uy; Secret.hide #Secret.U8 0x66uy; Secret.hide #Secret.U8 0x5uy; Secret.hide #Secret.U8 0x5auy; Secret.hide #Secret.U8 0x9auy; Secret.hide #Secret.U8 0x56uy;\n Secret.hide #Secret.U8 0xe5uy; Secret.hide #Secret.U8 0xf9uy; Secret.hide #Secret.U8 0x6uy; Secret.hide #Secret.U8 0x31uy; Secret.hide #Secret.U8 0xe0uy; Secret.hide #Secret.U8 0x84uy; Secret.hide #Secret.U8 0x85uy; Secret.hide #Secret.U8 0xe0uy;\n Secret.hide #Secret.U8 0xf8uy; Secret.hide #Secret.U8 0x9euy; Secret.hide #Secret.U8 0x9cuy; Secret.hide #Secret.U8 0xecuy; Secret.hide #Secret.U8 0x4auy; Secret.hide #Secret.U8 0xdeuy; Secret.hide #Secret.U8 0xb6uy; Secret.hide #Secret.U8 0x50uy;\n]\n\ninline_for_extraction\nnoextract\nlet traffic_secret_length = norm [delta; zeta; iota; primops] (L.length _traffic_secret)\n\nlet traffic_secret_length_correct : squash (traffic_secret_length == L.length _traffic_secret) =\n assert_norm (traffic_secret_length == L.length _traffic_secret)\n\ninline_for_extraction\nnoextract\nlet _plain: list Secret.uint8 = [\n Secret.hide #Secret.U8 0uy;Secret.hide #Secret.U8 1uy;Secret.hide #Secret.U8 2uy;Secret.hide #Secret.U8 3uy;Secret.hide #Secret.U8 4uy;Secret.hide #Secret.U8 5uy;Secret.hide #Secret.U8 6uy;Secret.hide #Secret.U8 7uy;Secret.hide #Secret.U8 8uy;Secret.hide #Secret.U8 9uy;\n]\n\ninline_for_extraction\nnoextract\nlet plain_length = norm [delta; zeta; iota; primops] (L.length _plain)\n\nlet plain_length_correct : squash (plain_length == L.length _plain) =\n assert_norm (plain_length == L.length _plain)\n\nmodule E = EverCrypt.Error\nmodule PF = LowStar.Printf\n\nlet is_success_body (e: E.error_code) : HST.Stack bool\n (requires (fun _ -> True))\n (ensures (fun h r h' -> h == h' /\\ r == (E.Success? e)))\n= match e with\n | E.UnsupportedAlgorithm ->\n PF.print_string \"unsupported algorithm\\n\";\n false\n | E.InvalidKey ->\n PF.print_string \"invalid key\\n\";\n false\n | E.AuthenticationFailure ->\n PF.print_string \"auth failure\\n\";\n false\n | E.InvalidIVLength ->\n PF.print_string \"invalid IV length\\n\";\n false\n | E.DecodeError ->\n PF.print_string \"decode error\\n\";\n false\n | E.Success ->\n PF.print_string \"success\\n\";\n true\n | _ ->\n PF.print_string \"unknown error\\n\";\n false\n\ninline_for_extraction\nnoextract\nlet is_success (s: string) (e: E.error_code) : HST.Stack bool\n (requires (fun _ -> True))\n (ensures (fun h r h' -> h == h' /\\ r == (E.Success? e)))\n= PF.print_string \"Performing \";\n PF.print_string s;\n PF.print_string \": \";\n is_success_body e\n\nlet check_is_true_body\n (e: bool)\n: HST.Stack bool\n (requires (fun _ -> True))", "dependencies": { "source_file": "QUICTest.fst", "checked_file": "QUICTest.fst.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.State.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Printf.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked", "C.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "PF", "full_module": "LowStar.Printf" }, { "abbrev": true, "short_module": "E", "full_module": "EverCrypt.Error" }, { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Q", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "e: Prims.bool -> FStar.HyperStack.ST.Stack Prims.bool", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Prims.bool", "Prims.unit", "LowStar.Printf.print_string", "FStar.Monotonic.HyperStack.mem", "Prims.l_True", "Prims.l_and", "Prims.eq2" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val check_is_true_body (e: bool)\n : HST.Stack bool (requires (fun _ -> True)) (ensures (fun h r h' -> h == h' /\\ r == e))\nlet check_is_true_body (e: bool)\n : HST.Stack bool (requires (fun _ -> True)) (ensures (fun h r h' -> h == h' /\\ r == e)) =", "completed_definiton": "if e then PF.print_string \"OK\\n\" else PF.print_string \"KO\\n\";\ne", "isa_cross_project_example": true }, { "file_name": "QUICTest.fst", "name": "QUICTest.is_success_body", "original_source_type": "val is_success_body (e: E.error_code)\n : HST.Stack bool\n (requires (fun _ -> True))\n (ensures (fun h r h' -> h == h' /\\ r == (E.Success? e)))", "source_type": "val is_success_body (e: E.error_code)\n : HST.Stack bool\n (requires (fun _ -> True))\n (ensures (fun h r h' -> h == h' /\\ r == (E.Success? e)))", "source_definition": "let is_success_body (e: E.error_code) : HST.Stack bool\n (requires (fun _ -> True))\n (ensures (fun h r h' -> h == h' /\\ r == (E.Success? e)))\n= match e with\n | E.UnsupportedAlgorithm ->\n PF.print_string \"unsupported algorithm\\n\";\n false\n | E.InvalidKey ->\n PF.print_string \"invalid key\\n\";\n false\n | E.AuthenticationFailure ->\n PF.print_string \"auth failure\\n\";\n false\n | E.InvalidIVLength ->\n PF.print_string \"invalid IV length\\n\";\n false\n | E.DecodeError ->\n PF.print_string \"decode error\\n\";\n false\n | E.Success ->\n PF.print_string \"success\\n\";\n true\n | _ ->\n PF.print_string \"unknown error\\n\";\n false", "source": { "project_name": "everquic-crypto", "file_name": "test/QUICTest.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 58, "start_col": 2, "end_line": 79, "end_col": 9 }, "file_context": "module QUICTest\nmodule B = LowStar.Buffer\nmodule U62 = QUIC.UInt62\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule L = FStar.List.Tot\nmodule Secret = QUIC.Secret.Int\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Seq = QUIC.Secret.Seq\nmodule Q = QUIC.State\nmodule QS = QUIC.Spec\n\n(* declassification for post tests *)\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet idx = {\n Q.hash_alg = Spec.Hash.Definitions.SHA2_256;\n Q.aead_alg = Spec.Agile.AEAD.CHACHA20_POLY1305;\n}\n\ninline_for_extraction\nnoextract\nlet _traffic_secret: list Secret.uint8 = [\n Secret.hide #Secret.U8 0x48uy; Secret.hide #Secret.U8 0xc4uy; Secret.hide #Secret.U8 0x30uy; Secret.hide #Secret.U8 0x9buy; Secret.hide #Secret.U8 0x5fuy; Secret.hide #Secret.U8 0x27uy; Secret.hide #Secret.U8 0x52uy; Secret.hide #Secret.U8 0xe8uy;\n Secret.hide #Secret.U8 0x12uy; Secret.hide #Secret.U8 0x7buy; Secret.hide #Secret.U8 0x1uy; Secret.hide #Secret.U8 0x66uy; Secret.hide #Secret.U8 0x5uy; Secret.hide #Secret.U8 0x5auy; Secret.hide #Secret.U8 0x9auy; Secret.hide #Secret.U8 0x56uy;\n Secret.hide #Secret.U8 0xe5uy; Secret.hide #Secret.U8 0xf9uy; Secret.hide #Secret.U8 0x6uy; Secret.hide #Secret.U8 0x31uy; Secret.hide #Secret.U8 0xe0uy; Secret.hide #Secret.U8 0x84uy; Secret.hide #Secret.U8 0x85uy; Secret.hide #Secret.U8 0xe0uy;\n Secret.hide #Secret.U8 0xf8uy; Secret.hide #Secret.U8 0x9euy; Secret.hide #Secret.U8 0x9cuy; Secret.hide #Secret.U8 0xecuy; Secret.hide #Secret.U8 0x4auy; Secret.hide #Secret.U8 0xdeuy; Secret.hide #Secret.U8 0xb6uy; Secret.hide #Secret.U8 0x50uy;\n]\n\ninline_for_extraction\nnoextract\nlet traffic_secret_length = norm [delta; zeta; iota; primops] (L.length _traffic_secret)\n\nlet traffic_secret_length_correct : squash (traffic_secret_length == L.length _traffic_secret) =\n assert_norm (traffic_secret_length == L.length _traffic_secret)\n\ninline_for_extraction\nnoextract\nlet _plain: list Secret.uint8 = [\n Secret.hide #Secret.U8 0uy;Secret.hide #Secret.U8 1uy;Secret.hide #Secret.U8 2uy;Secret.hide #Secret.U8 3uy;Secret.hide #Secret.U8 4uy;Secret.hide #Secret.U8 5uy;Secret.hide #Secret.U8 6uy;Secret.hide #Secret.U8 7uy;Secret.hide #Secret.U8 8uy;Secret.hide #Secret.U8 9uy;\n]\n\ninline_for_extraction\nnoextract\nlet plain_length = norm [delta; zeta; iota; primops] (L.length _plain)\n\nlet plain_length_correct : squash (plain_length == L.length _plain) =\n assert_norm (plain_length == L.length _plain)\n\nmodule E = EverCrypt.Error\nmodule PF = LowStar.Printf\n\nlet is_success_body (e: E.error_code) : HST.Stack bool\n (requires (fun _ -> True))", "dependencies": { "source_file": "QUICTest.fst", "checked_file": "QUICTest.fst.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.State.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Printf.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked", "C.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "PF", "full_module": "LowStar.Printf" }, { "abbrev": true, "short_module": "E", "full_module": "EverCrypt.Error" }, { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Q", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "L", "full_module": "FStar.List.Tot" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "e: EverCrypt.Error.error_code -> FStar.HyperStack.ST.Stack Prims.bool", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "EverCrypt.Error.error_code", "Prims.bool", "Prims.unit", "LowStar.Printf.print_string", "FStar.Monotonic.HyperStack.mem", "Prims.l_True", "Prims.l_and", "Prims.eq2", "EverCrypt.Error.uu___is_Success" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val is_success_body (e: E.error_code)\n : HST.Stack bool\n (requires (fun _ -> True))\n (ensures (fun h r h' -> h == h' /\\ r == (E.Success? e)))\nlet is_success_body (e: E.error_code)\n : HST.Stack bool\n (requires (fun _ -> True))\n (ensures (fun h r h' -> h == h' /\\ r == (E.Success? e))) =", "completed_definiton": "match e with\n| E.UnsupportedAlgorithm ->\n PF.print_string \"unsupported algorithm\\n\";\n false\n| E.InvalidKey ->\n PF.print_string \"invalid key\\n\";\n false\n| E.AuthenticationFailure ->\n PF.print_string \"auth failure\\n\";\n false\n| E.InvalidIVLength ->\n PF.print_string \"invalid IV length\\n\";\n false\n| E.DecodeError ->\n PF.print_string \"decode error\\n\";\n false\n| E.Success ->\n PF.print_string \"success\\n\";\n true\n| _ ->\n PF.print_string \"unknown error\\n\";\n false", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.parse_packet_number_opt_kind", "original_source_type": "", "source_type": "val parse_packet_number_opt_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 46, "start_col": 35, "end_line": 46, "end_col": 65 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let parse_packet_number_opt_kind =", "completed_definiton": "LP.strong_parser_kind 0 4 None", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.protected_bits_key_phase", "original_source_type": "val protected_bits_key_phase (x: bitfield 5) : Tot bool", "source_type": "val protected_bits_key_phase (x: bitfield 5) : Tot bool", "source_definition": "let protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 102, "start_col": 2, "end_line": 102, "end_col": 38 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: QUIC.Spec.Base.bitfield 5 -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bitfield", "Prims.op_Equality", "FStar.UInt8.t", "LowParse.BitFields.__proj__Mkuint_t__item__get_bitfield", "LowParse.BitFields.uint8", "FStar.UInt8.__uint_to_t", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val protected_bits_key_phase (x: bitfield 5) : Tot bool\nlet protected_bits_key_phase (x: bitfield 5) : Tot bool =", "completed_definiton": "BF.uint8.BF.get_bitfield x 2 3 = 1uy", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.packet_number_opt", "original_source_type": "val packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n : Tot Type0", "source_type": "val packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n : Tot Type0", "source_definition": "let packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 42, "start_col": 2, "end_line": 44, "end_col": 49 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n cid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n h: QUIC.Spec.Header.Public.header' cid_len\n -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.is_retry", "Prims.unit", "Prims.bool", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "QUIC.Spec.Header.Parse.get_pn_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n : Tot Type0\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n : Tot Type0 =", "completed_definiton": "if Public.is_retry h then unit else PN.packet_number_t' last (get_pn_length h)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.get_pn_length", "original_source_type": "val get_pn_length (h: Public.header) : Tot PN.packet_number_length_t", "source_type": "val get_pn_length (h: Public.header) : Tot PN.packet_number_length_t", "source_definition": "let get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 22, "start_col": 2, "end_line": 22, "end_col": 75 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Public.header -> QUIC.Spec.PacketNumber.Base.packet_number_length_t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Public.header", "QUIC.Spec.Header.Parse.protected_bits_pn_length", "QUIC.Spec.Header.Public.uu___is_PShort", "QUIC.Spec.Header.Public.get_protected_bits", "QUIC.Spec.PacketNumber.Base.packet_number_length_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val get_pn_length (h: Public.header) : Tot PN.packet_number_length_t\nlet get_pn_length (h: Public.header) : Tot PN.packet_number_length_t =", "completed_definiton": "protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.get_reserved_bits", "original_source_type": "val get_reserved_bits (h: Public.header) : Tot (bitfield 2)", "source_type": "val get_reserved_bits (h: Public.header) : Tot (bitfield 2)", "source_definition": "let get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 35, "start_col": 2, "end_line": 35, "end_col": 74 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Public.header -> QUIC.Spec.Base.bitfield 2", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Public.header", "QUIC.Spec.Header.Parse.protected_bits_reserved", "QUIC.Spec.Header.Public.uu___is_PShort", "QUIC.Spec.Header.Public.get_protected_bits", "QUIC.Spec.Base.bitfield" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val get_reserved_bits (h: Public.header) : Tot (bitfield 2)\nlet get_reserved_bits (h: Public.header) : Tot (bitfield 2) =", "completed_definiton": "protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.parse_header_prop", "original_source_type": "val parse_header_prop (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t) (m: header)\n : GTot bool", "source_type": "val parse_header_prop (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t) (m: header)\n : GTot bool", "source_definition": "let parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 90, "start_col": 2, "end_line": 91, "end_col": 27 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n m: QUIC.Spec.Header.Base.header\n -> Prims.GTot Prims.bool", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Base.header", "Prims.op_AmpAmp", "QUIC.Spec.Header.Parse.short_dcid_len_prop", "QUIC.Spec.Header.Parse.packet_number_prop", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_header_prop (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t) (m: header)\n : GTot bool\nlet parse_header_prop (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t) (m: header)\n : GTot bool =", "completed_definiton": "short_dcid_len_prop short_dcid_len m && packet_number_prop last m", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.short_dcid_len_prop", "original_source_type": "val short_dcid_len_prop (short_dcid_len: short_dcid_len_t) (h: header) : Tot bool", "source_type": "val short_dcid_len_prop (short_dcid_len: short_dcid_len_t) (h: header) : Tot bool", "source_definition": "let short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 80, "start_col": 2, "end_line": 82, "end_col": 11 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "short_dcid_len: QUIC.Spec.Base.short_dcid_len_t -> h: QUIC.Spec.Header.Base.header -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.Header.Base.header", "QUIC.Spec.Header.Base.uu___is_MShort", "Prims.op_Equality", "Prims.int", "Prims.l_or", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "FStar.UInt.size", "FStar.UInt32.n", "QUIC.Spec.Header.Base.dcid_len", "FStar.UInt32.v", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val short_dcid_len_prop (short_dcid_len: short_dcid_len_t) (h: header) : Tot bool\nlet short_dcid_len_prop (short_dcid_len: short_dcid_len_t) (h: header) : Tot bool =", "completed_definiton": "if MShort? h then dcid_len h = U32.v short_dcid_len else true", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.lp_parse_header", "original_source_type": "val lp_parse_header (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))", "source_type": "val lp_parse_header (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))", "source_definition": "let lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 310, "start_col": 2, "end_line": 315, "end_col": 38 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t\n -> LowParse.Spec.Base.parser (QUIC.Spec.Header.Parse.parse_header_kind short_dcid_len)\n (QUIC.Spec.Header.Parse.header' short_dcid_len last)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "LowParse.Spec.Combinators.parse_synth", "QUIC.Spec.Header.Parse.parse_header_kind", "Prims.dtuple2", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "QUIC.Spec.Header.Parse.header'", "QUIC.Spec.Header.Parse.parse_header_dtuple", "QUIC.Spec.Header.Parse.synth_header", "LowParse.Spec.Base.parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lp_parse_header (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\nlet lp_parse_header (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last)) =", "completed_definiton": "LP.parse_synth #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.serialize_header", "original_source_type": "val serialize_header (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Tot (LP.serializer (lp_parse_header short_dcid_len last))", "source_type": "val serialize_header (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Tot (LP.serializer (lp_parse_header short_dcid_len last))", "source_definition": "let serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 425, "start_col": 2, "end_line": 433, "end_col": 6 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t\n -> LowParse.Spec.Base.serializer (QUIC.Spec.Header.Parse.lp_parse_header short_dcid_len last)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "LowParse.Spec.Combinators.serialize_synth", "QUIC.Spec.Header.Parse.parse_header_kind", "Prims.dtuple2", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "QUIC.Spec.Header.Parse.header'", "QUIC.Spec.Header.Parse.parse_header_dtuple", "QUIC.Spec.Header.Parse.synth_header", "QUIC.Spec.Header.Parse.serialize_header_dtuple", "QUIC.Spec.Header.Parse.synth_header_recip", "LowParse.Spec.Base.serializer", "QUIC.Spec.Header.Parse.lp_parse_header" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_header (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Tot (LP.serializer (lp_parse_header short_dcid_len last))\nlet serialize_header (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Tot (LP.serializer (lp_parse_header short_dcid_len last)) =", "completed_definiton": "LP.serialize_synth #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.packet_number_prop", "original_source_type": "val packet_number_prop (last: PN.last_packet_number_t) (h: header) : GTot bool", "source_type": "val packet_number_prop (last: PN.last_packet_number_t) (h: header) : GTot bool", "source_definition": "let packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 70, "start_col": 2, "end_line": 72, "end_col": 11 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "last: QUIC.Spec.PacketNumber.Base.last_packet_number_t -> h: QUIC.Spec.Header.Base.header\n -> Prims.GTot Prims.bool", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Base.header", "Prims.op_Negation", "QUIC.Spec.Header.Base.is_retry", "QUIC.Spec.PacketNumber.Base.in_window", "Prims.op_Subtraction", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "QUIC.Spec.Header.Base.pn_length", "Lib.IntTypes.U64", "QUIC.Spec.Header.Base.packet_number", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val packet_number_prop (last: PN.last_packet_number_t) (h: header) : GTot bool\nlet packet_number_prop (last: PN.last_packet_number_t) (h: header) : GTot bool =", "completed_definiton": "if not (is_retry h)\nthen PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\nelse true", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.serialize_header_eq_2", "original_source_type": "val serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n : Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n (let phpn:dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) =\n synth_header_recip short_dcid_len last h\n in\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn))", "source_type": "val serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n : Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n (let phpn:dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) =\n synth_header_recip short_dcid_len last h\n in\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn))", "source_definition": "let serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_1 short_dcid_len last h", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 509, "start_col": 2, "end_line": 509, "end_col": 45 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h\n\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n h: QUIC.Spec.Header.Parse.header' short_dcid_len last\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Base.serialize (QUIC.Spec.Header.Parse.serialize_header short_dcid_len last) h ==\n (let phpn = QUIC.Spec.Header.Parse.synth_header_recip short_dcid_len last h in\n LowParse.Spec.Base.serialize (QUIC.Spec.Header.Parse.serialize_header_dtuple short_dcid_len\n last)\n phpn))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Parse.header'", "QUIC.Spec.Header.Parse.serialize_header_eq_1", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "LowParse.Bytes.bytes", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Parse.parse_header_kind", "QUIC.Spec.Header.Parse.lp_parse_header", "QUIC.Spec.Header.Parse.serialize_header", "Prims.dtuple2", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "QUIC.Spec.Header.Parse.parse_header_dtuple", "QUIC.Spec.Header.Parse.serialize_header_dtuple", "QUIC.Spec.Header.Parse.synth_header_recip", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n : Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n (let phpn:dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) =\n synth_header_recip short_dcid_len last h\n in\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn))\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n : Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n (let phpn:dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) =\n synth_header_recip short_dcid_len last h\n in\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn)) =", "completed_definiton": "serialize_header_eq_1 short_dcid_len last h", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.parse_header_dtuple_eq_1", "original_source_type": "val parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n : Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2 #_\n #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_\n #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x)", "source_type": "val parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n : Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2 #_\n #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_\n #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x)", "source_definition": "let parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 332, "start_col": 2, "end_line": 337, "end_col": 5 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n x: QUIC.Spec.Base.bytes\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Base.parse (QUIC.Spec.Header.Parse.parse_header_dtuple short_dcid_len last) x ==\n LowParse.Spec.Combinators.bare_parse_dtuple2 (QUIC.Spec.Header.Public.parse_header short_dcid_len\n )\n (QUIC.Spec.Header.Parse.parse_packet_number_opt short_dcid_len last)\n x)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Base.bytes", "LowParse.Spec.Combinators.parse_dtuple2_eq'", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Parse.parse_packet_number_opt_kind", "QUIC.Spec.Header.Parse.packet_number_opt", "QUIC.Spec.Header.Parse.parse_packet_number_opt", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "FStar.Pervasives.Native.option", "FStar.Pervasives.Native.tuple2", "Prims.dtuple2", "LowParse.Spec.Base.consumed_length", "LowParse.Spec.Base.parse", "QUIC.Spec.Header.Parse.parse_header_dtuple", "LowParse.Spec.Combinators.bare_parse_dtuple2", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n : Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2 #_\n #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_\n #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x)\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n : Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2 #_\n #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_\n #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x) =", "completed_definiton": "LP.parse_dtuple2_eq' #_\n #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_\n #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.pn_offset", "original_source_type": "val pn_offset: (h: header { ~ (is_retry h) }) -> GTot (n: nat { 0 < n /\\ n + Secret.v (pn_length h) == header_len h })", "source_type": "val pn_offset: (h: header { ~ (is_retry h) }) -> GTot (n: nat { 0 < n /\\ n + Secret.v (pn_length h) == header_len h })", "source_definition": "let pn_offset\n h\n= pn_offset_prop h;\n pn_offset' h", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 690, "start_col": 2, "end_line": 691, "end_col": 14 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h\n\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_1 short_dcid_len last h\n\nlet serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_2 short_dcid_len last h;\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n serialize_header_dtuple_eq short_dcid_len last phpn\n\n#push-options \"--z3rlimit 32\"\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n LP.serialize (Public.serialize_header short_dcid_len) ph `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn \n )))\n= serialize_header_eq_3 short_dcid_len last h\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n: Lemma\n (requires (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h\n ))\n (ensures (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h == LP.serialize (serialize_header short_dcid_len2 last2) h\n ))\n= serialize_header_eq short_dcid_len1 last1 h;\n serialize_header_eq short_dcid_len2 last2 h;\n let (| ph, pn |) = synth_header_recip short_dcid_len1 last1 h in\n Public.serialize_header_ext short_dcid_len1 short_dcid_len2 ph;\n if not (is_retry h)\n then PN.serialize_packet_number_ext last1 last2 (pn_length h) pn\n\nlet last_packet_number\n (h: header)\n: GTot PN.last_packet_number_t\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in if Secret.v pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\nlet in_window_last_packet_number\n (h: header)\n: Lemma\n ((~ (is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) (Secret.v (last_packet_number h)) (Secret.v (packet_number h)))\n= ()\n\n(* Fulfill the interface now *)\n\nlet header_len'\n (h: header)\n: GTot nat\n= \n let s = serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h) in\n LP.serialize_length s h;\n Seq.length (LP.serialize s h)\n\nlet header_len'_correct\n (gh: header)\n: Lemma\n (header_len gh == header_len' gh)\n [SMTPat (header_len gh)]\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let cid_len = U32.uint_to_t (dcid_len gh) in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n serialize_header_eq cid_len last gh;\n Public.header_len'_correct cid_len ph;\n if is_retry gh\n then ()\n else begin\n let pn_len = pn_length gh in\n PN.parse_packet_number_kind'_correct last pn_len;\n LP.serialize_length\n #(PN.parse_packet_number_kind' pn_len)\n #_\n #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len))\n (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len))\n pn'\n end\n\nlet format_header\n h\n= LP.serialize (serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\nlet format_header_is_short\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_short cid_len ph\n\nlet format_header_is_retry\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_retry cid_len ph\n\n#push-options \"--z3rlimit 64\"\n\nlet format_header_pn_length\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n let x = Seq.index (format_header h) 0 in\n assert (x == Seq.index (LP.serialize (Public.serialize_header cid_len) ph) 0);\n assert (Public.PShort? ph == MShort? h);\n Public.serialize_get_protected_bits cid_len ph;\n BF.get_bitfield_get_bitfield #8 (U8.v x) 0 (if Public.PShort? ph then 5 else 4) 0 2;\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield x 0 2) == Secret.v (pn_length h) - 1)\n\n#pop-options\n\nlet pn_offset'\n (h: header)\n: GTot nat\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Seq.length (LP.serialize (Public.serialize_header cid_len) ph)\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet pn_offset_prop\n (h: header)\n: Lemma\n (requires (~ (is_retry h)))\n (ensures (\n 0 < pn_offset' h /\\\n pn_offset' h + Secret.v (pn_length h) == Seq.length (format_header h)\n ))\n=\n let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let pn_len = pn_length h in\n PN.parse_packet_number_kind'_correct last pn_len;\n let (| ph, pn |) = synth_header_recip cid_len last h in\n LP.serialize_length (Public.serialize_header cid_len) ph;\n LP.serialize_length #(PN.parse_packet_number_kind' pn_len) #_ #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len)) (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len)) pn\n\n#pop-options\n\nlet pn_offset", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header{~(QUIC.Spec.Header.Base.is_retry h)}\n -> Prims.GTot\n (n:\n Prims.nat\n { 0 < n /\\\n n + QUIC.Secret.Int.Base.v (QUIC.Spec.Header.Base.pn_length h) ==\n QUIC.Spec.Header.Base.header_len h })", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Spec.Header.Base.is_retry", "QUIC.Spec.Header.Parse.pn_offset'", "Prims.unit", "QUIC.Spec.Header.Parse.pn_offset_prop", "Prims.nat", "Prims.l_and", "Prims.op_LessThan", "Prims.eq2", "Prims.int", "Prims.op_Addition", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "QUIC.Spec.Header.Base.pn_length", "QUIC.Spec.Header.Base.header_len" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val pn_offset: (h: header { ~ (is_retry h) }) -> GTot (n: nat { 0 < n /\\ n + Secret.v (pn_length h) == header_len h })\nlet pn_offset h =", "completed_definiton": "pn_offset_prop h;\npn_offset' h", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.serialize_header_dtuple", "original_source_type": "val serialize_header_dtuple (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Tot (LP.serializer (parse_header_dtuple short_dcid_len last))", "source_type": "val serialize_header_dtuple (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Tot (LP.serializer (parse_header_dtuple short_dcid_len last))", "source_definition": "let serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 413, "start_col": 2, "end_line": 418, "end_col": 53 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t\n -> LowParse.Spec.Base.serializer (QUIC.Spec.Header.Parse.parse_header_dtuple short_dcid_len last)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "LowParse.Spec.Combinators.serialize_dtuple2", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "QUIC.Spec.Header.Parse.parse_packet_number_opt_kind", "QUIC.Spec.Header.Parse.packet_number_opt", "QUIC.Spec.Header.Parse.parse_packet_number_opt", "QUIC.Spec.Header.Parse.serialize_packet_number_opt", "LowParse.Spec.Base.serializer", "QUIC.Spec.Header.Parse.parse_header_kind", "Prims.dtuple2", "QUIC.Spec.Header.Parse.parse_header_dtuple" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_header_dtuple (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\nlet serialize_header_dtuple (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Tot (LP.serializer (parse_header_dtuple short_dcid_len last)) =", "completed_definiton": "LP.serialize_dtuple2 #_\n #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_\n #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.parse_header_dtuple", "original_source_type": "val parse_header_dtuple (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Tot\n (LP.parser (parse_header_kind short_dcid_len)\n (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))", "source_type": "val parse_header_dtuple (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Tot\n (LP.parser (parse_header_kind short_dcid_len)\n (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))", "source_definition": "let parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 299, "start_col": 2, "end_line": 303, "end_col": 49 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t\n -> LowParse.Spec.Base.parser (QUIC.Spec.Header.Parse.parse_header_kind short_dcid_len)\n (Prims.dtuple2 (QUIC.Spec.Header.Public.header' short_dcid_len)\n (QUIC.Spec.Header.Parse.packet_number_opt short_dcid_len last))", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "LowParse.Spec.Combinators.parse_dtuple2", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Parse.parse_packet_number_opt_kind", "QUIC.Spec.Header.Parse.packet_number_opt", "QUIC.Spec.Header.Parse.parse_packet_number_opt", "LowParse.Spec.Base.parser", "QUIC.Spec.Header.Parse.parse_header_kind", "Prims.dtuple2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_header_dtuple (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Tot\n (LP.parser (parse_header_kind short_dcid_len)\n (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\nlet parse_header_dtuple (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Tot\n (LP.parser (parse_header_kind short_dcid_len)\n (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))) =", "completed_definiton": "LP.parse_dtuple2 #_\n #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_\n #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.serialize_header_dtuple_eq", "original_source_type": "val serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n : Lemma\n (LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2 #_\n #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_\n #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn)", "source_type": "val serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n : Lemma\n (LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2 #_\n #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_\n #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn)", "source_definition": "let serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 449, "start_col": 2, "end_line": 468, "end_col": 8 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n phpn:\n Prims.dtuple2 (QUIC.Spec.Header.Public.header' short_dcid_len)\n (QUIC.Spec.Header.Parse.packet_number_opt short_dcid_len last)\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Base.serialize (QUIC.Spec.Header.Parse.serialize_header_dtuple short_dcid_len\n last)\n phpn ==\n LowParse.Spec.Combinators.bare_serialize_dtuple2 (QUIC.Spec.Header.Public.serialize_header short_dcid_len\n )\n (QUIC.Spec.Header.Parse.serialize_packet_number_opt short_dcid_len last)\n phpn)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "Prims.dtuple2", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "LowParse.Spec.Combinators.serialize_dtuple2_eq'", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "QUIC.Spec.Header.Parse.parse_packet_number_opt_kind", "QUIC.Spec.Header.Parse.parse_packet_number_opt", "QUIC.Spec.Header.Parse.serialize_packet_number_opt", "Prims.unit", "Prims._assert", "Prims.eq2", "LowParse.Bytes.bytes", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Parse.parse_header_kind", "QUIC.Spec.Header.Parse.parse_header_dtuple", "QUIC.Spec.Header.Parse.serialize_header_dtuple", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Combinators.parse_dtuple2", "LowParse.Spec.Combinators.serialize_dtuple2", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.bare_serialize_dtuple2", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n : Lemma\n (LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2 #_\n #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_\n #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn)\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n : Lemma\n (LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2 #_\n #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_\n #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn) =", "completed_definiton": "assert (LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2 #_\n #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_\n #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last))\n phpn);\nLP.serialize_dtuple2_eq' #_\n #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_\n #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.mk_long_protected_bits", "original_source_type": "val mk_long_protected_bits (reserved_bits: bitfield 2) (pnl: PN.packet_number_length_t)\n : GTot (bitfield 4)", "source_type": "val mk_long_protected_bits (reserved_bits: bitfield 2) (pnl: PN.packet_number_length_t)\n : GTot (bitfield 4)", "source_definition": "let mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 162, "start_col": 2, "end_line": 164, "end_col": 113 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "reserved_bits: QUIC.Spec.Base.bitfield 2 -> pnl: QUIC.Spec.PacketNumber.Base.packet_number_length_t\n -> Prims.GTot (QUIC.Spec.Base.bitfield 4)", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bitfield", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "LowParse.BitFields.__proj__Mkuint_t__item__set_bitfield", "FStar.UInt8.t", "LowParse.BitFields.uint8", "FStar.UInt8.__uint_to_t", "FStar.UInt8.uint_to_t", "Prims.op_Subtraction", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "Prims.unit", "LowParse.BitFields.set_bitfield_bound", "LowParse.BitFields.set_bitfield", "FStar.UInt8.v" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val mk_long_protected_bits (reserved_bits: bitfield 2) (pnl: PN.packet_number_length_t)\n : GTot (bitfield 4)\nlet mk_long_protected_bits (reserved_bits: bitfield 2) (pnl: PN.packet_number_length_t)\n : GTot (bitfield 4) =", "completed_definiton": "BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\nBF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\nBF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1)))\n 2\n 4\n reserved_bits", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.serialize_header_eq_3", "original_source_type": "val serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n : Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n (let phpn:dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) =\n synth_header_recip short_dcid_len last h\n in\n LP.bare_serialize_dtuple2 #_\n #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_\n #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn))", "source_type": "val serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n : Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n (let phpn:dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) =\n synth_header_recip short_dcid_len last h\n in\n LP.bare_serialize_dtuple2 #_\n #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_\n #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn))", "source_definition": "let serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_2 short_dcid_len last h;\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n serialize_header_dtuple_eq short_dcid_len last phpn", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 526, "start_col": 2, "end_line": 528, "end_col": 53 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h\n\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_1 short_dcid_len last h\n\nlet serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n h: QUIC.Spec.Header.Parse.header' short_dcid_len last\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Base.serialize (QUIC.Spec.Header.Parse.serialize_header short_dcid_len last) h ==\n (let phpn = QUIC.Spec.Header.Parse.synth_header_recip short_dcid_len last h in\n LowParse.Spec.Combinators.bare_serialize_dtuple2 (QUIC.Spec.Header.Public.serialize_header short_dcid_len\n )\n (QUIC.Spec.Header.Parse.serialize_packet_number_opt short_dcid_len last)\n phpn))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Parse.header'", "QUIC.Spec.Header.Parse.serialize_header_dtuple_eq", "Prims.dtuple2", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "QUIC.Spec.Header.Parse.synth_header_recip", "Prims.unit", "QUIC.Spec.Header.Parse.serialize_header_eq_2", "Prims.l_True", "Prims.squash", "Prims.eq2", "LowParse.Bytes.bytes", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Parse.parse_header_kind", "QUIC.Spec.Header.Parse.lp_parse_header", "QUIC.Spec.Header.Parse.serialize_header", "LowParse.Spec.Combinators.bare_serialize_dtuple2", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "QUIC.Spec.Header.Parse.parse_packet_number_opt_kind", "QUIC.Spec.Header.Parse.parse_packet_number_opt", "QUIC.Spec.Header.Parse.serialize_packet_number_opt", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n : Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n (let phpn:dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) =\n synth_header_recip short_dcid_len last h\n in\n LP.bare_serialize_dtuple2 #_\n #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_\n #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn))\nlet serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n : Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n (let phpn:dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) =\n synth_header_recip short_dcid_len last h\n in\n LP.bare_serialize_dtuple2 #_\n #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_\n #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn)) =", "completed_definiton": "serialize_header_eq_2 short_dcid_len last h;\nlet phpn:dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) =\n synth_header_recip short_dcid_len last h\nin\nserialize_header_dtuple_eq short_dcid_len last phpn", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.protected_bits_reserved", "original_source_type": "val protected_bits_reserved (is_short: bool) (pb: bitfield (if is_short then 5 else 4))\n : Tot (bitfield 2)", "source_type": "val protected_bits_reserved (is_short: bool) (pb: bitfield (if is_short then 5 else 4))\n : Tot (bitfield 2)", "source_definition": "let protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 28, "start_col": 2, "end_line": 30, "end_col": 38 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n is_short: Prims.bool ->\n pb:\n QUIC.Spec.Base.bitfield (match is_short with\n | true -> 5\n | _ -> 4)\n -> QUIC.Spec.Base.bitfield 2", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.bool", "QUIC.Spec.Base.bitfield", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "LowParse.BitFields.__proj__Mkuint_t__item__get_bitfield", "FStar.UInt8.t", "LowParse.BitFields.uint8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val protected_bits_reserved (is_short: bool) (pb: bitfield (if is_short then 5 else 4))\n : Tot (bitfield 2)\nlet protected_bits_reserved (is_short: bool) (pb: bitfield (if is_short then 5 else 4))\n : Tot (bitfield 2) =", "completed_definiton": "if is_short then BF.uint8.BF.get_bitfield pb 3 5 else BF.uint8.BF.get_bitfield pb 2 4", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.mk_short_protected_bits", "original_source_type": "val mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n : GTot (bitfield 5)", "source_type": "val mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n : GTot (bitfield 5)", "source_definition": "let mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 109, "start_col": 2, "end_line": 112, "end_col": 177 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n reserved_bits: QUIC.Spec.Base.bitfield 2 ->\n key_phase: Prims.bool ->\n pnl: QUIC.Spec.PacketNumber.Base.packet_number_length_t\n -> Prims.GTot (QUIC.Spec.Base.bitfield 5)", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bitfield", "Prims.bool", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "LowParse.BitFields.__proj__Mkuint_t__item__set_bitfield", "FStar.UInt8.t", "LowParse.BitFields.uint8", "FStar.UInt8.__uint_to_t", "FStar.UInt8.uint_to_t", "Prims.op_Subtraction", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "Prims.b2t", "Prims.op_LessThan", "LowParse.BitFields.__proj__Mkuint_t__item__v", "Prims.pow2", "Prims.unit", "LowParse.BitFields.set_bitfield_bound", "LowParse.BitFields.set_bitfield", "LowParse.BitFields.ubitfield", "FStar.UInt8.v" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n : GTot (bitfield 5)\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n : GTot (bitfield 5) =", "completed_definiton": "BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\nBF.set_bitfield_bound #8\n (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1))\n 5\n 2\n 3\n (if key_phase then 1 else 0);\nBF.set_bitfield_bound #8\n (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)\n )\n 5\n 3\n 5\n (U8.v reserved_bits);\nBF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy\n 0\n 2\n (U8.uint_to_t (Secret.v pnl - 1)))\n 2\n 3\n (if key_phase then 1uy else 0uy))\n 3\n 5\n reserved_bits", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.serialize_packet_number_opt", "original_source_type": "val serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n : Tot (LP.serializer (parse_packet_number_opt cid_len last h))", "source_type": "val serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n : Tot (LP.serializer (parse_packet_number_opt cid_len last h))", "source_definition": "let serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 62, "start_col": 2, "end_line": 64, "end_col": 107 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n cid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n h: QUIC.Spec.Header.Public.header' cid_len\n -> LowParse.Spec.Base.serializer (QUIC.Spec.Header.Parse.parse_packet_number_opt cid_len last h)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.is_retry", "LowParse.Spec.Combinators.serialize_weaken", "LowParse.Spec.Combinators.parse_ret_kind", "Prims.unit", "QUIC.Spec.Header.Parse.parse_packet_number_opt_kind", "LowParse.Spec.Combinators.parse_empty", "LowParse.Spec.Combinators.serialize_empty", "Prims.bool", "QUIC.Spec.PacketNumber.parse_packet_number_kind", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "QUIC.Spec.Header.Parse.get_pn_length", "QUIC.Spec.PacketNumber.parse_packet_number", "QUIC.Spec.PacketNumber.serialize_packet_number", "LowParse.Spec.Base.serializer", "QUIC.Spec.Header.Parse.packet_number_opt", "QUIC.Spec.Header.Parse.parse_packet_number_opt" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n : Tot (LP.serializer (parse_packet_number_opt cid_len last h))\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n : Tot (LP.serializer (parse_packet_number_opt cid_len last h)) =", "completed_definiton": "if Public.is_retry h\nthen LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\nelse\n LP.serialize_weaken parse_packet_number_opt_kind\n (PN.serialize_packet_number last (get_pn_length h))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.mk_long_protected_bits_complete", "original_source_type": "val mk_long_protected_bits_complete (pb: bitfield 4)\n : Lemma\n (mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) ==\n pb)", "source_type": "val mk_long_protected_bits_complete (pb: bitfield 4)\n : Lemma\n (mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) ==\n pb)", "source_definition": "let mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 183, "start_col": 1, "end_line": 192, "end_col": 63 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "pb: QUIC.Spec.Base.bitfield 4\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Spec.Header.Parse.mk_long_protected_bits (QUIC.Spec.Header.Parse.protected_bits_reserved false\n pb)\n (QUIC.Spec.Header.Parse.protected_bits_pn_length false pb) ==\n pb)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bitfield", "LowParse.BitFields.get_bitfield_partition_2_gen", "FStar.UInt8.v", "Prims.unit", "Prims._assert", "Prims.l_and", "Prims.eq2", "FStar.UInt.uint_t", "LowParse.BitFields.__proj__Mkuint_t__item__v", "FStar.UInt8.t", "LowParse.BitFields.uint8", "LowParse.BitFields.__proj__Mkuint_t__item__get_bitfield", "LowParse.BitFields.get_bitfield_size", "LowParse.BitFields.get_bitfield_full", "QUIC.Spec.Header.Parse.mk_long_protected_bits", "QUIC.Spec.Header.Parse.protected_bits_reserved", "QUIC.Spec.Header.Parse.protected_bits_pn_length", "Prims.l_True", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val mk_long_protected_bits_complete (pb: bitfield 4)\n : Lemma\n (mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) ==\n pb)\nlet mk_long_protected_bits_complete (pb: bitfield 4)\n : Lemma\n (mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) ==\n pb) =", "completed_definiton": "let pb' =\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb)\nin\nBF.get_bitfield_full #4 (U8.v pb');\nBF.get_bitfield_full #4 (U8.v pb);\nBF.get_bitfield_size 4 8 (U8.v pb) 0 4;\nBF.get_bitfield_size 4 8 (U8.v pb') 0 4;\nassert ((BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) ==\n BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) ==\n BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4)));\nBF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.parse_packet_number_opt", "original_source_type": "val parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n : Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))", "source_type": "val parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n : Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))", "source_definition": "let parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 53, "start_col": 2, "end_line": 55, "end_col": 93 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n cid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n h: QUIC.Spec.Header.Public.header' cid_len\n -> LowParse.Spec.Base.parser QUIC.Spec.Header.Parse.parse_packet_number_opt_kind\n (QUIC.Spec.Header.Parse.packet_number_opt cid_len last h)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.is_retry", "LowParse.Spec.Base.weaken", "QUIC.Spec.Header.Parse.parse_packet_number_opt_kind", "LowParse.Spec.Combinators.parse_ret_kind", "Prims.unit", "LowParse.Spec.Combinators.parse_empty", "Prims.bool", "QUIC.Spec.PacketNumber.parse_packet_number_kind", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "QUIC.Spec.Header.Parse.get_pn_length", "QUIC.Spec.PacketNumber.parse_packet_number", "LowParse.Spec.Base.parser", "QUIC.Spec.Header.Parse.packet_number_opt" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n : Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n : Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h)) =", "completed_definiton": "if Public.is_retry h\nthen LP.weaken parse_packet_number_opt_kind LP.parse_empty\nelse LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.protected_bits_pn_length", "original_source_type": "val protected_bits_pn_length (is_short: bool) (pb: bitfield (if is_short then 5 else 4))\n : Tot PN.packet_number_length_t", "source_type": "val protected_bits_pn_length (is_short: bool) (pb: bitfield (if is_short then 5 else 4))\n : Tot PN.packet_number_length_t", "source_definition": "let protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 17, "start_col": 2, "end_line": 17, "end_col": 87 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n is_short: Prims.bool ->\n pb:\n QUIC.Spec.Base.bitfield (match is_short with\n | true -> 5\n | _ -> 4)\n -> QUIC.Spec.PacketNumber.Base.packet_number_length_t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.bool", "QUIC.Spec.Base.bitfield", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "Lib.IntTypes.to_u32", "Lib.IntTypes.U8", "Lib.IntTypes.PUB", "Lib.IntTypes.add", "FStar.UInt8.__uint_to_t", "QUIC.Secret.Int.get_bitfield", "FStar.UInt32.__uint_to_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val protected_bits_pn_length (is_short: bool) (pb: bitfield (if is_short then 5 else 4))\n : Tot PN.packet_number_length_t\nlet protected_bits_pn_length (is_short: bool) (pb: bitfield (if is_short then 5 else 4))\n : Tot PN.packet_number_length_t =", "completed_definiton": "Secret.to_u32 #Secret.U8 (1uy `Secret.add` (Secret.get_bitfield #Secret.U8 pb 0ul 2ul))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.putative_pn_offset", "original_source_type": "val putative_pn_offset: (cid_len: nat) -> (x: bytes) -> GTot (y: option nat {\n match y with\n | None -> True\n | Some y -> 0 < y /\\ y <= Seq.length x /\\ y <= header_len_bound\n})", "source_type": "val putative_pn_offset: (cid_len: nat) -> (x: bytes) -> GTot (y: option nat {\n match y with\n | None -> True\n | Some y -> 0 < y /\\ y <= Seq.length x /\\ y <= header_len_bound\n})", "source_definition": "let putative_pn_offset\n cid_len x\n= if cid_len > 20\n then None\n else\n match LP.parse (Public.parse_header (U32.uint_to_t cid_len)) x with\n | None -> None\n | Some (_, consumed) ->\n LP.parser_kind_prop_equiv (Public.parse_header_kind (U32.uint_to_t cid_len)) (Public.parse_header (U32.uint_to_t cid_len));\n Some (consumed <: nat)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 695, "start_col": 2, "end_line": 702, "end_col": 28 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h\n\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_1 short_dcid_len last h\n\nlet serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_2 short_dcid_len last h;\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n serialize_header_dtuple_eq short_dcid_len last phpn\n\n#push-options \"--z3rlimit 32\"\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n LP.serialize (Public.serialize_header short_dcid_len) ph `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn \n )))\n= serialize_header_eq_3 short_dcid_len last h\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n: Lemma\n (requires (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h\n ))\n (ensures (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h == LP.serialize (serialize_header short_dcid_len2 last2) h\n ))\n= serialize_header_eq short_dcid_len1 last1 h;\n serialize_header_eq short_dcid_len2 last2 h;\n let (| ph, pn |) = synth_header_recip short_dcid_len1 last1 h in\n Public.serialize_header_ext short_dcid_len1 short_dcid_len2 ph;\n if not (is_retry h)\n then PN.serialize_packet_number_ext last1 last2 (pn_length h) pn\n\nlet last_packet_number\n (h: header)\n: GTot PN.last_packet_number_t\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in if Secret.v pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\nlet in_window_last_packet_number\n (h: header)\n: Lemma\n ((~ (is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) (Secret.v (last_packet_number h)) (Secret.v (packet_number h)))\n= ()\n\n(* Fulfill the interface now *)\n\nlet header_len'\n (h: header)\n: GTot nat\n= \n let s = serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h) in\n LP.serialize_length s h;\n Seq.length (LP.serialize s h)\n\nlet header_len'_correct\n (gh: header)\n: Lemma\n (header_len gh == header_len' gh)\n [SMTPat (header_len gh)]\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let cid_len = U32.uint_to_t (dcid_len gh) in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n serialize_header_eq cid_len last gh;\n Public.header_len'_correct cid_len ph;\n if is_retry gh\n then ()\n else begin\n let pn_len = pn_length gh in\n PN.parse_packet_number_kind'_correct last pn_len;\n LP.serialize_length\n #(PN.parse_packet_number_kind' pn_len)\n #_\n #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len))\n (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len))\n pn'\n end\n\nlet format_header\n h\n= LP.serialize (serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\nlet format_header_is_short\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_short cid_len ph\n\nlet format_header_is_retry\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_retry cid_len ph\n\n#push-options \"--z3rlimit 64\"\n\nlet format_header_pn_length\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n let x = Seq.index (format_header h) 0 in\n assert (x == Seq.index (LP.serialize (Public.serialize_header cid_len) ph) 0);\n assert (Public.PShort? ph == MShort? h);\n Public.serialize_get_protected_bits cid_len ph;\n BF.get_bitfield_get_bitfield #8 (U8.v x) 0 (if Public.PShort? ph then 5 else 4) 0 2;\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield x 0 2) == Secret.v (pn_length h) - 1)\n\n#pop-options\n\nlet pn_offset'\n (h: header)\n: GTot nat\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Seq.length (LP.serialize (Public.serialize_header cid_len) ph)\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet pn_offset_prop\n (h: header)\n: Lemma\n (requires (~ (is_retry h)))\n (ensures (\n 0 < pn_offset' h /\\\n pn_offset' h + Secret.v (pn_length h) == Seq.length (format_header h)\n ))\n=\n let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let pn_len = pn_length h in\n PN.parse_packet_number_kind'_correct last pn_len;\n let (| ph, pn |) = synth_header_recip cid_len last h in\n LP.serialize_length (Public.serialize_header cid_len) ph;\n LP.serialize_length #(PN.parse_packet_number_kind' pn_len) #_ #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len)) (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len)) pn\n\n#pop-options\n\nlet pn_offset\n h\n= pn_offset_prop h;\n pn_offset' h\n\nlet putative_pn_offset", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "cid_len: Prims.nat -> x: QUIC.Spec.Base.bytes\n -> Prims.GTot\n (y:\n FStar.Pervasives.Native.option Prims.nat\n { (match y with\n | FStar.Pervasives.Native.None #_ -> Prims.l_True\n | FStar.Pervasives.Native.Some #_ y ->\n 0 < y /\\ y <= FStar.Seq.Base.length x /\\ y <= QUIC.Spec.Base.header_len_bound)\n <:\n Type0 })", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "QUIC.Spec.Base.bytes", "Prims.op_GreaterThan", "FStar.Pervasives.Native.None", "Prims.bool", "LowParse.Spec.Base.parse", "QUIC.Spec.Header.Public.header'", "FStar.UInt32.uint_to_t", "QUIC.Spec.Header.Public.parse_header", "LowParse.Spec.Base.consumed_length", "FStar.Pervasives.Native.Some", "Prims.unit", "LowParse.Spec.Base.parser_kind_prop_equiv", "QUIC.Spec.Header.Public.parse_header_kind", "FStar.Pervasives.Native.option", "Prims.l_True", "Prims.l_and", "Prims.b2t", "Prims.op_LessThan", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "QUIC.Spec.Base.header_len_bound" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val putative_pn_offset: (cid_len: nat) -> (x: bytes) -> GTot (y: option nat {\n match y with\n | None -> True\n | Some y -> 0 < y /\\ y <= Seq.length x /\\ y <= header_len_bound\n})\nlet putative_pn_offset cid_len x =", "completed_definiton": "if cid_len > 20\nthen None\nelse\n match LP.parse (Public.parse_header (U32.uint_to_t cid_len)) x with\n | None -> None\n | Some (_, consumed) ->\n LP.parser_kind_prop_equiv (Public.parse_header_kind (U32.uint_to_t cid_len))\n (Public.parse_header (U32.uint_to_t cid_len));\n Some (consumed <: nat)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.parse_header_kind", "original_source_type": "val parse_header_kind (short_dcid_len: short_dcid_len_t)\n : Tot\n (k:\n LP.parser_kind\n { k.LP.parser_kind_subkind == Some LP.ParserStrong /\\ k.LP.parser_kind_low > 0 /\\\n (match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound) })", "source_type": "val parse_header_kind (short_dcid_len: short_dcid_len_t)\n : Tot\n (k:\n LP.parser_kind\n { k.LP.parser_kind_subkind == Some LP.ParserStrong /\\ k.LP.parser_kind_low > 0 /\\\n (match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound) })", "source_definition": "let parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 293, "start_col": 2, "end_line": 293, "end_col": 112 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "short_dcid_len: QUIC.Spec.Base.short_dcid_len_t\n -> k:\n LowParse.Spec.Base.parser_kind\n { Mkparser_kind'?.parser_kind_subkind k ==\n FStar.Pervasives.Native.Some LowParse.Spec.Base.ParserStrong /\\\n Mkparser_kind'?.parser_kind_low k > 0 /\\\n (match Mkparser_kind'?.parser_kind_high k with\n | FStar.Pervasives.Native.None #_ -> Prims.l_False\n | FStar.Pervasives.Native.Some #_ max -> max < QUIC.Spec.Base.header_len_bound) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Parse.parse_packet_number_opt_kind", "LowParse.Spec.Base.parser_kind", "Prims.l_and", "Prims.eq2", "FStar.Pervasives.Native.option", "LowParse.Spec.Base.parser_subkind", "LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_subkind", "FStar.Pervasives.Native.Some", "LowParse.Spec.Base.ParserStrong", "Prims.b2t", "Prims.op_GreaterThan", "LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_low", "LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_high", "Prims.l_False", "Prims.nat", "Prims.op_LessThan", "QUIC.Spec.Base.header_len_bound", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_header_kind (short_dcid_len: short_dcid_len_t)\n : Tot\n (k:\n LP.parser_kind\n { k.LP.parser_kind_subkind == Some LP.ParserStrong /\\ k.LP.parser_kind_low > 0 /\\\n (match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound) })\nlet parse_header_kind (short_dcid_len: short_dcid_len_t)\n : Tot\n (k:\n LP.parser_kind\n { k.LP.parser_kind_subkind == Some LP.ParserStrong /\\ k.LP.parser_kind_low > 0 /\\\n (match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound) }) =", "completed_definiton": "(LP.parse_filter_kind (Public.parse_header_kind short_dcid_len))\n`LP.and_then_kind`\nparse_packet_number_opt_kind", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.last_packet_number", "original_source_type": "val last_packet_number (h: header) : GTot PN.last_packet_number_t", "source_type": "val last_packet_number (h: header) : GTot PN.last_packet_number_t", "source_definition": "let last_packet_number\n (h: header)\n: GTot PN.last_packet_number_t\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in if Secret.v pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 574, "start_col": 2, "end_line": 574, "end_col": 152 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h\n\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_1 short_dcid_len last h\n\nlet serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_2 short_dcid_len last h;\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n serialize_header_dtuple_eq short_dcid_len last phpn\n\n#push-options \"--z3rlimit 32\"\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n LP.serialize (Public.serialize_header short_dcid_len) ph `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn \n )))\n= serialize_header_eq_3 short_dcid_len last h\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n: Lemma\n (requires (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h\n ))\n (ensures (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h == LP.serialize (serialize_header short_dcid_len2 last2) h\n ))\n= serialize_header_eq short_dcid_len1 last1 h;\n serialize_header_eq short_dcid_len2 last2 h;\n let (| ph, pn |) = synth_header_recip short_dcid_len1 last1 h in\n Public.serialize_header_ext short_dcid_len1 short_dcid_len2 ph;\n if not (is_retry h)\n then PN.serialize_packet_number_ext last1 last2 (pn_length h) pn\n\nlet last_packet_number\n (h: header)", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header -> Prims.GTot QUIC.Spec.PacketNumber.Base.last_packet_number_t", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "QUIC.Spec.Header.Base.is_retry", "Lib.IntTypes.to_u64", "Lib.IntTypes.U64", "Lib.IntTypes.PUB", "FStar.UInt64.__uint_to_t", "Prims.bool", "Prims.op_Equality", "Prims.int", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.SEC", "Lib.IntTypes.sub", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "QUIC.Spec.Header.Base.packet_number" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val last_packet_number (h: header) : GTot PN.last_packet_number_t\nlet last_packet_number (h: header) : GTot PN.last_packet_number_t =", "completed_definiton": "if is_retry h\nthen Secret.to_u64 0uL\nelse\n let pn = packet_number h in\n if Secret.v pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` (Secret.to_u64 1uL)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.serialize_header_eq_1", "original_source_type": "val serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n : Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h)", "source_type": "val serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n : Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h)", "source_definition": "let serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 487, "start_col": 2, "end_line": 496, "end_col": 5 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n h: QUIC.Spec.Header.Parse.header' short_dcid_len last\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Base.serialize (QUIC.Spec.Header.Parse.serialize_header short_dcid_len last) h ==\n LowParse.Spec.Combinators.bare_serialize_synth (QUIC.Spec.Header.Parse.parse_header_dtuple short_dcid_len\n last)\n (QUIC.Spec.Header.Parse.synth_header short_dcid_len last)\n (QUIC.Spec.Header.Parse.serialize_header_dtuple short_dcid_len last)\n (QUIC.Spec.Header.Parse.synth_header_recip short_dcid_len last)\n h)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Parse.header'", "LowParse.Spec.Combinators.serialize_synth_eq", "QUIC.Spec.Header.Parse.parse_header_kind", "Prims.dtuple2", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "QUIC.Spec.Header.Parse.parse_header_dtuple", "QUIC.Spec.Header.Parse.synth_header", "QUIC.Spec.Header.Parse.serialize_header_dtuple", "QUIC.Spec.Header.Parse.synth_header_recip", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "LowParse.Bytes.bytes", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Parse.lp_parse_header", "QUIC.Spec.Header.Parse.serialize_header", "LowParse.Spec.Combinators.bare_serialize_synth", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n : Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h)\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n : Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h) =", "completed_definiton": "LP.serialize_synth_eq #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.synth_header_inverse", "original_source_type": "val synth_header_inverse (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len)\n (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (synth_header short_dcid_len last)\n (synth_header_recip short_dcid_len last))\n [\n SMTPat\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len)\n (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (synth_header short_dcid_len last)\n (synth_header_recip short_dcid_len last))\n ]", "source_type": "val synth_header_inverse (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len)\n (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (synth_header short_dcid_len last)\n (synth_header_recip short_dcid_len last))\n [\n SMTPat\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len)\n (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (synth_header short_dcid_len last)\n (synth_header_recip short_dcid_len last))\n ]", "source_definition": "let synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 267, "start_col": 2, "end_line": 281, "end_col": 3 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_inverse (QUIC.Spec.Header.Parse.synth_header short_dcid_len\n last)\n (QUIC.Spec.Header.Parse.synth_header_recip short_dcid_len last))\n [\n SMTPat (LowParse.Spec.Combinators.synth_inverse (QUIC.Spec.Header.Parse.synth_header short_dcid_len\n last)\n (QUIC.Spec.Header.Parse.synth_header_recip short_dcid_len last))\n ]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "LowParse.Spec.Combinators.synth_inverse_intro'", "Prims.dtuple2", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "QUIC.Spec.Header.Parse.header'", "QUIC.Spec.Header.Parse.synth_header", "QUIC.Spec.Header.Parse.synth_header_recip", "QUIC.Spec.Base.bitfield", "Prims.bool", "QUIC.Spec.Base.vlbytes", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "QUIC.Spec.Header.Parse.mk_short_protected_bits_correct", "FStar.UInt32.t", "QUIC.Spec.Header.Base.long_header_specifics", "QUIC.Spec.Base.token_max_len", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Header.Parse.mk_long_protected_bits_correct", "Prims.unit", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_inverse", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_header_inverse (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len)\n (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (synth_header short_dcid_len last)\n (synth_header_recip short_dcid_len last))\n [\n SMTPat\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len)\n (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (synth_header short_dcid_len last)\n (synth_header_recip short_dcid_len last))\n ]\nlet synth_header_inverse (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len)\n (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (synth_header short_dcid_len last)\n (synth_header_recip short_dcid_len last))\n [\n SMTPat\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len)\n (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (synth_header short_dcid_len last)\n (synth_header_recip short_dcid_len last))\n ] =", "completed_definiton": "LP.synth_inverse_intro' (synth_header short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn -> mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn -> mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn -> mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn -> mk_long_protected_bits_correct rb pnl)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.parse_header", "original_source_type": "val parse_header: cid_len: nat { cid_len <= 20 } -> last: nat { last + 1 < pow2 62 } -> b:bytes -> GTot (r: h_result {\n match r with\n | H_Failure -> True\n | H_Success h c ->\n is_valid_header h cid_len last /\\\n Seq.length c <= Seq.length b /\\\n c `Seq.equal` Seq.slice b (Seq.length b - Seq.length c) (Seq.length b)\n})", "source_type": "val parse_header: cid_len: nat { cid_len <= 20 } -> last: nat { last + 1 < pow2 62 } -> b:bytes -> GTot (r: h_result {\n match r with\n | H_Failure -> True\n | H_Success h c ->\n is_valid_header h cid_len last /\\\n Seq.length c <= Seq.length b /\\\n c `Seq.equal` Seq.slice b (Seq.length b - Seq.length c) (Seq.length b)\n})", "source_definition": "let parse_header\n cid_len last b\n= match LP.parse (lp_parse_header (U32.uint_to_t cid_len) (Secret.to_u64 (U64.uint_to_t last))) b with\n | None -> H_Failure\n | Some (h, consumed) -> H_Success h (Seq.slice b consumed (Seq.length b))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 767, "start_col": 2, "end_line": 769, "end_col": 75 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h\n\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_1 short_dcid_len last h\n\nlet serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_2 short_dcid_len last h;\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n serialize_header_dtuple_eq short_dcid_len last phpn\n\n#push-options \"--z3rlimit 32\"\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n LP.serialize (Public.serialize_header short_dcid_len) ph `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn \n )))\n= serialize_header_eq_3 short_dcid_len last h\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n: Lemma\n (requires (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h\n ))\n (ensures (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h == LP.serialize (serialize_header short_dcid_len2 last2) h\n ))\n= serialize_header_eq short_dcid_len1 last1 h;\n serialize_header_eq short_dcid_len2 last2 h;\n let (| ph, pn |) = synth_header_recip short_dcid_len1 last1 h in\n Public.serialize_header_ext short_dcid_len1 short_dcid_len2 ph;\n if not (is_retry h)\n then PN.serialize_packet_number_ext last1 last2 (pn_length h) pn\n\nlet last_packet_number\n (h: header)\n: GTot PN.last_packet_number_t\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in if Secret.v pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\nlet in_window_last_packet_number\n (h: header)\n: Lemma\n ((~ (is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) (Secret.v (last_packet_number h)) (Secret.v (packet_number h)))\n= ()\n\n(* Fulfill the interface now *)\n\nlet header_len'\n (h: header)\n: GTot nat\n= \n let s = serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h) in\n LP.serialize_length s h;\n Seq.length (LP.serialize s h)\n\nlet header_len'_correct\n (gh: header)\n: Lemma\n (header_len gh == header_len' gh)\n [SMTPat (header_len gh)]\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let cid_len = U32.uint_to_t (dcid_len gh) in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n serialize_header_eq cid_len last gh;\n Public.header_len'_correct cid_len ph;\n if is_retry gh\n then ()\n else begin\n let pn_len = pn_length gh in\n PN.parse_packet_number_kind'_correct last pn_len;\n LP.serialize_length\n #(PN.parse_packet_number_kind' pn_len)\n #_\n #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len))\n (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len))\n pn'\n end\n\nlet format_header\n h\n= LP.serialize (serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\nlet format_header_is_short\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_short cid_len ph\n\nlet format_header_is_retry\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_retry cid_len ph\n\n#push-options \"--z3rlimit 64\"\n\nlet format_header_pn_length\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n let x = Seq.index (format_header h) 0 in\n assert (x == Seq.index (LP.serialize (Public.serialize_header cid_len) ph) 0);\n assert (Public.PShort? ph == MShort? h);\n Public.serialize_get_protected_bits cid_len ph;\n BF.get_bitfield_get_bitfield #8 (U8.v x) 0 (if Public.PShort? ph then 5 else 4) 0 2;\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield x 0 2) == Secret.v (pn_length h) - 1)\n\n#pop-options\n\nlet pn_offset'\n (h: header)\n: GTot nat\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Seq.length (LP.serialize (Public.serialize_header cid_len) ph)\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet pn_offset_prop\n (h: header)\n: Lemma\n (requires (~ (is_retry h)))\n (ensures (\n 0 < pn_offset' h /\\\n pn_offset' h + Secret.v (pn_length h) == Seq.length (format_header h)\n ))\n=\n let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let pn_len = pn_length h in\n PN.parse_packet_number_kind'_correct last pn_len;\n let (| ph, pn |) = synth_header_recip cid_len last h in\n LP.serialize_length (Public.serialize_header cid_len) ph;\n LP.serialize_length #(PN.parse_packet_number_kind' pn_len) #_ #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len)) (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len)) pn\n\n#pop-options\n\nlet pn_offset\n h\n= pn_offset_prop h;\n pn_offset' h\n\nlet putative_pn_offset\n cid_len x\n= if cid_len > 20\n then None\n else\n match LP.parse (Public.parse_header (U32.uint_to_t cid_len)) x with\n | None -> None\n | Some (_, consumed) ->\n LP.parser_kind_prop_equiv (Public.parse_header_kind (U32.uint_to_t cid_len)) (Public.parse_header (U32.uint_to_t cid_len));\n Some (consumed <: nat)\n\nlet putative_pn_offset_frame\n cid_len x1 x2\n= let Some off = putative_pn_offset cid_len x1 in\n let h1 = Seq.index x1 0 in\n let h2 = Seq.index x2 0 in\n assert (Seq.slice x2 0 off `Seq.equal` (h2 `Seq.cons` Seq.tail (Seq.slice x1 0 off)));\n let is_short = BF.get_bitfield (U8.v h1) 7 8 = 0 in\n let number_of_protected_bits = if is_short then 5 else 4 in\n let new_pb = BF.uint8.BF.get_bitfield h2 0 number_of_protected_bits in\n let h1' = BF.uint8.BF.set_bitfield h1 0 number_of_protected_bits new_pb in\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield h2 0 number_of_protected_bits) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield h1' 0 number_of_protected_bits));\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield h2 number_of_protected_bits 8) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield h1' number_of_protected_bits 8));\n BF.get_bitfield_partition_2 #8 number_of_protected_bits (BF.uint8.BF.v h2) (BF.uint8.BF.v h1');\n let cid_len' = U32.uint_to_t cid_len in\n let p = Public.parse_header cid_len' in\n let s = Public.serialize_header cid_len' in\n let Some (ph, consumed) = LP.parse p x1 in\n assert (consumed == off);\n LP.parse_serialize s ph;\n LP.parse_strong_prefix p x1 (Seq.slice x1 0 off);\n LP.parse_injective p (Seq.slice x1 0 off) (LP.serialize s ph);\n assert (LP.serialize s ph == Seq.slice x1 0 off);\n Public.serialize_header_is_short cid_len' ph;\n Public.serialize_set_protected_bits cid_len' ph new_pb;\n let ph2 = Public.set_protected_bits ph new_pb in\n assert (LP.serialize s ph2 == Seq.slice x2 0 off);\n LP.parse_strong_prefix p (Seq.slice x2 0 off) x2\n\n#push-options \"--z3rlimit 32\"\n\nlet putative_pn_offset_intro\n (cid_len : short_dcid_len_t)\n (x: bytes)\n (ph: Public.header' cid_len)\n (off: nat { off <= Seq.length x })\n: Lemma\n (requires (\n LP.parse (Public.parse_header cid_len) x == Some (ph, off)\n ))\n (ensures (putative_pn_offset (U32.v cid_len) x == Some off))\n= ()\n\nlet putative_pn_offset_correct\n h cid_len\n=\n let cid_len_h = U32.uint_to_t (dcid_len h) in\n let last_h = last_packet_number h in\n serialize_header_eq cid_len_h last_h h;\n let (| ph, _ |) = synth_header_recip cid_len_h last_h h in\n let off = Seq.length (LP.serialize (Public.serialize_header cid_len_h) ph) in\n assert (pn_offset h == off);\n let cid_len' = U32.uint_to_t cid_len in\n Public.serialize_header_ext cid_len_h cid_len' ph;\n LP.parse_serialize (Public.serialize_header cid_len') ph;\n LP.parse_strong_prefix (Public.parse_header cid_len') (LP.serialize (Public.serialize_header cid_len') ph) (format_header h);\n LP.parse_injective (Public.parse_header cid_len') (LP.serialize (Public.serialize_header cid_len') ph) (format_header h);\n assert (LP.parse (Public.parse_header cid_len') (format_header h) == Some (ph, off));\n putative_pn_offset_intro cid_len' (format_header h) ph off\n\n#pop-options\n\nlet parse_header", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n cid_len: Prims.nat{cid_len <= 20} ->\n last: Prims.nat{last + 1 < Prims.pow2 62} ->\n b: QUIC.Spec.Base.bytes\n -> Prims.GTot\n (r:\n QUIC.Spec.Header.Parse.h_result\n { (match r with\n | QUIC.Spec.Header.Parse.H_Failure -> Prims.l_True\n | QUIC.Spec.Header.Parse.H_Success h c ->\n QUIC.Spec.Header.Base.is_valid_header h cid_len last /\\\n FStar.Seq.Base.length c <= FStar.Seq.Base.length b /\\\n FStar.Seq.Base.equal c\n (FStar.Seq.Base.slice b\n (FStar.Seq.Base.length b - FStar.Seq.Base.length c)\n (FStar.Seq.Base.length b)))\n <:\n Type0 })", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "Prims.op_Addition", "Prims.pow2", "QUIC.Spec.Base.bytes", "LowParse.Spec.Base.parse", "QUIC.Spec.Header.Parse.header'", "FStar.UInt32.uint_to_t", "Lib.IntTypes.to_u64", "Lib.IntTypes.U64", "Lib.IntTypes.PUB", "FStar.UInt64.uint_to_t", "QUIC.Spec.Header.Parse.lp_parse_header", "QUIC.Spec.Header.Parse.H_Failure", "LowParse.Spec.Base.consumed_length", "QUIC.Spec.Header.Parse.H_Success", "FStar.Seq.Base.slice", "QUIC.Spec.Base.byte", "FStar.Seq.Base.length", "QUIC.Spec.Header.Parse.h_result", "Prims.l_True", "QUIC.Spec.Header.Base.header", "Prims.l_and", "QUIC.Spec.Header.Base.is_valid_header", "FStar.Seq.Base.equal", "Prims.op_Subtraction" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_header: cid_len: nat { cid_len <= 20 } -> last: nat { last + 1 < pow2 62 } -> b:bytes -> GTot (r: h_result {\n match r with\n | H_Failure -> True\n | H_Success h c ->\n is_valid_header h cid_len last /\\\n Seq.length c <= Seq.length b /\\\n c `Seq.equal` Seq.slice b (Seq.length b - Seq.length c) (Seq.length b)\n})\nlet parse_header cid_len last b =", "completed_definiton": "match LP.parse (lp_parse_header (U32.uint_to_t cid_len) (Secret.to_u64 (U64.uint_to_t last))) b with\n| None -> H_Failure\n| Some (h, consumed) -> H_Success h (Seq.slice b consumed (Seq.length b))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.synth_header_injective", "original_source_type": "val synth_header_injective (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len)\n (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (synth_header short_dcid_len last))\n [\n SMTPat\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len)\n (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (synth_header short_dcid_len last))\n ]", "source_type": "val synth_header_injective (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len)\n (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (synth_header short_dcid_len last))\n [\n SMTPat\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len)\n (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (synth_header short_dcid_len last))\n ]", "source_definition": "let synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 248, "start_col": 2, "end_line": 259, "end_col": 110 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_injective (QUIC.Spec.Header.Parse.synth_header short_dcid_len\n last))\n [\n SMTPat (LowParse.Spec.Combinators.synth_injective (QUIC.Spec.Header.Parse.synth_header short_dcid_len\n last))\n ]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "LowParse.Spec.Combinators.synth_inverse_synth_injective", "Prims.dtuple2", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "QUIC.Spec.Header.Parse.header'", "QUIC.Spec.Header.Parse.synth_header", "QUIC.Spec.Header.Parse.synth_header_recip", "Prims.unit", "LowParse.Spec.Combinators.synth_inverse_intro'", "QUIC.Spec.Base.bitfield", "Prims.bool", "QUIC.Spec.Base.vlbytes", "QUIC.Spec.Header.Parse.mk_short_protected_bits_complete", "FStar.UInt32.t", "QUIC.Spec.Header.Public.long_header_specifics", "QUIC.Spec.Header.Parse.mk_long_protected_bits_complete", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_injective", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_header_injective (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len)\n (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (synth_header short_dcid_len last))\n [\n SMTPat\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len)\n (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (synth_header short_dcid_len last))\n ]\nlet synth_header_injective (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len)\n (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (synth_header short_dcid_len last))\n [\n SMTPat\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len)\n (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (synth_header short_dcid_len last))\n ] =", "completed_definiton": "LP.synth_inverse_intro' (synth_header_recip short_dcid_len last)\n (synth_header short_dcid_len last)\n (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h , pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid -> mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits);\nLP.synth_inverse_synth_injective (synth_header short_dcid_len last)\n (synth_header_recip short_dcid_len last)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.synth_header", "original_source_type": "val synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n : Tot (header' short_dcid_len last)", "source_type": "val synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n : Tot (header' short_dcid_len last)", "source_definition": "let synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 199, "start_col": 1, "end_line": 216, "end_col": 9 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n x:\n Prims.dtuple2 (QUIC.Spec.Header.Public.header' short_dcid_len)\n (QUIC.Spec.Header.Parse.packet_number_opt short_dcid_len last)\n -> QUIC.Spec.Header.Parse.header' short_dcid_len last", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "Prims.dtuple2", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "QUIC.Spec.Base.bitfield", "Prims.bool", "QUIC.Spec.Base.vlbytes", "QUIC.Spec.Header.Base.MShort", "QUIC.Spec.Header.Parse.protected_bits_reserved", "QUIC.Spec.Header.Parse.protected_bits_key_phase", "QUIC.Spec.Header.Parse.protected_bits_pn_length", "FStar.UInt32.t", "QUIC.Spec.Header.Public.long_header_specifics", "QUIC.Spec.Header.Base.MLong", "QUIC.Spec.Header.Base.MRetry", "QUIC.Spec.Base.token_max_len", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Header.Base.MInitial", "QUIC.Spec.Header.Base.MHandshake", "QUIC.Spec.Header.Base.MZeroRTT", "QUIC.Spec.Header.Base.long_header_specifics", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.Header.Parse.header'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n : Tot (header' short_dcid_len last)\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n : Tot (header' short_dcid_len last) =", "completed_definiton": "let (| h , pn |) = x in\nmatch h with\n| Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits)\n spin\n (protected_bits_key_phase protected_bits)\n dcid\n (protected_bits_pn_length true protected_bits)\n pn\n| Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version\n dcid\n scid\n (match spec with\n | Public.PRetry odcid -> MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length -> MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length -> MZeroRTT rb payload_and_pn_length pnl pn)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.synth_header_recip", "original_source_type": "val synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n : GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))", "source_type": "val synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n : GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))", "source_definition": "let synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 223, "start_col": 2, "end_line": 240, "end_col": 7 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n x: QUIC.Spec.Header.Parse.header' short_dcid_len last\n -> Prims.GTot\n (Prims.dtuple2 (QUIC.Spec.Header.Public.header' short_dcid_len)\n (QUIC.Spec.Header.Parse.packet_number_opt short_dcid_len last))", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Parse.header'", "QUIC.Spec.Base.bitfield", "Prims.bool", "QUIC.Spec.Base.vlbytes", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Prims.Mkdtuple2", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "QUIC.Spec.Header.Public.PShort", "QUIC.Spec.Header.Parse.mk_short_protected_bits", "Prims.unit", "QUIC.Spec.Header.Parse.mk_short_protected_bits_correct", "FStar.UInt32.t", "QUIC.Spec.Header.Base.long_header_specifics", "QUIC.Spec.Header.Public.PLong", "QUIC.Spec.Header.Public.PRetry", "QUIC.Spec.Base.token_max_len", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Header.Parse.mk_long_protected_bits", "QUIC.Spec.Header.Public.PInitial", "QUIC.Spec.Header.Parse.mk_long_protected_bits_correct", "QUIC.Spec.Header.Public.PHandshake", "QUIC.Spec.Header.Public.PZeroRTT", "Prims.dtuple2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n : GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n : GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) =", "completed_definiton": "match x with\n| MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n| MLong version dcid scid spec ->\n match spec with\n | MRetry unused odcid -> (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (|\n Public.PLong (mk_long_protected_bits rb pnl)\n version\n dcid\n scid\n (Public.PInitial token payload_and_pn_length),\n pn\n |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (|\n Public.PLong (mk_long_protected_bits rb pnl)\n version\n dcid\n scid\n (Public.PHandshake payload_and_pn_length),\n pn\n |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (|\n Public.PLong (mk_long_protected_bits rb pnl)\n version\n dcid\n scid\n (Public.PZeroRTT payload_and_pn_length),\n pn\n |)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.mk_short_protected_bits_complete", "original_source_type": "val mk_short_protected_bits_complete (pb: bitfield 5)\n : Lemma\n (mk_short_protected_bits (protected_bits_reserved true pb)\n (protected_bits_key_phase pb)\n (protected_bits_pn_length true pb) ==\n pb)", "source_type": "val mk_short_protected_bits_complete (pb: bitfield 5)\n : Lemma\n (mk_short_protected_bits (protected_bits_reserved true pb)\n (protected_bits_key_phase pb)\n (protected_bits_pn_length true pb) ==\n pb)", "source_definition": "let mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 144, "start_col": 1, "end_line": 154, "end_col": 62 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "pb: QUIC.Spec.Base.bitfield 5\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Spec.Header.Parse.mk_short_protected_bits (QUIC.Spec.Header.Parse.protected_bits_reserved\n true\n pb)\n (QUIC.Spec.Header.Parse.protected_bits_key_phase pb)\n (QUIC.Spec.Header.Parse.protected_bits_pn_length true pb) ==\n pb)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bitfield", "LowParse.BitFields.get_bitfield_partition", "FStar.UInt8.v", "Prims.Cons", "Prims.nat", "Prims.Nil", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.l_iff", "Prims.b2t", "LowParse.BitFields.get_bitfield_partition_prop", "Prims.l_and", "Prims.eq2", "FStar.UInt.uint_t", "LowParse.BitFields.__proj__Mkuint_t__item__v", "FStar.UInt8.t", "LowParse.BitFields.uint8", "LowParse.BitFields.__proj__Mkuint_t__item__get_bitfield", "LowParse.BitFields.get_bitfield_size", "LowParse.BitFields.get_bitfield_full", "QUIC.Spec.Header.Parse.mk_short_protected_bits", "QUIC.Spec.Header.Parse.protected_bits_reserved", "QUIC.Spec.Header.Parse.protected_bits_key_phase", "QUIC.Spec.Header.Parse.protected_bits_pn_length", "Prims.l_True", "Prims.squash", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val mk_short_protected_bits_complete (pb: bitfield 5)\n : Lemma\n (mk_short_protected_bits (protected_bits_reserved true pb)\n (protected_bits_key_phase pb)\n (protected_bits_pn_length true pb) ==\n pb)\nlet mk_short_protected_bits_complete (pb: bitfield 5)\n : Lemma\n (mk_short_protected_bits (protected_bits_reserved true pb)\n (protected_bits_key_phase pb)\n (protected_bits_pn_length true pb) ==\n pb) =", "completed_definiton": "let pb' =\n mk_short_protected_bits (protected_bits_reserved true pb)\n (protected_bits_key_phase pb)\n (protected_bits_pn_length true pb)\nin\nBF.get_bitfield_full #5 (U8.v pb');\nBF.get_bitfield_full #5 (U8.v pb);\nBF.get_bitfield_size 5 8 (U8.v pb) 0 5;\nBF.get_bitfield_size 5 8 (U8.v pb') 0 5;\nassert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==>\n ((BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) ==\n BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) ==\n BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) ==\n BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))));\nBF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.header_len'", "original_source_type": "val header_len' (h: header) : GTot nat", "source_type": "val header_len' (h: header) : GTot nat", "source_definition": "let header_len'\n (h: header)\n: GTot nat\n= \n let s = serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h) in\n LP.serialize_length s h;\n Seq.length (LP.serialize s h)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 587, "start_col": 1, "end_line": 590, "end_col": 31 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h\n\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_1 short_dcid_len last h\n\nlet serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_2 short_dcid_len last h;\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n serialize_header_dtuple_eq short_dcid_len last phpn\n\n#push-options \"--z3rlimit 32\"\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n LP.serialize (Public.serialize_header short_dcid_len) ph `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn \n )))\n= serialize_header_eq_3 short_dcid_len last h\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n: Lemma\n (requires (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h\n ))\n (ensures (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h == LP.serialize (serialize_header short_dcid_len2 last2) h\n ))\n= serialize_header_eq short_dcid_len1 last1 h;\n serialize_header_eq short_dcid_len2 last2 h;\n let (| ph, pn |) = synth_header_recip short_dcid_len1 last1 h in\n Public.serialize_header_ext short_dcid_len1 short_dcid_len2 ph;\n if not (is_retry h)\n then PN.serialize_packet_number_ext last1 last2 (pn_length h) pn\n\nlet last_packet_number\n (h: header)\n: GTot PN.last_packet_number_t\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in if Secret.v pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\nlet in_window_last_packet_number\n (h: header)\n: Lemma\n ((~ (is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) (Secret.v (last_packet_number h)) (Secret.v (packet_number h)))\n= ()\n\n(* Fulfill the interface now *)\n\nlet header_len'\n (h: header)", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Parse.parse_header_kind", "FStar.UInt32.uint_to_t", "QUIC.Spec.Header.Base.dcid_len", "QUIC.Spec.Header.Parse.header'", "QUIC.Spec.Header.Parse.last_packet_number", "QUIC.Spec.Header.Parse.lp_parse_header", "Prims.unit", "LowParse.Spec.Base.serialize_length", "LowParse.Spec.Base.serializer", "QUIC.Spec.Header.Parse.serialize_header", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_len' (h: header) : GTot nat\nlet header_len' (h: header) : GTot nat =", "completed_definiton": "let s = serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h) in\nLP.serialize_length s h;\nSeq.length (LP.serialize s h)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.pn_offset'", "original_source_type": "val pn_offset' (h: header) : GTot nat", "source_type": "val pn_offset' (h: header) : GTot nat", "source_definition": "let pn_offset'\n (h: header)\n: GTot nat\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Seq.length (LP.serialize (Public.serialize_header cid_len) ph)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 659, "start_col": 1, "end_line": 662, "end_col": 64 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h\n\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_1 short_dcid_len last h\n\nlet serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_2 short_dcid_len last h;\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n serialize_header_dtuple_eq short_dcid_len last phpn\n\n#push-options \"--z3rlimit 32\"\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n LP.serialize (Public.serialize_header short_dcid_len) ph `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn \n )))\n= serialize_header_eq_3 short_dcid_len last h\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n: Lemma\n (requires (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h\n ))\n (ensures (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h == LP.serialize (serialize_header short_dcid_len2 last2) h\n ))\n= serialize_header_eq short_dcid_len1 last1 h;\n serialize_header_eq short_dcid_len2 last2 h;\n let (| ph, pn |) = synth_header_recip short_dcid_len1 last1 h in\n Public.serialize_header_ext short_dcid_len1 short_dcid_len2 ph;\n if not (is_retry h)\n then PN.serialize_packet_number_ext last1 last2 (pn_length h) pn\n\nlet last_packet_number\n (h: header)\n: GTot PN.last_packet_number_t\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in if Secret.v pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\nlet in_window_last_packet_number\n (h: header)\n: Lemma\n ((~ (is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) (Secret.v (last_packet_number h)) (Secret.v (packet_number h)))\n= ()\n\n(* Fulfill the interface now *)\n\nlet header_len'\n (h: header)\n: GTot nat\n= \n let s = serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h) in\n LP.serialize_length s h;\n Seq.length (LP.serialize s h)\n\nlet header_len'_correct\n (gh: header)\n: Lemma\n (header_len gh == header_len' gh)\n [SMTPat (header_len gh)]\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let cid_len = U32.uint_to_t (dcid_len gh) in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n serialize_header_eq cid_len last gh;\n Public.header_len'_correct cid_len ph;\n if is_retry gh\n then ()\n else begin\n let pn_len = pn_length gh in\n PN.parse_packet_number_kind'_correct last pn_len;\n LP.serialize_length\n #(PN.parse_packet_number_kind' pn_len)\n #_\n #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len))\n (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len))\n pn'\n end\n\nlet format_header\n h\n= LP.serialize (serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\nlet format_header_is_short\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_short cid_len ph\n\nlet format_header_is_retry\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_retry cid_len ph\n\n#push-options \"--z3rlimit 64\"\n\nlet format_header_pn_length\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n let x = Seq.index (format_header h) 0 in\n assert (x == Seq.index (LP.serialize (Public.serialize_header cid_len) ph) 0);\n assert (Public.PShort? ph == MShort? h);\n Public.serialize_get_protected_bits cid_len ph;\n BF.get_bitfield_get_bitfield #8 (U8.v x) 0 (if Public.PShort? ph then 5 else 4) 0 2;\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield x 0 2) == Secret.v (pn_length h) - 1)\n\n#pop-options\n\nlet pn_offset'\n (h: header)", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header -> Prims.GTot Prims.nat", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "Prims.nat", "Prims.dtuple2", "QUIC.Spec.Header.Parse.synth_header_recip", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Parse.last_packet_number", "FStar.UInt32.t", "FStar.UInt32.uint_to_t", "QUIC.Spec.Header.Base.dcid_len" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val pn_offset' (h: header) : GTot nat\nlet pn_offset' (h: header) : GTot nat =", "completed_definiton": "let cid_len = U32.uint_to_t (dcid_len h) in\nlet last = last_packet_number h in\nlet (| ph , _ |) = synth_header_recip cid_len last h in\nSeq.length (LP.serialize (Public.serialize_header cid_len) ph)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.format_header", "original_source_type": "val format_header: h:header -> GTot (lbytes (header_len h))", "source_type": "val format_header: h:header -> GTot (lbytes (header_len h))", "source_definition": "let format_header\n h\n= LP.serialize (serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 621, "start_col": 2, "end_line": 621, "end_col": 87 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h\n\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_1 short_dcid_len last h\n\nlet serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_2 short_dcid_len last h;\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n serialize_header_dtuple_eq short_dcid_len last phpn\n\n#push-options \"--z3rlimit 32\"\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n LP.serialize (Public.serialize_header short_dcid_len) ph `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn \n )))\n= serialize_header_eq_3 short_dcid_len last h\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n: Lemma\n (requires (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h\n ))\n (ensures (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h == LP.serialize (serialize_header short_dcid_len2 last2) h\n ))\n= serialize_header_eq short_dcid_len1 last1 h;\n serialize_header_eq short_dcid_len2 last2 h;\n let (| ph, pn |) = synth_header_recip short_dcid_len1 last1 h in\n Public.serialize_header_ext short_dcid_len1 short_dcid_len2 ph;\n if not (is_retry h)\n then PN.serialize_packet_number_ext last1 last2 (pn_length h) pn\n\nlet last_packet_number\n (h: header)\n: GTot PN.last_packet_number_t\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in if Secret.v pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\nlet in_window_last_packet_number\n (h: header)\n: Lemma\n ((~ (is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) (Secret.v (last_packet_number h)) (Secret.v (packet_number h)))\n= ()\n\n(* Fulfill the interface now *)\n\nlet header_len'\n (h: header)\n: GTot nat\n= \n let s = serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h) in\n LP.serialize_length s h;\n Seq.length (LP.serialize s h)\n\nlet header_len'_correct\n (gh: header)\n: Lemma\n (header_len gh == header_len' gh)\n [SMTPat (header_len gh)]\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let cid_len = U32.uint_to_t (dcid_len gh) in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n serialize_header_eq cid_len last gh;\n Public.header_len'_correct cid_len ph;\n if is_retry gh\n then ()\n else begin\n let pn_len = pn_length gh in\n PN.parse_packet_number_kind'_correct last pn_len;\n LP.serialize_length\n #(PN.parse_packet_number_kind' pn_len)\n #_\n #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len))\n (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len))\n pn'\n end\n\nlet format_header", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header\n -> Prims.GTot (QUIC.Spec.Base.lbytes (QUIC.Spec.Header.Base.header_len h))", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Parse.parse_header_kind", "FStar.UInt32.uint_to_t", "QUIC.Spec.Header.Base.dcid_len", "QUIC.Spec.Header.Parse.header'", "QUIC.Spec.Header.Parse.last_packet_number", "QUIC.Spec.Header.Parse.lp_parse_header", "QUIC.Spec.Header.Parse.serialize_header", "QUIC.Spec.Base.lbytes", "QUIC.Spec.Header.Base.header_len" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val format_header: h:header -> GTot (lbytes (header_len h))\nlet format_header h =", "completed_definiton": "LP.serialize (serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.parse_header_exists_recip", "original_source_type": "val parse_header_exists_recip\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (x:bytes)\n: Lemma\n (requires (\n H_Success? (parse_header cid_len last x)\n ))\n (ensures (\n Some? (putative_pn_offset cid_len x)\n ))", "source_type": "val parse_header_exists_recip\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (x:bytes)\n: Lemma\n (requires (\n H_Success? (parse_header cid_len last x)\n ))\n (ensures (\n Some? (putative_pn_offset cid_len x)\n ))", "source_definition": "let parse_header_exists_recip\n cid_len last x\n=\n let cid_len' = U32.uint_to_t cid_len in\n let last' = Secret.to_u64 (U64.uint_to_t last) in\n lp_parse_header_eq cid_len' last' x", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 817, "start_col": 1, "end_line": 820, "end_col": 37 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h\n\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_1 short_dcid_len last h\n\nlet serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_2 short_dcid_len last h;\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n serialize_header_dtuple_eq short_dcid_len last phpn\n\n#push-options \"--z3rlimit 32\"\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n LP.serialize (Public.serialize_header short_dcid_len) ph `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn \n )))\n= serialize_header_eq_3 short_dcid_len last h\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n: Lemma\n (requires (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h\n ))\n (ensures (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h == LP.serialize (serialize_header short_dcid_len2 last2) h\n ))\n= serialize_header_eq short_dcid_len1 last1 h;\n serialize_header_eq short_dcid_len2 last2 h;\n let (| ph, pn |) = synth_header_recip short_dcid_len1 last1 h in\n Public.serialize_header_ext short_dcid_len1 short_dcid_len2 ph;\n if not (is_retry h)\n then PN.serialize_packet_number_ext last1 last2 (pn_length h) pn\n\nlet last_packet_number\n (h: header)\n: GTot PN.last_packet_number_t\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in if Secret.v pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\nlet in_window_last_packet_number\n (h: header)\n: Lemma\n ((~ (is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) (Secret.v (last_packet_number h)) (Secret.v (packet_number h)))\n= ()\n\n(* Fulfill the interface now *)\n\nlet header_len'\n (h: header)\n: GTot nat\n= \n let s = serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h) in\n LP.serialize_length s h;\n Seq.length (LP.serialize s h)\n\nlet header_len'_correct\n (gh: header)\n: Lemma\n (header_len gh == header_len' gh)\n [SMTPat (header_len gh)]\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let cid_len = U32.uint_to_t (dcid_len gh) in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n serialize_header_eq cid_len last gh;\n Public.header_len'_correct cid_len ph;\n if is_retry gh\n then ()\n else begin\n let pn_len = pn_length gh in\n PN.parse_packet_number_kind'_correct last pn_len;\n LP.serialize_length\n #(PN.parse_packet_number_kind' pn_len)\n #_\n #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len))\n (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len))\n pn'\n end\n\nlet format_header\n h\n= LP.serialize (serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\nlet format_header_is_short\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_short cid_len ph\n\nlet format_header_is_retry\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_retry cid_len ph\n\n#push-options \"--z3rlimit 64\"\n\nlet format_header_pn_length\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n let x = Seq.index (format_header h) 0 in\n assert (x == Seq.index (LP.serialize (Public.serialize_header cid_len) ph) 0);\n assert (Public.PShort? ph == MShort? h);\n Public.serialize_get_protected_bits cid_len ph;\n BF.get_bitfield_get_bitfield #8 (U8.v x) 0 (if Public.PShort? ph then 5 else 4) 0 2;\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield x 0 2) == Secret.v (pn_length h) - 1)\n\n#pop-options\n\nlet pn_offset'\n (h: header)\n: GTot nat\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Seq.length (LP.serialize (Public.serialize_header cid_len) ph)\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet pn_offset_prop\n (h: header)\n: Lemma\n (requires (~ (is_retry h)))\n (ensures (\n 0 < pn_offset' h /\\\n pn_offset' h + Secret.v (pn_length h) == Seq.length (format_header h)\n ))\n=\n let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let pn_len = pn_length h in\n PN.parse_packet_number_kind'_correct last pn_len;\n let (| ph, pn |) = synth_header_recip cid_len last h in\n LP.serialize_length (Public.serialize_header cid_len) ph;\n LP.serialize_length #(PN.parse_packet_number_kind' pn_len) #_ #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len)) (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len)) pn\n\n#pop-options\n\nlet pn_offset\n h\n= pn_offset_prop h;\n pn_offset' h\n\nlet putative_pn_offset\n cid_len x\n= if cid_len > 20\n then None\n else\n match LP.parse (Public.parse_header (U32.uint_to_t cid_len)) x with\n | None -> None\n | Some (_, consumed) ->\n LP.parser_kind_prop_equiv (Public.parse_header_kind (U32.uint_to_t cid_len)) (Public.parse_header (U32.uint_to_t cid_len));\n Some (consumed <: nat)\n\nlet putative_pn_offset_frame\n cid_len x1 x2\n= let Some off = putative_pn_offset cid_len x1 in\n let h1 = Seq.index x1 0 in\n let h2 = Seq.index x2 0 in\n assert (Seq.slice x2 0 off `Seq.equal` (h2 `Seq.cons` Seq.tail (Seq.slice x1 0 off)));\n let is_short = BF.get_bitfield (U8.v h1) 7 8 = 0 in\n let number_of_protected_bits = if is_short then 5 else 4 in\n let new_pb = BF.uint8.BF.get_bitfield h2 0 number_of_protected_bits in\n let h1' = BF.uint8.BF.set_bitfield h1 0 number_of_protected_bits new_pb in\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield h2 0 number_of_protected_bits) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield h1' 0 number_of_protected_bits));\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield h2 number_of_protected_bits 8) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield h1' number_of_protected_bits 8));\n BF.get_bitfield_partition_2 #8 number_of_protected_bits (BF.uint8.BF.v h2) (BF.uint8.BF.v h1');\n let cid_len' = U32.uint_to_t cid_len in\n let p = Public.parse_header cid_len' in\n let s = Public.serialize_header cid_len' in\n let Some (ph, consumed) = LP.parse p x1 in\n assert (consumed == off);\n LP.parse_serialize s ph;\n LP.parse_strong_prefix p x1 (Seq.slice x1 0 off);\n LP.parse_injective p (Seq.slice x1 0 off) (LP.serialize s ph);\n assert (LP.serialize s ph == Seq.slice x1 0 off);\n Public.serialize_header_is_short cid_len' ph;\n Public.serialize_set_protected_bits cid_len' ph new_pb;\n let ph2 = Public.set_protected_bits ph new_pb in\n assert (LP.serialize s ph2 == Seq.slice x2 0 off);\n LP.parse_strong_prefix p (Seq.slice x2 0 off) x2\n\n#push-options \"--z3rlimit 32\"\n\nlet putative_pn_offset_intro\n (cid_len : short_dcid_len_t)\n (x: bytes)\n (ph: Public.header' cid_len)\n (off: nat { off <= Seq.length x })\n: Lemma\n (requires (\n LP.parse (Public.parse_header cid_len) x == Some (ph, off)\n ))\n (ensures (putative_pn_offset (U32.v cid_len) x == Some off))\n= ()\n\nlet putative_pn_offset_correct\n h cid_len\n=\n let cid_len_h = U32.uint_to_t (dcid_len h) in\n let last_h = last_packet_number h in\n serialize_header_eq cid_len_h last_h h;\n let (| ph, _ |) = synth_header_recip cid_len_h last_h h in\n let off = Seq.length (LP.serialize (Public.serialize_header cid_len_h) ph) in\n assert (pn_offset h == off);\n let cid_len' = U32.uint_to_t cid_len in\n Public.serialize_header_ext cid_len_h cid_len' ph;\n LP.parse_serialize (Public.serialize_header cid_len') ph;\n LP.parse_strong_prefix (Public.parse_header cid_len') (LP.serialize (Public.serialize_header cid_len') ph) (format_header h);\n LP.parse_injective (Public.parse_header cid_len') (LP.serialize (Public.serialize_header cid_len') ph) (format_header h);\n assert (LP.parse (Public.parse_header cid_len') (format_header h) == Some (ph, off));\n putative_pn_offset_intro cid_len' (format_header h) ph off\n\n#pop-options\n\nlet parse_header\n cid_len last b\n= match LP.parse (lp_parse_header (U32.uint_to_t cid_len) (Secret.to_u64 (U64.uint_to_t last))) b with\n | None -> H_Failure\n | Some (h, consumed) -> H_Success h (Seq.slice b consumed (Seq.length b))\n\nlet lemma_header_parsing_correct\n h c cid_len last\n=\n let s = format_header h in\n in_window_last_packet_number h;\n FStar.Math.Lemmas.pow2_le_compat 64 62;\n let cid_len' = (U32.uint_to_t cid_len) in\n let last' = (Secret.to_u64 (U64.uint_to_t last)) in\n serialize_header_ext (U32.uint_to_t (dcid_len h)) cid_len' (last_packet_number h) last' h;\n LP.parse_serialize (serialize_header cid_len' last') h;\n LP.parse_strong_prefix (lp_parse_header cid_len' last') s (s `Seq.append` c);\n assert (c `Seq.equal` Seq.slice (s `Seq.append` c) (Seq.length s) (Seq.length (s `Seq.append` c)))\n\nlet lemma_header_parsing_safe\n cid_len last b1 b2\n=\n let cid_len' = (U32.uint_to_t cid_len) in\n let last' = (Secret.to_u64 (U64.uint_to_t last)) in\n match LP.parse (lp_parse_header cid_len' last') b1 with\n | None -> ()\n | Some (h, consumed) ->\n LP.parse_injective (lp_parse_header cid_len' last') b1 b2;\n Seq.lemma_split b1 consumed;\n Seq.lemma_split b2 consumed\n\nlet parse_header_exists\n cid_len last x\n=\n let cid_len' = U32.uint_to_t cid_len in\n let last' = Secret.to_u64 (U64.uint_to_t last) in\n lp_parse_header_eq cid_len' last' x;\n let Some (ph, consumed) = Public.parse_header cid_len' x in\n if Public.is_retry ph\n then ()\n else begin\n LP.parsed_data_is_serialize (Public.serialize_header cid_len') x;\n assert (Seq.index x 0 == Seq.index (LP.serialize (Public.serialize_header cid_len') ph) 0);\n Public.serialize_header_is_retry cid_len' ph;\n let pn_len = get_pn_length ph in\n PN.parse_packet_number_kind'_correct last' pn_len;\n LP.parser_kind_prop_equiv (PN.parse_packet_number_kind' pn_len) (PN.parse_packet_number last' pn_len);\n assert (Some? (LP.parse (PN.parse_packet_number last' pn_len) (Seq.slice x consumed (Seq.length x))))\n end\n\nlet parse_header_exists_recip", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n cid_len: Prims.nat{cid_len <= 20} ->\n last: Prims.nat{last + 1 < Prims.pow2 62} ->\n x: QUIC.Spec.Base.bytes\n -> FStar.Pervasives.Lemma\n (requires H_Success? (QUIC.Spec.Header.Parse.parse_header cid_len last x))\n (ensures Some? (QUIC.Spec.Header.Parse.putative_pn_offset cid_len x))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "Prims.op_Addition", "Prims.pow2", "QUIC.Spec.Base.bytes", "QUIC.Spec.Header.Parse.lp_parse_header_eq", "Lib.IntTypes.int_t", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "Lib.IntTypes.to_u64", "Lib.IntTypes.PUB", "FStar.UInt64.uint_to_t", "FStar.UInt32.t", "FStar.UInt32.uint_to_t", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_header_exists_recip\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (x:bytes)\n: Lemma\n (requires (\n H_Success? (parse_header cid_len last x)\n ))\n (ensures (\n Some? (putative_pn_offset cid_len x)\n ))\nlet parse_header_exists_recip cid_len last x =", "completed_definiton": "let cid_len' = U32.uint_to_t cid_len in\nlet last' = Secret.to_u64 (U64.uint_to_t last) in\nlp_parse_header_eq cid_len' last' x", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.parse_header_exists", "original_source_type": "val parse_header_exists\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (x:bytes)\n: Lemma\n (requires (\n match putative_pn_offset cid_len x with\n | None -> False\n | Some off -> (~ (packet_is_retry x)) ==> off + 4 <= Seq.length x\n ))\n (ensures (\n H_Success? (parse_header cid_len last x)\n ))", "source_type": "val parse_header_exists\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (x:bytes)\n: Lemma\n (requires (\n match putative_pn_offset cid_len x with\n | None -> False\n | Some off -> (~ (packet_is_retry x)) ==> off + 4 <= Seq.length x\n ))\n (ensures (\n H_Success? (parse_header cid_len last x)\n ))", "source_definition": "let parse_header_exists\n cid_len last x\n=\n let cid_len' = U32.uint_to_t cid_len in\n let last' = Secret.to_u64 (U64.uint_to_t last) in\n lp_parse_header_eq cid_len' last' x;\n let Some (ph, consumed) = Public.parse_header cid_len' x in\n if Public.is_retry ph\n then ()\n else begin\n LP.parsed_data_is_serialize (Public.serialize_header cid_len') x;\n assert (Seq.index x 0 == Seq.index (LP.serialize (Public.serialize_header cid_len') ph) 0);\n Public.serialize_header_is_retry cid_len' ph;\n let pn_len = get_pn_length ph in\n PN.parse_packet_number_kind'_correct last' pn_len;\n LP.parser_kind_prop_equiv (PN.parse_packet_number_kind' pn_len) (PN.parse_packet_number last' pn_len);\n assert (Some? (LP.parse (PN.parse_packet_number last' pn_len) (Seq.slice x consumed (Seq.length x))))\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 798, "start_col": 1, "end_line": 813, "end_col": 5 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h\n\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_1 short_dcid_len last h\n\nlet serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_2 short_dcid_len last h;\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n serialize_header_dtuple_eq short_dcid_len last phpn\n\n#push-options \"--z3rlimit 32\"\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n LP.serialize (Public.serialize_header short_dcid_len) ph `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn \n )))\n= serialize_header_eq_3 short_dcid_len last h\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n: Lemma\n (requires (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h\n ))\n (ensures (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h == LP.serialize (serialize_header short_dcid_len2 last2) h\n ))\n= serialize_header_eq short_dcid_len1 last1 h;\n serialize_header_eq short_dcid_len2 last2 h;\n let (| ph, pn |) = synth_header_recip short_dcid_len1 last1 h in\n Public.serialize_header_ext short_dcid_len1 short_dcid_len2 ph;\n if not (is_retry h)\n then PN.serialize_packet_number_ext last1 last2 (pn_length h) pn\n\nlet last_packet_number\n (h: header)\n: GTot PN.last_packet_number_t\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in if Secret.v pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\nlet in_window_last_packet_number\n (h: header)\n: Lemma\n ((~ (is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) (Secret.v (last_packet_number h)) (Secret.v (packet_number h)))\n= ()\n\n(* Fulfill the interface now *)\n\nlet header_len'\n (h: header)\n: GTot nat\n= \n let s = serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h) in\n LP.serialize_length s h;\n Seq.length (LP.serialize s h)\n\nlet header_len'_correct\n (gh: header)\n: Lemma\n (header_len gh == header_len' gh)\n [SMTPat (header_len gh)]\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let cid_len = U32.uint_to_t (dcid_len gh) in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n serialize_header_eq cid_len last gh;\n Public.header_len'_correct cid_len ph;\n if is_retry gh\n then ()\n else begin\n let pn_len = pn_length gh in\n PN.parse_packet_number_kind'_correct last pn_len;\n LP.serialize_length\n #(PN.parse_packet_number_kind' pn_len)\n #_\n #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len))\n (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len))\n pn'\n end\n\nlet format_header\n h\n= LP.serialize (serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\nlet format_header_is_short\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_short cid_len ph\n\nlet format_header_is_retry\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_retry cid_len ph\n\n#push-options \"--z3rlimit 64\"\n\nlet format_header_pn_length\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n let x = Seq.index (format_header h) 0 in\n assert (x == Seq.index (LP.serialize (Public.serialize_header cid_len) ph) 0);\n assert (Public.PShort? ph == MShort? h);\n Public.serialize_get_protected_bits cid_len ph;\n BF.get_bitfield_get_bitfield #8 (U8.v x) 0 (if Public.PShort? ph then 5 else 4) 0 2;\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield x 0 2) == Secret.v (pn_length h) - 1)\n\n#pop-options\n\nlet pn_offset'\n (h: header)\n: GTot nat\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Seq.length (LP.serialize (Public.serialize_header cid_len) ph)\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet pn_offset_prop\n (h: header)\n: Lemma\n (requires (~ (is_retry h)))\n (ensures (\n 0 < pn_offset' h /\\\n pn_offset' h + Secret.v (pn_length h) == Seq.length (format_header h)\n ))\n=\n let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let pn_len = pn_length h in\n PN.parse_packet_number_kind'_correct last pn_len;\n let (| ph, pn |) = synth_header_recip cid_len last h in\n LP.serialize_length (Public.serialize_header cid_len) ph;\n LP.serialize_length #(PN.parse_packet_number_kind' pn_len) #_ #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len)) (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len)) pn\n\n#pop-options\n\nlet pn_offset\n h\n= pn_offset_prop h;\n pn_offset' h\n\nlet putative_pn_offset\n cid_len x\n= if cid_len > 20\n then None\n else\n match LP.parse (Public.parse_header (U32.uint_to_t cid_len)) x with\n | None -> None\n | Some (_, consumed) ->\n LP.parser_kind_prop_equiv (Public.parse_header_kind (U32.uint_to_t cid_len)) (Public.parse_header (U32.uint_to_t cid_len));\n Some (consumed <: nat)\n\nlet putative_pn_offset_frame\n cid_len x1 x2\n= let Some off = putative_pn_offset cid_len x1 in\n let h1 = Seq.index x1 0 in\n let h2 = Seq.index x2 0 in\n assert (Seq.slice x2 0 off `Seq.equal` (h2 `Seq.cons` Seq.tail (Seq.slice x1 0 off)));\n let is_short = BF.get_bitfield (U8.v h1) 7 8 = 0 in\n let number_of_protected_bits = if is_short then 5 else 4 in\n let new_pb = BF.uint8.BF.get_bitfield h2 0 number_of_protected_bits in\n let h1' = BF.uint8.BF.set_bitfield h1 0 number_of_protected_bits new_pb in\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield h2 0 number_of_protected_bits) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield h1' 0 number_of_protected_bits));\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield h2 number_of_protected_bits 8) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield h1' number_of_protected_bits 8));\n BF.get_bitfield_partition_2 #8 number_of_protected_bits (BF.uint8.BF.v h2) (BF.uint8.BF.v h1');\n let cid_len' = U32.uint_to_t cid_len in\n let p = Public.parse_header cid_len' in\n let s = Public.serialize_header cid_len' in\n let Some (ph, consumed) = LP.parse p x1 in\n assert (consumed == off);\n LP.parse_serialize s ph;\n LP.parse_strong_prefix p x1 (Seq.slice x1 0 off);\n LP.parse_injective p (Seq.slice x1 0 off) (LP.serialize s ph);\n assert (LP.serialize s ph == Seq.slice x1 0 off);\n Public.serialize_header_is_short cid_len' ph;\n Public.serialize_set_protected_bits cid_len' ph new_pb;\n let ph2 = Public.set_protected_bits ph new_pb in\n assert (LP.serialize s ph2 == Seq.slice x2 0 off);\n LP.parse_strong_prefix p (Seq.slice x2 0 off) x2\n\n#push-options \"--z3rlimit 32\"\n\nlet putative_pn_offset_intro\n (cid_len : short_dcid_len_t)\n (x: bytes)\n (ph: Public.header' cid_len)\n (off: nat { off <= Seq.length x })\n: Lemma\n (requires (\n LP.parse (Public.parse_header cid_len) x == Some (ph, off)\n ))\n (ensures (putative_pn_offset (U32.v cid_len) x == Some off))\n= ()\n\nlet putative_pn_offset_correct\n h cid_len\n=\n let cid_len_h = U32.uint_to_t (dcid_len h) in\n let last_h = last_packet_number h in\n serialize_header_eq cid_len_h last_h h;\n let (| ph, _ |) = synth_header_recip cid_len_h last_h h in\n let off = Seq.length (LP.serialize (Public.serialize_header cid_len_h) ph) in\n assert (pn_offset h == off);\n let cid_len' = U32.uint_to_t cid_len in\n Public.serialize_header_ext cid_len_h cid_len' ph;\n LP.parse_serialize (Public.serialize_header cid_len') ph;\n LP.parse_strong_prefix (Public.parse_header cid_len') (LP.serialize (Public.serialize_header cid_len') ph) (format_header h);\n LP.parse_injective (Public.parse_header cid_len') (LP.serialize (Public.serialize_header cid_len') ph) (format_header h);\n assert (LP.parse (Public.parse_header cid_len') (format_header h) == Some (ph, off));\n putative_pn_offset_intro cid_len' (format_header h) ph off\n\n#pop-options\n\nlet parse_header\n cid_len last b\n= match LP.parse (lp_parse_header (U32.uint_to_t cid_len) (Secret.to_u64 (U64.uint_to_t last))) b with\n | None -> H_Failure\n | Some (h, consumed) -> H_Success h (Seq.slice b consumed (Seq.length b))\n\nlet lemma_header_parsing_correct\n h c cid_len last\n=\n let s = format_header h in\n in_window_last_packet_number h;\n FStar.Math.Lemmas.pow2_le_compat 64 62;\n let cid_len' = (U32.uint_to_t cid_len) in\n let last' = (Secret.to_u64 (U64.uint_to_t last)) in\n serialize_header_ext (U32.uint_to_t (dcid_len h)) cid_len' (last_packet_number h) last' h;\n LP.parse_serialize (serialize_header cid_len' last') h;\n LP.parse_strong_prefix (lp_parse_header cid_len' last') s (s `Seq.append` c);\n assert (c `Seq.equal` Seq.slice (s `Seq.append` c) (Seq.length s) (Seq.length (s `Seq.append` c)))\n\nlet lemma_header_parsing_safe\n cid_len last b1 b2\n=\n let cid_len' = (U32.uint_to_t cid_len) in\n let last' = (Secret.to_u64 (U64.uint_to_t last)) in\n match LP.parse (lp_parse_header cid_len' last') b1 with\n | None -> ()\n | Some (h, consumed) ->\n LP.parse_injective (lp_parse_header cid_len' last') b1 b2;\n Seq.lemma_split b1 consumed;\n Seq.lemma_split b2 consumed\n\nlet parse_header_exists", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n cid_len: Prims.nat{cid_len <= 20} ->\n last: Prims.nat{last + 1 < Prims.pow2 62} ->\n x: QUIC.Spec.Base.bytes\n -> FStar.Pervasives.Lemma\n (requires\n ((match QUIC.Spec.Header.Parse.putative_pn_offset cid_len x with\n | FStar.Pervasives.Native.None #_ -> Prims.l_False\n | FStar.Pervasives.Native.Some #_ off ->\n ~(QUIC.Spec.Header.Parse.packet_is_retry x) ==> off + 4 <= FStar.Seq.Base.length x)\n <:\n Type0)) (ensures H_Success? (QUIC.Spec.Header.Parse.parse_header cid_len last x))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "Prims.op_Addition", "Prims.pow2", "QUIC.Spec.Base.bytes", "QUIC.Spec.Header.Public.header'", "LowParse.Spec.Base.consumed_length", "QUIC.Spec.Header.Public.is_retry", "Prims.bool", "Prims._assert", "FStar.Pervasives.Native.uu___is_Some", "FStar.Pervasives.Native.tuple2", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "FStar.Seq.Base.slice", "QUIC.Spec.Base.byte", "FStar.Seq.Base.length", "LowParse.Spec.Base.parse", "QUIC.Spec.PacketNumber.parse_packet_number", "Prims.unit", "LowParse.Spec.Base.parser_kind_prop_equiv", "QUIC.Spec.PacketNumber.parse_packet_number_kind'", "QUIC.Spec.PacketNumber.parse_packet_number_kind'_correct", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.Header.Parse.get_pn_length", "QUIC.Spec.Header.Public.serialize_header_is_retry", "Prims.eq2", "FStar.UInt8.t", "FStar.Seq.Base.index", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "LowParse.Spec.Base.parsed_data_is_serialize", "FStar.Pervasives.Native.option", "QUIC.Spec.Header.Parse.lp_parse_header_eq", "Lib.IntTypes.int_t", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "Lib.IntTypes.to_u64", "Lib.IntTypes.PUB", "FStar.UInt64.uint_to_t", "FStar.UInt32.t", "FStar.UInt32.uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_header_exists\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (x:bytes)\n: Lemma\n (requires (\n match putative_pn_offset cid_len x with\n | None -> False\n | Some off -> (~ (packet_is_retry x)) ==> off + 4 <= Seq.length x\n ))\n (ensures (\n H_Success? (parse_header cid_len last x)\n ))\nlet parse_header_exists cid_len last x =", "completed_definiton": "let cid_len' = U32.uint_to_t cid_len in\nlet last' = Secret.to_u64 (U64.uint_to_t last) in\nlp_parse_header_eq cid_len' last' x;\nlet Some (ph, consumed) = Public.parse_header cid_len' x in\nif Public.is_retry ph\nthen ()\nelse\n (LP.parsed_data_is_serialize (Public.serialize_header cid_len') x;\n assert (Seq.index x 0 == Seq.index (LP.serialize (Public.serialize_header cid_len') ph) 0);\n Public.serialize_header_is_retry cid_len' ph;\n let pn_len = get_pn_length ph in\n PN.parse_packet_number_kind'_correct last' pn_len;\n LP.parser_kind_prop_equiv (PN.parse_packet_number_kind' pn_len)\n (PN.parse_packet_number last' pn_len);\n assert (Some? (LP.parse (PN.parse_packet_number last' pn_len)\n (Seq.slice x consumed (Seq.length x)))))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.putative_pn_offset_frame", "original_source_type": "val putative_pn_offset_frame\n (cid_len: nat)\n (x1 x2: bytes)\n: Lemma\n (requires (match putative_pn_offset cid_len x1 with\n | None -> False\n | Some off ->\n off <= Seq.length x2 /\\\n Seq.slice x1 1 off `Seq.equal` Seq.slice x2 1 off /\\ (\n let f1 = Seq.index x1 0 in\n let f2 = Seq.index x2 0 in\n let is_short = BF.get_bitfield (U8.v f1) 7 8 = 0 in\n let number_of_protected_bits = if is_short then 5 else 4 in\n BF.get_bitfield (U8.v f1) number_of_protected_bits 8 == BF.get_bitfield (U8.v f2) number_of_protected_bits 8\n )))\n (ensures (match putative_pn_offset cid_len x1 with\n | None -> False\n | Some off -> putative_pn_offset cid_len x2 == Some (off <: nat)\n ))", "source_type": "val putative_pn_offset_frame\n (cid_len: nat)\n (x1 x2: bytes)\n: Lemma\n (requires (match putative_pn_offset cid_len x1 with\n | None -> False\n | Some off ->\n off <= Seq.length x2 /\\\n Seq.slice x1 1 off `Seq.equal` Seq.slice x2 1 off /\\ (\n let f1 = Seq.index x1 0 in\n let f2 = Seq.index x2 0 in\n let is_short = BF.get_bitfield (U8.v f1) 7 8 = 0 in\n let number_of_protected_bits = if is_short then 5 else 4 in\n BF.get_bitfield (U8.v f1) number_of_protected_bits 8 == BF.get_bitfield (U8.v f2) number_of_protected_bits 8\n )))\n (ensures (match putative_pn_offset cid_len x1 with\n | None -> False\n | Some off -> putative_pn_offset cid_len x2 == Some (off <: nat)\n ))", "source_definition": "let putative_pn_offset_frame\n cid_len x1 x2\n= let Some off = putative_pn_offset cid_len x1 in\n let h1 = Seq.index x1 0 in\n let h2 = Seq.index x2 0 in\n assert (Seq.slice x2 0 off `Seq.equal` (h2 `Seq.cons` Seq.tail (Seq.slice x1 0 off)));\n let is_short = BF.get_bitfield (U8.v h1) 7 8 = 0 in\n let number_of_protected_bits = if is_short then 5 else 4 in\n let new_pb = BF.uint8.BF.get_bitfield h2 0 number_of_protected_bits in\n let h1' = BF.uint8.BF.set_bitfield h1 0 number_of_protected_bits new_pb in\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield h2 0 number_of_protected_bits) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield h1' 0 number_of_protected_bits));\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield h2 number_of_protected_bits 8) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield h1' number_of_protected_bits 8));\n BF.get_bitfield_partition_2 #8 number_of_protected_bits (BF.uint8.BF.v h2) (BF.uint8.BF.v h1');\n let cid_len' = U32.uint_to_t cid_len in\n let p = Public.parse_header cid_len' in\n let s = Public.serialize_header cid_len' in\n let Some (ph, consumed) = LP.parse p x1 in\n assert (consumed == off);\n LP.parse_serialize s ph;\n LP.parse_strong_prefix p x1 (Seq.slice x1 0 off);\n LP.parse_injective p (Seq.slice x1 0 off) (LP.serialize s ph);\n assert (LP.serialize s ph == Seq.slice x1 0 off);\n Public.serialize_header_is_short cid_len' ph;\n Public.serialize_set_protected_bits cid_len' ph new_pb;\n let ph2 = Public.set_protected_bits ph new_pb in\n assert (LP.serialize s ph2 == Seq.slice x2 0 off);\n LP.parse_strong_prefix p (Seq.slice x2 0 off) x2", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 706, "start_col": 1, "end_line": 730, "end_col": 50 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h\n\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_1 short_dcid_len last h\n\nlet serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_2 short_dcid_len last h;\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n serialize_header_dtuple_eq short_dcid_len last phpn\n\n#push-options \"--z3rlimit 32\"\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n LP.serialize (Public.serialize_header short_dcid_len) ph `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn \n )))\n= serialize_header_eq_3 short_dcid_len last h\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n: Lemma\n (requires (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h\n ))\n (ensures (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h == LP.serialize (serialize_header short_dcid_len2 last2) h\n ))\n= serialize_header_eq short_dcid_len1 last1 h;\n serialize_header_eq short_dcid_len2 last2 h;\n let (| ph, pn |) = synth_header_recip short_dcid_len1 last1 h in\n Public.serialize_header_ext short_dcid_len1 short_dcid_len2 ph;\n if not (is_retry h)\n then PN.serialize_packet_number_ext last1 last2 (pn_length h) pn\n\nlet last_packet_number\n (h: header)\n: GTot PN.last_packet_number_t\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in if Secret.v pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\nlet in_window_last_packet_number\n (h: header)\n: Lemma\n ((~ (is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) (Secret.v (last_packet_number h)) (Secret.v (packet_number h)))\n= ()\n\n(* Fulfill the interface now *)\n\nlet header_len'\n (h: header)\n: GTot nat\n= \n let s = serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h) in\n LP.serialize_length s h;\n Seq.length (LP.serialize s h)\n\nlet header_len'_correct\n (gh: header)\n: Lemma\n (header_len gh == header_len' gh)\n [SMTPat (header_len gh)]\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let cid_len = U32.uint_to_t (dcid_len gh) in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n serialize_header_eq cid_len last gh;\n Public.header_len'_correct cid_len ph;\n if is_retry gh\n then ()\n else begin\n let pn_len = pn_length gh in\n PN.parse_packet_number_kind'_correct last pn_len;\n LP.serialize_length\n #(PN.parse_packet_number_kind' pn_len)\n #_\n #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len))\n (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len))\n pn'\n end\n\nlet format_header\n h\n= LP.serialize (serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\nlet format_header_is_short\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_short cid_len ph\n\nlet format_header_is_retry\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_retry cid_len ph\n\n#push-options \"--z3rlimit 64\"\n\nlet format_header_pn_length\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n let x = Seq.index (format_header h) 0 in\n assert (x == Seq.index (LP.serialize (Public.serialize_header cid_len) ph) 0);\n assert (Public.PShort? ph == MShort? h);\n Public.serialize_get_protected_bits cid_len ph;\n BF.get_bitfield_get_bitfield #8 (U8.v x) 0 (if Public.PShort? ph then 5 else 4) 0 2;\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield x 0 2) == Secret.v (pn_length h) - 1)\n\n#pop-options\n\nlet pn_offset'\n (h: header)\n: GTot nat\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Seq.length (LP.serialize (Public.serialize_header cid_len) ph)\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet pn_offset_prop\n (h: header)\n: Lemma\n (requires (~ (is_retry h)))\n (ensures (\n 0 < pn_offset' h /\\\n pn_offset' h + Secret.v (pn_length h) == Seq.length (format_header h)\n ))\n=\n let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let pn_len = pn_length h in\n PN.parse_packet_number_kind'_correct last pn_len;\n let (| ph, pn |) = synth_header_recip cid_len last h in\n LP.serialize_length (Public.serialize_header cid_len) ph;\n LP.serialize_length #(PN.parse_packet_number_kind' pn_len) #_ #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len)) (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len)) pn\n\n#pop-options\n\nlet pn_offset\n h\n= pn_offset_prop h;\n pn_offset' h\n\nlet putative_pn_offset\n cid_len x\n= if cid_len > 20\n then None\n else\n match LP.parse (Public.parse_header (U32.uint_to_t cid_len)) x with\n | None -> None\n | Some (_, consumed) ->\n LP.parser_kind_prop_equiv (Public.parse_header_kind (U32.uint_to_t cid_len)) (Public.parse_header (U32.uint_to_t cid_len));\n Some (consumed <: nat)\n\nlet putative_pn_offset_frame", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "cid_len: Prims.nat -> x1: QUIC.Spec.Base.bytes -> x2: QUIC.Spec.Base.bytes\n -> FStar.Pervasives.Lemma\n (requires\n ((match QUIC.Spec.Header.Parse.putative_pn_offset cid_len x1 with\n | FStar.Pervasives.Native.None #_ -> Prims.l_False\n | FStar.Pervasives.Native.Some #_ off ->\n off <= FStar.Seq.Base.length x2 /\\\n FStar.Seq.Base.equal (FStar.Seq.Base.slice x1 1 off) (FStar.Seq.Base.slice x2 1 off) /\\\n (let f1 = FStar.Seq.Base.index x1 0 in\n let f2 = FStar.Seq.Base.index x2 0 in\n let is_short = LowParse.BitFields.get_bitfield (FStar.UInt8.v f1) 7 8 = 0 in\n let number_of_protected_bits =\n (match is_short with\n | true -> 5\n | _ -> 4)\n <:\n Prims.nat\n in\n LowParse.BitFields.get_bitfield (FStar.UInt8.v f1) number_of_protected_bits 8 ==\n LowParse.BitFields.get_bitfield (FStar.UInt8.v f2) number_of_protected_bits 8))\n <:\n Type0))\n (ensures\n ((match QUIC.Spec.Header.Parse.putative_pn_offset cid_len x1 with\n | FStar.Pervasives.Native.None #_ -> Prims.l_False\n | FStar.Pervasives.Native.Some #_ off ->\n QUIC.Spec.Header.Parse.putative_pn_offset cid_len x2 ==\n FStar.Pervasives.Native.Some off)\n <:\n Type0))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "QUIC.Spec.Base.bytes", "QUIC.Spec.Header.Public.header'", "LowParse.Spec.Base.consumed_length", "LowParse.Spec.Base.parse_strong_prefix", "QUIC.Spec.Header.Public.parse_header_kind", "FStar.Seq.Base.slice", "QUIC.Spec.Base.byte", "Prims.unit", "Prims._assert", "Prims.eq2", "FStar.Seq.Base.seq", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.header", "QUIC.Spec.Header.Public.set_protected_bits", "QUIC.Spec.Header.Public.serialize_set_protected_bits", "QUIC.Spec.Header.Public.serialize_header_is_short", "LowParse.Spec.Base.parse_injective", "LowParse.Spec.Base.parse_serialize", "FStar.Pervasives.Native.option", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Base.parse", "LowParse.Spec.Base.serializer", "QUIC.Spec.Header.Public.serialize_header", "LowParse.Spec.Base.parser", "FStar.UInt32.t", "FStar.UInt32.uint_to_t", "LowParse.BitFields.get_bitfield_partition_2", "LowParse.BitFields.__proj__Mkuint_t__item__v", "FStar.UInt8.t", "LowParse.BitFields.uint8", "FStar.UInt.uint_t", "LowParse.BitFields.__proj__Mkuint_t__item__get_bitfield", "LowParse.BitFields.set_bitfield", "LowParse.BitFields.__proj__Mkuint_t__item__set_bitfield", "LowParse.BitFields.get_bitfield", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.bool", "Prims.op_Equality", "Prims.int", "FStar.UInt8.n", "FStar.UInt8.v", "FStar.Seq.Base.equal", "FStar.Seq.Properties.cons", "FStar.Seq.Properties.tail", "FStar.Seq.Base.index", "Prims.l_True", "Prims.op_LessThan", "FStar.Seq.Base.length", "QUIC.Spec.Base.header_len_bound", "QUIC.Spec.Header.Parse.putative_pn_offset" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val putative_pn_offset_frame\n (cid_len: nat)\n (x1 x2: bytes)\n: Lemma\n (requires (match putative_pn_offset cid_len x1 with\n | None -> False\n | Some off ->\n off <= Seq.length x2 /\\\n Seq.slice x1 1 off `Seq.equal` Seq.slice x2 1 off /\\ (\n let f1 = Seq.index x1 0 in\n let f2 = Seq.index x2 0 in\n let is_short = BF.get_bitfield (U8.v f1) 7 8 = 0 in\n let number_of_protected_bits = if is_short then 5 else 4 in\n BF.get_bitfield (U8.v f1) number_of_protected_bits 8 == BF.get_bitfield (U8.v f2) number_of_protected_bits 8\n )))\n (ensures (match putative_pn_offset cid_len x1 with\n | None -> False\n | Some off -> putative_pn_offset cid_len x2 == Some (off <: nat)\n ))\nlet putative_pn_offset_frame cid_len x1 x2 =", "completed_definiton": "let Some off = putative_pn_offset cid_len x1 in\nlet h1 = Seq.index x1 0 in\nlet h2 = Seq.index x2 0 in\nassert ((Seq.slice x2 0 off) `Seq.equal` (h2 `Seq.cons` (Seq.tail (Seq.slice x1 0 off))));\nlet is_short = BF.get_bitfield (U8.v h1) 7 8 = 0 in\nlet number_of_protected_bits = if is_short then 5 else 4 in\nlet new_pb = BF.uint8.BF.get_bitfield h2 0 number_of_protected_bits in\nlet h1' = BF.uint8.BF.set_bitfield h1 0 number_of_protected_bits new_pb in\nassert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield h2 0 number_of_protected_bits) ==\n BF.uint8.BF.v (BF.uint8.BF.get_bitfield h1' 0 number_of_protected_bits));\nassert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield h2 number_of_protected_bits 8) ==\n BF.uint8.BF.v (BF.uint8.BF.get_bitfield h1' number_of_protected_bits 8));\nBF.get_bitfield_partition_2 #8 number_of_protected_bits (BF.uint8.BF.v h2) (BF.uint8.BF.v h1');\nlet cid_len' = U32.uint_to_t cid_len in\nlet p = Public.parse_header cid_len' in\nlet s = Public.serialize_header cid_len' in\nlet Some (ph, consumed) = LP.parse p x1 in\nassert (consumed == off);\nLP.parse_serialize s ph;\nLP.parse_strong_prefix p x1 (Seq.slice x1 0 off);\nLP.parse_injective p (Seq.slice x1 0 off) (LP.serialize s ph);\nassert (LP.serialize s ph == Seq.slice x1 0 off);\nPublic.serialize_header_is_short cid_len' ph;\nPublic.serialize_set_protected_bits cid_len' ph new_pb;\nlet ph2 = Public.set_protected_bits ph new_pb in\nassert (LP.serialize s ph2 == Seq.slice x2 0 off);\nLP.parse_strong_prefix p (Seq.slice x2 0 off) x2", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.lp_parse_header_eq", "original_source_type": "val lp_parse_header_eq (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t) (x: bytes)\n : Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x ==\n (match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else\n match\n LP.parse (PN.parse_packet_number last (get_pn_length ph))\n (Seq.slice x consumed (Seq.length x))\n with\n | None -> None\n | Some (pn, consumed') ->\n Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')))", "source_type": "val lp_parse_header_eq (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t) (x: bytes)\n : Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x ==\n (match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else\n match\n LP.parse (PN.parse_packet_number last (get_pn_length ph))\n (Seq.slice x consumed (Seq.length x))\n with\n | None -> None\n | Some (pn, consumed') ->\n Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')))", "source_definition": "let lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 397, "start_col": 2, "end_line": 404, "end_col": 46 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n x: QUIC.Spec.Base.bytes\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Base.parse (QUIC.Spec.Header.Parse.lp_parse_header short_dcid_len last) x ==\n (match LowParse.Spec.Base.parse (QUIC.Spec.Header.Public.parse_header short_dcid_len) x with\n | FStar.Pervasives.Native.None #_ -> FStar.Pervasives.Native.None\n | FStar.Pervasives.Native.Some #_ (FStar.Pervasives.Native.Mktuple2 #_ #_ ph consumed) ->\n (match QUIC.Spec.Header.Public.is_retry ph with\n | true ->\n FStar.Pervasives.Native.Some\n (QUIC.Spec.Header.Parse.synth_header short_dcid_len last (| ph, () |), consumed)\n | _ ->\n (match\n LowParse.Spec.Base.parse (QUIC.Spec.PacketNumber.parse_packet_number last\n (QUIC.Spec.Header.Parse.get_pn_length ph))\n (FStar.Seq.Base.slice x consumed (FStar.Seq.Base.length x))\n with\n | FStar.Pervasives.Native.None #_ -> FStar.Pervasives.Native.None\n | FStar.Pervasives.Native.Some\n #_\n (FStar.Pervasives.Native.Mktuple2 #_ #_ pn consumed') ->\n FStar.Pervasives.Native.Some\n (QUIC.Spec.Header.Parse.synth_header short_dcid_len last (| ph, pn |),\n consumed + consumed'))\n <:\n FStar.Pervasives.Native.option (QUIC.Spec.Header.Parse.header' short_dcid_len last *\n LowParse.Spec.Base.consumed_length x))\n <:\n FStar.Pervasives.Native.option (QUIC.Spec.Header.Parse.header' short_dcid_len last *\n LowParse.Spec.Base.consumed_length x)))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Base.bytes", "QUIC.Spec.Header.Parse.parse_header_dtuple_eq", "Prims.unit", "LowParse.Spec.Combinators.parse_synth_eq", "QUIC.Spec.Header.Parse.parse_header_kind", "Prims.dtuple2", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "QUIC.Spec.Header.Parse.header'", "QUIC.Spec.Header.Parse.parse_header_dtuple", "QUIC.Spec.Header.Parse.synth_header", "Prims.l_True", "Prims.squash", "Prims.eq2", "FStar.Pervasives.Native.option", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Base.consumed_length", "LowParse.Spec.Base.parse", "QUIC.Spec.Header.Parse.lp_parse_header", "QUIC.Spec.Header.Public.parse_header", "FStar.Pervasives.Native.None", "QUIC.Spec.Header.Public.is_retry", "FStar.Pervasives.Native.Some", "FStar.Pervasives.Native.Mktuple2", "Prims.Mkdtuple2", "Prims.bool", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "QUIC.Spec.Header.Parse.get_pn_length", "QUIC.Spec.PacketNumber.parse_packet_number", "FStar.Seq.Base.slice", "QUIC.Spec.Base.byte", "FStar.Seq.Base.length", "Prims.op_Addition", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lp_parse_header_eq (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t) (x: bytes)\n : Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x ==\n (match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else\n match\n LP.parse (PN.parse_packet_number last (get_pn_length ph))\n (Seq.slice x consumed (Seq.length x))\n with\n | None -> None\n | Some (pn, consumed') ->\n Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')))\nlet lp_parse_header_eq (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t) (x: bytes)\n : Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x ==\n (match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else\n match\n LP.parse (PN.parse_packet_number last (get_pn_length ph))\n (Seq.slice x consumed (Seq.length x))\n with\n | None -> None\n | Some (pn, consumed') ->\n Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed'))) =", "completed_definiton": "LP.parse_synth_eq #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\nparse_header_dtuple_eq short_dcid_len last x", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.pn_offset_prop", "original_source_type": "val pn_offset_prop (h: header)\n : Lemma (requires (~(is_retry h)))\n (ensures\n (0 < pn_offset' h /\\ pn_offset' h + Secret.v (pn_length h) == Seq.length (format_header h)))", "source_type": "val pn_offset_prop (h: header)\n : Lemma (requires (~(is_retry h)))\n (ensures\n (0 < pn_offset' h /\\ pn_offset' h + Secret.v (pn_length h) == Seq.length (format_header h)))", "source_definition": "let pn_offset_prop\n (h: header)\n: Lemma\n (requires (~ (is_retry h)))\n (ensures (\n 0 < pn_offset' h /\\\n pn_offset' h + Secret.v (pn_length h) == Seq.length (format_header h)\n ))\n=\n let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let pn_len = pn_length h in\n PN.parse_packet_number_kind'_correct last pn_len;\n let (| ph, pn |) = synth_header_recip cid_len last h in\n LP.serialize_length (Public.serialize_header cid_len) ph;\n LP.serialize_length #(PN.parse_packet_number_kind' pn_len) #_ #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len)) (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len)) pn", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 676, "start_col": 1, "end_line": 684, "end_col": 253 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h\n\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_1 short_dcid_len last h\n\nlet serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_2 short_dcid_len last h;\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n serialize_header_dtuple_eq short_dcid_len last phpn\n\n#push-options \"--z3rlimit 32\"\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n LP.serialize (Public.serialize_header short_dcid_len) ph `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn \n )))\n= serialize_header_eq_3 short_dcid_len last h\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n: Lemma\n (requires (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h\n ))\n (ensures (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h == LP.serialize (serialize_header short_dcid_len2 last2) h\n ))\n= serialize_header_eq short_dcid_len1 last1 h;\n serialize_header_eq short_dcid_len2 last2 h;\n let (| ph, pn |) = synth_header_recip short_dcid_len1 last1 h in\n Public.serialize_header_ext short_dcid_len1 short_dcid_len2 ph;\n if not (is_retry h)\n then PN.serialize_packet_number_ext last1 last2 (pn_length h) pn\n\nlet last_packet_number\n (h: header)\n: GTot PN.last_packet_number_t\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in if Secret.v pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\nlet in_window_last_packet_number\n (h: header)\n: Lemma\n ((~ (is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) (Secret.v (last_packet_number h)) (Secret.v (packet_number h)))\n= ()\n\n(* Fulfill the interface now *)\n\nlet header_len'\n (h: header)\n: GTot nat\n= \n let s = serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h) in\n LP.serialize_length s h;\n Seq.length (LP.serialize s h)\n\nlet header_len'_correct\n (gh: header)\n: Lemma\n (header_len gh == header_len' gh)\n [SMTPat (header_len gh)]\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let cid_len = U32.uint_to_t (dcid_len gh) in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n serialize_header_eq cid_len last gh;\n Public.header_len'_correct cid_len ph;\n if is_retry gh\n then ()\n else begin\n let pn_len = pn_length gh in\n PN.parse_packet_number_kind'_correct last pn_len;\n LP.serialize_length\n #(PN.parse_packet_number_kind' pn_len)\n #_\n #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len))\n (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len))\n pn'\n end\n\nlet format_header\n h\n= LP.serialize (serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\nlet format_header_is_short\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_short cid_len ph\n\nlet format_header_is_retry\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_retry cid_len ph\n\n#push-options \"--z3rlimit 64\"\n\nlet format_header_pn_length\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n let x = Seq.index (format_header h) 0 in\n assert (x == Seq.index (LP.serialize (Public.serialize_header cid_len) ph) 0);\n assert (Public.PShort? ph == MShort? h);\n Public.serialize_get_protected_bits cid_len ph;\n BF.get_bitfield_get_bitfield #8 (U8.v x) 0 (if Public.PShort? ph then 5 else 4) 0 2;\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield x 0 2) == Secret.v (pn_length h) - 1)\n\n#pop-options\n\nlet pn_offset'\n (h: header)\n: GTot nat\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Seq.length (LP.serialize (Public.serialize_header cid_len) ph)\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet pn_offset_prop\n (h: header)\n: Lemma\n (requires (~ (is_retry h)))\n (ensures (\n 0 < pn_offset' h /\\\n pn_offset' h + Secret.v (pn_length h) == Seq.length (format_header h)", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header\n -> FStar.Pervasives.Lemma (requires ~(QUIC.Spec.Header.Base.is_retry h))\n (ensures\n 0 < QUIC.Spec.Header.Parse.pn_offset' h /\\\n QUIC.Spec.Header.Parse.pn_offset' h +\n QUIC.Secret.Int.Base.v (QUIC.Spec.Header.Base.pn_length h) ==\n FStar.Seq.Base.length (QUIC.Spec.Header.Parse.format_header h))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "LowParse.Spec.Base.serialize_length", "QUIC.Spec.PacketNumber.parse_packet_number_kind'", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "QUIC.Spec.PacketNumber.parse_packet_number", "LowParse.Spec.Base.bare_parser", "QUIC.Spec.PacketNumber.serialize_packet_number", "LowParse.Spec.Base.bare_serializer", "Prims.unit", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "Prims.dtuple2", "QUIC.Spec.Header.Parse.synth_header_recip", "QUIC.Spec.PacketNumber.parse_packet_number_kind'_correct", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.Header.Base.pn_length", "QUIC.Spec.Header.Parse.serialize_header_eq", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Parse.last_packet_number", "FStar.UInt32.t", "FStar.UInt32.uint_to_t", "QUIC.Spec.Header.Base.dcid_len", "Prims.l_not", "Prims.b2t", "QUIC.Spec.Header.Base.is_retry", "Prims.squash", "Prims.l_and", "Prims.op_LessThan", "QUIC.Spec.Header.Parse.pn_offset'", "Prims.eq2", "Prims.int", "Prims.op_Addition", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "QUIC.Spec.Header.Parse.format_header", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val pn_offset_prop (h: header)\n : Lemma (requires (~(is_retry h)))\n (ensures\n (0 < pn_offset' h /\\ pn_offset' h + Secret.v (pn_length h) == Seq.length (format_header h)))\nlet pn_offset_prop (h: header)\n : Lemma (requires (~(is_retry h)))\n (ensures\n (0 < pn_offset' h /\\ pn_offset' h + Secret.v (pn_length h) == Seq.length (format_header h))) =", "completed_definiton": "let cid_len = U32.uint_to_t (dcid_len h) in\nlet last = last_packet_number h in\nserialize_header_eq cid_len last h;\nlet pn_len = pn_length h in\nPN.parse_packet_number_kind'_correct last pn_len;\nlet (| ph , pn |) = synth_header_recip cid_len last h in\nLP.serialize_length (Public.serialize_header cid_len) ph;\nLP.serialize_length #(PN.parse_packet_number_kind' pn_len)\n #_\n #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len))\n (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len))\n pn", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.lemma_header_parsing_correct", "original_source_type": "val lemma_header_parsing_correct:\n h: header ->\n c: bytes ->\n cid_len: nat { cid_len <= 20 } ->\n last: nat { last + 1 < pow2 62 } ->\n Lemma\n (requires (\n is_valid_header h cid_len last\n ))\n (ensures (\n parse_header cid_len last S.(format_header h @| c)\n == H_Success h c))", "source_type": "val lemma_header_parsing_correct:\n h: header ->\n c: bytes ->\n cid_len: nat { cid_len <= 20 } ->\n last: nat { last + 1 < pow2 62 } ->\n Lemma\n (requires (\n is_valid_header h cid_len last\n ))\n (ensures (\n parse_header cid_len last S.(format_header h @| c)\n == H_Success h c))", "source_definition": "let lemma_header_parsing_correct\n h c cid_len last\n=\n let s = format_header h in\n in_window_last_packet_number h;\n FStar.Math.Lemmas.pow2_le_compat 64 62;\n let cid_len' = (U32.uint_to_t cid_len) in\n let last' = (Secret.to_u64 (U64.uint_to_t last)) in\n serialize_header_ext (U32.uint_to_t (dcid_len h)) cid_len' (last_packet_number h) last' h;\n LP.parse_serialize (serialize_header cid_len' last') h;\n LP.parse_strong_prefix (lp_parse_header cid_len' last') s (s `Seq.append` c);\n assert (c `Seq.equal` Seq.slice (s `Seq.append` c) (Seq.length s) (Seq.length (s `Seq.append` c)))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 773, "start_col": 1, "end_line": 782, "end_col": 100 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h\n\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_1 short_dcid_len last h\n\nlet serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_2 short_dcid_len last h;\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n serialize_header_dtuple_eq short_dcid_len last phpn\n\n#push-options \"--z3rlimit 32\"\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n LP.serialize (Public.serialize_header short_dcid_len) ph `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn \n )))\n= serialize_header_eq_3 short_dcid_len last h\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n: Lemma\n (requires (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h\n ))\n (ensures (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h == LP.serialize (serialize_header short_dcid_len2 last2) h\n ))\n= serialize_header_eq short_dcid_len1 last1 h;\n serialize_header_eq short_dcid_len2 last2 h;\n let (| ph, pn |) = synth_header_recip short_dcid_len1 last1 h in\n Public.serialize_header_ext short_dcid_len1 short_dcid_len2 ph;\n if not (is_retry h)\n then PN.serialize_packet_number_ext last1 last2 (pn_length h) pn\n\nlet last_packet_number\n (h: header)\n: GTot PN.last_packet_number_t\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in if Secret.v pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\nlet in_window_last_packet_number\n (h: header)\n: Lemma\n ((~ (is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) (Secret.v (last_packet_number h)) (Secret.v (packet_number h)))\n= ()\n\n(* Fulfill the interface now *)\n\nlet header_len'\n (h: header)\n: GTot nat\n= \n let s = serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h) in\n LP.serialize_length s h;\n Seq.length (LP.serialize s h)\n\nlet header_len'_correct\n (gh: header)\n: Lemma\n (header_len gh == header_len' gh)\n [SMTPat (header_len gh)]\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let cid_len = U32.uint_to_t (dcid_len gh) in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n serialize_header_eq cid_len last gh;\n Public.header_len'_correct cid_len ph;\n if is_retry gh\n then ()\n else begin\n let pn_len = pn_length gh in\n PN.parse_packet_number_kind'_correct last pn_len;\n LP.serialize_length\n #(PN.parse_packet_number_kind' pn_len)\n #_\n #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len))\n (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len))\n pn'\n end\n\nlet format_header\n h\n= LP.serialize (serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\nlet format_header_is_short\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_short cid_len ph\n\nlet format_header_is_retry\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_retry cid_len ph\n\n#push-options \"--z3rlimit 64\"\n\nlet format_header_pn_length\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n let x = Seq.index (format_header h) 0 in\n assert (x == Seq.index (LP.serialize (Public.serialize_header cid_len) ph) 0);\n assert (Public.PShort? ph == MShort? h);\n Public.serialize_get_protected_bits cid_len ph;\n BF.get_bitfield_get_bitfield #8 (U8.v x) 0 (if Public.PShort? ph then 5 else 4) 0 2;\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield x 0 2) == Secret.v (pn_length h) - 1)\n\n#pop-options\n\nlet pn_offset'\n (h: header)\n: GTot nat\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Seq.length (LP.serialize (Public.serialize_header cid_len) ph)\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet pn_offset_prop\n (h: header)\n: Lemma\n (requires (~ (is_retry h)))\n (ensures (\n 0 < pn_offset' h /\\\n pn_offset' h + Secret.v (pn_length h) == Seq.length (format_header h)\n ))\n=\n let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let pn_len = pn_length h in\n PN.parse_packet_number_kind'_correct last pn_len;\n let (| ph, pn |) = synth_header_recip cid_len last h in\n LP.serialize_length (Public.serialize_header cid_len) ph;\n LP.serialize_length #(PN.parse_packet_number_kind' pn_len) #_ #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len)) (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len)) pn\n\n#pop-options\n\nlet pn_offset\n h\n= pn_offset_prop h;\n pn_offset' h\n\nlet putative_pn_offset\n cid_len x\n= if cid_len > 20\n then None\n else\n match LP.parse (Public.parse_header (U32.uint_to_t cid_len)) x with\n | None -> None\n | Some (_, consumed) ->\n LP.parser_kind_prop_equiv (Public.parse_header_kind (U32.uint_to_t cid_len)) (Public.parse_header (U32.uint_to_t cid_len));\n Some (consumed <: nat)\n\nlet putative_pn_offset_frame\n cid_len x1 x2\n= let Some off = putative_pn_offset cid_len x1 in\n let h1 = Seq.index x1 0 in\n let h2 = Seq.index x2 0 in\n assert (Seq.slice x2 0 off `Seq.equal` (h2 `Seq.cons` Seq.tail (Seq.slice x1 0 off)));\n let is_short = BF.get_bitfield (U8.v h1) 7 8 = 0 in\n let number_of_protected_bits = if is_short then 5 else 4 in\n let new_pb = BF.uint8.BF.get_bitfield h2 0 number_of_protected_bits in\n let h1' = BF.uint8.BF.set_bitfield h1 0 number_of_protected_bits new_pb in\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield h2 0 number_of_protected_bits) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield h1' 0 number_of_protected_bits));\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield h2 number_of_protected_bits 8) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield h1' number_of_protected_bits 8));\n BF.get_bitfield_partition_2 #8 number_of_protected_bits (BF.uint8.BF.v h2) (BF.uint8.BF.v h1');\n let cid_len' = U32.uint_to_t cid_len in\n let p = Public.parse_header cid_len' in\n let s = Public.serialize_header cid_len' in\n let Some (ph, consumed) = LP.parse p x1 in\n assert (consumed == off);\n LP.parse_serialize s ph;\n LP.parse_strong_prefix p x1 (Seq.slice x1 0 off);\n LP.parse_injective p (Seq.slice x1 0 off) (LP.serialize s ph);\n assert (LP.serialize s ph == Seq.slice x1 0 off);\n Public.serialize_header_is_short cid_len' ph;\n Public.serialize_set_protected_bits cid_len' ph new_pb;\n let ph2 = Public.set_protected_bits ph new_pb in\n assert (LP.serialize s ph2 == Seq.slice x2 0 off);\n LP.parse_strong_prefix p (Seq.slice x2 0 off) x2\n\n#push-options \"--z3rlimit 32\"\n\nlet putative_pn_offset_intro\n (cid_len : short_dcid_len_t)\n (x: bytes)\n (ph: Public.header' cid_len)\n (off: nat { off <= Seq.length x })\n: Lemma\n (requires (\n LP.parse (Public.parse_header cid_len) x == Some (ph, off)\n ))\n (ensures (putative_pn_offset (U32.v cid_len) x == Some off))\n= ()\n\nlet putative_pn_offset_correct\n h cid_len\n=\n let cid_len_h = U32.uint_to_t (dcid_len h) in\n let last_h = last_packet_number h in\n serialize_header_eq cid_len_h last_h h;\n let (| ph, _ |) = synth_header_recip cid_len_h last_h h in\n let off = Seq.length (LP.serialize (Public.serialize_header cid_len_h) ph) in\n assert (pn_offset h == off);\n let cid_len' = U32.uint_to_t cid_len in\n Public.serialize_header_ext cid_len_h cid_len' ph;\n LP.parse_serialize (Public.serialize_header cid_len') ph;\n LP.parse_strong_prefix (Public.parse_header cid_len') (LP.serialize (Public.serialize_header cid_len') ph) (format_header h);\n LP.parse_injective (Public.parse_header cid_len') (LP.serialize (Public.serialize_header cid_len') ph) (format_header h);\n assert (LP.parse (Public.parse_header cid_len') (format_header h) == Some (ph, off));\n putative_pn_offset_intro cid_len' (format_header h) ph off\n\n#pop-options\n\nlet parse_header\n cid_len last b\n= match LP.parse (lp_parse_header (U32.uint_to_t cid_len) (Secret.to_u64 (U64.uint_to_t last))) b with\n | None -> H_Failure\n | Some (h, consumed) -> H_Success h (Seq.slice b consumed (Seq.length b))\n\nlet lemma_header_parsing_correct", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n h: QUIC.Spec.Header.Base.header ->\n c: QUIC.Spec.Base.bytes ->\n cid_len: Prims.nat{cid_len <= 20} ->\n last: Prims.nat{last + 1 < Prims.pow2 62}\n -> FStar.Pervasives.Lemma (requires QUIC.Spec.Header.Base.is_valid_header h cid_len last)\n (ensures\n QUIC.Spec.Header.Parse.parse_header cid_len\n last\n (QUIC.Spec.Header.Parse.format_header h @| c) ==\n QUIC.Spec.Header.Parse.H_Success h c)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "QUIC.Spec.Base.bytes", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "Prims.op_Addition", "Prims.pow2", "Prims._assert", "FStar.Seq.Base.equal", "QUIC.Spec.Base.byte", "FStar.Seq.Base.slice", "FStar.Seq.Base.append", "FStar.Seq.Base.length", "Prims.unit", "LowParse.Spec.Base.parse_strong_prefix", "QUIC.Spec.Header.Parse.parse_header_kind", "QUIC.Spec.Header.Parse.header'", "QUIC.Spec.Header.Parse.lp_parse_header", "LowParse.Spec.Base.parse_serialize", "QUIC.Spec.Header.Parse.serialize_header", "QUIC.Spec.Header.Parse.serialize_header_ext", "FStar.UInt32.uint_to_t", "QUIC.Spec.Header.Base.dcid_len", "QUIC.Spec.Header.Parse.last_packet_number", "Lib.IntTypes.int_t", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "Lib.IntTypes.to_u64", "Lib.IntTypes.PUB", "FStar.UInt64.uint_to_t", "FStar.UInt32.t", "FStar.Math.Lemmas.pow2_le_compat", "QUIC.Spec.Header.Parse.in_window_last_packet_number", "QUIC.Spec.Base.lbytes", "QUIC.Spec.Header.Base.header_len", "QUIC.Spec.Header.Parse.format_header" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_header_parsing_correct:\n h: header ->\n c: bytes ->\n cid_len: nat { cid_len <= 20 } ->\n last: nat { last + 1 < pow2 62 } ->\n Lemma\n (requires (\n is_valid_header h cid_len last\n ))\n (ensures (\n parse_header cid_len last S.(format_header h @| c)\n == H_Success h c))\nlet lemma_header_parsing_correct h c cid_len last =", "completed_definiton": "let s = format_header h in\nin_window_last_packet_number h;\nFStar.Math.Lemmas.pow2_le_compat 64 62;\nlet cid_len' = (U32.uint_to_t cid_len) in\nlet last' = (Secret.to_u64 (U64.uint_to_t last)) in\nserialize_header_ext (U32.uint_to_t (dcid_len h)) cid_len' (last_packet_number h) last' h;\nLP.parse_serialize (serialize_header cid_len' last') h;\nLP.parse_strong_prefix (lp_parse_header cid_len' last') s (s `Seq.append` c);\nassert (c `Seq.equal` (Seq.slice (s `Seq.append` c) (Seq.length s) (Seq.length (s `Seq.append` c))))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.lemma_header_parsing_safe", "original_source_type": "val lemma_header_parsing_safe: cid_len: nat -> last: nat -> b1:bytes -> b2:bytes -> Lemma\n (requires (\n cid_len <= 20 /\\\n last + 1 < pow2 62 /\\\n parse_header cid_len last b1 == parse_header cid_len last b2\n ))\n (ensures parse_header cid_len last b1 == H_Failure \\/ b1 = b2)", "source_type": "val lemma_header_parsing_safe: cid_len: nat -> last: nat -> b1:bytes -> b2:bytes -> Lemma\n (requires (\n cid_len <= 20 /\\\n last + 1 < pow2 62 /\\\n parse_header cid_len last b1 == parse_header cid_len last b2\n ))\n (ensures parse_header cid_len last b1 == H_Failure \\/ b1 = b2)", "source_definition": "let lemma_header_parsing_safe\n cid_len last b1 b2\n=\n let cid_len' = (U32.uint_to_t cid_len) in\n let last' = (Secret.to_u64 (U64.uint_to_t last)) in\n match LP.parse (lp_parse_header cid_len' last') b1 with\n | None -> ()\n | Some (h, consumed) ->\n LP.parse_injective (lp_parse_header cid_len' last') b1 b2;\n Seq.lemma_split b1 consumed;\n Seq.lemma_split b2 consumed", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 786, "start_col": 1, "end_line": 794, "end_col": 31 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h\n\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_1 short_dcid_len last h\n\nlet serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_2 short_dcid_len last h;\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n serialize_header_dtuple_eq short_dcid_len last phpn\n\n#push-options \"--z3rlimit 32\"\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n LP.serialize (Public.serialize_header short_dcid_len) ph `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn \n )))\n= serialize_header_eq_3 short_dcid_len last h\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n: Lemma\n (requires (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h\n ))\n (ensures (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h == LP.serialize (serialize_header short_dcid_len2 last2) h\n ))\n= serialize_header_eq short_dcid_len1 last1 h;\n serialize_header_eq short_dcid_len2 last2 h;\n let (| ph, pn |) = synth_header_recip short_dcid_len1 last1 h in\n Public.serialize_header_ext short_dcid_len1 short_dcid_len2 ph;\n if not (is_retry h)\n then PN.serialize_packet_number_ext last1 last2 (pn_length h) pn\n\nlet last_packet_number\n (h: header)\n: GTot PN.last_packet_number_t\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in if Secret.v pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\nlet in_window_last_packet_number\n (h: header)\n: Lemma\n ((~ (is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) (Secret.v (last_packet_number h)) (Secret.v (packet_number h)))\n= ()\n\n(* Fulfill the interface now *)\n\nlet header_len'\n (h: header)\n: GTot nat\n= \n let s = serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h) in\n LP.serialize_length s h;\n Seq.length (LP.serialize s h)\n\nlet header_len'_correct\n (gh: header)\n: Lemma\n (header_len gh == header_len' gh)\n [SMTPat (header_len gh)]\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let cid_len = U32.uint_to_t (dcid_len gh) in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n serialize_header_eq cid_len last gh;\n Public.header_len'_correct cid_len ph;\n if is_retry gh\n then ()\n else begin\n let pn_len = pn_length gh in\n PN.parse_packet_number_kind'_correct last pn_len;\n LP.serialize_length\n #(PN.parse_packet_number_kind' pn_len)\n #_\n #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len))\n (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len))\n pn'\n end\n\nlet format_header\n h\n= LP.serialize (serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\nlet format_header_is_short\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_short cid_len ph\n\nlet format_header_is_retry\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_retry cid_len ph\n\n#push-options \"--z3rlimit 64\"\n\nlet format_header_pn_length\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n let x = Seq.index (format_header h) 0 in\n assert (x == Seq.index (LP.serialize (Public.serialize_header cid_len) ph) 0);\n assert (Public.PShort? ph == MShort? h);\n Public.serialize_get_protected_bits cid_len ph;\n BF.get_bitfield_get_bitfield #8 (U8.v x) 0 (if Public.PShort? ph then 5 else 4) 0 2;\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield x 0 2) == Secret.v (pn_length h) - 1)\n\n#pop-options\n\nlet pn_offset'\n (h: header)\n: GTot nat\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Seq.length (LP.serialize (Public.serialize_header cid_len) ph)\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet pn_offset_prop\n (h: header)\n: Lemma\n (requires (~ (is_retry h)))\n (ensures (\n 0 < pn_offset' h /\\\n pn_offset' h + Secret.v (pn_length h) == Seq.length (format_header h)\n ))\n=\n let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let pn_len = pn_length h in\n PN.parse_packet_number_kind'_correct last pn_len;\n let (| ph, pn |) = synth_header_recip cid_len last h in\n LP.serialize_length (Public.serialize_header cid_len) ph;\n LP.serialize_length #(PN.parse_packet_number_kind' pn_len) #_ #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len)) (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len)) pn\n\n#pop-options\n\nlet pn_offset\n h\n= pn_offset_prop h;\n pn_offset' h\n\nlet putative_pn_offset\n cid_len x\n= if cid_len > 20\n then None\n else\n match LP.parse (Public.parse_header (U32.uint_to_t cid_len)) x with\n | None -> None\n | Some (_, consumed) ->\n LP.parser_kind_prop_equiv (Public.parse_header_kind (U32.uint_to_t cid_len)) (Public.parse_header (U32.uint_to_t cid_len));\n Some (consumed <: nat)\n\nlet putative_pn_offset_frame\n cid_len x1 x2\n= let Some off = putative_pn_offset cid_len x1 in\n let h1 = Seq.index x1 0 in\n let h2 = Seq.index x2 0 in\n assert (Seq.slice x2 0 off `Seq.equal` (h2 `Seq.cons` Seq.tail (Seq.slice x1 0 off)));\n let is_short = BF.get_bitfield (U8.v h1) 7 8 = 0 in\n let number_of_protected_bits = if is_short then 5 else 4 in\n let new_pb = BF.uint8.BF.get_bitfield h2 0 number_of_protected_bits in\n let h1' = BF.uint8.BF.set_bitfield h1 0 number_of_protected_bits new_pb in\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield h2 0 number_of_protected_bits) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield h1' 0 number_of_protected_bits));\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield h2 number_of_protected_bits 8) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield h1' number_of_protected_bits 8));\n BF.get_bitfield_partition_2 #8 number_of_protected_bits (BF.uint8.BF.v h2) (BF.uint8.BF.v h1');\n let cid_len' = U32.uint_to_t cid_len in\n let p = Public.parse_header cid_len' in\n let s = Public.serialize_header cid_len' in\n let Some (ph, consumed) = LP.parse p x1 in\n assert (consumed == off);\n LP.parse_serialize s ph;\n LP.parse_strong_prefix p x1 (Seq.slice x1 0 off);\n LP.parse_injective p (Seq.slice x1 0 off) (LP.serialize s ph);\n assert (LP.serialize s ph == Seq.slice x1 0 off);\n Public.serialize_header_is_short cid_len' ph;\n Public.serialize_set_protected_bits cid_len' ph new_pb;\n let ph2 = Public.set_protected_bits ph new_pb in\n assert (LP.serialize s ph2 == Seq.slice x2 0 off);\n LP.parse_strong_prefix p (Seq.slice x2 0 off) x2\n\n#push-options \"--z3rlimit 32\"\n\nlet putative_pn_offset_intro\n (cid_len : short_dcid_len_t)\n (x: bytes)\n (ph: Public.header' cid_len)\n (off: nat { off <= Seq.length x })\n: Lemma\n (requires (\n LP.parse (Public.parse_header cid_len) x == Some (ph, off)\n ))\n (ensures (putative_pn_offset (U32.v cid_len) x == Some off))\n= ()\n\nlet putative_pn_offset_correct\n h cid_len\n=\n let cid_len_h = U32.uint_to_t (dcid_len h) in\n let last_h = last_packet_number h in\n serialize_header_eq cid_len_h last_h h;\n let (| ph, _ |) = synth_header_recip cid_len_h last_h h in\n let off = Seq.length (LP.serialize (Public.serialize_header cid_len_h) ph) in\n assert (pn_offset h == off);\n let cid_len' = U32.uint_to_t cid_len in\n Public.serialize_header_ext cid_len_h cid_len' ph;\n LP.parse_serialize (Public.serialize_header cid_len') ph;\n LP.parse_strong_prefix (Public.parse_header cid_len') (LP.serialize (Public.serialize_header cid_len') ph) (format_header h);\n LP.parse_injective (Public.parse_header cid_len') (LP.serialize (Public.serialize_header cid_len') ph) (format_header h);\n assert (LP.parse (Public.parse_header cid_len') (format_header h) == Some (ph, off));\n putative_pn_offset_intro cid_len' (format_header h) ph off\n\n#pop-options\n\nlet parse_header\n cid_len last b\n= match LP.parse (lp_parse_header (U32.uint_to_t cid_len) (Secret.to_u64 (U64.uint_to_t last))) b with\n | None -> H_Failure\n | Some (h, consumed) -> H_Success h (Seq.slice b consumed (Seq.length b))\n\nlet lemma_header_parsing_correct\n h c cid_len last\n=\n let s = format_header h in\n in_window_last_packet_number h;\n FStar.Math.Lemmas.pow2_le_compat 64 62;\n let cid_len' = (U32.uint_to_t cid_len) in\n let last' = (Secret.to_u64 (U64.uint_to_t last)) in\n serialize_header_ext (U32.uint_to_t (dcid_len h)) cid_len' (last_packet_number h) last' h;\n LP.parse_serialize (serialize_header cid_len' last') h;\n LP.parse_strong_prefix (lp_parse_header cid_len' last') s (s `Seq.append` c);\n assert (c `Seq.equal` Seq.slice (s `Seq.append` c) (Seq.length s) (Seq.length (s `Seq.append` c)))\n\nlet lemma_header_parsing_safe", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "cid_len: Prims.nat -> last: Prims.nat -> b1: QUIC.Spec.Base.bytes -> b2: QUIC.Spec.Base.bytes\n -> FStar.Pervasives.Lemma\n (requires\n cid_len <= 20 /\\ last + 1 < Prims.pow2 62 /\\\n QUIC.Spec.Header.Parse.parse_header cid_len last b1 ==\n QUIC.Spec.Header.Parse.parse_header cid_len last b2)\n (ensures\n QUIC.Spec.Header.Parse.parse_header cid_len last b1 == QUIC.Spec.Header.Parse.H_Failure \\/\n b1 = b2)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "QUIC.Spec.Base.bytes", "LowParse.Spec.Base.parse", "QUIC.Spec.Header.Parse.header'", "QUIC.Spec.Header.Parse.lp_parse_header", "LowParse.Spec.Base.consumed_length", "FStar.Seq.Properties.lemma_split", "QUIC.Spec.Base.byte", "Prims.unit", "LowParse.Spec.Base.parse_injective", "QUIC.Spec.Header.Parse.parse_header_kind", "Lib.IntTypes.int_t", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "Lib.IntTypes.to_u64", "Lib.IntTypes.PUB", "FStar.UInt64.uint_to_t", "FStar.UInt32.t", "FStar.UInt32.uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_header_parsing_safe: cid_len: nat -> last: nat -> b1:bytes -> b2:bytes -> Lemma\n (requires (\n cid_len <= 20 /\\\n last + 1 < pow2 62 /\\\n parse_header cid_len last b1 == parse_header cid_len last b2\n ))\n (ensures parse_header cid_len last b1 == H_Failure \\/ b1 = b2)\nlet lemma_header_parsing_safe cid_len last b1 b2 =", "completed_definiton": "let cid_len' = (U32.uint_to_t cid_len) in\nlet last' = (Secret.to_u64 (U64.uint_to_t last)) in\nmatch LP.parse (lp_parse_header cid_len' last') b1 with\n| None -> ()\n| Some (h, consumed) ->\n LP.parse_injective (lp_parse_header cid_len' last') b1 b2;\n Seq.lemma_split b1 consumed;\n Seq.lemma_split b2 consumed", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.parse_header_dtuple_eq_2", "original_source_type": "val parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n : Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n (match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n match\n LP.parse (parse_packet_number_opt short_dcid_len last ph)\n (Seq.slice x consumed (Seq.length x))\n with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')))", "source_type": "val parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n : Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n (match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n match\n LP.parse (parse_packet_number_opt short_dcid_len last ph)\n (Seq.slice x consumed (Seq.length x))\n with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')))", "source_definition": "let parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 353, "start_col": 2, "end_line": 353, "end_col": 48 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n x: QUIC.Spec.Base.bytes\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Base.parse (QUIC.Spec.Header.Parse.parse_header_dtuple short_dcid_len last) x ==\n (match LowParse.Spec.Base.parse (QUIC.Spec.Header.Public.parse_header short_dcid_len) x with\n | FStar.Pervasives.Native.None #_ -> FStar.Pervasives.Native.None\n | FStar.Pervasives.Native.Some #_ (FStar.Pervasives.Native.Mktuple2 #_ #_ ph consumed) ->\n (match\n LowParse.Spec.Base.parse (QUIC.Spec.Header.Parse.parse_packet_number_opt short_dcid_len\n last\n ph)\n (FStar.Seq.Base.slice x consumed (FStar.Seq.Base.length x))\n with\n | FStar.Pervasives.Native.None #_ -> FStar.Pervasives.Native.None\n | FStar.Pervasives.Native.Some #_ (FStar.Pervasives.Native.Mktuple2 #_ #_ pn consumed') ->\n FStar.Pervasives.Native.Some ((| ph, pn |), consumed + consumed'))\n <:\n FStar.Pervasives.Native.option (Prims.dtuple2 (QUIC.Spec.Header.Public.header' short_dcid_len\n )\n (QUIC.Spec.Header.Parse.packet_number_opt short_dcid_len last) *\n LowParse.Spec.Base.consumed_length x)))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Base.bytes", "QUIC.Spec.Header.Parse.parse_header_dtuple_eq_1", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "FStar.Pervasives.Native.option", "FStar.Pervasives.Native.tuple2", "Prims.dtuple2", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "LowParse.Spec.Base.consumed_length", "LowParse.Spec.Base.parse", "QUIC.Spec.Header.Parse.parse_header_dtuple", "QUIC.Spec.Header.Public.parse_header", "FStar.Pervasives.Native.None", "QUIC.Spec.Header.Parse.parse_packet_number_opt", "FStar.Seq.Base.slice", "QUIC.Spec.Base.byte", "FStar.Seq.Base.length", "FStar.Pervasives.Native.Some", "FStar.Pervasives.Native.Mktuple2", "Prims.Mkdtuple2", "Prims.op_Addition", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n : Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n (match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n match\n LP.parse (parse_packet_number_opt short_dcid_len last ph)\n (Seq.slice x consumed (Seq.length x))\n with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')))\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n : Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n (match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n match\n LP.parse (parse_packet_number_opt short_dcid_len last ph)\n (Seq.slice x consumed (Seq.length x))\n with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed'))) =", "completed_definiton": "parse_header_dtuple_eq_1 short_dcid_len last x", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.parse_header_dtuple_eq", "original_source_type": "val parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n : Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n (match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else\n match\n LP.parse (PN.parse_packet_number last (get_pn_length ph))\n (Seq.slice x consumed (Seq.length x))\n with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')))", "source_type": "val parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n : Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n (match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else\n match\n LP.parse (PN.parse_packet_number last (get_pn_length ph))\n (Seq.slice x consumed (Seq.length x))\n with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')))", "source_definition": "let parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 373, "start_col": 2, "end_line": 378, "end_col": 5 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n x: QUIC.Spec.Base.bytes\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Base.parse (QUIC.Spec.Header.Parse.parse_header_dtuple short_dcid_len last) x ==\n (match LowParse.Spec.Base.parse (QUIC.Spec.Header.Public.parse_header short_dcid_len) x with\n | FStar.Pervasives.Native.None #_ -> FStar.Pervasives.Native.None\n | FStar.Pervasives.Native.Some #_ (FStar.Pervasives.Native.Mktuple2 #_ #_ ph consumed) ->\n (match QUIC.Spec.Header.Public.is_retry ph with\n | true -> FStar.Pervasives.Native.Some ((| ph, () |), consumed)\n | _ ->\n (match\n LowParse.Spec.Base.parse (QUIC.Spec.PacketNumber.parse_packet_number last\n (QUIC.Spec.Header.Parse.get_pn_length ph))\n (FStar.Seq.Base.slice x consumed (FStar.Seq.Base.length x))\n with\n | FStar.Pervasives.Native.None #_ -> FStar.Pervasives.Native.None\n | FStar.Pervasives.Native.Some\n #_\n (FStar.Pervasives.Native.Mktuple2 #_ #_ pn consumed') ->\n FStar.Pervasives.Native.Some ((| ph, pn |), consumed + consumed'))\n <:\n FStar.Pervasives.Native.option (Prims.dtuple2 (QUIC.Spec.Header.Public.header' short_dcid_len\n )\n (QUIC.Spec.Header.Parse.packet_number_opt short_dcid_len last) *\n LowParse.Spec.Base.consumed_length x))\n <:\n FStar.Pervasives.Native.option (Prims.dtuple2 (QUIC.Spec.Header.Public.header' short_dcid_len\n )\n (QUIC.Spec.Header.Parse.packet_number_opt short_dcid_len last) *\n LowParse.Spec.Base.consumed_length x)))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Base.bytes", "LowParse.Spec.Combinators.parse_dtuple2_eq'", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Parse.parse_packet_number_opt_kind", "QUIC.Spec.Header.Parse.packet_number_opt", "QUIC.Spec.Header.Parse.parse_packet_number_opt", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "FStar.Pervasives.Native.option", "FStar.Pervasives.Native.tuple2", "Prims.dtuple2", "LowParse.Spec.Base.consumed_length", "LowParse.Spec.Base.parse", "QUIC.Spec.Header.Parse.parse_header_dtuple", "FStar.Pervasives.Native.None", "QUIC.Spec.Header.Public.is_retry", "FStar.Pervasives.Native.Some", "FStar.Pervasives.Native.Mktuple2", "Prims.Mkdtuple2", "Prims.bool", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "QUIC.Spec.Header.Parse.get_pn_length", "QUIC.Spec.PacketNumber.parse_packet_number", "FStar.Seq.Base.slice", "QUIC.Spec.Base.byte", "FStar.Seq.Base.length", "Prims.op_Addition", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n : Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n (match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else\n match\n LP.parse (PN.parse_packet_number last (get_pn_length ph))\n (Seq.slice x consumed (Seq.length x))\n with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')))\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n : Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n (match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else\n match\n LP.parse (PN.parse_packet_number last (get_pn_length ph))\n (Seq.slice x consumed (Seq.length x))\n with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed'))) =", "completed_definiton": "LP.parse_dtuple2_eq' #_\n #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_\n #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.serialize_header_ext", "original_source_type": "val serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n : Lemma\n (requires\n (parse_header_prop short_dcid_len1 last1 h /\\ parse_header_prop short_dcid_len2 last2 h))\n (ensures\n (parse_header_prop short_dcid_len1 last1 h /\\ parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h ==\n LP.serialize (serialize_header short_dcid_len2 last2) h))", "source_type": "val serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n : Lemma\n (requires\n (parse_header_prop short_dcid_len1 last1 h /\\ parse_header_prop short_dcid_len2 last2 h))\n (ensures\n (parse_header_prop short_dcid_len1 last1 h /\\ parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h ==\n LP.serialize (serialize_header short_dcid_len2 last2) h))", "source_definition": "let serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n: Lemma\n (requires (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h\n ))\n (ensures (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h == LP.serialize (serialize_header short_dcid_len2 last2) h\n ))\n= serialize_header_eq short_dcid_len1 last1 h;\n serialize_header_eq short_dcid_len2 last2 h;\n let (| ph, pn |) = synth_header_recip short_dcid_len1 last1 h in\n Public.serialize_header_ext short_dcid_len1 short_dcid_len2 ph;\n if not (is_retry h)\n then PN.serialize_packet_number_ext last1 last2 (pn_length h) pn", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 564, "start_col": 2, "end_line": 569, "end_col": 66 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h\n\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_1 short_dcid_len last h\n\nlet serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_2 short_dcid_len last h;\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n serialize_header_dtuple_eq short_dcid_len last phpn\n\n#push-options \"--z3rlimit 32\"\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n LP.serialize (Public.serialize_header short_dcid_len) ph `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn \n )))\n= serialize_header_eq_3 short_dcid_len last h\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n: Lemma\n (requires (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h\n ))\n (ensures (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h == LP.serialize (serialize_header short_dcid_len2 last2) h", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len1: QUIC.Spec.Base.short_dcid_len_t ->\n short_dcid_len2: QUIC.Spec.Base.short_dcid_len_t ->\n last1: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n last2: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n h: QUIC.Spec.Header.Base.header\n -> FStar.Pervasives.Lemma\n (requires\n QUIC.Spec.Header.Parse.parse_header_prop short_dcid_len1 last1 h /\\\n QUIC.Spec.Header.Parse.parse_header_prop short_dcid_len2 last2 h)\n (ensures\n QUIC.Spec.Header.Parse.parse_header_prop short_dcid_len1 last1 h /\\\n QUIC.Spec.Header.Parse.parse_header_prop short_dcid_len2 last2 h /\\\n LowParse.Spec.Base.serialize (QUIC.Spec.Header.Parse.serialize_header short_dcid_len1 last1)\n h ==\n LowParse.Spec.Base.serialize (QUIC.Spec.Header.Parse.serialize_header short_dcid_len2 last2)\n h)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Base.header", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "Prims.op_Negation", "QUIC.Spec.Header.Base.is_retry", "QUIC.Spec.PacketNumber.serialize_packet_number_ext", "QUIC.Spec.Header.Base.pn_length", "Prims.bool", "Prims.unit", "QUIC.Spec.Header.Public.serialize_header_ext", "Prims.dtuple2", "QUIC.Spec.Header.Parse.synth_header_recip", "QUIC.Spec.Header.Parse.serialize_header_eq", "Prims.l_and", "Prims.b2t", "QUIC.Spec.Header.Parse.parse_header_prop", "Prims.squash", "Prims.eq2", "LowParse.Bytes.bytes", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Parse.parse_header_kind", "QUIC.Spec.Header.Parse.header'", "QUIC.Spec.Header.Parse.lp_parse_header", "QUIC.Spec.Header.Parse.serialize_header", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n : Lemma\n (requires\n (parse_header_prop short_dcid_len1 last1 h /\\ parse_header_prop short_dcid_len2 last2 h))\n (ensures\n (parse_header_prop short_dcid_len1 last1 h /\\ parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h ==\n LP.serialize (serialize_header short_dcid_len2 last2) h))\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n : Lemma\n (requires\n (parse_header_prop short_dcid_len1 last1 h /\\ parse_header_prop short_dcid_len2 last2 h))\n (ensures\n (parse_header_prop short_dcid_len1 last1 h /\\ parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h ==\n LP.serialize (serialize_header short_dcid_len2 last2) h)) =", "completed_definiton": "serialize_header_eq short_dcid_len1 last1 h;\nserialize_header_eq short_dcid_len2 last2 h;\nlet (| ph , pn |) = synth_header_recip short_dcid_len1 last1 h in\nPublic.serialize_header_ext short_dcid_len1 short_dcid_len2 ph;\nif not (is_retry h) then PN.serialize_packet_number_ext last1 last2 (pn_length h) pn", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.format_header_is_short", "original_source_type": "val format_header_is_short: h: header -> Lemma\n (MShort? h <==> BF.get_bitfield (U8.v (S.index (format_header h) 0)) 7 8 == 0)", "source_type": "val format_header_is_short: h: header -> Lemma\n (MShort? h <==> BF.get_bitfield (U8.v (S.index (format_header h) 0)) 7 8 == 0)", "source_definition": "let format_header_is_short\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_short cid_len ph", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 625, "start_col": 1, "end_line": 629, "end_col": 45 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h\n\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_1 short_dcid_len last h\n\nlet serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_2 short_dcid_len last h;\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n serialize_header_dtuple_eq short_dcid_len last phpn\n\n#push-options \"--z3rlimit 32\"\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n LP.serialize (Public.serialize_header short_dcid_len) ph `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn \n )))\n= serialize_header_eq_3 short_dcid_len last h\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n: Lemma\n (requires (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h\n ))\n (ensures (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h == LP.serialize (serialize_header short_dcid_len2 last2) h\n ))\n= serialize_header_eq short_dcid_len1 last1 h;\n serialize_header_eq short_dcid_len2 last2 h;\n let (| ph, pn |) = synth_header_recip short_dcid_len1 last1 h in\n Public.serialize_header_ext short_dcid_len1 short_dcid_len2 ph;\n if not (is_retry h)\n then PN.serialize_packet_number_ext last1 last2 (pn_length h) pn\n\nlet last_packet_number\n (h: header)\n: GTot PN.last_packet_number_t\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in if Secret.v pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\nlet in_window_last_packet_number\n (h: header)\n: Lemma\n ((~ (is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) (Secret.v (last_packet_number h)) (Secret.v (packet_number h)))\n= ()\n\n(* Fulfill the interface now *)\n\nlet header_len'\n (h: header)\n: GTot nat\n= \n let s = serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h) in\n LP.serialize_length s h;\n Seq.length (LP.serialize s h)\n\nlet header_len'_correct\n (gh: header)\n: Lemma\n (header_len gh == header_len' gh)\n [SMTPat (header_len gh)]\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let cid_len = U32.uint_to_t (dcid_len gh) in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n serialize_header_eq cid_len last gh;\n Public.header_len'_correct cid_len ph;\n if is_retry gh\n then ()\n else begin\n let pn_len = pn_length gh in\n PN.parse_packet_number_kind'_correct last pn_len;\n LP.serialize_length\n #(PN.parse_packet_number_kind' pn_len)\n #_\n #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len))\n (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len))\n pn'\n end\n\nlet format_header\n h\n= LP.serialize (serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\nlet format_header_is_short", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header\n -> FStar.Pervasives.Lemma\n (ensures\n MShort? h <==>\n LowParse.BitFields.get_bitfield (FStar.UInt8.v (FStar.Seq.Base.index (QUIC.Spec.Header.Parse.format_header\n h)\n 0))\n 7\n 8 ==\n 0)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "QUIC.Spec.Header.Public.serialize_header_is_short", "Prims.unit", "Prims.dtuple2", "QUIC.Spec.Header.Parse.synth_header_recip", "QUIC.Spec.Header.Parse.serialize_header_eq", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Parse.last_packet_number", "FStar.UInt32.t", "FStar.UInt32.uint_to_t", "QUIC.Spec.Header.Base.dcid_len" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val format_header_is_short: h: header -> Lemma\n (MShort? h <==> BF.get_bitfield (U8.v (S.index (format_header h) 0)) 7 8 == 0)\nlet format_header_is_short h =", "completed_definiton": "let cid_len = U32.uint_to_t (dcid_len h) in\nlet last = last_packet_number h in\nserialize_header_eq cid_len last h;\nlet (| ph , _ |) = synth_header_recip cid_len last h in\nPublic.serialize_header_is_short cid_len ph", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.format_header_is_retry", "original_source_type": "val format_header_is_retry: h: header -> Lemma\n (is_retry h <==> (\n BF.get_bitfield (U8.v (S.index (format_header h) 0)) 7 8 == 1 /\\\n BF.get_bitfield (U8.v (S.index (format_header h) 0)) 4 6 == 3\n ))", "source_type": "val format_header_is_retry: h: header -> Lemma\n (is_retry h <==> (\n BF.get_bitfield (U8.v (S.index (format_header h) 0)) 7 8 == 1 /\\\n BF.get_bitfield (U8.v (S.index (format_header h) 0)) 4 6 == 3\n ))", "source_definition": "let format_header_is_retry\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_retry cid_len ph", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 633, "start_col": 1, "end_line": 637, "end_col": 45 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h\n\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_1 short_dcid_len last h\n\nlet serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_2 short_dcid_len last h;\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n serialize_header_dtuple_eq short_dcid_len last phpn\n\n#push-options \"--z3rlimit 32\"\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n LP.serialize (Public.serialize_header short_dcid_len) ph `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn \n )))\n= serialize_header_eq_3 short_dcid_len last h\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n: Lemma\n (requires (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h\n ))\n (ensures (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h == LP.serialize (serialize_header short_dcid_len2 last2) h\n ))\n= serialize_header_eq short_dcid_len1 last1 h;\n serialize_header_eq short_dcid_len2 last2 h;\n let (| ph, pn |) = synth_header_recip short_dcid_len1 last1 h in\n Public.serialize_header_ext short_dcid_len1 short_dcid_len2 ph;\n if not (is_retry h)\n then PN.serialize_packet_number_ext last1 last2 (pn_length h) pn\n\nlet last_packet_number\n (h: header)\n: GTot PN.last_packet_number_t\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in if Secret.v pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\nlet in_window_last_packet_number\n (h: header)\n: Lemma\n ((~ (is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) (Secret.v (last_packet_number h)) (Secret.v (packet_number h)))\n= ()\n\n(* Fulfill the interface now *)\n\nlet header_len'\n (h: header)\n: GTot nat\n= \n let s = serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h) in\n LP.serialize_length s h;\n Seq.length (LP.serialize s h)\n\nlet header_len'_correct\n (gh: header)\n: Lemma\n (header_len gh == header_len' gh)\n [SMTPat (header_len gh)]\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let cid_len = U32.uint_to_t (dcid_len gh) in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n serialize_header_eq cid_len last gh;\n Public.header_len'_correct cid_len ph;\n if is_retry gh\n then ()\n else begin\n let pn_len = pn_length gh in\n PN.parse_packet_number_kind'_correct last pn_len;\n LP.serialize_length\n #(PN.parse_packet_number_kind' pn_len)\n #_\n #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len))\n (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len))\n pn'\n end\n\nlet format_header\n h\n= LP.serialize (serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\nlet format_header_is_short\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_short cid_len ph\n\nlet format_header_is_retry", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Spec.Header.Base.is_retry h <==>\n LowParse.BitFields.get_bitfield (FStar.UInt8.v (FStar.Seq.Base.index (QUIC.Spec.Header.Parse.format_header\n h)\n 0))\n 7\n 8 ==\n 1 /\\\n LowParse.BitFields.get_bitfield (FStar.UInt8.v (FStar.Seq.Base.index (QUIC.Spec.Header.Parse.format_header\n h)\n 0))\n 4\n 6 ==\n 3)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "QUIC.Spec.Header.Public.serialize_header_is_retry", "Prims.unit", "Prims.dtuple2", "QUIC.Spec.Header.Parse.synth_header_recip", "QUIC.Spec.Header.Parse.serialize_header_eq", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Parse.last_packet_number", "FStar.UInt32.t", "FStar.UInt32.uint_to_t", "QUIC.Spec.Header.Base.dcid_len" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val format_header_is_retry: h: header -> Lemma\n (is_retry h <==> (\n BF.get_bitfield (U8.v (S.index (format_header h) 0)) 7 8 == 1 /\\\n BF.get_bitfield (U8.v (S.index (format_header h) 0)) 4 6 == 3\n ))\nlet format_header_is_retry h =", "completed_definiton": "let cid_len = U32.uint_to_t (dcid_len h) in\nlet last = last_packet_number h in\nserialize_header_eq cid_len last h;\nlet (| ph , _ |) = synth_header_recip cid_len last h in\nPublic.serialize_header_is_retry cid_len ph", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.format_header_pn_length", "original_source_type": "val format_header_pn_length: h: header -> Lemma\n (requires (~ (is_retry h)))\n (ensures (BF.get_bitfield (U8.v (S.index (format_header h) 0)) 0 2 == Secret.v (pn_length h) - 1))", "source_type": "val format_header_pn_length: h: header -> Lemma\n (requires (~ (is_retry h)))\n (ensures (BF.get_bitfield (U8.v (S.index (format_header h) 0)) 0 2 == Secret.v (pn_length h) - 1))", "source_definition": "let format_header_pn_length\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n let x = Seq.index (format_header h) 0 in\n assert (x == Seq.index (LP.serialize (Public.serialize_header cid_len) ph) 0);\n assert (Public.PShort? ph == MShort? h);\n Public.serialize_get_protected_bits cid_len ph;\n BF.get_bitfield_get_bitfield #8 (U8.v x) 0 (if Public.PShort? ph then 5 else 4) 0 2;\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield x 0 2) == Secret.v (pn_length h) - 1)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 643, "start_col": 1, "end_line": 652, "end_col": 87 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h\n\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_1 short_dcid_len last h\n\nlet serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_2 short_dcid_len last h;\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n serialize_header_dtuple_eq short_dcid_len last phpn\n\n#push-options \"--z3rlimit 32\"\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n LP.serialize (Public.serialize_header short_dcid_len) ph `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn \n )))\n= serialize_header_eq_3 short_dcid_len last h\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n: Lemma\n (requires (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h\n ))\n (ensures (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h == LP.serialize (serialize_header short_dcid_len2 last2) h\n ))\n= serialize_header_eq short_dcid_len1 last1 h;\n serialize_header_eq short_dcid_len2 last2 h;\n let (| ph, pn |) = synth_header_recip short_dcid_len1 last1 h in\n Public.serialize_header_ext short_dcid_len1 short_dcid_len2 ph;\n if not (is_retry h)\n then PN.serialize_packet_number_ext last1 last2 (pn_length h) pn\n\nlet last_packet_number\n (h: header)\n: GTot PN.last_packet_number_t\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in if Secret.v pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\nlet in_window_last_packet_number\n (h: header)\n: Lemma\n ((~ (is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) (Secret.v (last_packet_number h)) (Secret.v (packet_number h)))\n= ()\n\n(* Fulfill the interface now *)\n\nlet header_len'\n (h: header)\n: GTot nat\n= \n let s = serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h) in\n LP.serialize_length s h;\n Seq.length (LP.serialize s h)\n\nlet header_len'_correct\n (gh: header)\n: Lemma\n (header_len gh == header_len' gh)\n [SMTPat (header_len gh)]\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let cid_len = U32.uint_to_t (dcid_len gh) in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n serialize_header_eq cid_len last gh;\n Public.header_len'_correct cid_len ph;\n if is_retry gh\n then ()\n else begin\n let pn_len = pn_length gh in\n PN.parse_packet_number_kind'_correct last pn_len;\n LP.serialize_length\n #(PN.parse_packet_number_kind' pn_len)\n #_\n #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len))\n (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len))\n pn'\n end\n\nlet format_header\n h\n= LP.serialize (serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\nlet format_header_is_short\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_short cid_len ph\n\nlet format_header_is_retry\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_retry cid_len ph\n\n#push-options \"--z3rlimit 64\"\n\nlet format_header_pn_length", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header\n -> FStar.Pervasives.Lemma (requires ~(QUIC.Spec.Header.Base.is_retry h))\n (ensures\n LowParse.BitFields.get_bitfield (FStar.UInt8.v (FStar.Seq.Base.index (QUIC.Spec.Header.Parse.format_header\n h)\n 0))\n 0\n 2 ==\n QUIC.Secret.Int.Base.v (QUIC.Spec.Header.Base.pn_length h) - 1)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "Prims._assert", "Prims.eq2", "Prims.int", "LowParse.BitFields.__proj__Mkuint_t__item__v", "FStar.UInt8.t", "LowParse.BitFields.uint8", "LowParse.BitFields.__proj__Mkuint_t__item__get_bitfield", "Prims.op_Subtraction", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "QUIC.Spec.Header.Base.pn_length", "Prims.unit", "LowParse.BitFields.get_bitfield_get_bitfield", "FStar.UInt8.v", "QUIC.Spec.Header.Public.uu___is_PShort", "Prims.bool", "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "QUIC.Spec.Header.Public.serialize_get_protected_bits", "QUIC.Spec.Header.Base.uu___is_MShort", "FStar.Seq.Base.index", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "QUIC.Spec.Base.byte", "QUIC.Spec.Header.Parse.format_header", "Prims.dtuple2", "QUIC.Spec.Header.Parse.synth_header_recip", "QUIC.Spec.Header.Parse.serialize_header_eq", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Parse.last_packet_number", "FStar.UInt32.t", "FStar.UInt32.uint_to_t", "QUIC.Spec.Header.Base.dcid_len" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val format_header_pn_length: h: header -> Lemma\n (requires (~ (is_retry h)))\n (ensures (BF.get_bitfield (U8.v (S.index (format_header h) 0)) 0 2 == Secret.v (pn_length h) - 1))\nlet format_header_pn_length h =", "completed_definiton": "let cid_len = U32.uint_to_t (dcid_len h) in\nlet last = last_packet_number h in\nserialize_header_eq cid_len last h;\nlet (| ph , _ |) = synth_header_recip cid_len last h in\nlet x = Seq.index (format_header h) 0 in\nassert (x == Seq.index (LP.serialize (Public.serialize_header cid_len) ph) 0);\nassert (Public.PShort? ph == MShort? h);\nPublic.serialize_get_protected_bits cid_len ph;\nBF.get_bitfield_get_bitfield #8 (U8.v x) 0 (if Public.PShort? ph then 5 else 4) 0 2;\nassert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield x 0 2) == Secret.v (pn_length h) - 1)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.serialize_header_eq", "original_source_type": "val serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n : Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n (let (| ph , pn |) = synth_header_recip short_dcid_len last h in\n (LP.serialize (Public.serialize_header short_dcid_len) ph)\n `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn)))", "source_type": "val serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n : Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n (let (| ph , pn |) = synth_header_recip short_dcid_len last h in\n (LP.serialize (Public.serialize_header short_dcid_len) ph)\n `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn)))", "source_definition": "let serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n LP.serialize (Public.serialize_header short_dcid_len) ph `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn \n )))\n= serialize_header_eq_3 short_dcid_len last h", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 544, "start_col": 2, "end_line": 544, "end_col": 45 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h\n\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_1 short_dcid_len last h\n\nlet serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_2 short_dcid_len last h;\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n serialize_header_dtuple_eq short_dcid_len last phpn\n\n#push-options \"--z3rlimit 32\"\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n LP.serialize (Public.serialize_header short_dcid_len) ph `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n h: QUIC.Spec.Header.Parse.header' short_dcid_len last\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Base.serialize (QUIC.Spec.Header.Parse.serialize_header short_dcid_len last) h ==\n (let _ = QUIC.Spec.Header.Parse.synth_header_recip short_dcid_len last h in\n (let Prims.Mkdtuple2 #_ #_ ph pn = _ in\n FStar.Seq.Base.append (LowParse.Spec.Base.serialize (QUIC.Spec.Header.Public.serialize_header\n short_dcid_len)\n ph)\n (match QUIC.Spec.Header.Base.is_retry h with\n | true -> FStar.Seq.Base.empty\n | _ ->\n LowParse.Spec.Base.serialize (QUIC.Spec.PacketNumber.serialize_packet_number last\n (QUIC.Spec.Header.Base.pn_length h))\n pn))\n <:\n FStar.Seq.Base.seq LowParse.Bytes.byte))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Parse.header'", "QUIC.Spec.Header.Parse.serialize_header_eq_3", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "FStar.Seq.Base.seq", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Parse.parse_header_kind", "QUIC.Spec.Header.Parse.lp_parse_header", "QUIC.Spec.Header.Parse.serialize_header", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "FStar.Seq.Base.append", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "QUIC.Spec.Header.Base.is_retry", "FStar.Seq.Base.empty", "Prims.bool", "QUIC.Spec.PacketNumber.parse_packet_number_kind", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "QUIC.Spec.Header.Base.pn_length", "QUIC.Spec.PacketNumber.parse_packet_number", "QUIC.Spec.PacketNumber.serialize_packet_number", "Prims.dtuple2", "QUIC.Spec.Header.Parse.synth_header_recip", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n : Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n (let (| ph , pn |) = synth_header_recip short_dcid_len last h in\n (LP.serialize (Public.serialize_header short_dcid_len) ph)\n `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn)))\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n : Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n (let (| ph , pn |) = synth_header_recip short_dcid_len last h in\n (LP.serialize (Public.serialize_header short_dcid_len) ph)\n `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn))) =", "completed_definiton": "serialize_header_eq_3 short_dcid_len last h", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.putative_pn_offset_correct", "original_source_type": "val putative_pn_offset_correct\n (h: header {~ (is_retry h)})\n (cid_len: nat { cid_len <= 20 })\n: Lemma\n (requires (MShort? h ==> cid_len == dcid_len h))\n (ensures (putative_pn_offset cid_len (format_header h) == Some (pn_offset h <: nat)))", "source_type": "val putative_pn_offset_correct\n (h: header {~ (is_retry h)})\n (cid_len: nat { cid_len <= 20 })\n: Lemma\n (requires (MShort? h ==> cid_len == dcid_len h))\n (ensures (putative_pn_offset cid_len (format_header h) == Some (pn_offset h <: nat)))", "source_definition": "let putative_pn_offset_correct\n h cid_len\n=\n let cid_len_h = U32.uint_to_t (dcid_len h) in\n let last_h = last_packet_number h in\n serialize_header_eq cid_len_h last_h h;\n let (| ph, _ |) = synth_header_recip cid_len_h last_h h in\n let off = Seq.length (LP.serialize (Public.serialize_header cid_len_h) ph) in\n assert (pn_offset h == off);\n let cid_len' = U32.uint_to_t cid_len in\n Public.serialize_header_ext cid_len_h cid_len' ph;\n LP.parse_serialize (Public.serialize_header cid_len') ph;\n LP.parse_strong_prefix (Public.parse_header cid_len') (LP.serialize (Public.serialize_header cid_len') ph) (format_header h);\n LP.parse_injective (Public.parse_header cid_len') (LP.serialize (Public.serialize_header cid_len') ph) (format_header h);\n assert (LP.parse (Public.parse_header cid_len') (format_header h) == Some (ph, off));\n putative_pn_offset_intro cid_len' (format_header h) ph off", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 748, "start_col": 1, "end_line": 761, "end_col": 60 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h\n\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_1 short_dcid_len last h\n\nlet serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_2 short_dcid_len last h;\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n serialize_header_dtuple_eq short_dcid_len last phpn\n\n#push-options \"--z3rlimit 32\"\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n LP.serialize (Public.serialize_header short_dcid_len) ph `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn \n )))\n= serialize_header_eq_3 short_dcid_len last h\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n: Lemma\n (requires (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h\n ))\n (ensures (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h == LP.serialize (serialize_header short_dcid_len2 last2) h\n ))\n= serialize_header_eq short_dcid_len1 last1 h;\n serialize_header_eq short_dcid_len2 last2 h;\n let (| ph, pn |) = synth_header_recip short_dcid_len1 last1 h in\n Public.serialize_header_ext short_dcid_len1 short_dcid_len2 ph;\n if not (is_retry h)\n then PN.serialize_packet_number_ext last1 last2 (pn_length h) pn\n\nlet last_packet_number\n (h: header)\n: GTot PN.last_packet_number_t\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in if Secret.v pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\nlet in_window_last_packet_number\n (h: header)\n: Lemma\n ((~ (is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) (Secret.v (last_packet_number h)) (Secret.v (packet_number h)))\n= ()\n\n(* Fulfill the interface now *)\n\nlet header_len'\n (h: header)\n: GTot nat\n= \n let s = serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h) in\n LP.serialize_length s h;\n Seq.length (LP.serialize s h)\n\nlet header_len'_correct\n (gh: header)\n: Lemma\n (header_len gh == header_len' gh)\n [SMTPat (header_len gh)]\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let cid_len = U32.uint_to_t (dcid_len gh) in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n serialize_header_eq cid_len last gh;\n Public.header_len'_correct cid_len ph;\n if is_retry gh\n then ()\n else begin\n let pn_len = pn_length gh in\n PN.parse_packet_number_kind'_correct last pn_len;\n LP.serialize_length\n #(PN.parse_packet_number_kind' pn_len)\n #_\n #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len))\n (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len))\n pn'\n end\n\nlet format_header\n h\n= LP.serialize (serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\nlet format_header_is_short\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_short cid_len ph\n\nlet format_header_is_retry\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Public.serialize_header_is_retry cid_len ph\n\n#push-options \"--z3rlimit 64\"\n\nlet format_header_pn_length\n h\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let (| ph, _ |) = synth_header_recip cid_len last h in\n let x = Seq.index (format_header h) 0 in\n assert (x == Seq.index (LP.serialize (Public.serialize_header cid_len) ph) 0);\n assert (Public.PShort? ph == MShort? h);\n Public.serialize_get_protected_bits cid_len ph;\n BF.get_bitfield_get_bitfield #8 (U8.v x) 0 (if Public.PShort? ph then 5 else 4) 0 2;\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield x 0 2) == Secret.v (pn_length h) - 1)\n\n#pop-options\n\nlet pn_offset'\n (h: header)\n: GTot nat\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Seq.length (LP.serialize (Public.serialize_header cid_len) ph)\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet pn_offset_prop\n (h: header)\n: Lemma\n (requires (~ (is_retry h)))\n (ensures (\n 0 < pn_offset' h /\\\n pn_offset' h + Secret.v (pn_length h) == Seq.length (format_header h)\n ))\n=\n let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n serialize_header_eq cid_len last h;\n let pn_len = pn_length h in\n PN.parse_packet_number_kind'_correct last pn_len;\n let (| ph, pn |) = synth_header_recip cid_len last h in\n LP.serialize_length (Public.serialize_header cid_len) ph;\n LP.serialize_length #(PN.parse_packet_number_kind' pn_len) #_ #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len)) (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len)) pn\n\n#pop-options\n\nlet pn_offset\n h\n= pn_offset_prop h;\n pn_offset' h\n\nlet putative_pn_offset\n cid_len x\n= if cid_len > 20\n then None\n else\n match LP.parse (Public.parse_header (U32.uint_to_t cid_len)) x with\n | None -> None\n | Some (_, consumed) ->\n LP.parser_kind_prop_equiv (Public.parse_header_kind (U32.uint_to_t cid_len)) (Public.parse_header (U32.uint_to_t cid_len));\n Some (consumed <: nat)\n\nlet putative_pn_offset_frame\n cid_len x1 x2\n= let Some off = putative_pn_offset cid_len x1 in\n let h1 = Seq.index x1 0 in\n let h2 = Seq.index x2 0 in\n assert (Seq.slice x2 0 off `Seq.equal` (h2 `Seq.cons` Seq.tail (Seq.slice x1 0 off)));\n let is_short = BF.get_bitfield (U8.v h1) 7 8 = 0 in\n let number_of_protected_bits = if is_short then 5 else 4 in\n let new_pb = BF.uint8.BF.get_bitfield h2 0 number_of_protected_bits in\n let h1' = BF.uint8.BF.set_bitfield h1 0 number_of_protected_bits new_pb in\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield h2 0 number_of_protected_bits) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield h1' 0 number_of_protected_bits));\n assert (BF.uint8.BF.v (BF.uint8.BF.get_bitfield h2 number_of_protected_bits 8) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield h1' number_of_protected_bits 8));\n BF.get_bitfield_partition_2 #8 number_of_protected_bits (BF.uint8.BF.v h2) (BF.uint8.BF.v h1');\n let cid_len' = U32.uint_to_t cid_len in\n let p = Public.parse_header cid_len' in\n let s = Public.serialize_header cid_len' in\n let Some (ph, consumed) = LP.parse p x1 in\n assert (consumed == off);\n LP.parse_serialize s ph;\n LP.parse_strong_prefix p x1 (Seq.slice x1 0 off);\n LP.parse_injective p (Seq.slice x1 0 off) (LP.serialize s ph);\n assert (LP.serialize s ph == Seq.slice x1 0 off);\n Public.serialize_header_is_short cid_len' ph;\n Public.serialize_set_protected_bits cid_len' ph new_pb;\n let ph2 = Public.set_protected_bits ph new_pb in\n assert (LP.serialize s ph2 == Seq.slice x2 0 off);\n LP.parse_strong_prefix p (Seq.slice x2 0 off) x2\n\n#push-options \"--z3rlimit 32\"\n\nlet putative_pn_offset_intro\n (cid_len : short_dcid_len_t)\n (x: bytes)\n (ph: Public.header' cid_len)\n (off: nat { off <= Seq.length x })\n: Lemma\n (requires (\n LP.parse (Public.parse_header cid_len) x == Some (ph, off)\n ))\n (ensures (putative_pn_offset (U32.v cid_len) x == Some off))\n= ()\n\nlet putative_pn_offset_correct", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n h: QUIC.Spec.Header.Base.header{~(QUIC.Spec.Header.Base.is_retry h)} ->\n cid_len: Prims.nat{cid_len <= 20}\n -> FStar.Pervasives.Lemma (requires MShort? h ==> cid_len == QUIC.Spec.Header.Base.dcid_len h)\n (ensures\n QUIC.Spec.Header.Parse.putative_pn_offset cid_len (QUIC.Spec.Header.Parse.format_header h) ==\n FStar.Pervasives.Native.Some (QUIC.Spec.Header.Parse.pn_offset h))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Spec.Header.Base.is_retry", "Prims.nat", "Prims.op_LessThanOrEqual", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "QUIC.Spec.Header.Parse.putative_pn_offset_intro", "QUIC.Spec.Header.Parse.format_header", "Prims.unit", "Prims._assert", "Prims.eq2", "FStar.Pervasives.Native.option", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Base.consumed_length", "LowParse.Spec.Base.parse", "QUIC.Spec.Header.Public.parse_header", "FStar.Pervasives.Native.Some", "FStar.Pervasives.Native.Mktuple2", "LowParse.Spec.Base.parse_injective", "QUIC.Spec.Header.Public.parse_header_kind", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Public.serialize_header", "LowParse.Spec.Base.parse_strong_prefix", "LowParse.Spec.Base.parse_serialize", "QUIC.Spec.Header.Public.serialize_header_ext", "FStar.UInt32.t", "FStar.UInt32.uint_to_t", "QUIC.Spec.Header.Parse.pn_offset", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Prims.dtuple2", "QUIC.Spec.Header.Parse.synth_header_recip", "QUIC.Spec.Header.Parse.serialize_header_eq", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Parse.last_packet_number", "QUIC.Spec.Header.Base.dcid_len" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val putative_pn_offset_correct\n (h: header {~ (is_retry h)})\n (cid_len: nat { cid_len <= 20 })\n: Lemma\n (requires (MShort? h ==> cid_len == dcid_len h))\n (ensures (putative_pn_offset cid_len (format_header h) == Some (pn_offset h <: nat)))\nlet putative_pn_offset_correct h cid_len =", "completed_definiton": "let cid_len_h = U32.uint_to_t (dcid_len h) in\nlet last_h = last_packet_number h in\nserialize_header_eq cid_len_h last_h h;\nlet (| ph , _ |) = synth_header_recip cid_len_h last_h h in\nlet off = Seq.length (LP.serialize (Public.serialize_header cid_len_h) ph) in\nassert (pn_offset h == off);\nlet cid_len' = U32.uint_to_t cid_len in\nPublic.serialize_header_ext cid_len_h cid_len' ph;\nLP.parse_serialize (Public.serialize_header cid_len') ph;\nLP.parse_strong_prefix (Public.parse_header cid_len')\n (LP.serialize (Public.serialize_header cid_len') ph)\n (format_header h);\nLP.parse_injective (Public.parse_header cid_len')\n (LP.serialize (Public.serialize_header cid_len') ph)\n (format_header h);\nassert (LP.parse (Public.parse_header cid_len') (format_header h) == Some (ph, off));\nputative_pn_offset_intro cid_len' (format_header h) ph off", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fst", "name": "QUIC.Spec.Header.Parse.header_len'_correct", "original_source_type": "val header_len'_correct (gh: header)\n : Lemma (header_len gh == header_len' gh) [SMTPat (header_len gh)]", "source_type": "val header_len'_correct (gh: header)\n : Lemma (header_len gh == header_len' gh) [SMTPat (header_len gh)]", "source_definition": "let header_len'_correct\n (gh: header)\n: Lemma\n (header_len gh == header_len' gh)\n [SMTPat (header_len gh)]\n=\n allow_inversion header;\n allow_inversion long_header_specifics;\n let cid_len = U32.uint_to_t (dcid_len gh) in\n let last = last_packet_number gh in\n in_window_last_packet_number gh;\n let (| ph, pn' |) = synth_header_recip cid_len last gh in\n serialize_header_eq cid_len last gh;\n Public.header_len'_correct cid_len ph;\n if is_retry gh\n then ()\n else begin\n let pn_len = pn_length gh in\n PN.parse_packet_number_kind'_correct last pn_len;\n LP.serialize_length\n #(PN.parse_packet_number_kind' pn_len)\n #_\n #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len))\n (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len))\n pn'\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 598, "start_col": 2, "end_line": 617, "end_col": 5 }, "file_context": "module QUIC.Spec.Header.Parse\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Public = QUIC.Spec.Header.Public\nmodule LP = LowParse.Spec.Combinators\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Cast = FStar.Int.Cast\n\nlet protected_bits_pn_length\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot PN.packet_number_length_t\n= Secret.to_u32 #Secret.U8 (1uy `Secret.add` Secret.get_bitfield #Secret.U8 pb 0ul 2ul)\n\nlet get_pn_length\n (h: Public.header)\n: Tot PN.packet_number_length_t \n= protected_bits_pn_length (Public.PShort? h) (Public.get_protected_bits h)\n\nlet protected_bits_reserved\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Tot (bitfield 2)\n= if is_short\n then BF.uint8.BF.get_bitfield pb 3 5\n else BF.uint8.BF.get_bitfield pb 2 4\n\nlet get_reserved_bits\n (h: Public.header)\n: Tot (bitfield 2)\n= protected_bits_reserved (Public.PShort? h) (Public.get_protected_bits h)\n\nlet packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot Type0\n= if Public.is_retry h\n then unit\n else PN.packet_number_t' last (get_pn_length h)\n\nlet parse_packet_number_opt_kind = LP.strong_parser_kind 0 4 None\n\nlet parse_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.parser parse_packet_number_opt_kind (packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.weaken parse_packet_number_opt_kind LP.parse_empty\n else LP.weaken parse_packet_number_opt_kind (PN.parse_packet_number last (get_pn_length h))\n\nlet serialize_packet_number_opt\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: Public.header' cid_len)\n: Tot (LP.serializer (parse_packet_number_opt cid_len last h))\n= if Public.is_retry h\n then LP.serialize_weaken parse_packet_number_opt_kind LP.serialize_empty\n else LP.serialize_weaken parse_packet_number_opt_kind (PN.serialize_packet_number last (get_pn_length h))\n\nlet packet_number_prop\n (last: PN.last_packet_number_t)\n (h: header)\n: GTot bool\n= if not (is_retry h)\n then PN.in_window (Secret.v (pn_length h) - 1) (Secret.v last) (Secret.v (packet_number h))\n else true\n\nmodule U32 = FStar.UInt32\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: Tot bool\n= if MShort? h\n then dcid_len h = U32.v short_dcid_len\n else true\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (m: header)\n: GTot bool\n= short_dcid_len_prop short_dcid_len m &&\n packet_number_prop last m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n= LP.parse_filter_refine (parse_header_prop short_dcid_len last)\n\nlet protected_bits_key_phase\n (x: bitfield 5)\n: Tot bool\n= BF.uint8.BF.get_bitfield x 2 3 = 1uy\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 5)\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet protected_bits_pn_length_prop\n (is_short: bool)\n (pb: bitfield (if is_short then 5 else 4))\n: Lemma\n (Secret.v (protected_bits_pn_length is_short pb) == U8.v (BF.uint8.BF.get_bitfield pb 0 2) + 1)\n [SMTPat (protected_bits_pn_length is_short pb)]\n= ()\n\n#push-options \"--z3rlimit 16 --max_fuel 2\"\n\nlet mk_short_protected_bits_correct\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_short_protected_bits reserved_bits key_phase pnl in\n protected_bits_pn_length true b == pnl /\\\n protected_bits_reserved true b == reserved_bits /\\\n protected_bits_key_phase b == key_phase /\\\n True\n )\n= ()\n\nlet mk_short_protected_bits_complete\n (pb: bitfield 5)\n: Lemma\n (\n mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) == pb\n )\n= let pb' = mk_short_protected_bits (protected_bits_reserved true pb) (protected_bits_key_phase pb) (protected_bits_pn_length true pb) in\n BF.get_bitfield_full #5 (U8.v pb');\n BF.get_bitfield_full #5 (U8.v pb);\n BF.get_bitfield_size 5 8 (U8.v pb) 0 5;\n BF.get_bitfield_size 5 8 (U8.v pb') 0 5;\n assert_norm (BF.get_bitfield_partition_prop #8 (U8.v pb) (U8.v pb') 0 5 [2; 3] <==> (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 3) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 3)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 3 5) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 3 5))\n ));\n BF.get_bitfield_partition #8 (U8.v pb) (U8.v pb') 0 5 [2; 3]\n\n#pop-options\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: GTot (bitfield 4)\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (U8.uint_to_t (Secret.v pnl - 1))) 2 4 reserved_bits\n\nlet mk_long_protected_bits_correct\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Lemma\n (\n let b = mk_long_protected_bits reserved_bits pnl in\n protected_bits_pn_length false b == pnl /\\\n protected_bits_reserved false b == reserved_bits\n )\n= ()\n\nlet mk_long_protected_bits_complete\n (pb: bitfield 4)\n: Lemma\n (\n mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) == pb\n )\n= let pb' = mk_long_protected_bits (protected_bits_reserved false pb) (protected_bits_pn_length false pb) in\n BF.get_bitfield_full #4 (U8.v pb');\n BF.get_bitfield_full #4 (U8.v pb);\n BF.get_bitfield_size 4 8 (U8.v pb) 0 4;\n BF.get_bitfield_size 4 8 (U8.v pb') 0 4;\n assert (\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 0 2) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 0 2)) /\\\n (BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb 2 4) == BF.uint8.BF.v (BF.uint8.BF.get_bitfield pb' 2 4))\n );\n BF.get_bitfield_partition_2_gen #8 0 2 4 (U8.v pb) (U8.v pb')\n\nlet synth_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Tot (header' short_dcid_len last)\n= let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n MShort (protected_bits_reserved true protected_bits) spin (protected_bits_key_phase protected_bits) dcid (protected_bits_pn_length true protected_bits) pn\n | Public.PLong protected_bits version dcid scid spec ->\n let pnl = protected_bits_pn_length false protected_bits in\n let rb = protected_bits_reserved false protected_bits in\n MLong version dcid scid\n begin match spec with\n | Public.PRetry odcid ->\n MRetry protected_bits odcid\n | Public.PInitial token payload_and_pn_length ->\n MInitial rb token payload_and_pn_length pnl pn\n | Public.PHandshake payload_and_pn_length ->\n MHandshake rb payload_and_pn_length pnl pn\n | Public.PZeroRTT payload_and_pn_length ->\n MZeroRTT rb payload_and_pn_length pnl pn\n end\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: header' short_dcid_len last)\n: GTot (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\nlet synth_header_injective\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))\n [SMTPat (LP.synth_injective #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header_recip short_dcid_len last) (synth_header short_dcid_len last) (fun (x: dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) ->\n let (| h, pn |) = x in\n match h with\n | Public.PShort protected_bits spin dcid ->\n mk_short_protected_bits_complete protected_bits\n | Public.PLong protected_bits version dcid scid spec ->\n begin match spec with\n | Public.PRetry odcid -> ()\n | _ -> mk_long_protected_bits_complete protected_bits\n end\n );\n LP.synth_inverse_synth_injective (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last)\n\nlet synth_header_inverse\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Lemma\n (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))\n [SMTPat (LP.synth_inverse #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)) #(header' short_dcid_len last) (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last))]\n= LP.synth_inverse_intro' (synth_header short_dcid_len last) (synth_header_recip short_dcid_len last) (fun (x: header' short_dcid_len last) ->\n match x with\n | MShort rb spin key_phase dcid pnl pn ->\n mk_short_protected_bits_correct rb key_phase pnl\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid -> ()\n | MInitial rb token payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MHandshake rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n mk_long_protected_bits_correct rb pnl\n end\n )\n\nlet parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max < header_len_bound\n end\n })\n= LP.parse_filter_kind (Public.parse_header_kind short_dcid_len) `LP.and_then_kind` parse_packet_number_opt_kind\n\nlet parse_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last)))\n= LP.parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n\nlet lp_parse_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len last))\n=\n LP.parse_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n\n#push-options \"--z3rlimit 64\"\n\nlet parse_header_dtuple_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x ==\n LP.bare_parse_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n )\n= LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet parse_header_dtuple_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n begin match LP.parse (parse_packet_number_opt short_dcid_len last ph) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n= parse_header_dtuple_eq_1 short_dcid_len last x\n\nlet parse_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (parse_header_dtuple short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some ((| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some ((| ph, pn |), consumed + consumed')\n end\n ))\n=\n LP.parse_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.parse_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n (parse_packet_number_opt short_dcid_len last)\n x\n\nlet lp_parse_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: bytes)\n: Lemma\n (LP.parse (lp_parse_header short_dcid_len last) x == (\n match LP.parse (Public.parse_header short_dcid_len) x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n match LP.parse (PN.parse_packet_number last (get_pn_length ph)) (Seq.slice x consumed (Seq.length x)) with\n | None -> None\n | Some (pn, consumed') -> Some (synth_header short_dcid_len last (| ph, pn |), consumed + consumed')\n end\n ))\n= LP.parse_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n (parse_header_dtuple short_dcid_len last)\n (synth_header short_dcid_len last)\n x;\n parse_header_dtuple_eq short_dcid_len last x\n\n#pop-options\n\nlet serialize_header_dtuple\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (parse_header_dtuple short_dcid_len last))\n= \n LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer (lp_parse_header short_dcid_len last))\n=\n LP.serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n\nlet serialize_header_dtuple_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n: Lemma (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n )\n= assert (\n LP.serialize (serialize_header_dtuple short_dcid_len last) phpn ==\n LP.serialize\n #_ #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n (LP.serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n )\n phpn\n );\n LP.serialize_dtuple2_eq'\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n\nlet serialize_header_eq_1\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h ==\n LP.bare_serialize_synth\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n h\n )\n=\n LP.serialize_synth_eq\n #_\n #(dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last))\n #(header' short_dcid_len last)\n _\n (synth_header short_dcid_len last)\n (serialize_header_dtuple short_dcid_len last)\n (synth_header_recip short_dcid_len last)\n ()\n h\n\nlet serialize_header_eq_2\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.serialize\n (serialize_header_dtuple short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_1 short_dcid_len last h\n\nlet serialize_header_eq_3\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n LP.bare_serialize_dtuple2\n #_ #(Public.header' short_dcid_len)\n (Public.serialize_header short_dcid_len)\n #_ #(packet_number_opt short_dcid_len last)\n #(parse_packet_number_opt short_dcid_len last)\n (serialize_packet_number_opt short_dcid_len last)\n phpn\n ))\n= serialize_header_eq_2 short_dcid_len last h;\n let phpn : dtuple2 (Public.header' short_dcid_len) (packet_number_opt short_dcid_len last) = synth_header_recip short_dcid_len last h in\n serialize_header_dtuple_eq short_dcid_len last phpn\n\n#push-options \"--z3rlimit 32\"\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (h: header' short_dcid_len last)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len last) h == (\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n LP.serialize (Public.serialize_header short_dcid_len) ph `Seq.append`\n (if is_retry h\n then Seq.empty\n else LP.serialize (PN.serialize_packet_number last (pn_length h)) pn \n )))\n= serialize_header_eq_3 short_dcid_len last h\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (last1 last2: PN.last_packet_number_t)\n (h: header)\n: Lemma\n (requires (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h\n ))\n (ensures (\n parse_header_prop short_dcid_len1 last1 h /\\\n parse_header_prop short_dcid_len2 last2 h /\\\n LP.serialize (serialize_header short_dcid_len1 last1) h == LP.serialize (serialize_header short_dcid_len2 last2) h\n ))\n= serialize_header_eq short_dcid_len1 last1 h;\n serialize_header_eq short_dcid_len2 last2 h;\n let (| ph, pn |) = synth_header_recip short_dcid_len1 last1 h in\n Public.serialize_header_ext short_dcid_len1 short_dcid_len2 ph;\n if not (is_retry h)\n then PN.serialize_packet_number_ext last1 last2 (pn_length h) pn\n\nlet last_packet_number\n (h: header)\n: GTot PN.last_packet_number_t\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in if Secret.v pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\nlet in_window_last_packet_number\n (h: header)\n: Lemma\n ((~ (is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) (Secret.v (last_packet_number h)) (Secret.v (packet_number h)))\n= ()\n\n(* Fulfill the interface now *)\n\nlet header_len'\n (h: header)\n: GTot nat\n= \n let s = serialize_header (U32.uint_to_t (dcid_len h)) (last_packet_number h) in\n LP.serialize_length s h;\n Seq.length (LP.serialize s h)\n\nlet header_len'_correct\n (gh: header)\n: Lemma\n (header_len gh == header_len' gh)\n [SMTPat (header_len gh)]", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fst", "checked_file": "QUIC.Spec.Header.Parse.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "gh: QUIC.Spec.Header.Base.header\n -> FStar.Pervasives.Lemma\n (ensures QUIC.Spec.Header.Base.header_len gh == QUIC.Spec.Header.Parse.header_len' gh)\n [SMTPat (QUIC.Spec.Header.Base.header_len gh)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "QUIC.Spec.Header.Base.is_retry", "Prims.bool", "LowParse.Spec.Base.serialize_length", "QUIC.Spec.PacketNumber.parse_packet_number_kind'", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "QUIC.Spec.PacketNumber.parse_packet_number", "LowParse.Spec.Base.bare_parser", "QUIC.Spec.PacketNumber.serialize_packet_number", "LowParse.Spec.Base.bare_serializer", "Prims.unit", "QUIC.Spec.PacketNumber.parse_packet_number_kind'_correct", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.Header.Base.pn_length", "QUIC.Spec.Header.Public.header_len'_correct", "QUIC.Spec.Header.Parse.serialize_header_eq", "Prims.dtuple2", "QUIC.Spec.Header.Parse.synth_header_recip", "QUIC.Spec.Header.Parse.in_window_last_packet_number", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Parse.last_packet_number", "FStar.UInt32.t", "FStar.UInt32.uint_to_t", "QUIC.Spec.Header.Base.dcid_len", "FStar.Pervasives.allow_inversion", "QUIC.Spec.Header.Base.long_header_specifics", "Prims.l_True", "Prims.squash", "Prims.eq2", "Prims.int", "Prims.l_or", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThan", "Prims.op_LessThanOrEqual", "QUIC.Spec.Base.header_len_bound", "Prims.op_GreaterThanOrEqual", "QUIC.Spec.Header.Base.header_len", "QUIC.Spec.Header.Parse.header_len'", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Prims.pos", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_len'_correct (gh: header)\n : Lemma (header_len gh == header_len' gh) [SMTPat (header_len gh)]\nlet header_len'_correct (gh: header)\n : Lemma (header_len gh == header_len' gh) [SMTPat (header_len gh)] =", "completed_definiton": "allow_inversion header;\nallow_inversion long_header_specifics;\nlet cid_len = U32.uint_to_t (dcid_len gh) in\nlet last = last_packet_number gh in\nin_window_last_packet_number gh;\nlet (| ph , pn' |) = synth_header_recip cid_len last gh in\nserialize_header_eq cid_len last gh;\nPublic.header_len'_correct cid_len ph;\nif is_retry gh\nthen ()\nelse\n let pn_len = pn_length gh in\n PN.parse_packet_number_kind'_correct last pn_len;\n LP.serialize_length #(PN.parse_packet_number_kind' pn_len)\n #_\n #(PN.parse_packet_number last pn_len <: LP.bare_parser (PN.packet_number_t' last pn_len))\n (PN.serialize_packet_number last pn_len <: LP.bare_serializer (PN.packet_number_t' last pn_len))\n pn'", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fsti", "name": "Model.PNE.length_bits", "original_source_type": "", "source_type": "val length_bits : l: Model.PNE.pne_plain_length -> Type0", "source_definition": "let length_bits (l: pne_plain_length) =\n b:bits { LowParse.BitFields.get_bitfield b 0 2 + 1 == l }", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 46, "start_col": 2, "end_line": 46, "end_col": 59 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\n\n/// Abbreviations for idealization\n/// ------------------------------\n\ntype id = I.pne_id\ntype alg = I.ca\n\nlet is_safe (i:id) =\n I.is_pne_honest i && I.ideal_PNE\n\ntype safe_id =\n i:id{is_safe i}\n\ntype unsafe_id =\n i:id{not (is_safe i)}\n\n/// QUIC payload sampling\n/// --------------------\n\n// For simplicity, we do not distinguish between long and short headers; caller\n// of this module will just 0-left-pad the protected bits in the case of a long\n// header.\nlet bits: Type0 = LowParse.BitFields.ubitfield 8 5\n\n// Note: the sample is PUBLIC so is using QUIC.Spec.lbytes which do not operate over secret integers.\nlet sample_length = 16\nlet sample = QUIC.Spec.lbytes sample_length\nlet pne_plain_length = l:nat {l >= 1 /\\ l <= 4}", "dependencies": { "source_file": "Model.PNE.fsti", "checked_file": "Model.PNE.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "l: Model.PNE.pne_plain_length -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.pne_plain_length", "Model.PNE.bits", "Prims.eq2", "Prims.int", "Prims.op_Addition", "LowParse.BitFields.get_bitfield" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let length_bits (l: pne_plain_length) =", "completed_definiton": "b: bits{LowParse.BitFields.get_bitfield b 0 2 + 1 == l}", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fsti", "name": "Model.PNE.bits", "original_source_type": "val bits:Type0", "source_type": "val bits:Type0", "source_definition": "let bits: Type0 = LowParse.BitFields.ubitfield 8 5", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 38, "start_col": 18, "end_line": 38, "end_col": 50 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\n\n/// Abbreviations for idealization\n/// ------------------------------\n\ntype id = I.pne_id\ntype alg = I.ca\n\nlet is_safe (i:id) =\n I.is_pne_honest i && I.ideal_PNE\n\ntype safe_id =\n i:id{is_safe i}\n\ntype unsafe_id =\n i:id{not (is_safe i)}\n\n/// QUIC payload sampling\n/// --------------------\n\n// For simplicity, we do not distinguish between long and short headers; caller\n// of this module will just 0-left-pad the protected bits in the case of a long", "dependencies": { "source_file": "Model.PNE.fsti", "checked_file": "Model.PNE.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.BitFields.ubitfield" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val bits:Type0\nlet bits:Type0 =", "completed_definiton": "LowParse.BitFields.ubitfield 8 5", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fsti", "name": "Model.PNE.pne_plain", "original_source_type": "", "source_type": "val pne_plain : u47: Model.PNE.info j -> l: Model.PNE.pne_plain_length -> Prims.eqtype", "source_definition": "let pne_plain (#j:id) (u:info j) (l:pne_plain_length) =\n PNEPlainPkg?.pne_plain u.plain j l", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 90, "start_col": 2, "end_line": 90, "end_col": 36 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\n\n/// Abbreviations for idealization\n/// ------------------------------\n\ntype id = I.pne_id\ntype alg = I.ca\n\nlet is_safe (i:id) =\n I.is_pne_honest i && I.ideal_PNE\n\ntype safe_id =\n i:id{is_safe i}\n\ntype unsafe_id =\n i:id{not (is_safe i)}\n\n/// QUIC payload sampling\n/// --------------------\n\n// For simplicity, we do not distinguish between long and short headers; caller\n// of this module will just 0-left-pad the protected bits in the case of a long\n// header.\nlet bits: Type0 = LowParse.BitFields.ubitfield 8 5\n\n// Note: the sample is PUBLIC so is using QUIC.Spec.lbytes which do not operate over secret integers.\nlet sample_length = 16\nlet sample = QUIC.Spec.lbytes sample_length\nlet pne_plain_length = l:nat {l >= 1 /\\ l <= 4}\n\nlet length_bits (l: pne_plain_length) =\n b:bits { LowParse.BitFields.get_bitfield b 0 2 + 1 == l }\n\nlet pne_cipher (l:pne_plain_length) = lbytes l & bits\nlet pne_cipherpad = lbytes 4 & bits\n\n/// Restrict a generated cipherpad to the length of the encoded packet number.\nval clip_cipherpad : (cp:pne_cipherpad) -> (l:pne_plain_length) -> pne_cipher l\n\n// We define a separate package type here (different from the one in AEAD). We\n// idealize them separately, and there's a specific part here that's about the\n// protected bits of the header.\nnoeq type pne_plain_pkg =\n | PNEPlainPkg:\n pne_plain: (j:id -> l:pne_plain_length -> t:eqtype) ->\n as_bytes: (j:id -> l:pne_plain_length -> pne_plain j l -> GTot (lbytes l & length_bits l)) ->\n repr: (j:unsafe_id -> l:pne_plain_length -> n:pne_plain j l ->\n Tot (b:(lbytes l & length_bits l) {b == as_bytes j l n})) ->\n mk: (j:id -> l:pne_plain_length -> n:lbytes l -> b:length_bits l -> p:pne_plain j l { as_bytes j l p == (n, b) }) ->\n xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad ->\n (l': pne_plain_length & pne_plain j l')) ->\n lemma_xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad -> Lemma\n (requires True)\n (ensures (\n let (| l', p' |) = xor j l p cp in\n let _, bits = as_bytes j l' p' in\n let l: pne_plain_length = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n let l': pne_plain_length = l' in\n l == l'\n ))) ->\n pne_plain_pkg\n\nnoeq type info' = {\n calg: alg;\n halg: I.ha;\n plain: pne_plain_pkg;\n}\n\nlet info (j:id) =\n info:info'{\n I.pne_id_ginfo j == info.calg /\\\n I.pne_id_ghash j == info.halg\n }", "dependencies": { "source_file": "Model.PNE.fsti", "checked_file": "Model.PNE.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "u47: Model.PNE.info j -> l: Model.PNE.pne_plain_length -> Prims.eqtype", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.id", "Model.PNE.info", "Model.PNE.pne_plain_length", "Model.PNE.__proj__PNEPlainPkg__item__pne_plain", "Model.PNE.__proj__Mkinfo'__item__plain", "Prims.eqtype" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let pne_plain (#j: id) (u: info j) (l: pne_plain_length) =", "completed_definiton": "PNEPlainPkg?.pne_plain u.plain j l", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fsti", "name": "Model.PNE.sample_length", "original_source_type": "", "source_type": "val sample_length : Prims.int", "source_definition": "let sample_length = 16", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 41, "start_col": 20, "end_line": 41, "end_col": 22 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\n\n/// Abbreviations for idealization\n/// ------------------------------\n\ntype id = I.pne_id\ntype alg = I.ca\n\nlet is_safe (i:id) =\n I.is_pne_honest i && I.ideal_PNE\n\ntype safe_id =\n i:id{is_safe i}\n\ntype unsafe_id =\n i:id{not (is_safe i)}\n\n/// QUIC payload sampling\n/// --------------------\n\n// For simplicity, we do not distinguish between long and short headers; caller\n// of this module will just 0-left-pad the protected bits in the case of a long\n// header.\nlet bits: Type0 = LowParse.BitFields.ubitfield 8 5", "dependencies": { "source_file": "Model.PNE.fsti", "checked_file": "Model.PNE.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.int", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let sample_length =", "completed_definiton": "16", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fsti", "name": "Model.PNE.contains_sample", "original_source_type": "val contains_sample (#j: safe_id) (#u: info j) (s: sample) (st: pne_state u) (h: mem) : GTot bool", "source_type": "val contains_sample (#j: safe_id) (#u: info j) (s: sample) (st: pne_state u) (h: mem) : GTot bool", "source_definition": "let contains_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :\n GTot bool =\n Some? (entry_for_sample s st h)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 146, "start_col": 2, "end_line": 146, "end_col": 33 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\n\n/// Abbreviations for idealization\n/// ------------------------------\n\ntype id = I.pne_id\ntype alg = I.ca\n\nlet is_safe (i:id) =\n I.is_pne_honest i && I.ideal_PNE\n\ntype safe_id =\n i:id{is_safe i}\n\ntype unsafe_id =\n i:id{not (is_safe i)}\n\n/// QUIC payload sampling\n/// --------------------\n\n// For simplicity, we do not distinguish between long and short headers; caller\n// of this module will just 0-left-pad the protected bits in the case of a long\n// header.\nlet bits: Type0 = LowParse.BitFields.ubitfield 8 5\n\n// Note: the sample is PUBLIC so is using QUIC.Spec.lbytes which do not operate over secret integers.\nlet sample_length = 16\nlet sample = QUIC.Spec.lbytes sample_length\nlet pne_plain_length = l:nat {l >= 1 /\\ l <= 4}\n\nlet length_bits (l: pne_plain_length) =\n b:bits { LowParse.BitFields.get_bitfield b 0 2 + 1 == l }\n\nlet pne_cipher (l:pne_plain_length) = lbytes l & bits\nlet pne_cipherpad = lbytes 4 & bits\n\n/// Restrict a generated cipherpad to the length of the encoded packet number.\nval clip_cipherpad : (cp:pne_cipherpad) -> (l:pne_plain_length) -> pne_cipher l\n\n// We define a separate package type here (different from the one in AEAD). We\n// idealize them separately, and there's a specific part here that's about the\n// protected bits of the header.\nnoeq type pne_plain_pkg =\n | PNEPlainPkg:\n pne_plain: (j:id -> l:pne_plain_length -> t:eqtype) ->\n as_bytes: (j:id -> l:pne_plain_length -> pne_plain j l -> GTot (lbytes l & length_bits l)) ->\n repr: (j:unsafe_id -> l:pne_plain_length -> n:pne_plain j l ->\n Tot (b:(lbytes l & length_bits l) {b == as_bytes j l n})) ->\n mk: (j:id -> l:pne_plain_length -> n:lbytes l -> b:length_bits l -> p:pne_plain j l { as_bytes j l p == (n, b) }) ->\n xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad ->\n (l': pne_plain_length & pne_plain j l')) ->\n lemma_xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad -> Lemma\n (requires True)\n (ensures (\n let (| l', p' |) = xor j l p cp in\n let _, bits = as_bytes j l' p' in\n let l: pne_plain_length = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n let l': pne_plain_length = l' in\n l == l'\n ))) ->\n pne_plain_pkg\n\nnoeq type info' = {\n calg: alg;\n halg: I.ha;\n plain: pne_plain_pkg;\n}\n\nlet info (j:id) =\n info:info'{\n I.pne_id_ginfo j == info.calg /\\\n I.pne_id_ghash j == info.halg\n }\n\nlet pne_plain (#j:id) (u:info j) (l:pne_plain_length) =\n PNEPlainPkg?.pne_plain u.plain j l\n\nnoeq\ntype entry (#j:id) (u:info j) =\n | Entry :\n s:sample ->\n #l:pne_plain_length ->\n n:pne_plain u l ->\n // We do not perform truncation at encryption-time, but rather at decryption-time\n c:pne_cipherpad ->\n entry u\n\nval pne_state : (#j:id) -> (u:info j) -> Type u#1\n\nval table : (#j:safe_id) -> (#u:info j) -> (st:pne_state u) -> (h:mem) -> GTot (Seq.seq (entry u))\n\n// Header protection key\nlet key_len (#j:id) (u:info j) = Spec.Agile.Cipher.key_length u.calg\nval key: #j:unsafe_id -> #u:info j -> st:pne_state u -> lbytes (key_len u)\n\nval footprint : #j:id -> #u:info j -> st:pne_state u -> GTot B.loc\n\nval invariant: #j:id -> #u:info j -> st:pne_state u -> mem -> Type0\n\nval frame_invariant: #j:id -> #u:info j -> st:pne_state u -> l:B.loc -> h0:mem -> h1:mem -> Lemma\n (requires (\n invariant st h0 /\\\n B.modifies l h0 h1 /\\\n B.loc_disjoint l (footprint st)))\n (ensures (\n invariant st h1))\n\nval frame_table: #j:safe_id -> #u:info j -> st:pne_state u ->\n r:B.loc -> h0:mem -> h1:mem ->\n Lemma\n (requires\n invariant st h0 /\\\n B.modifies r h0 h1 /\\\n r `B.loc_disjoint` (footprint st))\n (ensures table st h1 == table st h0)\n\n// Equality for the pair of (pne, protected_bits) we manipulate in this module.\nlet pne_bits_eq #l (x y: pne_cipher l) =\n fst x `lbytes_eq` fst y && snd x = snd y\n\n// Finding the entry for a given sample.\nlet sample_filter (#j:id) (u:info j) (s:sample) (e:entry u) : bool =\n Entry?.s e = s\n\nlet entry_for_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :\n GTot (option (entry u)) =\n Seq.find_l (sample_filter u s) (table st h)\n\n/// XXX unused\nlet contains_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :", "dependencies": { "source_file": "Model.PNE.fsti", "checked_file": "Model.PNE.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: Model.PNE.sample -> st: Model.PNE.pne_state u87 -> h: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Prims.bool", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.safe_id", "Model.PNE.info", "Model.PNE.sample", "Model.PNE.pne_state", "FStar.Monotonic.HyperStack.mem", "FStar.Pervasives.Native.uu___is_Some", "Model.PNE.entry", "Model.PNE.entry_for_sample", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val contains_sample (#j: safe_id) (#u: info j) (s: sample) (st: pne_state u) (h: mem) : GTot bool\nlet contains_sample (#j: safe_id) (#u: info j) (s: sample) (st: pne_state u) (h: mem) : GTot bool =", "completed_definiton": "Some? (entry_for_sample s st h)", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fsti", "name": "Model.PNE.traffic_secret", "original_source_type": "", "source_type": "val traffic_secret : ha: a: Spec.Hash.Definitions.hash_alg{Prims.op_Negation (Spec.Hash.Definitions.is_shake a)} -> Type0", "source_definition": "let traffic_secret ha =\n lbytes (Spec.Hash.Definitions.hash_length ha)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 181, "start_col": 2, "end_line": 181, "end_col": 47 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\n\n/// Abbreviations for idealization\n/// ------------------------------\n\ntype id = I.pne_id\ntype alg = I.ca\n\nlet is_safe (i:id) =\n I.is_pne_honest i && I.ideal_PNE\n\ntype safe_id =\n i:id{is_safe i}\n\ntype unsafe_id =\n i:id{not (is_safe i)}\n\n/// QUIC payload sampling\n/// --------------------\n\n// For simplicity, we do not distinguish between long and short headers; caller\n// of this module will just 0-left-pad the protected bits in the case of a long\n// header.\nlet bits: Type0 = LowParse.BitFields.ubitfield 8 5\n\n// Note: the sample is PUBLIC so is using QUIC.Spec.lbytes which do not operate over secret integers.\nlet sample_length = 16\nlet sample = QUIC.Spec.lbytes sample_length\nlet pne_plain_length = l:nat {l >= 1 /\\ l <= 4}\n\nlet length_bits (l: pne_plain_length) =\n b:bits { LowParse.BitFields.get_bitfield b 0 2 + 1 == l }\n\nlet pne_cipher (l:pne_plain_length) = lbytes l & bits\nlet pne_cipherpad = lbytes 4 & bits\n\n/// Restrict a generated cipherpad to the length of the encoded packet number.\nval clip_cipherpad : (cp:pne_cipherpad) -> (l:pne_plain_length) -> pne_cipher l\n\n// We define a separate package type here (different from the one in AEAD). We\n// idealize them separately, and there's a specific part here that's about the\n// protected bits of the header.\nnoeq type pne_plain_pkg =\n | PNEPlainPkg:\n pne_plain: (j:id -> l:pne_plain_length -> t:eqtype) ->\n as_bytes: (j:id -> l:pne_plain_length -> pne_plain j l -> GTot (lbytes l & length_bits l)) ->\n repr: (j:unsafe_id -> l:pne_plain_length -> n:pne_plain j l ->\n Tot (b:(lbytes l & length_bits l) {b == as_bytes j l n})) ->\n mk: (j:id -> l:pne_plain_length -> n:lbytes l -> b:length_bits l -> p:pne_plain j l { as_bytes j l p == (n, b) }) ->\n xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad ->\n (l': pne_plain_length & pne_plain j l')) ->\n lemma_xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad -> Lemma\n (requires True)\n (ensures (\n let (| l', p' |) = xor j l p cp in\n let _, bits = as_bytes j l' p' in\n let l: pne_plain_length = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n let l': pne_plain_length = l' in\n l == l'\n ))) ->\n pne_plain_pkg\n\nnoeq type info' = {\n calg: alg;\n halg: I.ha;\n plain: pne_plain_pkg;\n}\n\nlet info (j:id) =\n info:info'{\n I.pne_id_ginfo j == info.calg /\\\n I.pne_id_ghash j == info.halg\n }\n\nlet pne_plain (#j:id) (u:info j) (l:pne_plain_length) =\n PNEPlainPkg?.pne_plain u.plain j l\n\nnoeq\ntype entry (#j:id) (u:info j) =\n | Entry :\n s:sample ->\n #l:pne_plain_length ->\n n:pne_plain u l ->\n // We do not perform truncation at encryption-time, but rather at decryption-time\n c:pne_cipherpad ->\n entry u\n\nval pne_state : (#j:id) -> (u:info j) -> Type u#1\n\nval table : (#j:safe_id) -> (#u:info j) -> (st:pne_state u) -> (h:mem) -> GTot (Seq.seq (entry u))\n\n// Header protection key\nlet key_len (#j:id) (u:info j) = Spec.Agile.Cipher.key_length u.calg\nval key: #j:unsafe_id -> #u:info j -> st:pne_state u -> lbytes (key_len u)\n\nval footprint : #j:id -> #u:info j -> st:pne_state u -> GTot B.loc\n\nval invariant: #j:id -> #u:info j -> st:pne_state u -> mem -> Type0\n\nval frame_invariant: #j:id -> #u:info j -> st:pne_state u -> l:B.loc -> h0:mem -> h1:mem -> Lemma\n (requires (\n invariant st h0 /\\\n B.modifies l h0 h1 /\\\n B.loc_disjoint l (footprint st)))\n (ensures (\n invariant st h1))\n\nval frame_table: #j:safe_id -> #u:info j -> st:pne_state u ->\n r:B.loc -> h0:mem -> h1:mem ->\n Lemma\n (requires\n invariant st h0 /\\\n B.modifies r h0 h1 /\\\n r `B.loc_disjoint` (footprint st))\n (ensures table st h1 == table st h0)\n\n// Equality for the pair of (pne, protected_bits) we manipulate in this module.\nlet pne_bits_eq #l (x y: pne_cipher l) =\n fst x `lbytes_eq` fst y && snd x = snd y\n\n// Finding the entry for a given sample.\nlet sample_filter (#j:id) (u:info j) (s:sample) (e:entry u) : bool =\n Entry?.s e = s\n\nlet entry_for_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :\n GTot (option (entry u)) =\n Seq.find_l (sample_filter u s) (table st h)\n\n/// XXX unused\nlet contains_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :\n GTot bool =\n Some? (entry_for_sample s st h)\n\nlet fresh_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :\n GTot bool =\n None? (entry_for_sample s st h)\n\n\n/// Stateful API\n/// ------------\n\nval create (j:id) (u:info j) : ST (pne_state u)\n (requires fun _ -> True)\n (ensures fun h0 st h1 ->\n invariant st h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (footprint st) h0 h1 /\\\n B.(loc_includes (loc_pne_region ()) (footprint st)) /\\\n\n (is_safe j ==> table st h1 == Seq.empty))\n\nlet lemma_max_hash_len ha\n : Lemma (Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (if Some? (Spec.Hash.Definitions.max_input_length ha) then\n Some?.v (Spec.Hash.Definitions.max_input_length ha) >= pow2 61 - 1\n else\n True) /\\\n pow2 61 - 1 > 64)\n [SMTPat (Spec.Hash.Definitions.hash_length ha)]\n =\n assert_norm (pow2 61 < pow2 125);\n assert_norm (pow2 61 - 1 > 64);\n assert_norm (pow2 64 > pow2 61);\n assert_norm (pow2 128 > pow2 64)", "dependencies": { "source_file": "Model.PNE.fsti", "checked_file": "Model.PNE.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "ha: a: Spec.Hash.Definitions.hash_alg{Prims.op_Negation (Spec.Hash.Definitions.is_shake a)} -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Spec.Hash.Definitions.hash_alg", "Prims.b2t", "Prims.op_Negation", "Spec.Hash.Definitions.is_shake", "Model.Helpers.lbytes", "Spec.Hash.Definitions.hash_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let traffic_secret ha =", "completed_definiton": "lbytes (Spec.Hash.Definitions.hash_length ha)", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fsti", "name": "Model.PNE.pne_plain_length", "original_source_type": "", "source_type": "val pne_plain_length : Type0", "source_definition": "let pne_plain_length = l:nat {l >= 1 /\\ l <= 4}", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 43, "start_col": 23, "end_line": 43, "end_col": 47 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\n\n/// Abbreviations for idealization\n/// ------------------------------\n\ntype id = I.pne_id\ntype alg = I.ca\n\nlet is_safe (i:id) =\n I.is_pne_honest i && I.ideal_PNE\n\ntype safe_id =\n i:id{is_safe i}\n\ntype unsafe_id =\n i:id{not (is_safe i)}\n\n/// QUIC payload sampling\n/// --------------------\n\n// For simplicity, we do not distinguish between long and short headers; caller\n// of this module will just 0-left-pad the protected bits in the case of a long\n// header.\nlet bits: Type0 = LowParse.BitFields.ubitfield 8 5\n\n// Note: the sample is PUBLIC so is using QUIC.Spec.lbytes which do not operate over secret integers.\nlet sample_length = 16", "dependencies": { "source_file": "Model.PNE.fsti", "checked_file": "Model.PNE.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "Prims.op_LessThanOrEqual" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let pne_plain_length =", "completed_definiton": "l: nat{l >= 1 /\\ l <= 4}", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fsti", "name": "Model.PNE.pne_cipher", "original_source_type": "", "source_type": "val pne_cipher : l: Model.PNE.pne_plain_length -> Type0", "source_definition": "let pne_cipher (l:pne_plain_length) = lbytes l & bits", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 48, "start_col": 38, "end_line": 48, "end_col": 53 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\n\n/// Abbreviations for idealization\n/// ------------------------------\n\ntype id = I.pne_id\ntype alg = I.ca\n\nlet is_safe (i:id) =\n I.is_pne_honest i && I.ideal_PNE\n\ntype safe_id =\n i:id{is_safe i}\n\ntype unsafe_id =\n i:id{not (is_safe i)}\n\n/// QUIC payload sampling\n/// --------------------\n\n// For simplicity, we do not distinguish between long and short headers; caller\n// of this module will just 0-left-pad the protected bits in the case of a long\n// header.\nlet bits: Type0 = LowParse.BitFields.ubitfield 8 5\n\n// Note: the sample is PUBLIC so is using QUIC.Spec.lbytes which do not operate over secret integers.\nlet sample_length = 16\nlet sample = QUIC.Spec.lbytes sample_length\nlet pne_plain_length = l:nat {l >= 1 /\\ l <= 4}\n\nlet length_bits (l: pne_plain_length) =\n b:bits { LowParse.BitFields.get_bitfield b 0 2 + 1 == l }", "dependencies": { "source_file": "Model.PNE.fsti", "checked_file": "Model.PNE.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "l: Model.PNE.pne_plain_length -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.pne_plain_length", "FStar.Pervasives.Native.tuple2", "Model.Helpers.lbytes", "Model.PNE.bits" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let pne_cipher (l: pne_plain_length) =", "completed_definiton": "lbytes l & bits", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fsti", "name": "Model.PNE.is_safe", "original_source_type": "", "source_type": "val is_safe : i: Model.PNE.id -> Prims.bool", "source_definition": "let is_safe (i:id) =\n I.is_pne_honest i && I.ideal_PNE", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 24, "start_col": 2, "end_line": 24, "end_col": 34 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\n\n/// Abbreviations for idealization\n/// ------------------------------\n\ntype id = I.pne_id\ntype alg = I.ca", "dependencies": { "source_file": "Model.PNE.fsti", "checked_file": "Model.PNE.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: Model.PNE.id -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.id", "Prims.op_AmpAmp", "Model.Indexing.is_pne_honest", "Model.Flags.ideal_PNE", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let is_safe (i: id) =", "completed_definiton": "I.is_pne_honest i && I.ideal_PNE", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fsti", "name": "Model.PNE.info", "original_source_type": "", "source_type": "val info : j: Model.PNE.id -> Type", "source_definition": "let info (j:id) =\n info:info'{\n I.pne_id_ginfo j == info.calg /\\\n I.pne_id_ghash j == info.halg\n }", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 84, "start_col": 2, "end_line": 87, "end_col": 3 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\n\n/// Abbreviations for idealization\n/// ------------------------------\n\ntype id = I.pne_id\ntype alg = I.ca\n\nlet is_safe (i:id) =\n I.is_pne_honest i && I.ideal_PNE\n\ntype safe_id =\n i:id{is_safe i}\n\ntype unsafe_id =\n i:id{not (is_safe i)}\n\n/// QUIC payload sampling\n/// --------------------\n\n// For simplicity, we do not distinguish between long and short headers; caller\n// of this module will just 0-left-pad the protected bits in the case of a long\n// header.\nlet bits: Type0 = LowParse.BitFields.ubitfield 8 5\n\n// Note: the sample is PUBLIC so is using QUIC.Spec.lbytes which do not operate over secret integers.\nlet sample_length = 16\nlet sample = QUIC.Spec.lbytes sample_length\nlet pne_plain_length = l:nat {l >= 1 /\\ l <= 4}\n\nlet length_bits (l: pne_plain_length) =\n b:bits { LowParse.BitFields.get_bitfield b 0 2 + 1 == l }\n\nlet pne_cipher (l:pne_plain_length) = lbytes l & bits\nlet pne_cipherpad = lbytes 4 & bits\n\n/// Restrict a generated cipherpad to the length of the encoded packet number.\nval clip_cipherpad : (cp:pne_cipherpad) -> (l:pne_plain_length) -> pne_cipher l\n\n// We define a separate package type here (different from the one in AEAD). We\n// idealize them separately, and there's a specific part here that's about the\n// protected bits of the header.\nnoeq type pne_plain_pkg =\n | PNEPlainPkg:\n pne_plain: (j:id -> l:pne_plain_length -> t:eqtype) ->\n as_bytes: (j:id -> l:pne_plain_length -> pne_plain j l -> GTot (lbytes l & length_bits l)) ->\n repr: (j:unsafe_id -> l:pne_plain_length -> n:pne_plain j l ->\n Tot (b:(lbytes l & length_bits l) {b == as_bytes j l n})) ->\n mk: (j:id -> l:pne_plain_length -> n:lbytes l -> b:length_bits l -> p:pne_plain j l { as_bytes j l p == (n, b) }) ->\n xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad ->\n (l': pne_plain_length & pne_plain j l')) ->\n lemma_xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad -> Lemma\n (requires True)\n (ensures (\n let (| l', p' |) = xor j l p cp in\n let _, bits = as_bytes j l' p' in\n let l: pne_plain_length = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n let l': pne_plain_length = l' in\n l == l'\n ))) ->\n pne_plain_pkg\n\nnoeq type info' = {\n calg: alg;\n halg: I.ha;\n plain: pne_plain_pkg;\n}", "dependencies": { "source_file": "Model.PNE.fsti", "checked_file": "Model.PNE.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "j: Model.PNE.id -> Type", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.id", "Model.PNE.info'", "Prims.l_and", "Prims.eq2", "Model.Indexing.ca", "Model.Indexing.pne_id_ginfo", "Model.PNE.__proj__Mkinfo'__item__calg", "Model.Indexing.ha", "Model.Indexing.pne_id_ghash", "Model.PNE.__proj__Mkinfo'__item__halg" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let info (j: id) =", "completed_definiton": "info: info'{I.pne_id_ginfo j == info.calg /\\ I.pne_id_ghash j == info.halg}", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fsti", "name": "Model.PNE.pne_cipherpad", "original_source_type": "", "source_type": "val pne_cipherpad : Type0", "source_definition": "let pne_cipherpad = lbytes 4 & bits", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 49, "start_col": 20, "end_line": 49, "end_col": 35 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\n\n/// Abbreviations for idealization\n/// ------------------------------\n\ntype id = I.pne_id\ntype alg = I.ca\n\nlet is_safe (i:id) =\n I.is_pne_honest i && I.ideal_PNE\n\ntype safe_id =\n i:id{is_safe i}\n\ntype unsafe_id =\n i:id{not (is_safe i)}\n\n/// QUIC payload sampling\n/// --------------------\n\n// For simplicity, we do not distinguish between long and short headers; caller\n// of this module will just 0-left-pad the protected bits in the case of a long\n// header.\nlet bits: Type0 = LowParse.BitFields.ubitfield 8 5\n\n// Note: the sample is PUBLIC so is using QUIC.Spec.lbytes which do not operate over secret integers.\nlet sample_length = 16\nlet sample = QUIC.Spec.lbytes sample_length\nlet pne_plain_length = l:nat {l >= 1 /\\ l <= 4}\n\nlet length_bits (l: pne_plain_length) =\n b:bits { LowParse.BitFields.get_bitfield b 0 2 + 1 == l }", "dependencies": { "source_file": "Model.PNE.fsti", "checked_file": "Model.PNE.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Pervasives.Native.tuple2", "Model.Helpers.lbytes", "Model.PNE.bits" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let pne_cipherpad =", "completed_definiton": "lbytes 4 & bits", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fsti", "name": "Model.PNE.fresh_sample", "original_source_type": "val fresh_sample (#j: safe_id) (#u: info j) (s: sample) (st: pne_state u) (h: mem) : GTot bool", "source_type": "val fresh_sample (#j: safe_id) (#u: info j) (s: sample) (st: pne_state u) (h: mem) : GTot bool", "source_definition": "let fresh_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :\n GTot bool =\n None? (entry_for_sample s st h)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 150, "start_col": 2, "end_line": 150, "end_col": 33 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\n\n/// Abbreviations for idealization\n/// ------------------------------\n\ntype id = I.pne_id\ntype alg = I.ca\n\nlet is_safe (i:id) =\n I.is_pne_honest i && I.ideal_PNE\n\ntype safe_id =\n i:id{is_safe i}\n\ntype unsafe_id =\n i:id{not (is_safe i)}\n\n/// QUIC payload sampling\n/// --------------------\n\n// For simplicity, we do not distinguish between long and short headers; caller\n// of this module will just 0-left-pad the protected bits in the case of a long\n// header.\nlet bits: Type0 = LowParse.BitFields.ubitfield 8 5\n\n// Note: the sample is PUBLIC so is using QUIC.Spec.lbytes which do not operate over secret integers.\nlet sample_length = 16\nlet sample = QUIC.Spec.lbytes sample_length\nlet pne_plain_length = l:nat {l >= 1 /\\ l <= 4}\n\nlet length_bits (l: pne_plain_length) =\n b:bits { LowParse.BitFields.get_bitfield b 0 2 + 1 == l }\n\nlet pne_cipher (l:pne_plain_length) = lbytes l & bits\nlet pne_cipherpad = lbytes 4 & bits\n\n/// Restrict a generated cipherpad to the length of the encoded packet number.\nval clip_cipherpad : (cp:pne_cipherpad) -> (l:pne_plain_length) -> pne_cipher l\n\n// We define a separate package type here (different from the one in AEAD). We\n// idealize them separately, and there's a specific part here that's about the\n// protected bits of the header.\nnoeq type pne_plain_pkg =\n | PNEPlainPkg:\n pne_plain: (j:id -> l:pne_plain_length -> t:eqtype) ->\n as_bytes: (j:id -> l:pne_plain_length -> pne_plain j l -> GTot (lbytes l & length_bits l)) ->\n repr: (j:unsafe_id -> l:pne_plain_length -> n:pne_plain j l ->\n Tot (b:(lbytes l & length_bits l) {b == as_bytes j l n})) ->\n mk: (j:id -> l:pne_plain_length -> n:lbytes l -> b:length_bits l -> p:pne_plain j l { as_bytes j l p == (n, b) }) ->\n xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad ->\n (l': pne_plain_length & pne_plain j l')) ->\n lemma_xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad -> Lemma\n (requires True)\n (ensures (\n let (| l', p' |) = xor j l p cp in\n let _, bits = as_bytes j l' p' in\n let l: pne_plain_length = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n let l': pne_plain_length = l' in\n l == l'\n ))) ->\n pne_plain_pkg\n\nnoeq type info' = {\n calg: alg;\n halg: I.ha;\n plain: pne_plain_pkg;\n}\n\nlet info (j:id) =\n info:info'{\n I.pne_id_ginfo j == info.calg /\\\n I.pne_id_ghash j == info.halg\n }\n\nlet pne_plain (#j:id) (u:info j) (l:pne_plain_length) =\n PNEPlainPkg?.pne_plain u.plain j l\n\nnoeq\ntype entry (#j:id) (u:info j) =\n | Entry :\n s:sample ->\n #l:pne_plain_length ->\n n:pne_plain u l ->\n // We do not perform truncation at encryption-time, but rather at decryption-time\n c:pne_cipherpad ->\n entry u\n\nval pne_state : (#j:id) -> (u:info j) -> Type u#1\n\nval table : (#j:safe_id) -> (#u:info j) -> (st:pne_state u) -> (h:mem) -> GTot (Seq.seq (entry u))\n\n// Header protection key\nlet key_len (#j:id) (u:info j) = Spec.Agile.Cipher.key_length u.calg\nval key: #j:unsafe_id -> #u:info j -> st:pne_state u -> lbytes (key_len u)\n\nval footprint : #j:id -> #u:info j -> st:pne_state u -> GTot B.loc\n\nval invariant: #j:id -> #u:info j -> st:pne_state u -> mem -> Type0\n\nval frame_invariant: #j:id -> #u:info j -> st:pne_state u -> l:B.loc -> h0:mem -> h1:mem -> Lemma\n (requires (\n invariant st h0 /\\\n B.modifies l h0 h1 /\\\n B.loc_disjoint l (footprint st)))\n (ensures (\n invariant st h1))\n\nval frame_table: #j:safe_id -> #u:info j -> st:pne_state u ->\n r:B.loc -> h0:mem -> h1:mem ->\n Lemma\n (requires\n invariant st h0 /\\\n B.modifies r h0 h1 /\\\n r `B.loc_disjoint` (footprint st))\n (ensures table st h1 == table st h0)\n\n// Equality for the pair of (pne, protected_bits) we manipulate in this module.\nlet pne_bits_eq #l (x y: pne_cipher l) =\n fst x `lbytes_eq` fst y && snd x = snd y\n\n// Finding the entry for a given sample.\nlet sample_filter (#j:id) (u:info j) (s:sample) (e:entry u) : bool =\n Entry?.s e = s\n\nlet entry_for_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :\n GTot (option (entry u)) =\n Seq.find_l (sample_filter u s) (table st h)\n\n/// XXX unused\nlet contains_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :\n GTot bool =\n Some? (entry_for_sample s st h)\n\nlet fresh_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :", "dependencies": { "source_file": "Model.PNE.fsti", "checked_file": "Model.PNE.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: Model.PNE.sample -> st: Model.PNE.pne_state u92 -> h: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Prims.bool", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.safe_id", "Model.PNE.info", "Model.PNE.sample", "Model.PNE.pne_state", "FStar.Monotonic.HyperStack.mem", "FStar.Pervasives.Native.uu___is_None", "Model.PNE.entry", "Model.PNE.entry_for_sample", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val fresh_sample (#j: safe_id) (#u: info j) (s: sample) (st: pne_state u) (h: mem) : GTot bool\nlet fresh_sample (#j: safe_id) (#u: info j) (s: sample) (st: pne_state u) (h: mem) : GTot bool =", "completed_definiton": "None? (entry_for_sample s st h)", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fsti", "name": "Model.PNE.key_len", "original_source_type": "", "source_type": "val key_len : u70: Model.PNE.info j -> n: Prims.nat{n <= Prims.pow2 32 - 1}", "source_definition": "let key_len (#j:id) (u:info j) = Spec.Agile.Cipher.key_length u.calg", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 107, "start_col": 33, "end_line": 107, "end_col": 68 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\n\n/// Abbreviations for idealization\n/// ------------------------------\n\ntype id = I.pne_id\ntype alg = I.ca\n\nlet is_safe (i:id) =\n I.is_pne_honest i && I.ideal_PNE\n\ntype safe_id =\n i:id{is_safe i}\n\ntype unsafe_id =\n i:id{not (is_safe i)}\n\n/// QUIC payload sampling\n/// --------------------\n\n// For simplicity, we do not distinguish between long and short headers; caller\n// of this module will just 0-left-pad the protected bits in the case of a long\n// header.\nlet bits: Type0 = LowParse.BitFields.ubitfield 8 5\n\n// Note: the sample is PUBLIC so is using QUIC.Spec.lbytes which do not operate over secret integers.\nlet sample_length = 16\nlet sample = QUIC.Spec.lbytes sample_length\nlet pne_plain_length = l:nat {l >= 1 /\\ l <= 4}\n\nlet length_bits (l: pne_plain_length) =\n b:bits { LowParse.BitFields.get_bitfield b 0 2 + 1 == l }\n\nlet pne_cipher (l:pne_plain_length) = lbytes l & bits\nlet pne_cipherpad = lbytes 4 & bits\n\n/// Restrict a generated cipherpad to the length of the encoded packet number.\nval clip_cipherpad : (cp:pne_cipherpad) -> (l:pne_plain_length) -> pne_cipher l\n\n// We define a separate package type here (different from the one in AEAD). We\n// idealize them separately, and there's a specific part here that's about the\n// protected bits of the header.\nnoeq type pne_plain_pkg =\n | PNEPlainPkg:\n pne_plain: (j:id -> l:pne_plain_length -> t:eqtype) ->\n as_bytes: (j:id -> l:pne_plain_length -> pne_plain j l -> GTot (lbytes l & length_bits l)) ->\n repr: (j:unsafe_id -> l:pne_plain_length -> n:pne_plain j l ->\n Tot (b:(lbytes l & length_bits l) {b == as_bytes j l n})) ->\n mk: (j:id -> l:pne_plain_length -> n:lbytes l -> b:length_bits l -> p:pne_plain j l { as_bytes j l p == (n, b) }) ->\n xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad ->\n (l': pne_plain_length & pne_plain j l')) ->\n lemma_xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad -> Lemma\n (requires True)\n (ensures (\n let (| l', p' |) = xor j l p cp in\n let _, bits = as_bytes j l' p' in\n let l: pne_plain_length = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n let l': pne_plain_length = l' in\n l == l'\n ))) ->\n pne_plain_pkg\n\nnoeq type info' = {\n calg: alg;\n halg: I.ha;\n plain: pne_plain_pkg;\n}\n\nlet info (j:id) =\n info:info'{\n I.pne_id_ginfo j == info.calg /\\\n I.pne_id_ghash j == info.halg\n }\n\nlet pne_plain (#j:id) (u:info j) (l:pne_plain_length) =\n PNEPlainPkg?.pne_plain u.plain j l\n\nnoeq\ntype entry (#j:id) (u:info j) =\n | Entry :\n s:sample ->\n #l:pne_plain_length ->\n n:pne_plain u l ->\n // We do not perform truncation at encryption-time, but rather at decryption-time\n c:pne_cipherpad ->\n entry u\n\nval pne_state : (#j:id) -> (u:info j) -> Type u#1\n\nval table : (#j:safe_id) -> (#u:info j) -> (st:pne_state u) -> (h:mem) -> GTot (Seq.seq (entry u))", "dependencies": { "source_file": "Model.PNE.fsti", "checked_file": "Model.PNE.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "u70: Model.PNE.info j -> n: Prims.nat{n <= Prims.pow2 32 - 1}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.id", "Model.PNE.info", "Spec.Agile.Cipher.key_length", "Model.PNE.__proj__Mkinfo'__item__calg", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_Subtraction", "Prims.pow2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let key_len (#j: id) (u: info j) =", "completed_definiton": "Spec.Agile.Cipher.key_length u.calg", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fsti", "name": "Model.PNE.entry_for_sample", "original_source_type": "val entry_for_sample (#j: safe_id) (#u: info j) (s: sample) (st: pne_state u) (h: mem)\n : GTot (option (entry u))", "source_type": "val entry_for_sample (#j: safe_id) (#u: info j) (s: sample) (st: pne_state u) (h: mem)\n : GTot (option (entry u))", "source_definition": "let entry_for_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :\n GTot (option (entry u)) =\n Seq.find_l (sample_filter u s) (table st h)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 141, "start_col": 2, "end_line": 141, "end_col": 45 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\n\n/// Abbreviations for idealization\n/// ------------------------------\n\ntype id = I.pne_id\ntype alg = I.ca\n\nlet is_safe (i:id) =\n I.is_pne_honest i && I.ideal_PNE\n\ntype safe_id =\n i:id{is_safe i}\n\ntype unsafe_id =\n i:id{not (is_safe i)}\n\n/// QUIC payload sampling\n/// --------------------\n\n// For simplicity, we do not distinguish between long and short headers; caller\n// of this module will just 0-left-pad the protected bits in the case of a long\n// header.\nlet bits: Type0 = LowParse.BitFields.ubitfield 8 5\n\n// Note: the sample is PUBLIC so is using QUIC.Spec.lbytes which do not operate over secret integers.\nlet sample_length = 16\nlet sample = QUIC.Spec.lbytes sample_length\nlet pne_plain_length = l:nat {l >= 1 /\\ l <= 4}\n\nlet length_bits (l: pne_plain_length) =\n b:bits { LowParse.BitFields.get_bitfield b 0 2 + 1 == l }\n\nlet pne_cipher (l:pne_plain_length) = lbytes l & bits\nlet pne_cipherpad = lbytes 4 & bits\n\n/// Restrict a generated cipherpad to the length of the encoded packet number.\nval clip_cipherpad : (cp:pne_cipherpad) -> (l:pne_plain_length) -> pne_cipher l\n\n// We define a separate package type here (different from the one in AEAD). We\n// idealize them separately, and there's a specific part here that's about the\n// protected bits of the header.\nnoeq type pne_plain_pkg =\n | PNEPlainPkg:\n pne_plain: (j:id -> l:pne_plain_length -> t:eqtype) ->\n as_bytes: (j:id -> l:pne_plain_length -> pne_plain j l -> GTot (lbytes l & length_bits l)) ->\n repr: (j:unsafe_id -> l:pne_plain_length -> n:pne_plain j l ->\n Tot (b:(lbytes l & length_bits l) {b == as_bytes j l n})) ->\n mk: (j:id -> l:pne_plain_length -> n:lbytes l -> b:length_bits l -> p:pne_plain j l { as_bytes j l p == (n, b) }) ->\n xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad ->\n (l': pne_plain_length & pne_plain j l')) ->\n lemma_xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad -> Lemma\n (requires True)\n (ensures (\n let (| l', p' |) = xor j l p cp in\n let _, bits = as_bytes j l' p' in\n let l: pne_plain_length = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n let l': pne_plain_length = l' in\n l == l'\n ))) ->\n pne_plain_pkg\n\nnoeq type info' = {\n calg: alg;\n halg: I.ha;\n plain: pne_plain_pkg;\n}\n\nlet info (j:id) =\n info:info'{\n I.pne_id_ginfo j == info.calg /\\\n I.pne_id_ghash j == info.halg\n }\n\nlet pne_plain (#j:id) (u:info j) (l:pne_plain_length) =\n PNEPlainPkg?.pne_plain u.plain j l\n\nnoeq\ntype entry (#j:id) (u:info j) =\n | Entry :\n s:sample ->\n #l:pne_plain_length ->\n n:pne_plain u l ->\n // We do not perform truncation at encryption-time, but rather at decryption-time\n c:pne_cipherpad ->\n entry u\n\nval pne_state : (#j:id) -> (u:info j) -> Type u#1\n\nval table : (#j:safe_id) -> (#u:info j) -> (st:pne_state u) -> (h:mem) -> GTot (Seq.seq (entry u))\n\n// Header protection key\nlet key_len (#j:id) (u:info j) = Spec.Agile.Cipher.key_length u.calg\nval key: #j:unsafe_id -> #u:info j -> st:pne_state u -> lbytes (key_len u)\n\nval footprint : #j:id -> #u:info j -> st:pne_state u -> GTot B.loc\n\nval invariant: #j:id -> #u:info j -> st:pne_state u -> mem -> Type0\n\nval frame_invariant: #j:id -> #u:info j -> st:pne_state u -> l:B.loc -> h0:mem -> h1:mem -> Lemma\n (requires (\n invariant st h0 /\\\n B.modifies l h0 h1 /\\\n B.loc_disjoint l (footprint st)))\n (ensures (\n invariant st h1))\n\nval frame_table: #j:safe_id -> #u:info j -> st:pne_state u ->\n r:B.loc -> h0:mem -> h1:mem ->\n Lemma\n (requires\n invariant st h0 /\\\n B.modifies r h0 h1 /\\\n r `B.loc_disjoint` (footprint st))\n (ensures table st h1 == table st h0)\n\n// Equality for the pair of (pne, protected_bits) we manipulate in this module.\nlet pne_bits_eq #l (x y: pne_cipher l) =\n fst x `lbytes_eq` fst y && snd x = snd y\n\n// Finding the entry for a given sample.\nlet sample_filter (#j:id) (u:info j) (s:sample) (e:entry u) : bool =\n Entry?.s e = s\n\nlet entry_for_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :", "dependencies": { "source_file": "Model.PNE.fsti", "checked_file": "Model.PNE.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: Model.PNE.sample -> st: Model.PNE.pne_state u82 -> h: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot (FStar.Pervasives.Native.option (Model.PNE.entry u82))", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.safe_id", "Model.PNE.info", "Model.PNE.sample", "Model.PNE.pne_state", "FStar.Monotonic.HyperStack.mem", "FStar.Seq.Properties.find_l", "Model.PNE.entry", "Model.PNE.sample_filter", "Model.PNE.table", "FStar.Pervasives.Native.option" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val entry_for_sample (#j: safe_id) (#u: info j) (s: sample) (st: pne_state u) (h: mem)\n : GTot (option (entry u))\nlet entry_for_sample (#j: safe_id) (#u: info j) (s: sample) (st: pne_state u) (h: mem)\n : GTot (option (entry u)) =", "completed_definiton": "Seq.find_l (sample_filter u s) (table st h)", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fsti", "name": "Model.PNE.sample", "original_source_type": "", "source_type": "val sample : Type0", "source_definition": "let sample = QUIC.Spec.lbytes sample_length", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 42, "start_col": 13, "end_line": 42, "end_col": 43 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\n\n/// Abbreviations for idealization\n/// ------------------------------\n\ntype id = I.pne_id\ntype alg = I.ca\n\nlet is_safe (i:id) =\n I.is_pne_honest i && I.ideal_PNE\n\ntype safe_id =\n i:id{is_safe i}\n\ntype unsafe_id =\n i:id{not (is_safe i)}\n\n/// QUIC payload sampling\n/// --------------------\n\n// For simplicity, we do not distinguish between long and short headers; caller\n// of this module will just 0-left-pad the protected bits in the case of a long\n// header.\nlet bits: Type0 = LowParse.BitFields.ubitfield 8 5\n\n// Note: the sample is PUBLIC so is using QUIC.Spec.lbytes which do not operate over secret integers.", "dependencies": { "source_file": "Model.PNE.fsti", "checked_file": "Model.PNE.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.lbytes", "Model.PNE.sample_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let sample =", "completed_definiton": "QUIC.Spec.lbytes sample_length", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fsti", "name": "Model.PNE.pne_bits_eq", "original_source_type": "", "source_type": "val pne_bits_eq : x: Model.PNE.pne_cipher l -> y: Model.PNE.pne_cipher l -> Prims.bool", "source_definition": "let pne_bits_eq #l (x y: pne_cipher l) =\n fst x `lbytes_eq` fst y && snd x = snd y", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 133, "start_col": 2, "end_line": 133, "end_col": 42 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\n\n/// Abbreviations for idealization\n/// ------------------------------\n\ntype id = I.pne_id\ntype alg = I.ca\n\nlet is_safe (i:id) =\n I.is_pne_honest i && I.ideal_PNE\n\ntype safe_id =\n i:id{is_safe i}\n\ntype unsafe_id =\n i:id{not (is_safe i)}\n\n/// QUIC payload sampling\n/// --------------------\n\n// For simplicity, we do not distinguish between long and short headers; caller\n// of this module will just 0-left-pad the protected bits in the case of a long\n// header.\nlet bits: Type0 = LowParse.BitFields.ubitfield 8 5\n\n// Note: the sample is PUBLIC so is using QUIC.Spec.lbytes which do not operate over secret integers.\nlet sample_length = 16\nlet sample = QUIC.Spec.lbytes sample_length\nlet pne_plain_length = l:nat {l >= 1 /\\ l <= 4}\n\nlet length_bits (l: pne_plain_length) =\n b:bits { LowParse.BitFields.get_bitfield b 0 2 + 1 == l }\n\nlet pne_cipher (l:pne_plain_length) = lbytes l & bits\nlet pne_cipherpad = lbytes 4 & bits\n\n/// Restrict a generated cipherpad to the length of the encoded packet number.\nval clip_cipherpad : (cp:pne_cipherpad) -> (l:pne_plain_length) -> pne_cipher l\n\n// We define a separate package type here (different from the one in AEAD). We\n// idealize them separately, and there's a specific part here that's about the\n// protected bits of the header.\nnoeq type pne_plain_pkg =\n | PNEPlainPkg:\n pne_plain: (j:id -> l:pne_plain_length -> t:eqtype) ->\n as_bytes: (j:id -> l:pne_plain_length -> pne_plain j l -> GTot (lbytes l & length_bits l)) ->\n repr: (j:unsafe_id -> l:pne_plain_length -> n:pne_plain j l ->\n Tot (b:(lbytes l & length_bits l) {b == as_bytes j l n})) ->\n mk: (j:id -> l:pne_plain_length -> n:lbytes l -> b:length_bits l -> p:pne_plain j l { as_bytes j l p == (n, b) }) ->\n xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad ->\n (l': pne_plain_length & pne_plain j l')) ->\n lemma_xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad -> Lemma\n (requires True)\n (ensures (\n let (| l', p' |) = xor j l p cp in\n let _, bits = as_bytes j l' p' in\n let l: pne_plain_length = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n let l': pne_plain_length = l' in\n l == l'\n ))) ->\n pne_plain_pkg\n\nnoeq type info' = {\n calg: alg;\n halg: I.ha;\n plain: pne_plain_pkg;\n}\n\nlet info (j:id) =\n info:info'{\n I.pne_id_ginfo j == info.calg /\\\n I.pne_id_ghash j == info.halg\n }\n\nlet pne_plain (#j:id) (u:info j) (l:pne_plain_length) =\n PNEPlainPkg?.pne_plain u.plain j l\n\nnoeq\ntype entry (#j:id) (u:info j) =\n | Entry :\n s:sample ->\n #l:pne_plain_length ->\n n:pne_plain u l ->\n // We do not perform truncation at encryption-time, but rather at decryption-time\n c:pne_cipherpad ->\n entry u\n\nval pne_state : (#j:id) -> (u:info j) -> Type u#1\n\nval table : (#j:safe_id) -> (#u:info j) -> (st:pne_state u) -> (h:mem) -> GTot (Seq.seq (entry u))\n\n// Header protection key\nlet key_len (#j:id) (u:info j) = Spec.Agile.Cipher.key_length u.calg\nval key: #j:unsafe_id -> #u:info j -> st:pne_state u -> lbytes (key_len u)\n\nval footprint : #j:id -> #u:info j -> st:pne_state u -> GTot B.loc\n\nval invariant: #j:id -> #u:info j -> st:pne_state u -> mem -> Type0\n\nval frame_invariant: #j:id -> #u:info j -> st:pne_state u -> l:B.loc -> h0:mem -> h1:mem -> Lemma\n (requires (\n invariant st h0 /\\\n B.modifies l h0 h1 /\\\n B.loc_disjoint l (footprint st)))\n (ensures (\n invariant st h1))\n\nval frame_table: #j:safe_id -> #u:info j -> st:pne_state u ->\n r:B.loc -> h0:mem -> h1:mem ->\n Lemma\n (requires\n invariant st h0 /\\\n B.modifies r h0 h1 /\\\n r `B.loc_disjoint` (footprint st))\n (ensures table st h1 == table st h0)\n\n// Equality for the pair of (pne, protected_bits) we manipulate in this module.", "dependencies": { "source_file": "Model.PNE.fsti", "checked_file": "Model.PNE.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Model.PNE.pne_cipher l -> y: Model.PNE.pne_cipher l -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.pne_plain_length", "Model.PNE.pne_cipher", "Prims.op_AmpAmp", "Model.Helpers.lbytes_eq", "FStar.Pervasives.Native.fst", "Model.Helpers.lbytes", "Model.PNE.bits", "Prims.op_Equality", "FStar.Pervasives.Native.snd", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let pne_bits_eq #l (x: pne_cipher l) (y: pne_cipher l) =", "completed_definiton": "(fst x) `lbytes_eq` (fst y) && snd x = snd y", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fsti", "name": "Model.PNE.sample_filter", "original_source_type": "val sample_filter (#j: id) (u: info j) (s: sample) (e: entry u) : bool", "source_type": "val sample_filter (#j: id) (u: info j) (s: sample) (e: entry u) : bool", "source_definition": "let sample_filter (#j:id) (u:info j) (s:sample) (e:entry u) : bool =\n Entry?.s e = s", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 137, "start_col": 2, "end_line": 137, "end_col": 16 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\n\n/// Abbreviations for idealization\n/// ------------------------------\n\ntype id = I.pne_id\ntype alg = I.ca\n\nlet is_safe (i:id) =\n I.is_pne_honest i && I.ideal_PNE\n\ntype safe_id =\n i:id{is_safe i}\n\ntype unsafe_id =\n i:id{not (is_safe i)}\n\n/// QUIC payload sampling\n/// --------------------\n\n// For simplicity, we do not distinguish between long and short headers; caller\n// of this module will just 0-left-pad the protected bits in the case of a long\n// header.\nlet bits: Type0 = LowParse.BitFields.ubitfield 8 5\n\n// Note: the sample is PUBLIC so is using QUIC.Spec.lbytes which do not operate over secret integers.\nlet sample_length = 16\nlet sample = QUIC.Spec.lbytes sample_length\nlet pne_plain_length = l:nat {l >= 1 /\\ l <= 4}\n\nlet length_bits (l: pne_plain_length) =\n b:bits { LowParse.BitFields.get_bitfield b 0 2 + 1 == l }\n\nlet pne_cipher (l:pne_plain_length) = lbytes l & bits\nlet pne_cipherpad = lbytes 4 & bits\n\n/// Restrict a generated cipherpad to the length of the encoded packet number.\nval clip_cipherpad : (cp:pne_cipherpad) -> (l:pne_plain_length) -> pne_cipher l\n\n// We define a separate package type here (different from the one in AEAD). We\n// idealize them separately, and there's a specific part here that's about the\n// protected bits of the header.\nnoeq type pne_plain_pkg =\n | PNEPlainPkg:\n pne_plain: (j:id -> l:pne_plain_length -> t:eqtype) ->\n as_bytes: (j:id -> l:pne_plain_length -> pne_plain j l -> GTot (lbytes l & length_bits l)) ->\n repr: (j:unsafe_id -> l:pne_plain_length -> n:pne_plain j l ->\n Tot (b:(lbytes l & length_bits l) {b == as_bytes j l n})) ->\n mk: (j:id -> l:pne_plain_length -> n:lbytes l -> b:length_bits l -> p:pne_plain j l { as_bytes j l p == (n, b) }) ->\n xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad ->\n (l': pne_plain_length & pne_plain j l')) ->\n lemma_xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad -> Lemma\n (requires True)\n (ensures (\n let (| l', p' |) = xor j l p cp in\n let _, bits = as_bytes j l' p' in\n let l: pne_plain_length = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n let l': pne_plain_length = l' in\n l == l'\n ))) ->\n pne_plain_pkg\n\nnoeq type info' = {\n calg: alg;\n halg: I.ha;\n plain: pne_plain_pkg;\n}\n\nlet info (j:id) =\n info:info'{\n I.pne_id_ginfo j == info.calg /\\\n I.pne_id_ghash j == info.halg\n }\n\nlet pne_plain (#j:id) (u:info j) (l:pne_plain_length) =\n PNEPlainPkg?.pne_plain u.plain j l\n\nnoeq\ntype entry (#j:id) (u:info j) =\n | Entry :\n s:sample ->\n #l:pne_plain_length ->\n n:pne_plain u l ->\n // We do not perform truncation at encryption-time, but rather at decryption-time\n c:pne_cipherpad ->\n entry u\n\nval pne_state : (#j:id) -> (u:info j) -> Type u#1\n\nval table : (#j:safe_id) -> (#u:info j) -> (st:pne_state u) -> (h:mem) -> GTot (Seq.seq (entry u))\n\n// Header protection key\nlet key_len (#j:id) (u:info j) = Spec.Agile.Cipher.key_length u.calg\nval key: #j:unsafe_id -> #u:info j -> st:pne_state u -> lbytes (key_len u)\n\nval footprint : #j:id -> #u:info j -> st:pne_state u -> GTot B.loc\n\nval invariant: #j:id -> #u:info j -> st:pne_state u -> mem -> Type0\n\nval frame_invariant: #j:id -> #u:info j -> st:pne_state u -> l:B.loc -> h0:mem -> h1:mem -> Lemma\n (requires (\n invariant st h0 /\\\n B.modifies l h0 h1 /\\\n B.loc_disjoint l (footprint st)))\n (ensures (\n invariant st h1))\n\nval frame_table: #j:safe_id -> #u:info j -> st:pne_state u ->\n r:B.loc -> h0:mem -> h1:mem ->\n Lemma\n (requires\n invariant st h0 /\\\n B.modifies r h0 h1 /\\\n r `B.loc_disjoint` (footprint st))\n (ensures table st h1 == table st h0)\n\n// Equality for the pair of (pne, protected_bits) we manipulate in this module.\nlet pne_bits_eq #l (x y: pne_cipher l) =\n fst x `lbytes_eq` fst y && snd x = snd y\n\n// Finding the entry for a given sample.", "dependencies": { "source_file": "Model.PNE.fsti", "checked_file": "Model.PNE.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "u77: Model.PNE.info j -> s: Model.PNE.sample -> e: Model.PNE.entry u77 -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.id", "Model.PNE.info", "Model.PNE.sample", "Model.PNE.entry", "Prims.op_Equality", "Model.PNE.__proj__Entry__item__s", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val sample_filter (#j: id) (u: info j) (s: sample) (e: entry u) : bool\nlet sample_filter (#j: id) (u: info j) (s: sample) (e: entry u) : bool =", "completed_definiton": "Entry?.s e = s", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fsti", "name": "Model.PNE.xor_cipherpad", "original_source_type": "val xor_cipherpad (cp1 cp2: pne_cipherpad) : pne_cipherpad", "source_type": "val xor_cipherpad (cp1 cp2: pne_cipherpad) : pne_cipherpad", "source_definition": "let xor_cipherpad (cp1 cp2: pne_cipherpad): pne_cipherpad =\n let c1, b1 = cp1 in\n let c2, b2 = cp2 in\n let x1 = LowParse.BitFields.get_bitfield b1 0 5 in\n let x2 = LowParse.BitFields.get_bitfield b2 0 5 in\n QUIC.UInt.lemma_logxor_lt #8 x1 x2 5;\n let v = x1 `UInt.logxor` x2 in\n LowParse.BitFields.set_bitfield_bound #8 0 5 0 5 v;\n Seq.init 4 (fun i -> Seq.index c1 i `Lib.IntTypes.(logxor #U8 #SEC)` Seq.index c2 i),\n LowParse.BitFields.set_bitfield #8 0 0 5 v", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 292, "start_col": 59, "end_line": 301, "end_col": 44 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\n\n/// Abbreviations for idealization\n/// ------------------------------\n\ntype id = I.pne_id\ntype alg = I.ca\n\nlet is_safe (i:id) =\n I.is_pne_honest i && I.ideal_PNE\n\ntype safe_id =\n i:id{is_safe i}\n\ntype unsafe_id =\n i:id{not (is_safe i)}\n\n/// QUIC payload sampling\n/// --------------------\n\n// For simplicity, we do not distinguish between long and short headers; caller\n// of this module will just 0-left-pad the protected bits in the case of a long\n// header.\nlet bits: Type0 = LowParse.BitFields.ubitfield 8 5\n\n// Note: the sample is PUBLIC so is using QUIC.Spec.lbytes which do not operate over secret integers.\nlet sample_length = 16\nlet sample = QUIC.Spec.lbytes sample_length\nlet pne_plain_length = l:nat {l >= 1 /\\ l <= 4}\n\nlet length_bits (l: pne_plain_length) =\n b:bits { LowParse.BitFields.get_bitfield b 0 2 + 1 == l }\n\nlet pne_cipher (l:pne_plain_length) = lbytes l & bits\nlet pne_cipherpad = lbytes 4 & bits\n\n/// Restrict a generated cipherpad to the length of the encoded packet number.\nval clip_cipherpad : (cp:pne_cipherpad) -> (l:pne_plain_length) -> pne_cipher l\n\n// We define a separate package type here (different from the one in AEAD). We\n// idealize them separately, and there's a specific part here that's about the\n// protected bits of the header.\nnoeq type pne_plain_pkg =\n | PNEPlainPkg:\n pne_plain: (j:id -> l:pne_plain_length -> t:eqtype) ->\n as_bytes: (j:id -> l:pne_plain_length -> pne_plain j l -> GTot (lbytes l & length_bits l)) ->\n repr: (j:unsafe_id -> l:pne_plain_length -> n:pne_plain j l ->\n Tot (b:(lbytes l & length_bits l) {b == as_bytes j l n})) ->\n mk: (j:id -> l:pne_plain_length -> n:lbytes l -> b:length_bits l -> p:pne_plain j l { as_bytes j l p == (n, b) }) ->\n xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad ->\n (l': pne_plain_length & pne_plain j l')) ->\n lemma_xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad -> Lemma\n (requires True)\n (ensures (\n let (| l', p' |) = xor j l p cp in\n let _, bits = as_bytes j l' p' in\n let l: pne_plain_length = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n let l': pne_plain_length = l' in\n l == l'\n ))) ->\n pne_plain_pkg\n\nnoeq type info' = {\n calg: alg;\n halg: I.ha;\n plain: pne_plain_pkg;\n}\n\nlet info (j:id) =\n info:info'{\n I.pne_id_ginfo j == info.calg /\\\n I.pne_id_ghash j == info.halg\n }\n\nlet pne_plain (#j:id) (u:info j) (l:pne_plain_length) =\n PNEPlainPkg?.pne_plain u.plain j l\n\nnoeq\ntype entry (#j:id) (u:info j) =\n | Entry :\n s:sample ->\n #l:pne_plain_length ->\n n:pne_plain u l ->\n // We do not perform truncation at encryption-time, but rather at decryption-time\n c:pne_cipherpad ->\n entry u\n\nval pne_state : (#j:id) -> (u:info j) -> Type u#1\n\nval table : (#j:safe_id) -> (#u:info j) -> (st:pne_state u) -> (h:mem) -> GTot (Seq.seq (entry u))\n\n// Header protection key\nlet key_len (#j:id) (u:info j) = Spec.Agile.Cipher.key_length u.calg\nval key: #j:unsafe_id -> #u:info j -> st:pne_state u -> lbytes (key_len u)\n\nval footprint : #j:id -> #u:info j -> st:pne_state u -> GTot B.loc\n\nval invariant: #j:id -> #u:info j -> st:pne_state u -> mem -> Type0\n\nval frame_invariant: #j:id -> #u:info j -> st:pne_state u -> l:B.loc -> h0:mem -> h1:mem -> Lemma\n (requires (\n invariant st h0 /\\\n B.modifies l h0 h1 /\\\n B.loc_disjoint l (footprint st)))\n (ensures (\n invariant st h1))\n\nval frame_table: #j:safe_id -> #u:info j -> st:pne_state u ->\n r:B.loc -> h0:mem -> h1:mem ->\n Lemma\n (requires\n invariant st h0 /\\\n B.modifies r h0 h1 /\\\n r `B.loc_disjoint` (footprint st))\n (ensures table st h1 == table st h0)\n\n// Equality for the pair of (pne, protected_bits) we manipulate in this module.\nlet pne_bits_eq #l (x y: pne_cipher l) =\n fst x `lbytes_eq` fst y && snd x = snd y\n\n// Finding the entry for a given sample.\nlet sample_filter (#j:id) (u:info j) (s:sample) (e:entry u) : bool =\n Entry?.s e = s\n\nlet entry_for_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :\n GTot (option (entry u)) =\n Seq.find_l (sample_filter u s) (table st h)\n\n/// XXX unused\nlet contains_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :\n GTot bool =\n Some? (entry_for_sample s st h)\n\nlet fresh_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :\n GTot bool =\n None? (entry_for_sample s st h)\n\n\n/// Stateful API\n/// ------------\n\nval create (j:id) (u:info j) : ST (pne_state u)\n (requires fun _ -> True)\n (ensures fun h0 st h1 ->\n invariant st h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (footprint st) h0 h1 /\\\n B.(loc_includes (loc_pne_region ()) (footprint st)) /\\\n\n (is_safe j ==> table st h1 == Seq.empty))\n\nlet lemma_max_hash_len ha\n : Lemma (Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (if Some? (Spec.Hash.Definitions.max_input_length ha) then\n Some?.v (Spec.Hash.Definitions.max_input_length ha) >= pow2 61 - 1\n else\n True) /\\\n pow2 61 - 1 > 64)\n [SMTPat (Spec.Hash.Definitions.hash_length ha)]\n =\n assert_norm (pow2 61 < pow2 125);\n assert_norm (pow2 61 - 1 > 64);\n assert_norm (pow2 64 > pow2 61);\n assert_norm (pow2 128 > pow2 64)\n\nlet traffic_secret ha =\n lbytes (Spec.Hash.Definitions.hash_length ha)\n\nval coerce (j:unsafe_id) (u:info j)\n (k:lbytes (key_len u))\n : ST (pne_state #j u)\n (requires fun _ -> True)\n (ensures fun h0 st h1 ->\n invariant st h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (footprint st) h0 h1 /\\\n B.(loc_includes (loc_pne_region ()) (footprint st)) /\\\n key st == k)\n\nval quic_coerce (j:unsafe_id) (u:info j)\n (ts:traffic_secret u.halg)\n : ST (pne_state #j u)\n (requires fun _ -> True)\n (ensures fun h0 st h1 ->\n invariant st h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (footprint st) h0 h1 /\\\n B.(loc_includes (loc_pne_region ()) (footprint st)) /\\\n key st ==\n QUIC.Spec.derive_secret u.halg ts\n QUIC.Spec.label_hp (key_len u))\n\nlet encrypt_spec (a: Spec.cipher_alg)\n (l: pne_plain_length)\n (pn: lbytes l)\n (b: length_bits l)\n (s: sample)\n (k: Spec.key a):\n pne_cipher l\n=\n let open QUIC.Spec.Lemmas in\n // We need the packet number length in order to know where to find the mask in the cipher block.\n let mask = Model.Helpers.reveal #16 (QUIC.TotSpec.block_of_sample a k (Model.Helpers.hide s)) in\n let pnmask = and_inplace (Seq.slice mask 1 (l + 1)) (QUIC.Spec.Header.pn_sizemask (l - 1)) 0 in\n // Classify, because HACL* specs require secret integers.\n let pnmask = Seq.init (Seq.length pnmask) (fun i -> Lib.IntTypes.u8 (UInt8.v (Seq.index pnmask i))) in\n assert (Seq.length pnmask == l);\n // We now have enough to build the encrypted pn. Note that because our\n // input is a sliced packet number, we don't mask at an offset like\n // header_encrypt does.\n let encrypted_pn = pointwise_op (Lib.IntTypes.(logxor #U8 #SEC)) pn pnmask 0 in\n // Now on to bit protection. Since we receive as input only the protected\n // bits, there is a proof obligation for a caller, to show that get_bf\n // (header.[0] `xor` mask.[0]) == get_bf header.[0] `xor` get_bf mask.[0]\n let mask_bits: bits = LowParse.BitFields.get_bitfield (UInt8.v (Seq.index mask 0)) 0 5 in\n let protected_bits = mask_bits `FStar.UInt.logxor` b in\n QUIC.UInt.lemma_logxor_lt #8 mask_bits b 5;\n encrypted_pn, protected_bits\n\nval encrypt :\n (#j:id) ->\n (#u:info j) ->\n (st:pne_state u) ->\n (#l:pne_plain_length) ->\n (n:pne_plain u l) ->\n // For confidentiality modeling, this function takes as inputs only the public\n // parts of the header.\n (s:sample) ->\n ST (pne_cipher l)\n (requires fun h0 ->\n invariant st h0 /\\\n // cannot talk about freshness because it requires talking about the\n // table which is only available for safe id's\n (is_safe j ==> fresh_sample s st h0))\n (ensures fun h0 c h1 ->\n invariant st h1 /\\\n B.modifies (footprint st) h0 h1 /\\ (\n if is_safe j then\n exists (c': pne_cipherpad).\n table st h1 == Seq.snoc (table st h0) (Entry s #l n c') /\\\n clip_cipherpad c' l == c\n else\n // Our input is: plain packet number, plain bits to be protected\n let pn, bits = PNEPlainPkg?.as_bytes u.plain j l n in\n let k = key st in\n // We output an encrypted packet number and protected bits\n c == encrypt_spec u.calg l pn bits s k))\n\nlet decrypt_spec\n (#j:unsafe_id)\n (#u:info j)\n (a: Spec.cipher_alg)\n (padded_cipher: lbytes 4)\n (b: bits)\n (k: Spec.key a)\n (s: sample):\n (l:pne_plain_length & pne_plain u l)\n=\n // This mimics the specification of header_decrypt_aux starting after:\n // let sample = ...\n let mask = Model.Helpers.reveal #16 (QUIC.TotSpec.block_of_sample a k (Model.Helpers.hide s)) in\n // Decrypting protected bits\n let mask_bits: bits = LowParse.BitFields.get_bitfield (UInt8.v (Seq.index mask 0)) 0 5 in\n QUIC.UInt.lemma_logxor_lt #8 mask_bits b 5;\n let b = mask_bits `FStar.UInt.logxor` b in\n // Moving on to the pn length which is part of the protected bits\n let pn_len = LowParse.BitFields.get_bitfield b 0 2 in\n assert (0 <= pn_len /\\ pn_len <= 3);\n let pnmask = QUIC.Spec.Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (QUIC.Spec.Header.pn_sizemask pn_len) 0 in\n assert (let l = Seq.length pnmask in 1 <= l /\\ l <= 4);\n // Classify, because HACL* specs require secret integers.\n let pnmask = Seq.init (Seq.length pnmask) (fun i -> Lib.IntTypes.u8 (UInt8.v (Seq.index pnmask i))) in\n let cipher = Seq.slice padded_cipher 0 (pn_len + 1) in\n assert (Seq.length cipher == Seq.length pnmask /\\ Seq.length cipher == pn_len + 1);\n let pn = QUIC.Spec.Lemmas.pointwise_op (Lib.IntTypes.(logxor #U8 #SEC)) cipher pnmask 0 in\n (| pn_len + 1, PNEPlainPkg?.mk u.plain j (pn_len + 1) pn b |)", "dependencies": { "source_file": "Model.PNE.fsti", "checked_file": "Model.PNE.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "cp1: Model.PNE.pne_cipherpad -> cp2: Model.PNE.pne_cipherpad -> Model.PNE.pne_cipherpad", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.pne_cipherpad", "Model.Helpers.lbytes", "Model.PNE.bits", "FStar.Pervasives.Native.Mktuple2", "FStar.Seq.Base.init", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Lib.IntTypes.logxor", "FStar.Seq.Base.index", "Lib.IntTypes.uint8", "LowParse.BitFields.set_bitfield", "Prims.unit", "LowParse.BitFields.set_bitfield_bound", "FStar.UInt.uint_t", "FStar.UInt.logxor", "QUIC.UInt.lemma_logxor_lt", "LowParse.BitFields.ubitfield", "Prims.op_Subtraction", "LowParse.BitFields.get_bitfield" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val xor_cipherpad (cp1 cp2: pne_cipherpad) : pne_cipherpad\nlet xor_cipherpad (cp1 cp2: pne_cipherpad) : pne_cipherpad =", "completed_definiton": "let c1, b1 = cp1 in\nlet c2, b2 = cp2 in\nlet x1 = LowParse.BitFields.get_bitfield b1 0 5 in\nlet x2 = LowParse.BitFields.get_bitfield b2 0 5 in\nQUIC.UInt.lemma_logxor_lt #8 x1 x2 5;\nlet v = x1 `UInt.logxor` x2 in\nLowParse.BitFields.set_bitfield_bound #8 0 5 0 5 v;\nSeq.init 4 (fun i -> (Seq.index c1 i) `Lib.IntTypes.(logxor #U8 #SEC)` (Seq.index c2 i)),\nLowParse.BitFields.set_bitfield #8 0 0 5 v", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fsti", "name": "Model.PNE.encrypt_spec", "original_source_type": "val encrypt_spec\n (a: Spec.cipher_alg)\n (l: pne_plain_length)\n (pn: lbytes l)\n (b: length_bits l)\n (s: sample)\n (k: Spec.key a)\n : pne_cipher l", "source_type": "val encrypt_spec\n (a: Spec.cipher_alg)\n (l: pne_plain_length)\n (pn: lbytes l)\n (b: length_bits l)\n (s: sample)\n (k: Spec.key a)\n : pne_cipher l", "source_definition": "let encrypt_spec (a: Spec.cipher_alg)\n (l: pne_plain_length)\n (pn: lbytes l)\n (b: length_bits l)\n (s: sample)\n (k: Spec.key a):\n pne_cipher l\n=\n let open QUIC.Spec.Lemmas in\n // We need the packet number length in order to know where to find the mask in the cipher block.\n let mask = Model.Helpers.reveal #16 (QUIC.TotSpec.block_of_sample a k (Model.Helpers.hide s)) in\n let pnmask = and_inplace (Seq.slice mask 1 (l + 1)) (QUIC.Spec.Header.pn_sizemask (l - 1)) 0 in\n // Classify, because HACL* specs require secret integers.\n let pnmask = Seq.init (Seq.length pnmask) (fun i -> Lib.IntTypes.u8 (UInt8.v (Seq.index pnmask i))) in\n assert (Seq.length pnmask == l);\n // We now have enough to build the encrypted pn. Note that because our\n // input is a sliced packet number, we don't mask at an offset like\n // header_encrypt does.\n let encrypted_pn = pointwise_op (Lib.IntTypes.(logxor #U8 #SEC)) pn pnmask 0 in\n // Now on to bit protection. Since we receive as input only the protected\n // bits, there is a proof obligation for a caller, to show that get_bf\n // (header.[0] `xor` mask.[0]) == get_bf header.[0] `xor` get_bf mask.[0]\n let mask_bits: bits = LowParse.BitFields.get_bitfield (UInt8.v (Seq.index mask 0)) 0 5 in\n let protected_bits = mask_bits `FStar.UInt.logxor` b in\n QUIC.UInt.lemma_logxor_lt #8 mask_bits b 5;\n encrypted_pn, protected_bits", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 215, "start_col": 2, "end_line": 232, "end_col": 30 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\n\n/// Abbreviations for idealization\n/// ------------------------------\n\ntype id = I.pne_id\ntype alg = I.ca\n\nlet is_safe (i:id) =\n I.is_pne_honest i && I.ideal_PNE\n\ntype safe_id =\n i:id{is_safe i}\n\ntype unsafe_id =\n i:id{not (is_safe i)}\n\n/// QUIC payload sampling\n/// --------------------\n\n// For simplicity, we do not distinguish between long and short headers; caller\n// of this module will just 0-left-pad the protected bits in the case of a long\n// header.\nlet bits: Type0 = LowParse.BitFields.ubitfield 8 5\n\n// Note: the sample is PUBLIC so is using QUIC.Spec.lbytes which do not operate over secret integers.\nlet sample_length = 16\nlet sample = QUIC.Spec.lbytes sample_length\nlet pne_plain_length = l:nat {l >= 1 /\\ l <= 4}\n\nlet length_bits (l: pne_plain_length) =\n b:bits { LowParse.BitFields.get_bitfield b 0 2 + 1 == l }\n\nlet pne_cipher (l:pne_plain_length) = lbytes l & bits\nlet pne_cipherpad = lbytes 4 & bits\n\n/// Restrict a generated cipherpad to the length of the encoded packet number.\nval clip_cipherpad : (cp:pne_cipherpad) -> (l:pne_plain_length) -> pne_cipher l\n\n// We define a separate package type here (different from the one in AEAD). We\n// idealize them separately, and there's a specific part here that's about the\n// protected bits of the header.\nnoeq type pne_plain_pkg =\n | PNEPlainPkg:\n pne_plain: (j:id -> l:pne_plain_length -> t:eqtype) ->\n as_bytes: (j:id -> l:pne_plain_length -> pne_plain j l -> GTot (lbytes l & length_bits l)) ->\n repr: (j:unsafe_id -> l:pne_plain_length -> n:pne_plain j l ->\n Tot (b:(lbytes l & length_bits l) {b == as_bytes j l n})) ->\n mk: (j:id -> l:pne_plain_length -> n:lbytes l -> b:length_bits l -> p:pne_plain j l { as_bytes j l p == (n, b) }) ->\n xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad ->\n (l': pne_plain_length & pne_plain j l')) ->\n lemma_xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad -> Lemma\n (requires True)\n (ensures (\n let (| l', p' |) = xor j l p cp in\n let _, bits = as_bytes j l' p' in\n let l: pne_plain_length = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n let l': pne_plain_length = l' in\n l == l'\n ))) ->\n pne_plain_pkg\n\nnoeq type info' = {\n calg: alg;\n halg: I.ha;\n plain: pne_plain_pkg;\n}\n\nlet info (j:id) =\n info:info'{\n I.pne_id_ginfo j == info.calg /\\\n I.pne_id_ghash j == info.halg\n }\n\nlet pne_plain (#j:id) (u:info j) (l:pne_plain_length) =\n PNEPlainPkg?.pne_plain u.plain j l\n\nnoeq\ntype entry (#j:id) (u:info j) =\n | Entry :\n s:sample ->\n #l:pne_plain_length ->\n n:pne_plain u l ->\n // We do not perform truncation at encryption-time, but rather at decryption-time\n c:pne_cipherpad ->\n entry u\n\nval pne_state : (#j:id) -> (u:info j) -> Type u#1\n\nval table : (#j:safe_id) -> (#u:info j) -> (st:pne_state u) -> (h:mem) -> GTot (Seq.seq (entry u))\n\n// Header protection key\nlet key_len (#j:id) (u:info j) = Spec.Agile.Cipher.key_length u.calg\nval key: #j:unsafe_id -> #u:info j -> st:pne_state u -> lbytes (key_len u)\n\nval footprint : #j:id -> #u:info j -> st:pne_state u -> GTot B.loc\n\nval invariant: #j:id -> #u:info j -> st:pne_state u -> mem -> Type0\n\nval frame_invariant: #j:id -> #u:info j -> st:pne_state u -> l:B.loc -> h0:mem -> h1:mem -> Lemma\n (requires (\n invariant st h0 /\\\n B.modifies l h0 h1 /\\\n B.loc_disjoint l (footprint st)))\n (ensures (\n invariant st h1))\n\nval frame_table: #j:safe_id -> #u:info j -> st:pne_state u ->\n r:B.loc -> h0:mem -> h1:mem ->\n Lemma\n (requires\n invariant st h0 /\\\n B.modifies r h0 h1 /\\\n r `B.loc_disjoint` (footprint st))\n (ensures table st h1 == table st h0)\n\n// Equality for the pair of (pne, protected_bits) we manipulate in this module.\nlet pne_bits_eq #l (x y: pne_cipher l) =\n fst x `lbytes_eq` fst y && snd x = snd y\n\n// Finding the entry for a given sample.\nlet sample_filter (#j:id) (u:info j) (s:sample) (e:entry u) : bool =\n Entry?.s e = s\n\nlet entry_for_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :\n GTot (option (entry u)) =\n Seq.find_l (sample_filter u s) (table st h)\n\n/// XXX unused\nlet contains_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :\n GTot bool =\n Some? (entry_for_sample s st h)\n\nlet fresh_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :\n GTot bool =\n None? (entry_for_sample s st h)\n\n\n/// Stateful API\n/// ------------\n\nval create (j:id) (u:info j) : ST (pne_state u)\n (requires fun _ -> True)\n (ensures fun h0 st h1 ->\n invariant st h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (footprint st) h0 h1 /\\\n B.(loc_includes (loc_pne_region ()) (footprint st)) /\\\n\n (is_safe j ==> table st h1 == Seq.empty))\n\nlet lemma_max_hash_len ha\n : Lemma (Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (if Some? (Spec.Hash.Definitions.max_input_length ha) then\n Some?.v (Spec.Hash.Definitions.max_input_length ha) >= pow2 61 - 1\n else\n True) /\\\n pow2 61 - 1 > 64)\n [SMTPat (Spec.Hash.Definitions.hash_length ha)]\n =\n assert_norm (pow2 61 < pow2 125);\n assert_norm (pow2 61 - 1 > 64);\n assert_norm (pow2 64 > pow2 61);\n assert_norm (pow2 128 > pow2 64)\n\nlet traffic_secret ha =\n lbytes (Spec.Hash.Definitions.hash_length ha)\n\nval coerce (j:unsafe_id) (u:info j)\n (k:lbytes (key_len u))\n : ST (pne_state #j u)\n (requires fun _ -> True)\n (ensures fun h0 st h1 ->\n invariant st h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (footprint st) h0 h1 /\\\n B.(loc_includes (loc_pne_region ()) (footprint st)) /\\\n key st == k)\n\nval quic_coerce (j:unsafe_id) (u:info j)\n (ts:traffic_secret u.halg)\n : ST (pne_state #j u)\n (requires fun _ -> True)\n (ensures fun h0 st h1 ->\n invariant st h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (footprint st) h0 h1 /\\\n B.(loc_includes (loc_pne_region ()) (footprint st)) /\\\n key st ==\n QUIC.Spec.derive_secret u.halg ts\n QUIC.Spec.label_hp (key_len u))\n\nlet encrypt_spec (a: Spec.cipher_alg)\n (l: pne_plain_length)\n (pn: lbytes l)\n (b: length_bits l)\n (s: sample)\n (k: Spec.key a):\n pne_cipher l", "dependencies": { "source_file": "Model.PNE.fsti", "checked_file": "Model.PNE.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: Spec.Agile.Cipher.cipher_alg ->\n l: Model.PNE.pne_plain_length ->\n pn: Model.Helpers.lbytes l ->\n b: Model.PNE.length_bits l ->\n s: Model.PNE.sample ->\n k: Spec.Agile.Cipher.key a\n -> Model.PNE.pne_cipher l", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Spec.Agile.Cipher.cipher_alg", "Model.PNE.pne_plain_length", "Model.Helpers.lbytes", "Model.PNE.length_bits", "Model.PNE.sample", "Spec.Agile.Cipher.key", "FStar.Pervasives.Native.Mktuple2", "Model.PNE.bits", "Prims.unit", "QUIC.UInt.lemma_logxor_lt", "FStar.UInt.uint_t", "FStar.UInt.logxor", "LowParse.BitFields.get_bitfield", "FStar.UInt8.n", "FStar.UInt8.v", "FStar.Seq.Base.index", "QUIC.Spec.Base.byte", "FStar.Seq.Base.seq", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "QUIC.Spec.Lemmas.pointwise_op", "Lib.IntTypes.uint8", "Lib.IntTypes.logxor", "Prims._assert", "Prims.eq2", "Prims.nat", "FStar.Seq.Base.length", "FStar.Seq.Base.init", "Prims.b2t", "Prims.op_LessThan", "Lib.IntTypes.u8", "QUIC.Spec.Base.bytes", "QUIC.Spec.Lemmas.and_inplace", "FStar.Seq.Base.slice", "Prims.op_Addition", "QUIC.Spec.Header.pn_sizemask", "Prims.op_Subtraction", "QUIC.Spec.Base.lbytes", "Model.Helpers.reveal", "QUIC.TotSpec.block_of_sample", "Model.Helpers.hide", "Model.PNE.pne_cipher" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val encrypt_spec\n (a: Spec.cipher_alg)\n (l: pne_plain_length)\n (pn: lbytes l)\n (b: length_bits l)\n (s: sample)\n (k: Spec.key a)\n : pne_cipher l\nlet encrypt_spec\n (a: Spec.cipher_alg)\n (l: pne_plain_length)\n (pn: lbytes l)\n (b: length_bits l)\n (s: sample)\n (k: Spec.key a)\n : pne_cipher l =", "completed_definiton": "let open QUIC.Spec.Lemmas in\nlet mask = Model.Helpers.reveal #16 (QUIC.TotSpec.block_of_sample a k (Model.Helpers.hide s)) in\nlet pnmask = and_inplace (Seq.slice mask 1 (l + 1)) (QUIC.Spec.Header.pn_sizemask (l - 1)) 0 in\nlet pnmask =\n Seq.init (Seq.length pnmask) (fun i -> Lib.IntTypes.u8 (UInt8.v (Seq.index pnmask i)))\nin\nassert (Seq.length pnmask == l);\nlet encrypted_pn = pointwise_op (let open Lib.IntTypes in logxor #U8 #SEC) pn pnmask 0 in\nlet mask_bits:bits = LowParse.BitFields.get_bitfield (UInt8.v (Seq.index mask 0)) 0 5 in\nlet protected_bits = mask_bits `FStar.UInt.logxor` b in\nQUIC.UInt.lemma_logxor_lt #8 mask_bits b 5;\nencrypted_pn, protected_bits", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fsti", "name": "Model.PNE.decrypt_spec", "original_source_type": "val decrypt_spec\n (#j: unsafe_id)\n (#u: info j)\n (a: Spec.cipher_alg)\n (padded_cipher: lbytes 4)\n (b: bits)\n (k: Spec.key a)\n (s: sample)\n : (l: pne_plain_length & pne_plain u l)", "source_type": "val decrypt_spec\n (#j: unsafe_id)\n (#u: info j)\n (a: Spec.cipher_alg)\n (padded_cipher: lbytes 4)\n (b: bits)\n (k: Spec.key a)\n (s: sample)\n : (l: pne_plain_length & pne_plain u l)", "source_definition": "let decrypt_spec\n (#j:unsafe_id)\n (#u:info j)\n (a: Spec.cipher_alg)\n (padded_cipher: lbytes 4)\n (b: bits)\n (k: Spec.key a)\n (s: sample):\n (l:pne_plain_length & pne_plain u l)\n=\n // This mimics the specification of header_decrypt_aux starting after:\n // let sample = ...\n let mask = Model.Helpers.reveal #16 (QUIC.TotSpec.block_of_sample a k (Model.Helpers.hide s)) in\n // Decrypting protected bits\n let mask_bits: bits = LowParse.BitFields.get_bitfield (UInt8.v (Seq.index mask 0)) 0 5 in\n QUIC.UInt.lemma_logxor_lt #8 mask_bits b 5;\n let b = mask_bits `FStar.UInt.logxor` b in\n // Moving on to the pn length which is part of the protected bits\n let pn_len = LowParse.BitFields.get_bitfield b 0 2 in\n assert (0 <= pn_len /\\ pn_len <= 3);\n let pnmask = QUIC.Spec.Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (QUIC.Spec.Header.pn_sizemask pn_len) 0 in\n assert (let l = Seq.length pnmask in 1 <= l /\\ l <= 4);\n // Classify, because HACL* specs require secret integers.\n let pnmask = Seq.init (Seq.length pnmask) (fun i -> Lib.IntTypes.u8 (UInt8.v (Seq.index pnmask i))) in\n let cipher = Seq.slice padded_cipher 0 (pn_len + 1) in\n assert (Seq.length cipher == Seq.length pnmask /\\ Seq.length cipher == pn_len + 1);\n let pn = QUIC.Spec.Lemmas.pointwise_op (Lib.IntTypes.(logxor #U8 #SEC)) cipher pnmask 0 in\n (| pn_len + 1, PNEPlainPkg?.mk u.plain j (pn_len + 1) pn b |)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 272, "start_col": 1, "end_line": 290, "end_col": 63 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\n\n/// Abbreviations for idealization\n/// ------------------------------\n\ntype id = I.pne_id\ntype alg = I.ca\n\nlet is_safe (i:id) =\n I.is_pne_honest i && I.ideal_PNE\n\ntype safe_id =\n i:id{is_safe i}\n\ntype unsafe_id =\n i:id{not (is_safe i)}\n\n/// QUIC payload sampling\n/// --------------------\n\n// For simplicity, we do not distinguish between long and short headers; caller\n// of this module will just 0-left-pad the protected bits in the case of a long\n// header.\nlet bits: Type0 = LowParse.BitFields.ubitfield 8 5\n\n// Note: the sample is PUBLIC so is using QUIC.Spec.lbytes which do not operate over secret integers.\nlet sample_length = 16\nlet sample = QUIC.Spec.lbytes sample_length\nlet pne_plain_length = l:nat {l >= 1 /\\ l <= 4}\n\nlet length_bits (l: pne_plain_length) =\n b:bits { LowParse.BitFields.get_bitfield b 0 2 + 1 == l }\n\nlet pne_cipher (l:pne_plain_length) = lbytes l & bits\nlet pne_cipherpad = lbytes 4 & bits\n\n/// Restrict a generated cipherpad to the length of the encoded packet number.\nval clip_cipherpad : (cp:pne_cipherpad) -> (l:pne_plain_length) -> pne_cipher l\n\n// We define a separate package type here (different from the one in AEAD). We\n// idealize them separately, and there's a specific part here that's about the\n// protected bits of the header.\nnoeq type pne_plain_pkg =\n | PNEPlainPkg:\n pne_plain: (j:id -> l:pne_plain_length -> t:eqtype) ->\n as_bytes: (j:id -> l:pne_plain_length -> pne_plain j l -> GTot (lbytes l & length_bits l)) ->\n repr: (j:unsafe_id -> l:pne_plain_length -> n:pne_plain j l ->\n Tot (b:(lbytes l & length_bits l) {b == as_bytes j l n})) ->\n mk: (j:id -> l:pne_plain_length -> n:lbytes l -> b:length_bits l -> p:pne_plain j l { as_bytes j l p == (n, b) }) ->\n xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad ->\n (l': pne_plain_length & pne_plain j l')) ->\n lemma_xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad -> Lemma\n (requires True)\n (ensures (\n let (| l', p' |) = xor j l p cp in\n let _, bits = as_bytes j l' p' in\n let l: pne_plain_length = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n let l': pne_plain_length = l' in\n l == l'\n ))) ->\n pne_plain_pkg\n\nnoeq type info' = {\n calg: alg;\n halg: I.ha;\n plain: pne_plain_pkg;\n}\n\nlet info (j:id) =\n info:info'{\n I.pne_id_ginfo j == info.calg /\\\n I.pne_id_ghash j == info.halg\n }\n\nlet pne_plain (#j:id) (u:info j) (l:pne_plain_length) =\n PNEPlainPkg?.pne_plain u.plain j l\n\nnoeq\ntype entry (#j:id) (u:info j) =\n | Entry :\n s:sample ->\n #l:pne_plain_length ->\n n:pne_plain u l ->\n // We do not perform truncation at encryption-time, but rather at decryption-time\n c:pne_cipherpad ->\n entry u\n\nval pne_state : (#j:id) -> (u:info j) -> Type u#1\n\nval table : (#j:safe_id) -> (#u:info j) -> (st:pne_state u) -> (h:mem) -> GTot (Seq.seq (entry u))\n\n// Header protection key\nlet key_len (#j:id) (u:info j) = Spec.Agile.Cipher.key_length u.calg\nval key: #j:unsafe_id -> #u:info j -> st:pne_state u -> lbytes (key_len u)\n\nval footprint : #j:id -> #u:info j -> st:pne_state u -> GTot B.loc\n\nval invariant: #j:id -> #u:info j -> st:pne_state u -> mem -> Type0\n\nval frame_invariant: #j:id -> #u:info j -> st:pne_state u -> l:B.loc -> h0:mem -> h1:mem -> Lemma\n (requires (\n invariant st h0 /\\\n B.modifies l h0 h1 /\\\n B.loc_disjoint l (footprint st)))\n (ensures (\n invariant st h1))\n\nval frame_table: #j:safe_id -> #u:info j -> st:pne_state u ->\n r:B.loc -> h0:mem -> h1:mem ->\n Lemma\n (requires\n invariant st h0 /\\\n B.modifies r h0 h1 /\\\n r `B.loc_disjoint` (footprint st))\n (ensures table st h1 == table st h0)\n\n// Equality for the pair of (pne, protected_bits) we manipulate in this module.\nlet pne_bits_eq #l (x y: pne_cipher l) =\n fst x `lbytes_eq` fst y && snd x = snd y\n\n// Finding the entry for a given sample.\nlet sample_filter (#j:id) (u:info j) (s:sample) (e:entry u) : bool =\n Entry?.s e = s\n\nlet entry_for_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :\n GTot (option (entry u)) =\n Seq.find_l (sample_filter u s) (table st h)\n\n/// XXX unused\nlet contains_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :\n GTot bool =\n Some? (entry_for_sample s st h)\n\nlet fresh_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :\n GTot bool =\n None? (entry_for_sample s st h)\n\n\n/// Stateful API\n/// ------------\n\nval create (j:id) (u:info j) : ST (pne_state u)\n (requires fun _ -> True)\n (ensures fun h0 st h1 ->\n invariant st h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (footprint st) h0 h1 /\\\n B.(loc_includes (loc_pne_region ()) (footprint st)) /\\\n\n (is_safe j ==> table st h1 == Seq.empty))\n\nlet lemma_max_hash_len ha\n : Lemma (Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (if Some? (Spec.Hash.Definitions.max_input_length ha) then\n Some?.v (Spec.Hash.Definitions.max_input_length ha) >= pow2 61 - 1\n else\n True) /\\\n pow2 61 - 1 > 64)\n [SMTPat (Spec.Hash.Definitions.hash_length ha)]\n =\n assert_norm (pow2 61 < pow2 125);\n assert_norm (pow2 61 - 1 > 64);\n assert_norm (pow2 64 > pow2 61);\n assert_norm (pow2 128 > pow2 64)\n\nlet traffic_secret ha =\n lbytes (Spec.Hash.Definitions.hash_length ha)\n\nval coerce (j:unsafe_id) (u:info j)\n (k:lbytes (key_len u))\n : ST (pne_state #j u)\n (requires fun _ -> True)\n (ensures fun h0 st h1 ->\n invariant st h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (footprint st) h0 h1 /\\\n B.(loc_includes (loc_pne_region ()) (footprint st)) /\\\n key st == k)\n\nval quic_coerce (j:unsafe_id) (u:info j)\n (ts:traffic_secret u.halg)\n : ST (pne_state #j u)\n (requires fun _ -> True)\n (ensures fun h0 st h1 ->\n invariant st h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (footprint st) h0 h1 /\\\n B.(loc_includes (loc_pne_region ()) (footprint st)) /\\\n key st ==\n QUIC.Spec.derive_secret u.halg ts\n QUIC.Spec.label_hp (key_len u))\n\nlet encrypt_spec (a: Spec.cipher_alg)\n (l: pne_plain_length)\n (pn: lbytes l)\n (b: length_bits l)\n (s: sample)\n (k: Spec.key a):\n pne_cipher l\n=\n let open QUIC.Spec.Lemmas in\n // We need the packet number length in order to know where to find the mask in the cipher block.\n let mask = Model.Helpers.reveal #16 (QUIC.TotSpec.block_of_sample a k (Model.Helpers.hide s)) in\n let pnmask = and_inplace (Seq.slice mask 1 (l + 1)) (QUIC.Spec.Header.pn_sizemask (l - 1)) 0 in\n // Classify, because HACL* specs require secret integers.\n let pnmask = Seq.init (Seq.length pnmask) (fun i -> Lib.IntTypes.u8 (UInt8.v (Seq.index pnmask i))) in\n assert (Seq.length pnmask == l);\n // We now have enough to build the encrypted pn. Note that because our\n // input is a sliced packet number, we don't mask at an offset like\n // header_encrypt does.\n let encrypted_pn = pointwise_op (Lib.IntTypes.(logxor #U8 #SEC)) pn pnmask 0 in\n // Now on to bit protection. Since we receive as input only the protected\n // bits, there is a proof obligation for a caller, to show that get_bf\n // (header.[0] `xor` mask.[0]) == get_bf header.[0] `xor` get_bf mask.[0]\n let mask_bits: bits = LowParse.BitFields.get_bitfield (UInt8.v (Seq.index mask 0)) 0 5 in\n let protected_bits = mask_bits `FStar.UInt.logxor` b in\n QUIC.UInt.lemma_logxor_lt #8 mask_bits b 5;\n encrypted_pn, protected_bits\n\nval encrypt :\n (#j:id) ->\n (#u:info j) ->\n (st:pne_state u) ->\n (#l:pne_plain_length) ->\n (n:pne_plain u l) ->\n // For confidentiality modeling, this function takes as inputs only the public\n // parts of the header.\n (s:sample) ->\n ST (pne_cipher l)\n (requires fun h0 ->\n invariant st h0 /\\\n // cannot talk about freshness because it requires talking about the\n // table which is only available for safe id's\n (is_safe j ==> fresh_sample s st h0))\n (ensures fun h0 c h1 ->\n invariant st h1 /\\\n B.modifies (footprint st) h0 h1 /\\ (\n if is_safe j then\n exists (c': pne_cipherpad).\n table st h1 == Seq.snoc (table st h0) (Entry s #l n c') /\\\n clip_cipherpad c' l == c\n else\n // Our input is: plain packet number, plain bits to be protected\n let pn, bits = PNEPlainPkg?.as_bytes u.plain j l n in\n let k = key st in\n // We output an encrypted packet number and protected bits\n c == encrypt_spec u.calg l pn bits s k))\n\nlet decrypt_spec\n (#j:unsafe_id)\n (#u:info j)\n (a: Spec.cipher_alg)\n (padded_cipher: lbytes 4)\n (b: bits)\n (k: Spec.key a)\n (s: sample):", "dependencies": { "source_file": "Model.PNE.fsti", "checked_file": "Model.PNE.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: Spec.Agile.Cipher.cipher_alg ->\n padded_cipher: Model.Helpers.lbytes 4 ->\n b: Model.PNE.bits ->\n k: Spec.Agile.Cipher.key a ->\n s: Model.PNE.sample\n -> Prims.dtuple2 Model.PNE.pne_plain_length (fun l -> Model.PNE.pne_plain u107 l)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.unsafe_id", "Model.PNE.info", "Spec.Agile.Cipher.cipher_alg", "Model.Helpers.lbytes", "Model.PNE.bits", "Spec.Agile.Cipher.key", "Model.PNE.sample", "Prims.Mkdtuple2", "Model.PNE.pne_plain_length", "Model.PNE.pne_plain", "Prims.op_Addition", "Model.PNE.__proj__PNEPlainPkg__item__mk", "Model.PNE.__proj__Mkinfo'__item__plain", "FStar.Seq.Base.seq", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "QUIC.Spec.Lemmas.pointwise_op", "Lib.IntTypes.uint8", "Lib.IntTypes.logxor", "Prims.unit", "Prims._assert", "Prims.l_and", "Prims.eq2", "Prims.nat", "FStar.Seq.Base.length", "Prims.int", "FStar.Seq.Base.slice", "FStar.Seq.Base.init", "QUIC.Spec.Base.byte", "Prims.b2t", "Prims.op_LessThan", "Lib.IntTypes.u8", "FStar.UInt8.v", "FStar.Seq.Base.index", "Prims.op_LessThanOrEqual", "QUIC.Spec.Base.bytes", "QUIC.Spec.Lemmas.and_inplace", "QUIC.Spec.Header.pn_sizemask", "LowParse.BitFields.ubitfield", "Prims.op_Subtraction", "LowParse.BitFields.get_bitfield", "FStar.UInt.uint_t", "FStar.UInt.logxor", "QUIC.UInt.lemma_logxor_lt", "FStar.UInt8.n", "QUIC.Spec.Base.lbytes", "Model.Helpers.reveal", "QUIC.TotSpec.block_of_sample", "Model.Helpers.hide", "Prims.dtuple2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val decrypt_spec\n (#j: unsafe_id)\n (#u: info j)\n (a: Spec.cipher_alg)\n (padded_cipher: lbytes 4)\n (b: bits)\n (k: Spec.key a)\n (s: sample)\n : (l: pne_plain_length & pne_plain u l)\nlet decrypt_spec\n (#j: unsafe_id)\n (#u: info j)\n (a: Spec.cipher_alg)\n (padded_cipher: lbytes 4)\n (b: bits)\n (k: Spec.key a)\n (s: sample)\n : (l: pne_plain_length & pne_plain u l) =", "completed_definiton": "let mask = Model.Helpers.reveal #16 (QUIC.TotSpec.block_of_sample a k (Model.Helpers.hide s)) in\nlet mask_bits:bits = LowParse.BitFields.get_bitfield (UInt8.v (Seq.index mask 0)) 0 5 in\nQUIC.UInt.lemma_logxor_lt #8 mask_bits b 5;\nlet b = mask_bits `FStar.UInt.logxor` b in\nlet pn_len = LowParse.BitFields.get_bitfield b 0 2 in\nassert (0 <= pn_len /\\ pn_len <= 3);\nlet pnmask =\n QUIC.Spec.Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2))\n (QUIC.Spec.Header.pn_sizemask pn_len)\n 0\nin\nassert (let l = Seq.length pnmask in\n 1 <= l /\\ l <= 4);\nlet pnmask =\n Seq.init (Seq.length pnmask) (fun i -> Lib.IntTypes.u8 (UInt8.v (Seq.index pnmask i)))\nin\nlet cipher = Seq.slice padded_cipher 0 (pn_len + 1) in\nassert (Seq.length cipher == Seq.length pnmask /\\ Seq.length cipher == pn_len + 1);\nlet pn = QUIC.Spec.Lemmas.pointwise_op (let open Lib.IntTypes in logxor #U8 #SEC) cipher pnmask 0 in\n(| pn_len + 1, PNEPlainPkg?.mk u.plain j (pn_len + 1) pn b |)", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fsti", "name": "Model.PNE.lemma_max_hash_len", "original_source_type": "val lemma_max_hash_len (ha: _)\n : Lemma\n (Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (if Some? (Spec.Hash.Definitions.max_input_length ha)\n then Some?.v (Spec.Hash.Definitions.max_input_length ha) >= pow2 61 - 1\n else True) /\\ pow2 61 - 1 > 64) [SMTPat (Spec.Hash.Definitions.hash_length ha)]", "source_type": "val lemma_max_hash_len (ha: _)\n : Lemma\n (Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (if Some? (Spec.Hash.Definitions.max_input_length ha)\n then Some?.v (Spec.Hash.Definitions.max_input_length ha) >= pow2 61 - 1\n else True) /\\ pow2 61 - 1 > 64) [SMTPat (Spec.Hash.Definitions.hash_length ha)]", "source_definition": "let lemma_max_hash_len ha\n : Lemma (Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (if Some? (Spec.Hash.Definitions.max_input_length ha) then\n Some?.v (Spec.Hash.Definitions.max_input_length ha) >= pow2 61 - 1\n else\n True) /\\\n pow2 61 - 1 > 64)\n [SMTPat (Spec.Hash.Definitions.hash_length ha)]\n =\n assert_norm (pow2 61 < pow2 125);\n assert_norm (pow2 61 - 1 > 64);\n assert_norm (pow2 64 > pow2 61);\n assert_norm (pow2 128 > pow2 64)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 175, "start_col": 2, "end_line": 178, "end_col": 34 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\n\n/// Abbreviations for idealization\n/// ------------------------------\n\ntype id = I.pne_id\ntype alg = I.ca\n\nlet is_safe (i:id) =\n I.is_pne_honest i && I.ideal_PNE\n\ntype safe_id =\n i:id{is_safe i}\n\ntype unsafe_id =\n i:id{not (is_safe i)}\n\n/// QUIC payload sampling\n/// --------------------\n\n// For simplicity, we do not distinguish between long and short headers; caller\n// of this module will just 0-left-pad the protected bits in the case of a long\n// header.\nlet bits: Type0 = LowParse.BitFields.ubitfield 8 5\n\n// Note: the sample is PUBLIC so is using QUIC.Spec.lbytes which do not operate over secret integers.\nlet sample_length = 16\nlet sample = QUIC.Spec.lbytes sample_length\nlet pne_plain_length = l:nat {l >= 1 /\\ l <= 4}\n\nlet length_bits (l: pne_plain_length) =\n b:bits { LowParse.BitFields.get_bitfield b 0 2 + 1 == l }\n\nlet pne_cipher (l:pne_plain_length) = lbytes l & bits\nlet pne_cipherpad = lbytes 4 & bits\n\n/// Restrict a generated cipherpad to the length of the encoded packet number.\nval clip_cipherpad : (cp:pne_cipherpad) -> (l:pne_plain_length) -> pne_cipher l\n\n// We define a separate package type here (different from the one in AEAD). We\n// idealize them separately, and there's a specific part here that's about the\n// protected bits of the header.\nnoeq type pne_plain_pkg =\n | PNEPlainPkg:\n pne_plain: (j:id -> l:pne_plain_length -> t:eqtype) ->\n as_bytes: (j:id -> l:pne_plain_length -> pne_plain j l -> GTot (lbytes l & length_bits l)) ->\n repr: (j:unsafe_id -> l:pne_plain_length -> n:pne_plain j l ->\n Tot (b:(lbytes l & length_bits l) {b == as_bytes j l n})) ->\n mk: (j:id -> l:pne_plain_length -> n:lbytes l -> b:length_bits l -> p:pne_plain j l { as_bytes j l p == (n, b) }) ->\n xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad ->\n (l': pne_plain_length & pne_plain j l')) ->\n lemma_xor: (j:id -> l:pne_plain_length -> p:pne_plain j l -> cp:pne_cipherpad -> Lemma\n (requires True)\n (ensures (\n let (| l', p' |) = xor j l p cp in\n let _, bits = as_bytes j l' p' in\n let l: pne_plain_length = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n let l': pne_plain_length = l' in\n l == l'\n ))) ->\n pne_plain_pkg\n\nnoeq type info' = {\n calg: alg;\n halg: I.ha;\n plain: pne_plain_pkg;\n}\n\nlet info (j:id) =\n info:info'{\n I.pne_id_ginfo j == info.calg /\\\n I.pne_id_ghash j == info.halg\n }\n\nlet pne_plain (#j:id) (u:info j) (l:pne_plain_length) =\n PNEPlainPkg?.pne_plain u.plain j l\n\nnoeq\ntype entry (#j:id) (u:info j) =\n | Entry :\n s:sample ->\n #l:pne_plain_length ->\n n:pne_plain u l ->\n // We do not perform truncation at encryption-time, but rather at decryption-time\n c:pne_cipherpad ->\n entry u\n\nval pne_state : (#j:id) -> (u:info j) -> Type u#1\n\nval table : (#j:safe_id) -> (#u:info j) -> (st:pne_state u) -> (h:mem) -> GTot (Seq.seq (entry u))\n\n// Header protection key\nlet key_len (#j:id) (u:info j) = Spec.Agile.Cipher.key_length u.calg\nval key: #j:unsafe_id -> #u:info j -> st:pne_state u -> lbytes (key_len u)\n\nval footprint : #j:id -> #u:info j -> st:pne_state u -> GTot B.loc\n\nval invariant: #j:id -> #u:info j -> st:pne_state u -> mem -> Type0\n\nval frame_invariant: #j:id -> #u:info j -> st:pne_state u -> l:B.loc -> h0:mem -> h1:mem -> Lemma\n (requires (\n invariant st h0 /\\\n B.modifies l h0 h1 /\\\n B.loc_disjoint l (footprint st)))\n (ensures (\n invariant st h1))\n\nval frame_table: #j:safe_id -> #u:info j -> st:pne_state u ->\n r:B.loc -> h0:mem -> h1:mem ->\n Lemma\n (requires\n invariant st h0 /\\\n B.modifies r h0 h1 /\\\n r `B.loc_disjoint` (footprint st))\n (ensures table st h1 == table st h0)\n\n// Equality for the pair of (pne, protected_bits) we manipulate in this module.\nlet pne_bits_eq #l (x y: pne_cipher l) =\n fst x `lbytes_eq` fst y && snd x = snd y\n\n// Finding the entry for a given sample.\nlet sample_filter (#j:id) (u:info j) (s:sample) (e:entry u) : bool =\n Entry?.s e = s\n\nlet entry_for_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :\n GTot (option (entry u)) =\n Seq.find_l (sample_filter u s) (table st h)\n\n/// XXX unused\nlet contains_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :\n GTot bool =\n Some? (entry_for_sample s st h)\n\nlet fresh_sample (#j:safe_id) (#u:info j) (s:sample) (st:pne_state u) (h:mem) :\n GTot bool =\n None? (entry_for_sample s st h)\n\n\n/// Stateful API\n/// ------------\n\nval create (j:id) (u:info j) : ST (pne_state u)\n (requires fun _ -> True)\n (ensures fun h0 st h1 ->\n invariant st h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (footprint st) h0 h1 /\\\n B.(loc_includes (loc_pne_region ()) (footprint st)) /\\\n\n (is_safe j ==> table st h1 == Seq.empty))\n\nlet lemma_max_hash_len ha\n : Lemma (Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (if Some? (Spec.Hash.Definitions.max_input_length ha) then\n Some?.v (Spec.Hash.Definitions.max_input_length ha) >= pow2 61 - 1\n else\n True) /\\\n pow2 61 - 1 > 64)\n [SMTPat (Spec.Hash.Definitions.hash_length ha)]", "dependencies": { "source_file": "Model.PNE.fsti", "checked_file": "Model.PNE.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "ha: a: Spec.Hash.Definitions.hash_alg{Prims.op_Negation (Spec.Hash.Definitions.is_shake a)}\n -> FStar.Pervasives.Lemma\n (ensures\n Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (match Some? (Spec.Hash.Definitions.max_input_length ha) with\n | true -> Some?.v (Spec.Hash.Definitions.max_input_length ha) >= Prims.pow2 61 - 1\n | _ -> Prims.l_True) /\\ Prims.pow2 61 - 1 > 64)\n [SMTPat (Spec.Hash.Definitions.hash_length ha)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Spec.Hash.Definitions.hash_alg", "Prims.b2t", "Prims.op_Negation", "Spec.Hash.Definitions.is_shake", "FStar.Pervasives.assert_norm", "Prims.op_GreaterThan", "Prims.pow2", "Prims.unit", "Prims.op_Subtraction", "Prims.op_LessThan", "Prims.l_True", "Prims.squash", "Prims.l_and", "Prims.op_LessThanOrEqual", "Spec.Hash.Definitions.hash_length", "FStar.Pervasives.Native.uu___is_Some", "Prims.pos", "Spec.Hash.Definitions.max_input_length", "Prims.op_GreaterThanOrEqual", "FStar.Pervasives.Native.__proj__Some__item__v", "Prims.bool", "Prims.logical", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Lib.IntTypes.size_nat", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_max_hash_len (ha: _)\n : Lemma\n (Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (if Some? (Spec.Hash.Definitions.max_input_length ha)\n then Some?.v (Spec.Hash.Definitions.max_input_length ha) >= pow2 61 - 1\n else True) /\\ pow2 61 - 1 > 64) [SMTPat (Spec.Hash.Definitions.hash_length ha)]\nlet lemma_max_hash_len ha\n : Lemma\n (Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (if Some? (Spec.Hash.Definitions.max_input_length ha)\n then Some?.v (Spec.Hash.Definitions.max_input_length ha) >= pow2 61 - 1\n else True) /\\ pow2 61 - 1 > 64) [SMTPat (Spec.Hash.Definitions.hash_length ha)] =", "completed_definiton": "assert_norm (pow2 61 < pow2 125);\nassert_norm (pow2 61 - 1 > 64);\nassert_norm (pow2 64 > pow2 61);\nassert_norm (pow2 128 > pow2 64)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fsti", "name": "QUIC.Spec.Header.Public.parse_header_prop", "original_source_type": "val parse_header_prop (short_dcid_len: short_dcid_len_t) (m: header) : GTot Type0", "source_type": "val parse_header_prop (short_dcid_len: short_dcid_len_t) (m: header) : GTot Type0", "source_definition": "let parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (m: header)\n: GTot Type0\n= short_dcid_len_prop short_dcid_len m", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 69, "start_col": 2, "end_line": 69, "end_col": 38 }, "file_context": "module QUIC.Spec.Header.Public\ninclude QUIC.Spec.Base\n\nmodule LP = LowParse.Spec.Base\nmodule U32 = FStar.UInt32\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U8 = FStar.UInt8\nmodule LPB = LowParse.BitFields\nmodule FB = FStar.Bytes\nmodule Cast = FStar.Int.Cast\n\nnoeq\ntype long_header_specifics =\n| PInitial:\n (token: vlbytes 0 token_max_len) -> // arbitrary bound\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PZeroRTT:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PHandshake:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PRetry:\n (odcid: vlbytes 0 20) -> // TODO: change bounds to drop instead of rejecting as invalid\n long_header_specifics\n\nnoeq\ntype header =\n| PLong:\n (protected_bits: bitfield 4) ->\n (version: U32.t) ->\n (dcid: vlbytes 0 20) ->\n (scid: vlbytes 0 20) ->\n (spec: long_header_specifics) ->\n header\n| PShort:\n (protected_bits: bitfield 5) ->\n (spin: bool) ->\n (dcid: vlbytes 0 20) ->\n header\n\nlet is_retry\n (h: header)\n: Tot bool\n= if PShort? h\n then false\n else\n let spec = PLong?.spec h in\n PRetry? spec\n\nlet dcid_len (h: header) : Tot nat =\n match h with\n | PLong _ _ dcid _ _ -> FB.length dcid\n | PShort _ _ dcid -> FB.length dcid\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: GTot Type0\n= (PShort? h ==> dcid_len h == U32.v short_dcid_len)\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (m: header)", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fsti", "checked_file": "QUIC.Spec.Header.Public.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "short_dcid_len: QUIC.Spec.Base.short_dcid_len_t -> m: QUIC.Spec.Header.Public.header\n -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.Header.Public.header", "QUIC.Spec.Header.Public.short_dcid_len_prop" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_header_prop (short_dcid_len: short_dcid_len_t) (m: header) : GTot Type0\nlet parse_header_prop (short_dcid_len: short_dcid_len_t) (m: header) : GTot Type0 =", "completed_definiton": "short_dcid_len_prop short_dcid_len m", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fsti", "name": "QUIC.Spec.Header.Public.short_dcid_len_prop", "original_source_type": "val short_dcid_len_prop (short_dcid_len: short_dcid_len_t) (h: header) : GTot Type0", "source_type": "val short_dcid_len_prop (short_dcid_len: short_dcid_len_t) (h: header) : GTot Type0", "source_definition": "let short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: GTot Type0\n= (PShort? h ==> dcid_len h == U32.v short_dcid_len)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 62, "start_col": 2, "end_line": 62, "end_col": 52 }, "file_context": "module QUIC.Spec.Header.Public\ninclude QUIC.Spec.Base\n\nmodule LP = LowParse.Spec.Base\nmodule U32 = FStar.UInt32\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U8 = FStar.UInt8\nmodule LPB = LowParse.BitFields\nmodule FB = FStar.Bytes\nmodule Cast = FStar.Int.Cast\n\nnoeq\ntype long_header_specifics =\n| PInitial:\n (token: vlbytes 0 token_max_len) -> // arbitrary bound\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PZeroRTT:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PHandshake:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PRetry:\n (odcid: vlbytes 0 20) -> // TODO: change bounds to drop instead of rejecting as invalid\n long_header_specifics\n\nnoeq\ntype header =\n| PLong:\n (protected_bits: bitfield 4) ->\n (version: U32.t) ->\n (dcid: vlbytes 0 20) ->\n (scid: vlbytes 0 20) ->\n (spec: long_header_specifics) ->\n header\n| PShort:\n (protected_bits: bitfield 5) ->\n (spin: bool) ->\n (dcid: vlbytes 0 20) ->\n header\n\nlet is_retry\n (h: header)\n: Tot bool\n= if PShort? h\n then false\n else\n let spec = PLong?.spec h in\n PRetry? spec\n\nlet dcid_len (h: header) : Tot nat =\n match h with\n | PLong _ _ dcid _ _ -> FB.length dcid\n | PShort _ _ dcid -> FB.length dcid\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fsti", "checked_file": "QUIC.Spec.Header.Public.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "short_dcid_len: QUIC.Spec.Base.short_dcid_len_t -> h: QUIC.Spec.Header.Public.header\n -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.Header.Public.header", "Prims.l_imp", "Prims.b2t", "QUIC.Spec.Header.Public.uu___is_PShort", "Prims.eq2", "Prims.int", "Prims.l_or", "Prims.op_GreaterThanOrEqual", "FStar.UInt.size", "FStar.UInt32.n", "QUIC.Spec.Header.Public.dcid_len", "FStar.UInt32.v" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val short_dcid_len_prop (short_dcid_len: short_dcid_len_t) (h: header) : GTot Type0\nlet short_dcid_len_prop (short_dcid_len: short_dcid_len_t) (h: header) : GTot Type0 =", "completed_definiton": "(PShort? h ==> dcid_len h == U32.v short_dcid_len)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fsti", "name": "QUIC.Spec.Header.Public.dcid_len", "original_source_type": "val dcid_len (h: header) : Tot nat", "source_type": "val dcid_len (h: header) : Tot nat", "source_definition": "let dcid_len (h: header) : Tot nat =\n match h with\n | PLong _ _ dcid _ _ -> FB.length dcid\n | PShort _ _ dcid -> FB.length dcid", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 54, "start_col": 2, "end_line": 56, "end_col": 37 }, "file_context": "module QUIC.Spec.Header.Public\ninclude QUIC.Spec.Base\n\nmodule LP = LowParse.Spec.Base\nmodule U32 = FStar.UInt32\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U8 = FStar.UInt8\nmodule LPB = LowParse.BitFields\nmodule FB = FStar.Bytes\nmodule Cast = FStar.Int.Cast\n\nnoeq\ntype long_header_specifics =\n| PInitial:\n (token: vlbytes 0 token_max_len) -> // arbitrary bound\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PZeroRTT:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PHandshake:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PRetry:\n (odcid: vlbytes 0 20) -> // TODO: change bounds to drop instead of rejecting as invalid\n long_header_specifics\n\nnoeq\ntype header =\n| PLong:\n (protected_bits: bitfield 4) ->\n (version: U32.t) ->\n (dcid: vlbytes 0 20) ->\n (scid: vlbytes 0 20) ->\n (spec: long_header_specifics) ->\n header\n| PShort:\n (protected_bits: bitfield 5) ->\n (spin: bool) ->\n (dcid: vlbytes 0 20) ->\n header\n\nlet is_retry\n (h: header)\n: Tot bool\n= if PShort? h\n then false\n else\n let spec = PLong?.spec h in\n PRetry? spec", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fsti", "checked_file": "QUIC.Spec.Header.Public.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Public.header -> Prims.nat", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Public.header", "QUIC.Spec.Base.bitfield", "FStar.UInt32.t", "QUIC.Spec.Base.vlbytes", "QUIC.Spec.Header.Public.long_header_specifics", "FStar.Bytes.length", "Prims.bool", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val dcid_len (h: header) : Tot nat\nlet dcid_len (h: header) : Tot nat =", "completed_definiton": "match h with\n| PLong _ _ dcid _ _ -> FB.length dcid\n| PShort _ _ dcid -> FB.length dcid", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fsti", "name": "QUIC.Spec.Header.Public.get_protected_bits", "original_source_type": "val get_protected_bits (h: header) : Tot (bitfield (if PShort? h then 5 else 4))", "source_type": "val get_protected_bits (h: header) : Tot (bitfield (if PShort? h then 5 else 4))", "source_definition": "let get_protected_bits\n (h: header)\n: Tot (bitfield (if PShort? h then 5 else 4))\n= match h with\n | PShort pb spin dcid -> pb\n | PLong pb version dcid scid spec -> pb", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 133, "start_col": 2, "end_line": 135, "end_col": 41 }, "file_context": "module QUIC.Spec.Header.Public\ninclude QUIC.Spec.Base\n\nmodule LP = LowParse.Spec.Base\nmodule U32 = FStar.UInt32\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U8 = FStar.UInt8\nmodule LPB = LowParse.BitFields\nmodule FB = FStar.Bytes\nmodule Cast = FStar.Int.Cast\n\nnoeq\ntype long_header_specifics =\n| PInitial:\n (token: vlbytes 0 token_max_len) -> // arbitrary bound\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PZeroRTT:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PHandshake:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PRetry:\n (odcid: vlbytes 0 20) -> // TODO: change bounds to drop instead of rejecting as invalid\n long_header_specifics\n\nnoeq\ntype header =\n| PLong:\n (protected_bits: bitfield 4) ->\n (version: U32.t) ->\n (dcid: vlbytes 0 20) ->\n (scid: vlbytes 0 20) ->\n (spec: long_header_specifics) ->\n header\n| PShort:\n (protected_bits: bitfield 5) ->\n (spin: bool) ->\n (dcid: vlbytes 0 20) ->\n header\n\nlet is_retry\n (h: header)\n: Tot bool\n= if PShort? h\n then false\n else\n let spec = PLong?.spec h in\n PRetry? spec\n\nlet dcid_len (h: header) : Tot nat =\n match h with\n | PLong _ _ dcid _ _ -> FB.length dcid\n | PShort _ _ dcid -> FB.length dcid\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: GTot Type0\n= (PShort? h ==> dcid_len h == U32.v short_dcid_len)\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (m: header)\n: GTot Type0\n= short_dcid_len_prop short_dcid_len m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n= (m: header { parse_header_prop short_dcid_len m })\n\ninline_for_extraction\nnoextract\nval parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 4 < header_len_bound\n end\n })\n\nval parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n\nval serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))\n\nval serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h\n ))\n\nval serialize_header_is_short\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma (\n let s = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length s > 0 /\\\n (PShort? h <==> LPB.get_bitfield (U8.v (Seq.index s 0)) 7 8 == 0)\n )\n\nval serialize_header_is_retry\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma (\n let s = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length s > 0 /\\ (\n is_retry h <==> (\n LPB.get_bitfield (U8.v (Seq.index s 0)) 7 8 == 1 /\\\n LPB.get_bitfield (U8.v (Seq.index s 0)) 4 6 == 3\n )))\n\n\n(* Mutating the protected bits *)\n\nlet get_protected_bits\n (h: header)", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fsti", "checked_file": "QUIC.Spec.Header.Public.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Public.header\n -> QUIC.Spec.Base.bitfield (match PShort? h with\n | true -> 5\n | _ -> 4)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Public.header", "QUIC.Spec.Base.bitfield", "Prims.bool", "QUIC.Spec.Base.vlbytes", "FStar.UInt32.t", "QUIC.Spec.Header.Public.long_header_specifics", "QUIC.Spec.Header.Public.uu___is_PShort", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val get_protected_bits (h: header) : Tot (bitfield (if PShort? h then 5 else 4))\nlet get_protected_bits (h: header) : Tot (bitfield (if PShort? h then 5 else 4)) =", "completed_definiton": "match h with\n| PShort pb spin dcid -> pb\n| PLong pb version dcid scid spec -> pb", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fsti", "name": "QUIC.Spec.Header.Public.is_retry", "original_source_type": "val is_retry (h: header) : Tot bool", "source_type": "val is_retry (h: header) : Tot bool", "source_definition": "let is_retry\n (h: header)\n: Tot bool\n= if PShort? h\n then false\n else\n let spec = PLong?.spec h in\n PRetry? spec", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 47, "start_col": 2, "end_line": 51, "end_col": 16 }, "file_context": "module QUIC.Spec.Header.Public\ninclude QUIC.Spec.Base\n\nmodule LP = LowParse.Spec.Base\nmodule U32 = FStar.UInt32\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U8 = FStar.UInt8\nmodule LPB = LowParse.BitFields\nmodule FB = FStar.Bytes\nmodule Cast = FStar.Int.Cast\n\nnoeq\ntype long_header_specifics =\n| PInitial:\n (token: vlbytes 0 token_max_len) -> // arbitrary bound\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PZeroRTT:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PHandshake:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PRetry:\n (odcid: vlbytes 0 20) -> // TODO: change bounds to drop instead of rejecting as invalid\n long_header_specifics\n\nnoeq\ntype header =\n| PLong:\n (protected_bits: bitfield 4) ->\n (version: U32.t) ->\n (dcid: vlbytes 0 20) ->\n (scid: vlbytes 0 20) ->\n (spec: long_header_specifics) ->\n header\n| PShort:\n (protected_bits: bitfield 5) ->\n (spin: bool) ->\n (dcid: vlbytes 0 20) ->\n header\n\nlet is_retry\n (h: header)", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fsti", "checked_file": "QUIC.Spec.Header.Public.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Public.header -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Public.header", "QUIC.Spec.Header.Public.uu___is_PShort", "Prims.bool", "QUIC.Spec.Header.Public.uu___is_PRetry", "QUIC.Spec.Header.Public.long_header_specifics", "QUIC.Spec.Header.Public.__proj__PLong__item__spec" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val is_retry (h: header) : Tot bool\nlet is_retry (h: header) : Tot bool =", "completed_definiton": "if PShort? h\nthen false\nelse\n let spec = PLong?.spec h in\n PRetry? spec", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fsti", "name": "QUIC.Spec.Header.Public.set_protected_bits", "original_source_type": "val set_protected_bits (h: header) (new_pb: bitfield (if PShort? h then 5 else 4)) : Tot header", "source_type": "val set_protected_bits (h: header) (new_pb: bitfield (if PShort? h then 5 else 4)) : Tot header", "source_definition": "let set_protected_bits\n (h: header)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Tot header\n= match h with\n | PShort _ spin dcid -> PShort new_pb spin dcid\n | PLong _ version dcid scid spec -> PLong new_pb version dcid scid spec", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 141, "start_col": 2, "end_line": 143, "end_col": 73 }, "file_context": "module QUIC.Spec.Header.Public\ninclude QUIC.Spec.Base\n\nmodule LP = LowParse.Spec.Base\nmodule U32 = FStar.UInt32\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U8 = FStar.UInt8\nmodule LPB = LowParse.BitFields\nmodule FB = FStar.Bytes\nmodule Cast = FStar.Int.Cast\n\nnoeq\ntype long_header_specifics =\n| PInitial:\n (token: vlbytes 0 token_max_len) -> // arbitrary bound\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PZeroRTT:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PHandshake:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PRetry:\n (odcid: vlbytes 0 20) -> // TODO: change bounds to drop instead of rejecting as invalid\n long_header_specifics\n\nnoeq\ntype header =\n| PLong:\n (protected_bits: bitfield 4) ->\n (version: U32.t) ->\n (dcid: vlbytes 0 20) ->\n (scid: vlbytes 0 20) ->\n (spec: long_header_specifics) ->\n header\n| PShort:\n (protected_bits: bitfield 5) ->\n (spin: bool) ->\n (dcid: vlbytes 0 20) ->\n header\n\nlet is_retry\n (h: header)\n: Tot bool\n= if PShort? h\n then false\n else\n let spec = PLong?.spec h in\n PRetry? spec\n\nlet dcid_len (h: header) : Tot nat =\n match h with\n | PLong _ _ dcid _ _ -> FB.length dcid\n | PShort _ _ dcid -> FB.length dcid\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: GTot Type0\n= (PShort? h ==> dcid_len h == U32.v short_dcid_len)\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (m: header)\n: GTot Type0\n= short_dcid_len_prop short_dcid_len m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n= (m: header { parse_header_prop short_dcid_len m })\n\ninline_for_extraction\nnoextract\nval parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 4 < header_len_bound\n end\n })\n\nval parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n\nval serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))\n\nval serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h\n ))\n\nval serialize_header_is_short\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma (\n let s = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length s > 0 /\\\n (PShort? h <==> LPB.get_bitfield (U8.v (Seq.index s 0)) 7 8 == 0)\n )\n\nval serialize_header_is_retry\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma (\n let s = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length s > 0 /\\ (\n is_retry h <==> (\n LPB.get_bitfield (U8.v (Seq.index s 0)) 7 8 == 1 /\\\n LPB.get_bitfield (U8.v (Seq.index s 0)) 4 6 == 3\n )))\n\n\n(* Mutating the protected bits *)\n\nlet get_protected_bits\n (h: header)\n: Tot (bitfield (if PShort? h then 5 else 4))\n= match h with\n | PShort pb spin dcid -> pb\n | PLong pb version dcid scid spec -> pb\n\nlet set_protected_bits\n (h: header)\n (new_pb: bitfield (if PShort? h then 5 else 4))", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fsti", "checked_file": "QUIC.Spec.Header.Public.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n h: QUIC.Spec.Header.Public.header ->\n new_pb:\n QUIC.Spec.Base.bitfield (match PShort? h with\n | true -> 5\n | _ -> 4)\n -> QUIC.Spec.Header.Public.header", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Public.header", "QUIC.Spec.Base.bitfield", "QUIC.Spec.Header.Public.uu___is_PShort", "Prims.bool", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "QUIC.Spec.Base.vlbytes", "QUIC.Spec.Header.Public.PShort", "FStar.UInt32.t", "QUIC.Spec.Header.Public.long_header_specifics", "QUIC.Spec.Header.Public.PLong" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val set_protected_bits (h: header) (new_pb: bitfield (if PShort? h then 5 else 4)) : Tot header\nlet set_protected_bits (h: header) (new_pb: bitfield (if PShort? h then 5 else 4)) : Tot header =", "completed_definiton": "match h with\n| PShort _ spin dcid -> PShort new_pb spin dcid\n| PLong _ version dcid scid spec -> PLong new_pb version dcid scid spec", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fsti", "name": "QUIC.Spec.Header.Public.header_len'", "original_source_type": "val header_len' (h: header) : GTot (n: pos{n <= header_len_bound})", "source_type": "val header_len' (h: header) : GTot (n: pos{n <= header_len_bound})", "source_definition": "let header_len'\n (h: header)\n: GTot (n: pos { n <= header_len_bound })\n= match h with\n | PShort _ _ dcid ->\n 1 + FB.length dcid\n | PLong pb version dcid scid spec ->\n 7 + FB.length dcid + FB.length scid +\n begin match spec with\n | PInitial token payload_and_pn_length ->\n varint_len (Cast.uint32_to_uint64 (FB.len token)) + FB.length token + varint_len payload_and_pn_length\n | PZeroRTT payload_and_pn_length ->\n varint_len payload_and_pn_length\n | PHandshake payload_and_pn_length ->\n varint_len payload_and_pn_length\n | PRetry odcid ->\n 1 + FB.length odcid\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 168, "start_col": 2, "end_line": 182, "end_col": 7 }, "file_context": "module QUIC.Spec.Header.Public\ninclude QUIC.Spec.Base\n\nmodule LP = LowParse.Spec.Base\nmodule U32 = FStar.UInt32\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U8 = FStar.UInt8\nmodule LPB = LowParse.BitFields\nmodule FB = FStar.Bytes\nmodule Cast = FStar.Int.Cast\n\nnoeq\ntype long_header_specifics =\n| PInitial:\n (token: vlbytes 0 token_max_len) -> // arbitrary bound\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PZeroRTT:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PHandshake:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PRetry:\n (odcid: vlbytes 0 20) -> // TODO: change bounds to drop instead of rejecting as invalid\n long_header_specifics\n\nnoeq\ntype header =\n| PLong:\n (protected_bits: bitfield 4) ->\n (version: U32.t) ->\n (dcid: vlbytes 0 20) ->\n (scid: vlbytes 0 20) ->\n (spec: long_header_specifics) ->\n header\n| PShort:\n (protected_bits: bitfield 5) ->\n (spin: bool) ->\n (dcid: vlbytes 0 20) ->\n header\n\nlet is_retry\n (h: header)\n: Tot bool\n= if PShort? h\n then false\n else\n let spec = PLong?.spec h in\n PRetry? spec\n\nlet dcid_len (h: header) : Tot nat =\n match h with\n | PLong _ _ dcid _ _ -> FB.length dcid\n | PShort _ _ dcid -> FB.length dcid\n\nlet short_dcid_len_prop\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n: GTot Type0\n= (PShort? h ==> dcid_len h == U32.v short_dcid_len)\n\nunfold\nlet parse_header_prop\n (short_dcid_len: short_dcid_len_t)\n (m: header)\n: GTot Type0\n= short_dcid_len_prop short_dcid_len m\n\ninline_for_extraction\ntype header'\n (short_dcid_len: short_dcid_len_t)\n= (m: header { parse_header_prop short_dcid_len m })\n\ninline_for_extraction\nnoextract\nval parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 4 < header_len_bound\n end\n })\n\nval parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n\nval serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))\n\nval serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h\n ))\n\nval serialize_header_is_short\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma (\n let s = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length s > 0 /\\\n (PShort? h <==> LPB.get_bitfield (U8.v (Seq.index s 0)) 7 8 == 0)\n )\n\nval serialize_header_is_retry\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma (\n let s = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length s > 0 /\\ (\n is_retry h <==> (\n LPB.get_bitfield (U8.v (Seq.index s 0)) 7 8 == 1 /\\\n LPB.get_bitfield (U8.v (Seq.index s 0)) 4 6 == 3\n )))\n\n\n(* Mutating the protected bits *)\n\nlet get_protected_bits\n (h: header)\n: Tot (bitfield (if PShort? h then 5 else 4))\n= match h with\n | PShort pb spin dcid -> pb\n | PLong pb version dcid scid spec -> pb\n\nlet set_protected_bits\n (h: header)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Tot header\n= match h with\n | PShort _ spin dcid -> PShort new_pb spin dcid\n | PLong _ version dcid scid spec -> PLong new_pb version dcid scid spec\n\nval serialize_get_protected_bits\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (let sq = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length sq > 0 /\\\n get_protected_bits h == LPB.uint8.LPB.get_bitfield (Seq.head sq) 0 (if PShort? h then 5 else 4))\n\nval serialize_set_protected_bits\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (let sq = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length sq > 0 /\\\n LP.serialize (serialize_header short_dcid_len) (set_protected_bits h new_pb) `Seq.equal`\n (LPB.uint8.LPB.set_bitfield (Seq.head sq) 0 (if PShort? h then 5 else 4) new_pb `Seq.cons` Seq.tail sq))\n\n(* Explicit length computation is needed for the switch. *)\n\nlet header_len'\n (h: header)", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fsti", "checked_file": "QUIC.Spec.Header.Public.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "LowParse.Spec.Base.fsti.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Public.header -> Prims.GTot (n: Prims.pos{n <= QUIC.Spec.Base.header_len_bound})", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Public.header", "QUIC.Spec.Base.bitfield", "Prims.bool", "QUIC.Spec.Base.vlbytes", "Prims.op_Addition", "FStar.Bytes.length", "FStar.UInt32.t", "QUIC.Spec.Header.Public.long_header_specifics", "QUIC.Spec.Base.token_max_len", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Base.varint_len", "FStar.Int.Cast.uint32_to_uint64", "FStar.Bytes.len", "Prims.int", "Prims.pos", "Prims.b2t", "Prims.op_LessThanOrEqual", "QUIC.Spec.Base.header_len_bound" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_len' (h: header) : GTot (n: pos{n <= header_len_bound})\nlet header_len' (h: header) : GTot (n: pos{n <= header_len_bound}) =", "completed_definiton": "match h with\n| PShort _ _ dcid -> 1 + FB.length dcid\n| PLong pb version dcid scid spec ->\n 7 + FB.length dcid + FB.length scid +\n (match spec with\n | PInitial token payload_and_pn_length ->\n varint_len (Cast.uint32_to_uint64 (FB.len token)) + FB.length token +\n varint_len payload_and_pn_length\n | PZeroRTT payload_and_pn_length -> varint_len payload_and_pn_length\n | PHandshake payload_and_pn_length -> varint_len payload_and_pn_length\n | PRetry odcid -> 1 + FB.length odcid)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Seq.fsti", "name": "QUIC.Secret.Seq.seq_hide_inj", "original_source_type": "val seq_hide_inj (#t: Secret.inttype{Secret.unsigned t}) (x1 x2: seq (Secret.uint_t t Secret.PUB))\n : Lemma (requires ((seq_hide x1) `equal` (seq_hide x2))) (ensures (x1 `equal` x2))", "source_type": "val seq_hide_inj (#t: Secret.inttype{Secret.unsigned t}) (x1 x2: seq (Secret.uint_t t Secret.PUB))\n : Lemma (requires ((seq_hide x1) `equal` (seq_hide x2))) (ensures (x1 `equal` x2))", "source_definition": "let seq_hide_inj\n (#t: Secret.inttype { Secret.unsigned t })\n (x1 x2: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (requires (seq_hide x1 `equal` seq_hide x2))\n (ensures (x1 `equal` x2))\n= seq_reveal_hide #t x1; seq_reveal_hide #t x2", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Seq.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 121, "start_col": 2, "end_line": 121, "end_col": 46 }, "file_context": "module QUIC.Secret.Seq\ninclude FStar.Seq\n\nmodule Secret = QUIC.Secret.Int\nmodule U8 = FStar.UInt8\nmodule Ghost = FStar.Ghost\n\nnoextract\nval seq_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Tot (seq (Secret.uint_t t Secret.SEC))\n\nval seq_hide_length\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (length (seq_hide x) == length x)\n [SMTPat (length (seq_hide x))]\n\nval seq_hide_index\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n Secret.v (index (seq_hide x) i) == Secret.v (index x i)\n ))\n\nlet seq_hide_index'\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n index (seq_hide x) i == Secret.hide #t (index x i)\n ))\n [SMTPat (index (seq_hide x) i)]\n= seq_hide_index x i\n\nval seq_reveal\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n: GTot (seq (Secret.uint_t t Secret.PUB))\n\nval seq_reveal_length\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n: Lemma\n (length (seq_reveal x) == length x)\n [SMTPat (length (seq_reveal x))]\n\nval seq_reveal_index\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n Secret.v (index (seq_reveal x) i) == Secret.v (index x i)\n ))\n\nlet seq_reveal_index'\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n index (seq_reveal x) i == Secret.reveal (index x i)\n ))\n [SMTPat (index (seq_reveal x) i)]\n= seq_reveal_index x i\n\nlet seq_reveal_pub\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (seq_reveal x `equal` x)\n= ()\n\nlet seq_reveal_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (seq_reveal (seq_hide x) `equal` x)\n [SMTPat (seq_reveal (seq_hide x))]\n= ()\n\nlet seq_hide_reveal\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.SEC))\n: Lemma\n (seq_hide (seq_reveal x) `equal` x)\n [SMTPat (seq_hide (seq_reveal x))]\n= ()\n\nlet seq_reveal_inj\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x1 x2: seq (Secret.uint_t t sec))\n: Lemma\n (requires (seq_reveal x1 `equal` seq_reveal x2))\n (ensures (x1 `equal` x2))\n= match sec with\n | Secret.PUB -> seq_reveal_pub #t x1; seq_reveal_pub #t x2\n | Secret.SEC -> seq_hide_reveal #t x1; seq_hide_reveal #t x2\n\nlet seq_hide_inj\n (#t: Secret.inttype { Secret.unsigned t })\n (x1 x2: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (requires (seq_hide x1 `equal` seq_hide x2))", "dependencies": { "source_file": "QUIC.Secret.Seq.fsti", "checked_file": "QUIC.Secret.Seq.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x1: FStar.Seq.Base.seq (Lib.IntTypes.uint_t t Lib.IntTypes.PUB) ->\n x2: FStar.Seq.Base.seq (Lib.IntTypes.uint_t t Lib.IntTypes.PUB)\n -> FStar.Pervasives.Lemma\n (requires FStar.Seq.Base.equal (QUIC.Secret.Seq.seq_hide x1) (QUIC.Secret.Seq.seq_hide x2))\n (ensures FStar.Seq.Base.equal x1 x2)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "Lib.IntTypes.unsigned", "FStar.Seq.Base.seq", "Lib.IntTypes.uint_t", "Lib.IntTypes.PUB", "QUIC.Secret.Seq.seq_reveal_hide", "Prims.unit", "FStar.Seq.Base.equal", "Lib.IntTypes.SEC", "QUIC.Secret.Seq.seq_hide", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val seq_hide_inj (#t: Secret.inttype{Secret.unsigned t}) (x1 x2: seq (Secret.uint_t t Secret.PUB))\n : Lemma (requires ((seq_hide x1) `equal` (seq_hide x2))) (ensures (x1 `equal` x2))\nlet seq_hide_inj (#t: Secret.inttype{Secret.unsigned t}) (x1 x2: seq (Secret.uint_t t Secret.PUB))\n : Lemma (requires ((seq_hide x1) `equal` (seq_hide x2))) (ensures (x1 `equal` x2)) =", "completed_definiton": "seq_reveal_hide #t x1;\nseq_reveal_hide #t x2", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Seq.fsti", "name": "QUIC.Secret.Seq.seq_reveal_inj", "original_source_type": "val seq_reveal_inj\n (#t: Secret.inttype{Secret.unsigned t})\n (#sec: Secret.secrecy_level)\n (x1 x2: seq (Secret.uint_t t sec))\n : Lemma (requires ((seq_reveal x1) `equal` (seq_reveal x2))) (ensures (x1 `equal` x2))", "source_type": "val seq_reveal_inj\n (#t: Secret.inttype{Secret.unsigned t})\n (#sec: Secret.secrecy_level)\n (x1 x2: seq (Secret.uint_t t sec))\n : Lemma (requires ((seq_reveal x1) `equal` (seq_reveal x2))) (ensures (x1 `equal` x2))", "source_definition": "let seq_reveal_inj\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x1 x2: seq (Secret.uint_t t sec))\n: Lemma\n (requires (seq_reveal x1 `equal` seq_reveal x2))\n (ensures (x1 `equal` x2))\n= match sec with\n | Secret.PUB -> seq_reveal_pub #t x1; seq_reveal_pub #t x2\n | Secret.SEC -> seq_hide_reveal #t x1; seq_hide_reveal #t x2", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Seq.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 111, "start_col": 2, "end_line": 113, "end_col": 62 }, "file_context": "module QUIC.Secret.Seq\ninclude FStar.Seq\n\nmodule Secret = QUIC.Secret.Int\nmodule U8 = FStar.UInt8\nmodule Ghost = FStar.Ghost\n\nnoextract\nval seq_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Tot (seq (Secret.uint_t t Secret.SEC))\n\nval seq_hide_length\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (length (seq_hide x) == length x)\n [SMTPat (length (seq_hide x))]\n\nval seq_hide_index\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n Secret.v (index (seq_hide x) i) == Secret.v (index x i)\n ))\n\nlet seq_hide_index'\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n index (seq_hide x) i == Secret.hide #t (index x i)\n ))\n [SMTPat (index (seq_hide x) i)]\n= seq_hide_index x i\n\nval seq_reveal\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n: GTot (seq (Secret.uint_t t Secret.PUB))\n\nval seq_reveal_length\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n: Lemma\n (length (seq_reveal x) == length x)\n [SMTPat (length (seq_reveal x))]\n\nval seq_reveal_index\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n Secret.v (index (seq_reveal x) i) == Secret.v (index x i)\n ))\n\nlet seq_reveal_index'\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n index (seq_reveal x) i == Secret.reveal (index x i)\n ))\n [SMTPat (index (seq_reveal x) i)]\n= seq_reveal_index x i\n\nlet seq_reveal_pub\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (seq_reveal x `equal` x)\n= ()\n\nlet seq_reveal_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (seq_reveal (seq_hide x) `equal` x)\n [SMTPat (seq_reveal (seq_hide x))]\n= ()\n\nlet seq_hide_reveal\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.SEC))\n: Lemma\n (seq_hide (seq_reveal x) `equal` x)\n [SMTPat (seq_hide (seq_reveal x))]\n= ()\n\nlet seq_reveal_inj\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x1 x2: seq (Secret.uint_t t sec))\n: Lemma\n (requires (seq_reveal x1 `equal` seq_reveal x2))", "dependencies": { "source_file": "QUIC.Secret.Seq.fsti", "checked_file": "QUIC.Secret.Seq.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x1: FStar.Seq.Base.seq (Lib.IntTypes.uint_t t sec) ->\n x2: FStar.Seq.Base.seq (Lib.IntTypes.uint_t t sec)\n -> FStar.Pervasives.Lemma\n (requires FStar.Seq.Base.equal (QUIC.Secret.Seq.seq_reveal x1) (QUIC.Secret.Seq.seq_reveal x2)\n ) (ensures FStar.Seq.Base.equal x1 x2)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "Lib.IntTypes.unsigned", "Lib.IntTypes.secrecy_level", "FStar.Seq.Base.seq", "Lib.IntTypes.uint_t", "QUIC.Secret.Seq.seq_reveal_pub", "Prims.unit", "QUIC.Secret.Seq.seq_hide_reveal", "FStar.Seq.Base.equal", "Lib.IntTypes.PUB", "QUIC.Secret.Seq.seq_reveal", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val seq_reveal_inj\n (#t: Secret.inttype{Secret.unsigned t})\n (#sec: Secret.secrecy_level)\n (x1 x2: seq (Secret.uint_t t sec))\n : Lemma (requires ((seq_reveal x1) `equal` (seq_reveal x2))) (ensures (x1 `equal` x2))\nlet seq_reveal_inj\n (#t: Secret.inttype{Secret.unsigned t})\n (#sec: Secret.secrecy_level)\n (x1 x2: seq (Secret.uint_t t sec))\n : Lemma (requires ((seq_reveal x1) `equal` (seq_reveal x2))) (ensures (x1 `equal` x2)) =", "completed_definiton": "match sec with\n| Secret.PUB ->\n seq_reveal_pub #t x1;\n seq_reveal_pub #t x2\n| Secret.SEC ->\n seq_hide_reveal #t x1;\n seq_hide_reveal #t x2", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Seq.fsti", "name": "QUIC.Secret.Seq.seq_hide_index'", "original_source_type": "val seq_hide_index'\n (#t: Secret.inttype{Secret.unsigned t})\n (x: seq (Secret.uint_t t Secret.PUB))\n (i: nat)\n : Lemma (requires (i < length x))\n (ensures (index (seq_hide x) i == Secret.hide #t (index x i)))\n [SMTPat (index (seq_hide x) i)]", "source_type": "val seq_hide_index'\n (#t: Secret.inttype{Secret.unsigned t})\n (x: seq (Secret.uint_t t Secret.PUB))\n (i: nat)\n : Lemma (requires (i < length x))\n (ensures (index (seq_hide x) i == Secret.hide #t (index x i)))\n [SMTPat (index (seq_hide x) i)]", "source_definition": "let seq_hide_index'\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n index (seq_hide x) i == Secret.hide #t (index x i)\n ))\n [SMTPat (index (seq_hide x) i)]\n= seq_hide_index x i", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Seq.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 41, "start_col": 2, "end_line": 41, "end_col": 20 }, "file_context": "module QUIC.Secret.Seq\ninclude FStar.Seq\n\nmodule Secret = QUIC.Secret.Int\nmodule U8 = FStar.UInt8\nmodule Ghost = FStar.Ghost\n\nnoextract\nval seq_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Tot (seq (Secret.uint_t t Secret.SEC))\n\nval seq_hide_length\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (length (seq_hide x) == length x)\n [SMTPat (length (seq_hide x))]\n\nval seq_hide_index\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n Secret.v (index (seq_hide x) i) == Secret.v (index x i)\n ))\n\nlet seq_hide_index'\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n index (seq_hide x) i == Secret.hide #t (index x i)\n ))", "dependencies": { "source_file": "QUIC.Secret.Seq.fsti", "checked_file": "QUIC.Secret.Seq.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: FStar.Seq.Base.seq (Lib.IntTypes.uint_t t Lib.IntTypes.PUB) -> i: Prims.nat\n -> FStar.Pervasives.Lemma (requires i < FStar.Seq.Base.length x)\n (ensures\n FStar.Seq.Base.index (QUIC.Secret.Seq.seq_hide x) i ==\n QUIC.Secret.Int.hide (FStar.Seq.Base.index x i))\n [SMTPat (FStar.Seq.Base.index (QUIC.Secret.Seq.seq_hide x) i)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "Lib.IntTypes.unsigned", "FStar.Seq.Base.seq", "Lib.IntTypes.uint_t", "Lib.IntTypes.PUB", "Prims.nat", "QUIC.Secret.Seq.seq_hide_index", "Prims.unit", "Prims.op_LessThan", "FStar.Seq.Base.length", "Prims.squash", "Prims.eq2", "Lib.IntTypes.SEC", "FStar.Seq.Base.index", "QUIC.Secret.Seq.seq_hide", "QUIC.Secret.Int.hide", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val seq_hide_index'\n (#t: Secret.inttype{Secret.unsigned t})\n (x: seq (Secret.uint_t t Secret.PUB))\n (i: nat)\n : Lemma (requires (i < length x))\n (ensures (index (seq_hide x) i == Secret.hide #t (index x i)))\n [SMTPat (index (seq_hide x) i)]\nlet seq_hide_index'\n (#t: Secret.inttype{Secret.unsigned t})\n (x: seq (Secret.uint_t t Secret.PUB))\n (i: nat)\n : Lemma (requires (i < length x))\n (ensures (index (seq_hide x) i == Secret.hide #t (index x i)))\n [SMTPat (index (seq_hide x) i)] =", "completed_definiton": "seq_hide_index x i", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Seq.fsti", "name": "QUIC.Secret.Seq.seq_reveal_index'", "original_source_type": "val seq_reveal_index'\n (#t: Secret.inttype{Secret.unsigned t})\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (i: nat)\n : Lemma (requires (i < length x))\n (ensures (index (seq_reveal x) i == Secret.reveal (index x i)))\n [SMTPat (index (seq_reveal x) i)]", "source_type": "val seq_reveal_index'\n (#t: Secret.inttype{Secret.unsigned t})\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (i: nat)\n : Lemma (requires (i < length x))\n (ensures (index (seq_reveal x) i == Secret.reveal (index x i)))\n [SMTPat (index (seq_reveal x) i)]", "source_definition": "let seq_reveal_index'\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n index (seq_reveal x) i == Secret.reveal (index x i)\n ))\n [SMTPat (index (seq_reveal x) i)]\n= seq_reveal_index x i", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Seq.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 79, "start_col": 2, "end_line": 79, "end_col": 22 }, "file_context": "module QUIC.Secret.Seq\ninclude FStar.Seq\n\nmodule Secret = QUIC.Secret.Int\nmodule U8 = FStar.UInt8\nmodule Ghost = FStar.Ghost\n\nnoextract\nval seq_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Tot (seq (Secret.uint_t t Secret.SEC))\n\nval seq_hide_length\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (length (seq_hide x) == length x)\n [SMTPat (length (seq_hide x))]\n\nval seq_hide_index\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n Secret.v (index (seq_hide x) i) == Secret.v (index x i)\n ))\n\nlet seq_hide_index'\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n index (seq_hide x) i == Secret.hide #t (index x i)\n ))\n [SMTPat (index (seq_hide x) i)]\n= seq_hide_index x i\n\nval seq_reveal\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n: GTot (seq (Secret.uint_t t Secret.PUB))\n\nval seq_reveal_length\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n: Lemma\n (length (seq_reveal x) == length x)\n [SMTPat (length (seq_reveal x))]\n\nval seq_reveal_index\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n Secret.v (index (seq_reveal x) i) == Secret.v (index x i)\n ))\n\nlet seq_reveal_index'\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n index (seq_reveal x) i == Secret.reveal (index x i)\n ))", "dependencies": { "source_file": "QUIC.Secret.Seq.fsti", "checked_file": "QUIC.Secret.Seq.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: FStar.Seq.Base.seq (Lib.IntTypes.uint_t t sec) -> i: Prims.nat\n -> FStar.Pervasives.Lemma (requires i < FStar.Seq.Base.length x)\n (ensures\n FStar.Seq.Base.index (QUIC.Secret.Seq.seq_reveal x) i ==\n QUIC.Secret.Int.reveal (FStar.Seq.Base.index x i))\n [SMTPat (FStar.Seq.Base.index (QUIC.Secret.Seq.seq_reveal x) i)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "Lib.IntTypes.unsigned", "Lib.IntTypes.secrecy_level", "FStar.Seq.Base.seq", "Lib.IntTypes.uint_t", "Prims.nat", "QUIC.Secret.Seq.seq_reveal_index", "Prims.unit", "Prims.op_LessThan", "FStar.Seq.Base.length", "Prims.squash", "Prims.eq2", "Lib.IntTypes.PUB", "FStar.Seq.Base.index", "QUIC.Secret.Seq.seq_reveal", "QUIC.Secret.Int.reveal", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val seq_reveal_index'\n (#t: Secret.inttype{Secret.unsigned t})\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (i: nat)\n : Lemma (requires (i < length x))\n (ensures (index (seq_reveal x) i == Secret.reveal (index x i)))\n [SMTPat (index (seq_reveal x) i)]\nlet seq_reveal_index'\n (#t: Secret.inttype{Secret.unsigned t})\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (i: nat)\n : Lemma (requires (i < length x))\n (ensures (index (seq_reveal x) i == Secret.reveal (index x i)))\n [SMTPat (index (seq_reveal x) i)] =", "completed_definiton": "seq_reveal_index x i", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Seq.fsti", "name": "QUIC.Secret.Seq.cons_seq_hide", "original_source_type": "val cons_seq_hide\n (#t: Secret.inttype{Secret.unsigned t})\n (a: Secret.uint_t t Secret.PUB)\n (x: seq (Secret.uint_t t Secret.PUB))\n : Lemma (cons (Secret.hide a) (seq_hide x) == seq_hide (cons a x))", "source_type": "val cons_seq_hide\n (#t: Secret.inttype{Secret.unsigned t})\n (a: Secret.uint_t t Secret.PUB)\n (x: seq (Secret.uint_t t Secret.PUB))\n : Lemma (cons (Secret.hide a) (seq_hide x) == seq_hide (cons a x))", "source_definition": "let cons_seq_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (a: Secret.uint_t t Secret.PUB)\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (cons (Secret.hide a) (seq_hide x) == seq_hide (cons a x))\n= assert (cons (Secret.hide a) (seq_hide x) `equal` seq_hide (cons a x))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Seq.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 152, "start_col": 2, "end_line": 152, "end_col": 72 }, "file_context": "module QUIC.Secret.Seq\ninclude FStar.Seq\n\nmodule Secret = QUIC.Secret.Int\nmodule U8 = FStar.UInt8\nmodule Ghost = FStar.Ghost\n\nnoextract\nval seq_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Tot (seq (Secret.uint_t t Secret.SEC))\n\nval seq_hide_length\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (length (seq_hide x) == length x)\n [SMTPat (length (seq_hide x))]\n\nval seq_hide_index\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n Secret.v (index (seq_hide x) i) == Secret.v (index x i)\n ))\n\nlet seq_hide_index'\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n index (seq_hide x) i == Secret.hide #t (index x i)\n ))\n [SMTPat (index (seq_hide x) i)]\n= seq_hide_index x i\n\nval seq_reveal\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n: GTot (seq (Secret.uint_t t Secret.PUB))\n\nval seq_reveal_length\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n: Lemma\n (length (seq_reveal x) == length x)\n [SMTPat (length (seq_reveal x))]\n\nval seq_reveal_index\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n Secret.v (index (seq_reveal x) i) == Secret.v (index x i)\n ))\n\nlet seq_reveal_index'\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n index (seq_reveal x) i == Secret.reveal (index x i)\n ))\n [SMTPat (index (seq_reveal x) i)]\n= seq_reveal_index x i\n\nlet seq_reveal_pub\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (seq_reveal x `equal` x)\n= ()\n\nlet seq_reveal_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (seq_reveal (seq_hide x) `equal` x)\n [SMTPat (seq_reveal (seq_hide x))]\n= ()\n\nlet seq_hide_reveal\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.SEC))\n: Lemma\n (seq_hide (seq_reveal x) `equal` x)\n [SMTPat (seq_hide (seq_reveal x))]\n= ()\n\nlet seq_reveal_inj\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x1 x2: seq (Secret.uint_t t sec))\n: Lemma\n (requires (seq_reveal x1 `equal` seq_reveal x2))\n (ensures (x1 `equal` x2))\n= match sec with\n | Secret.PUB -> seq_reveal_pub #t x1; seq_reveal_pub #t x2\n | Secret.SEC -> seq_hide_reveal #t x1; seq_hide_reveal #t x2\n\nlet seq_hide_inj\n (#t: Secret.inttype { Secret.unsigned t })\n (x1 x2: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (requires (seq_hide x1 `equal` seq_hide x2))\n (ensures (x1 `equal` x2))\n= seq_reveal_hide #t x1; seq_reveal_hide #t x2\n\n(* Properties *)\n\nlet slice_seq_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n (from: nat)\n (to: nat { from <= to /\\ to <= length x })\n: Lemma\n (slice (seq_hide x) from to == seq_hide (slice x from to))\n [SMTPat (slice (seq_hide x) from to)]\n= assert (slice (seq_hide x) from to `equal` seq_hide (slice x from to))\n\nlet reveal_seq_slice\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (from: nat)\n (to: nat { from <= to /\\ to <= length x })\n: Lemma\n (slice (seq_reveal x) from to == seq_reveal (slice x from to))\n [SMTPat (slice (seq_reveal x) from to)]\n= assert (slice (seq_reveal x) from to `equal` seq_reveal (slice x from to))\n\nlet cons_seq_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (a: Secret.uint_t t Secret.PUB)\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma", "dependencies": { "source_file": "QUIC.Secret.Seq.fsti", "checked_file": "QUIC.Secret.Seq.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: Lib.IntTypes.uint_t t Lib.IntTypes.PUB ->\n x: FStar.Seq.Base.seq (Lib.IntTypes.uint_t t Lib.IntTypes.PUB)\n -> FStar.Pervasives.Lemma\n (ensures\n FStar.Seq.Properties.cons (QUIC.Secret.Int.hide a) (QUIC.Secret.Seq.seq_hide x) ==\n QUIC.Secret.Seq.seq_hide (FStar.Seq.Properties.cons a x))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "Lib.IntTypes.unsigned", "Lib.IntTypes.uint_t", "Lib.IntTypes.PUB", "FStar.Seq.Base.seq", "Prims._assert", "FStar.Seq.Base.equal", "Lib.IntTypes.SEC", "FStar.Seq.Properties.cons", "QUIC.Secret.Int.hide", "QUIC.Secret.Seq.seq_hide", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val cons_seq_hide\n (#t: Secret.inttype{Secret.unsigned t})\n (a: Secret.uint_t t Secret.PUB)\n (x: seq (Secret.uint_t t Secret.PUB))\n : Lemma (cons (Secret.hide a) (seq_hide x) == seq_hide (cons a x))\nlet cons_seq_hide\n (#t: Secret.inttype{Secret.unsigned t})\n (a: Secret.uint_t t Secret.PUB)\n (x: seq (Secret.uint_t t Secret.PUB))\n : Lemma (cons (Secret.hide a) (seq_hide x) == seq_hide (cons a x)) =", "completed_definiton": "assert ((cons (Secret.hide a) (seq_hide x)) `equal` (seq_hide (cons a x)))", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Seq.fsti", "name": "QUIC.Secret.Seq.slice_seq_hide", "original_source_type": "val slice_seq_hide\n (#t: Secret.inttype{Secret.unsigned t})\n (x: seq (Secret.uint_t t Secret.PUB))\n (from: nat)\n (to: nat{from <= to /\\ to <= length x})\n : Lemma (slice (seq_hide x) from to == seq_hide (slice x from to))\n [SMTPat (slice (seq_hide x) from to)]", "source_type": "val slice_seq_hide\n (#t: Secret.inttype{Secret.unsigned t})\n (x: seq (Secret.uint_t t Secret.PUB))\n (from: nat)\n (to: nat{from <= to /\\ to <= length x})\n : Lemma (slice (seq_hide x) from to == seq_hide (slice x from to))\n [SMTPat (slice (seq_hide x) from to)]", "source_definition": "let slice_seq_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n (from: nat)\n (to: nat { from <= to /\\ to <= length x })\n: Lemma\n (slice (seq_hide x) from to == seq_hide (slice x from to))\n [SMTPat (slice (seq_hide x) from to)]\n= assert (slice (seq_hide x) from to `equal` seq_hide (slice x from to))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Seq.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 133, "start_col": 2, "end_line": 133, "end_col": 72 }, "file_context": "module QUIC.Secret.Seq\ninclude FStar.Seq\n\nmodule Secret = QUIC.Secret.Int\nmodule U8 = FStar.UInt8\nmodule Ghost = FStar.Ghost\n\nnoextract\nval seq_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Tot (seq (Secret.uint_t t Secret.SEC))\n\nval seq_hide_length\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (length (seq_hide x) == length x)\n [SMTPat (length (seq_hide x))]\n\nval seq_hide_index\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n Secret.v (index (seq_hide x) i) == Secret.v (index x i)\n ))\n\nlet seq_hide_index'\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n index (seq_hide x) i == Secret.hide #t (index x i)\n ))\n [SMTPat (index (seq_hide x) i)]\n= seq_hide_index x i\n\nval seq_reveal\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n: GTot (seq (Secret.uint_t t Secret.PUB))\n\nval seq_reveal_length\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n: Lemma\n (length (seq_reveal x) == length x)\n [SMTPat (length (seq_reveal x))]\n\nval seq_reveal_index\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n Secret.v (index (seq_reveal x) i) == Secret.v (index x i)\n ))\n\nlet seq_reveal_index'\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n index (seq_reveal x) i == Secret.reveal (index x i)\n ))\n [SMTPat (index (seq_reveal x) i)]\n= seq_reveal_index x i\n\nlet seq_reveal_pub\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (seq_reveal x `equal` x)\n= ()\n\nlet seq_reveal_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (seq_reveal (seq_hide x) `equal` x)\n [SMTPat (seq_reveal (seq_hide x))]\n= ()\n\nlet seq_hide_reveal\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.SEC))\n: Lemma\n (seq_hide (seq_reveal x) `equal` x)\n [SMTPat (seq_hide (seq_reveal x))]\n= ()\n\nlet seq_reveal_inj\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x1 x2: seq (Secret.uint_t t sec))\n: Lemma\n (requires (seq_reveal x1 `equal` seq_reveal x2))\n (ensures (x1 `equal` x2))\n= match sec with\n | Secret.PUB -> seq_reveal_pub #t x1; seq_reveal_pub #t x2\n | Secret.SEC -> seq_hide_reveal #t x1; seq_hide_reveal #t x2\n\nlet seq_hide_inj\n (#t: Secret.inttype { Secret.unsigned t })\n (x1 x2: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (requires (seq_hide x1 `equal` seq_hide x2))\n (ensures (x1 `equal` x2))\n= seq_reveal_hide #t x1; seq_reveal_hide #t x2\n\n(* Properties *)\n\nlet slice_seq_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n (from: nat)\n (to: nat { from <= to /\\ to <= length x })\n: Lemma\n (slice (seq_hide x) from to == seq_hide (slice x from to))", "dependencies": { "source_file": "QUIC.Secret.Seq.fsti", "checked_file": "QUIC.Secret.Seq.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x: FStar.Seq.Base.seq (Lib.IntTypes.uint_t t Lib.IntTypes.PUB) ->\n from: Prims.nat ->\n to: Prims.nat{from <= to /\\ to <= FStar.Seq.Base.length x}\n -> FStar.Pervasives.Lemma\n (ensures\n FStar.Seq.Base.slice (QUIC.Secret.Seq.seq_hide x) from to ==\n QUIC.Secret.Seq.seq_hide (FStar.Seq.Base.slice x from to))\n [SMTPat (FStar.Seq.Base.slice (QUIC.Secret.Seq.seq_hide x) from to)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "Lib.IntTypes.unsigned", "FStar.Seq.Base.seq", "Lib.IntTypes.uint_t", "Lib.IntTypes.PUB", "Prims.nat", "Prims.l_and", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "Prims._assert", "FStar.Seq.Base.equal", "Lib.IntTypes.SEC", "FStar.Seq.Base.slice", "QUIC.Secret.Seq.seq_hide", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val slice_seq_hide\n (#t: Secret.inttype{Secret.unsigned t})\n (x: seq (Secret.uint_t t Secret.PUB))\n (from: nat)\n (to: nat{from <= to /\\ to <= length x})\n : Lemma (slice (seq_hide x) from to == seq_hide (slice x from to))\n [SMTPat (slice (seq_hide x) from to)]\nlet slice_seq_hide\n (#t: Secret.inttype{Secret.unsigned t})\n (x: seq (Secret.uint_t t Secret.PUB))\n (from: nat)\n (to: nat{from <= to /\\ to <= length x})\n : Lemma (slice (seq_hide x) from to == seq_hide (slice x from to))\n [SMTPat (slice (seq_hide x) from to)] =", "completed_definiton": "assert ((slice (seq_hide x) from to) `equal` (seq_hide (slice x from to)))", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Seq.fsti", "name": "QUIC.Secret.Seq.cons_seq_reveal", "original_source_type": "val cons_seq_reveal\n (#t: Secret.inttype{Secret.unsigned t})\n (#sec: Secret.secrecy_level)\n (a: Secret.uint_t t sec)\n (x: seq (Secret.uint_t t sec))\n : Lemma (cons (Secret.reveal a) (seq_reveal x) == seq_reveal (cons a x))", "source_type": "val cons_seq_reveal\n (#t: Secret.inttype{Secret.unsigned t})\n (#sec: Secret.secrecy_level)\n (a: Secret.uint_t t sec)\n (x: seq (Secret.uint_t t sec))\n : Lemma (cons (Secret.reveal a) (seq_reveal x) == seq_reveal (cons a x))", "source_definition": "let cons_seq_reveal\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (a: Secret.uint_t t sec)\n (x: seq (Secret.uint_t t sec))\n: Lemma\n (cons (Secret.reveal a) (seq_reveal x) == seq_reveal (cons a x))\n= assert (cons (Secret.reveal a) (seq_reveal x) `equal` seq_reveal (cons a x))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Seq.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 161, "start_col": 2, "end_line": 161, "end_col": 78 }, "file_context": "module QUIC.Secret.Seq\ninclude FStar.Seq\n\nmodule Secret = QUIC.Secret.Int\nmodule U8 = FStar.UInt8\nmodule Ghost = FStar.Ghost\n\nnoextract\nval seq_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Tot (seq (Secret.uint_t t Secret.SEC))\n\nval seq_hide_length\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (length (seq_hide x) == length x)\n [SMTPat (length (seq_hide x))]\n\nval seq_hide_index\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n Secret.v (index (seq_hide x) i) == Secret.v (index x i)\n ))\n\nlet seq_hide_index'\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n index (seq_hide x) i == Secret.hide #t (index x i)\n ))\n [SMTPat (index (seq_hide x) i)]\n= seq_hide_index x i\n\nval seq_reveal\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n: GTot (seq (Secret.uint_t t Secret.PUB))\n\nval seq_reveal_length\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n: Lemma\n (length (seq_reveal x) == length x)\n [SMTPat (length (seq_reveal x))]\n\nval seq_reveal_index\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n Secret.v (index (seq_reveal x) i) == Secret.v (index x i)\n ))\n\nlet seq_reveal_index'\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n index (seq_reveal x) i == Secret.reveal (index x i)\n ))\n [SMTPat (index (seq_reveal x) i)]\n= seq_reveal_index x i\n\nlet seq_reveal_pub\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (seq_reveal x `equal` x)\n= ()\n\nlet seq_reveal_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (seq_reveal (seq_hide x) `equal` x)\n [SMTPat (seq_reveal (seq_hide x))]\n= ()\n\nlet seq_hide_reveal\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.SEC))\n: Lemma\n (seq_hide (seq_reveal x) `equal` x)\n [SMTPat (seq_hide (seq_reveal x))]\n= ()\n\nlet seq_reveal_inj\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x1 x2: seq (Secret.uint_t t sec))\n: Lemma\n (requires (seq_reveal x1 `equal` seq_reveal x2))\n (ensures (x1 `equal` x2))\n= match sec with\n | Secret.PUB -> seq_reveal_pub #t x1; seq_reveal_pub #t x2\n | Secret.SEC -> seq_hide_reveal #t x1; seq_hide_reveal #t x2\n\nlet seq_hide_inj\n (#t: Secret.inttype { Secret.unsigned t })\n (x1 x2: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (requires (seq_hide x1 `equal` seq_hide x2))\n (ensures (x1 `equal` x2))\n= seq_reveal_hide #t x1; seq_reveal_hide #t x2\n\n(* Properties *)\n\nlet slice_seq_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n (from: nat)\n (to: nat { from <= to /\\ to <= length x })\n: Lemma\n (slice (seq_hide x) from to == seq_hide (slice x from to))\n [SMTPat (slice (seq_hide x) from to)]\n= assert (slice (seq_hide x) from to `equal` seq_hide (slice x from to))\n\nlet reveal_seq_slice\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (from: nat)\n (to: nat { from <= to /\\ to <= length x })\n: Lemma\n (slice (seq_reveal x) from to == seq_reveal (slice x from to))\n [SMTPat (slice (seq_reveal x) from to)]\n= assert (slice (seq_reveal x) from to `equal` seq_reveal (slice x from to))\n\nlet cons_seq_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (a: Secret.uint_t t Secret.PUB)\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (cons (Secret.hide a) (seq_hide x) == seq_hide (cons a x))\n= assert (cons (Secret.hide a) (seq_hide x) `equal` seq_hide (cons a x))\n\nlet cons_seq_reveal\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (a: Secret.uint_t t sec)\n (x: seq (Secret.uint_t t sec))\n: Lemma", "dependencies": { "source_file": "QUIC.Secret.Seq.fsti", "checked_file": "QUIC.Secret.Seq.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Lib.IntTypes.uint_t t sec -> x: FStar.Seq.Base.seq (Lib.IntTypes.uint_t t sec)\n -> FStar.Pervasives.Lemma\n (ensures\n FStar.Seq.Properties.cons (QUIC.Secret.Int.reveal a) (QUIC.Secret.Seq.seq_reveal x) ==\n QUIC.Secret.Seq.seq_reveal (FStar.Seq.Properties.cons a x))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "Lib.IntTypes.unsigned", "Lib.IntTypes.secrecy_level", "Lib.IntTypes.uint_t", "FStar.Seq.Base.seq", "Prims._assert", "FStar.Seq.Base.equal", "Lib.IntTypes.PUB", "FStar.Seq.Properties.cons", "QUIC.Secret.Int.reveal", "QUIC.Secret.Seq.seq_reveal", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val cons_seq_reveal\n (#t: Secret.inttype{Secret.unsigned t})\n (#sec: Secret.secrecy_level)\n (a: Secret.uint_t t sec)\n (x: seq (Secret.uint_t t sec))\n : Lemma (cons (Secret.reveal a) (seq_reveal x) == seq_reveal (cons a x))\nlet cons_seq_reveal\n (#t: Secret.inttype{Secret.unsigned t})\n (#sec: Secret.secrecy_level)\n (a: Secret.uint_t t sec)\n (x: seq (Secret.uint_t t sec))\n : Lemma (cons (Secret.reveal a) (seq_reveal x) == seq_reveal (cons a x)) =", "completed_definiton": "assert ((cons (Secret.reveal a) (seq_reveal x)) `equal` (seq_reveal (cons a x)))", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Seq.fsti", "name": "QUIC.Secret.Seq.reveal_seq_slice", "original_source_type": "val reveal_seq_slice\n (#t: Secret.inttype{Secret.unsigned t})\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (from: nat)\n (to: nat{from <= to /\\ to <= length x})\n : Lemma (slice (seq_reveal x) from to == seq_reveal (slice x from to))\n [SMTPat (slice (seq_reveal x) from to)]", "source_type": "val reveal_seq_slice\n (#t: Secret.inttype{Secret.unsigned t})\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (from: nat)\n (to: nat{from <= to /\\ to <= length x})\n : Lemma (slice (seq_reveal x) from to == seq_reveal (slice x from to))\n [SMTPat (slice (seq_reveal x) from to)]", "source_definition": "let reveal_seq_slice\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (from: nat)\n (to: nat { from <= to /\\ to <= length x })\n: Lemma\n (slice (seq_reveal x) from to == seq_reveal (slice x from to))\n [SMTPat (slice (seq_reveal x) from to)]\n= assert (slice (seq_reveal x) from to `equal` seq_reveal (slice x from to))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Seq.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 144, "start_col": 2, "end_line": 144, "end_col": 76 }, "file_context": "module QUIC.Secret.Seq\ninclude FStar.Seq\n\nmodule Secret = QUIC.Secret.Int\nmodule U8 = FStar.UInt8\nmodule Ghost = FStar.Ghost\n\nnoextract\nval seq_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Tot (seq (Secret.uint_t t Secret.SEC))\n\nval seq_hide_length\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (length (seq_hide x) == length x)\n [SMTPat (length (seq_hide x))]\n\nval seq_hide_index\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n Secret.v (index (seq_hide x) i) == Secret.v (index x i)\n ))\n\nlet seq_hide_index'\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n index (seq_hide x) i == Secret.hide #t (index x i)\n ))\n [SMTPat (index (seq_hide x) i)]\n= seq_hide_index x i\n\nval seq_reveal\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n: GTot (seq (Secret.uint_t t Secret.PUB))\n\nval seq_reveal_length\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n: Lemma\n (length (seq_reveal x) == length x)\n [SMTPat (length (seq_reveal x))]\n\nval seq_reveal_index\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n Secret.v (index (seq_reveal x) i) == Secret.v (index x i)\n ))\n\nlet seq_reveal_index'\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (i: nat)\n: Lemma\n (requires (i < length x))\n (ensures (\n index (seq_reveal x) i == Secret.reveal (index x i)\n ))\n [SMTPat (index (seq_reveal x) i)]\n= seq_reveal_index x i\n\nlet seq_reveal_pub\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (seq_reveal x `equal` x)\n= ()\n\nlet seq_reveal_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (seq_reveal (seq_hide x) `equal` x)\n [SMTPat (seq_reveal (seq_hide x))]\n= ()\n\nlet seq_hide_reveal\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.SEC))\n: Lemma\n (seq_hide (seq_reveal x) `equal` x)\n [SMTPat (seq_hide (seq_reveal x))]\n= ()\n\nlet seq_reveal_inj\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x1 x2: seq (Secret.uint_t t sec))\n: Lemma\n (requires (seq_reveal x1 `equal` seq_reveal x2))\n (ensures (x1 `equal` x2))\n= match sec with\n | Secret.PUB -> seq_reveal_pub #t x1; seq_reveal_pub #t x2\n | Secret.SEC -> seq_hide_reveal #t x1; seq_hide_reveal #t x2\n\nlet seq_hide_inj\n (#t: Secret.inttype { Secret.unsigned t })\n (x1 x2: seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (requires (seq_hide x1 `equal` seq_hide x2))\n (ensures (x1 `equal` x2))\n= seq_reveal_hide #t x1; seq_reveal_hide #t x2\n\n(* Properties *)\n\nlet slice_seq_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n (from: nat)\n (to: nat { from <= to /\\ to <= length x })\n: Lemma\n (slice (seq_hide x) from to == seq_hide (slice x from to))\n [SMTPat (slice (seq_hide x) from to)]\n= assert (slice (seq_hide x) from to `equal` seq_hide (slice x from to))\n\nlet reveal_seq_slice\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (from: nat)\n (to: nat { from <= to /\\ to <= length x })\n: Lemma\n (slice (seq_reveal x) from to == seq_reveal (slice x from to))", "dependencies": { "source_file": "QUIC.Secret.Seq.fsti", "checked_file": "QUIC.Secret.Seq.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x: FStar.Seq.Base.seq (Lib.IntTypes.uint_t t sec) ->\n from: Prims.nat ->\n to: Prims.nat{from <= to /\\ to <= FStar.Seq.Base.length x}\n -> FStar.Pervasives.Lemma\n (ensures\n FStar.Seq.Base.slice (QUIC.Secret.Seq.seq_reveal x) from to ==\n QUIC.Secret.Seq.seq_reveal (FStar.Seq.Base.slice x from to))\n [SMTPat (FStar.Seq.Base.slice (QUIC.Secret.Seq.seq_reveal x) from to)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "Lib.IntTypes.unsigned", "Lib.IntTypes.secrecy_level", "FStar.Seq.Base.seq", "Lib.IntTypes.uint_t", "Prims.nat", "Prims.l_and", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "Prims._assert", "FStar.Seq.Base.equal", "Lib.IntTypes.PUB", "FStar.Seq.Base.slice", "QUIC.Secret.Seq.seq_reveal", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val reveal_seq_slice\n (#t: Secret.inttype{Secret.unsigned t})\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (from: nat)\n (to: nat{from <= to /\\ to <= length x})\n : Lemma (slice (seq_reveal x) from to == seq_reveal (slice x from to))\n [SMTPat (slice (seq_reveal x) from to)]\nlet reveal_seq_slice\n (#t: Secret.inttype{Secret.unsigned t})\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n (from: nat)\n (to: nat{from <= to /\\ to <= length x})\n : Lemma (slice (seq_reveal x) from to == seq_reveal (slice x from to))\n [SMTPat (slice (seq_reveal x) from to)] =", "completed_definiton": "assert ((slice (seq_reveal x) from to) `equal` (seq_reveal (slice x from to)))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.pn_sizemask_ct", "original_source_type": "val pn_sizemask_ct (pn_len: nat{pn_len < 4}) : Tot (lbytes 4)", "source_type": "val pn_sizemask_ct (pn_len: nat{pn_len < 4}) : Tot (lbytes 4)", "source_definition": "let pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 118, "start_col": 2, "end_line": 120, "end_col": 77 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "pn_len: Prims.nat{pn_len < 4} -> QUIC.Spec.Base.lbytes 4", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "FStar.Endianness.n_to_be", "Prims.op_Subtraction", "Prims.pow2", "Prims.op_Multiply", "Prims.unit", "FStar.Math.Lemmas.pow2_lt_compat", "QUIC.Spec.Base.lbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val pn_sizemask_ct (pn_len: nat{pn_len < 4}) : Tot (lbytes 4)\nlet pn_sizemask_ct (pn_len: nat{pn_len < 4}) : Tot (lbytes 4) =", "completed_definiton": "let open FStar.Endianness in\nFStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\nFStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.block_len", "original_source_type": "val block_len (a: SCipher.cipher_alg) : x: U32.t{U32.v x = SCipher.block_length a}", "source_type": "val block_len (a: SCipher.cipher_alg) : x: U32.t{U32.v x = SCipher.block_length a}", "source_definition": "let block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 41, "start_col": 2, "end_line": 42, "end_col": 45 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Spec.Agile.Cipher.cipher_alg\n -> x: FStar.UInt32.t{FStar.UInt32.v x = Spec.Agile.Cipher.block_length a}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Spec.Agile.Cipher.cipher_alg", "FStar.UInt32.__uint_to_t", "FStar.UInt32.t", "Prims.b2t", "Prims.op_Equality", "Prims.int", "FStar.UInt32.v", "Spec.Agile.Cipher.block_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val block_len (a: SCipher.cipher_alg) : x: U32.t{U32.v x = SCipher.block_length a}\nlet block_len (a: SCipher.cipher_alg) : x: U32.t{U32.v x = SCipher.block_length a} =", "completed_definiton": "let open SCipher in\nmatch a with\n| CHACHA20 -> 64ul\n| _ -> 16ul", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.header_decrypt_aux_pre", "original_source_type": "val header_decrypt_aux_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n : GTot Type0", "source_type": "val header_decrypt_aux_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n : GTot Type0", "source_definition": "let header_decrypt_aux_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n: GTot Type0\n=\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length dst == U32.v dst_len", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 823, "start_col": 1, "end_line": 830, "end_col": 33 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)\n\nlet pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma\n (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\n= let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n pow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\n Lemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i\n\nlet header_encrypt_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: GTot packet\n= \n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256\"\n\nlet header_encrypt_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: Lemma\n (header_encrypt_ct a hpk h c `Seq.equal` Spec.header_encrypt a hpk h c)\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then ()\n else begin\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Parse.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header { ~ (Spec.is_retry h) })\n (r: Seq.seq Secret.uint8 {\n Seq.length r >= Parse.pn_offset h + 20\n })\n: GTot (Seq.seq Secret.uint8)\n= \n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = (Seq.slice r (pn_offset + 4) (pn_offset + 20)) in\n let mask = (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide (pn_sizemask_ct pn_len)) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n let r = Lemmas.secret_xor_inplace r pnmask pn_offset in\n let r = Seq.cons f' (Seq.slice r 1 (Seq.length r)) in\n r\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 2\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n: Lemma\n (requires (\n (~ (Spec.is_retry h))\n ))\n (ensures (\n let r = Parse.format_header h `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide r))\n ))\n= header_encrypt_ct_correct a hpk h c;\n let fmt = Parse.format_header h in\n let len = Seq.length fmt in\n let pr = fmt `Seq.append` c in\n assert (Seq.length pr >= Parse.pn_offset h + 20);\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let psample = Seq.slice c (3 - pn_len) (19 - pn_len) in\n assert (c `Seq.equal` Seq.slice pr len (Seq.length pr));\n let pn_off = Parse.pn_offset h in\n assert (pn_off + pn_len + 1 == len);\n assert (c == Seq.slice pr (pn_off + pn_len + 1) (Seq.length pr));\n Seq.slice_slice pr (pn_off + pn_len + 1) (Seq.length pr) (3 - pn_len) (19 - pn_len);\n assert (psample == Seq.slice pr (pn_off + 4) (pn_off + 20));\n let r = Seq.seq_hide #Secret.U8 pr in\n let sample = Seq.slice r (pn_off + 4) (pn_off + 20) in\n assert (sample == Seq.seq_hide #Secret.U8 psample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n assert (mask == Seq.seq_hide pmask);\n let mask15 = Seq.slice mask 1 5 in\n let ppnszmask = pn_sizemask_ct pn_len in\n let pnszmask = Seq.seq_hide ppnszmask in\n let pnmask = Lemmas.secret_and_inplace mask15 pnszmask 0 in\n let pmask15 = Seq.slice pmask 1 5 in\n let ppnmask = Lemmas.and_inplace pmask15 ppnszmask 0 in\n Lemmas.secret_and_inplace_eq mask15 pnszmask 0;\n assert (pnmask == Seq.seq_hide #Secret.U8 ppnmask);\n let f = Seq.index r 0 in\n let pf : Secret.uint_t Secret.U8 Secret.PUB = Seq.index pr 0 in\n assert (f == Secret.hide #Secret.U8 #Secret.PUB pf);\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 (U32.v protected_bits) (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 (U32.v protected_bits))) in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n assert (U8.v pf' == Secret.v f');\n assert (f' == Secret.hide #Secret.U8 pf');\n let pr1 = Lemmas.xor_inplace pr ppnmask pn_off in\n let r1 = Lemmas.secret_xor_inplace r pnmask pn_off in\n Lemmas.secret_xor_inplace_eq r pnmask pn_off;\n assert (r1 == Seq.seq_hide #Secret.U8 pr1);\n let r2 = Seq.cons f' (Seq.slice r1 1 (Seq.length r1)) in\n let pr2 = Seq.cons pf' (Seq.slice pr1 1 (Seq.length pr1)) in\n Seq.cons_seq_hide #Secret.U8 pf' (Seq.slice pr1 1 (Seq.length pr1));\n assert (r2 == Seq.seq_hide #Secret.U8 pr2)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet pn_sizemask_ct_num\n (pn_len: PN.packet_number_length_t)\n: Tot (x: Secret.uint32 { pn_sizemask_ct (Secret.v pn_len - 1) == FStar.Endianness.n_to_be 4 (Secret.v x) })\n=\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` (Secret.v pn_len - 1)));\n [@inline_let]\n let n0 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 24) in\n [@inline_let]\n let n1 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 16) in\n [@inline_let]\n let n2 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 8) in\n [@inline_let]\n let n3 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 0) in\n let pn_len_1 = pn_len `Secret.sub` Secret.to_u32 1ul in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n0)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n1)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n2)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n3))\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet pn_sizemask (dst: B.buffer Secret.uint8) (pn_len: PN.packet_number_length_t): HST.Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\ B.length dst == 4)\n (ensures fun h0 _ h1 ->\n B.as_seq h1 dst `Seq.equal` Seq.seq_hide (pn_sizemask_ct (Secret.v pn_len - 1)) /\\\n B.(modifies (loc_buffer dst) h0 h1))\n= let x = pn_sizemask_ct_num pn_len in\n SecretBuffer.store32_be dst x\n\n#push-options \"--z3rlimit 512 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (h: Ghost.erased Spec.header)\n (is_short: bool)\n (pn_offset: U32.t)\n (pn_len: PN.packet_number_length_t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let fmt = (Parse.format_header h) in\n let hlen = Seq.length fmt in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n (~ (Spec.is_retry h)) /\\\n is_short == (Spec.MShort? h) /\\\n U32.v pn_offset == Parse.pn_offset h /\\\n pn_len == Parse.pn_length h /\\\n hlen + 19 <= B.length dst /\\\n Seq.slice (Seq.seq_reveal #Secret.U8 (B.as_seq m dst)) 0 hlen == fmt\n ))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n header_encrypt_ct_secret_preserving_not_retry_spec a (B.as_seq m k) h (B.as_seq m dst) == B.as_seq m' dst\n ))\n= assert (U32.v pn_offset + 20 <= B.length dst);\n let m0 = HST.get () in\n HST.push_frame ();\n let m01 = HST.get () in\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n B.loc_unused_in_not_unused_in_disjoint m01;\n let m02 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m02;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n let m03 = HST.get () in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (CTR.footprint m03 s == CTR.footprint m0 s);\n assert (B.loc_disjoint (B.loc_buffer mask `B.loc_union` B.loc_buffer pn_sm) (CTR.footprint m0 s `B.loc_union` B.loc_buffer k `B.loc_union` B.loc_buffer dst));\n let sample = B.sub dst (pn_offset `U32.add` 4ul) 16ul in\n let m1 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v pn_offset + 4) (U32.v pn_offset + 20)) in\n assert (B.as_seq m1 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m2 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m2 mask == Ghost.reveal gmask);\n pn_sizemask pn_sm pn_len;\n let m3 = HST.get () in\n assert (B.as_seq m3 mask == Ghost.reveal gmask);\n let gpn_sm = Ghost.hide (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len - 1))) in\n assert (B.as_seq m3 pn_sm == Ghost.reveal gpn_sm);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m4 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) gpn_sm 0) in\n assert (B.as_seq m4 pnmask == Ghost.reveal gpnmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask_0 = B.index mask 0ul in\n assert (mask_0 == Seq.index (B.as_seq m4 (B.gsub mask 0ul 1ul)) 0);\n assert (mask_0 == Seq.index gmask 0);\n let f_ = B.index dst 0ul in\n assert (f_ == Seq.index (B.as_seq m0 dst) 0);\n let f_logxor = f_ `Secret.logxor` mask_0 in\n let f_get_bf = Secret.get_bitfield f_logxor 0ul protected_bits in\n let f' = Secret.set_bitfield f_ 0ul protected_bits f_get_bf in\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n let m5 = HST.get () in\n let gr1 = Ghost.hide (Lemmas.secret_xor_inplace (B.as_seq m0 dst) gpnmask (U32.v pn_offset)) in\n assert (B.as_seq m5 dst == Ghost.reveal gr1);\n B.upd dst 0ul f' ;\n HST.pop_frame ();\n let m6 = HST.get () in\n assert (B.as_seq m6 dst `Seq.equal` (f' `Seq.cons` Seq.slice (Ghost.reveal gr1) 1 (B.length dst)))\n\n#restart-solver\n\nlet header_encrypt\n a s k dst h is_short is_retry public_len pn_len\n= if is_retry\n then ()\n else begin\n let m = HST.get () in\n let hpk = Ghost.hide (B.as_seq m k) in\n let fmt = Ghost.hide (Parse.format_header (G.reveal h)) in\n let cipher = Ghost.hide (Seq.slice (B.as_seq m dst) (Seq.length fmt) (B.length dst)) in\n assert (B.as_seq m dst `Seq.equal` (fmt `Seq.append` cipher));\n header_encrypt_ct_secret_preserving_not_retry_spec_correct a hpk h cipher;\n assert (U32.v public_len + 20 <= B.length dst);\n let post (cont: Seq.lseq Secret.uint8 (B.length dst)) (m1: HS.mem) : GTot Type0 =\n header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst)) == cont /\\\n CTR.invariant m1 s /\\\n CTR.footprint m1 s == CTR.footprint m s\n in\n SecretBuffer.with_whole_buffer_hide_weak_modifies'\n #unit\n dst\n m\n (CTR.footprint m s `B.loc_union` B.loc_buffer k)\n (CTR.footprint m s)\n true\n (fun _ cont m1 ->\n post cont m1\n )\n (fun _ bs ->\n header_encrypt_ct_secret_preserving_not_retry a s k h is_short public_len pn_len bs\n )\n ;\n let m' = HST.get () in\n assert (B.as_seq m' dst == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst))));\n assert (B.as_seq m' dst == Spec.header_encrypt a (B.as_seq m k) h cipher)\n end\n\n#pop-options\n\n\n(* A constant-time specification of header_decrypt_aux which does not test or truncate on pn_len *)\n\nlet header_decrypt_aux_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: GTot (option Spec.header_decrypt_aux_t)\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet;\n Spec.pn_offset = ();\n Spec.pn_len = ();\n })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = pn_len;\n })\n end\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats\"\n\n#restart-solver\n\nlet header_decrypt_aux_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len packet == Spec.header_decrypt_aux a hpk cid_len packet)\n= \n let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then ()\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then ()\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> ()\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then ()\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal #Secret.U8 (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide #Secret.U8 sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n let r = packet' in\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#restart-solver\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })\n : GTot (Spec.header_decrypt_aux_t)\n=\n let f = Seq.index packet 0 in\n let sample_offset = pn_offset + 4 in\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` (Seq.index mask 0)) 0ul protected_bits) in\n let packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len))) 0 in\n let packet'' = Lemmas.secret_xor_inplace packet' pnmask pn_offset in\n {\n Spec.is_short = is_short;\n Spec.is_retry = false;\n Spec.packet = Seq.seq_reveal #Secret.U8 packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = Secret.v pn_len;\n }\n\n#push-options \"--z3rlimit 32\"\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet) == Some (header_decrypt_aux_ct_secret_preserving_not_retry_spec a hpk cid_len packet is_short pn_offset))\n= assert (Some? (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet)));\n let ppacket = Seq.seq_reveal packet in\n let f = Seq.index packet 0 in\n let pf = Seq.index ppacket 0 in\n assert (pf == Secret.reveal f);\n let is_short = (BF.get_bitfield #8 (Secret.v f) 7 8 = 0) in\n let Some pn_offset = Parse.putative_pn_offset cid_len ppacket in\n let sample_offset = pn_offset + 4 in\n let psample = Seq.slice ppacket sample_offset (sample_offset + 16) in\n let sample = Seq.slice packet sample_offset (sample_offset + 16) in\n assert (psample == Seq.seq_reveal sample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n let protected_bits = if is_short then 5 else 4 in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 protected_bits (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 protected_bits)) in\n let f' = Secret.set_bitfield f 0ul (U32.uint_to_t protected_bits) (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul (U32.uint_to_t protected_bits)) in\n assert (pf' == Secret.reveal f');\n let packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\n let ppacket' = Seq.cons pf' (Seq.slice ppacket 1 (Seq.length ppacket)) in\n assert (ppacket' `Seq.equal` Seq.seq_reveal packet');\n let ppn_len = BF.get_bitfield (U8.v pf') 0 2 in\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n assert (Secret.v pn_len == ppn_len);\n let ppnmask_ct = Lemmas.and_inplace (Seq.slice pmask 1 5) (pn_sizemask_ct ppn_len) 0 in\n let pnmask_ct = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct ppn_len)) 0 in\n Lemmas.secret_and_inplace_eq (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct ppn_len)) 0;\n assert (ppnmask_ct == Seq.seq_reveal pnmask_ct);\n Lemmas.secret_xor_inplace_eq packet' pnmask_ct pn_offset\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\ninline_for_extraction\nlet header_decrypt_aux_ct_secret_preserving_not_retry'\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n 0 < l /\\ l < pow2 32 /\\ (\n let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\ (\n match Parse.putative_pn_offset (U32.v cid_len) (Seq.seq_reveal (B.as_seq m dst)) with\n | None -> False\n | Some pn_offset' ->\n U32.v pn_offset == pn_offset' /\\\n pn_offset' + 20 <= l\n ))))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) is_short (U32.v pn_offset)).Spec.packet == Seq.seq_reveal (B.as_seq m' dst)\n ))\n= let m0 = HST.get () in\n let f = B.index dst 0ul in\n let sample_offset = pn_offset `U32.add` 4ul in\n let sample = B.sub dst sample_offset 16ul in\n HST.push_frame ();\n let m1 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m1;\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer dst `B.loc_union` CTR.footprint m0 s));\n let m2 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m2;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (B.loc_disjoint (B.loc_buffer pn_sm) (B.loc_buffer dst `B.loc_union` CTR.footprint m0 s));\n let m3 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v sample_offset) (U32.v sample_offset + 16)) in\n assert (B.as_seq m3 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m4 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m4 mask == Ghost.reveal gmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask0 = B.index mask 0ul in\n let f_logxor = f `Secret.logxor` mask0 in\n let f_bf = Secret.get_bitfield (f_logxor) 0ul protected_bits in\n let f' = Secret.set_bitfield f 0ul protected_bits f_bf in\n B.upd dst 0ul f';\n let m5 = HST.get () in\n let gpacket' = Ghost.hide (Seq.cons f' (Seq.slice (B.as_seq m0 dst) 1 (B.length dst))) in\n assert (Ghost.reveal gpacket' `Seq.equal` B.as_seq m5 dst);\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n pn_sizemask pn_sm (Secret.cast_up Secret.U32 pn_len `Secret.add` Secret.hide 1ul);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m6 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len))) 0) in\n assert (Ghost.reveal gpnmask == B.as_seq m6 pnmask);\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n HST.pop_frame ();\n let m7 = HST.get () in\n assert (B.as_seq m7 dst == Lemmas.secret_xor_inplace gpacket' gpnmask (U32.v pn_offset))\n\n#pop-options\n\n#push-options \"--z3rlimit 32 --query_stats\"\n\n#restart-solver\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer U8.t)\n: HST.Stack unit\n (requires (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n 0 < l /\\ l < pow2 32 /\\ (\n let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\ (\n match Parse.putative_pn_offset (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some pn_offset' ->\n U32.v pn_offset == pn_offset' /\\\n pn_offset' + 20 <= l\n ))))\n (ensures (fun m _ m' ->\n match Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some res ->\n let len_mod = U32.v pn_offset + res.Spec.pn_len + 1 in\n res.Spec.pn_offset == U32.v pn_offset /\\\n len_mod <= B.length dst /\\\n B.modifies (B.loc_buffer (B.gsub dst 0ul (U32.uint_to_t len_mod)) `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n res.Spec.packet == B.as_seq m' dst\n ))\n=\n let m = HST.get () in\n SecretBuffer.with_whole_buffer_hide_weak_modifies\n #unit\n dst\n m\n (CTR.footprint m s `B.loc_union` B.loc_buffer k)\n (CTR.footprint m s)\n true\n (fun _ cont m' ->\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a (B.as_seq m k) (U32.v cid_len) (Seq.seq_hide #Secret.U8 (B.as_seq m dst)) is_short (U32.v pn_offset)).Spec.packet == cont /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s\n )\n (fun _ bs ->\n header_decrypt_aux_ct_secret_preserving_not_retry' a s k cid_len is_short pn_offset bs\n );\n let m' = HST.get () in\n header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct a (B.as_seq m k) (U32.v cid_len) (Seq.seq_hide #Secret.U8 (B.as_seq m dst)) is_short (U32.v pn_offset);\n header_decrypt_aux_ct_correct a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst);\n Spec.header_decrypt_aux_post a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst);\n let len_mod = Ghost.hide (U32.uint_to_t (U32.v pn_offset + (Some?.v (Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst))).Spec.pn_len + 1)) in\n B.modifies_loc_buffer_from_to_intro dst 0ul len_mod (CTR.footprint m s) m m'\n\n#pop-options\n\ntype header_decrypt_aux_result =\n | HD_Failure\n | HD_Success_Retry\n | HD_Success_NotRetry\n\nunfold\nlet header_decrypt_aux_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n s: NotEverCrypt.CTR.state (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n k: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n cid_len: QUIC.Spec.Base.short_dcid_len_t ->\n dst: LowStar.Buffer.buffer FStar.UInt8.t ->\n dst_len: FStar.UInt32.t ->\n m: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "NotEverCrypt.CTR.state", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "QUIC.Spec.Base.short_dcid_len_t", "FStar.UInt8.t", "FStar.UInt32.t", "FStar.Monotonic.HyperStack.mem", "Prims.l_and", "LowStar.Monotonic.Buffer.all_live", "Prims.Cons", "LowStar.Monotonic.Buffer.buf_t", "LowStar.Monotonic.Buffer.buf", "LowStar.Buffer.trivial_preorder", "Prims.Nil", "NotEverCrypt.CTR.invariant", "Prims.eq2", "Prims.nat", "LowStar.Monotonic.Buffer.length", "Spec.Agile.Cipher.key_length", "LowStar.Monotonic.Buffer.all_disjoint", "LowStar.Monotonic.Buffer.loc", "NotEverCrypt.CTR.footprint", "LowStar.Monotonic.Buffer.loc_buffer", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "FStar.UInt32.v" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_decrypt_aux_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n : GTot Type0\nlet header_decrypt_aux_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n : GTot Type0 =", "completed_definiton": "let l = B.length dst in\nB.all_live m [B.buf k; B.buf dst] /\\ CTR.invariant m s /\\\nB.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\nB.all_disjoint [CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\nB.length dst == U32.v dst_len", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.pn_sizemask", "original_source_type": "val pn_sizemask (dst: B.buffer Secret.uint8) (pn_len: PN.packet_number_length_t)\n : HST.Stack unit\n (requires fun h0 -> B.live h0 dst /\\ B.length dst == 4)\n (ensures\n fun h0 _ h1 ->\n (B.as_seq h1 dst) `Seq.equal` (Seq.seq_hide (pn_sizemask_ct (Secret.v pn_len - 1))) /\\\n B.(modifies (loc_buffer dst) h0 h1))", "source_type": "val pn_sizemask (dst: B.buffer Secret.uint8) (pn_len: PN.packet_number_length_t)\n : HST.Stack unit\n (requires fun h0 -> B.live h0 dst /\\ B.length dst == 4)\n (ensures\n fun h0 _ h1 ->\n (B.as_seq h1 dst) `Seq.equal` (Seq.seq_hide (pn_sizemask_ct (Secret.v pn_len - 1))) /\\\n B.(modifies (loc_buffer dst) h0 h1))", "source_definition": "let pn_sizemask (dst: B.buffer Secret.uint8) (pn_len: PN.packet_number_length_t): HST.Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\ B.length dst == 4)\n (ensures fun h0 _ h1 ->\n B.as_seq h1 dst `Seq.equal` Seq.seq_hide (pn_sizemask_ct (Secret.v pn_len - 1)) /\\\n B.(modifies (loc_buffer dst) h0 h1))\n= let x = pn_sizemask_ct_num pn_len in\n SecretBuffer.store32_be dst x", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 322, "start_col": 1, "end_line": 323, "end_col": 31 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)\n\nlet pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma\n (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\n= let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n pow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\n Lemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i\n\nlet header_encrypt_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: GTot packet\n= \n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256\"\n\nlet header_encrypt_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: Lemma\n (header_encrypt_ct a hpk h c `Seq.equal` Spec.header_encrypt a hpk h c)\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then ()\n else begin\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Parse.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header { ~ (Spec.is_retry h) })\n (r: Seq.seq Secret.uint8 {\n Seq.length r >= Parse.pn_offset h + 20\n })\n: GTot (Seq.seq Secret.uint8)\n= \n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = (Seq.slice r (pn_offset + 4) (pn_offset + 20)) in\n let mask = (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide (pn_sizemask_ct pn_len)) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n let r = Lemmas.secret_xor_inplace r pnmask pn_offset in\n let r = Seq.cons f' (Seq.slice r 1 (Seq.length r)) in\n r\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 2\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n: Lemma\n (requires (\n (~ (Spec.is_retry h))\n ))\n (ensures (\n let r = Parse.format_header h `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide r))\n ))\n= header_encrypt_ct_correct a hpk h c;\n let fmt = Parse.format_header h in\n let len = Seq.length fmt in\n let pr = fmt `Seq.append` c in\n assert (Seq.length pr >= Parse.pn_offset h + 20);\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let psample = Seq.slice c (3 - pn_len) (19 - pn_len) in\n assert (c `Seq.equal` Seq.slice pr len (Seq.length pr));\n let pn_off = Parse.pn_offset h in\n assert (pn_off + pn_len + 1 == len);\n assert (c == Seq.slice pr (pn_off + pn_len + 1) (Seq.length pr));\n Seq.slice_slice pr (pn_off + pn_len + 1) (Seq.length pr) (3 - pn_len) (19 - pn_len);\n assert (psample == Seq.slice pr (pn_off + 4) (pn_off + 20));\n let r = Seq.seq_hide #Secret.U8 pr in\n let sample = Seq.slice r (pn_off + 4) (pn_off + 20) in\n assert (sample == Seq.seq_hide #Secret.U8 psample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n assert (mask == Seq.seq_hide pmask);\n let mask15 = Seq.slice mask 1 5 in\n let ppnszmask = pn_sizemask_ct pn_len in\n let pnszmask = Seq.seq_hide ppnszmask in\n let pnmask = Lemmas.secret_and_inplace mask15 pnszmask 0 in\n let pmask15 = Seq.slice pmask 1 5 in\n let ppnmask = Lemmas.and_inplace pmask15 ppnszmask 0 in\n Lemmas.secret_and_inplace_eq mask15 pnszmask 0;\n assert (pnmask == Seq.seq_hide #Secret.U8 ppnmask);\n let f = Seq.index r 0 in\n let pf : Secret.uint_t Secret.U8 Secret.PUB = Seq.index pr 0 in\n assert (f == Secret.hide #Secret.U8 #Secret.PUB pf);\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 (U32.v protected_bits) (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 (U32.v protected_bits))) in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n assert (U8.v pf' == Secret.v f');\n assert (f' == Secret.hide #Secret.U8 pf');\n let pr1 = Lemmas.xor_inplace pr ppnmask pn_off in\n let r1 = Lemmas.secret_xor_inplace r pnmask pn_off in\n Lemmas.secret_xor_inplace_eq r pnmask pn_off;\n assert (r1 == Seq.seq_hide #Secret.U8 pr1);\n let r2 = Seq.cons f' (Seq.slice r1 1 (Seq.length r1)) in\n let pr2 = Seq.cons pf' (Seq.slice pr1 1 (Seq.length pr1)) in\n Seq.cons_seq_hide #Secret.U8 pf' (Seq.slice pr1 1 (Seq.length pr1));\n assert (r2 == Seq.seq_hide #Secret.U8 pr2)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet pn_sizemask_ct_num\n (pn_len: PN.packet_number_length_t)\n: Tot (x: Secret.uint32 { pn_sizemask_ct (Secret.v pn_len - 1) == FStar.Endianness.n_to_be 4 (Secret.v x) })\n=\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` (Secret.v pn_len - 1)));\n [@inline_let]\n let n0 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 24) in\n [@inline_let]\n let n1 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 16) in\n [@inline_let]\n let n2 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 8) in\n [@inline_let]\n let n3 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 0) in\n let pn_len_1 = pn_len `Secret.sub` Secret.to_u32 1ul in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n0)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n1)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n2)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n3))\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet pn_sizemask (dst: B.buffer Secret.uint8) (pn_len: PN.packet_number_length_t): HST.Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\ B.length dst == 4)\n (ensures fun h0 _ h1 ->\n B.as_seq h1 dst `Seq.equal` Seq.seq_hide (pn_sizemask_ct (Secret.v pn_len - 1)) /\\", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n dst: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Secret.Buffer.store32_be", "Prims.unit", "Lib.IntTypes.int_t", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "Prims.eq2", "FStar.Seq.Base.seq", "QUIC.Spec.Base.byte", "Prims.l_or", "Prims.b2t", "Prims.op_Equality", "Prims.nat", "FStar.Seq.Base.length", "Prims.l_and", "FStar.UInt8.t", "Lib.IntTypes.v", "FStar.Endianness.be_to_n", "QUIC.Impl.Header.pn_sizemask_ct", "Prims.op_Subtraction", "FStar.Endianness.n_to_be", "QUIC.Impl.Header.pn_sizemask_ct_num", "FStar.Monotonic.HyperStack.mem", "LowStar.Monotonic.Buffer.live", "LowStar.Buffer.trivial_preorder", "Prims.int", "LowStar.Monotonic.Buffer.length", "FStar.Seq.Base.equal", "LowStar.Monotonic.Buffer.as_seq", "QUIC.Secret.Seq.seq_hide", "Lib.IntTypes.U8", "QUIC.Secret.Int.Base.v", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_buffer" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val pn_sizemask (dst: B.buffer Secret.uint8) (pn_len: PN.packet_number_length_t)\n : HST.Stack unit\n (requires fun h0 -> B.live h0 dst /\\ B.length dst == 4)\n (ensures\n fun h0 _ h1 ->\n (B.as_seq h1 dst) `Seq.equal` (Seq.seq_hide (pn_sizemask_ct (Secret.v pn_len - 1))) /\\\n B.(modifies (loc_buffer dst) h0 h1))\nlet pn_sizemask (dst: B.buffer Secret.uint8) (pn_len: PN.packet_number_length_t)\n : HST.Stack unit\n (requires fun h0 -> B.live h0 dst /\\ B.length dst == 4)\n (ensures\n fun h0 _ h1 ->\n (B.as_seq h1 dst) `Seq.equal` (Seq.seq_hide (pn_sizemask_ct (Secret.v pn_len - 1))) /\\\n B.(modifies (loc_buffer dst) h0 h1)) =", "completed_definiton": "let x = pn_sizemask_ct_num pn_len in\nSecretBuffer.store32_be dst x", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.header_decrypt_aux_post", "original_source_type": "val header_decrypt_aux_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n (rs: header_decrypt_aux_result)\n (m': HS.mem)\n : GTot Type0", "source_type": "val header_decrypt_aux_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n (rs: header_decrypt_aux_result)\n (m': HS.mem)\n : GTot Type0", "source_definition": "let header_decrypt_aux_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n (rs: header_decrypt_aux_result)\n (m' : HS.mem)\n: GTot Type0\n=\n header_decrypt_aux_pre a s k cid_len dst dst_len m /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n begin match rs, Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) with\n | HD_Failure, None ->\n B.modifies B.loc_none m m'\n | HD_Failure, _ -> False\n | _, Some res ->\n res.Spec.packet == B.as_seq m' dst /\\\n res.Spec.is_retry == (HD_Success_Retry? rs) /\\\n (if res.Spec.is_retry\n then B.modifies B.loc_none m m'\n else\n let len = res.Spec.pn_offset + res.Spec.pn_len + 1 in\n len <= B.length dst /\\\n B.modifies (CTR.footprint m s `B.loc_union` B.loc_buffer (B.gsub dst 0ul (U32.uint_to_t len))) m m'\n )\n | _ -> False\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 845, "start_col": 2, "end_line": 863, "end_col": 5 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)\n\nlet pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma\n (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\n= let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n pow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\n Lemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i\n\nlet header_encrypt_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: GTot packet\n= \n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256\"\n\nlet header_encrypt_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: Lemma\n (header_encrypt_ct a hpk h c `Seq.equal` Spec.header_encrypt a hpk h c)\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then ()\n else begin\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Parse.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header { ~ (Spec.is_retry h) })\n (r: Seq.seq Secret.uint8 {\n Seq.length r >= Parse.pn_offset h + 20\n })\n: GTot (Seq.seq Secret.uint8)\n= \n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = (Seq.slice r (pn_offset + 4) (pn_offset + 20)) in\n let mask = (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide (pn_sizemask_ct pn_len)) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n let r = Lemmas.secret_xor_inplace r pnmask pn_offset in\n let r = Seq.cons f' (Seq.slice r 1 (Seq.length r)) in\n r\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 2\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n: Lemma\n (requires (\n (~ (Spec.is_retry h))\n ))\n (ensures (\n let r = Parse.format_header h `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide r))\n ))\n= header_encrypt_ct_correct a hpk h c;\n let fmt = Parse.format_header h in\n let len = Seq.length fmt in\n let pr = fmt `Seq.append` c in\n assert (Seq.length pr >= Parse.pn_offset h + 20);\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let psample = Seq.slice c (3 - pn_len) (19 - pn_len) in\n assert (c `Seq.equal` Seq.slice pr len (Seq.length pr));\n let pn_off = Parse.pn_offset h in\n assert (pn_off + pn_len + 1 == len);\n assert (c == Seq.slice pr (pn_off + pn_len + 1) (Seq.length pr));\n Seq.slice_slice pr (pn_off + pn_len + 1) (Seq.length pr) (3 - pn_len) (19 - pn_len);\n assert (psample == Seq.slice pr (pn_off + 4) (pn_off + 20));\n let r = Seq.seq_hide #Secret.U8 pr in\n let sample = Seq.slice r (pn_off + 4) (pn_off + 20) in\n assert (sample == Seq.seq_hide #Secret.U8 psample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n assert (mask == Seq.seq_hide pmask);\n let mask15 = Seq.slice mask 1 5 in\n let ppnszmask = pn_sizemask_ct pn_len in\n let pnszmask = Seq.seq_hide ppnszmask in\n let pnmask = Lemmas.secret_and_inplace mask15 pnszmask 0 in\n let pmask15 = Seq.slice pmask 1 5 in\n let ppnmask = Lemmas.and_inplace pmask15 ppnszmask 0 in\n Lemmas.secret_and_inplace_eq mask15 pnszmask 0;\n assert (pnmask == Seq.seq_hide #Secret.U8 ppnmask);\n let f = Seq.index r 0 in\n let pf : Secret.uint_t Secret.U8 Secret.PUB = Seq.index pr 0 in\n assert (f == Secret.hide #Secret.U8 #Secret.PUB pf);\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 (U32.v protected_bits) (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 (U32.v protected_bits))) in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n assert (U8.v pf' == Secret.v f');\n assert (f' == Secret.hide #Secret.U8 pf');\n let pr1 = Lemmas.xor_inplace pr ppnmask pn_off in\n let r1 = Lemmas.secret_xor_inplace r pnmask pn_off in\n Lemmas.secret_xor_inplace_eq r pnmask pn_off;\n assert (r1 == Seq.seq_hide #Secret.U8 pr1);\n let r2 = Seq.cons f' (Seq.slice r1 1 (Seq.length r1)) in\n let pr2 = Seq.cons pf' (Seq.slice pr1 1 (Seq.length pr1)) in\n Seq.cons_seq_hide #Secret.U8 pf' (Seq.slice pr1 1 (Seq.length pr1));\n assert (r2 == Seq.seq_hide #Secret.U8 pr2)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet pn_sizemask_ct_num\n (pn_len: PN.packet_number_length_t)\n: Tot (x: Secret.uint32 { pn_sizemask_ct (Secret.v pn_len - 1) == FStar.Endianness.n_to_be 4 (Secret.v x) })\n=\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` (Secret.v pn_len - 1)));\n [@inline_let]\n let n0 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 24) in\n [@inline_let]\n let n1 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 16) in\n [@inline_let]\n let n2 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 8) in\n [@inline_let]\n let n3 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 0) in\n let pn_len_1 = pn_len `Secret.sub` Secret.to_u32 1ul in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n0)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n1)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n2)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n3))\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet pn_sizemask (dst: B.buffer Secret.uint8) (pn_len: PN.packet_number_length_t): HST.Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\ B.length dst == 4)\n (ensures fun h0 _ h1 ->\n B.as_seq h1 dst `Seq.equal` Seq.seq_hide (pn_sizemask_ct (Secret.v pn_len - 1)) /\\\n B.(modifies (loc_buffer dst) h0 h1))\n= let x = pn_sizemask_ct_num pn_len in\n SecretBuffer.store32_be dst x\n\n#push-options \"--z3rlimit 512 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (h: Ghost.erased Spec.header)\n (is_short: bool)\n (pn_offset: U32.t)\n (pn_len: PN.packet_number_length_t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let fmt = (Parse.format_header h) in\n let hlen = Seq.length fmt in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n (~ (Spec.is_retry h)) /\\\n is_short == (Spec.MShort? h) /\\\n U32.v pn_offset == Parse.pn_offset h /\\\n pn_len == Parse.pn_length h /\\\n hlen + 19 <= B.length dst /\\\n Seq.slice (Seq.seq_reveal #Secret.U8 (B.as_seq m dst)) 0 hlen == fmt\n ))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n header_encrypt_ct_secret_preserving_not_retry_spec a (B.as_seq m k) h (B.as_seq m dst) == B.as_seq m' dst\n ))\n= assert (U32.v pn_offset + 20 <= B.length dst);\n let m0 = HST.get () in\n HST.push_frame ();\n let m01 = HST.get () in\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n B.loc_unused_in_not_unused_in_disjoint m01;\n let m02 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m02;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n let m03 = HST.get () in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (CTR.footprint m03 s == CTR.footprint m0 s);\n assert (B.loc_disjoint (B.loc_buffer mask `B.loc_union` B.loc_buffer pn_sm) (CTR.footprint m0 s `B.loc_union` B.loc_buffer k `B.loc_union` B.loc_buffer dst));\n let sample = B.sub dst (pn_offset `U32.add` 4ul) 16ul in\n let m1 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v pn_offset + 4) (U32.v pn_offset + 20)) in\n assert (B.as_seq m1 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m2 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m2 mask == Ghost.reveal gmask);\n pn_sizemask pn_sm pn_len;\n let m3 = HST.get () in\n assert (B.as_seq m3 mask == Ghost.reveal gmask);\n let gpn_sm = Ghost.hide (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len - 1))) in\n assert (B.as_seq m3 pn_sm == Ghost.reveal gpn_sm);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m4 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) gpn_sm 0) in\n assert (B.as_seq m4 pnmask == Ghost.reveal gpnmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask_0 = B.index mask 0ul in\n assert (mask_0 == Seq.index (B.as_seq m4 (B.gsub mask 0ul 1ul)) 0);\n assert (mask_0 == Seq.index gmask 0);\n let f_ = B.index dst 0ul in\n assert (f_ == Seq.index (B.as_seq m0 dst) 0);\n let f_logxor = f_ `Secret.logxor` mask_0 in\n let f_get_bf = Secret.get_bitfield f_logxor 0ul protected_bits in\n let f' = Secret.set_bitfield f_ 0ul protected_bits f_get_bf in\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n let m5 = HST.get () in\n let gr1 = Ghost.hide (Lemmas.secret_xor_inplace (B.as_seq m0 dst) gpnmask (U32.v pn_offset)) in\n assert (B.as_seq m5 dst == Ghost.reveal gr1);\n B.upd dst 0ul f' ;\n HST.pop_frame ();\n let m6 = HST.get () in\n assert (B.as_seq m6 dst `Seq.equal` (f' `Seq.cons` Seq.slice (Ghost.reveal gr1) 1 (B.length dst)))\n\n#restart-solver\n\nlet header_encrypt\n a s k dst h is_short is_retry public_len pn_len\n= if is_retry\n then ()\n else begin\n let m = HST.get () in\n let hpk = Ghost.hide (B.as_seq m k) in\n let fmt = Ghost.hide (Parse.format_header (G.reveal h)) in\n let cipher = Ghost.hide (Seq.slice (B.as_seq m dst) (Seq.length fmt) (B.length dst)) in\n assert (B.as_seq m dst `Seq.equal` (fmt `Seq.append` cipher));\n header_encrypt_ct_secret_preserving_not_retry_spec_correct a hpk h cipher;\n assert (U32.v public_len + 20 <= B.length dst);\n let post (cont: Seq.lseq Secret.uint8 (B.length dst)) (m1: HS.mem) : GTot Type0 =\n header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst)) == cont /\\\n CTR.invariant m1 s /\\\n CTR.footprint m1 s == CTR.footprint m s\n in\n SecretBuffer.with_whole_buffer_hide_weak_modifies'\n #unit\n dst\n m\n (CTR.footprint m s `B.loc_union` B.loc_buffer k)\n (CTR.footprint m s)\n true\n (fun _ cont m1 ->\n post cont m1\n )\n (fun _ bs ->\n header_encrypt_ct_secret_preserving_not_retry a s k h is_short public_len pn_len bs\n )\n ;\n let m' = HST.get () in\n assert (B.as_seq m' dst == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst))));\n assert (B.as_seq m' dst == Spec.header_encrypt a (B.as_seq m k) h cipher)\n end\n\n#pop-options\n\n\n(* A constant-time specification of header_decrypt_aux which does not test or truncate on pn_len *)\n\nlet header_decrypt_aux_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: GTot (option Spec.header_decrypt_aux_t)\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet;\n Spec.pn_offset = ();\n Spec.pn_len = ();\n })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = pn_len;\n })\n end\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats\"\n\n#restart-solver\n\nlet header_decrypt_aux_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len packet == Spec.header_decrypt_aux a hpk cid_len packet)\n= \n let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then ()\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then ()\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> ()\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then ()\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal #Secret.U8 (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide #Secret.U8 sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n let r = packet' in\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#restart-solver\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })\n : GTot (Spec.header_decrypt_aux_t)\n=\n let f = Seq.index packet 0 in\n let sample_offset = pn_offset + 4 in\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` (Seq.index mask 0)) 0ul protected_bits) in\n let packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len))) 0 in\n let packet'' = Lemmas.secret_xor_inplace packet' pnmask pn_offset in\n {\n Spec.is_short = is_short;\n Spec.is_retry = false;\n Spec.packet = Seq.seq_reveal #Secret.U8 packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = Secret.v pn_len;\n }\n\n#push-options \"--z3rlimit 32\"\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet) == Some (header_decrypt_aux_ct_secret_preserving_not_retry_spec a hpk cid_len packet is_short pn_offset))\n= assert (Some? (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet)));\n let ppacket = Seq.seq_reveal packet in\n let f = Seq.index packet 0 in\n let pf = Seq.index ppacket 0 in\n assert (pf == Secret.reveal f);\n let is_short = (BF.get_bitfield #8 (Secret.v f) 7 8 = 0) in\n let Some pn_offset = Parse.putative_pn_offset cid_len ppacket in\n let sample_offset = pn_offset + 4 in\n let psample = Seq.slice ppacket sample_offset (sample_offset + 16) in\n let sample = Seq.slice packet sample_offset (sample_offset + 16) in\n assert (psample == Seq.seq_reveal sample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n let protected_bits = if is_short then 5 else 4 in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 protected_bits (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 protected_bits)) in\n let f' = Secret.set_bitfield f 0ul (U32.uint_to_t protected_bits) (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul (U32.uint_to_t protected_bits)) in\n assert (pf' == Secret.reveal f');\n let packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\n let ppacket' = Seq.cons pf' (Seq.slice ppacket 1 (Seq.length ppacket)) in\n assert (ppacket' `Seq.equal` Seq.seq_reveal packet');\n let ppn_len = BF.get_bitfield (U8.v pf') 0 2 in\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n assert (Secret.v pn_len == ppn_len);\n let ppnmask_ct = Lemmas.and_inplace (Seq.slice pmask 1 5) (pn_sizemask_ct ppn_len) 0 in\n let pnmask_ct = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct ppn_len)) 0 in\n Lemmas.secret_and_inplace_eq (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct ppn_len)) 0;\n assert (ppnmask_ct == Seq.seq_reveal pnmask_ct);\n Lemmas.secret_xor_inplace_eq packet' pnmask_ct pn_offset\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\ninline_for_extraction\nlet header_decrypt_aux_ct_secret_preserving_not_retry'\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n 0 < l /\\ l < pow2 32 /\\ (\n let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\ (\n match Parse.putative_pn_offset (U32.v cid_len) (Seq.seq_reveal (B.as_seq m dst)) with\n | None -> False\n | Some pn_offset' ->\n U32.v pn_offset == pn_offset' /\\\n pn_offset' + 20 <= l\n ))))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) is_short (U32.v pn_offset)).Spec.packet == Seq.seq_reveal (B.as_seq m' dst)\n ))\n= let m0 = HST.get () in\n let f = B.index dst 0ul in\n let sample_offset = pn_offset `U32.add` 4ul in\n let sample = B.sub dst sample_offset 16ul in\n HST.push_frame ();\n let m1 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m1;\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer dst `B.loc_union` CTR.footprint m0 s));\n let m2 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m2;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (B.loc_disjoint (B.loc_buffer pn_sm) (B.loc_buffer dst `B.loc_union` CTR.footprint m0 s));\n let m3 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v sample_offset) (U32.v sample_offset + 16)) in\n assert (B.as_seq m3 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m4 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m4 mask == Ghost.reveal gmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask0 = B.index mask 0ul in\n let f_logxor = f `Secret.logxor` mask0 in\n let f_bf = Secret.get_bitfield (f_logxor) 0ul protected_bits in\n let f' = Secret.set_bitfield f 0ul protected_bits f_bf in\n B.upd dst 0ul f';\n let m5 = HST.get () in\n let gpacket' = Ghost.hide (Seq.cons f' (Seq.slice (B.as_seq m0 dst) 1 (B.length dst))) in\n assert (Ghost.reveal gpacket' `Seq.equal` B.as_seq m5 dst);\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n pn_sizemask pn_sm (Secret.cast_up Secret.U32 pn_len `Secret.add` Secret.hide 1ul);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m6 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len))) 0) in\n assert (Ghost.reveal gpnmask == B.as_seq m6 pnmask);\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n HST.pop_frame ();\n let m7 = HST.get () in\n assert (B.as_seq m7 dst == Lemmas.secret_xor_inplace gpacket' gpnmask (U32.v pn_offset))\n\n#pop-options\n\n#push-options \"--z3rlimit 32 --query_stats\"\n\n#restart-solver\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer U8.t)\n: HST.Stack unit\n (requires (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n 0 < l /\\ l < pow2 32 /\\ (\n let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\ (\n match Parse.putative_pn_offset (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some pn_offset' ->\n U32.v pn_offset == pn_offset' /\\\n pn_offset' + 20 <= l\n ))))\n (ensures (fun m _ m' ->\n match Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some res ->\n let len_mod = U32.v pn_offset + res.Spec.pn_len + 1 in\n res.Spec.pn_offset == U32.v pn_offset /\\\n len_mod <= B.length dst /\\\n B.modifies (B.loc_buffer (B.gsub dst 0ul (U32.uint_to_t len_mod)) `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n res.Spec.packet == B.as_seq m' dst\n ))\n=\n let m = HST.get () in\n SecretBuffer.with_whole_buffer_hide_weak_modifies\n #unit\n dst\n m\n (CTR.footprint m s `B.loc_union` B.loc_buffer k)\n (CTR.footprint m s)\n true\n (fun _ cont m' ->\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a (B.as_seq m k) (U32.v cid_len) (Seq.seq_hide #Secret.U8 (B.as_seq m dst)) is_short (U32.v pn_offset)).Spec.packet == cont /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s\n )\n (fun _ bs ->\n header_decrypt_aux_ct_secret_preserving_not_retry' a s k cid_len is_short pn_offset bs\n );\n let m' = HST.get () in\n header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct a (B.as_seq m k) (U32.v cid_len) (Seq.seq_hide #Secret.U8 (B.as_seq m dst)) is_short (U32.v pn_offset);\n header_decrypt_aux_ct_correct a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst);\n Spec.header_decrypt_aux_post a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst);\n let len_mod = Ghost.hide (U32.uint_to_t (U32.v pn_offset + (Some?.v (Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst))).Spec.pn_len + 1)) in\n B.modifies_loc_buffer_from_to_intro dst 0ul len_mod (CTR.footprint m s) m m'\n\n#pop-options\n\ntype header_decrypt_aux_result =\n | HD_Failure\n | HD_Success_Retry\n | HD_Success_NotRetry\n\nunfold\nlet header_decrypt_aux_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n: GTot Type0\n=\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length dst == U32.v dst_len\n\nunfold\nlet header_decrypt_aux_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n (rs: header_decrypt_aux_result)\n (m' : HS.mem)\n: GTot Type0", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n s: NotEverCrypt.CTR.state (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n k: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n cid_len: QUIC.Spec.Base.short_dcid_len_t ->\n dst: LowStar.Buffer.buffer FStar.UInt8.t ->\n dst_len: FStar.UInt32.t ->\n m: FStar.Monotonic.HyperStack.mem ->\n rs: QUIC.Impl.Header.header_decrypt_aux_result ->\n m': FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "NotEverCrypt.CTR.state", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "QUIC.Spec.Base.short_dcid_len_t", "FStar.UInt8.t", "FStar.UInt32.t", "FStar.Monotonic.HyperStack.mem", "QUIC.Impl.Header.header_decrypt_aux_result", "Prims.l_and", "QUIC.Impl.Header.header_decrypt_aux_pre", "NotEverCrypt.CTR.invariant", "Prims.eq2", "LowStar.Monotonic.Buffer.loc", "NotEverCrypt.CTR.footprint", "FStar.Pervasives.Native.Mktuple2", "FStar.Pervasives.Native.option", "QUIC.Spec.Header.header_decrypt_aux_t", "QUIC.Spec.Header.header_decrypt_aux", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Buffer.trivial_preorder", "FStar.UInt32.v", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_none", "Prims.l_False", "FStar.Seq.Base.seq", "QUIC.Spec.Base.byte", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__packet", "Prims.bool", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__is_retry", "QUIC.Impl.Header.uu___is_HD_Success_Retry", "Prims.b2t", "Prims.op_LessThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Buffer.gsub", "FStar.UInt32.__uint_to_t", "FStar.UInt32.uint_to_t", "Prims.int", "Prims.op_Addition", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__pn_offset", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__pn_len", "Prims.logical", "FStar.Pervasives.Native.tuple2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_decrypt_aux_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n (rs: header_decrypt_aux_result)\n (m': HS.mem)\n : GTot Type0\nlet header_decrypt_aux_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n (rs: header_decrypt_aux_result)\n (m': HS.mem)\n : GTot Type0 =", "completed_definiton": "header_decrypt_aux_pre a s k cid_len dst dst_len m /\\ CTR.invariant m' s /\\\nCTR.footprint m s == CTR.footprint m' s /\\\n(match rs, Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) with\n | HD_Failure, None -> B.modifies B.loc_none m m'\n | HD_Failure, _ -> False\n | _, Some res ->\n res.Spec.packet == B.as_seq m' dst /\\ res.Spec.is_retry == (HD_Success_Retry? rs) /\\\n (if res.Spec.is_retry\n then B.modifies B.loc_none m m'\n else\n let len = res.Spec.pn_offset + res.Spec.pn_len + 1 in\n len <= B.length dst /\\\n B.modifies ((CTR.footprint m s)\n `B.loc_union`\n (B.loc_buffer (B.gsub dst 0ul (U32.uint_to_t len))))\n m\n m')\n | _ -> False)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.max_cipher_length64", "original_source_type": "val max_cipher_length64:(x: Secret.uint64{Secret.v x == max_cipher_length})", "source_type": "val max_cipher_length64:(x: Secret.uint64{Secret.v x == max_cipher_length})", "source_definition": "let max_cipher_length64 : (x: Secret.uint64 { Secret.v x == max_cipher_length }) =\n Secret.mk_int (norm [delta; iota; zeta; primops] (pow2 32 - header_len_bound))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 905, "start_col": 2, "end_line": 905, "end_col": 80 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)\n\nlet pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma\n (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\n= let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n pow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\n Lemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i\n\nlet header_encrypt_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: GTot packet\n= \n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256\"\n\nlet header_encrypt_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: Lemma\n (header_encrypt_ct a hpk h c `Seq.equal` Spec.header_encrypt a hpk h c)\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then ()\n else begin\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Parse.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header { ~ (Spec.is_retry h) })\n (r: Seq.seq Secret.uint8 {\n Seq.length r >= Parse.pn_offset h + 20\n })\n: GTot (Seq.seq Secret.uint8)\n= \n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = (Seq.slice r (pn_offset + 4) (pn_offset + 20)) in\n let mask = (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide (pn_sizemask_ct pn_len)) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n let r = Lemmas.secret_xor_inplace r pnmask pn_offset in\n let r = Seq.cons f' (Seq.slice r 1 (Seq.length r)) in\n r\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 2\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n: Lemma\n (requires (\n (~ (Spec.is_retry h))\n ))\n (ensures (\n let r = Parse.format_header h `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide r))\n ))\n= header_encrypt_ct_correct a hpk h c;\n let fmt = Parse.format_header h in\n let len = Seq.length fmt in\n let pr = fmt `Seq.append` c in\n assert (Seq.length pr >= Parse.pn_offset h + 20);\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let psample = Seq.slice c (3 - pn_len) (19 - pn_len) in\n assert (c `Seq.equal` Seq.slice pr len (Seq.length pr));\n let pn_off = Parse.pn_offset h in\n assert (pn_off + pn_len + 1 == len);\n assert (c == Seq.slice pr (pn_off + pn_len + 1) (Seq.length pr));\n Seq.slice_slice pr (pn_off + pn_len + 1) (Seq.length pr) (3 - pn_len) (19 - pn_len);\n assert (psample == Seq.slice pr (pn_off + 4) (pn_off + 20));\n let r = Seq.seq_hide #Secret.U8 pr in\n let sample = Seq.slice r (pn_off + 4) (pn_off + 20) in\n assert (sample == Seq.seq_hide #Secret.U8 psample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n assert (mask == Seq.seq_hide pmask);\n let mask15 = Seq.slice mask 1 5 in\n let ppnszmask = pn_sizemask_ct pn_len in\n let pnszmask = Seq.seq_hide ppnszmask in\n let pnmask = Lemmas.secret_and_inplace mask15 pnszmask 0 in\n let pmask15 = Seq.slice pmask 1 5 in\n let ppnmask = Lemmas.and_inplace pmask15 ppnszmask 0 in\n Lemmas.secret_and_inplace_eq mask15 pnszmask 0;\n assert (pnmask == Seq.seq_hide #Secret.U8 ppnmask);\n let f = Seq.index r 0 in\n let pf : Secret.uint_t Secret.U8 Secret.PUB = Seq.index pr 0 in\n assert (f == Secret.hide #Secret.U8 #Secret.PUB pf);\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 (U32.v protected_bits) (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 (U32.v protected_bits))) in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n assert (U8.v pf' == Secret.v f');\n assert (f' == Secret.hide #Secret.U8 pf');\n let pr1 = Lemmas.xor_inplace pr ppnmask pn_off in\n let r1 = Lemmas.secret_xor_inplace r pnmask pn_off in\n Lemmas.secret_xor_inplace_eq r pnmask pn_off;\n assert (r1 == Seq.seq_hide #Secret.U8 pr1);\n let r2 = Seq.cons f' (Seq.slice r1 1 (Seq.length r1)) in\n let pr2 = Seq.cons pf' (Seq.slice pr1 1 (Seq.length pr1)) in\n Seq.cons_seq_hide #Secret.U8 pf' (Seq.slice pr1 1 (Seq.length pr1));\n assert (r2 == Seq.seq_hide #Secret.U8 pr2)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet pn_sizemask_ct_num\n (pn_len: PN.packet_number_length_t)\n: Tot (x: Secret.uint32 { pn_sizemask_ct (Secret.v pn_len - 1) == FStar.Endianness.n_to_be 4 (Secret.v x) })\n=\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` (Secret.v pn_len - 1)));\n [@inline_let]\n let n0 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 24) in\n [@inline_let]\n let n1 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 16) in\n [@inline_let]\n let n2 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 8) in\n [@inline_let]\n let n3 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 0) in\n let pn_len_1 = pn_len `Secret.sub` Secret.to_u32 1ul in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n0)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n1)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n2)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n3))\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet pn_sizemask (dst: B.buffer Secret.uint8) (pn_len: PN.packet_number_length_t): HST.Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\ B.length dst == 4)\n (ensures fun h0 _ h1 ->\n B.as_seq h1 dst `Seq.equal` Seq.seq_hide (pn_sizemask_ct (Secret.v pn_len - 1)) /\\\n B.(modifies (loc_buffer dst) h0 h1))\n= let x = pn_sizemask_ct_num pn_len in\n SecretBuffer.store32_be dst x\n\n#push-options \"--z3rlimit 512 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (h: Ghost.erased Spec.header)\n (is_short: bool)\n (pn_offset: U32.t)\n (pn_len: PN.packet_number_length_t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let fmt = (Parse.format_header h) in\n let hlen = Seq.length fmt in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n (~ (Spec.is_retry h)) /\\\n is_short == (Spec.MShort? h) /\\\n U32.v pn_offset == Parse.pn_offset h /\\\n pn_len == Parse.pn_length h /\\\n hlen + 19 <= B.length dst /\\\n Seq.slice (Seq.seq_reveal #Secret.U8 (B.as_seq m dst)) 0 hlen == fmt\n ))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n header_encrypt_ct_secret_preserving_not_retry_spec a (B.as_seq m k) h (B.as_seq m dst) == B.as_seq m' dst\n ))\n= assert (U32.v pn_offset + 20 <= B.length dst);\n let m0 = HST.get () in\n HST.push_frame ();\n let m01 = HST.get () in\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n B.loc_unused_in_not_unused_in_disjoint m01;\n let m02 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m02;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n let m03 = HST.get () in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (CTR.footprint m03 s == CTR.footprint m0 s);\n assert (B.loc_disjoint (B.loc_buffer mask `B.loc_union` B.loc_buffer pn_sm) (CTR.footprint m0 s `B.loc_union` B.loc_buffer k `B.loc_union` B.loc_buffer dst));\n let sample = B.sub dst (pn_offset `U32.add` 4ul) 16ul in\n let m1 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v pn_offset + 4) (U32.v pn_offset + 20)) in\n assert (B.as_seq m1 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m2 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m2 mask == Ghost.reveal gmask);\n pn_sizemask pn_sm pn_len;\n let m3 = HST.get () in\n assert (B.as_seq m3 mask == Ghost.reveal gmask);\n let gpn_sm = Ghost.hide (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len - 1))) in\n assert (B.as_seq m3 pn_sm == Ghost.reveal gpn_sm);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m4 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) gpn_sm 0) in\n assert (B.as_seq m4 pnmask == Ghost.reveal gpnmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask_0 = B.index mask 0ul in\n assert (mask_0 == Seq.index (B.as_seq m4 (B.gsub mask 0ul 1ul)) 0);\n assert (mask_0 == Seq.index gmask 0);\n let f_ = B.index dst 0ul in\n assert (f_ == Seq.index (B.as_seq m0 dst) 0);\n let f_logxor = f_ `Secret.logxor` mask_0 in\n let f_get_bf = Secret.get_bitfield f_logxor 0ul protected_bits in\n let f' = Secret.set_bitfield f_ 0ul protected_bits f_get_bf in\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n let m5 = HST.get () in\n let gr1 = Ghost.hide (Lemmas.secret_xor_inplace (B.as_seq m0 dst) gpnmask (U32.v pn_offset)) in\n assert (B.as_seq m5 dst == Ghost.reveal gr1);\n B.upd dst 0ul f' ;\n HST.pop_frame ();\n let m6 = HST.get () in\n assert (B.as_seq m6 dst `Seq.equal` (f' `Seq.cons` Seq.slice (Ghost.reveal gr1) 1 (B.length dst)))\n\n#restart-solver\n\nlet header_encrypt\n a s k dst h is_short is_retry public_len pn_len\n= if is_retry\n then ()\n else begin\n let m = HST.get () in\n let hpk = Ghost.hide (B.as_seq m k) in\n let fmt = Ghost.hide (Parse.format_header (G.reveal h)) in\n let cipher = Ghost.hide (Seq.slice (B.as_seq m dst) (Seq.length fmt) (B.length dst)) in\n assert (B.as_seq m dst `Seq.equal` (fmt `Seq.append` cipher));\n header_encrypt_ct_secret_preserving_not_retry_spec_correct a hpk h cipher;\n assert (U32.v public_len + 20 <= B.length dst);\n let post (cont: Seq.lseq Secret.uint8 (B.length dst)) (m1: HS.mem) : GTot Type0 =\n header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst)) == cont /\\\n CTR.invariant m1 s /\\\n CTR.footprint m1 s == CTR.footprint m s\n in\n SecretBuffer.with_whole_buffer_hide_weak_modifies'\n #unit\n dst\n m\n (CTR.footprint m s `B.loc_union` B.loc_buffer k)\n (CTR.footprint m s)\n true\n (fun _ cont m1 ->\n post cont m1\n )\n (fun _ bs ->\n header_encrypt_ct_secret_preserving_not_retry a s k h is_short public_len pn_len bs\n )\n ;\n let m' = HST.get () in\n assert (B.as_seq m' dst == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst))));\n assert (B.as_seq m' dst == Spec.header_encrypt a (B.as_seq m k) h cipher)\n end\n\n#pop-options\n\n\n(* A constant-time specification of header_decrypt_aux which does not test or truncate on pn_len *)\n\nlet header_decrypt_aux_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: GTot (option Spec.header_decrypt_aux_t)\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet;\n Spec.pn_offset = ();\n Spec.pn_len = ();\n })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = pn_len;\n })\n end\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats\"\n\n#restart-solver\n\nlet header_decrypt_aux_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len packet == Spec.header_decrypt_aux a hpk cid_len packet)\n= \n let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then ()\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then ()\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> ()\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then ()\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal #Secret.U8 (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide #Secret.U8 sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n let r = packet' in\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#restart-solver\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })\n : GTot (Spec.header_decrypt_aux_t)\n=\n let f = Seq.index packet 0 in\n let sample_offset = pn_offset + 4 in\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` (Seq.index mask 0)) 0ul protected_bits) in\n let packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len))) 0 in\n let packet'' = Lemmas.secret_xor_inplace packet' pnmask pn_offset in\n {\n Spec.is_short = is_short;\n Spec.is_retry = false;\n Spec.packet = Seq.seq_reveal #Secret.U8 packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = Secret.v pn_len;\n }\n\n#push-options \"--z3rlimit 32\"\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet) == Some (header_decrypt_aux_ct_secret_preserving_not_retry_spec a hpk cid_len packet is_short pn_offset))\n= assert (Some? (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet)));\n let ppacket = Seq.seq_reveal packet in\n let f = Seq.index packet 0 in\n let pf = Seq.index ppacket 0 in\n assert (pf == Secret.reveal f);\n let is_short = (BF.get_bitfield #8 (Secret.v f) 7 8 = 0) in\n let Some pn_offset = Parse.putative_pn_offset cid_len ppacket in\n let sample_offset = pn_offset + 4 in\n let psample = Seq.slice ppacket sample_offset (sample_offset + 16) in\n let sample = Seq.slice packet sample_offset (sample_offset + 16) in\n assert (psample == Seq.seq_reveal sample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n let protected_bits = if is_short then 5 else 4 in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 protected_bits (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 protected_bits)) in\n let f' = Secret.set_bitfield f 0ul (U32.uint_to_t protected_bits) (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul (U32.uint_to_t protected_bits)) in\n assert (pf' == Secret.reveal f');\n let packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\n let ppacket' = Seq.cons pf' (Seq.slice ppacket 1 (Seq.length ppacket)) in\n assert (ppacket' `Seq.equal` Seq.seq_reveal packet');\n let ppn_len = BF.get_bitfield (U8.v pf') 0 2 in\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n assert (Secret.v pn_len == ppn_len);\n let ppnmask_ct = Lemmas.and_inplace (Seq.slice pmask 1 5) (pn_sizemask_ct ppn_len) 0 in\n let pnmask_ct = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct ppn_len)) 0 in\n Lemmas.secret_and_inplace_eq (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct ppn_len)) 0;\n assert (ppnmask_ct == Seq.seq_reveal pnmask_ct);\n Lemmas.secret_xor_inplace_eq packet' pnmask_ct pn_offset\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\ninline_for_extraction\nlet header_decrypt_aux_ct_secret_preserving_not_retry'\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n 0 < l /\\ l < pow2 32 /\\ (\n let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\ (\n match Parse.putative_pn_offset (U32.v cid_len) (Seq.seq_reveal (B.as_seq m dst)) with\n | None -> False\n | Some pn_offset' ->\n U32.v pn_offset == pn_offset' /\\\n pn_offset' + 20 <= l\n ))))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) is_short (U32.v pn_offset)).Spec.packet == Seq.seq_reveal (B.as_seq m' dst)\n ))\n= let m0 = HST.get () in\n let f = B.index dst 0ul in\n let sample_offset = pn_offset `U32.add` 4ul in\n let sample = B.sub dst sample_offset 16ul in\n HST.push_frame ();\n let m1 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m1;\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer dst `B.loc_union` CTR.footprint m0 s));\n let m2 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m2;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (B.loc_disjoint (B.loc_buffer pn_sm) (B.loc_buffer dst `B.loc_union` CTR.footprint m0 s));\n let m3 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v sample_offset) (U32.v sample_offset + 16)) in\n assert (B.as_seq m3 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m4 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m4 mask == Ghost.reveal gmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask0 = B.index mask 0ul in\n let f_logxor = f `Secret.logxor` mask0 in\n let f_bf = Secret.get_bitfield (f_logxor) 0ul protected_bits in\n let f' = Secret.set_bitfield f 0ul protected_bits f_bf in\n B.upd dst 0ul f';\n let m5 = HST.get () in\n let gpacket' = Ghost.hide (Seq.cons f' (Seq.slice (B.as_seq m0 dst) 1 (B.length dst))) in\n assert (Ghost.reveal gpacket' `Seq.equal` B.as_seq m5 dst);\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n pn_sizemask pn_sm (Secret.cast_up Secret.U32 pn_len `Secret.add` Secret.hide 1ul);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m6 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len))) 0) in\n assert (Ghost.reveal gpnmask == B.as_seq m6 pnmask);\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n HST.pop_frame ();\n let m7 = HST.get () in\n assert (B.as_seq m7 dst == Lemmas.secret_xor_inplace gpacket' gpnmask (U32.v pn_offset))\n\n#pop-options\n\n#push-options \"--z3rlimit 32 --query_stats\"\n\n#restart-solver\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer U8.t)\n: HST.Stack unit\n (requires (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n 0 < l /\\ l < pow2 32 /\\ (\n let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\ (\n match Parse.putative_pn_offset (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some pn_offset' ->\n U32.v pn_offset == pn_offset' /\\\n pn_offset' + 20 <= l\n ))))\n (ensures (fun m _ m' ->\n match Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some res ->\n let len_mod = U32.v pn_offset + res.Spec.pn_len + 1 in\n res.Spec.pn_offset == U32.v pn_offset /\\\n len_mod <= B.length dst /\\\n B.modifies (B.loc_buffer (B.gsub dst 0ul (U32.uint_to_t len_mod)) `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n res.Spec.packet == B.as_seq m' dst\n ))\n=\n let m = HST.get () in\n SecretBuffer.with_whole_buffer_hide_weak_modifies\n #unit\n dst\n m\n (CTR.footprint m s `B.loc_union` B.loc_buffer k)\n (CTR.footprint m s)\n true\n (fun _ cont m' ->\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a (B.as_seq m k) (U32.v cid_len) (Seq.seq_hide #Secret.U8 (B.as_seq m dst)) is_short (U32.v pn_offset)).Spec.packet == cont /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s\n )\n (fun _ bs ->\n header_decrypt_aux_ct_secret_preserving_not_retry' a s k cid_len is_short pn_offset bs\n );\n let m' = HST.get () in\n header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct a (B.as_seq m k) (U32.v cid_len) (Seq.seq_hide #Secret.U8 (B.as_seq m dst)) is_short (U32.v pn_offset);\n header_decrypt_aux_ct_correct a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst);\n Spec.header_decrypt_aux_post a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst);\n let len_mod = Ghost.hide (U32.uint_to_t (U32.v pn_offset + (Some?.v (Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst))).Spec.pn_len + 1)) in\n B.modifies_loc_buffer_from_to_intro dst 0ul len_mod (CTR.footprint m s) m m'\n\n#pop-options\n\ntype header_decrypt_aux_result =\n | HD_Failure\n | HD_Success_Retry\n | HD_Success_NotRetry\n\nunfold\nlet header_decrypt_aux_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n: GTot Type0\n=\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length dst == U32.v dst_len\n\nunfold\nlet header_decrypt_aux_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n (rs: header_decrypt_aux_result)\n (m' : HS.mem)\n: GTot Type0\n=\n header_decrypt_aux_pre a s k cid_len dst dst_len m /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n begin match rs, Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) with\n | HD_Failure, None ->\n B.modifies B.loc_none m m'\n | HD_Failure, _ -> False\n | _, Some res ->\n res.Spec.packet == B.as_seq m' dst /\\\n res.Spec.is_retry == (HD_Success_Retry? rs) /\\\n (if res.Spec.is_retry\n then B.modifies B.loc_none m m'\n else\n let len = res.Spec.pn_offset + res.Spec.pn_len + 1 in\n len <= B.length dst /\\\n B.modifies (CTR.footprint m s `B.loc_union` B.loc_buffer (B.gsub dst 0ul (U32.uint_to_t len))) m m'\n )\n | _ -> False\n end\n\n#push-options \"--z3rlimit 16\"\n\nlet header_decrypt_aux\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n: HST.Stack header_decrypt_aux_result\n (requires (fun m ->\n header_decrypt_aux_pre a s k cid_len dst dst_len m\n ))\n (ensures (fun m rs m' ->\n header_decrypt_aux_post a s k cid_len dst dst_len m rs m'\n ))\n= let m = HST.get () in\n if dst_len = 0ul\n then HD_Failure\n else\n let f = B.index dst 0ul in\n let short_or_long = BF.uint8.BF.get_bitfield f 7 8 in\n let isshort = short_or_long = 0uy in\n let retry_or_other = BF.uint8.BF.get_bitfield f 4 6 in\n let isretry = not isshort && (retry_or_other = 3uy) in\n if isretry\n then HD_Success_Retry\n else match ParseImpl.putative_pn_offset cid_len dst dst_len with\n | None -> HD_Failure\n | Some pn_offset ->\n if dst_len `U32.lt` (pn_offset `U32.add` 20ul)\n then HD_Failure\n else begin\n header_decrypt_aux_ct_secret_preserving_not_retry a s k cid_len isshort pn_offset dst;\n HD_Success_NotRetry\n end\n\n#pop-options", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x:\nLib.IntTypes.int_t Lib.IntTypes.U64 Lib.IntTypes.SEC\n {Lib.IntTypes.v x == QUIC.Spec.Crypto.max_cipher_length}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.mk_int", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "FStar.Pervasives.norm", "Prims.Cons", "FStar.Pervasives.norm_step", "FStar.Pervasives.delta", "FStar.Pervasives.iota", "FStar.Pervasives.zeta", "FStar.Pervasives.primops", "Prims.Nil", "Lib.IntTypes.range_t", "Prims.op_Subtraction", "Prims.pow2", "QUIC.Spec.Base.header_len_bound" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val max_cipher_length64:(x: Secret.uint64{Secret.v x == max_cipher_length})\nlet max_cipher_length64:(x: Secret.uint64{Secret.v x == max_cipher_length}) =", "completed_definiton": "Secret.mk_int (norm [delta; iota; zeta; primops] (pow2 32 - header_len_bound))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.index_pn_sizemask_ct_right", "original_source_type": "val index_pn_sizemask_ct_right (pn_len: nat{pn_len < 4}) (i: nat{i > pn_len /\\ i < 4})\n : Lemma (Seq.index (pn_sizemask_ct pn_len) i == 0uy)", "source_type": "val index_pn_sizemask_ct_right (pn_len: nat{pn_len < 4}) (i: nat{i > pn_len /\\ i < 4})\n : Lemma (Seq.index (pn_sizemask_ct pn_len) i == 0uy)", "source_definition": "let index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma\n (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\n= let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n pow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\n Lemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 127, "start_col": 2, "end_line": 132, "end_col": 74 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)\n\nlet pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "pn_len: Prims.nat{pn_len < 4} -> i: Prims.nat{i > pn_len /\\ i < 4}\n -> FStar.Pervasives.Lemma\n (ensures FStar.Seq.Base.index (QUIC.Impl.Header.pn_sizemask_ct pn_len) i == 0uy)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Prims.l_and", "Prims.op_GreaterThan", "QUIC.Spec.Lemmas.index_n_to_be_zero_right", "Prims.op_Subtraction", "Prims.pow2", "FStar.Mul.op_Star", "Prims.unit", "FStar.Math.Lemmas.pow2_plus", "Prims.op_Addition", "FStar.Math.Lemmas.pow2_lt_compat", "Prims.op_Multiply", "Prims.l_True", "Prims.squash", "Prims.eq2", "FStar.UInt8.t", "FStar.Seq.Base.index", "QUIC.Spec.Base.byte", "QUIC.Impl.Header.pn_sizemask_ct", "FStar.UInt8.__uint_to_t", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val index_pn_sizemask_ct_right (pn_len: nat{pn_len < 4}) (i: nat{i > pn_len /\\ i < 4})\n : Lemma (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\nlet index_pn_sizemask_ct_right (pn_len: nat{pn_len < 4}) (i: nat{i > pn_len /\\ i < 4})\n : Lemma (Seq.index (pn_sizemask_ct pn_len) i == 0uy) =", "completed_definiton": "let open FStar.Endianness in\nlet open FStar.Math.Lemmas in\nlet open FStar.Mul in\npow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\npow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\nLemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.header_encrypt_ct", "original_source_type": "val header_encrypt_ct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n : GTot packet", "source_type": "val header_encrypt_ct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n : GTot packet", "source_definition": "let header_encrypt_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: GTot packet\n= \n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 141, "start_col": 2, "end_line": 157, "end_col": 5 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)\n\nlet pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma\n (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\n= let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n pow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\n Lemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i\n\nlet header_encrypt_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: GTot packet", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n h: QUIC.Spec.Header.Base.header ->\n c: QUIC.Spec.Crypto.cbytes' (QUIC.Spec.Header.Base.is_retry h)\n -> Prims.GTot QUIC.Spec.Crypto.packet", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "QUIC.Spec.Header.Base.header", "QUIC.Spec.Crypto.cbytes'", "QUIC.Spec.Header.Base.is_retry", "Prims.bool", "FStar.Seq.Base.seq", "QUIC.Spec.Base.byte", "FStar.Seq.Properties.cons", "FStar.UInt8.uint_to_t", "FStar.Seq.Base.slice", "FStar.Seq.Base.length", "QUIC.Spec.Base.bytes", "QUIC.Spec.Lemmas.xor_inplace", "FStar.UInt.uint_t", "LowParse.BitFields.set_bitfield", "FStar.UInt8.n", "FStar.UInt8.v", "LowParse.BitFields.get_bitfield", "FStar.UInt.logxor", "FStar.Seq.Base.index", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.PUB", "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "QUIC.Spec.Header.Base.uu___is_MShort", "QUIC.Spec.Lemmas.and_inplace", "QUIC.Impl.Header.pn_sizemask_ct", "Lib.IntTypes.int_t", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.SEC", "QUIC.Spec.Header.block_of_sample", "QUIC.Secret.Seq.seq_hide", "Prims.op_Subtraction", "Prims.int", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "QUIC.Spec.Header.Base.pn_length", "Prims.op_LessThan", "Prims.eq2", "Prims.op_Addition", "Lib.IntTypes.v", "QUIC.Spec.Header.Base.header_len", "QUIC.Spec.Header.Parse.pn_offset", "QUIC.Spec.Crypto.packet", "FStar.Seq.Base.append", "QUIC.Spec.Header.Parse.format_header", "Prims.unit", "FStar.Pervasives.assert_norm", "QUIC.Spec.Crypto.max_cipher_length", "Prims.pow2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_encrypt_ct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n : GTot packet\nlet header_encrypt_ct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n : GTot packet =", "completed_definiton": "assert_norm (max_cipher_length < pow2 62);\nlet r = (Parse.format_header h) `Seq.append` c in\nif Spec.is_retry h\nthen r\nelse\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3 - pn_len) (19 - pn_len)) in\n let mask =\n Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample)\n in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' =\n BF.set_bitfield (U8.v f)\n 0\n protected_bits\n (BF.get_bitfield ((U8.v f) `FStar.UInt.logxor` (U8.v (Seq.index mask 0))) 0 protected_bits)\n in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.header_decrypt_aux_ct", "original_source_type": "val header_decrypt_aux_ct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet: packet)\n : GTot (option Spec.header_decrypt_aux_t)", "source_type": "val header_decrypt_aux_ct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet: packet)\n : GTot (option Spec.header_decrypt_aux_t)", "source_definition": "let header_decrypt_aux_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: GTot (option Spec.header_decrypt_aux_t)\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet;\n Spec.pn_offset = ();\n Spec.pn_len = ();\n })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = pn_len;\n })\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 458, "start_col": 2, "end_line": 499, "end_col": 11 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)\n\nlet pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma\n (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\n= let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n pow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\n Lemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i\n\nlet header_encrypt_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: GTot packet\n= \n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256\"\n\nlet header_encrypt_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: Lemma\n (header_encrypt_ct a hpk h c `Seq.equal` Spec.header_encrypt a hpk h c)\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then ()\n else begin\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Parse.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header { ~ (Spec.is_retry h) })\n (r: Seq.seq Secret.uint8 {\n Seq.length r >= Parse.pn_offset h + 20\n })\n: GTot (Seq.seq Secret.uint8)\n= \n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = (Seq.slice r (pn_offset + 4) (pn_offset + 20)) in\n let mask = (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide (pn_sizemask_ct pn_len)) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n let r = Lemmas.secret_xor_inplace r pnmask pn_offset in\n let r = Seq.cons f' (Seq.slice r 1 (Seq.length r)) in\n r\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 2\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n: Lemma\n (requires (\n (~ (Spec.is_retry h))\n ))\n (ensures (\n let r = Parse.format_header h `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide r))\n ))\n= header_encrypt_ct_correct a hpk h c;\n let fmt = Parse.format_header h in\n let len = Seq.length fmt in\n let pr = fmt `Seq.append` c in\n assert (Seq.length pr >= Parse.pn_offset h + 20);\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let psample = Seq.slice c (3 - pn_len) (19 - pn_len) in\n assert (c `Seq.equal` Seq.slice pr len (Seq.length pr));\n let pn_off = Parse.pn_offset h in\n assert (pn_off + pn_len + 1 == len);\n assert (c == Seq.slice pr (pn_off + pn_len + 1) (Seq.length pr));\n Seq.slice_slice pr (pn_off + pn_len + 1) (Seq.length pr) (3 - pn_len) (19 - pn_len);\n assert (psample == Seq.slice pr (pn_off + 4) (pn_off + 20));\n let r = Seq.seq_hide #Secret.U8 pr in\n let sample = Seq.slice r (pn_off + 4) (pn_off + 20) in\n assert (sample == Seq.seq_hide #Secret.U8 psample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n assert (mask == Seq.seq_hide pmask);\n let mask15 = Seq.slice mask 1 5 in\n let ppnszmask = pn_sizemask_ct pn_len in\n let pnszmask = Seq.seq_hide ppnszmask in\n let pnmask = Lemmas.secret_and_inplace mask15 pnszmask 0 in\n let pmask15 = Seq.slice pmask 1 5 in\n let ppnmask = Lemmas.and_inplace pmask15 ppnszmask 0 in\n Lemmas.secret_and_inplace_eq mask15 pnszmask 0;\n assert (pnmask == Seq.seq_hide #Secret.U8 ppnmask);\n let f = Seq.index r 0 in\n let pf : Secret.uint_t Secret.U8 Secret.PUB = Seq.index pr 0 in\n assert (f == Secret.hide #Secret.U8 #Secret.PUB pf);\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 (U32.v protected_bits) (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 (U32.v protected_bits))) in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n assert (U8.v pf' == Secret.v f');\n assert (f' == Secret.hide #Secret.U8 pf');\n let pr1 = Lemmas.xor_inplace pr ppnmask pn_off in\n let r1 = Lemmas.secret_xor_inplace r pnmask pn_off in\n Lemmas.secret_xor_inplace_eq r pnmask pn_off;\n assert (r1 == Seq.seq_hide #Secret.U8 pr1);\n let r2 = Seq.cons f' (Seq.slice r1 1 (Seq.length r1)) in\n let pr2 = Seq.cons pf' (Seq.slice pr1 1 (Seq.length pr1)) in\n Seq.cons_seq_hide #Secret.U8 pf' (Seq.slice pr1 1 (Seq.length pr1));\n assert (r2 == Seq.seq_hide #Secret.U8 pr2)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet pn_sizemask_ct_num\n (pn_len: PN.packet_number_length_t)\n: Tot (x: Secret.uint32 { pn_sizemask_ct (Secret.v pn_len - 1) == FStar.Endianness.n_to_be 4 (Secret.v x) })\n=\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` (Secret.v pn_len - 1)));\n [@inline_let]\n let n0 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 24) in\n [@inline_let]\n let n1 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 16) in\n [@inline_let]\n let n2 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 8) in\n [@inline_let]\n let n3 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 0) in\n let pn_len_1 = pn_len `Secret.sub` Secret.to_u32 1ul in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n0)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n1)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n2)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n3))\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet pn_sizemask (dst: B.buffer Secret.uint8) (pn_len: PN.packet_number_length_t): HST.Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\ B.length dst == 4)\n (ensures fun h0 _ h1 ->\n B.as_seq h1 dst `Seq.equal` Seq.seq_hide (pn_sizemask_ct (Secret.v pn_len - 1)) /\\\n B.(modifies (loc_buffer dst) h0 h1))\n= let x = pn_sizemask_ct_num pn_len in\n SecretBuffer.store32_be dst x\n\n#push-options \"--z3rlimit 512 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (h: Ghost.erased Spec.header)\n (is_short: bool)\n (pn_offset: U32.t)\n (pn_len: PN.packet_number_length_t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let fmt = (Parse.format_header h) in\n let hlen = Seq.length fmt in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n (~ (Spec.is_retry h)) /\\\n is_short == (Spec.MShort? h) /\\\n U32.v pn_offset == Parse.pn_offset h /\\\n pn_len == Parse.pn_length h /\\\n hlen + 19 <= B.length dst /\\\n Seq.slice (Seq.seq_reveal #Secret.U8 (B.as_seq m dst)) 0 hlen == fmt\n ))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n header_encrypt_ct_secret_preserving_not_retry_spec a (B.as_seq m k) h (B.as_seq m dst) == B.as_seq m' dst\n ))\n= assert (U32.v pn_offset + 20 <= B.length dst);\n let m0 = HST.get () in\n HST.push_frame ();\n let m01 = HST.get () in\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n B.loc_unused_in_not_unused_in_disjoint m01;\n let m02 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m02;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n let m03 = HST.get () in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (CTR.footprint m03 s == CTR.footprint m0 s);\n assert (B.loc_disjoint (B.loc_buffer mask `B.loc_union` B.loc_buffer pn_sm) (CTR.footprint m0 s `B.loc_union` B.loc_buffer k `B.loc_union` B.loc_buffer dst));\n let sample = B.sub dst (pn_offset `U32.add` 4ul) 16ul in\n let m1 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v pn_offset + 4) (U32.v pn_offset + 20)) in\n assert (B.as_seq m1 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m2 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m2 mask == Ghost.reveal gmask);\n pn_sizemask pn_sm pn_len;\n let m3 = HST.get () in\n assert (B.as_seq m3 mask == Ghost.reveal gmask);\n let gpn_sm = Ghost.hide (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len - 1))) in\n assert (B.as_seq m3 pn_sm == Ghost.reveal gpn_sm);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m4 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) gpn_sm 0) in\n assert (B.as_seq m4 pnmask == Ghost.reveal gpnmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask_0 = B.index mask 0ul in\n assert (mask_0 == Seq.index (B.as_seq m4 (B.gsub mask 0ul 1ul)) 0);\n assert (mask_0 == Seq.index gmask 0);\n let f_ = B.index dst 0ul in\n assert (f_ == Seq.index (B.as_seq m0 dst) 0);\n let f_logxor = f_ `Secret.logxor` mask_0 in\n let f_get_bf = Secret.get_bitfield f_logxor 0ul protected_bits in\n let f' = Secret.set_bitfield f_ 0ul protected_bits f_get_bf in\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n let m5 = HST.get () in\n let gr1 = Ghost.hide (Lemmas.secret_xor_inplace (B.as_seq m0 dst) gpnmask (U32.v pn_offset)) in\n assert (B.as_seq m5 dst == Ghost.reveal gr1);\n B.upd dst 0ul f' ;\n HST.pop_frame ();\n let m6 = HST.get () in\n assert (B.as_seq m6 dst `Seq.equal` (f' `Seq.cons` Seq.slice (Ghost.reveal gr1) 1 (B.length dst)))\n\n#restart-solver\n\nlet header_encrypt\n a s k dst h is_short is_retry public_len pn_len\n= if is_retry\n then ()\n else begin\n let m = HST.get () in\n let hpk = Ghost.hide (B.as_seq m k) in\n let fmt = Ghost.hide (Parse.format_header (G.reveal h)) in\n let cipher = Ghost.hide (Seq.slice (B.as_seq m dst) (Seq.length fmt) (B.length dst)) in\n assert (B.as_seq m dst `Seq.equal` (fmt `Seq.append` cipher));\n header_encrypt_ct_secret_preserving_not_retry_spec_correct a hpk h cipher;\n assert (U32.v public_len + 20 <= B.length dst);\n let post (cont: Seq.lseq Secret.uint8 (B.length dst)) (m1: HS.mem) : GTot Type0 =\n header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst)) == cont /\\\n CTR.invariant m1 s /\\\n CTR.footprint m1 s == CTR.footprint m s\n in\n SecretBuffer.with_whole_buffer_hide_weak_modifies'\n #unit\n dst\n m\n (CTR.footprint m s `B.loc_union` B.loc_buffer k)\n (CTR.footprint m s)\n true\n (fun _ cont m1 ->\n post cont m1\n )\n (fun _ bs ->\n header_encrypt_ct_secret_preserving_not_retry a s k h is_short public_len pn_len bs\n )\n ;\n let m' = HST.get () in\n assert (B.as_seq m' dst == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst))));\n assert (B.as_seq m' dst == Spec.header_encrypt a (B.as_seq m k) h cipher)\n end\n\n#pop-options\n\n\n(* A constant-time specification of header_decrypt_aux which does not test or truncate on pn_len *)\n\nlet header_decrypt_aux_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n cid_len: Prims.nat{cid_len <= 20} ->\n packet: QUIC.Spec.Crypto.packet\n -> Prims.GTot (FStar.Pervasives.Native.option QUIC.Spec.Header.header_decrypt_aux_t)", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "QUIC.Spec.Crypto.packet", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "FStar.Pervasives.Native.None", "QUIC.Spec.Header.header_decrypt_aux_t", "Prims.bool", "FStar.Pervasives.Native.Some", "QUIC.Spec.Header.Mkheader_decrypt_aux_t", "QUIC.Spec.Header.Parse.putative_pn_offset", "Prims.op_GreaterThan", "Prims.op_Addition", "QUIC.Spec.Base.bytes", "QUIC.Spec.Lemmas.xor_inplace", "QUIC.Spec.Lemmas.and_inplace", "FStar.Seq.Base.slice", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.PUB", "QUIC.Impl.Header.pn_sizemask_ct", "LowParse.BitFields.ubitfield", "Prims.op_Subtraction", "LowParse.BitFields.get_bitfield", "FStar.UInt8.n", "FStar.Seq.Base.seq", "FStar.Seq.Properties.cons", "FStar.UInt8.uint_to_t", "FStar.UInt.uint_t", "LowParse.BitFields.set_bitfield", "FStar.UInt8.v", "FStar.UInt.logxor", "FStar.Seq.Base.index", "Prims.l_and", "Lib.IntTypes.int_t", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.SEC", "QUIC.Spec.Header.block_of_sample", "QUIC.Secret.Seq.seq_hide", "FStar.Pervasives.Native.option", "Prims.op_AmpAmp", "Prims.op_Negation" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_decrypt_aux_ct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet: packet)\n : GTot (option Spec.header_decrypt_aux_t)\nlet header_decrypt_aux_ct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet: packet)\n : GTot (option Spec.header_decrypt_aux_t) =", "completed_definiton": "let open FStar.Math.Lemmas in\nif Seq.length packet = 0\nthen None\nelse\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some\n ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet;\n Spec.pn_offset = ();\n Spec.pn_len = ()\n })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else\n let sample = Seq.slice packet sample_offset (sample_offset + 16) in\n let mask =\n Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a)\n hpk\n (Seq.seq_hide sample))\n in\n let protected_bits = if is_short then 5 else 4 in\n let f' =\n BF.set_bitfield (U8.v f)\n 0\n protected_bits\n (BF.get_bitfield ((U8.v f) `FStar.UInt.logxor` (U8.v (Seq.index mask 0)))\n 0\n protected_bits)\n in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some\n ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = pn_len\n })", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.header_decrypt", "original_source_type": "val header_decrypt\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst:B.buffer U8.t)\n (dst_len: U32.t)\n: HST.Stack h_result\n (requires (fun m ->\n header_decrypt_pre a s k cid_len last dst dst_len m\n ))\n (ensures (fun m res m' ->\n header_decrypt_post a s k cid_len last dst dst_len m res m'\n ))", "source_type": "val header_decrypt\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst:B.buffer U8.t)\n (dst_len: U32.t)\n: HST.Stack h_result\n (requires (fun m ->\n header_decrypt_pre a s k cid_len last dst dst_len m\n ))\n (ensures (fun m res m' ->\n header_decrypt_post a s k cid_len last dst dst_len m res m'\n ))", "source_definition": "let header_decrypt\n a s k cid_len last dst dst_len\n=\n let m = HST.get () in\n assert (B.length dst == 0 ==> None? (Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst)));\n let aux = header_decrypt_aux a s k cid_len dst dst_len in\n let m1 = HST.get () in\n Classical.move_requires (Parse.parse_header_exists (U32.v cid_len) (Secret.v last)) (B.as_seq m1 dst);\n Classical.move_requires (Parse.parse_header_exists_recip (U32.v cid_len) (Secret.v last)) (B.as_seq m1 dst);\n match aux with\n | HD_Failure -> H_Failure\n | HD_Success_Retry ->\n header_decrypt_retry a s k cid_len last dst dst_len m\n | _ ->\n header_decrypt_not_retry a s k cid_len last dst dst_len m", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 1028, "start_col": 1, "end_line": 1040, "end_col": 61 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)\n\nlet pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma\n (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\n= let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n pow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\n Lemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i\n\nlet header_encrypt_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: GTot packet\n= \n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256\"\n\nlet header_encrypt_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: Lemma\n (header_encrypt_ct a hpk h c `Seq.equal` Spec.header_encrypt a hpk h c)\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then ()\n else begin\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Parse.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header { ~ (Spec.is_retry h) })\n (r: Seq.seq Secret.uint8 {\n Seq.length r >= Parse.pn_offset h + 20\n })\n: GTot (Seq.seq Secret.uint8)\n= \n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = (Seq.slice r (pn_offset + 4) (pn_offset + 20)) in\n let mask = (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide (pn_sizemask_ct pn_len)) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n let r = Lemmas.secret_xor_inplace r pnmask pn_offset in\n let r = Seq.cons f' (Seq.slice r 1 (Seq.length r)) in\n r\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 2\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n: Lemma\n (requires (\n (~ (Spec.is_retry h))\n ))\n (ensures (\n let r = Parse.format_header h `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide r))\n ))\n= header_encrypt_ct_correct a hpk h c;\n let fmt = Parse.format_header h in\n let len = Seq.length fmt in\n let pr = fmt `Seq.append` c in\n assert (Seq.length pr >= Parse.pn_offset h + 20);\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let psample = Seq.slice c (3 - pn_len) (19 - pn_len) in\n assert (c `Seq.equal` Seq.slice pr len (Seq.length pr));\n let pn_off = Parse.pn_offset h in\n assert (pn_off + pn_len + 1 == len);\n assert (c == Seq.slice pr (pn_off + pn_len + 1) (Seq.length pr));\n Seq.slice_slice pr (pn_off + pn_len + 1) (Seq.length pr) (3 - pn_len) (19 - pn_len);\n assert (psample == Seq.slice pr (pn_off + 4) (pn_off + 20));\n let r = Seq.seq_hide #Secret.U8 pr in\n let sample = Seq.slice r (pn_off + 4) (pn_off + 20) in\n assert (sample == Seq.seq_hide #Secret.U8 psample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n assert (mask == Seq.seq_hide pmask);\n let mask15 = Seq.slice mask 1 5 in\n let ppnszmask = pn_sizemask_ct pn_len in\n let pnszmask = Seq.seq_hide ppnszmask in\n let pnmask = Lemmas.secret_and_inplace mask15 pnszmask 0 in\n let pmask15 = Seq.slice pmask 1 5 in\n let ppnmask = Lemmas.and_inplace pmask15 ppnszmask 0 in\n Lemmas.secret_and_inplace_eq mask15 pnszmask 0;\n assert (pnmask == Seq.seq_hide #Secret.U8 ppnmask);\n let f = Seq.index r 0 in\n let pf : Secret.uint_t Secret.U8 Secret.PUB = Seq.index pr 0 in\n assert (f == Secret.hide #Secret.U8 #Secret.PUB pf);\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 (U32.v protected_bits) (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 (U32.v protected_bits))) in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n assert (U8.v pf' == Secret.v f');\n assert (f' == Secret.hide #Secret.U8 pf');\n let pr1 = Lemmas.xor_inplace pr ppnmask pn_off in\n let r1 = Lemmas.secret_xor_inplace r pnmask pn_off in\n Lemmas.secret_xor_inplace_eq r pnmask pn_off;\n assert (r1 == Seq.seq_hide #Secret.U8 pr1);\n let r2 = Seq.cons f' (Seq.slice r1 1 (Seq.length r1)) in\n let pr2 = Seq.cons pf' (Seq.slice pr1 1 (Seq.length pr1)) in\n Seq.cons_seq_hide #Secret.U8 pf' (Seq.slice pr1 1 (Seq.length pr1));\n assert (r2 == Seq.seq_hide #Secret.U8 pr2)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet pn_sizemask_ct_num\n (pn_len: PN.packet_number_length_t)\n: Tot (x: Secret.uint32 { pn_sizemask_ct (Secret.v pn_len - 1) == FStar.Endianness.n_to_be 4 (Secret.v x) })\n=\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` (Secret.v pn_len - 1)));\n [@inline_let]\n let n0 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 24) in\n [@inline_let]\n let n1 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 16) in\n [@inline_let]\n let n2 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 8) in\n [@inline_let]\n let n3 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 0) in\n let pn_len_1 = pn_len `Secret.sub` Secret.to_u32 1ul in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n0)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n1)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n2)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n3))\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet pn_sizemask (dst: B.buffer Secret.uint8) (pn_len: PN.packet_number_length_t): HST.Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\ B.length dst == 4)\n (ensures fun h0 _ h1 ->\n B.as_seq h1 dst `Seq.equal` Seq.seq_hide (pn_sizemask_ct (Secret.v pn_len - 1)) /\\\n B.(modifies (loc_buffer dst) h0 h1))\n= let x = pn_sizemask_ct_num pn_len in\n SecretBuffer.store32_be dst x\n\n#push-options \"--z3rlimit 512 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (h: Ghost.erased Spec.header)\n (is_short: bool)\n (pn_offset: U32.t)\n (pn_len: PN.packet_number_length_t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let fmt = (Parse.format_header h) in\n let hlen = Seq.length fmt in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n (~ (Spec.is_retry h)) /\\\n is_short == (Spec.MShort? h) /\\\n U32.v pn_offset == Parse.pn_offset h /\\\n pn_len == Parse.pn_length h /\\\n hlen + 19 <= B.length dst /\\\n Seq.slice (Seq.seq_reveal #Secret.U8 (B.as_seq m dst)) 0 hlen == fmt\n ))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n header_encrypt_ct_secret_preserving_not_retry_spec a (B.as_seq m k) h (B.as_seq m dst) == B.as_seq m' dst\n ))\n= assert (U32.v pn_offset + 20 <= B.length dst);\n let m0 = HST.get () in\n HST.push_frame ();\n let m01 = HST.get () in\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n B.loc_unused_in_not_unused_in_disjoint m01;\n let m02 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m02;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n let m03 = HST.get () in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (CTR.footprint m03 s == CTR.footprint m0 s);\n assert (B.loc_disjoint (B.loc_buffer mask `B.loc_union` B.loc_buffer pn_sm) (CTR.footprint m0 s `B.loc_union` B.loc_buffer k `B.loc_union` B.loc_buffer dst));\n let sample = B.sub dst (pn_offset `U32.add` 4ul) 16ul in\n let m1 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v pn_offset + 4) (U32.v pn_offset + 20)) in\n assert (B.as_seq m1 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m2 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m2 mask == Ghost.reveal gmask);\n pn_sizemask pn_sm pn_len;\n let m3 = HST.get () in\n assert (B.as_seq m3 mask == Ghost.reveal gmask);\n let gpn_sm = Ghost.hide (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len - 1))) in\n assert (B.as_seq m3 pn_sm == Ghost.reveal gpn_sm);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m4 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) gpn_sm 0) in\n assert (B.as_seq m4 pnmask == Ghost.reveal gpnmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask_0 = B.index mask 0ul in\n assert (mask_0 == Seq.index (B.as_seq m4 (B.gsub mask 0ul 1ul)) 0);\n assert (mask_0 == Seq.index gmask 0);\n let f_ = B.index dst 0ul in\n assert (f_ == Seq.index (B.as_seq m0 dst) 0);\n let f_logxor = f_ `Secret.logxor` mask_0 in\n let f_get_bf = Secret.get_bitfield f_logxor 0ul protected_bits in\n let f' = Secret.set_bitfield f_ 0ul protected_bits f_get_bf in\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n let m5 = HST.get () in\n let gr1 = Ghost.hide (Lemmas.secret_xor_inplace (B.as_seq m0 dst) gpnmask (U32.v pn_offset)) in\n assert (B.as_seq m5 dst == Ghost.reveal gr1);\n B.upd dst 0ul f' ;\n HST.pop_frame ();\n let m6 = HST.get () in\n assert (B.as_seq m6 dst `Seq.equal` (f' `Seq.cons` Seq.slice (Ghost.reveal gr1) 1 (B.length dst)))\n\n#restart-solver\n\nlet header_encrypt\n a s k dst h is_short is_retry public_len pn_len\n= if is_retry\n then ()\n else begin\n let m = HST.get () in\n let hpk = Ghost.hide (B.as_seq m k) in\n let fmt = Ghost.hide (Parse.format_header (G.reveal h)) in\n let cipher = Ghost.hide (Seq.slice (B.as_seq m dst) (Seq.length fmt) (B.length dst)) in\n assert (B.as_seq m dst `Seq.equal` (fmt `Seq.append` cipher));\n header_encrypt_ct_secret_preserving_not_retry_spec_correct a hpk h cipher;\n assert (U32.v public_len + 20 <= B.length dst);\n let post (cont: Seq.lseq Secret.uint8 (B.length dst)) (m1: HS.mem) : GTot Type0 =\n header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst)) == cont /\\\n CTR.invariant m1 s /\\\n CTR.footprint m1 s == CTR.footprint m s\n in\n SecretBuffer.with_whole_buffer_hide_weak_modifies'\n #unit\n dst\n m\n (CTR.footprint m s `B.loc_union` B.loc_buffer k)\n (CTR.footprint m s)\n true\n (fun _ cont m1 ->\n post cont m1\n )\n (fun _ bs ->\n header_encrypt_ct_secret_preserving_not_retry a s k h is_short public_len pn_len bs\n )\n ;\n let m' = HST.get () in\n assert (B.as_seq m' dst == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst))));\n assert (B.as_seq m' dst == Spec.header_encrypt a (B.as_seq m k) h cipher)\n end\n\n#pop-options\n\n\n(* A constant-time specification of header_decrypt_aux which does not test or truncate on pn_len *)\n\nlet header_decrypt_aux_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: GTot (option Spec.header_decrypt_aux_t)\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet;\n Spec.pn_offset = ();\n Spec.pn_len = ();\n })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = pn_len;\n })\n end\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats\"\n\n#restart-solver\n\nlet header_decrypt_aux_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len packet == Spec.header_decrypt_aux a hpk cid_len packet)\n= \n let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then ()\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then ()\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> ()\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then ()\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal #Secret.U8 (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide #Secret.U8 sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n let r = packet' in\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#restart-solver\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })\n : GTot (Spec.header_decrypt_aux_t)\n=\n let f = Seq.index packet 0 in\n let sample_offset = pn_offset + 4 in\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` (Seq.index mask 0)) 0ul protected_bits) in\n let packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len))) 0 in\n let packet'' = Lemmas.secret_xor_inplace packet' pnmask pn_offset in\n {\n Spec.is_short = is_short;\n Spec.is_retry = false;\n Spec.packet = Seq.seq_reveal #Secret.U8 packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = Secret.v pn_len;\n }\n\n#push-options \"--z3rlimit 32\"\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet) == Some (header_decrypt_aux_ct_secret_preserving_not_retry_spec a hpk cid_len packet is_short pn_offset))\n= assert (Some? (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet)));\n let ppacket = Seq.seq_reveal packet in\n let f = Seq.index packet 0 in\n let pf = Seq.index ppacket 0 in\n assert (pf == Secret.reveal f);\n let is_short = (BF.get_bitfield #8 (Secret.v f) 7 8 = 0) in\n let Some pn_offset = Parse.putative_pn_offset cid_len ppacket in\n let sample_offset = pn_offset + 4 in\n let psample = Seq.slice ppacket sample_offset (sample_offset + 16) in\n let sample = Seq.slice packet sample_offset (sample_offset + 16) in\n assert (psample == Seq.seq_reveal sample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n let protected_bits = if is_short then 5 else 4 in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 protected_bits (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 protected_bits)) in\n let f' = Secret.set_bitfield f 0ul (U32.uint_to_t protected_bits) (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul (U32.uint_to_t protected_bits)) in\n assert (pf' == Secret.reveal f');\n let packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\n let ppacket' = Seq.cons pf' (Seq.slice ppacket 1 (Seq.length ppacket)) in\n assert (ppacket' `Seq.equal` Seq.seq_reveal packet');\n let ppn_len = BF.get_bitfield (U8.v pf') 0 2 in\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n assert (Secret.v pn_len == ppn_len);\n let ppnmask_ct = Lemmas.and_inplace (Seq.slice pmask 1 5) (pn_sizemask_ct ppn_len) 0 in\n let pnmask_ct = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct ppn_len)) 0 in\n Lemmas.secret_and_inplace_eq (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct ppn_len)) 0;\n assert (ppnmask_ct == Seq.seq_reveal pnmask_ct);\n Lemmas.secret_xor_inplace_eq packet' pnmask_ct pn_offset\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\ninline_for_extraction\nlet header_decrypt_aux_ct_secret_preserving_not_retry'\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n 0 < l /\\ l < pow2 32 /\\ (\n let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\ (\n match Parse.putative_pn_offset (U32.v cid_len) (Seq.seq_reveal (B.as_seq m dst)) with\n | None -> False\n | Some pn_offset' ->\n U32.v pn_offset == pn_offset' /\\\n pn_offset' + 20 <= l\n ))))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) is_short (U32.v pn_offset)).Spec.packet == Seq.seq_reveal (B.as_seq m' dst)\n ))\n= let m0 = HST.get () in\n let f = B.index dst 0ul in\n let sample_offset = pn_offset `U32.add` 4ul in\n let sample = B.sub dst sample_offset 16ul in\n HST.push_frame ();\n let m1 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m1;\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer dst `B.loc_union` CTR.footprint m0 s));\n let m2 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m2;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (B.loc_disjoint (B.loc_buffer pn_sm) (B.loc_buffer dst `B.loc_union` CTR.footprint m0 s));\n let m3 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v sample_offset) (U32.v sample_offset + 16)) in\n assert (B.as_seq m3 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m4 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m4 mask == Ghost.reveal gmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask0 = B.index mask 0ul in\n let f_logxor = f `Secret.logxor` mask0 in\n let f_bf = Secret.get_bitfield (f_logxor) 0ul protected_bits in\n let f' = Secret.set_bitfield f 0ul protected_bits f_bf in\n B.upd dst 0ul f';\n let m5 = HST.get () in\n let gpacket' = Ghost.hide (Seq.cons f' (Seq.slice (B.as_seq m0 dst) 1 (B.length dst))) in\n assert (Ghost.reveal gpacket' `Seq.equal` B.as_seq m5 dst);\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n pn_sizemask pn_sm (Secret.cast_up Secret.U32 pn_len `Secret.add` Secret.hide 1ul);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m6 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len))) 0) in\n assert (Ghost.reveal gpnmask == B.as_seq m6 pnmask);\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n HST.pop_frame ();\n let m7 = HST.get () in\n assert (B.as_seq m7 dst == Lemmas.secret_xor_inplace gpacket' gpnmask (U32.v pn_offset))\n\n#pop-options\n\n#push-options \"--z3rlimit 32 --query_stats\"\n\n#restart-solver\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer U8.t)\n: HST.Stack unit\n (requires (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n 0 < l /\\ l < pow2 32 /\\ (\n let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\ (\n match Parse.putative_pn_offset (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some pn_offset' ->\n U32.v pn_offset == pn_offset' /\\\n pn_offset' + 20 <= l\n ))))\n (ensures (fun m _ m' ->\n match Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some res ->\n let len_mod = U32.v pn_offset + res.Spec.pn_len + 1 in\n res.Spec.pn_offset == U32.v pn_offset /\\\n len_mod <= B.length dst /\\\n B.modifies (B.loc_buffer (B.gsub dst 0ul (U32.uint_to_t len_mod)) `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n res.Spec.packet == B.as_seq m' dst\n ))\n=\n let m = HST.get () in\n SecretBuffer.with_whole_buffer_hide_weak_modifies\n #unit\n dst\n m\n (CTR.footprint m s `B.loc_union` B.loc_buffer k)\n (CTR.footprint m s)\n true\n (fun _ cont m' ->\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a (B.as_seq m k) (U32.v cid_len) (Seq.seq_hide #Secret.U8 (B.as_seq m dst)) is_short (U32.v pn_offset)).Spec.packet == cont /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s\n )\n (fun _ bs ->\n header_decrypt_aux_ct_secret_preserving_not_retry' a s k cid_len is_short pn_offset bs\n );\n let m' = HST.get () in\n header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct a (B.as_seq m k) (U32.v cid_len) (Seq.seq_hide #Secret.U8 (B.as_seq m dst)) is_short (U32.v pn_offset);\n header_decrypt_aux_ct_correct a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst);\n Spec.header_decrypt_aux_post a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst);\n let len_mod = Ghost.hide (U32.uint_to_t (U32.v pn_offset + (Some?.v (Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst))).Spec.pn_len + 1)) in\n B.modifies_loc_buffer_from_to_intro dst 0ul len_mod (CTR.footprint m s) m m'\n\n#pop-options\n\ntype header_decrypt_aux_result =\n | HD_Failure\n | HD_Success_Retry\n | HD_Success_NotRetry\n\nunfold\nlet header_decrypt_aux_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n: GTot Type0\n=\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length dst == U32.v dst_len\n\nunfold\nlet header_decrypt_aux_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n (rs: header_decrypt_aux_result)\n (m' : HS.mem)\n: GTot Type0\n=\n header_decrypt_aux_pre a s k cid_len dst dst_len m /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n begin match rs, Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) with\n | HD_Failure, None ->\n B.modifies B.loc_none m m'\n | HD_Failure, _ -> False\n | _, Some res ->\n res.Spec.packet == B.as_seq m' dst /\\\n res.Spec.is_retry == (HD_Success_Retry? rs) /\\\n (if res.Spec.is_retry\n then B.modifies B.loc_none m m'\n else\n let len = res.Spec.pn_offset + res.Spec.pn_len + 1 in\n len <= B.length dst /\\\n B.modifies (CTR.footprint m s `B.loc_union` B.loc_buffer (B.gsub dst 0ul (U32.uint_to_t len))) m m'\n )\n | _ -> False\n end\n\n#push-options \"--z3rlimit 16\"\n\nlet header_decrypt_aux\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n: HST.Stack header_decrypt_aux_result\n (requires (fun m ->\n header_decrypt_aux_pre a s k cid_len dst dst_len m\n ))\n (ensures (fun m rs m' ->\n header_decrypt_aux_post a s k cid_len dst dst_len m rs m'\n ))\n= let m = HST.get () in\n if dst_len = 0ul\n then HD_Failure\n else\n let f = B.index dst 0ul in\n let short_or_long = BF.uint8.BF.get_bitfield f 7 8 in\n let isshort = short_or_long = 0uy in\n let retry_or_other = BF.uint8.BF.get_bitfield f 4 6 in\n let isretry = not isshort && (retry_or_other = 3uy) in\n if isretry\n then HD_Success_Retry\n else match ParseImpl.putative_pn_offset cid_len dst dst_len with\n | None -> HD_Failure\n | Some pn_offset ->\n if dst_len `U32.lt` (pn_offset `U32.add` 20ul)\n then HD_Failure\n else begin\n header_decrypt_aux_ct_secret_preserving_not_retry a s k cid_len isshort pn_offset dst;\n HD_Success_NotRetry\n end\n\n#pop-options\n\nlet max_cipher_length64 : (x: Secret.uint64 { Secret.v x == max_cipher_length }) =\n Secret.mk_int (norm [delta; iota; zeta; primops] (pow2 32 - header_len_bound))\n\nlet secret_max_correct\n (x y: Secret.uint64)\n: Lemma\n (Secret.v (Secret.max64 x y) == Spec.max (Secret.v x) (Secret.v y))\n [SMTPat (Secret.max64 x y)]\n= ()\n\nlet secret_min_correct\n (x y: Secret.uint64)\n: Lemma\n (Secret.v (Secret.min64 x y) == Spec.min (Secret.v x) (Secret.v y))\n [SMTPat (Secret.min64 x y)]\n= ()\n\n#push-options \"--z3rlimit 2048 --query_stats --ifuel 3 --fuel 2 --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\ninline_for_extraction\nlet header_decrypt_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst:B.buffer U8.t)\n (dst_len: U32.t)\n (m0: HS.mem)\n: HST.Stack h_result\n (requires (fun m ->\n header_decrypt_pre a s k cid_len last dst dst_len m0 /\\\n header_decrypt_aux_post a s k cid_len dst dst_len m0 HD_Success_Retry m\n ))\n (ensures (fun _ rs m' ->\n header_decrypt_post a s k cid_len last dst dst_len m0 rs m'\n ))\n= \n let m1 = HST.get () in\n Classical.move_requires (Parse.parse_header_exists (U32.v cid_len) (Secret.v last)) (B.as_seq m1 dst);\n Classical.move_requires (Parse.parse_header_exists_recip (U32.v cid_len) (Secret.v last)) (B.as_seq m1 dst);\n (* In the Retry case, header_decrypt_aux did nothing, so we need\n to check here that the header can be parsed. *)\n Spec.header_decrypt_aux_post a (B.as_seq m0 k) (U32.v cid_len) (B.as_seq m0 dst);\n if None? (ParseImpl.putative_pn_offset cid_len dst dst_len)\n then H_Failure\n else begin\n Spec.header_decrypt_aux_post_parse a (B.as_seq m0 k) (U32.v cid_len) (Secret.v last) (B.as_seq m0 dst);\n Parse.lemma_header_parsing_post (U32.v cid_len) (Secret.v last) (B.as_seq m1 dst);\n let (h, pn) = ParseImpl.read_header dst dst_len cid_len last in\n let m2 = HST.get () in\n ParseImpl.header_len_correct h m2 pn;\n H_Success h pn (Secret.to_u32 0ul)\n end\n\n#restart-solver\n\ninline_for_extraction\nlet header_decrypt_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst:B.buffer U8.t)\n (dst_len: U32.t)\n (m0: HS.mem)\n: HST.Stack h_result\n (requires (fun m ->\n header_decrypt_pre a s k cid_len last dst dst_len m0 /\\\n header_decrypt_aux_post a s k cid_len dst dst_len m0 HD_Success_NotRetry m\n ))\n (ensures (fun _ rs m' ->\n header_decrypt_post a s k cid_len last dst dst_len m0 rs m'\n ))\n= \n let m1 = HST.get () in\n Classical.move_requires (Parse.parse_header_exists (U32.v cid_len) (Secret.v last)) (B.as_seq m1 dst);\n Classical.move_requires (Parse.parse_header_exists_recip (U32.v cid_len) (Secret.v last)) (B.as_seq m1 dst);\n (* In other cases, header_decrypt_aux already checked\n that the header can be parsed. *)\n Spec.header_decrypt_aux_post a (B.as_seq m0 k) (U32.v cid_len) (B.as_seq m0 dst);\n Spec.header_decrypt_aux_post_parse a (B.as_seq m0 k) (U32.v cid_len) (Secret.v last) (B.as_seq m0 dst);\n Parse.lemma_header_parsing_post (U32.v cid_len) (Secret.v last) (B.as_seq m1 dst);\n let (h, pn) = ParseImpl.read_header dst dst_len cid_len last in\n let m2 = HST.get () in\n ParseImpl.header_len_correct h m2 pn;\n let hlen = header_len h in\n assert (Seq.length (Parse.format_header (g_header h m2 pn)) == Secret.v hlen);\n assert (Secret.v hlen <= B.length dst);\n let rlen = Secret.hide dst_len `Secret.usub` hlen in\n let hlen64 = Secret.cast_up Secret.U64 hlen in\n let rlen64 = Secret.cast_up Secret.U64 rlen in\n let clen64 = if has_payload_length h then payload_length h else rlen64 in\n let clen64_checked : Secret.uint64 =\n Secret.max64 (Secret.min64 (Secret.min64 clen64 rlen64) (max_cipher_length64 `Secret.sub` Secret.hide 1uL)) (Secret.hide 16uL)\n in\n assert_norm (16 < max_cipher_length);\n assert (Secret.v clen64_checked < max_cipher_length);\n assert (Secret.v clen64_checked <= Secret.v rlen);\n assert_norm (max_cipher_length < pow2 32);\n let clen32 = Secret.cast_down Secret.U32 clen64_checked in\n let bh = Ghost.hide (B.gsub dst 0ul (Secret.reveal hlen)) in\n let brem = Ghost.hide (B.gsub dst (Secret.reveal hlen) (Secret.reveal rlen)) in\n let bc = Ghost.hide (B.gsub brem 0ul (Secret.reveal clen32)) in\n let b3 = Ghost.hide (B.gsub brem (Secret.reveal clen32) (Secret.reveal rlen `U32.sub` Secret.reveal clen32)) in\n assert (B.as_seq m2 bh == B.as_seq m1 bh);\n assert (B.as_seq m1 bh == Parse.format_header (g_header h m2 pn));\n assert (B.disjoint bh brem);\n assert (B.as_seq m2 brem == B.as_seq m1 brem);\n assert (B.as_seq m1 brem == B.as_seq m0 brem);\n assert (B.as_seq m2 bc == B.as_seq m1 bc);\n assert (B.as_seq m1 bc == B.as_seq m0 bc);\n assert (B.as_seq m2 b3 == B.as_seq m1 b3);\n assert (B.as_seq m1 b3 == B.as_seq m0 b3);\n assert (B.as_seq m2 dst `Seq.equal` (B.as_seq m2 bh `Seq.append` B.as_seq m2 bc `Seq.append` B.as_seq m2 b3));\n H_Success h pn clen32\n\n#restart-solver\n\nlet header_decrypt", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 3, "max_ifuel": 3, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 2048, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n s: NotEverCrypt.CTR.state (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n k: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n cid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n dst: LowStar.Buffer.buffer FStar.UInt8.t ->\n dst_len: FStar.UInt32.t\n -> FStar.HyperStack.ST.Stack QUIC.Impl.Header.h_result", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "NotEverCrypt.CTR.state", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "FStar.UInt8.t", "FStar.UInt32.t", "QUIC.Impl.Header.H_Failure", "QUIC.Impl.Header.h_result", "QUIC.Impl.Header.header_decrypt_retry", "QUIC.Impl.Header.header_decrypt_aux_result", "QUIC.Impl.Header.header_decrypt_not_retry", "Prims.unit", "FStar.Classical.move_requires", "QUIC.Spec.Base.bytes", "Prims.b2t", "QUIC.Spec.Header.Parse.uu___is_H_Success", "QUIC.Spec.Header.Parse.parse_header", "FStar.UInt32.v", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "FStar.Pervasives.Native.uu___is_Some", "Prims.nat", "QUIC.Spec.Header.Parse.putative_pn_offset", "QUIC.Spec.Header.Parse.parse_header_exists_recip", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Buffer.trivial_preorder", "Prims.l_False", "Prims.l_imp", "Prims.l_not", "QUIC.Spec.Header.Parse.packet_is_retry", "Prims.op_LessThanOrEqual", "Prims.op_Addition", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "QUIC.Spec.Header.Parse.parse_header_exists", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "QUIC.Impl.Header.header_decrypt_aux", "Prims._assert", "Prims.eq2", "Prims.int", "LowStar.Monotonic.Buffer.length", "FStar.Pervasives.Native.uu___is_None", "QUIC.Spec.Header.header_decrypt_aux_t", "QUIC.Spec.Header.header_decrypt_aux" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_decrypt\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst:B.buffer U8.t)\n (dst_len: U32.t)\n: HST.Stack h_result\n (requires (fun m ->\n header_decrypt_pre a s k cid_len last dst dst_len m\n ))\n (ensures (fun m res m' ->\n header_decrypt_post a s k cid_len last dst dst_len m res m'\n ))\nlet header_decrypt a s k cid_len last dst dst_len =", "completed_definiton": "let m = HST.get () in\nassert (B.length dst == 0 ==>\n None? (Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst)));\nlet aux = header_decrypt_aux a s k cid_len dst dst_len in\nlet m1 = HST.get () in\nClassical.move_requires (Parse.parse_header_exists (U32.v cid_len) (Secret.v last))\n (B.as_seq m1 dst);\nClassical.move_requires (Parse.parse_header_exists_recip (U32.v cid_len) (Secret.v last))\n (B.as_seq m1 dst);\nmatch aux with\n| HD_Failure -> H_Failure\n| HD_Success_Retry -> header_decrypt_retry a s k cid_len last dst dst_len m\n| _ -> header_decrypt_not_retry a s k cid_len last dst dst_len m", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.header_decrypt_retry", "original_source_type": "val header_decrypt_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m0: HS.mem)\n : HST.Stack h_result\n (requires\n (fun m ->\n header_decrypt_pre a s k cid_len last dst dst_len m0 /\\\n header_decrypt_aux_post a s k cid_len dst dst_len m0 HD_Success_Retry m))\n (ensures (fun _ rs m' -> header_decrypt_post a s k cid_len last dst dst_len m0 rs m'))", "source_type": "val header_decrypt_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m0: HS.mem)\n : HST.Stack h_result\n (requires\n (fun m ->\n header_decrypt_pre a s k cid_len last dst dst_len m0 /\\\n header_decrypt_aux_post a s k cid_len dst dst_len m0 HD_Success_Retry m))\n (ensures (fun _ rs m' -> header_decrypt_post a s k cid_len last dst dst_len m0 rs m'))", "source_definition": "let header_decrypt_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst:B.buffer U8.t)\n (dst_len: U32.t)\n (m0: HS.mem)\n: HST.Stack h_result\n (requires (fun m ->\n header_decrypt_pre a s k cid_len last dst dst_len m0 /\\\n header_decrypt_aux_post a s k cid_len dst dst_len m0 HD_Success_Retry m\n ))\n (ensures (fun _ rs m' ->\n header_decrypt_post a s k cid_len last dst dst_len m0 rs m'\n ))\n= \n let m1 = HST.get () in\n Classical.move_requires (Parse.parse_header_exists (U32.v cid_len) (Secret.v last)) (B.as_seq m1 dst);\n Classical.move_requires (Parse.parse_header_exists_recip (U32.v cid_len) (Secret.v last)) (B.as_seq m1 dst);\n (* In the Retry case, header_decrypt_aux did nothing, so we need\n to check here that the header can be parsed. *)\n Spec.header_decrypt_aux_post a (B.as_seq m0 k) (U32.v cid_len) (B.as_seq m0 dst);\n if None? (ParseImpl.putative_pn_offset cid_len dst dst_len)\n then H_Failure\n else begin\n Spec.header_decrypt_aux_post_parse a (B.as_seq m0 k) (U32.v cid_len) (Secret.v last) (B.as_seq m0 dst);\n Parse.lemma_header_parsing_post (U32.v cid_len) (Secret.v last) (B.as_seq m1 dst);\n let (h, pn) = ParseImpl.read_header dst dst_len cid_len last in\n let m2 = HST.get () in\n ParseImpl.header_len_correct h m2 pn;\n H_Success h pn (Secret.to_u32 0ul)\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 943, "start_col": 1, "end_line": 959, "end_col": 7 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)\n\nlet pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma\n (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\n= let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n pow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\n Lemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i\n\nlet header_encrypt_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: GTot packet\n= \n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256\"\n\nlet header_encrypt_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: Lemma\n (header_encrypt_ct a hpk h c `Seq.equal` Spec.header_encrypt a hpk h c)\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then ()\n else begin\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Parse.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header { ~ (Spec.is_retry h) })\n (r: Seq.seq Secret.uint8 {\n Seq.length r >= Parse.pn_offset h + 20\n })\n: GTot (Seq.seq Secret.uint8)\n= \n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = (Seq.slice r (pn_offset + 4) (pn_offset + 20)) in\n let mask = (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide (pn_sizemask_ct pn_len)) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n let r = Lemmas.secret_xor_inplace r pnmask pn_offset in\n let r = Seq.cons f' (Seq.slice r 1 (Seq.length r)) in\n r\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 2\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n: Lemma\n (requires (\n (~ (Spec.is_retry h))\n ))\n (ensures (\n let r = Parse.format_header h `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide r))\n ))\n= header_encrypt_ct_correct a hpk h c;\n let fmt = Parse.format_header h in\n let len = Seq.length fmt in\n let pr = fmt `Seq.append` c in\n assert (Seq.length pr >= Parse.pn_offset h + 20);\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let psample = Seq.slice c (3 - pn_len) (19 - pn_len) in\n assert (c `Seq.equal` Seq.slice pr len (Seq.length pr));\n let pn_off = Parse.pn_offset h in\n assert (pn_off + pn_len + 1 == len);\n assert (c == Seq.slice pr (pn_off + pn_len + 1) (Seq.length pr));\n Seq.slice_slice pr (pn_off + pn_len + 1) (Seq.length pr) (3 - pn_len) (19 - pn_len);\n assert (psample == Seq.slice pr (pn_off + 4) (pn_off + 20));\n let r = Seq.seq_hide #Secret.U8 pr in\n let sample = Seq.slice r (pn_off + 4) (pn_off + 20) in\n assert (sample == Seq.seq_hide #Secret.U8 psample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n assert (mask == Seq.seq_hide pmask);\n let mask15 = Seq.slice mask 1 5 in\n let ppnszmask = pn_sizemask_ct pn_len in\n let pnszmask = Seq.seq_hide ppnszmask in\n let pnmask = Lemmas.secret_and_inplace mask15 pnszmask 0 in\n let pmask15 = Seq.slice pmask 1 5 in\n let ppnmask = Lemmas.and_inplace pmask15 ppnszmask 0 in\n Lemmas.secret_and_inplace_eq mask15 pnszmask 0;\n assert (pnmask == Seq.seq_hide #Secret.U8 ppnmask);\n let f = Seq.index r 0 in\n let pf : Secret.uint_t Secret.U8 Secret.PUB = Seq.index pr 0 in\n assert (f == Secret.hide #Secret.U8 #Secret.PUB pf);\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 (U32.v protected_bits) (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 (U32.v protected_bits))) in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n assert (U8.v pf' == Secret.v f');\n assert (f' == Secret.hide #Secret.U8 pf');\n let pr1 = Lemmas.xor_inplace pr ppnmask pn_off in\n let r1 = Lemmas.secret_xor_inplace r pnmask pn_off in\n Lemmas.secret_xor_inplace_eq r pnmask pn_off;\n assert (r1 == Seq.seq_hide #Secret.U8 pr1);\n let r2 = Seq.cons f' (Seq.slice r1 1 (Seq.length r1)) in\n let pr2 = Seq.cons pf' (Seq.slice pr1 1 (Seq.length pr1)) in\n Seq.cons_seq_hide #Secret.U8 pf' (Seq.slice pr1 1 (Seq.length pr1));\n assert (r2 == Seq.seq_hide #Secret.U8 pr2)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet pn_sizemask_ct_num\n (pn_len: PN.packet_number_length_t)\n: Tot (x: Secret.uint32 { pn_sizemask_ct (Secret.v pn_len - 1) == FStar.Endianness.n_to_be 4 (Secret.v x) })\n=\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` (Secret.v pn_len - 1)));\n [@inline_let]\n let n0 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 24) in\n [@inline_let]\n let n1 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 16) in\n [@inline_let]\n let n2 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 8) in\n [@inline_let]\n let n3 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 0) in\n let pn_len_1 = pn_len `Secret.sub` Secret.to_u32 1ul in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n0)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n1)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n2)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n3))\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet pn_sizemask (dst: B.buffer Secret.uint8) (pn_len: PN.packet_number_length_t): HST.Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\ B.length dst == 4)\n (ensures fun h0 _ h1 ->\n B.as_seq h1 dst `Seq.equal` Seq.seq_hide (pn_sizemask_ct (Secret.v pn_len - 1)) /\\\n B.(modifies (loc_buffer dst) h0 h1))\n= let x = pn_sizemask_ct_num pn_len in\n SecretBuffer.store32_be dst x\n\n#push-options \"--z3rlimit 512 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (h: Ghost.erased Spec.header)\n (is_short: bool)\n (pn_offset: U32.t)\n (pn_len: PN.packet_number_length_t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let fmt = (Parse.format_header h) in\n let hlen = Seq.length fmt in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n (~ (Spec.is_retry h)) /\\\n is_short == (Spec.MShort? h) /\\\n U32.v pn_offset == Parse.pn_offset h /\\\n pn_len == Parse.pn_length h /\\\n hlen + 19 <= B.length dst /\\\n Seq.slice (Seq.seq_reveal #Secret.U8 (B.as_seq m dst)) 0 hlen == fmt\n ))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n header_encrypt_ct_secret_preserving_not_retry_spec a (B.as_seq m k) h (B.as_seq m dst) == B.as_seq m' dst\n ))\n= assert (U32.v pn_offset + 20 <= B.length dst);\n let m0 = HST.get () in\n HST.push_frame ();\n let m01 = HST.get () in\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n B.loc_unused_in_not_unused_in_disjoint m01;\n let m02 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m02;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n let m03 = HST.get () in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (CTR.footprint m03 s == CTR.footprint m0 s);\n assert (B.loc_disjoint (B.loc_buffer mask `B.loc_union` B.loc_buffer pn_sm) (CTR.footprint m0 s `B.loc_union` B.loc_buffer k `B.loc_union` B.loc_buffer dst));\n let sample = B.sub dst (pn_offset `U32.add` 4ul) 16ul in\n let m1 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v pn_offset + 4) (U32.v pn_offset + 20)) in\n assert (B.as_seq m1 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m2 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m2 mask == Ghost.reveal gmask);\n pn_sizemask pn_sm pn_len;\n let m3 = HST.get () in\n assert (B.as_seq m3 mask == Ghost.reveal gmask);\n let gpn_sm = Ghost.hide (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len - 1))) in\n assert (B.as_seq m3 pn_sm == Ghost.reveal gpn_sm);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m4 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) gpn_sm 0) in\n assert (B.as_seq m4 pnmask == Ghost.reveal gpnmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask_0 = B.index mask 0ul in\n assert (mask_0 == Seq.index (B.as_seq m4 (B.gsub mask 0ul 1ul)) 0);\n assert (mask_0 == Seq.index gmask 0);\n let f_ = B.index dst 0ul in\n assert (f_ == Seq.index (B.as_seq m0 dst) 0);\n let f_logxor = f_ `Secret.logxor` mask_0 in\n let f_get_bf = Secret.get_bitfield f_logxor 0ul protected_bits in\n let f' = Secret.set_bitfield f_ 0ul protected_bits f_get_bf in\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n let m5 = HST.get () in\n let gr1 = Ghost.hide (Lemmas.secret_xor_inplace (B.as_seq m0 dst) gpnmask (U32.v pn_offset)) in\n assert (B.as_seq m5 dst == Ghost.reveal gr1);\n B.upd dst 0ul f' ;\n HST.pop_frame ();\n let m6 = HST.get () in\n assert (B.as_seq m6 dst `Seq.equal` (f' `Seq.cons` Seq.slice (Ghost.reveal gr1) 1 (B.length dst)))\n\n#restart-solver\n\nlet header_encrypt\n a s k dst h is_short is_retry public_len pn_len\n= if is_retry\n then ()\n else begin\n let m = HST.get () in\n let hpk = Ghost.hide (B.as_seq m k) in\n let fmt = Ghost.hide (Parse.format_header (G.reveal h)) in\n let cipher = Ghost.hide (Seq.slice (B.as_seq m dst) (Seq.length fmt) (B.length dst)) in\n assert (B.as_seq m dst `Seq.equal` (fmt `Seq.append` cipher));\n header_encrypt_ct_secret_preserving_not_retry_spec_correct a hpk h cipher;\n assert (U32.v public_len + 20 <= B.length dst);\n let post (cont: Seq.lseq Secret.uint8 (B.length dst)) (m1: HS.mem) : GTot Type0 =\n header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst)) == cont /\\\n CTR.invariant m1 s /\\\n CTR.footprint m1 s == CTR.footprint m s\n in\n SecretBuffer.with_whole_buffer_hide_weak_modifies'\n #unit\n dst\n m\n (CTR.footprint m s `B.loc_union` B.loc_buffer k)\n (CTR.footprint m s)\n true\n (fun _ cont m1 ->\n post cont m1\n )\n (fun _ bs ->\n header_encrypt_ct_secret_preserving_not_retry a s k h is_short public_len pn_len bs\n )\n ;\n let m' = HST.get () in\n assert (B.as_seq m' dst == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst))));\n assert (B.as_seq m' dst == Spec.header_encrypt a (B.as_seq m k) h cipher)\n end\n\n#pop-options\n\n\n(* A constant-time specification of header_decrypt_aux which does not test or truncate on pn_len *)\n\nlet header_decrypt_aux_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: GTot (option Spec.header_decrypt_aux_t)\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet;\n Spec.pn_offset = ();\n Spec.pn_len = ();\n })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = pn_len;\n })\n end\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats\"\n\n#restart-solver\n\nlet header_decrypt_aux_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len packet == Spec.header_decrypt_aux a hpk cid_len packet)\n= \n let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then ()\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then ()\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> ()\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then ()\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal #Secret.U8 (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide #Secret.U8 sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n let r = packet' in\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#restart-solver\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })\n : GTot (Spec.header_decrypt_aux_t)\n=\n let f = Seq.index packet 0 in\n let sample_offset = pn_offset + 4 in\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` (Seq.index mask 0)) 0ul protected_bits) in\n let packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len))) 0 in\n let packet'' = Lemmas.secret_xor_inplace packet' pnmask pn_offset in\n {\n Spec.is_short = is_short;\n Spec.is_retry = false;\n Spec.packet = Seq.seq_reveal #Secret.U8 packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = Secret.v pn_len;\n }\n\n#push-options \"--z3rlimit 32\"\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet) == Some (header_decrypt_aux_ct_secret_preserving_not_retry_spec a hpk cid_len packet is_short pn_offset))\n= assert (Some? (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet)));\n let ppacket = Seq.seq_reveal packet in\n let f = Seq.index packet 0 in\n let pf = Seq.index ppacket 0 in\n assert (pf == Secret.reveal f);\n let is_short = (BF.get_bitfield #8 (Secret.v f) 7 8 = 0) in\n let Some pn_offset = Parse.putative_pn_offset cid_len ppacket in\n let sample_offset = pn_offset + 4 in\n let psample = Seq.slice ppacket sample_offset (sample_offset + 16) in\n let sample = Seq.slice packet sample_offset (sample_offset + 16) in\n assert (psample == Seq.seq_reveal sample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n let protected_bits = if is_short then 5 else 4 in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 protected_bits (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 protected_bits)) in\n let f' = Secret.set_bitfield f 0ul (U32.uint_to_t protected_bits) (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul (U32.uint_to_t protected_bits)) in\n assert (pf' == Secret.reveal f');\n let packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\n let ppacket' = Seq.cons pf' (Seq.slice ppacket 1 (Seq.length ppacket)) in\n assert (ppacket' `Seq.equal` Seq.seq_reveal packet');\n let ppn_len = BF.get_bitfield (U8.v pf') 0 2 in\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n assert (Secret.v pn_len == ppn_len);\n let ppnmask_ct = Lemmas.and_inplace (Seq.slice pmask 1 5) (pn_sizemask_ct ppn_len) 0 in\n let pnmask_ct = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct ppn_len)) 0 in\n Lemmas.secret_and_inplace_eq (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct ppn_len)) 0;\n assert (ppnmask_ct == Seq.seq_reveal pnmask_ct);\n Lemmas.secret_xor_inplace_eq packet' pnmask_ct pn_offset\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\ninline_for_extraction\nlet header_decrypt_aux_ct_secret_preserving_not_retry'\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n 0 < l /\\ l < pow2 32 /\\ (\n let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\ (\n match Parse.putative_pn_offset (U32.v cid_len) (Seq.seq_reveal (B.as_seq m dst)) with\n | None -> False\n | Some pn_offset' ->\n U32.v pn_offset == pn_offset' /\\\n pn_offset' + 20 <= l\n ))))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) is_short (U32.v pn_offset)).Spec.packet == Seq.seq_reveal (B.as_seq m' dst)\n ))\n= let m0 = HST.get () in\n let f = B.index dst 0ul in\n let sample_offset = pn_offset `U32.add` 4ul in\n let sample = B.sub dst sample_offset 16ul in\n HST.push_frame ();\n let m1 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m1;\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer dst `B.loc_union` CTR.footprint m0 s));\n let m2 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m2;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (B.loc_disjoint (B.loc_buffer pn_sm) (B.loc_buffer dst `B.loc_union` CTR.footprint m0 s));\n let m3 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v sample_offset) (U32.v sample_offset + 16)) in\n assert (B.as_seq m3 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m4 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m4 mask == Ghost.reveal gmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask0 = B.index mask 0ul in\n let f_logxor = f `Secret.logxor` mask0 in\n let f_bf = Secret.get_bitfield (f_logxor) 0ul protected_bits in\n let f' = Secret.set_bitfield f 0ul protected_bits f_bf in\n B.upd dst 0ul f';\n let m5 = HST.get () in\n let gpacket' = Ghost.hide (Seq.cons f' (Seq.slice (B.as_seq m0 dst) 1 (B.length dst))) in\n assert (Ghost.reveal gpacket' `Seq.equal` B.as_seq m5 dst);\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n pn_sizemask pn_sm (Secret.cast_up Secret.U32 pn_len `Secret.add` Secret.hide 1ul);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m6 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len))) 0) in\n assert (Ghost.reveal gpnmask == B.as_seq m6 pnmask);\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n HST.pop_frame ();\n let m7 = HST.get () in\n assert (B.as_seq m7 dst == Lemmas.secret_xor_inplace gpacket' gpnmask (U32.v pn_offset))\n\n#pop-options\n\n#push-options \"--z3rlimit 32 --query_stats\"\n\n#restart-solver\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer U8.t)\n: HST.Stack unit\n (requires (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n 0 < l /\\ l < pow2 32 /\\ (\n let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\ (\n match Parse.putative_pn_offset (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some pn_offset' ->\n U32.v pn_offset == pn_offset' /\\\n pn_offset' + 20 <= l\n ))))\n (ensures (fun m _ m' ->\n match Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some res ->\n let len_mod = U32.v pn_offset + res.Spec.pn_len + 1 in\n res.Spec.pn_offset == U32.v pn_offset /\\\n len_mod <= B.length dst /\\\n B.modifies (B.loc_buffer (B.gsub dst 0ul (U32.uint_to_t len_mod)) `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n res.Spec.packet == B.as_seq m' dst\n ))\n=\n let m = HST.get () in\n SecretBuffer.with_whole_buffer_hide_weak_modifies\n #unit\n dst\n m\n (CTR.footprint m s `B.loc_union` B.loc_buffer k)\n (CTR.footprint m s)\n true\n (fun _ cont m' ->\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a (B.as_seq m k) (U32.v cid_len) (Seq.seq_hide #Secret.U8 (B.as_seq m dst)) is_short (U32.v pn_offset)).Spec.packet == cont /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s\n )\n (fun _ bs ->\n header_decrypt_aux_ct_secret_preserving_not_retry' a s k cid_len is_short pn_offset bs\n );\n let m' = HST.get () in\n header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct a (B.as_seq m k) (U32.v cid_len) (Seq.seq_hide #Secret.U8 (B.as_seq m dst)) is_short (U32.v pn_offset);\n header_decrypt_aux_ct_correct a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst);\n Spec.header_decrypt_aux_post a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst);\n let len_mod = Ghost.hide (U32.uint_to_t (U32.v pn_offset + (Some?.v (Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst))).Spec.pn_len + 1)) in\n B.modifies_loc_buffer_from_to_intro dst 0ul len_mod (CTR.footprint m s) m m'\n\n#pop-options\n\ntype header_decrypt_aux_result =\n | HD_Failure\n | HD_Success_Retry\n | HD_Success_NotRetry\n\nunfold\nlet header_decrypt_aux_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n: GTot Type0\n=\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length dst == U32.v dst_len\n\nunfold\nlet header_decrypt_aux_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n (rs: header_decrypt_aux_result)\n (m' : HS.mem)\n: GTot Type0\n=\n header_decrypt_aux_pre a s k cid_len dst dst_len m /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n begin match rs, Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) with\n | HD_Failure, None ->\n B.modifies B.loc_none m m'\n | HD_Failure, _ -> False\n | _, Some res ->\n res.Spec.packet == B.as_seq m' dst /\\\n res.Spec.is_retry == (HD_Success_Retry? rs) /\\\n (if res.Spec.is_retry\n then B.modifies B.loc_none m m'\n else\n let len = res.Spec.pn_offset + res.Spec.pn_len + 1 in\n len <= B.length dst /\\\n B.modifies (CTR.footprint m s `B.loc_union` B.loc_buffer (B.gsub dst 0ul (U32.uint_to_t len))) m m'\n )\n | _ -> False\n end\n\n#push-options \"--z3rlimit 16\"\n\nlet header_decrypt_aux\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n: HST.Stack header_decrypt_aux_result\n (requires (fun m ->\n header_decrypt_aux_pre a s k cid_len dst dst_len m\n ))\n (ensures (fun m rs m' ->\n header_decrypt_aux_post a s k cid_len dst dst_len m rs m'\n ))\n= let m = HST.get () in\n if dst_len = 0ul\n then HD_Failure\n else\n let f = B.index dst 0ul in\n let short_or_long = BF.uint8.BF.get_bitfield f 7 8 in\n let isshort = short_or_long = 0uy in\n let retry_or_other = BF.uint8.BF.get_bitfield f 4 6 in\n let isretry = not isshort && (retry_or_other = 3uy) in\n if isretry\n then HD_Success_Retry\n else match ParseImpl.putative_pn_offset cid_len dst dst_len with\n | None -> HD_Failure\n | Some pn_offset ->\n if dst_len `U32.lt` (pn_offset `U32.add` 20ul)\n then HD_Failure\n else begin\n header_decrypt_aux_ct_secret_preserving_not_retry a s k cid_len isshort pn_offset dst;\n HD_Success_NotRetry\n end\n\n#pop-options\n\nlet max_cipher_length64 : (x: Secret.uint64 { Secret.v x == max_cipher_length }) =\n Secret.mk_int (norm [delta; iota; zeta; primops] (pow2 32 - header_len_bound))\n\nlet secret_max_correct\n (x y: Secret.uint64)\n: Lemma\n (Secret.v (Secret.max64 x y) == Spec.max (Secret.v x) (Secret.v y))\n [SMTPat (Secret.max64 x y)]\n= ()\n\nlet secret_min_correct\n (x y: Secret.uint64)\n: Lemma\n (Secret.v (Secret.min64 x y) == Spec.min (Secret.v x) (Secret.v y))\n [SMTPat (Secret.min64 x y)]\n= ()\n\n#push-options \"--z3rlimit 2048 --query_stats --ifuel 3 --fuel 2 --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\ninline_for_extraction\nlet header_decrypt_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst:B.buffer U8.t)\n (dst_len: U32.t)\n (m0: HS.mem)\n: HST.Stack h_result\n (requires (fun m ->\n header_decrypt_pre a s k cid_len last dst dst_len m0 /\\\n header_decrypt_aux_post a s k cid_len dst dst_len m0 HD_Success_Retry m\n ))\n (ensures (fun _ rs m' ->\n header_decrypt_post a s k cid_len last dst dst_len m0 rs m'", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 3, "max_ifuel": 3, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 2048, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n s: NotEverCrypt.CTR.state (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n k: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n cid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n dst: LowStar.Buffer.buffer FStar.UInt8.t ->\n dst_len: FStar.UInt32.t ->\n m0: FStar.Monotonic.HyperStack.mem\n -> FStar.HyperStack.ST.Stack QUIC.Impl.Header.h_result", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "NotEverCrypt.CTR.state", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "FStar.UInt8.t", "FStar.UInt32.t", "FStar.Monotonic.HyperStack.mem", "QUIC.Impl.Header.H_Failure", "QUIC.Impl.Header.h_result", "Prims.bool", "QUIC.Impl.Header.Base.header", "QUIC.Spec.PacketNumber.Base.packet_number_t", "QUIC.Impl.Header.H_Success", "Lib.IntTypes.to_u32", "Lib.IntTypes.U32", "Lib.IntTypes.PUB", "FStar.UInt32.__uint_to_t", "Prims.unit", "QUIC.Impl.Header.Parse.header_len_correct", "FStar.HyperStack.ST.get", "FStar.Pervasives.Native.tuple2", "QUIC.Impl.Header.Parse.read_header", "QUIC.Spec.Header.Parse.lemma_header_parsing_post", "FStar.UInt32.v", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Buffer.trivial_preorder", "QUIC.Spec.Header.header_decrypt_aux_post_parse", "FStar.Pervasives.Native.uu___is_None", "FStar.Pervasives.Native.option", "QUIC.Impl.Header.Parse.putative_pn_offset", "QUIC.Spec.Header.header_decrypt_aux_post", "FStar.Classical.move_requires", "QUIC.Spec.Base.bytes", "Prims.b2t", "QUIC.Spec.Header.Parse.uu___is_H_Success", "QUIC.Spec.Header.Parse.parse_header", "FStar.Pervasives.Native.uu___is_Some", "Prims.nat", "QUIC.Spec.Header.Parse.putative_pn_offset", "QUIC.Spec.Header.Parse.parse_header_exists_recip", "Prims.l_False", "Prims.l_imp", "Prims.l_not", "QUIC.Spec.Header.Parse.packet_is_retry", "Prims.op_LessThanOrEqual", "Prims.op_Addition", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "QUIC.Spec.Header.Parse.parse_header_exists", "Prims.l_and", "QUIC.Impl.Header.header_decrypt_pre", "QUIC.Impl.Header.header_decrypt_aux_post", "QUIC.Impl.Header.HD_Success_Retry", "QUIC.Impl.Header.header_decrypt_post" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_decrypt_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m0: HS.mem)\n : HST.Stack h_result\n (requires\n (fun m ->\n header_decrypt_pre a s k cid_len last dst dst_len m0 /\\\n header_decrypt_aux_post a s k cid_len dst dst_len m0 HD_Success_Retry m))\n (ensures (fun _ rs m' -> header_decrypt_post a s k cid_len last dst dst_len m0 rs m'))\nlet header_decrypt_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m0: HS.mem)\n : HST.Stack h_result\n (requires\n (fun m ->\n header_decrypt_pre a s k cid_len last dst dst_len m0 /\\\n header_decrypt_aux_post a s k cid_len dst dst_len m0 HD_Success_Retry m))\n (ensures (fun _ rs m' -> header_decrypt_post a s k cid_len last dst dst_len m0 rs m')) =", "completed_definiton": "let m1 = HST.get () in\nClassical.move_requires (Parse.parse_header_exists (U32.v cid_len) (Secret.v last))\n (B.as_seq m1 dst);\nClassical.move_requires (Parse.parse_header_exists_recip (U32.v cid_len) (Secret.v last))\n (B.as_seq m1 dst);\nSpec.header_decrypt_aux_post a (B.as_seq m0 k) (U32.v cid_len) (B.as_seq m0 dst);\nif None? (ParseImpl.putative_pn_offset cid_len dst dst_len)\nthen H_Failure\nelse\n (Spec.header_decrypt_aux_post_parse a\n (B.as_seq m0 k)\n (U32.v cid_len)\n (Secret.v last)\n (B.as_seq m0 dst);\n Parse.lemma_header_parsing_post (U32.v cid_len) (Secret.v last) (B.as_seq m1 dst);\n let h, pn = ParseImpl.read_header dst dst_len cid_len last in\n let m2 = HST.get () in\n ParseImpl.header_len_correct h m2 pn;\n H_Success h pn (Secret.to_u32 0ul))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.header_encrypt", "original_source_type": "val header_encrypt: a: ea ->\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a)) ->\n (k: B.buffer Secret.uint8) ->\n dst:B.buffer U8.t ->\n h: G.erased Spec.header ->\n is_short: bool ->\n is_retry: bool ->\n public_len: U32.t ->\n pn_len: PN.packet_number_length_t ->\n HST.Stack unit\n (requires (fun h0 ->\n header_encrypt_pre a s k dst h is_short is_retry public_len pn_len h0\n ))\n (ensures fun h0 _ h1 ->\n header_encrypt_post a s k dst h is_short is_retry public_len pn_len h0 h1\n )", "source_type": "val header_encrypt: a: ea ->\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a)) ->\n (k: B.buffer Secret.uint8) ->\n dst:B.buffer U8.t ->\n h: G.erased Spec.header ->\n is_short: bool ->\n is_retry: bool ->\n public_len: U32.t ->\n pn_len: PN.packet_number_length_t ->\n HST.Stack unit\n (requires (fun h0 ->\n header_encrypt_pre a s k dst h is_short is_retry public_len pn_len h0\n ))\n (ensures fun h0 _ h1 ->\n header_encrypt_post a s k dst h is_short is_retry public_len pn_len h0 h1\n )", "source_definition": "let header_encrypt\n a s k dst h is_short is_retry public_len pn_len\n= if is_retry\n then ()\n else begin\n let m = HST.get () in\n let hpk = Ghost.hide (B.as_seq m k) in\n let fmt = Ghost.hide (Parse.format_header (G.reveal h)) in\n let cipher = Ghost.hide (Seq.slice (B.as_seq m dst) (Seq.length fmt) (B.length dst)) in\n assert (B.as_seq m dst `Seq.equal` (fmt `Seq.append` cipher));\n header_encrypt_ct_secret_preserving_not_retry_spec_correct a hpk h cipher;\n assert (U32.v public_len + 20 <= B.length dst);\n let post (cont: Seq.lseq Secret.uint8 (B.length dst)) (m1: HS.mem) : GTot Type0 =\n header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst)) == cont /\\\n CTR.invariant m1 s /\\\n CTR.footprint m1 s == CTR.footprint m s\n in\n SecretBuffer.with_whole_buffer_hide_weak_modifies'\n #unit\n dst\n m\n (CTR.footprint m s `B.loc_union` B.loc_buffer k)\n (CTR.footprint m s)\n true\n (fun _ cont m1 ->\n post cont m1\n )\n (fun _ bs ->\n header_encrypt_ct_secret_preserving_not_retry a s k h is_short public_len pn_len bs\n )\n ;\n let m' = HST.get () in\n assert (B.as_seq m' dst == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst))));\n assert (B.as_seq m' dst == Spec.header_encrypt a (B.as_seq m k) h cipher)\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 413, "start_col": 2, "end_line": 445, "end_col": 5 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)\n\nlet pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma\n (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\n= let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n pow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\n Lemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i\n\nlet header_encrypt_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: GTot packet\n= \n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256\"\n\nlet header_encrypt_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: Lemma\n (header_encrypt_ct a hpk h c `Seq.equal` Spec.header_encrypt a hpk h c)\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then ()\n else begin\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Parse.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header { ~ (Spec.is_retry h) })\n (r: Seq.seq Secret.uint8 {\n Seq.length r >= Parse.pn_offset h + 20\n })\n: GTot (Seq.seq Secret.uint8)\n= \n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = (Seq.slice r (pn_offset + 4) (pn_offset + 20)) in\n let mask = (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide (pn_sizemask_ct pn_len)) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n let r = Lemmas.secret_xor_inplace r pnmask pn_offset in\n let r = Seq.cons f' (Seq.slice r 1 (Seq.length r)) in\n r\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 2\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n: Lemma\n (requires (\n (~ (Spec.is_retry h))\n ))\n (ensures (\n let r = Parse.format_header h `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide r))\n ))\n= header_encrypt_ct_correct a hpk h c;\n let fmt = Parse.format_header h in\n let len = Seq.length fmt in\n let pr = fmt `Seq.append` c in\n assert (Seq.length pr >= Parse.pn_offset h + 20);\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let psample = Seq.slice c (3 - pn_len) (19 - pn_len) in\n assert (c `Seq.equal` Seq.slice pr len (Seq.length pr));\n let pn_off = Parse.pn_offset h in\n assert (pn_off + pn_len + 1 == len);\n assert (c == Seq.slice pr (pn_off + pn_len + 1) (Seq.length pr));\n Seq.slice_slice pr (pn_off + pn_len + 1) (Seq.length pr) (3 - pn_len) (19 - pn_len);\n assert (psample == Seq.slice pr (pn_off + 4) (pn_off + 20));\n let r = Seq.seq_hide #Secret.U8 pr in\n let sample = Seq.slice r (pn_off + 4) (pn_off + 20) in\n assert (sample == Seq.seq_hide #Secret.U8 psample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n assert (mask == Seq.seq_hide pmask);\n let mask15 = Seq.slice mask 1 5 in\n let ppnszmask = pn_sizemask_ct pn_len in\n let pnszmask = Seq.seq_hide ppnszmask in\n let pnmask = Lemmas.secret_and_inplace mask15 pnszmask 0 in\n let pmask15 = Seq.slice pmask 1 5 in\n let ppnmask = Lemmas.and_inplace pmask15 ppnszmask 0 in\n Lemmas.secret_and_inplace_eq mask15 pnszmask 0;\n assert (pnmask == Seq.seq_hide #Secret.U8 ppnmask);\n let f = Seq.index r 0 in\n let pf : Secret.uint_t Secret.U8 Secret.PUB = Seq.index pr 0 in\n assert (f == Secret.hide #Secret.U8 #Secret.PUB pf);\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 (U32.v protected_bits) (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 (U32.v protected_bits))) in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n assert (U8.v pf' == Secret.v f');\n assert (f' == Secret.hide #Secret.U8 pf');\n let pr1 = Lemmas.xor_inplace pr ppnmask pn_off in\n let r1 = Lemmas.secret_xor_inplace r pnmask pn_off in\n Lemmas.secret_xor_inplace_eq r pnmask pn_off;\n assert (r1 == Seq.seq_hide #Secret.U8 pr1);\n let r2 = Seq.cons f' (Seq.slice r1 1 (Seq.length r1)) in\n let pr2 = Seq.cons pf' (Seq.slice pr1 1 (Seq.length pr1)) in\n Seq.cons_seq_hide #Secret.U8 pf' (Seq.slice pr1 1 (Seq.length pr1));\n assert (r2 == Seq.seq_hide #Secret.U8 pr2)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet pn_sizemask_ct_num\n (pn_len: PN.packet_number_length_t)\n: Tot (x: Secret.uint32 { pn_sizemask_ct (Secret.v pn_len - 1) == FStar.Endianness.n_to_be 4 (Secret.v x) })\n=\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` (Secret.v pn_len - 1)));\n [@inline_let]\n let n0 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 24) in\n [@inline_let]\n let n1 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 16) in\n [@inline_let]\n let n2 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 8) in\n [@inline_let]\n let n3 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 0) in\n let pn_len_1 = pn_len `Secret.sub` Secret.to_u32 1ul in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n0)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n1)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n2)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n3))\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet pn_sizemask (dst: B.buffer Secret.uint8) (pn_len: PN.packet_number_length_t): HST.Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\ B.length dst == 4)\n (ensures fun h0 _ h1 ->\n B.as_seq h1 dst `Seq.equal` Seq.seq_hide (pn_sizemask_ct (Secret.v pn_len - 1)) /\\\n B.(modifies (loc_buffer dst) h0 h1))\n= let x = pn_sizemask_ct_num pn_len in\n SecretBuffer.store32_be dst x\n\n#push-options \"--z3rlimit 512 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (h: Ghost.erased Spec.header)\n (is_short: bool)\n (pn_offset: U32.t)\n (pn_len: PN.packet_number_length_t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let fmt = (Parse.format_header h) in\n let hlen = Seq.length fmt in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n (~ (Spec.is_retry h)) /\\\n is_short == (Spec.MShort? h) /\\\n U32.v pn_offset == Parse.pn_offset h /\\\n pn_len == Parse.pn_length h /\\\n hlen + 19 <= B.length dst /\\\n Seq.slice (Seq.seq_reveal #Secret.U8 (B.as_seq m dst)) 0 hlen == fmt\n ))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n header_encrypt_ct_secret_preserving_not_retry_spec a (B.as_seq m k) h (B.as_seq m dst) == B.as_seq m' dst\n ))\n= assert (U32.v pn_offset + 20 <= B.length dst);\n let m0 = HST.get () in\n HST.push_frame ();\n let m01 = HST.get () in\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n B.loc_unused_in_not_unused_in_disjoint m01;\n let m02 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m02;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n let m03 = HST.get () in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (CTR.footprint m03 s == CTR.footprint m0 s);\n assert (B.loc_disjoint (B.loc_buffer mask `B.loc_union` B.loc_buffer pn_sm) (CTR.footprint m0 s `B.loc_union` B.loc_buffer k `B.loc_union` B.loc_buffer dst));\n let sample = B.sub dst (pn_offset `U32.add` 4ul) 16ul in\n let m1 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v pn_offset + 4) (U32.v pn_offset + 20)) in\n assert (B.as_seq m1 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m2 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m2 mask == Ghost.reveal gmask);\n pn_sizemask pn_sm pn_len;\n let m3 = HST.get () in\n assert (B.as_seq m3 mask == Ghost.reveal gmask);\n let gpn_sm = Ghost.hide (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len - 1))) in\n assert (B.as_seq m3 pn_sm == Ghost.reveal gpn_sm);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m4 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) gpn_sm 0) in\n assert (B.as_seq m4 pnmask == Ghost.reveal gpnmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask_0 = B.index mask 0ul in\n assert (mask_0 == Seq.index (B.as_seq m4 (B.gsub mask 0ul 1ul)) 0);\n assert (mask_0 == Seq.index gmask 0);\n let f_ = B.index dst 0ul in\n assert (f_ == Seq.index (B.as_seq m0 dst) 0);\n let f_logxor = f_ `Secret.logxor` mask_0 in\n let f_get_bf = Secret.get_bitfield f_logxor 0ul protected_bits in\n let f' = Secret.set_bitfield f_ 0ul protected_bits f_get_bf in\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n let m5 = HST.get () in\n let gr1 = Ghost.hide (Lemmas.secret_xor_inplace (B.as_seq m0 dst) gpnmask (U32.v pn_offset)) in\n assert (B.as_seq m5 dst == Ghost.reveal gr1);\n B.upd dst 0ul f' ;\n HST.pop_frame ();\n let m6 = HST.get () in\n assert (B.as_seq m6 dst `Seq.equal` (f' `Seq.cons` Seq.slice (Ghost.reveal gr1) 1 (B.length dst)))\n\n#restart-solver\n\nlet header_encrypt", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 1, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 512, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n s: NotEverCrypt.CTR.state (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n k: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n dst: LowStar.Buffer.buffer FStar.UInt8.t ->\n h: FStar.Ghost.erased QUIC.Spec.Header.Base.header ->\n is_short: Prims.bool ->\n is_retry: Prims.bool ->\n public_len: FStar.UInt32.t ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "NotEverCrypt.CTR.state", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "FStar.UInt8.t", "FStar.Ghost.erased", "QUIC.Spec.Header.Base.header", "Prims.bool", "FStar.UInt32.t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "Prims.unit", "Prims._assert", "Prims.eq2", "FStar.Seq.Base.seq", "QUIC.Spec.Base.byte", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Buffer.trivial_preorder", "QUIC.Spec.Header.header_encrypt", "FStar.Ghost.reveal", "Prims.l_and", "QUIC.Spec.Header.Base.is_retry", "Prims.int", "FStar.Seq.Base.length", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "QUIC.Spec.Crypto.max_cipher_length", "Prims.logical", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "QUIC.Impl.Header.header_encrypt_ct_secret_preserving_not_retry_spec", "Spec.Agile.Cipher.key", "QUIC.Secret.Seq.seq_hide", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "QUIC.Secret.Buffer.with_whole_buffer_hide_weak_modifies'", "FStar.Ghost.hide", "LowStar.Monotonic.Buffer.loc", "LowStar.Monotonic.Buffer.loc_union", "NotEverCrypt.CTR.footprint", "LowStar.Monotonic.Buffer.loc_buffer", "FStar.Seq.Properties.lseq", "LowStar.Monotonic.Buffer.length", "Prims.nat", "QUIC.Impl.Header.header_encrypt_ct_secret_preserving_not_retry", "Lib.IntTypes.int_t", "NotEverCrypt.CTR.invariant", "Prims.op_Addition", "FStar.UInt32.v", "QUIC.Impl.Header.header_encrypt_ct_secret_preserving_not_retry_spec_correct", "FStar.Seq.Base.equal", "FStar.Seq.Base.append", "FStar.Seq.Base.slice", "QUIC.Spec.Header.Parse.format_header" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_encrypt: a: ea ->\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a)) ->\n (k: B.buffer Secret.uint8) ->\n dst:B.buffer U8.t ->\n h: G.erased Spec.header ->\n is_short: bool ->\n is_retry: bool ->\n public_len: U32.t ->\n pn_len: PN.packet_number_length_t ->\n HST.Stack unit\n (requires (fun h0 ->\n header_encrypt_pre a s k dst h is_short is_retry public_len pn_len h0\n ))\n (ensures fun h0 _ h1 ->\n header_encrypt_post a s k dst h is_short is_retry public_len pn_len h0 h1\n )\nlet header_encrypt a s k dst h is_short is_retry public_len pn_len =", "completed_definiton": "if is_retry\nthen ()\nelse\n let m = HST.get () in\n let hpk = Ghost.hide (B.as_seq m k) in\n let fmt = Ghost.hide (Parse.format_header (G.reveal h)) in\n let cipher = Ghost.hide (Seq.slice (B.as_seq m dst) (Seq.length fmt) (B.length dst)) in\n assert ((B.as_seq m dst) `Seq.equal` (fmt `Seq.append` cipher));\n header_encrypt_ct_secret_preserving_not_retry_spec_correct a hpk h cipher;\n assert (U32.v public_len + 20 <= B.length dst);\n let post (cont: Seq.lseq Secret.uint8 (B.length dst)) (m1: HS.mem) : GTot Type0 =\n header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst)) ==\n cont /\\ CTR.invariant m1 s /\\ CTR.footprint m1 s == CTR.footprint m s\n in\n SecretBuffer.with_whole_buffer_hide_weak_modifies' #unit\n dst\n m\n ((CTR.footprint m s) `B.loc_union` (B.loc_buffer k))\n (CTR.footprint m s)\n true\n (fun _ cont m1 -> post cont m1)\n (fun _ bs -> header_encrypt_ct_secret_preserving_not_retry a s k h is_short public_len pn_len bs\n );\n let m' = HST.get () in\n assert (B.as_seq m' dst ==\n Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a\n hpk\n h\n (Seq.seq_hide (B.as_seq m dst))));\n assert (B.as_seq m' dst == Spec.header_encrypt a (B.as_seq m k) h cipher)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.header_decrypt_aux_ct_secret_preserving_not_retry_spec", "original_source_type": "val header_decrypt_aux_ct_secret_preserving_not_retry_spec\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet:\n Seq.seq Secret.uint8\n { let l = Seq.length packet in\n 0 < l /\\ l < pow2 32 })\n (is_short:\n bool\n { let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~(not is_short && BF.get_bitfield #8 i 4 6 = 3)) })\n (pn_offset:\n nat\n { match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' -> pn_offset == pn_offset' /\\ pn_offset + 20 <= Seq.length packet })\n : GTot (Spec.header_decrypt_aux_t)", "source_type": "val header_decrypt_aux_ct_secret_preserving_not_retry_spec\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet:\n Seq.seq Secret.uint8\n { let l = Seq.length packet in\n 0 < l /\\ l < pow2 32 })\n (is_short:\n bool\n { let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~(not is_short && BF.get_bitfield #8 i 4 6 = 3)) })\n (pn_offset:\n nat\n { match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' -> pn_offset == pn_offset' /\\ pn_offset + 20 <= Seq.length packet })\n : GTot (Spec.header_decrypt_aux_t)", "source_definition": "let header_decrypt_aux_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })\n : GTot (Spec.header_decrypt_aux_t)\n=\n let f = Seq.index packet 0 in\n let sample_offset = pn_offset + 4 in\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` (Seq.index mask 0)) 0ul protected_bits) in\n let packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len))) 0 in\n let packet'' = Lemmas.secret_xor_inplace packet' pnmask pn_offset in\n {\n Spec.is_short = is_short;\n Spec.is_retry = false;\n Spec.packet = Seq.seq_reveal #Secret.U8 packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = Secret.v pn_len;\n }", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 583, "start_col": 1, "end_line": 602, "end_col": 3 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)\n\nlet pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma\n (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\n= let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n pow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\n Lemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i\n\nlet header_encrypt_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: GTot packet\n= \n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256\"\n\nlet header_encrypt_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: Lemma\n (header_encrypt_ct a hpk h c `Seq.equal` Spec.header_encrypt a hpk h c)\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then ()\n else begin\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Parse.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header { ~ (Spec.is_retry h) })\n (r: Seq.seq Secret.uint8 {\n Seq.length r >= Parse.pn_offset h + 20\n })\n: GTot (Seq.seq Secret.uint8)\n= \n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = (Seq.slice r (pn_offset + 4) (pn_offset + 20)) in\n let mask = (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide (pn_sizemask_ct pn_len)) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n let r = Lemmas.secret_xor_inplace r pnmask pn_offset in\n let r = Seq.cons f' (Seq.slice r 1 (Seq.length r)) in\n r\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 2\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n: Lemma\n (requires (\n (~ (Spec.is_retry h))\n ))\n (ensures (\n let r = Parse.format_header h `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide r))\n ))\n= header_encrypt_ct_correct a hpk h c;\n let fmt = Parse.format_header h in\n let len = Seq.length fmt in\n let pr = fmt `Seq.append` c in\n assert (Seq.length pr >= Parse.pn_offset h + 20);\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let psample = Seq.slice c (3 - pn_len) (19 - pn_len) in\n assert (c `Seq.equal` Seq.slice pr len (Seq.length pr));\n let pn_off = Parse.pn_offset h in\n assert (pn_off + pn_len + 1 == len);\n assert (c == Seq.slice pr (pn_off + pn_len + 1) (Seq.length pr));\n Seq.slice_slice pr (pn_off + pn_len + 1) (Seq.length pr) (3 - pn_len) (19 - pn_len);\n assert (psample == Seq.slice pr (pn_off + 4) (pn_off + 20));\n let r = Seq.seq_hide #Secret.U8 pr in\n let sample = Seq.slice r (pn_off + 4) (pn_off + 20) in\n assert (sample == Seq.seq_hide #Secret.U8 psample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n assert (mask == Seq.seq_hide pmask);\n let mask15 = Seq.slice mask 1 5 in\n let ppnszmask = pn_sizemask_ct pn_len in\n let pnszmask = Seq.seq_hide ppnszmask in\n let pnmask = Lemmas.secret_and_inplace mask15 pnszmask 0 in\n let pmask15 = Seq.slice pmask 1 5 in\n let ppnmask = Lemmas.and_inplace pmask15 ppnszmask 0 in\n Lemmas.secret_and_inplace_eq mask15 pnszmask 0;\n assert (pnmask == Seq.seq_hide #Secret.U8 ppnmask);\n let f = Seq.index r 0 in\n let pf : Secret.uint_t Secret.U8 Secret.PUB = Seq.index pr 0 in\n assert (f == Secret.hide #Secret.U8 #Secret.PUB pf);\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 (U32.v protected_bits) (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 (U32.v protected_bits))) in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n assert (U8.v pf' == Secret.v f');\n assert (f' == Secret.hide #Secret.U8 pf');\n let pr1 = Lemmas.xor_inplace pr ppnmask pn_off in\n let r1 = Lemmas.secret_xor_inplace r pnmask pn_off in\n Lemmas.secret_xor_inplace_eq r pnmask pn_off;\n assert (r1 == Seq.seq_hide #Secret.U8 pr1);\n let r2 = Seq.cons f' (Seq.slice r1 1 (Seq.length r1)) in\n let pr2 = Seq.cons pf' (Seq.slice pr1 1 (Seq.length pr1)) in\n Seq.cons_seq_hide #Secret.U8 pf' (Seq.slice pr1 1 (Seq.length pr1));\n assert (r2 == Seq.seq_hide #Secret.U8 pr2)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet pn_sizemask_ct_num\n (pn_len: PN.packet_number_length_t)\n: Tot (x: Secret.uint32 { pn_sizemask_ct (Secret.v pn_len - 1) == FStar.Endianness.n_to_be 4 (Secret.v x) })\n=\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` (Secret.v pn_len - 1)));\n [@inline_let]\n let n0 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 24) in\n [@inline_let]\n let n1 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 16) in\n [@inline_let]\n let n2 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 8) in\n [@inline_let]\n let n3 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 0) in\n let pn_len_1 = pn_len `Secret.sub` Secret.to_u32 1ul in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n0)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n1)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n2)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n3))\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet pn_sizemask (dst: B.buffer Secret.uint8) (pn_len: PN.packet_number_length_t): HST.Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\ B.length dst == 4)\n (ensures fun h0 _ h1 ->\n B.as_seq h1 dst `Seq.equal` Seq.seq_hide (pn_sizemask_ct (Secret.v pn_len - 1)) /\\\n B.(modifies (loc_buffer dst) h0 h1))\n= let x = pn_sizemask_ct_num pn_len in\n SecretBuffer.store32_be dst x\n\n#push-options \"--z3rlimit 512 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (h: Ghost.erased Spec.header)\n (is_short: bool)\n (pn_offset: U32.t)\n (pn_len: PN.packet_number_length_t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let fmt = (Parse.format_header h) in\n let hlen = Seq.length fmt in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n (~ (Spec.is_retry h)) /\\\n is_short == (Spec.MShort? h) /\\\n U32.v pn_offset == Parse.pn_offset h /\\\n pn_len == Parse.pn_length h /\\\n hlen + 19 <= B.length dst /\\\n Seq.slice (Seq.seq_reveal #Secret.U8 (B.as_seq m dst)) 0 hlen == fmt\n ))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n header_encrypt_ct_secret_preserving_not_retry_spec a (B.as_seq m k) h (B.as_seq m dst) == B.as_seq m' dst\n ))\n= assert (U32.v pn_offset + 20 <= B.length dst);\n let m0 = HST.get () in\n HST.push_frame ();\n let m01 = HST.get () in\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n B.loc_unused_in_not_unused_in_disjoint m01;\n let m02 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m02;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n let m03 = HST.get () in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (CTR.footprint m03 s == CTR.footprint m0 s);\n assert (B.loc_disjoint (B.loc_buffer mask `B.loc_union` B.loc_buffer pn_sm) (CTR.footprint m0 s `B.loc_union` B.loc_buffer k `B.loc_union` B.loc_buffer dst));\n let sample = B.sub dst (pn_offset `U32.add` 4ul) 16ul in\n let m1 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v pn_offset + 4) (U32.v pn_offset + 20)) in\n assert (B.as_seq m1 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m2 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m2 mask == Ghost.reveal gmask);\n pn_sizemask pn_sm pn_len;\n let m3 = HST.get () in\n assert (B.as_seq m3 mask == Ghost.reveal gmask);\n let gpn_sm = Ghost.hide (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len - 1))) in\n assert (B.as_seq m3 pn_sm == Ghost.reveal gpn_sm);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m4 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) gpn_sm 0) in\n assert (B.as_seq m4 pnmask == Ghost.reveal gpnmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask_0 = B.index mask 0ul in\n assert (mask_0 == Seq.index (B.as_seq m4 (B.gsub mask 0ul 1ul)) 0);\n assert (mask_0 == Seq.index gmask 0);\n let f_ = B.index dst 0ul in\n assert (f_ == Seq.index (B.as_seq m0 dst) 0);\n let f_logxor = f_ `Secret.logxor` mask_0 in\n let f_get_bf = Secret.get_bitfield f_logxor 0ul protected_bits in\n let f' = Secret.set_bitfield f_ 0ul protected_bits f_get_bf in\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n let m5 = HST.get () in\n let gr1 = Ghost.hide (Lemmas.secret_xor_inplace (B.as_seq m0 dst) gpnmask (U32.v pn_offset)) in\n assert (B.as_seq m5 dst == Ghost.reveal gr1);\n B.upd dst 0ul f' ;\n HST.pop_frame ();\n let m6 = HST.get () in\n assert (B.as_seq m6 dst `Seq.equal` (f' `Seq.cons` Seq.slice (Ghost.reveal gr1) 1 (B.length dst)))\n\n#restart-solver\n\nlet header_encrypt\n a s k dst h is_short is_retry public_len pn_len\n= if is_retry\n then ()\n else begin\n let m = HST.get () in\n let hpk = Ghost.hide (B.as_seq m k) in\n let fmt = Ghost.hide (Parse.format_header (G.reveal h)) in\n let cipher = Ghost.hide (Seq.slice (B.as_seq m dst) (Seq.length fmt) (B.length dst)) in\n assert (B.as_seq m dst `Seq.equal` (fmt `Seq.append` cipher));\n header_encrypt_ct_secret_preserving_not_retry_spec_correct a hpk h cipher;\n assert (U32.v public_len + 20 <= B.length dst);\n let post (cont: Seq.lseq Secret.uint8 (B.length dst)) (m1: HS.mem) : GTot Type0 =\n header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst)) == cont /\\\n CTR.invariant m1 s /\\\n CTR.footprint m1 s == CTR.footprint m s\n in\n SecretBuffer.with_whole_buffer_hide_weak_modifies'\n #unit\n dst\n m\n (CTR.footprint m s `B.loc_union` B.loc_buffer k)\n (CTR.footprint m s)\n true\n (fun _ cont m1 ->\n post cont m1\n )\n (fun _ bs ->\n header_encrypt_ct_secret_preserving_not_retry a s k h is_short public_len pn_len bs\n )\n ;\n let m' = HST.get () in\n assert (B.as_seq m' dst == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst))));\n assert (B.as_seq m' dst == Spec.header_encrypt a (B.as_seq m k) h cipher)\n end\n\n#pop-options\n\n\n(* A constant-time specification of header_decrypt_aux which does not test or truncate on pn_len *)\n\nlet header_decrypt_aux_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: GTot (option Spec.header_decrypt_aux_t)\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet;\n Spec.pn_offset = ();\n Spec.pn_len = ();\n })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = pn_len;\n })\n end\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats\"\n\n#restart-solver\n\nlet header_decrypt_aux_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len packet == Spec.header_decrypt_aux a hpk cid_len packet)\n= \n let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then ()\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then ()\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> ()\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then ()\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal #Secret.U8 (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide #Secret.U8 sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n let r = packet' in\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#restart-solver\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n cid_len: Prims.nat{cid_len <= 20} ->\n packet:\n FStar.Seq.Base.seq Lib.IntTypes.uint8\n { let l = FStar.Seq.Base.length packet in\n 0 < l /\\ l < Prims.pow2 32 } ->\n is_short:\n Prims.bool\n { let i = QUIC.Secret.Int.Base.v (FStar.Seq.Base.index packet 0) in\n (is_short == true <==> LowParse.BitFields.get_bitfield i 7 8 == 0) /\\\n ~(Prims.op_Negation is_short && LowParse.BitFields.get_bitfield i 4 6 = 3) } ->\n pn_offset:\n Prims.nat\n { (match\n QUIC.Spec.Header.Parse.putative_pn_offset cid_len (QUIC.Secret.Seq.seq_reveal packet)\n with\n | FStar.Pervasives.Native.None #_ -> Prims.l_False\n | FStar.Pervasives.Native.Some #_ pn_offset' ->\n pn_offset == pn_offset' /\\ pn_offset + 20 <= FStar.Seq.Base.length packet)\n <:\n Type0 }\n -> Prims.GTot QUIC.Spec.Header.header_decrypt_aux_t", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.seq", "Lib.IntTypes.uint8", "Prims.l_and", "Prims.op_LessThan", "Prims.pow2", "FStar.Seq.Base.length", "Prims.bool", "Prims.l_iff", "Prims.eq2", "Prims.int", "LowParse.BitFields.get_bitfield", "Prims.l_not", "Prims.op_AmpAmp", "Prims.op_Negation", "Prims.op_Equality", "Lib.IntTypes.range", "Lib.IntTypes.U8", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.SEC", "FStar.Seq.Base.index", "QUIC.Spec.Header.Parse.putative_pn_offset", "QUIC.Secret.Seq.seq_reveal", "Prims.l_False", "Prims.op_Addition", "QUIC.Spec.Header.Mkheader_decrypt_aux_t", "Lib.IntTypes.int_t", "QUIC.Impl.Lemmas.secret_xor_inplace", "QUIC.Impl.Lemmas.secret_and_inplace", "FStar.Seq.Base.slice", "QUIC.Secret.Seq.seq_hide", "QUIC.Impl.Header.pn_sizemask_ct", "Prims.l_or", "FStar.UInt.size", "Prims.op_Subtraction", "FStar.UInt32.v", "FStar.UInt32.uint_to_t", "FStar.UInt32.t", "Lib.IntTypes.v", "QUIC.Secret.Int.get_bitfield", "FStar.UInt32.__uint_to_t", "FStar.Seq.Properties.cons", "LowParse.BitFields.set_bitfield", "Lib.IntTypes.logxor", "QUIC.Secret.Int.set_bitfield", "Lib.IntTypes.bits", "FStar.Seq.Properties.lseq", "QUIC.Spec.Header.block_of_sample", "QUIC.Spec.Header.header_decrypt_aux_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_decrypt_aux_ct_secret_preserving_not_retry_spec\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet:\n Seq.seq Secret.uint8\n { let l = Seq.length packet in\n 0 < l /\\ l < pow2 32 })\n (is_short:\n bool\n { let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~(not is_short && BF.get_bitfield #8 i 4 6 = 3)) })\n (pn_offset:\n nat\n { match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' -> pn_offset == pn_offset' /\\ pn_offset + 20 <= Seq.length packet })\n : GTot (Spec.header_decrypt_aux_t)\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet:\n Seq.seq Secret.uint8\n { let l = Seq.length packet in\n 0 < l /\\ l < pow2 32 })\n (is_short:\n bool\n { let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~(not is_short && BF.get_bitfield #8 i 4 6 = 3)) })\n (pn_offset:\n nat\n { match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' -> pn_offset == pn_offset' /\\ pn_offset + 20 <= Seq.length packet })\n : GTot (Spec.header_decrypt_aux_t) =", "completed_definiton": "let f = Seq.index packet 0 in\nlet sample_offset = pn_offset + 4 in\nlet sample = Seq.slice packet sample_offset (sample_offset + 16) in\nlet mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\nlet protected_bits = if is_short then 5ul else 4ul in\nlet f' =\n Secret.set_bitfield f\n 0ul\n protected_bits\n (Secret.get_bitfield (f `Secret.logxor` (Seq.index mask 0)) 0ul protected_bits)\nin\nlet packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\nlet pn_len = Secret.get_bitfield f' 0ul 2ul in\nlet pnmask =\n Lemmas.secret_and_inplace (Seq.slice mask 1 5)\n (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len)))\n 0\nin\nlet packet'' = Lemmas.secret_xor_inplace packet' pnmask pn_offset in\n{\n Spec.is_short = is_short;\n Spec.is_retry = false;\n Spec.packet = Seq.seq_reveal #Secret.U8 packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = Secret.v pn_len\n}", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.header_decrypt_aux", "original_source_type": "val header_decrypt_aux\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n : HST.Stack header_decrypt_aux_result\n (requires (fun m -> header_decrypt_aux_pre a s k cid_len dst dst_len m))\n (ensures (fun m rs m' -> header_decrypt_aux_post a s k cid_len dst dst_len m rs m'))", "source_type": "val header_decrypt_aux\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n : HST.Stack header_decrypt_aux_result\n (requires (fun m -> header_decrypt_aux_pre a s k cid_len dst dst_len m))\n (ensures (fun m rs m' -> header_decrypt_aux_post a s k cid_len dst dst_len m rs m'))", "source_definition": "let header_decrypt_aux\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n: HST.Stack header_decrypt_aux_result\n (requires (fun m ->\n header_decrypt_aux_pre a s k cid_len dst dst_len m\n ))\n (ensures (fun m rs m' ->\n header_decrypt_aux_post a s k cid_len dst dst_len m rs m'\n ))\n= let m = HST.get () in\n if dst_len = 0ul\n then HD_Failure\n else\n let f = B.index dst 0ul in\n let short_or_long = BF.uint8.BF.get_bitfield f 7 8 in\n let isshort = short_or_long = 0uy in\n let retry_or_other = BF.uint8.BF.get_bitfield f 4 6 in\n let isretry = not isshort && (retry_or_other = 3uy) in\n if isretry\n then HD_Success_Retry\n else match ParseImpl.putative_pn_offset cid_len dst dst_len with\n | None -> HD_Failure\n | Some pn_offset ->\n if dst_len `U32.lt` (pn_offset `U32.add` 20ul)\n then HD_Failure\n else begin\n header_decrypt_aux_ct_secret_preserving_not_retry a s k cid_len isshort pn_offset dst;\n HD_Success_NotRetry\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 881, "start_col": 1, "end_line": 900, "end_col": 9 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)\n\nlet pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma\n (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\n= let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n pow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\n Lemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i\n\nlet header_encrypt_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: GTot packet\n= \n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256\"\n\nlet header_encrypt_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: Lemma\n (header_encrypt_ct a hpk h c `Seq.equal` Spec.header_encrypt a hpk h c)\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then ()\n else begin\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Parse.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header { ~ (Spec.is_retry h) })\n (r: Seq.seq Secret.uint8 {\n Seq.length r >= Parse.pn_offset h + 20\n })\n: GTot (Seq.seq Secret.uint8)\n= \n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = (Seq.slice r (pn_offset + 4) (pn_offset + 20)) in\n let mask = (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide (pn_sizemask_ct pn_len)) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n let r = Lemmas.secret_xor_inplace r pnmask pn_offset in\n let r = Seq.cons f' (Seq.slice r 1 (Seq.length r)) in\n r\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 2\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n: Lemma\n (requires (\n (~ (Spec.is_retry h))\n ))\n (ensures (\n let r = Parse.format_header h `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide r))\n ))\n= header_encrypt_ct_correct a hpk h c;\n let fmt = Parse.format_header h in\n let len = Seq.length fmt in\n let pr = fmt `Seq.append` c in\n assert (Seq.length pr >= Parse.pn_offset h + 20);\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let psample = Seq.slice c (3 - pn_len) (19 - pn_len) in\n assert (c `Seq.equal` Seq.slice pr len (Seq.length pr));\n let pn_off = Parse.pn_offset h in\n assert (pn_off + pn_len + 1 == len);\n assert (c == Seq.slice pr (pn_off + pn_len + 1) (Seq.length pr));\n Seq.slice_slice pr (pn_off + pn_len + 1) (Seq.length pr) (3 - pn_len) (19 - pn_len);\n assert (psample == Seq.slice pr (pn_off + 4) (pn_off + 20));\n let r = Seq.seq_hide #Secret.U8 pr in\n let sample = Seq.slice r (pn_off + 4) (pn_off + 20) in\n assert (sample == Seq.seq_hide #Secret.U8 psample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n assert (mask == Seq.seq_hide pmask);\n let mask15 = Seq.slice mask 1 5 in\n let ppnszmask = pn_sizemask_ct pn_len in\n let pnszmask = Seq.seq_hide ppnszmask in\n let pnmask = Lemmas.secret_and_inplace mask15 pnszmask 0 in\n let pmask15 = Seq.slice pmask 1 5 in\n let ppnmask = Lemmas.and_inplace pmask15 ppnszmask 0 in\n Lemmas.secret_and_inplace_eq mask15 pnszmask 0;\n assert (pnmask == Seq.seq_hide #Secret.U8 ppnmask);\n let f = Seq.index r 0 in\n let pf : Secret.uint_t Secret.U8 Secret.PUB = Seq.index pr 0 in\n assert (f == Secret.hide #Secret.U8 #Secret.PUB pf);\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 (U32.v protected_bits) (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 (U32.v protected_bits))) in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n assert (U8.v pf' == Secret.v f');\n assert (f' == Secret.hide #Secret.U8 pf');\n let pr1 = Lemmas.xor_inplace pr ppnmask pn_off in\n let r1 = Lemmas.secret_xor_inplace r pnmask pn_off in\n Lemmas.secret_xor_inplace_eq r pnmask pn_off;\n assert (r1 == Seq.seq_hide #Secret.U8 pr1);\n let r2 = Seq.cons f' (Seq.slice r1 1 (Seq.length r1)) in\n let pr2 = Seq.cons pf' (Seq.slice pr1 1 (Seq.length pr1)) in\n Seq.cons_seq_hide #Secret.U8 pf' (Seq.slice pr1 1 (Seq.length pr1));\n assert (r2 == Seq.seq_hide #Secret.U8 pr2)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet pn_sizemask_ct_num\n (pn_len: PN.packet_number_length_t)\n: Tot (x: Secret.uint32 { pn_sizemask_ct (Secret.v pn_len - 1) == FStar.Endianness.n_to_be 4 (Secret.v x) })\n=\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` (Secret.v pn_len - 1)));\n [@inline_let]\n let n0 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 24) in\n [@inline_let]\n let n1 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 16) in\n [@inline_let]\n let n2 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 8) in\n [@inline_let]\n let n3 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 0) in\n let pn_len_1 = pn_len `Secret.sub` Secret.to_u32 1ul in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n0)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n1)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n2)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n3))\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet pn_sizemask (dst: B.buffer Secret.uint8) (pn_len: PN.packet_number_length_t): HST.Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\ B.length dst == 4)\n (ensures fun h0 _ h1 ->\n B.as_seq h1 dst `Seq.equal` Seq.seq_hide (pn_sizemask_ct (Secret.v pn_len - 1)) /\\\n B.(modifies (loc_buffer dst) h0 h1))\n= let x = pn_sizemask_ct_num pn_len in\n SecretBuffer.store32_be dst x\n\n#push-options \"--z3rlimit 512 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (h: Ghost.erased Spec.header)\n (is_short: bool)\n (pn_offset: U32.t)\n (pn_len: PN.packet_number_length_t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let fmt = (Parse.format_header h) in\n let hlen = Seq.length fmt in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n (~ (Spec.is_retry h)) /\\\n is_short == (Spec.MShort? h) /\\\n U32.v pn_offset == Parse.pn_offset h /\\\n pn_len == Parse.pn_length h /\\\n hlen + 19 <= B.length dst /\\\n Seq.slice (Seq.seq_reveal #Secret.U8 (B.as_seq m dst)) 0 hlen == fmt\n ))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n header_encrypt_ct_secret_preserving_not_retry_spec a (B.as_seq m k) h (B.as_seq m dst) == B.as_seq m' dst\n ))\n= assert (U32.v pn_offset + 20 <= B.length dst);\n let m0 = HST.get () in\n HST.push_frame ();\n let m01 = HST.get () in\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n B.loc_unused_in_not_unused_in_disjoint m01;\n let m02 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m02;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n let m03 = HST.get () in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (CTR.footprint m03 s == CTR.footprint m0 s);\n assert (B.loc_disjoint (B.loc_buffer mask `B.loc_union` B.loc_buffer pn_sm) (CTR.footprint m0 s `B.loc_union` B.loc_buffer k `B.loc_union` B.loc_buffer dst));\n let sample = B.sub dst (pn_offset `U32.add` 4ul) 16ul in\n let m1 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v pn_offset + 4) (U32.v pn_offset + 20)) in\n assert (B.as_seq m1 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m2 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m2 mask == Ghost.reveal gmask);\n pn_sizemask pn_sm pn_len;\n let m3 = HST.get () in\n assert (B.as_seq m3 mask == Ghost.reveal gmask);\n let gpn_sm = Ghost.hide (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len - 1))) in\n assert (B.as_seq m3 pn_sm == Ghost.reveal gpn_sm);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m4 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) gpn_sm 0) in\n assert (B.as_seq m4 pnmask == Ghost.reveal gpnmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask_0 = B.index mask 0ul in\n assert (mask_0 == Seq.index (B.as_seq m4 (B.gsub mask 0ul 1ul)) 0);\n assert (mask_0 == Seq.index gmask 0);\n let f_ = B.index dst 0ul in\n assert (f_ == Seq.index (B.as_seq m0 dst) 0);\n let f_logxor = f_ `Secret.logxor` mask_0 in\n let f_get_bf = Secret.get_bitfield f_logxor 0ul protected_bits in\n let f' = Secret.set_bitfield f_ 0ul protected_bits f_get_bf in\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n let m5 = HST.get () in\n let gr1 = Ghost.hide (Lemmas.secret_xor_inplace (B.as_seq m0 dst) gpnmask (U32.v pn_offset)) in\n assert (B.as_seq m5 dst == Ghost.reveal gr1);\n B.upd dst 0ul f' ;\n HST.pop_frame ();\n let m6 = HST.get () in\n assert (B.as_seq m6 dst `Seq.equal` (f' `Seq.cons` Seq.slice (Ghost.reveal gr1) 1 (B.length dst)))\n\n#restart-solver\n\nlet header_encrypt\n a s k dst h is_short is_retry public_len pn_len\n= if is_retry\n then ()\n else begin\n let m = HST.get () in\n let hpk = Ghost.hide (B.as_seq m k) in\n let fmt = Ghost.hide (Parse.format_header (G.reveal h)) in\n let cipher = Ghost.hide (Seq.slice (B.as_seq m dst) (Seq.length fmt) (B.length dst)) in\n assert (B.as_seq m dst `Seq.equal` (fmt `Seq.append` cipher));\n header_encrypt_ct_secret_preserving_not_retry_spec_correct a hpk h cipher;\n assert (U32.v public_len + 20 <= B.length dst);\n let post (cont: Seq.lseq Secret.uint8 (B.length dst)) (m1: HS.mem) : GTot Type0 =\n header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst)) == cont /\\\n CTR.invariant m1 s /\\\n CTR.footprint m1 s == CTR.footprint m s\n in\n SecretBuffer.with_whole_buffer_hide_weak_modifies'\n #unit\n dst\n m\n (CTR.footprint m s `B.loc_union` B.loc_buffer k)\n (CTR.footprint m s)\n true\n (fun _ cont m1 ->\n post cont m1\n )\n (fun _ bs ->\n header_encrypt_ct_secret_preserving_not_retry a s k h is_short public_len pn_len bs\n )\n ;\n let m' = HST.get () in\n assert (B.as_seq m' dst == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst))));\n assert (B.as_seq m' dst == Spec.header_encrypt a (B.as_seq m k) h cipher)\n end\n\n#pop-options\n\n\n(* A constant-time specification of header_decrypt_aux which does not test or truncate on pn_len *)\n\nlet header_decrypt_aux_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: GTot (option Spec.header_decrypt_aux_t)\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet;\n Spec.pn_offset = ();\n Spec.pn_len = ();\n })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = pn_len;\n })\n end\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats\"\n\n#restart-solver\n\nlet header_decrypt_aux_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len packet == Spec.header_decrypt_aux a hpk cid_len packet)\n= \n let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then ()\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then ()\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> ()\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then ()\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal #Secret.U8 (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide #Secret.U8 sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n let r = packet' in\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#restart-solver\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })\n : GTot (Spec.header_decrypt_aux_t)\n=\n let f = Seq.index packet 0 in\n let sample_offset = pn_offset + 4 in\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` (Seq.index mask 0)) 0ul protected_bits) in\n let packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len))) 0 in\n let packet'' = Lemmas.secret_xor_inplace packet' pnmask pn_offset in\n {\n Spec.is_short = is_short;\n Spec.is_retry = false;\n Spec.packet = Seq.seq_reveal #Secret.U8 packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = Secret.v pn_len;\n }\n\n#push-options \"--z3rlimit 32\"\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet) == Some (header_decrypt_aux_ct_secret_preserving_not_retry_spec a hpk cid_len packet is_short pn_offset))\n= assert (Some? (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet)));\n let ppacket = Seq.seq_reveal packet in\n let f = Seq.index packet 0 in\n let pf = Seq.index ppacket 0 in\n assert (pf == Secret.reveal f);\n let is_short = (BF.get_bitfield #8 (Secret.v f) 7 8 = 0) in\n let Some pn_offset = Parse.putative_pn_offset cid_len ppacket in\n let sample_offset = pn_offset + 4 in\n let psample = Seq.slice ppacket sample_offset (sample_offset + 16) in\n let sample = Seq.slice packet sample_offset (sample_offset + 16) in\n assert (psample == Seq.seq_reveal sample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n let protected_bits = if is_short then 5 else 4 in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 protected_bits (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 protected_bits)) in\n let f' = Secret.set_bitfield f 0ul (U32.uint_to_t protected_bits) (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul (U32.uint_to_t protected_bits)) in\n assert (pf' == Secret.reveal f');\n let packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\n let ppacket' = Seq.cons pf' (Seq.slice ppacket 1 (Seq.length ppacket)) in\n assert (ppacket' `Seq.equal` Seq.seq_reveal packet');\n let ppn_len = BF.get_bitfield (U8.v pf') 0 2 in\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n assert (Secret.v pn_len == ppn_len);\n let ppnmask_ct = Lemmas.and_inplace (Seq.slice pmask 1 5) (pn_sizemask_ct ppn_len) 0 in\n let pnmask_ct = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct ppn_len)) 0 in\n Lemmas.secret_and_inplace_eq (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct ppn_len)) 0;\n assert (ppnmask_ct == Seq.seq_reveal pnmask_ct);\n Lemmas.secret_xor_inplace_eq packet' pnmask_ct pn_offset\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\ninline_for_extraction\nlet header_decrypt_aux_ct_secret_preserving_not_retry'\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n 0 < l /\\ l < pow2 32 /\\ (\n let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\ (\n match Parse.putative_pn_offset (U32.v cid_len) (Seq.seq_reveal (B.as_seq m dst)) with\n | None -> False\n | Some pn_offset' ->\n U32.v pn_offset == pn_offset' /\\\n pn_offset' + 20 <= l\n ))))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) is_short (U32.v pn_offset)).Spec.packet == Seq.seq_reveal (B.as_seq m' dst)\n ))\n= let m0 = HST.get () in\n let f = B.index dst 0ul in\n let sample_offset = pn_offset `U32.add` 4ul in\n let sample = B.sub dst sample_offset 16ul in\n HST.push_frame ();\n let m1 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m1;\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer dst `B.loc_union` CTR.footprint m0 s));\n let m2 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m2;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (B.loc_disjoint (B.loc_buffer pn_sm) (B.loc_buffer dst `B.loc_union` CTR.footprint m0 s));\n let m3 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v sample_offset) (U32.v sample_offset + 16)) in\n assert (B.as_seq m3 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m4 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m4 mask == Ghost.reveal gmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask0 = B.index mask 0ul in\n let f_logxor = f `Secret.logxor` mask0 in\n let f_bf = Secret.get_bitfield (f_logxor) 0ul protected_bits in\n let f' = Secret.set_bitfield f 0ul protected_bits f_bf in\n B.upd dst 0ul f';\n let m5 = HST.get () in\n let gpacket' = Ghost.hide (Seq.cons f' (Seq.slice (B.as_seq m0 dst) 1 (B.length dst))) in\n assert (Ghost.reveal gpacket' `Seq.equal` B.as_seq m5 dst);\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n pn_sizemask pn_sm (Secret.cast_up Secret.U32 pn_len `Secret.add` Secret.hide 1ul);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m6 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len))) 0) in\n assert (Ghost.reveal gpnmask == B.as_seq m6 pnmask);\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n HST.pop_frame ();\n let m7 = HST.get () in\n assert (B.as_seq m7 dst == Lemmas.secret_xor_inplace gpacket' gpnmask (U32.v pn_offset))\n\n#pop-options\n\n#push-options \"--z3rlimit 32 --query_stats\"\n\n#restart-solver\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer U8.t)\n: HST.Stack unit\n (requires (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n 0 < l /\\ l < pow2 32 /\\ (\n let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\ (\n match Parse.putative_pn_offset (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some pn_offset' ->\n U32.v pn_offset == pn_offset' /\\\n pn_offset' + 20 <= l\n ))))\n (ensures (fun m _ m' ->\n match Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some res ->\n let len_mod = U32.v pn_offset + res.Spec.pn_len + 1 in\n res.Spec.pn_offset == U32.v pn_offset /\\\n len_mod <= B.length dst /\\\n B.modifies (B.loc_buffer (B.gsub dst 0ul (U32.uint_to_t len_mod)) `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n res.Spec.packet == B.as_seq m' dst\n ))\n=\n let m = HST.get () in\n SecretBuffer.with_whole_buffer_hide_weak_modifies\n #unit\n dst\n m\n (CTR.footprint m s `B.loc_union` B.loc_buffer k)\n (CTR.footprint m s)\n true\n (fun _ cont m' ->\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a (B.as_seq m k) (U32.v cid_len) (Seq.seq_hide #Secret.U8 (B.as_seq m dst)) is_short (U32.v pn_offset)).Spec.packet == cont /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s\n )\n (fun _ bs ->\n header_decrypt_aux_ct_secret_preserving_not_retry' a s k cid_len is_short pn_offset bs\n );\n let m' = HST.get () in\n header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct a (B.as_seq m k) (U32.v cid_len) (Seq.seq_hide #Secret.U8 (B.as_seq m dst)) is_short (U32.v pn_offset);\n header_decrypt_aux_ct_correct a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst);\n Spec.header_decrypt_aux_post a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst);\n let len_mod = Ghost.hide (U32.uint_to_t (U32.v pn_offset + (Some?.v (Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst))).Spec.pn_len + 1)) in\n B.modifies_loc_buffer_from_to_intro dst 0ul len_mod (CTR.footprint m s) m m'\n\n#pop-options\n\ntype header_decrypt_aux_result =\n | HD_Failure\n | HD_Success_Retry\n | HD_Success_NotRetry\n\nunfold\nlet header_decrypt_aux_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n: GTot Type0\n=\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length dst == U32.v dst_len\n\nunfold\nlet header_decrypt_aux_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n (rs: header_decrypt_aux_result)\n (m' : HS.mem)\n: GTot Type0\n=\n header_decrypt_aux_pre a s k cid_len dst dst_len m /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n begin match rs, Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) with\n | HD_Failure, None ->\n B.modifies B.loc_none m m'\n | HD_Failure, _ -> False\n | _, Some res ->\n res.Spec.packet == B.as_seq m' dst /\\\n res.Spec.is_retry == (HD_Success_Retry? rs) /\\\n (if res.Spec.is_retry\n then B.modifies B.loc_none m m'\n else\n let len = res.Spec.pn_offset + res.Spec.pn_len + 1 in\n len <= B.length dst /\\\n B.modifies (CTR.footprint m s `B.loc_union` B.loc_buffer (B.gsub dst 0ul (U32.uint_to_t len))) m m'\n )\n | _ -> False\n end\n\n#push-options \"--z3rlimit 16\"\n\nlet header_decrypt_aux\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n: HST.Stack header_decrypt_aux_result\n (requires (fun m ->\n header_decrypt_aux_pre a s k cid_len dst dst_len m\n ))\n (ensures (fun m rs m' ->\n header_decrypt_aux_post a s k cid_len dst dst_len m rs m'", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n s: NotEverCrypt.CTR.state (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n k: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n cid_len: QUIC.Spec.Base.short_dcid_len_t ->\n dst: LowStar.Buffer.buffer FStar.UInt8.t ->\n dst_len: FStar.UInt32.t\n -> FStar.HyperStack.ST.Stack QUIC.Impl.Header.header_decrypt_aux_result", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "NotEverCrypt.CTR.state", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "QUIC.Spec.Base.short_dcid_len_t", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.op_Equality", "FStar.UInt32.__uint_to_t", "QUIC.Impl.Header.HD_Failure", "QUIC.Impl.Header.header_decrypt_aux_result", "Prims.bool", "QUIC.Impl.Header.HD_Success_Retry", "FStar.UInt32.lt", "FStar.UInt32.add", "QUIC.Impl.Header.HD_Success_NotRetry", "Prims.unit", "QUIC.Impl.Header.header_decrypt_aux_ct_secret_preserving_not_retry", "FStar.Pervasives.Native.option", "QUIC.Impl.Header.Parse.putative_pn_offset", "Prims.op_AmpAmp", "Prims.op_Negation", "FStar.UInt8.__uint_to_t", "Prims.eq2", "FStar.UInt.uint_t", "LowParse.BitFields.__proj__Mkuint_t__item__v", "LowParse.BitFields.uint8", "LowParse.BitFields.get_bitfield", "LowParse.BitFields.__proj__Mkuint_t__item__get_bitfield", "LowStar.Monotonic.Buffer.index", "LowStar.Buffer.trivial_preorder", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "QUIC.Impl.Header.header_decrypt_aux_pre", "QUIC.Impl.Header.header_decrypt_aux_post" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_decrypt_aux\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n : HST.Stack header_decrypt_aux_result\n (requires (fun m -> header_decrypt_aux_pre a s k cid_len dst dst_len m))\n (ensures (fun m rs m' -> header_decrypt_aux_post a s k cid_len dst dst_len m rs m'))\nlet header_decrypt_aux\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n : HST.Stack header_decrypt_aux_result\n (requires (fun m -> header_decrypt_aux_pre a s k cid_len dst dst_len m))\n (ensures (fun m rs m' -> header_decrypt_aux_post a s k cid_len dst dst_len m rs m')) =", "completed_definiton": "let m = HST.get () in\nif dst_len = 0ul\nthen HD_Failure\nelse\n let f = B.index dst 0ul in\n let short_or_long = BF.uint8.BF.get_bitfield f 7 8 in\n let isshort = short_or_long = 0uy in\n let retry_or_other = BF.uint8.BF.get_bitfield f 4 6 in\n let isretry = not isshort && (retry_or_other = 3uy) in\n if isretry\n then HD_Success_Retry\n else\n match ParseImpl.putative_pn_offset cid_len dst dst_len with\n | None -> HD_Failure\n | Some pn_offset ->\n if dst_len `U32.lt` (pn_offset `U32.add` 20ul)\n then HD_Failure\n else\n (header_decrypt_aux_ct_secret_preserving_not_retry a s k cid_len isshort pn_offset dst;\n HD_Success_NotRetry)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.header_encrypt_ct_secret_preserving_not_retry_spec", "original_source_type": "val header_encrypt_ct_secret_preserving_not_retry_spec\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header{~(Spec.is_retry h)})\n (r: Seq.seq Secret.uint8 {Seq.length r >= Parse.pn_offset h + 20})\n : GTot (Seq.seq Secret.uint8)", "source_type": "val header_encrypt_ct_secret_preserving_not_retry_spec\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header{~(Spec.is_retry h)})\n (r: Seq.seq Secret.uint8 {Seq.length r >= Parse.pn_offset h + 20})\n : GTot (Seq.seq Secret.uint8)", "source_definition": "let header_encrypt_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header { ~ (Spec.is_retry h) })\n (r: Seq.seq Secret.uint8 {\n Seq.length r >= Parse.pn_offset h + 20\n })\n: GTot (Seq.seq Secret.uint8)\n= \n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = (Seq.slice r (pn_offset + 4) (pn_offset + 20)) in\n let mask = (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide (pn_sizemask_ct pn_len)) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n let r = Lemmas.secret_xor_inplace r pnmask pn_offset in\n let r = Seq.cons f' (Seq.slice r 1 (Seq.length r)) in\n r", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 209, "start_col": 1, "end_line": 220, "end_col": 3 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)\n\nlet pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma\n (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\n= let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n pow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\n Lemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i\n\nlet header_encrypt_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: GTot packet\n= \n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256\"\n\nlet header_encrypt_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: Lemma\n (header_encrypt_ct a hpk h c `Seq.equal` Spec.header_encrypt a hpk h c)\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then ()\n else begin\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Parse.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header { ~ (Spec.is_retry h) })\n (r: Seq.seq Secret.uint8 {\n Seq.length r >= Parse.pn_offset h + 20\n })", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n h: QUIC.Spec.Header.Base.header{~(QUIC.Spec.Header.Base.is_retry h)} ->\n r:\n FStar.Seq.Base.seq Lib.IntTypes.uint8\n {FStar.Seq.Base.length r >= QUIC.Spec.Header.Parse.pn_offset h + 20}\n -> Prims.GTot (FStar.Seq.Base.seq Lib.IntTypes.uint8)", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "QUIC.Spec.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Spec.Header.Base.is_retry", "FStar.Seq.Base.seq", "Lib.IntTypes.uint8", "Prims.op_GreaterThanOrEqual", "FStar.Seq.Base.length", "Prims.op_Addition", "QUIC.Spec.Header.Parse.pn_offset", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "FStar.Seq.Properties.cons", "FStar.Seq.Base.slice", "QUIC.Impl.Lemmas.secret_xor_inplace", "Prims.eq2", "Prims.int", "Prims.l_or", "Lib.IntTypes.range", "FStar.UInt.size", "Lib.IntTypes.v", "LowParse.BitFields.set_bitfield", "FStar.UInt32.v", "FStar.UInt32.uint_to_t", "FStar.UInt32.t", "QUIC.Secret.Int.get_bitfield", "Lib.IntTypes.logxor", "FStar.Seq.Base.index", "QUIC.Secret.Int.set_bitfield", "FStar.UInt32.__uint_to_t", "Prims.l_and", "Prims.op_LessThan", "Prims.op_LessThanOrEqual", "QUIC.Spec.Header.Base.uu___is_MShort", "Prims.bool", "Lib.IntTypes.bits", "QUIC.Impl.Lemmas.secret_and_inplace", "QUIC.Secret.Seq.seq_hide", "QUIC.Impl.Header.pn_sizemask_ct", "FStar.Seq.Properties.lseq", "QUIC.Spec.Header.block_of_sample", "Prims.op_Subtraction", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "QUIC.Spec.Header.Base.pn_length", "Prims.nat", "QUIC.Spec.Header.Base.header_len" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_encrypt_ct_secret_preserving_not_retry_spec\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header{~(Spec.is_retry h)})\n (r: Seq.seq Secret.uint8 {Seq.length r >= Parse.pn_offset h + 20})\n : GTot (Seq.seq Secret.uint8)\nlet header_encrypt_ct_secret_preserving_not_retry_spec\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header{~(Spec.is_retry h)})\n (r: Seq.seq Secret.uint8 {Seq.length r >= Parse.pn_offset h + 20})\n : GTot (Seq.seq Secret.uint8) =", "completed_definiton": "let pn_offset = Parse.pn_offset h in\nlet pn_len = Secret.v (Spec.pn_length h) - 1 in\nlet sample = (Seq.slice r (pn_offset + 4) (pn_offset + 20)) in\nlet mask = (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\nlet pnmask =\n Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide (pn_sizemask_ct pn_len)) 0\nin\nlet f = Seq.index r 0 in\nlet protected_bits = if Spec.MShort? h then 5ul else 4ul in\nlet f' =\n Secret.set_bitfield f\n 0ul\n protected_bits\n (Secret.get_bitfield (f `Secret.logxor` (Seq.index mask 0)) 0ul protected_bits)\nin\nlet r = Lemmas.secret_xor_inplace r pnmask pn_offset in\nlet r = Seq.cons f' (Seq.slice r 1 (Seq.length r)) in\nr", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct", "original_source_type": "val header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet:\n Seq.seq Secret.uint8\n { let l = Seq.length packet in\n 0 < l /\\ l < pow2 32 })\n (is_short:\n bool\n { let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~(not is_short && BF.get_bitfield #8 i 4 6 = 3)) })\n (pn_offset:\n nat\n { match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' -> pn_offset == pn_offset' /\\ pn_offset + 20 <= Seq.length packet })\n : Lemma\n (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet) ==\n Some\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a\n hpk\n cid_len\n packet\n is_short\n pn_offset))", "source_type": "val header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet:\n Seq.seq Secret.uint8\n { let l = Seq.length packet in\n 0 < l /\\ l < pow2 32 })\n (is_short:\n bool\n { let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~(not is_short && BF.get_bitfield #8 i 4 6 = 3)) })\n (pn_offset:\n nat\n { match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' -> pn_offset == pn_offset' /\\ pn_offset + 20 <= Seq.length packet })\n : Lemma\n (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet) ==\n Some\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a\n hpk\n cid_len\n packet\n is_short\n pn_offset))", "source_definition": "let header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet) == Some (header_decrypt_aux_ct_secret_preserving_not_retry_spec a hpk cid_len packet is_short pn_offset))\n= assert (Some? (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet)));\n let ppacket = Seq.seq_reveal packet in\n let f = Seq.index packet 0 in\n let pf = Seq.index ppacket 0 in\n assert (pf == Secret.reveal f);\n let is_short = (BF.get_bitfield #8 (Secret.v f) 7 8 = 0) in\n let Some pn_offset = Parse.putative_pn_offset cid_len ppacket in\n let sample_offset = pn_offset + 4 in\n let psample = Seq.slice ppacket sample_offset (sample_offset + 16) in\n let sample = Seq.slice packet sample_offset (sample_offset + 16) in\n assert (psample == Seq.seq_reveal sample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n let protected_bits = if is_short then 5 else 4 in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 protected_bits (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 protected_bits)) in\n let f' = Secret.set_bitfield f 0ul (U32.uint_to_t protected_bits) (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul (U32.uint_to_t protected_bits)) in\n assert (pf' == Secret.reveal f');\n let packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\n let ppacket' = Seq.cons pf' (Seq.slice ppacket 1 (Seq.length ppacket)) in\n assert (ppacket' `Seq.equal` Seq.seq_reveal packet');\n let ppn_len = BF.get_bitfield (U8.v pf') 0 2 in\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n assert (Secret.v pn_len == ppn_len);\n let ppnmask_ct = Lemmas.and_inplace (Seq.slice pmask 1 5) (pn_sizemask_ct ppn_len) 0 in\n let pnmask_ct = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct ppn_len)) 0 in\n Lemmas.secret_and_inplace_eq (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct ppn_len)) 0;\n assert (ppnmask_ct == Seq.seq_reveal pnmask_ct);\n Lemmas.secret_xor_inplace_eq packet' pnmask_ct pn_offset", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 628, "start_col": 2, "end_line": 655, "end_col": 58 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)\n\nlet pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma\n (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\n= let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n pow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\n Lemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i\n\nlet header_encrypt_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: GTot packet\n= \n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256\"\n\nlet header_encrypt_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: Lemma\n (header_encrypt_ct a hpk h c `Seq.equal` Spec.header_encrypt a hpk h c)\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then ()\n else begin\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Parse.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header { ~ (Spec.is_retry h) })\n (r: Seq.seq Secret.uint8 {\n Seq.length r >= Parse.pn_offset h + 20\n })\n: GTot (Seq.seq Secret.uint8)\n= \n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = (Seq.slice r (pn_offset + 4) (pn_offset + 20)) in\n let mask = (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide (pn_sizemask_ct pn_len)) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n let r = Lemmas.secret_xor_inplace r pnmask pn_offset in\n let r = Seq.cons f' (Seq.slice r 1 (Seq.length r)) in\n r\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 2\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n: Lemma\n (requires (\n (~ (Spec.is_retry h))\n ))\n (ensures (\n let r = Parse.format_header h `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide r))\n ))\n= header_encrypt_ct_correct a hpk h c;\n let fmt = Parse.format_header h in\n let len = Seq.length fmt in\n let pr = fmt `Seq.append` c in\n assert (Seq.length pr >= Parse.pn_offset h + 20);\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let psample = Seq.slice c (3 - pn_len) (19 - pn_len) in\n assert (c `Seq.equal` Seq.slice pr len (Seq.length pr));\n let pn_off = Parse.pn_offset h in\n assert (pn_off + pn_len + 1 == len);\n assert (c == Seq.slice pr (pn_off + pn_len + 1) (Seq.length pr));\n Seq.slice_slice pr (pn_off + pn_len + 1) (Seq.length pr) (3 - pn_len) (19 - pn_len);\n assert (psample == Seq.slice pr (pn_off + 4) (pn_off + 20));\n let r = Seq.seq_hide #Secret.U8 pr in\n let sample = Seq.slice r (pn_off + 4) (pn_off + 20) in\n assert (sample == Seq.seq_hide #Secret.U8 psample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n assert (mask == Seq.seq_hide pmask);\n let mask15 = Seq.slice mask 1 5 in\n let ppnszmask = pn_sizemask_ct pn_len in\n let pnszmask = Seq.seq_hide ppnszmask in\n let pnmask = Lemmas.secret_and_inplace mask15 pnszmask 0 in\n let pmask15 = Seq.slice pmask 1 5 in\n let ppnmask = Lemmas.and_inplace pmask15 ppnszmask 0 in\n Lemmas.secret_and_inplace_eq mask15 pnszmask 0;\n assert (pnmask == Seq.seq_hide #Secret.U8 ppnmask);\n let f = Seq.index r 0 in\n let pf : Secret.uint_t Secret.U8 Secret.PUB = Seq.index pr 0 in\n assert (f == Secret.hide #Secret.U8 #Secret.PUB pf);\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 (U32.v protected_bits) (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 (U32.v protected_bits))) in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n assert (U8.v pf' == Secret.v f');\n assert (f' == Secret.hide #Secret.U8 pf');\n let pr1 = Lemmas.xor_inplace pr ppnmask pn_off in\n let r1 = Lemmas.secret_xor_inplace r pnmask pn_off in\n Lemmas.secret_xor_inplace_eq r pnmask pn_off;\n assert (r1 == Seq.seq_hide #Secret.U8 pr1);\n let r2 = Seq.cons f' (Seq.slice r1 1 (Seq.length r1)) in\n let pr2 = Seq.cons pf' (Seq.slice pr1 1 (Seq.length pr1)) in\n Seq.cons_seq_hide #Secret.U8 pf' (Seq.slice pr1 1 (Seq.length pr1));\n assert (r2 == Seq.seq_hide #Secret.U8 pr2)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet pn_sizemask_ct_num\n (pn_len: PN.packet_number_length_t)\n: Tot (x: Secret.uint32 { pn_sizemask_ct (Secret.v pn_len - 1) == FStar.Endianness.n_to_be 4 (Secret.v x) })\n=\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` (Secret.v pn_len - 1)));\n [@inline_let]\n let n0 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 24) in\n [@inline_let]\n let n1 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 16) in\n [@inline_let]\n let n2 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 8) in\n [@inline_let]\n let n3 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 0) in\n let pn_len_1 = pn_len `Secret.sub` Secret.to_u32 1ul in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n0)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n1)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n2)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n3))\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet pn_sizemask (dst: B.buffer Secret.uint8) (pn_len: PN.packet_number_length_t): HST.Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\ B.length dst == 4)\n (ensures fun h0 _ h1 ->\n B.as_seq h1 dst `Seq.equal` Seq.seq_hide (pn_sizemask_ct (Secret.v pn_len - 1)) /\\\n B.(modifies (loc_buffer dst) h0 h1))\n= let x = pn_sizemask_ct_num pn_len in\n SecretBuffer.store32_be dst x\n\n#push-options \"--z3rlimit 512 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (h: Ghost.erased Spec.header)\n (is_short: bool)\n (pn_offset: U32.t)\n (pn_len: PN.packet_number_length_t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let fmt = (Parse.format_header h) in\n let hlen = Seq.length fmt in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n (~ (Spec.is_retry h)) /\\\n is_short == (Spec.MShort? h) /\\\n U32.v pn_offset == Parse.pn_offset h /\\\n pn_len == Parse.pn_length h /\\\n hlen + 19 <= B.length dst /\\\n Seq.slice (Seq.seq_reveal #Secret.U8 (B.as_seq m dst)) 0 hlen == fmt\n ))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n header_encrypt_ct_secret_preserving_not_retry_spec a (B.as_seq m k) h (B.as_seq m dst) == B.as_seq m' dst\n ))\n= assert (U32.v pn_offset + 20 <= B.length dst);\n let m0 = HST.get () in\n HST.push_frame ();\n let m01 = HST.get () in\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n B.loc_unused_in_not_unused_in_disjoint m01;\n let m02 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m02;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n let m03 = HST.get () in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (CTR.footprint m03 s == CTR.footprint m0 s);\n assert (B.loc_disjoint (B.loc_buffer mask `B.loc_union` B.loc_buffer pn_sm) (CTR.footprint m0 s `B.loc_union` B.loc_buffer k `B.loc_union` B.loc_buffer dst));\n let sample = B.sub dst (pn_offset `U32.add` 4ul) 16ul in\n let m1 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v pn_offset + 4) (U32.v pn_offset + 20)) in\n assert (B.as_seq m1 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m2 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m2 mask == Ghost.reveal gmask);\n pn_sizemask pn_sm pn_len;\n let m3 = HST.get () in\n assert (B.as_seq m3 mask == Ghost.reveal gmask);\n let gpn_sm = Ghost.hide (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len - 1))) in\n assert (B.as_seq m3 pn_sm == Ghost.reveal gpn_sm);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m4 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) gpn_sm 0) in\n assert (B.as_seq m4 pnmask == Ghost.reveal gpnmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask_0 = B.index mask 0ul in\n assert (mask_0 == Seq.index (B.as_seq m4 (B.gsub mask 0ul 1ul)) 0);\n assert (mask_0 == Seq.index gmask 0);\n let f_ = B.index dst 0ul in\n assert (f_ == Seq.index (B.as_seq m0 dst) 0);\n let f_logxor = f_ `Secret.logxor` mask_0 in\n let f_get_bf = Secret.get_bitfield f_logxor 0ul protected_bits in\n let f' = Secret.set_bitfield f_ 0ul protected_bits f_get_bf in\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n let m5 = HST.get () in\n let gr1 = Ghost.hide (Lemmas.secret_xor_inplace (B.as_seq m0 dst) gpnmask (U32.v pn_offset)) in\n assert (B.as_seq m5 dst == Ghost.reveal gr1);\n B.upd dst 0ul f' ;\n HST.pop_frame ();\n let m6 = HST.get () in\n assert (B.as_seq m6 dst `Seq.equal` (f' `Seq.cons` Seq.slice (Ghost.reveal gr1) 1 (B.length dst)))\n\n#restart-solver\n\nlet header_encrypt\n a s k dst h is_short is_retry public_len pn_len\n= if is_retry\n then ()\n else begin\n let m = HST.get () in\n let hpk = Ghost.hide (B.as_seq m k) in\n let fmt = Ghost.hide (Parse.format_header (G.reveal h)) in\n let cipher = Ghost.hide (Seq.slice (B.as_seq m dst) (Seq.length fmt) (B.length dst)) in\n assert (B.as_seq m dst `Seq.equal` (fmt `Seq.append` cipher));\n header_encrypt_ct_secret_preserving_not_retry_spec_correct a hpk h cipher;\n assert (U32.v public_len + 20 <= B.length dst);\n let post (cont: Seq.lseq Secret.uint8 (B.length dst)) (m1: HS.mem) : GTot Type0 =\n header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst)) == cont /\\\n CTR.invariant m1 s /\\\n CTR.footprint m1 s == CTR.footprint m s\n in\n SecretBuffer.with_whole_buffer_hide_weak_modifies'\n #unit\n dst\n m\n (CTR.footprint m s `B.loc_union` B.loc_buffer k)\n (CTR.footprint m s)\n true\n (fun _ cont m1 ->\n post cont m1\n )\n (fun _ bs ->\n header_encrypt_ct_secret_preserving_not_retry a s k h is_short public_len pn_len bs\n )\n ;\n let m' = HST.get () in\n assert (B.as_seq m' dst == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst))));\n assert (B.as_seq m' dst == Spec.header_encrypt a (B.as_seq m k) h cipher)\n end\n\n#pop-options\n\n\n(* A constant-time specification of header_decrypt_aux which does not test or truncate on pn_len *)\n\nlet header_decrypt_aux_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: GTot (option Spec.header_decrypt_aux_t)\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet;\n Spec.pn_offset = ();\n Spec.pn_len = ();\n })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = pn_len;\n })\n end\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats\"\n\n#restart-solver\n\nlet header_decrypt_aux_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len packet == Spec.header_decrypt_aux a hpk cid_len packet)\n= \n let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then ()\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then ()\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> ()\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then ()\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal #Secret.U8 (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide #Secret.U8 sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n let r = packet' in\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#restart-solver\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })\n : GTot (Spec.header_decrypt_aux_t)\n=\n let f = Seq.index packet 0 in\n let sample_offset = pn_offset + 4 in\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` (Seq.index mask 0)) 0ul protected_bits) in\n let packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len))) 0 in\n let packet'' = Lemmas.secret_xor_inplace packet' pnmask pn_offset in\n {\n Spec.is_short = is_short;\n Spec.is_retry = false;\n Spec.packet = Seq.seq_reveal #Secret.U8 packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = Secret.v pn_len;\n }\n\n#push-options \"--z3rlimit 32\"\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })\n: Lemma", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n cid_len: Prims.nat{cid_len <= 20} ->\n packet:\n FStar.Seq.Base.seq Lib.IntTypes.uint8\n { let l = FStar.Seq.Base.length packet in\n 0 < l /\\ l < Prims.pow2 32 } ->\n is_short:\n Prims.bool\n { let i = QUIC.Secret.Int.Base.v (FStar.Seq.Base.index packet 0) in\n (is_short == true <==> LowParse.BitFields.get_bitfield i 7 8 == 0) /\\\n ~(Prims.op_Negation is_short && LowParse.BitFields.get_bitfield i 4 6 = 3) } ->\n pn_offset:\n Prims.nat\n { (match\n QUIC.Spec.Header.Parse.putative_pn_offset cid_len (QUIC.Secret.Seq.seq_reveal packet)\n with\n | FStar.Pervasives.Native.None #_ -> Prims.l_False\n | FStar.Pervasives.Native.Some #_ pn_offset' ->\n pn_offset == pn_offset' /\\ pn_offset + 20 <= FStar.Seq.Base.length packet)\n <:\n Type0 }\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Impl.Header.header_decrypt_aux_ct a hpk cid_len (QUIC.Secret.Seq.seq_reveal packet) ==\n FStar.Pervasives.Native.Some\n (QUIC.Impl.Header.header_decrypt_aux_ct_secret_preserving_not_retry_spec a\n hpk\n cid_len\n packet\n is_short\n pn_offset))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.seq", "Lib.IntTypes.uint8", "Prims.l_and", "Prims.op_LessThan", "Prims.pow2", "FStar.Seq.Base.length", "Prims.bool", "Prims.l_iff", "Prims.eq2", "Prims.int", "LowParse.BitFields.get_bitfield", "Prims.l_not", "Prims.op_AmpAmp", "Prims.op_Negation", "Prims.op_Equality", "Lib.IntTypes.range", "Lib.IntTypes.U8", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.SEC", "FStar.Seq.Base.index", "QUIC.Spec.Header.Parse.putative_pn_offset", "QUIC.Secret.Seq.seq_reveal", "Prims.l_False", "Prims.op_Addition", "QUIC.Impl.Lemmas.secret_xor_inplace_eq", "Prims.unit", "Prims._assert", "Lib.IntTypes.uint_t", "Lib.IntTypes.PUB", "QUIC.Impl.Lemmas.secret_and_inplace_eq", "FStar.Seq.Base.slice", "QUIC.Secret.Seq.seq_hide", "QUIC.Impl.Header.pn_sizemask_ct", "Lib.IntTypes.int_t", "QUIC.Impl.Lemmas.secret_and_inplace", "QUIC.Spec.Base.bytes", "QUIC.Spec.Lemmas.and_inplace", "Prims.l_or", "FStar.UInt.size", "FStar.UInt8.n", "Prims.op_Subtraction", "FStar.UInt32.v", "FStar.UInt32.uint_to_t", "FStar.UInt32.t", "Lib.IntTypes.v", "QUIC.Secret.Int.get_bitfield", "FStar.UInt32.__uint_to_t", "LowParse.BitFields.ubitfield", "FStar.UInt8.v", "FStar.Seq.Base.equal", "FStar.Seq.Properties.cons", "FStar.UInt8.t", "QUIC.Secret.Int.reveal", "LowParse.BitFields.set_bitfield", "Lib.IntTypes.logxor", "QUIC.Secret.Int.set_bitfield", "FStar.UInt8.uint_to_t", "FStar.UInt.logxor", "Prims.op_GreaterThanOrEqual", "FStar.UInt32.n", "FStar.Seq.Properties.lseq", "QUIC.Spec.Header.block_of_sample", "FStar.Pervasives.Native.option", "Prims.l_True", "QUIC.Spec.Base.byte", "QUIC.Spec.Base.header_len_bound", "FStar.Pervasives.Native.uu___is_Some", "QUIC.Spec.Header.header_decrypt_aux_t", "QUIC.Impl.Header.header_decrypt_aux_ct", "Prims.squash", "FStar.Pervasives.Native.Some", "QUIC.Impl.Header.header_decrypt_aux_ct_secret_preserving_not_retry_spec", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet:\n Seq.seq Secret.uint8\n { let l = Seq.length packet in\n 0 < l /\\ l < pow2 32 })\n (is_short:\n bool\n { let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~(not is_short && BF.get_bitfield #8 i 4 6 = 3)) })\n (pn_offset:\n nat\n { match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' -> pn_offset == pn_offset' /\\ pn_offset + 20 <= Seq.length packet })\n : Lemma\n (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet) ==\n Some\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a\n hpk\n cid_len\n packet\n is_short\n pn_offset))\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet:\n Seq.seq Secret.uint8\n { let l = Seq.length packet in\n 0 < l /\\ l < pow2 32 })\n (is_short:\n bool\n { let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~(not is_short && BF.get_bitfield #8 i 4 6 = 3)) })\n (pn_offset:\n nat\n { match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' -> pn_offset == pn_offset' /\\ pn_offset + 20 <= Seq.length packet })\n : Lemma\n (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet) ==\n Some\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a\n hpk\n cid_len\n packet\n is_short\n pn_offset)) =", "completed_definiton": "assert (Some? (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet)));\nlet ppacket = Seq.seq_reveal packet in\nlet f = Seq.index packet 0 in\nlet pf = Seq.index ppacket 0 in\nassert (pf == Secret.reveal f);\nlet is_short = (BF.get_bitfield #8 (Secret.v f) 7 8 = 0) in\nlet Some pn_offset = Parse.putative_pn_offset cid_len ppacket in\nlet sample_offset = pn_offset + 4 in\nlet psample = Seq.slice ppacket sample_offset (sample_offset + 16) in\nlet sample = Seq.slice packet sample_offset (sample_offset + 16) in\nassert (psample == Seq.seq_reveal sample);\nlet mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\nlet pmask = Seq.seq_reveal mask in\nlet protected_bits = if is_short then 5 else 4 in\nlet pf' =\n U8.uint_to_t (BF.set_bitfield (U8.v pf)\n 0\n protected_bits\n (BF.get_bitfield ((U8.v pf) `FStar.UInt.logxor` (U8.v (Seq.index pmask 0))) 0 protected_bits\n ))\nin\nlet f' =\n Secret.set_bitfield f\n 0ul\n (U32.uint_to_t protected_bits)\n (Secret.get_bitfield (f `Secret.logxor` (Seq.index mask 0)) 0ul (U32.uint_to_t protected_bits))\nin\nassert (pf' == Secret.reveal f');\nlet packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\nlet ppacket' = Seq.cons pf' (Seq.slice ppacket 1 (Seq.length ppacket)) in\nassert (ppacket' `Seq.equal` (Seq.seq_reveal packet'));\nlet ppn_len = BF.get_bitfield (U8.v pf') 0 2 in\nlet pn_len = Secret.get_bitfield f' 0ul 2ul in\nassert (Secret.v pn_len == ppn_len);\nlet ppnmask_ct = Lemmas.and_inplace (Seq.slice pmask 1 5) (pn_sizemask_ct ppn_len) 0 in\nlet pnmask_ct =\n Lemmas.secret_and_inplace (Seq.slice mask 1 5)\n (Seq.seq_hide #Secret.U8 (pn_sizemask_ct ppn_len))\n 0\nin\nLemmas.secret_and_inplace_eq (Seq.slice mask 1 5)\n (Seq.seq_hide #Secret.U8 (pn_sizemask_ct ppn_len))\n 0;\nassert (ppnmask_ct == Seq.seq_reveal pnmask_ct);\nLemmas.secret_xor_inplace_eq packet' pnmask_ct pn_offset", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.header_decrypt_aux_ct_secret_preserving_not_retry", "original_source_type": "val header_decrypt_aux_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer U8.t)\n : HST.Stack unit\n (requires\n (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\ CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint [CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\ 0 < l /\\\n l < pow2 32 /\\\n (let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~(not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\\n (match Parse.putative_pn_offset (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some pn_offset' -> U32.v pn_offset == pn_offset' /\\ pn_offset' + 20 <= l))))\n (ensures\n (fun m _ m' ->\n match Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some res ->\n let len_mod = U32.v pn_offset + res.Spec.pn_len + 1 in\n res.Spec.pn_offset == U32.v pn_offset /\\ len_mod <= B.length dst /\\\n B.modifies ((B.loc_buffer (B.gsub dst 0ul (U32.uint_to_t len_mod)))\n `B.loc_union`\n (CTR.footprint m s))\n m\n m' /\\ CTR.invariant m' s /\\ CTR.footprint m s == CTR.footprint m' s /\\\n res.Spec.packet == B.as_seq m' dst))", "source_type": "val header_decrypt_aux_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer U8.t)\n : HST.Stack unit\n (requires\n (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\ CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint [CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\ 0 < l /\\\n l < pow2 32 /\\\n (let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~(not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\\n (match Parse.putative_pn_offset (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some pn_offset' -> U32.v pn_offset == pn_offset' /\\ pn_offset' + 20 <= l))))\n (ensures\n (fun m _ m' ->\n match Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some res ->\n let len_mod = U32.v pn_offset + res.Spec.pn_len + 1 in\n res.Spec.pn_offset == U32.v pn_offset /\\ len_mod <= B.length dst /\\\n B.modifies ((B.loc_buffer (B.gsub dst 0ul (U32.uint_to_t len_mod)))\n `B.loc_union`\n (CTR.footprint m s))\n m\n m' /\\ CTR.invariant m' s /\\ CTR.footprint m s == CTR.footprint m' s /\\\n res.Spec.packet == B.as_seq m' dst))", "source_definition": "let header_decrypt_aux_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer U8.t)\n: HST.Stack unit\n (requires (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n 0 < l /\\ l < pow2 32 /\\ (\n let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\ (\n match Parse.putative_pn_offset (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some pn_offset' ->\n U32.v pn_offset == pn_offset' /\\\n pn_offset' + 20 <= l\n ))))\n (ensures (fun m _ m' ->\n match Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some res ->\n let len_mod = U32.v pn_offset + res.Spec.pn_len + 1 in\n res.Spec.pn_offset == U32.v pn_offset /\\\n len_mod <= B.length dst /\\\n B.modifies (B.loc_buffer (B.gsub dst 0ul (U32.uint_to_t len_mod)) `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n res.Spec.packet == B.as_seq m' dst\n ))\n=\n let m = HST.get () in\n SecretBuffer.with_whole_buffer_hide_weak_modifies\n #unit\n dst\n m\n (CTR.footprint m s `B.loc_union` B.loc_buffer k)\n (CTR.footprint m s)\n true\n (fun _ cont m' ->\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a (B.as_seq m k) (U32.v cid_len) (Seq.seq_hide #Secret.U8 (B.as_seq m dst)) is_short (U32.v pn_offset)).Spec.packet == cont /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s\n )\n (fun _ bs ->\n header_decrypt_aux_ct_secret_preserving_not_retry' a s k cid_len is_short pn_offset bs\n );\n let m' = HST.get () in\n header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct a (B.as_seq m k) (U32.v cid_len) (Seq.seq_hide #Secret.U8 (B.as_seq m dst)) is_short (U32.v pn_offset);\n header_decrypt_aux_ct_correct a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst);\n Spec.header_decrypt_aux_post a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst);\n let len_mod = Ghost.hide (U32.uint_to_t (U32.v pn_offset + (Some?.v (Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst))).Spec.pn_len + 1)) in\n B.modifies_loc_buffer_from_to_intro dst 0ul len_mod (CTR.footprint m s) m m'", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 782, "start_col": 1, "end_line": 804, "end_col": 78 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)\n\nlet pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma\n (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\n= let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n pow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\n Lemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i\n\nlet header_encrypt_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: GTot packet\n= \n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256\"\n\nlet header_encrypt_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: Lemma\n (header_encrypt_ct a hpk h c `Seq.equal` Spec.header_encrypt a hpk h c)\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then ()\n else begin\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Parse.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header { ~ (Spec.is_retry h) })\n (r: Seq.seq Secret.uint8 {\n Seq.length r >= Parse.pn_offset h + 20\n })\n: GTot (Seq.seq Secret.uint8)\n= \n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = (Seq.slice r (pn_offset + 4) (pn_offset + 20)) in\n let mask = (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide (pn_sizemask_ct pn_len)) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n let r = Lemmas.secret_xor_inplace r pnmask pn_offset in\n let r = Seq.cons f' (Seq.slice r 1 (Seq.length r)) in\n r\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 2\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n: Lemma\n (requires (\n (~ (Spec.is_retry h))\n ))\n (ensures (\n let r = Parse.format_header h `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide r))\n ))\n= header_encrypt_ct_correct a hpk h c;\n let fmt = Parse.format_header h in\n let len = Seq.length fmt in\n let pr = fmt `Seq.append` c in\n assert (Seq.length pr >= Parse.pn_offset h + 20);\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let psample = Seq.slice c (3 - pn_len) (19 - pn_len) in\n assert (c `Seq.equal` Seq.slice pr len (Seq.length pr));\n let pn_off = Parse.pn_offset h in\n assert (pn_off + pn_len + 1 == len);\n assert (c == Seq.slice pr (pn_off + pn_len + 1) (Seq.length pr));\n Seq.slice_slice pr (pn_off + pn_len + 1) (Seq.length pr) (3 - pn_len) (19 - pn_len);\n assert (psample == Seq.slice pr (pn_off + 4) (pn_off + 20));\n let r = Seq.seq_hide #Secret.U8 pr in\n let sample = Seq.slice r (pn_off + 4) (pn_off + 20) in\n assert (sample == Seq.seq_hide #Secret.U8 psample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n assert (mask == Seq.seq_hide pmask);\n let mask15 = Seq.slice mask 1 5 in\n let ppnszmask = pn_sizemask_ct pn_len in\n let pnszmask = Seq.seq_hide ppnszmask in\n let pnmask = Lemmas.secret_and_inplace mask15 pnszmask 0 in\n let pmask15 = Seq.slice pmask 1 5 in\n let ppnmask = Lemmas.and_inplace pmask15 ppnszmask 0 in\n Lemmas.secret_and_inplace_eq mask15 pnszmask 0;\n assert (pnmask == Seq.seq_hide #Secret.U8 ppnmask);\n let f = Seq.index r 0 in\n let pf : Secret.uint_t Secret.U8 Secret.PUB = Seq.index pr 0 in\n assert (f == Secret.hide #Secret.U8 #Secret.PUB pf);\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 (U32.v protected_bits) (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 (U32.v protected_bits))) in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n assert (U8.v pf' == Secret.v f');\n assert (f' == Secret.hide #Secret.U8 pf');\n let pr1 = Lemmas.xor_inplace pr ppnmask pn_off in\n let r1 = Lemmas.secret_xor_inplace r pnmask pn_off in\n Lemmas.secret_xor_inplace_eq r pnmask pn_off;\n assert (r1 == Seq.seq_hide #Secret.U8 pr1);\n let r2 = Seq.cons f' (Seq.slice r1 1 (Seq.length r1)) in\n let pr2 = Seq.cons pf' (Seq.slice pr1 1 (Seq.length pr1)) in\n Seq.cons_seq_hide #Secret.U8 pf' (Seq.slice pr1 1 (Seq.length pr1));\n assert (r2 == Seq.seq_hide #Secret.U8 pr2)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet pn_sizemask_ct_num\n (pn_len: PN.packet_number_length_t)\n: Tot (x: Secret.uint32 { pn_sizemask_ct (Secret.v pn_len - 1) == FStar.Endianness.n_to_be 4 (Secret.v x) })\n=\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` (Secret.v pn_len - 1)));\n [@inline_let]\n let n0 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 24) in\n [@inline_let]\n let n1 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 16) in\n [@inline_let]\n let n2 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 8) in\n [@inline_let]\n let n3 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 0) in\n let pn_len_1 = pn_len `Secret.sub` Secret.to_u32 1ul in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n0)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n1)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n2)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n3))\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet pn_sizemask (dst: B.buffer Secret.uint8) (pn_len: PN.packet_number_length_t): HST.Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\ B.length dst == 4)\n (ensures fun h0 _ h1 ->\n B.as_seq h1 dst `Seq.equal` Seq.seq_hide (pn_sizemask_ct (Secret.v pn_len - 1)) /\\\n B.(modifies (loc_buffer dst) h0 h1))\n= let x = pn_sizemask_ct_num pn_len in\n SecretBuffer.store32_be dst x\n\n#push-options \"--z3rlimit 512 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (h: Ghost.erased Spec.header)\n (is_short: bool)\n (pn_offset: U32.t)\n (pn_len: PN.packet_number_length_t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let fmt = (Parse.format_header h) in\n let hlen = Seq.length fmt in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n (~ (Spec.is_retry h)) /\\\n is_short == (Spec.MShort? h) /\\\n U32.v pn_offset == Parse.pn_offset h /\\\n pn_len == Parse.pn_length h /\\\n hlen + 19 <= B.length dst /\\\n Seq.slice (Seq.seq_reveal #Secret.U8 (B.as_seq m dst)) 0 hlen == fmt\n ))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n header_encrypt_ct_secret_preserving_not_retry_spec a (B.as_seq m k) h (B.as_seq m dst) == B.as_seq m' dst\n ))\n= assert (U32.v pn_offset + 20 <= B.length dst);\n let m0 = HST.get () in\n HST.push_frame ();\n let m01 = HST.get () in\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n B.loc_unused_in_not_unused_in_disjoint m01;\n let m02 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m02;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n let m03 = HST.get () in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (CTR.footprint m03 s == CTR.footprint m0 s);\n assert (B.loc_disjoint (B.loc_buffer mask `B.loc_union` B.loc_buffer pn_sm) (CTR.footprint m0 s `B.loc_union` B.loc_buffer k `B.loc_union` B.loc_buffer dst));\n let sample = B.sub dst (pn_offset `U32.add` 4ul) 16ul in\n let m1 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v pn_offset + 4) (U32.v pn_offset + 20)) in\n assert (B.as_seq m1 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m2 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m2 mask == Ghost.reveal gmask);\n pn_sizemask pn_sm pn_len;\n let m3 = HST.get () in\n assert (B.as_seq m3 mask == Ghost.reveal gmask);\n let gpn_sm = Ghost.hide (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len - 1))) in\n assert (B.as_seq m3 pn_sm == Ghost.reveal gpn_sm);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m4 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) gpn_sm 0) in\n assert (B.as_seq m4 pnmask == Ghost.reveal gpnmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask_0 = B.index mask 0ul in\n assert (mask_0 == Seq.index (B.as_seq m4 (B.gsub mask 0ul 1ul)) 0);\n assert (mask_0 == Seq.index gmask 0);\n let f_ = B.index dst 0ul in\n assert (f_ == Seq.index (B.as_seq m0 dst) 0);\n let f_logxor = f_ `Secret.logxor` mask_0 in\n let f_get_bf = Secret.get_bitfield f_logxor 0ul protected_bits in\n let f' = Secret.set_bitfield f_ 0ul protected_bits f_get_bf in\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n let m5 = HST.get () in\n let gr1 = Ghost.hide (Lemmas.secret_xor_inplace (B.as_seq m0 dst) gpnmask (U32.v pn_offset)) in\n assert (B.as_seq m5 dst == Ghost.reveal gr1);\n B.upd dst 0ul f' ;\n HST.pop_frame ();\n let m6 = HST.get () in\n assert (B.as_seq m6 dst `Seq.equal` (f' `Seq.cons` Seq.slice (Ghost.reveal gr1) 1 (B.length dst)))\n\n#restart-solver\n\nlet header_encrypt\n a s k dst h is_short is_retry public_len pn_len\n= if is_retry\n then ()\n else begin\n let m = HST.get () in\n let hpk = Ghost.hide (B.as_seq m k) in\n let fmt = Ghost.hide (Parse.format_header (G.reveal h)) in\n let cipher = Ghost.hide (Seq.slice (B.as_seq m dst) (Seq.length fmt) (B.length dst)) in\n assert (B.as_seq m dst `Seq.equal` (fmt `Seq.append` cipher));\n header_encrypt_ct_secret_preserving_not_retry_spec_correct a hpk h cipher;\n assert (U32.v public_len + 20 <= B.length dst);\n let post (cont: Seq.lseq Secret.uint8 (B.length dst)) (m1: HS.mem) : GTot Type0 =\n header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst)) == cont /\\\n CTR.invariant m1 s /\\\n CTR.footprint m1 s == CTR.footprint m s\n in\n SecretBuffer.with_whole_buffer_hide_weak_modifies'\n #unit\n dst\n m\n (CTR.footprint m s `B.loc_union` B.loc_buffer k)\n (CTR.footprint m s)\n true\n (fun _ cont m1 ->\n post cont m1\n )\n (fun _ bs ->\n header_encrypt_ct_secret_preserving_not_retry a s k h is_short public_len pn_len bs\n )\n ;\n let m' = HST.get () in\n assert (B.as_seq m' dst == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst))));\n assert (B.as_seq m' dst == Spec.header_encrypt a (B.as_seq m k) h cipher)\n end\n\n#pop-options\n\n\n(* A constant-time specification of header_decrypt_aux which does not test or truncate on pn_len *)\n\nlet header_decrypt_aux_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: GTot (option Spec.header_decrypt_aux_t)\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet;\n Spec.pn_offset = ();\n Spec.pn_len = ();\n })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = pn_len;\n })\n end\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats\"\n\n#restart-solver\n\nlet header_decrypt_aux_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len packet == Spec.header_decrypt_aux a hpk cid_len packet)\n= \n let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then ()\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then ()\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> ()\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then ()\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal #Secret.U8 (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide #Secret.U8 sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n let r = packet' in\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#restart-solver\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })\n : GTot (Spec.header_decrypt_aux_t)\n=\n let f = Seq.index packet 0 in\n let sample_offset = pn_offset + 4 in\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` (Seq.index mask 0)) 0ul protected_bits) in\n let packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len))) 0 in\n let packet'' = Lemmas.secret_xor_inplace packet' pnmask pn_offset in\n {\n Spec.is_short = is_short;\n Spec.is_retry = false;\n Spec.packet = Seq.seq_reveal #Secret.U8 packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = Secret.v pn_len;\n }\n\n#push-options \"--z3rlimit 32\"\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet) == Some (header_decrypt_aux_ct_secret_preserving_not_retry_spec a hpk cid_len packet is_short pn_offset))\n= assert (Some? (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet)));\n let ppacket = Seq.seq_reveal packet in\n let f = Seq.index packet 0 in\n let pf = Seq.index ppacket 0 in\n assert (pf == Secret.reveal f);\n let is_short = (BF.get_bitfield #8 (Secret.v f) 7 8 = 0) in\n let Some pn_offset = Parse.putative_pn_offset cid_len ppacket in\n let sample_offset = pn_offset + 4 in\n let psample = Seq.slice ppacket sample_offset (sample_offset + 16) in\n let sample = Seq.slice packet sample_offset (sample_offset + 16) in\n assert (psample == Seq.seq_reveal sample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n let protected_bits = if is_short then 5 else 4 in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 protected_bits (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 protected_bits)) in\n let f' = Secret.set_bitfield f 0ul (U32.uint_to_t protected_bits) (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul (U32.uint_to_t protected_bits)) in\n assert (pf' == Secret.reveal f');\n let packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\n let ppacket' = Seq.cons pf' (Seq.slice ppacket 1 (Seq.length ppacket)) in\n assert (ppacket' `Seq.equal` Seq.seq_reveal packet');\n let ppn_len = BF.get_bitfield (U8.v pf') 0 2 in\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n assert (Secret.v pn_len == ppn_len);\n let ppnmask_ct = Lemmas.and_inplace (Seq.slice pmask 1 5) (pn_sizemask_ct ppn_len) 0 in\n let pnmask_ct = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct ppn_len)) 0 in\n Lemmas.secret_and_inplace_eq (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct ppn_len)) 0;\n assert (ppnmask_ct == Seq.seq_reveal pnmask_ct);\n Lemmas.secret_xor_inplace_eq packet' pnmask_ct pn_offset\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\ninline_for_extraction\nlet header_decrypt_aux_ct_secret_preserving_not_retry'\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n 0 < l /\\ l < pow2 32 /\\ (\n let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\ (\n match Parse.putative_pn_offset (U32.v cid_len) (Seq.seq_reveal (B.as_seq m dst)) with\n | None -> False\n | Some pn_offset' ->\n U32.v pn_offset == pn_offset' /\\\n pn_offset' + 20 <= l\n ))))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) is_short (U32.v pn_offset)).Spec.packet == Seq.seq_reveal (B.as_seq m' dst)\n ))\n= let m0 = HST.get () in\n let f = B.index dst 0ul in\n let sample_offset = pn_offset `U32.add` 4ul in\n let sample = B.sub dst sample_offset 16ul in\n HST.push_frame ();\n let m1 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m1;\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer dst `B.loc_union` CTR.footprint m0 s));\n let m2 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m2;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (B.loc_disjoint (B.loc_buffer pn_sm) (B.loc_buffer dst `B.loc_union` CTR.footprint m0 s));\n let m3 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v sample_offset) (U32.v sample_offset + 16)) in\n assert (B.as_seq m3 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m4 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m4 mask == Ghost.reveal gmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask0 = B.index mask 0ul in\n let f_logxor = f `Secret.logxor` mask0 in\n let f_bf = Secret.get_bitfield (f_logxor) 0ul protected_bits in\n let f' = Secret.set_bitfield f 0ul protected_bits f_bf in\n B.upd dst 0ul f';\n let m5 = HST.get () in\n let gpacket' = Ghost.hide (Seq.cons f' (Seq.slice (B.as_seq m0 dst) 1 (B.length dst))) in\n assert (Ghost.reveal gpacket' `Seq.equal` B.as_seq m5 dst);\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n pn_sizemask pn_sm (Secret.cast_up Secret.U32 pn_len `Secret.add` Secret.hide 1ul);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m6 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len))) 0) in\n assert (Ghost.reveal gpnmask == B.as_seq m6 pnmask);\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n HST.pop_frame ();\n let m7 = HST.get () in\n assert (B.as_seq m7 dst == Lemmas.secret_xor_inplace gpacket' gpnmask (U32.v pn_offset))\n\n#pop-options\n\n#push-options \"--z3rlimit 32 --query_stats\"\n\n#restart-solver\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer U8.t)\n: HST.Stack unit\n (requires (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n 0 < l /\\ l < pow2 32 /\\ (\n let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\ (\n match Parse.putative_pn_offset (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some pn_offset' ->\n U32.v pn_offset == pn_offset' /\\\n pn_offset' + 20 <= l\n ))))\n (ensures (fun m _ m' ->\n match Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some res ->\n let len_mod = U32.v pn_offset + res.Spec.pn_len + 1 in\n res.Spec.pn_offset == U32.v pn_offset /\\\n len_mod <= B.length dst /\\\n B.modifies (B.loc_buffer (B.gsub dst 0ul (U32.uint_to_t len_mod)) `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n res.Spec.packet == B.as_seq m' dst", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n s: NotEverCrypt.CTR.state (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n k: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n cid_len: QUIC.Spec.Base.short_dcid_len_t ->\n is_short: Prims.bool ->\n pn_offset: FStar.UInt32.t ->\n dst: LowStar.Buffer.buffer FStar.UInt8.t\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "NotEverCrypt.CTR.state", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "QUIC.Spec.Base.short_dcid_len_t", "Prims.bool", "FStar.UInt32.t", "FStar.UInt8.t", "LowStar.Monotonic.Buffer.modifies_loc_buffer_from_to_intro", "LowStar.Buffer.trivial_preorder", "FStar.UInt32.__uint_to_t", "FStar.Ghost.reveal", "NotEverCrypt.CTR.footprint", "FStar.Ghost.erased", "FStar.Ghost.hide", "FStar.UInt32.uint_to_t", "Prims.op_Addition", "FStar.UInt32.v", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__pn_len", "FStar.Pervasives.Native.__proj__Some__item__v", "QUIC.Spec.Header.header_decrypt_aux_t", "QUIC.Spec.Header.header_decrypt_aux", "LowStar.Monotonic.Buffer.as_seq", "Prims.unit", "QUIC.Spec.Header.header_decrypt_aux_post", "QUIC.Impl.Header.header_decrypt_aux_ct_correct", "QUIC.Impl.Header.header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct", "QUIC.Secret.Seq.seq_hide", "Lib.IntTypes.U8", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "QUIC.Secret.Buffer.with_whole_buffer_hide_weak_modifies", "LowStar.Monotonic.Buffer.loc", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.loc_buffer", "FStar.Seq.Properties.lseq", "LowStar.Monotonic.Buffer.length", "Prims.l_and", "Prims.eq2", "FStar.Seq.Base.seq", "QUIC.Spec.Base.byte", "Prims.l_or", "Prims.b2t", "Prims.op_LessThan", "FStar.Seq.Base.length", "Prims.pow2", "Prims.nat", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__packet", "QUIC.Impl.Header.header_decrypt_aux_ct_secret_preserving_not_retry_spec", "NotEverCrypt.CTR.invariant", "QUIC.Impl.Header.header_decrypt_aux_ct_secret_preserving_not_retry'", "LowStar.Monotonic.Buffer.all_live", "Prims.Cons", "LowStar.Monotonic.Buffer.buf_t", "LowStar.Monotonic.Buffer.buf", "Prims.Nil", "Spec.Agile.Cipher.key_length", "LowStar.Monotonic.Buffer.all_disjoint", "Prims.l_iff", "Prims.int", "LowParse.BitFields.get_bitfield", "Prims.l_not", "Prims.op_AmpAmp", "Prims.op_Negation", "Prims.op_Equality", "QUIC.Spec.Header.Parse.putative_pn_offset", "Prims.l_False", "Prims.op_GreaterThanOrEqual", "FStar.UInt.size", "FStar.UInt32.n", "Prims.op_LessThanOrEqual", "Prims.logical", "Lib.IntTypes.range", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.PUB", "FStar.Seq.Base.index", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__is_retry", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__pn_offset", "LowStar.Monotonic.Buffer.modifies", "LowStar.Buffer.gsub" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_decrypt_aux_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer U8.t)\n : HST.Stack unit\n (requires\n (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\ CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint [CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\ 0 < l /\\\n l < pow2 32 /\\\n (let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~(not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\\n (match Parse.putative_pn_offset (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some pn_offset' -> U32.v pn_offset == pn_offset' /\\ pn_offset' + 20 <= l))))\n (ensures\n (fun m _ m' ->\n match Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some res ->\n let len_mod = U32.v pn_offset + res.Spec.pn_len + 1 in\n res.Spec.pn_offset == U32.v pn_offset /\\ len_mod <= B.length dst /\\\n B.modifies ((B.loc_buffer (B.gsub dst 0ul (U32.uint_to_t len_mod)))\n `B.loc_union`\n (CTR.footprint m s))\n m\n m' /\\ CTR.invariant m' s /\\ CTR.footprint m s == CTR.footprint m' s /\\\n res.Spec.packet == B.as_seq m' dst))\nlet header_decrypt_aux_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer U8.t)\n : HST.Stack unit\n (requires\n (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\ CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint [CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\ 0 < l /\\\n l < pow2 32 /\\\n (let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~(not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\\n (match Parse.putative_pn_offset (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some pn_offset' -> U32.v pn_offset == pn_offset' /\\ pn_offset' + 20 <= l))))\n (ensures\n (fun m _ m' ->\n match Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some res ->\n let len_mod = U32.v pn_offset + res.Spec.pn_len + 1 in\n res.Spec.pn_offset == U32.v pn_offset /\\ len_mod <= B.length dst /\\\n B.modifies ((B.loc_buffer (B.gsub dst 0ul (U32.uint_to_t len_mod)))\n `B.loc_union`\n (CTR.footprint m s))\n m\n m' /\\ CTR.invariant m' s /\\ CTR.footprint m s == CTR.footprint m' s /\\\n res.Spec.packet == B.as_seq m' dst)) =", "completed_definiton": "let m = HST.get () in\nSecretBuffer.with_whole_buffer_hide_weak_modifies #unit\n dst\n m\n ((CTR.footprint m s) `B.loc_union` (B.loc_buffer k))\n (CTR.footprint m s)\n true\n (fun _ cont m' ->\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a\n (B.as_seq m k)\n (U32.v cid_len)\n (Seq.seq_hide #Secret.U8 (B.as_seq m dst))\n is_short\n (U32.v pn_offset))\n .Spec.packet ==\n cont /\\ CTR.invariant m' s /\\ CTR.footprint m s == CTR.footprint m' s)\n (fun _ bs ->\n header_decrypt_aux_ct_secret_preserving_not_retry' a s k cid_len is_short pn_offset bs);\nlet m' = HST.get () in\nheader_decrypt_aux_ct_secret_preserving_not_retry_spec_correct a\n (B.as_seq m k)\n (U32.v cid_len)\n (Seq.seq_hide #Secret.U8 (B.as_seq m dst))\n is_short\n (U32.v pn_offset);\nheader_decrypt_aux_ct_correct a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst);\nSpec.header_decrypt_aux_post a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst);\nlet len_mod =\n Ghost.hide (U32.uint_to_t (U32.v pn_offset +\n (Some?.v (Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst)))\n .Spec.pn_len +\n 1))\nin\nB.modifies_loc_buffer_from_to_intro dst 0ul len_mod (CTR.footprint m s) m m'", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.pn_sizemask_ct_num", "original_source_type": "val pn_sizemask_ct_num (pn_len: PN.packet_number_length_t)\n : Tot\n (x:\n Secret.uint32{pn_sizemask_ct (Secret.v pn_len - 1) == FStar.Endianness.n_to_be 4 (Secret.v x)}\n )", "source_type": "val pn_sizemask_ct_num (pn_len: PN.packet_number_length_t)\n : Tot\n (x:\n Secret.uint32{pn_sizemask_ct (Secret.v pn_len - 1) == FStar.Endianness.n_to_be 4 (Secret.v x)}\n )", "source_definition": "let pn_sizemask_ct_num\n (pn_len: PN.packet_number_length_t)\n: Tot (x: Secret.uint32 { pn_sizemask_ct (Secret.v pn_len - 1) == FStar.Endianness.n_to_be 4 (Secret.v x) })\n=\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` (Secret.v pn_len - 1)));\n [@inline_let]\n let n0 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 24) in\n [@inline_let]\n let n1 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 16) in\n [@inline_let]\n let n2 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 8) in\n [@inline_let]\n let n3 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 0) in\n let pn_len_1 = pn_len `Secret.sub` Secret.to_u32 1ul in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n0)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n1)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n2)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n3))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 297, "start_col": 2, "end_line": 310, "end_col": 110 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)\n\nlet pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma\n (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\n= let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n pow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\n Lemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i\n\nlet header_encrypt_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: GTot packet\n= \n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256\"\n\nlet header_encrypt_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: Lemma\n (header_encrypt_ct a hpk h c `Seq.equal` Spec.header_encrypt a hpk h c)\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then ()\n else begin\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Parse.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header { ~ (Spec.is_retry h) })\n (r: Seq.seq Secret.uint8 {\n Seq.length r >= Parse.pn_offset h + 20\n })\n: GTot (Seq.seq Secret.uint8)\n= \n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = (Seq.slice r (pn_offset + 4) (pn_offset + 20)) in\n let mask = (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide (pn_sizemask_ct pn_len)) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n let r = Lemmas.secret_xor_inplace r pnmask pn_offset in\n let r = Seq.cons f' (Seq.slice r 1 (Seq.length r)) in\n r\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 2\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n: Lemma\n (requires (\n (~ (Spec.is_retry h))\n ))\n (ensures (\n let r = Parse.format_header h `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide r))\n ))\n= header_encrypt_ct_correct a hpk h c;\n let fmt = Parse.format_header h in\n let len = Seq.length fmt in\n let pr = fmt `Seq.append` c in\n assert (Seq.length pr >= Parse.pn_offset h + 20);\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let psample = Seq.slice c (3 - pn_len) (19 - pn_len) in\n assert (c `Seq.equal` Seq.slice pr len (Seq.length pr));\n let pn_off = Parse.pn_offset h in\n assert (pn_off + pn_len + 1 == len);\n assert (c == Seq.slice pr (pn_off + pn_len + 1) (Seq.length pr));\n Seq.slice_slice pr (pn_off + pn_len + 1) (Seq.length pr) (3 - pn_len) (19 - pn_len);\n assert (psample == Seq.slice pr (pn_off + 4) (pn_off + 20));\n let r = Seq.seq_hide #Secret.U8 pr in\n let sample = Seq.slice r (pn_off + 4) (pn_off + 20) in\n assert (sample == Seq.seq_hide #Secret.U8 psample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n assert (mask == Seq.seq_hide pmask);\n let mask15 = Seq.slice mask 1 5 in\n let ppnszmask = pn_sizemask_ct pn_len in\n let pnszmask = Seq.seq_hide ppnszmask in\n let pnmask = Lemmas.secret_and_inplace mask15 pnszmask 0 in\n let pmask15 = Seq.slice pmask 1 5 in\n let ppnmask = Lemmas.and_inplace pmask15 ppnszmask 0 in\n Lemmas.secret_and_inplace_eq mask15 pnszmask 0;\n assert (pnmask == Seq.seq_hide #Secret.U8 ppnmask);\n let f = Seq.index r 0 in\n let pf : Secret.uint_t Secret.U8 Secret.PUB = Seq.index pr 0 in\n assert (f == Secret.hide #Secret.U8 #Secret.PUB pf);\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 (U32.v protected_bits) (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 (U32.v protected_bits))) in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n assert (U8.v pf' == Secret.v f');\n assert (f' == Secret.hide #Secret.U8 pf');\n let pr1 = Lemmas.xor_inplace pr ppnmask pn_off in\n let r1 = Lemmas.secret_xor_inplace r pnmask pn_off in\n Lemmas.secret_xor_inplace_eq r pnmask pn_off;\n assert (r1 == Seq.seq_hide #Secret.U8 pr1);\n let r2 = Seq.cons f' (Seq.slice r1 1 (Seq.length r1)) in\n let pr2 = Seq.cons pf' (Seq.slice pr1 1 (Seq.length pr1)) in\n Seq.cons_seq_hide #Secret.U8 pf' (Seq.slice pr1 1 (Seq.length pr1));\n assert (r2 == Seq.seq_hide #Secret.U8 pr2)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet pn_sizemask_ct_num\n (pn_len: PN.packet_number_length_t)\n: Tot (x: Secret.uint32 { pn_sizemask_ct (Secret.v pn_len - 1) == FStar.Endianness.n_to_be 4 (Secret.v x) })", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t\n -> x:\n Lib.IntTypes.uint32\n { QUIC.Impl.Header.pn_sizemask_ct (QUIC.Secret.Int.Base.v pn_len - 1) ==\n FStar.Endianness.n_to_be 4 (QUIC.Secret.Int.Base.v x) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "Lib.IntTypes.add", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "Lib.IntTypes.mul", "QUIC.Secret.Int.secrets_are_equal_32_2", "Lib.IntTypes.to_u32", "Lib.IntTypes.PUB", "FStar.UInt32.__uint_to_t", "FStar.UInt32.uint_to_t", "Lib.IntTypes.int_t", "Lib.IntTypes.sub", "FStar.UInt.uint_t", "FStar.Pervasives.norm", "Prims.Cons", "FStar.Pervasives.norm_step", "FStar.Pervasives.delta", "FStar.Pervasives.zeta", "FStar.Pervasives.iota", "FStar.Pervasives.primops", "Prims.Nil", "FStar.UInt32.n", "Prims.op_Subtraction", "Prims.pow2", "Prims.unit", "FStar.Math.Lemmas.pow2_lt_compat", "Prims.op_Multiply", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.uint32", "Prims.eq2", "FStar.Seq.Base.seq", "QUIC.Spec.Base.byte", "Prims.l_or", "Prims.b2t", "Prims.op_Equality", "Prims.nat", "FStar.Seq.Base.length", "Prims.l_and", "FStar.UInt8.t", "FStar.Endianness.be_to_n", "QUIC.Impl.Header.pn_sizemask_ct", "FStar.Endianness.n_to_be" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val pn_sizemask_ct_num (pn_len: PN.packet_number_length_t)\n : Tot\n (x:\n Secret.uint32{pn_sizemask_ct (Secret.v pn_len - 1) == FStar.Endianness.n_to_be 4 (Secret.v x)}\n )\nlet pn_sizemask_ct_num (pn_len: PN.packet_number_length_t)\n : Tot\n (x:\n Secret.uint32{pn_sizemask_ct (Secret.v pn_len - 1) == FStar.Endianness.n_to_be 4 (Secret.v x)}\n ) =", "completed_definiton": "FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` (Secret.v pn_len - 1)));\n[@@ inline_let ]let n0 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 24) in\n[@@ inline_let ]let n1 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 16) in\n[@@ inline_let ]let n2 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 8) in\n[@@ inline_let ]let n3 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 0) in\nlet pn_len_1 = pn_len `Secret.sub` (Secret.to_u32 1ul) in\n((((pn_len_1 `Secret.secrets_are_equal_32_2` (Secret.to_u32 0ul))\n `Secret.mul`\n (Secret.to_u32 (U32.uint_to_t n0)))\n `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` (Secret.to_u32 1ul))\n `Secret.mul`\n (Secret.to_u32 (U32.uint_to_t n1))))\n `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` (Secret.to_u32 2ul))\n `Secret.mul`\n (Secret.to_u32 (U32.uint_to_t n2))))\n`Secret.add`\n((pn_len_1 `Secret.secrets_are_equal_32_2` (Secret.to_u32 3ul))\n `Secret.mul`\n (Secret.to_u32 (U32.uint_to_t n3)))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.header_encrypt_ct_correct", "original_source_type": "val header_encrypt_ct_correct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n : Lemma ((header_encrypt_ct a hpk h c) `Seq.equal` (Spec.header_encrypt a hpk h c))", "source_type": "val header_encrypt_ct_correct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n : Lemma ((header_encrypt_ct a hpk h c) `Seq.equal` (Spec.header_encrypt a hpk h c))", "source_definition": "let header_encrypt_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: Lemma\n (header_encrypt_ct a hpk h c `Seq.equal` Spec.header_encrypt a hpk h c)\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then ()\n else begin\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Parse.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 169, "start_col": 2, "end_line": 195, "end_col": 5 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)\n\nlet pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma\n (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\n= let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n pow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\n Lemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i\n\nlet header_encrypt_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: GTot packet\n= \n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256\"\n\nlet header_encrypt_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: Lemma\n (header_encrypt_ct a hpk h c `Seq.equal` Spec.header_encrypt a hpk h c)", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 256, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n h: QUIC.Spec.Header.Base.header ->\n c: QUIC.Spec.Crypto.cbytes' (QUIC.Spec.Header.Base.is_retry h)\n -> FStar.Pervasives.Lemma\n (ensures\n FStar.Seq.Base.equal (QUIC.Impl.Header.header_encrypt_ct a hpk h c)\n (QUIC.Spec.Header.header_encrypt a hpk h c))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "QUIC.Spec.Header.Base.header", "QUIC.Spec.Crypto.cbytes'", "QUIC.Spec.Header.Base.is_retry", "Prims.bool", "QUIC.Spec.Lemmas.xor_inplace_zero", "FStar.Seq.Base.slice", "QUIC.Spec.Base.byte", "Prims.op_Addition", "FStar.Seq.Base.length", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "QUIC.Spec.Lemmas.and_inplace_zero", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.PUB", "QUIC.Impl.Header.pn_sizemask_ct", "QUIC.Impl.Header.index_pn_sizemask_ct_right", "Prims.unit", "QUIC.Spec.Lemmas.pointwise_op_empty", "FStar.UInt8.logxor", "QUIC.Spec.Lemmas.pointwise_op_split", "FStar.Seq.Properties.lemma_split", "Prims._assert", "FStar.Seq.Base.equal", "FStar.UInt8.logand", "QUIC.Spec.Base.bytes", "QUIC.Spec.Lemmas.and_inplace", "QUIC.Spec.Header.pn_sizemask", "FStar.Seq.Base.seq", "Lib.IntTypes.int_t", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.SEC", "QUIC.Spec.Header.block_of_sample", "QUIC.Secret.Seq.seq_hide", "Prims.op_Subtraction", "Prims.int", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "QUIC.Spec.Header.Base.pn_length", "Prims.l_and", "Prims.eq2", "Lib.IntTypes.v", "QUIC.Spec.Header.Base.header_len", "QUIC.Spec.Header.Parse.pn_offset", "FStar.Seq.Base.append", "QUIC.Spec.Header.Parse.format_header", "FStar.Pervasives.assert_norm", "QUIC.Spec.Crypto.max_cipher_length", "Prims.pow2", "Prims.l_True", "Prims.squash", "QUIC.Impl.Header.header_encrypt_ct", "QUIC.Spec.Header.header_encrypt", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_encrypt_ct_correct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n : Lemma ((header_encrypt_ct a hpk h c) `Seq.equal` (Spec.header_encrypt a hpk h c))\nlet header_encrypt_ct_correct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n : Lemma ((header_encrypt_ct a hpk h c) `Seq.equal` (Spec.header_encrypt a hpk h c)) =", "completed_definiton": "assert_norm (max_cipher_length < pow2 62);\nlet r = (Parse.format_header h) `Seq.append` c in\nif Spec.is_retry h\nthen ()\nelse\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Parse.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3 - pn_len) (19 - pn_len)) in\n let mask =\n Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample)\n in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive =\n Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0\n in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` (Seq.slice pnmask_ct 0 (pn_len + 1)));\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor\n (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r))\n (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive))\n 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r))\n (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i)\n 0", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.block_of_sample", "original_source_type": "val block_of_sample\n (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k sample: B.buffer Secret.uint8)\n : HST.Stack unit\n (requires\n fun h0 ->\n B.(all_live h0 [buf dst; buf k; buf sample]) /\\ CTR.invariant h0 s /\\\n B.(all_disjoint [CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\ B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\ B.length sample = 16)\n (ensures\n fun h0 _ h1 ->\n B.(modifies ((loc_buffer dst) `loc_union` (CTR.footprint h0 s)) h0 h1) /\\\n (B.as_seq h1 dst)\n `Seq.equal`\n (Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample)) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\ CTR.invariant h1 s)", "source_type": "val block_of_sample\n (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k sample: B.buffer Secret.uint8)\n : HST.Stack unit\n (requires\n fun h0 ->\n B.(all_live h0 [buf dst; buf k; buf sample]) /\\ CTR.invariant h0 s /\\\n B.(all_disjoint [CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\ B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\ B.length sample = 16)\n (ensures\n fun h0 _ h1 ->\n B.(modifies ((loc_buffer dst) `loc_union` (CTR.footprint h0 s)) h0 h1) /\\\n (B.as_seq h1 dst)\n `Seq.equal`\n (Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample)) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\ CTR.invariant h1 s)", "source_definition": "let block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 68, "start_col": 2, "end_line": 112, "end_col": 18 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 256, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: Spec.Agile.Cipher.cipher_alg ->\n dst: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n s: NotEverCrypt.CTR.state a ->\n k: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n sample: LowStar.Buffer.buffer Lib.IntTypes.uint8\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Spec.Agile.Cipher.cipher_alg", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "NotEverCrypt.CTR.state", "FStar.HyperStack.ST.pop_frame", "Prims.unit", "LowStar.Monotonic.Buffer.blit", "NotEverCrypt.CTR.uint8", "LowStar.Buffer.trivial_preorder", "FStar.UInt32.__uint_to_t", "Prims._assert", "FStar.Seq.Base.equal", "LowStar.Monotonic.Buffer.as_seq", "FStar.Seq.Base.slice", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "Spec.Agile.Cipher.ctr_block", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "LowStar.Monotonic.Buffer.mbuffer", "LowStar.Buffer.sub", "FStar.Ghost.hide", "FStar.UInt32.t", "QUIC.Impl.Lemmas.seq_map2_xor0", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "NotEverCrypt.CTR.update_block", "NotEverCrypt.CTR.alg", "NotEverCrypt.CTR.init", "Lib.RawIntTypes.u32_to_UInt32", "Lib.IntTypes.int_t", "QUIC.Secret.Buffer.load32_le", "Lib.IntTypes.uint32", "Prims.eq2", "Prims.int", "LowStar.Monotonic.Buffer.length", "QUIC.Secret.Buffer.load32_be", "QUIC.Impl.Header.block_len", "Prims.l_and", "Prims.nat", "FStar.UInt32.v", "FStar.UInt32.uint_to_t", "Prims.b2t", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "LowStar.Buffer.alloca", "Lib.IntTypes.to_u8", "Lib.IntTypes.U1", "Lib.IntTypes.PUB", "FStar.UInt8.__uint_to_t", "FStar.HyperStack.ST.push_frame", "LowStar.Monotonic.Buffer.all_live", "Prims.Cons", "LowStar.Monotonic.Buffer.buf_t", "LowStar.Monotonic.Buffer.buf", "Prims.Nil", "NotEverCrypt.CTR.invariant", "LowStar.Monotonic.Buffer.all_disjoint", "LowStar.Monotonic.Buffer.loc", "NotEverCrypt.CTR.footprint", "LowStar.Monotonic.Buffer.loc_buffer", "Prims.l_or", "Spec.Agile.Cipher.AES128", "Spec.Agile.Cipher.AES256", "Spec.Agile.Cipher.CHACHA20", "Prims.op_Equality", "Spec.Agile.Cipher.key_length", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_union", "QUIC.Spec.Header.block_of_sample" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val block_of_sample\n (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k sample: B.buffer Secret.uint8)\n : HST.Stack unit\n (requires\n fun h0 ->\n B.(all_live h0 [buf dst; buf k; buf sample]) /\\ CTR.invariant h0 s /\\\n B.(all_disjoint [CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\ B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\ B.length sample = 16)\n (ensures\n fun h0 _ h1 ->\n B.(modifies ((loc_buffer dst) `loc_union` (CTR.footprint h0 s)) h0 h1) /\\\n (B.as_seq h1 dst)\n `Seq.equal`\n (Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample)) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\ CTR.invariant h1 s)\nlet block_of_sample\n (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k sample: B.buffer Secret.uint8)\n : HST.Stack unit\n (requires\n fun h0 ->\n B.(all_live h0 [buf dst; buf k; buf sample]) /\\ CTR.invariant h0 s /\\\n B.(all_disjoint [CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\ B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\ B.length sample = 16)\n (ensures\n fun h0 _ h1 ->\n B.(modifies ((loc_buffer dst) `loc_union` (CTR.footprint h0 s)) h0 h1) /\\\n (B.as_seq h1 dst)\n `Seq.equal`\n (Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample)) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\ CTR.invariant h1 s) =", "completed_definiton": "HST.push_frame ();\nlet h0 = HST.get () in\nlet zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\nlet zeroes = B.sub zeroes' 0ul (block_len a) in\nlet dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\nlet dst_block = B.sub dst_block' 0ul (block_len a) in\n(match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n let h1 = HST.get () in\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n let h2 = HST.get () in\n Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n assert ((B.as_seq h2 dst_block)\n `Seq.equal`\n (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)));\n let dst_slice = B.sub dst_block 0ul 16ul in\n assert ((B.as_seq h2 dst_slice)\n `Seq.equal`\n (Seq.slice (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)) 0 16));\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n let h1 = HST.get () in\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n let h2 = HST.get () in\n Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n assert ((B.as_seq h2 dst_block)\n `Seq.equal`\n (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)));\n let dst_slice = B.sub dst_block 0ul 16ul in\n assert ((B.as_seq h2 dst_slice)\n `Seq.equal`\n (Seq.slice (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)) 0 16));\n B.blit dst_slice 0ul dst 0ul 16ul);\nHST.pop_frame ()", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.header_encrypt_ct_secret_preserving_not_retry_spec_correct", "original_source_type": "val header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n : Lemma (requires ((~(Spec.is_retry h))))\n (ensures\n (let r = (Parse.format_header h) `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c ==\n Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a\n hpk\n h\n (Seq.seq_hide r))))", "source_type": "val header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n : Lemma (requires ((~(Spec.is_retry h))))\n (ensures\n (let r = (Parse.format_header h) `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c ==\n Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a\n hpk\n h\n (Seq.seq_hide r))))", "source_definition": "let header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n: Lemma\n (requires (\n (~ (Spec.is_retry h))\n ))\n (ensures (\n let r = Parse.format_header h `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide r))\n ))\n= header_encrypt_ct_correct a hpk h c;\n let fmt = Parse.format_header h in\n let len = Seq.length fmt in\n let pr = fmt `Seq.append` c in\n assert (Seq.length pr >= Parse.pn_offset h + 20);\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let psample = Seq.slice c (3 - pn_len) (19 - pn_len) in\n assert (c `Seq.equal` Seq.slice pr len (Seq.length pr));\n let pn_off = Parse.pn_offset h in\n assert (pn_off + pn_len + 1 == len);\n assert (c == Seq.slice pr (pn_off + pn_len + 1) (Seq.length pr));\n Seq.slice_slice pr (pn_off + pn_len + 1) (Seq.length pr) (3 - pn_len) (19 - pn_len);\n assert (psample == Seq.slice pr (pn_off + 4) (pn_off + 20));\n let r = Seq.seq_hide #Secret.U8 pr in\n let sample = Seq.slice r (pn_off + 4) (pn_off + 20) in\n assert (sample == Seq.seq_hide #Secret.U8 psample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n assert (mask == Seq.seq_hide pmask);\n let mask15 = Seq.slice mask 1 5 in\n let ppnszmask = pn_sizemask_ct pn_len in\n let pnszmask = Seq.seq_hide ppnszmask in\n let pnmask = Lemmas.secret_and_inplace mask15 pnszmask 0 in\n let pmask15 = Seq.slice pmask 1 5 in\n let ppnmask = Lemmas.and_inplace pmask15 ppnszmask 0 in\n Lemmas.secret_and_inplace_eq mask15 pnszmask 0;\n assert (pnmask == Seq.seq_hide #Secret.U8 ppnmask);\n let f = Seq.index r 0 in\n let pf : Secret.uint_t Secret.U8 Secret.PUB = Seq.index pr 0 in\n assert (f == Secret.hide #Secret.U8 #Secret.PUB pf);\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 (U32.v protected_bits) (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 (U32.v protected_bits))) in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n assert (U8.v pf' == Secret.v f');\n assert (f' == Secret.hide #Secret.U8 pf');\n let pr1 = Lemmas.xor_inplace pr ppnmask pn_off in\n let r1 = Lemmas.secret_xor_inplace r pnmask pn_off in\n Lemmas.secret_xor_inplace_eq r pnmask pn_off;\n assert (r1 == Seq.seq_hide #Secret.U8 pr1);\n let r2 = Seq.cons f' (Seq.slice r1 1 (Seq.length r1)) in\n let pr2 = Seq.cons pf' (Seq.slice pr1 1 (Seq.length pr1)) in\n Seq.cons_seq_hide #Secret.U8 pf' (Seq.slice pr1 1 (Seq.length pr1));\n assert (r2 == Seq.seq_hide #Secret.U8 pr2)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 242, "start_col": 2, "end_line": 284, "end_col": 44 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)\n\nlet pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma\n (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\n= let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n pow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\n Lemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i\n\nlet header_encrypt_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: GTot packet\n= \n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256\"\n\nlet header_encrypt_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: Lemma\n (header_encrypt_ct a hpk h c `Seq.equal` Spec.header_encrypt a hpk h c)\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then ()\n else begin\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Parse.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header { ~ (Spec.is_retry h) })\n (r: Seq.seq Secret.uint8 {\n Seq.length r >= Parse.pn_offset h + 20\n })\n: GTot (Seq.seq Secret.uint8)\n= \n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = (Seq.slice r (pn_offset + 4) (pn_offset + 20)) in\n let mask = (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide (pn_sizemask_ct pn_len)) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n let r = Lemmas.secret_xor_inplace r pnmask pn_offset in\n let r = Seq.cons f' (Seq.slice r 1 (Seq.length r)) in\n r\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 2\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n: Lemma\n (requires (\n (~ (Spec.is_retry h))\n ))\n (ensures (\n let r = Parse.format_header h `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide r))", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 2, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 256, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n h: QUIC.Spec.Header.Base.header ->\n c: QUIC.Spec.Crypto.cbytes\n -> FStar.Pervasives.Lemma (requires ~(QUIC.Spec.Header.Base.is_retry h))\n (ensures\n (let r = FStar.Seq.Base.append (QUIC.Spec.Header.Parse.format_header h) c in\n FStar.Seq.Base.length r >= QUIC.Spec.Header.Parse.pn_offset h + 20 /\\\n QUIC.Spec.Header.header_encrypt a hpk h c ==\n QUIC.Secret.Seq.seq_reveal (QUIC.Impl.Header.header_encrypt_ct_secret_preserving_not_retry_spec\n a\n hpk\n h\n (QUIC.Secret.Seq.seq_hide r))))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "QUIC.Spec.Header.Base.header", "QUIC.Spec.Crypto.cbytes", "Prims._assert", "Prims.eq2", "FStar.Seq.Base.seq", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "QUIC.Secret.Seq.seq_hide", "Prims.unit", "QUIC.Secret.Seq.cons_seq_hide", "FStar.Seq.Base.slice", "QUIC.Spec.Base.byte", "FStar.Seq.Base.length", "FStar.Seq.Properties.cons", "Lib.IntTypes.int_t", "Lib.IntTypes.uint8", "QUIC.Impl.Lemmas.secret_xor_inplace_eq", "QUIC.Impl.Lemmas.secret_xor_inplace", "QUIC.Spec.Base.bytes", "QUIC.Spec.Lemmas.xor_inplace", "Prims.l_or", "Prims.int", "Lib.IntTypes.range", "FStar.UInt.size", "Lib.IntTypes.bits", "QUIC.Secret.Int.Base.v", "LowParse.BitFields.set_bitfield", "FStar.UInt32.v", "FStar.UInt32.__uint_to_t", "QUIC.Secret.Int.get_bitfield", "Lib.IntTypes.logxor", "FStar.Seq.Base.index", "Lib.IntTypes.range_t", "Lib.IntTypes.PUB", "QUIC.Secret.Int.hide", "FStar.UInt8.n", "FStar.UInt8.v", "Lib.IntTypes.v", "FStar.UInt32.uint_to_t", "FStar.UInt32.t", "QUIC.Secret.Int.set_bitfield", "FStar.UInt8.t", "FStar.UInt8.uint_to_t", "LowParse.BitFields.get_bitfield", "FStar.UInt.logxor", "Prims.l_and", "Prims.b2t", "Prims.op_LessThan", "Prims.op_LessThanOrEqual", "QUIC.Spec.Header.Base.uu___is_MShort", "Prims.bool", "QUIC.Impl.Lemmas.secret_and_inplace_eq", "QUIC.Spec.Lemmas.and_inplace", "QUIC.Impl.Lemmas.secret_and_inplace", "QUIC.Spec.Base.lbytes", "QUIC.Impl.Header.pn_sizemask_ct", "QUIC.Secret.Seq.seq_reveal", "FStar.Seq.Properties.lseq", "QUIC.Spec.Header.block_of_sample", "Prims.op_Addition", "FStar.Seq.Properties.slice_slice", "Prims.op_Subtraction", "Prims.nat", "Lib.IntTypes.U32", "QUIC.Spec.Header.Base.pn_length", "QUIC.Spec.Header.Base.header_len", "QUIC.Spec.Header.Parse.pn_offset", "FStar.Seq.Base.equal", "Prims.op_GreaterThanOrEqual", "FStar.Seq.Base.append", "QUIC.Spec.Header.Parse.format_header", "QUIC.Impl.Header.header_encrypt_ct_correct", "Prims.l_not", "QUIC.Spec.Header.Base.is_retry", "Prims.squash", "QUIC.Spec.Header.header_encrypt", "QUIC.Impl.Header.header_encrypt_ct_secret_preserving_not_retry_spec", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n : Lemma (requires ((~(Spec.is_retry h))))\n (ensures\n (let r = (Parse.format_header h) `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c ==\n Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a\n hpk\n h\n (Seq.seq_hide r))))\nlet header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n : Lemma (requires ((~(Spec.is_retry h))))\n (ensures\n (let r = (Parse.format_header h) `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c ==\n Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a\n hpk\n h\n (Seq.seq_hide r)))) =", "completed_definiton": "header_encrypt_ct_correct a hpk h c;\nlet fmt = Parse.format_header h in\nlet len = Seq.length fmt in\nlet pr = fmt `Seq.append` c in\nassert (Seq.length pr >= Parse.pn_offset h + 20);\nlet pn_len = Secret.v (Spec.pn_length h) - 1 in\nlet psample = Seq.slice c (3 - pn_len) (19 - pn_len) in\nassert (c `Seq.equal` (Seq.slice pr len (Seq.length pr)));\nlet pn_off = Parse.pn_offset h in\nassert (pn_off + pn_len + 1 == len);\nassert (c == Seq.slice pr (pn_off + pn_len + 1) (Seq.length pr));\nSeq.slice_slice pr (pn_off + pn_len + 1) (Seq.length pr) (3 - pn_len) (19 - pn_len);\nassert (psample == Seq.slice pr (pn_off + 4) (pn_off + 20));\nlet r = Seq.seq_hide #Secret.U8 pr in\nlet sample = Seq.slice r (pn_off + 4) (pn_off + 20) in\nassert (sample == Seq.seq_hide #Secret.U8 psample);\nlet mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\nlet pmask = Seq.seq_reveal mask in\nassert (mask == Seq.seq_hide pmask);\nlet mask15 = Seq.slice mask 1 5 in\nlet ppnszmask = pn_sizemask_ct pn_len in\nlet pnszmask = Seq.seq_hide ppnszmask in\nlet pnmask = Lemmas.secret_and_inplace mask15 pnszmask 0 in\nlet pmask15 = Seq.slice pmask 1 5 in\nlet ppnmask = Lemmas.and_inplace pmask15 ppnszmask 0 in\nLemmas.secret_and_inplace_eq mask15 pnszmask 0;\nassert (pnmask == Seq.seq_hide #Secret.U8 ppnmask);\nlet f = Seq.index r 0 in\nlet pf:Secret.uint_t Secret.U8 Secret.PUB = Seq.index pr 0 in\nassert (f == Secret.hide #Secret.U8 #Secret.PUB pf);\nlet protected_bits = if Spec.MShort? h then 5ul else 4ul in\nlet pf' =\n U8.uint_to_t (BF.set_bitfield (U8.v pf)\n 0\n (U32.v protected_bits)\n (BF.get_bitfield ((U8.v pf) `FStar.UInt.logxor` (U8.v (Seq.index pmask 0)))\n 0\n (U32.v protected_bits)))\nin\nlet f' =\n Secret.set_bitfield f\n 0ul\n protected_bits\n (Secret.get_bitfield (f `Secret.logxor` (Seq.index mask 0)) 0ul protected_bits)\nin\nassert (U8.v pf' == Secret.v f');\nassert (f' == Secret.hide #Secret.U8 pf');\nlet pr1 = Lemmas.xor_inplace pr ppnmask pn_off in\nlet r1 = Lemmas.secret_xor_inplace r pnmask pn_off in\nLemmas.secret_xor_inplace_eq r pnmask pn_off;\nassert (r1 == Seq.seq_hide #Secret.U8 pr1);\nlet r2 = Seq.cons f' (Seq.slice r1 1 (Seq.length r1)) in\nlet pr2 = Seq.cons pf' (Seq.slice pr1 1 (Seq.length pr1)) in\nSeq.cons_seq_hide #Secret.U8 pf' (Seq.slice pr1 1 (Seq.length pr1));\nassert (r2 == Seq.seq_hide #Secret.U8 pr2)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.header_encrypt_ct_secret_preserving_not_retry", "original_source_type": "val header_encrypt_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (h: Ghost.erased Spec.header)\n (is_short: bool)\n (pn_offset: U32.t)\n (pn_len: PN.packet_number_length_t)\n (dst: B.buffer Secret.uint8)\n : HST.Stack unit\n (requires\n (fun m ->\n let fmt = (Parse.format_header h) in\n let hlen = Seq.length fmt in\n B.all_live m [B.buf k; B.buf dst] /\\ CTR.invariant m s /\\\n B.all_disjoint [CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n (~(Spec.is_retry h)) /\\ is_short == (Spec.MShort? h) /\\\n U32.v pn_offset == Parse.pn_offset h /\\ pn_len == Parse.pn_length h /\\\n hlen + 19 <= B.length dst /\\\n Seq.slice (Seq.seq_reveal #Secret.U8 (B.as_seq m dst)) 0 hlen == fmt))\n (ensures\n (fun m _ m' ->\n B.modifies ((B.loc_buffer dst) `B.loc_union` (CTR.footprint m s)) m m' /\\\n CTR.invariant m' s /\\ CTR.footprint m s == CTR.footprint m' s /\\\n header_encrypt_ct_secret_preserving_not_retry_spec a (B.as_seq m k) h (B.as_seq m dst) ==\n B.as_seq m' dst))", "source_type": "val header_encrypt_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (h: Ghost.erased Spec.header)\n (is_short: bool)\n (pn_offset: U32.t)\n (pn_len: PN.packet_number_length_t)\n (dst: B.buffer Secret.uint8)\n : HST.Stack unit\n (requires\n (fun m ->\n let fmt = (Parse.format_header h) in\n let hlen = Seq.length fmt in\n B.all_live m [B.buf k; B.buf dst] /\\ CTR.invariant m s /\\\n B.all_disjoint [CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n (~(Spec.is_retry h)) /\\ is_short == (Spec.MShort? h) /\\\n U32.v pn_offset == Parse.pn_offset h /\\ pn_len == Parse.pn_length h /\\\n hlen + 19 <= B.length dst /\\\n Seq.slice (Seq.seq_reveal #Secret.U8 (B.as_seq m dst)) 0 hlen == fmt))\n (ensures\n (fun m _ m' ->\n B.modifies ((B.loc_buffer dst) `B.loc_union` (CTR.footprint m s)) m m' /\\\n CTR.invariant m' s /\\ CTR.footprint m s == CTR.footprint m' s /\\\n header_encrypt_ct_secret_preserving_not_retry_spec a (B.as_seq m k) h (B.as_seq m dst) ==\n B.as_seq m' dst))", "source_definition": "let header_encrypt_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (h: Ghost.erased Spec.header)\n (is_short: bool)\n (pn_offset: U32.t)\n (pn_len: PN.packet_number_length_t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let fmt = (Parse.format_header h) in\n let hlen = Seq.length fmt in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n (~ (Spec.is_retry h)) /\\\n is_short == (Spec.MShort? h) /\\\n U32.v pn_offset == Parse.pn_offset h /\\\n pn_len == Parse.pn_length h /\\\n hlen + 19 <= B.length dst /\\\n Seq.slice (Seq.seq_reveal #Secret.U8 (B.as_seq m dst)) 0 hlen == fmt\n ))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n header_encrypt_ct_secret_preserving_not_retry_spec a (B.as_seq m k) h (B.as_seq m dst) == B.as_seq m' dst\n ))\n= assert (U32.v pn_offset + 20 <= B.length dst);\n let m0 = HST.get () in\n HST.push_frame ();\n let m01 = HST.get () in\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n B.loc_unused_in_not_unused_in_disjoint m01;\n let m02 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m02;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n let m03 = HST.get () in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (CTR.footprint m03 s == CTR.footprint m0 s);\n assert (B.loc_disjoint (B.loc_buffer mask `B.loc_union` B.loc_buffer pn_sm) (CTR.footprint m0 s `B.loc_union` B.loc_buffer k `B.loc_union` B.loc_buffer dst));\n let sample = B.sub dst (pn_offset `U32.add` 4ul) 16ul in\n let m1 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v pn_offset + 4) (U32.v pn_offset + 20)) in\n assert (B.as_seq m1 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m2 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m2 mask == Ghost.reveal gmask);\n pn_sizemask pn_sm pn_len;\n let m3 = HST.get () in\n assert (B.as_seq m3 mask == Ghost.reveal gmask);\n let gpn_sm = Ghost.hide (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len - 1))) in\n assert (B.as_seq m3 pn_sm == Ghost.reveal gpn_sm);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m4 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) gpn_sm 0) in\n assert (B.as_seq m4 pnmask == Ghost.reveal gpnmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask_0 = B.index mask 0ul in\n assert (mask_0 == Seq.index (B.as_seq m4 (B.gsub mask 0ul 1ul)) 0);\n assert (mask_0 == Seq.index gmask 0);\n let f_ = B.index dst 0ul in\n assert (f_ == Seq.index (B.as_seq m0 dst) 0);\n let f_logxor = f_ `Secret.logxor` mask_0 in\n let f_get_bf = Secret.get_bitfield f_logxor 0ul protected_bits in\n let f' = Secret.set_bitfield f_ 0ul protected_bits f_get_bf in\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n let m5 = HST.get () in\n let gr1 = Ghost.hide (Lemmas.secret_xor_inplace (B.as_seq m0 dst) gpnmask (U32.v pn_offset)) in\n assert (B.as_seq m5 dst == Ghost.reveal gr1);\n B.upd dst 0ul f' ;\n HST.pop_frame ();\n let m6 = HST.get () in\n assert (B.as_seq m6 dst `Seq.equal` (f' `Seq.cons` Seq.slice (Ghost.reveal gr1) 1 (B.length dst)))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 360, "start_col": 2, "end_line": 407, "end_col": 100 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)\n\nlet pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma\n (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\n= let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n pow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\n Lemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i\n\nlet header_encrypt_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: GTot packet\n= \n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256\"\n\nlet header_encrypt_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: Lemma\n (header_encrypt_ct a hpk h c `Seq.equal` Spec.header_encrypt a hpk h c)\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then ()\n else begin\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Parse.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header { ~ (Spec.is_retry h) })\n (r: Seq.seq Secret.uint8 {\n Seq.length r >= Parse.pn_offset h + 20\n })\n: GTot (Seq.seq Secret.uint8)\n= \n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = (Seq.slice r (pn_offset + 4) (pn_offset + 20)) in\n let mask = (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide (pn_sizemask_ct pn_len)) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n let r = Lemmas.secret_xor_inplace r pnmask pn_offset in\n let r = Seq.cons f' (Seq.slice r 1 (Seq.length r)) in\n r\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 2\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n: Lemma\n (requires (\n (~ (Spec.is_retry h))\n ))\n (ensures (\n let r = Parse.format_header h `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide r))\n ))\n= header_encrypt_ct_correct a hpk h c;\n let fmt = Parse.format_header h in\n let len = Seq.length fmt in\n let pr = fmt `Seq.append` c in\n assert (Seq.length pr >= Parse.pn_offset h + 20);\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let psample = Seq.slice c (3 - pn_len) (19 - pn_len) in\n assert (c `Seq.equal` Seq.slice pr len (Seq.length pr));\n let pn_off = Parse.pn_offset h in\n assert (pn_off + pn_len + 1 == len);\n assert (c == Seq.slice pr (pn_off + pn_len + 1) (Seq.length pr));\n Seq.slice_slice pr (pn_off + pn_len + 1) (Seq.length pr) (3 - pn_len) (19 - pn_len);\n assert (psample == Seq.slice pr (pn_off + 4) (pn_off + 20));\n let r = Seq.seq_hide #Secret.U8 pr in\n let sample = Seq.slice r (pn_off + 4) (pn_off + 20) in\n assert (sample == Seq.seq_hide #Secret.U8 psample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n assert (mask == Seq.seq_hide pmask);\n let mask15 = Seq.slice mask 1 5 in\n let ppnszmask = pn_sizemask_ct pn_len in\n let pnszmask = Seq.seq_hide ppnszmask in\n let pnmask = Lemmas.secret_and_inplace mask15 pnszmask 0 in\n let pmask15 = Seq.slice pmask 1 5 in\n let ppnmask = Lemmas.and_inplace pmask15 ppnszmask 0 in\n Lemmas.secret_and_inplace_eq mask15 pnszmask 0;\n assert (pnmask == Seq.seq_hide #Secret.U8 ppnmask);\n let f = Seq.index r 0 in\n let pf : Secret.uint_t Secret.U8 Secret.PUB = Seq.index pr 0 in\n assert (f == Secret.hide #Secret.U8 #Secret.PUB pf);\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 (U32.v protected_bits) (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 (U32.v protected_bits))) in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n assert (U8.v pf' == Secret.v f');\n assert (f' == Secret.hide #Secret.U8 pf');\n let pr1 = Lemmas.xor_inplace pr ppnmask pn_off in\n let r1 = Lemmas.secret_xor_inplace r pnmask pn_off in\n Lemmas.secret_xor_inplace_eq r pnmask pn_off;\n assert (r1 == Seq.seq_hide #Secret.U8 pr1);\n let r2 = Seq.cons f' (Seq.slice r1 1 (Seq.length r1)) in\n let pr2 = Seq.cons pf' (Seq.slice pr1 1 (Seq.length pr1)) in\n Seq.cons_seq_hide #Secret.U8 pf' (Seq.slice pr1 1 (Seq.length pr1));\n assert (r2 == Seq.seq_hide #Secret.U8 pr2)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet pn_sizemask_ct_num\n (pn_len: PN.packet_number_length_t)\n: Tot (x: Secret.uint32 { pn_sizemask_ct (Secret.v pn_len - 1) == FStar.Endianness.n_to_be 4 (Secret.v x) })\n=\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` (Secret.v pn_len - 1)));\n [@inline_let]\n let n0 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 24) in\n [@inline_let]\n let n1 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 16) in\n [@inline_let]\n let n2 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 8) in\n [@inline_let]\n let n3 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 0) in\n let pn_len_1 = pn_len `Secret.sub` Secret.to_u32 1ul in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n0)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n1)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n2)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n3))\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet pn_sizemask (dst: B.buffer Secret.uint8) (pn_len: PN.packet_number_length_t): HST.Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\ B.length dst == 4)\n (ensures fun h0 _ h1 ->\n B.as_seq h1 dst `Seq.equal` Seq.seq_hide (pn_sizemask_ct (Secret.v pn_len - 1)) /\\\n B.(modifies (loc_buffer dst) h0 h1))\n= let x = pn_sizemask_ct_num pn_len in\n SecretBuffer.store32_be dst x\n\n#push-options \"--z3rlimit 512 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (h: Ghost.erased Spec.header)\n (is_short: bool)\n (pn_offset: U32.t)\n (pn_len: PN.packet_number_length_t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let fmt = (Parse.format_header h) in\n let hlen = Seq.length fmt in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n (~ (Spec.is_retry h)) /\\\n is_short == (Spec.MShort? h) /\\\n U32.v pn_offset == Parse.pn_offset h /\\\n pn_len == Parse.pn_length h /\\\n hlen + 19 <= B.length dst /\\\n Seq.slice (Seq.seq_reveal #Secret.U8 (B.as_seq m dst)) 0 hlen == fmt\n ))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n header_encrypt_ct_secret_preserving_not_retry_spec a (B.as_seq m k) h (B.as_seq m dst) == B.as_seq m' dst", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 1, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 512, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n s: NotEverCrypt.CTR.state (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n k: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n h: FStar.Ghost.erased QUIC.Spec.Header.Base.header ->\n is_short: Prims.bool ->\n pn_offset: FStar.UInt32.t ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n dst: LowStar.Buffer.buffer Lib.IntTypes.uint8\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "NotEverCrypt.CTR.state", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "FStar.Ghost.erased", "QUIC.Spec.Header.Base.header", "Prims.bool", "FStar.UInt32.t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "Prims._assert", "FStar.Seq.Base.equal", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Buffer.trivial_preorder", "FStar.Seq.Properties.cons", "FStar.Seq.Base.slice", "FStar.Ghost.reveal", "FStar.Seq.Base.seq", "LowStar.Monotonic.Buffer.length", "Prims.unit", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "FStar.HyperStack.ST.pop_frame", "LowStar.Monotonic.Buffer.upd", "FStar.UInt32.__uint_to_t", "Prims.eq2", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "FStar.Ghost.hide", "QUIC.Impl.Lemmas.secret_xor_inplace", "FStar.UInt32.v", "QUIC.Impl.Lemmas.op_inplace", "Lib.IntTypes.logxor", "Prims.int", "Prims.l_or", "Lib.IntTypes.range", "FStar.UInt.size", "Lib.IntTypes.v", "LowParse.BitFields.set_bitfield", "FStar.UInt32.uint_to_t", "QUIC.Secret.Int.set_bitfield", "Prims.l_and", "Prims.b2t", "Prims.op_LessThan", "Prims.pow2", "Prims.op_Subtraction", "LowParse.BitFields.get_bitfield", "QUIC.Secret.Int.get_bitfield", "FStar.Seq.Base.index", "LowStar.Monotonic.Buffer.index", "LowStar.Buffer.gsub", "Prims.op_LessThanOrEqual", "Lib.IntTypes.bits", "QUIC.Impl.Lemmas.secret_and_inplace", "Lib.IntTypes.logand", "LowStar.Monotonic.Buffer.mbuffer", "LowStar.Buffer.sub", "QUIC.Secret.Seq.seq_hide", "QUIC.Impl.Header.pn_sizemask_ct", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "QUIC.Impl.Header.pn_sizemask", "QUIC.Spec.Header.block_of_sample", "FStar.Seq.Properties.lseq", "QUIC.Impl.Header.block_of_sample", "Prims.op_Addition", "FStar.UInt32.add", "LowStar.Monotonic.Buffer.loc_disjoint", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.loc_buffer", "NotEverCrypt.CTR.footprint", "LowStar.Monotonic.Buffer.loc", "Prims.nat", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "LowStar.Buffer.alloca", "Lib.IntTypes.to_u8", "Lib.IntTypes.U1", "Lib.IntTypes.PUB", "FStar.UInt8.__uint_to_t", "LowStar.Monotonic.Buffer.loc_unused_in_not_unused_in_disjoint", "FStar.HyperStack.ST.push_frame", "LowStar.Monotonic.Buffer.all_live", "Prims.Cons", "LowStar.Monotonic.Buffer.buf_t", "LowStar.Monotonic.Buffer.buf", "Prims.Nil", "NotEverCrypt.CTR.invariant", "LowStar.Monotonic.Buffer.all_disjoint", "Spec.Agile.Cipher.key_length", "Prims.l_not", "QUIC.Spec.Header.Base.is_retry", "QUIC.Spec.Header.Base.uu___is_MShort", "FStar.UInt32.n", "Prims.op_GreaterThanOrEqual", "QUIC.Spec.Header.Base.pn_length", "QUIC.Spec.Header.Base.header_len", "QUIC.Spec.Header.Parse.pn_offset", "QUIC.Spec.Base.byte", "Lib.IntTypes.uint_t", "QUIC.Secret.Seq.seq_reveal", "FStar.Seq.Base.length", "QUIC.Spec.Base.lbytes", "QUIC.Spec.Header.Parse.format_header", "LowStar.Monotonic.Buffer.modifies", "QUIC.Impl.Header.header_encrypt_ct_secret_preserving_not_retry_spec" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_encrypt_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (h: Ghost.erased Spec.header)\n (is_short: bool)\n (pn_offset: U32.t)\n (pn_len: PN.packet_number_length_t)\n (dst: B.buffer Secret.uint8)\n : HST.Stack unit\n (requires\n (fun m ->\n let fmt = (Parse.format_header h) in\n let hlen = Seq.length fmt in\n B.all_live m [B.buf k; B.buf dst] /\\ CTR.invariant m s /\\\n B.all_disjoint [CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n (~(Spec.is_retry h)) /\\ is_short == (Spec.MShort? h) /\\\n U32.v pn_offset == Parse.pn_offset h /\\ pn_len == Parse.pn_length h /\\\n hlen + 19 <= B.length dst /\\\n Seq.slice (Seq.seq_reveal #Secret.U8 (B.as_seq m dst)) 0 hlen == fmt))\n (ensures\n (fun m _ m' ->\n B.modifies ((B.loc_buffer dst) `B.loc_union` (CTR.footprint m s)) m m' /\\\n CTR.invariant m' s /\\ CTR.footprint m s == CTR.footprint m' s /\\\n header_encrypt_ct_secret_preserving_not_retry_spec a (B.as_seq m k) h (B.as_seq m dst) ==\n B.as_seq m' dst))\nlet header_encrypt_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (h: Ghost.erased Spec.header)\n (is_short: bool)\n (pn_offset: U32.t)\n (pn_len: PN.packet_number_length_t)\n (dst: B.buffer Secret.uint8)\n : HST.Stack unit\n (requires\n (fun m ->\n let fmt = (Parse.format_header h) in\n let hlen = Seq.length fmt in\n B.all_live m [B.buf k; B.buf dst] /\\ CTR.invariant m s /\\\n B.all_disjoint [CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n (~(Spec.is_retry h)) /\\ is_short == (Spec.MShort? h) /\\\n U32.v pn_offset == Parse.pn_offset h /\\ pn_len == Parse.pn_length h /\\\n hlen + 19 <= B.length dst /\\\n Seq.slice (Seq.seq_reveal #Secret.U8 (B.as_seq m dst)) 0 hlen == fmt))\n (ensures\n (fun m _ m' ->\n B.modifies ((B.loc_buffer dst) `B.loc_union` (CTR.footprint m s)) m m' /\\\n CTR.invariant m' s /\\ CTR.footprint m s == CTR.footprint m' s /\\\n header_encrypt_ct_secret_preserving_not_retry_spec a (B.as_seq m k) h (B.as_seq m dst) ==\n B.as_seq m' dst)) =", "completed_definiton": "assert (U32.v pn_offset + 20 <= B.length dst);\nlet m0 = HST.get () in\nHST.push_frame ();\nlet m01 = HST.get () in\nlet mask = B.alloca (Secret.to_u8 0uy) 16ul in\nB.loc_unused_in_not_unused_in_disjoint m01;\nlet m02 = HST.get () in\nB.loc_unused_in_not_unused_in_disjoint m02;\nlet pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\nlet m03 = HST.get () in\nassert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\nassert (CTR.footprint m03 s == CTR.footprint m0 s);\nassert (B.loc_disjoint ((B.loc_buffer mask) `B.loc_union` (B.loc_buffer pn_sm))\n (((CTR.footprint m0 s) `B.loc_union` (B.loc_buffer k)) `B.loc_union` (B.loc_buffer dst)));\nlet sample = B.sub dst (pn_offset `U32.add` 4ul) 16ul in\nlet m1 = HST.get () in\nlet gsample =\n Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v pn_offset + 4) (U32.v pn_offset + 20))\nin\nassert (B.as_seq m1 sample == Ghost.reveal gsample);\nblock_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\nlet m2 = HST.get () in\nlet gmask =\n Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample)\nin\nassert (B.as_seq m2 mask == Ghost.reveal gmask);\npn_sizemask pn_sm pn_len;\nlet m3 = HST.get () in\nassert (B.as_seq m3 mask == Ghost.reveal gmask);\nlet gpn_sm = Ghost.hide (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len - 1))) in\nassert (B.as_seq m3 pn_sm == Ghost.reveal gpn_sm);\nlet pnmask = B.sub mask 1ul 4ul in\nLemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\nlet m4 = HST.get () in\nlet gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) gpn_sm 0) in\nassert (B.as_seq m4 pnmask == Ghost.reveal gpnmask);\nlet protected_bits = if is_short then 5ul else 4ul in\nlet mask_0 = B.index mask 0ul in\nassert (mask_0 == Seq.index (B.as_seq m4 (B.gsub mask 0ul 1ul)) 0);\nassert (mask_0 == Seq.index gmask 0);\nlet f_ = B.index dst 0ul in\nassert (f_ == Seq.index (B.as_seq m0 dst) 0);\nlet f_logxor = f_ `Secret.logxor` mask_0 in\nlet f_get_bf = Secret.get_bitfield f_logxor 0ul protected_bits in\nlet f' = Secret.set_bitfield f_ 0ul protected_bits f_get_bf in\nLemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\nlet m5 = HST.get () in\nlet gr1 = Ghost.hide (Lemmas.secret_xor_inplace (B.as_seq m0 dst) gpnmask (U32.v pn_offset)) in\nassert (B.as_seq m5 dst == Ghost.reveal gr1);\nB.upd dst 0ul f';\nHST.pop_frame ();\nlet m6 = HST.get () in\nassert ((B.as_seq m6 dst)\n `Seq.equal`\n (f' `Seq.cons` (Seq.slice (Ghost.reveal gr1) 1 (B.length dst))))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.header_decrypt_aux_ct_secret_preserving_not_retry'", "original_source_type": "val header_decrypt_aux_ct_secret_preserving_not_retry'\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer Secret.uint8)\n : HST.Stack unit\n (requires\n (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\ CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint [CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\ 0 < l /\\\n l < pow2 32 /\\\n (let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~(not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\\n (match Parse.putative_pn_offset (U32.v cid_len) (Seq.seq_reveal (B.as_seq m dst)) with\n | None -> False\n | Some pn_offset' -> U32.v pn_offset == pn_offset' /\\ pn_offset' + 20 <= l))))\n (ensures\n (fun m _ m' ->\n B.modifies ((B.loc_buffer dst) `B.loc_union` (CTR.footprint m s)) m m' /\\\n CTR.invariant m' s /\\ CTR.footprint m s == CTR.footprint m' s /\\\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a\n (B.as_seq m k)\n (U32.v cid_len)\n (B.as_seq m dst)\n is_short\n (U32.v pn_offset))\n .Spec.packet ==\n Seq.seq_reveal (B.as_seq m' dst)))", "source_type": "val header_decrypt_aux_ct_secret_preserving_not_retry'\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer Secret.uint8)\n : HST.Stack unit\n (requires\n (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\ CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint [CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\ 0 < l /\\\n l < pow2 32 /\\\n (let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~(not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\\n (match Parse.putative_pn_offset (U32.v cid_len) (Seq.seq_reveal (B.as_seq m dst)) with\n | None -> False\n | Some pn_offset' -> U32.v pn_offset == pn_offset' /\\ pn_offset' + 20 <= l))))\n (ensures\n (fun m _ m' ->\n B.modifies ((B.loc_buffer dst) `B.loc_union` (CTR.footprint m s)) m m' /\\\n CTR.invariant m' s /\\ CTR.footprint m s == CTR.footprint m' s /\\\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a\n (B.as_seq m k)\n (U32.v cid_len)\n (B.as_seq m dst)\n is_short\n (U32.v pn_offset))\n .Spec.packet ==\n Seq.seq_reveal (B.as_seq m' dst)))", "source_definition": "let header_decrypt_aux_ct_secret_preserving_not_retry'\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n 0 < l /\\ l < pow2 32 /\\ (\n let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\ (\n match Parse.putative_pn_offset (U32.v cid_len) (Seq.seq_reveal (B.as_seq m dst)) with\n | None -> False\n | Some pn_offset' ->\n U32.v pn_offset == pn_offset' /\\\n pn_offset' + 20 <= l\n ))))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) is_short (U32.v pn_offset)).Spec.packet == Seq.seq_reveal (B.as_seq m' dst)\n ))\n= let m0 = HST.get () in\n let f = B.index dst 0ul in\n let sample_offset = pn_offset `U32.add` 4ul in\n let sample = B.sub dst sample_offset 16ul in\n HST.push_frame ();\n let m1 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m1;\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer dst `B.loc_union` CTR.footprint m0 s));\n let m2 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m2;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (B.loc_disjoint (B.loc_buffer pn_sm) (B.loc_buffer dst `B.loc_union` CTR.footprint m0 s));\n let m3 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v sample_offset) (U32.v sample_offset + 16)) in\n assert (B.as_seq m3 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m4 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m4 mask == Ghost.reveal gmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask0 = B.index mask 0ul in\n let f_logxor = f `Secret.logxor` mask0 in\n let f_bf = Secret.get_bitfield (f_logxor) 0ul protected_bits in\n let f' = Secret.set_bitfield f 0ul protected_bits f_bf in\n B.upd dst 0ul f';\n let m5 = HST.get () in\n let gpacket' = Ghost.hide (Seq.cons f' (Seq.slice (B.as_seq m0 dst) 1 (B.length dst))) in\n assert (Ghost.reveal gpacket' `Seq.equal` B.as_seq m5 dst);\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n pn_sizemask pn_sm (Secret.cast_up Secret.U32 pn_len `Secret.add` Secret.hide 1ul);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m6 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len))) 0) in\n assert (Ghost.reveal gpnmask == B.as_seq m6 pnmask);\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n HST.pop_frame ();\n let m7 = HST.get () in\n assert (B.as_seq m7 dst == Lemmas.secret_xor_inplace gpacket' gpnmask (U32.v pn_offset))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 696, "start_col": 1, "end_line": 736, "end_col": 90 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)\n\nlet pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma\n (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\n= let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n pow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\n Lemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i\n\nlet header_encrypt_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: GTot packet\n= \n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256\"\n\nlet header_encrypt_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: Lemma\n (header_encrypt_ct a hpk h c `Seq.equal` Spec.header_encrypt a hpk h c)\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then ()\n else begin\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Parse.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header { ~ (Spec.is_retry h) })\n (r: Seq.seq Secret.uint8 {\n Seq.length r >= Parse.pn_offset h + 20\n })\n: GTot (Seq.seq Secret.uint8)\n= \n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = (Seq.slice r (pn_offset + 4) (pn_offset + 20)) in\n let mask = (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide (pn_sizemask_ct pn_len)) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n let r = Lemmas.secret_xor_inplace r pnmask pn_offset in\n let r = Seq.cons f' (Seq.slice r 1 (Seq.length r)) in\n r\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 2\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n: Lemma\n (requires (\n (~ (Spec.is_retry h))\n ))\n (ensures (\n let r = Parse.format_header h `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide r))\n ))\n= header_encrypt_ct_correct a hpk h c;\n let fmt = Parse.format_header h in\n let len = Seq.length fmt in\n let pr = fmt `Seq.append` c in\n assert (Seq.length pr >= Parse.pn_offset h + 20);\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let psample = Seq.slice c (3 - pn_len) (19 - pn_len) in\n assert (c `Seq.equal` Seq.slice pr len (Seq.length pr));\n let pn_off = Parse.pn_offset h in\n assert (pn_off + pn_len + 1 == len);\n assert (c == Seq.slice pr (pn_off + pn_len + 1) (Seq.length pr));\n Seq.slice_slice pr (pn_off + pn_len + 1) (Seq.length pr) (3 - pn_len) (19 - pn_len);\n assert (psample == Seq.slice pr (pn_off + 4) (pn_off + 20));\n let r = Seq.seq_hide #Secret.U8 pr in\n let sample = Seq.slice r (pn_off + 4) (pn_off + 20) in\n assert (sample == Seq.seq_hide #Secret.U8 psample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n assert (mask == Seq.seq_hide pmask);\n let mask15 = Seq.slice mask 1 5 in\n let ppnszmask = pn_sizemask_ct pn_len in\n let pnszmask = Seq.seq_hide ppnszmask in\n let pnmask = Lemmas.secret_and_inplace mask15 pnszmask 0 in\n let pmask15 = Seq.slice pmask 1 5 in\n let ppnmask = Lemmas.and_inplace pmask15 ppnszmask 0 in\n Lemmas.secret_and_inplace_eq mask15 pnszmask 0;\n assert (pnmask == Seq.seq_hide #Secret.U8 ppnmask);\n let f = Seq.index r 0 in\n let pf : Secret.uint_t Secret.U8 Secret.PUB = Seq.index pr 0 in\n assert (f == Secret.hide #Secret.U8 #Secret.PUB pf);\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 (U32.v protected_bits) (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 (U32.v protected_bits))) in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n assert (U8.v pf' == Secret.v f');\n assert (f' == Secret.hide #Secret.U8 pf');\n let pr1 = Lemmas.xor_inplace pr ppnmask pn_off in\n let r1 = Lemmas.secret_xor_inplace r pnmask pn_off in\n Lemmas.secret_xor_inplace_eq r pnmask pn_off;\n assert (r1 == Seq.seq_hide #Secret.U8 pr1);\n let r2 = Seq.cons f' (Seq.slice r1 1 (Seq.length r1)) in\n let pr2 = Seq.cons pf' (Seq.slice pr1 1 (Seq.length pr1)) in\n Seq.cons_seq_hide #Secret.U8 pf' (Seq.slice pr1 1 (Seq.length pr1));\n assert (r2 == Seq.seq_hide #Secret.U8 pr2)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet pn_sizemask_ct_num\n (pn_len: PN.packet_number_length_t)\n: Tot (x: Secret.uint32 { pn_sizemask_ct (Secret.v pn_len - 1) == FStar.Endianness.n_to_be 4 (Secret.v x) })\n=\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` (Secret.v pn_len - 1)));\n [@inline_let]\n let n0 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 24) in\n [@inline_let]\n let n1 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 16) in\n [@inline_let]\n let n2 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 8) in\n [@inline_let]\n let n3 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 0) in\n let pn_len_1 = pn_len `Secret.sub` Secret.to_u32 1ul in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n0)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n1)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n2)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n3))\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet pn_sizemask (dst: B.buffer Secret.uint8) (pn_len: PN.packet_number_length_t): HST.Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\ B.length dst == 4)\n (ensures fun h0 _ h1 ->\n B.as_seq h1 dst `Seq.equal` Seq.seq_hide (pn_sizemask_ct (Secret.v pn_len - 1)) /\\\n B.(modifies (loc_buffer dst) h0 h1))\n= let x = pn_sizemask_ct_num pn_len in\n SecretBuffer.store32_be dst x\n\n#push-options \"--z3rlimit 512 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (h: Ghost.erased Spec.header)\n (is_short: bool)\n (pn_offset: U32.t)\n (pn_len: PN.packet_number_length_t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let fmt = (Parse.format_header h) in\n let hlen = Seq.length fmt in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n (~ (Spec.is_retry h)) /\\\n is_short == (Spec.MShort? h) /\\\n U32.v pn_offset == Parse.pn_offset h /\\\n pn_len == Parse.pn_length h /\\\n hlen + 19 <= B.length dst /\\\n Seq.slice (Seq.seq_reveal #Secret.U8 (B.as_seq m dst)) 0 hlen == fmt\n ))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n header_encrypt_ct_secret_preserving_not_retry_spec a (B.as_seq m k) h (B.as_seq m dst) == B.as_seq m' dst\n ))\n= assert (U32.v pn_offset + 20 <= B.length dst);\n let m0 = HST.get () in\n HST.push_frame ();\n let m01 = HST.get () in\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n B.loc_unused_in_not_unused_in_disjoint m01;\n let m02 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m02;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n let m03 = HST.get () in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (CTR.footprint m03 s == CTR.footprint m0 s);\n assert (B.loc_disjoint (B.loc_buffer mask `B.loc_union` B.loc_buffer pn_sm) (CTR.footprint m0 s `B.loc_union` B.loc_buffer k `B.loc_union` B.loc_buffer dst));\n let sample = B.sub dst (pn_offset `U32.add` 4ul) 16ul in\n let m1 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v pn_offset + 4) (U32.v pn_offset + 20)) in\n assert (B.as_seq m1 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m2 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m2 mask == Ghost.reveal gmask);\n pn_sizemask pn_sm pn_len;\n let m3 = HST.get () in\n assert (B.as_seq m3 mask == Ghost.reveal gmask);\n let gpn_sm = Ghost.hide (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len - 1))) in\n assert (B.as_seq m3 pn_sm == Ghost.reveal gpn_sm);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m4 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) gpn_sm 0) in\n assert (B.as_seq m4 pnmask == Ghost.reveal gpnmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask_0 = B.index mask 0ul in\n assert (mask_0 == Seq.index (B.as_seq m4 (B.gsub mask 0ul 1ul)) 0);\n assert (mask_0 == Seq.index gmask 0);\n let f_ = B.index dst 0ul in\n assert (f_ == Seq.index (B.as_seq m0 dst) 0);\n let f_logxor = f_ `Secret.logxor` mask_0 in\n let f_get_bf = Secret.get_bitfield f_logxor 0ul protected_bits in\n let f' = Secret.set_bitfield f_ 0ul protected_bits f_get_bf in\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n let m5 = HST.get () in\n let gr1 = Ghost.hide (Lemmas.secret_xor_inplace (B.as_seq m0 dst) gpnmask (U32.v pn_offset)) in\n assert (B.as_seq m5 dst == Ghost.reveal gr1);\n B.upd dst 0ul f' ;\n HST.pop_frame ();\n let m6 = HST.get () in\n assert (B.as_seq m6 dst `Seq.equal` (f' `Seq.cons` Seq.slice (Ghost.reveal gr1) 1 (B.length dst)))\n\n#restart-solver\n\nlet header_encrypt\n a s k dst h is_short is_retry public_len pn_len\n= if is_retry\n then ()\n else begin\n let m = HST.get () in\n let hpk = Ghost.hide (B.as_seq m k) in\n let fmt = Ghost.hide (Parse.format_header (G.reveal h)) in\n let cipher = Ghost.hide (Seq.slice (B.as_seq m dst) (Seq.length fmt) (B.length dst)) in\n assert (B.as_seq m dst `Seq.equal` (fmt `Seq.append` cipher));\n header_encrypt_ct_secret_preserving_not_retry_spec_correct a hpk h cipher;\n assert (U32.v public_len + 20 <= B.length dst);\n let post (cont: Seq.lseq Secret.uint8 (B.length dst)) (m1: HS.mem) : GTot Type0 =\n header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst)) == cont /\\\n CTR.invariant m1 s /\\\n CTR.footprint m1 s == CTR.footprint m s\n in\n SecretBuffer.with_whole_buffer_hide_weak_modifies'\n #unit\n dst\n m\n (CTR.footprint m s `B.loc_union` B.loc_buffer k)\n (CTR.footprint m s)\n true\n (fun _ cont m1 ->\n post cont m1\n )\n (fun _ bs ->\n header_encrypt_ct_secret_preserving_not_retry a s k h is_short public_len pn_len bs\n )\n ;\n let m' = HST.get () in\n assert (B.as_seq m' dst == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst))));\n assert (B.as_seq m' dst == Spec.header_encrypt a (B.as_seq m k) h cipher)\n end\n\n#pop-options\n\n\n(* A constant-time specification of header_decrypt_aux which does not test or truncate on pn_len *)\n\nlet header_decrypt_aux_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: GTot (option Spec.header_decrypt_aux_t)\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet;\n Spec.pn_offset = ();\n Spec.pn_len = ();\n })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = pn_len;\n })\n end\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats\"\n\n#restart-solver\n\nlet header_decrypt_aux_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len packet == Spec.header_decrypt_aux a hpk cid_len packet)\n= \n let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then ()\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then ()\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> ()\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then ()\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal #Secret.U8 (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide #Secret.U8 sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n let r = packet' in\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#restart-solver\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })\n : GTot (Spec.header_decrypt_aux_t)\n=\n let f = Seq.index packet 0 in\n let sample_offset = pn_offset + 4 in\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` (Seq.index mask 0)) 0ul protected_bits) in\n let packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len))) 0 in\n let packet'' = Lemmas.secret_xor_inplace packet' pnmask pn_offset in\n {\n Spec.is_short = is_short;\n Spec.is_retry = false;\n Spec.packet = Seq.seq_reveal #Secret.U8 packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = Secret.v pn_len;\n }\n\n#push-options \"--z3rlimit 32\"\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet) == Some (header_decrypt_aux_ct_secret_preserving_not_retry_spec a hpk cid_len packet is_short pn_offset))\n= assert (Some? (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet)));\n let ppacket = Seq.seq_reveal packet in\n let f = Seq.index packet 0 in\n let pf = Seq.index ppacket 0 in\n assert (pf == Secret.reveal f);\n let is_short = (BF.get_bitfield #8 (Secret.v f) 7 8 = 0) in\n let Some pn_offset = Parse.putative_pn_offset cid_len ppacket in\n let sample_offset = pn_offset + 4 in\n let psample = Seq.slice ppacket sample_offset (sample_offset + 16) in\n let sample = Seq.slice packet sample_offset (sample_offset + 16) in\n assert (psample == Seq.seq_reveal sample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n let protected_bits = if is_short then 5 else 4 in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 protected_bits (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 protected_bits)) in\n let f' = Secret.set_bitfield f 0ul (U32.uint_to_t protected_bits) (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul (U32.uint_to_t protected_bits)) in\n assert (pf' == Secret.reveal f');\n let packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\n let ppacket' = Seq.cons pf' (Seq.slice ppacket 1 (Seq.length ppacket)) in\n assert (ppacket' `Seq.equal` Seq.seq_reveal packet');\n let ppn_len = BF.get_bitfield (U8.v pf') 0 2 in\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n assert (Secret.v pn_len == ppn_len);\n let ppnmask_ct = Lemmas.and_inplace (Seq.slice pmask 1 5) (pn_sizemask_ct ppn_len) 0 in\n let pnmask_ct = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct ppn_len)) 0 in\n Lemmas.secret_and_inplace_eq (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct ppn_len)) 0;\n assert (ppnmask_ct == Seq.seq_reveal pnmask_ct);\n Lemmas.secret_xor_inplace_eq packet' pnmask_ct pn_offset\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\ninline_for_extraction\nlet header_decrypt_aux_ct_secret_preserving_not_retry'\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n 0 < l /\\ l < pow2 32 /\\ (\n let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\ (\n match Parse.putative_pn_offset (U32.v cid_len) (Seq.seq_reveal (B.as_seq m dst)) with\n | None -> False\n | Some pn_offset' ->\n U32.v pn_offset == pn_offset' /\\\n pn_offset' + 20 <= l\n ))))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) is_short (U32.v pn_offset)).Spec.packet == Seq.seq_reveal (B.as_seq m' dst)", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 1, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 256, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n s: NotEverCrypt.CTR.state (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n k: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n cid_len: QUIC.Spec.Base.short_dcid_len_t ->\n is_short: Prims.bool ->\n pn_offset: FStar.UInt32.t ->\n dst: LowStar.Buffer.buffer Lib.IntTypes.uint8\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "NotEverCrypt.CTR.state", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "QUIC.Spec.Base.short_dcid_len_t", "Prims.bool", "FStar.UInt32.t", "Prims._assert", "Prims.eq2", "FStar.Seq.Base.seq", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Buffer.trivial_preorder", "QUIC.Impl.Lemmas.secret_xor_inplace", "FStar.Ghost.reveal", "FStar.UInt32.v", "Prims.unit", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "FStar.HyperStack.ST.pop_frame", "QUIC.Impl.Lemmas.op_inplace", "FStar.UInt32.__uint_to_t", "Lib.IntTypes.logxor", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "FStar.Ghost.erased", "Lib.IntTypes.int_t", "FStar.Ghost.hide", "QUIC.Impl.Lemmas.secret_and_inplace", "FStar.Seq.Base.slice", "QUIC.Secret.Seq.seq_hide", "QUIC.Impl.Header.pn_sizemask_ct", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.logand", "LowStar.Monotonic.Buffer.mbuffer", "LowStar.Buffer.sub", "QUIC.Impl.Header.pn_sizemask", "Lib.IntTypes.add", "Lib.IntTypes.U32", "QUIC.Secret.Int.cast_up", "QUIC.Secret.Int.hide", "Lib.IntTypes.PUB", "Prims.int", "Prims.l_or", "Lib.IntTypes.range", "Prims.l_and", "FStar.UInt.size", "Prims.b2t", "Prims.op_LessThan", "Prims.pow2", "Prims.op_Subtraction", "FStar.UInt32.uint_to_t", "Lib.IntTypes.v", "LowParse.BitFields.get_bitfield", "QUIC.Secret.Int.get_bitfield", "FStar.Seq.Base.equal", "FStar.Seq.Properties.cons", "LowStar.Monotonic.Buffer.length", "LowStar.Monotonic.Buffer.upd", "LowParse.BitFields.set_bitfield", "QUIC.Secret.Int.set_bitfield", "LowStar.Monotonic.Buffer.index", "Prims.op_LessThanOrEqual", "Lib.IntTypes.bits", "QUIC.Spec.Header.block_of_sample", "FStar.Seq.Properties.lseq", "QUIC.Impl.Header.block_of_sample", "Prims.op_Addition", "LowStar.Monotonic.Buffer.loc_disjoint", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Monotonic.Buffer.loc_union", "NotEverCrypt.CTR.footprint", "Prims.nat", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "LowStar.Buffer.alloca", "Lib.IntTypes.to_u8", "Lib.IntTypes.U1", "FStar.UInt8.__uint_to_t", "LowStar.Monotonic.Buffer.loc_unused_in_not_unused_in_disjoint", "FStar.HyperStack.ST.push_frame", "FStar.UInt32.add", "LowStar.Monotonic.Buffer.all_live", "Prims.Cons", "LowStar.Monotonic.Buffer.buf_t", "LowStar.Monotonic.Buffer.buf", "Prims.Nil", "NotEverCrypt.CTR.invariant", "Spec.Agile.Cipher.key_length", "LowStar.Monotonic.Buffer.all_disjoint", "LowStar.Monotonic.Buffer.loc", "Prims.l_iff", "Prims.l_not", "Prims.op_AmpAmp", "Prims.op_Equality", "QUIC.Spec.Header.Parse.putative_pn_offset", "QUIC.Secret.Seq.seq_reveal", "Prims.l_False", "Prims.op_GreaterThanOrEqual", "FStar.UInt32.n", "Prims.logical", "FStar.Seq.Base.index", "LowStar.Monotonic.Buffer.modifies", "QUIC.Spec.Base.byte", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__packet", "QUIC.Impl.Header.header_decrypt_aux_ct_secret_preserving_not_retry_spec" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_decrypt_aux_ct_secret_preserving_not_retry'\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer Secret.uint8)\n : HST.Stack unit\n (requires\n (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\ CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint [CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\ 0 < l /\\\n l < pow2 32 /\\\n (let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~(not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\\n (match Parse.putative_pn_offset (U32.v cid_len) (Seq.seq_reveal (B.as_seq m dst)) with\n | None -> False\n | Some pn_offset' -> U32.v pn_offset == pn_offset' /\\ pn_offset' + 20 <= l))))\n (ensures\n (fun m _ m' ->\n B.modifies ((B.loc_buffer dst) `B.loc_union` (CTR.footprint m s)) m m' /\\\n CTR.invariant m' s /\\ CTR.footprint m s == CTR.footprint m' s /\\\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a\n (B.as_seq m k)\n (U32.v cid_len)\n (B.as_seq m dst)\n is_short\n (U32.v pn_offset))\n .Spec.packet ==\n Seq.seq_reveal (B.as_seq m' dst)))\nlet header_decrypt_aux_ct_secret_preserving_not_retry'\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer Secret.uint8)\n : HST.Stack unit\n (requires\n (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\ CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint [CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\ 0 < l /\\\n l < pow2 32 /\\\n (let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~(not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\\n (match Parse.putative_pn_offset (U32.v cid_len) (Seq.seq_reveal (B.as_seq m dst)) with\n | None -> False\n | Some pn_offset' -> U32.v pn_offset == pn_offset' /\\ pn_offset' + 20 <= l))))\n (ensures\n (fun m _ m' ->\n B.modifies ((B.loc_buffer dst) `B.loc_union` (CTR.footprint m s)) m m' /\\\n CTR.invariant m' s /\\ CTR.footprint m s == CTR.footprint m' s /\\\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a\n (B.as_seq m k)\n (U32.v cid_len)\n (B.as_seq m dst)\n is_short\n (U32.v pn_offset))\n .Spec.packet ==\n Seq.seq_reveal (B.as_seq m' dst))) =", "completed_definiton": "let m0 = HST.get () in\nlet f = B.index dst 0ul in\nlet sample_offset = pn_offset `U32.add` 4ul in\nlet sample = B.sub dst sample_offset 16ul in\nHST.push_frame ();\nlet m1 = HST.get () in\nB.loc_unused_in_not_unused_in_disjoint m1;\nlet mask = B.alloca (Secret.to_u8 0uy) 16ul in\nassert (B.loc_disjoint (B.loc_buffer mask) ((B.loc_buffer dst) `B.loc_union` (CTR.footprint m0 s)));\nlet m2 = HST.get () in\nB.loc_unused_in_not_unused_in_disjoint m2;\nlet pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\nassert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\nassert (B.loc_disjoint (B.loc_buffer pn_sm) ((B.loc_buffer dst) `B.loc_union` (CTR.footprint m0 s)));\nlet m3 = HST.get () in\nlet gsample =\n Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v sample_offset) (U32.v sample_offset + 16))\nin\nassert (B.as_seq m3 sample == Ghost.reveal gsample);\nblock_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\nlet m4 = HST.get () in\nlet gmask =\n Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample)\nin\nassert (B.as_seq m4 mask == Ghost.reveal gmask);\nlet protected_bits = if is_short then 5ul else 4ul in\nlet mask0 = B.index mask 0ul in\nlet f_logxor = f `Secret.logxor` mask0 in\nlet f_bf = Secret.get_bitfield (f_logxor) 0ul protected_bits in\nlet f' = Secret.set_bitfield f 0ul protected_bits f_bf in\nB.upd dst 0ul f';\nlet m5 = HST.get () in\nlet gpacket' = Ghost.hide (Seq.cons f' (Seq.slice (B.as_seq m0 dst) 1 (B.length dst))) in\nassert ((Ghost.reveal gpacket') `Seq.equal` (B.as_seq m5 dst));\nlet pn_len = Secret.get_bitfield f' 0ul 2ul in\npn_sizemask pn_sm ((Secret.cast_up Secret.U32 pn_len) `Secret.add` (Secret.hide 1ul));\nlet pnmask = B.sub mask 1ul 4ul in\nLemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\nlet m6 = HST.get () in\nlet gpnmask =\n Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5)\n (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len)))\n 0)\nin\nassert (Ghost.reveal gpnmask == B.as_seq m6 pnmask);\nLemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\nHST.pop_frame ();\nlet m7 = HST.get () in\nassert (B.as_seq m7 dst == Lemmas.secret_xor_inplace gpacket' gpnmask (U32.v pn_offset))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.header_decrypt_not_retry", "original_source_type": "val header_decrypt_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m0: HS.mem)\n : HST.Stack h_result\n (requires\n (fun m ->\n header_decrypt_pre a s k cid_len last dst dst_len m0 /\\\n header_decrypt_aux_post a s k cid_len dst dst_len m0 HD_Success_NotRetry m))\n (ensures (fun _ rs m' -> header_decrypt_post a s k cid_len last dst dst_len m0 rs m'))", "source_type": "val header_decrypt_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m0: HS.mem)\n : HST.Stack h_result\n (requires\n (fun m ->\n header_decrypt_pre a s k cid_len last dst dst_len m0 /\\\n header_decrypt_aux_post a s k cid_len dst dst_len m0 HD_Success_NotRetry m))\n (ensures (fun _ rs m' -> header_decrypt_post a s k cid_len last dst dst_len m0 rs m'))", "source_definition": "let header_decrypt_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst:B.buffer U8.t)\n (dst_len: U32.t)\n (m0: HS.mem)\n: HST.Stack h_result\n (requires (fun m ->\n header_decrypt_pre a s k cid_len last dst dst_len m0 /\\\n header_decrypt_aux_post a s k cid_len dst dst_len m0 HD_Success_NotRetry m\n ))\n (ensures (fun _ rs m' ->\n header_decrypt_post a s k cid_len last dst dst_len m0 rs m'\n ))\n= \n let m1 = HST.get () in\n Classical.move_requires (Parse.parse_header_exists (U32.v cid_len) (Secret.v last)) (B.as_seq m1 dst);\n Classical.move_requires (Parse.parse_header_exists_recip (U32.v cid_len) (Secret.v last)) (B.as_seq m1 dst);\n (* In other cases, header_decrypt_aux already checked\n that the header can be parsed. *)\n Spec.header_decrypt_aux_post a (B.as_seq m0 k) (U32.v cid_len) (B.as_seq m0 dst);\n Spec.header_decrypt_aux_post_parse a (B.as_seq m0 k) (U32.v cid_len) (Secret.v last) (B.as_seq m0 dst);\n Parse.lemma_header_parsing_post (U32.v cid_len) (Secret.v last) (B.as_seq m1 dst);\n let (h, pn) = ParseImpl.read_header dst dst_len cid_len last in\n let m2 = HST.get () in\n ParseImpl.header_len_correct h m2 pn;\n let hlen = header_len h in\n assert (Seq.length (Parse.format_header (g_header h m2 pn)) == Secret.v hlen);\n assert (Secret.v hlen <= B.length dst);\n let rlen = Secret.hide dst_len `Secret.usub` hlen in\n let hlen64 = Secret.cast_up Secret.U64 hlen in\n let rlen64 = Secret.cast_up Secret.U64 rlen in\n let clen64 = if has_payload_length h then payload_length h else rlen64 in\n let clen64_checked : Secret.uint64 =\n Secret.max64 (Secret.min64 (Secret.min64 clen64 rlen64) (max_cipher_length64 `Secret.sub` Secret.hide 1uL)) (Secret.hide 16uL)\n in\n assert_norm (16 < max_cipher_length);\n assert (Secret.v clen64_checked < max_cipher_length);\n assert (Secret.v clen64_checked <= Secret.v rlen);\n assert_norm (max_cipher_length < pow2 32);\n let clen32 = Secret.cast_down Secret.U32 clen64_checked in\n let bh = Ghost.hide (B.gsub dst 0ul (Secret.reveal hlen)) in\n let brem = Ghost.hide (B.gsub dst (Secret.reveal hlen) (Secret.reveal rlen)) in\n let bc = Ghost.hide (B.gsub brem 0ul (Secret.reveal clen32)) in\n let b3 = Ghost.hide (B.gsub brem (Secret.reveal clen32) (Secret.reveal rlen `U32.sub` Secret.reveal clen32)) in\n assert (B.as_seq m2 bh == B.as_seq m1 bh);\n assert (B.as_seq m1 bh == Parse.format_header (g_header h m2 pn));\n assert (B.disjoint bh brem);\n assert (B.as_seq m2 brem == B.as_seq m1 brem);\n assert (B.as_seq m1 brem == B.as_seq m0 brem);\n assert (B.as_seq m2 bc == B.as_seq m1 bc);\n assert (B.as_seq m1 bc == B.as_seq m0 bc);\n assert (B.as_seq m2 b3 == B.as_seq m1 b3);\n assert (B.as_seq m1 b3 == B.as_seq m0 b3);\n assert (B.as_seq m2 dst `Seq.equal` (B.as_seq m2 bh `Seq.append` B.as_seq m2 bc `Seq.append` B.as_seq m2 b3));\n H_Success h pn clen32", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 981, "start_col": 1, "end_line": 1022, "end_col": 25 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)\n\nlet pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma\n (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\n= let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n pow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\n Lemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i\n\nlet header_encrypt_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: GTot packet\n= \n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256\"\n\nlet header_encrypt_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: Lemma\n (header_encrypt_ct a hpk h c `Seq.equal` Spec.header_encrypt a hpk h c)\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then ()\n else begin\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Parse.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header { ~ (Spec.is_retry h) })\n (r: Seq.seq Secret.uint8 {\n Seq.length r >= Parse.pn_offset h + 20\n })\n: GTot (Seq.seq Secret.uint8)\n= \n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = (Seq.slice r (pn_offset + 4) (pn_offset + 20)) in\n let mask = (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide (pn_sizemask_ct pn_len)) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n let r = Lemmas.secret_xor_inplace r pnmask pn_offset in\n let r = Seq.cons f' (Seq.slice r 1 (Seq.length r)) in\n r\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 2\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n: Lemma\n (requires (\n (~ (Spec.is_retry h))\n ))\n (ensures (\n let r = Parse.format_header h `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide r))\n ))\n= header_encrypt_ct_correct a hpk h c;\n let fmt = Parse.format_header h in\n let len = Seq.length fmt in\n let pr = fmt `Seq.append` c in\n assert (Seq.length pr >= Parse.pn_offset h + 20);\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let psample = Seq.slice c (3 - pn_len) (19 - pn_len) in\n assert (c `Seq.equal` Seq.slice pr len (Seq.length pr));\n let pn_off = Parse.pn_offset h in\n assert (pn_off + pn_len + 1 == len);\n assert (c == Seq.slice pr (pn_off + pn_len + 1) (Seq.length pr));\n Seq.slice_slice pr (pn_off + pn_len + 1) (Seq.length pr) (3 - pn_len) (19 - pn_len);\n assert (psample == Seq.slice pr (pn_off + 4) (pn_off + 20));\n let r = Seq.seq_hide #Secret.U8 pr in\n let sample = Seq.slice r (pn_off + 4) (pn_off + 20) in\n assert (sample == Seq.seq_hide #Secret.U8 psample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n assert (mask == Seq.seq_hide pmask);\n let mask15 = Seq.slice mask 1 5 in\n let ppnszmask = pn_sizemask_ct pn_len in\n let pnszmask = Seq.seq_hide ppnszmask in\n let pnmask = Lemmas.secret_and_inplace mask15 pnszmask 0 in\n let pmask15 = Seq.slice pmask 1 5 in\n let ppnmask = Lemmas.and_inplace pmask15 ppnszmask 0 in\n Lemmas.secret_and_inplace_eq mask15 pnszmask 0;\n assert (pnmask == Seq.seq_hide #Secret.U8 ppnmask);\n let f = Seq.index r 0 in\n let pf : Secret.uint_t Secret.U8 Secret.PUB = Seq.index pr 0 in\n assert (f == Secret.hide #Secret.U8 #Secret.PUB pf);\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 (U32.v protected_bits) (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 (U32.v protected_bits))) in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n assert (U8.v pf' == Secret.v f');\n assert (f' == Secret.hide #Secret.U8 pf');\n let pr1 = Lemmas.xor_inplace pr ppnmask pn_off in\n let r1 = Lemmas.secret_xor_inplace r pnmask pn_off in\n Lemmas.secret_xor_inplace_eq r pnmask pn_off;\n assert (r1 == Seq.seq_hide #Secret.U8 pr1);\n let r2 = Seq.cons f' (Seq.slice r1 1 (Seq.length r1)) in\n let pr2 = Seq.cons pf' (Seq.slice pr1 1 (Seq.length pr1)) in\n Seq.cons_seq_hide #Secret.U8 pf' (Seq.slice pr1 1 (Seq.length pr1));\n assert (r2 == Seq.seq_hide #Secret.U8 pr2)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet pn_sizemask_ct_num\n (pn_len: PN.packet_number_length_t)\n: Tot (x: Secret.uint32 { pn_sizemask_ct (Secret.v pn_len - 1) == FStar.Endianness.n_to_be 4 (Secret.v x) })\n=\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` (Secret.v pn_len - 1)));\n [@inline_let]\n let n0 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 24) in\n [@inline_let]\n let n1 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 16) in\n [@inline_let]\n let n2 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 8) in\n [@inline_let]\n let n3 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 0) in\n let pn_len_1 = pn_len `Secret.sub` Secret.to_u32 1ul in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n0)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n1)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n2)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n3))\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet pn_sizemask (dst: B.buffer Secret.uint8) (pn_len: PN.packet_number_length_t): HST.Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\ B.length dst == 4)\n (ensures fun h0 _ h1 ->\n B.as_seq h1 dst `Seq.equal` Seq.seq_hide (pn_sizemask_ct (Secret.v pn_len - 1)) /\\\n B.(modifies (loc_buffer dst) h0 h1))\n= let x = pn_sizemask_ct_num pn_len in\n SecretBuffer.store32_be dst x\n\n#push-options \"--z3rlimit 512 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (h: Ghost.erased Spec.header)\n (is_short: bool)\n (pn_offset: U32.t)\n (pn_len: PN.packet_number_length_t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let fmt = (Parse.format_header h) in\n let hlen = Seq.length fmt in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n (~ (Spec.is_retry h)) /\\\n is_short == (Spec.MShort? h) /\\\n U32.v pn_offset == Parse.pn_offset h /\\\n pn_len == Parse.pn_length h /\\\n hlen + 19 <= B.length dst /\\\n Seq.slice (Seq.seq_reveal #Secret.U8 (B.as_seq m dst)) 0 hlen == fmt\n ))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n header_encrypt_ct_secret_preserving_not_retry_spec a (B.as_seq m k) h (B.as_seq m dst) == B.as_seq m' dst\n ))\n= assert (U32.v pn_offset + 20 <= B.length dst);\n let m0 = HST.get () in\n HST.push_frame ();\n let m01 = HST.get () in\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n B.loc_unused_in_not_unused_in_disjoint m01;\n let m02 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m02;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n let m03 = HST.get () in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (CTR.footprint m03 s == CTR.footprint m0 s);\n assert (B.loc_disjoint (B.loc_buffer mask `B.loc_union` B.loc_buffer pn_sm) (CTR.footprint m0 s `B.loc_union` B.loc_buffer k `B.loc_union` B.loc_buffer dst));\n let sample = B.sub dst (pn_offset `U32.add` 4ul) 16ul in\n let m1 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v pn_offset + 4) (U32.v pn_offset + 20)) in\n assert (B.as_seq m1 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m2 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m2 mask == Ghost.reveal gmask);\n pn_sizemask pn_sm pn_len;\n let m3 = HST.get () in\n assert (B.as_seq m3 mask == Ghost.reveal gmask);\n let gpn_sm = Ghost.hide (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len - 1))) in\n assert (B.as_seq m3 pn_sm == Ghost.reveal gpn_sm);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m4 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) gpn_sm 0) in\n assert (B.as_seq m4 pnmask == Ghost.reveal gpnmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask_0 = B.index mask 0ul in\n assert (mask_0 == Seq.index (B.as_seq m4 (B.gsub mask 0ul 1ul)) 0);\n assert (mask_0 == Seq.index gmask 0);\n let f_ = B.index dst 0ul in\n assert (f_ == Seq.index (B.as_seq m0 dst) 0);\n let f_logxor = f_ `Secret.logxor` mask_0 in\n let f_get_bf = Secret.get_bitfield f_logxor 0ul protected_bits in\n let f' = Secret.set_bitfield f_ 0ul protected_bits f_get_bf in\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n let m5 = HST.get () in\n let gr1 = Ghost.hide (Lemmas.secret_xor_inplace (B.as_seq m0 dst) gpnmask (U32.v pn_offset)) in\n assert (B.as_seq m5 dst == Ghost.reveal gr1);\n B.upd dst 0ul f' ;\n HST.pop_frame ();\n let m6 = HST.get () in\n assert (B.as_seq m6 dst `Seq.equal` (f' `Seq.cons` Seq.slice (Ghost.reveal gr1) 1 (B.length dst)))\n\n#restart-solver\n\nlet header_encrypt\n a s k dst h is_short is_retry public_len pn_len\n= if is_retry\n then ()\n else begin\n let m = HST.get () in\n let hpk = Ghost.hide (B.as_seq m k) in\n let fmt = Ghost.hide (Parse.format_header (G.reveal h)) in\n let cipher = Ghost.hide (Seq.slice (B.as_seq m dst) (Seq.length fmt) (B.length dst)) in\n assert (B.as_seq m dst `Seq.equal` (fmt `Seq.append` cipher));\n header_encrypt_ct_secret_preserving_not_retry_spec_correct a hpk h cipher;\n assert (U32.v public_len + 20 <= B.length dst);\n let post (cont: Seq.lseq Secret.uint8 (B.length dst)) (m1: HS.mem) : GTot Type0 =\n header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst)) == cont /\\\n CTR.invariant m1 s /\\\n CTR.footprint m1 s == CTR.footprint m s\n in\n SecretBuffer.with_whole_buffer_hide_weak_modifies'\n #unit\n dst\n m\n (CTR.footprint m s `B.loc_union` B.loc_buffer k)\n (CTR.footprint m s)\n true\n (fun _ cont m1 ->\n post cont m1\n )\n (fun _ bs ->\n header_encrypt_ct_secret_preserving_not_retry a s k h is_short public_len pn_len bs\n )\n ;\n let m' = HST.get () in\n assert (B.as_seq m' dst == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst))));\n assert (B.as_seq m' dst == Spec.header_encrypt a (B.as_seq m k) h cipher)\n end\n\n#pop-options\n\n\n(* A constant-time specification of header_decrypt_aux which does not test or truncate on pn_len *)\n\nlet header_decrypt_aux_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: GTot (option Spec.header_decrypt_aux_t)\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet;\n Spec.pn_offset = ();\n Spec.pn_len = ();\n })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = pn_len;\n })\n end\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats\"\n\n#restart-solver\n\nlet header_decrypt_aux_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len packet == Spec.header_decrypt_aux a hpk cid_len packet)\n= \n let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then ()\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then ()\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> ()\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then ()\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal #Secret.U8 (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide #Secret.U8 sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n let r = packet' in\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#restart-solver\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })\n : GTot (Spec.header_decrypt_aux_t)\n=\n let f = Seq.index packet 0 in\n let sample_offset = pn_offset + 4 in\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` (Seq.index mask 0)) 0ul protected_bits) in\n let packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len))) 0 in\n let packet'' = Lemmas.secret_xor_inplace packet' pnmask pn_offset in\n {\n Spec.is_short = is_short;\n Spec.is_retry = false;\n Spec.packet = Seq.seq_reveal #Secret.U8 packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = Secret.v pn_len;\n }\n\n#push-options \"--z3rlimit 32\"\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: Seq.seq Secret.uint8 { \n let l = Seq.length packet in\n 0 < l /\\ l < pow2 32\n })\n (is_short: bool {\n let i = Secret.v #Secret.U8 (Seq.index packet 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3))\n })\n (pn_offset: nat {\n match Parse.putative_pn_offset cid_len (Seq.seq_reveal packet) with\n | None -> False\n | Some pn_offset' ->\n pn_offset == pn_offset' /\\\n pn_offset + 20 <= Seq.length packet\n })\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet) == Some (header_decrypt_aux_ct_secret_preserving_not_retry_spec a hpk cid_len packet is_short pn_offset))\n= assert (Some? (header_decrypt_aux_ct a hpk cid_len (Seq.seq_reveal packet)));\n let ppacket = Seq.seq_reveal packet in\n let f = Seq.index packet 0 in\n let pf = Seq.index ppacket 0 in\n assert (pf == Secret.reveal f);\n let is_short = (BF.get_bitfield #8 (Secret.v f) 7 8 = 0) in\n let Some pn_offset = Parse.putative_pn_offset cid_len ppacket in\n let sample_offset = pn_offset + 4 in\n let psample = Seq.slice ppacket sample_offset (sample_offset + 16) in\n let sample = Seq.slice packet sample_offset (sample_offset + 16) in\n assert (psample == Seq.seq_reveal sample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n let protected_bits = if is_short then 5 else 4 in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 protected_bits (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 protected_bits)) in\n let f' = Secret.set_bitfield f 0ul (U32.uint_to_t protected_bits) (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul (U32.uint_to_t protected_bits)) in\n assert (pf' == Secret.reveal f');\n let packet' = Seq.cons f' (Seq.slice packet 1 (Seq.length packet)) in\n let ppacket' = Seq.cons pf' (Seq.slice ppacket 1 (Seq.length ppacket)) in\n assert (ppacket' `Seq.equal` Seq.seq_reveal packet');\n let ppn_len = BF.get_bitfield (U8.v pf') 0 2 in\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n assert (Secret.v pn_len == ppn_len);\n let ppnmask_ct = Lemmas.and_inplace (Seq.slice pmask 1 5) (pn_sizemask_ct ppn_len) 0 in\n let pnmask_ct = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct ppn_len)) 0 in\n Lemmas.secret_and_inplace_eq (Seq.slice mask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct ppn_len)) 0;\n assert (ppnmask_ct == Seq.seq_reveal pnmask_ct);\n Lemmas.secret_xor_inplace_eq packet' pnmask_ct pn_offset\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\ninline_for_extraction\nlet header_decrypt_aux_ct_secret_preserving_not_retry'\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n 0 < l /\\ l < pow2 32 /\\ (\n let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\ (\n match Parse.putative_pn_offset (U32.v cid_len) (Seq.seq_reveal (B.as_seq m dst)) with\n | None -> False\n | Some pn_offset' ->\n U32.v pn_offset == pn_offset' /\\\n pn_offset' + 20 <= l\n ))))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) is_short (U32.v pn_offset)).Spec.packet == Seq.seq_reveal (B.as_seq m' dst)\n ))\n= let m0 = HST.get () in\n let f = B.index dst 0ul in\n let sample_offset = pn_offset `U32.add` 4ul in\n let sample = B.sub dst sample_offset 16ul in\n HST.push_frame ();\n let m1 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m1;\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer dst `B.loc_union` CTR.footprint m0 s));\n let m2 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m2;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (B.loc_disjoint (B.loc_buffer pn_sm) (B.loc_buffer dst `B.loc_union` CTR.footprint m0 s));\n let m3 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v sample_offset) (U32.v sample_offset + 16)) in\n assert (B.as_seq m3 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m4 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m4 mask == Ghost.reveal gmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask0 = B.index mask 0ul in\n let f_logxor = f `Secret.logxor` mask0 in\n let f_bf = Secret.get_bitfield (f_logxor) 0ul protected_bits in\n let f' = Secret.set_bitfield f 0ul protected_bits f_bf in\n B.upd dst 0ul f';\n let m5 = HST.get () in\n let gpacket' = Ghost.hide (Seq.cons f' (Seq.slice (B.as_seq m0 dst) 1 (B.length dst))) in\n assert (Ghost.reveal gpacket' `Seq.equal` B.as_seq m5 dst);\n let pn_len = Secret.get_bitfield f' 0ul 2ul in\n pn_sizemask pn_sm (Secret.cast_up Secret.U32 pn_len `Secret.add` Secret.hide 1ul);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m6 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len))) 0) in\n assert (Ghost.reveal gpnmask == B.as_seq m6 pnmask);\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n HST.pop_frame ();\n let m7 = HST.get () in\n assert (B.as_seq m7 dst == Lemmas.secret_xor_inplace gpacket' gpnmask (U32.v pn_offset))\n\n#pop-options\n\n#push-options \"--z3rlimit 32 --query_stats\"\n\n#restart-solver\n\nlet header_decrypt_aux_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (is_short: bool)\n (pn_offset: U32.t)\n (dst: B.buffer U8.t)\n: HST.Stack unit\n (requires (fun m ->\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n 0 < l /\\ l < pow2 32 /\\ (\n let i = Secret.v #Secret.U8 (Seq.index (B.as_seq m dst) 0) in\n (is_short == true <==> BF.get_bitfield #8 i 7 8 == 0) /\\\n (~ (not is_short && BF.get_bitfield #8 i 4 6 = 3)) /\\ (\n match Parse.putative_pn_offset (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some pn_offset' ->\n U32.v pn_offset == pn_offset' /\\\n pn_offset' + 20 <= l\n ))))\n (ensures (fun m _ m' ->\n match Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) with\n | None -> False\n | Some res ->\n let len_mod = U32.v pn_offset + res.Spec.pn_len + 1 in\n res.Spec.pn_offset == U32.v pn_offset /\\\n len_mod <= B.length dst /\\\n B.modifies (B.loc_buffer (B.gsub dst 0ul (U32.uint_to_t len_mod)) `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n res.Spec.packet == B.as_seq m' dst\n ))\n=\n let m = HST.get () in\n SecretBuffer.with_whole_buffer_hide_weak_modifies\n #unit\n dst\n m\n (CTR.footprint m s `B.loc_union` B.loc_buffer k)\n (CTR.footprint m s)\n true\n (fun _ cont m' ->\n (header_decrypt_aux_ct_secret_preserving_not_retry_spec a (B.as_seq m k) (U32.v cid_len) (Seq.seq_hide #Secret.U8 (B.as_seq m dst)) is_short (U32.v pn_offset)).Spec.packet == cont /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s\n )\n (fun _ bs ->\n header_decrypt_aux_ct_secret_preserving_not_retry' a s k cid_len is_short pn_offset bs\n );\n let m' = HST.get () in\n header_decrypt_aux_ct_secret_preserving_not_retry_spec_correct a (B.as_seq m k) (U32.v cid_len) (Seq.seq_hide #Secret.U8 (B.as_seq m dst)) is_short (U32.v pn_offset);\n header_decrypt_aux_ct_correct a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst);\n Spec.header_decrypt_aux_post a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst);\n let len_mod = Ghost.hide (U32.uint_to_t (U32.v pn_offset + (Some?.v (Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst))).Spec.pn_len + 1)) in\n B.modifies_loc_buffer_from_to_intro dst 0ul len_mod (CTR.footprint m s) m m'\n\n#pop-options\n\ntype header_decrypt_aux_result =\n | HD_Failure\n | HD_Success_Retry\n | HD_Success_NotRetry\n\nunfold\nlet header_decrypt_aux_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n: GTot Type0\n=\n let l = B.length dst in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length dst == U32.v dst_len\n\nunfold\nlet header_decrypt_aux_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n (rs: header_decrypt_aux_result)\n (m' : HS.mem)\n: GTot Type0\n=\n header_decrypt_aux_pre a s k cid_len dst dst_len m /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n begin match rs, Spec.header_decrypt_aux a (B.as_seq m k) (U32.v cid_len) (B.as_seq m dst) with\n | HD_Failure, None ->\n B.modifies B.loc_none m m'\n | HD_Failure, _ -> False\n | _, Some res ->\n res.Spec.packet == B.as_seq m' dst /\\\n res.Spec.is_retry == (HD_Success_Retry? rs) /\\\n (if res.Spec.is_retry\n then B.modifies B.loc_none m m'\n else\n let len = res.Spec.pn_offset + res.Spec.pn_len + 1 in\n len <= B.length dst /\\\n B.modifies (CTR.footprint m s `B.loc_union` B.loc_buffer (B.gsub dst 0ul (U32.uint_to_t len))) m m'\n )\n | _ -> False\n end\n\n#push-options \"--z3rlimit 16\"\n\nlet header_decrypt_aux\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n: HST.Stack header_decrypt_aux_result\n (requires (fun m ->\n header_decrypt_aux_pre a s k cid_len dst dst_len m\n ))\n (ensures (fun m rs m' ->\n header_decrypt_aux_post a s k cid_len dst dst_len m rs m'\n ))\n= let m = HST.get () in\n if dst_len = 0ul\n then HD_Failure\n else\n let f = B.index dst 0ul in\n let short_or_long = BF.uint8.BF.get_bitfield f 7 8 in\n let isshort = short_or_long = 0uy in\n let retry_or_other = BF.uint8.BF.get_bitfield f 4 6 in\n let isretry = not isshort && (retry_or_other = 3uy) in\n if isretry\n then HD_Success_Retry\n else match ParseImpl.putative_pn_offset cid_len dst dst_len with\n | None -> HD_Failure\n | Some pn_offset ->\n if dst_len `U32.lt` (pn_offset `U32.add` 20ul)\n then HD_Failure\n else begin\n header_decrypt_aux_ct_secret_preserving_not_retry a s k cid_len isshort pn_offset dst;\n HD_Success_NotRetry\n end\n\n#pop-options\n\nlet max_cipher_length64 : (x: Secret.uint64 { Secret.v x == max_cipher_length }) =\n Secret.mk_int (norm [delta; iota; zeta; primops] (pow2 32 - header_len_bound))\n\nlet secret_max_correct\n (x y: Secret.uint64)\n: Lemma\n (Secret.v (Secret.max64 x y) == Spec.max (Secret.v x) (Secret.v y))\n [SMTPat (Secret.max64 x y)]\n= ()\n\nlet secret_min_correct\n (x y: Secret.uint64)\n: Lemma\n (Secret.v (Secret.min64 x y) == Spec.min (Secret.v x) (Secret.v y))\n [SMTPat (Secret.min64 x y)]\n= ()\n\n#push-options \"--z3rlimit 2048 --query_stats --ifuel 3 --fuel 2 --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\ninline_for_extraction\nlet header_decrypt_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst:B.buffer U8.t)\n (dst_len: U32.t)\n (m0: HS.mem)\n: HST.Stack h_result\n (requires (fun m ->\n header_decrypt_pre a s k cid_len last dst dst_len m0 /\\\n header_decrypt_aux_post a s k cid_len dst dst_len m0 HD_Success_Retry m\n ))\n (ensures (fun _ rs m' ->\n header_decrypt_post a s k cid_len last dst dst_len m0 rs m'\n ))\n= \n let m1 = HST.get () in\n Classical.move_requires (Parse.parse_header_exists (U32.v cid_len) (Secret.v last)) (B.as_seq m1 dst);\n Classical.move_requires (Parse.parse_header_exists_recip (U32.v cid_len) (Secret.v last)) (B.as_seq m1 dst);\n (* In the Retry case, header_decrypt_aux did nothing, so we need\n to check here that the header can be parsed. *)\n Spec.header_decrypt_aux_post a (B.as_seq m0 k) (U32.v cid_len) (B.as_seq m0 dst);\n if None? (ParseImpl.putative_pn_offset cid_len dst dst_len)\n then H_Failure\n else begin\n Spec.header_decrypt_aux_post_parse a (B.as_seq m0 k) (U32.v cid_len) (Secret.v last) (B.as_seq m0 dst);\n Parse.lemma_header_parsing_post (U32.v cid_len) (Secret.v last) (B.as_seq m1 dst);\n let (h, pn) = ParseImpl.read_header dst dst_len cid_len last in\n let m2 = HST.get () in\n ParseImpl.header_len_correct h m2 pn;\n H_Success h pn (Secret.to_u32 0ul)\n end\n\n#restart-solver\n\ninline_for_extraction\nlet header_decrypt_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst:B.buffer U8.t)\n (dst_len: U32.t)\n (m0: HS.mem)\n: HST.Stack h_result\n (requires (fun m ->\n header_decrypt_pre a s k cid_len last dst dst_len m0 /\\\n header_decrypt_aux_post a s k cid_len dst dst_len m0 HD_Success_NotRetry m\n ))\n (ensures (fun _ rs m' ->\n header_decrypt_post a s k cid_len last dst dst_len m0 rs m'", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 3, "max_ifuel": 3, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 2048, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n s: NotEverCrypt.CTR.state (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n k: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n cid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n dst: LowStar.Buffer.buffer FStar.UInt8.t ->\n dst_len: FStar.UInt32.t ->\n m0: FStar.Monotonic.HyperStack.mem\n -> FStar.HyperStack.ST.Stack QUIC.Impl.Header.h_result", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "NotEverCrypt.CTR.state", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "FStar.UInt8.t", "FStar.UInt32.t", "FStar.Monotonic.HyperStack.mem", "QUIC.Impl.Header.Base.header", "QUIC.Spec.PacketNumber.Base.packet_number_t", "QUIC.Impl.Header.H_Success", "Prims.unit", "Prims._assert", "FStar.Seq.Base.equal", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Buffer.trivial_preorder", "FStar.Seq.Base.append", "FStar.Ghost.reveal", "LowStar.Monotonic.Buffer.mbuffer", "Prims.eq2", "FStar.Seq.Base.seq", "LowStar.Monotonic.Buffer.disjoint", "QUIC.Spec.Base.byte", "QUIC.Spec.Header.Parse.format_header", "QUIC.Impl.Header.Base.g_header", "FStar.Ghost.erased", "FStar.Ghost.hide", "LowStar.Buffer.gsub", "QUIC.Secret.Int.reveal", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "FStar.UInt32.sub", "FStar.UInt32.__uint_to_t", "Lib.IntTypes.int_t", "Prims.int", "Prims.l_or", "Lib.IntTypes.range", "Lib.IntTypes.U64", "Lib.IntTypes.v", "QUIC.Secret.Int.cast_down", "FStar.Pervasives.assert_norm", "Prims.b2t", "Prims.op_LessThan", "QUIC.Spec.Crypto.max_cipher_length", "Prims.pow2", "Prims.op_LessThanOrEqual", "QUIC.Secret.Int.Base.v", "QUIC.Secret.Int.max64", "QUIC.Secret.Int.min64", "Lib.IntTypes.sub", "QUIC.Impl.Header.max_cipher_length64", "QUIC.Secret.Int.hide", "Lib.IntTypes.PUB", "FStar.UInt64.__uint_to_t", "QUIC.Impl.Header.Base.has_payload_length", "QUIC.Impl.Header.Base.payload_length", "Prims.bool", "Lib.IntTypes.uint64", "QUIC.Secret.Int.cast_up", "Prims.op_Subtraction", "QUIC.Secret.Int.usub", "LowStar.Monotonic.Buffer.length", "Prims.op_GreaterThanOrEqual", "FStar.Seq.Base.length", "Prims.op_Addition", "FStar.UInt32.v", "QUIC.Impl.Header.Base.public_header_len", "QUIC.Impl.Header.Base.is_retry", "QUIC.Impl.Header.Base.pn_length", "QUIC.Impl.Header.Base.header_len", "QUIC.Impl.Header.Parse.header_len_correct", "QUIC.Impl.Header.h_result", "FStar.HyperStack.ST.get", "FStar.Pervasives.Native.tuple2", "QUIC.Impl.Header.Parse.read_header", "QUIC.Spec.Header.Parse.lemma_header_parsing_post", "QUIC.Spec.Header.header_decrypt_aux_post_parse", "QUIC.Spec.Header.header_decrypt_aux_post", "FStar.Classical.move_requires", "QUIC.Spec.Base.bytes", "QUIC.Spec.Header.Parse.uu___is_H_Success", "QUIC.Spec.Header.Parse.parse_header", "FStar.Pervasives.Native.uu___is_Some", "Prims.nat", "QUIC.Spec.Header.Parse.putative_pn_offset", "QUIC.Spec.Header.Parse.parse_header_exists_recip", "Prims.l_False", "Prims.l_imp", "Prims.l_not", "QUIC.Spec.Header.Parse.packet_is_retry", "QUIC.Spec.Header.Parse.parse_header_exists", "Prims.l_and", "QUIC.Impl.Header.header_decrypt_pre", "QUIC.Impl.Header.header_decrypt_aux_post", "QUIC.Impl.Header.HD_Success_NotRetry", "QUIC.Impl.Header.header_decrypt_post" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_decrypt_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m0: HS.mem)\n : HST.Stack h_result\n (requires\n (fun m ->\n header_decrypt_pre a s k cid_len last dst dst_len m0 /\\\n header_decrypt_aux_post a s k cid_len dst dst_len m0 HD_Success_NotRetry m))\n (ensures (fun _ rs m' -> header_decrypt_post a s k cid_len last dst dst_len m0 rs m'))\nlet header_decrypt_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m0: HS.mem)\n : HST.Stack h_result\n (requires\n (fun m ->\n header_decrypt_pre a s k cid_len last dst dst_len m0 /\\\n header_decrypt_aux_post a s k cid_len dst dst_len m0 HD_Success_NotRetry m))\n (ensures (fun _ rs m' -> header_decrypt_post a s k cid_len last dst dst_len m0 rs m')) =", "completed_definiton": "let m1 = HST.get () in\nClassical.move_requires (Parse.parse_header_exists (U32.v cid_len) (Secret.v last))\n (B.as_seq m1 dst);\nClassical.move_requires (Parse.parse_header_exists_recip (U32.v cid_len) (Secret.v last))\n (B.as_seq m1 dst);\nSpec.header_decrypt_aux_post a (B.as_seq m0 k) (U32.v cid_len) (B.as_seq m0 dst);\nSpec.header_decrypt_aux_post_parse a\n (B.as_seq m0 k)\n (U32.v cid_len)\n (Secret.v last)\n (B.as_seq m0 dst);\nParse.lemma_header_parsing_post (U32.v cid_len) (Secret.v last) (B.as_seq m1 dst);\nlet h, pn = ParseImpl.read_header dst dst_len cid_len last in\nlet m2 = HST.get () in\nParseImpl.header_len_correct h m2 pn;\nlet hlen = header_len h in\nassert (Seq.length (Parse.format_header (g_header h m2 pn)) == Secret.v hlen);\nassert (Secret.v hlen <= B.length dst);\nlet rlen = (Secret.hide dst_len) `Secret.usub` hlen in\nlet hlen64 = Secret.cast_up Secret.U64 hlen in\nlet rlen64 = Secret.cast_up Secret.U64 rlen in\nlet clen64 = if has_payload_length h then payload_length h else rlen64 in\nlet clen64_checked:Secret.uint64 =\n Secret.max64 (Secret.min64 (Secret.min64 clen64 rlen64)\n (max_cipher_length64 `Secret.sub` (Secret.hide 1uL)))\n (Secret.hide 16uL)\nin\nassert_norm (16 < max_cipher_length);\nassert (Secret.v clen64_checked < max_cipher_length);\nassert (Secret.v clen64_checked <= Secret.v rlen);\nassert_norm (max_cipher_length < pow2 32);\nlet clen32 = Secret.cast_down Secret.U32 clen64_checked in\nlet bh = Ghost.hide (B.gsub dst 0ul (Secret.reveal hlen)) in\nlet brem = Ghost.hide (B.gsub dst (Secret.reveal hlen) (Secret.reveal rlen)) in\nlet bc = Ghost.hide (B.gsub brem 0ul (Secret.reveal clen32)) in\nlet b3 =\n Ghost.hide (B.gsub brem\n (Secret.reveal clen32)\n ((Secret.reveal rlen) `U32.sub` (Secret.reveal clen32)))\nin\nassert (B.as_seq m2 bh == B.as_seq m1 bh);\nassert (B.as_seq m1 bh == Parse.format_header (g_header h m2 pn));\nassert (B.disjoint bh brem);\nassert (B.as_seq m2 brem == B.as_seq m1 brem);\nassert (B.as_seq m1 brem == B.as_seq m0 brem);\nassert (B.as_seq m2 bc == B.as_seq m1 bc);\nassert (B.as_seq m1 bc == B.as_seq m0 bc);\nassert (B.as_seq m2 b3 == B.as_seq m1 b3);\nassert (B.as_seq m1 b3 == B.as_seq m0 b3);\nassert ((B.as_seq m2 dst)\n `Seq.equal`\n (((B.as_seq m2 bh) `Seq.append` (B.as_seq m2 bc)) `Seq.append` (B.as_seq m2 b3)));\nH_Success h pn clen32", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fst", "name": "QUIC.Impl.Header.header_decrypt_aux_ct_correct", "original_source_type": "val header_decrypt_aux_ct_correct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet: packet)\n : Lemma\n (header_decrypt_aux_ct a hpk cid_len packet == Spec.header_decrypt_aux a hpk cid_len packet)", "source_type": "val header_decrypt_aux_ct_correct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet: packet)\n : Lemma\n (header_decrypt_aux_ct a hpk cid_len packet == Spec.header_decrypt_aux a hpk cid_len packet)", "source_definition": "let header_decrypt_aux_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len packet == Spec.header_decrypt_aux a hpk cid_len packet)\n= \n let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then ()\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then ()\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> ()\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then ()\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal #Secret.U8 (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide #Secret.U8 sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n let r = packet' in\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 513, "start_col": 2, "end_line": 556, "end_col": 11 }, "file_context": "module QUIC.Impl.Header\nfriend QUIC.Spec.Header\n\nopen QUIC.Impl.Header.Base\n\nmodule Parse = QUIC.Spec.Header.Parse\nmodule ParseImpl = QUIC.Impl.Header.Parse\nmodule Spec = QUIC.Spec.Header\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule B = LowStar.Buffer\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\n\nmodule U8 = FStar.UInt8\nmodule HST = FStar.HyperStack.ST\nmodule U32 = FStar.UInt32\nmodule G = FStar.Ghost\nmodule Seq = QUIC.Secret.Seq\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule Lemmas = QUIC.Impl.Lemmas\nmodule BF = LowParse.BitFields\n\nmodule SCipher = Spec.Agile.Cipher\nmodule SAEAD = Spec.Agile.AEAD\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nlet block_len (a: SCipher.cipher_alg):\n x:U32.t { U32.v x = SCipher.block_length a }\n=\n let open SCipher in\n match a with | CHACHA20 -> 64ul | _ -> 16ul\n\n#push-options \"--z3rlimit 256\"\ninline_for_extraction\nlet block_of_sample (a: SCipher.cipher_alg)\n (dst: B.buffer Secret.uint8)\n (s: CTR.state a)\n (k: B.buffer Secret.uint8)\n (sample: B.buffer Secret.uint8):\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf k; buf sample ]) /\\\n CTR.invariant h0 s /\\\n B.(all_disjoint\n [ CTR.footprint h0 s; loc_buffer dst; loc_buffer k; loc_buffer sample ]) /\\\n SCipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20) /\\\n B.length k = SCipher.key_length a /\\\n B.length dst = 16 /\\\n B.length sample = 16)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst `loc_union` CTR.footprint h0 s) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n Spec.block_of_sample a (B.as_seq h0 k) (B.as_seq h0 sample) /\\\n CTR.footprint h0 s == CTR.footprint h1 s /\\\n CTR.invariant h1 s)\n=\n HST.push_frame ();\n (**) let h0 = HST.get () in\n let zeroes' = B.alloca (Secret.to_u8 0uy) 64ul in\n let zeroes = B.sub zeroes' 0ul (block_len a) in\n let dst_block' = B.alloca (Secret.to_u8 0uy) 64ul in\n let dst_block = B.sub dst_block' 0ul (block_len a) in\n begin match a with\n | SCipher.CHACHA20 ->\n let ctr = SecretBuffer.load32_le (B.sub sample 0ul 4ul) in\n let iv = B.sub sample 4ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n | _ ->\n let ctr = SecretBuffer.load32_be (B.sub sample 12ul 4ul) in\n let iv = B.sub sample 0ul 12ul in\n (**) let h1 = HST.get () in\n (* EverCrypt currently does not support secret counters,\n so we need to declassify the counter value here and only here. *)\n CTR.init (G.hide a) s k iv 12ul (ADMITDeclassify.u32_to_UInt32 ctr);\n CTR.update_block (G.hide a) s dst_block zeroes;\n (**) let h2 = HST.get () in\n (**) Lemmas.seq_map2_xor0 (B.as_seq h1 dst_block)\n (**) (SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n (**) assert (B.as_seq h2 dst_block `Seq.equal`\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr));\n let dst_slice = B.sub dst_block 0ul 16ul in\n (**) assert (B.as_seq h2 dst_slice `Seq.equal` Seq.slice (\n (**) SCipher.ctr_block a (B.as_seq h0 k) (B.as_seq h1 iv) (Secret.v ctr)\n (**) ) 0 16);\n B.blit dst_slice 0ul dst 0ul 16ul\n end;\n HST.pop_frame ()\n#pop-options\n\n(* A more careful version of header_encrypt wrt. constant-time issues, which does not test or truncate on pn_len *)\n\nlet pn_sizemask_ct (pn_len:nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet index_pn_sizemask_ct_right\n (pn_len: nat { pn_len < 4 })\n (i: nat {i > pn_len /\\ i < 4})\n: Lemma\n (Seq.index (pn_sizemask_ct pn_len) i == 0uy)\n= let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n pow2_plus (24 - (8 * pn_len)) (8 * (pn_len + 1));\n Lemmas.index_n_to_be_zero_right 4 (pow2 32 - pow2 (24 - (8 * pn_len))) i\n\nlet header_encrypt_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: GTot packet\n= \n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256\"\n\nlet header_encrypt_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes' (Spec.is_retry h))\n: Lemma\n (header_encrypt_ct a hpk h c `Seq.equal` Spec.header_encrypt a hpk h c)\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if Spec.is_retry h\n then ()\n else begin\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Parse.pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0 in\n Lemmas.pointwise_op_split U8.logand (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 (pn_len + 1);\n assert (pnmask_naive `Seq.equal` Seq.slice pnmask_ct 0 (pn_len + 1));\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive)) 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r)) (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero\n (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i\n )\n 0\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header { ~ (Spec.is_retry h) })\n (r: Seq.seq Secret.uint8 {\n Seq.length r >= Parse.pn_offset h + 20\n })\n: GTot (Seq.seq Secret.uint8)\n= \n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let sample = (Seq.slice r (pn_offset + 4) (pn_offset + 20)) in\n let mask = (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.secret_and_inplace (Seq.slice mask 1 5) (Seq.seq_hide (pn_sizemask_ct pn_len)) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n let r = Lemmas.secret_xor_inplace r pnmask pn_offset in\n let r = Seq.cons f' (Seq.slice r 1 (Seq.length r)) in\n r\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 2\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry_spec_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (h: Spec.header)\n (c: cbytes)\n: Lemma\n (requires (\n (~ (Spec.is_retry h))\n ))\n (ensures (\n let r = Parse.format_header h `Seq.append` c in\n Seq.length r >= Parse.pn_offset h + 20 /\\\n Spec.header_encrypt a hpk h c == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide r))\n ))\n= header_encrypt_ct_correct a hpk h c;\n let fmt = Parse.format_header h in\n let len = Seq.length fmt in\n let pr = fmt `Seq.append` c in\n assert (Seq.length pr >= Parse.pn_offset h + 20);\n let pn_len = Secret.v (Spec.pn_length h) - 1 in\n let psample = Seq.slice c (3 - pn_len) (19 - pn_len) in\n assert (c `Seq.equal` Seq.slice pr len (Seq.length pr));\n let pn_off = Parse.pn_offset h in\n assert (pn_off + pn_len + 1 == len);\n assert (c == Seq.slice pr (pn_off + pn_len + 1) (Seq.length pr));\n Seq.slice_slice pr (pn_off + pn_len + 1) (Seq.length pr) (3 - pn_len) (19 - pn_len);\n assert (psample == Seq.slice pr (pn_off + 4) (pn_off + 20));\n let r = Seq.seq_hide #Secret.U8 pr in\n let sample = Seq.slice r (pn_off + 4) (pn_off + 20) in\n assert (sample == Seq.seq_hide #Secret.U8 psample);\n let mask = Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk sample in\n let pmask = Seq.seq_reveal mask in\n assert (mask == Seq.seq_hide pmask);\n let mask15 = Seq.slice mask 1 5 in\n let ppnszmask = pn_sizemask_ct pn_len in\n let pnszmask = Seq.seq_hide ppnszmask in\n let pnmask = Lemmas.secret_and_inplace mask15 pnszmask 0 in\n let pmask15 = Seq.slice pmask 1 5 in\n let ppnmask = Lemmas.and_inplace pmask15 ppnszmask 0 in\n Lemmas.secret_and_inplace_eq mask15 pnszmask 0;\n assert (pnmask == Seq.seq_hide #Secret.U8 ppnmask);\n let f = Seq.index r 0 in\n let pf : Secret.uint_t Secret.U8 Secret.PUB = Seq.index pr 0 in\n assert (f == Secret.hide #Secret.U8 #Secret.PUB pf);\n let protected_bits = if Spec.MShort? h then 5ul else 4ul in\n let pf' = U8.uint_to_t (BF.set_bitfield (U8.v pf) 0 (U32.v protected_bits) (BF.get_bitfield (U8.v pf `FStar.UInt.logxor` U8.v (Seq.index pmask 0)) 0 (U32.v protected_bits))) in\n let f' = Secret.set_bitfield f 0ul protected_bits (Secret.get_bitfield (f `Secret.logxor` Seq.index mask 0) 0ul protected_bits) in\n assert (U8.v pf' == Secret.v f');\n assert (f' == Secret.hide #Secret.U8 pf');\n let pr1 = Lemmas.xor_inplace pr ppnmask pn_off in\n let r1 = Lemmas.secret_xor_inplace r pnmask pn_off in\n Lemmas.secret_xor_inplace_eq r pnmask pn_off;\n assert (r1 == Seq.seq_hide #Secret.U8 pr1);\n let r2 = Seq.cons f' (Seq.slice r1 1 (Seq.length r1)) in\n let pr2 = Seq.cons pf' (Seq.slice pr1 1 (Seq.length pr1)) in\n Seq.cons_seq_hide #Secret.U8 pf' (Seq.slice pr1 1 (Seq.length pr1));\n assert (r2 == Seq.seq_hide #Secret.U8 pr2)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet pn_sizemask_ct_num\n (pn_len: PN.packet_number_length_t)\n: Tot (x: Secret.uint32 { pn_sizemask_ct (Secret.v pn_len - 1) == FStar.Endianness.n_to_be 4 (Secret.v x) })\n=\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` (Secret.v pn_len - 1)));\n [@inline_let]\n let n0 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 24) in\n [@inline_let]\n let n1 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 16) in\n [@inline_let]\n let n2 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 8) in\n [@inline_let]\n let n3 = norm [delta; zeta; iota; primops] (pow2 32 - pow2 0) in\n let pn_len_1 = pn_len `Secret.sub` Secret.to_u32 1ul in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n0)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n1)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n2)) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` Secret.to_u32 (U32.uint_to_t n3))\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet pn_sizemask (dst: B.buffer Secret.uint8) (pn_len: PN.packet_number_length_t): HST.Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\ B.length dst == 4)\n (ensures fun h0 _ h1 ->\n B.as_seq h1 dst `Seq.equal` Seq.seq_hide (pn_sizemask_ct (Secret.v pn_len - 1)) /\\\n B.(modifies (loc_buffer dst) h0 h1))\n= let x = pn_sizemask_ct_num pn_len in\n SecretBuffer.store32_be dst x\n\n#push-options \"--z3rlimit 512 --query_stats --z3cliopt smt.arith.nl=false --fuel 2 --ifuel 1\"\n\n#restart-solver\n\nlet header_encrypt_ct_secret_preserving_not_retry\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (h: Ghost.erased Spec.header)\n (is_short: bool)\n (pn_offset: U32.t)\n (pn_len: PN.packet_number_length_t)\n (dst: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun m ->\n let fmt = (Parse.format_header h) in\n let hlen = Seq.length fmt in\n B.all_live m [B.buf k; B.buf dst] /\\\n CTR.invariant m s /\\\n B.all_disjoint\n [ CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\\n B.length k == SCipher.key_length (SAEAD.cipher_alg_of_supported_alg a) /\\\n (~ (Spec.is_retry h)) /\\\n is_short == (Spec.MShort? h) /\\\n U32.v pn_offset == Parse.pn_offset h /\\\n pn_len == Parse.pn_length h /\\\n hlen + 19 <= B.length dst /\\\n Seq.slice (Seq.seq_reveal #Secret.U8 (B.as_seq m dst)) 0 hlen == fmt\n ))\n (ensures (fun m _ m' ->\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s /\\\n header_encrypt_ct_secret_preserving_not_retry_spec a (B.as_seq m k) h (B.as_seq m dst) == B.as_seq m' dst\n ))\n= assert (U32.v pn_offset + 20 <= B.length dst);\n let m0 = HST.get () in\n HST.push_frame ();\n let m01 = HST.get () in\n let mask = B.alloca (Secret.to_u8 0uy) 16ul in\n B.loc_unused_in_not_unused_in_disjoint m01;\n let m02 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m02;\n let pn_sm = B.alloca (Secret.to_u8 0uy) 4ul in\n let m03 = HST.get () in\n assert (B.loc_disjoint (B.loc_buffer mask) (B.loc_buffer pn_sm));\n assert (CTR.footprint m03 s == CTR.footprint m0 s);\n assert (B.loc_disjoint (B.loc_buffer mask `B.loc_union` B.loc_buffer pn_sm) (CTR.footprint m0 s `B.loc_union` B.loc_buffer k `B.loc_union` B.loc_buffer dst));\n let sample = B.sub dst (pn_offset `U32.add` 4ul) 16ul in\n let m1 = HST.get () in\n let gsample = Ghost.hide (Seq.slice (B.as_seq m0 dst) (U32.v pn_offset + 4) (U32.v pn_offset + 20)) in\n assert (B.as_seq m1 sample == Ghost.reveal gsample);\n block_of_sample (SAEAD.cipher_alg_of_supported_alg a) mask s k sample;\n let m2 = HST.get () in\n let gmask = Ghost.hide (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) (B.as_seq m0 k) gsample) in\n assert (B.as_seq m2 mask == Ghost.reveal gmask);\n pn_sizemask pn_sm pn_len;\n let m3 = HST.get () in\n assert (B.as_seq m3 mask == Ghost.reveal gmask);\n let gpn_sm = Ghost.hide (Seq.seq_hide #Secret.U8 (pn_sizemask_ct (Secret.v pn_len - 1))) in\n assert (B.as_seq m3 pn_sm == Ghost.reveal gpn_sm);\n let pnmask = B.sub mask 1ul 4ul in\n Lemmas.op_inplace pnmask pn_sm 4ul 0ul (Secret.logand #Secret.U8 #Secret.SEC);\n let m4 = HST.get () in\n let gpnmask = Ghost.hide (Lemmas.secret_and_inplace (Seq.slice gmask 1 5) gpn_sm 0) in\n assert (B.as_seq m4 pnmask == Ghost.reveal gpnmask);\n let protected_bits = if is_short then 5ul else 4ul in\n let mask_0 = B.index mask 0ul in\n assert (mask_0 == Seq.index (B.as_seq m4 (B.gsub mask 0ul 1ul)) 0);\n assert (mask_0 == Seq.index gmask 0);\n let f_ = B.index dst 0ul in\n assert (f_ == Seq.index (B.as_seq m0 dst) 0);\n let f_logxor = f_ `Secret.logxor` mask_0 in\n let f_get_bf = Secret.get_bitfield f_logxor 0ul protected_bits in\n let f' = Secret.set_bitfield f_ 0ul protected_bits f_get_bf in\n Lemmas.op_inplace dst pnmask 4ul pn_offset (Secret.logxor #Secret.U8 #Secret.SEC);\n let m5 = HST.get () in\n let gr1 = Ghost.hide (Lemmas.secret_xor_inplace (B.as_seq m0 dst) gpnmask (U32.v pn_offset)) in\n assert (B.as_seq m5 dst == Ghost.reveal gr1);\n B.upd dst 0ul f' ;\n HST.pop_frame ();\n let m6 = HST.get () in\n assert (B.as_seq m6 dst `Seq.equal` (f' `Seq.cons` Seq.slice (Ghost.reveal gr1) 1 (B.length dst)))\n\n#restart-solver\n\nlet header_encrypt\n a s k dst h is_short is_retry public_len pn_len\n= if is_retry\n then ()\n else begin\n let m = HST.get () in\n let hpk = Ghost.hide (B.as_seq m k) in\n let fmt = Ghost.hide (Parse.format_header (G.reveal h)) in\n let cipher = Ghost.hide (Seq.slice (B.as_seq m dst) (Seq.length fmt) (B.length dst)) in\n assert (B.as_seq m dst `Seq.equal` (fmt `Seq.append` cipher));\n header_encrypt_ct_secret_preserving_not_retry_spec_correct a hpk h cipher;\n assert (U32.v public_len + 20 <= B.length dst);\n let post (cont: Seq.lseq Secret.uint8 (B.length dst)) (m1: HS.mem) : GTot Type0 =\n header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst)) == cont /\\\n CTR.invariant m1 s /\\\n CTR.footprint m1 s == CTR.footprint m s\n in\n SecretBuffer.with_whole_buffer_hide_weak_modifies'\n #unit\n dst\n m\n (CTR.footprint m s `B.loc_union` B.loc_buffer k)\n (CTR.footprint m s)\n true\n (fun _ cont m1 ->\n post cont m1\n )\n (fun _ bs ->\n header_encrypt_ct_secret_preserving_not_retry a s k h is_short public_len pn_len bs\n )\n ;\n let m' = HST.get () in\n assert (B.as_seq m' dst == Seq.seq_reveal (header_encrypt_ct_secret_preserving_not_retry_spec a hpk h (Seq.seq_hide (B.as_seq m dst))));\n assert (B.as_seq m' dst == Spec.header_encrypt a (B.as_seq m k) h cipher)\n end\n\n#pop-options\n\n\n(* A constant-time specification of header_decrypt_aux which does not test or truncate on pn_len *)\n\nlet header_decrypt_aux_ct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: GTot (option Spec.header_decrypt_aux_t)\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet;\n Spec.pn_offset = ();\n Spec.pn_len = ();\n })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.slice packet sample_offset (sample_offset+16) in\n let mask = Seq.seq_reveal (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a) hpk (Seq.seq_hide sample)) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n Spec.is_short = is_short;\n Spec.is_retry = is_retry;\n Spec.packet = packet'';\n Spec.pn_offset = pn_offset;\n Spec.pn_len = pn_len;\n })\n end\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats\"\n\n#restart-solver\n\nlet header_decrypt_aux_ct_correct\n (a:ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Lemma\n (header_decrypt_aux_ct a hpk cid_len packet == Spec.header_decrypt_aux a hpk cid_len packet)", "dependencies": { "source_file": "QUIC.Impl.Header.fst", "checked_file": "QUIC.Impl.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "ParseImpl", "full_module": "QUIC.Impl.Header.Parse" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 1024, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n cid_len: Prims.nat{cid_len <= 20} ->\n packet: QUIC.Spec.Crypto.packet\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Impl.Header.header_decrypt_aux_ct a hpk cid_len packet ==\n QUIC.Spec.Header.header_decrypt_aux a hpk cid_len packet)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "QUIC.Spec.Crypto.packet", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "Prims.bool", "QUIC.Spec.Header.Parse.putative_pn_offset", "Prims.op_GreaterThan", "Prims.op_Addition", "QUIC.Spec.Lemmas.xor_inplace_zero", "FStar.Seq.Base.slice", "Prims.op_LessThan", "QUIC.Spec.Lemmas.and_inplace_zero", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.PUB", "QUIC.Impl.Header.pn_sizemask_ct", "QUIC.Impl.Header.index_pn_sizemask_ct_right", "Prims.unit", "QUIC.Spec.Lemmas.pointwise_op_empty", "FStar.UInt8.logxor", "QUIC.Spec.Lemmas.pointwise_op_split", "FStar.Seq.Properties.lemma_split", "FStar.Seq.Base.seq", "Prims._assert", "FStar.Seq.Base.equal", "FStar.UInt8.logand", "QUIC.Spec.Base.bytes", "QUIC.Spec.Lemmas.and_inplace", "QUIC.Spec.Header.pn_sizemask", "LowParse.BitFields.ubitfield", "Prims.op_Subtraction", "LowParse.BitFields.get_bitfield", "FStar.UInt8.n", "FStar.Seq.Properties.cons", "FStar.UInt8.uint_to_t", "FStar.UInt.uint_t", "LowParse.BitFields.set_bitfield", "FStar.UInt8.v", "FStar.UInt.logxor", "FStar.Seq.Base.index", "Prims.l_and", "Lib.IntTypes.int_t", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.SEC", "QUIC.Spec.Header.block_of_sample", "QUIC.Secret.Seq.seq_hide", "Prims.op_AmpAmp", "Prims.op_Negation", "Prims.l_True", "Prims.squash", "Prims.eq2", "FStar.Pervasives.Native.option", "QUIC.Spec.Header.header_decrypt_aux_t", "QUIC.Impl.Header.header_decrypt_aux_ct", "QUIC.Spec.Header.header_decrypt_aux", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_decrypt_aux_ct_correct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet: packet)\n : Lemma\n (header_decrypt_aux_ct a hpk cid_len packet == Spec.header_decrypt_aux a hpk cid_len packet)\nlet header_decrypt_aux_ct_correct\n (a: ea)\n (hpk: SCipher.key (SAEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet: packet)\n : Lemma\n (header_decrypt_aux_ct a hpk cid_len packet == Spec.header_decrypt_aux a hpk cid_len packet) =", "completed_definiton": "let open FStar.Math.Lemmas in\nif Seq.length packet = 0\nthen ()\nelse\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then ()\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> ()\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then ()\n else\n let sample = Seq.slice packet sample_offset (sample_offset + 16) in\n let mask =\n Seq.seq_reveal #Secret.U8\n (Spec.block_of_sample (SAEAD.cipher_alg_of_supported_alg a)\n hpk\n (Seq.seq_hide #Secret.U8 sample))\n in\n let protected_bits = if is_short then 5 else 4 in\n let f' =\n BF.set_bitfield (U8.v f)\n 0\n protected_bits\n (BF.get_bitfield ((U8.v f) `FStar.UInt.logxor` (U8.v (Seq.index mask 0)))\n 0\n protected_bits)\n in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask_ct = Lemmas.and_inplace (Seq.slice mask 1 5) (pn_sizemask_ct pn_len) 0 in\n let pnmask_naive =\n Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Spec.pn_sizemask pn_len) 0\n in\n Lemmas.pointwise_op_split U8.logand\n (Seq.slice mask 1 5)\n (pn_sizemask_ct pn_len)\n 0\n (pn_len + 1);\n assert (pnmask_naive `Seq.equal` (Seq.slice pnmask_ct 0 (pn_len + 1)));\n let r = packet' in\n Seq.lemma_split r (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_ct pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_split U8.logxor r pnmask_naive pn_offset (pn_offset + pn_len + 1);\n Lemmas.pointwise_op_empty U8.logxor\n (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r))\n (Seq.slice pnmask_naive (pn_len + 1) (Seq.length pnmask_naive))\n 0;\n Lemmas.xor_inplace_zero (Seq.slice r (pn_offset + pn_len + 1) (Seq.length r))\n (Seq.slice pnmask_ct (pn_len + 1) 4)\n (fun i ->\n Lemmas.and_inplace_zero (Seq.slice mask (pn_len + 2) 5)\n (Seq.slice (pn_sizemask_ct pn_len) (pn_len + 1) 4)\n (fun j -> index_pn_sizemask_ct_right pn_len (j + (pn_len + 1)))\n i)\n 0", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fsti", "name": "QUIC.Secret.Int.logand_spec'", "original_source_type": "val logand_spec' (#t: inttype) (#l: secrecy_level) (a b: int_t t l)\n : Lemma (v (a `logand` b) == (v a) `logand_v` (v b)) [SMTPat (v (a `logand` b))]", "source_type": "val logand_spec' (#t: inttype) (#l: secrecy_level) (a b: int_t t l)\n : Lemma (v (a `logand` b) == (v a) `logand_v` (v b)) [SMTPat (v (a `logand` b))]", "source_definition": "let logand_spec'\n (#t:inttype)\n (#l:secrecy_level)\n (a:int_t t l)\n (b:int_t t l)\n: Lemma (v (a `logand` b) == v a `logand_v` v b)\n [SMTPat (v (a `logand` b))]\n= logand_spec a b", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 79, "start_col": 2, "end_line": 79, "end_col": 17 }, "file_context": "module QUIC.Secret.Int\ninclude QUIC.Secret.Int.Base\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U = FStar.UInt\nmodule BF = LowParse.BitFields\n\ninline_for_extraction\nnoextract\nval usub\n (#t: inttype { unsigned t })\n (#sec: secrecy_level)\n (x: uint_t t sec)\n (y: uint_t t sec { v y <= v x })\n: Tot (z: uint_t t sec { v z == v x - v y })\n\ninline_for_extraction\nnoextract\nval cast_up\n (#t1: inttype { unsigned t1 })\n (t2: inttype { unsigned t2 /\\ bits t1 <= bits t2 })\n (#sec: secrecy_level)\n (x: uint_t t1 sec)\n: Tot (y: uint_t t2 SEC { v y == v x })\n\ninline_for_extraction\nnoextract\nval cast_down\n (#t1: inttype { unsigned t1 })\n (t2: inttype { unsigned t2 })\n (#sec: secrecy_level)\n (x: uint_t t1 sec { v x < pow2 (bits t2) } )\n: Tot (y: uint_t t2 SEC { v y == v x })\n\ninline_for_extraction\nnoextract\nval hide\n (#t: inttype { unsigned t })\n (#sec: secrecy_level)\n (x: uint_t t sec)\n: Tot (y: uint_t t SEC { v y == v x })\n\ninline_for_extraction\nnoextract\nval reveal\n (#t: inttype { unsigned t })\n (#sec: secrecy_level)\n (x: uint_t t sec)\n: GTot (y: uint_t t PUB { v y == v x })\n\nlet hide_reveal\n (#t: inttype { unsigned t })\n (x: uint_t t SEC)\n: Lemma\n (hide (reveal x) == x)\n [SMTPat (hide (reveal x))]\n= ()\n\nlet reveal_hide\n (#t: inttype { unsigned t })\n (x: uint_t t PUB)\n: Lemma\n (reveal (hide x) == x)\n [SMTPat (reveal (hide x))]\n= ()\n\n(* Patterns *)\n\nlet logand_spec'\n (#t:inttype)\n (#l:secrecy_level)\n (a:int_t t l)\n (b:int_t t l)\n: Lemma (v (a `logand` b) == v a `logand_v` v b)", "dependencies": { "source_file": "QUIC.Secret.Int.fsti", "checked_file": "QUIC.Secret.Int.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Lib.IntTypes.int_t t l -> b: Lib.IntTypes.int_t t l\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Secret.Int.Base.v (Lib.IntTypes.logand a b) ==\n Lib.IntTypes.logand_v (QUIC.Secret.Int.Base.v a) (QUIC.Secret.Int.Base.v b))\n [SMTPat (QUIC.Secret.Int.Base.v (Lib.IntTypes.logand a b))]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Lib.IntTypes.secrecy_level", "Lib.IntTypes.int_t", "Lib.IntTypes.logand_spec", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "Lib.IntTypes.range_t", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.logand", "Lib.IntTypes.logand_v", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val logand_spec' (#t: inttype) (#l: secrecy_level) (a b: int_t t l)\n : Lemma (v (a `logand` b) == (v a) `logand_v` (v b)) [SMTPat (v (a `logand` b))]\nlet logand_spec' (#t: inttype) (#l: secrecy_level) (a b: int_t t l)\n : Lemma (v (a `logand` b) == (v a) `logand_v` (v b)) [SMTPat (v (a `logand` b))] =", "completed_definiton": "logand_spec a b", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fsti", "name": "QUIC.Secret.Int.logxor_spec'", "original_source_type": "val logxor_spec' (#t: inttype) (#l: secrecy_level) (a b: int_t t l)\n : Lemma (v (a `logxor` b) == (v a) `logxor_v` (v b)) [SMTPat (v (a `logxor` b))]", "source_type": "val logxor_spec' (#t: inttype) (#l: secrecy_level) (a b: int_t t l)\n : Lemma (v (a `logxor` b) == (v a) `logxor_v` (v b)) [SMTPat (v (a `logxor` b))]", "source_definition": "let logxor_spec'\n (#t:inttype)\n (#l:secrecy_level)\n (a:int_t t l)\n (b:int_t t l)\n: Lemma (v (a `logxor` b) == v a `logxor_v` v b)\n [SMTPat (v (a `logxor` b))]\n= logxor_spec a b", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 97, "start_col": 2, "end_line": 97, "end_col": 17 }, "file_context": "module QUIC.Secret.Int\ninclude QUIC.Secret.Int.Base\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U = FStar.UInt\nmodule BF = LowParse.BitFields\n\ninline_for_extraction\nnoextract\nval usub\n (#t: inttype { unsigned t })\n (#sec: secrecy_level)\n (x: uint_t t sec)\n (y: uint_t t sec { v y <= v x })\n: Tot (z: uint_t t sec { v z == v x - v y })\n\ninline_for_extraction\nnoextract\nval cast_up\n (#t1: inttype { unsigned t1 })\n (t2: inttype { unsigned t2 /\\ bits t1 <= bits t2 })\n (#sec: secrecy_level)\n (x: uint_t t1 sec)\n: Tot (y: uint_t t2 SEC { v y == v x })\n\ninline_for_extraction\nnoextract\nval cast_down\n (#t1: inttype { unsigned t1 })\n (t2: inttype { unsigned t2 })\n (#sec: secrecy_level)\n (x: uint_t t1 sec { v x < pow2 (bits t2) } )\n: Tot (y: uint_t t2 SEC { v y == v x })\n\ninline_for_extraction\nnoextract\nval hide\n (#t: inttype { unsigned t })\n (#sec: secrecy_level)\n (x: uint_t t sec)\n: Tot (y: uint_t t SEC { v y == v x })\n\ninline_for_extraction\nnoextract\nval reveal\n (#t: inttype { unsigned t })\n (#sec: secrecy_level)\n (x: uint_t t sec)\n: GTot (y: uint_t t PUB { v y == v x })\n\nlet hide_reveal\n (#t: inttype { unsigned t })\n (x: uint_t t SEC)\n: Lemma\n (hide (reveal x) == x)\n [SMTPat (hide (reveal x))]\n= ()\n\nlet reveal_hide\n (#t: inttype { unsigned t })\n (x: uint_t t PUB)\n: Lemma\n (reveal (hide x) == x)\n [SMTPat (reveal (hide x))]\n= ()\n\n(* Patterns *)\n\nlet logand_spec'\n (#t:inttype)\n (#l:secrecy_level)\n (a:int_t t l)\n (b:int_t t l)\n: Lemma (v (a `logand` b) == v a `logand_v` v b)\n [SMTPat (v (a `logand` b))]\n= logand_spec a b\n\nlet logor_spec'\n (#t:inttype)\n (#l:secrecy_level)\n (a:int_t t l)\n (b:int_t t l)\n: Lemma (v (a `logor` b) == v a `logor_v` v b)\n [SMTPat (v (a `logor` b))]\n= logor_spec a b\n\nlet logxor_spec'\n (#t:inttype)\n (#l:secrecy_level)\n (a:int_t t l)\n (b:int_t t l)\n: Lemma (v (a `logxor` b) == v a `logxor_v` v b)", "dependencies": { "source_file": "QUIC.Secret.Int.fsti", "checked_file": "QUIC.Secret.Int.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Lib.IntTypes.int_t t l -> b: Lib.IntTypes.int_t t l\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Secret.Int.Base.v (Lib.IntTypes.logxor a b) ==\n Lib.IntTypes.logxor_v (QUIC.Secret.Int.Base.v a) (QUIC.Secret.Int.Base.v b))\n [SMTPat (QUIC.Secret.Int.Base.v (Lib.IntTypes.logxor a b))]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Lib.IntTypes.secrecy_level", "Lib.IntTypes.int_t", "Lib.IntTypes.logxor_spec", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "Lib.IntTypes.range_t", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.logxor", "Lib.IntTypes.logxor_v", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val logxor_spec' (#t: inttype) (#l: secrecy_level) (a b: int_t t l)\n : Lemma (v (a `logxor` b) == (v a) `logxor_v` (v b)) [SMTPat (v (a `logxor` b))]\nlet logxor_spec' (#t: inttype) (#l: secrecy_level) (a b: int_t t l)\n : Lemma (v (a `logxor` b) == (v a) `logxor_v` (v b)) [SMTPat (v (a `logxor` b))] =", "completed_definiton": "logxor_spec a b", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fsti", "name": "QUIC.Secret.Int.logor_spec'", "original_source_type": "val logor_spec' (#t: inttype) (#l: secrecy_level) (a b: int_t t l)\n : Lemma (v (a `logor` b) == (v a) `logor_v` (v b)) [SMTPat (v (a `logor` b))]", "source_type": "val logor_spec' (#t: inttype) (#l: secrecy_level) (a b: int_t t l)\n : Lemma (v (a `logor` b) == (v a) `logor_v` (v b)) [SMTPat (v (a `logor` b))]", "source_definition": "let logor_spec'\n (#t:inttype)\n (#l:secrecy_level)\n (a:int_t t l)\n (b:int_t t l)\n: Lemma (v (a `logor` b) == v a `logor_v` v b)\n [SMTPat (v (a `logor` b))]\n= logor_spec a b", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 88, "start_col": 2, "end_line": 88, "end_col": 16 }, "file_context": "module QUIC.Secret.Int\ninclude QUIC.Secret.Int.Base\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U = FStar.UInt\nmodule BF = LowParse.BitFields\n\ninline_for_extraction\nnoextract\nval usub\n (#t: inttype { unsigned t })\n (#sec: secrecy_level)\n (x: uint_t t sec)\n (y: uint_t t sec { v y <= v x })\n: Tot (z: uint_t t sec { v z == v x - v y })\n\ninline_for_extraction\nnoextract\nval cast_up\n (#t1: inttype { unsigned t1 })\n (t2: inttype { unsigned t2 /\\ bits t1 <= bits t2 })\n (#sec: secrecy_level)\n (x: uint_t t1 sec)\n: Tot (y: uint_t t2 SEC { v y == v x })\n\ninline_for_extraction\nnoextract\nval cast_down\n (#t1: inttype { unsigned t1 })\n (t2: inttype { unsigned t2 })\n (#sec: secrecy_level)\n (x: uint_t t1 sec { v x < pow2 (bits t2) } )\n: Tot (y: uint_t t2 SEC { v y == v x })\n\ninline_for_extraction\nnoextract\nval hide\n (#t: inttype { unsigned t })\n (#sec: secrecy_level)\n (x: uint_t t sec)\n: Tot (y: uint_t t SEC { v y == v x })\n\ninline_for_extraction\nnoextract\nval reveal\n (#t: inttype { unsigned t })\n (#sec: secrecy_level)\n (x: uint_t t sec)\n: GTot (y: uint_t t PUB { v y == v x })\n\nlet hide_reveal\n (#t: inttype { unsigned t })\n (x: uint_t t SEC)\n: Lemma\n (hide (reveal x) == x)\n [SMTPat (hide (reveal x))]\n= ()\n\nlet reveal_hide\n (#t: inttype { unsigned t })\n (x: uint_t t PUB)\n: Lemma\n (reveal (hide x) == x)\n [SMTPat (reveal (hide x))]\n= ()\n\n(* Patterns *)\n\nlet logand_spec'\n (#t:inttype)\n (#l:secrecy_level)\n (a:int_t t l)\n (b:int_t t l)\n: Lemma (v (a `logand` b) == v a `logand_v` v b)\n [SMTPat (v (a `logand` b))]\n= logand_spec a b\n\nlet logor_spec'\n (#t:inttype)\n (#l:secrecy_level)\n (a:int_t t l)\n (b:int_t t l)\n: Lemma (v (a `logor` b) == v a `logor_v` v b)", "dependencies": { "source_file": "QUIC.Secret.Int.fsti", "checked_file": "QUIC.Secret.Int.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.Base.fst.checked", "prims.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Lib.IntTypes.int_t t l -> b: Lib.IntTypes.int_t t l\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Secret.Int.Base.v (Lib.IntTypes.logor a b) ==\n Lib.IntTypes.logor_v (QUIC.Secret.Int.Base.v a) (QUIC.Secret.Int.Base.v b))\n [SMTPat (QUIC.Secret.Int.Base.v (Lib.IntTypes.logor a b))]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Lib.IntTypes.secrecy_level", "Lib.IntTypes.int_t", "Lib.IntTypes.logor_spec", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "Lib.IntTypes.range_t", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.logor", "Lib.IntTypes.logor_v", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val logor_spec' (#t: inttype) (#l: secrecy_level) (a b: int_t t l)\n : Lemma (v (a `logor` b) == (v a) `logor_v` (v b)) [SMTPat (v (a `logor` b))]\nlet logor_spec' (#t: inttype) (#l: secrecy_level) (a b: int_t t l)\n : Lemma (v (a `logor` b) == (v a) `logor_v` (v b)) [SMTPat (v (a `logor` b))] =", "completed_definiton": "logor_spec a b", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Base.fst", "name": "QUIC.Spec.Header.Base.has_payload_length", "original_source_type": "val has_payload_length (h: header) : Tot bool", "source_type": "val has_payload_length (h: header) : Tot bool", "source_definition": "let has_payload_length\n (h: header)\n: Tot bool\n= MLong? h && (not (MRetry? (MLong?.spec h)))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 108, "start_col": 2, "end_line": 108, "end_col": 45 }, "file_context": "module QUIC.Spec.Header.Base\ninclude QUIC.Spec.Base\n\nmodule FB = FStar.Bytes\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule S = FStar.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Cast = FStar.Int.Cast\n\nnoeq\ntype long_header_specifics =\n| MInitial:\n (reserved_bits: bitfield 2) ->\n (token: vlbytes 0 token_max_len) -> // arbitrary bound\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MZeroRTT:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MHandshake:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MRetry:\n (unused: bitfield 4) ->\n (odcid: vlbytes 0 20) -> // TODO: change bounds to drop instead of rejecting as invalid\n long_header_specifics\n\nnoeq\ntype header =\n| MLong:\n (version: U32.t) ->\n (dcid: vlbytes 0 20) ->\n (scid: vlbytes 0 20) ->\n (spec: long_header_specifics) ->\n header\n| MShort:\n (reserved_bits: bitfield 2) ->\n (spin: bool) ->\n (key_phase: bool) ->\n (dcid: vlbytes 0 20) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n header\n\nlet is_initial (h: header) : Tot bool =\n if MLong? h then MInitial? (MLong?.spec h) else false\n\nlet is_zero_rtt (h: header) : Tot bool =\n if MLong? h then MZeroRTT? (MLong?.spec h) else false\n\nlet is_handshake (h: header) : Tot bool =\n if MLong? h then MHandshake? (MLong?.spec h) else false\n\nlet is_retry (h: header) : Tot bool =\n if MLong? h then MRetry? (MLong?.spec h) else false\n\nlet reserved_bits (h: header { ~ (is_retry h) }) : Tot (bitfield 2) =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial pb _ _ _ _ -> pb\n | MZeroRTT pb _ _ _ -> pb\n | MHandshake pb _ _ _ -> pb\n end\n | MShort pb _ _ _ _ _ -> pb\n\nlet pn_length (h: header { ~ (is_retry h) }) : Tot PN.packet_number_length_t =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial _ _ _ pnl _ -> pnl\n | MZeroRTT _ _ pnl _ -> pnl\n | MHandshake _ _ pnl _ -> pnl\n end\n | MShort _ _ _ _ pnl _ -> pnl\n\nlet packet_number (h: header {~ (is_retry h)}) : Tot PN.packet_number_t =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial _ _ _ _ pn -> pn\n | MZeroRTT _ _ _ pn -> pn\n | MHandshake _ _ _ pn -> pn\n end\n | MShort _ _ _ _ _ pn -> pn\n\nlet dcid_len (h: header) : Tot nat =\n match h with\n | MLong _ dcid _ _ -> FB.length dcid\n | MShort _ _ _ dcid _ _ -> FB.length dcid\n\n(* Payload length *)\n\nlet has_payload_length\n (h: header)", "dependencies": { "source_file": "QUIC.Spec.Header.Base.fst", "checked_file": "QUIC.Spec.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "Prims.op_AmpAmp", "QUIC.Spec.Header.Base.uu___is_MLong", "Prims.op_Negation", "QUIC.Spec.Header.Base.uu___is_MRetry", "QUIC.Spec.Header.Base.__proj__MLong__item__spec", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val has_payload_length (h: header) : Tot bool\nlet has_payload_length (h: header) : Tot bool =", "completed_definiton": "MLong? h && (not (MRetry? (MLong?.spec h)))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Base.fst", "name": "QUIC.Spec.Header.Base.is_initial", "original_source_type": "val is_initial (h: header) : Tot bool", "source_type": "val is_initial (h: header) : Tot bool", "source_definition": "let is_initial (h: header) : Tot bool =\n if MLong? h then MInitial? (MLong?.spec h) else false", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 57, "start_col": 2, "end_line": 57, "end_col": 55 }, "file_context": "module QUIC.Spec.Header.Base\ninclude QUIC.Spec.Base\n\nmodule FB = FStar.Bytes\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule S = FStar.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Cast = FStar.Int.Cast\n\nnoeq\ntype long_header_specifics =\n| MInitial:\n (reserved_bits: bitfield 2) ->\n (token: vlbytes 0 token_max_len) -> // arbitrary bound\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MZeroRTT:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MHandshake:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MRetry:\n (unused: bitfield 4) ->\n (odcid: vlbytes 0 20) -> // TODO: change bounds to drop instead of rejecting as invalid\n long_header_specifics\n\nnoeq\ntype header =\n| MLong:\n (version: U32.t) ->\n (dcid: vlbytes 0 20) ->\n (scid: vlbytes 0 20) ->\n (spec: long_header_specifics) ->\n header\n| MShort:\n (reserved_bits: bitfield 2) ->\n (spin: bool) ->\n (key_phase: bool) ->\n (dcid: vlbytes 0 20) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n header", "dependencies": { "source_file": "QUIC.Spec.Header.Base.fst", "checked_file": "QUIC.Spec.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "QUIC.Spec.Header.Base.uu___is_MLong", "QUIC.Spec.Header.Base.uu___is_MInitial", "QUIC.Spec.Header.Base.__proj__MLong__item__spec", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val is_initial (h: header) : Tot bool\nlet is_initial (h: header) : Tot bool =", "completed_definiton": "if MLong? h then MInitial? (MLong?.spec h) else false", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Base.fst", "name": "QUIC.Spec.Header.Base.is_zero_rtt", "original_source_type": "val is_zero_rtt (h: header) : Tot bool", "source_type": "val is_zero_rtt (h: header) : Tot bool", "source_definition": "let is_zero_rtt (h: header) : Tot bool =\n if MLong? h then MZeroRTT? (MLong?.spec h) else false", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 60, "start_col": 2, "end_line": 60, "end_col": 55 }, "file_context": "module QUIC.Spec.Header.Base\ninclude QUIC.Spec.Base\n\nmodule FB = FStar.Bytes\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule S = FStar.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Cast = FStar.Int.Cast\n\nnoeq\ntype long_header_specifics =\n| MInitial:\n (reserved_bits: bitfield 2) ->\n (token: vlbytes 0 token_max_len) -> // arbitrary bound\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MZeroRTT:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MHandshake:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MRetry:\n (unused: bitfield 4) ->\n (odcid: vlbytes 0 20) -> // TODO: change bounds to drop instead of rejecting as invalid\n long_header_specifics\n\nnoeq\ntype header =\n| MLong:\n (version: U32.t) ->\n (dcid: vlbytes 0 20) ->\n (scid: vlbytes 0 20) ->\n (spec: long_header_specifics) ->\n header\n| MShort:\n (reserved_bits: bitfield 2) ->\n (spin: bool) ->\n (key_phase: bool) ->\n (dcid: vlbytes 0 20) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n header\n\nlet is_initial (h: header) : Tot bool =\n if MLong? h then MInitial? (MLong?.spec h) else false", "dependencies": { "source_file": "QUIC.Spec.Header.Base.fst", "checked_file": "QUIC.Spec.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "QUIC.Spec.Header.Base.uu___is_MLong", "QUIC.Spec.Header.Base.uu___is_MZeroRTT", "QUIC.Spec.Header.Base.__proj__MLong__item__spec", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val is_zero_rtt (h: header) : Tot bool\nlet is_zero_rtt (h: header) : Tot bool =", "completed_definiton": "if MLong? h then MZeroRTT? (MLong?.spec h) else false", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Base.fst", "name": "QUIC.Spec.Header.Base.is_handshake", "original_source_type": "val is_handshake (h: header) : Tot bool", "source_type": "val is_handshake (h: header) : Tot bool", "source_definition": "let is_handshake (h: header) : Tot bool =\n if MLong? h then MHandshake? (MLong?.spec h) else false", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 63, "start_col": 2, "end_line": 63, "end_col": 57 }, "file_context": "module QUIC.Spec.Header.Base\ninclude QUIC.Spec.Base\n\nmodule FB = FStar.Bytes\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule S = FStar.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Cast = FStar.Int.Cast\n\nnoeq\ntype long_header_specifics =\n| MInitial:\n (reserved_bits: bitfield 2) ->\n (token: vlbytes 0 token_max_len) -> // arbitrary bound\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MZeroRTT:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MHandshake:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MRetry:\n (unused: bitfield 4) ->\n (odcid: vlbytes 0 20) -> // TODO: change bounds to drop instead of rejecting as invalid\n long_header_specifics\n\nnoeq\ntype header =\n| MLong:\n (version: U32.t) ->\n (dcid: vlbytes 0 20) ->\n (scid: vlbytes 0 20) ->\n (spec: long_header_specifics) ->\n header\n| MShort:\n (reserved_bits: bitfield 2) ->\n (spin: bool) ->\n (key_phase: bool) ->\n (dcid: vlbytes 0 20) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n header\n\nlet is_initial (h: header) : Tot bool =\n if MLong? h then MInitial? (MLong?.spec h) else false\n\nlet is_zero_rtt (h: header) : Tot bool =\n if MLong? h then MZeroRTT? (MLong?.spec h) else false", "dependencies": { "source_file": "QUIC.Spec.Header.Base.fst", "checked_file": "QUIC.Spec.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "QUIC.Spec.Header.Base.uu___is_MLong", "QUIC.Spec.Header.Base.uu___is_MHandshake", "QUIC.Spec.Header.Base.__proj__MLong__item__spec", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val is_handshake (h: header) : Tot bool\nlet is_handshake (h: header) : Tot bool =", "completed_definiton": "if MLong? h then MHandshake? (MLong?.spec h) else false", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Base.fst", "name": "QUIC.Spec.Header.Base.is_retry", "original_source_type": "val is_retry (h: header) : Tot bool", "source_type": "val is_retry (h: header) : Tot bool", "source_definition": "let is_retry (h: header) : Tot bool =\n if MLong? h then MRetry? (MLong?.spec h) else false", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 66, "start_col": 2, "end_line": 66, "end_col": 53 }, "file_context": "module QUIC.Spec.Header.Base\ninclude QUIC.Spec.Base\n\nmodule FB = FStar.Bytes\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule S = FStar.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Cast = FStar.Int.Cast\n\nnoeq\ntype long_header_specifics =\n| MInitial:\n (reserved_bits: bitfield 2) ->\n (token: vlbytes 0 token_max_len) -> // arbitrary bound\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MZeroRTT:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MHandshake:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MRetry:\n (unused: bitfield 4) ->\n (odcid: vlbytes 0 20) -> // TODO: change bounds to drop instead of rejecting as invalid\n long_header_specifics\n\nnoeq\ntype header =\n| MLong:\n (version: U32.t) ->\n (dcid: vlbytes 0 20) ->\n (scid: vlbytes 0 20) ->\n (spec: long_header_specifics) ->\n header\n| MShort:\n (reserved_bits: bitfield 2) ->\n (spin: bool) ->\n (key_phase: bool) ->\n (dcid: vlbytes 0 20) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n header\n\nlet is_initial (h: header) : Tot bool =\n if MLong? h then MInitial? (MLong?.spec h) else false\n\nlet is_zero_rtt (h: header) : Tot bool =\n if MLong? h then MZeroRTT? (MLong?.spec h) else false\n\nlet is_handshake (h: header) : Tot bool =\n if MLong? h then MHandshake? (MLong?.spec h) else false", "dependencies": { "source_file": "QUIC.Spec.Header.Base.fst", "checked_file": "QUIC.Spec.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "QUIC.Spec.Header.Base.uu___is_MLong", "QUIC.Spec.Header.Base.uu___is_MRetry", "QUIC.Spec.Header.Base.__proj__MLong__item__spec", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val is_retry (h: header) : Tot bool\nlet is_retry (h: header) : Tot bool =", "completed_definiton": "if MLong? h then MRetry? (MLong?.spec h) else false", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Base.fst", "name": "QUIC.Spec.Header.Base.reserved_bits", "original_source_type": "val reserved_bits (h: header{~(is_retry h)}) : Tot (bitfield 2)", "source_type": "val reserved_bits (h: header{~(is_retry h)}) : Tot (bitfield 2)", "source_definition": "let reserved_bits (h: header { ~ (is_retry h) }) : Tot (bitfield 2) =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial pb _ _ _ _ -> pb\n | MZeroRTT pb _ _ _ -> pb\n | MHandshake pb _ _ _ -> pb\n end\n | MShort pb _ _ _ _ _ -> pb", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 69, "start_col": 2, "end_line": 76, "end_col": 29 }, "file_context": "module QUIC.Spec.Header.Base\ninclude QUIC.Spec.Base\n\nmodule FB = FStar.Bytes\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule S = FStar.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Cast = FStar.Int.Cast\n\nnoeq\ntype long_header_specifics =\n| MInitial:\n (reserved_bits: bitfield 2) ->\n (token: vlbytes 0 token_max_len) -> // arbitrary bound\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MZeroRTT:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MHandshake:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MRetry:\n (unused: bitfield 4) ->\n (odcid: vlbytes 0 20) -> // TODO: change bounds to drop instead of rejecting as invalid\n long_header_specifics\n\nnoeq\ntype header =\n| MLong:\n (version: U32.t) ->\n (dcid: vlbytes 0 20) ->\n (scid: vlbytes 0 20) ->\n (spec: long_header_specifics) ->\n header\n| MShort:\n (reserved_bits: bitfield 2) ->\n (spin: bool) ->\n (key_phase: bool) ->\n (dcid: vlbytes 0 20) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n header\n\nlet is_initial (h: header) : Tot bool =\n if MLong? h then MInitial? (MLong?.spec h) else false\n\nlet is_zero_rtt (h: header) : Tot bool =\n if MLong? h then MZeroRTT? (MLong?.spec h) else false\n\nlet is_handshake (h: header) : Tot bool =\n if MLong? h then MHandshake? (MLong?.spec h) else false\n\nlet is_retry (h: header) : Tot bool =\n if MLong? h then MRetry? (MLong?.spec h) else false", "dependencies": { "source_file": "QUIC.Spec.Header.Base.fst", "checked_file": "QUIC.Spec.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header{~(QUIC.Spec.Header.Base.is_retry h)} -> QUIC.Spec.Base.bitfield 2", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Spec.Header.Base.is_retry", "FStar.UInt32.t", "QUIC.Spec.Base.vlbytes", "QUIC.Spec.Header.Base.long_header_specifics", "QUIC.Spec.Base.bitfield", "QUIC.Spec.Base.token_max_len", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val reserved_bits (h: header{~(is_retry h)}) : Tot (bitfield 2)\nlet reserved_bits (h: header{~(is_retry h)}) : Tot (bitfield 2) =", "completed_definiton": "match h with\n| MLong _ _ _ spec ->\n (match spec with\n | MInitial pb _ _ _ _ -> pb\n | MZeroRTT pb _ _ _ -> pb\n | MHandshake pb _ _ _ -> pb)\n| MShort pb _ _ _ _ _ -> pb", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Base.fst", "name": "QUIC.Spec.Header.Base.pn_length", "original_source_type": "val pn_length (h: header{~(is_retry h)}) : Tot PN.packet_number_length_t", "source_type": "val pn_length (h: header{~(is_retry h)}) : Tot PN.packet_number_length_t", "source_definition": "let pn_length (h: header { ~ (is_retry h) }) : Tot PN.packet_number_length_t =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial _ _ _ pnl _ -> pnl\n | MZeroRTT _ _ pnl _ -> pnl\n | MHandshake _ _ pnl _ -> pnl\n end\n | MShort _ _ _ _ pnl _ -> pnl", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 79, "start_col": 2, "end_line": 86, "end_col": 31 }, "file_context": "module QUIC.Spec.Header.Base\ninclude QUIC.Spec.Base\n\nmodule FB = FStar.Bytes\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule S = FStar.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Cast = FStar.Int.Cast\n\nnoeq\ntype long_header_specifics =\n| MInitial:\n (reserved_bits: bitfield 2) ->\n (token: vlbytes 0 token_max_len) -> // arbitrary bound\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MZeroRTT:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MHandshake:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MRetry:\n (unused: bitfield 4) ->\n (odcid: vlbytes 0 20) -> // TODO: change bounds to drop instead of rejecting as invalid\n long_header_specifics\n\nnoeq\ntype header =\n| MLong:\n (version: U32.t) ->\n (dcid: vlbytes 0 20) ->\n (scid: vlbytes 0 20) ->\n (spec: long_header_specifics) ->\n header\n| MShort:\n (reserved_bits: bitfield 2) ->\n (spin: bool) ->\n (key_phase: bool) ->\n (dcid: vlbytes 0 20) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n header\n\nlet is_initial (h: header) : Tot bool =\n if MLong? h then MInitial? (MLong?.spec h) else false\n\nlet is_zero_rtt (h: header) : Tot bool =\n if MLong? h then MZeroRTT? (MLong?.spec h) else false\n\nlet is_handshake (h: header) : Tot bool =\n if MLong? h then MHandshake? (MLong?.spec h) else false\n\nlet is_retry (h: header) : Tot bool =\n if MLong? h then MRetry? (MLong?.spec h) else false\n\nlet reserved_bits (h: header { ~ (is_retry h) }) : Tot (bitfield 2) =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial pb _ _ _ _ -> pb\n | MZeroRTT pb _ _ _ -> pb\n | MHandshake pb _ _ _ -> pb\n end\n | MShort pb _ _ _ _ _ -> pb", "dependencies": { "source_file": "QUIC.Spec.Header.Base.fst", "checked_file": "QUIC.Spec.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header{~(QUIC.Spec.Header.Base.is_retry h)}\n -> QUIC.Spec.PacketNumber.Base.packet_number_length_t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Spec.Header.Base.is_retry", "FStar.UInt32.t", "QUIC.Spec.Base.vlbytes", "QUIC.Spec.Header.Base.long_header_specifics", "QUIC.Spec.Base.bitfield", "QUIC.Spec.Base.token_max_len", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val pn_length (h: header{~(is_retry h)}) : Tot PN.packet_number_length_t\nlet pn_length (h: header{~(is_retry h)}) : Tot PN.packet_number_length_t =", "completed_definiton": "match h with\n| MLong _ _ _ spec ->\n (match spec with\n | MInitial _ _ _ pnl _ -> pnl\n | MZeroRTT _ _ pnl _ -> pnl\n | MHandshake _ _ pnl _ -> pnl)\n| MShort _ _ _ _ pnl _ -> pnl", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Base.fst", "name": "QUIC.Spec.Header.Base.dcid_len", "original_source_type": "val dcid_len (h: header) : Tot nat", "source_type": "val dcid_len (h: header) : Tot nat", "source_definition": "let dcid_len (h: header) : Tot nat =\n match h with\n | MLong _ dcid _ _ -> FB.length dcid\n | MShort _ _ _ dcid _ _ -> FB.length dcid", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 99, "start_col": 2, "end_line": 101, "end_col": 43 }, "file_context": "module QUIC.Spec.Header.Base\ninclude QUIC.Spec.Base\n\nmodule FB = FStar.Bytes\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule S = FStar.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Cast = FStar.Int.Cast\n\nnoeq\ntype long_header_specifics =\n| MInitial:\n (reserved_bits: bitfield 2) ->\n (token: vlbytes 0 token_max_len) -> // arbitrary bound\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MZeroRTT:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MHandshake:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MRetry:\n (unused: bitfield 4) ->\n (odcid: vlbytes 0 20) -> // TODO: change bounds to drop instead of rejecting as invalid\n long_header_specifics\n\nnoeq\ntype header =\n| MLong:\n (version: U32.t) ->\n (dcid: vlbytes 0 20) ->\n (scid: vlbytes 0 20) ->\n (spec: long_header_specifics) ->\n header\n| MShort:\n (reserved_bits: bitfield 2) ->\n (spin: bool) ->\n (key_phase: bool) ->\n (dcid: vlbytes 0 20) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n header\n\nlet is_initial (h: header) : Tot bool =\n if MLong? h then MInitial? (MLong?.spec h) else false\n\nlet is_zero_rtt (h: header) : Tot bool =\n if MLong? h then MZeroRTT? (MLong?.spec h) else false\n\nlet is_handshake (h: header) : Tot bool =\n if MLong? h then MHandshake? (MLong?.spec h) else false\n\nlet is_retry (h: header) : Tot bool =\n if MLong? h then MRetry? (MLong?.spec h) else false\n\nlet reserved_bits (h: header { ~ (is_retry h) }) : Tot (bitfield 2) =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial pb _ _ _ _ -> pb\n | MZeroRTT pb _ _ _ -> pb\n | MHandshake pb _ _ _ -> pb\n end\n | MShort pb _ _ _ _ _ -> pb\n\nlet pn_length (h: header { ~ (is_retry h) }) : Tot PN.packet_number_length_t =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial _ _ _ pnl _ -> pnl\n | MZeroRTT _ _ pnl _ -> pnl\n | MHandshake _ _ pnl _ -> pnl\n end\n | MShort _ _ _ _ pnl _ -> pnl\n\nlet packet_number (h: header {~ (is_retry h)}) : Tot PN.packet_number_t =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial _ _ _ _ pn -> pn\n | MZeroRTT _ _ _ pn -> pn\n | MHandshake _ _ _ pn -> pn\n end\n | MShort _ _ _ _ _ pn -> pn", "dependencies": { "source_file": "QUIC.Spec.Header.Base.fst", "checked_file": "QUIC.Spec.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header -> Prims.nat", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "FStar.UInt32.t", "QUIC.Spec.Base.vlbytes", "QUIC.Spec.Header.Base.long_header_specifics", "FStar.Bytes.length", "QUIC.Spec.Base.bitfield", "Prims.bool", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val dcid_len (h: header) : Tot nat\nlet dcid_len (h: header) : Tot nat =", "completed_definiton": "match h with\n| MLong _ dcid _ _ -> FB.length dcid\n| MShort _ _ _ dcid _ _ -> FB.length dcid", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Base.fst", "name": "QUIC.Spec.Header.Base.packet_number", "original_source_type": "val packet_number (h: header{~(is_retry h)}) : Tot PN.packet_number_t", "source_type": "val packet_number (h: header{~(is_retry h)}) : Tot PN.packet_number_t", "source_definition": "let packet_number (h: header {~ (is_retry h)}) : Tot PN.packet_number_t =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial _ _ _ _ pn -> pn\n | MZeroRTT _ _ _ pn -> pn\n | MHandshake _ _ _ pn -> pn\n end\n | MShort _ _ _ _ _ pn -> pn", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 89, "start_col": 2, "end_line": 96, "end_col": 29 }, "file_context": "module QUIC.Spec.Header.Base\ninclude QUIC.Spec.Base\n\nmodule FB = FStar.Bytes\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule S = FStar.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Cast = FStar.Int.Cast\n\nnoeq\ntype long_header_specifics =\n| MInitial:\n (reserved_bits: bitfield 2) ->\n (token: vlbytes 0 token_max_len) -> // arbitrary bound\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MZeroRTT:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MHandshake:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MRetry:\n (unused: bitfield 4) ->\n (odcid: vlbytes 0 20) -> // TODO: change bounds to drop instead of rejecting as invalid\n long_header_specifics\n\nnoeq\ntype header =\n| MLong:\n (version: U32.t) ->\n (dcid: vlbytes 0 20) ->\n (scid: vlbytes 0 20) ->\n (spec: long_header_specifics) ->\n header\n| MShort:\n (reserved_bits: bitfield 2) ->\n (spin: bool) ->\n (key_phase: bool) ->\n (dcid: vlbytes 0 20) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n header\n\nlet is_initial (h: header) : Tot bool =\n if MLong? h then MInitial? (MLong?.spec h) else false\n\nlet is_zero_rtt (h: header) : Tot bool =\n if MLong? h then MZeroRTT? (MLong?.spec h) else false\n\nlet is_handshake (h: header) : Tot bool =\n if MLong? h then MHandshake? (MLong?.spec h) else false\n\nlet is_retry (h: header) : Tot bool =\n if MLong? h then MRetry? (MLong?.spec h) else false\n\nlet reserved_bits (h: header { ~ (is_retry h) }) : Tot (bitfield 2) =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial pb _ _ _ _ -> pb\n | MZeroRTT pb _ _ _ -> pb\n | MHandshake pb _ _ _ -> pb\n end\n | MShort pb _ _ _ _ _ -> pb\n\nlet pn_length (h: header { ~ (is_retry h) }) : Tot PN.packet_number_length_t =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial _ _ _ pnl _ -> pnl\n | MZeroRTT _ _ pnl _ -> pnl\n | MHandshake _ _ pnl _ -> pnl\n end\n | MShort _ _ _ _ pnl _ -> pnl", "dependencies": { "source_file": "QUIC.Spec.Header.Base.fst", "checked_file": "QUIC.Spec.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header{~(QUIC.Spec.Header.Base.is_retry h)}\n -> QUIC.Spec.PacketNumber.Base.packet_number_t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Spec.Header.Base.is_retry", "FStar.UInt32.t", "QUIC.Spec.Base.vlbytes", "QUIC.Spec.Header.Base.long_header_specifics", "QUIC.Spec.Base.bitfield", "QUIC.Spec.Base.token_max_len", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val packet_number (h: header{~(is_retry h)}) : Tot PN.packet_number_t\nlet packet_number (h: header{~(is_retry h)}) : Tot PN.packet_number_t =", "completed_definiton": "match h with\n| MLong _ _ _ spec ->\n (match spec with\n | MInitial _ _ _ _ pn -> pn\n | MZeroRTT _ _ _ pn -> pn\n | MHandshake _ _ _ pn -> pn)\n| MShort _ _ _ _ _ pn -> pn", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Base.fst", "name": "QUIC.Spec.Header.Base.payload_and_pn_length", "original_source_type": "val payload_and_pn_length (h: header{has_payload_length h}) : Tot U62.t", "source_type": "val payload_and_pn_length (h: header{has_payload_length h}) : Tot U62.t", "source_definition": "let payload_and_pn_length \n (h: header { has_payload_length h })\n: Tot U62.t\n= match MLong?.spec h with\n | MInitial _ _ pl _ _ -> pl\n | MZeroRTT _ pl _ _ -> pl\n | MHandshake _ pl _ _ -> pl", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 113, "start_col": 2, "end_line": 116, "end_col": 29 }, "file_context": "module QUIC.Spec.Header.Base\ninclude QUIC.Spec.Base\n\nmodule FB = FStar.Bytes\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule S = FStar.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Cast = FStar.Int.Cast\n\nnoeq\ntype long_header_specifics =\n| MInitial:\n (reserved_bits: bitfield 2) ->\n (token: vlbytes 0 token_max_len) -> // arbitrary bound\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MZeroRTT:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MHandshake:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MRetry:\n (unused: bitfield 4) ->\n (odcid: vlbytes 0 20) -> // TODO: change bounds to drop instead of rejecting as invalid\n long_header_specifics\n\nnoeq\ntype header =\n| MLong:\n (version: U32.t) ->\n (dcid: vlbytes 0 20) ->\n (scid: vlbytes 0 20) ->\n (spec: long_header_specifics) ->\n header\n| MShort:\n (reserved_bits: bitfield 2) ->\n (spin: bool) ->\n (key_phase: bool) ->\n (dcid: vlbytes 0 20) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n header\n\nlet is_initial (h: header) : Tot bool =\n if MLong? h then MInitial? (MLong?.spec h) else false\n\nlet is_zero_rtt (h: header) : Tot bool =\n if MLong? h then MZeroRTT? (MLong?.spec h) else false\n\nlet is_handshake (h: header) : Tot bool =\n if MLong? h then MHandshake? (MLong?.spec h) else false\n\nlet is_retry (h: header) : Tot bool =\n if MLong? h then MRetry? (MLong?.spec h) else false\n\nlet reserved_bits (h: header { ~ (is_retry h) }) : Tot (bitfield 2) =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial pb _ _ _ _ -> pb\n | MZeroRTT pb _ _ _ -> pb\n | MHandshake pb _ _ _ -> pb\n end\n | MShort pb _ _ _ _ _ -> pb\n\nlet pn_length (h: header { ~ (is_retry h) }) : Tot PN.packet_number_length_t =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial _ _ _ pnl _ -> pnl\n | MZeroRTT _ _ pnl _ -> pnl\n | MHandshake _ _ pnl _ -> pnl\n end\n | MShort _ _ _ _ pnl _ -> pnl\n\nlet packet_number (h: header {~ (is_retry h)}) : Tot PN.packet_number_t =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial _ _ _ _ pn -> pn\n | MZeroRTT _ _ _ pn -> pn\n | MHandshake _ _ _ pn -> pn\n end\n | MShort _ _ _ _ _ pn -> pn\n\nlet dcid_len (h: header) : Tot nat =\n match h with\n | MLong _ dcid _ _ -> FB.length dcid\n | MShort _ _ _ dcid _ _ -> FB.length dcid\n\n(* Payload length *)\n\nlet has_payload_length\n (h: header)\n: Tot bool\n= MLong? h && (not (MRetry? (MLong?.spec h)))\n\nlet payload_and_pn_length \n (h: header { has_payload_length h })", "dependencies": { "source_file": "QUIC.Spec.Header.Base.fst", "checked_file": "QUIC.Spec.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header{QUIC.Spec.Header.Base.has_payload_length h} -> QUIC.UInt62.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "Prims.b2t", "QUIC.Spec.Header.Base.has_payload_length", "QUIC.Spec.Header.Base.__proj__MLong__item__spec", "QUIC.Spec.Base.bitfield", "QUIC.Spec.Base.vlbytes", "QUIC.Spec.Base.token_max_len", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "QUIC.UInt62.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val payload_and_pn_length (h: header{has_payload_length h}) : Tot U62.t\nlet payload_and_pn_length (h: header{has_payload_length h}) : Tot U62.t =", "completed_definiton": "match MLong?.spec h with\n| MInitial _ _ pl _ _ -> pl\n| MZeroRTT _ pl _ _ -> pl\n| MHandshake _ pl _ _ -> pl", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Base.fst", "name": "QUIC.Spec.Header.Base.is_valid_header", "original_source_type": "val is_valid_header (h: header) (cid_len last: nat) : Tot Type0", "source_type": "val is_valid_header (h: header) (cid_len last: nat) : Tot Type0", "source_definition": "let is_valid_header (h: header) (cid_len: nat) (last: nat) : Tot Type0 =\n (MShort? h ==> dcid_len h == cid_len) /\\\n ((~ (is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) last (Secret.v (packet_number h)))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 132, "start_col": 2, "end_line": 133, "end_col": 100 }, "file_context": "module QUIC.Spec.Header.Base\ninclude QUIC.Spec.Base\n\nmodule FB = FStar.Bytes\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule S = FStar.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Cast = FStar.Int.Cast\n\nnoeq\ntype long_header_specifics =\n| MInitial:\n (reserved_bits: bitfield 2) ->\n (token: vlbytes 0 token_max_len) -> // arbitrary bound\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MZeroRTT:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MHandshake:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MRetry:\n (unused: bitfield 4) ->\n (odcid: vlbytes 0 20) -> // TODO: change bounds to drop instead of rejecting as invalid\n long_header_specifics\n\nnoeq\ntype header =\n| MLong:\n (version: U32.t) ->\n (dcid: vlbytes 0 20) ->\n (scid: vlbytes 0 20) ->\n (spec: long_header_specifics) ->\n header\n| MShort:\n (reserved_bits: bitfield 2) ->\n (spin: bool) ->\n (key_phase: bool) ->\n (dcid: vlbytes 0 20) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n header\n\nlet is_initial (h: header) : Tot bool =\n if MLong? h then MInitial? (MLong?.spec h) else false\n\nlet is_zero_rtt (h: header) : Tot bool =\n if MLong? h then MZeroRTT? (MLong?.spec h) else false\n\nlet is_handshake (h: header) : Tot bool =\n if MLong? h then MHandshake? (MLong?.spec h) else false\n\nlet is_retry (h: header) : Tot bool =\n if MLong? h then MRetry? (MLong?.spec h) else false\n\nlet reserved_bits (h: header { ~ (is_retry h) }) : Tot (bitfield 2) =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial pb _ _ _ _ -> pb\n | MZeroRTT pb _ _ _ -> pb\n | MHandshake pb _ _ _ -> pb\n end\n | MShort pb _ _ _ _ _ -> pb\n\nlet pn_length (h: header { ~ (is_retry h) }) : Tot PN.packet_number_length_t =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial _ _ _ pnl _ -> pnl\n | MZeroRTT _ _ pnl _ -> pnl\n | MHandshake _ _ pnl _ -> pnl\n end\n | MShort _ _ _ _ pnl _ -> pnl\n\nlet packet_number (h: header {~ (is_retry h)}) : Tot PN.packet_number_t =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial _ _ _ _ pn -> pn\n | MZeroRTT _ _ _ pn -> pn\n | MHandshake _ _ _ pn -> pn\n end\n | MShort _ _ _ _ _ pn -> pn\n\nlet dcid_len (h: header) : Tot nat =\n match h with\n | MLong _ dcid _ _ -> FB.length dcid\n | MShort _ _ _ dcid _ _ -> FB.length dcid\n\n(* Payload length *)\n\nlet has_payload_length\n (h: header)\n: Tot bool\n= MLong? h && (not (MRetry? (MLong?.spec h)))\n\nlet payload_and_pn_length \n (h: header { has_payload_length h })\n: Tot U62.t\n= match MLong?.spec h with\n | MInitial _ _ pl _ _ -> pl\n | MZeroRTT _ pl _ _ -> pl\n | MHandshake _ pl _ _ -> pl\n\nmodule Secret = QUIC.Secret.Int\n\nlet payload_length \n (h: header { has_payload_length h })\n: Tot U62.secret\n= match MLong?.spec h with\n | MInitial _ _ pl pnl _ -> Secret.to_u64 pl `Secret.sub` Secret.to_u64 pnl\n | MZeroRTT _ pl pnl _ -> Secret.to_u64 pl `Secret.sub` Secret.to_u64 pnl\n | MHandshake _ pl pnl _ -> Secret.to_u64 pl `Secret.sub` Secret.to_u64 pnl\n\n\n(* Correctness of a packet wrt. parsing parameters (cid_len, window) *)", "dependencies": { "source_file": "QUIC.Spec.Header.Base.fst", "checked_file": "QUIC.Spec.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header -> cid_len: Prims.nat -> last: Prims.nat -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "Prims.nat", "Prims.l_and", "Prims.l_imp", "Prims.b2t", "QUIC.Spec.Header.Base.uu___is_MShort", "Prims.eq2", "QUIC.Spec.Header.Base.dcid_len", "Prims.l_not", "QUIC.Spec.Header.Base.is_retry", "QUIC.Spec.PacketNumber.Base.in_window", "Prims.op_Subtraction", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "QUIC.Spec.Header.Base.pn_length", "Lib.IntTypes.U64", "QUIC.Spec.Header.Base.packet_number" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val is_valid_header (h: header) (cid_len last: nat) : Tot Type0\nlet is_valid_header (h: header) (cid_len last: nat) : Tot Type0 =", "completed_definiton": "(MShort? h ==> dcid_len h == cid_len) /\\\n((~(is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) last (Secret.v (packet_number h)))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Base.fst", "name": "QUIC.Spec.Header.Base.header_len", "original_source_type": "val header_len (h: header) : GTot (n: pos{n <= header_len_bound})", "source_type": "val header_len (h: header) : GTot (n: pos{n <= header_len_bound})", "source_definition": "let header_len\n (h: header)\n: GTot (n: pos { n <= header_len_bound })\n= match h with\n | MShort _ _ _ dcid packet_number_length _ ->\n 1 + FB.length dcid + Secret.v packet_number_length\n | MLong version dcid scid spec ->\n 7 + FB.length dcid + FB.length scid +\n begin match spec with\n | MInitial _ token payload_and_pn_length packet_number_length _ ->\n varint_len (Cast.uint32_to_uint64 (FB.len token)) + FB.length token + varint_len payload_and_pn_length + Secret.v packet_number_length\n | MZeroRTT _ payload_and_pn_length packet_number_length _ ->\n varint_len payload_and_pn_length + Secret.v packet_number_length\n | MHandshake _ payload_and_pn_length packet_number_length _ ->\n varint_len payload_and_pn_length + Secret.v packet_number_length\n | MRetry _ odcid ->\n 1 + FB.length odcid\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 140, "start_col": 2, "end_line": 154, "end_col": 7 }, "file_context": "module QUIC.Spec.Header.Base\ninclude QUIC.Spec.Base\n\nmodule FB = FStar.Bytes\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule S = FStar.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Cast = FStar.Int.Cast\n\nnoeq\ntype long_header_specifics =\n| MInitial:\n (reserved_bits: bitfield 2) ->\n (token: vlbytes 0 token_max_len) -> // arbitrary bound\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MZeroRTT:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MHandshake:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MRetry:\n (unused: bitfield 4) ->\n (odcid: vlbytes 0 20) -> // TODO: change bounds to drop instead of rejecting as invalid\n long_header_specifics\n\nnoeq\ntype header =\n| MLong:\n (version: U32.t) ->\n (dcid: vlbytes 0 20) ->\n (scid: vlbytes 0 20) ->\n (spec: long_header_specifics) ->\n header\n| MShort:\n (reserved_bits: bitfield 2) ->\n (spin: bool) ->\n (key_phase: bool) ->\n (dcid: vlbytes 0 20) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n header\n\nlet is_initial (h: header) : Tot bool =\n if MLong? h then MInitial? (MLong?.spec h) else false\n\nlet is_zero_rtt (h: header) : Tot bool =\n if MLong? h then MZeroRTT? (MLong?.spec h) else false\n\nlet is_handshake (h: header) : Tot bool =\n if MLong? h then MHandshake? (MLong?.spec h) else false\n\nlet is_retry (h: header) : Tot bool =\n if MLong? h then MRetry? (MLong?.spec h) else false\n\nlet reserved_bits (h: header { ~ (is_retry h) }) : Tot (bitfield 2) =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial pb _ _ _ _ -> pb\n | MZeroRTT pb _ _ _ -> pb\n | MHandshake pb _ _ _ -> pb\n end\n | MShort pb _ _ _ _ _ -> pb\n\nlet pn_length (h: header { ~ (is_retry h) }) : Tot PN.packet_number_length_t =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial _ _ _ pnl _ -> pnl\n | MZeroRTT _ _ pnl _ -> pnl\n | MHandshake _ _ pnl _ -> pnl\n end\n | MShort _ _ _ _ pnl _ -> pnl\n\nlet packet_number (h: header {~ (is_retry h)}) : Tot PN.packet_number_t =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial _ _ _ _ pn -> pn\n | MZeroRTT _ _ _ pn -> pn\n | MHandshake _ _ _ pn -> pn\n end\n | MShort _ _ _ _ _ pn -> pn\n\nlet dcid_len (h: header) : Tot nat =\n match h with\n | MLong _ dcid _ _ -> FB.length dcid\n | MShort _ _ _ dcid _ _ -> FB.length dcid\n\n(* Payload length *)\n\nlet has_payload_length\n (h: header)\n: Tot bool\n= MLong? h && (not (MRetry? (MLong?.spec h)))\n\nlet payload_and_pn_length \n (h: header { has_payload_length h })\n: Tot U62.t\n= match MLong?.spec h with\n | MInitial _ _ pl _ _ -> pl\n | MZeroRTT _ pl _ _ -> pl\n | MHandshake _ pl _ _ -> pl\n\nmodule Secret = QUIC.Secret.Int\n\nlet payload_length \n (h: header { has_payload_length h })\n: Tot U62.secret\n= match MLong?.spec h with\n | MInitial _ _ pl pnl _ -> Secret.to_u64 pl `Secret.sub` Secret.to_u64 pnl\n | MZeroRTT _ pl pnl _ -> Secret.to_u64 pl `Secret.sub` Secret.to_u64 pnl\n | MHandshake _ pl pnl _ -> Secret.to_u64 pl `Secret.sub` Secret.to_u64 pnl\n\n\n(* Correctness of a packet wrt. parsing parameters (cid_len, window) *)\n\nlet is_valid_header (h: header) (cid_len: nat) (last: nat) : Tot Type0 =\n (MShort? h ==> dcid_len h == cid_len) /\\\n ((~ (is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) last (Secret.v (packet_number h)))\n\n(* Explicit length computation is needed for the switch. *)\n\nlet header_len\n (h: header)", "dependencies": { "source_file": "QUIC.Spec.Header.Base.fst", "checked_file": "QUIC.Spec.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header -> Prims.GTot (n: Prims.pos{n <= QUIC.Spec.Base.header_len_bound})", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "QUIC.Spec.Base.bitfield", "Prims.bool", "QUIC.Spec.Base.vlbytes", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Prims.op_Addition", "FStar.Bytes.length", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "FStar.UInt32.t", "QUIC.Spec.Header.Base.long_header_specifics", "QUIC.Spec.Base.token_max_len", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Base.varint_len", "FStar.Int.Cast.uint32_to_uint64", "FStar.Bytes.len", "Prims.int", "Prims.pos", "Prims.b2t", "Prims.op_LessThanOrEqual", "QUIC.Spec.Base.header_len_bound" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_len (h: header) : GTot (n: pos{n <= header_len_bound})\nlet header_len (h: header) : GTot (n: pos{n <= header_len_bound}) =", "completed_definiton": "match h with\n| MShort _ _ _ dcid packet_number_length _ -> 1 + FB.length dcid + Secret.v packet_number_length\n| MLong version dcid scid spec ->\n 7 + FB.length dcid + FB.length scid +\n (match spec with\n | MInitial _ token payload_and_pn_length packet_number_length _ ->\n varint_len (Cast.uint32_to_uint64 (FB.len token)) + FB.length token +\n varint_len payload_and_pn_length +\n Secret.v packet_number_length\n | MZeroRTT _ payload_and_pn_length packet_number_length _ ->\n varint_len payload_and_pn_length + Secret.v packet_number_length\n | MHandshake _ payload_and_pn_length packet_number_length _ ->\n varint_len payload_and_pn_length + Secret.v packet_number_length\n | MRetry _ odcid -> 1 + FB.length odcid)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Base.fst", "name": "QUIC.Spec.Header.Base.payload_length", "original_source_type": "val payload_length (h: header{has_payload_length h}) : Tot U62.secret", "source_type": "val payload_length (h: header{has_payload_length h}) : Tot U62.secret", "source_definition": "let payload_length \n (h: header { has_payload_length h })\n: Tot U62.secret\n= match MLong?.spec h with\n | MInitial _ _ pl pnl _ -> Secret.to_u64 pl `Secret.sub` Secret.to_u64 pnl\n | MZeroRTT _ pl pnl _ -> Secret.to_u64 pl `Secret.sub` Secret.to_u64 pnl\n | MHandshake _ pl pnl _ -> Secret.to_u64 pl `Secret.sub` Secret.to_u64 pnl", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 123, "start_col": 2, "end_line": 126, "end_col": 76 }, "file_context": "module QUIC.Spec.Header.Base\ninclude QUIC.Spec.Base\n\nmodule FB = FStar.Bytes\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule S = FStar.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Cast = FStar.Int.Cast\n\nnoeq\ntype long_header_specifics =\n| MInitial:\n (reserved_bits: bitfield 2) ->\n (token: vlbytes 0 token_max_len) -> // arbitrary bound\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MZeroRTT:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MHandshake:\n (reserved_bits: bitfield 2) ->\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n long_header_specifics\n| MRetry:\n (unused: bitfield 4) ->\n (odcid: vlbytes 0 20) -> // TODO: change bounds to drop instead of rejecting as invalid\n long_header_specifics\n\nnoeq\ntype header =\n| MLong:\n (version: U32.t) ->\n (dcid: vlbytes 0 20) ->\n (scid: vlbytes 0 20) ->\n (spec: long_header_specifics) ->\n header\n| MShort:\n (reserved_bits: bitfield 2) ->\n (spin: bool) ->\n (key_phase: bool) ->\n (dcid: vlbytes 0 20) ->\n (packet_number_length: PN.packet_number_length_t) ->\n (packet_number: PN.packet_number_t) ->\n header\n\nlet is_initial (h: header) : Tot bool =\n if MLong? h then MInitial? (MLong?.spec h) else false\n\nlet is_zero_rtt (h: header) : Tot bool =\n if MLong? h then MZeroRTT? (MLong?.spec h) else false\n\nlet is_handshake (h: header) : Tot bool =\n if MLong? h then MHandshake? (MLong?.spec h) else false\n\nlet is_retry (h: header) : Tot bool =\n if MLong? h then MRetry? (MLong?.spec h) else false\n\nlet reserved_bits (h: header { ~ (is_retry h) }) : Tot (bitfield 2) =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial pb _ _ _ _ -> pb\n | MZeroRTT pb _ _ _ -> pb\n | MHandshake pb _ _ _ -> pb\n end\n | MShort pb _ _ _ _ _ -> pb\n\nlet pn_length (h: header { ~ (is_retry h) }) : Tot PN.packet_number_length_t =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial _ _ _ pnl _ -> pnl\n | MZeroRTT _ _ pnl _ -> pnl\n | MHandshake _ _ pnl _ -> pnl\n end\n | MShort _ _ _ _ pnl _ -> pnl\n\nlet packet_number (h: header {~ (is_retry h)}) : Tot PN.packet_number_t =\n match h with\n | MLong _ _ _ spec ->\n begin match spec with\n | MInitial _ _ _ _ pn -> pn\n | MZeroRTT _ _ _ pn -> pn\n | MHandshake _ _ _ pn -> pn\n end\n | MShort _ _ _ _ _ pn -> pn\n\nlet dcid_len (h: header) : Tot nat =\n match h with\n | MLong _ dcid _ _ -> FB.length dcid\n | MShort _ _ _ dcid _ _ -> FB.length dcid\n\n(* Payload length *)\n\nlet has_payload_length\n (h: header)\n: Tot bool\n= MLong? h && (not (MRetry? (MLong?.spec h)))\n\nlet payload_and_pn_length \n (h: header { has_payload_length h })\n: Tot U62.t\n= match MLong?.spec h with\n | MInitial _ _ pl _ _ -> pl\n | MZeroRTT _ pl _ _ -> pl\n | MHandshake _ pl _ _ -> pl\n\nmodule Secret = QUIC.Secret.Int\n\nlet payload_length \n (h: header { has_payload_length h })", "dependencies": { "source_file": "QUIC.Spec.Header.Base.fst", "checked_file": "QUIC.Spec.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header{QUIC.Spec.Header.Base.has_payload_length h} -> QUIC.UInt62.secret", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "Prims.b2t", "QUIC.Spec.Header.Base.has_payload_length", "QUIC.Spec.Header.Base.__proj__MLong__item__spec", "QUIC.Spec.Base.bitfield", "QUIC.Spec.Base.vlbytes", "QUIC.Spec.Base.token_max_len", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Lib.IntTypes.sub", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "Lib.IntTypes.to_u64", "Lib.IntTypes.PUB", "Lib.IntTypes.U32", "QUIC.UInt62.secret" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val payload_length (h: header{has_payload_length h}) : Tot U62.secret\nlet payload_length (h: header{has_payload_length h}) : Tot U62.secret =", "completed_definiton": "match MLong?.spec h with\n| MInitial _ _ pl pnl _ -> (Secret.to_u64 pl) `Secret.sub` (Secret.to_u64 pnl)\n| MZeroRTT _ pl pnl _ -> (Secret.to_u64 pl) `Secret.sub` (Secret.to_u64 pnl)\n| MHandshake _ pl pnl _ -> (Secret.to_u64 pl) `Secret.sub` (Secret.to_u64 pnl)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Crypto.fst", "name": "QUIC.Impl.Crypto.u32_of_u8", "original_source_type": "", "source_type": "val u32_of_u8 : a: FStar.UInt8.t -> b: FStar.UInt32.t{FStar.UInt32.v b = FStar.UInt8.v a}", "source_definition": "let u32_of_u8 = FStar.Int.Cast.uint8_to_uint32", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Crypto.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 28, "start_col": 16, "end_line": 28, "end_col": 46 }, "file_context": "module QUIC.Impl.Crypto\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nfriend QUIC.Spec.Crypto (* for the _l list constants *)\nmodule Spec = QUIC.Spec.Crypto\n\nopen LowStar.BufferOps (* for the !* notation *)\n\n\n/// Helpers & globals\n/// -----------------\n\nopen QUIC.Impl.Lemmas", "dependencies": { "source_file": "QUIC.Impl.Crypto.fst", "checked_file": "QUIC.Impl.Crypto.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "QUIC.Spec.Crypto.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: FStar.UInt8.t -> b: FStar.UInt32.t{FStar.UInt32.v b = FStar.UInt8.v a}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Int.Cast.uint8_to_uint32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let u32_of_u8 =", "completed_definiton": "FStar.Int.Cast.uint8_to_uint32", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Crypto.fst", "name": "QUIC.Impl.Crypto.u64_of_u32", "original_source_type": "", "source_type": "val u64_of_u32 : a: FStar.UInt32.t -> b: FStar.UInt64.t{FStar.UInt64.v b = FStar.UInt32.v a}", "source_definition": "let u64_of_u32 = FStar.Int.Cast.uint32_to_uint64", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Crypto.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 32, "start_col": 17, "end_line": 32, "end_col": 48 }, "file_context": "module QUIC.Impl.Crypto\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nfriend QUIC.Spec.Crypto (* for the _l list constants *)\nmodule Spec = QUIC.Spec.Crypto\n\nopen LowStar.BufferOps (* for the !* notation *)\n\n\n/// Helpers & globals\n/// -----------------\n\nopen QUIC.Impl.Lemmas\n\ninline_for_extraction noextract\nlet u32_of_u8 = FStar.Int.Cast.uint8_to_uint32\ninline_for_extraction noextract\nlet u64_of_u8 = FStar.Int.Cast.uint8_to_uint64", "dependencies": { "source_file": "QUIC.Impl.Crypto.fst", "checked_file": "QUIC.Impl.Crypto.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "QUIC.Spec.Crypto.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: FStar.UInt32.t -> b: FStar.UInt64.t{FStar.UInt64.v b = FStar.UInt32.v a}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Int.Cast.uint32_to_uint64" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let u64_of_u32 =", "completed_definiton": "FStar.Int.Cast.uint32_to_uint64", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Crypto.fst", "name": "QUIC.Impl.Crypto.u64_of_u8", "original_source_type": "", "source_type": "val u64_of_u8 : a: FStar.UInt8.t -> b: FStar.UInt64.t{FStar.UInt64.v b = FStar.UInt8.v a}", "source_definition": "let u64_of_u8 = FStar.Int.Cast.uint8_to_uint64", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Crypto.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 30, "start_col": 16, "end_line": 30, "end_col": 46 }, "file_context": "module QUIC.Impl.Crypto\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nfriend QUIC.Spec.Crypto (* for the _l list constants *)\nmodule Spec = QUIC.Spec.Crypto\n\nopen LowStar.BufferOps (* for the !* notation *)\n\n\n/// Helpers & globals\n/// -----------------\n\nopen QUIC.Impl.Lemmas\n\ninline_for_extraction noextract\nlet u32_of_u8 = FStar.Int.Cast.uint8_to_uint32", "dependencies": { "source_file": "QUIC.Impl.Crypto.fst", "checked_file": "QUIC.Impl.Crypto.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "QUIC.Spec.Crypto.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: FStar.UInt8.t -> b: FStar.UInt64.t{FStar.UInt64.v b = FStar.UInt8.v a}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Int.Cast.uint8_to_uint64" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let u64_of_u8 =", "completed_definiton": "FStar.Int.Cast.uint8_to_uint64", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Crypto.fst", "name": "QUIC.Impl.Crypto.prefix", "original_source_type": "", "source_type": "val prefix : b:\nLowStar.ImmutableBuffer.libuffer FStar.UInt8.t\n (FStar.Pervasives.normalize_term (FStar.List.Tot.Base.length QUIC.Spec.Crypto.prefix_l))\n (FStar.Seq.Properties.seq_of_list QUIC.Spec.Crypto.prefix_l)\n { LowStar.Monotonic.Buffer.frameOf b == FStar.Monotonic.HyperHeap.root /\\\n LowStar.Monotonic.Buffer.recallable b }", "source_definition": "let prefix = LowStar.ImmutableBuffer.igcmalloc_of_list HS.root prefix_l", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Crypto.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 38, "start_col": 13, "end_line": 38, "end_col": 71 }, "file_context": "module QUIC.Impl.Crypto\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nfriend QUIC.Spec.Crypto (* for the _l list constants *)\nmodule Spec = QUIC.Spec.Crypto\n\nopen LowStar.BufferOps (* for the !* notation *)\n\n\n/// Helpers & globals\n/// -----------------\n\nopen QUIC.Impl.Lemmas\n\ninline_for_extraction noextract\nlet u32_of_u8 = FStar.Int.Cast.uint8_to_uint32\ninline_for_extraction noextract\nlet u64_of_u8 = FStar.Int.Cast.uint8_to_uint64\ninline_for_extraction noextract\nlet u64_of_u32 = FStar.Int.Cast.uint32_to_uint64\n\n#push-options \"--warn_error -272\"\nlet label_key = LowStar.ImmutableBuffer.igcmalloc_of_list HS.root label_key_l\nlet label_iv = LowStar.ImmutableBuffer.igcmalloc_of_list HS.root label_iv_l", "dependencies": { "source_file": "QUIC.Impl.Crypto.fst", "checked_file": "QUIC.Impl.Crypto.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "QUIC.Spec.Crypto.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b:\nLowStar.ImmutableBuffer.libuffer FStar.UInt8.t\n (FStar.Pervasives.normalize_term (FStar.List.Tot.Base.length QUIC.Spec.Crypto.prefix_l))\n (FStar.Seq.Properties.seq_of_list QUIC.Spec.Crypto.prefix_l)\n { LowStar.Monotonic.Buffer.frameOf b == FStar.Monotonic.HyperHeap.root /\\\n LowStar.Monotonic.Buffer.recallable b }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowStar.ImmutableBuffer.igcmalloc_of_list", "FStar.UInt8.t", "FStar.Monotonic.HyperHeap.root", "QUIC.Spec.Crypto.prefix_l", "LowStar.ImmutableBuffer.libuffer", "FStar.Pervasives.normalize_term", "Prims.nat", "FStar.List.Tot.Base.length", "FStar.Seq.Properties.seq_of_list", "Prims.l_and", "Prims.eq2", "FStar.Monotonic.HyperHeap.rid", "LowStar.Monotonic.Buffer.frameOf", "LowStar.ImmutableBuffer.immutable_preorder", "LowStar.Monotonic.Buffer.recallable" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let prefix =", "completed_definiton": "LowStar.ImmutableBuffer.igcmalloc_of_list HS.root prefix_l", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Crypto.fst", "name": "QUIC.Impl.Crypto.label_key", "original_source_type": "val label_key : (label_key: IB.ibuffer U8.t {\n IB.frameOf label_key == HS.root /\\\n IB.length label_key == Seq.length Spec.label_key /\\\n IB.recallable label_key /\\\n IB.witnessed label_key (IB.cpred Spec.label_key)\n})", "source_type": "val label_key : (label_key: IB.ibuffer U8.t {\n IB.frameOf label_key == HS.root /\\\n IB.length label_key == Seq.length Spec.label_key /\\\n IB.recallable label_key /\\\n IB.witnessed label_key (IB.cpred Spec.label_key)\n})", "source_definition": "let label_key = LowStar.ImmutableBuffer.igcmalloc_of_list HS.root label_key_l", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Crypto.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 35, "start_col": 16, "end_line": 35, "end_col": 77 }, "file_context": "module QUIC.Impl.Crypto\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nfriend QUIC.Spec.Crypto (* for the _l list constants *)\nmodule Spec = QUIC.Spec.Crypto\n\nopen LowStar.BufferOps (* for the !* notation *)\n\n\n/// Helpers & globals\n/// -----------------\n\nopen QUIC.Impl.Lemmas\n\ninline_for_extraction noextract\nlet u32_of_u8 = FStar.Int.Cast.uint8_to_uint32\ninline_for_extraction noextract\nlet u64_of_u8 = FStar.Int.Cast.uint8_to_uint64\ninline_for_extraction noextract\nlet u64_of_u32 = FStar.Int.Cast.uint32_to_uint64", "dependencies": { "source_file": "QUIC.Impl.Crypto.fst", "checked_file": "QUIC.Impl.Crypto.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "QUIC.Spec.Crypto.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "label_key:\nLowStar.ImmutableBuffer.ibuffer FStar.UInt8.t\n { LowStar.Monotonic.Buffer.frameOf label_key == FStar.Monotonic.HyperHeap.root /\\\n LowStar.Monotonic.Buffer.length label_key == FStar.Seq.Base.length QUIC.Spec.Crypto.label_key /\\\n LowStar.Monotonic.Buffer.recallable label_key /\\\n LowStar.Monotonic.Buffer.witnessed label_key\n (LowStar.ImmutableBuffer.cpred QUIC.Spec.Crypto.label_key) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowStar.ImmutableBuffer.igcmalloc_of_list", "FStar.UInt8.t", "FStar.Monotonic.HyperHeap.root", "QUIC.Spec.Crypto.label_key_l", "LowStar.ImmutableBuffer.libuffer", "FStar.Pervasives.normalize_term", "Prims.nat", "FStar.List.Tot.Base.length", "FStar.Seq.Properties.seq_of_list", "Prims.l_and", "Prims.eq2", "FStar.Monotonic.HyperHeap.rid", "LowStar.Monotonic.Buffer.frameOf", "LowStar.ImmutableBuffer.immutable_preorder", "LowStar.Monotonic.Buffer.recallable" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val label_key : (label_key: IB.ibuffer U8.t {\n IB.frameOf label_key == HS.root /\\\n IB.length label_key == Seq.length Spec.label_key /\\\n IB.recallable label_key /\\\n IB.witnessed label_key (IB.cpred Spec.label_key)\n})\nlet label_key =", "completed_definiton": "LowStar.ImmutableBuffer.igcmalloc_of_list HS.root label_key_l", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Crypto.fst", "name": "QUIC.Impl.Crypto.label_hp", "original_source_type": "val label_hp : (label_hp : IB.ibuffer U8.t {\n IB.frameOf label_hp == HS.root /\\\n IB.length label_hp == Seq.length Spec.label_hp /\\\n IB.recallable label_hp /\\\n IB.witnessed label_hp (IB.cpred Spec.label_hp)\n})", "source_type": "val label_hp : (label_hp : IB.ibuffer U8.t {\n IB.frameOf label_hp == HS.root /\\\n IB.length label_hp == Seq.length Spec.label_hp /\\\n IB.recallable label_hp /\\\n IB.witnessed label_hp (IB.cpred Spec.label_hp)\n})", "source_definition": "let label_hp = LowStar.ImmutableBuffer.igcmalloc_of_list HS.root label_hp_l", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Crypto.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 37, "start_col": 15, "end_line": 37, "end_col": 75 }, "file_context": "module QUIC.Impl.Crypto\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nfriend QUIC.Spec.Crypto (* for the _l list constants *)\nmodule Spec = QUIC.Spec.Crypto\n\nopen LowStar.BufferOps (* for the !* notation *)\n\n\n/// Helpers & globals\n/// -----------------\n\nopen QUIC.Impl.Lemmas\n\ninline_for_extraction noextract\nlet u32_of_u8 = FStar.Int.Cast.uint8_to_uint32\ninline_for_extraction noextract\nlet u64_of_u8 = FStar.Int.Cast.uint8_to_uint64\ninline_for_extraction noextract\nlet u64_of_u32 = FStar.Int.Cast.uint32_to_uint64\n\n#push-options \"--warn_error -272\"\nlet label_key = LowStar.ImmutableBuffer.igcmalloc_of_list HS.root label_key_l", "dependencies": { "source_file": "QUIC.Impl.Crypto.fst", "checked_file": "QUIC.Impl.Crypto.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "QUIC.Spec.Crypto.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "label_hp:\nLowStar.ImmutableBuffer.ibuffer FStar.UInt8.t\n { LowStar.Monotonic.Buffer.frameOf label_hp == FStar.Monotonic.HyperHeap.root /\\\n LowStar.Monotonic.Buffer.length label_hp == FStar.Seq.Base.length QUIC.Spec.Crypto.label_hp /\\\n LowStar.Monotonic.Buffer.recallable label_hp /\\\n LowStar.Monotonic.Buffer.witnessed label_hp\n (LowStar.ImmutableBuffer.cpred QUIC.Spec.Crypto.label_hp) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowStar.ImmutableBuffer.igcmalloc_of_list", "FStar.UInt8.t", "FStar.Monotonic.HyperHeap.root", "QUIC.Spec.Crypto.label_hp_l", "LowStar.ImmutableBuffer.libuffer", "FStar.Pervasives.normalize_term", "Prims.nat", "FStar.List.Tot.Base.length", "FStar.Seq.Properties.seq_of_list", "Prims.l_and", "Prims.eq2", "FStar.Monotonic.HyperHeap.rid", "LowStar.Monotonic.Buffer.frameOf", "LowStar.ImmutableBuffer.immutable_preorder", "LowStar.Monotonic.Buffer.recallable" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val label_hp : (label_hp : IB.ibuffer U8.t {\n IB.frameOf label_hp == HS.root /\\\n IB.length label_hp == Seq.length Spec.label_hp /\\\n IB.recallable label_hp /\\\n IB.witnessed label_hp (IB.cpred Spec.label_hp)\n})\nlet label_hp =", "completed_definiton": "LowStar.ImmutableBuffer.igcmalloc_of_list HS.root label_hp_l", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Crypto.fst", "name": "QUIC.Impl.Crypto.label_iv", "original_source_type": "val label_iv : (label_iv : IB.ibuffer U8.t {\n IB.frameOf label_key == HS.root /\\\n IB.length label_iv == Seq.length Spec.label_iv /\\\n IB.recallable label_iv /\\\n IB.witnessed label_iv (IB.cpred Spec.label_iv)\n})", "source_type": "val label_iv : (label_iv : IB.ibuffer U8.t {\n IB.frameOf label_key == HS.root /\\\n IB.length label_iv == Seq.length Spec.label_iv /\\\n IB.recallable label_iv /\\\n IB.witnessed label_iv (IB.cpred Spec.label_iv)\n})", "source_definition": "let label_iv = LowStar.ImmutableBuffer.igcmalloc_of_list HS.root label_iv_l", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Crypto.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 36, "start_col": 15, "end_line": 36, "end_col": 75 }, "file_context": "module QUIC.Impl.Crypto\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nfriend QUIC.Spec.Crypto (* for the _l list constants *)\nmodule Spec = QUIC.Spec.Crypto\n\nopen LowStar.BufferOps (* for the !* notation *)\n\n\n/// Helpers & globals\n/// -----------------\n\nopen QUIC.Impl.Lemmas\n\ninline_for_extraction noextract\nlet u32_of_u8 = FStar.Int.Cast.uint8_to_uint32\ninline_for_extraction noextract\nlet u64_of_u8 = FStar.Int.Cast.uint8_to_uint64\ninline_for_extraction noextract\nlet u64_of_u32 = FStar.Int.Cast.uint32_to_uint64\n\n#push-options \"--warn_error -272\"", "dependencies": { "source_file": "QUIC.Impl.Crypto.fst", "checked_file": "QUIC.Impl.Crypto.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "QUIC.Spec.Crypto.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "label_iv:\nLowStar.ImmutableBuffer.ibuffer FStar.UInt8.t\n { LowStar.Monotonic.Buffer.frameOf QUIC.Impl.Crypto.label_key == FStar.Monotonic.HyperHeap.root /\\\n LowStar.Monotonic.Buffer.length label_iv == FStar.Seq.Base.length QUIC.Spec.Crypto.label_iv /\\\n LowStar.Monotonic.Buffer.recallable label_iv /\\\n LowStar.Monotonic.Buffer.witnessed label_iv\n (LowStar.ImmutableBuffer.cpred QUIC.Spec.Crypto.label_iv) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowStar.ImmutableBuffer.igcmalloc_of_list", "FStar.UInt8.t", "FStar.Monotonic.HyperHeap.root", "QUIC.Spec.Crypto.label_iv_l", "LowStar.ImmutableBuffer.libuffer", "FStar.Pervasives.normalize_term", "Prims.nat", "FStar.List.Tot.Base.length", "FStar.Seq.Properties.seq_of_list", "Prims.l_and", "Prims.eq2", "FStar.Monotonic.HyperHeap.rid", "LowStar.Monotonic.Buffer.frameOf", "LowStar.ImmutableBuffer.immutable_preorder", "LowStar.Monotonic.Buffer.recallable" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val label_iv : (label_iv : IB.ibuffer U8.t {\n IB.frameOf label_key == HS.root /\\\n IB.length label_iv == Seq.length Spec.label_iv /\\\n IB.recallable label_iv /\\\n IB.witnessed label_iv (IB.cpred Spec.label_iv)\n})\nlet label_iv =", "completed_definiton": "LowStar.ImmutableBuffer.igcmalloc_of_list HS.root label_iv_l", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Crypto.fst", "name": "QUIC.Impl.Crypto.derive_secret", "original_source_type": "val derive_secret: a: ha ->\n dst:B.buffer Secret.uint8 ->\n dst_len: U8.t { B.length dst = U8.v dst_len /\\ U8.v dst_len <= 255 } ->\n secret:B.buffer Secret.uint8 { B.length secret = Spec.Hash.Definitions.hash_length a } ->\n label:IB.ibuffer U8.t ->\n label_len:U8.t { IB.length label = U8.v label_len /\\ U8.v label_len <= 244 } ->\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf secret; buf label; buf dst ]) /\\\n B.disjoint dst secret)\n (ensures fun h0 _ h1 ->\n assert_norm (255 < pow2 61);\n assert_norm (pow2 61 < pow2 125);\n B.(modifies (loc_buffer dst) h0 h1) /\\\n B.as_seq h1 dst == derive_secret a (B.as_seq h0 secret)\n (IB.as_seq h0 label) (U8.v dst_len))", "source_type": "val derive_secret: a: ha ->\n dst:B.buffer Secret.uint8 ->\n dst_len: U8.t { B.length dst = U8.v dst_len /\\ U8.v dst_len <= 255 } ->\n secret:B.buffer Secret.uint8 { B.length secret = Spec.Hash.Definitions.hash_length a } ->\n label:IB.ibuffer U8.t ->\n label_len:U8.t { IB.length label = U8.v label_len /\\ U8.v label_len <= 244 } ->\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf secret; buf label; buf dst ]) /\\\n B.disjoint dst secret)\n (ensures fun h0 _ h1 ->\n assert_norm (255 < pow2 61);\n assert_norm (pow2 61 < pow2 125);\n B.(modifies (loc_buffer dst) h0 h1) /\\\n B.as_seq h1 dst == derive_secret a (B.as_seq h0 secret)\n (IB.as_seq h0 label) (U8.v dst_len))", "source_definition": "let derive_secret a dst dst_len secret label label_len =\n LowStar.ImmutableBuffer.recall prefix;\n LowStar.ImmutableBuffer.recall_contents prefix Spec.prefix;\n (**) let h0 = HST.get () in\n\n HST.push_frame ();\n (**) let h1 = HST.get () in\n\n let label_len32 = FStar.Int.Cast.uint8_to_uint32 label_len in\n let dst_len32 = FStar.Int.Cast.uint8_to_uint32 dst_len in\n let info_len = U32.(1ul +^ 1ul +^ 1ul +^ 11ul +^ label_len32 +^ 1ul) in\n let info = B.alloca 0uy info_len in\n\n // : best way to reason about this sort of code is to slice the buffer very thinly\n let info_z = B.sub info 0ul 1ul in\n let info_lb = B.sub info 1ul 1ul in\n let info_llen = B.sub info 2ul 1ul in\n let info_prefix = B.sub info 3ul 11ul in\n let info_label = B.sub info 14ul label_len32 in\n let info_z' = B.sub info (14ul `U32.add` label_len32) 1ul in\n (**) assert (14ul `U32.add` label_len32 `U32.add` 1ul = B.len info);\n (**) assert B.(all_disjoint [ loc_buffer info_z; loc_buffer info_lb; loc_buffer info_llen;\n (**) loc_buffer info_prefix; loc_buffer info_label; loc_buffer info_z' ]);\n\n info_lb.(0ul) <- dst_len;\n info_llen.(0ul) <- U8.(label_len +^ 11uy);\n B.blit prefix 0ul info_prefix 0ul 11ul;\n B.blit label 0ul info_label 0ul label_len32;\n\n (**) let h2 = HST.get () in\n (**) assert (\n (**) let z = Seq.create 1 0uy in\n (**) let lb = Seq.create 1 dst_len in // len <= 255\n (**) let llen = Seq.create 1 (U8.uint_to_t (11 + Seq.length (B.as_seq h0 label))) in\n (**) let info = B.as_seq h2 info in\n (**) B.as_seq h2 info_z `Seq.equal` z /\\\n (**) B.as_seq h2 info_lb `Seq.equal` lb /\\\n (**) B.as_seq h2 info_llen `Seq.equal` llen /\\\n (**) B.as_seq h2 info_prefix `Seq.equal` Spec.prefix /\\\n (**) B.as_seq h2 info_label `Seq.equal` (B.as_seq h0 label) /\\\n (**) B.as_seq h2 info_z' `Seq.equal` z\n (**) );\n (**) (\n (**) let z = Seq.create 1 0uy in\n (**) let lb = Seq.create 1 dst_len in // len <= 255\n (**) let llen = Seq.create 1 (U8.uint_to_t (11 + Seq.length (B.as_seq h0 label))) in\n (**) let info = B.as_seq h2 info in\n (**) lemma_five_cuts info 1 2 3 14 (14 + U8.v label_len)\n (**) z lb llen Spec.prefix (B.as_seq h0 label) z\n (**) );\n (**) hash_is_keysized_ a;\n let h25 = HST.get () in\n SecretBuffer.with_whole_buffer_hide_weak_modifies\n #unit\n info\n h25\n (B.loc_buffer secret `B.loc_union` B.loc_buffer dst)\n (B.loc_buffer dst)\n false\n (fun _ cont m ->\n (SHD.hash_length a + B.length info + 1 + SHD.block_length a) `SHD.less_than_max_input_length` a /\\\n B.as_seq m dst == SHKDF.expand a (B.as_seq h25 secret) (Seq.seq_hide #Secret.U8 (B.as_seq h25 info)) (U32.v dst_len32)\n )\n (fun _ bs ->\n HKDF.hash_block_length_fits a;\n HKDF.expand a dst secret (Hacl.Hash.Definitions.hash_len a) bs info_len dst_len32\n );\n (**) let h3 = HST.get () in\n HST.pop_frame ();\n (**) let h4 = HST.get () in\n (**) B.modifies_fresh_frame_popped h0 h1 (B.loc_buffer dst) h3 h4;\n (**) assert (HST.equal_domains h0 h4)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Crypto.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 46, "start_col": 2, "end_line": 116, "end_col": 39 }, "file_context": "module QUIC.Impl.Crypto\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nfriend QUIC.Spec.Crypto (* for the _l list constants *)\nmodule Spec = QUIC.Spec.Crypto\n\nopen LowStar.BufferOps (* for the !* notation *)\n\n\n/// Helpers & globals\n/// -----------------\n\nopen QUIC.Impl.Lemmas\n\ninline_for_extraction noextract\nlet u32_of_u8 = FStar.Int.Cast.uint8_to_uint32\ninline_for_extraction noextract\nlet u64_of_u8 = FStar.Int.Cast.uint8_to_uint64\ninline_for_extraction noextract\nlet u64_of_u32 = FStar.Int.Cast.uint32_to_uint64\n\n#push-options \"--warn_error -272\"\nlet label_key = LowStar.ImmutableBuffer.igcmalloc_of_list HS.root label_key_l\nlet label_iv = LowStar.ImmutableBuffer.igcmalloc_of_list HS.root label_iv_l\nlet label_hp = LowStar.ImmutableBuffer.igcmalloc_of_list HS.root label_hp_l\nlet prefix = LowStar.ImmutableBuffer.igcmalloc_of_list HS.root prefix_l\n#pop-options\n\n/// Actual code\n/// -----------\n\n#push-options \"--z3rlimit 100\"", "dependencies": { "source_file": "QUIC.Impl.Crypto.fst", "checked_file": "QUIC.Impl.Crypto.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "QUIC.Spec.Crypto.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ha ->\n dst: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n dst_len:\n FStar.UInt8.t\n { LowStar.Monotonic.Buffer.length dst = FStar.UInt8.v dst_len /\\\n FStar.UInt8.v dst_len <= 255 } ->\n secret:\n LowStar.Buffer.buffer Lib.IntTypes.uint8\n {LowStar.Monotonic.Buffer.length secret = Spec.Hash.Definitions.hash_length a} ->\n label: LowStar.ImmutableBuffer.ibuffer FStar.UInt8.t ->\n label_len:\n FStar.UInt8.t\n { LowStar.Monotonic.Buffer.length label = FStar.UInt8.v label_len /\\\n FStar.UInt8.v label_len <= 244 }\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ha", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "FStar.UInt8.t", "Prims.l_and", "Prims.b2t", "Prims.op_Equality", "Prims.int", "Prims.l_or", "Prims.op_GreaterThanOrEqual", "FStar.UInt.size", "FStar.UInt8.n", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "FStar.UInt8.v", "Prims.op_LessThanOrEqual", "Prims.nat", "Spec.Hash.Definitions.hash_length", "LowStar.ImmutableBuffer.ibuffer", "LowStar.ImmutableBuffer.immutable_preorder", "Prims._assert", "FStar.HyperStack.ST.equal_domains", "Prims.unit", "LowStar.Monotonic.Buffer.modifies_fresh_frame_popped", "LowStar.Monotonic.Buffer.loc_buffer", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "FStar.HyperStack.ST.pop_frame", "QUIC.Secret.Buffer.with_whole_buffer_hide_weak_modifies", "FStar.Ghost.hide", "LowStar.Monotonic.Buffer.loc", "LowStar.Monotonic.Buffer.loc_union", "Prims.bool", "FStar.Seq.Properties.lseq", "Spec.Hash.Definitions.less_than_max_input_length", "Prims.op_Addition", "Spec.Hash.Definitions.block_length", "Prims.eq2", "FStar.Seq.Base.seq", "LowStar.Monotonic.Buffer.as_seq", "Spec.Agile.HKDF.expand", "QUIC.Secret.Seq.seq_hide", "Lib.IntTypes.U8", "FStar.UInt32.v", "FStar.Ghost.erased", "EverCrypt.HKDF.expand", "Hacl.Hash.Definitions.hash_len", "EverCrypt.HKDF.hash_block_length_fits", "QUIC.Impl.Lemmas.hash_is_keysized_", "QUIC.Impl.Lemmas.lemma_five_cuts", "QUIC.Spec.Crypto.prefix", "FStar.Seq.Base.create", "FStar.UInt8.uint_to_t", "FStar.Seq.Base.length", "FStar.UInt8.__uint_to_t", "FStar.Seq.Base.equal", "LowStar.Monotonic.Buffer.blit", "FStar.UInt32.__uint_to_t", "QUIC.Impl.Crypto.prefix", "LowStar.BufferOps.op_Array_Assignment", "FStar.UInt8.op_Plus_Hat", "LowStar.Monotonic.Buffer.all_disjoint", "Prims.Cons", "Prims.Nil", "FStar.UInt32.t", "FStar.UInt32.add", "LowStar.Monotonic.Buffer.len", "LowStar.Monotonic.Buffer.mbuffer", "LowStar.Buffer.sub", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "LowStar.Buffer.alloca", "FStar.UInt32.op_Plus_Hat", "FStar.Int.Cast.uint8_to_uint32", "FStar.HyperStack.ST.push_frame", "LowStar.ImmutableBuffer.recall_contents", "LowStar.Monotonic.Buffer.recall" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val derive_secret: a: ha ->\n dst:B.buffer Secret.uint8 ->\n dst_len: U8.t { B.length dst = U8.v dst_len /\\ U8.v dst_len <= 255 } ->\n secret:B.buffer Secret.uint8 { B.length secret = Spec.Hash.Definitions.hash_length a } ->\n label:IB.ibuffer U8.t ->\n label_len:U8.t { IB.length label = U8.v label_len /\\ U8.v label_len <= 244 } ->\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf secret; buf label; buf dst ]) /\\\n B.disjoint dst secret)\n (ensures fun h0 _ h1 ->\n assert_norm (255 < pow2 61);\n assert_norm (pow2 61 < pow2 125);\n B.(modifies (loc_buffer dst) h0 h1) /\\\n B.as_seq h1 dst == derive_secret a (B.as_seq h0 secret)\n (IB.as_seq h0 label) (U8.v dst_len))\nlet derive_secret a dst dst_len secret label label_len =", "completed_definiton": "LowStar.ImmutableBuffer.recall prefix;\nLowStar.ImmutableBuffer.recall_contents prefix Spec.prefix;\nlet h0 = HST.get () in\nHST.push_frame ();\nlet h1 = HST.get () in\nlet label_len32 = FStar.Int.Cast.uint8_to_uint32 label_len in\nlet dst_len32 = FStar.Int.Cast.uint8_to_uint32 dst_len in\nlet info_len = let open U32 in 1ul +^ 1ul +^ 1ul +^ 11ul +^ label_len32 +^ 1ul in\nlet info = B.alloca 0uy info_len in\nlet info_z = B.sub info 0ul 1ul in\nlet info_lb = B.sub info 1ul 1ul in\nlet info_llen = B.sub info 2ul 1ul in\nlet info_prefix = B.sub info 3ul 11ul in\nlet info_label = B.sub info 14ul label_len32 in\nlet info_z' = B.sub info (14ul `U32.add` label_len32) 1ul in\nassert ((14ul `U32.add` label_len32) `U32.add` 1ul = B.len info);\nassert B.(all_disjoint [\n loc_buffer info_z;\n loc_buffer info_lb;\n loc_buffer info_llen;\n loc_buffer info_prefix;\n loc_buffer info_label;\n loc_buffer info_z'\n ]);\ninfo_lb.(0ul) <- dst_len;\ninfo_llen.(0ul) <- (let open U8 in label_len +^ 11uy);\nB.blit prefix 0ul info_prefix 0ul 11ul;\nB.blit label 0ul info_label 0ul label_len32;\nlet h2 = HST.get () in\nassert (let z = Seq.create 1 0uy in\n let lb = Seq.create 1 dst_len in\n let llen = Seq.create 1 (U8.uint_to_t (11 + Seq.length (B.as_seq h0 label))) in\n let info = B.as_seq h2 info in\n (B.as_seq h2 info_z) `Seq.equal` z /\\ (B.as_seq h2 info_lb) `Seq.equal` lb /\\\n (B.as_seq h2 info_llen) `Seq.equal` llen /\\ (B.as_seq h2 info_prefix) `Seq.equal` Spec.prefix /\\\n (B.as_seq h2 info_label) `Seq.equal` (B.as_seq h0 label) /\\ (B.as_seq h2 info_z') `Seq.equal` z);\n(let z = Seq.create 1 0uy in\n let lb = Seq.create 1 dst_len in\n let llen = Seq.create 1 (U8.uint_to_t (11 + Seq.length (B.as_seq h0 label))) in\n let info = B.as_seq h2 info in\n lemma_five_cuts info 1 2 3 14 (14 + U8.v label_len) z lb llen Spec.prefix (B.as_seq h0 label) z);\nhash_is_keysized_ a;\nlet h25 = HST.get () in\nSecretBuffer.with_whole_buffer_hide_weak_modifies #unit\n info\n h25\n ((B.loc_buffer secret) `B.loc_union` (B.loc_buffer dst))\n (B.loc_buffer dst)\n false\n (fun _ cont m ->\n (SHD.hash_length a + B.length info + 1 + SHD.block_length a)\n `SHD.less_than_max_input_length`\n a /\\\n B.as_seq m dst ==\n SHKDF.expand a\n (B.as_seq h25 secret)\n (Seq.seq_hide #Secret.U8 (B.as_seq h25 info))\n (U32.v dst_len32))\n (fun _ bs ->\n HKDF.hash_block_length_fits a;\n HKDF.expand a dst secret (Hacl.Hash.Definitions.hash_len a) bs info_len dst_len32);\nlet h3 = HST.get () in\nHST.pop_frame ();\nlet h4 = HST.get () in\nB.modifies_fresh_frame_popped h0 h1 (B.loc_buffer dst) h3 h4;\nassert (HST.equal_domains h0 h4)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.fst", "name": "QUIC.Spec.Header.pn_sizemask'", "original_source_type": "val pn_sizemask' (pn_len: nat{pn_len < 4}) : Tot (lbytes 4)", "source_type": "val pn_sizemask' (pn_len: nat{pn_len < 4}) : Tot (lbytes 4)", "source_definition": "let pn_sizemask' (pn_len: nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 45, "start_col": 2, "end_line": 47, "end_col": 77 }, "file_context": "module QUIC.Spec.Header\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Parse = QUIC.Spec.Header.Parse\n\nmodule AEAD = Spec.Agile.AEAD\nmodule Cipher = Spec.Agile.Cipher\nmodule Lemmas = QUIC.Spec.Lemmas\n\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: GTot (Seq.lseq Secret.uint8 16) =\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (Seq.seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (Seq.seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n(*\nDecryption of packet number\npacket[pn_offset..pn_offset+4] ^= pn_mask &\n match pn_len with\n | 0 -> mask & 0xFF000000\n | 1 -> mask & 0xFFFF0000\n | 2 -> mask & 0xFFFFFF00\n | 3 -> mask & 0xFFFFFFFF\n*)", "dependencies": { "source_file": "QUIC.Spec.Header.fst", "checked_file": "QUIC.Spec.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "pn_len: Prims.nat{pn_len < 4} -> QUIC.Spec.Base.lbytes 4", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "FStar.Endianness.n_to_be", "Prims.op_Subtraction", "Prims.pow2", "Prims.op_Multiply", "Prims.unit", "FStar.Math.Lemmas.pow2_lt_compat", "QUIC.Spec.Base.lbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val pn_sizemask' (pn_len: nat{pn_len < 4}) : Tot (lbytes 4)\nlet pn_sizemask' (pn_len: nat{pn_len < 4}) : Tot (lbytes 4) =", "completed_definiton": "let open FStar.Endianness in\nFStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\nFStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.fst", "name": "QUIC.Spec.Header.min", "original_source_type": "val min (a b: nat) : Tot (c: nat{c <= a /\\ c <= b /\\ (c >= a \\/ c >= b)})", "source_type": "val min (a b: nat) : Tot (c: nat{c <= a /\\ c <= b /\\ (c >= a \\/ c >= b)})", "source_definition": "let min (a: nat) (b: nat) : Tot (c: nat { c <= a /\\ c <= b /\\ (c >= a \\/ c >= b) }) = if b <= a then b else a", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 318, "start_col": 86, "end_line": 318, "end_col": 109 }, "file_context": "module QUIC.Spec.Header\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Parse = QUIC.Spec.Header.Parse\n\nmodule AEAD = Spec.Agile.AEAD\nmodule Cipher = Spec.Agile.Cipher\nmodule Lemmas = QUIC.Spec.Lemmas\n\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: GTot (Seq.lseq Secret.uint8 16) =\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (Seq.seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (Seq.seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n(*\nDecryption of packet number\npacket[pn_offset..pn_offset+4] ^= pn_mask &\n match pn_len with\n | 0 -> mask & 0xFF000000\n | 1 -> mask & 0xFFFF0000\n | 2 -> mask & 0xFFFFFF00\n | 3 -> mask & 0xFFFFFFFF\n*)\nlet pn_sizemask' (pn_len: nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet pn_sizemask (pn_len: nat { pn_len < 4 }) : Tot (lbytes (pn_len + 1)) =\n Seq.slice (pn_sizemask' pn_len) 0 (pn_len + 1)\n\nlet header_encrypt\n a hpk h c\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\nlet header_encrypt_post\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n (cid_len: nat { cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h) })\n: Lemma (\n let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let z = header_encrypt a hpk h c in\n Parse.header_len h + Seq.length c == Seq.length z /\\\n Seq.slice z (Parse.header_len h) (Seq.length z) `Seq.equal` c /\\\n MShort? h == (BF.get_bitfield (U8.v (Seq.index z 0)) 7 8 = 0) /\\\n is_retry h == (not (MShort? h) && BF.get_bitfield (U8.v (Seq.index z 0)) 4 6 = 3) /\\ (\n if is_retry h\n then z == y\n else Parse.putative_pn_offset cid_len z == Some (Parse.pn_offset h)\n ))\n= Parse.format_header_is_short h;\n Parse.format_header_is_retry h;\n if is_retry h\n then ()\n else begin\n Parse.format_header_pn_length h;\n let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index y 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let bf = BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits bf in\n let r = Lemmas.xor_inplace y pnmask pn_offset in\n let z = header_encrypt a hpk h c in\n assert (z == Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)));\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset 0 1;\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset 1 pn_offset;\n assert (pn_offset > 0);\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset (Parse.header_len h) (Seq.length y);\n assert (Seq.slice z (Parse.header_len h) (Seq.length z) `Seq.equal` Seq.slice y (Parse.header_len h) (Seq.length y));\n assert (U8.uint_to_t f' == Seq.index (Seq.slice z 0 1) 0);\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 7 8;\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf protected_bits 8;\n if MLong? h\n then BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 4 6;\n Parse.putative_pn_offset_correct h cid_len;\n Parse.putative_pn_offset_frame cid_len x y;\n Parse.putative_pn_offset_frame cid_len y z;\n ()\n end\n\n#pop-options\n\nlet header_encrypt_length\n a hpk h c\n=\n header_encrypt_post a hpk h c (dcid_len h)\n\nnoextract\ntype header_decrypt_aux_t = {\n is_short: bool;\n is_retry: (is_retry: bool { is_retry ==> ~ (is_short) });\n packet: packet;\n pn_offset: (if is_retry then unit else nat);\n pn_len: (if is_retry then unit else (pn_len: nat {pn_len < 4 /\\ pn_offset + pn_len + 1 <= Seq.length packet}));\n}\n\nlet header_decrypt_aux\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: GTot (option header_decrypt_aux_t)\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n is_short = is_short;\n is_retry = is_retry;\n packet = packet;\n pn_offset = ();\n pn_len = ();\n })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset+16)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n is_short = is_short;\n is_retry = is_retry;\n packet = packet'';\n pn_offset = pn_offset;\n pn_len = pn_len;\n })\n end\n\n#push-options \"--z3rlimit 64 --max_fuel 1\"\n\n#restart-solver\n\nlet header_decrypt_aux_post\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Lemma\n (requires (Some? (header_decrypt_aux a hpk cid_len packet)))\n (ensures (\n Some? (header_decrypt_aux a hpk cid_len packet) /\\ (\n let Some r = header_decrypt_aux a hpk cid_len packet in\n Seq.length r.packet == Seq.length packet /\\\n Seq.length packet > 0 /\\ (\n let f' = Seq.index r.packet 0 in\n r.is_short == (BF.get_bitfield (U8.v f') 7 8 = 0) /\\\n r.is_retry == (not r.is_short && (BF.get_bitfield (U8.v f') 4 6 = 3)) /\\ (\n if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\\n Parse.putative_pn_offset cid_len r.packet == Parse.putative_pn_offset cid_len packet /\\ (\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n r.pn_offset == pn_offset /\\\n r.pn_offset + 20 <= Seq.length r.packet /\\\n r.pn_len == BF.get_bitfield (U8.v f') 0 2 /\\\n r.pn_offset + r.pn_len + 1 <= Seq.length r.packet /\\\n Seq.slice r.packet (r.pn_offset + r.pn_len + 1) (Seq.length r.packet) `Seq.equal` Seq.slice packet (r.pn_offset + r.pn_len + 1) (Seq.length packet) /\\\n True\n ))))))\n=let Some r = header_decrypt_aux a hpk cid_len packet in\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then ()\n else begin\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n let sample_offset = pn_offset + 4 in\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset+16)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let bf = BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits bf in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n assert (r.packet == Lemmas.xor_inplace packet' pnmask pn_offset);\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset 0 1;\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset 1 pn_offset;\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset (pn_offset + pn_len + 1) (Seq.length packet);\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf protected_bits 8;\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 7 8;\n assert (Seq.index r.packet 0 == Seq.index (Seq.slice packet' 0 1) 0);\n Parse.putative_pn_offset_frame cid_len packet r.packet;\n if not is_short\n then BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 4 6;\n assert (Parse.putative_pn_offset cid_len r.packet == Parse.putative_pn_offset cid_len packet);\n ()\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 64 --max_fuel 1\"\n\nlet header_decrypt_aux_post_parse\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (packet: packet)\n: Lemma\n (requires (match header_decrypt_aux a hpk cid_len packet with\n | Some r ->\n Parse.H_Success? (Parse.parse_header cid_len last r.packet)\n | _ -> False\n ))\n (ensures (\n let Some r = header_decrypt_aux a hpk cid_len packet in\n let Parse.H_Success h rem' = Parse.parse_header cid_len last r.packet in\n Parse.header_len h <= Seq.length packet /\\\n Seq.length r.packet == Seq.length packet /\\\n Seq.length packet > 0 /\\ (\n r.is_short == MShort? h /\\\n r.is_retry == is_retry h /\\\n rem' `Seq.equal` Seq.slice packet (Parse.header_len h) (Seq.length packet) /\\ (\n if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\ (\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n pn_offset == Parse.pn_offset h /\\\n r.pn_offset == pn_offset /\\\n r.pn_len == Secret.v (pn_length h) - 1 /\\\n r.pn_offset + r.pn_len + 1 == Parse.header_len h /\\\n Seq.length rem' >= 16\n )))))\n= header_decrypt_aux_post a hpk cid_len packet;\n let Some r = header_decrypt_aux a hpk cid_len packet in\n let Parse.H_Success h rem' = Parse.parse_header cid_len last r.packet in\n Parse.lemma_header_parsing_post cid_len last r.packet;\n Parse.format_header_is_short h;\n Parse.format_header_is_retry h;\n assert (r.is_short == MShort? h);\n assert (r.is_retry == is_retry h);\n if r.is_retry\n then\n ()\n else begin\n Parse.format_header_pn_length h;\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n Parse.putative_pn_offset_correct h cid_len;\n Parse.putative_pn_offset_frame cid_len (Parse.format_header h) r.packet\n end\n\n#pop-options", "dependencies": { "source_file": "QUIC.Spec.Header.fst", "checked_file": "QUIC.Spec.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Prims.nat -> b: Prims.nat -> c: Prims.nat{c <= a /\\ c <= b /\\ (c >= a \\/ c >= b)}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.op_LessThanOrEqual", "Prims.bool", "Prims.l_and", "Prims.b2t", "Prims.l_or", "Prims.op_GreaterThanOrEqual" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val min (a b: nat) : Tot (c: nat{c <= a /\\ c <= b /\\ (c >= a \\/ c >= b)})\nlet min (a b: nat) : Tot (c: nat{c <= a /\\ c <= b /\\ (c >= a \\/ c >= b)}) =", "completed_definiton": "if b <= a then b else a", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.fst", "name": "QUIC.Spec.Header.max", "original_source_type": "val max (a b: nat) : Tot (c: nat{c >= a /\\ c >= b /\\ (c <= a \\/ c <= b)})", "source_type": "val max (a b: nat) : Tot (c: nat{c >= a /\\ c >= b /\\ (c <= a \\/ c <= b)})", "source_definition": "let max (a: nat) (b: nat) : Tot (c: nat { c >= a /\\ c >= b /\\ (c <= a \\/ c <= b) }) = if a <= b then b else a", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 317, "start_col": 86, "end_line": 317, "end_col": 109 }, "file_context": "module QUIC.Spec.Header\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Parse = QUIC.Spec.Header.Parse\n\nmodule AEAD = Spec.Agile.AEAD\nmodule Cipher = Spec.Agile.Cipher\nmodule Lemmas = QUIC.Spec.Lemmas\n\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: GTot (Seq.lseq Secret.uint8 16) =\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (Seq.seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (Seq.seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n(*\nDecryption of packet number\npacket[pn_offset..pn_offset+4] ^= pn_mask &\n match pn_len with\n | 0 -> mask & 0xFF000000\n | 1 -> mask & 0xFFFF0000\n | 2 -> mask & 0xFFFFFF00\n | 3 -> mask & 0xFFFFFFFF\n*)\nlet pn_sizemask' (pn_len: nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet pn_sizemask (pn_len: nat { pn_len < 4 }) : Tot (lbytes (pn_len + 1)) =\n Seq.slice (pn_sizemask' pn_len) 0 (pn_len + 1)\n\nlet header_encrypt\n a hpk h c\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\nlet header_encrypt_post\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n (cid_len: nat { cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h) })\n: Lemma (\n let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let z = header_encrypt a hpk h c in\n Parse.header_len h + Seq.length c == Seq.length z /\\\n Seq.slice z (Parse.header_len h) (Seq.length z) `Seq.equal` c /\\\n MShort? h == (BF.get_bitfield (U8.v (Seq.index z 0)) 7 8 = 0) /\\\n is_retry h == (not (MShort? h) && BF.get_bitfield (U8.v (Seq.index z 0)) 4 6 = 3) /\\ (\n if is_retry h\n then z == y\n else Parse.putative_pn_offset cid_len z == Some (Parse.pn_offset h)\n ))\n= Parse.format_header_is_short h;\n Parse.format_header_is_retry h;\n if is_retry h\n then ()\n else begin\n Parse.format_header_pn_length h;\n let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index y 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let bf = BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits bf in\n let r = Lemmas.xor_inplace y pnmask pn_offset in\n let z = header_encrypt a hpk h c in\n assert (z == Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)));\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset 0 1;\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset 1 pn_offset;\n assert (pn_offset > 0);\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset (Parse.header_len h) (Seq.length y);\n assert (Seq.slice z (Parse.header_len h) (Seq.length z) `Seq.equal` Seq.slice y (Parse.header_len h) (Seq.length y));\n assert (U8.uint_to_t f' == Seq.index (Seq.slice z 0 1) 0);\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 7 8;\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf protected_bits 8;\n if MLong? h\n then BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 4 6;\n Parse.putative_pn_offset_correct h cid_len;\n Parse.putative_pn_offset_frame cid_len x y;\n Parse.putative_pn_offset_frame cid_len y z;\n ()\n end\n\n#pop-options\n\nlet header_encrypt_length\n a hpk h c\n=\n header_encrypt_post a hpk h c (dcid_len h)\n\nnoextract\ntype header_decrypt_aux_t = {\n is_short: bool;\n is_retry: (is_retry: bool { is_retry ==> ~ (is_short) });\n packet: packet;\n pn_offset: (if is_retry then unit else nat);\n pn_len: (if is_retry then unit else (pn_len: nat {pn_len < 4 /\\ pn_offset + pn_len + 1 <= Seq.length packet}));\n}\n\nlet header_decrypt_aux\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: GTot (option header_decrypt_aux_t)\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n is_short = is_short;\n is_retry = is_retry;\n packet = packet;\n pn_offset = ();\n pn_len = ();\n })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset+16)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n is_short = is_short;\n is_retry = is_retry;\n packet = packet'';\n pn_offset = pn_offset;\n pn_len = pn_len;\n })\n end\n\n#push-options \"--z3rlimit 64 --max_fuel 1\"\n\n#restart-solver\n\nlet header_decrypt_aux_post\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Lemma\n (requires (Some? (header_decrypt_aux a hpk cid_len packet)))\n (ensures (\n Some? (header_decrypt_aux a hpk cid_len packet) /\\ (\n let Some r = header_decrypt_aux a hpk cid_len packet in\n Seq.length r.packet == Seq.length packet /\\\n Seq.length packet > 0 /\\ (\n let f' = Seq.index r.packet 0 in\n r.is_short == (BF.get_bitfield (U8.v f') 7 8 = 0) /\\\n r.is_retry == (not r.is_short && (BF.get_bitfield (U8.v f') 4 6 = 3)) /\\ (\n if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\\n Parse.putative_pn_offset cid_len r.packet == Parse.putative_pn_offset cid_len packet /\\ (\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n r.pn_offset == pn_offset /\\\n r.pn_offset + 20 <= Seq.length r.packet /\\\n r.pn_len == BF.get_bitfield (U8.v f') 0 2 /\\\n r.pn_offset + r.pn_len + 1 <= Seq.length r.packet /\\\n Seq.slice r.packet (r.pn_offset + r.pn_len + 1) (Seq.length r.packet) `Seq.equal` Seq.slice packet (r.pn_offset + r.pn_len + 1) (Seq.length packet) /\\\n True\n ))))))\n=let Some r = header_decrypt_aux a hpk cid_len packet in\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then ()\n else begin\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n let sample_offset = pn_offset + 4 in\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset+16)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let bf = BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits bf in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n assert (r.packet == Lemmas.xor_inplace packet' pnmask pn_offset);\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset 0 1;\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset 1 pn_offset;\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset (pn_offset + pn_len + 1) (Seq.length packet);\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf protected_bits 8;\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 7 8;\n assert (Seq.index r.packet 0 == Seq.index (Seq.slice packet' 0 1) 0);\n Parse.putative_pn_offset_frame cid_len packet r.packet;\n if not is_short\n then BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 4 6;\n assert (Parse.putative_pn_offset cid_len r.packet == Parse.putative_pn_offset cid_len packet);\n ()\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 64 --max_fuel 1\"\n\nlet header_decrypt_aux_post_parse\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (packet: packet)\n: Lemma\n (requires (match header_decrypt_aux a hpk cid_len packet with\n | Some r ->\n Parse.H_Success? (Parse.parse_header cid_len last r.packet)\n | _ -> False\n ))\n (ensures (\n let Some r = header_decrypt_aux a hpk cid_len packet in\n let Parse.H_Success h rem' = Parse.parse_header cid_len last r.packet in\n Parse.header_len h <= Seq.length packet /\\\n Seq.length r.packet == Seq.length packet /\\\n Seq.length packet > 0 /\\ (\n r.is_short == MShort? h /\\\n r.is_retry == is_retry h /\\\n rem' `Seq.equal` Seq.slice packet (Parse.header_len h) (Seq.length packet) /\\ (\n if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\ (\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n pn_offset == Parse.pn_offset h /\\\n r.pn_offset == pn_offset /\\\n r.pn_len == Secret.v (pn_length h) - 1 /\\\n r.pn_offset + r.pn_len + 1 == Parse.header_len h /\\\n Seq.length rem' >= 16\n )))))\n= header_decrypt_aux_post a hpk cid_len packet;\n let Some r = header_decrypt_aux a hpk cid_len packet in\n let Parse.H_Success h rem' = Parse.parse_header cid_len last r.packet in\n Parse.lemma_header_parsing_post cid_len last r.packet;\n Parse.format_header_is_short h;\n Parse.format_header_is_retry h;\n assert (r.is_short == MShort? h);\n assert (r.is_retry == is_retry h);\n if r.is_retry\n then\n ()\n else begin\n Parse.format_header_pn_length h;\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n Parse.putative_pn_offset_correct h cid_len;\n Parse.putative_pn_offset_frame cid_len (Parse.format_header h) r.packet\n end\n\n#pop-options", "dependencies": { "source_file": "QUIC.Spec.Header.fst", "checked_file": "QUIC.Spec.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Prims.nat -> b: Prims.nat -> c: Prims.nat{c >= a /\\ c >= b /\\ (c <= a \\/ c <= b)}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.op_LessThanOrEqual", "Prims.bool", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "Prims.l_or" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val max (a b: nat) : Tot (c: nat{c >= a /\\ c >= b /\\ (c <= a \\/ c <= b)})\nlet max (a b: nat) : Tot (c: nat{c >= a /\\ c >= b /\\ (c <= a \\/ c <= b)}) =", "completed_definiton": "if a <= b then b else a", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.fst", "name": "QUIC.Spec.Header.header_encrypt_length", "original_source_type": "val header_encrypt_length:\n a: ea ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n h: header ->\n c: cbytes' (is_retry h) ->\n Lemma\n (\n Seq.length (header_encrypt a hpk h c) ==\n header_len h + Seq.length c\n )", "source_type": "val header_encrypt_length:\n a: ea ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n h: header ->\n c: cbytes' (is_retry h) ->\n Lemma\n (\n Seq.length (header_encrypt a hpk h c) ==\n header_len h + Seq.length c\n )", "source_definition": "let header_encrypt_length\n a hpk h c\n=\n header_encrypt_post a hpk h c (dcid_len h)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 136, "start_col": 2, "end_line": 136, "end_col": 44 }, "file_context": "module QUIC.Spec.Header\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Parse = QUIC.Spec.Header.Parse\n\nmodule AEAD = Spec.Agile.AEAD\nmodule Cipher = Spec.Agile.Cipher\nmodule Lemmas = QUIC.Spec.Lemmas\n\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: GTot (Seq.lseq Secret.uint8 16) =\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (Seq.seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (Seq.seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n(*\nDecryption of packet number\npacket[pn_offset..pn_offset+4] ^= pn_mask &\n match pn_len with\n | 0 -> mask & 0xFF000000\n | 1 -> mask & 0xFFFF0000\n | 2 -> mask & 0xFFFFFF00\n | 3 -> mask & 0xFFFFFFFF\n*)\nlet pn_sizemask' (pn_len: nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet pn_sizemask (pn_len: nat { pn_len < 4 }) : Tot (lbytes (pn_len + 1)) =\n Seq.slice (pn_sizemask' pn_len) 0 (pn_len + 1)\n\nlet header_encrypt\n a hpk h c\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\nlet header_encrypt_post\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n (cid_len: nat { cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h) })\n: Lemma (\n let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let z = header_encrypt a hpk h c in\n Parse.header_len h + Seq.length c == Seq.length z /\\\n Seq.slice z (Parse.header_len h) (Seq.length z) `Seq.equal` c /\\\n MShort? h == (BF.get_bitfield (U8.v (Seq.index z 0)) 7 8 = 0) /\\\n is_retry h == (not (MShort? h) && BF.get_bitfield (U8.v (Seq.index z 0)) 4 6 = 3) /\\ (\n if is_retry h\n then z == y\n else Parse.putative_pn_offset cid_len z == Some (Parse.pn_offset h)\n ))\n= Parse.format_header_is_short h;\n Parse.format_header_is_retry h;\n if is_retry h\n then ()\n else begin\n Parse.format_header_pn_length h;\n let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index y 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let bf = BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits bf in\n let r = Lemmas.xor_inplace y pnmask pn_offset in\n let z = header_encrypt a hpk h c in\n assert (z == Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)));\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset 0 1;\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset 1 pn_offset;\n assert (pn_offset > 0);\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset (Parse.header_len h) (Seq.length y);\n assert (Seq.slice z (Parse.header_len h) (Seq.length z) `Seq.equal` Seq.slice y (Parse.header_len h) (Seq.length y));\n assert (U8.uint_to_t f' == Seq.index (Seq.slice z 0 1) 0);\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 7 8;\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf protected_bits 8;\n if MLong? h\n then BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 4 6;\n Parse.putative_pn_offset_correct h cid_len;\n Parse.putative_pn_offset_frame cid_len x y;\n Parse.putative_pn_offset_frame cid_len y z;\n ()\n end\n\n#pop-options\n\nlet header_encrypt_length\n a hpk h c", "dependencies": { "source_file": "QUIC.Spec.Header.fst", "checked_file": "QUIC.Spec.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n h: QUIC.Spec.Header.Base.header ->\n c: QUIC.Spec.Crypto.cbytes' (QUIC.Spec.Header.Base.is_retry h)\n -> FStar.Pervasives.Lemma\n (ensures\n FStar.Seq.Base.length (QUIC.Spec.Header.header_encrypt a hpk h c) ==\n QUIC.Spec.Header.Base.header_len h + FStar.Seq.Base.length c)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "QUIC.Spec.Header.Base.header", "QUIC.Spec.Crypto.cbytes'", "QUIC.Spec.Header.Base.is_retry", "QUIC.Spec.Header.header_encrypt_post", "QUIC.Spec.Header.Base.dcid_len", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_encrypt_length:\n a: ea ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n h: header ->\n c: cbytes' (is_retry h) ->\n Lemma\n (\n Seq.length (header_encrypt a hpk h c) ==\n header_len h + Seq.length c\n )\nlet header_encrypt_length a hpk h c =", "completed_definiton": "header_encrypt_post a hpk h c (dcid_len h)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.fst", "name": "QUIC.Spec.Header.pn_sizemask", "original_source_type": "val pn_sizemask (pn_len: nat { pn_len < 4 }) : Tot (lbytes (pn_len + 1))", "source_type": "val pn_sizemask (pn_len: nat { pn_len < 4 }) : Tot (lbytes (pn_len + 1))", "source_definition": "let pn_sizemask (pn_len: nat { pn_len < 4 }) : Tot (lbytes (pn_len + 1)) =\n Seq.slice (pn_sizemask' pn_len) 0 (pn_len + 1)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 50, "start_col": 2, "end_line": 50, "end_col": 48 }, "file_context": "module QUIC.Spec.Header\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Parse = QUIC.Spec.Header.Parse\n\nmodule AEAD = Spec.Agile.AEAD\nmodule Cipher = Spec.Agile.Cipher\nmodule Lemmas = QUIC.Spec.Lemmas\n\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: GTot (Seq.lseq Secret.uint8 16) =\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (Seq.seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (Seq.seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n(*\nDecryption of packet number\npacket[pn_offset..pn_offset+4] ^= pn_mask &\n match pn_len with\n | 0 -> mask & 0xFF000000\n | 1 -> mask & 0xFFFF0000\n | 2 -> mask & 0xFFFFFF00\n | 3 -> mask & 0xFFFFFFFF\n*)\nlet pn_sizemask' (pn_len: nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))", "dependencies": { "source_file": "QUIC.Spec.Header.fst", "checked_file": "QUIC.Spec.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "pn_len: Prims.nat{pn_len < 4} -> QUIC.Spec.Base.lbytes (pn_len + 1)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "FStar.Seq.Base.slice", "QUIC.Spec.Base.byte", "QUIC.Spec.Header.pn_sizemask'", "Prims.op_Addition", "QUIC.Spec.Base.lbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val pn_sizemask (pn_len: nat { pn_len < 4 }) : Tot (lbytes (pn_len + 1))\nlet pn_sizemask (pn_len: nat{pn_len < 4}) : Tot (lbytes (pn_len + 1)) =", "completed_definiton": "Seq.slice (pn_sizemask' pn_len) 0 (pn_len + 1)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.fst", "name": "QUIC.Spec.Header.block_of_sample", "original_source_type": "val block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: GTot (Seq.lseq Secret.uint8 16)", "source_type": "val block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: GTot (Seq.lseq Secret.uint8 16)", "source_definition": "let block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: GTot (Seq.lseq Secret.uint8 16) =\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (Seq.seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (Seq.seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 20, "start_col": 2, "end_line": 33, "end_col": 48 }, "file_context": "module QUIC.Spec.Header\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Parse = QUIC.Spec.Header.Parse\n\nmodule AEAD = Spec.Agile.AEAD\nmodule Cipher = Spec.Agile.Cipher\nmodule Lemmas = QUIC.Spec.Lemmas\n\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)", "dependencies": { "source_file": "QUIC.Spec.Header.fst", "checked_file": "QUIC.Spec.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: Spec.Agile.Cipher.cipher_alg ->\n k: Spec.Agile.Cipher.key a ->\n sample: FStar.Seq.Properties.lseq Lib.IntTypes.uint8 16\n -> Prims.GTot (FStar.Seq.Properties.lseq Lib.IntTypes.uint8 16)", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Spec.Agile.Cipher.cipher_alg", "Spec.Agile.Cipher.key", "FStar.Seq.Properties.lseq", "Lib.IntTypes.uint8", "Spec.Agile.Cipher.ctr", "Spec.Agile.Cipher.nonce", "FStar.Seq.Base.slice", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "Spec.Agile.Cipher.ctr_block", "FStar.Pervasives.Native.tuple2", "FStar.Seq.Base.seq", "FStar.Pervasives.Native.Mktuple2", "FStar.Endianness.le_to_n", "QUIC.Secret.Seq.seq_reveal", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.b2t", "Prims.op_Equality", "Prims.pos", "Prims.pow2", "FStar.Mul.op_Star", "FStar.Endianness.lemma_le_to_n_is_bounded", "Lib.IntTypes.int_t", "FStar.Seq.Properties.split", "FStar.Endianness.be_to_n", "FStar.Endianness.lemma_be_to_n_is_bounded" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: GTot (Seq.lseq Secret.uint8 16)\nlet block_of_sample (a: Cipher.cipher_alg) (k: Cipher.key a) (sample: Seq.lseq Secret.uint8 16)\n : GTot (Seq.lseq Secret.uint8 16) =", "completed_definiton": "let open FStar.Mul in\nlet ctr, iv =\n match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (Seq.seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (Seq.seq_reveal ctr_bytes), iv\nin\n(Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.fst", "name": "QUIC.Spec.Header.header_encrypt", "original_source_type": "val header_encrypt:\n a:ea ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n h: header ->\n c: cbytes' (is_retry h) ->\n GTot packet", "source_type": "val header_encrypt:\n a:ea ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n h: header ->\n c: cbytes' (is_retry h) ->\n GTot packet", "source_definition": "let header_encrypt\n a hpk h c\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 55, "start_col": 2, "end_line": 71, "end_col": 5 }, "file_context": "module QUIC.Spec.Header\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Parse = QUIC.Spec.Header.Parse\n\nmodule AEAD = Spec.Agile.AEAD\nmodule Cipher = Spec.Agile.Cipher\nmodule Lemmas = QUIC.Spec.Lemmas\n\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: GTot (Seq.lseq Secret.uint8 16) =\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (Seq.seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (Seq.seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n(*\nDecryption of packet number\npacket[pn_offset..pn_offset+4] ^= pn_mask &\n match pn_len with\n | 0 -> mask & 0xFF000000\n | 1 -> mask & 0xFFFF0000\n | 2 -> mask & 0xFFFFFF00\n | 3 -> mask & 0xFFFFFFFF\n*)\nlet pn_sizemask' (pn_len: nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet pn_sizemask (pn_len: nat { pn_len < 4 }) : Tot (lbytes (pn_len + 1)) =\n Seq.slice (pn_sizemask' pn_len) 0 (pn_len + 1)\n\nlet header_encrypt\n a hpk h c", "dependencies": { "source_file": "QUIC.Spec.Header.fst", "checked_file": "QUIC.Spec.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n h: QUIC.Spec.Header.Base.header ->\n c: QUIC.Spec.Crypto.cbytes' (QUIC.Spec.Header.Base.is_retry h)\n -> Prims.GTot QUIC.Spec.Crypto.packet", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "QUIC.Spec.Header.Base.header", "QUIC.Spec.Crypto.cbytes'", "QUIC.Spec.Header.Base.is_retry", "Prims.bool", "FStar.Seq.Base.seq", "QUIC.Spec.Base.byte", "FStar.Seq.Properties.cons", "FStar.UInt8.uint_to_t", "FStar.Seq.Base.slice", "FStar.Seq.Base.length", "QUIC.Spec.Base.bytes", "QUIC.Spec.Lemmas.xor_inplace", "FStar.UInt.uint_t", "LowParse.BitFields.set_bitfield", "FStar.UInt8.n", "FStar.UInt8.v", "LowParse.BitFields.get_bitfield", "FStar.UInt.logxor", "FStar.Seq.Base.index", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.PUB", "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "QUIC.Spec.Header.Base.uu___is_MShort", "QUIC.Spec.Lemmas.and_inplace", "Prims.op_Addition", "QUIC.Spec.Header.pn_sizemask", "Lib.IntTypes.int_t", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.SEC", "QUIC.Spec.Header.block_of_sample", "QUIC.Secret.Seq.seq_hide", "Prims.op_Subtraction", "Prims.int", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "QUIC.Spec.Header.Base.pn_length", "Prims.op_LessThan", "Prims.eq2", "Lib.IntTypes.v", "QUIC.Spec.Header.Base.header_len", "QUIC.Spec.Header.Parse.pn_offset", "QUIC.Spec.Crypto.packet", "FStar.Seq.Base.append", "QUIC.Spec.Header.Parse.format_header", "Prims.unit", "FStar.Pervasives.assert_norm", "QUIC.Spec.Crypto.max_cipher_length", "Prims.pow2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_encrypt:\n a:ea ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n h: header ->\n c: cbytes' (is_retry h) ->\n GTot packet\nlet header_encrypt a hpk h c =", "completed_definiton": "assert_norm (max_cipher_length < pow2 62);\nlet r = (Parse.format_header h) `Seq.append` c in\nif is_retry h\nthen r\nelse\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3 - pn_len) (19 - pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let f' =\n BF.set_bitfield (U8.v f)\n 0\n protected_bits\n (BF.get_bitfield ((U8.v f) `FStar.UInt.logxor` (U8.v (Seq.index mask 0))) 0 protected_bits)\n in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.fst", "name": "QUIC.Spec.Header.header_decrypt_aux", "original_source_type": "val header_decrypt_aux\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet: packet)\n : GTot (option header_decrypt_aux_t)", "source_type": "val header_decrypt_aux\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet: packet)\n : GTot (option header_decrypt_aux_t)", "source_definition": "let header_decrypt_aux\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: GTot (option header_decrypt_aux_t)\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n is_short = is_short;\n is_retry = is_retry;\n packet = packet;\n pn_offset = ();\n pn_len = ();\n })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset+16)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n is_short = is_short;\n is_retry = is_retry;\n packet = packet'';\n pn_offset = pn_offset;\n pn_len = pn_len;\n })\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 153, "start_col": 2, "end_line": 194, "end_col": 11 }, "file_context": "module QUIC.Spec.Header\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Parse = QUIC.Spec.Header.Parse\n\nmodule AEAD = Spec.Agile.AEAD\nmodule Cipher = Spec.Agile.Cipher\nmodule Lemmas = QUIC.Spec.Lemmas\n\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: GTot (Seq.lseq Secret.uint8 16) =\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (Seq.seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (Seq.seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n(*\nDecryption of packet number\npacket[pn_offset..pn_offset+4] ^= pn_mask &\n match pn_len with\n | 0 -> mask & 0xFF000000\n | 1 -> mask & 0xFFFF0000\n | 2 -> mask & 0xFFFFFF00\n | 3 -> mask & 0xFFFFFFFF\n*)\nlet pn_sizemask' (pn_len: nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet pn_sizemask (pn_len: nat { pn_len < 4 }) : Tot (lbytes (pn_len + 1)) =\n Seq.slice (pn_sizemask' pn_len) 0 (pn_len + 1)\n\nlet header_encrypt\n a hpk h c\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\nlet header_encrypt_post\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n (cid_len: nat { cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h) })\n: Lemma (\n let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let z = header_encrypt a hpk h c in\n Parse.header_len h + Seq.length c == Seq.length z /\\\n Seq.slice z (Parse.header_len h) (Seq.length z) `Seq.equal` c /\\\n MShort? h == (BF.get_bitfield (U8.v (Seq.index z 0)) 7 8 = 0) /\\\n is_retry h == (not (MShort? h) && BF.get_bitfield (U8.v (Seq.index z 0)) 4 6 = 3) /\\ (\n if is_retry h\n then z == y\n else Parse.putative_pn_offset cid_len z == Some (Parse.pn_offset h)\n ))\n= Parse.format_header_is_short h;\n Parse.format_header_is_retry h;\n if is_retry h\n then ()\n else begin\n Parse.format_header_pn_length h;\n let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index y 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let bf = BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits bf in\n let r = Lemmas.xor_inplace y pnmask pn_offset in\n let z = header_encrypt a hpk h c in\n assert (z == Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)));\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset 0 1;\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset 1 pn_offset;\n assert (pn_offset > 0);\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset (Parse.header_len h) (Seq.length y);\n assert (Seq.slice z (Parse.header_len h) (Seq.length z) `Seq.equal` Seq.slice y (Parse.header_len h) (Seq.length y));\n assert (U8.uint_to_t f' == Seq.index (Seq.slice z 0 1) 0);\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 7 8;\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf protected_bits 8;\n if MLong? h\n then BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 4 6;\n Parse.putative_pn_offset_correct h cid_len;\n Parse.putative_pn_offset_frame cid_len x y;\n Parse.putative_pn_offset_frame cid_len y z;\n ()\n end\n\n#pop-options\n\nlet header_encrypt_length\n a hpk h c\n=\n header_encrypt_post a hpk h c (dcid_len h)\n\nnoextract\ntype header_decrypt_aux_t = {\n is_short: bool;\n is_retry: (is_retry: bool { is_retry ==> ~ (is_short) });\n packet: packet;\n pn_offset: (if is_retry then unit else nat);\n pn_len: (if is_retry then unit else (pn_len: nat {pn_len < 4 /\\ pn_offset + pn_len + 1 <= Seq.length packet}));\n}\n\nlet header_decrypt_aux\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)", "dependencies": { "source_file": "QUIC.Spec.Header.fst", "checked_file": "QUIC.Spec.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n cid_len: Prims.nat{cid_len <= 20} ->\n packet: QUIC.Spec.Crypto.packet\n -> Prims.GTot (FStar.Pervasives.Native.option QUIC.Spec.Header.header_decrypt_aux_t)", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "QUIC.Spec.Crypto.packet", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "FStar.Pervasives.Native.None", "QUIC.Spec.Header.header_decrypt_aux_t", "Prims.bool", "FStar.Pervasives.Native.Some", "QUIC.Spec.Header.Mkheader_decrypt_aux_t", "QUIC.Spec.Header.Parse.putative_pn_offset", "Prims.op_GreaterThan", "Prims.op_Addition", "QUIC.Spec.Base.bytes", "QUIC.Spec.Lemmas.xor_inplace", "QUIC.Spec.Lemmas.and_inplace", "FStar.Seq.Base.slice", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.PUB", "QUIC.Spec.Header.pn_sizemask", "LowParse.BitFields.ubitfield", "Prims.op_Subtraction", "LowParse.BitFields.get_bitfield", "FStar.UInt8.n", "FStar.Seq.Base.seq", "FStar.Seq.Properties.cons", "FStar.UInt8.uint_to_t", "FStar.UInt.uint_t", "LowParse.BitFields.set_bitfield", "FStar.UInt8.v", "FStar.UInt.logxor", "FStar.Seq.Base.index", "Prims.l_and", "Lib.IntTypes.int_t", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.SEC", "QUIC.Spec.Header.block_of_sample", "QUIC.Secret.Seq.seq_hide", "FStar.Pervasives.Native.option", "Prims.op_AmpAmp", "Prims.op_Negation" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_decrypt_aux\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet: packet)\n : GTot (option header_decrypt_aux_t)\nlet header_decrypt_aux\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet: packet)\n : GTot (option header_decrypt_aux_t) =", "completed_definiton": "let open FStar.Math.Lemmas in\nif Seq.length packet = 0\nthen None\nelse\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some\n ({ is_short = is_short; is_retry = is_retry; packet = packet; pn_offset = (); pn_len = () })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset + 16)) in\n let mask =\n Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample)\n in\n let protected_bits = if is_short then 5 else 4 in\n let f' =\n BF.set_bitfield (U8.v f)\n 0\n protected_bits\n (BF.get_bitfield ((U8.v f) `FStar.UInt.logxor` (U8.v (Seq.index mask 0)))\n 0\n protected_bits)\n in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some\n ({\n is_short = is_short;\n is_retry = is_retry;\n packet = packet'';\n pn_offset = pn_offset;\n pn_len = pn_len\n })", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.fst", "name": "QUIC.Spec.Header.header_decrypt_aux_post", "original_source_type": "val header_decrypt_aux_post\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet: packet)\n : Lemma (requires (Some? (header_decrypt_aux a hpk cid_len packet)))\n (ensures\n (Some? (header_decrypt_aux a hpk cid_len packet) /\\\n (let Some r = header_decrypt_aux a hpk cid_len packet in\n Seq.length r.packet == Seq.length packet /\\ Seq.length packet > 0 /\\\n (let f' = Seq.index r.packet 0 in\n r.is_short == (BF.get_bitfield (U8.v f') 7 8 = 0) /\\\n r.is_retry == (not r.is_short && (BF.get_bitfield (U8.v f') 4 6 = 3)) /\\\n (if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\\n Parse.putative_pn_offset cid_len r.packet ==\n Parse.putative_pn_offset cid_len packet /\\\n (let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n r.pn_offset == pn_offset /\\ r.pn_offset + 20 <= Seq.length r.packet /\\\n r.pn_len == BF.get_bitfield (U8.v f') 0 2 /\\\n r.pn_offset + r.pn_len + 1 <= Seq.length r.packet /\\\n (Seq.slice r.packet (r.pn_offset + r.pn_len + 1) (Seq.length r.packet))\n `Seq.equal`\n (Seq.slice packet (r.pn_offset + r.pn_len + 1) (Seq.length packet)) /\\ True)))))\n )", "source_type": "val header_decrypt_aux_post\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet: packet)\n : Lemma (requires (Some? (header_decrypt_aux a hpk cid_len packet)))\n (ensures\n (Some? (header_decrypt_aux a hpk cid_len packet) /\\\n (let Some r = header_decrypt_aux a hpk cid_len packet in\n Seq.length r.packet == Seq.length packet /\\ Seq.length packet > 0 /\\\n (let f' = Seq.index r.packet 0 in\n r.is_short == (BF.get_bitfield (U8.v f') 7 8 = 0) /\\\n r.is_retry == (not r.is_short && (BF.get_bitfield (U8.v f') 4 6 = 3)) /\\\n (if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\\n Parse.putative_pn_offset cid_len r.packet ==\n Parse.putative_pn_offset cid_len packet /\\\n (let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n r.pn_offset == pn_offset /\\ r.pn_offset + 20 <= Seq.length r.packet /\\\n r.pn_len == BF.get_bitfield (U8.v f') 0 2 /\\\n r.pn_offset + r.pn_len + 1 <= Seq.length r.packet /\\\n (Seq.slice r.packet (r.pn_offset + r.pn_len + 1) (Seq.length r.packet))\n `Seq.equal`\n (Seq.slice packet (r.pn_offset + r.pn_len + 1) (Seq.length packet)) /\\ True)))))\n )", "source_definition": "let header_decrypt_aux_post\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Lemma\n (requires (Some? (header_decrypt_aux a hpk cid_len packet)))\n (ensures (\n Some? (header_decrypt_aux a hpk cid_len packet) /\\ (\n let Some r = header_decrypt_aux a hpk cid_len packet in\n Seq.length r.packet == Seq.length packet /\\\n Seq.length packet > 0 /\\ (\n let f' = Seq.index r.packet 0 in\n r.is_short == (BF.get_bitfield (U8.v f') 7 8 = 0) /\\\n r.is_retry == (not r.is_short && (BF.get_bitfield (U8.v f') 4 6 = 3)) /\\ (\n if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\\n Parse.putative_pn_offset cid_len r.packet == Parse.putative_pn_offset cid_len packet /\\ (\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n r.pn_offset == pn_offset /\\\n r.pn_offset + 20 <= Seq.length r.packet /\\\n r.pn_len == BF.get_bitfield (U8.v f') 0 2 /\\\n r.pn_offset + r.pn_len + 1 <= Seq.length r.packet /\\\n Seq.slice r.packet (r.pn_offset + r.pn_len + 1) (Seq.length r.packet) `Seq.equal` Seq.slice packet (r.pn_offset + r.pn_len + 1) (Seq.length packet) /\\\n True\n ))))))\n=let Some r = header_decrypt_aux a hpk cid_len packet in\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then ()\n else begin\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n let sample_offset = pn_offset + 4 in\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset+16)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let bf = BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits bf in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n assert (r.packet == Lemmas.xor_inplace packet' pnmask pn_offset);\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset 0 1;\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset 1 pn_offset;\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset (pn_offset + pn_len + 1) (Seq.length packet);\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf protected_bits 8;\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 7 8;\n assert (Seq.index r.packet 0 == Seq.index (Seq.slice packet' 0 1) 0);\n Parse.putative_pn_offset_frame cid_len packet r.packet;\n if not is_short\n then BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 4 6;\n assert (Parse.putative_pn_offset cid_len r.packet == Parse.putative_pn_offset cid_len packet);\n ()\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 228, "start_col": 1, "end_line": 259, "end_col": 5 }, "file_context": "module QUIC.Spec.Header\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Parse = QUIC.Spec.Header.Parse\n\nmodule AEAD = Spec.Agile.AEAD\nmodule Cipher = Spec.Agile.Cipher\nmodule Lemmas = QUIC.Spec.Lemmas\n\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: GTot (Seq.lseq Secret.uint8 16) =\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (Seq.seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (Seq.seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n(*\nDecryption of packet number\npacket[pn_offset..pn_offset+4] ^= pn_mask &\n match pn_len with\n | 0 -> mask & 0xFF000000\n | 1 -> mask & 0xFFFF0000\n | 2 -> mask & 0xFFFFFF00\n | 3 -> mask & 0xFFFFFFFF\n*)\nlet pn_sizemask' (pn_len: nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet pn_sizemask (pn_len: nat { pn_len < 4 }) : Tot (lbytes (pn_len + 1)) =\n Seq.slice (pn_sizemask' pn_len) 0 (pn_len + 1)\n\nlet header_encrypt\n a hpk h c\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\nlet header_encrypt_post\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n (cid_len: nat { cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h) })\n: Lemma (\n let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let z = header_encrypt a hpk h c in\n Parse.header_len h + Seq.length c == Seq.length z /\\\n Seq.slice z (Parse.header_len h) (Seq.length z) `Seq.equal` c /\\\n MShort? h == (BF.get_bitfield (U8.v (Seq.index z 0)) 7 8 = 0) /\\\n is_retry h == (not (MShort? h) && BF.get_bitfield (U8.v (Seq.index z 0)) 4 6 = 3) /\\ (\n if is_retry h\n then z == y\n else Parse.putative_pn_offset cid_len z == Some (Parse.pn_offset h)\n ))\n= Parse.format_header_is_short h;\n Parse.format_header_is_retry h;\n if is_retry h\n then ()\n else begin\n Parse.format_header_pn_length h;\n let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index y 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let bf = BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits bf in\n let r = Lemmas.xor_inplace y pnmask pn_offset in\n let z = header_encrypt a hpk h c in\n assert (z == Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)));\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset 0 1;\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset 1 pn_offset;\n assert (pn_offset > 0);\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset (Parse.header_len h) (Seq.length y);\n assert (Seq.slice z (Parse.header_len h) (Seq.length z) `Seq.equal` Seq.slice y (Parse.header_len h) (Seq.length y));\n assert (U8.uint_to_t f' == Seq.index (Seq.slice z 0 1) 0);\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 7 8;\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf protected_bits 8;\n if MLong? h\n then BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 4 6;\n Parse.putative_pn_offset_correct h cid_len;\n Parse.putative_pn_offset_frame cid_len x y;\n Parse.putative_pn_offset_frame cid_len y z;\n ()\n end\n\n#pop-options\n\nlet header_encrypt_length\n a hpk h c\n=\n header_encrypt_post a hpk h c (dcid_len h)\n\nnoextract\ntype header_decrypt_aux_t = {\n is_short: bool;\n is_retry: (is_retry: bool { is_retry ==> ~ (is_short) });\n packet: packet;\n pn_offset: (if is_retry then unit else nat);\n pn_len: (if is_retry then unit else (pn_len: nat {pn_len < 4 /\\ pn_offset + pn_len + 1 <= Seq.length packet}));\n}\n\nlet header_decrypt_aux\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: GTot (option header_decrypt_aux_t)\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n is_short = is_short;\n is_retry = is_retry;\n packet = packet;\n pn_offset = ();\n pn_len = ();\n })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset+16)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n is_short = is_short;\n is_retry = is_retry;\n packet = packet'';\n pn_offset = pn_offset;\n pn_len = pn_len;\n })\n end\n\n#push-options \"--z3rlimit 64 --max_fuel 1\"\n\n#restart-solver\n\nlet header_decrypt_aux_post\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Lemma\n (requires (Some? (header_decrypt_aux a hpk cid_len packet)))\n (ensures (\n Some? (header_decrypt_aux a hpk cid_len packet) /\\ (\n let Some r = header_decrypt_aux a hpk cid_len packet in\n Seq.length r.packet == Seq.length packet /\\\n Seq.length packet > 0 /\\ (\n let f' = Seq.index r.packet 0 in\n r.is_short == (BF.get_bitfield (U8.v f') 7 8 = 0) /\\\n r.is_retry == (not r.is_short && (BF.get_bitfield (U8.v f') 4 6 = 3)) /\\ (\n if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\\n Parse.putative_pn_offset cid_len r.packet == Parse.putative_pn_offset cid_len packet /\\ (\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n r.pn_offset == pn_offset /\\\n r.pn_offset + 20 <= Seq.length r.packet /\\\n r.pn_len == BF.get_bitfield (U8.v f') 0 2 /\\\n r.pn_offset + r.pn_len + 1 <= Seq.length r.packet /\\\n Seq.slice r.packet (r.pn_offset + r.pn_len + 1) (Seq.length r.packet) `Seq.equal` Seq.slice packet (r.pn_offset + r.pn_len + 1) (Seq.length packet) /\\\n True", "dependencies": { "source_file": "QUIC.Spec.Header.fst", "checked_file": "QUIC.Spec.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n cid_len: Prims.nat{cid_len <= 20} ->\n packet: QUIC.Spec.Crypto.packet\n -> FStar.Pervasives.Lemma\n (requires Some? (QUIC.Spec.Header.header_decrypt_aux a hpk cid_len packet))\n (ensures\n Some? (QUIC.Spec.Header.header_decrypt_aux a hpk cid_len packet) /\\\n (let _ = QUIC.Spec.Header.header_decrypt_aux a hpk cid_len packet in\n (let FStar.Pervasives.Native.Some #_ r = _ in\n FStar.Seq.Base.length (Mkheader_decrypt_aux_t?.packet r) == FStar.Seq.Base.length packet /\\\n FStar.Seq.Base.length packet > 0 /\\\n (let f' = FStar.Seq.Base.index (Mkheader_decrypt_aux_t?.packet r) 0 in\n Mkheader_decrypt_aux_t?.is_short r ==\n (LowParse.BitFields.get_bitfield (FStar.UInt8.v f') 7 8 = 0) /\\\n Mkheader_decrypt_aux_t?.is_retry r ==\n (Prims.op_Negation (Mkheader_decrypt_aux_t?.is_short r) &&\n LowParse.BitFields.get_bitfield (FStar.UInt8.v f') 4 6 = 3) /\\\n (match Mkheader_decrypt_aux_t?.is_retry r with\n | true -> Mkheader_decrypt_aux_t?.packet r == packet\n | _ ->\n Some? (QUIC.Spec.Header.Parse.putative_pn_offset cid_len packet) /\\\n QUIC.Spec.Header.Parse.putative_pn_offset cid_len\n (Mkheader_decrypt_aux_t?.packet r) ==\n QUIC.Spec.Header.Parse.putative_pn_offset cid_len packet /\\\n (let _ = QUIC.Spec.Header.Parse.putative_pn_offset cid_len packet in\n (let FStar.Pervasives.Native.Some #_ pn_offset = _ in\n Mkheader_decrypt_aux_t?.pn_offset r == pn_offset /\\\n Mkheader_decrypt_aux_t?.pn_offset r + 20 <=\n FStar.Seq.Base.length (Mkheader_decrypt_aux_t?.packet r) /\\\n Mkheader_decrypt_aux_t?.pn_len r ==\n LowParse.BitFields.get_bitfield (FStar.UInt8.v f') 0 2 /\\\n Mkheader_decrypt_aux_t?.pn_offset r + Mkheader_decrypt_aux_t?.pn_len r + 1 <=\n FStar.Seq.Base.length (Mkheader_decrypt_aux_t?.packet r) /\\\n FStar.Seq.Base.equal (FStar.Seq.Base.slice (Mkheader_decrypt_aux_t?.packet r)\n (Mkheader_decrypt_aux_t?.pn_offset r + Mkheader_decrypt_aux_t?.pn_len r +\n 1)\n (FStar.Seq.Base.length (Mkheader_decrypt_aux_t?.packet r)))\n (FStar.Seq.Base.slice packet\n (Mkheader_decrypt_aux_t?.pn_offset r + Mkheader_decrypt_aux_t?.pn_len r +\n 1)\n (FStar.Seq.Base.length packet)) /\\ Prims.l_True)\n <:\n Prims.logical))))\n <:\n Prims.logical))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "QUIC.Spec.Crypto.packet", "QUIC.Spec.Header.header_decrypt_aux_t", "Prims.bool", "Prims.unit", "Prims._assert", "Prims.eq2", "FStar.Pervasives.Native.option", "Prims.l_or", "Prims.l_True", "Prims.l_and", "Prims.op_LessThan", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "QUIC.Spec.Base.header_len_bound", "Prims.logical", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__packet", "QUIC.Spec.Header.Parse.putative_pn_offset", "Prims.op_Negation", "LowParse.BitFields.get_bitfield_set_bitfield_other", "FStar.UInt8.n", "FStar.UInt8.v", "QUIC.Spec.Header.Parse.putative_pn_offset_frame", "FStar.Seq.Base.index", "FStar.Seq.Base.slice", "QUIC.Spec.Lemmas.pointwise_op_slice_other", "FStar.UInt8.logxor", "Prims.op_Addition", "QUIC.Spec.Base.bytes", "QUIC.Spec.Lemmas.xor_inplace", "QUIC.Spec.Lemmas.and_inplace", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.PUB", "QUIC.Spec.Header.pn_sizemask", "LowParse.BitFields.ubitfield", "Prims.op_Subtraction", "LowParse.BitFields.get_bitfield", "FStar.Seq.Base.seq", "FStar.Seq.Properties.cons", "FStar.UInt8.uint_to_t", "FStar.UInt.uint_t", "LowParse.BitFields.set_bitfield", "FStar.UInt.logxor", "Lib.IntTypes.int_t", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.SEC", "QUIC.Spec.Header.block_of_sample", "QUIC.Secret.Seq.seq_hide", "Prims.int", "Prims.op_AmpAmp", "Prims.op_Equality", "QUIC.Spec.Header.header_decrypt_aux", "FStar.Pervasives.Native.uu___is_Some", "Prims.squash", "Prims.op_GreaterThan", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__is_short", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__is_retry", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__pn_offset", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__pn_len", "FStar.Seq.Base.equal", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_decrypt_aux_post\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet: packet)\n : Lemma (requires (Some? (header_decrypt_aux a hpk cid_len packet)))\n (ensures\n (Some? (header_decrypt_aux a hpk cid_len packet) /\\\n (let Some r = header_decrypt_aux a hpk cid_len packet in\n Seq.length r.packet == Seq.length packet /\\ Seq.length packet > 0 /\\\n (let f' = Seq.index r.packet 0 in\n r.is_short == (BF.get_bitfield (U8.v f') 7 8 = 0) /\\\n r.is_retry == (not r.is_short && (BF.get_bitfield (U8.v f') 4 6 = 3)) /\\\n (if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\\n Parse.putative_pn_offset cid_len r.packet ==\n Parse.putative_pn_offset cid_len packet /\\\n (let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n r.pn_offset == pn_offset /\\ r.pn_offset + 20 <= Seq.length r.packet /\\\n r.pn_len == BF.get_bitfield (U8.v f') 0 2 /\\\n r.pn_offset + r.pn_len + 1 <= Seq.length r.packet /\\\n (Seq.slice r.packet (r.pn_offset + r.pn_len + 1) (Seq.length r.packet))\n `Seq.equal`\n (Seq.slice packet (r.pn_offset + r.pn_len + 1) (Seq.length packet)) /\\ True)))))\n )\nlet header_decrypt_aux_post\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet: packet)\n : Lemma (requires (Some? (header_decrypt_aux a hpk cid_len packet)))\n (ensures\n (Some? (header_decrypt_aux a hpk cid_len packet) /\\\n (let Some r = header_decrypt_aux a hpk cid_len packet in\n Seq.length r.packet == Seq.length packet /\\ Seq.length packet > 0 /\\\n (let f' = Seq.index r.packet 0 in\n r.is_short == (BF.get_bitfield (U8.v f') 7 8 = 0) /\\\n r.is_retry == (not r.is_short && (BF.get_bitfield (U8.v f') 4 6 = 3)) /\\\n (if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\\n Parse.putative_pn_offset cid_len r.packet ==\n Parse.putative_pn_offset cid_len packet /\\\n (let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n r.pn_offset == pn_offset /\\ r.pn_offset + 20 <= Seq.length r.packet /\\\n r.pn_len == BF.get_bitfield (U8.v f') 0 2 /\\\n r.pn_offset + r.pn_len + 1 <= Seq.length r.packet /\\\n (Seq.slice r.packet (r.pn_offset + r.pn_len + 1) (Seq.length r.packet))\n `Seq.equal`\n (Seq.slice packet (r.pn_offset + r.pn_len + 1) (Seq.length packet)) /\\ True)))))\n ) =", "completed_definiton": "let Some r = header_decrypt_aux a hpk cid_len packet in\nlet f = Seq.index packet 0 in\nlet is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\nlet is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\nif is_retry\nthen ()\nelse\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n let sample_offset = pn_offset + 4 in\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset + 16)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let protected_bits = if is_short then 5 else 4 in\n let bf =\n BF.get_bitfield ((U8.v f) `FStar.UInt.logxor` (U8.v (Seq.index mask 0))) 0 protected_bits\n in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits bf in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n assert (r.packet == Lemmas.xor_inplace packet' pnmask pn_offset);\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset 0 1;\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset 1 pn_offset;\n Lemmas.pointwise_op_slice_other U8.logxor\n packet'\n pnmask\n pn_offset\n (pn_offset + pn_len + 1)\n (Seq.length packet);\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf protected_bits 8;\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 7 8;\n assert (Seq.index r.packet 0 == Seq.index (Seq.slice packet' 0 1) 0);\n Parse.putative_pn_offset_frame cid_len packet r.packet;\n if not is_short then BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 4 6;\n assert (Parse.putative_pn_offset cid_len r.packet == Parse.putative_pn_offset cid_len packet);\n ()", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.fst", "name": "QUIC.Spec.Header.header_decrypt_aux_post_parse", "original_source_type": "val header_decrypt_aux_post_parse\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (last: nat{last + 1 < pow2 62})\n (packet: packet)\n : Lemma\n (requires\n (match header_decrypt_aux a hpk cid_len packet with\n | Some r -> Parse.H_Success? (Parse.parse_header cid_len last r.packet)\n | _ -> False))\n (ensures\n (let Some r = header_decrypt_aux a hpk cid_len packet in\n let Parse.H_Success h rem' = Parse.parse_header cid_len last r.packet in\n Parse.header_len h <= Seq.length packet /\\ Seq.length r.packet == Seq.length packet /\\\n Seq.length packet > 0 /\\\n (r.is_short == MShort? h /\\ r.is_retry == is_retry h /\\\n rem' `Seq.equal` (Seq.slice packet (Parse.header_len h) (Seq.length packet)) /\\\n (if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\\n (let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n pn_offset == Parse.pn_offset h /\\ r.pn_offset == pn_offset /\\\n r.pn_len == Secret.v (pn_length h) - 1 /\\\n r.pn_offset + r.pn_len + 1 == Parse.header_len h /\\ Seq.length rem' >= 16)))))", "source_type": "val header_decrypt_aux_post_parse\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (last: nat{last + 1 < pow2 62})\n (packet: packet)\n : Lemma\n (requires\n (match header_decrypt_aux a hpk cid_len packet with\n | Some r -> Parse.H_Success? (Parse.parse_header cid_len last r.packet)\n | _ -> False))\n (ensures\n (let Some r = header_decrypt_aux a hpk cid_len packet in\n let Parse.H_Success h rem' = Parse.parse_header cid_len last r.packet in\n Parse.header_len h <= Seq.length packet /\\ Seq.length r.packet == Seq.length packet /\\\n Seq.length packet > 0 /\\\n (r.is_short == MShort? h /\\ r.is_retry == is_retry h /\\\n rem' `Seq.equal` (Seq.slice packet (Parse.header_len h) (Seq.length packet)) /\\\n (if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\\n (let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n pn_offset == Parse.pn_offset h /\\ r.pn_offset == pn_offset /\\\n r.pn_len == Secret.v (pn_length h) - 1 /\\\n r.pn_offset + r.pn_len + 1 == Parse.header_len h /\\ Seq.length rem' >= 16)))))", "source_definition": "let header_decrypt_aux_post_parse\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (packet: packet)\n: Lemma\n (requires (match header_decrypt_aux a hpk cid_len packet with\n | Some r ->\n Parse.H_Success? (Parse.parse_header cid_len last r.packet)\n | _ -> False\n ))\n (ensures (\n let Some r = header_decrypt_aux a hpk cid_len packet in\n let Parse.H_Success h rem' = Parse.parse_header cid_len last r.packet in\n Parse.header_len h <= Seq.length packet /\\\n Seq.length r.packet == Seq.length packet /\\\n Seq.length packet > 0 /\\ (\n r.is_short == MShort? h /\\\n r.is_retry == is_retry h /\\\n rem' `Seq.equal` Seq.slice packet (Parse.header_len h) (Seq.length packet) /\\ (\n if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\ (\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n pn_offset == Parse.pn_offset h /\\\n r.pn_offset == pn_offset /\\\n r.pn_len == Secret.v (pn_length h) - 1 /\\\n r.pn_offset + r.pn_len + 1 == Parse.header_len h /\\\n Seq.length rem' >= 16\n )))))\n= header_decrypt_aux_post a hpk cid_len packet;\n let Some r = header_decrypt_aux a hpk cid_len packet in\n let Parse.H_Success h rem' = Parse.parse_header cid_len last r.packet in\n Parse.lemma_header_parsing_post cid_len last r.packet;\n Parse.format_header_is_short h;\n Parse.format_header_is_retry h;\n assert (r.is_short == MShort? h);\n assert (r.is_retry == is_retry h);\n if r.is_retry\n then\n ()\n else begin\n Parse.format_header_pn_length h;\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n Parse.putative_pn_offset_correct h cid_len;\n Parse.putative_pn_offset_frame cid_len (Parse.format_header h) r.packet\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 297, "start_col": 2, "end_line": 313, "end_col": 5 }, "file_context": "module QUIC.Spec.Header\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Parse = QUIC.Spec.Header.Parse\n\nmodule AEAD = Spec.Agile.AEAD\nmodule Cipher = Spec.Agile.Cipher\nmodule Lemmas = QUIC.Spec.Lemmas\n\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: GTot (Seq.lseq Secret.uint8 16) =\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (Seq.seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (Seq.seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n(*\nDecryption of packet number\npacket[pn_offset..pn_offset+4] ^= pn_mask &\n match pn_len with\n | 0 -> mask & 0xFF000000\n | 1 -> mask & 0xFFFF0000\n | 2 -> mask & 0xFFFFFF00\n | 3 -> mask & 0xFFFFFFFF\n*)\nlet pn_sizemask' (pn_len: nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet pn_sizemask (pn_len: nat { pn_len < 4 }) : Tot (lbytes (pn_len + 1)) =\n Seq.slice (pn_sizemask' pn_len) 0 (pn_len + 1)\n\nlet header_encrypt\n a hpk h c\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\nlet header_encrypt_post\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n (cid_len: nat { cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h) })\n: Lemma (\n let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let z = header_encrypt a hpk h c in\n Parse.header_len h + Seq.length c == Seq.length z /\\\n Seq.slice z (Parse.header_len h) (Seq.length z) `Seq.equal` c /\\\n MShort? h == (BF.get_bitfield (U8.v (Seq.index z 0)) 7 8 = 0) /\\\n is_retry h == (not (MShort? h) && BF.get_bitfield (U8.v (Seq.index z 0)) 4 6 = 3) /\\ (\n if is_retry h\n then z == y\n else Parse.putative_pn_offset cid_len z == Some (Parse.pn_offset h)\n ))\n= Parse.format_header_is_short h;\n Parse.format_header_is_retry h;\n if is_retry h\n then ()\n else begin\n Parse.format_header_pn_length h;\n let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index y 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let bf = BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits bf in\n let r = Lemmas.xor_inplace y pnmask pn_offset in\n let z = header_encrypt a hpk h c in\n assert (z == Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)));\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset 0 1;\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset 1 pn_offset;\n assert (pn_offset > 0);\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset (Parse.header_len h) (Seq.length y);\n assert (Seq.slice z (Parse.header_len h) (Seq.length z) `Seq.equal` Seq.slice y (Parse.header_len h) (Seq.length y));\n assert (U8.uint_to_t f' == Seq.index (Seq.slice z 0 1) 0);\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 7 8;\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf protected_bits 8;\n if MLong? h\n then BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 4 6;\n Parse.putative_pn_offset_correct h cid_len;\n Parse.putative_pn_offset_frame cid_len x y;\n Parse.putative_pn_offset_frame cid_len y z;\n ()\n end\n\n#pop-options\n\nlet header_encrypt_length\n a hpk h c\n=\n header_encrypt_post a hpk h c (dcid_len h)\n\nnoextract\ntype header_decrypt_aux_t = {\n is_short: bool;\n is_retry: (is_retry: bool { is_retry ==> ~ (is_short) });\n packet: packet;\n pn_offset: (if is_retry then unit else nat);\n pn_len: (if is_retry then unit else (pn_len: nat {pn_len < 4 /\\ pn_offset + pn_len + 1 <= Seq.length packet}));\n}\n\nlet header_decrypt_aux\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: GTot (option header_decrypt_aux_t)\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n is_short = is_short;\n is_retry = is_retry;\n packet = packet;\n pn_offset = ();\n pn_len = ();\n })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset+16)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n is_short = is_short;\n is_retry = is_retry;\n packet = packet'';\n pn_offset = pn_offset;\n pn_len = pn_len;\n })\n end\n\n#push-options \"--z3rlimit 64 --max_fuel 1\"\n\n#restart-solver\n\nlet header_decrypt_aux_post\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Lemma\n (requires (Some? (header_decrypt_aux a hpk cid_len packet)))\n (ensures (\n Some? (header_decrypt_aux a hpk cid_len packet) /\\ (\n let Some r = header_decrypt_aux a hpk cid_len packet in\n Seq.length r.packet == Seq.length packet /\\\n Seq.length packet > 0 /\\ (\n let f' = Seq.index r.packet 0 in\n r.is_short == (BF.get_bitfield (U8.v f') 7 8 = 0) /\\\n r.is_retry == (not r.is_short && (BF.get_bitfield (U8.v f') 4 6 = 3)) /\\ (\n if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\\n Parse.putative_pn_offset cid_len r.packet == Parse.putative_pn_offset cid_len packet /\\ (\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n r.pn_offset == pn_offset /\\\n r.pn_offset + 20 <= Seq.length r.packet /\\\n r.pn_len == BF.get_bitfield (U8.v f') 0 2 /\\\n r.pn_offset + r.pn_len + 1 <= Seq.length r.packet /\\\n Seq.slice r.packet (r.pn_offset + r.pn_len + 1) (Seq.length r.packet) `Seq.equal` Seq.slice packet (r.pn_offset + r.pn_len + 1) (Seq.length packet) /\\\n True\n ))))))\n=let Some r = header_decrypt_aux a hpk cid_len packet in\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then ()\n else begin\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n let sample_offset = pn_offset + 4 in\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset+16)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let bf = BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits bf in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n assert (r.packet == Lemmas.xor_inplace packet' pnmask pn_offset);\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset 0 1;\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset 1 pn_offset;\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset (pn_offset + pn_len + 1) (Seq.length packet);\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf protected_bits 8;\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 7 8;\n assert (Seq.index r.packet 0 == Seq.index (Seq.slice packet' 0 1) 0);\n Parse.putative_pn_offset_frame cid_len packet r.packet;\n if not is_short\n then BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 4 6;\n assert (Parse.putative_pn_offset cid_len r.packet == Parse.putative_pn_offset cid_len packet);\n ()\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 64 --max_fuel 1\"\n\nlet header_decrypt_aux_post_parse\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (packet: packet)\n: Lemma\n (requires (match header_decrypt_aux a hpk cid_len packet with\n | Some r ->\n Parse.H_Success? (Parse.parse_header cid_len last r.packet)\n | _ -> False\n ))\n (ensures (\n let Some r = header_decrypt_aux a hpk cid_len packet in\n let Parse.H_Success h rem' = Parse.parse_header cid_len last r.packet in\n Parse.header_len h <= Seq.length packet /\\\n Seq.length r.packet == Seq.length packet /\\\n Seq.length packet > 0 /\\ (\n r.is_short == MShort? h /\\\n r.is_retry == is_retry h /\\\n rem' `Seq.equal` Seq.slice packet (Parse.header_len h) (Seq.length packet) /\\ (\n if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\ (\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n pn_offset == Parse.pn_offset h /\\\n r.pn_offset == pn_offset /\\\n r.pn_len == Secret.v (pn_length h) - 1 /\\\n r.pn_offset + r.pn_len + 1 == Parse.header_len h /\\\n Seq.length rem' >= 16", "dependencies": { "source_file": "QUIC.Spec.Header.fst", "checked_file": "QUIC.Spec.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n cid_len: Prims.nat{cid_len <= 20} ->\n last: Prims.nat{last + 1 < Prims.pow2 62} ->\n packet: QUIC.Spec.Crypto.packet\n -> FStar.Pervasives.Lemma\n (requires\n ((match QUIC.Spec.Header.header_decrypt_aux a hpk cid_len packet with\n | FStar.Pervasives.Native.Some #_ r ->\n H_Success? (QUIC.Spec.Header.Parse.parse_header cid_len\n last\n (Mkheader_decrypt_aux_t?.packet r))\n | _ -> Prims.l_False)\n <:\n Type0))\n (ensures\n (let _ = QUIC.Spec.Header.header_decrypt_aux a hpk cid_len packet in\n (let FStar.Pervasives.Native.Some #_ r = _ in\n let _ =\n QUIC.Spec.Header.Parse.parse_header cid_len last (Mkheader_decrypt_aux_t?.packet r)\n in\n (let QUIC.Spec.Header.Parse.H_Success h rem' = _ in\n QUIC.Spec.Header.Base.header_len h <= FStar.Seq.Base.length packet /\\\n FStar.Seq.Base.length (Mkheader_decrypt_aux_t?.packet r) ==\n FStar.Seq.Base.length packet /\\ FStar.Seq.Base.length packet > 0 /\\\n (Mkheader_decrypt_aux_t?.is_short r == MShort? h) /\\\n (Mkheader_decrypt_aux_t?.is_retry r == QUIC.Spec.Header.Base.is_retry h) /\\\n FStar.Seq.Base.equal rem'\n (FStar.Seq.Base.slice packet\n (QUIC.Spec.Header.Base.header_len h)\n (FStar.Seq.Base.length packet)) /\\\n (match Mkheader_decrypt_aux_t?.is_retry r with\n | true -> Mkheader_decrypt_aux_t?.packet r == packet\n | _ ->\n Some? (QUIC.Spec.Header.Parse.putative_pn_offset cid_len packet) /\\\n (let _ = QUIC.Spec.Header.Parse.putative_pn_offset cid_len packet in\n (let FStar.Pervasives.Native.Some #_ pn_offset = _ in\n pn_offset == QUIC.Spec.Header.Parse.pn_offset h /\\\n Mkheader_decrypt_aux_t?.pn_offset r == pn_offset /\\\n Mkheader_decrypt_aux_t?.pn_len r ==\n QUIC.Secret.Int.Base.v (QUIC.Spec.Header.Base.pn_length h) - 1 /\\\n Mkheader_decrypt_aux_t?.pn_offset r + Mkheader_decrypt_aux_t?.pn_len r + 1 ==\n QUIC.Spec.Header.Base.header_len h /\\ FStar.Seq.Base.length rem' >= 16)\n <:\n Prims.logical)))\n <:\n Type0)\n <:\n Type0))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "Prims.op_Addition", "Prims.pow2", "QUIC.Spec.Crypto.packet", "QUIC.Spec.Header.header_decrypt_aux_t", "QUIC.Spec.Header.Base.header", "QUIC.Spec.Base.bytes", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__is_retry", "Prims.bool", "QUIC.Spec.Header.Parse.putative_pn_offset_frame", "QUIC.Spec.Header.Parse.format_header", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__packet", "Prims.unit", "QUIC.Spec.Header.Parse.putative_pn_offset_correct", "FStar.Pervasives.Native.option", "Prims.l_True", "Prims.l_and", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "QUIC.Spec.Base.header_len_bound", "QUIC.Spec.Header.Parse.putative_pn_offset", "QUIC.Spec.Header.Parse.format_header_pn_length", "Prims._assert", "Prims.eq2", "QUIC.Spec.Header.Base.is_retry", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__is_short", "QUIC.Spec.Header.Base.uu___is_MShort", "QUIC.Spec.Header.Parse.format_header_is_retry", "QUIC.Spec.Header.Parse.format_header_is_short", "QUIC.Spec.Header.Parse.lemma_header_parsing_post", "QUIC.Spec.Header.Parse.h_result", "QUIC.Spec.Header.Base.is_valid_header", "FStar.Seq.Base.equal", "FStar.Seq.Base.slice", "Prims.op_Subtraction", "QUIC.Spec.Header.Parse.parse_header", "QUIC.Spec.Header.header_decrypt_aux", "QUIC.Spec.Header.header_decrypt_aux_post", "QUIC.Spec.Header.Parse.uu___is_H_Success", "Prims.l_False", "Prims.squash", "QUIC.Spec.Header.Base.header_len", "Prims.op_GreaterThan", "FStar.Pervasives.Native.uu___is_Some", "QUIC.Spec.Header.Parse.pn_offset", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__pn_offset", "Prims.int", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__pn_len", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "QUIC.Spec.Header.Base.pn_length", "Prims.op_GreaterThanOrEqual", "Prims.logical", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_decrypt_aux_post_parse\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (last: nat{last + 1 < pow2 62})\n (packet: packet)\n : Lemma\n (requires\n (match header_decrypt_aux a hpk cid_len packet with\n | Some r -> Parse.H_Success? (Parse.parse_header cid_len last r.packet)\n | _ -> False))\n (ensures\n (let Some r = header_decrypt_aux a hpk cid_len packet in\n let Parse.H_Success h rem' = Parse.parse_header cid_len last r.packet in\n Parse.header_len h <= Seq.length packet /\\ Seq.length r.packet == Seq.length packet /\\\n Seq.length packet > 0 /\\\n (r.is_short == MShort? h /\\ r.is_retry == is_retry h /\\\n rem' `Seq.equal` (Seq.slice packet (Parse.header_len h) (Seq.length packet)) /\\\n (if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\\n (let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n pn_offset == Parse.pn_offset h /\\ r.pn_offset == pn_offset /\\\n r.pn_len == Secret.v (pn_length h) - 1 /\\\n r.pn_offset + r.pn_len + 1 == Parse.header_len h /\\ Seq.length rem' >= 16)))))\nlet header_decrypt_aux_post_parse\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (last: nat{last + 1 < pow2 62})\n (packet: packet)\n : Lemma\n (requires\n (match header_decrypt_aux a hpk cid_len packet with\n | Some r -> Parse.H_Success? (Parse.parse_header cid_len last r.packet)\n | _ -> False))\n (ensures\n (let Some r = header_decrypt_aux a hpk cid_len packet in\n let Parse.H_Success h rem' = Parse.parse_header cid_len last r.packet in\n Parse.header_len h <= Seq.length packet /\\ Seq.length r.packet == Seq.length packet /\\\n Seq.length packet > 0 /\\\n (r.is_short == MShort? h /\\ r.is_retry == is_retry h /\\\n rem' `Seq.equal` (Seq.slice packet (Parse.header_len h) (Seq.length packet)) /\\\n (if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\\n (let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n pn_offset == Parse.pn_offset h /\\ r.pn_offset == pn_offset /\\\n r.pn_len == Secret.v (pn_length h) - 1 /\\\n r.pn_offset + r.pn_len + 1 == Parse.header_len h /\\ Seq.length rem' >= 16))))) =", "completed_definiton": "header_decrypt_aux_post a hpk cid_len packet;\nlet Some r = header_decrypt_aux a hpk cid_len packet in\nlet Parse.H_Success h rem' = Parse.parse_header cid_len last r.packet in\nParse.lemma_header_parsing_post cid_len last r.packet;\nParse.format_header_is_short h;\nParse.format_header_is_retry h;\nassert (r.is_short == MShort? h);\nassert (r.is_retry == is_retry h);\nif r.is_retry\nthen ()\nelse\n (Parse.format_header_pn_length h;\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n Parse.putative_pn_offset_correct h cid_len;\n Parse.putative_pn_offset_frame cid_len (Parse.format_header h) r.packet)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.fst", "name": "QUIC.Spec.Header.lemma_header_encryption_correct", "original_source_type": "val lemma_header_encryption_correct:\n a:ea ->\n k: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n h:header ->\n cid_len: nat { cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h) } ->\n last: nat { last + 1 < pow2 62 /\\ ((~ (is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) last (Secret.v (packet_number h))) } ->\n c: cbytes' (is_retry h) { has_payload_length h ==> Secret.v (payload_length h) == Seq.length c } ->\n Lemma (\n header_decrypt a k cid_len last (header_encrypt a k h c)\n == H_Success h c Seq.empty)", "source_type": "val lemma_header_encryption_correct:\n a:ea ->\n k: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n h:header ->\n cid_len: nat { cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h) } ->\n last: nat { last + 1 < pow2 62 /\\ ((~ (is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) last (Secret.v (packet_number h))) } ->\n c: cbytes' (is_retry h) { has_payload_length h ==> Secret.v (payload_length h) == Seq.length c } ->\n Lemma (\n header_decrypt a k cid_len last (header_encrypt a k h c)\n == H_Success h c Seq.empty)", "source_definition": "let lemma_header_encryption_correct\n a k h cid_len last c\n=\n lemma_header_encryption_correct_aux a k h cid_len c;\n Parse.lemma_header_parsing_correct h c cid_len last", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 430, "start_col": 1, "end_line": 431, "end_col": 52 }, "file_context": "module QUIC.Spec.Header\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Parse = QUIC.Spec.Header.Parse\n\nmodule AEAD = Spec.Agile.AEAD\nmodule Cipher = Spec.Agile.Cipher\nmodule Lemmas = QUIC.Spec.Lemmas\n\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: GTot (Seq.lseq Secret.uint8 16) =\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (Seq.seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (Seq.seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n(*\nDecryption of packet number\npacket[pn_offset..pn_offset+4] ^= pn_mask &\n match pn_len with\n | 0 -> mask & 0xFF000000\n | 1 -> mask & 0xFFFF0000\n | 2 -> mask & 0xFFFFFF00\n | 3 -> mask & 0xFFFFFFFF\n*)\nlet pn_sizemask' (pn_len: nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet pn_sizemask (pn_len: nat { pn_len < 4 }) : Tot (lbytes (pn_len + 1)) =\n Seq.slice (pn_sizemask' pn_len) 0 (pn_len + 1)\n\nlet header_encrypt\n a hpk h c\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\nlet header_encrypt_post\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n (cid_len: nat { cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h) })\n: Lemma (\n let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let z = header_encrypt a hpk h c in\n Parse.header_len h + Seq.length c == Seq.length z /\\\n Seq.slice z (Parse.header_len h) (Seq.length z) `Seq.equal` c /\\\n MShort? h == (BF.get_bitfield (U8.v (Seq.index z 0)) 7 8 = 0) /\\\n is_retry h == (not (MShort? h) && BF.get_bitfield (U8.v (Seq.index z 0)) 4 6 = 3) /\\ (\n if is_retry h\n then z == y\n else Parse.putative_pn_offset cid_len z == Some (Parse.pn_offset h)\n ))\n= Parse.format_header_is_short h;\n Parse.format_header_is_retry h;\n if is_retry h\n then ()\n else begin\n Parse.format_header_pn_length h;\n let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index y 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let bf = BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits bf in\n let r = Lemmas.xor_inplace y pnmask pn_offset in\n let z = header_encrypt a hpk h c in\n assert (z == Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)));\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset 0 1;\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset 1 pn_offset;\n assert (pn_offset > 0);\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset (Parse.header_len h) (Seq.length y);\n assert (Seq.slice z (Parse.header_len h) (Seq.length z) `Seq.equal` Seq.slice y (Parse.header_len h) (Seq.length y));\n assert (U8.uint_to_t f' == Seq.index (Seq.slice z 0 1) 0);\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 7 8;\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf protected_bits 8;\n if MLong? h\n then BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 4 6;\n Parse.putative_pn_offset_correct h cid_len;\n Parse.putative_pn_offset_frame cid_len x y;\n Parse.putative_pn_offset_frame cid_len y z;\n ()\n end\n\n#pop-options\n\nlet header_encrypt_length\n a hpk h c\n=\n header_encrypt_post a hpk h c (dcid_len h)\n\nnoextract\ntype header_decrypt_aux_t = {\n is_short: bool;\n is_retry: (is_retry: bool { is_retry ==> ~ (is_short) });\n packet: packet;\n pn_offset: (if is_retry then unit else nat);\n pn_len: (if is_retry then unit else (pn_len: nat {pn_len < 4 /\\ pn_offset + pn_len + 1 <= Seq.length packet}));\n}\n\nlet header_decrypt_aux\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: GTot (option header_decrypt_aux_t)\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n is_short = is_short;\n is_retry = is_retry;\n packet = packet;\n pn_offset = ();\n pn_len = ();\n })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset+16)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n is_short = is_short;\n is_retry = is_retry;\n packet = packet'';\n pn_offset = pn_offset;\n pn_len = pn_len;\n })\n end\n\n#push-options \"--z3rlimit 64 --max_fuel 1\"\n\n#restart-solver\n\nlet header_decrypt_aux_post\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Lemma\n (requires (Some? (header_decrypt_aux a hpk cid_len packet)))\n (ensures (\n Some? (header_decrypt_aux a hpk cid_len packet) /\\ (\n let Some r = header_decrypt_aux a hpk cid_len packet in\n Seq.length r.packet == Seq.length packet /\\\n Seq.length packet > 0 /\\ (\n let f' = Seq.index r.packet 0 in\n r.is_short == (BF.get_bitfield (U8.v f') 7 8 = 0) /\\\n r.is_retry == (not r.is_short && (BF.get_bitfield (U8.v f') 4 6 = 3)) /\\ (\n if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\\n Parse.putative_pn_offset cid_len r.packet == Parse.putative_pn_offset cid_len packet /\\ (\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n r.pn_offset == pn_offset /\\\n r.pn_offset + 20 <= Seq.length r.packet /\\\n r.pn_len == BF.get_bitfield (U8.v f') 0 2 /\\\n r.pn_offset + r.pn_len + 1 <= Seq.length r.packet /\\\n Seq.slice r.packet (r.pn_offset + r.pn_len + 1) (Seq.length r.packet) `Seq.equal` Seq.slice packet (r.pn_offset + r.pn_len + 1) (Seq.length packet) /\\\n True\n ))))))\n=let Some r = header_decrypt_aux a hpk cid_len packet in\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then ()\n else begin\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n let sample_offset = pn_offset + 4 in\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset+16)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let bf = BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits bf in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n assert (r.packet == Lemmas.xor_inplace packet' pnmask pn_offset);\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset 0 1;\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset 1 pn_offset;\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset (pn_offset + pn_len + 1) (Seq.length packet);\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf protected_bits 8;\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 7 8;\n assert (Seq.index r.packet 0 == Seq.index (Seq.slice packet' 0 1) 0);\n Parse.putative_pn_offset_frame cid_len packet r.packet;\n if not is_short\n then BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 4 6;\n assert (Parse.putative_pn_offset cid_len r.packet == Parse.putative_pn_offset cid_len packet);\n ()\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 64 --max_fuel 1\"\n\nlet header_decrypt_aux_post_parse\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (packet: packet)\n: Lemma\n (requires (match header_decrypt_aux a hpk cid_len packet with\n | Some r ->\n Parse.H_Success? (Parse.parse_header cid_len last r.packet)\n | _ -> False\n ))\n (ensures (\n let Some r = header_decrypt_aux a hpk cid_len packet in\n let Parse.H_Success h rem' = Parse.parse_header cid_len last r.packet in\n Parse.header_len h <= Seq.length packet /\\\n Seq.length r.packet == Seq.length packet /\\\n Seq.length packet > 0 /\\ (\n r.is_short == MShort? h /\\\n r.is_retry == is_retry h /\\\n rem' `Seq.equal` Seq.slice packet (Parse.header_len h) (Seq.length packet) /\\ (\n if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\ (\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n pn_offset == Parse.pn_offset h /\\\n r.pn_offset == pn_offset /\\\n r.pn_len == Secret.v (pn_length h) - 1 /\\\n r.pn_offset + r.pn_len + 1 == Parse.header_len h /\\\n Seq.length rem' >= 16\n )))))\n= header_decrypt_aux_post a hpk cid_len packet;\n let Some r = header_decrypt_aux a hpk cid_len packet in\n let Parse.H_Success h rem' = Parse.parse_header cid_len last r.packet in\n Parse.lemma_header_parsing_post cid_len last r.packet;\n Parse.format_header_is_short h;\n Parse.format_header_is_retry h;\n assert (r.is_short == MShort? h);\n assert (r.is_retry == is_retry h);\n if r.is_retry\n then\n ()\n else begin\n Parse.format_header_pn_length h;\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n Parse.putative_pn_offset_correct h cid_len;\n Parse.putative_pn_offset_frame cid_len (Parse.format_header h) r.packet\n end\n\n#pop-options\n\nlet max (a: nat) (b: nat) : Tot (c: nat { c >= a /\\ c >= b /\\ (c <= a \\/ c <= b) }) = if a <= b then b else a\nlet min (a: nat) (b: nat) : Tot (c: nat { c <= a /\\ c <= b /\\ (c >= a \\/ c >= b) }) = if b <= a then b else a\n\n#push-options \"--z3rlimit 256\"\n\n#restart-solver\n\nlet header_decrypt\n a hpk cid_len last packet\n=\n let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then H_Failure\n else\n match header_decrypt_aux a hpk cid_len packet with\n | None -> H_Failure\n | Some r ->\n let packet'' = r.packet in\n begin match Parse.parse_header cid_len last packet'' with\n | Parse.H_Failure -> H_Failure\n | Parse.H_Success h rem' ->\n header_decrypt_aux_post_parse a hpk cid_len last packet;\n if is_retry h\n then\n H_Success h Seq.empty rem'\n else\n let clen = if has_payload_length h then Secret.v (payload_length h) else Seq.length rem' in\n assert_norm (16 < max_cipher_length - 1);\n (* payload_length is secret, so, to stay constant-time, we\n must not check for failure. Instead, we compute some length\n that might be garbage if bounds on payload_length do not hold. *)\n let clen = max (min (min clen (Seq.length rem')) (max_cipher_length - 1)) 16 in\n assert (clen < max_cipher_length);\n assert (clen <= Seq.length rem');\n assert (16 <= clen);\n let c = Seq.slice rem' 0 clen in\n let rem = Seq.slice rem' clen (Seq.length rem') in\n H_Success h c rem\n end\n\nlet lemma_header_encryption_correct_aux\n (a:ea)\n (k: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h:header)\n (cid_len: nat { cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h) })\n (c: cbytes' (is_retry h))\n: Lemma\n (let r' = header_decrypt_aux a k cid_len (header_encrypt a k h c) in\n Some? r' /\\ (\n let Some r = r' in\n r.packet `Seq.equal` (Parse.format_header h `Seq.append` c) /\\\n r.is_short == MShort? h /\\\n r.is_retry == is_retry h /\\\n ((~ (is_retry h)) ==> ((r.pn_offset <: nat) == Parse.pn_offset h /\\ r.pn_len == Secret.v (pn_length h) - 1))\n ))\n= header_encrypt_post a k h c cid_len;\n header_decrypt_aux_post a k cid_len (header_encrypt a k h c);\n if is_retry h\n then\n ()\n else begin\n let format = Parse.format_header h `Seq.append` c in\n let packet = header_encrypt a k h c in\n let Some r = header_decrypt_aux a k cid_len packet in\n Parse.putative_pn_offset_correct h cid_len;\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample' = Seq.slice c (3-pn_len) (19-pn_len) in\n assert (sample' `Seq.equal` Seq.slice packet (pn_offset + 4) (pn_offset + 20));\n let sample = Seq.seq_hide sample' in\n assert ((r.pn_offset <: nat) == pn_offset);\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) k sample) in\n let protected_bits = if MShort? h then 5 else 4 in\n assert (protected_bits == (if r.is_short then 5 else 4));\n let f = Seq.index format 0 in\n let pb_value = BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits in\n let f0 = BF.set_bitfield (U8.v f) 0 protected_bits pb_value in\n assert (U8.uint_to_t f0 == Seq.index packet 0);\n let pb_value' = BF.get_bitfield (f0 `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits in\n let f1 = BF.set_bitfield f0 0 protected_bits pb_value' in\n let packet1 = Seq.cons (U8.uint_to_t f1) (Seq.slice packet 1 (Seq.length packet)) in\n let pnmask' = Lemmas.and_inplace (Seq.slice mask 1 (r.pn_len + 2)) (pn_sizemask r.pn_len) 0 in\n assert (r.packet == Lemmas.xor_inplace packet1 pnmask' pn_offset);\n Lemmas.pointwise_op_slice_other U8.logxor packet1 pnmask' pn_offset 0 1;\n assert (Seq.index r.packet 0 == Seq.index (Seq.slice r.packet 0 1) 0);\n assert (Seq.index r.packet 0 == U8.uint_to_t f1);\n BF.get_bitfield_logxor (U8.v f) (U8.v (Seq.index mask 0)) 0 protected_bits;\n BF.get_bitfield_set_bitfield_same (U8.v f) 0 protected_bits pb_value;\n BF.get_bitfield_logxor (f0) (U8.v (Seq.index mask 0)) 0 protected_bits;\n BF.get_bitfield_set_bitfield_same (f0) 0 protected_bits pb_value';\n FStar.UInt.logxor_inv (BF.get_bitfield (U8.v f) 0 protected_bits) (BF.get_bitfield (U8.v (Seq.index mask 0)) 0 protected_bits);\n assert (BF.get_bitfield (U8.v f) 0 protected_bits == BF.get_bitfield f1 0 protected_bits);\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits pb_value protected_bits 8;\n BF.get_bitfield_set_bitfield_other (f0) 0 protected_bits pb_value' protected_bits 8;\n BF.get_bitfield_partition_2 protected_bits (U8.v f) f1;\n assert (f == U8.uint_to_t f1);\n Parse.format_header_pn_length h;\n assert ((r.pn_len <: nat) == pn_len);\n assert (pnmask' == Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0);\n Lemmas.xor_inplace_involutive format pnmask' pn_offset;\n let packet0 = Lemmas.xor_inplace format pnmask' pn_offset in\n Lemmas.pointwise_op_slice_other U8.logxor format pnmask' pn_offset 0 1;\n assert (Seq.index packet0 0 == Seq.index (Seq.slice format 0 1) 0);\n assert (packet == Seq.cons (U8.uint_to_t f0) (Seq.slice packet0 1 (Seq.length packet0)));\n assert (packet1 `Seq.equal` Seq.cons (U8.uint_to_t f1) (Seq.slice packet0 1 (Seq.length packet0)));\n assert (packet1 `Seq.equal` packet0);\n assert (r.packet `Seq.equal` format);\n ()\n end\n\nlet lemma_header_encryption_correct\n a k h cid_len last c", "dependencies": { "source_file": "QUIC.Spec.Header.fst", "checked_file": "QUIC.Spec.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 256, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n k: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n h: QUIC.Spec.Header.Base.header ->\n cid_len: Prims.nat{cid_len <= 20 /\\ (MShort? h ==> cid_len == QUIC.Spec.Header.Base.dcid_len h)} ->\n last:\n Prims.nat\n { last + 1 < Prims.pow2 62 /\\\n (~(QUIC.Spec.Header.Base.is_retry h) ==>\n QUIC.Spec.PacketNumber.Base.in_window (QUIC.Secret.Int.Base.v (QUIC.Spec.Header.Base.pn_length\n h) -\n 1)\n last\n (QUIC.Secret.Int.Base.v (QUIC.Spec.Header.Base.packet_number h))) } ->\n c:\n QUIC.Spec.Crypto.cbytes' (QUIC.Spec.Header.Base.is_retry h)\n { QUIC.Spec.Header.Base.has_payload_length h ==>\n QUIC.Secret.Int.Base.v (QUIC.Spec.Header.Base.payload_length h) == FStar.Seq.Base.length c\n }\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Spec.Header.header_decrypt a k cid_len last (QUIC.Spec.Header.header_encrypt a k h c) ==\n QUIC.Spec.Header.H_Success h c FStar.Seq.Base.empty)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "QUIC.Spec.Header.Base.header", "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.l_imp", "QUIC.Spec.Header.Base.uu___is_MShort", "Prims.eq2", "QUIC.Spec.Header.Base.dcid_len", "Prims.op_LessThan", "Prims.op_Addition", "Prims.pow2", "Prims.l_not", "QUIC.Spec.Header.Base.is_retry", "QUIC.Spec.PacketNumber.Base.in_window", "Prims.op_Subtraction", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "QUIC.Spec.Header.Base.pn_length", "Lib.IntTypes.U64", "QUIC.Spec.Header.Base.packet_number", "QUIC.Spec.Crypto.cbytes'", "QUIC.Spec.Header.Base.has_payload_length", "Prims.int", "Prims.l_or", "Lib.IntTypes.range", "Prims.op_GreaterThanOrEqual", "QUIC.Spec.Header.Base.payload_length", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "QUIC.Spec.Header.Parse.lemma_header_parsing_correct", "Prims.unit", "QUIC.Spec.Header.lemma_header_encryption_correct_aux" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_header_encryption_correct:\n a:ea ->\n k: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n h:header ->\n cid_len: nat { cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h) } ->\n last: nat { last + 1 < pow2 62 /\\ ((~ (is_retry h)) ==> PN.in_window (Secret.v (pn_length h) - 1) last (Secret.v (packet_number h))) } ->\n c: cbytes' (is_retry h) { has_payload_length h ==> Secret.v (payload_length h) == Seq.length c } ->\n Lemma (\n header_decrypt a k cid_len last (header_encrypt a k h c)\n == H_Success h c Seq.empty)\nlet lemma_header_encryption_correct a k h cid_len last c =", "completed_definiton": "lemma_header_encryption_correct_aux a k h cid_len c;\nParse.lemma_header_parsing_correct h c cid_len last", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.fst", "name": "QUIC.Spec.Header.header_encrypt_post", "original_source_type": "val header_encrypt_post\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n (cid_len: nat{cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h)})\n : Lemma\n (let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let z = header_encrypt a hpk h c in\n Parse.header_len h + Seq.length c == Seq.length z /\\\n (Seq.slice z (Parse.header_len h) (Seq.length z)) `Seq.equal` c /\\\n MShort? h == (BF.get_bitfield (U8.v (Seq.index z 0)) 7 8 = 0) /\\\n is_retry h == (not (MShort? h) && BF.get_bitfield (U8.v (Seq.index z 0)) 4 6 = 3) /\\\n (if is_retry h then z == y else Parse.putative_pn_offset cid_len z == Some (Parse.pn_offset h)\n ))", "source_type": "val header_encrypt_post\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n (cid_len: nat{cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h)})\n : Lemma\n (let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let z = header_encrypt a hpk h c in\n Parse.header_len h + Seq.length c == Seq.length z /\\\n (Seq.slice z (Parse.header_len h) (Seq.length z)) `Seq.equal` c /\\\n MShort? h == (BF.get_bitfield (U8.v (Seq.index z 0)) 7 8 = 0) /\\\n is_retry h == (not (MShort? h) && BF.get_bitfield (U8.v (Seq.index z 0)) 4 6 = 3) /\\\n (if is_retry h then z == y else Parse.putative_pn_offset cid_len z == Some (Parse.pn_offset h)\n ))", "source_definition": "let header_encrypt_post\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n (cid_len: nat { cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h) })\n: Lemma (\n let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let z = header_encrypt a hpk h c in\n Parse.header_len h + Seq.length c == Seq.length z /\\\n Seq.slice z (Parse.header_len h) (Seq.length z) `Seq.equal` c /\\\n MShort? h == (BF.get_bitfield (U8.v (Seq.index z 0)) 7 8 = 0) /\\\n is_retry h == (not (MShort? h) && BF.get_bitfield (U8.v (Seq.index z 0)) 4 6 = 3) /\\ (\n if is_retry h\n then z == y\n else Parse.putative_pn_offset cid_len z == Some (Parse.pn_offset h)\n ))\n= Parse.format_header_is_short h;\n Parse.format_header_is_retry h;\n if is_retry h\n then ()\n else begin\n Parse.format_header_pn_length h;\n let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index y 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let bf = BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits bf in\n let r = Lemmas.xor_inplace y pnmask pn_offset in\n let z = header_encrypt a hpk h c in\n assert (z == Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)));\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset 0 1;\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset 1 pn_offset;\n assert (pn_offset > 0);\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset (Parse.header_len h) (Seq.length y);\n assert (Seq.slice z (Parse.header_len h) (Seq.length z) `Seq.equal` Seq.slice y (Parse.header_len h) (Seq.length y));\n assert (U8.uint_to_t f' == Seq.index (Seq.slice z 0 1) 0);\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 7 8;\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf protected_bits 8;\n if MLong? h\n then BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 4 6;\n Parse.putative_pn_offset_correct h cid_len;\n Parse.putative_pn_offset_frame cid_len x y;\n Parse.putative_pn_offset_frame cid_len y z;\n ()\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 95, "start_col": 2, "end_line": 129, "end_col": 5 }, "file_context": "module QUIC.Spec.Header\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Parse = QUIC.Spec.Header.Parse\n\nmodule AEAD = Spec.Agile.AEAD\nmodule Cipher = Spec.Agile.Cipher\nmodule Lemmas = QUIC.Spec.Lemmas\n\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: GTot (Seq.lseq Secret.uint8 16) =\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (Seq.seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (Seq.seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n(*\nDecryption of packet number\npacket[pn_offset..pn_offset+4] ^= pn_mask &\n match pn_len with\n | 0 -> mask & 0xFF000000\n | 1 -> mask & 0xFFFF0000\n | 2 -> mask & 0xFFFFFF00\n | 3 -> mask & 0xFFFFFFFF\n*)\nlet pn_sizemask' (pn_len: nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet pn_sizemask (pn_len: nat { pn_len < 4 }) : Tot (lbytes (pn_len + 1)) =\n Seq.slice (pn_sizemask' pn_len) 0 (pn_len + 1)\n\nlet header_encrypt\n a hpk h c\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\nlet header_encrypt_post\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n (cid_len: nat { cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h) })\n: Lemma (\n let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let z = header_encrypt a hpk h c in\n Parse.header_len h + Seq.length c == Seq.length z /\\\n Seq.slice z (Parse.header_len h) (Seq.length z) `Seq.equal` c /\\\n MShort? h == (BF.get_bitfield (U8.v (Seq.index z 0)) 7 8 = 0) /\\\n is_retry h == (not (MShort? h) && BF.get_bitfield (U8.v (Seq.index z 0)) 4 6 = 3) /\\ (\n if is_retry h\n then z == y\n else Parse.putative_pn_offset cid_len z == Some (Parse.pn_offset h)", "dependencies": { "source_file": "QUIC.Spec.Header.fst", "checked_file": "QUIC.Spec.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 256, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n h: QUIC.Spec.Header.Base.header ->\n c: QUIC.Spec.Crypto.cbytes' (QUIC.Spec.Header.Base.is_retry h) ->\n cid_len: Prims.nat{cid_len <= 20 /\\ (MShort? h ==> cid_len == QUIC.Spec.Header.Base.dcid_len h)}\n -> FStar.Pervasives.Lemma\n (ensures\n (let x = QUIC.Spec.Header.Parse.format_header h in\n let y = FStar.Seq.Base.append x c in\n let z = QUIC.Spec.Header.header_encrypt a hpk h c in\n QUIC.Spec.Header.Base.header_len h + FStar.Seq.Base.length c == FStar.Seq.Base.length z /\\\n FStar.Seq.Base.equal (FStar.Seq.Base.slice z\n (QUIC.Spec.Header.Base.header_len h)\n (FStar.Seq.Base.length z))\n c /\\\n MShort? h ==\n (LowParse.BitFields.get_bitfield (FStar.UInt8.v (FStar.Seq.Base.index z 0)) 7 8 = 0) /\\\n QUIC.Spec.Header.Base.is_retry h ==\n (Prims.op_Negation (MShort? h) &&\n LowParse.BitFields.get_bitfield (FStar.UInt8.v (FStar.Seq.Base.index z 0)) 4 6 = 3) /\\\n (match QUIC.Spec.Header.Base.is_retry h with\n | true -> z == y\n | _ ->\n QUIC.Spec.Header.Parse.putative_pn_offset cid_len z ==\n FStar.Pervasives.Native.Some (QUIC.Spec.Header.Parse.pn_offset h))))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "QUIC.Spec.Header.Base.header", "QUIC.Spec.Crypto.cbytes'", "QUIC.Spec.Header.Base.is_retry", "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.l_imp", "QUIC.Spec.Header.Base.uu___is_MShort", "Prims.eq2", "QUIC.Spec.Header.Base.dcid_len", "Prims.bool", "Prims.unit", "QUIC.Spec.Header.Parse.putative_pn_offset_frame", "QUIC.Spec.Header.Parse.putative_pn_offset_correct", "QUIC.Spec.Header.Base.uu___is_MLong", "LowParse.BitFields.get_bitfield_set_bitfield_other", "FStar.UInt8.n", "FStar.UInt8.v", "Prims._assert", "FStar.UInt8.t", "FStar.UInt8.uint_to_t", "FStar.Seq.Base.index", "QUIC.Spec.Base.byte", "FStar.Seq.Base.slice", "FStar.Seq.Base.equal", "QUIC.Spec.Header.Base.header_len", "FStar.Seq.Base.length", "QUIC.Spec.Lemmas.pointwise_op_slice_other", "FStar.UInt8.logxor", "Prims.op_GreaterThan", "FStar.Seq.Base.seq", "FStar.Seq.Properties.cons", "QUIC.Spec.Crypto.packet", "QUIC.Spec.Header.header_encrypt", "QUIC.Spec.Base.bytes", "QUIC.Spec.Lemmas.xor_inplace", "FStar.UInt.uint_t", "LowParse.BitFields.set_bitfield", "LowParse.BitFields.ubitfield", "Prims.op_Subtraction", "LowParse.BitFields.get_bitfield", "FStar.UInt.logxor", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.PUB", "QUIC.Spec.Lemmas.and_inplace", "Prims.op_Addition", "QUIC.Spec.Header.pn_sizemask", "Lib.IntTypes.int_t", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.SEC", "QUIC.Spec.Header.block_of_sample", "QUIC.Secret.Seq.seq_hide", "Prims.int", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "QUIC.Spec.Header.Base.pn_length", "Prims.op_LessThan", "Lib.IntTypes.v", "QUIC.Spec.Header.Parse.pn_offset", "FStar.Seq.Base.append", "QUIC.Spec.Base.lbytes", "QUIC.Spec.Header.Parse.format_header", "QUIC.Spec.Header.Parse.format_header_pn_length", "QUIC.Spec.Header.Parse.format_header_is_retry", "QUIC.Spec.Header.Parse.format_header_is_short", "Prims.l_True", "Prims.squash", "Prims.op_Equality", "Prims.op_AmpAmp", "Prims.op_Negation", "FStar.Pervasives.Native.option", "QUIC.Spec.Header.Parse.putative_pn_offset", "FStar.Pervasives.Native.Some", "Prims.logical", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_encrypt_post\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n (cid_len: nat{cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h)})\n : Lemma\n (let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let z = header_encrypt a hpk h c in\n Parse.header_len h + Seq.length c == Seq.length z /\\\n (Seq.slice z (Parse.header_len h) (Seq.length z)) `Seq.equal` c /\\\n MShort? h == (BF.get_bitfield (U8.v (Seq.index z 0)) 7 8 = 0) /\\\n is_retry h == (not (MShort? h) && BF.get_bitfield (U8.v (Seq.index z 0)) 4 6 = 3) /\\\n (if is_retry h then z == y else Parse.putative_pn_offset cid_len z == Some (Parse.pn_offset h)\n ))\nlet header_encrypt_post\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n (cid_len: nat{cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h)})\n : Lemma\n (let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let z = header_encrypt a hpk h c in\n Parse.header_len h + Seq.length c == Seq.length z /\\\n (Seq.slice z (Parse.header_len h) (Seq.length z)) `Seq.equal` c /\\\n MShort? h == (BF.get_bitfield (U8.v (Seq.index z 0)) 7 8 = 0) /\\\n is_retry h == (not (MShort? h) && BF.get_bitfield (U8.v (Seq.index z 0)) 4 6 = 3) /\\\n (if is_retry h then z == y else Parse.putative_pn_offset cid_len z == Some (Parse.pn_offset h)\n )) =", "completed_definiton": "Parse.format_header_is_short h;\nParse.format_header_is_retry h;\nif is_retry h\nthen ()\nelse\n (Parse.format_header_pn_length h;\n let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3 - pn_len) (19 - pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index y 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let bf =\n BF.get_bitfield ((U8.v f) `FStar.UInt.logxor` (U8.v (Seq.index mask 0))) 0 protected_bits\n in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits bf in\n let r = Lemmas.xor_inplace y pnmask pn_offset in\n let z = header_encrypt a hpk h c in\n assert (z == Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)));\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset 0 1;\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset 1 pn_offset;\n assert (pn_offset > 0);\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset (Parse.header_len h) (Seq.length y);\n assert ((Seq.slice z (Parse.header_len h) (Seq.length z))\n `Seq.equal`\n (Seq.slice y (Parse.header_len h) (Seq.length y)));\n assert (U8.uint_to_t f' == Seq.index (Seq.slice z 0 1) 0);\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 7 8;\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf protected_bits 8;\n if MLong? h then BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 4 6;\n Parse.putative_pn_offset_correct h cid_len;\n Parse.putative_pn_offset_frame cid_len x y;\n Parse.putative_pn_offset_frame cid_len y z;\n ())", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.fst", "name": "QUIC.Spec.Header.lemma_header_encryption_correct_aux", "original_source_type": "val lemma_header_encryption_correct_aux\n (a: ea)\n (k: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (cid_len: nat{cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h)})\n (c: cbytes' (is_retry h))\n : Lemma\n (let r' = header_decrypt_aux a k cid_len (header_encrypt a k h c) in\n Some? r' /\\\n (let Some r = r' in\n r.packet `Seq.equal` ((Parse.format_header h) `Seq.append` c) /\\ r.is_short == MShort? h /\\\n r.is_retry == is_retry h /\\\n ((~(is_retry h)) ==>\n ((r.pn_offset <: nat) == Parse.pn_offset h /\\ r.pn_len == Secret.v (pn_length h) - 1))))", "source_type": "val lemma_header_encryption_correct_aux\n (a: ea)\n (k: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (cid_len: nat{cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h)})\n (c: cbytes' (is_retry h))\n : Lemma\n (let r' = header_decrypt_aux a k cid_len (header_encrypt a k h c) in\n Some? r' /\\\n (let Some r = r' in\n r.packet `Seq.equal` ((Parse.format_header h) `Seq.append` c) /\\ r.is_short == MShort? h /\\\n r.is_retry == is_retry h /\\\n ((~(is_retry h)) ==>\n ((r.pn_offset <: nat) == Parse.pn_offset h /\\ r.pn_len == Secret.v (pn_length h) - 1))))", "source_definition": "let lemma_header_encryption_correct_aux\n (a:ea)\n (k: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h:header)\n (cid_len: nat { cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h) })\n (c: cbytes' (is_retry h))\n: Lemma\n (let r' = header_decrypt_aux a k cid_len (header_encrypt a k h c) in\n Some? r' /\\ (\n let Some r = r' in\n r.packet `Seq.equal` (Parse.format_header h `Seq.append` c) /\\\n r.is_short == MShort? h /\\\n r.is_retry == is_retry h /\\\n ((~ (is_retry h)) ==> ((r.pn_offset <: nat) == Parse.pn_offset h /\\ r.pn_len == Secret.v (pn_length h) - 1))\n ))\n= header_encrypt_post a k h c cid_len;\n header_decrypt_aux_post a k cid_len (header_encrypt a k h c);\n if is_retry h\n then\n ()\n else begin\n let format = Parse.format_header h `Seq.append` c in\n let packet = header_encrypt a k h c in\n let Some r = header_decrypt_aux a k cid_len packet in\n Parse.putative_pn_offset_correct h cid_len;\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample' = Seq.slice c (3-pn_len) (19-pn_len) in\n assert (sample' `Seq.equal` Seq.slice packet (pn_offset + 4) (pn_offset + 20));\n let sample = Seq.seq_hide sample' in\n assert ((r.pn_offset <: nat) == pn_offset);\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) k sample) in\n let protected_bits = if MShort? h then 5 else 4 in\n assert (protected_bits == (if r.is_short then 5 else 4));\n let f = Seq.index format 0 in\n let pb_value = BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits in\n let f0 = BF.set_bitfield (U8.v f) 0 protected_bits pb_value in\n assert (U8.uint_to_t f0 == Seq.index packet 0);\n let pb_value' = BF.get_bitfield (f0 `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits in\n let f1 = BF.set_bitfield f0 0 protected_bits pb_value' in\n let packet1 = Seq.cons (U8.uint_to_t f1) (Seq.slice packet 1 (Seq.length packet)) in\n let pnmask' = Lemmas.and_inplace (Seq.slice mask 1 (r.pn_len + 2)) (pn_sizemask r.pn_len) 0 in\n assert (r.packet == Lemmas.xor_inplace packet1 pnmask' pn_offset);\n Lemmas.pointwise_op_slice_other U8.logxor packet1 pnmask' pn_offset 0 1;\n assert (Seq.index r.packet 0 == Seq.index (Seq.slice r.packet 0 1) 0);\n assert (Seq.index r.packet 0 == U8.uint_to_t f1);\n BF.get_bitfield_logxor (U8.v f) (U8.v (Seq.index mask 0)) 0 protected_bits;\n BF.get_bitfield_set_bitfield_same (U8.v f) 0 protected_bits pb_value;\n BF.get_bitfield_logxor (f0) (U8.v (Seq.index mask 0)) 0 protected_bits;\n BF.get_bitfield_set_bitfield_same (f0) 0 protected_bits pb_value';\n FStar.UInt.logxor_inv (BF.get_bitfield (U8.v f) 0 protected_bits) (BF.get_bitfield (U8.v (Seq.index mask 0)) 0 protected_bits);\n assert (BF.get_bitfield (U8.v f) 0 protected_bits == BF.get_bitfield f1 0 protected_bits);\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits pb_value protected_bits 8;\n BF.get_bitfield_set_bitfield_other (f0) 0 protected_bits pb_value' protected_bits 8;\n BF.get_bitfield_partition_2 protected_bits (U8.v f) f1;\n assert (f == U8.uint_to_t f1);\n Parse.format_header_pn_length h;\n assert ((r.pn_len <: nat) == pn_len);\n assert (pnmask' == Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0);\n Lemmas.xor_inplace_involutive format pnmask' pn_offset;\n let packet0 = Lemmas.xor_inplace format pnmask' pn_offset in\n Lemmas.pointwise_op_slice_other U8.logxor format pnmask' pn_offset 0 1;\n assert (Seq.index packet0 0 == Seq.index (Seq.slice format 0 1) 0);\n assert (packet == Seq.cons (U8.uint_to_t f0) (Seq.slice packet0 1 (Seq.length packet0)));\n assert (packet1 `Seq.equal` Seq.cons (U8.uint_to_t f1) (Seq.slice packet0 1 (Seq.length packet0)));\n assert (packet1 `Seq.equal` packet0);\n assert (r.packet `Seq.equal` format);\n ()\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 372, "start_col": 2, "end_line": 425, "end_col": 5 }, "file_context": "module QUIC.Spec.Header\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Parse = QUIC.Spec.Header.Parse\n\nmodule AEAD = Spec.Agile.AEAD\nmodule Cipher = Spec.Agile.Cipher\nmodule Lemmas = QUIC.Spec.Lemmas\n\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: GTot (Seq.lseq Secret.uint8 16) =\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (Seq.seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (Seq.seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n(*\nDecryption of packet number\npacket[pn_offset..pn_offset+4] ^= pn_mask &\n match pn_len with\n | 0 -> mask & 0xFF000000\n | 1 -> mask & 0xFFFF0000\n | 2 -> mask & 0xFFFFFF00\n | 3 -> mask & 0xFFFFFFFF\n*)\nlet pn_sizemask' (pn_len: nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet pn_sizemask (pn_len: nat { pn_len < 4 }) : Tot (lbytes (pn_len + 1)) =\n Seq.slice (pn_sizemask' pn_len) 0 (pn_len + 1)\n\nlet header_encrypt\n a hpk h c\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\nlet header_encrypt_post\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n (cid_len: nat { cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h) })\n: Lemma (\n let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let z = header_encrypt a hpk h c in\n Parse.header_len h + Seq.length c == Seq.length z /\\\n Seq.slice z (Parse.header_len h) (Seq.length z) `Seq.equal` c /\\\n MShort? h == (BF.get_bitfield (U8.v (Seq.index z 0)) 7 8 = 0) /\\\n is_retry h == (not (MShort? h) && BF.get_bitfield (U8.v (Seq.index z 0)) 4 6 = 3) /\\ (\n if is_retry h\n then z == y\n else Parse.putative_pn_offset cid_len z == Some (Parse.pn_offset h)\n ))\n= Parse.format_header_is_short h;\n Parse.format_header_is_retry h;\n if is_retry h\n then ()\n else begin\n Parse.format_header_pn_length h;\n let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index y 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let bf = BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits bf in\n let r = Lemmas.xor_inplace y pnmask pn_offset in\n let z = header_encrypt a hpk h c in\n assert (z == Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)));\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset 0 1;\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset 1 pn_offset;\n assert (pn_offset > 0);\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset (Parse.header_len h) (Seq.length y);\n assert (Seq.slice z (Parse.header_len h) (Seq.length z) `Seq.equal` Seq.slice y (Parse.header_len h) (Seq.length y));\n assert (U8.uint_to_t f' == Seq.index (Seq.slice z 0 1) 0);\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 7 8;\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf protected_bits 8;\n if MLong? h\n then BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 4 6;\n Parse.putative_pn_offset_correct h cid_len;\n Parse.putative_pn_offset_frame cid_len x y;\n Parse.putative_pn_offset_frame cid_len y z;\n ()\n end\n\n#pop-options\n\nlet header_encrypt_length\n a hpk h c\n=\n header_encrypt_post a hpk h c (dcid_len h)\n\nnoextract\ntype header_decrypt_aux_t = {\n is_short: bool;\n is_retry: (is_retry: bool { is_retry ==> ~ (is_short) });\n packet: packet;\n pn_offset: (if is_retry then unit else nat);\n pn_len: (if is_retry then unit else (pn_len: nat {pn_len < 4 /\\ pn_offset + pn_len + 1 <= Seq.length packet}));\n}\n\nlet header_decrypt_aux\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: GTot (option header_decrypt_aux_t)\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n is_short = is_short;\n is_retry = is_retry;\n packet = packet;\n pn_offset = ();\n pn_len = ();\n })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset+16)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n is_short = is_short;\n is_retry = is_retry;\n packet = packet'';\n pn_offset = pn_offset;\n pn_len = pn_len;\n })\n end\n\n#push-options \"--z3rlimit 64 --max_fuel 1\"\n\n#restart-solver\n\nlet header_decrypt_aux_post\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Lemma\n (requires (Some? (header_decrypt_aux a hpk cid_len packet)))\n (ensures (\n Some? (header_decrypt_aux a hpk cid_len packet) /\\ (\n let Some r = header_decrypt_aux a hpk cid_len packet in\n Seq.length r.packet == Seq.length packet /\\\n Seq.length packet > 0 /\\ (\n let f' = Seq.index r.packet 0 in\n r.is_short == (BF.get_bitfield (U8.v f') 7 8 = 0) /\\\n r.is_retry == (not r.is_short && (BF.get_bitfield (U8.v f') 4 6 = 3)) /\\ (\n if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\\n Parse.putative_pn_offset cid_len r.packet == Parse.putative_pn_offset cid_len packet /\\ (\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n r.pn_offset == pn_offset /\\\n r.pn_offset + 20 <= Seq.length r.packet /\\\n r.pn_len == BF.get_bitfield (U8.v f') 0 2 /\\\n r.pn_offset + r.pn_len + 1 <= Seq.length r.packet /\\\n Seq.slice r.packet (r.pn_offset + r.pn_len + 1) (Seq.length r.packet) `Seq.equal` Seq.slice packet (r.pn_offset + r.pn_len + 1) (Seq.length packet) /\\\n True\n ))))))\n=let Some r = header_decrypt_aux a hpk cid_len packet in\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then ()\n else begin\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n let sample_offset = pn_offset + 4 in\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset+16)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let bf = BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits bf in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n assert (r.packet == Lemmas.xor_inplace packet' pnmask pn_offset);\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset 0 1;\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset 1 pn_offset;\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset (pn_offset + pn_len + 1) (Seq.length packet);\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf protected_bits 8;\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 7 8;\n assert (Seq.index r.packet 0 == Seq.index (Seq.slice packet' 0 1) 0);\n Parse.putative_pn_offset_frame cid_len packet r.packet;\n if not is_short\n then BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 4 6;\n assert (Parse.putative_pn_offset cid_len r.packet == Parse.putative_pn_offset cid_len packet);\n ()\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 64 --max_fuel 1\"\n\nlet header_decrypt_aux_post_parse\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (packet: packet)\n: Lemma\n (requires (match header_decrypt_aux a hpk cid_len packet with\n | Some r ->\n Parse.H_Success? (Parse.parse_header cid_len last r.packet)\n | _ -> False\n ))\n (ensures (\n let Some r = header_decrypt_aux a hpk cid_len packet in\n let Parse.H_Success h rem' = Parse.parse_header cid_len last r.packet in\n Parse.header_len h <= Seq.length packet /\\\n Seq.length r.packet == Seq.length packet /\\\n Seq.length packet > 0 /\\ (\n r.is_short == MShort? h /\\\n r.is_retry == is_retry h /\\\n rem' `Seq.equal` Seq.slice packet (Parse.header_len h) (Seq.length packet) /\\ (\n if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\ (\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n pn_offset == Parse.pn_offset h /\\\n r.pn_offset == pn_offset /\\\n r.pn_len == Secret.v (pn_length h) - 1 /\\\n r.pn_offset + r.pn_len + 1 == Parse.header_len h /\\\n Seq.length rem' >= 16\n )))))\n= header_decrypt_aux_post a hpk cid_len packet;\n let Some r = header_decrypt_aux a hpk cid_len packet in\n let Parse.H_Success h rem' = Parse.parse_header cid_len last r.packet in\n Parse.lemma_header_parsing_post cid_len last r.packet;\n Parse.format_header_is_short h;\n Parse.format_header_is_retry h;\n assert (r.is_short == MShort? h);\n assert (r.is_retry == is_retry h);\n if r.is_retry\n then\n ()\n else begin\n Parse.format_header_pn_length h;\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n Parse.putative_pn_offset_correct h cid_len;\n Parse.putative_pn_offset_frame cid_len (Parse.format_header h) r.packet\n end\n\n#pop-options\n\nlet max (a: nat) (b: nat) : Tot (c: nat { c >= a /\\ c >= b /\\ (c <= a \\/ c <= b) }) = if a <= b then b else a\nlet min (a: nat) (b: nat) : Tot (c: nat { c <= a /\\ c <= b /\\ (c >= a \\/ c >= b) }) = if b <= a then b else a\n\n#push-options \"--z3rlimit 256\"\n\n#restart-solver\n\nlet header_decrypt\n a hpk cid_len last packet\n=\n let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then H_Failure\n else\n match header_decrypt_aux a hpk cid_len packet with\n | None -> H_Failure\n | Some r ->\n let packet'' = r.packet in\n begin match Parse.parse_header cid_len last packet'' with\n | Parse.H_Failure -> H_Failure\n | Parse.H_Success h rem' ->\n header_decrypt_aux_post_parse a hpk cid_len last packet;\n if is_retry h\n then\n H_Success h Seq.empty rem'\n else\n let clen = if has_payload_length h then Secret.v (payload_length h) else Seq.length rem' in\n assert_norm (16 < max_cipher_length - 1);\n (* payload_length is secret, so, to stay constant-time, we\n must not check for failure. Instead, we compute some length\n that might be garbage if bounds on payload_length do not hold. *)\n let clen = max (min (min clen (Seq.length rem')) (max_cipher_length - 1)) 16 in\n assert (clen < max_cipher_length);\n assert (clen <= Seq.length rem');\n assert (16 <= clen);\n let c = Seq.slice rem' 0 clen in\n let rem = Seq.slice rem' clen (Seq.length rem') in\n H_Success h c rem\n end\n\nlet lemma_header_encryption_correct_aux\n (a:ea)\n (k: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h:header)\n (cid_len: nat { cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h) })\n (c: cbytes' (is_retry h))\n: Lemma\n (let r' = header_decrypt_aux a k cid_len (header_encrypt a k h c) in\n Some? r' /\\ (\n let Some r = r' in\n r.packet `Seq.equal` (Parse.format_header h `Seq.append` c) /\\\n r.is_short == MShort? h /\\\n r.is_retry == is_retry h /\\\n ((~ (is_retry h)) ==> ((r.pn_offset <: nat) == Parse.pn_offset h /\\ r.pn_len == Secret.v (pn_length h) - 1))", "dependencies": { "source_file": "QUIC.Spec.Header.fst", "checked_file": "QUIC.Spec.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 256, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n k: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n h: QUIC.Spec.Header.Base.header ->\n cid_len: Prims.nat{cid_len <= 20 /\\ (MShort? h ==> cid_len == QUIC.Spec.Header.Base.dcid_len h)} ->\n c: QUIC.Spec.Crypto.cbytes' (QUIC.Spec.Header.Base.is_retry h)\n -> FStar.Pervasives.Lemma\n (ensures\n (let r' =\n QUIC.Spec.Header.header_decrypt_aux a k cid_len (QUIC.Spec.Header.header_encrypt a k h c)\n in\n Some? r' /\\\n (let _ = r' in\n (let FStar.Pervasives.Native.Some #_ r = _ in\n FStar.Seq.Base.equal (Mkheader_decrypt_aux_t?.packet r)\n (FStar.Seq.Base.append (QUIC.Spec.Header.Parse.format_header h) c) /\\\n Mkheader_decrypt_aux_t?.is_short r == MShort? h /\\\n Mkheader_decrypt_aux_t?.is_retry r == QUIC.Spec.Header.Base.is_retry h /\\\n (~(QUIC.Spec.Header.Base.is_retry h) ==>\n Mkheader_decrypt_aux_t?.pn_offset r == QUIC.Spec.Header.Parse.pn_offset h /\\\n Mkheader_decrypt_aux_t?.pn_len r ==\n QUIC.Secret.Int.Base.v (QUIC.Spec.Header.Base.pn_length h) - 1))\n <:\n Prims.logical)))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "QUIC.Spec.Header.Base.header", "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.l_imp", "QUIC.Spec.Header.Base.uu___is_MShort", "Prims.eq2", "QUIC.Spec.Header.Base.dcid_len", "QUIC.Spec.Crypto.cbytes'", "QUIC.Spec.Header.Base.is_retry", "Prims.bool", "QUIC.Spec.Header.header_decrypt_aux_t", "Prims.unit", "Prims._assert", "FStar.Seq.Base.equal", "QUIC.Spec.Base.byte", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__packet", "FStar.Seq.Properties.cons", "FStar.UInt8.uint_to_t", "FStar.Seq.Base.slice", "FStar.Seq.Base.length", "FStar.Seq.Base.seq", "FStar.Seq.Base.index", "QUIC.Spec.Lemmas.pointwise_op_slice_other", "FStar.UInt8.logxor", "QUIC.Spec.Base.bytes", "QUIC.Spec.Lemmas.xor_inplace", "QUIC.Spec.Lemmas.xor_inplace_involutive", "QUIC.Spec.Lemmas.and_inplace", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.PUB", "Prims.op_Addition", "QUIC.Spec.Header.pn_sizemask", "Prims.int", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__pn_len", "QUIC.Spec.Header.Parse.format_header_pn_length", "FStar.UInt8.t", "LowParse.BitFields.get_bitfield_partition_2", "FStar.UInt8.n", "FStar.UInt8.v", "LowParse.BitFields.get_bitfield_set_bitfield_other", "LowParse.BitFields.ubitfield", "Prims.op_Subtraction", "LowParse.BitFields.get_bitfield", "FStar.UInt.logxor_inv", "LowParse.BitFields.get_bitfield_set_bitfield_same", "LowParse.BitFields.get_bitfield_logxor", "FStar.UInt.uint_t", "LowParse.BitFields.set_bitfield", "FStar.UInt.logxor", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__is_short", "Lib.IntTypes.int_t", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.SEC", "QUIC.Spec.Header.block_of_sample", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__pn_offset", "QUIC.Secret.Seq.seq_hide", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "QUIC.Spec.Header.Base.pn_length", "Prims.op_LessThan", "Lib.IntTypes.v", "QUIC.Spec.Header.Base.header_len", "QUIC.Spec.Header.Parse.pn_offset", "QUIC.Spec.Header.Parse.putative_pn_offset_correct", "FStar.Pervasives.Native.option", "QUIC.Spec.Header.header_decrypt_aux", "QUIC.Spec.Crypto.packet", "QUIC.Spec.Header.header_encrypt", "FStar.Seq.Base.append", "QUIC.Spec.Header.Parse.format_header", "QUIC.Spec.Header.header_decrypt_aux_post", "QUIC.Spec.Header.header_encrypt_post", "Prims.l_True", "Prims.squash", "FStar.Pervasives.Native.uu___is_Some", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__is_retry", "Prims.l_not", "Prims.logical", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_header_encryption_correct_aux\n (a: ea)\n (k: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (cid_len: nat{cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h)})\n (c: cbytes' (is_retry h))\n : Lemma\n (let r' = header_decrypt_aux a k cid_len (header_encrypt a k h c) in\n Some? r' /\\\n (let Some r = r' in\n r.packet `Seq.equal` ((Parse.format_header h) `Seq.append` c) /\\ r.is_short == MShort? h /\\\n r.is_retry == is_retry h /\\\n ((~(is_retry h)) ==>\n ((r.pn_offset <: nat) == Parse.pn_offset h /\\ r.pn_len == Secret.v (pn_length h) - 1))))\nlet lemma_header_encryption_correct_aux\n (a: ea)\n (k: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (cid_len: nat{cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h)})\n (c: cbytes' (is_retry h))\n : Lemma\n (let r' = header_decrypt_aux a k cid_len (header_encrypt a k h c) in\n Some? r' /\\\n (let Some r = r' in\n r.packet `Seq.equal` ((Parse.format_header h) `Seq.append` c) /\\ r.is_short == MShort? h /\\\n r.is_retry == is_retry h /\\\n ((~(is_retry h)) ==>\n ((r.pn_offset <: nat) == Parse.pn_offset h /\\ r.pn_len == Secret.v (pn_length h) - 1)))) =", "completed_definiton": "header_encrypt_post a k h c cid_len;\nheader_decrypt_aux_post a k cid_len (header_encrypt a k h c);\nif is_retry h\nthen ()\nelse\n let format = (Parse.format_header h) `Seq.append` c in\n let packet = header_encrypt a k h c in\n let Some r = header_decrypt_aux a k cid_len packet in\n Parse.putative_pn_offset_correct h cid_len;\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample' = Seq.slice c (3 - pn_len) (19 - pn_len) in\n assert (sample' `Seq.equal` (Seq.slice packet (pn_offset + 4) (pn_offset + 20)));\n let sample = Seq.seq_hide sample' in\n assert ((r.pn_offset <: nat) == pn_offset);\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) k sample) in\n let protected_bits = if MShort? h then 5 else 4 in\n assert (protected_bits == (if r.is_short then 5 else 4));\n let f = Seq.index format 0 in\n let pb_value =\n BF.get_bitfield ((U8.v f) `FStar.UInt.logxor` (U8.v (Seq.index mask 0))) 0 protected_bits\n in\n let f0 = BF.set_bitfield (U8.v f) 0 protected_bits pb_value in\n assert (U8.uint_to_t f0 == Seq.index packet 0);\n let pb_value' =\n BF.get_bitfield (f0 `FStar.UInt.logxor` (U8.v (Seq.index mask 0))) 0 protected_bits\n in\n let f1 = BF.set_bitfield f0 0 protected_bits pb_value' in\n let packet1 = Seq.cons (U8.uint_to_t f1) (Seq.slice packet 1 (Seq.length packet)) in\n let pnmask' = Lemmas.and_inplace (Seq.slice mask 1 (r.pn_len + 2)) (pn_sizemask r.pn_len) 0 in\n assert (r.packet == Lemmas.xor_inplace packet1 pnmask' pn_offset);\n Lemmas.pointwise_op_slice_other U8.logxor packet1 pnmask' pn_offset 0 1;\n assert (Seq.index r.packet 0 == Seq.index (Seq.slice r.packet 0 1) 0);\n assert (Seq.index r.packet 0 == U8.uint_to_t f1);\n BF.get_bitfield_logxor (U8.v f) (U8.v (Seq.index mask 0)) 0 protected_bits;\n BF.get_bitfield_set_bitfield_same (U8.v f) 0 protected_bits pb_value;\n BF.get_bitfield_logxor (f0) (U8.v (Seq.index mask 0)) 0 protected_bits;\n BF.get_bitfield_set_bitfield_same (f0) 0 protected_bits pb_value';\n FStar.UInt.logxor_inv (BF.get_bitfield (U8.v f) 0 protected_bits)\n (BF.get_bitfield (U8.v (Seq.index mask 0)) 0 protected_bits);\n assert (BF.get_bitfield (U8.v f) 0 protected_bits == BF.get_bitfield f1 0 protected_bits);\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits pb_value protected_bits 8;\n BF.get_bitfield_set_bitfield_other (f0) 0 protected_bits pb_value' protected_bits 8;\n BF.get_bitfield_partition_2 protected_bits (U8.v f) f1;\n assert (f == U8.uint_to_t f1);\n Parse.format_header_pn_length h;\n assert ((r.pn_len <: nat) == pn_len);\n assert (pnmask' == Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0);\n Lemmas.xor_inplace_involutive format pnmask' pn_offset;\n let packet0 = Lemmas.xor_inplace format pnmask' pn_offset in\n Lemmas.pointwise_op_slice_other U8.logxor format pnmask' pn_offset 0 1;\n assert (Seq.index packet0 0 == Seq.index (Seq.slice format 0 1) 0);\n assert (packet == Seq.cons (U8.uint_to_t f0) (Seq.slice packet0 1 (Seq.length packet0)));\n assert (packet1\n `Seq.equal`\n (Seq.cons (U8.uint_to_t f1) (Seq.slice packet0 1 (Seq.length packet0))));\n assert (packet1 `Seq.equal` packet0);\n assert (r.packet `Seq.equal` format);\n ()", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.fst", "name": "QUIC.Spec.Header.header_decrypt", "original_source_type": "val header_decrypt:\n a:ea ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n cid_len: nat { cid_len <= 20 } ->\n last: nat { last + 1 < pow2 62 } ->\n p: packet ->\n GTot (r: h_result { match r with\n | H_Failure -> True\n | H_Success h c rem ->\n is_valid_header h cid_len last /\\\n Seq.length rem <= Seq.length p /\\\n rem `Seq.equal` Seq.slice p (Seq.length p - Seq.length rem) (Seq.length p)\n })", "source_type": "val header_decrypt:\n a:ea ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n cid_len: nat { cid_len <= 20 } ->\n last: nat { last + 1 < pow2 62 } ->\n p: packet ->\n GTot (r: h_result { match r with\n | H_Failure -> True\n | H_Success h c rem ->\n is_valid_header h cid_len last /\\\n Seq.length rem <= Seq.length p /\\\n rem `Seq.equal` Seq.slice p (Seq.length p - Seq.length rem) (Seq.length p)\n })", "source_definition": "let header_decrypt\n a hpk cid_len last packet\n=\n let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then H_Failure\n else\n match header_decrypt_aux a hpk cid_len packet with\n | None -> H_Failure\n | Some r ->\n let packet'' = r.packet in\n begin match Parse.parse_header cid_len last packet'' with\n | Parse.H_Failure -> H_Failure\n | Parse.H_Success h rem' ->\n header_decrypt_aux_post_parse a hpk cid_len last packet;\n if is_retry h\n then\n H_Success h Seq.empty rem'\n else\n let clen = if has_payload_length h then Secret.v (payload_length h) else Seq.length rem' in\n assert_norm (16 < max_cipher_length - 1);\n (* payload_length is secret, so, to stay constant-time, we\n must not check for failure. Instead, we compute some length\n that might be garbage if bounds on payload_length do not hold. *)\n let clen = max (min (min clen (Seq.length rem')) (max_cipher_length - 1)) 16 in\n assert (clen < max_cipher_length);\n assert (clen <= Seq.length rem');\n assert (16 <= clen);\n let c = Seq.slice rem' 0 clen in\n let rem = Seq.slice rem' clen (Seq.length rem') in\n H_Success h c rem\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 327, "start_col": 2, "end_line": 355, "end_col": 9 }, "file_context": "module QUIC.Spec.Header\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule Secret = QUIC.Secret.Int\nmodule BF = LowParse.BitFields\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule U64 = FStar.UInt64\nmodule Parse = QUIC.Spec.Header.Parse\n\nmodule AEAD = Spec.Agile.AEAD\nmodule Cipher = Spec.Agile.Cipher\nmodule Lemmas = QUIC.Spec.Lemmas\n\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: GTot (Seq.lseq Secret.uint8 16) =\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (Seq.seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (Seq.seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n(*\nDecryption of packet number\npacket[pn_offset..pn_offset+4] ^= pn_mask &\n match pn_len with\n | 0 -> mask & 0xFF000000\n | 1 -> mask & 0xFFFF0000\n | 2 -> mask & 0xFFFFFF00\n | 3 -> mask & 0xFFFFFFFF\n*)\nlet pn_sizemask' (pn_len: nat { pn_len < 4 }) : Tot (lbytes 4) =\n let open FStar.Endianness in\n FStar.Math.Lemmas.pow2_lt_compat 32 (24 - (8 `op_Multiply` pn_len));\n FStar.Endianness.n_to_be 4 (pow2 32 - pow2 (24 - (8 `op_Multiply` pn_len)))\n\nlet pn_sizemask (pn_len: nat { pn_len < 4 }) : Tot (lbytes (pn_len + 1)) =\n Seq.slice (pn_sizemask' pn_len) 0 (pn_len + 1)\n\nlet header_encrypt\n a hpk h c\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = Parse.format_header h `Seq.append` c in\n if is_retry h\n then\n r\n else\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n\n#push-options \"--z3rlimit 256 --query_stats --z3cliopt smt.arith.nl=false\"\n\n#restart-solver\n\nlet header_encrypt_post\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n (cid_len: nat { cid_len <= 20 /\\ (MShort? h ==> cid_len == dcid_len h) })\n: Lemma (\n let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let z = header_encrypt a hpk h c in\n Parse.header_len h + Seq.length c == Seq.length z /\\\n Seq.slice z (Parse.header_len h) (Seq.length z) `Seq.equal` c /\\\n MShort? h == (BF.get_bitfield (U8.v (Seq.index z 0)) 7 8 = 0) /\\\n is_retry h == (not (MShort? h) && BF.get_bitfield (U8.v (Seq.index z 0)) 4 6 = 3) /\\ (\n if is_retry h\n then z == y\n else Parse.putative_pn_offset cid_len z == Some (Parse.pn_offset h)\n ))\n= Parse.format_header_is_short h;\n Parse.format_header_is_retry h;\n if is_retry h\n then ()\n else begin\n Parse.format_header_pn_length h;\n let x = Parse.format_header h in\n let y = x `Seq.append` c in\n let pn_offset = Parse.pn_offset h in\n let pn_len = Secret.v (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let f = Seq.index y 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let bf = BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits bf in\n let r = Lemmas.xor_inplace y pnmask pn_offset in\n let z = header_encrypt a hpk h c in\n assert (z == Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)));\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset 0 1;\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset 1 pn_offset;\n assert (pn_offset > 0);\n Lemmas.pointwise_op_slice_other U8.logxor y pnmask pn_offset (Parse.header_len h) (Seq.length y);\n assert (Seq.slice z (Parse.header_len h) (Seq.length z) `Seq.equal` Seq.slice y (Parse.header_len h) (Seq.length y));\n assert (U8.uint_to_t f' == Seq.index (Seq.slice z 0 1) 0);\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 7 8;\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf protected_bits 8;\n if MLong? h\n then BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 4 6;\n Parse.putative_pn_offset_correct h cid_len;\n Parse.putative_pn_offset_frame cid_len x y;\n Parse.putative_pn_offset_frame cid_len y z;\n ()\n end\n\n#pop-options\n\nlet header_encrypt_length\n a hpk h c\n=\n header_encrypt_post a hpk h c (dcid_len h)\n\nnoextract\ntype header_decrypt_aux_t = {\n is_short: bool;\n is_retry: (is_retry: bool { is_retry ==> ~ (is_short) });\n packet: packet;\n pn_offset: (if is_retry then unit else nat);\n pn_len: (if is_retry then unit else (pn_len: nat {pn_len < 4 /\\ pn_offset + pn_len + 1 <= Seq.length packet}));\n}\n\nlet header_decrypt_aux\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: GTot (option header_decrypt_aux_t)\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n is_short = is_short;\n is_retry = is_retry;\n packet = packet;\n pn_offset = ();\n pn_len = ();\n })\n else\n match Parse.putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset+16)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n is_short = is_short;\n is_retry = is_retry;\n packet = packet'';\n pn_offset = pn_offset;\n pn_len = pn_len;\n })\n end\n\n#push-options \"--z3rlimit 64 --max_fuel 1\"\n\n#restart-solver\n\nlet header_decrypt_aux_post\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Lemma\n (requires (Some? (header_decrypt_aux a hpk cid_len packet)))\n (ensures (\n Some? (header_decrypt_aux a hpk cid_len packet) /\\ (\n let Some r = header_decrypt_aux a hpk cid_len packet in\n Seq.length r.packet == Seq.length packet /\\\n Seq.length packet > 0 /\\ (\n let f' = Seq.index r.packet 0 in\n r.is_short == (BF.get_bitfield (U8.v f') 7 8 = 0) /\\\n r.is_retry == (not r.is_short && (BF.get_bitfield (U8.v f') 4 6 = 3)) /\\ (\n if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\\n Parse.putative_pn_offset cid_len r.packet == Parse.putative_pn_offset cid_len packet /\\ (\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n r.pn_offset == pn_offset /\\\n r.pn_offset + 20 <= Seq.length r.packet /\\\n r.pn_len == BF.get_bitfield (U8.v f') 0 2 /\\\n r.pn_offset + r.pn_len + 1 <= Seq.length r.packet /\\\n Seq.slice r.packet (r.pn_offset + r.pn_len + 1) (Seq.length r.packet) `Seq.equal` Seq.slice packet (r.pn_offset + r.pn_len + 1) (Seq.length packet) /\\\n True\n ))))))\n=let Some r = header_decrypt_aux a hpk cid_len packet in\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then ()\n else begin\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n let sample_offset = pn_offset + 4 in\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset+16)) in\n let mask = Seq.seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let bf = BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits bf in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (pn_sizemask pn_len) 0 in\n assert (r.packet == Lemmas.xor_inplace packet' pnmask pn_offset);\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset 0 1;\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset 1 pn_offset;\n Lemmas.pointwise_op_slice_other U8.logxor packet' pnmask pn_offset (pn_offset + pn_len + 1) (Seq.length packet);\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf protected_bits 8;\n BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 7 8;\n assert (Seq.index r.packet 0 == Seq.index (Seq.slice packet' 0 1) 0);\n Parse.putative_pn_offset_frame cid_len packet r.packet;\n if not is_short\n then BF.get_bitfield_set_bitfield_other (U8.v f) 0 protected_bits bf 4 6;\n assert (Parse.putative_pn_offset cid_len r.packet == Parse.putative_pn_offset cid_len packet);\n ()\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 64 --max_fuel 1\"\n\nlet header_decrypt_aux_post_parse\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (packet: packet)\n: Lemma\n (requires (match header_decrypt_aux a hpk cid_len packet with\n | Some r ->\n Parse.H_Success? (Parse.parse_header cid_len last r.packet)\n | _ -> False\n ))\n (ensures (\n let Some r = header_decrypt_aux a hpk cid_len packet in\n let Parse.H_Success h rem' = Parse.parse_header cid_len last r.packet in\n Parse.header_len h <= Seq.length packet /\\\n Seq.length r.packet == Seq.length packet /\\\n Seq.length packet > 0 /\\ (\n r.is_short == MShort? h /\\\n r.is_retry == is_retry h /\\\n rem' `Seq.equal` Seq.slice packet (Parse.header_len h) (Seq.length packet) /\\ (\n if r.is_retry\n then r.packet == packet\n else\n Some? (Parse.putative_pn_offset cid_len packet) /\\ (\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n pn_offset == Parse.pn_offset h /\\\n r.pn_offset == pn_offset /\\\n r.pn_len == Secret.v (pn_length h) - 1 /\\\n r.pn_offset + r.pn_len + 1 == Parse.header_len h /\\\n Seq.length rem' >= 16\n )))))\n= header_decrypt_aux_post a hpk cid_len packet;\n let Some r = header_decrypt_aux a hpk cid_len packet in\n let Parse.H_Success h rem' = Parse.parse_header cid_len last r.packet in\n Parse.lemma_header_parsing_post cid_len last r.packet;\n Parse.format_header_is_short h;\n Parse.format_header_is_retry h;\n assert (r.is_short == MShort? h);\n assert (r.is_retry == is_retry h);\n if r.is_retry\n then\n ()\n else begin\n Parse.format_header_pn_length h;\n let Some pn_offset = Parse.putative_pn_offset cid_len packet in\n Parse.putative_pn_offset_correct h cid_len;\n Parse.putative_pn_offset_frame cid_len (Parse.format_header h) r.packet\n end\n\n#pop-options\n\nlet max (a: nat) (b: nat) : Tot (c: nat { c >= a /\\ c >= b /\\ (c <= a \\/ c <= b) }) = if a <= b then b else a\nlet min (a: nat) (b: nat) : Tot (c: nat { c <= a /\\ c <= b /\\ (c >= a \\/ c >= b) }) = if b <= a then b else a\n\n#push-options \"--z3rlimit 256\"\n\n#restart-solver\n\nlet header_decrypt\n a hpk cid_len last packet", "dependencies": { "source_file": "QUIC.Spec.Header.fst", "checked_file": "QUIC.Spec.Header.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 256, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n cid_len: Prims.nat{cid_len <= 20} ->\n last: Prims.nat{last + 1 < Prims.pow2 62} ->\n p: QUIC.Spec.Crypto.packet\n -> Prims.GTot\n (r:\n QUIC.Spec.Header.h_result\n { (match r with\n | QUIC.Spec.Header.H_Failure -> Prims.l_True\n | QUIC.Spec.Header.H_Success h _ rem ->\n QUIC.Spec.Header.Base.is_valid_header h cid_len last /\\\n FStar.Seq.Base.length rem <= FStar.Seq.Base.length p /\\\n FStar.Seq.Base.equal rem\n (FStar.Seq.Base.slice p\n (FStar.Seq.Base.length p - FStar.Seq.Base.length rem)\n (FStar.Seq.Base.length p)))\n <:\n Type0 })", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "Prims.op_Addition", "Prims.pow2", "QUIC.Spec.Crypto.packet", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "QUIC.Spec.Header.H_Failure", "Prims.bool", "QUIC.Spec.Header.header_decrypt_aux", "QUIC.Spec.Header.header_decrypt_aux_t", "QUIC.Spec.Header.Parse.parse_header", "QUIC.Spec.Header.Base.header", "QUIC.Spec.Base.bytes", "QUIC.Spec.Header.Base.is_retry", "QUIC.Spec.Header.H_Success", "FStar.Seq.Base.empty", "FStar.Seq.Base.seq", "FStar.Seq.Base.slice", "Prims.unit", "Prims._assert", "QUIC.Spec.Crypto.max_cipher_length", "Prims.l_and", "Prims.op_GreaterThanOrEqual", "QUIC.Spec.Header.min", "Prims.op_Subtraction", "Prims.l_or", "QUIC.Spec.Header.max", "FStar.Pervasives.assert_norm", "QUIC.Spec.Header.Base.has_payload_length", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "QUIC.Spec.Header.Base.payload_length", "QUIC.Spec.Header.h_result", "Prims.l_True", "Prims.eq2", "QUIC.Spec.Header.Base.is_valid_header", "FStar.Seq.Base.equal", "QUIC.Spec.Header.header_decrypt_aux_post_parse", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__packet" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_decrypt:\n a:ea ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n cid_len: nat { cid_len <= 20 } ->\n last: nat { last + 1 < pow2 62 } ->\n p: packet ->\n GTot (r: h_result { match r with\n | H_Failure -> True\n | H_Success h c rem ->\n is_valid_header h cid_len last /\\\n Seq.length rem <= Seq.length p /\\\n rem `Seq.equal` Seq.slice p (Seq.length p - Seq.length rem) (Seq.length p)\n })\nlet header_decrypt a hpk cid_len last packet =", "completed_definiton": "let open FStar.Math.Lemmas in\nif Seq.length packet = 0\nthen H_Failure\nelse\n match header_decrypt_aux a hpk cid_len packet with\n | None -> H_Failure\n | Some r ->\n let packet'' = r.packet in\n match Parse.parse_header cid_len last packet'' with\n | Parse.H_Failure -> H_Failure\n | Parse.H_Success h rem' ->\n header_decrypt_aux_post_parse a hpk cid_len last packet;\n if is_retry h\n then H_Success h Seq.empty rem'\n else\n let clen = if has_payload_length h then Secret.v (payload_length h) else Seq.length rem' in\n assert_norm (16 < max_cipher_length - 1);\n let clen = max (min (min clen (Seq.length rem')) (max_cipher_length - 1)) 16 in\n assert (clen < max_cipher_length);\n assert (clen <= Seq.length rem');\n assert (16 <= clen);\n let c = Seq.slice rem' 0 clen in\n let rem = Seq.slice rem' clen (Seq.length rem') in\n H_Success h c rem", "isa_cross_project_example": true }, { "file_name": "QUIC.UInt.fst", "name": "QUIC.UInt.to_vec_prefix", "original_source_type": "val to_vec_prefix (n k: nat) (a: uint_t k)\n : Lemma (requires (k <= n))\n (ensures (pow2 k <= pow2 n /\\ (to_vec #k a) `Seq.equal` (Seq.slice (to_vec #n a) (n - k) n)))\n (decreases k)", "source_type": "val to_vec_prefix (n k: nat) (a: uint_t k)\n : Lemma (requires (k <= n))\n (ensures (pow2 k <= pow2 n /\\ (to_vec #k a) `Seq.equal` (Seq.slice (to_vec #n a) (n - k) n)))\n (decreases k)", "source_definition": "let rec to_vec_prefix\n (n: nat)\n (k: nat)\n (a: uint_t k)\n: Lemma\n (requires (k <= n))\n (ensures (\n pow2 k <= pow2 n /\\\n to_vec #k a `Seq.equal` Seq.slice (to_vec #n a) (n - k) n\n ))\n (decreases k)\n= if k = 0\n then ()\n else to_vec_prefix (n - 1) (k - 1) (a / 2)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.UInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 18, "start_col": 2, "end_line": 20, "end_col": 44 }, "file_context": "module QUIC.UInt\ninclude FStar.UInt\nopen FStar.Math.Lemmas\n\n#push-options \"--z3rlimit 16\"\n\nlet rec to_vec_prefix\n (n: nat)\n (k: nat)\n (a: uint_t k)\n: Lemma\n (requires (k <= n))\n (ensures (\n pow2 k <= pow2 n /\\\n to_vec #k a `Seq.equal` Seq.slice (to_vec #n a) (n - k) n\n ))", "dependencies": { "source_file": "QUIC.UInt.fst", "checked_file": "QUIC.UInt.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "n: Prims.nat -> k: Prims.nat -> a: FStar.UInt.uint_t k\n -> FStar.Pervasives.Lemma (requires k <= n)\n (ensures\n Prims.pow2 k <= Prims.pow2 n /\\\n FStar.Seq.Base.equal (FStar.UInt.to_vec a)\n (FStar.Seq.Base.slice (FStar.UInt.to_vec a) (n - k) n))\n (decreases k)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma", "" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "FStar.UInt.uint_t", "Prims.op_Equality", "Prims.int", "Prims.bool", "QUIC.UInt.to_vec_prefix", "Prims.op_Subtraction", "Prims.op_Division", "Prims.unit", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.squash", "Prims.l_and", "Prims.pow2", "FStar.Seq.Base.equal", "FStar.UInt.to_vec", "FStar.Seq.Base.slice", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val to_vec_prefix (n k: nat) (a: uint_t k)\n : Lemma (requires (k <= n))\n (ensures (pow2 k <= pow2 n /\\ (to_vec #k a) `Seq.equal` (Seq.slice (to_vec #n a) (n - k) n)))\n (decreases k)\nlet rec to_vec_prefix (n k: nat) (a: uint_t k)\n : Lemma (requires (k <= n))\n (ensures (pow2 k <= pow2 n /\\ (to_vec #k a) `Seq.equal` (Seq.slice (to_vec #n a) (n - k) n)))\n (decreases k) =", "completed_definiton": "if k = 0 then () else to_vec_prefix (n - 1) (k - 1) (a / 2)", "isa_cross_project_example": true }, { "file_name": "QUIC.UInt.fst", "name": "QUIC.UInt.lemma_logxor_lt", "original_source_type": "val lemma_logxor_lt (#n: pos) (a b: uint_t n) (k: nat{k <= n})\n : Lemma (requires a < pow2 k /\\ b < pow2 k) (ensures a `logxor` b < pow2 k)", "source_type": "val lemma_logxor_lt (#n: pos) (a b: uint_t n) (k: nat{k <= n})\n : Lemma (requires a < pow2 k /\\ b < pow2 k) (ensures a `logxor` b < pow2 k)", "source_definition": "let lemma_logxor_lt (#n:pos) (a b:uint_t n) (k:nat{k <= n})\n : Lemma (requires a < pow2 k /\\ b < pow2 k)\n (ensures a `logxor` b < pow2 k)\n= if k = n\n then ()\n else if k = 0\n then begin\n assert_norm (pow2 0 == 1);\n assert (a == 0);\n assert (b == 0);\n logxor_self #n 0\n end\n else begin\n pow2_lt_compat n k;\n to_vec_inc n k a;\n to_vec_inc n k b;\n to_vec_inc n k (logxor #k a b);\n nth_lemma #n (logxor #k a b) (logxor #n a b)\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.UInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 40, "start_col": 2, "end_line": 55, "end_col": 5 }, "file_context": "module QUIC.UInt\ninclude FStar.UInt\nopen FStar.Math.Lemmas\n\n#push-options \"--z3rlimit 16\"\n\nlet rec to_vec_prefix\n (n: nat)\n (k: nat)\n (a: uint_t k)\n: Lemma\n (requires (k <= n))\n (ensures (\n pow2 k <= pow2 n /\\\n to_vec #k a `Seq.equal` Seq.slice (to_vec #n a) (n - k) n\n ))\n (decreases k)\n= if k = 0\n then ()\n else to_vec_prefix (n - 1) (k - 1) (a / 2)\n\nlet rec to_vec_inc\n (n: nat)\n (k: nat)\n (a: uint_t k)\n: Lemma\n (requires (k <= n))\n (ensures (\n pow2 k <= pow2 n /\\\n to_vec #n a `Seq.equal` (Seq.create (n - k) false `Seq.append` to_vec #k a)\n ))\n (decreases k)\n= if k = 0\n then ()\n else to_vec_inc (n - 1) (k - 1) (a / 2)\n\nlet lemma_logxor_lt (#n:pos) (a b:uint_t n) (k:nat{k <= n})\n : Lemma (requires a < pow2 k /\\ b < pow2 k)", "dependencies": { "source_file": "QUIC.UInt.fst", "checked_file": "QUIC.UInt.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n -> k: Prims.nat{k <= n}\n -> FStar.Pervasives.Lemma (requires a < Prims.pow2 k /\\ b < Prims.pow2 k)\n (ensures FStar.UInt.logxor a b < Prims.pow2 k)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.pos", "FStar.UInt.uint_t", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_Equality", "Prims.int", "Prims.l_or", "Prims.l_and", "Prims.op_GreaterThanOrEqual", "Prims.op_GreaterThan", "Prims.bool", "FStar.UInt.logxor_self", "Prims.unit", "Prims._assert", "Prims.eq2", "FStar.Pervasives.assert_norm", "Prims.pow2", "FStar.UInt.nth_lemma", "FStar.UInt.logxor", "QUIC.UInt.to_vec_inc", "FStar.Math.Lemmas.pow2_lt_compat", "Prims.op_LessThan", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_logxor_lt (#n: pos) (a b: uint_t n) (k: nat{k <= n})\n : Lemma (requires a < pow2 k /\\ b < pow2 k) (ensures a `logxor` b < pow2 k)\nlet lemma_logxor_lt (#n: pos) (a b: uint_t n) (k: nat{k <= n})\n : Lemma (requires a < pow2 k /\\ b < pow2 k) (ensures a `logxor` b < pow2 k) =", "completed_definiton": "if k = n\nthen ()\nelse\n if k = 0\n then\n (assert_norm (pow2 0 == 1);\n assert (a == 0);\n assert (b == 0);\n logxor_self #n 0)\n else\n (pow2_lt_compat n k;\n to_vec_inc n k a;\n to_vec_inc n k b;\n to_vec_inc n k (logxor #k a b);\n nth_lemma #n (logxor #k a b) (logxor #n a b))", "isa_cross_project_example": true }, { "file_name": "QUIC.UInt.fst", "name": "QUIC.UInt.to_vec_inc", "original_source_type": "val to_vec_inc (n k: nat) (a: uint_t k)\n : Lemma (requires (k <= n))\n (ensures\n (pow2 k <= pow2 n /\\\n (to_vec #n a) `Seq.equal` ((Seq.create (n - k) false) `Seq.append` (to_vec #k a))))\n (decreases k)", "source_type": "val to_vec_inc (n k: nat) (a: uint_t k)\n : Lemma (requires (k <= n))\n (ensures\n (pow2 k <= pow2 n /\\\n (to_vec #n a) `Seq.equal` ((Seq.create (n - k) false) `Seq.append` (to_vec #k a))))\n (decreases k)", "source_definition": "let rec to_vec_inc\n (n: nat)\n (k: nat)\n (a: uint_t k)\n: Lemma\n (requires (k <= n))\n (ensures (\n pow2 k <= pow2 n /\\\n to_vec #n a `Seq.equal` (Seq.create (n - k) false `Seq.append` to_vec #k a)\n ))\n (decreases k)\n= if k = 0\n then ()\n else to_vec_inc (n - 1) (k - 1) (a / 2)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.UInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 33, "start_col": 2, "end_line": 35, "end_col": 41 }, "file_context": "module QUIC.UInt\ninclude FStar.UInt\nopen FStar.Math.Lemmas\n\n#push-options \"--z3rlimit 16\"\n\nlet rec to_vec_prefix\n (n: nat)\n (k: nat)\n (a: uint_t k)\n: Lemma\n (requires (k <= n))\n (ensures (\n pow2 k <= pow2 n /\\\n to_vec #k a `Seq.equal` Seq.slice (to_vec #n a) (n - k) n\n ))\n (decreases k)\n= if k = 0\n then ()\n else to_vec_prefix (n - 1) (k - 1) (a / 2)\n\nlet rec to_vec_inc\n (n: nat)\n (k: nat)\n (a: uint_t k)\n: Lemma\n (requires (k <= n))\n (ensures (\n pow2 k <= pow2 n /\\\n to_vec #n a `Seq.equal` (Seq.create (n - k) false `Seq.append` to_vec #k a)\n ))", "dependencies": { "source_file": "QUIC.UInt.fst", "checked_file": "QUIC.UInt.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lemmas.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Math.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "n: Prims.nat -> k: Prims.nat -> a: FStar.UInt.uint_t k\n -> FStar.Pervasives.Lemma (requires k <= n)\n (ensures\n Prims.pow2 k <= Prims.pow2 n /\\\n FStar.Seq.Base.equal (FStar.UInt.to_vec a)\n (FStar.Seq.Base.append (FStar.Seq.Base.create (n - k) false) (FStar.UInt.to_vec a)))\n (decreases k)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma", "" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "FStar.UInt.uint_t", "Prims.op_Equality", "Prims.int", "Prims.bool", "QUIC.UInt.to_vec_inc", "Prims.op_Subtraction", "Prims.op_Division", "Prims.unit", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.squash", "Prims.l_and", "Prims.pow2", "FStar.Seq.Base.equal", "FStar.UInt.to_vec", "FStar.Seq.Base.append", "FStar.Seq.Base.create", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val to_vec_inc (n k: nat) (a: uint_t k)\n : Lemma (requires (k <= n))\n (ensures\n (pow2 k <= pow2 n /\\\n (to_vec #n a) `Seq.equal` ((Seq.create (n - k) false) `Seq.append` (to_vec #k a))))\n (decreases k)\nlet rec to_vec_inc (n k: nat) (a: uint_t k)\n : Lemma (requires (k <= n))\n (ensures\n (pow2 k <= pow2 n /\\\n (to_vec #n a) `Seq.equal` ((Seq.create (n - k) false) `Seq.append` (to_vec #k a))))\n (decreases k) =", "completed_definiton": "if k = 0 then () else to_vec_inc (n - 1) (k - 1) (a / 2)", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fst", "name": "Model.AEAD.aead_reader", "original_source_type": "val aead_reader: #i:id -> w:aead_writer i -> Type u#1", "source_type": "val aead_reader: #i:id -> w:aead_writer i -> Type u#1", "source_definition": "let aead_reader #i (w: aead_writer i) =\n w':aead_writer i { w' == w }", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 32, "start_col": 2, "end_line": 32, "end_col": 30 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\nopen LowStar.BufferOps\nopen Model.Helpers\n\nlet log #i (u: info i): Type0 =\n Seq.seq (entry i u)\n\nlet model_writer i: Type u#1 =\n u:info i & B.pointer (log #i u)\n\nlet unsafe_writer i =\n info i & Spec.kv (I.ae_id_ginfo i)\n\nlet aead_writer (i: id): Type u#1 =\n if is_safe i then\n model_writer i\n else\n unsafe_writer i", "dependencies": { "source_file": "Model.AEAD.fst", "checked_file": "Model.AEAD.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.AEAD.aead_writer i -> Type", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.id", "Model.AEAD.aead_writer", "Prims.eq2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val aead_reader: #i:id -> w:aead_writer i -> Type u#1\nlet aead_reader #i (w: aead_writer i) =", "completed_definiton": "w': aead_writer i {w' == w}", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fst", "name": "Model.AEAD.rgetinfo", "original_source_type": "val rgetinfo: #i:id -> #w:aead_writer i -> aead_reader w -> Tot (u:info i{u == wgetinfo w})", "source_type": "val rgetinfo: #i:id -> #w:aead_writer i -> aead_reader w -> Tot (u:info i{u == wgetinfo w})", "source_definition": "let rgetinfo #_ #w _ =\n wgetinfo w", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 41, "start_col": 2, "end_line": 41, "end_col": 12 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\nopen LowStar.BufferOps\nopen Model.Helpers\n\nlet log #i (u: info i): Type0 =\n Seq.seq (entry i u)\n\nlet model_writer i: Type u#1 =\n u:info i & B.pointer (log #i u)\n\nlet unsafe_writer i =\n info i & Spec.kv (I.ae_id_ginfo i)\n\nlet aead_writer (i: id): Type u#1 =\n if is_safe i then\n model_writer i\n else\n unsafe_writer i\n\nlet aead_reader #i (w: aead_writer i) =\n w':aead_writer i { w' == w }\n\nlet wgetinfo #i (u: aead_writer i) =\n if is_safe i then\n dfst (u <: model_writer i)\n else\n fst (u <: unsafe_writer i)", "dependencies": { "source_file": "Model.AEAD.fst", "checked_file": "Model.AEAD.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Model.AEAD.aead_reader w -> u107: Model.AEAD.info i {u107 == Model.AEAD.wgetinfo w}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.id", "Model.AEAD.aead_writer", "Model.AEAD.aead_reader", "Model.AEAD.wgetinfo", "Model.AEAD.info", "Prims.eq2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val rgetinfo: #i:id -> #w:aead_writer i -> aead_reader w -> Tot (u:info i{u == wgetinfo w})\nlet rgetinfo #_ #w _ =", "completed_definiton": "wgetinfo w", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fst", "name": "Model.AEAD.unsafe_writer", "original_source_type": "", "source_type": "val unsafe_writer : i: Model.Indexing.ae_id -> Type", "source_definition": "let unsafe_writer i =\n info i & Spec.kv (I.ae_id_ginfo i)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 23, "start_col": 2, "end_line": 23, "end_col": 36 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\nopen LowStar.BufferOps\nopen Model.Helpers\n\nlet log #i (u: info i): Type0 =\n Seq.seq (entry i u)\n\nlet model_writer i: Type u#1 =\n u:info i & B.pointer (log #i u)", "dependencies": { "source_file": "Model.AEAD.fst", "checked_file": "Model.AEAD.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: Model.Indexing.ae_id -> Type", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.Indexing.ae_id", "FStar.Pervasives.Native.tuple2", "Model.AEAD.info", "Spec.Agile.AEAD.kv", "Model.Indexing.ae_id_ginfo" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let unsafe_writer i =", "completed_definiton": "info i & Spec.kv (I.ae_id_ginfo i)", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fst", "name": "Model.AEAD.aead_writer", "original_source_type": "val aead_writer: i:id -> Type u#1", "source_type": "val aead_writer: i:id -> Type u#1", "source_definition": "let aead_writer (i: id): Type u#1 =\n if is_safe i then\n model_writer i\n else\n unsafe_writer i", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 26, "start_col": 2, "end_line": 29, "end_col": 19 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\nopen LowStar.BufferOps\nopen Model.Helpers\n\nlet log #i (u: info i): Type0 =\n Seq.seq (entry i u)\n\nlet model_writer i: Type u#1 =\n u:info i & B.pointer (log #i u)\n\nlet unsafe_writer i =\n info i & Spec.kv (I.ae_id_ginfo i)", "dependencies": { "source_file": "Model.AEAD.fst", "checked_file": "Model.AEAD.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: Model.AEAD.id -> Type", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.id", "Model.AEAD.is_safe", "Model.AEAD.model_writer", "Prims.bool", "Model.AEAD.unsafe_writer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val aead_writer: i:id -> Type u#1\nlet aead_writer (i: id) : Type u#1 =", "completed_definiton": "if is_safe i then model_writer i else unsafe_writer i", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fst", "name": "Model.AEAD.log", "original_source_type": "val log (#i: _) (u: info i) : Type0", "source_type": "val log (#i: _) (u: info i) : Type0", "source_definition": "let log #i (u: info i): Type0 =\n Seq.seq (entry i u)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 17, "start_col": 2, "end_line": 17, "end_col": 21 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\nopen LowStar.BufferOps\nopen Model.Helpers", "dependencies": { "source_file": "Model.AEAD.fst", "checked_file": "Model.AEAD.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "u95: Model.AEAD.info i -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.id", "Model.AEAD.info", "FStar.Seq.Base.seq", "Model.AEAD.entry" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val log (#i: _) (u: info i) : Type0\nlet log #i (u: info i) : Type0 =", "completed_definiton": "Seq.seq (entry i u)", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fst", "name": "Model.AEAD.wkey", "original_source_type": "val wkey: #i:unsafe_id -> w:aead_writer i -> Tot (Spec.kv (wgetinfo w).alg)", "source_type": "val wkey: #i:unsafe_id -> w:aead_writer i -> Tot (Spec.kv (wgetinfo w).alg)", "source_definition": "let wkey #i w =\n snd (w <: unsafe_writer i)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 47, "start_col": 2, "end_line": 47, "end_col": 28 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\nopen LowStar.BufferOps\nopen Model.Helpers\n\nlet log #i (u: info i): Type0 =\n Seq.seq (entry i u)\n\nlet model_writer i: Type u#1 =\n u:info i & B.pointer (log #i u)\n\nlet unsafe_writer i =\n info i & Spec.kv (I.ae_id_ginfo i)\n\nlet aead_writer (i: id): Type u#1 =\n if is_safe i then\n model_writer i\n else\n unsafe_writer i\n\nlet aead_reader #i (w: aead_writer i) =\n w':aead_writer i { w' == w }\n\nlet wgetinfo #i (u: aead_writer i) =\n if is_safe i then\n dfst (u <: model_writer i)\n else\n fst (u <: unsafe_writer i)\n\nlet rgetinfo #_ #w _ =\n wgetinfo w\n\nlet wlog #i w h =\n B.deref h (dsnd (w <: model_writer i))", "dependencies": { "source_file": "Model.AEAD.fst", "checked_file": "Model.AEAD.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.AEAD.aead_writer i -> Spec.Agile.AEAD.kv (Mkinfo'?.alg (Model.AEAD.wgetinfo w))", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.unsafe_id", "Model.AEAD.aead_writer", "FStar.Pervasives.Native.snd", "Model.AEAD.info", "Spec.Agile.AEAD.kv", "Model.Indexing.ae_id_ginfo", "Model.AEAD.unsafe_writer", "Model.AEAD.__proj__Mkinfo'__item__alg", "Model.AEAD.wgetinfo" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val wkey: #i:unsafe_id -> w:aead_writer i -> Tot (Spec.kv (wgetinfo w).alg)\nlet wkey #i w =", "completed_definiton": "snd (w <: unsafe_writer i)", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fst", "name": "Model.AEAD.wgetinfo", "original_source_type": "val wgetinfo: #i:id -> aead_writer i -> Tot (info i)", "source_type": "val wgetinfo: #i:id -> aead_writer i -> Tot (info i)", "source_definition": "let wgetinfo #i (u: aead_writer i) =\n if is_safe i then\n dfst (u <: model_writer i)\n else\n fst (u <: unsafe_writer i)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 35, "start_col": 2, "end_line": 38, "end_col": 30 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\nopen LowStar.BufferOps\nopen Model.Helpers\n\nlet log #i (u: info i): Type0 =\n Seq.seq (entry i u)\n\nlet model_writer i: Type u#1 =\n u:info i & B.pointer (log #i u)\n\nlet unsafe_writer i =\n info i & Spec.kv (I.ae_id_ginfo i)\n\nlet aead_writer (i: id): Type u#1 =\n if is_safe i then\n model_writer i\n else\n unsafe_writer i\n\nlet aead_reader #i (w: aead_writer i) =\n w':aead_writer i { w' == w }", "dependencies": { "source_file": "Model.AEAD.fst", "checked_file": "Model.AEAD.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "u102: Model.AEAD.aead_writer i -> Model.AEAD.info i", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.id", "Model.AEAD.aead_writer", "Model.AEAD.is_safe", "FStar.Pervasives.dfst", "Model.AEAD.info", "LowStar.Buffer.pointer", "Model.AEAD.log", "Model.AEAD.model_writer", "Prims.bool", "FStar.Pervasives.Native.fst", "Spec.Agile.AEAD.kv", "Model.Indexing.ae_id_ginfo", "Model.AEAD.unsafe_writer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val wgetinfo: #i:id -> aead_writer i -> Tot (info i)\nlet wgetinfo #i (u: aead_writer i) =", "completed_definiton": "if is_safe i then dfst (u <: model_writer i) else fst (u <: unsafe_writer i)", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fst", "name": "Model.AEAD.wfootprint", "original_source_type": "val wfootprint: #i:id -> aead_writer i -> GTot B.loc", "source_type": "val wfootprint: #i:id -> aead_writer i -> GTot B.loc", "source_definition": "let wfootprint #i w =\n if is_safe i then\n B.loc_addr_of_buffer (dsnd (w <: model_writer i))\n else\n B.loc_none", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 50, "start_col": 2, "end_line": 53, "end_col": 14 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\nopen LowStar.BufferOps\nopen Model.Helpers\n\nlet log #i (u: info i): Type0 =\n Seq.seq (entry i u)\n\nlet model_writer i: Type u#1 =\n u:info i & B.pointer (log #i u)\n\nlet unsafe_writer i =\n info i & Spec.kv (I.ae_id_ginfo i)\n\nlet aead_writer (i: id): Type u#1 =\n if is_safe i then\n model_writer i\n else\n unsafe_writer i\n\nlet aead_reader #i (w: aead_writer i) =\n w':aead_writer i { w' == w }\n\nlet wgetinfo #i (u: aead_writer i) =\n if is_safe i then\n dfst (u <: model_writer i)\n else\n fst (u <: unsafe_writer i)\n\nlet rgetinfo #_ #w _ =\n wgetinfo w\n\nlet wlog #i w h =\n B.deref h (dsnd (w <: model_writer i))\n\nlet wkey #i w =\n snd (w <: unsafe_writer i)", "dependencies": { "source_file": "Model.AEAD.fst", "checked_file": "Model.AEAD.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.AEAD.aead_writer i -> Prims.GTot LowStar.Monotonic.Buffer.loc", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.id", "Model.AEAD.aead_writer", "Model.AEAD.is_safe", "LowStar.Monotonic.Buffer.loc_addr_of_buffer", "Model.AEAD.log", "Prims.__proj__Mkdtuple2__item___1", "Model.AEAD.info", "LowStar.Buffer.pointer", "LowStar.Buffer.trivial_preorder", "FStar.Pervasives.dsnd", "Model.AEAD.model_writer", "Prims.bool", "LowStar.Monotonic.Buffer.loc_none", "LowStar.Monotonic.Buffer.loc" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val wfootprint: #i:id -> aead_writer i -> GTot B.loc\nlet wfootprint #i w =", "completed_definiton": "if is_safe i then B.loc_addr_of_buffer (dsnd (w <: model_writer i)) else B.loc_none", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fst", "name": "Model.AEAD.gen_reader", "original_source_type": "val gen_reader (#i: id) (w: aead_writer i) : ST (aead_reader w)\n (requires (fun h -> winvariant w h))\n (ensures (fun h0 r h1 -> h0 == h1))", "source_type": "val gen_reader (#i: id) (w: aead_writer i) : ST (aead_reader w)\n (requires (fun h -> winvariant w h))\n (ensures (fun h0 r h1 -> h0 == h1))", "source_definition": "let gen_reader #i w =\n w", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 76, "start_col": 2, "end_line": 76, "end_col": 3 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\nopen LowStar.BufferOps\nopen Model.Helpers\n\nlet log #i (u: info i): Type0 =\n Seq.seq (entry i u)\n\nlet model_writer i: Type u#1 =\n u:info i & B.pointer (log #i u)\n\nlet unsafe_writer i =\n info i & Spec.kv (I.ae_id_ginfo i)\n\nlet aead_writer (i: id): Type u#1 =\n if is_safe i then\n model_writer i\n else\n unsafe_writer i\n\nlet aead_reader #i (w: aead_writer i) =\n w':aead_writer i { w' == w }\n\nlet wgetinfo #i (u: aead_writer i) =\n if is_safe i then\n dfst (u <: model_writer i)\n else\n fst (u <: unsafe_writer i)\n\nlet rgetinfo #_ #w _ =\n wgetinfo w\n\nlet wlog #i w h =\n B.deref h (dsnd (w <: model_writer i))\n\nlet wkey #i w =\n snd (w <: unsafe_writer i)\n\nlet wfootprint #i w =\n if is_safe i then\n B.loc_addr_of_buffer (dsnd (w <: model_writer i))\n else\n B.loc_none\n\nlet winvariant #i w h =\n if is_safe i then\n B.live h (dsnd (w <: model_writer i))\n else\n True\n\nlet wframe_invariant #_ w h0 l h1 =\n ()\n\nlet frame_log #_ w h0 l h1 =\n ()\n\nlet gen i u =\n if is_safe i then\n let l: log #i u = Seq.empty #(entry i u) in\n ((| u, B.malloc q_ae_region l 1ul |) <: model_writer i)\n else\n let key_l = Spec.key_length u.alg in\n (u, random key_l) <: unsafe_writer i", "dependencies": { "source_file": "Model.AEAD.fst", "checked_file": "Model.AEAD.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.AEAD.aead_writer i -> FStar.HyperStack.ST.ST (Model.AEAD.aead_reader w)", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Model.AEAD.id", "Model.AEAD.aead_writer", "Model.AEAD.aead_reader" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val gen_reader (#i: id) (w: aead_writer i) : ST (aead_reader w)\n (requires (fun h -> winvariant w h))\n (ensures (fun h0 r h1 -> h0 == h1))\nlet gen_reader #i w =", "completed_definiton": "w", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fst", "name": "Model.AEAD.wlog", "original_source_type": "val wlog: #i:safe_id -> w:aead_writer i -> mem -> GTot (Seq.seq (entry i (wgetinfo w)))", "source_type": "val wlog: #i:safe_id -> w:aead_writer i -> mem -> GTot (Seq.seq (entry i (wgetinfo w)))", "source_definition": "let wlog #i w h =\n B.deref h (dsnd (w <: model_writer i))", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 44, "start_col": 2, "end_line": 44, "end_col": 40 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\nopen LowStar.BufferOps\nopen Model.Helpers\n\nlet log #i (u: info i): Type0 =\n Seq.seq (entry i u)\n\nlet model_writer i: Type u#1 =\n u:info i & B.pointer (log #i u)\n\nlet unsafe_writer i =\n info i & Spec.kv (I.ae_id_ginfo i)\n\nlet aead_writer (i: id): Type u#1 =\n if is_safe i then\n model_writer i\n else\n unsafe_writer i\n\nlet aead_reader #i (w: aead_writer i) =\n w':aead_writer i { w' == w }\n\nlet wgetinfo #i (u: aead_writer i) =\n if is_safe i then\n dfst (u <: model_writer i)\n else\n fst (u <: unsafe_writer i)\n\nlet rgetinfo #_ #w _ =\n wgetinfo w", "dependencies": { "source_file": "Model.AEAD.fst", "checked_file": "Model.AEAD.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.AEAD.aead_writer i -> h: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot (FStar.Seq.Base.seq (Model.AEAD.entry i (Model.AEAD.wgetinfo w)))", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.safe_id", "Model.AEAD.aead_writer", "FStar.Monotonic.HyperStack.mem", "LowStar.Monotonic.Buffer.deref", "Model.AEAD.log", "Prims.__proj__Mkdtuple2__item___1", "Model.AEAD.info", "LowStar.Buffer.pointer", "LowStar.Buffer.trivial_preorder", "FStar.Pervasives.dsnd", "Model.AEAD.model_writer", "FStar.Seq.Base.seq", "Model.AEAD.entry", "Model.AEAD.wgetinfo" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val wlog: #i:safe_id -> w:aead_writer i -> mem -> GTot (Seq.seq (entry i (wgetinfo w)))\nlet wlog #i w h =", "completed_definiton": "B.deref h (dsnd (w <: model_writer i))", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fst", "name": "Model.AEAD.winvariant", "original_source_type": "val winvariant : #i:id -> aead_writer i -> mem -> Type0", "source_type": "val winvariant : #i:id -> aead_writer i -> mem -> Type0", "source_definition": "let winvariant #i w h =\n if is_safe i then\n B.live h (dsnd (w <: model_writer i))\n else\n True", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 56, "start_col": 2, "end_line": 59, "end_col": 8 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\nopen LowStar.BufferOps\nopen Model.Helpers\n\nlet log #i (u: info i): Type0 =\n Seq.seq (entry i u)\n\nlet model_writer i: Type u#1 =\n u:info i & B.pointer (log #i u)\n\nlet unsafe_writer i =\n info i & Spec.kv (I.ae_id_ginfo i)\n\nlet aead_writer (i: id): Type u#1 =\n if is_safe i then\n model_writer i\n else\n unsafe_writer i\n\nlet aead_reader #i (w: aead_writer i) =\n w':aead_writer i { w' == w }\n\nlet wgetinfo #i (u: aead_writer i) =\n if is_safe i then\n dfst (u <: model_writer i)\n else\n fst (u <: unsafe_writer i)\n\nlet rgetinfo #_ #w _ =\n wgetinfo w\n\nlet wlog #i w h =\n B.deref h (dsnd (w <: model_writer i))\n\nlet wkey #i w =\n snd (w <: unsafe_writer i)\n\nlet wfootprint #i w =\n if is_safe i then\n B.loc_addr_of_buffer (dsnd (w <: model_writer i))\n else\n B.loc_none", "dependencies": { "source_file": "Model.AEAD.fst", "checked_file": "Model.AEAD.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.AEAD.aead_writer i -> h: FStar.Monotonic.HyperStack.mem -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.id", "Model.AEAD.aead_writer", "FStar.Monotonic.HyperStack.mem", "Model.AEAD.is_safe", "LowStar.Monotonic.Buffer.live", "Model.AEAD.log", "Prims.__proj__Mkdtuple2__item___1", "Model.AEAD.info", "LowStar.Buffer.pointer", "LowStar.Buffer.trivial_preorder", "FStar.Pervasives.dsnd", "Model.AEAD.model_writer", "Prims.bool", "Prims.l_True" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val winvariant : #i:id -> aead_writer i -> mem -> Type0\nlet winvariant #i w h =", "completed_definiton": "if is_safe i then B.live h (dsnd (w <: model_writer i)) else True", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fst", "name": "Model.AEAD.coerce", "original_source_type": "val coerce (#i:unsafe_id) (u:info i)\n (kv:Spec.kv u.alg)\n : ST (aead_writer i)\n (requires fun h0 -> True)\n (ensures fun h0 w h1 ->\n winvariant w h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (wfootprint w) h0 h1 /\\\n B.(loc_includes (loc_ae_region ()) (wfootprint w)) /\\\n wgetinfo w == u /\\\n wkey w == kv\n )", "source_type": "val coerce (#i:unsafe_id) (u:info i)\n (kv:Spec.kv u.alg)\n : ST (aead_writer i)\n (requires fun h0 -> True)\n (ensures fun h0 w h1 ->\n winvariant w h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (wfootprint w) h0 h1 /\\\n B.(loc_includes (loc_ae_region ()) (wfootprint w)) /\\\n wgetinfo w == u /\\\n wkey w == kv\n )", "source_definition": "let coerce #i u kv =\n (u, kv) <: unsafe_writer i", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 79, "start_col": 2, "end_line": 79, "end_col": 28 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\nopen LowStar.BufferOps\nopen Model.Helpers\n\nlet log #i (u: info i): Type0 =\n Seq.seq (entry i u)\n\nlet model_writer i: Type u#1 =\n u:info i & B.pointer (log #i u)\n\nlet unsafe_writer i =\n info i & Spec.kv (I.ae_id_ginfo i)\n\nlet aead_writer (i: id): Type u#1 =\n if is_safe i then\n model_writer i\n else\n unsafe_writer i\n\nlet aead_reader #i (w: aead_writer i) =\n w':aead_writer i { w' == w }\n\nlet wgetinfo #i (u: aead_writer i) =\n if is_safe i then\n dfst (u <: model_writer i)\n else\n fst (u <: unsafe_writer i)\n\nlet rgetinfo #_ #w _ =\n wgetinfo w\n\nlet wlog #i w h =\n B.deref h (dsnd (w <: model_writer i))\n\nlet wkey #i w =\n snd (w <: unsafe_writer i)\n\nlet wfootprint #i w =\n if is_safe i then\n B.loc_addr_of_buffer (dsnd (w <: model_writer i))\n else\n B.loc_none\n\nlet winvariant #i w h =\n if is_safe i then\n B.live h (dsnd (w <: model_writer i))\n else\n True\n\nlet wframe_invariant #_ w h0 l h1 =\n ()\n\nlet frame_log #_ w h0 l h1 =\n ()\n\nlet gen i u =\n if is_safe i then\n let l: log #i u = Seq.empty #(entry i u) in\n ((| u, B.malloc q_ae_region l 1ul |) <: model_writer i)\n else\n let key_l = Spec.key_length u.alg in\n (u, random key_l) <: unsafe_writer i\n\nlet gen_reader #i w =\n w", "dependencies": { "source_file": "Model.AEAD.fst", "checked_file": "Model.AEAD.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "u138: Model.AEAD.info i -> kv: Spec.Agile.AEAD.kv (Mkinfo'?.alg u138)\n -> FStar.HyperStack.ST.ST (Model.AEAD.aead_writer i)", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Model.AEAD.unsafe_id", "Model.AEAD.info", "Spec.Agile.AEAD.kv", "Model.AEAD.__proj__Mkinfo'__item__alg", "FStar.Pervasives.Native.Mktuple2", "Model.Indexing.ae_id_ginfo", "Model.AEAD.unsafe_writer", "Model.AEAD.aead_writer" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val coerce (#i:unsafe_id) (u:info i)\n (kv:Spec.kv u.alg)\n : ST (aead_writer i)\n (requires fun h0 -> True)\n (ensures fun h0 w h1 ->\n winvariant w h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (wfootprint w) h0 h1 /\\\n B.(loc_includes (loc_ae_region ()) (wfootprint w)) /\\\n wgetinfo w == u /\\\n wkey w == kv\n )\nlet coerce #i u kv =", "completed_definiton": "(u, kv) <: unsafe_writer i", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fst", "name": "Model.AEAD.gen", "original_source_type": "val gen (i:id) (u:info i) : ST (aead_writer i)\n (requires (fun h -> True))\n (ensures (fun h0 w h1 ->\n winvariant w h1 /\\\n\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (wfootprint w) h0 h1 /\\\n B.(loc_includes (loc_ae_region ()) (wfootprint w)) /\\\n\n wgetinfo w == u /\\\n (I.ideal_AEAD && I.is_ae_honest i ==> wlog w h1 == Seq.empty)))", "source_type": "val gen (i:id) (u:info i) : ST (aead_writer i)\n (requires (fun h -> True))\n (ensures (fun h0 w h1 ->\n winvariant w h1 /\\\n\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (wfootprint w) h0 h1 /\\\n B.(loc_includes (loc_ae_region ()) (wfootprint w)) /\\\n\n wgetinfo w == u /\\\n (I.ideal_AEAD && I.is_ae_honest i ==> wlog w h1 == Seq.empty)))", "source_definition": "let gen i u =\n if is_safe i then\n let l: log #i u = Seq.empty #(entry i u) in\n ((| u, B.malloc q_ae_region l 1ul |) <: model_writer i)\n else\n let key_l = Spec.key_length u.alg in\n (u, random key_l) <: unsafe_writer i", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 68, "start_col": 2, "end_line": 73, "end_col": 40 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\nopen LowStar.BufferOps\nopen Model.Helpers\n\nlet log #i (u: info i): Type0 =\n Seq.seq (entry i u)\n\nlet model_writer i: Type u#1 =\n u:info i & B.pointer (log #i u)\n\nlet unsafe_writer i =\n info i & Spec.kv (I.ae_id_ginfo i)\n\nlet aead_writer (i: id): Type u#1 =\n if is_safe i then\n model_writer i\n else\n unsafe_writer i\n\nlet aead_reader #i (w: aead_writer i) =\n w':aead_writer i { w' == w }\n\nlet wgetinfo #i (u: aead_writer i) =\n if is_safe i then\n dfst (u <: model_writer i)\n else\n fst (u <: unsafe_writer i)\n\nlet rgetinfo #_ #w _ =\n wgetinfo w\n\nlet wlog #i w h =\n B.deref h (dsnd (w <: model_writer i))\n\nlet wkey #i w =\n snd (w <: unsafe_writer i)\n\nlet wfootprint #i w =\n if is_safe i then\n B.loc_addr_of_buffer (dsnd (w <: model_writer i))\n else\n B.loc_none\n\nlet winvariant #i w h =\n if is_safe i then\n B.live h (dsnd (w <: model_writer i))\n else\n True\n\nlet wframe_invariant #_ w h0 l h1 =\n ()\n\nlet frame_log #_ w h0 l h1 =\n ()", "dependencies": { "source_file": "Model.AEAD.fst", "checked_file": "Model.AEAD.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: Model.AEAD.id -> u133: Model.AEAD.info i -> FStar.HyperStack.ST.ST (Model.AEAD.aead_writer i)", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Model.AEAD.id", "Model.AEAD.info", "Model.AEAD.is_safe", "Prims.Mkdtuple2", "LowStar.Buffer.pointer", "Model.AEAD.log", "Model.AEAD.model_writer", "LowStar.Buffer.malloc", "Mem.q_ae_region", "FStar.UInt32.__uint_to_t", "LowStar.Monotonic.Buffer.mbuffer", "LowStar.Buffer.trivial_preorder", "Prims.l_and", "Prims.eq2", "Prims.nat", "LowStar.Monotonic.Buffer.length", "FStar.UInt32.v", "Prims.b2t", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "FStar.Monotonic.HyperHeap.rid", "LowStar.Monotonic.Buffer.frameOf", "LowStar.Monotonic.Buffer.freeable", "FStar.Seq.Base.empty", "Model.AEAD.entry", "Model.AEAD.aead_writer", "Prims.bool", "FStar.Pervasives.Native.Mktuple2", "Spec.Agile.AEAD.kv", "Model.Indexing.ae_id_ginfo", "Model.AEAD.unsafe_writer", "Model.Helpers.random", "Model.Helpers.lbytes", "FStar.Integers.int_t", "FStar.Integers.Signed", "FStar.Integers.Winfinite", "Prims.op_GreaterThanOrEqual", "Spec.Agile.AEAD.key_length", "Model.AEAD.__proj__Mkinfo'__item__alg" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val gen (i:id) (u:info i) : ST (aead_writer i)\n (requires (fun h -> True))\n (ensures (fun h0 w h1 ->\n winvariant w h1 /\\\n\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (wfootprint w) h0 h1 /\\\n B.(loc_includes (loc_ae_region ()) (wfootprint w)) /\\\n\n wgetinfo w == u /\\\n (I.ideal_AEAD && I.is_ae_honest i ==> wlog w h1 == Seq.empty)))\nlet gen i u =", "completed_definiton": "if is_safe i\nthen\n let l:log #i u = Seq.empty #(entry i u) in\n ((| u, B.malloc q_ae_region l 1ul |) <: model_writer i)\nelse\n let key_l = Spec.key_length u.alg in\n (u, random key_l) <: unsafe_writer i", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fst", "name": "Model.AEAD.quic_coerce", "original_source_type": "val quic_coerce (#i:unsafe_id) (u:info i)\n (ts:traffic_secret u.halg)\n : ST (aead_writer i)\n (requires fun h0 -> True)\n (ensures fun h0 w h1 ->\n winvariant w h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (wfootprint w) h0 h1 /\\\n B.(loc_includes (loc_ae_region ()) (wfootprint w)) /\\\n wgetinfo w == u /\\\n wkey w ==\n QUIC.Spec.derive_secret u.halg ts\n QUIC.Spec.label_key (Spec.key_length u.alg)\n )", "source_type": "val quic_coerce (#i:unsafe_id) (u:info i)\n (ts:traffic_secret u.halg)\n : ST (aead_writer i)\n (requires fun h0 -> True)\n (ensures fun h0 w h1 ->\n winvariant w h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (wfootprint w) h0 h1 /\\\n B.(loc_includes (loc_ae_region ()) (wfootprint w)) /\\\n wgetinfo w == u /\\\n wkey w ==\n QUIC.Spec.derive_secret u.halg ts\n QUIC.Spec.label_key (Spec.key_length u.alg)\n )", "source_definition": "let quic_coerce #i u ts =\n coerce u\n (QUIC.Spec.derive_secret u.halg ts\n QUIC.Spec.label_key (Spec.key_length u.alg))", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 83, "start_col": 2, "end_line": 85, "end_col": 50 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\nopen LowStar.BufferOps\nopen Model.Helpers\n\nlet log #i (u: info i): Type0 =\n Seq.seq (entry i u)\n\nlet model_writer i: Type u#1 =\n u:info i & B.pointer (log #i u)\n\nlet unsafe_writer i =\n info i & Spec.kv (I.ae_id_ginfo i)\n\nlet aead_writer (i: id): Type u#1 =\n if is_safe i then\n model_writer i\n else\n unsafe_writer i\n\nlet aead_reader #i (w: aead_writer i) =\n w':aead_writer i { w' == w }\n\nlet wgetinfo #i (u: aead_writer i) =\n if is_safe i then\n dfst (u <: model_writer i)\n else\n fst (u <: unsafe_writer i)\n\nlet rgetinfo #_ #w _ =\n wgetinfo w\n\nlet wlog #i w h =\n B.deref h (dsnd (w <: model_writer i))\n\nlet wkey #i w =\n snd (w <: unsafe_writer i)\n\nlet wfootprint #i w =\n if is_safe i then\n B.loc_addr_of_buffer (dsnd (w <: model_writer i))\n else\n B.loc_none\n\nlet winvariant #i w h =\n if is_safe i then\n B.live h (dsnd (w <: model_writer i))\n else\n True\n\nlet wframe_invariant #_ w h0 l h1 =\n ()\n\nlet frame_log #_ w h0 l h1 =\n ()\n\nlet gen i u =\n if is_safe i then\n let l: log #i u = Seq.empty #(entry i u) in\n ((| u, B.malloc q_ae_region l 1ul |) <: model_writer i)\n else\n let key_l = Spec.key_length u.alg in\n (u, random key_l) <: unsafe_writer i\n\nlet gen_reader #i w =\n w\n\nlet coerce #i u kv =\n (u, kv) <: unsafe_writer i\n\n// With QUIC-specific derivation of key from transport secret", "dependencies": { "source_file": "Model.AEAD.fst", "checked_file": "Model.AEAD.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "u141: Model.AEAD.info i -> ts: Model.AEAD.traffic_secret (Mkinfo'?.halg u141)\n -> FStar.HyperStack.ST.ST (Model.AEAD.aead_writer i)", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Model.AEAD.unsafe_id", "Model.AEAD.info", "Model.AEAD.traffic_secret", "Model.AEAD.__proj__Mkinfo'__item__halg", "Model.AEAD.coerce", "QUIC.Spec.Crypto.derive_secret", "QUIC.Spec.Crypto.label_key", "Spec.Agile.AEAD.key_length", "Model.AEAD.__proj__Mkinfo'__item__alg", "Model.AEAD.aead_writer" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val quic_coerce (#i:unsafe_id) (u:info i)\n (ts:traffic_secret u.halg)\n : ST (aead_writer i)\n (requires fun h0 -> True)\n (ensures fun h0 w h1 ->\n winvariant w h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (wfootprint w) h0 h1 /\\\n B.(loc_includes (loc_ae_region ()) (wfootprint w)) /\\\n wgetinfo w == u /\\\n wkey w ==\n QUIC.Spec.derive_secret u.halg ts\n QUIC.Spec.label_key (Spec.key_length u.alg)\n )\nlet quic_coerce #i u ts =", "completed_definiton": "coerce u (QUIC.Spec.derive_secret u.halg ts QUIC.Spec.label_key (Spec.key_length u.alg))", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fst", "name": "Model.AEAD.encrypt", "original_source_type": "val encrypt\n (i: id)\n (w: aead_writer i)\n (n: nonce)\n (aad: ad (wgetinfo w))\n (l: at_least (wgetinfo w))\n (p: plain (wgetinfo w) l)\n : Stack (cipher (wgetinfo w) l)\n (requires (fun h0 ->\n winvariant w h0 /\\\n (is_safe i ==> fresh_nonce w n h0)))\n (ensures (fun h0 c h1 ->\n B.modifies (wfootprint w) h0 h1 /\\\n winvariant w h1 /\\\n (is_safe i ==>\n wlog w h1 == Seq.snoc (wlog w h0) (Entry n aad p c)) /\\\n (~ (is_safe i) ==> (\n let a: Spec.supported_alg = I.ae_id_ginfo i in\n let k: Spec.kv a = wkey w in\n let iv : Spec.iv a = Model.Helpers.hide n in\n let p = (wgetinfo w).plain_pkg.as_bytes i l p in\n c == Spec.encrypt #(I.ae_id_ginfo i) k iv aad p))))", "source_type": "val encrypt\n (i: id)\n (w: aead_writer i)\n (n: nonce)\n (aad: ad (wgetinfo w))\n (l: at_least (wgetinfo w))\n (p: plain (wgetinfo w) l)\n : Stack (cipher (wgetinfo w) l)\n (requires (fun h0 ->\n winvariant w h0 /\\\n (is_safe i ==> fresh_nonce w n h0)))\n (ensures (fun h0 c h1 ->\n B.modifies (wfootprint w) h0 h1 /\\\n winvariant w h1 /\\\n (is_safe i ==>\n wlog w h1 == Seq.snoc (wlog w h0) (Entry n aad p c)) /\\\n (~ (is_safe i) ==> (\n let a: Spec.supported_alg = I.ae_id_ginfo i in\n let k: Spec.kv a = wkey w in\n let iv : Spec.iv a = Model.Helpers.hide n in\n let p = (wgetinfo w).plain_pkg.as_bytes i l p in\n c == Spec.encrypt #(I.ae_id_ginfo i) k iv aad p))))", "source_definition": "let encrypt i w nonce aad plain_length plain =\n if is_safe i then\n let a = (wgetinfo w).alg in\n let w: model_writer i = w in\n let p = dsnd w in\n let log = !*p in\n let cipher_length = (plain_length <: nat) + Spec.tag_length a in\n let cipher = random cipher_length in\n p *= Seq.snoc log (Entry #i #(wgetinfo w) nonce aad #plain_length plain cipher);\n cipher\n else\n let a = (wgetinfo w).alg in\n let k: Spec.kv a = wkey w in\n let iv = Helpers.hide nonce in\n let p = (wgetinfo w).plain_pkg.repr i plain_length plain in\n Spec.encrypt #a k iv aad p", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 88, "start_col": 2, "end_line": 102, "end_col": 30 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\nopen LowStar.BufferOps\nopen Model.Helpers\n\nlet log #i (u: info i): Type0 =\n Seq.seq (entry i u)\n\nlet model_writer i: Type u#1 =\n u:info i & B.pointer (log #i u)\n\nlet unsafe_writer i =\n info i & Spec.kv (I.ae_id_ginfo i)\n\nlet aead_writer (i: id): Type u#1 =\n if is_safe i then\n model_writer i\n else\n unsafe_writer i\n\nlet aead_reader #i (w: aead_writer i) =\n w':aead_writer i { w' == w }\n\nlet wgetinfo #i (u: aead_writer i) =\n if is_safe i then\n dfst (u <: model_writer i)\n else\n fst (u <: unsafe_writer i)\n\nlet rgetinfo #_ #w _ =\n wgetinfo w\n\nlet wlog #i w h =\n B.deref h (dsnd (w <: model_writer i))\n\nlet wkey #i w =\n snd (w <: unsafe_writer i)\n\nlet wfootprint #i w =\n if is_safe i then\n B.loc_addr_of_buffer (dsnd (w <: model_writer i))\n else\n B.loc_none\n\nlet winvariant #i w h =\n if is_safe i then\n B.live h (dsnd (w <: model_writer i))\n else\n True\n\nlet wframe_invariant #_ w h0 l h1 =\n ()\n\nlet frame_log #_ w h0 l h1 =\n ()\n\nlet gen i u =\n if is_safe i then\n let l: log #i u = Seq.empty #(entry i u) in\n ((| u, B.malloc q_ae_region l 1ul |) <: model_writer i)\n else\n let key_l = Spec.key_length u.alg in\n (u, random key_l) <: unsafe_writer i\n\nlet gen_reader #i w =\n w\n\nlet coerce #i u kv =\n (u, kv) <: unsafe_writer i\n\n// With QUIC-specific derivation of key from transport secret\nlet quic_coerce #i u ts =\n coerce u\n (QUIC.Spec.derive_secret u.halg ts\n QUIC.Spec.label_key (Spec.key_length u.alg))", "dependencies": { "source_file": "Model.AEAD.fst", "checked_file": "Model.AEAD.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n i: Model.AEAD.id ->\n w: Model.AEAD.aead_writer i ->\n n: Model.AEAD.nonce ->\n aad: Model.AEAD.ad (Model.AEAD.wgetinfo w) ->\n l: Model.AEAD.at_least (Model.AEAD.wgetinfo w) ->\n p: Model.AEAD.plain (Model.AEAD.wgetinfo w) l\n -> FStar.HyperStack.ST.Stack (Model.AEAD.cipher (Model.AEAD.wgetinfo w) l)", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Model.AEAD.id", "Model.AEAD.aead_writer", "Model.AEAD.nonce", "Model.AEAD.ad", "Model.AEAD.wgetinfo", "Model.AEAD.at_least", "Model.AEAD.plain", "Model.AEAD.is_safe", "Model.AEAD.cipher", "Prims.unit", "LowStar.BufferOps.op_Star_Equals", "Model.AEAD.log", "Prims.__proj__Mkdtuple2__item___1", "Model.AEAD.info", "LowStar.Buffer.pointer", "LowStar.Buffer.trivial_preorder", "FStar.Seq.Properties.snoc", "Model.AEAD.entry", "Model.AEAD.Entry", "Model.Helpers.lbytes", "Model.Helpers.random", "Prims.int", "Prims.op_Addition", "Prims.nat", "Spec.Agile.AEAD.tag_length", "LowStar.BufferOps.op_Bang_Star", "FStar.Pervasives.dsnd", "Model.AEAD.model_writer", "Model.AEAD.alg", "Model.AEAD.__proj__Mkinfo'__item__alg", "Prims.bool", "Spec.Agile.AEAD.encrypt", "Spec.Agile.AEAD.lbytes", "Prims.eq2", "Model.AEAD.__proj__PlainPkg__item__as_bytes", "Model.AEAD.__proj__Mkinfo'__item__min_len", "Model.AEAD.__proj__Mkinfo'__item__plain_pkg", "Model.AEAD.__proj__PlainPkg__item__repr", "FStar.Seq.Base.length", "FStar.UInt8.t", "Model.Helpers.hide", "Spec.Agile.AEAD.kv", "Model.AEAD.wkey" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val encrypt\n (i: id)\n (w: aead_writer i)\n (n: nonce)\n (aad: ad (wgetinfo w))\n (l: at_least (wgetinfo w))\n (p: plain (wgetinfo w) l)\n : Stack (cipher (wgetinfo w) l)\n (requires (fun h0 ->\n winvariant w h0 /\\\n (is_safe i ==> fresh_nonce w n h0)))\n (ensures (fun h0 c h1 ->\n B.modifies (wfootprint w) h0 h1 /\\\n winvariant w h1 /\\\n (is_safe i ==>\n wlog w h1 == Seq.snoc (wlog w h0) (Entry n aad p c)) /\\\n (~ (is_safe i) ==> (\n let a: Spec.supported_alg = I.ae_id_ginfo i in\n let k: Spec.kv a = wkey w in\n let iv : Spec.iv a = Model.Helpers.hide n in\n let p = (wgetinfo w).plain_pkg.as_bytes i l p in\n c == Spec.encrypt #(I.ae_id_ginfo i) k iv aad p))))\nlet encrypt i w nonce aad plain_length plain =", "completed_definiton": "if is_safe i\nthen\n let a = (wgetinfo w).alg in\n let w:model_writer i = w in\n let p = dsnd w in\n let log = !*p in\n let cipher_length = (plain_length <: nat) + Spec.tag_length a in\n let cipher = random cipher_length in\n p *= Seq.snoc log (Entry #i #(wgetinfo w) nonce aad #plain_length plain cipher);\n cipher\nelse\n let a = (wgetinfo w).alg in\n let k:Spec.kv a = wkey w in\n let iv = Helpers.hide nonce in\n let p = (wgetinfo w).plain_pkg.repr i plain_length plain in\n Spec.encrypt #a k iv aad p", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fst", "name": "Model.AEAD.decrypt", "original_source_type": "val decrypt\n (i: id)\n (#w: aead_writer i)\n (r: aead_reader w)\n (aad: ad (wgetinfo w))\n (n: nonce)\n (l:at_least (wgetinfo w))\n (c:cipher (wgetinfo w) l)\n : Stack (option (plain (rgetinfo r) l))\n (requires (fun h0 ->\n winvariant w h0))\n (ensures fun h0 res h1 ->\n winvariant w h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n (is_safe i ==>\n // feels like we should state something more interesting, e.g. if we\n // take all the entries in the log that match this nonce, then there is\n // exactly one\n (match wentry_for_nonce w n h0 with\n | None -> None? res\n | Some (Entry n' aad' #l' p' c') ->\n // We know that n == n' here, owing to the definition of wentry_for_nonce.\n let matches = aad' == aad /\\ c' == c /\\ l == l' in\n (matches ==> res = Some p') /\\\n (~matches ==> res = None)\n )\n ) /\\\n (~ (is_safe i) ==> (\n let a: Spec.supported_alg = I.ae_id_ginfo i in\n let k: Spec.kv a = wkey w in\n let iv : Spec.iv a = Helpers.hide n in\n let maybe_plain = Spec.decrypt k iv aad c in\n match maybe_plain with\n | None -> None? res\n | Some p ->\n Some? res /\\ (\n let p' = (wgetinfo w).plain_pkg.as_bytes i l (Some?.v res) in\n p == p')\n ))\n )", "source_type": "val decrypt\n (i: id)\n (#w: aead_writer i)\n (r: aead_reader w)\n (aad: ad (wgetinfo w))\n (n: nonce)\n (l:at_least (wgetinfo w))\n (c:cipher (wgetinfo w) l)\n : Stack (option (plain (rgetinfo r) l))\n (requires (fun h0 ->\n winvariant w h0))\n (ensures fun h0 res h1 ->\n winvariant w h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n (is_safe i ==>\n // feels like we should state something more interesting, e.g. if we\n // take all the entries in the log that match this nonce, then there is\n // exactly one\n (match wentry_for_nonce w n h0 with\n | None -> None? res\n | Some (Entry n' aad' #l' p' c') ->\n // We know that n == n' here, owing to the definition of wentry_for_nonce.\n let matches = aad' == aad /\\ c' == c /\\ l == l' in\n (matches ==> res = Some p') /\\\n (~matches ==> res = None)\n )\n ) /\\\n (~ (is_safe i) ==> (\n let a: Spec.supported_alg = I.ae_id_ginfo i in\n let k: Spec.kv a = wkey w in\n let iv : Spec.iv a = Helpers.hide n in\n let maybe_plain = Spec.decrypt k iv aad c in\n match maybe_plain with\n | None -> None? res\n | Some p ->\n Some? res /\\ (\n let p' = (wgetinfo w).plain_pkg.as_bytes i l (Some?.v res) in\n p == p')\n ))\n )", "source_definition": "let decrypt i #w r aad n l c =\n if is_safe i then\n let w: model_writer i = w in\n let log = !*(dsnd w) in\n match Seq.find_l (nonce_filter w n) log with\n | None -> None\n | Some (Entry n' aad' #l' p' c') ->\n assert (n == n');\n if lbytes_eq aad aad' && lbytes_eq c c' && l = l' then\n Some p'\n else\n None\n else\n let a = (wgetinfo w).alg in\n let k: Spec.kv a = wkey w in\n match Spec.decrypt k (Helpers.hide n) aad c with\n | None -> None\n | Some p ->\n Some ((wgetinfo w).plain_pkg.mk i (Seq.length p) p)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 105, "start_col": 2, "end_line": 122, "end_col": 59 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\nopen LowStar.BufferOps\nopen Model.Helpers\n\nlet log #i (u: info i): Type0 =\n Seq.seq (entry i u)\n\nlet model_writer i: Type u#1 =\n u:info i & B.pointer (log #i u)\n\nlet unsafe_writer i =\n info i & Spec.kv (I.ae_id_ginfo i)\n\nlet aead_writer (i: id): Type u#1 =\n if is_safe i then\n model_writer i\n else\n unsafe_writer i\n\nlet aead_reader #i (w: aead_writer i) =\n w':aead_writer i { w' == w }\n\nlet wgetinfo #i (u: aead_writer i) =\n if is_safe i then\n dfst (u <: model_writer i)\n else\n fst (u <: unsafe_writer i)\n\nlet rgetinfo #_ #w _ =\n wgetinfo w\n\nlet wlog #i w h =\n B.deref h (dsnd (w <: model_writer i))\n\nlet wkey #i w =\n snd (w <: unsafe_writer i)\n\nlet wfootprint #i w =\n if is_safe i then\n B.loc_addr_of_buffer (dsnd (w <: model_writer i))\n else\n B.loc_none\n\nlet winvariant #i w h =\n if is_safe i then\n B.live h (dsnd (w <: model_writer i))\n else\n True\n\nlet wframe_invariant #_ w h0 l h1 =\n ()\n\nlet frame_log #_ w h0 l h1 =\n ()\n\nlet gen i u =\n if is_safe i then\n let l: log #i u = Seq.empty #(entry i u) in\n ((| u, B.malloc q_ae_region l 1ul |) <: model_writer i)\n else\n let key_l = Spec.key_length u.alg in\n (u, random key_l) <: unsafe_writer i\n\nlet gen_reader #i w =\n w\n\nlet coerce #i u kv =\n (u, kv) <: unsafe_writer i\n\n// With QUIC-specific derivation of key from transport secret\nlet quic_coerce #i u ts =\n coerce u\n (QUIC.Spec.derive_secret u.halg ts\n QUIC.Spec.label_key (Spec.key_length u.alg))\n\nlet encrypt i w nonce aad plain_length plain =\n if is_safe i then\n let a = (wgetinfo w).alg in\n let w: model_writer i = w in\n let p = dsnd w in\n let log = !*p in\n let cipher_length = (plain_length <: nat) + Spec.tag_length a in\n let cipher = random cipher_length in\n p *= Seq.snoc log (Entry #i #(wgetinfo w) nonce aad #plain_length plain cipher);\n cipher\n else\n let a = (wgetinfo w).alg in\n let k: Spec.kv a = wkey w in\n let iv = Helpers.hide nonce in\n let p = (wgetinfo w).plain_pkg.repr i plain_length plain in\n Spec.encrypt #a k iv aad p", "dependencies": { "source_file": "Model.AEAD.fst", "checked_file": "Model.AEAD.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n i: Model.AEAD.id ->\n r: Model.AEAD.aead_reader w ->\n aad: Model.AEAD.ad (Model.AEAD.wgetinfo w) ->\n n: Model.AEAD.nonce ->\n l: Model.AEAD.at_least (Model.AEAD.wgetinfo w) ->\n c: Model.AEAD.cipher (Model.AEAD.wgetinfo w) l\n -> FStar.HyperStack.ST.Stack\n (FStar.Pervasives.Native.option (Model.AEAD.plain (Model.AEAD.rgetinfo r) l))", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Model.AEAD.id", "Model.AEAD.aead_writer", "Model.AEAD.aead_reader", "Model.AEAD.ad", "Model.AEAD.wgetinfo", "Model.AEAD.nonce", "Model.AEAD.at_least", "Model.AEAD.cipher", "Model.AEAD.is_safe", "FStar.Seq.Properties.find_l", "Model.AEAD.entry", "Prims.__proj__Mkdtuple2__item___1", "Model.AEAD.info", "LowStar.Buffer.pointer", "Model.AEAD.log", "Model.AEAD.nonce_filter", "FStar.Pervasives.Native.None", "Model.AEAD.plain", "Model.AEAD.rgetinfo", "Prims.op_AmpAmp", "Model.Helpers.lbytes_eq", "Prims.op_Equality", "Model.AEAD.plain_length", "Prims.l_or", "Prims.b2t", "Prims.op_LessThanOrEqual", "Model.AEAD.__proj__Mkinfo'__item__min_len", "FStar.Pervasives.Native.Some", "Prims.bool", "FStar.Pervasives.Native.option", "Prims.unit", "Prims._assert", "Prims.eq2", "LowStar.BufferOps.op_Bang_Star", "LowStar.Buffer.trivial_preorder", "FStar.Pervasives.dsnd", "Model.AEAD.model_writer", "Spec.Agile.AEAD.decrypt", "Model.Helpers.hide", "Spec.Agile.AEAD.decrypted", "Model.AEAD.__proj__PlainPkg__item__mk", "Model.AEAD.__proj__Mkinfo'__item__plain_pkg", "FStar.Seq.Base.length", "Spec.Agile.AEAD.uint8", "Spec.Agile.AEAD.kv", "Model.AEAD.wkey", "Model.AEAD.alg", "Model.AEAD.__proj__Mkinfo'__item__alg" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val decrypt\n (i: id)\n (#w: aead_writer i)\n (r: aead_reader w)\n (aad: ad (wgetinfo w))\n (n: nonce)\n (l:at_least (wgetinfo w))\n (c:cipher (wgetinfo w) l)\n : Stack (option (plain (rgetinfo r) l))\n (requires (fun h0 ->\n winvariant w h0))\n (ensures fun h0 res h1 ->\n winvariant w h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n (is_safe i ==>\n // feels like we should state something more interesting, e.g. if we\n // take all the entries in the log that match this nonce, then there is\n // exactly one\n (match wentry_for_nonce w n h0 with\n | None -> None? res\n | Some (Entry n' aad' #l' p' c') ->\n // We know that n == n' here, owing to the definition of wentry_for_nonce.\n let matches = aad' == aad /\\ c' == c /\\ l == l' in\n (matches ==> res = Some p') /\\\n (~matches ==> res = None)\n )\n ) /\\\n (~ (is_safe i) ==> (\n let a: Spec.supported_alg = I.ae_id_ginfo i in\n let k: Spec.kv a = wkey w in\n let iv : Spec.iv a = Helpers.hide n in\n let maybe_plain = Spec.decrypt k iv aad c in\n match maybe_plain with\n | None -> None? res\n | Some p ->\n Some? res /\\ (\n let p' = (wgetinfo w).plain_pkg.as_bytes i l (Some?.v res) in\n p == p')\n ))\n )\nlet decrypt i #w r aad n l c =", "completed_definiton": "if is_safe i\nthen\n let w:model_writer i = w in\n let log = !*(dsnd w) in\n match Seq.find_l (nonce_filter w n) log with\n | None -> None\n | Some (Entry n' aad' #l' p' c') ->\n assert (n == n');\n if lbytes_eq aad aad' && lbytes_eq c c' && l = l' then Some p' else None\nelse\n let a = (wgetinfo w).alg in\n let k:Spec.kv a = wkey w in\n match Spec.decrypt k (Helpers.hide n) aad c with\n | None -> None\n | Some p -> Some ((wgetinfo w).plain_pkg.mk i (Seq.length p) p)", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fsti", "name": "NotEverCrypt.CTR.alg", "original_source_type": "", "source_type": "val alg : Type0", "source_definition": "let alg = Spec.cipher_alg", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 14, "start_col": 10, "end_line": 14, "end_col": 25 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nmodule Spec = Spec.Agile.CTR\n\nopen FStar.HyperStack.ST\nopen EverCrypt.Error", "dependencies": { "source_file": "NotEverCrypt.CTR.fsti", "checked_file": "NotEverCrypt.CTR.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Loops.fst.checked", "Spec.Agile.CTR.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Spec.Agile.Cipher.cipher_alg" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let alg =", "completed_definiton": "Spec.cipher_alg", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fsti", "name": "NotEverCrypt.CTR.xor8", "original_source_type": "", "source_type": "val xor8 : _: Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.SEC ->\n _: Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.SEC\n -> Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.SEC", "source_definition": "let xor8 = Lib.IntTypes.((^.) #U8 #SEC)", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 83, "start_col": 25, "end_line": 83, "end_col": 38 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nmodule Spec = Spec.Agile.CTR\n\nopen FStar.HyperStack.ST\nopen EverCrypt.Error\n\nunfold noextract\nlet alg = Spec.cipher_alg\n\n/// Classic boilerplate\n/// -------------------\n\n[@CAbstractStruct]\nval state_s: alg -> Type0\n\nlet state alg = B.pointer (state_s alg)\n\ninline_for_extraction noextract\nval freeable_s: #(a: alg) -> state_s a -> Type0\n\ninline_for_extraction noextract\nlet freeable (#a: alg) (h: HS.mem) (p: state a) =\n B.freeable p /\\ freeable_s (B.deref h p)\n\ninline_for_extraction noextract\nlet preserves_freeable #a (s: state a) (h0 h1: HS.mem): Type0 =\n freeable h0 s ==> freeable h1 s\n\nval footprint_s: #a:alg -> state_s a -> GTot B.loc\nlet footprint (#a:alg) (m: HS.mem) (s: state a) =\n B.(loc_union (loc_addr_of_buffer s) (footprint_s (B.deref m s)))\n\ninline_for_extraction noextract\nval invariant_s: (#a:alg) -> HS.mem -> state_s a -> Type0\n\ninline_for_extraction noextract\nlet invariant (#a:alg) (m: HS.mem) (s: state a) =\n B.live m s /\\\n B.(loc_disjoint (loc_addr_of_buffer s) (footprint_s (B.deref m s))) /\\\n invariant_s m (B.get m s 0)\n\nval invariant_loc_in_footprint\n (#a: alg)\n (s: state a)\n (m: HS.mem)\n: Lemma\n (requires (invariant m s))\n (ensures (B.loc_in (footprint m s) m))\n [SMTPat (invariant m s)]\n\nval frame_invariant: #a:alg -> l:B.loc -> s:state a -> h0:HS.mem -> h1:HS.mem -> Lemma\n (requires (\n invariant h0 s /\\\n B.loc_disjoint l (footprint h0 s) /\\\n B.modifies l h0 h1))\n (ensures (\n invariant h1 s /\\\n footprint h0 s == footprint h1 s))\n [ SMTPat (invariant h1 s); SMTPat (B.modifies l h0 h1) ]\n\n/// Ghost accessors\n/// ---------------\n\n/// We keep ghost values for the key and the iv, meaning that their value\n/// doesn't depend on the heap, once we dereference past the initial pointer.\n/// This should give preservation of key and iv automatically to clients.\nval kv: #a:alg -> state_s a -> GTot (Spec.key a)\nval iv: #a:alg -> state_s a -> GTot (Spec.nonce a)\n\n/// ctr is mutated from call to call\nval ctr: #a:alg -> h:HS.mem -> state a -> GTot Spec.ctr\n\n/// Stateful API\n/// ------------", "dependencies": { "source_file": "NotEverCrypt.CTR.fsti", "checked_file": "NotEverCrypt.CTR.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Loops.fst.checked", "Spec.Agile.CTR.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n _: Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.SEC ->\n _: Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.SEC\n -> Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.SEC", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.op_Hat_Dot", "Lib.IntTypes.U8", "Lib.IntTypes.SEC" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let xor8 =", "completed_definiton": "let open Lib.IntTypes in ( ^. ) #U8 #SEC", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fsti", "name": "NotEverCrypt.CTR.uint8", "original_source_type": "", "source_type": "val uint8 : Type0", "source_definition": "let uint8 = Lib.IntTypes.uint8", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 82, "start_col": 12, "end_line": 82, "end_col": 30 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nmodule Spec = Spec.Agile.CTR\n\nopen FStar.HyperStack.ST\nopen EverCrypt.Error\n\nunfold noextract\nlet alg = Spec.cipher_alg\n\n/// Classic boilerplate\n/// -------------------\n\n[@CAbstractStruct]\nval state_s: alg -> Type0\n\nlet state alg = B.pointer (state_s alg)\n\ninline_for_extraction noextract\nval freeable_s: #(a: alg) -> state_s a -> Type0\n\ninline_for_extraction noextract\nlet freeable (#a: alg) (h: HS.mem) (p: state a) =\n B.freeable p /\\ freeable_s (B.deref h p)\n\ninline_for_extraction noextract\nlet preserves_freeable #a (s: state a) (h0 h1: HS.mem): Type0 =\n freeable h0 s ==> freeable h1 s\n\nval footprint_s: #a:alg -> state_s a -> GTot B.loc\nlet footprint (#a:alg) (m: HS.mem) (s: state a) =\n B.(loc_union (loc_addr_of_buffer s) (footprint_s (B.deref m s)))\n\ninline_for_extraction noextract\nval invariant_s: (#a:alg) -> HS.mem -> state_s a -> Type0\n\ninline_for_extraction noextract\nlet invariant (#a:alg) (m: HS.mem) (s: state a) =\n B.live m s /\\\n B.(loc_disjoint (loc_addr_of_buffer s) (footprint_s (B.deref m s))) /\\\n invariant_s m (B.get m s 0)\n\nval invariant_loc_in_footprint\n (#a: alg)\n (s: state a)\n (m: HS.mem)\n: Lemma\n (requires (invariant m s))\n (ensures (B.loc_in (footprint m s) m))\n [SMTPat (invariant m s)]\n\nval frame_invariant: #a:alg -> l:B.loc -> s:state a -> h0:HS.mem -> h1:HS.mem -> Lemma\n (requires (\n invariant h0 s /\\\n B.loc_disjoint l (footprint h0 s) /\\\n B.modifies l h0 h1))\n (ensures (\n invariant h1 s /\\\n footprint h0 s == footprint h1 s))\n [ SMTPat (invariant h1 s); SMTPat (B.modifies l h0 h1) ]\n\n/// Ghost accessors\n/// ---------------\n\n/// We keep ghost values for the key and the iv, meaning that their value\n/// doesn't depend on the heap, once we dereference past the initial pointer.\n/// This should give preservation of key and iv automatically to clients.\nval kv: #a:alg -> state_s a -> GTot (Spec.key a)\nval iv: #a:alg -> state_s a -> GTot (Spec.nonce a)\n\n/// ctr is mutated from call to call\nval ctr: #a:alg -> h:HS.mem -> state a -> GTot Spec.ctr\n\n/// Stateful API\n/// ------------", "dependencies": { "source_file": "NotEverCrypt.CTR.fsti", "checked_file": "NotEverCrypt.CTR.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Loops.fst.checked", "Spec.Agile.CTR.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.uint8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let uint8 =", "completed_definiton": "Lib.IntTypes.uint8", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fsti", "name": "NotEverCrypt.CTR.e_alg", "original_source_type": "", "source_type": "val e_alg : Type0", "source_definition": "let e_alg = G.erased alg", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 85, "start_col": 12, "end_line": 85, "end_col": 24 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nmodule Spec = Spec.Agile.CTR\n\nopen FStar.HyperStack.ST\nopen EverCrypt.Error\n\nunfold noextract\nlet alg = Spec.cipher_alg\n\n/// Classic boilerplate\n/// -------------------\n\n[@CAbstractStruct]\nval state_s: alg -> Type0\n\nlet state alg = B.pointer (state_s alg)\n\ninline_for_extraction noextract\nval freeable_s: #(a: alg) -> state_s a -> Type0\n\ninline_for_extraction noextract\nlet freeable (#a: alg) (h: HS.mem) (p: state a) =\n B.freeable p /\\ freeable_s (B.deref h p)\n\ninline_for_extraction noextract\nlet preserves_freeable #a (s: state a) (h0 h1: HS.mem): Type0 =\n freeable h0 s ==> freeable h1 s\n\nval footprint_s: #a:alg -> state_s a -> GTot B.loc\nlet footprint (#a:alg) (m: HS.mem) (s: state a) =\n B.(loc_union (loc_addr_of_buffer s) (footprint_s (B.deref m s)))\n\ninline_for_extraction noextract\nval invariant_s: (#a:alg) -> HS.mem -> state_s a -> Type0\n\ninline_for_extraction noextract\nlet invariant (#a:alg) (m: HS.mem) (s: state a) =\n B.live m s /\\\n B.(loc_disjoint (loc_addr_of_buffer s) (footprint_s (B.deref m s))) /\\\n invariant_s m (B.get m s 0)\n\nval invariant_loc_in_footprint\n (#a: alg)\n (s: state a)\n (m: HS.mem)\n: Lemma\n (requires (invariant m s))\n (ensures (B.loc_in (footprint m s) m))\n [SMTPat (invariant m s)]\n\nval frame_invariant: #a:alg -> l:B.loc -> s:state a -> h0:HS.mem -> h1:HS.mem -> Lemma\n (requires (\n invariant h0 s /\\\n B.loc_disjoint l (footprint h0 s) /\\\n B.modifies l h0 h1))\n (ensures (\n invariant h1 s /\\\n footprint h0 s == footprint h1 s))\n [ SMTPat (invariant h1 s); SMTPat (B.modifies l h0 h1) ]\n\n/// Ghost accessors\n/// ---------------\n\n/// We keep ghost values for the key and the iv, meaning that their value\n/// doesn't depend on the heap, once we dereference past the initial pointer.\n/// This should give preservation of key and iv automatically to clients.\nval kv: #a:alg -> state_s a -> GTot (Spec.key a)\nval iv: #a:alg -> state_s a -> GTot (Spec.nonce a)\n\n/// ctr is mutated from call to call\nval ctr: #a:alg -> h:HS.mem -> state a -> GTot Spec.ctr\n\n/// Stateful API\n/// ------------\n\nlet uint8 = Lib.IntTypes.uint8\nlet xor8 = Lib.IntTypes.((^.) #U8 #SEC)", "dependencies": { "source_file": "NotEverCrypt.CTR.fsti", "checked_file": "NotEverCrypt.CTR.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Loops.fst.checked", "Spec.Agile.CTR.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Ghost.erased", "NotEverCrypt.CTR.alg" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let e_alg =", "completed_definiton": "G.erased alg", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fsti", "name": "NotEverCrypt.CTR.preserves_freeable", "original_source_type": "val preserves_freeable (#a: _) (s: state a) (h0 h1: HS.mem) : Type0", "source_type": "val preserves_freeable (#a: _) (s: state a) (h0 h1: HS.mem) : Type0", "source_definition": "let preserves_freeable #a (s: state a) (h0 h1: HS.mem): Type0 =\n freeable h0 s ==> freeable h1 s", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 33, "start_col": 2, "end_line": 33, "end_col": 33 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nmodule Spec = Spec.Agile.CTR\n\nopen FStar.HyperStack.ST\nopen EverCrypt.Error\n\nunfold noextract\nlet alg = Spec.cipher_alg\n\n/// Classic boilerplate\n/// -------------------\n\n[@CAbstractStruct]\nval state_s: alg -> Type0\n\nlet state alg = B.pointer (state_s alg)\n\ninline_for_extraction noextract\nval freeable_s: #(a: alg) -> state_s a -> Type0\n\ninline_for_extraction noextract\nlet freeable (#a: alg) (h: HS.mem) (p: state a) =\n B.freeable p /\\ freeable_s (B.deref h p)\n\ninline_for_extraction noextract", "dependencies": { "source_file": "NotEverCrypt.CTR.fsti", "checked_file": "NotEverCrypt.CTR.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Loops.fst.checked", "Spec.Agile.CTR.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n s: NotEverCrypt.CTR.state a ->\n h0: FStar.Monotonic.HyperStack.mem ->\n h1: FStar.Monotonic.HyperStack.mem\n -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "NotEverCrypt.CTR.alg", "NotEverCrypt.CTR.state", "FStar.Monotonic.HyperStack.mem", "Prims.l_imp", "NotEverCrypt.CTR.freeable" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val preserves_freeable (#a: _) (s: state a) (h0 h1: HS.mem) : Type0\nlet preserves_freeable #a (s: state a) (h0: HS.mem) (h1: HS.mem) : Type0 =", "completed_definiton": "freeable h0 s ==> freeable h1 s", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fsti", "name": "NotEverCrypt.CTR.state", "original_source_type": "", "source_type": "val state : alg: NotEverCrypt.CTR.alg -> Type0", "source_definition": "let state alg = B.pointer (state_s alg)", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 22, "start_col": 16, "end_line": 22, "end_col": 39 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nmodule Spec = Spec.Agile.CTR\n\nopen FStar.HyperStack.ST\nopen EverCrypt.Error\n\nunfold noextract\nlet alg = Spec.cipher_alg\n\n/// Classic boilerplate\n/// -------------------\n\n[@CAbstractStruct]\nval state_s: alg -> Type0", "dependencies": { "source_file": "NotEverCrypt.CTR.fsti", "checked_file": "NotEverCrypt.CTR.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Loops.fst.checked", "Spec.Agile.CTR.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "alg: NotEverCrypt.CTR.alg -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "NotEverCrypt.CTR.alg", "LowStar.Buffer.pointer", "NotEverCrypt.CTR.state_s" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let state alg =", "completed_definiton": "B.pointer (state_s alg)", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fsti", "name": "NotEverCrypt.CTR.footprint", "original_source_type": "", "source_type": "val footprint : m: FStar.Monotonic.HyperStack.mem -> s: NotEverCrypt.CTR.state a\n -> Prims.GTot LowStar.Monotonic.Buffer.loc", "source_definition": "let footprint (#a:alg) (m: HS.mem) (s: state a) =\n B.(loc_union (loc_addr_of_buffer s) (footprint_s (B.deref m s)))", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 37, "start_col": 2, "end_line": 37, "end_col": 66 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nmodule Spec = Spec.Agile.CTR\n\nopen FStar.HyperStack.ST\nopen EverCrypt.Error\n\nunfold noextract\nlet alg = Spec.cipher_alg\n\n/// Classic boilerplate\n/// -------------------\n\n[@CAbstractStruct]\nval state_s: alg -> Type0\n\nlet state alg = B.pointer (state_s alg)\n\ninline_for_extraction noextract\nval freeable_s: #(a: alg) -> state_s a -> Type0\n\ninline_for_extraction noextract\nlet freeable (#a: alg) (h: HS.mem) (p: state a) =\n B.freeable p /\\ freeable_s (B.deref h p)\n\ninline_for_extraction noextract\nlet preserves_freeable #a (s: state a) (h0 h1: HS.mem): Type0 =\n freeable h0 s ==> freeable h1 s\n\nval footprint_s: #a:alg -> state_s a -> GTot B.loc", "dependencies": { "source_file": "NotEverCrypt.CTR.fsti", "checked_file": "NotEverCrypt.CTR.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Loops.fst.checked", "Spec.Agile.CTR.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "m: FStar.Monotonic.HyperStack.mem -> s: NotEverCrypt.CTR.state a\n -> Prims.GTot LowStar.Monotonic.Buffer.loc", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "NotEverCrypt.CTR.alg", "FStar.Monotonic.HyperStack.mem", "NotEverCrypt.CTR.state", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.loc_addr_of_buffer", "NotEverCrypt.CTR.state_s", "LowStar.Buffer.trivial_preorder", "NotEverCrypt.CTR.footprint_s", "LowStar.Monotonic.Buffer.deref", "LowStar.Monotonic.Buffer.loc" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let footprint (#a: alg) (m: HS.mem) (s: state a) =", "completed_definiton": "let open B in loc_union (loc_addr_of_buffer s) (footprint_s (B.deref m s))", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fsti", "name": "NotEverCrypt.CTR.freeable", "original_source_type": "", "source_type": "val freeable : h: FStar.Monotonic.HyperStack.mem -> p: NotEverCrypt.CTR.state a -> Prims.logical", "source_definition": "let freeable (#a: alg) (h: HS.mem) (p: state a) =\n B.freeable p /\\ freeable_s (B.deref h p)", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 29, "start_col": 2, "end_line": 29, "end_col": 42 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nmodule Spec = Spec.Agile.CTR\n\nopen FStar.HyperStack.ST\nopen EverCrypt.Error\n\nunfold noextract\nlet alg = Spec.cipher_alg\n\n/// Classic boilerplate\n/// -------------------\n\n[@CAbstractStruct]\nval state_s: alg -> Type0\n\nlet state alg = B.pointer (state_s alg)\n\ninline_for_extraction noextract\nval freeable_s: #(a: alg) -> state_s a -> Type0\n\ninline_for_extraction noextract", "dependencies": { "source_file": "NotEverCrypt.CTR.fsti", "checked_file": "NotEverCrypt.CTR.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Loops.fst.checked", "Spec.Agile.CTR.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: FStar.Monotonic.HyperStack.mem -> p: NotEverCrypt.CTR.state a -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "NotEverCrypt.CTR.alg", "FStar.Monotonic.HyperStack.mem", "NotEverCrypt.CTR.state", "Prims.l_and", "LowStar.Monotonic.Buffer.freeable", "NotEverCrypt.CTR.state_s", "LowStar.Buffer.trivial_preorder", "NotEverCrypt.CTR.freeable_s", "LowStar.Monotonic.Buffer.deref", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let freeable (#a: alg) (h: HS.mem) (p: state a) =", "completed_definiton": "B.freeable p /\\ freeable_s (B.deref h p)", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fsti", "name": "NotEverCrypt.CTR.invariant", "original_source_type": "", "source_type": "val invariant : m: FStar.Monotonic.HyperStack.mem -> s: NotEverCrypt.CTR.state a -> Prims.logical", "source_definition": "let invariant (#a:alg) (m: HS.mem) (s: state a) =\n B.live m s /\\\n B.(loc_disjoint (loc_addr_of_buffer s) (footprint_s (B.deref m s))) /\\\n invariant_s m (B.get m s 0)", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 44, "start_col": 2, "end_line": 46, "end_col": 29 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nmodule Spec = Spec.Agile.CTR\n\nopen FStar.HyperStack.ST\nopen EverCrypt.Error\n\nunfold noextract\nlet alg = Spec.cipher_alg\n\n/// Classic boilerplate\n/// -------------------\n\n[@CAbstractStruct]\nval state_s: alg -> Type0\n\nlet state alg = B.pointer (state_s alg)\n\ninline_for_extraction noextract\nval freeable_s: #(a: alg) -> state_s a -> Type0\n\ninline_for_extraction noextract\nlet freeable (#a: alg) (h: HS.mem) (p: state a) =\n B.freeable p /\\ freeable_s (B.deref h p)\n\ninline_for_extraction noextract\nlet preserves_freeable #a (s: state a) (h0 h1: HS.mem): Type0 =\n freeable h0 s ==> freeable h1 s\n\nval footprint_s: #a:alg -> state_s a -> GTot B.loc\nlet footprint (#a:alg) (m: HS.mem) (s: state a) =\n B.(loc_union (loc_addr_of_buffer s) (footprint_s (B.deref m s)))\n\ninline_for_extraction noextract\nval invariant_s: (#a:alg) -> HS.mem -> state_s a -> Type0\n\ninline_for_extraction noextract", "dependencies": { "source_file": "NotEverCrypt.CTR.fsti", "checked_file": "NotEverCrypt.CTR.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Loops.fst.checked", "Spec.Agile.CTR.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "m: FStar.Monotonic.HyperStack.mem -> s: NotEverCrypt.CTR.state a -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "NotEverCrypt.CTR.alg", "FStar.Monotonic.HyperStack.mem", "NotEverCrypt.CTR.state", "Prims.l_and", "LowStar.Monotonic.Buffer.live", "NotEverCrypt.CTR.state_s", "LowStar.Buffer.trivial_preorder", "LowStar.Monotonic.Buffer.loc_disjoint", "LowStar.Monotonic.Buffer.loc_addr_of_buffer", "NotEverCrypt.CTR.footprint_s", "LowStar.Monotonic.Buffer.deref", "NotEverCrypt.CTR.invariant_s", "LowStar.Monotonic.Buffer.get", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let invariant (#a: alg) (m: HS.mem) (s: state a) =", "completed_definiton": "B.live m s /\\ B.(loc_disjoint (loc_addr_of_buffer s) (footprint_s (B.deref m s))) /\\\ninvariant_s m (B.get m s 0)", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fsti", "name": "NotEverCrypt.CTR.update_block_st", "original_source_type": "", "source_type": "val update_block_st : a: NotEverCrypt.CTR.alg -> Type0", "source_definition": "let update_block_st (a: alg) =\n s:state a ->\n dst:B.buffer uint8 { B.length dst = Spec.block_length a } ->\n src:B.buffer uint8 { B.length src = Spec.block_length a } ->\n Stack unit\n (requires (fun h0 ->\n B.live h0 src /\\ B.live h0 dst /\\\n B.(loc_disjoint (loc_buffer src) (footprint h0 s)) /\\\n B.(loc_disjoint (loc_buffer dst) (footprint h0 s)) /\\\n B.disjoint src dst /\\\n invariant h0 s))\n (ensures (fun h0 _ h1 ->\n preserves_freeable s h0 h1 /\\\n invariant h1 s /\\\n B.(modifies (footprint_s (B.deref h0 s) `loc_union` loc_buffer dst) h0 h1) /\\\n footprint h0 s == footprint h1 s /\\\n (ctr h0 s < pow2 32 - 1 ==> ctr h1 s == ctr h0 s + 1) /\\\n B.as_seq h1 dst == Spec.Loops.seq_map2 xor8 (B.as_seq h0 src)\n (Spec.ctr_block a (kv (B.deref h0 s)) (iv (B.deref h0 s)) (ctr h0 s))))", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 164, "start_col": 2, "end_line": 181, "end_col": 79 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nmodule Spec = Spec.Agile.CTR\n\nopen FStar.HyperStack.ST\nopen EverCrypt.Error\n\nunfold noextract\nlet alg = Spec.cipher_alg\n\n/// Classic boilerplate\n/// -------------------\n\n[@CAbstractStruct]\nval state_s: alg -> Type0\n\nlet state alg = B.pointer (state_s alg)\n\ninline_for_extraction noextract\nval freeable_s: #(a: alg) -> state_s a -> Type0\n\ninline_for_extraction noextract\nlet freeable (#a: alg) (h: HS.mem) (p: state a) =\n B.freeable p /\\ freeable_s (B.deref h p)\n\ninline_for_extraction noextract\nlet preserves_freeable #a (s: state a) (h0 h1: HS.mem): Type0 =\n freeable h0 s ==> freeable h1 s\n\nval footprint_s: #a:alg -> state_s a -> GTot B.loc\nlet footprint (#a:alg) (m: HS.mem) (s: state a) =\n B.(loc_union (loc_addr_of_buffer s) (footprint_s (B.deref m s)))\n\ninline_for_extraction noextract\nval invariant_s: (#a:alg) -> HS.mem -> state_s a -> Type0\n\ninline_for_extraction noextract\nlet invariant (#a:alg) (m: HS.mem) (s: state a) =\n B.live m s /\\\n B.(loc_disjoint (loc_addr_of_buffer s) (footprint_s (B.deref m s))) /\\\n invariant_s m (B.get m s 0)\n\nval invariant_loc_in_footprint\n (#a: alg)\n (s: state a)\n (m: HS.mem)\n: Lemma\n (requires (invariant m s))\n (ensures (B.loc_in (footprint m s) m))\n [SMTPat (invariant m s)]\n\nval frame_invariant: #a:alg -> l:B.loc -> s:state a -> h0:HS.mem -> h1:HS.mem -> Lemma\n (requires (\n invariant h0 s /\\\n B.loc_disjoint l (footprint h0 s) /\\\n B.modifies l h0 h1))\n (ensures (\n invariant h1 s /\\\n footprint h0 s == footprint h1 s))\n [ SMTPat (invariant h1 s); SMTPat (B.modifies l h0 h1) ]\n\n/// Ghost accessors\n/// ---------------\n\n/// We keep ghost values for the key and the iv, meaning that their value\n/// doesn't depend on the heap, once we dereference past the initial pointer.\n/// This should give preservation of key and iv automatically to clients.\nval kv: #a:alg -> state_s a -> GTot (Spec.key a)\nval iv: #a:alg -> state_s a -> GTot (Spec.nonce a)\n\n/// ctr is mutated from call to call\nval ctr: #a:alg -> h:HS.mem -> state a -> GTot Spec.ctr\n\n/// Stateful API\n/// ------------\n\nlet uint8 = Lib.IntTypes.uint8\nlet xor8 = Lib.IntTypes.((^.) #U8 #SEC)\n\nlet e_alg = G.erased alg\n\nval alg_of_state: a:e_alg -> (\n let a = G.reveal a in\n s: state a -> Stack alg\n (fun h0 -> invariant h0 s)\n (fun h0 a' h1 -> h0 == h1 /\\ a' == a))\n\ninline_for_extraction noextract\nlet create_in_st (a:alg) =\n r:HS.rid ->\n dst:B.pointer (B.pointer_or_null (state_s a)) ->\n k:B.buffer uint8 { B.length k = Spec.Agile.CTR.key_length a } ->\n nonce: B.buffer uint8 ->\n nonce_len: UInt32.t { Spec.nonce_bound a (UInt32.v nonce_len) /\\ B.len nonce = nonce_len } ->\n c: UInt32.t ->\n ST error_code\n (requires fun h0 ->\n ST.is_eternal_region r /\\\n B.live h0 dst /\\ B.live h0 k /\\ B.live h0 nonce)\n (ensures fun h0 e h1 ->\n match e with\n | UnsupportedAlgorithm ->\n B.(modifies loc_none h0 h1)\n | InvalidIVLength ->\n B.(modifies loc_none h0 h1) /\\ UInt32.v nonce_len < 12\n | Success ->\n let s = B.deref h1 dst in\n // Sanity\n not (B.g_is_null s) /\\\n invariant h1 s /\\\n\n // Memory stuff\n B.(modifies (loc_buffer dst) h0 h1) /\\\n B.fresh_loc (footprint h1 s) h0 h1 /\\\n B.(loc_includes (loc_region_only true r) (footprint h1 s)) /\\\n freeable h1 s /\\\n\n // Useful stuff\n kv (B.deref h1 s) == B.as_seq h0 k /\\\n iv (B.deref h1 s) == B.as_seq h0 nonce /\\\n ctr h1 s = UInt32.v c\n | _ -> False)\n\nval create_in: a:alg -> create_in_st a\n\n/// Initializes state to start at a given counter. This allows client to\n/// generate a counter-block directly for a given counter, or to just start at\n/// zero and do encryption block-by-block. Note that we use a C-like API where\n/// the length comes after the buffer.\nval init: a:e_alg -> (\n let a = G.reveal a in\n s:state a ->\n k:B.buffer uint8 { B.length k = Spec.Agile.CTR.key_length a } ->\n nonce: B.buffer uint8 ->\n nonce_len: UInt32.t { Spec.nonce_bound a (UInt32.v nonce_len) /\\ B.len nonce = nonce_len } ->\n c: UInt32.t ->\n Stack unit\n (requires (fun h0 ->\n B.live h0 k /\\\n B.live h0 nonce /\\\n B.(loc_disjoint (loc_buffer k) (footprint h0 s)) /\\\n B.(loc_disjoint (loc_buffer nonce) (footprint h0 s)) /\\\n invariant h0 s))\n (ensures (fun h0 _ h1 ->\n preserves_freeable #a s h0 h1 /\\\n invariant #a h1 s /\\\n footprint h0 s == footprint #a h1 s /\\\n B.(modifies (footprint #a h0 s) h0 h1) /\\\n kv (B.deref h1 s) == B.as_seq h0 k /\\\n iv (B.deref h1 s) == B.as_seq h0 nonce /\\\n ctr h1 s = UInt32.v c\n )))\n\n/// Process exactly one block, incrementing the counter contained in the state\n/// in passing. The expected usage is repeated calls to update_block as more\n/// data comes in, followed by a call to update_last.\ninline_for_extraction noextract", "dependencies": { "source_file": "NotEverCrypt.CTR.fsti", "checked_file": "NotEverCrypt.CTR.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Loops.fst.checked", "Spec.Agile.CTR.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: NotEverCrypt.CTR.alg -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "NotEverCrypt.CTR.alg", "NotEverCrypt.CTR.state", "LowStar.Buffer.buffer", "NotEverCrypt.CTR.uint8", "Prims.b2t", "Prims.op_Equality", "Prims.int", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Spec.Agile.Cipher.block_length", "Prims.unit", "FStar.Monotonic.HyperStack.mem", "Prims.l_and", "LowStar.Monotonic.Buffer.live", "LowStar.Monotonic.Buffer.loc_disjoint", "LowStar.Monotonic.Buffer.loc_buffer", "NotEverCrypt.CTR.footprint", "LowStar.Monotonic.Buffer.disjoint", "NotEverCrypt.CTR.invariant", "NotEverCrypt.CTR.preserves_freeable", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_union", "NotEverCrypt.CTR.footprint_s", "LowStar.Monotonic.Buffer.deref", "NotEverCrypt.CTR.state_s", "Prims.eq2", "LowStar.Monotonic.Buffer.loc", "Prims.l_imp", "Prims.op_LessThan", "NotEverCrypt.CTR.ctr", "Prims.op_Subtraction", "Prims.pow2", "Prims.op_Addition", "FStar.Seq.Base.seq", "LowStar.Monotonic.Buffer.as_seq", "Spec.Loops.seq_map2", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "NotEverCrypt.CTR.xor8", "Spec.Agile.Cipher.ctr_block", "NotEverCrypt.CTR.kv", "NotEverCrypt.CTR.iv" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let update_block_st (a: alg) =", "completed_definiton": "\n s: state a ->\n dst: B.buffer uint8 {B.length dst = Spec.block_length a} ->\n src: B.buffer uint8 {B.length src = Spec.block_length a}\n -> Stack unit\n (requires\n (fun h0 ->\n B.live h0 src /\\ B.live h0 dst /\\ B.(loc_disjoint (loc_buffer src) (footprint h0 s)) /\\\n B.(loc_disjoint (loc_buffer dst) (footprint h0 s)) /\\ B.disjoint src dst /\\\n invariant h0 s))\n (ensures\n (fun h0 _ h1 ->\n preserves_freeable s h0 h1 /\\ invariant h1 s /\\\n B.(modifies ((footprint_s (B.deref h0 s)) `loc_union` (loc_buffer dst)) h0 h1) /\\\n footprint h0 s == footprint h1 s /\\\n (ctr h0 s < pow2 32 - 1 ==> ctr h1 s == ctr h0 s + 1) /\\\n B.as_seq h1 dst ==\n Spec.Loops.seq_map2 xor8\n (B.as_seq h0 src)\n (Spec.ctr_block a (kv (B.deref h0 s)) (iv (B.deref h0 s)) (ctr h0 s))))", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fsti", "name": "NotEverCrypt.CTR.create_in_st", "original_source_type": "", "source_type": "val create_in_st : a: NotEverCrypt.CTR.alg -> Type0", "source_definition": "let create_in_st (a:alg) =\n r:HS.rid ->\n dst:B.pointer (B.pointer_or_null (state_s a)) ->\n k:B.buffer uint8 { B.length k = Spec.Agile.CTR.key_length a } ->\n nonce: B.buffer uint8 ->\n nonce_len: UInt32.t { Spec.nonce_bound a (UInt32.v nonce_len) /\\ B.len nonce = nonce_len } ->\n c: UInt32.t ->\n ST error_code\n (requires fun h0 ->\n ST.is_eternal_region r /\\\n B.live h0 dst /\\ B.live h0 k /\\ B.live h0 nonce)\n (ensures fun h0 e h1 ->\n match e with\n | UnsupportedAlgorithm ->\n B.(modifies loc_none h0 h1)\n | InvalidIVLength ->\n B.(modifies loc_none h0 h1) /\\ UInt32.v nonce_len < 12\n | Success ->\n let s = B.deref h1 dst in\n // Sanity\n not (B.g_is_null s) /\\\n invariant h1 s /\\\n\n // Memory stuff\n B.(modifies (loc_buffer dst) h0 h1) /\\\n B.fresh_loc (footprint h1 s) h0 h1 /\\\n B.(loc_includes (loc_region_only true r) (footprint h1 s)) /\\\n freeable h1 s /\\\n\n // Useful stuff\n kv (B.deref h1 s) == B.as_seq h0 k /\\\n iv (B.deref h1 s) == B.as_seq h0 nonce /\\\n ctr h1 s = UInt32.v c\n | _ -> False)", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 95, "start_col": 2, "end_line": 127, "end_col": 19 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nmodule Spec = Spec.Agile.CTR\n\nopen FStar.HyperStack.ST\nopen EverCrypt.Error\n\nunfold noextract\nlet alg = Spec.cipher_alg\n\n/// Classic boilerplate\n/// -------------------\n\n[@CAbstractStruct]\nval state_s: alg -> Type0\n\nlet state alg = B.pointer (state_s alg)\n\ninline_for_extraction noextract\nval freeable_s: #(a: alg) -> state_s a -> Type0\n\ninline_for_extraction noextract\nlet freeable (#a: alg) (h: HS.mem) (p: state a) =\n B.freeable p /\\ freeable_s (B.deref h p)\n\ninline_for_extraction noextract\nlet preserves_freeable #a (s: state a) (h0 h1: HS.mem): Type0 =\n freeable h0 s ==> freeable h1 s\n\nval footprint_s: #a:alg -> state_s a -> GTot B.loc\nlet footprint (#a:alg) (m: HS.mem) (s: state a) =\n B.(loc_union (loc_addr_of_buffer s) (footprint_s (B.deref m s)))\n\ninline_for_extraction noextract\nval invariant_s: (#a:alg) -> HS.mem -> state_s a -> Type0\n\ninline_for_extraction noextract\nlet invariant (#a:alg) (m: HS.mem) (s: state a) =\n B.live m s /\\\n B.(loc_disjoint (loc_addr_of_buffer s) (footprint_s (B.deref m s))) /\\\n invariant_s m (B.get m s 0)\n\nval invariant_loc_in_footprint\n (#a: alg)\n (s: state a)\n (m: HS.mem)\n: Lemma\n (requires (invariant m s))\n (ensures (B.loc_in (footprint m s) m))\n [SMTPat (invariant m s)]\n\nval frame_invariant: #a:alg -> l:B.loc -> s:state a -> h0:HS.mem -> h1:HS.mem -> Lemma\n (requires (\n invariant h0 s /\\\n B.loc_disjoint l (footprint h0 s) /\\\n B.modifies l h0 h1))\n (ensures (\n invariant h1 s /\\\n footprint h0 s == footprint h1 s))\n [ SMTPat (invariant h1 s); SMTPat (B.modifies l h0 h1) ]\n\n/// Ghost accessors\n/// ---------------\n\n/// We keep ghost values for the key and the iv, meaning that their value\n/// doesn't depend on the heap, once we dereference past the initial pointer.\n/// This should give preservation of key and iv automatically to clients.\nval kv: #a:alg -> state_s a -> GTot (Spec.key a)\nval iv: #a:alg -> state_s a -> GTot (Spec.nonce a)\n\n/// ctr is mutated from call to call\nval ctr: #a:alg -> h:HS.mem -> state a -> GTot Spec.ctr\n\n/// Stateful API\n/// ------------\n\nlet uint8 = Lib.IntTypes.uint8\nlet xor8 = Lib.IntTypes.((^.) #U8 #SEC)\n\nlet e_alg = G.erased alg\n\nval alg_of_state: a:e_alg -> (\n let a = G.reveal a in\n s: state a -> Stack alg\n (fun h0 -> invariant h0 s)\n (fun h0 a' h1 -> h0 == h1 /\\ a' == a))\n\ninline_for_extraction noextract", "dependencies": { "source_file": "NotEverCrypt.CTR.fsti", "checked_file": "NotEverCrypt.CTR.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Loops.fst.checked", "Spec.Agile.CTR.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: NotEverCrypt.CTR.alg -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "NotEverCrypt.CTR.alg", "FStar.Monotonic.HyperHeap.rid", "LowStar.Buffer.pointer", "LowStar.Buffer.pointer_or_null", "NotEverCrypt.CTR.state_s", "LowStar.Buffer.buffer", "NotEverCrypt.CTR.uint8", "Prims.b2t", "Prims.op_Equality", "Prims.nat", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Spec.Agile.Cipher.key_length", "FStar.UInt32.t", "Prims.l_and", "Spec.Agile.Cipher.nonce_bound", "FStar.UInt32.v", "LowStar.Monotonic.Buffer.len", "EverCrypt.Error.error_code", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.is_eternal_region", "LowStar.Monotonic.Buffer.live", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_none", "Prims.op_LessThan", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "NotEverCrypt.CTR.invariant", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Monotonic.Buffer.fresh_loc", "NotEverCrypt.CTR.footprint", "LowStar.Monotonic.Buffer.loc_includes", "LowStar.Monotonic.Buffer.loc_region_only", "NotEverCrypt.CTR.freeable", "Prims.eq2", "Spec.Agile.Cipher.key", "NotEverCrypt.CTR.kv", "LowStar.Monotonic.Buffer.deref", "LowStar.Monotonic.Buffer.as_seq", "FStar.Seq.Base.seq", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "NotEverCrypt.CTR.iv", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.op_GreaterThanOrEqual", "Prims.op_LessThanOrEqual", "Lib.IntTypes.max_size_t", "NotEverCrypt.CTR.ctr", "Prims.l_False" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let create_in_st (a: alg) =", "completed_definiton": "\n r: HS.rid ->\n dst: B.pointer (B.pointer_or_null (state_s a)) ->\n k: B.buffer uint8 {B.length k = Spec.Agile.CTR.key_length a} ->\n nonce: B.buffer uint8 ->\n nonce_len: UInt32.t{Spec.nonce_bound a (UInt32.v nonce_len) /\\ B.len nonce = nonce_len} ->\n c: UInt32.t\n -> ST error_code\n (requires fun h0 -> ST.is_eternal_region r /\\ B.live h0 dst /\\ B.live h0 k /\\ B.live h0 nonce)\n (ensures\n fun h0 e h1 ->\n match e with\n | UnsupportedAlgorithm -> let open B in modifies loc_none h0 h1\n | InvalidIVLength -> B.(modifies loc_none h0 h1) /\\ UInt32.v nonce_len < 12\n | Success ->\n let s = B.deref h1 dst in\n not (B.g_is_null s) /\\ invariant h1 s /\\ B.(modifies (loc_buffer dst) h0 h1) /\\\n B.fresh_loc (footprint h1 s) h0 h1 /\\\n B.(loc_includes (loc_region_only true r) (footprint h1 s)) /\\ freeable h1 s /\\\n kv (B.deref h1 s) == B.as_seq h0 k /\\ iv (B.deref h1 s) == B.as_seq h0 nonce /\\\n ctr h1 s = UInt32.v c\n | _ -> False)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Buffer.fst", "name": "QUIC.Secret.Buffer.store32_be", "original_source_type": "val store32_be\n (b:B.buffer Secret.uint8 {B.length b == 4})\n (z:Secret.uint32)\n: HST.Stack unit\n (requires (fun h -> B.live h b))\n (ensures (fun h0 _ h1 -> B.(modifies (loc_buffer b) h0 h1) /\\ B.live h1 b /\\\n E.be_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))", "source_type": "val store32_be\n (b:B.buffer Secret.uint8 {B.length b == 4})\n (z:Secret.uint32)\n: HST.Stack unit\n (requires (fun h -> B.live h b))\n (ensures (fun h0 _ h1 -> B.(modifies (loc_buffer b) h0 h1) /\\ B.live h1 b /\\\n E.be_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))", "source_definition": "let store32_be\n b z\n= LowStar.Endianness.store32_be b z", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Buffer.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 66, "start_col": 2, "end_line": 66, "end_col": 35 }, "file_context": "module QUIC.Secret.Buffer\n\nfriend Lib.IntTypes\n\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\nmodule Seq = QUIC.Secret.Seq\nmodule Ghost = FStar.Ghost\n\n#set-options \"--z3rlimit 64\" // --query_stats\"\n\n#restart-solver\n\nlet seq_hide_eq\n (#t: Secret.inttype { Secret.unsigned t })\n (x: Seq.seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (Seq.seq_hide x `Seq.equal` x)\n [SMTPat (Seq.seq_hide x)]\n= ()\n\nlet seq_reveal_eq\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: Seq.seq (Secret.uint_t t sec))\n: Lemma\n (Seq.seq_reveal x `Seq.equal` x)\n [SMTPat (Seq.seq_reveal x)]\n= ()\n\nlet with_buffer_hide #t b from to h0 lin lout x1 x2 x3 x4 x5 x6 post f =\n let bl = B.sub b 0ul from in\n let bs = B.sub b from (to `U32.sub` from) in\n let br = B.offset b to in\n f (Ghost.hide (B.loc_buffer b)) bl bs br\n\nlet with_buffer_hide_from #t b from h0 lin lout x1 x2 x3 x4 post f =\n let bl = B.sub b 0ul from in\n let bs = B.offset b from in\n f (Ghost.hide (B.loc_buffer b)) bl bs\n\nlet load64_be\n b\n=\n LowStar.Endianness.load64_be b\n\nlet load32_be\n b\n=\n LowStar.Endianness.load32_be b\n\nlet load32_le\n b\n=\n LowStar.Endianness.load32_le b\n\nlet store64_be\n b z\n= LowStar.Endianness.store64_be b z\n\nlet store32_be", "dependencies": { "source_file": "QUIC.Secret.Buffer.fst", "checked_file": "QUIC.Secret.Buffer.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "E", "full_module": "FStar.Endianness" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b: LowStar.Buffer.buffer Lib.IntTypes.uint8 {LowStar.Monotonic.Buffer.length b == 4} ->\n z: Lib.IntTypes.uint32\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "Prims.eq2", "Prims.int", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Lib.IntTypes.uint32", "LowStar.Endianness.store32_be", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val store32_be\n (b:B.buffer Secret.uint8 {B.length b == 4})\n (z:Secret.uint32)\n: HST.Stack unit\n (requires (fun h -> B.live h b))\n (ensures (fun h0 _ h1 -> B.(modifies (loc_buffer b) h0 h1) /\\ B.live h1 b /\\\n E.be_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))\nlet store32_be b z =", "completed_definiton": "LowStar.Endianness.store32_be b z", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Buffer.fst", "name": "QUIC.Secret.Buffer.load32_be", "original_source_type": "val load32_be\n (b:B.buffer Secret.uint8{B.length b == 4}):\n HST.Stack Secret.uint32\n (requires (fun h -> B.live h b))\n (ensures (fun h0 z h1 -> h0 == h1 /\\ B.live h1 b /\\\n E.be_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))", "source_type": "val load32_be\n (b:B.buffer Secret.uint8{B.length b == 4}):\n HST.Stack Secret.uint32\n (requires (fun h -> B.live h b))\n (ensures (fun h0 z h1 -> h0 == h1 /\\ B.live h1 b /\\\n E.be_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))", "source_definition": "let load32_be\n b\n=\n LowStar.Endianness.load32_be b", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Buffer.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 53, "start_col": 2, "end_line": 53, "end_col": 32 }, "file_context": "module QUIC.Secret.Buffer\n\nfriend Lib.IntTypes\n\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\nmodule Seq = QUIC.Secret.Seq\nmodule Ghost = FStar.Ghost\n\n#set-options \"--z3rlimit 64\" // --query_stats\"\n\n#restart-solver\n\nlet seq_hide_eq\n (#t: Secret.inttype { Secret.unsigned t })\n (x: Seq.seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (Seq.seq_hide x `Seq.equal` x)\n [SMTPat (Seq.seq_hide x)]\n= ()\n\nlet seq_reveal_eq\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: Seq.seq (Secret.uint_t t sec))\n: Lemma\n (Seq.seq_reveal x `Seq.equal` x)\n [SMTPat (Seq.seq_reveal x)]\n= ()\n\nlet with_buffer_hide #t b from to h0 lin lout x1 x2 x3 x4 x5 x6 post f =\n let bl = B.sub b 0ul from in\n let bs = B.sub b from (to `U32.sub` from) in\n let br = B.offset b to in\n f (Ghost.hide (B.loc_buffer b)) bl bs br\n\nlet with_buffer_hide_from #t b from h0 lin lout x1 x2 x3 x4 post f =\n let bl = B.sub b 0ul from in\n let bs = B.offset b from in\n f (Ghost.hide (B.loc_buffer b)) bl bs\n\nlet load64_be\n b\n=\n LowStar.Endianness.load64_be b\n\nlet load32_be\n b", "dependencies": { "source_file": "QUIC.Secret.Buffer.fst", "checked_file": "QUIC.Secret.Buffer.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "E", "full_module": "FStar.Endianness" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: LowStar.Buffer.buffer Lib.IntTypes.uint8 {LowStar.Monotonic.Buffer.length b == 4}\n -> FStar.HyperStack.ST.Stack Lib.IntTypes.uint32", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "Prims.eq2", "Prims.int", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "LowStar.Endianness.load32_be", "FStar.UInt32.t", "Lib.IntTypes.uint32" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val load32_be\n (b:B.buffer Secret.uint8{B.length b == 4}):\n HST.Stack Secret.uint32\n (requires (fun h -> B.live h b))\n (ensures (fun h0 z h1 -> h0 == h1 /\\ B.live h1 b /\\\n E.be_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))\nlet load32_be b =", "completed_definiton": "LowStar.Endianness.load32_be b", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Buffer.fst", "name": "QUIC.Secret.Buffer.store32_le", "original_source_type": "val store32_le\n (b:B.buffer Secret.uint8 {B.length b == 4})\n (z:Secret.uint32)\n: HST.Stack unit\n (requires (fun h -> B.live h b))\n (ensures (fun h0 _ h1 -> B.(modifies (loc_buffer b) h0 h1) /\\ B.live h1 b /\\\n E.le_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))", "source_type": "val store32_le\n (b:B.buffer Secret.uint8 {B.length b == 4})\n (z:Secret.uint32)\n: HST.Stack unit\n (requires (fun h -> B.live h b))\n (ensures (fun h0 _ h1 -> B.(modifies (loc_buffer b) h0 h1) /\\ B.live h1 b /\\\n E.le_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))", "source_definition": "let store32_le\n b z\n= LowStar.Endianness.store32_le b z", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Buffer.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 70, "start_col": 2, "end_line": 70, "end_col": 35 }, "file_context": "module QUIC.Secret.Buffer\n\nfriend Lib.IntTypes\n\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\nmodule Seq = QUIC.Secret.Seq\nmodule Ghost = FStar.Ghost\n\n#set-options \"--z3rlimit 64\" // --query_stats\"\n\n#restart-solver\n\nlet seq_hide_eq\n (#t: Secret.inttype { Secret.unsigned t })\n (x: Seq.seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (Seq.seq_hide x `Seq.equal` x)\n [SMTPat (Seq.seq_hide x)]\n= ()\n\nlet seq_reveal_eq\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: Seq.seq (Secret.uint_t t sec))\n: Lemma\n (Seq.seq_reveal x `Seq.equal` x)\n [SMTPat (Seq.seq_reveal x)]\n= ()\n\nlet with_buffer_hide #t b from to h0 lin lout x1 x2 x3 x4 x5 x6 post f =\n let bl = B.sub b 0ul from in\n let bs = B.sub b from (to `U32.sub` from) in\n let br = B.offset b to in\n f (Ghost.hide (B.loc_buffer b)) bl bs br\n\nlet with_buffer_hide_from #t b from h0 lin lout x1 x2 x3 x4 post f =\n let bl = B.sub b 0ul from in\n let bs = B.offset b from in\n f (Ghost.hide (B.loc_buffer b)) bl bs\n\nlet load64_be\n b\n=\n LowStar.Endianness.load64_be b\n\nlet load32_be\n b\n=\n LowStar.Endianness.load32_be b\n\nlet load32_le\n b\n=\n LowStar.Endianness.load32_le b\n\nlet store64_be\n b z\n= LowStar.Endianness.store64_be b z\n\nlet store32_be\n b z\n= LowStar.Endianness.store32_be b z\n\nlet store32_le", "dependencies": { "source_file": "QUIC.Secret.Buffer.fst", "checked_file": "QUIC.Secret.Buffer.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "E", "full_module": "FStar.Endianness" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b: LowStar.Buffer.buffer Lib.IntTypes.uint8 {LowStar.Monotonic.Buffer.length b == 4} ->\n z: Lib.IntTypes.uint32\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "Prims.eq2", "Prims.int", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Lib.IntTypes.uint32", "LowStar.Endianness.store32_le", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val store32_le\n (b:B.buffer Secret.uint8 {B.length b == 4})\n (z:Secret.uint32)\n: HST.Stack unit\n (requires (fun h -> B.live h b))\n (ensures (fun h0 _ h1 -> B.(modifies (loc_buffer b) h0 h1) /\\ B.live h1 b /\\\n E.le_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))\nlet store32_le b z =", "completed_definiton": "LowStar.Endianness.store32_le b z", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Buffer.fst", "name": "QUIC.Secret.Buffer.load32_le", "original_source_type": "val load32_le\n (b:B.buffer Secret.uint8 {B.length b == 4}):\n HST.Stack Secret.uint32\n (requires (fun h -> B.live h b))\n (ensures (fun h0 z h1 -> h0 == h1 /\\ B.live h1 b /\\\n E.le_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))", "source_type": "val load32_le\n (b:B.buffer Secret.uint8 {B.length b == 4}):\n HST.Stack Secret.uint32\n (requires (fun h -> B.live h b))\n (ensures (fun h0 z h1 -> h0 == h1 /\\ B.live h1 b /\\\n E.le_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))", "source_definition": "let load32_le\n b\n=\n LowStar.Endianness.load32_le b", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Buffer.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 58, "start_col": 2, "end_line": 58, "end_col": 32 }, "file_context": "module QUIC.Secret.Buffer\n\nfriend Lib.IntTypes\n\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\nmodule Seq = QUIC.Secret.Seq\nmodule Ghost = FStar.Ghost\n\n#set-options \"--z3rlimit 64\" // --query_stats\"\n\n#restart-solver\n\nlet seq_hide_eq\n (#t: Secret.inttype { Secret.unsigned t })\n (x: Seq.seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (Seq.seq_hide x `Seq.equal` x)\n [SMTPat (Seq.seq_hide x)]\n= ()\n\nlet seq_reveal_eq\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: Seq.seq (Secret.uint_t t sec))\n: Lemma\n (Seq.seq_reveal x `Seq.equal` x)\n [SMTPat (Seq.seq_reveal x)]\n= ()\n\nlet with_buffer_hide #t b from to h0 lin lout x1 x2 x3 x4 x5 x6 post f =\n let bl = B.sub b 0ul from in\n let bs = B.sub b from (to `U32.sub` from) in\n let br = B.offset b to in\n f (Ghost.hide (B.loc_buffer b)) bl bs br\n\nlet with_buffer_hide_from #t b from h0 lin lout x1 x2 x3 x4 post f =\n let bl = B.sub b 0ul from in\n let bs = B.offset b from in\n f (Ghost.hide (B.loc_buffer b)) bl bs\n\nlet load64_be\n b\n=\n LowStar.Endianness.load64_be b\n\nlet load32_be\n b\n=\n LowStar.Endianness.load32_be b\n\nlet load32_le\n b", "dependencies": { "source_file": "QUIC.Secret.Buffer.fst", "checked_file": "QUIC.Secret.Buffer.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "E", "full_module": "FStar.Endianness" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: LowStar.Buffer.buffer Lib.IntTypes.uint8 {LowStar.Monotonic.Buffer.length b == 4}\n -> FStar.HyperStack.ST.Stack Lib.IntTypes.uint32", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "Prims.eq2", "Prims.int", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "LowStar.Endianness.load32_le", "FStar.UInt32.t", "Lib.IntTypes.uint32" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val load32_le\n (b:B.buffer Secret.uint8 {B.length b == 4}):\n HST.Stack Secret.uint32\n (requires (fun h -> B.live h b))\n (ensures (fun h0 z h1 -> h0 == h1 /\\ B.live h1 b /\\\n E.le_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))\nlet load32_le b =", "completed_definiton": "LowStar.Endianness.load32_le b", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Buffer.fst", "name": "QUIC.Secret.Buffer.store64_be", "original_source_type": "val store64_be\n (b:B.buffer Secret.uint8 {B.length b == 8})\n (z:Secret.uint64)\n: HST.Stack unit\n (requires (fun h -> B.live h b))\n (ensures (fun h0 _ h1 -> B.(modifies (loc_buffer b) h0 h1) /\\ B.live h1 b /\\\n E.be_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))", "source_type": "val store64_be\n (b:B.buffer Secret.uint8 {B.length b == 8})\n (z:Secret.uint64)\n: HST.Stack unit\n (requires (fun h -> B.live h b))\n (ensures (fun h0 _ h1 -> B.(modifies (loc_buffer b) h0 h1) /\\ B.live h1 b /\\\n E.be_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))", "source_definition": "let store64_be\n b z\n= LowStar.Endianness.store64_be b z", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Buffer.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 62, "start_col": 2, "end_line": 62, "end_col": 35 }, "file_context": "module QUIC.Secret.Buffer\n\nfriend Lib.IntTypes\n\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\nmodule Seq = QUIC.Secret.Seq\nmodule Ghost = FStar.Ghost\n\n#set-options \"--z3rlimit 64\" // --query_stats\"\n\n#restart-solver\n\nlet seq_hide_eq\n (#t: Secret.inttype { Secret.unsigned t })\n (x: Seq.seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (Seq.seq_hide x `Seq.equal` x)\n [SMTPat (Seq.seq_hide x)]\n= ()\n\nlet seq_reveal_eq\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: Seq.seq (Secret.uint_t t sec))\n: Lemma\n (Seq.seq_reveal x `Seq.equal` x)\n [SMTPat (Seq.seq_reveal x)]\n= ()\n\nlet with_buffer_hide #t b from to h0 lin lout x1 x2 x3 x4 x5 x6 post f =\n let bl = B.sub b 0ul from in\n let bs = B.sub b from (to `U32.sub` from) in\n let br = B.offset b to in\n f (Ghost.hide (B.loc_buffer b)) bl bs br\n\nlet with_buffer_hide_from #t b from h0 lin lout x1 x2 x3 x4 post f =\n let bl = B.sub b 0ul from in\n let bs = B.offset b from in\n f (Ghost.hide (B.loc_buffer b)) bl bs\n\nlet load64_be\n b\n=\n LowStar.Endianness.load64_be b\n\nlet load32_be\n b\n=\n LowStar.Endianness.load32_be b\n\nlet load32_le\n b\n=\n LowStar.Endianness.load32_le b\n\nlet store64_be", "dependencies": { "source_file": "QUIC.Secret.Buffer.fst", "checked_file": "QUIC.Secret.Buffer.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "E", "full_module": "FStar.Endianness" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b: LowStar.Buffer.buffer Lib.IntTypes.uint8 {LowStar.Monotonic.Buffer.length b == 8} ->\n z: Lib.IntTypes.uint64\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "Prims.eq2", "Prims.int", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Lib.IntTypes.uint64", "LowStar.Endianness.store64_be", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val store64_be\n (b:B.buffer Secret.uint8 {B.length b == 8})\n (z:Secret.uint64)\n: HST.Stack unit\n (requires (fun h -> B.live h b))\n (ensures (fun h0 _ h1 -> B.(modifies (loc_buffer b) h0 h1) /\\ B.live h1 b /\\\n E.be_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))\nlet store64_be b z =", "completed_definiton": "LowStar.Endianness.store64_be b z", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Buffer.fst", "name": "QUIC.Secret.Buffer.load64_be", "original_source_type": "val load64_be\n (b:B.buffer Secret.uint8{B.length b == 8}):\n HST.Stack Secret.uint64\n (requires (fun h -> B.live h b))\n (ensures (fun h0 z h1 -> h0 == h1 /\\ B.live h1 b /\\\n E.be_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))", "source_type": "val load64_be\n (b:B.buffer Secret.uint8{B.length b == 8}):\n HST.Stack Secret.uint64\n (requires (fun h -> B.live h b))\n (ensures (fun h0 z h1 -> h0 == h1 /\\ B.live h1 b /\\\n E.be_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))", "source_definition": "let load64_be\n b\n=\n LowStar.Endianness.load64_be b", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Buffer.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 48, "start_col": 2, "end_line": 48, "end_col": 32 }, "file_context": "module QUIC.Secret.Buffer\n\nfriend Lib.IntTypes\n\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\nmodule Seq = QUIC.Secret.Seq\nmodule Ghost = FStar.Ghost\n\n#set-options \"--z3rlimit 64\" // --query_stats\"\n\n#restart-solver\n\nlet seq_hide_eq\n (#t: Secret.inttype { Secret.unsigned t })\n (x: Seq.seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (Seq.seq_hide x `Seq.equal` x)\n [SMTPat (Seq.seq_hide x)]\n= ()\n\nlet seq_reveal_eq\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: Seq.seq (Secret.uint_t t sec))\n: Lemma\n (Seq.seq_reveal x `Seq.equal` x)\n [SMTPat (Seq.seq_reveal x)]\n= ()\n\nlet with_buffer_hide #t b from to h0 lin lout x1 x2 x3 x4 x5 x6 post f =\n let bl = B.sub b 0ul from in\n let bs = B.sub b from (to `U32.sub` from) in\n let br = B.offset b to in\n f (Ghost.hide (B.loc_buffer b)) bl bs br\n\nlet with_buffer_hide_from #t b from h0 lin lout x1 x2 x3 x4 post f =\n let bl = B.sub b 0ul from in\n let bs = B.offset b from in\n f (Ghost.hide (B.loc_buffer b)) bl bs\n\nlet load64_be\n b", "dependencies": { "source_file": "QUIC.Secret.Buffer.fst", "checked_file": "QUIC.Secret.Buffer.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "E", "full_module": "FStar.Endianness" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: LowStar.Buffer.buffer Lib.IntTypes.uint8 {LowStar.Monotonic.Buffer.length b == 8}\n -> FStar.HyperStack.ST.Stack Lib.IntTypes.uint64", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "Prims.eq2", "Prims.int", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "LowStar.Endianness.load64_be", "FStar.UInt64.t", "Lib.IntTypes.uint64" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val load64_be\n (b:B.buffer Secret.uint8{B.length b == 8}):\n HST.Stack Secret.uint64\n (requires (fun h -> B.live h b))\n (ensures (fun h0 z h1 -> h0 == h1 /\\ B.live h1 b /\\\n E.be_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))\nlet load64_be b =", "completed_definiton": "LowStar.Endianness.load64_be b", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Buffer.fst", "name": "QUIC.Secret.Buffer.with_buffer_hide_from", "original_source_type": "val with_buffer_hide_from\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t { U32.v from <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (x1 x2 x3 x4: Ghost.erased U32.t)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (B.length b - U32.v from)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (B.length b - U32.v from) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs) /\\\n B.live h bl /\\ B.live h bs /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (B.len b `U32.sub` from)))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if bl x1 x2 `B.loc_union` loc_buffer_from_to_if bs x3 x4) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if (B.gsub b 0ul from) x1 x2 `B.loc_union` loc_buffer_from_to_if (B.gsub b from (B.len b `U32.sub` from)) x3 x4) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (B.len b `U32.sub` from))) h'\n ))", "source_type": "val with_buffer_hide_from\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t { U32.v from <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (x1 x2 x3 x4: Ghost.erased U32.t)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (B.length b - U32.v from)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (B.length b - U32.v from) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs) /\\\n B.live h bl /\\ B.live h bs /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (B.len b `U32.sub` from)))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if bl x1 x2 `B.loc_union` loc_buffer_from_to_if bs x3 x4) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if (B.gsub b 0ul from) x1 x2 `B.loc_union` loc_buffer_from_to_if (B.gsub b from (B.len b `U32.sub` from)) x3 x4) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (B.len b `U32.sub` from))) h'\n ))", "source_definition": "let with_buffer_hide_from #t b from h0 lin lout x1 x2 x3 x4 post f =\n let bl = B.sub b 0ul from in\n let bs = B.offset b from in\n f (Ghost.hide (B.loc_buffer b)) bl bs", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Buffer.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 40, "start_col": 68, "end_line": 43, "end_col": 39 }, "file_context": "module QUIC.Secret.Buffer\n\nfriend Lib.IntTypes\n\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\nmodule Seq = QUIC.Secret.Seq\nmodule Ghost = FStar.Ghost\n\n#set-options \"--z3rlimit 64\" // --query_stats\"\n\n#restart-solver\n\nlet seq_hide_eq\n (#t: Secret.inttype { Secret.unsigned t })\n (x: Seq.seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (Seq.seq_hide x `Seq.equal` x)\n [SMTPat (Seq.seq_hide x)]\n= ()\n\nlet seq_reveal_eq\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: Seq.seq (Secret.uint_t t sec))\n: Lemma\n (Seq.seq_reveal x `Seq.equal` x)\n [SMTPat (Seq.seq_reveal x)]\n= ()\n\nlet with_buffer_hide #t b from to h0 lin lout x1 x2 x3 x4 x5 x6 post f =\n let bl = B.sub b 0ul from in\n let bs = B.sub b from (to `U32.sub` from) in\n let br = B.offset b to in\n f (Ghost.hide (B.loc_buffer b)) bl bs br", "dependencies": { "source_file": "QUIC.Secret.Buffer.fst", "checked_file": "QUIC.Secret.Buffer.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b: LowStar.Buffer.buffer FStar.UInt8.t ->\n from: FStar.UInt32.t{FStar.UInt32.v from <= LowStar.Monotonic.Buffer.length b} ->\n h0: FStar.Monotonic.HyperStack.mem ->\n lin:\n FStar.Ghost.erased LowStar.Monotonic.Buffer.loc\n { LowStar.Monotonic.Buffer.loc_disjoint (FStar.Ghost.reveal lin)\n (LowStar.Monotonic.Buffer.loc_buffer b) } ->\n lout:\n FStar.Ghost.erased LowStar.Monotonic.Buffer.loc\n { LowStar.Monotonic.Buffer.loc_disjoint (FStar.Ghost.reveal lout)\n (LowStar.Monotonic.Buffer.loc_buffer b) } ->\n x1: FStar.Ghost.erased FStar.UInt32.t ->\n x2: FStar.Ghost.erased FStar.UInt32.t ->\n x3: FStar.Ghost.erased FStar.UInt32.t ->\n x4: FStar.Ghost.erased FStar.UInt32.t ->\n post:\n (\n res: t ->\n contl: FStar.Seq.Properties.lseq FStar.UInt8.t (FStar.UInt32.v from) ->\n cont:\n FStar.Seq.Properties.lseq FStar.UInt8.t\n (LowStar.Monotonic.Buffer.length b - FStar.UInt32.v from) ->\n h: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0) ->\n f:\n (\n l: FStar.Ghost.erased LowStar.Monotonic.Buffer.loc ->\n bl:\n LowStar.Buffer.buffer FStar.UInt8.t\n {LowStar.Monotonic.Buffer.length bl == FStar.UInt32.v from} ->\n bs:\n LowStar.Buffer.buffer Lib.IntTypes.uint8\n { LowStar.Monotonic.Buffer.length bs ==\n LowStar.Monotonic.Buffer.length b - FStar.UInt32.v from }\n -> FStar.HyperStack.ST.Stack t)\n -> FStar.HyperStack.ST.Stack t", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "FStar.Monotonic.HyperStack.mem", "FStar.Ghost.erased", "LowStar.Monotonic.Buffer.loc", "LowStar.Monotonic.Buffer.loc_disjoint", "FStar.Ghost.reveal", "LowStar.Monotonic.Buffer.loc_buffer", "FStar.Seq.Properties.lseq", "Prims.op_Subtraction", "Prims.eq2", "Prims.int", "Prims.l_or", "Prims.op_GreaterThanOrEqual", "FStar.UInt.size", "FStar.UInt32.n", "Lib.IntTypes.uint8", "Prims.l_and", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.live", "FStar.Seq.Base.seq", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Buffer.gsub", "FStar.UInt32.__uint_to_t", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "QUIC.Secret.Seq.seq_hide", "FStar.UInt32.sub", "LowStar.Monotonic.Buffer.len", "QUIC.Secret.Buffer.loc_buffer_from_to_if", "QUIC.Secret.Seq.seq_reveal", "FStar.Ghost.hide", "LowStar.Monotonic.Buffer.mbuffer", "LowStar.Buffer.offset", "LowStar.Buffer.sub" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val with_buffer_hide_from\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t { U32.v from <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (x1 x2 x3 x4: Ghost.erased U32.t)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (B.length b - U32.v from)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (B.length b - U32.v from) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs) /\\\n B.live h bl /\\ B.live h bs /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (B.len b `U32.sub` from)))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if bl x1 x2 `B.loc_union` loc_buffer_from_to_if bs x3 x4) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if (B.gsub b 0ul from) x1 x2 `B.loc_union` loc_buffer_from_to_if (B.gsub b from (B.len b `U32.sub` from)) x3 x4) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (B.len b `U32.sub` from))) h'\n ))\nlet with_buffer_hide_from #t b from h0 lin lout x1 x2 x3 x4 post f =", "completed_definiton": "let bl = B.sub b 0ul from in\nlet bs = B.offset b from in\nf (Ghost.hide (B.loc_buffer b)) bl bs", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Buffer.fst", "name": "QUIC.Secret.Buffer.with_buffer_hide", "original_source_type": "val with_buffer_hide\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t)\n (to: U32.t { U32.v from <= U32.v to /\\ U32.v to <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (x1 x2 x3 x4 x5 x6: Ghost.erased U32.t)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (U32.v to - U32.v from)) -> (contr: Seq.lseq U8.t (B.length b - U32.v to)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (U32.v to - U32.v from) }) ->\n (br: B.buffer U8.t { B.length br == (B.length b - U32.v to) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl `B.loc_union` B.loc_buffer bs) (B.loc_buffer br) /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs `B.loc_union` B.loc_buffer br) /\\\n B.live h bl /\\ B.live h bs /\\ B.live h br /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (to `U32.sub` from))) /\\\n B.as_seq h br == B.as_seq h0 (B.gsub b to (B.len b `U32.sub` to))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if bl x1 x2 `B.loc_union` loc_buffer_from_to_if bs x3 x4 `B.loc_union` loc_buffer_from_to_if br x5 x6) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) (B.as_seq h' br) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if (B.gsub b 0ul from) x1 x2 `B.loc_union` loc_buffer_from_to_if (B.gsub b from (to `U32.sub` from)) x3 x4 `B.loc_union` loc_buffer_from_to_if (B.gsub b to (B.len b `U32.sub` to)) x5 x6) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (to `U32.sub` from))) (B.as_seq h' (B.gsub b to (B.len b `U32.sub` to))) h'\n ))", "source_type": "val with_buffer_hide\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t)\n (to: U32.t { U32.v from <= U32.v to /\\ U32.v to <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (x1 x2 x3 x4 x5 x6: Ghost.erased U32.t)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (U32.v to - U32.v from)) -> (contr: Seq.lseq U8.t (B.length b - U32.v to)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (U32.v to - U32.v from) }) ->\n (br: B.buffer U8.t { B.length br == (B.length b - U32.v to) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl `B.loc_union` B.loc_buffer bs) (B.loc_buffer br) /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs `B.loc_union` B.loc_buffer br) /\\\n B.live h bl /\\ B.live h bs /\\ B.live h br /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (to `U32.sub` from))) /\\\n B.as_seq h br == B.as_seq h0 (B.gsub b to (B.len b `U32.sub` to))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if bl x1 x2 `B.loc_union` loc_buffer_from_to_if bs x3 x4 `B.loc_union` loc_buffer_from_to_if br x5 x6) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) (B.as_seq h' br) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if (B.gsub b 0ul from) x1 x2 `B.loc_union` loc_buffer_from_to_if (B.gsub b from (to `U32.sub` from)) x3 x4 `B.loc_union` loc_buffer_from_to_if (B.gsub b to (B.len b `U32.sub` to)) x5 x6) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (to `U32.sub` from))) (B.as_seq h' (B.gsub b to (B.len b `U32.sub` to))) h'\n ))", "source_definition": "let with_buffer_hide #t b from to h0 lin lout x1 x2 x3 x4 x5 x6 post f =\n let bl = B.sub b 0ul from in\n let bs = B.sub b from (to `U32.sub` from) in\n let br = B.offset b to in\n f (Ghost.hide (B.loc_buffer b)) bl bs br", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Buffer.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 34, "start_col": 72, "end_line": 38, "end_col": 42 }, "file_context": "module QUIC.Secret.Buffer\n\nfriend Lib.IntTypes\n\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\nmodule Seq = QUIC.Secret.Seq\nmodule Ghost = FStar.Ghost\n\n#set-options \"--z3rlimit 64\" // --query_stats\"\n\n#restart-solver\n\nlet seq_hide_eq\n (#t: Secret.inttype { Secret.unsigned t })\n (x: Seq.seq (Secret.uint_t t Secret.PUB))\n: Lemma\n (Seq.seq_hide x `Seq.equal` x)\n [SMTPat (Seq.seq_hide x)]\n= ()\n\nlet seq_reveal_eq\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: Seq.seq (Secret.uint_t t sec))\n: Lemma\n (Seq.seq_reveal x `Seq.equal` x)\n [SMTPat (Seq.seq_reveal x)]\n= ()", "dependencies": { "source_file": "QUIC.Secret.Buffer.fst", "checked_file": "QUIC.Secret.Buffer.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b: LowStar.Buffer.buffer FStar.UInt8.t ->\n from: FStar.UInt32.t ->\n to:\n FStar.UInt32.t\n { FStar.UInt32.v from <= FStar.UInt32.v to /\\\n FStar.UInt32.v to <= LowStar.Monotonic.Buffer.length b } ->\n h0: FStar.Monotonic.HyperStack.mem ->\n lin:\n FStar.Ghost.erased LowStar.Monotonic.Buffer.loc\n { LowStar.Monotonic.Buffer.loc_disjoint (FStar.Ghost.reveal lin)\n (LowStar.Monotonic.Buffer.loc_buffer b) } ->\n lout:\n FStar.Ghost.erased LowStar.Monotonic.Buffer.loc\n { LowStar.Monotonic.Buffer.loc_disjoint (FStar.Ghost.reveal lout)\n (LowStar.Monotonic.Buffer.loc_buffer b) } ->\n x1: FStar.Ghost.erased FStar.UInt32.t ->\n x2: FStar.Ghost.erased FStar.UInt32.t ->\n x3: FStar.Ghost.erased FStar.UInt32.t ->\n x4: FStar.Ghost.erased FStar.UInt32.t ->\n x5: FStar.Ghost.erased FStar.UInt32.t ->\n x6: FStar.Ghost.erased FStar.UInt32.t ->\n post:\n (\n res: t ->\n contl: FStar.Seq.Properties.lseq FStar.UInt8.t (FStar.UInt32.v from) ->\n cont: FStar.Seq.Properties.lseq FStar.UInt8.t (FStar.UInt32.v to - FStar.UInt32.v from) ->\n contr:\n FStar.Seq.Properties.lseq FStar.UInt8.t\n (LowStar.Monotonic.Buffer.length b - FStar.UInt32.v to) ->\n h: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0) ->\n f:\n (\n l: FStar.Ghost.erased LowStar.Monotonic.Buffer.loc ->\n bl:\n LowStar.Buffer.buffer FStar.UInt8.t\n {LowStar.Monotonic.Buffer.length bl == FStar.UInt32.v from} ->\n bs:\n LowStar.Buffer.buffer Lib.IntTypes.uint8\n {LowStar.Monotonic.Buffer.length bs == FStar.UInt32.v to - FStar.UInt32.v from} ->\n br:\n LowStar.Buffer.buffer FStar.UInt8.t\n { LowStar.Monotonic.Buffer.length br ==\n LowStar.Monotonic.Buffer.length b - FStar.UInt32.v to }\n -> FStar.HyperStack.ST.Stack t)\n -> FStar.HyperStack.ST.Stack t", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "FStar.Monotonic.HyperStack.mem", "FStar.Ghost.erased", "LowStar.Monotonic.Buffer.loc", "LowStar.Monotonic.Buffer.loc_disjoint", "FStar.Ghost.reveal", "LowStar.Monotonic.Buffer.loc_buffer", "FStar.Seq.Properties.lseq", "Prims.op_Subtraction", "Prims.eq2", "Prims.int", "Prims.l_or", "Prims.op_GreaterThanOrEqual", "FStar.UInt.size", "FStar.UInt32.n", "Lib.IntTypes.uint8", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.live", "FStar.Seq.Base.seq", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Buffer.gsub", "FStar.UInt32.__uint_to_t", "QUIC.Secret.Seq.seq_hide", "Lib.IntTypes.U8", "FStar.UInt32.sub", "LowStar.Monotonic.Buffer.len", "QUIC.Secret.Buffer.loc_buffer_from_to_if", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.SEC", "FStar.Ghost.hide", "LowStar.Monotonic.Buffer.mbuffer", "LowStar.Buffer.offset", "LowStar.Buffer.sub" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val with_buffer_hide\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t)\n (to: U32.t { U32.v from <= U32.v to /\\ U32.v to <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (x1 x2 x3 x4 x5 x6: Ghost.erased U32.t)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (U32.v to - U32.v from)) -> (contr: Seq.lseq U8.t (B.length b - U32.v to)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (U32.v to - U32.v from) }) ->\n (br: B.buffer U8.t { B.length br == (B.length b - U32.v to) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl `B.loc_union` B.loc_buffer bs) (B.loc_buffer br) /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs `B.loc_union` B.loc_buffer br) /\\\n B.live h bl /\\ B.live h bs /\\ B.live h br /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (to `U32.sub` from))) /\\\n B.as_seq h br == B.as_seq h0 (B.gsub b to (B.len b `U32.sub` to))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if bl x1 x2 `B.loc_union` loc_buffer_from_to_if bs x3 x4 `B.loc_union` loc_buffer_from_to_if br x5 x6) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) (B.as_seq h' br) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if (B.gsub b 0ul from) x1 x2 `B.loc_union` loc_buffer_from_to_if (B.gsub b from (to `U32.sub` from)) x3 x4 `B.loc_union` loc_buffer_from_to_if (B.gsub b to (B.len b `U32.sub` to)) x5 x6) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (to `U32.sub` from))) (B.as_seq h' (B.gsub b to (B.len b `U32.sub` to))) h'\n ))\nlet with_buffer_hide #t b from to h0 lin lout x1 x2 x3 x4 x5 x6 post f =", "completed_definiton": "let bl = B.sub b 0ul from in\nlet bs = B.sub b from (to `U32.sub` from) in\nlet br = B.offset b to in\nf (Ghost.hide (B.loc_buffer b)) bl bs br", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fsti", "name": "QUIC.Impl.Header.Public.dcid_len", "original_source_type": "val dcid_len (h: header) : Tot short_dcid_len_t", "source_type": "val dcid_len (h: header) : Tot short_dcid_len_t", "source_definition": "let dcid_len (h: header) : Tot short_dcid_len_t =\n match h with\n | PLong _ _ _ dcil _ _ _ -> dcil\n | PShort _ _ _ dcil -> dcil", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 70, "start_col": 2, "end_line": 72, "end_col": 29 }, "file_context": "module QUIC.Impl.Header.Public\ninclude QUIC.Spec.Header.Public\ninclude QUIC.Impl.Base\n\nmodule LP = LowParse.Low.Base\nmodule U32 = FStar.UInt32\nmodule S = QUIC.Spec.Header.Public\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule HS = FStar.HyperStack\nmodule FB = FStar.Bytes\nmodule U64 = FStar.UInt64\nmodule HST = FStar.HyperStack.ST\nmodule Secret = QUIC.Secret.Int\n\nval validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n\nnoeq\ntype long_header_specifics =\n| PInitial:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (token: B.buffer U8.t) ->\n (token_length: U32.t { let v = U32.v token_length in v == B.length token /\\ 0 <= v /\\ v <= token_max_len }) ->\n long_header_specifics\n| PZeroRTT:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PHandshake:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PRetry:\n odcid: B.buffer U8.t ->\n odcil: U32.t { let v = U32.v odcil in v = B.length odcid /\\ 0 <= v /\\ v <= 20 } ->\n long_header_specifics\n\nnoeq\ntype header =\n| PLong:\n (protected_bits: secret_bitfield 4) ->\n (version: U32.t) ->\n dcid: B.buffer U8.t ->\n dcil: U32.t { let v = U32.v dcil in v == B.length dcid /\\ 0 <= v /\\ v <= 20 } ->\n scid: B.buffer U8.t ->\n scil: U32.t { let v = U32.v scil in v == B.length scid /\\ 0 <= v /\\ v <= 20 } ->\n (spec: long_header_specifics) ->\n header\n| PShort:\n (protected_bits: secret_bitfield 5) ->\n (spin: bool) ->\n cid: B.buffer U8.t ->\n cid_len: U32.t{\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n } ->\n header\n\nlet is_retry\n (h: header)\n: Tot bool\n= if PShort? h\n then false\n else\n let spec = PLong?.spec h in\n PRetry? spec", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fsti", "checked_file": "QUIC.Impl.Header.Public.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Impl.Header.Public.header -> QUIC.Spec.Base.short_dcid_len_t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Public.header", "QUIC.Spec.Base.secret_bitfield", "FStar.UInt32.t", "LowStar.Buffer.buffer", "FStar.UInt8.t", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.op_LessThanOrEqual", "FStar.UInt.uint_t", "FStar.UInt32.v", "QUIC.Impl.Header.Public.long_header_specifics", "Prims.bool", "QUIC.Spec.Base.short_dcid_len_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val dcid_len (h: header) : Tot short_dcid_len_t\nlet dcid_len (h: header) : Tot short_dcid_len_t =", "completed_definiton": "match h with\n| PLong _ _ _ dcil _ _ _ -> dcil\n| PShort _ _ _ dcil -> dcil", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fsti", "name": "QUIC.Impl.Header.Public.is_retry", "original_source_type": "val is_retry (h: header) : Tot bool", "source_type": "val is_retry (h: header) : Tot bool", "source_definition": "let is_retry\n (h: header)\n: Tot bool\n= if PShort? h\n then false\n else\n let spec = PLong?.spec h in\n PRetry? spec", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 63, "start_col": 2, "end_line": 67, "end_col": 16 }, "file_context": "module QUIC.Impl.Header.Public\ninclude QUIC.Spec.Header.Public\ninclude QUIC.Impl.Base\n\nmodule LP = LowParse.Low.Base\nmodule U32 = FStar.UInt32\nmodule S = QUIC.Spec.Header.Public\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule HS = FStar.HyperStack\nmodule FB = FStar.Bytes\nmodule U64 = FStar.UInt64\nmodule HST = FStar.HyperStack.ST\nmodule Secret = QUIC.Secret.Int\n\nval validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n\nnoeq\ntype long_header_specifics =\n| PInitial:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (token: B.buffer U8.t) ->\n (token_length: U32.t { let v = U32.v token_length in v == B.length token /\\ 0 <= v /\\ v <= token_max_len }) ->\n long_header_specifics\n| PZeroRTT:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PHandshake:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PRetry:\n odcid: B.buffer U8.t ->\n odcil: U32.t { let v = U32.v odcil in v = B.length odcid /\\ 0 <= v /\\ v <= 20 } ->\n long_header_specifics\n\nnoeq\ntype header =\n| PLong:\n (protected_bits: secret_bitfield 4) ->\n (version: U32.t) ->\n dcid: B.buffer U8.t ->\n dcil: U32.t { let v = U32.v dcil in v == B.length dcid /\\ 0 <= v /\\ v <= 20 } ->\n scid: B.buffer U8.t ->\n scil: U32.t { let v = U32.v scil in v == B.length scid /\\ 0 <= v /\\ v <= 20 } ->\n (spec: long_header_specifics) ->\n header\n| PShort:\n (protected_bits: secret_bitfield 5) ->\n (spin: bool) ->\n cid: B.buffer U8.t ->\n cid_len: U32.t{\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n } ->\n header\n\nlet is_retry\n (h: header)", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fsti", "checked_file": "QUIC.Impl.Header.Public.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Impl.Header.Public.header -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Public.header", "QUIC.Impl.Header.Public.uu___is_PShort", "Prims.bool", "QUIC.Impl.Header.Public.uu___is_PRetry", "QUIC.Impl.Header.Public.long_header_specifics", "QUIC.Impl.Header.Public.__proj__PLong__item__spec" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val is_retry (h: header) : Tot bool\nlet is_retry (h: header) : Tot bool =", "completed_definiton": "if PShort? h\nthen false\nelse\n let spec = PLong?.spec h in\n PRetry? spec", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fsti", "name": "QUIC.Impl.Header.Public.header_footprint", "original_source_type": "val header_footprint (h: header) : GTot B.loc", "source_type": "val header_footprint (h: header) : GTot B.loc", "source_definition": "let header_footprint (h: header) : GTot B.loc =\n match h with\n | PShort protected_bits spin cid cid_len ->\n B.loc_buffer cid\n | PLong protected_bits version dcid dcil scid scil spec ->\n B.loc_buffer dcid `B.loc_union` B.loc_buffer scid `B.loc_union`\n begin match spec with\n | PInitial payload_and_pn_length token token_length ->\n B.loc_buffer token\n | PRetry odcid odcil ->\n B.loc_buffer odcid\n | _ -> B.loc_none\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 89, "start_col": 2, "end_line": 100, "end_col": 7 }, "file_context": "module QUIC.Impl.Header.Public\ninclude QUIC.Spec.Header.Public\ninclude QUIC.Impl.Base\n\nmodule LP = LowParse.Low.Base\nmodule U32 = FStar.UInt32\nmodule S = QUIC.Spec.Header.Public\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule HS = FStar.HyperStack\nmodule FB = FStar.Bytes\nmodule U64 = FStar.UInt64\nmodule HST = FStar.HyperStack.ST\nmodule Secret = QUIC.Secret.Int\n\nval validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n\nnoeq\ntype long_header_specifics =\n| PInitial:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (token: B.buffer U8.t) ->\n (token_length: U32.t { let v = U32.v token_length in v == B.length token /\\ 0 <= v /\\ v <= token_max_len }) ->\n long_header_specifics\n| PZeroRTT:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PHandshake:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PRetry:\n odcid: B.buffer U8.t ->\n odcil: U32.t { let v = U32.v odcil in v = B.length odcid /\\ 0 <= v /\\ v <= 20 } ->\n long_header_specifics\n\nnoeq\ntype header =\n| PLong:\n (protected_bits: secret_bitfield 4) ->\n (version: U32.t) ->\n dcid: B.buffer U8.t ->\n dcil: U32.t { let v = U32.v dcil in v == B.length dcid /\\ 0 <= v /\\ v <= 20 } ->\n scid: B.buffer U8.t ->\n scil: U32.t { let v = U32.v scil in v == B.length scid /\\ 0 <= v /\\ v <= 20 } ->\n (spec: long_header_specifics) ->\n header\n| PShort:\n (protected_bits: secret_bitfield 5) ->\n (spin: bool) ->\n cid: B.buffer U8.t ->\n cid_len: U32.t{\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n } ->\n header\n\nlet is_retry\n (h: header)\n: Tot bool\n= if PShort? h\n then false\n else\n let spec = PLong?.spec h in\n PRetry? spec\n\nlet dcid_len (h: header) : Tot short_dcid_len_t =\n match h with\n | PLong _ _ _ dcil _ _ _ -> dcil\n | PShort _ _ _ dcil -> dcil\n\nlet header_live (h: header) (m: HS.mem) : GTot Type0 =\n match h with\n | PShort protected_bits spin cid cid_len ->\n B.live m cid\n | PLong protected_bits version dcid dcil scid scil spec ->\n B.live m dcid /\\ B.live m scid /\\\n begin match spec with\n | PInitial payload_and_pn_length token token_length ->\n B.live m token\n | PRetry odcid odcil ->\n B.live m odcid\n | _ -> True\n end", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fsti", "checked_file": "QUIC.Impl.Header.Public.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Impl.Header.Public.header -> Prims.GTot LowStar.Monotonic.Buffer.loc", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Public.header", "QUIC.Spec.Base.secret_bitfield", "Prims.bool", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.op_LessThanOrEqual", "FStar.UInt.uint_t", "FStar.UInt32.v", "LowStar.Monotonic.Buffer.loc_buffer", "QUIC.Impl.Header.Public.long_header_specifics", "LowStar.Monotonic.Buffer.loc_union", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Base.token_max_len", "Prims.op_Equality", "LowStar.Monotonic.Buffer.loc_none", "LowStar.Monotonic.Buffer.loc" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_footprint (h: header) : GTot B.loc\nlet header_footprint (h: header) : GTot B.loc =", "completed_definiton": "match h with\n| PShort protected_bits spin cid cid_len -> B.loc_buffer cid\n| PLong protected_bits version dcid dcil scid scil spec ->\n ((B.loc_buffer dcid) `B.loc_union` (B.loc_buffer scid))\n `B.loc_union`\n (match spec with\n | PInitial payload_and_pn_length token token_length -> B.loc_buffer token\n | PRetry odcid odcil -> B.loc_buffer odcid\n | _ -> B.loc_none)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fsti", "name": "QUIC.Impl.Header.Public.header_live", "original_source_type": "val header_live (h: header) (m: HS.mem) : GTot Type0", "source_type": "val header_live (h: header) (m: HS.mem) : GTot Type0", "source_definition": "let header_live (h: header) (m: HS.mem) : GTot Type0 =\n match h with\n | PShort protected_bits spin cid cid_len ->\n B.live m cid\n | PLong protected_bits version dcid dcil scid scil spec ->\n B.live m dcid /\\ B.live m scid /\\\n begin match spec with\n | PInitial payload_and_pn_length token token_length ->\n B.live m token\n | PRetry odcid odcil ->\n B.live m odcid\n | _ -> True\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 75, "start_col": 2, "end_line": 86, "end_col": 7 }, "file_context": "module QUIC.Impl.Header.Public\ninclude QUIC.Spec.Header.Public\ninclude QUIC.Impl.Base\n\nmodule LP = LowParse.Low.Base\nmodule U32 = FStar.UInt32\nmodule S = QUIC.Spec.Header.Public\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule HS = FStar.HyperStack\nmodule FB = FStar.Bytes\nmodule U64 = FStar.UInt64\nmodule HST = FStar.HyperStack.ST\nmodule Secret = QUIC.Secret.Int\n\nval validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n\nnoeq\ntype long_header_specifics =\n| PInitial:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (token: B.buffer U8.t) ->\n (token_length: U32.t { let v = U32.v token_length in v == B.length token /\\ 0 <= v /\\ v <= token_max_len }) ->\n long_header_specifics\n| PZeroRTT:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PHandshake:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PRetry:\n odcid: B.buffer U8.t ->\n odcil: U32.t { let v = U32.v odcil in v = B.length odcid /\\ 0 <= v /\\ v <= 20 } ->\n long_header_specifics\n\nnoeq\ntype header =\n| PLong:\n (protected_bits: secret_bitfield 4) ->\n (version: U32.t) ->\n dcid: B.buffer U8.t ->\n dcil: U32.t { let v = U32.v dcil in v == B.length dcid /\\ 0 <= v /\\ v <= 20 } ->\n scid: B.buffer U8.t ->\n scil: U32.t { let v = U32.v scil in v == B.length scid /\\ 0 <= v /\\ v <= 20 } ->\n (spec: long_header_specifics) ->\n header\n| PShort:\n (protected_bits: secret_bitfield 5) ->\n (spin: bool) ->\n cid: B.buffer U8.t ->\n cid_len: U32.t{\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n } ->\n header\n\nlet is_retry\n (h: header)\n: Tot bool\n= if PShort? h\n then false\n else\n let spec = PLong?.spec h in\n PRetry? spec\n\nlet dcid_len (h: header) : Tot short_dcid_len_t =\n match h with\n | PLong _ _ _ dcil _ _ _ -> dcil\n | PShort _ _ _ dcil -> dcil", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fsti", "checked_file": "QUIC.Impl.Header.Public.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Impl.Header.Public.header -> m: FStar.Monotonic.HyperStack.mem -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Public.header", "FStar.Monotonic.HyperStack.mem", "QUIC.Spec.Base.secret_bitfield", "Prims.bool", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.op_LessThanOrEqual", "FStar.UInt.uint_t", "FStar.UInt32.v", "LowStar.Monotonic.Buffer.live", "QUIC.Impl.Header.Public.long_header_specifics", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Base.token_max_len", "Prims.op_Equality", "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_live (h: header) (m: HS.mem) : GTot Type0\nlet header_live (h: header) (m: HS.mem) : GTot Type0 =", "completed_definiton": "match h with\n| PShort protected_bits spin cid cid_len -> B.live m cid\n| PLong protected_bits version dcid dcil scid scil spec ->\n B.live m dcid /\\ B.live m scid /\\\n (match spec with\n | PInitial payload_and_pn_length token token_length -> B.live m token\n | PRetry odcid odcil -> B.live m odcid\n | _ -> True)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fsti", "name": "QUIC.Impl.Header.Public.g_header", "original_source_type": "val g_header (h: header) (m: HS.mem) : GTot S.header", "source_type": "val g_header (h: header) (m: HS.mem) : GTot S.header", "source_definition": "let g_header (h: header) (m: HS.mem) : GTot S.header =\n match h with\n | PShort protected_bits spin cid cid_len ->\n S.PShort (Secret.reveal protected_bits) spin (FB.hide (B.as_seq m cid))\n | PLong protected_bits version dcid dcil scid scil spec ->\n S.PLong (Secret.reveal protected_bits) version (FB.hide (B.as_seq m dcid)) (FB.hide (B.as_seq m scid))\n begin match spec with\n | PInitial payload_and_pn_length token token_length ->\n S.PInitial (FB.hide (B.as_seq m token)) payload_and_pn_length \n | PRetry odcid odcil ->\n S.PRetry (FB.hide (B.as_seq m odcid))\n | PHandshake payload_and_pn_length -> S.PHandshake payload_and_pn_length\n | PZeroRTT payload_and_pn_length -> S.PZeroRTT payload_and_pn_length \n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 108, "start_col": 2, "end_line": 120, "end_col": 7 }, "file_context": "module QUIC.Impl.Header.Public\ninclude QUIC.Spec.Header.Public\ninclude QUIC.Impl.Base\n\nmodule LP = LowParse.Low.Base\nmodule U32 = FStar.UInt32\nmodule S = QUIC.Spec.Header.Public\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule HS = FStar.HyperStack\nmodule FB = FStar.Bytes\nmodule U64 = FStar.UInt64\nmodule HST = FStar.HyperStack.ST\nmodule Secret = QUIC.Secret.Int\n\nval validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n\nnoeq\ntype long_header_specifics =\n| PInitial:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (token: B.buffer U8.t) ->\n (token_length: U32.t { let v = U32.v token_length in v == B.length token /\\ 0 <= v /\\ v <= token_max_len }) ->\n long_header_specifics\n| PZeroRTT:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PHandshake:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PRetry:\n odcid: B.buffer U8.t ->\n odcil: U32.t { let v = U32.v odcil in v = B.length odcid /\\ 0 <= v /\\ v <= 20 } ->\n long_header_specifics\n\nnoeq\ntype header =\n| PLong:\n (protected_bits: secret_bitfield 4) ->\n (version: U32.t) ->\n dcid: B.buffer U8.t ->\n dcil: U32.t { let v = U32.v dcil in v == B.length dcid /\\ 0 <= v /\\ v <= 20 } ->\n scid: B.buffer U8.t ->\n scil: U32.t { let v = U32.v scil in v == B.length scid /\\ 0 <= v /\\ v <= 20 } ->\n (spec: long_header_specifics) ->\n header\n| PShort:\n (protected_bits: secret_bitfield 5) ->\n (spin: bool) ->\n cid: B.buffer U8.t ->\n cid_len: U32.t{\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n } ->\n header\n\nlet is_retry\n (h: header)\n: Tot bool\n= if PShort? h\n then false\n else\n let spec = PLong?.spec h in\n PRetry? spec\n\nlet dcid_len (h: header) : Tot short_dcid_len_t =\n match h with\n | PLong _ _ _ dcil _ _ _ -> dcil\n | PShort _ _ _ dcil -> dcil\n\nlet header_live (h: header) (m: HS.mem) : GTot Type0 =\n match h with\n | PShort protected_bits spin cid cid_len ->\n B.live m cid\n | PLong protected_bits version dcid dcil scid scil spec ->\n B.live m dcid /\\ B.live m scid /\\\n begin match spec with\n | PInitial payload_and_pn_length token token_length ->\n B.live m token\n | PRetry odcid odcil ->\n B.live m odcid\n | _ -> True\n end\n\nlet header_footprint (h: header) : GTot B.loc =\n match h with\n | PShort protected_bits spin cid cid_len ->\n B.loc_buffer cid\n | PLong protected_bits version dcid dcil scid scil spec ->\n B.loc_buffer dcid `B.loc_union` B.loc_buffer scid `B.loc_union`\n begin match spec with\n | PInitial payload_and_pn_length token token_length ->\n B.loc_buffer token\n | PRetry odcid odcil ->\n B.loc_buffer odcid\n | _ -> B.loc_none\n end\n\nlet header_live_loc_not_unused_in_footprint (h: header) (m: HS.mem) : Lemma\n (requires (header_live h m))\n (ensures (B.loc_not_unused_in m `B.loc_includes` header_footprint h))\n= ()", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fsti", "checked_file": "QUIC.Impl.Header.Public.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Impl.Header.Public.header -> m: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot QUIC.Spec.Header.Public.header", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Public.header", "FStar.Monotonic.HyperStack.mem", "QUIC.Spec.Base.secret_bitfield", "Prims.bool", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.op_LessThanOrEqual", "FStar.UInt.uint_t", "FStar.UInt32.v", "QUIC.Spec.Header.Public.PShort", "QUIC.Secret.Int.reveal", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "FStar.Bytes.hide", "LowStar.Monotonic.Buffer.as_seq", "QUIC.Impl.Header.Public.long_header_specifics", "QUIC.Spec.Header.Public.PLong", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Base.token_max_len", "QUIC.Spec.Header.Public.PInitial", "Prims.op_Equality", "QUIC.Spec.Header.Public.PRetry", "QUIC.Spec.Header.Public.PHandshake", "QUIC.Spec.Header.Public.PZeroRTT", "QUIC.Spec.Header.Public.long_header_specifics", "QUIC.Spec.Header.Public.header" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val g_header (h: header) (m: HS.mem) : GTot S.header\nlet g_header (h: header) (m: HS.mem) : GTot S.header =", "completed_definiton": "match h with\n| PShort protected_bits spin cid cid_len ->\n S.PShort (Secret.reveal protected_bits) spin (FB.hide (B.as_seq m cid))\n| PLong protected_bits version dcid dcil scid scil spec ->\n S.PLong (Secret.reveal protected_bits)\n version\n (FB.hide (B.as_seq m dcid))\n (FB.hide (B.as_seq m scid))\n (match spec with\n | PInitial payload_and_pn_length token token_length ->\n S.PInitial (FB.hide (B.as_seq m token)) payload_and_pn_length\n | PRetry odcid odcil -> S.PRetry (FB.hide (B.as_seq m odcid))\n | PHandshake payload_and_pn_length -> S.PHandshake payload_and_pn_length\n | PZeroRTT payload_and_pn_length -> S.PZeroRTT payload_and_pn_length)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fsti", "name": "QUIC.Impl.Header.Public.header_len", "original_source_type": "val header_len (h: header) : Tot U32.t", "source_type": "val header_len (h: header) : Tot U32.t", "source_definition": "let header_len\n (h: header)\n: Tot U32.t\n= match h with\n | PShort pb spin cid cid_len ->\n 1ul `U32.add` cid_len\n | PLong pb version dcid dcil scid scil spec ->\n 7ul `U32.add` dcil `U32.add` scil `U32.add`\n begin match spec with\n | PInitial payload_and_pn_length token token_length ->\n varint_len (Cast.uint32_to_uint64 token_length) `U32.add` token_length `U32.add` varint_len (payload_and_pn_length)\n | PZeroRTT payload_and_pn_length ->\n varint_len (payload_and_pn_length)\n | PHandshake payload_and_pn_length ->\n varint_len (payload_and_pn_length)\n | PRetry odcid odcil ->\n 1ul `U32.add` odcil\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 195, "start_col": 2, "end_line": 209, "end_col": 7 }, "file_context": "module QUIC.Impl.Header.Public\ninclude QUIC.Spec.Header.Public\ninclude QUIC.Impl.Base\n\nmodule LP = LowParse.Low.Base\nmodule U32 = FStar.UInt32\nmodule S = QUIC.Spec.Header.Public\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule HS = FStar.HyperStack\nmodule FB = FStar.Bytes\nmodule U64 = FStar.UInt64\nmodule HST = FStar.HyperStack.ST\nmodule Secret = QUIC.Secret.Int\n\nval validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n\nnoeq\ntype long_header_specifics =\n| PInitial:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n (token: B.buffer U8.t) ->\n (token_length: U32.t { let v = U32.v token_length in v == B.length token /\\ 0 <= v /\\ v <= token_max_len }) ->\n long_header_specifics\n| PZeroRTT:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PHandshake:\n (payload_and_pn_length: payload_and_pn_length_t) ->\n long_header_specifics\n| PRetry:\n odcid: B.buffer U8.t ->\n odcil: U32.t { let v = U32.v odcil in v = B.length odcid /\\ 0 <= v /\\ v <= 20 } ->\n long_header_specifics\n\nnoeq\ntype header =\n| PLong:\n (protected_bits: secret_bitfield 4) ->\n (version: U32.t) ->\n dcid: B.buffer U8.t ->\n dcil: U32.t { let v = U32.v dcil in v == B.length dcid /\\ 0 <= v /\\ v <= 20 } ->\n scid: B.buffer U8.t ->\n scil: U32.t { let v = U32.v scil in v == B.length scid /\\ 0 <= v /\\ v <= 20 } ->\n (spec: long_header_specifics) ->\n header\n| PShort:\n (protected_bits: secret_bitfield 5) ->\n (spin: bool) ->\n cid: B.buffer U8.t ->\n cid_len: U32.t{\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n } ->\n header\n\nlet is_retry\n (h: header)\n: Tot bool\n= if PShort? h\n then false\n else\n let spec = PLong?.spec h in\n PRetry? spec\n\nlet dcid_len (h: header) : Tot short_dcid_len_t =\n match h with\n | PLong _ _ _ dcil _ _ _ -> dcil\n | PShort _ _ _ dcil -> dcil\n\nlet header_live (h: header) (m: HS.mem) : GTot Type0 =\n match h with\n | PShort protected_bits spin cid cid_len ->\n B.live m cid\n | PLong protected_bits version dcid dcil scid scil spec ->\n B.live m dcid /\\ B.live m scid /\\\n begin match spec with\n | PInitial payload_and_pn_length token token_length ->\n B.live m token\n | PRetry odcid odcil ->\n B.live m odcid\n | _ -> True\n end\n\nlet header_footprint (h: header) : GTot B.loc =\n match h with\n | PShort protected_bits spin cid cid_len ->\n B.loc_buffer cid\n | PLong protected_bits version dcid dcil scid scil spec ->\n B.loc_buffer dcid `B.loc_union` B.loc_buffer scid `B.loc_union`\n begin match spec with\n | PInitial payload_and_pn_length token token_length ->\n B.loc_buffer token\n | PRetry odcid odcil ->\n B.loc_buffer odcid\n | _ -> B.loc_none\n end\n\nlet header_live_loc_not_unused_in_footprint (h: header) (m: HS.mem) : Lemma\n (requires (header_live h m))\n (ensures (B.loc_not_unused_in m `B.loc_includes` header_footprint h))\n= ()\n\nlet g_header (h: header) (m: HS.mem) : GTot S.header =\n match h with\n | PShort protected_bits spin cid cid_len ->\n S.PShort (Secret.reveal protected_bits) spin (FB.hide (B.as_seq m cid))\n | PLong protected_bits version dcid dcil scid scil spec ->\n S.PLong (Secret.reveal protected_bits) version (FB.hide (B.as_seq m dcid)) (FB.hide (B.as_seq m scid))\n begin match spec with\n | PInitial payload_and_pn_length token token_length ->\n S.PInitial (FB.hide (B.as_seq m token)) payload_and_pn_length \n | PRetry odcid odcil ->\n S.PRetry (FB.hide (B.as_seq m odcid))\n | PHandshake payload_and_pn_length -> S.PHandshake payload_and_pn_length\n | PZeroRTT payload_and_pn_length -> S.PZeroRTT payload_and_pn_length \n end\n\nlet frame_header_live\n (h: header)\n (l: B.loc)\n (m1 m2: HS.mem)\n: Lemma\n (requires (\n header_live h m1 /\\\n B.modifies l m1 m2 /\\\n B.loc_disjoint l (header_footprint h)\n ))\n (ensures (header_live h m2))\n= ()\n\nlet frame_header\n (h: header)\n (l: B.loc)\n (m1 m2: HS.mem)\n: Lemma\n (requires (\n header_live h m1 /\\\n B.modifies l m1 m2 /\\\n B.loc_disjoint l (header_footprint h)\n ))\n (ensures (header_live h m2 /\\ g_header h m2 == g_header h m1))\n= ()\n\n\nval read_header\n (packet: B.buffer U8.t)\n (packet_len: U32.t { let v = U32.v packet_len in v == B.length packet })\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n: HST.Stack header\n (requires (fun h ->\n B.live h packet /\\\n Some? (LP.parse (parse_header cid_len) (B.as_seq h packet))\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin\n let Some (x, len) = LP.parse (parse_header cid_len) (B.as_seq h packet) in\n header_live res h' /\\\n len <= B.length packet /\\\n B.loc_buffer (B.gsub packet 0ul (U32.uint_to_t len)) `B.loc_includes` header_footprint res /\\\n g_header res h' == x\n end\n ))\n\nval write_header\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n (out: B.buffer U8.t)\n (out_len: U32.t { U32.v out_len <= B.length out })\n: HST.Stack U32.t\n (requires (fun h0 ->\n (PShort? h ==> PShort?.cid_len h == short_dcid_len) /\\\n header_live h h0 /\\\n B.live h0 out /\\\n B.loc_disjoint (header_footprint h) (B.loc_buffer out) /\\\n Seq.length (LP.serialize (serialize_header short_dcid_len) (g_header h h0)) <= U32.v out_len\n ))\n (ensures (fun h0 len h1 ->\n let gh = g_header h h0 in\n let s = LP.serialize (serialize_header short_dcid_len) gh in\n B.modifies (B.loc_buffer out) h0 h1 /\\\n U32.v len <= U32.v out_len /\\\n Seq.slice (B.as_seq h1 out) 0 (U32.v len) == s \n ))\n\nmodule Cast = FStar.Int.Cast\n\nlet header_len\n (h: header)", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fsti", "checked_file": "QUIC.Impl.Header.Public.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Header.Public.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Impl.Header.Public.header -> FStar.UInt32.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Public.header", "QUIC.Spec.Base.secret_bitfield", "Prims.bool", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.op_LessThanOrEqual", "FStar.UInt.uint_t", "FStar.UInt32.v", "FStar.UInt32.add", "FStar.UInt32.__uint_to_t", "QUIC.Impl.Header.Public.long_header_specifics", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Base.token_max_len", "QUIC.Impl.Base.varint_len", "FStar.Int.Cast.uint32_to_uint64", "Prims.op_Equality" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val header_len (h: header) : Tot U32.t\nlet header_len (h: header) : Tot U32.t =", "completed_definiton": "match h with\n| PShort pb spin cid cid_len -> 1ul `U32.add` cid_len\n| PLong pb version dcid dcil scid scil spec ->\n ((7ul `U32.add` dcil) `U32.add` scil)\n `U32.add`\n (match spec with\n | PInitial payload_and_pn_length token token_length ->\n ((varint_len (Cast.uint32_to_uint64 token_length)) `U32.add` token_length)\n `U32.add`\n (varint_len (payload_and_pn_length))\n | PZeroRTT payload_and_pn_length -> varint_len (payload_and_pn_length)\n | PHandshake payload_and_pn_length -> varint_len (payload_and_pn_length)\n | PRetry odcid odcil -> 1ul `U32.add` odcil)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Base.fst", "name": "QUIC.Impl.Base.varint_len", "original_source_type": "val varint_len (x: U62.t) : Tot (y: U32.t{U32.v y <= 8})", "source_type": "val varint_len (x: U62.t) : Tot (y: U32.t{U32.v y <= 8})", "source_definition": "let varint_len\n (x: U62.t)\n: Tot (y: U32.t {U32.v y <= 8})\n= if x `U62.lt` 64uL\n then 1ul\n else if x `U62.lt` 16384uL\n then 2ul\n else if x `U62.lt` 1073741824uL\n then 4ul\n else 8ul", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 13, "start_col": 2, "end_line": 19, "end_col": 10 }, "file_context": "module QUIC.Impl.Base\n\nmodule U32 = FStar.UInt32\nmodule U62 = QUIC.UInt62\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet varint_len\n (x: U62.t)", "dependencies": { "source_file": "QUIC.Impl.Base.fst", "checked_file": "QUIC.Impl.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: QUIC.UInt62.t -> y: FStar.UInt32.t{FStar.UInt32.v y <= 8}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.UInt62.t", "FStar.UInt64.lt", "FStar.UInt64.__uint_to_t", "FStar.UInt32.__uint_to_t", "Prims.bool", "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val varint_len (x: U62.t) : Tot (y: U32.t{U32.v y <= 8})\nlet varint_len (x: U62.t) : Tot (y: U32.t{U32.v y <= 8}) =", "completed_definiton": "if x `U62.lt` 64uL\nthen 1ul\nelse if x `U62.lt` 16384uL then 2ul else if x `U62.lt` 1073741824uL then 4ul else 8ul", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fst", "name": "NotEverCrypt.CTR.footprint_s", "original_source_type": "val footprint_s: #a:alg -> state_s a -> GTot B.loc", "source_type": "val footprint_s: #a:alg -> state_s a -> GTot B.loc", "source_definition": "let footprint_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.(loc_addr_of_buffer iv `loc_union` loc_addr_of_buffer key)", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 41, "start_col": 22, "end_line": 43, "end_col": 62 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nfriend Spec.Cipher.Expansion\nfriend EverCrypt.CTR.Keys\n\nopen EverCrypt.CTR.Keys\nopen FStar.HyperStack.ST\nopen LowStar.BufferOps\nopen Spec.Cipher.Expansion\nopen Spec.Agile.CTR\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\nnoextract\nlet nonce_upper_bound a =\n match a with\n | AES128 | AES256 -> block_length a\n | CHACHA20 -> 12\n\nnoeq\ntype state_s (a: Spec.cipher_alg) =\n| State:\n i:impl ->\n g_iv: G.erased (Spec.nonce a) ->\n iv: B.buffer uint8 { B.length iv = nonce_upper_bound a } ->\n iv_len: UInt32.t { UInt32.v iv_len = Seq.length (G.reveal g_iv) } ->\n g_key: G.erased (Spec.key a) ->\n xkey: B.buffer uint8 { B.length xkey = concrete_xkey_length i } ->\n ctr: UInt32.t ->\n state_s a\n\nlet freeable_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.freeable iv /\\ B.freeable key", "dependencies": { "source_file": "NotEverCrypt.CTR.fst", "checked_file": "NotEverCrypt.CTR.fst.checked", "interface_file": true, "dependencies": [ "Vale.X64.CPU_Features_s.fst.checked", "Vale.Wrapper.X64.GCTR.fsti.checked", "Vale.Def.Words_s.fsti.checked", "Vale.Def.Words.Seq_s.fsti.checked", "Vale.Def.Types_s.fst.checked", "Vale.Arch.BufferFriend.fsti.checked", "Vale.AES.GCTR_s.fst.checked", "Vale.AES.GCTR.fsti.checked", "Vale.AES.AES_s.fst.checked", "Spec.Loops.fst.checked", "Spec.Cipher.Expansion.fst.checked", "Spec.Agile.CTR.fst.checked", "Spec.Agile.Cipher.fst.checked", "Spec.AES.fst.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "Hacl.Impl.Chacha20.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.TargetConfig.fsti.checked", "EverCrypt.CTR.Keys.fst.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: NotEverCrypt.CTR.state_s a -> Prims.GTot LowStar.Monotonic.Buffer.loc", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "NotEverCrypt.CTR.alg", "NotEverCrypt.CTR.state_s", "Spec.Cipher.Expansion.impl", "FStar.Ghost.erased", "Spec.Agile.Cipher.nonce", "LowStar.Buffer.buffer", "EverCrypt.CTR.Keys.uint8", "Prims.b2t", "Prims.op_Equality", "Prims.int", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "NotEverCrypt.CTR.nonce_upper_bound", "FStar.UInt32.t", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.op_GreaterThanOrEqual", "FStar.UInt32.v", "FStar.Seq.Base.length", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "FStar.Ghost.reveal", "Spec.Agile.Cipher.key", "Prims.nat", "Spec.Cipher.Expansion.concrete_xkey_length", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.loc_addr_of_buffer", "LowStar.Monotonic.Buffer.loc" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val footprint_s: #a:alg -> state_s a -> GTot B.loc\nlet footprint_s #a s =", "completed_definiton": "let State _ _ iv _ _ key _ = s in\nlet open B in (loc_addr_of_buffer iv) `loc_union` (loc_addr_of_buffer key)", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fst", "name": "NotEverCrypt.CTR.invert_state_s", "original_source_type": "val invert_state_s (a: alg)\n : Lemma (requires True) (ensures (inversion (state_s a))) [SMTPat (state_s a)]", "source_type": "val invert_state_s (a: alg)\n : Lemma (requires True) (ensures (inversion (state_s a))) [SMTPat (state_s a)]", "source_definition": "let invert_state_s (a: alg): Lemma\n (requires True)\n (ensures (inversion (state_s a)))\n [ SMTPat (state_s a) ]\n=\n allow_inversion (state_s a)", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 71, "start_col": 2, "end_line": 71, "end_col": 29 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nfriend Spec.Cipher.Expansion\nfriend EverCrypt.CTR.Keys\n\nopen EverCrypt.CTR.Keys\nopen FStar.HyperStack.ST\nopen LowStar.BufferOps\nopen Spec.Cipher.Expansion\nopen Spec.Agile.CTR\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\nnoextract\nlet nonce_upper_bound a =\n match a with\n | AES128 | AES256 -> block_length a\n | CHACHA20 -> 12\n\nnoeq\ntype state_s (a: Spec.cipher_alg) =\n| State:\n i:impl ->\n g_iv: G.erased (Spec.nonce a) ->\n iv: B.buffer uint8 { B.length iv = nonce_upper_bound a } ->\n iv_len: UInt32.t { UInt32.v iv_len = Seq.length (G.reveal g_iv) } ->\n g_key: G.erased (Spec.key a) ->\n xkey: B.buffer uint8 { B.length xkey = concrete_xkey_length i } ->\n ctr: UInt32.t ->\n state_s a\n\nlet freeable_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.freeable iv /\\ B.freeable key\n\nlet footprint_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.(loc_addr_of_buffer iv `loc_union` loc_addr_of_buffer key)\n\nlet cpu_features_invariant (i: impl): Type0 =\n match i with\n | Vale_AES128 | Vale_AES256 ->\n EverCrypt.TargetConfig.hacl_can_compile_vale /\\\n Vale.X64.CPU_Features_s.(aesni_enabled /\\ pclmulqdq_enabled /\\ avx_enabled /\\ sse_enabled)\n | Hacl_CHACHA20 ->\n True\n\nlet invariant_s #a h s =\n let State i g_iv iv _ g_key ek _ = s in\n let g_iv = G.reveal g_iv in\n a = cipher_alg_of_impl i /\\\n B.live h iv /\\ B.live h ek /\\\n B.disjoint ek iv /\\\n g_iv `Seq.equal` Seq.slice (B.as_seq h iv) 0 (Seq.length g_iv) /\\\n concrete_expand i (G.reveal g_key) `Seq.equal` B.as_seq h ek /\\\n cpu_features_invariant i\n\nlet _: squash (inversion impl) = allow_inversion impl\nlet _: squash (inversion cipher_alg) = allow_inversion cipher_alg\n\nlet invert_state_s (a: alg): Lemma\n (requires True)\n (ensures (inversion (state_s a)))\n [ SMTPat (state_s a) ]", "dependencies": { "source_file": "NotEverCrypt.CTR.fst", "checked_file": "NotEverCrypt.CTR.fst.checked", "interface_file": true, "dependencies": [ "Vale.X64.CPU_Features_s.fst.checked", "Vale.Wrapper.X64.GCTR.fsti.checked", "Vale.Def.Words_s.fsti.checked", "Vale.Def.Words.Seq_s.fsti.checked", "Vale.Def.Types_s.fst.checked", "Vale.Arch.BufferFriend.fsti.checked", "Vale.AES.GCTR_s.fst.checked", "Vale.AES.GCTR.fsti.checked", "Vale.AES.AES_s.fst.checked", "Spec.Loops.fst.checked", "Spec.Cipher.Expansion.fst.checked", "Spec.Agile.CTR.fst.checked", "Spec.Agile.Cipher.fst.checked", "Spec.AES.fst.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "Hacl.Impl.Chacha20.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.TargetConfig.fsti.checked", "EverCrypt.CTR.Keys.fst.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: NotEverCrypt.CTR.alg\n -> FStar.Pervasives.Lemma (ensures FStar.Pervasives.inversion (NotEverCrypt.CTR.state_s a))\n [SMTPat (NotEverCrypt.CTR.state_s a)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "NotEverCrypt.CTR.alg", "FStar.Pervasives.allow_inversion", "NotEverCrypt.CTR.state_s", "Prims.unit", "Prims.l_True", "Prims.squash", "FStar.Pervasives.inversion", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val invert_state_s (a: alg)\n : Lemma (requires True) (ensures (inversion (state_s a))) [SMTPat (state_s a)]\nlet invert_state_s (a: alg)\n : Lemma (requires True) (ensures (inversion (state_s a))) [SMTPat (state_s a)] =", "completed_definiton": "allow_inversion (state_s a)", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fst", "name": "NotEverCrypt.CTR.freeable_s", "original_source_type": "val freeable_s: #(a: alg) -> state_s a -> Type0", "source_type": "val freeable_s: #(a: alg) -> state_s a -> Type0", "source_definition": "let freeable_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.freeable iv /\\ B.freeable key", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 37, "start_col": 21, "end_line": 39, "end_col": 33 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nfriend Spec.Cipher.Expansion\nfriend EverCrypt.CTR.Keys\n\nopen EverCrypt.CTR.Keys\nopen FStar.HyperStack.ST\nopen LowStar.BufferOps\nopen Spec.Cipher.Expansion\nopen Spec.Agile.CTR\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\nnoextract\nlet nonce_upper_bound a =\n match a with\n | AES128 | AES256 -> block_length a\n | CHACHA20 -> 12\n\nnoeq\ntype state_s (a: Spec.cipher_alg) =\n| State:\n i:impl ->\n g_iv: G.erased (Spec.nonce a) ->\n iv: B.buffer uint8 { B.length iv = nonce_upper_bound a } ->\n iv_len: UInt32.t { UInt32.v iv_len = Seq.length (G.reveal g_iv) } ->\n g_key: G.erased (Spec.key a) ->\n xkey: B.buffer uint8 { B.length xkey = concrete_xkey_length i } ->\n ctr: UInt32.t ->\n state_s a", "dependencies": { "source_file": "NotEverCrypt.CTR.fst", "checked_file": "NotEverCrypt.CTR.fst.checked", "interface_file": true, "dependencies": [ "Vale.X64.CPU_Features_s.fst.checked", "Vale.Wrapper.X64.GCTR.fsti.checked", "Vale.Def.Words_s.fsti.checked", "Vale.Def.Words.Seq_s.fsti.checked", "Vale.Def.Types_s.fst.checked", "Vale.Arch.BufferFriend.fsti.checked", "Vale.AES.GCTR_s.fst.checked", "Vale.AES.GCTR.fsti.checked", "Vale.AES.AES_s.fst.checked", "Spec.Loops.fst.checked", "Spec.Cipher.Expansion.fst.checked", "Spec.Agile.CTR.fst.checked", "Spec.Agile.Cipher.fst.checked", "Spec.AES.fst.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "Hacl.Impl.Chacha20.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.TargetConfig.fsti.checked", "EverCrypt.CTR.Keys.fst.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: NotEverCrypt.CTR.state_s a -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "NotEverCrypt.CTR.alg", "NotEverCrypt.CTR.state_s", "Spec.Cipher.Expansion.impl", "FStar.Ghost.erased", "Spec.Agile.Cipher.nonce", "LowStar.Buffer.buffer", "EverCrypt.CTR.Keys.uint8", "Prims.b2t", "Prims.op_Equality", "Prims.int", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "NotEverCrypt.CTR.nonce_upper_bound", "FStar.UInt32.t", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.op_GreaterThanOrEqual", "FStar.UInt32.v", "FStar.Seq.Base.length", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "FStar.Ghost.reveal", "Spec.Agile.Cipher.key", "Prims.nat", "Spec.Cipher.Expansion.concrete_xkey_length", "Prims.l_and", "LowStar.Monotonic.Buffer.freeable" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val freeable_s: #(a: alg) -> state_s a -> Type0\nlet freeable_s #a s =", "completed_definiton": "let State _ _ iv _ _ key _ = s in\nB.freeable iv /\\ B.freeable key", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fst", "name": "NotEverCrypt.CTR.iv", "original_source_type": "val iv: #a:alg -> state_s a -> GTot (Spec.nonce a)", "source_type": "val iv: #a:alg -> state_s a -> GTot (Spec.nonce a)", "source_definition": "let iv #a (s: state_s a) =\n let State _ g_iv _ _ _ _ _ = s in\n G.reveal g_iv", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 81, "start_col": 26, "end_line": 83, "end_col": 15 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nfriend Spec.Cipher.Expansion\nfriend EverCrypt.CTR.Keys\n\nopen EverCrypt.CTR.Keys\nopen FStar.HyperStack.ST\nopen LowStar.BufferOps\nopen Spec.Cipher.Expansion\nopen Spec.Agile.CTR\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\nnoextract\nlet nonce_upper_bound a =\n match a with\n | AES128 | AES256 -> block_length a\n | CHACHA20 -> 12\n\nnoeq\ntype state_s (a: Spec.cipher_alg) =\n| State:\n i:impl ->\n g_iv: G.erased (Spec.nonce a) ->\n iv: B.buffer uint8 { B.length iv = nonce_upper_bound a } ->\n iv_len: UInt32.t { UInt32.v iv_len = Seq.length (G.reveal g_iv) } ->\n g_key: G.erased (Spec.key a) ->\n xkey: B.buffer uint8 { B.length xkey = concrete_xkey_length i } ->\n ctr: UInt32.t ->\n state_s a\n\nlet freeable_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.freeable iv /\\ B.freeable key\n\nlet footprint_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.(loc_addr_of_buffer iv `loc_union` loc_addr_of_buffer key)\n\nlet cpu_features_invariant (i: impl): Type0 =\n match i with\n | Vale_AES128 | Vale_AES256 ->\n EverCrypt.TargetConfig.hacl_can_compile_vale /\\\n Vale.X64.CPU_Features_s.(aesni_enabled /\\ pclmulqdq_enabled /\\ avx_enabled /\\ sse_enabled)\n | Hacl_CHACHA20 ->\n True\n\nlet invariant_s #a h s =\n let State i g_iv iv _ g_key ek _ = s in\n let g_iv = G.reveal g_iv in\n a = cipher_alg_of_impl i /\\\n B.live h iv /\\ B.live h ek /\\\n B.disjoint ek iv /\\\n g_iv `Seq.equal` Seq.slice (B.as_seq h iv) 0 (Seq.length g_iv) /\\\n concrete_expand i (G.reveal g_key) `Seq.equal` B.as_seq h ek /\\\n cpu_features_invariant i\n\nlet _: squash (inversion impl) = allow_inversion impl\nlet _: squash (inversion cipher_alg) = allow_inversion cipher_alg\n\nlet invert_state_s (a: alg): Lemma\n (requires True)\n (ensures (inversion (state_s a)))\n [ SMTPat (state_s a) ]\n=\n allow_inversion (state_s a)\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet frame_invariant #_ _ _ _ _ = ()\n\nlet kv #a (s: state_s a) =\n let State _ _ _ _ g_key _ _ = s in\n G.reveal g_key", "dependencies": { "source_file": "NotEverCrypt.CTR.fst", "checked_file": "NotEverCrypt.CTR.fst.checked", "interface_file": true, "dependencies": [ "Vale.X64.CPU_Features_s.fst.checked", "Vale.Wrapper.X64.GCTR.fsti.checked", "Vale.Def.Words_s.fsti.checked", "Vale.Def.Words.Seq_s.fsti.checked", "Vale.Def.Types_s.fst.checked", "Vale.Arch.BufferFriend.fsti.checked", "Vale.AES.GCTR_s.fst.checked", "Vale.AES.GCTR.fsti.checked", "Vale.AES.AES_s.fst.checked", "Spec.Loops.fst.checked", "Spec.Cipher.Expansion.fst.checked", "Spec.Agile.CTR.fst.checked", "Spec.Agile.Cipher.fst.checked", "Spec.AES.fst.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "Hacl.Impl.Chacha20.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.TargetConfig.fsti.checked", "EverCrypt.CTR.Keys.fst.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: NotEverCrypt.CTR.state_s a -> Prims.GTot (Spec.Agile.Cipher.nonce a)", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "NotEverCrypt.CTR.alg", "NotEverCrypt.CTR.state_s", "Spec.Cipher.Expansion.impl", "FStar.Ghost.erased", "Spec.Agile.Cipher.nonce", "LowStar.Buffer.buffer", "EverCrypt.CTR.Keys.uint8", "Prims.b2t", "Prims.op_Equality", "Prims.int", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "NotEverCrypt.CTR.nonce_upper_bound", "FStar.UInt32.t", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.op_GreaterThanOrEqual", "FStar.UInt32.v", "FStar.Seq.Base.length", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "FStar.Ghost.reveal", "Spec.Agile.Cipher.key", "Prims.nat", "Spec.Cipher.Expansion.concrete_xkey_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val iv: #a:alg -> state_s a -> GTot (Spec.nonce a)\nlet iv #a (s: state_s a) =", "completed_definiton": "let State _ g_iv _ _ _ _ _ = s in\nG.reveal g_iv", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fst", "name": "NotEverCrypt.CTR.kv", "original_source_type": "val kv: #a:alg -> state_s a -> GTot (Spec.key a)", "source_type": "val kv: #a:alg -> state_s a -> GTot (Spec.key a)", "source_definition": "let kv #a (s: state_s a) =\n let State _ _ _ _ g_key _ _ = s in\n G.reveal g_key", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 77, "start_col": 26, "end_line": 79, "end_col": 16 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nfriend Spec.Cipher.Expansion\nfriend EverCrypt.CTR.Keys\n\nopen EverCrypt.CTR.Keys\nopen FStar.HyperStack.ST\nopen LowStar.BufferOps\nopen Spec.Cipher.Expansion\nopen Spec.Agile.CTR\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\nnoextract\nlet nonce_upper_bound a =\n match a with\n | AES128 | AES256 -> block_length a\n | CHACHA20 -> 12\n\nnoeq\ntype state_s (a: Spec.cipher_alg) =\n| State:\n i:impl ->\n g_iv: G.erased (Spec.nonce a) ->\n iv: B.buffer uint8 { B.length iv = nonce_upper_bound a } ->\n iv_len: UInt32.t { UInt32.v iv_len = Seq.length (G.reveal g_iv) } ->\n g_key: G.erased (Spec.key a) ->\n xkey: B.buffer uint8 { B.length xkey = concrete_xkey_length i } ->\n ctr: UInt32.t ->\n state_s a\n\nlet freeable_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.freeable iv /\\ B.freeable key\n\nlet footprint_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.(loc_addr_of_buffer iv `loc_union` loc_addr_of_buffer key)\n\nlet cpu_features_invariant (i: impl): Type0 =\n match i with\n | Vale_AES128 | Vale_AES256 ->\n EverCrypt.TargetConfig.hacl_can_compile_vale /\\\n Vale.X64.CPU_Features_s.(aesni_enabled /\\ pclmulqdq_enabled /\\ avx_enabled /\\ sse_enabled)\n | Hacl_CHACHA20 ->\n True\n\nlet invariant_s #a h s =\n let State i g_iv iv _ g_key ek _ = s in\n let g_iv = G.reveal g_iv in\n a = cipher_alg_of_impl i /\\\n B.live h iv /\\ B.live h ek /\\\n B.disjoint ek iv /\\\n g_iv `Seq.equal` Seq.slice (B.as_seq h iv) 0 (Seq.length g_iv) /\\\n concrete_expand i (G.reveal g_key) `Seq.equal` B.as_seq h ek /\\\n cpu_features_invariant i\n\nlet _: squash (inversion impl) = allow_inversion impl\nlet _: squash (inversion cipher_alg) = allow_inversion cipher_alg\n\nlet invert_state_s (a: alg): Lemma\n (requires True)\n (ensures (inversion (state_s a)))\n [ SMTPat (state_s a) ]\n=\n allow_inversion (state_s a)\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet frame_invariant #_ _ _ _ _ = ()", "dependencies": { "source_file": "NotEverCrypt.CTR.fst", "checked_file": "NotEverCrypt.CTR.fst.checked", "interface_file": true, "dependencies": [ "Vale.X64.CPU_Features_s.fst.checked", "Vale.Wrapper.X64.GCTR.fsti.checked", "Vale.Def.Words_s.fsti.checked", "Vale.Def.Words.Seq_s.fsti.checked", "Vale.Def.Types_s.fst.checked", "Vale.Arch.BufferFriend.fsti.checked", "Vale.AES.GCTR_s.fst.checked", "Vale.AES.GCTR.fsti.checked", "Vale.AES.AES_s.fst.checked", "Spec.Loops.fst.checked", "Spec.Cipher.Expansion.fst.checked", "Spec.Agile.CTR.fst.checked", "Spec.Agile.Cipher.fst.checked", "Spec.AES.fst.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "Hacl.Impl.Chacha20.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.TargetConfig.fsti.checked", "EverCrypt.CTR.Keys.fst.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: NotEverCrypt.CTR.state_s a -> Prims.GTot (Spec.Agile.Cipher.key a)", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "NotEverCrypt.CTR.alg", "NotEverCrypt.CTR.state_s", "Spec.Cipher.Expansion.impl", "FStar.Ghost.erased", "Spec.Agile.Cipher.nonce", "LowStar.Buffer.buffer", "EverCrypt.CTR.Keys.uint8", "Prims.b2t", "Prims.op_Equality", "Prims.int", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "NotEverCrypt.CTR.nonce_upper_bound", "FStar.UInt32.t", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.op_GreaterThanOrEqual", "FStar.UInt32.v", "FStar.Seq.Base.length", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "FStar.Ghost.reveal", "Spec.Agile.Cipher.key", "Prims.nat", "Spec.Cipher.Expansion.concrete_xkey_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val kv: #a:alg -> state_s a -> GTot (Spec.key a)\nlet kv #a (s: state_s a) =", "completed_definiton": "let State _ _ _ _ g_key _ _ = s in\nG.reveal g_key", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fst", "name": "NotEverCrypt.CTR.nonce_upper_bound", "original_source_type": "", "source_type": "val nonce_upper_bound : a: Spec.Agile.Cipher.cipher_alg -> Prims.int", "source_definition": "let nonce_upper_bound a =\n match a with\n | AES128 | AES256 -> block_length a\n | CHACHA20 -> 12", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 21, "start_col": 2, "end_line": 23, "end_col": 18 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nfriend Spec.Cipher.Expansion\nfriend EverCrypt.CTR.Keys\n\nopen EverCrypt.CTR.Keys\nopen FStar.HyperStack.ST\nopen LowStar.BufferOps\nopen Spec.Cipher.Expansion\nopen Spec.Agile.CTR\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\nnoextract", "dependencies": { "source_file": "NotEverCrypt.CTR.fst", "checked_file": "NotEverCrypt.CTR.fst.checked", "interface_file": true, "dependencies": [ "Vale.X64.CPU_Features_s.fst.checked", "Vale.Wrapper.X64.GCTR.fsti.checked", "Vale.Def.Words_s.fsti.checked", "Vale.Def.Words.Seq_s.fsti.checked", "Vale.Def.Types_s.fst.checked", "Vale.Arch.BufferFriend.fsti.checked", "Vale.AES.GCTR_s.fst.checked", "Vale.AES.GCTR.fsti.checked", "Vale.AES.AES_s.fst.checked", "Spec.Loops.fst.checked", "Spec.Cipher.Expansion.fst.checked", "Spec.Agile.CTR.fst.checked", "Spec.Agile.Cipher.fst.checked", "Spec.AES.fst.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "Hacl.Impl.Chacha20.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.TargetConfig.fsti.checked", "EverCrypt.CTR.Keys.fst.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Spec.Agile.Cipher.cipher_alg -> Prims.int", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Spec.Agile.Cipher.cipher_alg", "Spec.Agile.Cipher.block_length", "Prims.int" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let nonce_upper_bound a =", "completed_definiton": "match a with\n| AES128 | AES256 -> block_length a\n| CHACHA20 -> 12", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fst", "name": "NotEverCrypt.CTR.alg_of_state", "original_source_type": "val alg_of_state: a:e_alg -> (\n let a = G.reveal a in\n s: state a -> Stack alg\n (fun h0 -> invariant h0 s)\n (fun h0 a' h1 -> h0 == h1 /\\ a' == a))", "source_type": "val alg_of_state: a:e_alg -> (\n let a = G.reveal a in\n s: state a -> Stack alg\n (fun h0 -> invariant h0 s)\n (fun h0 a' h1 -> h0 == h1 /\\ a' == a))", "source_definition": "let alg_of_state _ s =\n let State i _ _ _ _ _ _ = !*s in\n cipher_alg_of_impl i", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 88, "start_col": 22, "end_line": 90, "end_col": 22 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nfriend Spec.Cipher.Expansion\nfriend EverCrypt.CTR.Keys\n\nopen EverCrypt.CTR.Keys\nopen FStar.HyperStack.ST\nopen LowStar.BufferOps\nopen Spec.Cipher.Expansion\nopen Spec.Agile.CTR\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\nnoextract\nlet nonce_upper_bound a =\n match a with\n | AES128 | AES256 -> block_length a\n | CHACHA20 -> 12\n\nnoeq\ntype state_s (a: Spec.cipher_alg) =\n| State:\n i:impl ->\n g_iv: G.erased (Spec.nonce a) ->\n iv: B.buffer uint8 { B.length iv = nonce_upper_bound a } ->\n iv_len: UInt32.t { UInt32.v iv_len = Seq.length (G.reveal g_iv) } ->\n g_key: G.erased (Spec.key a) ->\n xkey: B.buffer uint8 { B.length xkey = concrete_xkey_length i } ->\n ctr: UInt32.t ->\n state_s a\n\nlet freeable_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.freeable iv /\\ B.freeable key\n\nlet footprint_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.(loc_addr_of_buffer iv `loc_union` loc_addr_of_buffer key)\n\nlet cpu_features_invariant (i: impl): Type0 =\n match i with\n | Vale_AES128 | Vale_AES256 ->\n EverCrypt.TargetConfig.hacl_can_compile_vale /\\\n Vale.X64.CPU_Features_s.(aesni_enabled /\\ pclmulqdq_enabled /\\ avx_enabled /\\ sse_enabled)\n | Hacl_CHACHA20 ->\n True\n\nlet invariant_s #a h s =\n let State i g_iv iv _ g_key ek _ = s in\n let g_iv = G.reveal g_iv in\n a = cipher_alg_of_impl i /\\\n B.live h iv /\\ B.live h ek /\\\n B.disjoint ek iv /\\\n g_iv `Seq.equal` Seq.slice (B.as_seq h iv) 0 (Seq.length g_iv) /\\\n concrete_expand i (G.reveal g_key) `Seq.equal` B.as_seq h ek /\\\n cpu_features_invariant i\n\nlet _: squash (inversion impl) = allow_inversion impl\nlet _: squash (inversion cipher_alg) = allow_inversion cipher_alg\n\nlet invert_state_s (a: alg): Lemma\n (requires True)\n (ensures (inversion (state_s a)))\n [ SMTPat (state_s a) ]\n=\n allow_inversion (state_s a)\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet frame_invariant #_ _ _ _ _ = ()\n\nlet kv #a (s: state_s a) =\n let State _ _ _ _ g_key _ _ = s in\n G.reveal g_key\n\nlet iv #a (s: state_s a) =\n let State _ g_iv _ _ _ _ _ = s in\n G.reveal g_iv\n\nlet ctr #a (h: HS.mem) (s: state a) =\n UInt32.v (State?.ctr (B.deref h s))", "dependencies": { "source_file": "NotEverCrypt.CTR.fst", "checked_file": "NotEverCrypt.CTR.fst.checked", "interface_file": true, "dependencies": [ "Vale.X64.CPU_Features_s.fst.checked", "Vale.Wrapper.X64.GCTR.fsti.checked", "Vale.Def.Words_s.fsti.checked", "Vale.Def.Words.Seq_s.fsti.checked", "Vale.Def.Types_s.fst.checked", "Vale.Arch.BufferFriend.fsti.checked", "Vale.AES.GCTR_s.fst.checked", "Vale.AES.GCTR.fsti.checked", "Vale.AES.AES_s.fst.checked", "Spec.Loops.fst.checked", "Spec.Cipher.Expansion.fst.checked", "Spec.Agile.CTR.fst.checked", "Spec.Agile.Cipher.fst.checked", "Spec.AES.fst.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "Hacl.Impl.Chacha20.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.TargetConfig.fsti.checked", "EverCrypt.CTR.Keys.fst.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: NotEverCrypt.CTR.e_alg\n -> (let a = FStar.Ghost.reveal a in\n s: NotEverCrypt.CTR.state a -> FStar.HyperStack.ST.Stack NotEverCrypt.CTR.alg)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "NotEverCrypt.CTR.e_alg", "NotEverCrypt.CTR.state", "FStar.Ghost.reveal", "NotEverCrypt.CTR.alg", "Spec.Cipher.Expansion.impl", "FStar.Ghost.erased", "Spec.Agile.Cipher.nonce", "LowStar.Buffer.buffer", "EverCrypt.CTR.Keys.uint8", "Prims.b2t", "Prims.op_Equality", "Prims.int", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "NotEverCrypt.CTR.nonce_upper_bound", "FStar.UInt32.t", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.op_GreaterThanOrEqual", "FStar.UInt32.v", "FStar.Seq.Base.length", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "Spec.Agile.Cipher.key", "Prims.nat", "Spec.Cipher.Expansion.concrete_xkey_length", "Spec.Cipher.Expansion.cipher_alg_of_impl", "NotEverCrypt.CTR.state_s", "Spec.Agile.Cipher.cipher_alg", "LowStar.BufferOps.op_Bang_Star" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alg_of_state: a:e_alg -> (\n let a = G.reveal a in\n s: state a -> Stack alg\n (fun h0 -> invariant h0 s)\n (fun h0 a' h1 -> h0 == h1 /\\ a' == a))\nlet alg_of_state _ s =", "completed_definiton": "let State i _ _ _ _ _ _ = !*s in\ncipher_alg_of_impl i", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fst", "name": "NotEverCrypt.CTR.ctr", "original_source_type": "val ctr: #a:alg -> h:HS.mem -> state a -> GTot Spec.ctr", "source_type": "val ctr: #a:alg -> h:HS.mem -> state a -> GTot Spec.ctr", "source_definition": "let ctr #a (h: HS.mem) (s: state a) =\n UInt32.v (State?.ctr (B.deref h s))", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 86, "start_col": 2, "end_line": 86, "end_col": 37 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nfriend Spec.Cipher.Expansion\nfriend EverCrypt.CTR.Keys\n\nopen EverCrypt.CTR.Keys\nopen FStar.HyperStack.ST\nopen LowStar.BufferOps\nopen Spec.Cipher.Expansion\nopen Spec.Agile.CTR\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\nnoextract\nlet nonce_upper_bound a =\n match a with\n | AES128 | AES256 -> block_length a\n | CHACHA20 -> 12\n\nnoeq\ntype state_s (a: Spec.cipher_alg) =\n| State:\n i:impl ->\n g_iv: G.erased (Spec.nonce a) ->\n iv: B.buffer uint8 { B.length iv = nonce_upper_bound a } ->\n iv_len: UInt32.t { UInt32.v iv_len = Seq.length (G.reveal g_iv) } ->\n g_key: G.erased (Spec.key a) ->\n xkey: B.buffer uint8 { B.length xkey = concrete_xkey_length i } ->\n ctr: UInt32.t ->\n state_s a\n\nlet freeable_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.freeable iv /\\ B.freeable key\n\nlet footprint_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.(loc_addr_of_buffer iv `loc_union` loc_addr_of_buffer key)\n\nlet cpu_features_invariant (i: impl): Type0 =\n match i with\n | Vale_AES128 | Vale_AES256 ->\n EverCrypt.TargetConfig.hacl_can_compile_vale /\\\n Vale.X64.CPU_Features_s.(aesni_enabled /\\ pclmulqdq_enabled /\\ avx_enabled /\\ sse_enabled)\n | Hacl_CHACHA20 ->\n True\n\nlet invariant_s #a h s =\n let State i g_iv iv _ g_key ek _ = s in\n let g_iv = G.reveal g_iv in\n a = cipher_alg_of_impl i /\\\n B.live h iv /\\ B.live h ek /\\\n B.disjoint ek iv /\\\n g_iv `Seq.equal` Seq.slice (B.as_seq h iv) 0 (Seq.length g_iv) /\\\n concrete_expand i (G.reveal g_key) `Seq.equal` B.as_seq h ek /\\\n cpu_features_invariant i\n\nlet _: squash (inversion impl) = allow_inversion impl\nlet _: squash (inversion cipher_alg) = allow_inversion cipher_alg\n\nlet invert_state_s (a: alg): Lemma\n (requires True)\n (ensures (inversion (state_s a)))\n [ SMTPat (state_s a) ]\n=\n allow_inversion (state_s a)\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet frame_invariant #_ _ _ _ _ = ()\n\nlet kv #a (s: state_s a) =\n let State _ _ _ _ g_key _ _ = s in\n G.reveal g_key\n\nlet iv #a (s: state_s a) =\n let State _ g_iv _ _ _ _ _ = s in\n G.reveal g_iv", "dependencies": { "source_file": "NotEverCrypt.CTR.fst", "checked_file": "NotEverCrypt.CTR.fst.checked", "interface_file": true, "dependencies": [ "Vale.X64.CPU_Features_s.fst.checked", "Vale.Wrapper.X64.GCTR.fsti.checked", "Vale.Def.Words_s.fsti.checked", "Vale.Def.Words.Seq_s.fsti.checked", "Vale.Def.Types_s.fst.checked", "Vale.Arch.BufferFriend.fsti.checked", "Vale.AES.GCTR_s.fst.checked", "Vale.AES.GCTR.fsti.checked", "Vale.AES.AES_s.fst.checked", "Spec.Loops.fst.checked", "Spec.Cipher.Expansion.fst.checked", "Spec.Agile.CTR.fst.checked", "Spec.Agile.Cipher.fst.checked", "Spec.AES.fst.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "Hacl.Impl.Chacha20.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.TargetConfig.fsti.checked", "EverCrypt.CTR.Keys.fst.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: FStar.Monotonic.HyperStack.mem -> s: NotEverCrypt.CTR.state a -> Prims.GTot Spec.Agile.Cipher.ctr", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "NotEverCrypt.CTR.alg", "FStar.Monotonic.HyperStack.mem", "NotEverCrypt.CTR.state", "FStar.UInt32.v", "NotEverCrypt.CTR.__proj__State__item__ctr", "LowStar.Monotonic.Buffer.deref", "NotEverCrypt.CTR.state_s", "LowStar.Buffer.trivial_preorder", "Spec.Agile.Cipher.ctr" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ctr: #a:alg -> h:HS.mem -> state a -> GTot Spec.ctr\nlet ctr #a (h: HS.mem) (s: state a) =", "completed_definiton": "UInt32.v (State?.ctr (B.deref h s))", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fst", "name": "NotEverCrypt.CTR.vale_impl_of_alg", "original_source_type": "val vale_impl_of_alg (a: vale_cipher_alg) : vale_impl", "source_type": "val vale_impl_of_alg (a: vale_cipher_alg) : vale_impl", "source_definition": "let vale_impl_of_alg (a: vale_cipher_alg): vale_impl =\n match a with\n | AES128 -> Vale_AES128\n | AES256 -> Vale_AES256", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 93, "start_col": 2, "end_line": 95, "end_col": 25 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nfriend Spec.Cipher.Expansion\nfriend EverCrypt.CTR.Keys\n\nopen EverCrypt.CTR.Keys\nopen FStar.HyperStack.ST\nopen LowStar.BufferOps\nopen Spec.Cipher.Expansion\nopen Spec.Agile.CTR\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\nnoextract\nlet nonce_upper_bound a =\n match a with\n | AES128 | AES256 -> block_length a\n | CHACHA20 -> 12\n\nnoeq\ntype state_s (a: Spec.cipher_alg) =\n| State:\n i:impl ->\n g_iv: G.erased (Spec.nonce a) ->\n iv: B.buffer uint8 { B.length iv = nonce_upper_bound a } ->\n iv_len: UInt32.t { UInt32.v iv_len = Seq.length (G.reveal g_iv) } ->\n g_key: G.erased (Spec.key a) ->\n xkey: B.buffer uint8 { B.length xkey = concrete_xkey_length i } ->\n ctr: UInt32.t ->\n state_s a\n\nlet freeable_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.freeable iv /\\ B.freeable key\n\nlet footprint_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.(loc_addr_of_buffer iv `loc_union` loc_addr_of_buffer key)\n\nlet cpu_features_invariant (i: impl): Type0 =\n match i with\n | Vale_AES128 | Vale_AES256 ->\n EverCrypt.TargetConfig.hacl_can_compile_vale /\\\n Vale.X64.CPU_Features_s.(aesni_enabled /\\ pclmulqdq_enabled /\\ avx_enabled /\\ sse_enabled)\n | Hacl_CHACHA20 ->\n True\n\nlet invariant_s #a h s =\n let State i g_iv iv _ g_key ek _ = s in\n let g_iv = G.reveal g_iv in\n a = cipher_alg_of_impl i /\\\n B.live h iv /\\ B.live h ek /\\\n B.disjoint ek iv /\\\n g_iv `Seq.equal` Seq.slice (B.as_seq h iv) 0 (Seq.length g_iv) /\\\n concrete_expand i (G.reveal g_key) `Seq.equal` B.as_seq h ek /\\\n cpu_features_invariant i\n\nlet _: squash (inversion impl) = allow_inversion impl\nlet _: squash (inversion cipher_alg) = allow_inversion cipher_alg\n\nlet invert_state_s (a: alg): Lemma\n (requires True)\n (ensures (inversion (state_s a)))\n [ SMTPat (state_s a) ]\n=\n allow_inversion (state_s a)\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet frame_invariant #_ _ _ _ _ = ()\n\nlet kv #a (s: state_s a) =\n let State _ _ _ _ g_key _ _ = s in\n G.reveal g_key\n\nlet iv #a (s: state_s a) =\n let State _ g_iv _ _ _ _ _ = s in\n G.reveal g_iv\n\nlet ctr #a (h: HS.mem) (s: state a) =\n UInt32.v (State?.ctr (B.deref h s))\n\nlet alg_of_state _ s =\n let State i _ _ _ _ _ _ = !*s in\n cipher_alg_of_impl i", "dependencies": { "source_file": "NotEverCrypt.CTR.fst", "checked_file": "NotEverCrypt.CTR.fst.checked", "interface_file": true, "dependencies": [ "Vale.X64.CPU_Features_s.fst.checked", "Vale.Wrapper.X64.GCTR.fsti.checked", "Vale.Def.Words_s.fsti.checked", "Vale.Def.Words.Seq_s.fsti.checked", "Vale.Def.Types_s.fst.checked", "Vale.Arch.BufferFriend.fsti.checked", "Vale.AES.GCTR_s.fst.checked", "Vale.AES.GCTR.fsti.checked", "Vale.AES.AES_s.fst.checked", "Spec.Loops.fst.checked", "Spec.Cipher.Expansion.fst.checked", "Spec.Agile.CTR.fst.checked", "Spec.Agile.Cipher.fst.checked", "Spec.AES.fst.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "Hacl.Impl.Chacha20.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.TargetConfig.fsti.checked", "EverCrypt.CTR.Keys.fst.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Spec.Cipher.Expansion.vale_cipher_alg -> EverCrypt.CTR.Keys.vale_impl", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Spec.Cipher.Expansion.vale_cipher_alg", "Spec.Cipher.Expansion.Vale_AES128", "Spec.Cipher.Expansion.Vale_AES256", "EverCrypt.CTR.Keys.vale_impl" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val vale_impl_of_alg (a: vale_cipher_alg) : vale_impl\nlet vale_impl_of_alg (a: vale_cipher_alg) : vale_impl =", "completed_definiton": "match a with\n| AES128 -> Vale_AES128\n| AES256 -> Vale_AES256", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fst", "name": "NotEverCrypt.CTR.cpu_features_invariant", "original_source_type": "val cpu_features_invariant (i: impl) : Type0", "source_type": "val cpu_features_invariant (i: impl) : Type0", "source_definition": "let cpu_features_invariant (i: impl): Type0 =\n match i with\n | Vale_AES128 | Vale_AES256 ->\n EverCrypt.TargetConfig.hacl_can_compile_vale /\\\n Vale.X64.CPU_Features_s.(aesni_enabled /\\ pclmulqdq_enabled /\\ avx_enabled /\\ sse_enabled)\n | Hacl_CHACHA20 ->\n True", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 46, "start_col": 2, "end_line": 51, "end_col": 10 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nfriend Spec.Cipher.Expansion\nfriend EverCrypt.CTR.Keys\n\nopen EverCrypt.CTR.Keys\nopen FStar.HyperStack.ST\nopen LowStar.BufferOps\nopen Spec.Cipher.Expansion\nopen Spec.Agile.CTR\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\nnoextract\nlet nonce_upper_bound a =\n match a with\n | AES128 | AES256 -> block_length a\n | CHACHA20 -> 12\n\nnoeq\ntype state_s (a: Spec.cipher_alg) =\n| State:\n i:impl ->\n g_iv: G.erased (Spec.nonce a) ->\n iv: B.buffer uint8 { B.length iv = nonce_upper_bound a } ->\n iv_len: UInt32.t { UInt32.v iv_len = Seq.length (G.reveal g_iv) } ->\n g_key: G.erased (Spec.key a) ->\n xkey: B.buffer uint8 { B.length xkey = concrete_xkey_length i } ->\n ctr: UInt32.t ->\n state_s a\n\nlet freeable_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.freeable iv /\\ B.freeable key\n\nlet footprint_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.(loc_addr_of_buffer iv `loc_union` loc_addr_of_buffer key)", "dependencies": { "source_file": "NotEverCrypt.CTR.fst", "checked_file": "NotEverCrypt.CTR.fst.checked", "interface_file": true, "dependencies": [ "Vale.X64.CPU_Features_s.fst.checked", "Vale.Wrapper.X64.GCTR.fsti.checked", "Vale.Def.Words_s.fsti.checked", "Vale.Def.Words.Seq_s.fsti.checked", "Vale.Def.Types_s.fst.checked", "Vale.Arch.BufferFriend.fsti.checked", "Vale.AES.GCTR_s.fst.checked", "Vale.AES.GCTR.fsti.checked", "Vale.AES.AES_s.fst.checked", "Spec.Loops.fst.checked", "Spec.Cipher.Expansion.fst.checked", "Spec.Agile.CTR.fst.checked", "Spec.Agile.Cipher.fst.checked", "Spec.AES.fst.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "Hacl.Impl.Chacha20.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.TargetConfig.fsti.checked", "EverCrypt.CTR.Keys.fst.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: Spec.Cipher.Expansion.impl -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Spec.Cipher.Expansion.impl", "Prims.l_and", "Prims.b2t", "EverCrypt.TargetConfig.hacl_can_compile_vale", "Vale.X64.CPU_Features_s.aesni_enabled", "Vale.X64.CPU_Features_s.pclmulqdq_enabled", "Vale.X64.CPU_Features_s.avx_enabled", "Vale.X64.CPU_Features_s.sse_enabled", "Prims.l_True" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val cpu_features_invariant (i: impl) : Type0\nlet cpu_features_invariant (i: impl) : Type0 =", "completed_definiton": "match i with\n| Vale_AES128\n| Vale_AES256 ->\n EverCrypt.TargetConfig.hacl_can_compile_vale /\\\n Vale.X64.CPU_Features_s.(aesni_enabled /\\ pclmulqdq_enabled /\\ avx_enabled /\\ sse_enabled)\n| Hacl_CHACHA20 -> True", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fst", "name": "NotEverCrypt.CTR.invariant_s", "original_source_type": "val invariant_s: (#a:alg) -> HS.mem -> state_s a -> Type0", "source_type": "val invariant_s: (#a:alg) -> HS.mem -> state_s a -> Type0", "source_definition": "let invariant_s #a h s =\n let State i g_iv iv _ g_key ek _ = s in\n let g_iv = G.reveal g_iv in\n a = cipher_alg_of_impl i /\\\n B.live h iv /\\ B.live h ek /\\\n B.disjoint ek iv /\\\n g_iv `Seq.equal` Seq.slice (B.as_seq h iv) 0 (Seq.length g_iv) /\\\n concrete_expand i (G.reveal g_key) `Seq.equal` B.as_seq h ek /\\\n cpu_features_invariant i", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 53, "start_col": 24, "end_line": 61, "end_col": 26 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nfriend Spec.Cipher.Expansion\nfriend EverCrypt.CTR.Keys\n\nopen EverCrypt.CTR.Keys\nopen FStar.HyperStack.ST\nopen LowStar.BufferOps\nopen Spec.Cipher.Expansion\nopen Spec.Agile.CTR\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\nnoextract\nlet nonce_upper_bound a =\n match a with\n | AES128 | AES256 -> block_length a\n | CHACHA20 -> 12\n\nnoeq\ntype state_s (a: Spec.cipher_alg) =\n| State:\n i:impl ->\n g_iv: G.erased (Spec.nonce a) ->\n iv: B.buffer uint8 { B.length iv = nonce_upper_bound a } ->\n iv_len: UInt32.t { UInt32.v iv_len = Seq.length (G.reveal g_iv) } ->\n g_key: G.erased (Spec.key a) ->\n xkey: B.buffer uint8 { B.length xkey = concrete_xkey_length i } ->\n ctr: UInt32.t ->\n state_s a\n\nlet freeable_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.freeable iv /\\ B.freeable key\n\nlet footprint_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.(loc_addr_of_buffer iv `loc_union` loc_addr_of_buffer key)\n\nlet cpu_features_invariant (i: impl): Type0 =\n match i with\n | Vale_AES128 | Vale_AES256 ->\n EverCrypt.TargetConfig.hacl_can_compile_vale /\\\n Vale.X64.CPU_Features_s.(aesni_enabled /\\ pclmulqdq_enabled /\\ avx_enabled /\\ sse_enabled)\n | Hacl_CHACHA20 ->\n True", "dependencies": { "source_file": "NotEverCrypt.CTR.fst", "checked_file": "NotEverCrypt.CTR.fst.checked", "interface_file": true, "dependencies": [ "Vale.X64.CPU_Features_s.fst.checked", "Vale.Wrapper.X64.GCTR.fsti.checked", "Vale.Def.Words_s.fsti.checked", "Vale.Def.Words.Seq_s.fsti.checked", "Vale.Def.Types_s.fst.checked", "Vale.Arch.BufferFriend.fsti.checked", "Vale.AES.GCTR_s.fst.checked", "Vale.AES.GCTR.fsti.checked", "Vale.AES.AES_s.fst.checked", "Spec.Loops.fst.checked", "Spec.Cipher.Expansion.fst.checked", "Spec.Agile.CTR.fst.checked", "Spec.Agile.Cipher.fst.checked", "Spec.AES.fst.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "Hacl.Impl.Chacha20.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.TargetConfig.fsti.checked", "EverCrypt.CTR.Keys.fst.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: FStar.Monotonic.HyperStack.mem -> s: NotEverCrypt.CTR.state_s a -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "NotEverCrypt.CTR.alg", "FStar.Monotonic.HyperStack.mem", "NotEverCrypt.CTR.state_s", "Spec.Cipher.Expansion.impl", "FStar.Ghost.erased", "Spec.Agile.Cipher.nonce", "LowStar.Buffer.buffer", "EverCrypt.CTR.Keys.uint8", "Prims.b2t", "Prims.op_Equality", "Prims.int", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "NotEverCrypt.CTR.nonce_upper_bound", "FStar.UInt32.t", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.op_GreaterThanOrEqual", "FStar.UInt32.v", "FStar.Seq.Base.length", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "FStar.Ghost.reveal", "Spec.Agile.Cipher.key", "Prims.nat", "Spec.Cipher.Expansion.concrete_xkey_length", "Prims.l_and", "Spec.Agile.Cipher.cipher_alg", "Spec.Cipher.Expansion.cipher_alg_of_impl", "LowStar.Monotonic.Buffer.live", "LowStar.Monotonic.Buffer.disjoint", "FStar.Seq.Base.equal", "FStar.Seq.Base.slice", "LowStar.Monotonic.Buffer.as_seq", "Spec.Cipher.Expansion.concrete_expand", "NotEverCrypt.CTR.cpu_features_invariant" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val invariant_s: (#a:alg) -> HS.mem -> state_s a -> Type0\nlet invariant_s #a h s =", "completed_definiton": "let State i g_iv iv _ g_key ek _ = s in\nlet g_iv = G.reveal g_iv in\na = cipher_alg_of_impl i /\\ B.live h iv /\\ B.live h ek /\\ B.disjoint ek iv /\\\ng_iv `Seq.equal` (Seq.slice (B.as_seq h iv) 0 (Seq.length g_iv)) /\\\n(concrete_expand i (G.reveal g_key)) `Seq.equal` (B.as_seq h ek) /\\ cpu_features_invariant i", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fst", "name": "NotEverCrypt.CTR.uint128_of_uint32", "original_source_type": "val uint128_of_uint32 (x: UInt32.t) : y: UInt128.t{UInt128.v y = UInt32.v x}", "source_type": "val uint128_of_uint32 (x: UInt32.t) : y: UInt128.t{UInt128.v y = UInt32.v x}", "source_definition": "let uint128_of_uint32 (x: UInt32.t): y:UInt128.t { UInt128.v y = UInt32.v x } =\n let open FStar.Int.Cast.Full in\n uint64_to_uint128 (uint32_to_uint64 x)", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 271, "start_col": 2, "end_line": 272, "end_col": 40 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nfriend Spec.Cipher.Expansion\nfriend EverCrypt.CTR.Keys\n\nopen EverCrypt.CTR.Keys\nopen FStar.HyperStack.ST\nopen LowStar.BufferOps\nopen Spec.Cipher.Expansion\nopen Spec.Agile.CTR\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\nnoextract\nlet nonce_upper_bound a =\n match a with\n | AES128 | AES256 -> block_length a\n | CHACHA20 -> 12\n\nnoeq\ntype state_s (a: Spec.cipher_alg) =\n| State:\n i:impl ->\n g_iv: G.erased (Spec.nonce a) ->\n iv: B.buffer uint8 { B.length iv = nonce_upper_bound a } ->\n iv_len: UInt32.t { UInt32.v iv_len = Seq.length (G.reveal g_iv) } ->\n g_key: G.erased (Spec.key a) ->\n xkey: B.buffer uint8 { B.length xkey = concrete_xkey_length i } ->\n ctr: UInt32.t ->\n state_s a\n\nlet freeable_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.freeable iv /\\ B.freeable key\n\nlet footprint_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.(loc_addr_of_buffer iv `loc_union` loc_addr_of_buffer key)\n\nlet cpu_features_invariant (i: impl): Type0 =\n match i with\n | Vale_AES128 | Vale_AES256 ->\n EverCrypt.TargetConfig.hacl_can_compile_vale /\\\n Vale.X64.CPU_Features_s.(aesni_enabled /\\ pclmulqdq_enabled /\\ avx_enabled /\\ sse_enabled)\n | Hacl_CHACHA20 ->\n True\n\nlet invariant_s #a h s =\n let State i g_iv iv _ g_key ek _ = s in\n let g_iv = G.reveal g_iv in\n a = cipher_alg_of_impl i /\\\n B.live h iv /\\ B.live h ek /\\\n B.disjoint ek iv /\\\n g_iv `Seq.equal` Seq.slice (B.as_seq h iv) 0 (Seq.length g_iv) /\\\n concrete_expand i (G.reveal g_key) `Seq.equal` B.as_seq h ek /\\\n cpu_features_invariant i\n\nlet _: squash (inversion impl) = allow_inversion impl\nlet _: squash (inversion cipher_alg) = allow_inversion cipher_alg\n\nlet invert_state_s (a: alg): Lemma\n (requires True)\n (ensures (inversion (state_s a)))\n [ SMTPat (state_s a) ]\n=\n allow_inversion (state_s a)\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet frame_invariant #_ _ _ _ _ = ()\n\nlet kv #a (s: state_s a) =\n let State _ _ _ _ g_key _ _ = s in\n G.reveal g_key\n\nlet iv #a (s: state_s a) =\n let State _ g_iv _ _ _ _ _ = s in\n G.reveal g_iv\n\nlet ctr #a (h: HS.mem) (s: state a) =\n UInt32.v (State?.ctr (B.deref h s))\n\nlet alg_of_state _ s =\n let State i _ _ _ _ _ _ = !*s in\n cipher_alg_of_impl i\n\nlet vale_impl_of_alg (a: vale_cipher_alg): vale_impl =\n match a with\n | AES128 -> Vale_AES128\n | AES256 -> Vale_AES256\n\nfriend Lib.IntTypes\n\n#push-options \"--z3rlimit 100\"\n\ninline_for_extraction noextract\nlet create_in_vale (i: vale_impl): create_in_st (cipher_alg_of_impl i) =\nfun r dst k iv iv_len c ->\n let has_aesni = EverCrypt.AutoConfig2.has_aesni () in\n let has_pclmulqdq = EverCrypt.AutoConfig2.has_pclmulqdq () in\n let has_avx = EverCrypt.AutoConfig2.has_avx() in\n let has_sse = EverCrypt.AutoConfig2.has_sse() in\n [@inline_let]\n let a = cipher_alg_of_impl i in\n\n if iv_len `UInt32.lt` 12ul then\n InvalidIVLength\n\n else if EverCrypt.TargetConfig.hacl_can_compile_vale && (has_aesni && has_pclmulqdq && has_avx && has_sse) then\n (**) let h0 = ST.get () in\n (**) let g_iv = G.hide (B.as_seq h0 iv) in\n (**) let g_key: G.erased (key a) = G.hide (B.as_seq h0 (k <: B.buffer uint8)) in\n\n let ek = B.malloc r 0uy (concrete_xkey_len i) in\n vale_expand i k ek;\n (**) let h1 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h1;\n\n let iv' = B.malloc r 0uy 16ul in\n B.blit iv 0ul iv' 0ul iv_len;\n (**) let h2 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h2;\n\n let p = B.malloc r (State (vale_impl_of_alg a) g_iv iv' iv_len g_key ek c) 1ul in\n (**) let h3 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h3;\n assert (B.fresh_loc (footprint h3 p) h0 h3);\n\n dst *= p;\n (**) let h4 = ST.get () in\n (**) B.modifies_only_not_unused_in B.(loc_buffer dst) h0 h4;\n\n Success\n\n else\n UnsupportedAlgorithm\n\nlet create_in a r dst k iv iv_len c =\n match a with\n | AES128 ->\n create_in_vale Vale_AES128 r dst k iv iv_len c\n | AES256 ->\n create_in_vale Vale_AES256 r dst k iv iv_len c\n | CHACHA20 ->\n (**) let h0 = ST.get () in\n (**) let g_iv = G.hide (B.as_seq h0 iv) in\n (**) let g_key: G.erased (key a) = G.hide (B.as_seq h0 (k <: B.buffer uint8)) in\n\n [@inline_let]\n let l = concrete_xkey_len Hacl_CHACHA20 in\n let ek = B.malloc r 0uy l in\n B.blit k 0ul ek 0ul l;\n (**) let h1 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h1;\n\n let iv' = B.malloc r 0uy iv_len in\n B.blit iv 0ul iv' 0ul iv_len;\n (**) let h2 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h2;\n\n let p = B.malloc r (State Hacl_CHACHA20 g_iv iv' 12ul g_key ek c) 1ul in\n (**) let h3 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h3;\n assert (B.fresh_loc (footprint h3 p) h0 h3);\n\n dst *= p;\n (**) let h4 = ST.get () in\n (**) B.modifies_only_not_unused_in B.(loc_buffer dst) h0 h4;\n\n Success\n\ninline_for_extraction noextract\nlet copy_or_expand (i: impl)\n (k: B.buffer uint8 { B.length k = Spec.key_length (cipher_alg_of_impl i) })\n (ek: B.buffer uint8 { B.len ek = concrete_xkey_len i }):\n Stack unit\n (requires (fun h0 ->\n B.live h0 k /\\ B.live h0 ek /\\\n B.disjoint k ek /\\\n cpu_features_invariant i))\n (ensures (fun h0 _ h1 ->\n B.(modifies (loc_buffer ek) h0 h1) /\\\n B.as_seq h1 ek `Seq.equal` concrete_expand i (B.as_seq h0 k)))\n=\n match i with\n | Vale_AES128 ->\n if EverCrypt.TargetConfig.hacl_can_compile_vale then\n vale_expand Vale_AES128 k ek\n | Vale_AES256 ->\n if EverCrypt.TargetConfig.hacl_can_compile_vale then\n vale_expand Vale_AES256 k ek\n | Hacl_CHACHA20 ->\n B.blit k 0ul ek 0ul 32ul\n\nlet init a p k iv iv_len c =\n let State i _ iv' _ _ ek _ = !*p in\n [@inline_let]\n let k: B.buffer uint8 = k in\n\n (**) let h0 = ST.get () in\n (**) let g_iv = G.hide (B.as_seq h0 iv) in\n (**) let g_key: G.erased (key (cipher_alg_of_impl i)) = G.hide (B.as_seq h0 k) in\n\n B.blit iv 0ul iv' 0ul iv_len;\n (**) let h1 = ST.get () in\n (**) assert B.(modifies (footprint_s (B.deref h0 p)) h0 h1);\n\n copy_or_expand i k ek;\n (**) let h2 = ST.get () in\n (**) assert B.(modifies (footprint_s (B.deref h0 p)) h1 h2);\n\n // TODO: two in-place updates\n p *= (State i g_iv iv' iv_len g_key ek c)\n\nnoextract\nlet as_vale_key (i: vale_impl) (k: key (cipher_alg_of_impl i)):\n s:Seq.seq Vale.Def.Types_s.nat32 {\n Vale.AES.AES_s.is_aes_key_LE (vale_alg_of_vale_impl i) s\n }\n=\n let open Vale.Def.Words.Seq_s in\n let k_nat = seq_uint8_to_seq_nat8 k in\n let k_w = seq_nat8_to_seq_nat32_LE k_nat in\n k_w\n\n// Main (missing) proof of functional equivalence between Vale and HACL.\nlet vale_encrypt_is_hacl_encrypt (i: vale_impl)\n (k: key (cipher_alg_of_impl i))\n (ctr_block: Seq.lseq uint8 16)\n (input: Seq.lseq uint8 16):\n Lemma\n (ensures (\n let open Vale.Def.Words_s in\n let open Vale.Def.Types_s in\n let open Vale.Def.Words.Seq_s in\n // Vale version\n let a = vale_alg_of_vale_impl i in\n let ctr_block_nat8 = seq_uint8_to_seq_nat8 ctr_block in\n let k_nat32 = as_vale_key i k in\n let input_nat8 = seq_uint8_to_seq_nat8 input in\n let cipher_nat8 = Vale.AES.GCTR_s.gctr_encrypt_LE\n (le_bytes_to_quad32 ctr_block_nat8) (Vale.AES.GCTR.make_gctr_plain_LE input_nat8)\n a k_nat32\n in\n let cipher = seq_nat8_to_seq_uint8 cipher_nat8 in\n\n // HACL version\n let a = aes_alg_of_alg (cipher_alg_of_impl i) in\n let cipher' = Spec.Loops.seq_map2 xor8 input\n Spec.AES.(aes_encrypt_block a (aes_key_expansion a k) ctr_block)\n in\n cipher `Seq.equal` cipher'))\n=\n admit ()\n\ninline_for_extraction noextract\nlet gctr_bytes (i: vale_impl): Vale.Wrapper.X64.GCTR.gctr_bytes_st (vale_alg_of_vale_impl i) =\n match i with\n | Vale_AES128 -> Vale.Wrapper.X64.GCTR.gctr_bytes_stdcall128\n | Vale_AES256 -> Vale.Wrapper.X64.GCTR.gctr_bytes_stdcall256\n\nfriend Spec.Agile.Cipher\n\ninline_for_extraction", "dependencies": { "source_file": "NotEverCrypt.CTR.fst", "checked_file": "NotEverCrypt.CTR.fst.checked", "interface_file": true, "dependencies": [ "Vale.X64.CPU_Features_s.fst.checked", "Vale.Wrapper.X64.GCTR.fsti.checked", "Vale.Def.Words_s.fsti.checked", "Vale.Def.Words.Seq_s.fsti.checked", "Vale.Def.Types_s.fst.checked", "Vale.Arch.BufferFriend.fsti.checked", "Vale.AES.GCTR_s.fst.checked", "Vale.AES.GCTR.fsti.checked", "Vale.AES.AES_s.fst.checked", "Spec.Loops.fst.checked", "Spec.Cipher.Expansion.fst.checked", "Spec.Agile.CTR.fst.checked", "Spec.Agile.Cipher.fst.checked", "Spec.AES.fst.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "Hacl.Impl.Chacha20.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.TargetConfig.fsti.checked", "EverCrypt.CTR.Keys.fst.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: FStar.UInt32.t -> y: FStar.UInt128.t{FStar.UInt128.v y = FStar.UInt32.v x}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "FStar.Int.Cast.Full.uint64_to_uint128", "FStar.Int.Cast.uint32_to_uint64", "FStar.UInt128.t", "Prims.b2t", "Prims.op_Equality", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt128.n", "FStar.UInt32.n", "FStar.UInt128.v", "FStar.UInt32.v" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val uint128_of_uint32 (x: UInt32.t) : y: UInt128.t{UInt128.v y = UInt32.v x}\nlet uint128_of_uint32 (x: UInt32.t) : y: UInt128.t{UInt128.v y = UInt32.v x} =", "completed_definiton": "let open FStar.Int.Cast.Full in uint64_to_uint128 (uint32_to_uint64 x)", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fst", "name": "NotEverCrypt.CTR.gctr_bytes", "original_source_type": "val gctr_bytes (i: vale_impl) : Vale.Wrapper.X64.GCTR.gctr_bytes_st (vale_alg_of_vale_impl i)", "source_type": "val gctr_bytes (i: vale_impl) : Vale.Wrapper.X64.GCTR.gctr_bytes_st (vale_alg_of_vale_impl i)", "source_definition": "let gctr_bytes (i: vale_impl): Vale.Wrapper.X64.GCTR.gctr_bytes_st (vale_alg_of_vale_impl i) =\n match i with\n | Vale_AES128 -> Vale.Wrapper.X64.GCTR.gctr_bytes_stdcall128\n | Vale_AES256 -> Vale.Wrapper.X64.GCTR.gctr_bytes_stdcall256", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 263, "start_col": 2, "end_line": 265, "end_col": 62 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nfriend Spec.Cipher.Expansion\nfriend EverCrypt.CTR.Keys\n\nopen EverCrypt.CTR.Keys\nopen FStar.HyperStack.ST\nopen LowStar.BufferOps\nopen Spec.Cipher.Expansion\nopen Spec.Agile.CTR\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\nnoextract\nlet nonce_upper_bound a =\n match a with\n | AES128 | AES256 -> block_length a\n | CHACHA20 -> 12\n\nnoeq\ntype state_s (a: Spec.cipher_alg) =\n| State:\n i:impl ->\n g_iv: G.erased (Spec.nonce a) ->\n iv: B.buffer uint8 { B.length iv = nonce_upper_bound a } ->\n iv_len: UInt32.t { UInt32.v iv_len = Seq.length (G.reveal g_iv) } ->\n g_key: G.erased (Spec.key a) ->\n xkey: B.buffer uint8 { B.length xkey = concrete_xkey_length i } ->\n ctr: UInt32.t ->\n state_s a\n\nlet freeable_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.freeable iv /\\ B.freeable key\n\nlet footprint_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.(loc_addr_of_buffer iv `loc_union` loc_addr_of_buffer key)\n\nlet cpu_features_invariant (i: impl): Type0 =\n match i with\n | Vale_AES128 | Vale_AES256 ->\n EverCrypt.TargetConfig.hacl_can_compile_vale /\\\n Vale.X64.CPU_Features_s.(aesni_enabled /\\ pclmulqdq_enabled /\\ avx_enabled /\\ sse_enabled)\n | Hacl_CHACHA20 ->\n True\n\nlet invariant_s #a h s =\n let State i g_iv iv _ g_key ek _ = s in\n let g_iv = G.reveal g_iv in\n a = cipher_alg_of_impl i /\\\n B.live h iv /\\ B.live h ek /\\\n B.disjoint ek iv /\\\n g_iv `Seq.equal` Seq.slice (B.as_seq h iv) 0 (Seq.length g_iv) /\\\n concrete_expand i (G.reveal g_key) `Seq.equal` B.as_seq h ek /\\\n cpu_features_invariant i\n\nlet _: squash (inversion impl) = allow_inversion impl\nlet _: squash (inversion cipher_alg) = allow_inversion cipher_alg\n\nlet invert_state_s (a: alg): Lemma\n (requires True)\n (ensures (inversion (state_s a)))\n [ SMTPat (state_s a) ]\n=\n allow_inversion (state_s a)\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet frame_invariant #_ _ _ _ _ = ()\n\nlet kv #a (s: state_s a) =\n let State _ _ _ _ g_key _ _ = s in\n G.reveal g_key\n\nlet iv #a (s: state_s a) =\n let State _ g_iv _ _ _ _ _ = s in\n G.reveal g_iv\n\nlet ctr #a (h: HS.mem) (s: state a) =\n UInt32.v (State?.ctr (B.deref h s))\n\nlet alg_of_state _ s =\n let State i _ _ _ _ _ _ = !*s in\n cipher_alg_of_impl i\n\nlet vale_impl_of_alg (a: vale_cipher_alg): vale_impl =\n match a with\n | AES128 -> Vale_AES128\n | AES256 -> Vale_AES256\n\nfriend Lib.IntTypes\n\n#push-options \"--z3rlimit 100\"\n\ninline_for_extraction noextract\nlet create_in_vale (i: vale_impl): create_in_st (cipher_alg_of_impl i) =\nfun r dst k iv iv_len c ->\n let has_aesni = EverCrypt.AutoConfig2.has_aesni () in\n let has_pclmulqdq = EverCrypt.AutoConfig2.has_pclmulqdq () in\n let has_avx = EverCrypt.AutoConfig2.has_avx() in\n let has_sse = EverCrypt.AutoConfig2.has_sse() in\n [@inline_let]\n let a = cipher_alg_of_impl i in\n\n if iv_len `UInt32.lt` 12ul then\n InvalidIVLength\n\n else if EverCrypt.TargetConfig.hacl_can_compile_vale && (has_aesni && has_pclmulqdq && has_avx && has_sse) then\n (**) let h0 = ST.get () in\n (**) let g_iv = G.hide (B.as_seq h0 iv) in\n (**) let g_key: G.erased (key a) = G.hide (B.as_seq h0 (k <: B.buffer uint8)) in\n\n let ek = B.malloc r 0uy (concrete_xkey_len i) in\n vale_expand i k ek;\n (**) let h1 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h1;\n\n let iv' = B.malloc r 0uy 16ul in\n B.blit iv 0ul iv' 0ul iv_len;\n (**) let h2 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h2;\n\n let p = B.malloc r (State (vale_impl_of_alg a) g_iv iv' iv_len g_key ek c) 1ul in\n (**) let h3 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h3;\n assert (B.fresh_loc (footprint h3 p) h0 h3);\n\n dst *= p;\n (**) let h4 = ST.get () in\n (**) B.modifies_only_not_unused_in B.(loc_buffer dst) h0 h4;\n\n Success\n\n else\n UnsupportedAlgorithm\n\nlet create_in a r dst k iv iv_len c =\n match a with\n | AES128 ->\n create_in_vale Vale_AES128 r dst k iv iv_len c\n | AES256 ->\n create_in_vale Vale_AES256 r dst k iv iv_len c\n | CHACHA20 ->\n (**) let h0 = ST.get () in\n (**) let g_iv = G.hide (B.as_seq h0 iv) in\n (**) let g_key: G.erased (key a) = G.hide (B.as_seq h0 (k <: B.buffer uint8)) in\n\n [@inline_let]\n let l = concrete_xkey_len Hacl_CHACHA20 in\n let ek = B.malloc r 0uy l in\n B.blit k 0ul ek 0ul l;\n (**) let h1 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h1;\n\n let iv' = B.malloc r 0uy iv_len in\n B.blit iv 0ul iv' 0ul iv_len;\n (**) let h2 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h2;\n\n let p = B.malloc r (State Hacl_CHACHA20 g_iv iv' 12ul g_key ek c) 1ul in\n (**) let h3 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h3;\n assert (B.fresh_loc (footprint h3 p) h0 h3);\n\n dst *= p;\n (**) let h4 = ST.get () in\n (**) B.modifies_only_not_unused_in B.(loc_buffer dst) h0 h4;\n\n Success\n\ninline_for_extraction noextract\nlet copy_or_expand (i: impl)\n (k: B.buffer uint8 { B.length k = Spec.key_length (cipher_alg_of_impl i) })\n (ek: B.buffer uint8 { B.len ek = concrete_xkey_len i }):\n Stack unit\n (requires (fun h0 ->\n B.live h0 k /\\ B.live h0 ek /\\\n B.disjoint k ek /\\\n cpu_features_invariant i))\n (ensures (fun h0 _ h1 ->\n B.(modifies (loc_buffer ek) h0 h1) /\\\n B.as_seq h1 ek `Seq.equal` concrete_expand i (B.as_seq h0 k)))\n=\n match i with\n | Vale_AES128 ->\n if EverCrypt.TargetConfig.hacl_can_compile_vale then\n vale_expand Vale_AES128 k ek\n | Vale_AES256 ->\n if EverCrypt.TargetConfig.hacl_can_compile_vale then\n vale_expand Vale_AES256 k ek\n | Hacl_CHACHA20 ->\n B.blit k 0ul ek 0ul 32ul\n\nlet init a p k iv iv_len c =\n let State i _ iv' _ _ ek _ = !*p in\n [@inline_let]\n let k: B.buffer uint8 = k in\n\n (**) let h0 = ST.get () in\n (**) let g_iv = G.hide (B.as_seq h0 iv) in\n (**) let g_key: G.erased (key (cipher_alg_of_impl i)) = G.hide (B.as_seq h0 k) in\n\n B.blit iv 0ul iv' 0ul iv_len;\n (**) let h1 = ST.get () in\n (**) assert B.(modifies (footprint_s (B.deref h0 p)) h0 h1);\n\n copy_or_expand i k ek;\n (**) let h2 = ST.get () in\n (**) assert B.(modifies (footprint_s (B.deref h0 p)) h1 h2);\n\n // TODO: two in-place updates\n p *= (State i g_iv iv' iv_len g_key ek c)\n\nnoextract\nlet as_vale_key (i: vale_impl) (k: key (cipher_alg_of_impl i)):\n s:Seq.seq Vale.Def.Types_s.nat32 {\n Vale.AES.AES_s.is_aes_key_LE (vale_alg_of_vale_impl i) s\n }\n=\n let open Vale.Def.Words.Seq_s in\n let k_nat = seq_uint8_to_seq_nat8 k in\n let k_w = seq_nat8_to_seq_nat32_LE k_nat in\n k_w\n\n// Main (missing) proof of functional equivalence between Vale and HACL.\nlet vale_encrypt_is_hacl_encrypt (i: vale_impl)\n (k: key (cipher_alg_of_impl i))\n (ctr_block: Seq.lseq uint8 16)\n (input: Seq.lseq uint8 16):\n Lemma\n (ensures (\n let open Vale.Def.Words_s in\n let open Vale.Def.Types_s in\n let open Vale.Def.Words.Seq_s in\n // Vale version\n let a = vale_alg_of_vale_impl i in\n let ctr_block_nat8 = seq_uint8_to_seq_nat8 ctr_block in\n let k_nat32 = as_vale_key i k in\n let input_nat8 = seq_uint8_to_seq_nat8 input in\n let cipher_nat8 = Vale.AES.GCTR_s.gctr_encrypt_LE\n (le_bytes_to_quad32 ctr_block_nat8) (Vale.AES.GCTR.make_gctr_plain_LE input_nat8)\n a k_nat32\n in\n let cipher = seq_nat8_to_seq_uint8 cipher_nat8 in\n\n // HACL version\n let a = aes_alg_of_alg (cipher_alg_of_impl i) in\n let cipher' = Spec.Loops.seq_map2 xor8 input\n Spec.AES.(aes_encrypt_block a (aes_key_expansion a k) ctr_block)\n in\n cipher `Seq.equal` cipher'))\n=\n admit ()\n\ninline_for_extraction noextract", "dependencies": { "source_file": "NotEverCrypt.CTR.fst", "checked_file": "NotEverCrypt.CTR.fst.checked", "interface_file": true, "dependencies": [ "Vale.X64.CPU_Features_s.fst.checked", "Vale.Wrapper.X64.GCTR.fsti.checked", "Vale.Def.Words_s.fsti.checked", "Vale.Def.Words.Seq_s.fsti.checked", "Vale.Def.Types_s.fst.checked", "Vale.Arch.BufferFriend.fsti.checked", "Vale.AES.GCTR_s.fst.checked", "Vale.AES.GCTR.fsti.checked", "Vale.AES.AES_s.fst.checked", "Spec.Loops.fst.checked", "Spec.Cipher.Expansion.fst.checked", "Spec.Agile.CTR.fst.checked", "Spec.Agile.Cipher.fst.checked", "Spec.AES.fst.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "Hacl.Impl.Chacha20.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.TargetConfig.fsti.checked", "EverCrypt.CTR.Keys.fst.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: EverCrypt.CTR.Keys.vale_impl\n -> Vale.Wrapper.X64.GCTR.gctr_bytes_st (EverCrypt.CTR.Keys.vale_alg_of_vale_impl i)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "EverCrypt.CTR.Keys.vale_impl", "Vale.Wrapper.X64.GCTR.gctr_bytes_stdcall128", "Vale.Wrapper.X64.GCTR.gctr_bytes_stdcall256", "Vale.Wrapper.X64.GCTR.gctr_bytes_st", "EverCrypt.CTR.Keys.vale_alg_of_vale_impl" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val gctr_bytes (i: vale_impl) : Vale.Wrapper.X64.GCTR.gctr_bytes_st (vale_alg_of_vale_impl i)\nlet gctr_bytes (i: vale_impl) : Vale.Wrapper.X64.GCTR.gctr_bytes_st (vale_alg_of_vale_impl i) =", "completed_definiton": "match i with\n| Vale_AES128 -> Vale.Wrapper.X64.GCTR.gctr_bytes_stdcall128\n| Vale_AES256 -> Vale.Wrapper.X64.GCTR.gctr_bytes_stdcall256", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fst", "name": "NotEverCrypt.CTR.as_vale_key", "original_source_type": "val as_vale_key (i: vale_impl) (k: key (cipher_alg_of_impl i))\n : s: Seq.seq Vale.Def.Types_s.nat32 {Vale.AES.AES_s.is_aes_key_LE (vale_alg_of_vale_impl i) s}", "source_type": "val as_vale_key (i: vale_impl) (k: key (cipher_alg_of_impl i))\n : s: Seq.seq Vale.Def.Types_s.nat32 {Vale.AES.AES_s.is_aes_key_LE (vale_alg_of_vale_impl i) s}", "source_definition": "let as_vale_key (i: vale_impl) (k: key (cipher_alg_of_impl i)):\n s:Seq.seq Vale.Def.Types_s.nat32 {\n Vale.AES.AES_s.is_aes_key_LE (vale_alg_of_vale_impl i) s\n }\n=\n let open Vale.Def.Words.Seq_s in\n let k_nat = seq_uint8_to_seq_nat8 k in\n let k_w = seq_nat8_to_seq_nat32_LE k_nat in\n k_w", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 226, "start_col": 2, "end_line": 229, "end_col": 5 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nfriend Spec.Cipher.Expansion\nfriend EverCrypt.CTR.Keys\n\nopen EverCrypt.CTR.Keys\nopen FStar.HyperStack.ST\nopen LowStar.BufferOps\nopen Spec.Cipher.Expansion\nopen Spec.Agile.CTR\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\nnoextract\nlet nonce_upper_bound a =\n match a with\n | AES128 | AES256 -> block_length a\n | CHACHA20 -> 12\n\nnoeq\ntype state_s (a: Spec.cipher_alg) =\n| State:\n i:impl ->\n g_iv: G.erased (Spec.nonce a) ->\n iv: B.buffer uint8 { B.length iv = nonce_upper_bound a } ->\n iv_len: UInt32.t { UInt32.v iv_len = Seq.length (G.reveal g_iv) } ->\n g_key: G.erased (Spec.key a) ->\n xkey: B.buffer uint8 { B.length xkey = concrete_xkey_length i } ->\n ctr: UInt32.t ->\n state_s a\n\nlet freeable_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.freeable iv /\\ B.freeable key\n\nlet footprint_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.(loc_addr_of_buffer iv `loc_union` loc_addr_of_buffer key)\n\nlet cpu_features_invariant (i: impl): Type0 =\n match i with\n | Vale_AES128 | Vale_AES256 ->\n EverCrypt.TargetConfig.hacl_can_compile_vale /\\\n Vale.X64.CPU_Features_s.(aesni_enabled /\\ pclmulqdq_enabled /\\ avx_enabled /\\ sse_enabled)\n | Hacl_CHACHA20 ->\n True\n\nlet invariant_s #a h s =\n let State i g_iv iv _ g_key ek _ = s in\n let g_iv = G.reveal g_iv in\n a = cipher_alg_of_impl i /\\\n B.live h iv /\\ B.live h ek /\\\n B.disjoint ek iv /\\\n g_iv `Seq.equal` Seq.slice (B.as_seq h iv) 0 (Seq.length g_iv) /\\\n concrete_expand i (G.reveal g_key) `Seq.equal` B.as_seq h ek /\\\n cpu_features_invariant i\n\nlet _: squash (inversion impl) = allow_inversion impl\nlet _: squash (inversion cipher_alg) = allow_inversion cipher_alg\n\nlet invert_state_s (a: alg): Lemma\n (requires True)\n (ensures (inversion (state_s a)))\n [ SMTPat (state_s a) ]\n=\n allow_inversion (state_s a)\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet frame_invariant #_ _ _ _ _ = ()\n\nlet kv #a (s: state_s a) =\n let State _ _ _ _ g_key _ _ = s in\n G.reveal g_key\n\nlet iv #a (s: state_s a) =\n let State _ g_iv _ _ _ _ _ = s in\n G.reveal g_iv\n\nlet ctr #a (h: HS.mem) (s: state a) =\n UInt32.v (State?.ctr (B.deref h s))\n\nlet alg_of_state _ s =\n let State i _ _ _ _ _ _ = !*s in\n cipher_alg_of_impl i\n\nlet vale_impl_of_alg (a: vale_cipher_alg): vale_impl =\n match a with\n | AES128 -> Vale_AES128\n | AES256 -> Vale_AES256\n\nfriend Lib.IntTypes\n\n#push-options \"--z3rlimit 100\"\n\ninline_for_extraction noextract\nlet create_in_vale (i: vale_impl): create_in_st (cipher_alg_of_impl i) =\nfun r dst k iv iv_len c ->\n let has_aesni = EverCrypt.AutoConfig2.has_aesni () in\n let has_pclmulqdq = EverCrypt.AutoConfig2.has_pclmulqdq () in\n let has_avx = EverCrypt.AutoConfig2.has_avx() in\n let has_sse = EverCrypt.AutoConfig2.has_sse() in\n [@inline_let]\n let a = cipher_alg_of_impl i in\n\n if iv_len `UInt32.lt` 12ul then\n InvalidIVLength\n\n else if EverCrypt.TargetConfig.hacl_can_compile_vale && (has_aesni && has_pclmulqdq && has_avx && has_sse) then\n (**) let h0 = ST.get () in\n (**) let g_iv = G.hide (B.as_seq h0 iv) in\n (**) let g_key: G.erased (key a) = G.hide (B.as_seq h0 (k <: B.buffer uint8)) in\n\n let ek = B.malloc r 0uy (concrete_xkey_len i) in\n vale_expand i k ek;\n (**) let h1 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h1;\n\n let iv' = B.malloc r 0uy 16ul in\n B.blit iv 0ul iv' 0ul iv_len;\n (**) let h2 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h2;\n\n let p = B.malloc r (State (vale_impl_of_alg a) g_iv iv' iv_len g_key ek c) 1ul in\n (**) let h3 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h3;\n assert (B.fresh_loc (footprint h3 p) h0 h3);\n\n dst *= p;\n (**) let h4 = ST.get () in\n (**) B.modifies_only_not_unused_in B.(loc_buffer dst) h0 h4;\n\n Success\n\n else\n UnsupportedAlgorithm\n\nlet create_in a r dst k iv iv_len c =\n match a with\n | AES128 ->\n create_in_vale Vale_AES128 r dst k iv iv_len c\n | AES256 ->\n create_in_vale Vale_AES256 r dst k iv iv_len c\n | CHACHA20 ->\n (**) let h0 = ST.get () in\n (**) let g_iv = G.hide (B.as_seq h0 iv) in\n (**) let g_key: G.erased (key a) = G.hide (B.as_seq h0 (k <: B.buffer uint8)) in\n\n [@inline_let]\n let l = concrete_xkey_len Hacl_CHACHA20 in\n let ek = B.malloc r 0uy l in\n B.blit k 0ul ek 0ul l;\n (**) let h1 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h1;\n\n let iv' = B.malloc r 0uy iv_len in\n B.blit iv 0ul iv' 0ul iv_len;\n (**) let h2 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h2;\n\n let p = B.malloc r (State Hacl_CHACHA20 g_iv iv' 12ul g_key ek c) 1ul in\n (**) let h3 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h3;\n assert (B.fresh_loc (footprint h3 p) h0 h3);\n\n dst *= p;\n (**) let h4 = ST.get () in\n (**) B.modifies_only_not_unused_in B.(loc_buffer dst) h0 h4;\n\n Success\n\ninline_for_extraction noextract\nlet copy_or_expand (i: impl)\n (k: B.buffer uint8 { B.length k = Spec.key_length (cipher_alg_of_impl i) })\n (ek: B.buffer uint8 { B.len ek = concrete_xkey_len i }):\n Stack unit\n (requires (fun h0 ->\n B.live h0 k /\\ B.live h0 ek /\\\n B.disjoint k ek /\\\n cpu_features_invariant i))\n (ensures (fun h0 _ h1 ->\n B.(modifies (loc_buffer ek) h0 h1) /\\\n B.as_seq h1 ek `Seq.equal` concrete_expand i (B.as_seq h0 k)))\n=\n match i with\n | Vale_AES128 ->\n if EverCrypt.TargetConfig.hacl_can_compile_vale then\n vale_expand Vale_AES128 k ek\n | Vale_AES256 ->\n if EverCrypt.TargetConfig.hacl_can_compile_vale then\n vale_expand Vale_AES256 k ek\n | Hacl_CHACHA20 ->\n B.blit k 0ul ek 0ul 32ul\n\nlet init a p k iv iv_len c =\n let State i _ iv' _ _ ek _ = !*p in\n [@inline_let]\n let k: B.buffer uint8 = k in\n\n (**) let h0 = ST.get () in\n (**) let g_iv = G.hide (B.as_seq h0 iv) in\n (**) let g_key: G.erased (key (cipher_alg_of_impl i)) = G.hide (B.as_seq h0 k) in\n\n B.blit iv 0ul iv' 0ul iv_len;\n (**) let h1 = ST.get () in\n (**) assert B.(modifies (footprint_s (B.deref h0 p)) h0 h1);\n\n copy_or_expand i k ek;\n (**) let h2 = ST.get () in\n (**) assert B.(modifies (footprint_s (B.deref h0 p)) h1 h2);\n\n // TODO: two in-place updates\n p *= (State i g_iv iv' iv_len g_key ek c)\n\nnoextract\nlet as_vale_key (i: vale_impl) (k: key (cipher_alg_of_impl i)):\n s:Seq.seq Vale.Def.Types_s.nat32 {\n Vale.AES.AES_s.is_aes_key_LE (vale_alg_of_vale_impl i) s\n }", "dependencies": { "source_file": "NotEverCrypt.CTR.fst", "checked_file": "NotEverCrypt.CTR.fst.checked", "interface_file": true, "dependencies": [ "Vale.X64.CPU_Features_s.fst.checked", "Vale.Wrapper.X64.GCTR.fsti.checked", "Vale.Def.Words_s.fsti.checked", "Vale.Def.Words.Seq_s.fsti.checked", "Vale.Def.Types_s.fst.checked", "Vale.Arch.BufferFriend.fsti.checked", "Vale.AES.GCTR_s.fst.checked", "Vale.AES.GCTR.fsti.checked", "Vale.AES.AES_s.fst.checked", "Spec.Loops.fst.checked", "Spec.Cipher.Expansion.fst.checked", "Spec.Agile.CTR.fst.checked", "Spec.Agile.Cipher.fst.checked", "Spec.AES.fst.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "Hacl.Impl.Chacha20.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.TargetConfig.fsti.checked", "EverCrypt.CTR.Keys.fst.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n i: EverCrypt.CTR.Keys.vale_impl ->\n k: Spec.Agile.Cipher.key (Spec.Cipher.Expansion.cipher_alg_of_impl i)\n -> s:\n FStar.Seq.Base.seq Vale.Def.Types_s.nat32\n {Vale.AES.AES_s.is_aes_key_LE (EverCrypt.CTR.Keys.vale_alg_of_vale_impl i) s}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "EverCrypt.CTR.Keys.vale_impl", "Spec.Agile.Cipher.key", "Spec.Cipher.Expansion.cipher_alg_of_impl", "FStar.Seq.Base.seq", "Vale.Def.Words_s.nat32", "Vale.Def.Words.Seq_s.seq_nat8_to_seq_nat32_LE", "Vale.Def.Words_s.nat8", "Vale.Def.Words.Seq_s.seq_uint8_to_seq_nat8", "Vale.Def.Types_s.nat32", "Vale.AES.AES_s.is_aes_key_LE", "EverCrypt.CTR.Keys.vale_alg_of_vale_impl" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val as_vale_key (i: vale_impl) (k: key (cipher_alg_of_impl i))\n : s: Seq.seq Vale.Def.Types_s.nat32 {Vale.AES.AES_s.is_aes_key_LE (vale_alg_of_vale_impl i) s}\nlet as_vale_key (i: vale_impl) (k: key (cipher_alg_of_impl i))\n : s: Seq.seq Vale.Def.Types_s.nat32 {Vale.AES.AES_s.is_aes_key_LE (vale_alg_of_vale_impl i) s} =", "completed_definiton": "let open Vale.Def.Words.Seq_s in\nlet k_nat = seq_uint8_to_seq_nat8 k in\nlet k_w = seq_nat8_to_seq_nat32_LE k_nat in\nk_w", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fst", "name": "NotEverCrypt.CTR.free", "original_source_type": "val free: a:e_alg -> (\n let a = G.reveal a in\n s:state a ->\n ST unit\n (requires (fun h0 ->\n freeable h0 s /\\\n invariant h0 s))\n (ensures (fun h0 _ h1 ->\n B.(modifies (footprint h0 s) h0 h1))))", "source_type": "val free: a:e_alg -> (\n let a = G.reveal a in\n s:state a ->\n ST unit\n (requires (fun h0 ->\n freeable h0 s /\\\n invariant h0 s))\n (ensures (fun h0 _ h1 ->\n B.(modifies (footprint h0 s) h0 h1))))", "source_definition": "let free a p =\n let State i g_iv iv iv_len g_key ek c0 = !*p in\n B.free iv;\n B.free ek;\n B.free p", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 362, "start_col": 14, "end_line": 366, "end_col": 10 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nfriend Spec.Cipher.Expansion\nfriend EverCrypt.CTR.Keys\n\nopen EverCrypt.CTR.Keys\nopen FStar.HyperStack.ST\nopen LowStar.BufferOps\nopen Spec.Cipher.Expansion\nopen Spec.Agile.CTR\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\nnoextract\nlet nonce_upper_bound a =\n match a with\n | AES128 | AES256 -> block_length a\n | CHACHA20 -> 12\n\nnoeq\ntype state_s (a: Spec.cipher_alg) =\n| State:\n i:impl ->\n g_iv: G.erased (Spec.nonce a) ->\n iv: B.buffer uint8 { B.length iv = nonce_upper_bound a } ->\n iv_len: UInt32.t { UInt32.v iv_len = Seq.length (G.reveal g_iv) } ->\n g_key: G.erased (Spec.key a) ->\n xkey: B.buffer uint8 { B.length xkey = concrete_xkey_length i } ->\n ctr: UInt32.t ->\n state_s a\n\nlet freeable_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.freeable iv /\\ B.freeable key\n\nlet footprint_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.(loc_addr_of_buffer iv `loc_union` loc_addr_of_buffer key)\n\nlet cpu_features_invariant (i: impl): Type0 =\n match i with\n | Vale_AES128 | Vale_AES256 ->\n EverCrypt.TargetConfig.hacl_can_compile_vale /\\\n Vale.X64.CPU_Features_s.(aesni_enabled /\\ pclmulqdq_enabled /\\ avx_enabled /\\ sse_enabled)\n | Hacl_CHACHA20 ->\n True\n\nlet invariant_s #a h s =\n let State i g_iv iv _ g_key ek _ = s in\n let g_iv = G.reveal g_iv in\n a = cipher_alg_of_impl i /\\\n B.live h iv /\\ B.live h ek /\\\n B.disjoint ek iv /\\\n g_iv `Seq.equal` Seq.slice (B.as_seq h iv) 0 (Seq.length g_iv) /\\\n concrete_expand i (G.reveal g_key) `Seq.equal` B.as_seq h ek /\\\n cpu_features_invariant i\n\nlet _: squash (inversion impl) = allow_inversion impl\nlet _: squash (inversion cipher_alg) = allow_inversion cipher_alg\n\nlet invert_state_s (a: alg): Lemma\n (requires True)\n (ensures (inversion (state_s a)))\n [ SMTPat (state_s a) ]\n=\n allow_inversion (state_s a)\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet frame_invariant #_ _ _ _ _ = ()\n\nlet kv #a (s: state_s a) =\n let State _ _ _ _ g_key _ _ = s in\n G.reveal g_key\n\nlet iv #a (s: state_s a) =\n let State _ g_iv _ _ _ _ _ = s in\n G.reveal g_iv\n\nlet ctr #a (h: HS.mem) (s: state a) =\n UInt32.v (State?.ctr (B.deref h s))\n\nlet alg_of_state _ s =\n let State i _ _ _ _ _ _ = !*s in\n cipher_alg_of_impl i\n\nlet vale_impl_of_alg (a: vale_cipher_alg): vale_impl =\n match a with\n | AES128 -> Vale_AES128\n | AES256 -> Vale_AES256\n\nfriend Lib.IntTypes\n\n#push-options \"--z3rlimit 100\"\n\ninline_for_extraction noextract\nlet create_in_vale (i: vale_impl): create_in_st (cipher_alg_of_impl i) =\nfun r dst k iv iv_len c ->\n let has_aesni = EverCrypt.AutoConfig2.has_aesni () in\n let has_pclmulqdq = EverCrypt.AutoConfig2.has_pclmulqdq () in\n let has_avx = EverCrypt.AutoConfig2.has_avx() in\n let has_sse = EverCrypt.AutoConfig2.has_sse() in\n [@inline_let]\n let a = cipher_alg_of_impl i in\n\n if iv_len `UInt32.lt` 12ul then\n InvalidIVLength\n\n else if EverCrypt.TargetConfig.hacl_can_compile_vale && (has_aesni && has_pclmulqdq && has_avx && has_sse) then\n (**) let h0 = ST.get () in\n (**) let g_iv = G.hide (B.as_seq h0 iv) in\n (**) let g_key: G.erased (key a) = G.hide (B.as_seq h0 (k <: B.buffer uint8)) in\n\n let ek = B.malloc r 0uy (concrete_xkey_len i) in\n vale_expand i k ek;\n (**) let h1 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h1;\n\n let iv' = B.malloc r 0uy 16ul in\n B.blit iv 0ul iv' 0ul iv_len;\n (**) let h2 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h2;\n\n let p = B.malloc r (State (vale_impl_of_alg a) g_iv iv' iv_len g_key ek c) 1ul in\n (**) let h3 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h3;\n assert (B.fresh_loc (footprint h3 p) h0 h3);\n\n dst *= p;\n (**) let h4 = ST.get () in\n (**) B.modifies_only_not_unused_in B.(loc_buffer dst) h0 h4;\n\n Success\n\n else\n UnsupportedAlgorithm\n\nlet create_in a r dst k iv iv_len c =\n match a with\n | AES128 ->\n create_in_vale Vale_AES128 r dst k iv iv_len c\n | AES256 ->\n create_in_vale Vale_AES256 r dst k iv iv_len c\n | CHACHA20 ->\n (**) let h0 = ST.get () in\n (**) let g_iv = G.hide (B.as_seq h0 iv) in\n (**) let g_key: G.erased (key a) = G.hide (B.as_seq h0 (k <: B.buffer uint8)) in\n\n [@inline_let]\n let l = concrete_xkey_len Hacl_CHACHA20 in\n let ek = B.malloc r 0uy l in\n B.blit k 0ul ek 0ul l;\n (**) let h1 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h1;\n\n let iv' = B.malloc r 0uy iv_len in\n B.blit iv 0ul iv' 0ul iv_len;\n (**) let h2 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h2;\n\n let p = B.malloc r (State Hacl_CHACHA20 g_iv iv' 12ul g_key ek c) 1ul in\n (**) let h3 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h3;\n assert (B.fresh_loc (footprint h3 p) h0 h3);\n\n dst *= p;\n (**) let h4 = ST.get () in\n (**) B.modifies_only_not_unused_in B.(loc_buffer dst) h0 h4;\n\n Success\n\ninline_for_extraction noextract\nlet copy_or_expand (i: impl)\n (k: B.buffer uint8 { B.length k = Spec.key_length (cipher_alg_of_impl i) })\n (ek: B.buffer uint8 { B.len ek = concrete_xkey_len i }):\n Stack unit\n (requires (fun h0 ->\n B.live h0 k /\\ B.live h0 ek /\\\n B.disjoint k ek /\\\n cpu_features_invariant i))\n (ensures (fun h0 _ h1 ->\n B.(modifies (loc_buffer ek) h0 h1) /\\\n B.as_seq h1 ek `Seq.equal` concrete_expand i (B.as_seq h0 k)))\n=\n match i with\n | Vale_AES128 ->\n if EverCrypt.TargetConfig.hacl_can_compile_vale then\n vale_expand Vale_AES128 k ek\n | Vale_AES256 ->\n if EverCrypt.TargetConfig.hacl_can_compile_vale then\n vale_expand Vale_AES256 k ek\n | Hacl_CHACHA20 ->\n B.blit k 0ul ek 0ul 32ul\n\nlet init a p k iv iv_len c =\n let State i _ iv' _ _ ek _ = !*p in\n [@inline_let]\n let k: B.buffer uint8 = k in\n\n (**) let h0 = ST.get () in\n (**) let g_iv = G.hide (B.as_seq h0 iv) in\n (**) let g_key: G.erased (key (cipher_alg_of_impl i)) = G.hide (B.as_seq h0 k) in\n\n B.blit iv 0ul iv' 0ul iv_len;\n (**) let h1 = ST.get () in\n (**) assert B.(modifies (footprint_s (B.deref h0 p)) h0 h1);\n\n copy_or_expand i k ek;\n (**) let h2 = ST.get () in\n (**) assert B.(modifies (footprint_s (B.deref h0 p)) h1 h2);\n\n // TODO: two in-place updates\n p *= (State i g_iv iv' iv_len g_key ek c)\n\nnoextract\nlet as_vale_key (i: vale_impl) (k: key (cipher_alg_of_impl i)):\n s:Seq.seq Vale.Def.Types_s.nat32 {\n Vale.AES.AES_s.is_aes_key_LE (vale_alg_of_vale_impl i) s\n }\n=\n let open Vale.Def.Words.Seq_s in\n let k_nat = seq_uint8_to_seq_nat8 k in\n let k_w = seq_nat8_to_seq_nat32_LE k_nat in\n k_w\n\n// Main (missing) proof of functional equivalence between Vale and HACL.\nlet vale_encrypt_is_hacl_encrypt (i: vale_impl)\n (k: key (cipher_alg_of_impl i))\n (ctr_block: Seq.lseq uint8 16)\n (input: Seq.lseq uint8 16):\n Lemma\n (ensures (\n let open Vale.Def.Words_s in\n let open Vale.Def.Types_s in\n let open Vale.Def.Words.Seq_s in\n // Vale version\n let a = vale_alg_of_vale_impl i in\n let ctr_block_nat8 = seq_uint8_to_seq_nat8 ctr_block in\n let k_nat32 = as_vale_key i k in\n let input_nat8 = seq_uint8_to_seq_nat8 input in\n let cipher_nat8 = Vale.AES.GCTR_s.gctr_encrypt_LE\n (le_bytes_to_quad32 ctr_block_nat8) (Vale.AES.GCTR.make_gctr_plain_LE input_nat8)\n a k_nat32\n in\n let cipher = seq_nat8_to_seq_uint8 cipher_nat8 in\n\n // HACL version\n let a = aes_alg_of_alg (cipher_alg_of_impl i) in\n let cipher' = Spec.Loops.seq_map2 xor8 input\n Spec.AES.(aes_encrypt_block a (aes_key_expansion a k) ctr_block)\n in\n cipher `Seq.equal` cipher'))\n=\n admit ()\n\ninline_for_extraction noextract\nlet gctr_bytes (i: vale_impl): Vale.Wrapper.X64.GCTR.gctr_bytes_st (vale_alg_of_vale_impl i) =\n match i with\n | Vale_AES128 -> Vale.Wrapper.X64.GCTR.gctr_bytes_stdcall128\n | Vale_AES256 -> Vale.Wrapper.X64.GCTR.gctr_bytes_stdcall256\n\nfriend Spec.Agile.Cipher\n\ninline_for_extraction\nlet uint128_of_uint32 (x: UInt32.t): y:UInt128.t { UInt128.v y = UInt32.v x } =\n let open FStar.Int.Cast.Full in\n uint64_to_uint128 (uint32_to_uint64 x)\n\ninline_for_extraction noextract\nlet update_block_vale (i: vale_impl): update_block_st (cipher_alg_of_impl i) =\nfun p dst src ->\n let State _ g_iv iv iv_len g_key ek c0 = !*p in\n\n let open Vale.Wrapper.X64.GCTR in\n let open LowStar.Endianness in\n push_frame ();\n\n // Prepare the block. See Spec.AES.aes_ctr_key_block for instance.\n let ctr_block = B.alloca (0uy <: uint8) 16ul in\n (**) let h0 = ST.get () in\n\n B.blit iv 0ul ctr_block 0ul iv_len;\n (**) let h1 = ST.get () in\n\n // Proof steps missing:\n // - show that repeati is equivalent to a blit\n // - show that the uint128 addition does what aes_ctr_block_add_counter\n // does (the right lemmas should be there already...)\n (* assert (\n let open Lib.ByteSequence in\n let open Lib.IntTypes in\n let open Lib.Sequence in\n let open Lib.LoopCombinators in\n let block0 = B.as_seq h0 ctr_block in\n let spec0 = create 16 (u8 0) in\n let iv = B.as_seq h0 iv in\n let block1 = B.as_seq h1 ctr_block in\n let spec1 =\n repeati #(lbytes 16) (length iv) (fun i b -> b.[i] <- Seq.index iv i) spec0\n in\n block0 `Seq.equal` spec0 /\\\n block1 `Seq.equal` spec1\n );\n admit () | _ -> admit () *)\n\n // Interpreting potential overflow bytes of the IV as part of a 128-bit\n // counter dictated by HACL* spec.\n let c: UInt128.t = load128_be ctr_block `UInt128.add_mod` (uint128_of_uint32 c0) in\n store128_le ctr_block c;\n (**) let h2 = ST.get () in\n (**) Vale.Arch.BufferFriend.lemma_be_to_n_is_nat_from_bytes (B.as_seq h1 ctr_block);\n (**) Vale.Arch.BufferFriend.lemma_n_to_be_is_nat_to_bytes 16 (UInt128.v c);\n\n gctr_bytes i\n (G.elift1 (as_vale_key i) g_key)\n src 16uL\n dst\n (B.sub ek 0ul (key_offset i))\n ctr_block;\n (**) vale_encrypt_is_hacl_encrypt i (G.reveal g_key) (B.as_seq h2 ctr_block)\n (B.as_seq h2 src);\n\n let c = c0 `UInt32.add_mod` 1ul in\n p *= (State #(cipher_alg_of_impl i) i g_iv iv iv_len g_key ek c);\n\n pop_frame ();\n\n admit ()\n\nlet update_block a p dst src =\n let State i g_iv iv iv_len g_key ek c0 = !*p in\n match i with\n | Vale_AES128 ->\n if EverCrypt.TargetConfig.hacl_can_compile_vale then\n update_block_vale Vale_AES128 p dst src\n\n | Vale_AES256 ->\n if EverCrypt.TargetConfig.hacl_can_compile_vale then\n update_block_vale Vale_AES256 p dst src\n\n | Hacl_CHACHA20 ->\n let open Hacl.Impl.Chacha20 in\n push_frame ();\n let ctx = B.alloca 0ul 16ul in\n // NOTE: chacha20_init must be called with 0ul because encrypt_block also\n // takes a counter argument and increments too! There may be a way to keep\n // the allocated initial block in the state, but not doing that for now.\n chacha20_init ctx ek (B.sub iv 0ul 12ul) 0ul;\n chacha20_encrypt_block ctx dst c0 src;\n\n pop_frame ();\n\n // There's a non-trivial proof of spec equivalence here. See discussion in\n // Spec.Chacha20.\n admit ()", "dependencies": { "source_file": "NotEverCrypt.CTR.fst", "checked_file": "NotEverCrypt.CTR.fst.checked", "interface_file": true, "dependencies": [ "Vale.X64.CPU_Features_s.fst.checked", "Vale.Wrapper.X64.GCTR.fsti.checked", "Vale.Def.Words_s.fsti.checked", "Vale.Def.Words.Seq_s.fsti.checked", "Vale.Def.Types_s.fst.checked", "Vale.Arch.BufferFriend.fsti.checked", "Vale.AES.GCTR_s.fst.checked", "Vale.AES.GCTR.fsti.checked", "Vale.AES.AES_s.fst.checked", "Spec.Loops.fst.checked", "Spec.Cipher.Expansion.fst.checked", "Spec.Agile.CTR.fst.checked", "Spec.Agile.Cipher.fst.checked", "Spec.AES.fst.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "Hacl.Impl.Chacha20.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.TargetConfig.fsti.checked", "EverCrypt.CTR.Keys.fst.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: NotEverCrypt.CTR.e_alg\n -> (let a = FStar.Ghost.reveal a in\n s: NotEverCrypt.CTR.state a -> FStar.HyperStack.ST.ST Prims.unit)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "NotEverCrypt.CTR.e_alg", "NotEverCrypt.CTR.state", "FStar.Ghost.reveal", "NotEverCrypt.CTR.alg", "Spec.Cipher.Expansion.impl", "FStar.Ghost.erased", "Spec.Agile.Cipher.nonce", "LowStar.Buffer.buffer", "EverCrypt.CTR.Keys.uint8", "Prims.b2t", "Prims.op_Equality", "Prims.int", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "NotEverCrypt.CTR.nonce_upper_bound", "FStar.UInt32.t", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.op_GreaterThanOrEqual", "FStar.UInt32.v", "FStar.Seq.Base.length", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "Spec.Agile.Cipher.key", "Prims.nat", "Spec.Cipher.Expansion.concrete_xkey_length", "LowStar.Monotonic.Buffer.free", "NotEverCrypt.CTR.state_s", "Prims.unit", "Spec.Agile.Cipher.cipher_alg", "LowStar.BufferOps.op_Bang_Star" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val free: a:e_alg -> (\n let a = G.reveal a in\n s:state a ->\n ST unit\n (requires (fun h0 ->\n freeable h0 s /\\\n invariant h0 s))\n (ensures (fun h0 _ h1 ->\n B.(modifies (footprint h0 s) h0 h1))))\nlet free a p =", "completed_definiton": "let State i g_iv iv iv_len g_key ek c0 = !*p in\nB.free iv;\nB.free ek;\nB.free p", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fst", "name": "NotEverCrypt.CTR.copy_or_expand", "original_source_type": "val copy_or_expand\n (i: impl)\n (k: B.buffer uint8 {B.length k = Spec.key_length (cipher_alg_of_impl i)})\n (ek: B.buffer uint8 {B.len ek = concrete_xkey_len i})\n : Stack unit\n (requires\n (fun h0 -> B.live h0 k /\\ B.live h0 ek /\\ B.disjoint k ek /\\ cpu_features_invariant i))\n (ensures\n (fun h0 _ h1 ->\n B.(modifies (loc_buffer ek) h0 h1) /\\\n (B.as_seq h1 ek) `Seq.equal` (concrete_expand i (B.as_seq h0 k))))", "source_type": "val copy_or_expand\n (i: impl)\n (k: B.buffer uint8 {B.length k = Spec.key_length (cipher_alg_of_impl i)})\n (ek: B.buffer uint8 {B.len ek = concrete_xkey_len i})\n : Stack unit\n (requires\n (fun h0 -> B.live h0 k /\\ B.live h0 ek /\\ B.disjoint k ek /\\ cpu_features_invariant i))\n (ensures\n (fun h0 _ h1 ->\n B.(modifies (loc_buffer ek) h0 h1) /\\\n (B.as_seq h1 ek) `Seq.equal` (concrete_expand i (B.as_seq h0 k))))", "source_definition": "let copy_or_expand (i: impl)\n (k: B.buffer uint8 { B.length k = Spec.key_length (cipher_alg_of_impl i) })\n (ek: B.buffer uint8 { B.len ek = concrete_xkey_len i }):\n Stack unit\n (requires (fun h0 ->\n B.live h0 k /\\ B.live h0 ek /\\\n B.disjoint k ek /\\\n cpu_features_invariant i))\n (ensures (fun h0 _ h1 ->\n B.(modifies (loc_buffer ek) h0 h1) /\\\n B.as_seq h1 ek `Seq.equal` concrete_expand i (B.as_seq h0 k)))\n=\n match i with\n | Vale_AES128 ->\n if EverCrypt.TargetConfig.hacl_can_compile_vale then\n vale_expand Vale_AES128 k ek\n | Vale_AES256 ->\n if EverCrypt.TargetConfig.hacl_can_compile_vale then\n vale_expand Vale_AES256 k ek\n | Hacl_CHACHA20 ->\n B.blit k 0ul ek 0ul 32ul", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 190, "start_col": 2, "end_line": 198, "end_col": 30 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nfriend Spec.Cipher.Expansion\nfriend EverCrypt.CTR.Keys\n\nopen EverCrypt.CTR.Keys\nopen FStar.HyperStack.ST\nopen LowStar.BufferOps\nopen Spec.Cipher.Expansion\nopen Spec.Agile.CTR\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\nnoextract\nlet nonce_upper_bound a =\n match a with\n | AES128 | AES256 -> block_length a\n | CHACHA20 -> 12\n\nnoeq\ntype state_s (a: Spec.cipher_alg) =\n| State:\n i:impl ->\n g_iv: G.erased (Spec.nonce a) ->\n iv: B.buffer uint8 { B.length iv = nonce_upper_bound a } ->\n iv_len: UInt32.t { UInt32.v iv_len = Seq.length (G.reveal g_iv) } ->\n g_key: G.erased (Spec.key a) ->\n xkey: B.buffer uint8 { B.length xkey = concrete_xkey_length i } ->\n ctr: UInt32.t ->\n state_s a\n\nlet freeable_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.freeable iv /\\ B.freeable key\n\nlet footprint_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.(loc_addr_of_buffer iv `loc_union` loc_addr_of_buffer key)\n\nlet cpu_features_invariant (i: impl): Type0 =\n match i with\n | Vale_AES128 | Vale_AES256 ->\n EverCrypt.TargetConfig.hacl_can_compile_vale /\\\n Vale.X64.CPU_Features_s.(aesni_enabled /\\ pclmulqdq_enabled /\\ avx_enabled /\\ sse_enabled)\n | Hacl_CHACHA20 ->\n True\n\nlet invariant_s #a h s =\n let State i g_iv iv _ g_key ek _ = s in\n let g_iv = G.reveal g_iv in\n a = cipher_alg_of_impl i /\\\n B.live h iv /\\ B.live h ek /\\\n B.disjoint ek iv /\\\n g_iv `Seq.equal` Seq.slice (B.as_seq h iv) 0 (Seq.length g_iv) /\\\n concrete_expand i (G.reveal g_key) `Seq.equal` B.as_seq h ek /\\\n cpu_features_invariant i\n\nlet _: squash (inversion impl) = allow_inversion impl\nlet _: squash (inversion cipher_alg) = allow_inversion cipher_alg\n\nlet invert_state_s (a: alg): Lemma\n (requires True)\n (ensures (inversion (state_s a)))\n [ SMTPat (state_s a) ]\n=\n allow_inversion (state_s a)\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet frame_invariant #_ _ _ _ _ = ()\n\nlet kv #a (s: state_s a) =\n let State _ _ _ _ g_key _ _ = s in\n G.reveal g_key\n\nlet iv #a (s: state_s a) =\n let State _ g_iv _ _ _ _ _ = s in\n G.reveal g_iv\n\nlet ctr #a (h: HS.mem) (s: state a) =\n UInt32.v (State?.ctr (B.deref h s))\n\nlet alg_of_state _ s =\n let State i _ _ _ _ _ _ = !*s in\n cipher_alg_of_impl i\n\nlet vale_impl_of_alg (a: vale_cipher_alg): vale_impl =\n match a with\n | AES128 -> Vale_AES128\n | AES256 -> Vale_AES256\n\nfriend Lib.IntTypes\n\n#push-options \"--z3rlimit 100\"\n\ninline_for_extraction noextract\nlet create_in_vale (i: vale_impl): create_in_st (cipher_alg_of_impl i) =\nfun r dst k iv iv_len c ->\n let has_aesni = EverCrypt.AutoConfig2.has_aesni () in\n let has_pclmulqdq = EverCrypt.AutoConfig2.has_pclmulqdq () in\n let has_avx = EverCrypt.AutoConfig2.has_avx() in\n let has_sse = EverCrypt.AutoConfig2.has_sse() in\n [@inline_let]\n let a = cipher_alg_of_impl i in\n\n if iv_len `UInt32.lt` 12ul then\n InvalidIVLength\n\n else if EverCrypt.TargetConfig.hacl_can_compile_vale && (has_aesni && has_pclmulqdq && has_avx && has_sse) then\n (**) let h0 = ST.get () in\n (**) let g_iv = G.hide (B.as_seq h0 iv) in\n (**) let g_key: G.erased (key a) = G.hide (B.as_seq h0 (k <: B.buffer uint8)) in\n\n let ek = B.malloc r 0uy (concrete_xkey_len i) in\n vale_expand i k ek;\n (**) let h1 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h1;\n\n let iv' = B.malloc r 0uy 16ul in\n B.blit iv 0ul iv' 0ul iv_len;\n (**) let h2 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h2;\n\n let p = B.malloc r (State (vale_impl_of_alg a) g_iv iv' iv_len g_key ek c) 1ul in\n (**) let h3 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h3;\n assert (B.fresh_loc (footprint h3 p) h0 h3);\n\n dst *= p;\n (**) let h4 = ST.get () in\n (**) B.modifies_only_not_unused_in B.(loc_buffer dst) h0 h4;\n\n Success\n\n else\n UnsupportedAlgorithm\n\nlet create_in a r dst k iv iv_len c =\n match a with\n | AES128 ->\n create_in_vale Vale_AES128 r dst k iv iv_len c\n | AES256 ->\n create_in_vale Vale_AES256 r dst k iv iv_len c\n | CHACHA20 ->\n (**) let h0 = ST.get () in\n (**) let g_iv = G.hide (B.as_seq h0 iv) in\n (**) let g_key: G.erased (key a) = G.hide (B.as_seq h0 (k <: B.buffer uint8)) in\n\n [@inline_let]\n let l = concrete_xkey_len Hacl_CHACHA20 in\n let ek = B.malloc r 0uy l in\n B.blit k 0ul ek 0ul l;\n (**) let h1 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h1;\n\n let iv' = B.malloc r 0uy iv_len in\n B.blit iv 0ul iv' 0ul iv_len;\n (**) let h2 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h2;\n\n let p = B.malloc r (State Hacl_CHACHA20 g_iv iv' 12ul g_key ek c) 1ul in\n (**) let h3 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h3;\n assert (B.fresh_loc (footprint h3 p) h0 h3);\n\n dst *= p;\n (**) let h4 = ST.get () in\n (**) B.modifies_only_not_unused_in B.(loc_buffer dst) h0 h4;\n\n Success\n\ninline_for_extraction noextract\nlet copy_or_expand (i: impl)\n (k: B.buffer uint8 { B.length k = Spec.key_length (cipher_alg_of_impl i) })\n (ek: B.buffer uint8 { B.len ek = concrete_xkey_len i }):\n Stack unit\n (requires (fun h0 ->\n B.live h0 k /\\ B.live h0 ek /\\\n B.disjoint k ek /\\\n cpu_features_invariant i))\n (ensures (fun h0 _ h1 ->\n B.(modifies (loc_buffer ek) h0 h1) /\\\n B.as_seq h1 ek `Seq.equal` concrete_expand i (B.as_seq h0 k)))", "dependencies": { "source_file": "NotEverCrypt.CTR.fst", "checked_file": "NotEverCrypt.CTR.fst.checked", "interface_file": true, "dependencies": [ "Vale.X64.CPU_Features_s.fst.checked", "Vale.Wrapper.X64.GCTR.fsti.checked", "Vale.Def.Words_s.fsti.checked", "Vale.Def.Words.Seq_s.fsti.checked", "Vale.Def.Types_s.fst.checked", "Vale.Arch.BufferFriend.fsti.checked", "Vale.AES.GCTR_s.fst.checked", "Vale.AES.GCTR.fsti.checked", "Vale.AES.AES_s.fst.checked", "Spec.Loops.fst.checked", "Spec.Cipher.Expansion.fst.checked", "Spec.Agile.CTR.fst.checked", "Spec.Agile.Cipher.fst.checked", "Spec.AES.fst.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "Hacl.Impl.Chacha20.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.TargetConfig.fsti.checked", "EverCrypt.CTR.Keys.fst.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n i: Spec.Cipher.Expansion.impl ->\n k:\n LowStar.Buffer.buffer NotEverCrypt.CTR.uint8\n { LowStar.Monotonic.Buffer.length k =\n Spec.Agile.Cipher.key_length (Spec.Cipher.Expansion.cipher_alg_of_impl i) } ->\n ek:\n LowStar.Buffer.buffer NotEverCrypt.CTR.uint8\n {LowStar.Monotonic.Buffer.len ek = EverCrypt.CTR.Keys.concrete_xkey_len i}\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Spec.Cipher.Expansion.impl", "LowStar.Buffer.buffer", "NotEverCrypt.CTR.uint8", "Prims.b2t", "Prims.op_Equality", "Prims.nat", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Spec.Agile.Cipher.key_length", "Spec.Cipher.Expansion.cipher_alg_of_impl", "FStar.UInt32.t", "LowStar.Monotonic.Buffer.len", "EverCrypt.CTR.Keys.concrete_xkey_len", "EverCrypt.TargetConfig.hacl_can_compile_vale", "EverCrypt.CTR.Keys.vale_expand", "Spec.Cipher.Expansion.Vale_AES128", "Prims.unit", "Prims.bool", "Spec.Cipher.Expansion.Vale_AES256", "LowStar.Monotonic.Buffer.blit", "FStar.UInt32.__uint_to_t", "FStar.Monotonic.HyperStack.mem", "Prims.l_and", "LowStar.Monotonic.Buffer.live", "LowStar.Monotonic.Buffer.disjoint", "NotEverCrypt.CTR.cpu_features_invariant", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_buffer", "FStar.Seq.Base.equal", "LowStar.Monotonic.Buffer.as_seq", "Spec.Cipher.Expansion.concrete_expand" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val copy_or_expand\n (i: impl)\n (k: B.buffer uint8 {B.length k = Spec.key_length (cipher_alg_of_impl i)})\n (ek: B.buffer uint8 {B.len ek = concrete_xkey_len i})\n : Stack unit\n (requires\n (fun h0 -> B.live h0 k /\\ B.live h0 ek /\\ B.disjoint k ek /\\ cpu_features_invariant i))\n (ensures\n (fun h0 _ h1 ->\n B.(modifies (loc_buffer ek) h0 h1) /\\\n (B.as_seq h1 ek) `Seq.equal` (concrete_expand i (B.as_seq h0 k))))\nlet copy_or_expand\n (i: impl)\n (k: B.buffer uint8 {B.length k = Spec.key_length (cipher_alg_of_impl i)})\n (ek: B.buffer uint8 {B.len ek = concrete_xkey_len i})\n : Stack unit\n (requires\n (fun h0 -> B.live h0 k /\\ B.live h0 ek /\\ B.disjoint k ek /\\ cpu_features_invariant i))\n (ensures\n (fun h0 _ h1 ->\n B.(modifies (loc_buffer ek) h0 h1) /\\\n (B.as_seq h1 ek) `Seq.equal` (concrete_expand i (B.as_seq h0 k)))) =", "completed_definiton": "match i with\n| Vale_AES128 -> if EverCrypt.TargetConfig.hacl_can_compile_vale then vale_expand Vale_AES128 k ek\n| Vale_AES256 -> if EverCrypt.TargetConfig.hacl_can_compile_vale then vale_expand Vale_AES256 k ek\n| Hacl_CHACHA20 -> B.blit k 0ul ek 0ul 32ul", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fst", "name": "NotEverCrypt.CTR.init", "original_source_type": "val init: a:e_alg -> (\n let a = G.reveal a in\n s:state a ->\n k:B.buffer uint8 { B.length k = Spec.Agile.CTR.key_length a } ->\n nonce: B.buffer uint8 ->\n nonce_len: UInt32.t { Spec.nonce_bound a (UInt32.v nonce_len) /\\ B.len nonce = nonce_len } ->\n c: UInt32.t ->\n Stack unit\n (requires (fun h0 ->\n B.live h0 k /\\\n B.live h0 nonce /\\\n B.(loc_disjoint (loc_buffer k) (footprint h0 s)) /\\\n B.(loc_disjoint (loc_buffer nonce) (footprint h0 s)) /\\\n invariant h0 s))\n (ensures (fun h0 _ h1 ->\n preserves_freeable #a s h0 h1 /\\\n invariant #a h1 s /\\\n footprint h0 s == footprint #a h1 s /\\\n B.(modifies (footprint #a h0 s) h0 h1) /\\\n kv (B.deref h1 s) == B.as_seq h0 k /\\\n iv (B.deref h1 s) == B.as_seq h0 nonce /\\\n ctr h1 s = UInt32.v c\n )))", "source_type": "val init: a:e_alg -> (\n let a = G.reveal a in\n s:state a ->\n k:B.buffer uint8 { B.length k = Spec.Agile.CTR.key_length a } ->\n nonce: B.buffer uint8 ->\n nonce_len: UInt32.t { Spec.nonce_bound a (UInt32.v nonce_len) /\\ B.len nonce = nonce_len } ->\n c: UInt32.t ->\n Stack unit\n (requires (fun h0 ->\n B.live h0 k /\\\n B.live h0 nonce /\\\n B.(loc_disjoint (loc_buffer k) (footprint h0 s)) /\\\n B.(loc_disjoint (loc_buffer nonce) (footprint h0 s)) /\\\n invariant h0 s))\n (ensures (fun h0 _ h1 ->\n preserves_freeable #a s h0 h1 /\\\n invariant #a h1 s /\\\n footprint h0 s == footprint #a h1 s /\\\n B.(modifies (footprint #a h0 s) h0 h1) /\\\n kv (B.deref h1 s) == B.as_seq h0 k /\\\n iv (B.deref h1 s) == B.as_seq h0 nonce /\\\n ctr h1 s = UInt32.v c\n )))", "source_definition": "let init a p k iv iv_len c =\n let State i _ iv' _ _ ek _ = !*p in\n [@inline_let]\n let k: B.buffer uint8 = k in\n\n (**) let h0 = ST.get () in\n (**) let g_iv = G.hide (B.as_seq h0 iv) in\n (**) let g_key: G.erased (key (cipher_alg_of_impl i)) = G.hide (B.as_seq h0 k) in\n\n B.blit iv 0ul iv' 0ul iv_len;\n (**) let h1 = ST.get () in\n (**) assert B.(modifies (footprint_s (B.deref h0 p)) h0 h1);\n\n copy_or_expand i k ek;\n (**) let h2 = ST.get () in\n (**) assert B.(modifies (footprint_s (B.deref h0 p)) h1 h2);\n\n // TODO: two in-place updates\n p *= (State i g_iv iv' iv_len g_key ek c)", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 200, "start_col": 28, "end_line": 218, "end_col": 43 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nfriend Spec.Cipher.Expansion\nfriend EverCrypt.CTR.Keys\n\nopen EverCrypt.CTR.Keys\nopen FStar.HyperStack.ST\nopen LowStar.BufferOps\nopen Spec.Cipher.Expansion\nopen Spec.Agile.CTR\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\nnoextract\nlet nonce_upper_bound a =\n match a with\n | AES128 | AES256 -> block_length a\n | CHACHA20 -> 12\n\nnoeq\ntype state_s (a: Spec.cipher_alg) =\n| State:\n i:impl ->\n g_iv: G.erased (Spec.nonce a) ->\n iv: B.buffer uint8 { B.length iv = nonce_upper_bound a } ->\n iv_len: UInt32.t { UInt32.v iv_len = Seq.length (G.reveal g_iv) } ->\n g_key: G.erased (Spec.key a) ->\n xkey: B.buffer uint8 { B.length xkey = concrete_xkey_length i } ->\n ctr: UInt32.t ->\n state_s a\n\nlet freeable_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.freeable iv /\\ B.freeable key\n\nlet footprint_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.(loc_addr_of_buffer iv `loc_union` loc_addr_of_buffer key)\n\nlet cpu_features_invariant (i: impl): Type0 =\n match i with\n | Vale_AES128 | Vale_AES256 ->\n EverCrypt.TargetConfig.hacl_can_compile_vale /\\\n Vale.X64.CPU_Features_s.(aesni_enabled /\\ pclmulqdq_enabled /\\ avx_enabled /\\ sse_enabled)\n | Hacl_CHACHA20 ->\n True\n\nlet invariant_s #a h s =\n let State i g_iv iv _ g_key ek _ = s in\n let g_iv = G.reveal g_iv in\n a = cipher_alg_of_impl i /\\\n B.live h iv /\\ B.live h ek /\\\n B.disjoint ek iv /\\\n g_iv `Seq.equal` Seq.slice (B.as_seq h iv) 0 (Seq.length g_iv) /\\\n concrete_expand i (G.reveal g_key) `Seq.equal` B.as_seq h ek /\\\n cpu_features_invariant i\n\nlet _: squash (inversion impl) = allow_inversion impl\nlet _: squash (inversion cipher_alg) = allow_inversion cipher_alg\n\nlet invert_state_s (a: alg): Lemma\n (requires True)\n (ensures (inversion (state_s a)))\n [ SMTPat (state_s a) ]\n=\n allow_inversion (state_s a)\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet frame_invariant #_ _ _ _ _ = ()\n\nlet kv #a (s: state_s a) =\n let State _ _ _ _ g_key _ _ = s in\n G.reveal g_key\n\nlet iv #a (s: state_s a) =\n let State _ g_iv _ _ _ _ _ = s in\n G.reveal g_iv\n\nlet ctr #a (h: HS.mem) (s: state a) =\n UInt32.v (State?.ctr (B.deref h s))\n\nlet alg_of_state _ s =\n let State i _ _ _ _ _ _ = !*s in\n cipher_alg_of_impl i\n\nlet vale_impl_of_alg (a: vale_cipher_alg): vale_impl =\n match a with\n | AES128 -> Vale_AES128\n | AES256 -> Vale_AES256\n\nfriend Lib.IntTypes\n\n#push-options \"--z3rlimit 100\"\n\ninline_for_extraction noextract\nlet create_in_vale (i: vale_impl): create_in_st (cipher_alg_of_impl i) =\nfun r dst k iv iv_len c ->\n let has_aesni = EverCrypt.AutoConfig2.has_aesni () in\n let has_pclmulqdq = EverCrypt.AutoConfig2.has_pclmulqdq () in\n let has_avx = EverCrypt.AutoConfig2.has_avx() in\n let has_sse = EverCrypt.AutoConfig2.has_sse() in\n [@inline_let]\n let a = cipher_alg_of_impl i in\n\n if iv_len `UInt32.lt` 12ul then\n InvalidIVLength\n\n else if EverCrypt.TargetConfig.hacl_can_compile_vale && (has_aesni && has_pclmulqdq && has_avx && has_sse) then\n (**) let h0 = ST.get () in\n (**) let g_iv = G.hide (B.as_seq h0 iv) in\n (**) let g_key: G.erased (key a) = G.hide (B.as_seq h0 (k <: B.buffer uint8)) in\n\n let ek = B.malloc r 0uy (concrete_xkey_len i) in\n vale_expand i k ek;\n (**) let h1 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h1;\n\n let iv' = B.malloc r 0uy 16ul in\n B.blit iv 0ul iv' 0ul iv_len;\n (**) let h2 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h2;\n\n let p = B.malloc r (State (vale_impl_of_alg a) g_iv iv' iv_len g_key ek c) 1ul in\n (**) let h3 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h3;\n assert (B.fresh_loc (footprint h3 p) h0 h3);\n\n dst *= p;\n (**) let h4 = ST.get () in\n (**) B.modifies_only_not_unused_in B.(loc_buffer dst) h0 h4;\n\n Success\n\n else\n UnsupportedAlgorithm\n\nlet create_in a r dst k iv iv_len c =\n match a with\n | AES128 ->\n create_in_vale Vale_AES128 r dst k iv iv_len c\n | AES256 ->\n create_in_vale Vale_AES256 r dst k iv iv_len c\n | CHACHA20 ->\n (**) let h0 = ST.get () in\n (**) let g_iv = G.hide (B.as_seq h0 iv) in\n (**) let g_key: G.erased (key a) = G.hide (B.as_seq h0 (k <: B.buffer uint8)) in\n\n [@inline_let]\n let l = concrete_xkey_len Hacl_CHACHA20 in\n let ek = B.malloc r 0uy l in\n B.blit k 0ul ek 0ul l;\n (**) let h1 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h1;\n\n let iv' = B.malloc r 0uy iv_len in\n B.blit iv 0ul iv' 0ul iv_len;\n (**) let h2 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h2;\n\n let p = B.malloc r (State Hacl_CHACHA20 g_iv iv' 12ul g_key ek c) 1ul in\n (**) let h3 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h3;\n assert (B.fresh_loc (footprint h3 p) h0 h3);\n\n dst *= p;\n (**) let h4 = ST.get () in\n (**) B.modifies_only_not_unused_in B.(loc_buffer dst) h0 h4;\n\n Success\n\ninline_for_extraction noextract\nlet copy_or_expand (i: impl)\n (k: B.buffer uint8 { B.length k = Spec.key_length (cipher_alg_of_impl i) })\n (ek: B.buffer uint8 { B.len ek = concrete_xkey_len i }):\n Stack unit\n (requires (fun h0 ->\n B.live h0 k /\\ B.live h0 ek /\\\n B.disjoint k ek /\\\n cpu_features_invariant i))\n (ensures (fun h0 _ h1 ->\n B.(modifies (loc_buffer ek) h0 h1) /\\\n B.as_seq h1 ek `Seq.equal` concrete_expand i (B.as_seq h0 k)))\n=\n match i with\n | Vale_AES128 ->\n if EverCrypt.TargetConfig.hacl_can_compile_vale then\n vale_expand Vale_AES128 k ek\n | Vale_AES256 ->\n if EverCrypt.TargetConfig.hacl_can_compile_vale then\n vale_expand Vale_AES256 k ek\n | Hacl_CHACHA20 ->\n B.blit k 0ul ek 0ul 32ul", "dependencies": { "source_file": "NotEverCrypt.CTR.fst", "checked_file": "NotEverCrypt.CTR.fst.checked", "interface_file": true, "dependencies": [ "Vale.X64.CPU_Features_s.fst.checked", "Vale.Wrapper.X64.GCTR.fsti.checked", "Vale.Def.Words_s.fsti.checked", "Vale.Def.Words.Seq_s.fsti.checked", "Vale.Def.Types_s.fst.checked", "Vale.Arch.BufferFriend.fsti.checked", "Vale.AES.GCTR_s.fst.checked", "Vale.AES.GCTR.fsti.checked", "Vale.AES.AES_s.fst.checked", "Spec.Loops.fst.checked", "Spec.Cipher.Expansion.fst.checked", "Spec.Agile.CTR.fst.checked", "Spec.Agile.Cipher.fst.checked", "Spec.AES.fst.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "Hacl.Impl.Chacha20.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.TargetConfig.fsti.checked", "EverCrypt.CTR.Keys.fst.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: NotEverCrypt.CTR.e_alg\n -> (let a = FStar.Ghost.reveal a in\n\n s: NotEverCrypt.CTR.state a ->\n k:\n LowStar.Buffer.buffer NotEverCrypt.CTR.uint8\n {LowStar.Monotonic.Buffer.length k = Spec.Agile.Cipher.key_length a} ->\n nonce: LowStar.Buffer.buffer NotEverCrypt.CTR.uint8 ->\n nonce_len:\n FStar.UInt32.t\n { Spec.Agile.Cipher.nonce_bound a (FStar.UInt32.v nonce_len) /\\\n LowStar.Monotonic.Buffer.len nonce = nonce_len } ->\n c: FStar.UInt32.t\n -> FStar.HyperStack.ST.Stack Prims.unit)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "NotEverCrypt.CTR.e_alg", "NotEverCrypt.CTR.state", "FStar.Ghost.reveal", "NotEverCrypt.CTR.alg", "LowStar.Buffer.buffer", "NotEverCrypt.CTR.uint8", "Prims.b2t", "Prims.op_Equality", "Prims.nat", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Spec.Agile.Cipher.key_length", "FStar.UInt32.t", "Prims.l_and", "Spec.Agile.Cipher.nonce_bound", "FStar.UInt32.v", "LowStar.Monotonic.Buffer.len", "Spec.Cipher.Expansion.impl", "FStar.Ghost.erased", "Spec.Agile.Cipher.nonce", "EverCrypt.CTR.Keys.uint8", "Prims.int", "NotEverCrypt.CTR.nonce_upper_bound", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.op_GreaterThanOrEqual", "FStar.Seq.Base.length", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "Spec.Agile.Cipher.key", "Spec.Cipher.Expansion.concrete_xkey_length", "LowStar.BufferOps.op_Star_Equals", "NotEverCrypt.CTR.state_s", "NotEverCrypt.CTR.State", "Spec.Cipher.Expansion.cipher_alg_of_impl", "Prims.unit", "Prims._assert", "LowStar.Monotonic.Buffer.modifies", "NotEverCrypt.CTR.footprint_s", "LowStar.Monotonic.Buffer.deref", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "NotEverCrypt.CTR.copy_or_expand", "LowStar.Monotonic.Buffer.blit", "FStar.UInt32.__uint_to_t", "FStar.Ghost.hide", "LowStar.Monotonic.Buffer.as_seq", "Spec.Agile.Cipher.cipher_alg", "LowStar.BufferOps.op_Bang_Star" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val init: a:e_alg -> (\n let a = G.reveal a in\n s:state a ->\n k:B.buffer uint8 { B.length k = Spec.Agile.CTR.key_length a } ->\n nonce: B.buffer uint8 ->\n nonce_len: UInt32.t { Spec.nonce_bound a (UInt32.v nonce_len) /\\ B.len nonce = nonce_len } ->\n c: UInt32.t ->\n Stack unit\n (requires (fun h0 ->\n B.live h0 k /\\\n B.live h0 nonce /\\\n B.(loc_disjoint (loc_buffer k) (footprint h0 s)) /\\\n B.(loc_disjoint (loc_buffer nonce) (footprint h0 s)) /\\\n invariant h0 s))\n (ensures (fun h0 _ h1 ->\n preserves_freeable #a s h0 h1 /\\\n invariant #a h1 s /\\\n footprint h0 s == footprint #a h1 s /\\\n B.(modifies (footprint #a h0 s) h0 h1) /\\\n kv (B.deref h1 s) == B.as_seq h0 k /\\\n iv (B.deref h1 s) == B.as_seq h0 nonce /\\\n ctr h1 s = UInt32.v c\n )))\nlet init a p k iv iv_len c =", "completed_definiton": "let State i _ iv' _ _ ek _ = !*p in\n[@@ inline_let ]let k:B.buffer uint8 = k in\nlet h0 = ST.get () in\nlet g_iv = G.hide (B.as_seq h0 iv) in\nlet g_key:G.erased (key (cipher_alg_of_impl i)) = G.hide (B.as_seq h0 k) in\nB.blit iv 0ul iv' 0ul iv_len;\nlet h1 = ST.get () in\nassert B.(modifies (footprint_s (B.deref h0 p)) h0 h1);\ncopy_or_expand i k ek;\nlet h2 = ST.get () in\nassert B.(modifies (footprint_s (B.deref h0 p)) h1 h2);\np *= (State i g_iv iv' iv_len g_key ek c)", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fst", "name": "NotEverCrypt.CTR.create_in", "original_source_type": "val create_in: a:alg -> create_in_st a", "source_type": "val create_in: a:alg -> create_in_st a", "source_definition": "let create_in a r dst k iv iv_len c =\n match a with\n | AES128 ->\n create_in_vale Vale_AES128 r dst k iv iv_len c\n | AES256 ->\n create_in_vale Vale_AES256 r dst k iv iv_len c\n | CHACHA20 ->\n (**) let h0 = ST.get () in\n (**) let g_iv = G.hide (B.as_seq h0 iv) in\n (**) let g_key: G.erased (key a) = G.hide (B.as_seq h0 (k <: B.buffer uint8)) in\n\n [@inline_let]\n let l = concrete_xkey_len Hacl_CHACHA20 in\n let ek = B.malloc r 0uy l in\n B.blit k 0ul ek 0ul l;\n (**) let h1 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h1;\n\n let iv' = B.malloc r 0uy iv_len in\n B.blit iv 0ul iv' 0ul iv_len;\n (**) let h2 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h2;\n\n let p = B.malloc r (State Hacl_CHACHA20 g_iv iv' 12ul g_key ek c) 1ul in\n (**) let h3 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h3;\n assert (B.fresh_loc (footprint h3 p) h0 h3);\n\n dst *= p;\n (**) let h4 = ST.get () in\n (**) B.modifies_only_not_unused_in B.(loc_buffer dst) h0 h4;\n\n Success", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 144, "start_col": 2, "end_line": 175, "end_col": 13 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nfriend Spec.Cipher.Expansion\nfriend EverCrypt.CTR.Keys\n\nopen EverCrypt.CTR.Keys\nopen FStar.HyperStack.ST\nopen LowStar.BufferOps\nopen Spec.Cipher.Expansion\nopen Spec.Agile.CTR\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\nnoextract\nlet nonce_upper_bound a =\n match a with\n | AES128 | AES256 -> block_length a\n | CHACHA20 -> 12\n\nnoeq\ntype state_s (a: Spec.cipher_alg) =\n| State:\n i:impl ->\n g_iv: G.erased (Spec.nonce a) ->\n iv: B.buffer uint8 { B.length iv = nonce_upper_bound a } ->\n iv_len: UInt32.t { UInt32.v iv_len = Seq.length (G.reveal g_iv) } ->\n g_key: G.erased (Spec.key a) ->\n xkey: B.buffer uint8 { B.length xkey = concrete_xkey_length i } ->\n ctr: UInt32.t ->\n state_s a\n\nlet freeable_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.freeable iv /\\ B.freeable key\n\nlet footprint_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.(loc_addr_of_buffer iv `loc_union` loc_addr_of_buffer key)\n\nlet cpu_features_invariant (i: impl): Type0 =\n match i with\n | Vale_AES128 | Vale_AES256 ->\n EverCrypt.TargetConfig.hacl_can_compile_vale /\\\n Vale.X64.CPU_Features_s.(aesni_enabled /\\ pclmulqdq_enabled /\\ avx_enabled /\\ sse_enabled)\n | Hacl_CHACHA20 ->\n True\n\nlet invariant_s #a h s =\n let State i g_iv iv _ g_key ek _ = s in\n let g_iv = G.reveal g_iv in\n a = cipher_alg_of_impl i /\\\n B.live h iv /\\ B.live h ek /\\\n B.disjoint ek iv /\\\n g_iv `Seq.equal` Seq.slice (B.as_seq h iv) 0 (Seq.length g_iv) /\\\n concrete_expand i (G.reveal g_key) `Seq.equal` B.as_seq h ek /\\\n cpu_features_invariant i\n\nlet _: squash (inversion impl) = allow_inversion impl\nlet _: squash (inversion cipher_alg) = allow_inversion cipher_alg\n\nlet invert_state_s (a: alg): Lemma\n (requires True)\n (ensures (inversion (state_s a)))\n [ SMTPat (state_s a) ]\n=\n allow_inversion (state_s a)\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet frame_invariant #_ _ _ _ _ = ()\n\nlet kv #a (s: state_s a) =\n let State _ _ _ _ g_key _ _ = s in\n G.reveal g_key\n\nlet iv #a (s: state_s a) =\n let State _ g_iv _ _ _ _ _ = s in\n G.reveal g_iv\n\nlet ctr #a (h: HS.mem) (s: state a) =\n UInt32.v (State?.ctr (B.deref h s))\n\nlet alg_of_state _ s =\n let State i _ _ _ _ _ _ = !*s in\n cipher_alg_of_impl i\n\nlet vale_impl_of_alg (a: vale_cipher_alg): vale_impl =\n match a with\n | AES128 -> Vale_AES128\n | AES256 -> Vale_AES256\n\nfriend Lib.IntTypes\n\n#push-options \"--z3rlimit 100\"\n\ninline_for_extraction noextract\nlet create_in_vale (i: vale_impl): create_in_st (cipher_alg_of_impl i) =\nfun r dst k iv iv_len c ->\n let has_aesni = EverCrypt.AutoConfig2.has_aesni () in\n let has_pclmulqdq = EverCrypt.AutoConfig2.has_pclmulqdq () in\n let has_avx = EverCrypt.AutoConfig2.has_avx() in\n let has_sse = EverCrypt.AutoConfig2.has_sse() in\n [@inline_let]\n let a = cipher_alg_of_impl i in\n\n if iv_len `UInt32.lt` 12ul then\n InvalidIVLength\n\n else if EverCrypt.TargetConfig.hacl_can_compile_vale && (has_aesni && has_pclmulqdq && has_avx && has_sse) then\n (**) let h0 = ST.get () in\n (**) let g_iv = G.hide (B.as_seq h0 iv) in\n (**) let g_key: G.erased (key a) = G.hide (B.as_seq h0 (k <: B.buffer uint8)) in\n\n let ek = B.malloc r 0uy (concrete_xkey_len i) in\n vale_expand i k ek;\n (**) let h1 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h1;\n\n let iv' = B.malloc r 0uy 16ul in\n B.blit iv 0ul iv' 0ul iv_len;\n (**) let h2 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h2;\n\n let p = B.malloc r (State (vale_impl_of_alg a) g_iv iv' iv_len g_key ek c) 1ul in\n (**) let h3 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h3;\n assert (B.fresh_loc (footprint h3 p) h0 h3);\n\n dst *= p;\n (**) let h4 = ST.get () in\n (**) B.modifies_only_not_unused_in B.(loc_buffer dst) h0 h4;\n\n Success\n\n else\n UnsupportedAlgorithm", "dependencies": { "source_file": "NotEverCrypt.CTR.fst", "checked_file": "NotEverCrypt.CTR.fst.checked", "interface_file": true, "dependencies": [ "Vale.X64.CPU_Features_s.fst.checked", "Vale.Wrapper.X64.GCTR.fsti.checked", "Vale.Def.Words_s.fsti.checked", "Vale.Def.Words.Seq_s.fsti.checked", "Vale.Def.Types_s.fst.checked", "Vale.Arch.BufferFriend.fsti.checked", "Vale.AES.GCTR_s.fst.checked", "Vale.AES.GCTR.fsti.checked", "Vale.AES.AES_s.fst.checked", "Spec.Loops.fst.checked", "Spec.Cipher.Expansion.fst.checked", "Spec.Agile.CTR.fst.checked", "Spec.Agile.Cipher.fst.checked", "Spec.AES.fst.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "Hacl.Impl.Chacha20.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.TargetConfig.fsti.checked", "EverCrypt.CTR.Keys.fst.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: NotEverCrypt.CTR.alg -> NotEverCrypt.CTR.create_in_st a", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "NotEverCrypt.CTR.alg", "FStar.Monotonic.HyperHeap.rid", "LowStar.Buffer.pointer", "LowStar.Buffer.pointer_or_null", "NotEverCrypt.CTR.state_s", "LowStar.Buffer.buffer", "NotEverCrypt.CTR.uint8", "Prims.b2t", "Prims.op_Equality", "Prims.nat", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Spec.Agile.Cipher.key_length", "FStar.UInt32.t", "Prims.l_and", "Spec.Agile.Cipher.nonce_bound", "FStar.UInt32.v", "LowStar.Monotonic.Buffer.len", "NotEverCrypt.CTR.create_in_vale", "Spec.Cipher.Expansion.Vale_AES128", "EverCrypt.Error.error_code", "Spec.Cipher.Expansion.Vale_AES256", "EverCrypt.Error.Success", "Prims.unit", "LowStar.Monotonic.Buffer.modifies_only_not_unused_in", "LowStar.Monotonic.Buffer.loc_buffer", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "LowStar.BufferOps.op_Star_Equals", "Prims._assert", "LowStar.Monotonic.Buffer.fresh_loc", "NotEverCrypt.CTR.footprint", "LowStar.Monotonic.Buffer.loc_none", "LowStar.Monotonic.Buffer.mbuffer", "Prims.eq2", "FStar.UInt32.uint_to_t", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "LowStar.Monotonic.Buffer.frameOf", "LowStar.Monotonic.Buffer.freeable", "LowStar.Buffer.malloc", "NotEverCrypt.CTR.State", "Spec.Cipher.Expansion.Hacl_CHACHA20", "FStar.UInt32.__uint_to_t", "LowStar.Monotonic.Buffer.blit", "FStar.UInt8.__uint_to_t", "Prims.int", "Prims.l_or", "FStar.UInt.size", "Prims.op_GreaterThanOrEqual", "Prims.op_LessThanOrEqual", "Prims.op_Subtraction", "Prims.pow2", "Spec.Cipher.Expansion.concrete_xkey_length", "EverCrypt.CTR.Keys.concrete_xkey_len", "FStar.Ghost.erased", "Spec.Agile.Cipher.key", "FStar.Ghost.hide", "LowStar.Monotonic.Buffer.as_seq", "Spec.Agile.Cipher.nonce" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val create_in: a:alg -> create_in_st a\nlet create_in a r dst k iv iv_len c =", "completed_definiton": "match a with\n| AES128 -> create_in_vale Vale_AES128 r dst k iv iv_len c\n| AES256 -> create_in_vale Vale_AES256 r dst k iv iv_len c\n| CHACHA20 ->\n let h0 = ST.get () in\n let g_iv = G.hide (B.as_seq h0 iv) in\n let g_key:G.erased (key a) = G.hide (B.as_seq h0 (k <: B.buffer uint8)) in\n [@@ inline_let ]let l = concrete_xkey_len Hacl_CHACHA20 in\n let ek = B.malloc r 0uy l in\n B.blit k 0ul ek 0ul l;\n let h1 = ST.get () in\n B.modifies_only_not_unused_in B.loc_none h0 h1;\n let iv' = B.malloc r 0uy iv_len in\n B.blit iv 0ul iv' 0ul iv_len;\n let h2 = ST.get () in\n B.modifies_only_not_unused_in B.loc_none h0 h2;\n let p = B.malloc r (State Hacl_CHACHA20 g_iv iv' 12ul g_key ek c) 1ul in\n let h3 = ST.get () in\n B.modifies_only_not_unused_in B.loc_none h0 h3;\n assert (B.fresh_loc (footprint h3 p) h0 h3);\n dst *= p;\n let h4 = ST.get () in\n B.modifies_only_not_unused_in B.(loc_buffer dst) h0 h4;\n Success", "isa_cross_project_example": true }, { "file_name": "NotEverCrypt.CTR.fst", "name": "NotEverCrypt.CTR.create_in_vale", "original_source_type": "val create_in_vale (i: vale_impl) : create_in_st (cipher_alg_of_impl i)", "source_type": "val create_in_vale (i: vale_impl) : create_in_st (cipher_alg_of_impl i)", "source_definition": "let create_in_vale (i: vale_impl): create_in_st (cipher_alg_of_impl i) =\nfun r dst k iv iv_len c ->\n let has_aesni = EverCrypt.AutoConfig2.has_aesni () in\n let has_pclmulqdq = EverCrypt.AutoConfig2.has_pclmulqdq () in\n let has_avx = EverCrypt.AutoConfig2.has_avx() in\n let has_sse = EverCrypt.AutoConfig2.has_sse() in\n [@inline_let]\n let a = cipher_alg_of_impl i in\n\n if iv_len `UInt32.lt` 12ul then\n InvalidIVLength\n\n else if EverCrypt.TargetConfig.hacl_can_compile_vale && (has_aesni && has_pclmulqdq && has_avx && has_sse) then\n (**) let h0 = ST.get () in\n (**) let g_iv = G.hide (B.as_seq h0 iv) in\n (**) let g_key: G.erased (key a) = G.hide (B.as_seq h0 (k <: B.buffer uint8)) in\n\n let ek = B.malloc r 0uy (concrete_xkey_len i) in\n vale_expand i k ek;\n (**) let h1 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h1;\n\n let iv' = B.malloc r 0uy 16ul in\n B.blit iv 0ul iv' 0ul iv_len;\n (**) let h2 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h2;\n\n let p = B.malloc r (State (vale_impl_of_alg a) g_iv iv' iv_len g_key ek c) 1ul in\n (**) let h3 = ST.get () in\n (**) B.modifies_only_not_unused_in B.loc_none h0 h3;\n assert (B.fresh_loc (footprint h3 p) h0 h3);\n\n dst *= p;\n (**) let h4 = ST.get () in\n (**) B.modifies_only_not_unused_in B.(loc_buffer dst) h0 h4;\n\n Success\n\n else\n UnsupportedAlgorithm", "source": { "project_name": "everquic-crypto", "file_name": "src/NotEverCrypt.CTR.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 103, "start_col": 0, "end_line": 141, "end_col": 24 }, "file_context": "module NotEverCrypt.CTR\n\nmodule ST = FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule G = FStar.Ghost\n\nfriend Spec.Cipher.Expansion\nfriend EverCrypt.CTR.Keys\n\nopen EverCrypt.CTR.Keys\nopen FStar.HyperStack.ST\nopen LowStar.BufferOps\nopen Spec.Cipher.Expansion\nopen Spec.Agile.CTR\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\nnoextract\nlet nonce_upper_bound a =\n match a with\n | AES128 | AES256 -> block_length a\n | CHACHA20 -> 12\n\nnoeq\ntype state_s (a: Spec.cipher_alg) =\n| State:\n i:impl ->\n g_iv: G.erased (Spec.nonce a) ->\n iv: B.buffer uint8 { B.length iv = nonce_upper_bound a } ->\n iv_len: UInt32.t { UInt32.v iv_len = Seq.length (G.reveal g_iv) } ->\n g_key: G.erased (Spec.key a) ->\n xkey: B.buffer uint8 { B.length xkey = concrete_xkey_length i } ->\n ctr: UInt32.t ->\n state_s a\n\nlet freeable_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.freeable iv /\\ B.freeable key\n\nlet footprint_s #a s =\n let State _ _ iv _ _ key _ = s in\n B.(loc_addr_of_buffer iv `loc_union` loc_addr_of_buffer key)\n\nlet cpu_features_invariant (i: impl): Type0 =\n match i with\n | Vale_AES128 | Vale_AES256 ->\n EverCrypt.TargetConfig.hacl_can_compile_vale /\\\n Vale.X64.CPU_Features_s.(aesni_enabled /\\ pclmulqdq_enabled /\\ avx_enabled /\\ sse_enabled)\n | Hacl_CHACHA20 ->\n True\n\nlet invariant_s #a h s =\n let State i g_iv iv _ g_key ek _ = s in\n let g_iv = G.reveal g_iv in\n a = cipher_alg_of_impl i /\\\n B.live h iv /\\ B.live h ek /\\\n B.disjoint ek iv /\\\n g_iv `Seq.equal` Seq.slice (B.as_seq h iv) 0 (Seq.length g_iv) /\\\n concrete_expand i (G.reveal g_key) `Seq.equal` B.as_seq h ek /\\\n cpu_features_invariant i\n\nlet _: squash (inversion impl) = allow_inversion impl\nlet _: squash (inversion cipher_alg) = allow_inversion cipher_alg\n\nlet invert_state_s (a: alg): Lemma\n (requires True)\n (ensures (inversion (state_s a)))\n [ SMTPat (state_s a) ]\n=\n allow_inversion (state_s a)\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet frame_invariant #_ _ _ _ _ = ()\n\nlet kv #a (s: state_s a) =\n let State _ _ _ _ g_key _ _ = s in\n G.reveal g_key\n\nlet iv #a (s: state_s a) =\n let State _ g_iv _ _ _ _ _ = s in\n G.reveal g_iv\n\nlet ctr #a (h: HS.mem) (s: state a) =\n UInt32.v (State?.ctr (B.deref h s))\n\nlet alg_of_state _ s =\n let State i _ _ _ _ _ _ = !*s in\n cipher_alg_of_impl i\n\nlet vale_impl_of_alg (a: vale_cipher_alg): vale_impl =\n match a with\n | AES128 -> Vale_AES128\n | AES256 -> Vale_AES256\n\nfriend Lib.IntTypes\n\n#push-options \"--z3rlimit 100\"\n\ninline_for_extraction noextract", "dependencies": { "source_file": "NotEverCrypt.CTR.fst", "checked_file": "NotEverCrypt.CTR.fst.checked", "interface_file": true, "dependencies": [ "Vale.X64.CPU_Features_s.fst.checked", "Vale.Wrapper.X64.GCTR.fsti.checked", "Vale.Def.Words_s.fsti.checked", "Vale.Def.Words.Seq_s.fsti.checked", "Vale.Def.Types_s.fst.checked", "Vale.Arch.BufferFriend.fsti.checked", "Vale.AES.GCTR_s.fst.checked", "Vale.AES.GCTR.fsti.checked", "Vale.AES.AES_s.fst.checked", "Spec.Loops.fst.checked", "Spec.Cipher.Expansion.fst.checked", "Spec.Agile.CTR.fst.checked", "Spec.Agile.Cipher.fst.checked", "Spec.AES.fst.checked", "prims.fst.checked", "LowStar.Endianness.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fst.checked", "Hacl.Impl.Chacha20.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.Full.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.TargetConfig.fsti.checked", "EverCrypt.CTR.Keys.fst.checked", "EverCrypt.AutoConfig2.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Spec.Agile.CTR" }, { "abbrev": false, "short_module": null, "full_module": "Spec.Cipher.Expansion" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.CTR.Keys" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.CTR" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "NotEverCrypt" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: EverCrypt.CTR.Keys.vale_impl\n -> NotEverCrypt.CTR.create_in_st (Spec.Cipher.Expansion.cipher_alg_of_impl i)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "EverCrypt.CTR.Keys.vale_impl", "FStar.Monotonic.HyperHeap.rid", "LowStar.Buffer.pointer", "LowStar.Buffer.pointer_or_null", "NotEverCrypt.CTR.state_s", "Spec.Cipher.Expansion.cipher_alg_of_impl", "LowStar.Buffer.buffer", "NotEverCrypt.CTR.uint8", "Prims.b2t", "Prims.op_Equality", "Prims.nat", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Spec.Agile.Cipher.key_length", "FStar.UInt32.t", "Prims.l_and", "Spec.Agile.Cipher.nonce_bound", "FStar.UInt32.v", "LowStar.Monotonic.Buffer.len", "FStar.UInt32.lt", "FStar.UInt32.__uint_to_t", "EverCrypt.Error.InvalidIVLength", "EverCrypt.Error.error_code", "Prims.bool", "Prims.op_AmpAmp", "EverCrypt.TargetConfig.hacl_can_compile_vale", "EverCrypt.Error.Success", "Prims.unit", "LowStar.Monotonic.Buffer.modifies_only_not_unused_in", "LowStar.Monotonic.Buffer.loc_buffer", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "LowStar.BufferOps.op_Star_Equals", "Prims._assert", "LowStar.Monotonic.Buffer.fresh_loc", "NotEverCrypt.CTR.footprint", "LowStar.Monotonic.Buffer.loc_none", "LowStar.Monotonic.Buffer.mbuffer", "Prims.eq2", "FStar.UInt32.uint_to_t", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "LowStar.Monotonic.Buffer.frameOf", "LowStar.Monotonic.Buffer.freeable", "LowStar.Buffer.malloc", "NotEverCrypt.CTR.State", "NotEverCrypt.CTR.vale_impl_of_alg", "LowStar.Monotonic.Buffer.blit", "FStar.UInt8.__uint_to_t", "EverCrypt.CTR.Keys.vale_expand", "EverCrypt.CTR.Keys.uint8", "EverCrypt.CTR.Keys.concrete_xkey_len", "FStar.Ghost.erased", "Spec.Agile.Cipher.key", "FStar.Ghost.hide", "LowStar.Monotonic.Buffer.as_seq", "Spec.Agile.Cipher.nonce", "EverCrypt.Error.UnsupportedAlgorithm", "Spec.Agile.Cipher.cipher_alg", "EverCrypt.AutoConfig2.has_sse", "EverCrypt.AutoConfig2.has_avx", "EverCrypt.AutoConfig2.has_pclmulqdq", "EverCrypt.AutoConfig2.has_aesni", "NotEverCrypt.CTR.create_in_st" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val create_in_vale (i: vale_impl) : create_in_st (cipher_alg_of_impl i)\nlet create_in_vale (i: vale_impl) : create_in_st (cipher_alg_of_impl i) =", "completed_definiton": "fun r dst k iv iv_len c ->\n let has_aesni = EverCrypt.AutoConfig2.has_aesni () in\n let has_pclmulqdq = EverCrypt.AutoConfig2.has_pclmulqdq () in\n let has_avx = EverCrypt.AutoConfig2.has_avx () in\n let has_sse = EverCrypt.AutoConfig2.has_sse () in\n [@@ inline_let ]let a = cipher_alg_of_impl i in\n if iv_len `UInt32.lt` 12ul\n then InvalidIVLength\n else\n if\n EverCrypt.TargetConfig.hacl_can_compile_vale &&\n (has_aesni && has_pclmulqdq && has_avx && has_sse)\n then\n let h0 = ST.get () in\n let g_iv = G.hide (B.as_seq h0 iv) in\n let g_key:G.erased (key a) = G.hide (B.as_seq h0 (k <: B.buffer uint8)) in\n let ek = B.malloc r 0uy (concrete_xkey_len i) in\n vale_expand i k ek;\n let h1 = ST.get () in\n B.modifies_only_not_unused_in B.loc_none h0 h1;\n let iv' = B.malloc r 0uy 16ul in\n B.blit iv 0ul iv' 0ul iv_len;\n let h2 = ST.get () in\n B.modifies_only_not_unused_in B.loc_none h0 h2;\n let p = B.malloc r (State (vale_impl_of_alg a) g_iv iv' iv_len g_key ek c) 1ul in\n let h3 = ST.get () in\n B.modifies_only_not_unused_in B.loc_none h0 h3;\n assert (B.fresh_loc (footprint h3 p) h0 h3);\n dst *= p;\n let h4 = ST.get () in\n B.modifies_only_not_unused_in B.(loc_buffer dst) h0 h4;\n Success\n else UnsupportedAlgorithm", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.p7", "original_source_type": "", "source_type": "val p7 : LowParse.Spec.Base.parser (LowParse.Spec.Combinators.and_then_kind LowParse.Spec.Int.parse_u32_kind\n (LowParse.Spec.BoundedInt.parse_bounded_integer_kind 3))\n (FStar.UInt32.t * LowParse.Spec.BoundedInt.bounded_integer 3)", "source_definition": "let p7 = parse_u32 `nondep_then` parse_bounded_integer 3", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 149, "start_col": 9, "end_line": 149, "end_col": 56 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser (LowParse.Spec.Combinators.and_then_kind LowParse.Spec.Int.parse_u32_kind\n (LowParse.Spec.BoundedInt.parse_bounded_integer_kind 3))\n (FStar.UInt32.t * LowParse.Spec.BoundedInt.bounded_integer 3)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Int.parse_u32_kind", "FStar.UInt32.t", "LowParse.Spec.Int.parse_u32", "LowParse.Spec.BoundedInt.parse_bounded_integer_kind", "LowParse.Spec.BoundedInt.bounded_integer", "LowParse.Spec.BoundedInt.parse_bounded_integer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let p7 =", "completed_definiton": "parse_u32 `nondep_then` (parse_bounded_integer 3)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.filter_u30", "original_source_type": "val filter_u30 (y: U62.t) : Tot bool", "source_type": "val filter_u30 (y: U62.t) : Tot bool", "source_definition": "let filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 105, "start_col": 2, "end_line": 105, "end_col": 21 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "y: QUIC.UInt62.t -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.UInt62.t", "FStar.UInt64.lte", "FStar.UInt64.__uint_to_t", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val filter_u30 (y: U62.t) : Tot bool\nlet filter_u30 (y: U62.t) : Tot bool =", "completed_definiton": "16384uL `U64.lte` y", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.parse_varint_payload_kind", "original_source_type": "", "source_type": "val parse_varint_payload_kind : LowParse.Spec.Base.parser_kind'", "source_definition": "let parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 11, "start_col": 2, "end_line": 14, "end_col": 30 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind'", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.Mkparser_kind'", "FStar.Pervasives.Native.Some", "Prims.nat", "LowParse.Spec.Base.parser_subkind", "LowParse.Spec.Base.ParserStrong", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let parse_varint_payload_kind =", "completed_definiton": "{\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None\n}", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.filter_u62", "original_source_type": "val filter_u62 (y: U62.t) : Tot bool", "source_type": "val filter_u62 (y: U62.t) : Tot bool", "source_definition": "let filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 111, "start_col": 2, "end_line": 111, "end_col": 26 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "y: QUIC.UInt62.t -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.UInt62.t", "FStar.UInt64.lte", "FStar.UInt64.__uint_to_t", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val filter_u62 (y: U62.t) : Tot bool\nlet filter_u62 (y: U62.t) : Tot bool =", "completed_definiton": "1073741824uL `U64.lte` y", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.varint_msb_t", "original_source_type": "", "source_type": "val varint_msb_t : Type0", "source_definition": "let varint_msb_t = (x: U64.t { U64.v x < 64 })", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 25, "start_col": 19, "end_line": 25, "end_col": 46 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt64.t", "Prims.b2t", "Prims.op_LessThan", "FStar.UInt64.v" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let varint_msb_t =", "completed_definiton": "(x: U64.t{U64.v x < 64})", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.filter_u14", "original_source_type": "val filter_u14 (y: U62.t) : Tot bool", "source_type": "val filter_u14 (y: U62.t) : Tot bool", "source_definition": "let filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 99, "start_col": 2, "end_line": 99, "end_col": 18 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "y: QUIC.UInt62.t -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.UInt62.t", "FStar.UInt64.lte", "FStar.UInt64.__uint_to_t", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val filter_u14 (y: U62.t) : Tot bool\nlet filter_u14 (y: U62.t) : Tot bool =", "completed_definiton": "64uL `U64.lte` y", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.varint_in_bounds", "original_source_type": "val varint_in_bounds (min: nat) (max: nat{min <= max /\\ max < 4294967296}) (x: U62.t) : GTot bool", "source_type": "val varint_in_bounds (min: nat) (max: nat{min <= max /\\ max < 4294967296}) (x: U62.t) : GTot bool", "source_definition": "let varint_in_bounds\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: U62.t)\n: GTot bool\n= min <= U64.v x && U64.v x <= max", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 529, "start_col": 2, "end_line": 529, "end_col": 34 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b\n\nlet parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))\n= \n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b;\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) (id_u30) b\n\nlet parse_varint_payload_62_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\\n U64.v msb == U64.v v / (72057594037927936)\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq (p7) (synth_u62 msb) b;\n parse_filter_eq ((p7) `parse_synth` synth_u62 msb) filter_u62 b;\n parse_synth_eq (((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) (id_u62) b;\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n let Some (lsb, _) = parse (p7) b in\n synth_u62_msb msb lsb\n\nlet parse_varint_payload\n (x: U8.t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let kd = uint8.get_bitfield x 6 8 in\n let msb : varint_msb_t = Cast.uint8_to_uint64 (uint8.get_bitfield x 0 6) in\n if kd = 0uy\n then weaken parse_varint_payload_kind (parse_ret msb)\n else if kd = 1uy\n then parse_varint_payload_u14 msb\n else if kd = 2uy\n then parse_varint_payload_u30 msb\n else parse_varint_payload_u62 msb\n\nmodule BF = LowParse.BitFields\n\nlet parse_varint_payload_interval\n (tag: U8.t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\ (\n if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936\n )))\n=\n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n assert (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy);\n let msb8 = uint8.get_bitfield tag 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n if kd = 0uy\n then begin\n assert (U64.v v < 64);\n assert (U8.v msb8 == U64.v v)\n end\n else if kd = 1uy\n then begin\n parse_varint_payload_14_interval msb b\n end else if kd = 2uy\n then\n parse_varint_payload_30_interval msb b\n else\n parse_varint_payload_62_interval msb b\n\n#pop-options\n\nlet parse_varint_payload_and_then_cases_injective : squash (and_then_cases_injective parse_varint_payload) =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n and_then_cases_injective_intro parse_varint_payload (fun x1 x2 b1 b2 ->\n let msb1 = Cast.uint8_to_uint64 (uint8.get_bitfield x1 0 6) in\n let msb2 = Cast.uint8_to_uint64 (uint8.get_bitfield x2 0 6) in\n parse_varint_payload_interval x1 b1;\n parse_varint_payload_interval x2 b2;\n assert (uint8.v (uint8.get_bitfield x1 6 8) == uint8.v (uint8.get_bitfield x2 6 8));\n assert (uint8.v (uint8.get_bitfield x1 0 6) == uint8.v (uint8.get_bitfield x2 0 6));\n BF.get_bitfield_partition_2 6 (U8.v x1) (U8.v x2)\n )\n\nlet parse_varint =\n parse_u8 `and_then` parse_varint_payload\n\nlet parse_varint_eq_aux\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == (match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let b' = Seq.slice b consumed (Seq.length b) in\n match parse (parse_varint_payload hd) b' with\n | None -> None\n | Some (res, consumed') -> Some (res, consumed + consumed')\n ))\n= assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n and_then_eq parse_u8 parse_varint_payload b\n\n#push-options \"--z3rlimit 128\"\n\nlet parse_varint'\n (b: bytes)\n: GTot (option (U62.t & consumed_length b))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (uint8.get_bitfield hd 0 6) in\n let b' = Seq.slice b consumed (Seq.length b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match parse parse_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n else if tag = 2uy\n then begin match parse (parse_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end else begin match parse (parse_u32 `nondep_then` parse_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n\nlet parse_varint_eq\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == parse_varint' b)\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n parse_varint_eq_aux b;\n match parse parse_u8 b with\n | None -> ()\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb8 = uint8.get_bitfield hd 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n let b' = Seq.slice b consumed (Seq.length b) in\n assert (tag == 0uy \\/ tag == 1uy \\/ tag == 2uy \\/ tag == 3uy);\n if tag = 0uy\n then ()\n else if tag = 1uy\n then begin\n parse_synth_eq parse_u8 (synth_u14 msb) b';\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b';\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b'\n end else if tag = 2uy\n then begin\n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b';\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b';\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) id_u30 b'\n end else begin\n parse_synth_eq (p7) (synth_u62 msb) b';\n parse_filter_eq (p7 `parse_synth` (synth_u62 msb)) filter_u62 b';\n parse_synth_eq ((p7 `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) id_u62 b'\n end\n\n#pop-options\n\ninline_for_extraction\nlet get_tag\n (x: U62.t)\n: Tot (bitfield uint8 2)\n= if x `U64.lt` 64uL\n then 0uy\n else if x `U64.lt` 16384uL\n then 1uy\n else if x `U64.lt` 1073741824uL\n then 2uy\n else 3uy\n\ninline_for_extraction\nlet get_msb\n (x: U62.t)\n: Tot varint_msb_t\n= if x `U64.lt` 64uL\n then x\n else if x `U64.lt` 16384uL\n then (x `U64.div` 256uL)\n else if x `U64.lt` 1073741824uL\n then (x `U64.div` 16777216uL)\n else (x `U64.div` 72057594037927936uL)\n\ninline_for_extraction\nlet get_first_byte\n (x: U62.t)\n: Tot U8.t\n= uint8.set_bitfield (uint8.set_bitfield 0uy 0 6 (Cast.uint64_to_uint8 (get_msb x))) 6 8 (get_tag x)\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_varint_payload\n (x: U62.t)\n: GTot bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then Seq.empty\n else if x `U64.lt` 16384uL\n then serialize serialize_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then serialize (serialize_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else serialize (serialize_u32 `serialize_nondep_then` serialize_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\nlet serialize_varint'\n (x: U62.t)\n: GTot bytes\n= serialize serialize_u8 (get_first_byte x) `Seq.append` serialize_varint_payload x\n\n#pop-options\n\n#push-options \"--z3rlimit 1024 --using_facts_from '*,-FStar.Bytes,-FStar.String,-FStar.Char'\"\n\nlet serialize_varint_correct\n (x: U62.t)\n: Lemma\n (let y = serialize_varint' x in\n parse_varint' y == Some (x, Seq.length y)\n )\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n let y = serialize_varint' x in\n let z = get_first_byte x in\n let hd = serialize serialize_u8 z in\n assert (parse parse_u8 hd == Some (z, Seq.length hd));\n assert (Seq.slice hd 0 (Seq.length hd) `Seq.equal` Seq.slice y 0 (Seq.length hd));\n let tl = serialize_varint_payload x in\n assert (Seq.slice y (Seq.length hd) (Seq.length y) `Seq.equal` tl);\n parse_strong_prefix parse_u8 hd y;\n let tg = get_tag x in\n assert (uint8.get_bitfield z 6 8 == tg);\n if tg = 0uy\n then begin\n assert (x `U64.lt` 64uL);\n assert (U64.v x == U8.v (uint8.get_bitfield z 0 6));\n assert (x == Cast.uint8_to_uint64 (uint8.get_bitfield z 0 6));\n assert (y `Seq.equal` hd)\n end else if tg = 1uy\n then begin\n assert (64uL `U64.lte` x /\\ x `U64.lt` 16384uL);\n let x' = Cast.uint64_to_uint8 x in\n assert (parse parse_u8 tl == Some (x', Seq.length tl));\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 256);\n assert (U64.v x == (U8.v (uint8.get_bitfield z 0 6) `Prims.op_Multiply` 256) + U8.v x')\n end else if tg = 2uy\n then begin\n assert (16384uL `U64.lte` x /\\ x `U64.lt` 1073741824uL);\n let x' : bounded_integer 3 = Cast.uint64_to_uint32 (x `U64.rem` 16777216uL) in\n assert (parse (parse_bounded_integer 3) tl == Some (x', Seq.length tl));\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 16777216);\n assert (U64.v x == (U8.v (uint8.get_bitfield z 0 6) `Prims.op_Multiply` 16777216) + U32.v x')\n end else begin\n assert (1073741824uL `U64.lte` x);\n let lo : bounded_integer 3 = Cast.uint64_to_uint32 (x `U64.rem` 16777216uL) in\n let hi = Cast.uint64_to_uint32 (x `U64.div` 16777216uL) in\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 72057594037927936);\n assert (U64.v x == U32.v lo + (16777216 `Prims.op_Multiply` (U32.v hi + (4294967296 `Prims.op_Multiply` U8.v (uint8.get_bitfield z 0 6)))))\n end\n\n#pop-options\n\nlet serialize_varint =\n Classical.forall_intro parse_varint_eq;\n Classical.forall_intro serialize_varint_correct;\n serialize_varint'\n\nlet varint_in_bounds\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: U62.t)", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "min: Prims.nat -> max: Prims.nat{min <= max /\\ max < 4294967296} -> x: QUIC.UInt62.t\n -> Prims.GTot Prims.bool", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "QUIC.UInt62.t", "Prims.op_AmpAmp", "FStar.UInt64.v", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val varint_in_bounds (min: nat) (max: nat{min <= max /\\ max < 4294967296}) (x: U62.t) : GTot bool\nlet varint_in_bounds (min: nat) (max: nat{min <= max /\\ max < 4294967296}) (x: U62.t) : GTot bool =", "completed_definiton": "min <= U64.v x && U64.v x <= max", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.serialize_varint'", "original_source_type": "val serialize_varint' (x: U62.t) : GTot bytes", "source_type": "val serialize_varint' (x: U62.t) : GTot bytes", "source_definition": "let serialize_varint'\n (x: U62.t)\n: GTot bytes\n= serialize serialize_u8 (get_first_byte x) `Seq.append` serialize_varint_payload x", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 461, "start_col": 2, "end_line": 461, "end_col": 83 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b\n\nlet parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))\n= \n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b;\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) (id_u30) b\n\nlet parse_varint_payload_62_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\\n U64.v msb == U64.v v / (72057594037927936)\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq (p7) (synth_u62 msb) b;\n parse_filter_eq ((p7) `parse_synth` synth_u62 msb) filter_u62 b;\n parse_synth_eq (((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) (id_u62) b;\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n let Some (lsb, _) = parse (p7) b in\n synth_u62_msb msb lsb\n\nlet parse_varint_payload\n (x: U8.t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let kd = uint8.get_bitfield x 6 8 in\n let msb : varint_msb_t = Cast.uint8_to_uint64 (uint8.get_bitfield x 0 6) in\n if kd = 0uy\n then weaken parse_varint_payload_kind (parse_ret msb)\n else if kd = 1uy\n then parse_varint_payload_u14 msb\n else if kd = 2uy\n then parse_varint_payload_u30 msb\n else parse_varint_payload_u62 msb\n\nmodule BF = LowParse.BitFields\n\nlet parse_varint_payload_interval\n (tag: U8.t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\ (\n if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936\n )))\n=\n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n assert (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy);\n let msb8 = uint8.get_bitfield tag 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n if kd = 0uy\n then begin\n assert (U64.v v < 64);\n assert (U8.v msb8 == U64.v v)\n end\n else if kd = 1uy\n then begin\n parse_varint_payload_14_interval msb b\n end else if kd = 2uy\n then\n parse_varint_payload_30_interval msb b\n else\n parse_varint_payload_62_interval msb b\n\n#pop-options\n\nlet parse_varint_payload_and_then_cases_injective : squash (and_then_cases_injective parse_varint_payload) =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n and_then_cases_injective_intro parse_varint_payload (fun x1 x2 b1 b2 ->\n let msb1 = Cast.uint8_to_uint64 (uint8.get_bitfield x1 0 6) in\n let msb2 = Cast.uint8_to_uint64 (uint8.get_bitfield x2 0 6) in\n parse_varint_payload_interval x1 b1;\n parse_varint_payload_interval x2 b2;\n assert (uint8.v (uint8.get_bitfield x1 6 8) == uint8.v (uint8.get_bitfield x2 6 8));\n assert (uint8.v (uint8.get_bitfield x1 0 6) == uint8.v (uint8.get_bitfield x2 0 6));\n BF.get_bitfield_partition_2 6 (U8.v x1) (U8.v x2)\n )\n\nlet parse_varint =\n parse_u8 `and_then` parse_varint_payload\n\nlet parse_varint_eq_aux\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == (match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let b' = Seq.slice b consumed (Seq.length b) in\n match parse (parse_varint_payload hd) b' with\n | None -> None\n | Some (res, consumed') -> Some (res, consumed + consumed')\n ))\n= assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n and_then_eq parse_u8 parse_varint_payload b\n\n#push-options \"--z3rlimit 128\"\n\nlet parse_varint'\n (b: bytes)\n: GTot (option (U62.t & consumed_length b))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (uint8.get_bitfield hd 0 6) in\n let b' = Seq.slice b consumed (Seq.length b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match parse parse_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n else if tag = 2uy\n then begin match parse (parse_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end else begin match parse (parse_u32 `nondep_then` parse_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n\nlet parse_varint_eq\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == parse_varint' b)\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n parse_varint_eq_aux b;\n match parse parse_u8 b with\n | None -> ()\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb8 = uint8.get_bitfield hd 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n let b' = Seq.slice b consumed (Seq.length b) in\n assert (tag == 0uy \\/ tag == 1uy \\/ tag == 2uy \\/ tag == 3uy);\n if tag = 0uy\n then ()\n else if tag = 1uy\n then begin\n parse_synth_eq parse_u8 (synth_u14 msb) b';\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b';\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b'\n end else if tag = 2uy\n then begin\n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b';\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b';\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) id_u30 b'\n end else begin\n parse_synth_eq (p7) (synth_u62 msb) b';\n parse_filter_eq (p7 `parse_synth` (synth_u62 msb)) filter_u62 b';\n parse_synth_eq ((p7 `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) id_u62 b'\n end\n\n#pop-options\n\ninline_for_extraction\nlet get_tag\n (x: U62.t)\n: Tot (bitfield uint8 2)\n= if x `U64.lt` 64uL\n then 0uy\n else if x `U64.lt` 16384uL\n then 1uy\n else if x `U64.lt` 1073741824uL\n then 2uy\n else 3uy\n\ninline_for_extraction\nlet get_msb\n (x: U62.t)\n: Tot varint_msb_t\n= if x `U64.lt` 64uL\n then x\n else if x `U64.lt` 16384uL\n then (x `U64.div` 256uL)\n else if x `U64.lt` 1073741824uL\n then (x `U64.div` 16777216uL)\n else (x `U64.div` 72057594037927936uL)\n\ninline_for_extraction\nlet get_first_byte\n (x: U62.t)\n: Tot U8.t\n= uint8.set_bitfield (uint8.set_bitfield 0uy 0 6 (Cast.uint64_to_uint8 (get_msb x))) 6 8 (get_tag x)\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_varint_payload\n (x: U62.t)\n: GTot bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then Seq.empty\n else if x `U64.lt` 16384uL\n then serialize serialize_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then serialize (serialize_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else serialize (serialize_u32 `serialize_nondep_then` serialize_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\nlet serialize_varint'\n (x: U62.t)", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: QUIC.UInt62.t -> Prims.GTot LowParse.Bytes.bytes", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.UInt62.t", "FStar.Seq.Base.append", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "LowParse.Spec.Int.parse_u8_kind", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "QUIC.Spec.VarInt.get_first_byte", "QUIC.Spec.VarInt.serialize_varint_payload", "LowParse.Bytes.bytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_varint' (x: U62.t) : GTot bytes\nlet serialize_varint' (x: U62.t) : GTot bytes =", "completed_definiton": "(serialize serialize_u8 (get_first_byte x)) `Seq.append` (serialize_varint_payload x)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.id_u14", "original_source_type": "val id_u14 (y: parse_filter_refine filter_u14) : Tot U62.t", "source_type": "val id_u14 (y: parse_filter_refine filter_u14) : Tot U62.t", "source_definition": "let id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 117, "start_col": 2, "end_line": 117, "end_col": 3 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "y: LowParse.Spec.Combinators.parse_filter_refine QUIC.Spec.VarInt.filter_u14 -> QUIC.UInt62.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.UInt62.t", "QUIC.Spec.VarInt.filter_u14" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val id_u14 (y: parse_filter_refine filter_u14) : Tot U62.t\nlet id_u14 (y: parse_filter_refine filter_u14) : Tot U62.t =", "completed_definiton": "y", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.id_u30", "original_source_type": "val id_u30 (y: parse_filter_refine filter_u30) : Tot U62.t", "source_type": "val id_u30 (y: parse_filter_refine filter_u30) : Tot U62.t", "source_definition": "let id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 132, "start_col": 2, "end_line": 132, "end_col": 3 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "y: LowParse.Spec.Combinators.parse_filter_refine QUIC.Spec.VarInt.filter_u30 -> QUIC.UInt62.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.UInt62.t", "QUIC.Spec.VarInt.filter_u30" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val id_u30 (y: parse_filter_refine filter_u30) : Tot U62.t\nlet id_u30 (y: parse_filter_refine filter_u30) : Tot U62.t =", "completed_definiton": "y", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.id_u62", "original_source_type": "val id_u62 (y: parse_filter_refine filter_u62) : Tot U62.t", "source_type": "val id_u62 (y: parse_filter_refine filter_u62) : Tot U62.t", "source_definition": "let id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 147, "start_col": 2, "end_line": 147, "end_col": 3 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "y: LowParse.Spec.Combinators.parse_filter_refine QUIC.Spec.VarInt.filter_u62 -> QUIC.UInt62.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.UInt62.t", "QUIC.Spec.VarInt.filter_u62" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val id_u62 (y: parse_filter_refine filter_u62) : Tot U62.t\nlet id_u62 (y: parse_filter_refine filter_u62) : Tot U62.t =", "completed_definiton": "y", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.parse_varint_payload_and_then_cases_injective", "original_source_type": "val parse_varint_payload_and_then_cases_injective:squash (and_then_cases_injective parse_varint_payload\n )", "source_type": "val parse_varint_payload_and_then_cases_injective:squash (and_then_cases_injective parse_varint_payload\n )", "source_definition": "let parse_varint_payload_and_then_cases_injective : squash (and_then_cases_injective parse_varint_payload) =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n and_then_cases_injective_intro parse_varint_payload (fun x1 x2 b1 b2 ->\n let msb1 = Cast.uint8_to_uint64 (uint8.get_bitfield x1 0 6) in\n let msb2 = Cast.uint8_to_uint64 (uint8.get_bitfield x2 0 6) in\n parse_varint_payload_interval x1 b1;\n parse_varint_payload_interval x2 b2;\n assert (uint8.v (uint8.get_bitfield x1 6 8) == uint8.v (uint8.get_bitfield x2 6 8));\n assert (uint8.v (uint8.get_bitfield x1 0 6) == uint8.v (uint8.get_bitfield x2 0 6));\n BF.get_bitfield_partition_2 6 (U8.v x1) (U8.v x2)\n )", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 286, "start_col": 2, "end_line": 298, "end_col": 3 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b\n\nlet parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))\n= \n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b;\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) (id_u30) b\n\nlet parse_varint_payload_62_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\\n U64.v msb == U64.v v / (72057594037927936)\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq (p7) (synth_u62 msb) b;\n parse_filter_eq ((p7) `parse_synth` synth_u62 msb) filter_u62 b;\n parse_synth_eq (((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) (id_u62) b;\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n let Some (lsb, _) = parse (p7) b in\n synth_u62_msb msb lsb\n\nlet parse_varint_payload\n (x: U8.t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let kd = uint8.get_bitfield x 6 8 in\n let msb : varint_msb_t = Cast.uint8_to_uint64 (uint8.get_bitfield x 0 6) in\n if kd = 0uy\n then weaken parse_varint_payload_kind (parse_ret msb)\n else if kd = 1uy\n then parse_varint_payload_u14 msb\n else if kd = 2uy\n then parse_varint_payload_u30 msb\n else parse_varint_payload_u62 msb\n\nmodule BF = LowParse.BitFields\n\nlet parse_varint_payload_interval\n (tag: U8.t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\ (\n if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936\n )))\n=\n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n assert (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy);\n let msb8 = uint8.get_bitfield tag 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n if kd = 0uy\n then begin\n assert (U64.v v < 64);\n assert (U8.v msb8 == U64.v v)\n end\n else if kd = 1uy\n then begin\n parse_varint_payload_14_interval msb b\n end else if kd = 2uy\n then\n parse_varint_payload_30_interval msb b\n else\n parse_varint_payload_62_interval msb b\n\n#pop-options", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.squash (LowParse.Spec.Combinators.and_then_cases_injective QUIC.Spec.VarInt.parse_varint_payload\n )", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.and_then_cases_injective_intro", "FStar.UInt8.t", "QUIC.UInt62.t", "QUIC.Spec.VarInt.parse_varint_payload", "LowParse.Bytes.bytes", "LowParse.BitFields.get_bitfield_partition_2", "FStar.UInt8.n", "FStar.UInt8.v", "Prims.unit", "Prims._assert", "Prims.eq2", "FStar.UInt.uint_t", "LowParse.BitFields.__proj__Mkuint_t__item__v", "LowParse.BitFields.uint8", "LowParse.BitFields.__proj__Mkuint_t__item__get_bitfield", "QUIC.Spec.VarInt.parse_varint_payload_interval", "FStar.UInt64.t", "Prims.b2t", "Prims.op_Equality", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt64.v", "FStar.Int.Cast.uint8_to_uint64", "FStar.Pervasives.assert_norm", "Prims.pow2", "Prims.op_GreaterThan", "FStar.UInt64.n", "QUIC.UInt62.bound" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": true, "is_type": null, "partial_definition": "val parse_varint_payload_and_then_cases_injective:squash (and_then_cases_injective parse_varint_payload\n )\nlet parse_varint_payload_and_then_cases_injective:squash (and_then_cases_injective parse_varint_payload\n ) =", "completed_definiton": "assert_norm (pow2 8 == 256);\nassert (pow2 62 == U64.v U62.bound);\nassert_norm (pow2 32 == 4294967296);\nassert_norm (pow2 24 == 16777216);\nand_then_cases_injective_intro parse_varint_payload\n (fun x1 x2 b1 b2 ->\n let msb1 = Cast.uint8_to_uint64 (uint8.get_bitfield x1 0 6) in\n let msb2 = Cast.uint8_to_uint64 (uint8.get_bitfield x2 0 6) in\n parse_varint_payload_interval x1 b1;\n parse_varint_payload_interval x2 b2;\n assert (uint8.v (uint8.get_bitfield x1 6 8) == uint8.v (uint8.get_bitfield x2 6 8));\n assert (uint8.v (uint8.get_bitfield x1 0 6) == uint8.v (uint8.get_bitfield x2 0 6));\n BF.get_bitfield_partition_2 6 (U8.v x1) (U8.v x2))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.serialize_varint", "original_source_type": "val serialize_varint : LP.serializer parse_varint", "source_type": "val serialize_varint : LP.serializer parse_varint", "source_definition": "let serialize_varint =\n Classical.forall_intro parse_varint_eq;\n Classical.forall_intro serialize_varint_correct;\n serialize_varint'", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 520, "start_col": 2, "end_line": 522, "end_col": 19 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b\n\nlet parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))\n= \n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b;\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) (id_u30) b\n\nlet parse_varint_payload_62_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\\n U64.v msb == U64.v v / (72057594037927936)\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq (p7) (synth_u62 msb) b;\n parse_filter_eq ((p7) `parse_synth` synth_u62 msb) filter_u62 b;\n parse_synth_eq (((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) (id_u62) b;\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n let Some (lsb, _) = parse (p7) b in\n synth_u62_msb msb lsb\n\nlet parse_varint_payload\n (x: U8.t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let kd = uint8.get_bitfield x 6 8 in\n let msb : varint_msb_t = Cast.uint8_to_uint64 (uint8.get_bitfield x 0 6) in\n if kd = 0uy\n then weaken parse_varint_payload_kind (parse_ret msb)\n else if kd = 1uy\n then parse_varint_payload_u14 msb\n else if kd = 2uy\n then parse_varint_payload_u30 msb\n else parse_varint_payload_u62 msb\n\nmodule BF = LowParse.BitFields\n\nlet parse_varint_payload_interval\n (tag: U8.t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\ (\n if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936\n )))\n=\n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n assert (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy);\n let msb8 = uint8.get_bitfield tag 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n if kd = 0uy\n then begin\n assert (U64.v v < 64);\n assert (U8.v msb8 == U64.v v)\n end\n else if kd = 1uy\n then begin\n parse_varint_payload_14_interval msb b\n end else if kd = 2uy\n then\n parse_varint_payload_30_interval msb b\n else\n parse_varint_payload_62_interval msb b\n\n#pop-options\n\nlet parse_varint_payload_and_then_cases_injective : squash (and_then_cases_injective parse_varint_payload) =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n and_then_cases_injective_intro parse_varint_payload (fun x1 x2 b1 b2 ->\n let msb1 = Cast.uint8_to_uint64 (uint8.get_bitfield x1 0 6) in\n let msb2 = Cast.uint8_to_uint64 (uint8.get_bitfield x2 0 6) in\n parse_varint_payload_interval x1 b1;\n parse_varint_payload_interval x2 b2;\n assert (uint8.v (uint8.get_bitfield x1 6 8) == uint8.v (uint8.get_bitfield x2 6 8));\n assert (uint8.v (uint8.get_bitfield x1 0 6) == uint8.v (uint8.get_bitfield x2 0 6));\n BF.get_bitfield_partition_2 6 (U8.v x1) (U8.v x2)\n )\n\nlet parse_varint =\n parse_u8 `and_then` parse_varint_payload\n\nlet parse_varint_eq_aux\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == (match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let b' = Seq.slice b consumed (Seq.length b) in\n match parse (parse_varint_payload hd) b' with\n | None -> None\n | Some (res, consumed') -> Some (res, consumed + consumed')\n ))\n= assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n and_then_eq parse_u8 parse_varint_payload b\n\n#push-options \"--z3rlimit 128\"\n\nlet parse_varint'\n (b: bytes)\n: GTot (option (U62.t & consumed_length b))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (uint8.get_bitfield hd 0 6) in\n let b' = Seq.slice b consumed (Seq.length b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match parse parse_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n else if tag = 2uy\n then begin match parse (parse_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end else begin match parse (parse_u32 `nondep_then` parse_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n\nlet parse_varint_eq\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == parse_varint' b)\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n parse_varint_eq_aux b;\n match parse parse_u8 b with\n | None -> ()\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb8 = uint8.get_bitfield hd 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n let b' = Seq.slice b consumed (Seq.length b) in\n assert (tag == 0uy \\/ tag == 1uy \\/ tag == 2uy \\/ tag == 3uy);\n if tag = 0uy\n then ()\n else if tag = 1uy\n then begin\n parse_synth_eq parse_u8 (synth_u14 msb) b';\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b';\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b'\n end else if tag = 2uy\n then begin\n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b';\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b';\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) id_u30 b'\n end else begin\n parse_synth_eq (p7) (synth_u62 msb) b';\n parse_filter_eq (p7 `parse_synth` (synth_u62 msb)) filter_u62 b';\n parse_synth_eq ((p7 `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) id_u62 b'\n end\n\n#pop-options\n\ninline_for_extraction\nlet get_tag\n (x: U62.t)\n: Tot (bitfield uint8 2)\n= if x `U64.lt` 64uL\n then 0uy\n else if x `U64.lt` 16384uL\n then 1uy\n else if x `U64.lt` 1073741824uL\n then 2uy\n else 3uy\n\ninline_for_extraction\nlet get_msb\n (x: U62.t)\n: Tot varint_msb_t\n= if x `U64.lt` 64uL\n then x\n else if x `U64.lt` 16384uL\n then (x `U64.div` 256uL)\n else if x `U64.lt` 1073741824uL\n then (x `U64.div` 16777216uL)\n else (x `U64.div` 72057594037927936uL)\n\ninline_for_extraction\nlet get_first_byte\n (x: U62.t)\n: Tot U8.t\n= uint8.set_bitfield (uint8.set_bitfield 0uy 0 6 (Cast.uint64_to_uint8 (get_msb x))) 6 8 (get_tag x)\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_varint_payload\n (x: U62.t)\n: GTot bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then Seq.empty\n else if x `U64.lt` 16384uL\n then serialize serialize_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then serialize (serialize_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else serialize (serialize_u32 `serialize_nondep_then` serialize_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\nlet serialize_varint'\n (x: U62.t)\n: GTot bytes\n= serialize serialize_u8 (get_first_byte x) `Seq.append` serialize_varint_payload x\n\n#pop-options\n\n#push-options \"--z3rlimit 1024 --using_facts_from '*,-FStar.Bytes,-FStar.String,-FStar.Char'\"\n\nlet serialize_varint_correct\n (x: U62.t)\n: Lemma\n (let y = serialize_varint' x in\n parse_varint' y == Some (x, Seq.length y)\n )\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n let y = serialize_varint' x in\n let z = get_first_byte x in\n let hd = serialize serialize_u8 z in\n assert (parse parse_u8 hd == Some (z, Seq.length hd));\n assert (Seq.slice hd 0 (Seq.length hd) `Seq.equal` Seq.slice y 0 (Seq.length hd));\n let tl = serialize_varint_payload x in\n assert (Seq.slice y (Seq.length hd) (Seq.length y) `Seq.equal` tl);\n parse_strong_prefix parse_u8 hd y;\n let tg = get_tag x in\n assert (uint8.get_bitfield z 6 8 == tg);\n if tg = 0uy\n then begin\n assert (x `U64.lt` 64uL);\n assert (U64.v x == U8.v (uint8.get_bitfield z 0 6));\n assert (x == Cast.uint8_to_uint64 (uint8.get_bitfield z 0 6));\n assert (y `Seq.equal` hd)\n end else if tg = 1uy\n then begin\n assert (64uL `U64.lte` x /\\ x `U64.lt` 16384uL);\n let x' = Cast.uint64_to_uint8 x in\n assert (parse parse_u8 tl == Some (x', Seq.length tl));\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 256);\n assert (U64.v x == (U8.v (uint8.get_bitfield z 0 6) `Prims.op_Multiply` 256) + U8.v x')\n end else if tg = 2uy\n then begin\n assert (16384uL `U64.lte` x /\\ x `U64.lt` 1073741824uL);\n let x' : bounded_integer 3 = Cast.uint64_to_uint32 (x `U64.rem` 16777216uL) in\n assert (parse (parse_bounded_integer 3) tl == Some (x', Seq.length tl));\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 16777216);\n assert (U64.v x == (U8.v (uint8.get_bitfield z 0 6) `Prims.op_Multiply` 16777216) + U32.v x')\n end else begin\n assert (1073741824uL `U64.lte` x);\n let lo : bounded_integer 3 = Cast.uint64_to_uint32 (x `U64.rem` 16777216uL) in\n let hi = Cast.uint64_to_uint32 (x `U64.div` 16777216uL) in\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 72057594037927936);\n assert (U64.v x == U32.v lo + (16777216 `Prims.op_Multiply` (U32.v hi + (4294967296 `Prims.op_Multiply` U8.v (uint8.get_bitfield z 0 6)))))\n end\n\n#pop-options", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer QUIC.Spec.VarInt.parse_varint", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.VarInt.serialize_varint'", "Prims.unit", "FStar.Classical.forall_intro", "QUIC.UInt62.t", "Prims.eq2", "FStar.Pervasives.Native.option", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Base.consumed_length", "QUIC.Spec.VarInt.parse_varint'", "FStar.Pervasives.Native.Some", "FStar.Pervasives.Native.Mktuple2", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "QUIC.Spec.VarInt.serialize_varint_correct", "LowParse.Bytes.bytes", "Prims.l_and", "Prims.int", "Prims.pow2", "Prims.l_or", "Prims.b2t", "Prims.op_GreaterThan", "FStar.UInt.size", "FStar.UInt64.n", "FStar.UInt64.v", "QUIC.UInt62.bound", "LowParse.Spec.Base.parse", "QUIC.Spec.VarInt.parse_varint", "QUIC.Spec.VarInt.parse_varint_eq" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val serialize_varint : LP.serializer parse_varint\nlet serialize_varint =", "completed_definiton": "Classical.forall_intro parse_varint_eq;\nClassical.forall_intro serialize_varint_correct;\nserialize_varint'", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.parse_varint_payload_u14", "original_source_type": "val parse_varint_payload_u14 (msb: varint_msb_t) : Tot (parser parse_varint_payload_kind U62.t)", "source_type": "val parse_varint_payload_u14 (msb: varint_msb_t) : Tot (parser parse_varint_payload_kind U62.t)", "source_definition": "let parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 123, "start_col": 2, "end_line": 126, "end_col": 25 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "msb: QUIC.Spec.VarInt.varint_msb_t\n -> LowParse.Spec.Base.parser QUIC.Spec.VarInt.parse_varint_payload_kind QUIC.UInt62.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.VarInt.varint_msb_t", "LowParse.Spec.Base.weaken", "QUIC.Spec.VarInt.parse_varint_payload_kind", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "QUIC.UInt62.t", "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.Spec.VarInt.filter_u14", "LowParse.Spec.Combinators.parse_filter", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "QUIC.Spec.VarInt.synth_u14", "QUIC.Spec.VarInt.id_u14", "LowParse.Spec.Base.parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val parse_varint_payload_u14 (msb: varint_msb_t) : Tot (parser parse_varint_payload_kind U62.t)\nlet parse_varint_payload_u14 (msb: varint_msb_t) : Tot (parser parse_varint_payload_kind U62.t) =", "completed_definiton": "weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) `parse_synth` id_u14)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.get_msb", "original_source_type": "val get_msb (x: U62.t) : Tot varint_msb_t", "source_type": "val get_msb (x: U62.t) : Tot varint_msb_t", "source_definition": "let get_msb\n (x: U62.t)\n: Tot varint_msb_t\n= if x `U64.lt` 64uL\n then x\n else if x `U64.lt` 16384uL\n then (x `U64.div` 256uL)\n else if x `U64.lt` 1073741824uL\n then (x `U64.div` 16777216uL)\n else (x `U64.div` 72057594037927936uL)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 425, "start_col": 2, "end_line": 431, "end_col": 40 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b\n\nlet parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))\n= \n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b;\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) (id_u30) b\n\nlet parse_varint_payload_62_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\\n U64.v msb == U64.v v / (72057594037927936)\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq (p7) (synth_u62 msb) b;\n parse_filter_eq ((p7) `parse_synth` synth_u62 msb) filter_u62 b;\n parse_synth_eq (((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) (id_u62) b;\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n let Some (lsb, _) = parse (p7) b in\n synth_u62_msb msb lsb\n\nlet parse_varint_payload\n (x: U8.t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let kd = uint8.get_bitfield x 6 8 in\n let msb : varint_msb_t = Cast.uint8_to_uint64 (uint8.get_bitfield x 0 6) in\n if kd = 0uy\n then weaken parse_varint_payload_kind (parse_ret msb)\n else if kd = 1uy\n then parse_varint_payload_u14 msb\n else if kd = 2uy\n then parse_varint_payload_u30 msb\n else parse_varint_payload_u62 msb\n\nmodule BF = LowParse.BitFields\n\nlet parse_varint_payload_interval\n (tag: U8.t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\ (\n if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936\n )))\n=\n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n assert (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy);\n let msb8 = uint8.get_bitfield tag 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n if kd = 0uy\n then begin\n assert (U64.v v < 64);\n assert (U8.v msb8 == U64.v v)\n end\n else if kd = 1uy\n then begin\n parse_varint_payload_14_interval msb b\n end else if kd = 2uy\n then\n parse_varint_payload_30_interval msb b\n else\n parse_varint_payload_62_interval msb b\n\n#pop-options\n\nlet parse_varint_payload_and_then_cases_injective : squash (and_then_cases_injective parse_varint_payload) =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n and_then_cases_injective_intro parse_varint_payload (fun x1 x2 b1 b2 ->\n let msb1 = Cast.uint8_to_uint64 (uint8.get_bitfield x1 0 6) in\n let msb2 = Cast.uint8_to_uint64 (uint8.get_bitfield x2 0 6) in\n parse_varint_payload_interval x1 b1;\n parse_varint_payload_interval x2 b2;\n assert (uint8.v (uint8.get_bitfield x1 6 8) == uint8.v (uint8.get_bitfield x2 6 8));\n assert (uint8.v (uint8.get_bitfield x1 0 6) == uint8.v (uint8.get_bitfield x2 0 6));\n BF.get_bitfield_partition_2 6 (U8.v x1) (U8.v x2)\n )\n\nlet parse_varint =\n parse_u8 `and_then` parse_varint_payload\n\nlet parse_varint_eq_aux\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == (match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let b' = Seq.slice b consumed (Seq.length b) in\n match parse (parse_varint_payload hd) b' with\n | None -> None\n | Some (res, consumed') -> Some (res, consumed + consumed')\n ))\n= assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n and_then_eq parse_u8 parse_varint_payload b\n\n#push-options \"--z3rlimit 128\"\n\nlet parse_varint'\n (b: bytes)\n: GTot (option (U62.t & consumed_length b))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (uint8.get_bitfield hd 0 6) in\n let b' = Seq.slice b consumed (Seq.length b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match parse parse_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n else if tag = 2uy\n then begin match parse (parse_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end else begin match parse (parse_u32 `nondep_then` parse_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n\nlet parse_varint_eq\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == parse_varint' b)\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n parse_varint_eq_aux b;\n match parse parse_u8 b with\n | None -> ()\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb8 = uint8.get_bitfield hd 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n let b' = Seq.slice b consumed (Seq.length b) in\n assert (tag == 0uy \\/ tag == 1uy \\/ tag == 2uy \\/ tag == 3uy);\n if tag = 0uy\n then ()\n else if tag = 1uy\n then begin\n parse_synth_eq parse_u8 (synth_u14 msb) b';\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b';\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b'\n end else if tag = 2uy\n then begin\n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b';\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b';\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) id_u30 b'\n end else begin\n parse_synth_eq (p7) (synth_u62 msb) b';\n parse_filter_eq (p7 `parse_synth` (synth_u62 msb)) filter_u62 b';\n parse_synth_eq ((p7 `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) id_u62 b'\n end\n\n#pop-options\n\ninline_for_extraction\nlet get_tag\n (x: U62.t)\n: Tot (bitfield uint8 2)\n= if x `U64.lt` 64uL\n then 0uy\n else if x `U64.lt` 16384uL\n then 1uy\n else if x `U64.lt` 1073741824uL\n then 2uy\n else 3uy\n\ninline_for_extraction\nlet get_msb\n (x: U62.t)", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: QUIC.UInt62.t -> QUIC.Spec.VarInt.varint_msb_t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.UInt62.t", "FStar.UInt64.lt", "FStar.UInt64.__uint_to_t", "Prims.bool", "FStar.UInt64.div", "QUIC.Spec.VarInt.varint_msb_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val get_msb (x: U62.t) : Tot varint_msb_t\nlet get_msb (x: U62.t) : Tot varint_msb_t =", "completed_definiton": "if x `U64.lt` 64uL\nthen x\nelse\n if x `U64.lt` 16384uL\n then (x `U64.div` 256uL)\n else\n if x `U64.lt` 1073741824uL then (x `U64.div` 16777216uL) else (x `U64.div` 72057594037927936uL)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.synth_u14", "original_source_type": "val synth_u14 (msb: varint_msb_t) (lsb: U8.t) : Tot U62.t", "source_type": "val synth_u14 (msb: varint_msb_t) (lsb: U8.t) : Tot U62.t", "source_definition": "let synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 34, "start_col": 2, "end_line": 38, "end_col": 58 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "msb: QUIC.Spec.VarInt.varint_msb_t -> lsb: FStar.UInt8.t -> QUIC.UInt62.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.VarInt.varint_msb_t", "FStar.UInt8.t", "FStar.UInt64.add", "FStar.UInt64.mul", "FStar.UInt64.__uint_to_t", "FStar.Int.Cast.uint8_to_uint64", "Prims.unit", "Prims._assert", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt64.n", "Prims.b2t", "Prims.op_GreaterThan", "Prims.pow2", "FStar.UInt64.v", "QUIC.UInt62.bound", "FStar.Pervasives.assert_norm", "QUIC.UInt62.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val synth_u14 (msb: varint_msb_t) (lsb: U8.t) : Tot U62.t\nlet synth_u14 (msb: varint_msb_t) (lsb: U8.t) : Tot U62.t =", "completed_definiton": "[@@ inline_let ]let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\nin\n(msb `U64.mul` 256uL) `U64.add` (Cast.uint8_to_uint64 lsb)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.parse_varint_payload_u30", "original_source_type": "val parse_varint_payload_u30 (msb: varint_msb_t) : Tot (parser parse_varint_payload_kind U62.t)", "source_type": "val parse_varint_payload_u30 (msb: varint_msb_t) : Tot (parser parse_varint_payload_kind U62.t)", "source_definition": "let parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 138, "start_col": 2, "end_line": 141, "end_col": 25 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "msb: QUIC.Spec.VarInt.varint_msb_t\n -> LowParse.Spec.Base.parser QUIC.Spec.VarInt.parse_varint_payload_kind QUIC.UInt62.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.VarInt.varint_msb_t", "LowParse.Spec.Base.weaken", "QUIC.Spec.VarInt.parse_varint_payload_kind", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.BoundedInt.parse_bounded_integer_kind", "QUIC.UInt62.t", "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.Spec.VarInt.filter_u30", "LowParse.Spec.Combinators.parse_filter", "LowParse.Spec.BoundedInt.bounded_integer", "LowParse.Spec.BoundedInt.parse_bounded_integer", "QUIC.Spec.VarInt.synth_u30", "QUIC.Spec.VarInt.id_u30", "LowParse.Spec.Base.parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val parse_varint_payload_u30 (msb: varint_msb_t) : Tot (parser parse_varint_payload_kind U62.t)\nlet parse_varint_payload_u30 (msb: varint_msb_t) : Tot (parser parse_varint_payload_kind U62.t) =", "completed_definiton": "weaken parse_varint_payload_kind\n ((((parse_bounded_integer 3) `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30)\n `parse_synth`\n id_u30)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.synth_u30", "original_source_type": "val synth_u30 (msb: varint_msb_t) (lsb: bounded_integer 3) : Tot U62.t", "source_type": "val synth_u30 (msb: varint_msb_t) (lsb: bounded_integer 3) : Tot U62.t", "source_definition": "let synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 52, "start_col": 2, "end_line": 57, "end_col": 65 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "msb: QUIC.Spec.VarInt.varint_msb_t -> lsb: LowParse.Spec.BoundedInt.bounded_integer 3\n -> QUIC.UInt62.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.VarInt.varint_msb_t", "LowParse.Spec.BoundedInt.bounded_integer", "FStar.UInt64.add", "FStar.UInt64.mul", "FStar.UInt64.__uint_to_t", "FStar.Int.Cast.uint32_to_uint64", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.int", "Prims.pow2", "Prims._assert", "Prims.l_or", "Prims.b2t", "Prims.op_GreaterThan", "FStar.UInt.size", "FStar.UInt64.n", "FStar.UInt64.v", "QUIC.UInt62.bound", "QUIC.UInt62.t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_u30 (msb: varint_msb_t) (lsb: bounded_integer 3) : Tot U62.t\nlet synth_u30 (msb: varint_msb_t) (lsb: bounded_integer 3) : Tot U62.t =", "completed_definiton": "[@@ inline_let ]let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\nin\n(msb `U64.mul` 16777216uL) `U64.add` (Cast.uint32_to_uint64 lsb)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.parse_varint", "original_source_type": "val parse_varint : LP.parser parse_varint_kind U62.t", "source_type": "val parse_varint : LP.parser parse_varint_kind U62.t", "source_definition": "let parse_varint =\n parse_u8 `and_then` parse_varint_payload", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 301, "start_col": 2, "end_line": 301, "end_col": 42 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b\n\nlet parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))\n= \n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b;\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) (id_u30) b\n\nlet parse_varint_payload_62_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\\n U64.v msb == U64.v v / (72057594037927936)\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq (p7) (synth_u62 msb) b;\n parse_filter_eq ((p7) `parse_synth` synth_u62 msb) filter_u62 b;\n parse_synth_eq (((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) (id_u62) b;\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n let Some (lsb, _) = parse (p7) b in\n synth_u62_msb msb lsb\n\nlet parse_varint_payload\n (x: U8.t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let kd = uint8.get_bitfield x 6 8 in\n let msb : varint_msb_t = Cast.uint8_to_uint64 (uint8.get_bitfield x 0 6) in\n if kd = 0uy\n then weaken parse_varint_payload_kind (parse_ret msb)\n else if kd = 1uy\n then parse_varint_payload_u14 msb\n else if kd = 2uy\n then parse_varint_payload_u30 msb\n else parse_varint_payload_u62 msb\n\nmodule BF = LowParse.BitFields\n\nlet parse_varint_payload_interval\n (tag: U8.t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\ (\n if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936\n )))\n=\n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n assert (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy);\n let msb8 = uint8.get_bitfield tag 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n if kd = 0uy\n then begin\n assert (U64.v v < 64);\n assert (U8.v msb8 == U64.v v)\n end\n else if kd = 1uy\n then begin\n parse_varint_payload_14_interval msb b\n end else if kd = 2uy\n then\n parse_varint_payload_30_interval msb b\n else\n parse_varint_payload_62_interval msb b\n\n#pop-options\n\nlet parse_varint_payload_and_then_cases_injective : squash (and_then_cases_injective parse_varint_payload) =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n and_then_cases_injective_intro parse_varint_payload (fun x1 x2 b1 b2 ->\n let msb1 = Cast.uint8_to_uint64 (uint8.get_bitfield x1 0 6) in\n let msb2 = Cast.uint8_to_uint64 (uint8.get_bitfield x2 0 6) in\n parse_varint_payload_interval x1 b1;\n parse_varint_payload_interval x2 b2;\n assert (uint8.v (uint8.get_bitfield x1 6 8) == uint8.v (uint8.get_bitfield x2 6 8));\n assert (uint8.v (uint8.get_bitfield x1 0 6) == uint8.v (uint8.get_bitfield x2 0 6));\n BF.get_bitfield_partition_2 6 (U8.v x1) (U8.v x2)\n )", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser QUIC.Spec.VarInt.parse_varint_kind QUIC.UInt62.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.and_then", "LowParse.Spec.Int.parse_u8_kind", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "QUIC.Spec.VarInt.parse_varint_payload_kind", "QUIC.UInt62.t", "QUIC.Spec.VarInt.parse_varint_payload" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val parse_varint : LP.parser parse_varint_kind U62.t\nlet parse_varint =", "completed_definiton": "parse_u8 `and_then` parse_varint_payload", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.get_first_byte", "original_source_type": "val get_first_byte (x: U62.t) : Tot U8.t", "source_type": "val get_first_byte (x: U62.t) : Tot U8.t", "source_definition": "let get_first_byte\n (x: U62.t)\n: Tot U8.t\n= uint8.set_bitfield (uint8.set_bitfield 0uy 0 6 (Cast.uint64_to_uint8 (get_msb x))) 6 8 (get_tag x)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 437, "start_col": 2, "end_line": 437, "end_col": 100 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b\n\nlet parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))\n= \n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b;\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) (id_u30) b\n\nlet parse_varint_payload_62_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\\n U64.v msb == U64.v v / (72057594037927936)\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq (p7) (synth_u62 msb) b;\n parse_filter_eq ((p7) `parse_synth` synth_u62 msb) filter_u62 b;\n parse_synth_eq (((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) (id_u62) b;\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n let Some (lsb, _) = parse (p7) b in\n synth_u62_msb msb lsb\n\nlet parse_varint_payload\n (x: U8.t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let kd = uint8.get_bitfield x 6 8 in\n let msb : varint_msb_t = Cast.uint8_to_uint64 (uint8.get_bitfield x 0 6) in\n if kd = 0uy\n then weaken parse_varint_payload_kind (parse_ret msb)\n else if kd = 1uy\n then parse_varint_payload_u14 msb\n else if kd = 2uy\n then parse_varint_payload_u30 msb\n else parse_varint_payload_u62 msb\n\nmodule BF = LowParse.BitFields\n\nlet parse_varint_payload_interval\n (tag: U8.t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\ (\n if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936\n )))\n=\n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n assert (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy);\n let msb8 = uint8.get_bitfield tag 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n if kd = 0uy\n then begin\n assert (U64.v v < 64);\n assert (U8.v msb8 == U64.v v)\n end\n else if kd = 1uy\n then begin\n parse_varint_payload_14_interval msb b\n end else if kd = 2uy\n then\n parse_varint_payload_30_interval msb b\n else\n parse_varint_payload_62_interval msb b\n\n#pop-options\n\nlet parse_varint_payload_and_then_cases_injective : squash (and_then_cases_injective parse_varint_payload) =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n and_then_cases_injective_intro parse_varint_payload (fun x1 x2 b1 b2 ->\n let msb1 = Cast.uint8_to_uint64 (uint8.get_bitfield x1 0 6) in\n let msb2 = Cast.uint8_to_uint64 (uint8.get_bitfield x2 0 6) in\n parse_varint_payload_interval x1 b1;\n parse_varint_payload_interval x2 b2;\n assert (uint8.v (uint8.get_bitfield x1 6 8) == uint8.v (uint8.get_bitfield x2 6 8));\n assert (uint8.v (uint8.get_bitfield x1 0 6) == uint8.v (uint8.get_bitfield x2 0 6));\n BF.get_bitfield_partition_2 6 (U8.v x1) (U8.v x2)\n )\n\nlet parse_varint =\n parse_u8 `and_then` parse_varint_payload\n\nlet parse_varint_eq_aux\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == (match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let b' = Seq.slice b consumed (Seq.length b) in\n match parse (parse_varint_payload hd) b' with\n | None -> None\n | Some (res, consumed') -> Some (res, consumed + consumed')\n ))\n= assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n and_then_eq parse_u8 parse_varint_payload b\n\n#push-options \"--z3rlimit 128\"\n\nlet parse_varint'\n (b: bytes)\n: GTot (option (U62.t & consumed_length b))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (uint8.get_bitfield hd 0 6) in\n let b' = Seq.slice b consumed (Seq.length b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match parse parse_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n else if tag = 2uy\n then begin match parse (parse_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end else begin match parse (parse_u32 `nondep_then` parse_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n\nlet parse_varint_eq\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == parse_varint' b)\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n parse_varint_eq_aux b;\n match parse parse_u8 b with\n | None -> ()\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb8 = uint8.get_bitfield hd 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n let b' = Seq.slice b consumed (Seq.length b) in\n assert (tag == 0uy \\/ tag == 1uy \\/ tag == 2uy \\/ tag == 3uy);\n if tag = 0uy\n then ()\n else if tag = 1uy\n then begin\n parse_synth_eq parse_u8 (synth_u14 msb) b';\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b';\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b'\n end else if tag = 2uy\n then begin\n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b';\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b';\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) id_u30 b'\n end else begin\n parse_synth_eq (p7) (synth_u62 msb) b';\n parse_filter_eq (p7 `parse_synth` (synth_u62 msb)) filter_u62 b';\n parse_synth_eq ((p7 `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) id_u62 b'\n end\n\n#pop-options\n\ninline_for_extraction\nlet get_tag\n (x: U62.t)\n: Tot (bitfield uint8 2)\n= if x `U64.lt` 64uL\n then 0uy\n else if x `U64.lt` 16384uL\n then 1uy\n else if x `U64.lt` 1073741824uL\n then 2uy\n else 3uy\n\ninline_for_extraction\nlet get_msb\n (x: U62.t)\n: Tot varint_msb_t\n= if x `U64.lt` 64uL\n then x\n else if x `U64.lt` 16384uL\n then (x `U64.div` 256uL)\n else if x `U64.lt` 1073741824uL\n then (x `U64.div` 16777216uL)\n else (x `U64.div` 72057594037927936uL)\n\ninline_for_extraction\nlet get_first_byte\n (x: U62.t)", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: QUIC.UInt62.t -> FStar.UInt8.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.UInt62.t", "LowParse.BitFields.__proj__Mkuint_t__item__set_bitfield", "FStar.UInt8.t", "LowParse.BitFields.uint8", "FStar.UInt8.__uint_to_t", "FStar.Int.Cast.uint64_to_uint8", "QUIC.Spec.VarInt.get_msb", "QUIC.Spec.VarInt.get_tag" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val get_first_byte (x: U62.t) : Tot U8.t\nlet get_first_byte (x: U62.t) : Tot U8.t =", "completed_definiton": "uint8.set_bitfield (uint8.set_bitfield 0uy 0 6 (Cast.uint64_to_uint8 (get_msb x))) 6 8 (get_tag x)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.synth_bounded_varint_recip", "original_source_type": "val synth_bounded_varint_recip\n (min: nat)\n (max: nat{min <= max /\\ max < 4294967296})\n (x: bounded_int32 min max)\n : Tot (parse_filter_refine (varint_in_bounds min max))", "source_type": "val synth_bounded_varint_recip\n (min: nat)\n (max: nat{min <= max /\\ max < 4294967296})\n (x: bounded_int32 min max)\n : Tot (parse_filter_refine (varint_in_bounds min max))", "source_definition": "let synth_bounded_varint_recip\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: bounded_int32 min max)\n: Tot (parse_filter_refine (varint_in_bounds min max))\n= Cast.uint32_to_uint64 x", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 550, "start_col": 2, "end_line": 550, "end_col": 25 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b\n\nlet parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))\n= \n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b;\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) (id_u30) b\n\nlet parse_varint_payload_62_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\\n U64.v msb == U64.v v / (72057594037927936)\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq (p7) (synth_u62 msb) b;\n parse_filter_eq ((p7) `parse_synth` synth_u62 msb) filter_u62 b;\n parse_synth_eq (((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) (id_u62) b;\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n let Some (lsb, _) = parse (p7) b in\n synth_u62_msb msb lsb\n\nlet parse_varint_payload\n (x: U8.t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let kd = uint8.get_bitfield x 6 8 in\n let msb : varint_msb_t = Cast.uint8_to_uint64 (uint8.get_bitfield x 0 6) in\n if kd = 0uy\n then weaken parse_varint_payload_kind (parse_ret msb)\n else if kd = 1uy\n then parse_varint_payload_u14 msb\n else if kd = 2uy\n then parse_varint_payload_u30 msb\n else parse_varint_payload_u62 msb\n\nmodule BF = LowParse.BitFields\n\nlet parse_varint_payload_interval\n (tag: U8.t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\ (\n if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936\n )))\n=\n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n assert (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy);\n let msb8 = uint8.get_bitfield tag 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n if kd = 0uy\n then begin\n assert (U64.v v < 64);\n assert (U8.v msb8 == U64.v v)\n end\n else if kd = 1uy\n then begin\n parse_varint_payload_14_interval msb b\n end else if kd = 2uy\n then\n parse_varint_payload_30_interval msb b\n else\n parse_varint_payload_62_interval msb b\n\n#pop-options\n\nlet parse_varint_payload_and_then_cases_injective : squash (and_then_cases_injective parse_varint_payload) =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n and_then_cases_injective_intro parse_varint_payload (fun x1 x2 b1 b2 ->\n let msb1 = Cast.uint8_to_uint64 (uint8.get_bitfield x1 0 6) in\n let msb2 = Cast.uint8_to_uint64 (uint8.get_bitfield x2 0 6) in\n parse_varint_payload_interval x1 b1;\n parse_varint_payload_interval x2 b2;\n assert (uint8.v (uint8.get_bitfield x1 6 8) == uint8.v (uint8.get_bitfield x2 6 8));\n assert (uint8.v (uint8.get_bitfield x1 0 6) == uint8.v (uint8.get_bitfield x2 0 6));\n BF.get_bitfield_partition_2 6 (U8.v x1) (U8.v x2)\n )\n\nlet parse_varint =\n parse_u8 `and_then` parse_varint_payload\n\nlet parse_varint_eq_aux\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == (match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let b' = Seq.slice b consumed (Seq.length b) in\n match parse (parse_varint_payload hd) b' with\n | None -> None\n | Some (res, consumed') -> Some (res, consumed + consumed')\n ))\n= assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n and_then_eq parse_u8 parse_varint_payload b\n\n#push-options \"--z3rlimit 128\"\n\nlet parse_varint'\n (b: bytes)\n: GTot (option (U62.t & consumed_length b))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (uint8.get_bitfield hd 0 6) in\n let b' = Seq.slice b consumed (Seq.length b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match parse parse_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n else if tag = 2uy\n then begin match parse (parse_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end else begin match parse (parse_u32 `nondep_then` parse_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n\nlet parse_varint_eq\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == parse_varint' b)\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n parse_varint_eq_aux b;\n match parse parse_u8 b with\n | None -> ()\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb8 = uint8.get_bitfield hd 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n let b' = Seq.slice b consumed (Seq.length b) in\n assert (tag == 0uy \\/ tag == 1uy \\/ tag == 2uy \\/ tag == 3uy);\n if tag = 0uy\n then ()\n else if tag = 1uy\n then begin\n parse_synth_eq parse_u8 (synth_u14 msb) b';\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b';\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b'\n end else if tag = 2uy\n then begin\n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b';\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b';\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) id_u30 b'\n end else begin\n parse_synth_eq (p7) (synth_u62 msb) b';\n parse_filter_eq (p7 `parse_synth` (synth_u62 msb)) filter_u62 b';\n parse_synth_eq ((p7 `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) id_u62 b'\n end\n\n#pop-options\n\ninline_for_extraction\nlet get_tag\n (x: U62.t)\n: Tot (bitfield uint8 2)\n= if x `U64.lt` 64uL\n then 0uy\n else if x `U64.lt` 16384uL\n then 1uy\n else if x `U64.lt` 1073741824uL\n then 2uy\n else 3uy\n\ninline_for_extraction\nlet get_msb\n (x: U62.t)\n: Tot varint_msb_t\n= if x `U64.lt` 64uL\n then x\n else if x `U64.lt` 16384uL\n then (x `U64.div` 256uL)\n else if x `U64.lt` 1073741824uL\n then (x `U64.div` 16777216uL)\n else (x `U64.div` 72057594037927936uL)\n\ninline_for_extraction\nlet get_first_byte\n (x: U62.t)\n: Tot U8.t\n= uint8.set_bitfield (uint8.set_bitfield 0uy 0 6 (Cast.uint64_to_uint8 (get_msb x))) 6 8 (get_tag x)\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_varint_payload\n (x: U62.t)\n: GTot bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then Seq.empty\n else if x `U64.lt` 16384uL\n then serialize serialize_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then serialize (serialize_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else serialize (serialize_u32 `serialize_nondep_then` serialize_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\nlet serialize_varint'\n (x: U62.t)\n: GTot bytes\n= serialize serialize_u8 (get_first_byte x) `Seq.append` serialize_varint_payload x\n\n#pop-options\n\n#push-options \"--z3rlimit 1024 --using_facts_from '*,-FStar.Bytes,-FStar.String,-FStar.Char'\"\n\nlet serialize_varint_correct\n (x: U62.t)\n: Lemma\n (let y = serialize_varint' x in\n parse_varint' y == Some (x, Seq.length y)\n )\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n let y = serialize_varint' x in\n let z = get_first_byte x in\n let hd = serialize serialize_u8 z in\n assert (parse parse_u8 hd == Some (z, Seq.length hd));\n assert (Seq.slice hd 0 (Seq.length hd) `Seq.equal` Seq.slice y 0 (Seq.length hd));\n let tl = serialize_varint_payload x in\n assert (Seq.slice y (Seq.length hd) (Seq.length y) `Seq.equal` tl);\n parse_strong_prefix parse_u8 hd y;\n let tg = get_tag x in\n assert (uint8.get_bitfield z 6 8 == tg);\n if tg = 0uy\n then begin\n assert (x `U64.lt` 64uL);\n assert (U64.v x == U8.v (uint8.get_bitfield z 0 6));\n assert (x == Cast.uint8_to_uint64 (uint8.get_bitfield z 0 6));\n assert (y `Seq.equal` hd)\n end else if tg = 1uy\n then begin\n assert (64uL `U64.lte` x /\\ x `U64.lt` 16384uL);\n let x' = Cast.uint64_to_uint8 x in\n assert (parse parse_u8 tl == Some (x', Seq.length tl));\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 256);\n assert (U64.v x == (U8.v (uint8.get_bitfield z 0 6) `Prims.op_Multiply` 256) + U8.v x')\n end else if tg = 2uy\n then begin\n assert (16384uL `U64.lte` x /\\ x `U64.lt` 1073741824uL);\n let x' : bounded_integer 3 = Cast.uint64_to_uint32 (x `U64.rem` 16777216uL) in\n assert (parse (parse_bounded_integer 3) tl == Some (x', Seq.length tl));\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 16777216);\n assert (U64.v x == (U8.v (uint8.get_bitfield z 0 6) `Prims.op_Multiply` 16777216) + U32.v x')\n end else begin\n assert (1073741824uL `U64.lte` x);\n let lo : bounded_integer 3 = Cast.uint64_to_uint32 (x `U64.rem` 16777216uL) in\n let hi = Cast.uint64_to_uint32 (x `U64.div` 16777216uL) in\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 72057594037927936);\n assert (U64.v x == U32.v lo + (16777216 `Prims.op_Multiply` (U32.v hi + (4294967296 `Prims.op_Multiply` U8.v (uint8.get_bitfield z 0 6)))))\n end\n\n#pop-options\n\nlet serialize_varint =\n Classical.forall_intro parse_varint_eq;\n Classical.forall_intro serialize_varint_correct;\n serialize_varint'\n\nlet varint_in_bounds\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: U62.t)\n: GTot bool\n= min <= U64.v x && U64.v x <= max\n\ninline_for_extraction\nnoextract\nlet synth_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: parse_filter_refine (varint_in_bounds min max))\n: Tot (bounded_int32 min max)\n= Cast.uint64_to_uint32 x\n\nlet parse_bounded_varint min max =\n (parse_varint `parse_filter` varint_in_bounds min max) `parse_synth` synth_bounded_varint min max\n\ninline_for_extraction\nnoextract\nlet synth_bounded_varint_recip\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: bounded_int32 min max)", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n min: Prims.nat ->\n max: Prims.nat{min <= max /\\ max < 4294967296} ->\n x: LowParse.Spec.BoundedInt.bounded_int32 min max\n -> LowParse.Spec.Combinators.parse_filter_refine (QUIC.Spec.VarInt.varint_in_bounds min max)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "LowParse.Spec.BoundedInt.bounded_int32", "FStar.Int.Cast.uint32_to_uint64", "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.UInt62.t", "QUIC.Spec.VarInt.varint_in_bounds" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_bounded_varint_recip\n (min: nat)\n (max: nat{min <= max /\\ max < 4294967296})\n (x: bounded_int32 min max)\n : Tot (parse_filter_refine (varint_in_bounds min max))\nlet synth_bounded_varint_recip\n (min: nat)\n (max: nat{min <= max /\\ max < 4294967296})\n (x: bounded_int32 min max)\n : Tot (parse_filter_refine (varint_in_bounds min max)) =", "completed_definiton": "Cast.uint32_to_uint64 x", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.get_tag", "original_source_type": "val get_tag (x: U62.t) : Tot (bitfield uint8 2)", "source_type": "val get_tag (x: U62.t) : Tot (bitfield uint8 2)", "source_definition": "let get_tag\n (x: U62.t)\n: Tot (bitfield uint8 2)\n= if x `U64.lt` 64uL\n then 0uy\n else if x `U64.lt` 16384uL\n then 1uy\n else if x `U64.lt` 1073741824uL\n then 2uy\n else 3uy", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 413, "start_col": 2, "end_line": 419, "end_col": 10 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b\n\nlet parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))\n= \n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b;\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) (id_u30) b\n\nlet parse_varint_payload_62_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\\n U64.v msb == U64.v v / (72057594037927936)\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq (p7) (synth_u62 msb) b;\n parse_filter_eq ((p7) `parse_synth` synth_u62 msb) filter_u62 b;\n parse_synth_eq (((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) (id_u62) b;\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n let Some (lsb, _) = parse (p7) b in\n synth_u62_msb msb lsb\n\nlet parse_varint_payload\n (x: U8.t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let kd = uint8.get_bitfield x 6 8 in\n let msb : varint_msb_t = Cast.uint8_to_uint64 (uint8.get_bitfield x 0 6) in\n if kd = 0uy\n then weaken parse_varint_payload_kind (parse_ret msb)\n else if kd = 1uy\n then parse_varint_payload_u14 msb\n else if kd = 2uy\n then parse_varint_payload_u30 msb\n else parse_varint_payload_u62 msb\n\nmodule BF = LowParse.BitFields\n\nlet parse_varint_payload_interval\n (tag: U8.t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\ (\n if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936\n )))\n=\n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n assert (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy);\n let msb8 = uint8.get_bitfield tag 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n if kd = 0uy\n then begin\n assert (U64.v v < 64);\n assert (U8.v msb8 == U64.v v)\n end\n else if kd = 1uy\n then begin\n parse_varint_payload_14_interval msb b\n end else if kd = 2uy\n then\n parse_varint_payload_30_interval msb b\n else\n parse_varint_payload_62_interval msb b\n\n#pop-options\n\nlet parse_varint_payload_and_then_cases_injective : squash (and_then_cases_injective parse_varint_payload) =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n and_then_cases_injective_intro parse_varint_payload (fun x1 x2 b1 b2 ->\n let msb1 = Cast.uint8_to_uint64 (uint8.get_bitfield x1 0 6) in\n let msb2 = Cast.uint8_to_uint64 (uint8.get_bitfield x2 0 6) in\n parse_varint_payload_interval x1 b1;\n parse_varint_payload_interval x2 b2;\n assert (uint8.v (uint8.get_bitfield x1 6 8) == uint8.v (uint8.get_bitfield x2 6 8));\n assert (uint8.v (uint8.get_bitfield x1 0 6) == uint8.v (uint8.get_bitfield x2 0 6));\n BF.get_bitfield_partition_2 6 (U8.v x1) (U8.v x2)\n )\n\nlet parse_varint =\n parse_u8 `and_then` parse_varint_payload\n\nlet parse_varint_eq_aux\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == (match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let b' = Seq.slice b consumed (Seq.length b) in\n match parse (parse_varint_payload hd) b' with\n | None -> None\n | Some (res, consumed') -> Some (res, consumed + consumed')\n ))\n= assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n and_then_eq parse_u8 parse_varint_payload b\n\n#push-options \"--z3rlimit 128\"\n\nlet parse_varint'\n (b: bytes)\n: GTot (option (U62.t & consumed_length b))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (uint8.get_bitfield hd 0 6) in\n let b' = Seq.slice b consumed (Seq.length b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match parse parse_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n else if tag = 2uy\n then begin match parse (parse_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end else begin match parse (parse_u32 `nondep_then` parse_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n\nlet parse_varint_eq\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == parse_varint' b)\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n parse_varint_eq_aux b;\n match parse parse_u8 b with\n | None -> ()\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb8 = uint8.get_bitfield hd 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n let b' = Seq.slice b consumed (Seq.length b) in\n assert (tag == 0uy \\/ tag == 1uy \\/ tag == 2uy \\/ tag == 3uy);\n if tag = 0uy\n then ()\n else if tag = 1uy\n then begin\n parse_synth_eq parse_u8 (synth_u14 msb) b';\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b';\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b'\n end else if tag = 2uy\n then begin\n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b';\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b';\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) id_u30 b'\n end else begin\n parse_synth_eq (p7) (synth_u62 msb) b';\n parse_filter_eq (p7 `parse_synth` (synth_u62 msb)) filter_u62 b';\n parse_synth_eq ((p7 `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) id_u62 b'\n end\n\n#pop-options\n\ninline_for_extraction\nlet get_tag\n (x: U62.t)", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: QUIC.UInt62.t -> LowParse.BitFields.bitfield LowParse.BitFields.uint8 2", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.UInt62.t", "FStar.UInt64.lt", "FStar.UInt64.__uint_to_t", "FStar.UInt8.__uint_to_t", "Prims.bool", "LowParse.BitFields.bitfield", "FStar.UInt8.t", "LowParse.BitFields.uint8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val get_tag (x: U62.t) : Tot (bitfield uint8 2)\nlet get_tag (x: U62.t) : Tot (bitfield uint8 2) =", "completed_definiton": "if x `U64.lt` 64uL\nthen 0uy\nelse if x `U64.lt` 16384uL then 1uy else if x `U64.lt` 1073741824uL then 2uy else 3uy", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.synth_u62", "original_source_type": "val synth_u62 (msb: varint_msb_t) (lsb: (U32.t & bounded_integer 3)) : Tot U62.t", "source_type": "val synth_u62 (msb: varint_msb_t) (lsb: (U32.t & bounded_integer 3)) : Tot U62.t", "source_definition": "let synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 71, "start_col": 2, "end_line": 79, "end_col": 125 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n msb: QUIC.Spec.VarInt.varint_msb_t ->\n lsb: (FStar.UInt32.t * LowParse.Spec.BoundedInt.bounded_integer 3)\n -> QUIC.UInt62.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.VarInt.varint_msb_t", "FStar.Pervasives.Native.tuple2", "FStar.UInt32.t", "LowParse.Spec.BoundedInt.bounded_integer", "FStar.UInt64.add", "FStar.Int.Cast.uint32_to_uint64", "FStar.UInt64.mul", "FStar.UInt64.__uint_to_t", "QUIC.UInt62.t", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.int", "Prims.pow2", "Prims._assert", "Prims.l_or", "Prims.b2t", "Prims.op_GreaterThan", "FStar.UInt.size", "FStar.UInt64.n", "FStar.UInt64.v", "QUIC.UInt62.bound" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_u62 (msb: varint_msb_t) (lsb: (U32.t & bounded_integer 3)) : Tot U62.t\nlet synth_u62 (msb: varint_msb_t) (lsb: (U32.t & bounded_integer 3)) : Tot U62.t =", "completed_definiton": "[@@ inline_let ]let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\nin\nmatch lsb with\n| hi, lo ->\n (Cast.uint32_to_uint64 lo)\n `U64.add`\n (16777216uL `U64.mul` ((Cast.uint32_to_uint64 hi) `U64.add` (4294967296uL `U64.mul` msb)))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.synth_bounded_varint", "original_source_type": "val synth_bounded_varint\n (min: nat)\n (max: nat{min <= max /\\ max < 4294967296})\n (x: parse_filter_refine (varint_in_bounds min max))\n : Tot (bounded_int32 min max)", "source_type": "val synth_bounded_varint\n (min: nat)\n (max: nat{min <= max /\\ max < 4294967296})\n (x: parse_filter_refine (varint_in_bounds min max))\n : Tot (bounded_int32 min max)", "source_definition": "let synth_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: parse_filter_refine (varint_in_bounds min max))\n: Tot (bounded_int32 min max)\n= Cast.uint64_to_uint32 x", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 538, "start_col": 2, "end_line": 538, "end_col": 25 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b\n\nlet parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))\n= \n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b;\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) (id_u30) b\n\nlet parse_varint_payload_62_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\\n U64.v msb == U64.v v / (72057594037927936)\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq (p7) (synth_u62 msb) b;\n parse_filter_eq ((p7) `parse_synth` synth_u62 msb) filter_u62 b;\n parse_synth_eq (((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) (id_u62) b;\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n let Some (lsb, _) = parse (p7) b in\n synth_u62_msb msb lsb\n\nlet parse_varint_payload\n (x: U8.t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let kd = uint8.get_bitfield x 6 8 in\n let msb : varint_msb_t = Cast.uint8_to_uint64 (uint8.get_bitfield x 0 6) in\n if kd = 0uy\n then weaken parse_varint_payload_kind (parse_ret msb)\n else if kd = 1uy\n then parse_varint_payload_u14 msb\n else if kd = 2uy\n then parse_varint_payload_u30 msb\n else parse_varint_payload_u62 msb\n\nmodule BF = LowParse.BitFields\n\nlet parse_varint_payload_interval\n (tag: U8.t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\ (\n if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936\n )))\n=\n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n assert (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy);\n let msb8 = uint8.get_bitfield tag 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n if kd = 0uy\n then begin\n assert (U64.v v < 64);\n assert (U8.v msb8 == U64.v v)\n end\n else if kd = 1uy\n then begin\n parse_varint_payload_14_interval msb b\n end else if kd = 2uy\n then\n parse_varint_payload_30_interval msb b\n else\n parse_varint_payload_62_interval msb b\n\n#pop-options\n\nlet parse_varint_payload_and_then_cases_injective : squash (and_then_cases_injective parse_varint_payload) =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n and_then_cases_injective_intro parse_varint_payload (fun x1 x2 b1 b2 ->\n let msb1 = Cast.uint8_to_uint64 (uint8.get_bitfield x1 0 6) in\n let msb2 = Cast.uint8_to_uint64 (uint8.get_bitfield x2 0 6) in\n parse_varint_payload_interval x1 b1;\n parse_varint_payload_interval x2 b2;\n assert (uint8.v (uint8.get_bitfield x1 6 8) == uint8.v (uint8.get_bitfield x2 6 8));\n assert (uint8.v (uint8.get_bitfield x1 0 6) == uint8.v (uint8.get_bitfield x2 0 6));\n BF.get_bitfield_partition_2 6 (U8.v x1) (U8.v x2)\n )\n\nlet parse_varint =\n parse_u8 `and_then` parse_varint_payload\n\nlet parse_varint_eq_aux\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == (match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let b' = Seq.slice b consumed (Seq.length b) in\n match parse (parse_varint_payload hd) b' with\n | None -> None\n | Some (res, consumed') -> Some (res, consumed + consumed')\n ))\n= assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n and_then_eq parse_u8 parse_varint_payload b\n\n#push-options \"--z3rlimit 128\"\n\nlet parse_varint'\n (b: bytes)\n: GTot (option (U62.t & consumed_length b))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (uint8.get_bitfield hd 0 6) in\n let b' = Seq.slice b consumed (Seq.length b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match parse parse_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n else if tag = 2uy\n then begin match parse (parse_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end else begin match parse (parse_u32 `nondep_then` parse_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n\nlet parse_varint_eq\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == parse_varint' b)\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n parse_varint_eq_aux b;\n match parse parse_u8 b with\n | None -> ()\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb8 = uint8.get_bitfield hd 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n let b' = Seq.slice b consumed (Seq.length b) in\n assert (tag == 0uy \\/ tag == 1uy \\/ tag == 2uy \\/ tag == 3uy);\n if tag = 0uy\n then ()\n else if tag = 1uy\n then begin\n parse_synth_eq parse_u8 (synth_u14 msb) b';\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b';\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b'\n end else if tag = 2uy\n then begin\n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b';\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b';\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) id_u30 b'\n end else begin\n parse_synth_eq (p7) (synth_u62 msb) b';\n parse_filter_eq (p7 `parse_synth` (synth_u62 msb)) filter_u62 b';\n parse_synth_eq ((p7 `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) id_u62 b'\n end\n\n#pop-options\n\ninline_for_extraction\nlet get_tag\n (x: U62.t)\n: Tot (bitfield uint8 2)\n= if x `U64.lt` 64uL\n then 0uy\n else if x `U64.lt` 16384uL\n then 1uy\n else if x `U64.lt` 1073741824uL\n then 2uy\n else 3uy\n\ninline_for_extraction\nlet get_msb\n (x: U62.t)\n: Tot varint_msb_t\n= if x `U64.lt` 64uL\n then x\n else if x `U64.lt` 16384uL\n then (x `U64.div` 256uL)\n else if x `U64.lt` 1073741824uL\n then (x `U64.div` 16777216uL)\n else (x `U64.div` 72057594037927936uL)\n\ninline_for_extraction\nlet get_first_byte\n (x: U62.t)\n: Tot U8.t\n= uint8.set_bitfield (uint8.set_bitfield 0uy 0 6 (Cast.uint64_to_uint8 (get_msb x))) 6 8 (get_tag x)\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_varint_payload\n (x: U62.t)\n: GTot bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then Seq.empty\n else if x `U64.lt` 16384uL\n then serialize serialize_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then serialize (serialize_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else serialize (serialize_u32 `serialize_nondep_then` serialize_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\nlet serialize_varint'\n (x: U62.t)\n: GTot bytes\n= serialize serialize_u8 (get_first_byte x) `Seq.append` serialize_varint_payload x\n\n#pop-options\n\n#push-options \"--z3rlimit 1024 --using_facts_from '*,-FStar.Bytes,-FStar.String,-FStar.Char'\"\n\nlet serialize_varint_correct\n (x: U62.t)\n: Lemma\n (let y = serialize_varint' x in\n parse_varint' y == Some (x, Seq.length y)\n )\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n let y = serialize_varint' x in\n let z = get_first_byte x in\n let hd = serialize serialize_u8 z in\n assert (parse parse_u8 hd == Some (z, Seq.length hd));\n assert (Seq.slice hd 0 (Seq.length hd) `Seq.equal` Seq.slice y 0 (Seq.length hd));\n let tl = serialize_varint_payload x in\n assert (Seq.slice y (Seq.length hd) (Seq.length y) `Seq.equal` tl);\n parse_strong_prefix parse_u8 hd y;\n let tg = get_tag x in\n assert (uint8.get_bitfield z 6 8 == tg);\n if tg = 0uy\n then begin\n assert (x `U64.lt` 64uL);\n assert (U64.v x == U8.v (uint8.get_bitfield z 0 6));\n assert (x == Cast.uint8_to_uint64 (uint8.get_bitfield z 0 6));\n assert (y `Seq.equal` hd)\n end else if tg = 1uy\n then begin\n assert (64uL `U64.lte` x /\\ x `U64.lt` 16384uL);\n let x' = Cast.uint64_to_uint8 x in\n assert (parse parse_u8 tl == Some (x', Seq.length tl));\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 256);\n assert (U64.v x == (U8.v (uint8.get_bitfield z 0 6) `Prims.op_Multiply` 256) + U8.v x')\n end else if tg = 2uy\n then begin\n assert (16384uL `U64.lte` x /\\ x `U64.lt` 1073741824uL);\n let x' : bounded_integer 3 = Cast.uint64_to_uint32 (x `U64.rem` 16777216uL) in\n assert (parse (parse_bounded_integer 3) tl == Some (x', Seq.length tl));\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 16777216);\n assert (U64.v x == (U8.v (uint8.get_bitfield z 0 6) `Prims.op_Multiply` 16777216) + U32.v x')\n end else begin\n assert (1073741824uL `U64.lte` x);\n let lo : bounded_integer 3 = Cast.uint64_to_uint32 (x `U64.rem` 16777216uL) in\n let hi = Cast.uint64_to_uint32 (x `U64.div` 16777216uL) in\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 72057594037927936);\n assert (U64.v x == U32.v lo + (16777216 `Prims.op_Multiply` (U32.v hi + (4294967296 `Prims.op_Multiply` U8.v (uint8.get_bitfield z 0 6)))))\n end\n\n#pop-options\n\nlet serialize_varint =\n Classical.forall_intro parse_varint_eq;\n Classical.forall_intro serialize_varint_correct;\n serialize_varint'\n\nlet varint_in_bounds\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: U62.t)\n: GTot bool\n= min <= U64.v x && U64.v x <= max\n\ninline_for_extraction\nnoextract\nlet synth_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: parse_filter_refine (varint_in_bounds min max))", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n min: Prims.nat ->\n max: Prims.nat{min <= max /\\ max < 4294967296} ->\n x: LowParse.Spec.Combinators.parse_filter_refine (QUIC.Spec.VarInt.varint_in_bounds min max)\n -> LowParse.Spec.BoundedInt.bounded_int32 min max", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.UInt62.t", "QUIC.Spec.VarInt.varint_in_bounds", "FStar.Int.Cast.uint64_to_uint32", "LowParse.Spec.BoundedInt.bounded_int32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_bounded_varint\n (min: nat)\n (max: nat{min <= max /\\ max < 4294967296})\n (x: parse_filter_refine (varint_in_bounds min max))\n : Tot (bounded_int32 min max)\nlet synth_bounded_varint\n (min: nat)\n (max: nat{min <= max /\\ max < 4294967296})\n (x: parse_filter_refine (varint_in_bounds min max))\n : Tot (bounded_int32 min max) =", "completed_definiton": "Cast.uint64_to_uint32 x", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.parse_varint_payload_u62", "original_source_type": "val parse_varint_payload_u62 (msb: varint_msb_t) : Tot (parser parse_varint_payload_kind U62.t)", "source_type": "val parse_varint_payload_u62 (msb: varint_msb_t) : Tot (parser parse_varint_payload_kind U62.t)", "source_definition": "let parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 155, "start_col": 2, "end_line": 158, "end_col": 25 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "msb: QUIC.Spec.VarInt.varint_msb_t\n -> LowParse.Spec.Base.parser QUIC.Spec.VarInt.parse_varint_payload_kind QUIC.UInt62.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.VarInt.varint_msb_t", "LowParse.Spec.Base.weaken", "QUIC.Spec.VarInt.parse_varint_payload_kind", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.BoundedInt.parse_bounded_integer_kind", "QUIC.UInt62.t", "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.Spec.VarInt.filter_u62", "LowParse.Spec.Combinators.parse_filter", "FStar.Pervasives.Native.tuple2", "FStar.UInt32.t", "LowParse.Spec.BoundedInt.bounded_integer", "QUIC.Spec.VarInt.p7", "QUIC.Spec.VarInt.synth_u62", "QUIC.Spec.VarInt.id_u62", "LowParse.Spec.Base.parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val parse_varint_payload_u62 (msb: varint_msb_t) : Tot (parser parse_varint_payload_kind U62.t)\nlet parse_varint_payload_u62 (msb: varint_msb_t) : Tot (parser parse_varint_payload_kind U62.t) =", "completed_definiton": "weaken parse_varint_payload_kind\n ((((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) `parse_synth` id_u62)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.parse_varint'", "original_source_type": "val parse_varint' (b: bytes) : GTot (option (U62.t & consumed_length b))", "source_type": "val parse_varint' (b: bytes) : GTot (option (U62.t & consumed_length b))", "source_definition": "let parse_varint'\n (b: bytes)\n: GTot (option (U62.t & consumed_length b))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (uint8.get_bitfield hd 0 6) in\n let b' = Seq.slice b consumed (Seq.length b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match parse parse_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n else if tag = 2uy\n then begin match parse (parse_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end else begin match parse (parse_u32 `nondep_then` parse_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 326, "start_col": 2, "end_line": 368, "end_col": 7 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b\n\nlet parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))\n= \n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b;\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) (id_u30) b\n\nlet parse_varint_payload_62_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\\n U64.v msb == U64.v v / (72057594037927936)\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq (p7) (synth_u62 msb) b;\n parse_filter_eq ((p7) `parse_synth` synth_u62 msb) filter_u62 b;\n parse_synth_eq (((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) (id_u62) b;\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n let Some (lsb, _) = parse (p7) b in\n synth_u62_msb msb lsb\n\nlet parse_varint_payload\n (x: U8.t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let kd = uint8.get_bitfield x 6 8 in\n let msb : varint_msb_t = Cast.uint8_to_uint64 (uint8.get_bitfield x 0 6) in\n if kd = 0uy\n then weaken parse_varint_payload_kind (parse_ret msb)\n else if kd = 1uy\n then parse_varint_payload_u14 msb\n else if kd = 2uy\n then parse_varint_payload_u30 msb\n else parse_varint_payload_u62 msb\n\nmodule BF = LowParse.BitFields\n\nlet parse_varint_payload_interval\n (tag: U8.t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\ (\n if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936\n )))\n=\n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n assert (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy);\n let msb8 = uint8.get_bitfield tag 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n if kd = 0uy\n then begin\n assert (U64.v v < 64);\n assert (U8.v msb8 == U64.v v)\n end\n else if kd = 1uy\n then begin\n parse_varint_payload_14_interval msb b\n end else if kd = 2uy\n then\n parse_varint_payload_30_interval msb b\n else\n parse_varint_payload_62_interval msb b\n\n#pop-options\n\nlet parse_varint_payload_and_then_cases_injective : squash (and_then_cases_injective parse_varint_payload) =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n and_then_cases_injective_intro parse_varint_payload (fun x1 x2 b1 b2 ->\n let msb1 = Cast.uint8_to_uint64 (uint8.get_bitfield x1 0 6) in\n let msb2 = Cast.uint8_to_uint64 (uint8.get_bitfield x2 0 6) in\n parse_varint_payload_interval x1 b1;\n parse_varint_payload_interval x2 b2;\n assert (uint8.v (uint8.get_bitfield x1 6 8) == uint8.v (uint8.get_bitfield x2 6 8));\n assert (uint8.v (uint8.get_bitfield x1 0 6) == uint8.v (uint8.get_bitfield x2 0 6));\n BF.get_bitfield_partition_2 6 (U8.v x1) (U8.v x2)\n )\n\nlet parse_varint =\n parse_u8 `and_then` parse_varint_payload\n\nlet parse_varint_eq_aux\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == (match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let b' = Seq.slice b consumed (Seq.length b) in\n match parse (parse_varint_payload hd) b' with\n | None -> None\n | Some (res, consumed') -> Some (res, consumed + consumed')\n ))\n= assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n and_then_eq parse_u8 parse_varint_payload b\n\n#push-options \"--z3rlimit 128\"\n\nlet parse_varint'\n (b: bytes)", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: LowParse.Bytes.bytes\n -> Prims.GTot\n (FStar.Pervasives.Native.option (QUIC.UInt62.t * LowParse.Spec.Base.consumed_length b))", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "LowParse.Bytes.bytes", "LowParse.Spec.Base.parse", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "FStar.Pervasives.Native.None", "FStar.Pervasives.Native.tuple2", "QUIC.UInt62.t", "LowParse.Spec.Base.consumed_length", "Prims.op_Equality", "FStar.UInt8.__uint_to_t", "FStar.Pervasives.Native.Some", "FStar.Pervasives.Native.Mktuple2", "Prims.bool", "FStar.UInt64.lte", "FStar.UInt64.__uint_to_t", "Prims.op_Addition", "FStar.Pervasives.Native.option", "FStar.UInt64.add", "FStar.UInt64.mul", "FStar.Int.Cast.uint8_to_uint64", "LowParse.Spec.BoundedInt.bounded_integer", "LowParse.Spec.BoundedInt.parse_bounded_integer", "FStar.Int.Cast.uint32_to_uint64", "FStar.UInt32.t", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.Int.parse_u32", "LowParse.Spec.BoundedInt.parse_bounded_integer_kind", "FStar.Seq.Base.seq", "LowParse.Bytes.byte", "FStar.Seq.Base.slice", "FStar.Seq.Base.length", "FStar.UInt64.t", "Prims.b2t", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt64.v", "FStar.UInt8.v", "LowParse.BitFields.__proj__Mkuint_t__item__get_bitfield", "LowParse.BitFields.uint8", "Prims.eq2", "FStar.UInt.uint_t", "LowParse.BitFields.__proj__Mkuint_t__item__v", "LowParse.BitFields.get_bitfield", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.pow2", "Prims._assert", "Prims.op_GreaterThan", "FStar.UInt64.n", "QUIC.UInt62.bound" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_varint' (b: bytes) : GTot (option (U62.t & consumed_length b))\nlet parse_varint' (b: bytes) : GTot (option (U62.t & consumed_length b)) =", "completed_definiton": "assert_norm (pow2 8 == 256);\nassert_norm (pow2 6 == 64);\nassert (pow2 62 == U64.v U62.bound);\nassert_norm (pow2 24 == 16777216);\nassert_norm (pow2 32 == 4294967296);\nmatch parse parse_u8 b with\n| None -> None\n| Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (uint8.get_bitfield hd 0 6) in\n let b' = Seq.slice b consumed (Seq.length b) in\n if tag = 0uy\n then Some ((msb <: U62.t), consumed)\n else\n if tag = 1uy\n then\n match parse parse_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v:U62.t = (msb `U64.mul` 256uL) `U64.add` (Cast.uint8_to_uint64 lsb) in\n if 64uL `U64.lte` v then Some (v, consumed + consumed') else None\n else\n if tag = 2uy\n then\n match parse (parse_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v:U62.t = (msb `U64.mul` 16777216uL) `U64.add` (Cast.uint32_to_uint64 lsb) in\n if 16384uL `U64.lte` v then Some (v, consumed + consumed') else None\n else\n match parse (parse_u32 `nondep_then` (parse_bounded_integer 3)) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v:U62.t =\n (Cast.uint32_to_uint64 lo)\n `U64.add`\n (16777216uL\n `U64.mul`\n ((Cast.uint32_to_uint64 hi) `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v then Some (v, consumed + consumed') else None", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.parse_varint_payload", "original_source_type": "val parse_varint_payload (x: U8.t) : Tot (parser parse_varint_payload_kind U62.t)", "source_type": "val parse_varint_payload (x: U8.t) : Tot (parser parse_varint_payload_kind U62.t)", "source_definition": "let parse_varint_payload\n (x: U8.t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let kd = uint8.get_bitfield x 6 8 in\n let msb : varint_msb_t = Cast.uint8_to_uint64 (uint8.get_bitfield x 0 6) in\n if kd = 0uy\n then weaken parse_varint_payload_kind (parse_ret msb)\n else if kd = 1uy\n then parse_varint_payload_u14 msb\n else if kd = 2uy\n then parse_varint_payload_u30 msb\n else parse_varint_payload_u62 msb", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 223, "start_col": 2, "end_line": 236, "end_col": 35 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b\n\nlet parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))\n= \n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b;\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) (id_u30) b\n\nlet parse_varint_payload_62_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\\n U64.v msb == U64.v v / (72057594037927936)\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq (p7) (synth_u62 msb) b;\n parse_filter_eq ((p7) `parse_synth` synth_u62 msb) filter_u62 b;\n parse_synth_eq (((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) (id_u62) b;\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n let Some (lsb, _) = parse (p7) b in\n synth_u62_msb msb lsb\n\nlet parse_varint_payload\n (x: U8.t)", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: FStar.UInt8.t\n -> LowParse.Spec.Base.parser QUIC.Spec.VarInt.parse_varint_payload_kind QUIC.UInt62.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt8.t", "Prims.op_Equality", "FStar.UInt8.__uint_to_t", "LowParse.Spec.Base.weaken", "QUIC.Spec.VarInt.parse_varint_payload_kind", "LowParse.Spec.Combinators.parse_ret_kind", "QUIC.UInt62.t", "LowParse.Spec.Combinators.parse_ret", "Prims.bool", "QUIC.Spec.VarInt.parse_varint_payload_u14", "QUIC.Spec.VarInt.parse_varint_payload_u30", "QUIC.Spec.VarInt.parse_varint_payload_u62", "LowParse.Spec.Base.parser", "QUIC.Spec.VarInt.varint_msb_t", "FStar.Int.Cast.uint8_to_uint64", "LowParse.BitFields.__proj__Mkuint_t__item__get_bitfield", "LowParse.BitFields.uint8", "Prims.eq2", "FStar.UInt.uint_t", "LowParse.BitFields.__proj__Mkuint_t__item__v", "LowParse.BitFields.get_bitfield", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.int", "Prims.pow2", "Prims._assert", "Prims.l_or", "FStar.UInt.size", "FStar.UInt64.n", "Prims.b2t", "Prims.op_GreaterThan", "FStar.UInt64.v", "QUIC.UInt62.bound" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val parse_varint_payload (x: U8.t) : Tot (parser parse_varint_payload_kind U62.t)\nlet parse_varint_payload (x: U8.t) : Tot (parser parse_varint_payload_kind U62.t) =", "completed_definiton": "assert_norm (pow2 6 == 64);\nassert_norm (pow2 8 == 256);\nassert (pow2 62 == U64.v U62.bound);\nassert_norm (pow2 32 == 4294967296);\nassert_norm (pow2 24 == 16777216);\nlet kd = uint8.get_bitfield x 6 8 in\nlet msb:varint_msb_t = Cast.uint8_to_uint64 (uint8.get_bitfield x 0 6) in\nif kd = 0uy\nthen weaken parse_varint_payload_kind (parse_ret msb)\nelse\n if kd = 1uy\n then parse_varint_payload_u14 msb\n else if kd = 2uy then parse_varint_payload_u30 msb else parse_varint_payload_u62 msb", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.serialize_varint_payload", "original_source_type": "val serialize_varint_payload (x: U62.t) : GTot bytes", "source_type": "val serialize_varint_payload (x: U62.t) : GTot bytes", "source_definition": "let serialize_varint_payload\n (x: U62.t)\n: GTot bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then Seq.empty\n else if x `U64.lt` 16384uL\n then serialize serialize_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then serialize (serialize_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else serialize (serialize_u32 `serialize_nondep_then` serialize_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 445, "start_col": 2, "end_line": 456, "end_col": 181 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b\n\nlet parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))\n= \n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b;\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) (id_u30) b\n\nlet parse_varint_payload_62_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\\n U64.v msb == U64.v v / (72057594037927936)\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq (p7) (synth_u62 msb) b;\n parse_filter_eq ((p7) `parse_synth` synth_u62 msb) filter_u62 b;\n parse_synth_eq (((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) (id_u62) b;\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n let Some (lsb, _) = parse (p7) b in\n synth_u62_msb msb lsb\n\nlet parse_varint_payload\n (x: U8.t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let kd = uint8.get_bitfield x 6 8 in\n let msb : varint_msb_t = Cast.uint8_to_uint64 (uint8.get_bitfield x 0 6) in\n if kd = 0uy\n then weaken parse_varint_payload_kind (parse_ret msb)\n else if kd = 1uy\n then parse_varint_payload_u14 msb\n else if kd = 2uy\n then parse_varint_payload_u30 msb\n else parse_varint_payload_u62 msb\n\nmodule BF = LowParse.BitFields\n\nlet parse_varint_payload_interval\n (tag: U8.t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\ (\n if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936\n )))\n=\n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n assert (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy);\n let msb8 = uint8.get_bitfield tag 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n if kd = 0uy\n then begin\n assert (U64.v v < 64);\n assert (U8.v msb8 == U64.v v)\n end\n else if kd = 1uy\n then begin\n parse_varint_payload_14_interval msb b\n end else if kd = 2uy\n then\n parse_varint_payload_30_interval msb b\n else\n parse_varint_payload_62_interval msb b\n\n#pop-options\n\nlet parse_varint_payload_and_then_cases_injective : squash (and_then_cases_injective parse_varint_payload) =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n and_then_cases_injective_intro parse_varint_payload (fun x1 x2 b1 b2 ->\n let msb1 = Cast.uint8_to_uint64 (uint8.get_bitfield x1 0 6) in\n let msb2 = Cast.uint8_to_uint64 (uint8.get_bitfield x2 0 6) in\n parse_varint_payload_interval x1 b1;\n parse_varint_payload_interval x2 b2;\n assert (uint8.v (uint8.get_bitfield x1 6 8) == uint8.v (uint8.get_bitfield x2 6 8));\n assert (uint8.v (uint8.get_bitfield x1 0 6) == uint8.v (uint8.get_bitfield x2 0 6));\n BF.get_bitfield_partition_2 6 (U8.v x1) (U8.v x2)\n )\n\nlet parse_varint =\n parse_u8 `and_then` parse_varint_payload\n\nlet parse_varint_eq_aux\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == (match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let b' = Seq.slice b consumed (Seq.length b) in\n match parse (parse_varint_payload hd) b' with\n | None -> None\n | Some (res, consumed') -> Some (res, consumed + consumed')\n ))\n= assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n and_then_eq parse_u8 parse_varint_payload b\n\n#push-options \"--z3rlimit 128\"\n\nlet parse_varint'\n (b: bytes)\n: GTot (option (U62.t & consumed_length b))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (uint8.get_bitfield hd 0 6) in\n let b' = Seq.slice b consumed (Seq.length b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match parse parse_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n else if tag = 2uy\n then begin match parse (parse_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end else begin match parse (parse_u32 `nondep_then` parse_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n\nlet parse_varint_eq\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == parse_varint' b)\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n parse_varint_eq_aux b;\n match parse parse_u8 b with\n | None -> ()\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb8 = uint8.get_bitfield hd 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n let b' = Seq.slice b consumed (Seq.length b) in\n assert (tag == 0uy \\/ tag == 1uy \\/ tag == 2uy \\/ tag == 3uy);\n if tag = 0uy\n then ()\n else if tag = 1uy\n then begin\n parse_synth_eq parse_u8 (synth_u14 msb) b';\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b';\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b'\n end else if tag = 2uy\n then begin\n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b';\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b';\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) id_u30 b'\n end else begin\n parse_synth_eq (p7) (synth_u62 msb) b';\n parse_filter_eq (p7 `parse_synth` (synth_u62 msb)) filter_u62 b';\n parse_synth_eq ((p7 `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) id_u62 b'\n end\n\n#pop-options\n\ninline_for_extraction\nlet get_tag\n (x: U62.t)\n: Tot (bitfield uint8 2)\n= if x `U64.lt` 64uL\n then 0uy\n else if x `U64.lt` 16384uL\n then 1uy\n else if x `U64.lt` 1073741824uL\n then 2uy\n else 3uy\n\ninline_for_extraction\nlet get_msb\n (x: U62.t)\n: Tot varint_msb_t\n= if x `U64.lt` 64uL\n then x\n else if x `U64.lt` 16384uL\n then (x `U64.div` 256uL)\n else if x `U64.lt` 1073741824uL\n then (x `U64.div` 16777216uL)\n else (x `U64.div` 72057594037927936uL)\n\ninline_for_extraction\nlet get_first_byte\n (x: U62.t)\n: Tot U8.t\n= uint8.set_bitfield (uint8.set_bitfield 0uy 0 6 (Cast.uint64_to_uint8 (get_msb x))) 6 8 (get_tag x)\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_varint_payload\n (x: U62.t)\n: GTot bytes", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: QUIC.UInt62.t -> Prims.GTot LowParse.Bytes.bytes", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.UInt62.t", "FStar.UInt64.lt", "FStar.UInt64.__uint_to_t", "FStar.Seq.Base.empty", "LowParse.Bytes.byte", "Prims.bool", "LowParse.Spec.Base.serialize", "LowParse.Spec.Int.parse_u8_kind", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "FStar.Int.Cast.uint64_to_uint8", "LowParse.Spec.BoundedInt.parse_bounded_integer_kind", "LowParse.Spec.BoundedInt.bounded_integer", "LowParse.Spec.BoundedInt.parse_bounded_integer", "LowParse.Spec.BoundedInt.serialize_bounded_integer", "FStar.Int.Cast.uint64_to_uint32", "FStar.UInt64.rem", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "FStar.Pervasives.Native.tuple2", "FStar.UInt32.t", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Int.parse_u32", "LowParse.Spec.Combinators.serialize_nondep_then", "LowParse.Spec.Int.serialize_u32", "FStar.Pervasives.Native.Mktuple2", "FStar.UInt64.div", "LowParse.Bytes.bytes", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.int", "Prims.pow2", "Prims._assert", "Prims.l_or", "Prims.b2t", "Prims.op_GreaterThan", "FStar.UInt.size", "FStar.UInt64.n", "FStar.UInt64.v", "QUIC.UInt62.bound" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_varint_payload (x: U62.t) : GTot bytes\nlet serialize_varint_payload (x: U62.t) : GTot bytes =", "completed_definiton": "assert_norm (pow2 8 == 256);\nassert_norm (pow2 6 == 64);\nassert (pow2 62 == U64.v U62.bound);\nassert_norm (pow2 24 == 16777216);\nassert_norm (pow2 32 == 4294967296);\nif x `U64.lt` 64uL\nthen Seq.empty\nelse\n if x `U64.lt` 16384uL\n then serialize serialize_u8 (Cast.uint64_to_uint8 x)\n else\n if x `U64.lt` 1073741824uL\n then serialize (serialize_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else\n serialize (serialize_u32 `serialize_nondep_then` (serialize_bounded_integer 3))\n (Cast.uint64_to_uint32 (x `U64.div` 16777216uL),\n Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.parse_varint_payload_62_interval", "original_source_type": "val parse_varint_payload_62_interval (msb: varint_msb_t) (b: bytes)\n : Lemma (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures\n (let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\ U64.v msb == U64.v v / (72057594037927936)))", "source_type": "val parse_varint_payload_62_interval (msb: varint_msb_t) (b: bytes)\n : Lemma (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures\n (let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\ U64.v msb == U64.v v / (72057594037927936)))", "source_definition": "let parse_varint_payload_62_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\\n U64.v msb == U64.v v / (72057594037927936)\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq (p7) (synth_u62 msb) b;\n parse_filter_eq ((p7) `parse_synth` synth_u62 msb) filter_u62 b;\n parse_synth_eq (((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) (id_u62) b;\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n let Some (lsb, _) = parse (p7) b in\n synth_u62_msb msb lsb", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 208, "start_col": 3, "end_line": 218, "end_col": 24 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b\n\nlet parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))\n= \n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b;\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) (id_u30) b\n\nlet parse_varint_payload_62_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\\n U64.v msb == U64.v v / (72057594037927936)\n ))", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "msb: QUIC.Spec.VarInt.varint_msb_t -> b: LowParse.Bytes.bytes\n -> FStar.Pervasives.Lemma\n (requires Some? (LowParse.Spec.Base.parse (QUIC.Spec.VarInt.parse_varint_payload_u62 msb) b))\n (ensures\n (let _ = LowParse.Spec.Base.parse (QUIC.Spec.VarInt.parse_varint_payload_u62 msb) b in\n (let FStar.Pervasives.Native.Some #_ (FStar.Pervasives.Native.Mktuple2 #_ #_ v _) = _ in\n 1073741824 <= FStar.UInt64.v v /\\\n FStar.UInt64.v msb == FStar.UInt64.v v / 72057594037927936)\n <:\n Type0))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.VarInt.varint_msb_t", "LowParse.Bytes.bytes", "QUIC.UInt62.t", "LowParse.Spec.Base.consumed_length", "FStar.Pervasives.Native.tuple2", "FStar.UInt32.t", "LowParse.Spec.BoundedInt.bounded_integer", "QUIC.Spec.VarInt.synth_u62_msb", "Prims.unit", "FStar.Pervasives.Native.option", "LowParse.Spec.Base.parse", "QUIC.Spec.VarInt.p7", "QUIC.Spec.VarInt.parse_varint_payload_u62", "LowParse.Spec.Combinators.parse_synth_eq", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.BoundedInt.parse_bounded_integer_kind", "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.Spec.VarInt.filter_u62", "LowParse.Spec.Combinators.parse_filter", "LowParse.Spec.Combinators.parse_synth", "QUIC.Spec.VarInt.synth_u62", "QUIC.Spec.VarInt.id_u62", "LowParse.Spec.Combinators.parse_filter_eq", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.int", "Prims.pow2", "Prims._assert", "Prims.l_or", "Prims.b2t", "Prims.op_GreaterThan", "FStar.UInt.size", "FStar.UInt64.n", "FStar.UInt64.v", "QUIC.UInt62.bound", "FStar.Pervasives.Native.uu___is_Some", "Prims.squash", "Prims.l_and", "Prims.op_LessThanOrEqual", "Prims.op_Division", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_varint_payload_62_interval (msb: varint_msb_t) (b: bytes)\n : Lemma (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures\n (let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\ U64.v msb == U64.v v / (72057594037927936)))\nlet parse_varint_payload_62_interval (msb: varint_msb_t) (b: bytes)\n : Lemma (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures\n (let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\ U64.v msb == U64.v v / (72057594037927936))) =", "completed_definiton": "assert_norm (pow2 6 == 64);\nassert_norm (pow2 8 == 256);\nassert (pow2 62 == U64.v U62.bound);\nassert_norm (pow2 32 == 4294967296);\nassert_norm (pow2 24 == 16777216);\nparse_synth_eq (p7) (synth_u62 msb) b;\nparse_filter_eq ((p7) `parse_synth` (synth_u62 msb)) filter_u62 b;\nparse_synth_eq (((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) (id_u62) b;\nlet Some (v, _) = parse (parse_varint_payload_u62 msb) b in\nlet Some (lsb, _) = parse (p7) b in\nsynth_u62_msb msb lsb", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.serialize_bounded_varint", "original_source_type": "val serialize_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer (parse_bounded_varint min max))", "source_type": "val serialize_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer (parse_bounded_varint min max))", "source_definition": "let serialize_bounded_varint min max =\n serialize_synth\n _\n (synth_bounded_varint min max)\n (serialize_varint `serialize_filter` varint_in_bounds min max)\n (synth_bounded_varint_recip min max)\n ()", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 553, "start_col": 2, "end_line": 558, "end_col": 6 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b\n\nlet parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))\n= \n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b;\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) (id_u30) b\n\nlet parse_varint_payload_62_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\\n U64.v msb == U64.v v / (72057594037927936)\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq (p7) (synth_u62 msb) b;\n parse_filter_eq ((p7) `parse_synth` synth_u62 msb) filter_u62 b;\n parse_synth_eq (((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) (id_u62) b;\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n let Some (lsb, _) = parse (p7) b in\n synth_u62_msb msb lsb\n\nlet parse_varint_payload\n (x: U8.t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let kd = uint8.get_bitfield x 6 8 in\n let msb : varint_msb_t = Cast.uint8_to_uint64 (uint8.get_bitfield x 0 6) in\n if kd = 0uy\n then weaken parse_varint_payload_kind (parse_ret msb)\n else if kd = 1uy\n then parse_varint_payload_u14 msb\n else if kd = 2uy\n then parse_varint_payload_u30 msb\n else parse_varint_payload_u62 msb\n\nmodule BF = LowParse.BitFields\n\nlet parse_varint_payload_interval\n (tag: U8.t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\ (\n if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936\n )))\n=\n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n assert (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy);\n let msb8 = uint8.get_bitfield tag 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n if kd = 0uy\n then begin\n assert (U64.v v < 64);\n assert (U8.v msb8 == U64.v v)\n end\n else if kd = 1uy\n then begin\n parse_varint_payload_14_interval msb b\n end else if kd = 2uy\n then\n parse_varint_payload_30_interval msb b\n else\n parse_varint_payload_62_interval msb b\n\n#pop-options\n\nlet parse_varint_payload_and_then_cases_injective : squash (and_then_cases_injective parse_varint_payload) =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n and_then_cases_injective_intro parse_varint_payload (fun x1 x2 b1 b2 ->\n let msb1 = Cast.uint8_to_uint64 (uint8.get_bitfield x1 0 6) in\n let msb2 = Cast.uint8_to_uint64 (uint8.get_bitfield x2 0 6) in\n parse_varint_payload_interval x1 b1;\n parse_varint_payload_interval x2 b2;\n assert (uint8.v (uint8.get_bitfield x1 6 8) == uint8.v (uint8.get_bitfield x2 6 8));\n assert (uint8.v (uint8.get_bitfield x1 0 6) == uint8.v (uint8.get_bitfield x2 0 6));\n BF.get_bitfield_partition_2 6 (U8.v x1) (U8.v x2)\n )\n\nlet parse_varint =\n parse_u8 `and_then` parse_varint_payload\n\nlet parse_varint_eq_aux\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == (match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let b' = Seq.slice b consumed (Seq.length b) in\n match parse (parse_varint_payload hd) b' with\n | None -> None\n | Some (res, consumed') -> Some (res, consumed + consumed')\n ))\n= assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n and_then_eq parse_u8 parse_varint_payload b\n\n#push-options \"--z3rlimit 128\"\n\nlet parse_varint'\n (b: bytes)\n: GTot (option (U62.t & consumed_length b))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (uint8.get_bitfield hd 0 6) in\n let b' = Seq.slice b consumed (Seq.length b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match parse parse_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n else if tag = 2uy\n then begin match parse (parse_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end else begin match parse (parse_u32 `nondep_then` parse_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n\nlet parse_varint_eq\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == parse_varint' b)\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n parse_varint_eq_aux b;\n match parse parse_u8 b with\n | None -> ()\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb8 = uint8.get_bitfield hd 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n let b' = Seq.slice b consumed (Seq.length b) in\n assert (tag == 0uy \\/ tag == 1uy \\/ tag == 2uy \\/ tag == 3uy);\n if tag = 0uy\n then ()\n else if tag = 1uy\n then begin\n parse_synth_eq parse_u8 (synth_u14 msb) b';\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b';\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b'\n end else if tag = 2uy\n then begin\n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b';\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b';\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) id_u30 b'\n end else begin\n parse_synth_eq (p7) (synth_u62 msb) b';\n parse_filter_eq (p7 `parse_synth` (synth_u62 msb)) filter_u62 b';\n parse_synth_eq ((p7 `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) id_u62 b'\n end\n\n#pop-options\n\ninline_for_extraction\nlet get_tag\n (x: U62.t)\n: Tot (bitfield uint8 2)\n= if x `U64.lt` 64uL\n then 0uy\n else if x `U64.lt` 16384uL\n then 1uy\n else if x `U64.lt` 1073741824uL\n then 2uy\n else 3uy\n\ninline_for_extraction\nlet get_msb\n (x: U62.t)\n: Tot varint_msb_t\n= if x `U64.lt` 64uL\n then x\n else if x `U64.lt` 16384uL\n then (x `U64.div` 256uL)\n else if x `U64.lt` 1073741824uL\n then (x `U64.div` 16777216uL)\n else (x `U64.div` 72057594037927936uL)\n\ninline_for_extraction\nlet get_first_byte\n (x: U62.t)\n: Tot U8.t\n= uint8.set_bitfield (uint8.set_bitfield 0uy 0 6 (Cast.uint64_to_uint8 (get_msb x))) 6 8 (get_tag x)\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_varint_payload\n (x: U62.t)\n: GTot bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then Seq.empty\n else if x `U64.lt` 16384uL\n then serialize serialize_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then serialize (serialize_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else serialize (serialize_u32 `serialize_nondep_then` serialize_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\nlet serialize_varint'\n (x: U62.t)\n: GTot bytes\n= serialize serialize_u8 (get_first_byte x) `Seq.append` serialize_varint_payload x\n\n#pop-options\n\n#push-options \"--z3rlimit 1024 --using_facts_from '*,-FStar.Bytes,-FStar.String,-FStar.Char'\"\n\nlet serialize_varint_correct\n (x: U62.t)\n: Lemma\n (let y = serialize_varint' x in\n parse_varint' y == Some (x, Seq.length y)\n )\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n let y = serialize_varint' x in\n let z = get_first_byte x in\n let hd = serialize serialize_u8 z in\n assert (parse parse_u8 hd == Some (z, Seq.length hd));\n assert (Seq.slice hd 0 (Seq.length hd) `Seq.equal` Seq.slice y 0 (Seq.length hd));\n let tl = serialize_varint_payload x in\n assert (Seq.slice y (Seq.length hd) (Seq.length y) `Seq.equal` tl);\n parse_strong_prefix parse_u8 hd y;\n let tg = get_tag x in\n assert (uint8.get_bitfield z 6 8 == tg);\n if tg = 0uy\n then begin\n assert (x `U64.lt` 64uL);\n assert (U64.v x == U8.v (uint8.get_bitfield z 0 6));\n assert (x == Cast.uint8_to_uint64 (uint8.get_bitfield z 0 6));\n assert (y `Seq.equal` hd)\n end else if tg = 1uy\n then begin\n assert (64uL `U64.lte` x /\\ x `U64.lt` 16384uL);\n let x' = Cast.uint64_to_uint8 x in\n assert (parse parse_u8 tl == Some (x', Seq.length tl));\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 256);\n assert (U64.v x == (U8.v (uint8.get_bitfield z 0 6) `Prims.op_Multiply` 256) + U8.v x')\n end else if tg = 2uy\n then begin\n assert (16384uL `U64.lte` x /\\ x `U64.lt` 1073741824uL);\n let x' : bounded_integer 3 = Cast.uint64_to_uint32 (x `U64.rem` 16777216uL) in\n assert (parse (parse_bounded_integer 3) tl == Some (x', Seq.length tl));\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 16777216);\n assert (U64.v x == (U8.v (uint8.get_bitfield z 0 6) `Prims.op_Multiply` 16777216) + U32.v x')\n end else begin\n assert (1073741824uL `U64.lte` x);\n let lo : bounded_integer 3 = Cast.uint64_to_uint32 (x `U64.rem` 16777216uL) in\n let hi = Cast.uint64_to_uint32 (x `U64.div` 16777216uL) in\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 72057594037927936);\n assert (U64.v x == U32.v lo + (16777216 `Prims.op_Multiply` (U32.v hi + (4294967296 `Prims.op_Multiply` U8.v (uint8.get_bitfield z 0 6)))))\n end\n\n#pop-options\n\nlet serialize_varint =\n Classical.forall_intro parse_varint_eq;\n Classical.forall_intro serialize_varint_correct;\n serialize_varint'\n\nlet varint_in_bounds\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: U62.t)\n: GTot bool\n= min <= U64.v x && U64.v x <= max\n\ninline_for_extraction\nnoextract\nlet synth_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: parse_filter_refine (varint_in_bounds min max))\n: Tot (bounded_int32 min max)\n= Cast.uint64_to_uint32 x\n\nlet parse_bounded_varint min max =\n (parse_varint `parse_filter` varint_in_bounds min max) `parse_synth` synth_bounded_varint min max\n\ninline_for_extraction\nnoextract\nlet synth_bounded_varint_recip\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: bounded_int32 min max)\n: Tot (parse_filter_refine (varint_in_bounds min max))\n= Cast.uint32_to_uint64 x", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "min: Prims.nat -> max: Prims.nat{min <= max /\\ max < 4294967296}\n -> LowParse.Spec.Base.serializer (QUIC.Spec.VarInt.parse_bounded_varint min max)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "LowParse.Spec.Combinators.serialize_synth", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.UInt62.t", "QUIC.Spec.VarInt.varint_in_bounds", "LowParse.Spec.BoundedInt.bounded_int32", "LowParse.Spec.Combinators.parse_filter", "QUIC.Spec.VarInt.parse_varint", "QUIC.Spec.VarInt.synth_bounded_varint", "LowParse.Spec.Combinators.serialize_filter", "QUIC.Spec.VarInt.serialize_varint", "QUIC.Spec.VarInt.synth_bounded_varint_recip", "LowParse.Spec.Base.serializer", "QUIC.Spec.VarInt.parse_bounded_varint" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer (parse_bounded_varint min max))\nlet serialize_bounded_varint min max =", "completed_definiton": "serialize_synth _\n (synth_bounded_varint min max)\n (serialize_varint `serialize_filter` (varint_in_bounds min max))\n (synth_bounded_varint_recip min max)\n ()", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.parse_bounded_varint", "original_source_type": "val parse_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.parser parse_varint_kind (LP.bounded_int32 min max))", "source_type": "val parse_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.parser parse_varint_kind (LP.bounded_int32 min max))", "source_definition": "let parse_bounded_varint min max =\n (parse_varint `parse_filter` varint_in_bounds min max) `parse_synth` synth_bounded_varint min max", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 541, "start_col": 2, "end_line": 541, "end_col": 99 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b\n\nlet parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))\n= \n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b;\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) (id_u30) b\n\nlet parse_varint_payload_62_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\\n U64.v msb == U64.v v / (72057594037927936)\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq (p7) (synth_u62 msb) b;\n parse_filter_eq ((p7) `parse_synth` synth_u62 msb) filter_u62 b;\n parse_synth_eq (((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) (id_u62) b;\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n let Some (lsb, _) = parse (p7) b in\n synth_u62_msb msb lsb\n\nlet parse_varint_payload\n (x: U8.t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let kd = uint8.get_bitfield x 6 8 in\n let msb : varint_msb_t = Cast.uint8_to_uint64 (uint8.get_bitfield x 0 6) in\n if kd = 0uy\n then weaken parse_varint_payload_kind (parse_ret msb)\n else if kd = 1uy\n then parse_varint_payload_u14 msb\n else if kd = 2uy\n then parse_varint_payload_u30 msb\n else parse_varint_payload_u62 msb\n\nmodule BF = LowParse.BitFields\n\nlet parse_varint_payload_interval\n (tag: U8.t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\ (\n if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936\n )))\n=\n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n assert (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy);\n let msb8 = uint8.get_bitfield tag 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n if kd = 0uy\n then begin\n assert (U64.v v < 64);\n assert (U8.v msb8 == U64.v v)\n end\n else if kd = 1uy\n then begin\n parse_varint_payload_14_interval msb b\n end else if kd = 2uy\n then\n parse_varint_payload_30_interval msb b\n else\n parse_varint_payload_62_interval msb b\n\n#pop-options\n\nlet parse_varint_payload_and_then_cases_injective : squash (and_then_cases_injective parse_varint_payload) =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n and_then_cases_injective_intro parse_varint_payload (fun x1 x2 b1 b2 ->\n let msb1 = Cast.uint8_to_uint64 (uint8.get_bitfield x1 0 6) in\n let msb2 = Cast.uint8_to_uint64 (uint8.get_bitfield x2 0 6) in\n parse_varint_payload_interval x1 b1;\n parse_varint_payload_interval x2 b2;\n assert (uint8.v (uint8.get_bitfield x1 6 8) == uint8.v (uint8.get_bitfield x2 6 8));\n assert (uint8.v (uint8.get_bitfield x1 0 6) == uint8.v (uint8.get_bitfield x2 0 6));\n BF.get_bitfield_partition_2 6 (U8.v x1) (U8.v x2)\n )\n\nlet parse_varint =\n parse_u8 `and_then` parse_varint_payload\n\nlet parse_varint_eq_aux\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == (match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let b' = Seq.slice b consumed (Seq.length b) in\n match parse (parse_varint_payload hd) b' with\n | None -> None\n | Some (res, consumed') -> Some (res, consumed + consumed')\n ))\n= assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n and_then_eq parse_u8 parse_varint_payload b\n\n#push-options \"--z3rlimit 128\"\n\nlet parse_varint'\n (b: bytes)\n: GTot (option (U62.t & consumed_length b))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (uint8.get_bitfield hd 0 6) in\n let b' = Seq.slice b consumed (Seq.length b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match parse parse_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n else if tag = 2uy\n then begin match parse (parse_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end else begin match parse (parse_u32 `nondep_then` parse_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n\nlet parse_varint_eq\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == parse_varint' b)\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n parse_varint_eq_aux b;\n match parse parse_u8 b with\n | None -> ()\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb8 = uint8.get_bitfield hd 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n let b' = Seq.slice b consumed (Seq.length b) in\n assert (tag == 0uy \\/ tag == 1uy \\/ tag == 2uy \\/ tag == 3uy);\n if tag = 0uy\n then ()\n else if tag = 1uy\n then begin\n parse_synth_eq parse_u8 (synth_u14 msb) b';\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b';\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b'\n end else if tag = 2uy\n then begin\n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b';\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b';\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) id_u30 b'\n end else begin\n parse_synth_eq (p7) (synth_u62 msb) b';\n parse_filter_eq (p7 `parse_synth` (synth_u62 msb)) filter_u62 b';\n parse_synth_eq ((p7 `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) id_u62 b'\n end\n\n#pop-options\n\ninline_for_extraction\nlet get_tag\n (x: U62.t)\n: Tot (bitfield uint8 2)\n= if x `U64.lt` 64uL\n then 0uy\n else if x `U64.lt` 16384uL\n then 1uy\n else if x `U64.lt` 1073741824uL\n then 2uy\n else 3uy\n\ninline_for_extraction\nlet get_msb\n (x: U62.t)\n: Tot varint_msb_t\n= if x `U64.lt` 64uL\n then x\n else if x `U64.lt` 16384uL\n then (x `U64.div` 256uL)\n else if x `U64.lt` 1073741824uL\n then (x `U64.div` 16777216uL)\n else (x `U64.div` 72057594037927936uL)\n\ninline_for_extraction\nlet get_first_byte\n (x: U62.t)\n: Tot U8.t\n= uint8.set_bitfield (uint8.set_bitfield 0uy 0 6 (Cast.uint64_to_uint8 (get_msb x))) 6 8 (get_tag x)\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_varint_payload\n (x: U62.t)\n: GTot bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then Seq.empty\n else if x `U64.lt` 16384uL\n then serialize serialize_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then serialize (serialize_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else serialize (serialize_u32 `serialize_nondep_then` serialize_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\nlet serialize_varint'\n (x: U62.t)\n: GTot bytes\n= serialize serialize_u8 (get_first_byte x) `Seq.append` serialize_varint_payload x\n\n#pop-options\n\n#push-options \"--z3rlimit 1024 --using_facts_from '*,-FStar.Bytes,-FStar.String,-FStar.Char'\"\n\nlet serialize_varint_correct\n (x: U62.t)\n: Lemma\n (let y = serialize_varint' x in\n parse_varint' y == Some (x, Seq.length y)\n )\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n let y = serialize_varint' x in\n let z = get_first_byte x in\n let hd = serialize serialize_u8 z in\n assert (parse parse_u8 hd == Some (z, Seq.length hd));\n assert (Seq.slice hd 0 (Seq.length hd) `Seq.equal` Seq.slice y 0 (Seq.length hd));\n let tl = serialize_varint_payload x in\n assert (Seq.slice y (Seq.length hd) (Seq.length y) `Seq.equal` tl);\n parse_strong_prefix parse_u8 hd y;\n let tg = get_tag x in\n assert (uint8.get_bitfield z 6 8 == tg);\n if tg = 0uy\n then begin\n assert (x `U64.lt` 64uL);\n assert (U64.v x == U8.v (uint8.get_bitfield z 0 6));\n assert (x == Cast.uint8_to_uint64 (uint8.get_bitfield z 0 6));\n assert (y `Seq.equal` hd)\n end else if tg = 1uy\n then begin\n assert (64uL `U64.lte` x /\\ x `U64.lt` 16384uL);\n let x' = Cast.uint64_to_uint8 x in\n assert (parse parse_u8 tl == Some (x', Seq.length tl));\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 256);\n assert (U64.v x == (U8.v (uint8.get_bitfield z 0 6) `Prims.op_Multiply` 256) + U8.v x')\n end else if tg = 2uy\n then begin\n assert (16384uL `U64.lte` x /\\ x `U64.lt` 1073741824uL);\n let x' : bounded_integer 3 = Cast.uint64_to_uint32 (x `U64.rem` 16777216uL) in\n assert (parse (parse_bounded_integer 3) tl == Some (x', Seq.length tl));\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 16777216);\n assert (U64.v x == (U8.v (uint8.get_bitfield z 0 6) `Prims.op_Multiply` 16777216) + U32.v x')\n end else begin\n assert (1073741824uL `U64.lte` x);\n let lo : bounded_integer 3 = Cast.uint64_to_uint32 (x `U64.rem` 16777216uL) in\n let hi = Cast.uint64_to_uint32 (x `U64.div` 16777216uL) in\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 72057594037927936);\n assert (U64.v x == U32.v lo + (16777216 `Prims.op_Multiply` (U32.v hi + (4294967296 `Prims.op_Multiply` U8.v (uint8.get_bitfield z 0 6)))))\n end\n\n#pop-options\n\nlet serialize_varint =\n Classical.forall_intro parse_varint_eq;\n Classical.forall_intro serialize_varint_correct;\n serialize_varint'\n\nlet varint_in_bounds\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: U62.t)\n: GTot bool\n= min <= U64.v x && U64.v x <= max\n\ninline_for_extraction\nnoextract\nlet synth_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: parse_filter_refine (varint_in_bounds min max))\n: Tot (bounded_int32 min max)\n= Cast.uint64_to_uint32 x", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "min: Prims.nat -> max: Prims.nat{min <= max /\\ max < 4294967296}\n -> LowParse.Spec.Base.parser QUIC.Spec.VarInt.parse_varint_kind\n (LowParse.Spec.BoundedInt.bounded_int32 min max)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.UInt62.t", "QUIC.Spec.VarInt.varint_in_bounds", "LowParse.Spec.BoundedInt.bounded_int32", "LowParse.Spec.Combinators.parse_filter", "QUIC.Spec.VarInt.parse_varint", "QUIC.Spec.VarInt.synth_bounded_varint", "LowParse.Spec.Base.parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.parser parse_varint_kind (LP.bounded_int32 min max))\nlet parse_bounded_varint min max =", "completed_definiton": "(parse_varint `parse_filter` (varint_in_bounds min max))\n`parse_synth`\n(synth_bounded_varint min max)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.parse_varint_eq_aux", "original_source_type": "val parse_varint_eq_aux (b: bytes)\n : Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b ==\n (match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let b' = Seq.slice b consumed (Seq.length b) in\n match parse (parse_varint_payload hd) b' with\n | None -> None\n | Some (res, consumed') -> Some (res, consumed + consumed')))", "source_type": "val parse_varint_eq_aux (b: bytes)\n : Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b ==\n (match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let b' = Seq.slice b consumed (Seq.length b) in\n match parse (parse_varint_payload hd) b' with\n | None -> None\n | Some (res, consumed') -> Some (res, consumed + consumed')))", "source_definition": "let parse_varint_eq_aux\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == (match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let b' = Seq.slice b consumed (Seq.length b) in\n match parse (parse_varint_payload hd) b' with\n | None -> None\n | Some (res, consumed') -> Some (res, consumed + consumed')\n ))\n= assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n and_then_eq parse_u8 parse_varint_payload b", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 315, "start_col": 2, "end_line": 319, "end_col": 45 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b\n\nlet parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))\n= \n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b;\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) (id_u30) b\n\nlet parse_varint_payload_62_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\\n U64.v msb == U64.v v / (72057594037927936)\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq (p7) (synth_u62 msb) b;\n parse_filter_eq ((p7) `parse_synth` synth_u62 msb) filter_u62 b;\n parse_synth_eq (((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) (id_u62) b;\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n let Some (lsb, _) = parse (p7) b in\n synth_u62_msb msb lsb\n\nlet parse_varint_payload\n (x: U8.t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let kd = uint8.get_bitfield x 6 8 in\n let msb : varint_msb_t = Cast.uint8_to_uint64 (uint8.get_bitfield x 0 6) in\n if kd = 0uy\n then weaken parse_varint_payload_kind (parse_ret msb)\n else if kd = 1uy\n then parse_varint_payload_u14 msb\n else if kd = 2uy\n then parse_varint_payload_u30 msb\n else parse_varint_payload_u62 msb\n\nmodule BF = LowParse.BitFields\n\nlet parse_varint_payload_interval\n (tag: U8.t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\ (\n if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936\n )))\n=\n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n assert (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy);\n let msb8 = uint8.get_bitfield tag 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n if kd = 0uy\n then begin\n assert (U64.v v < 64);\n assert (U8.v msb8 == U64.v v)\n end\n else if kd = 1uy\n then begin\n parse_varint_payload_14_interval msb b\n end else if kd = 2uy\n then\n parse_varint_payload_30_interval msb b\n else\n parse_varint_payload_62_interval msb b\n\n#pop-options\n\nlet parse_varint_payload_and_then_cases_injective : squash (and_then_cases_injective parse_varint_payload) =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n and_then_cases_injective_intro parse_varint_payload (fun x1 x2 b1 b2 ->\n let msb1 = Cast.uint8_to_uint64 (uint8.get_bitfield x1 0 6) in\n let msb2 = Cast.uint8_to_uint64 (uint8.get_bitfield x2 0 6) in\n parse_varint_payload_interval x1 b1;\n parse_varint_payload_interval x2 b2;\n assert (uint8.v (uint8.get_bitfield x1 6 8) == uint8.v (uint8.get_bitfield x2 6 8));\n assert (uint8.v (uint8.get_bitfield x1 0 6) == uint8.v (uint8.get_bitfield x2 0 6));\n BF.get_bitfield_partition_2 6 (U8.v x1) (U8.v x2)\n )\n\nlet parse_varint =\n parse_u8 `and_then` parse_varint_payload\n\nlet parse_varint_eq_aux\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == (match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let b' = Seq.slice b consumed (Seq.length b) in\n match parse (parse_varint_payload hd) b' with\n | None -> None\n | Some (res, consumed') -> Some (res, consumed + consumed')", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: LowParse.Bytes.bytes\n -> FStar.Pervasives.Lemma\n (ensures\n Prims.pow2 8 == 256 /\\ Prims.pow2 62 == FStar.UInt64.v QUIC.UInt62.bound /\\\n Prims.pow2 24 == 16777216 /\\ Prims.pow2 32 == 4294967296 /\\\n LowParse.Spec.Base.parse QUIC.Spec.VarInt.parse_varint b ==\n (match LowParse.Spec.Base.parse LowParse.Spec.Int.parse_u8 b with\n | FStar.Pervasives.Native.None #_ -> FStar.Pervasives.Native.None\n | FStar.Pervasives.Native.Some #_ (FStar.Pervasives.Native.Mktuple2 #_ #_ hd consumed) ->\n let b' = FStar.Seq.Base.slice b consumed (FStar.Seq.Base.length b) in\n (match LowParse.Spec.Base.parse (QUIC.Spec.VarInt.parse_varint_payload hd) b' with\n | FStar.Pervasives.Native.None #_ -> FStar.Pervasives.Native.None\n | FStar.Pervasives.Native.Some #_ (FStar.Pervasives.Native.Mktuple2 #_ #_ res consumed') ->\n FStar.Pervasives.Native.Some (res, consumed + consumed'))\n <:\n FStar.Pervasives.Native.option (QUIC.UInt62.t * LowParse.Spec.Base.consumed_length b)))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "LowParse.Bytes.bytes", "LowParse.Spec.Combinators.and_then_eq", "LowParse.Spec.Int.parse_u8_kind", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "QUIC.Spec.VarInt.parse_varint_payload_kind", "QUIC.UInt62.t", "QUIC.Spec.VarInt.parse_varint_payload", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.int", "Prims.pow2", "Prims._assert", "Prims.l_or", "Prims.b2t", "Prims.op_GreaterThan", "FStar.UInt.size", "FStar.UInt64.n", "FStar.UInt64.v", "QUIC.UInt62.bound", "Prims.l_True", "Prims.squash", "Prims.l_and", "FStar.Pervasives.Native.option", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Base.consumed_length", "LowParse.Spec.Base.parse", "QUIC.Spec.VarInt.parse_varint", "FStar.Pervasives.Native.None", "FStar.Pervasives.Native.Some", "FStar.Pervasives.Native.Mktuple2", "Prims.op_Addition", "FStar.Seq.Base.seq", "LowParse.Bytes.byte", "FStar.Seq.Base.slice", "FStar.Seq.Base.length", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_varint_eq_aux (b: bytes)\n : Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b ==\n (match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let b' = Seq.slice b consumed (Seq.length b) in\n match parse (parse_varint_payload hd) b' with\n | None -> None\n | Some (res, consumed') -> Some (res, consumed + consumed')))\nlet parse_varint_eq_aux (b: bytes)\n : Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b ==\n (match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let b' = Seq.slice b consumed (Seq.length b) in\n match parse (parse_varint_payload hd) b' with\n | None -> None\n | Some (res, consumed') -> Some (res, consumed + consumed'))) =", "completed_definiton": "assert_norm (pow2 8 == 256);\nassert (pow2 62 == U64.v U62.bound);\nassert_norm (pow2 24 == 16777216);\nassert_norm (pow2 32 == 4294967296);\nand_then_eq parse_u8 parse_varint_payload b", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.bounded_varint_len_correct", "original_source_type": "val bounded_varint_len_correct\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: LP.bounded_int32 min max)\n: Lemma\n (QUIC.Spec.Base.varint_len (Cast.uint32_to_uint64 x) == FStar.Seq.length (LP.serialize (serialize_bounded_varint min max) x))", "source_type": "val bounded_varint_len_correct\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: LP.bounded_int32 min max)\n: Lemma\n (QUIC.Spec.Base.varint_len (Cast.uint32_to_uint64 x) == FStar.Seq.length (LP.serialize (serialize_bounded_varint min max) x))", "source_definition": "let bounded_varint_len_correct\n min max x\n= serialize_synth_eq\n _\n (synth_bounded_varint min max)\n (serialize_varint `serialize_filter` varint_in_bounds min max)\n (synth_bounded_varint_recip min max)\n ()\n x;\n varint_len_correct (Cast.uint32_to_uint64 x)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 570, "start_col": 2, "end_line": 577, "end_col": 46 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b\n\nlet parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))\n= \n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b;\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) (id_u30) b\n\nlet parse_varint_payload_62_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\\n U64.v msb == U64.v v / (72057594037927936)\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq (p7) (synth_u62 msb) b;\n parse_filter_eq ((p7) `parse_synth` synth_u62 msb) filter_u62 b;\n parse_synth_eq (((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) (id_u62) b;\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n let Some (lsb, _) = parse (p7) b in\n synth_u62_msb msb lsb\n\nlet parse_varint_payload\n (x: U8.t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let kd = uint8.get_bitfield x 6 8 in\n let msb : varint_msb_t = Cast.uint8_to_uint64 (uint8.get_bitfield x 0 6) in\n if kd = 0uy\n then weaken parse_varint_payload_kind (parse_ret msb)\n else if kd = 1uy\n then parse_varint_payload_u14 msb\n else if kd = 2uy\n then parse_varint_payload_u30 msb\n else parse_varint_payload_u62 msb\n\nmodule BF = LowParse.BitFields\n\nlet parse_varint_payload_interval\n (tag: U8.t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\ (\n if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936\n )))\n=\n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n assert (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy);\n let msb8 = uint8.get_bitfield tag 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n if kd = 0uy\n then begin\n assert (U64.v v < 64);\n assert (U8.v msb8 == U64.v v)\n end\n else if kd = 1uy\n then begin\n parse_varint_payload_14_interval msb b\n end else if kd = 2uy\n then\n parse_varint_payload_30_interval msb b\n else\n parse_varint_payload_62_interval msb b\n\n#pop-options\n\nlet parse_varint_payload_and_then_cases_injective : squash (and_then_cases_injective parse_varint_payload) =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n and_then_cases_injective_intro parse_varint_payload (fun x1 x2 b1 b2 ->\n let msb1 = Cast.uint8_to_uint64 (uint8.get_bitfield x1 0 6) in\n let msb2 = Cast.uint8_to_uint64 (uint8.get_bitfield x2 0 6) in\n parse_varint_payload_interval x1 b1;\n parse_varint_payload_interval x2 b2;\n assert (uint8.v (uint8.get_bitfield x1 6 8) == uint8.v (uint8.get_bitfield x2 6 8));\n assert (uint8.v (uint8.get_bitfield x1 0 6) == uint8.v (uint8.get_bitfield x2 0 6));\n BF.get_bitfield_partition_2 6 (U8.v x1) (U8.v x2)\n )\n\nlet parse_varint =\n parse_u8 `and_then` parse_varint_payload\n\nlet parse_varint_eq_aux\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == (match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let b' = Seq.slice b consumed (Seq.length b) in\n match parse (parse_varint_payload hd) b' with\n | None -> None\n | Some (res, consumed') -> Some (res, consumed + consumed')\n ))\n= assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n and_then_eq parse_u8 parse_varint_payload b\n\n#push-options \"--z3rlimit 128\"\n\nlet parse_varint'\n (b: bytes)\n: GTot (option (U62.t & consumed_length b))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (uint8.get_bitfield hd 0 6) in\n let b' = Seq.slice b consumed (Seq.length b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match parse parse_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n else if tag = 2uy\n then begin match parse (parse_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end else begin match parse (parse_u32 `nondep_then` parse_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n\nlet parse_varint_eq\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == parse_varint' b)\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n parse_varint_eq_aux b;\n match parse parse_u8 b with\n | None -> ()\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb8 = uint8.get_bitfield hd 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n let b' = Seq.slice b consumed (Seq.length b) in\n assert (tag == 0uy \\/ tag == 1uy \\/ tag == 2uy \\/ tag == 3uy);\n if tag = 0uy\n then ()\n else if tag = 1uy\n then begin\n parse_synth_eq parse_u8 (synth_u14 msb) b';\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b';\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b'\n end else if tag = 2uy\n then begin\n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b';\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b';\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) id_u30 b'\n end else begin\n parse_synth_eq (p7) (synth_u62 msb) b';\n parse_filter_eq (p7 `parse_synth` (synth_u62 msb)) filter_u62 b';\n parse_synth_eq ((p7 `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) id_u62 b'\n end\n\n#pop-options\n\ninline_for_extraction\nlet get_tag\n (x: U62.t)\n: Tot (bitfield uint8 2)\n= if x `U64.lt` 64uL\n then 0uy\n else if x `U64.lt` 16384uL\n then 1uy\n else if x `U64.lt` 1073741824uL\n then 2uy\n else 3uy\n\ninline_for_extraction\nlet get_msb\n (x: U62.t)\n: Tot varint_msb_t\n= if x `U64.lt` 64uL\n then x\n else if x `U64.lt` 16384uL\n then (x `U64.div` 256uL)\n else if x `U64.lt` 1073741824uL\n then (x `U64.div` 16777216uL)\n else (x `U64.div` 72057594037927936uL)\n\ninline_for_extraction\nlet get_first_byte\n (x: U62.t)\n: Tot U8.t\n= uint8.set_bitfield (uint8.set_bitfield 0uy 0 6 (Cast.uint64_to_uint8 (get_msb x))) 6 8 (get_tag x)\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_varint_payload\n (x: U62.t)\n: GTot bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then Seq.empty\n else if x `U64.lt` 16384uL\n then serialize serialize_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then serialize (serialize_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else serialize (serialize_u32 `serialize_nondep_then` serialize_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\nlet serialize_varint'\n (x: U62.t)\n: GTot bytes\n= serialize serialize_u8 (get_first_byte x) `Seq.append` serialize_varint_payload x\n\n#pop-options\n\n#push-options \"--z3rlimit 1024 --using_facts_from '*,-FStar.Bytes,-FStar.String,-FStar.Char'\"\n\nlet serialize_varint_correct\n (x: U62.t)\n: Lemma\n (let y = serialize_varint' x in\n parse_varint' y == Some (x, Seq.length y)\n )\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n let y = serialize_varint' x in\n let z = get_first_byte x in\n let hd = serialize serialize_u8 z in\n assert (parse parse_u8 hd == Some (z, Seq.length hd));\n assert (Seq.slice hd 0 (Seq.length hd) `Seq.equal` Seq.slice y 0 (Seq.length hd));\n let tl = serialize_varint_payload x in\n assert (Seq.slice y (Seq.length hd) (Seq.length y) `Seq.equal` tl);\n parse_strong_prefix parse_u8 hd y;\n let tg = get_tag x in\n assert (uint8.get_bitfield z 6 8 == tg);\n if tg = 0uy\n then begin\n assert (x `U64.lt` 64uL);\n assert (U64.v x == U8.v (uint8.get_bitfield z 0 6));\n assert (x == Cast.uint8_to_uint64 (uint8.get_bitfield z 0 6));\n assert (y `Seq.equal` hd)\n end else if tg = 1uy\n then begin\n assert (64uL `U64.lte` x /\\ x `U64.lt` 16384uL);\n let x' = Cast.uint64_to_uint8 x in\n assert (parse parse_u8 tl == Some (x', Seq.length tl));\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 256);\n assert (U64.v x == (U8.v (uint8.get_bitfield z 0 6) `Prims.op_Multiply` 256) + U8.v x')\n end else if tg = 2uy\n then begin\n assert (16384uL `U64.lte` x /\\ x `U64.lt` 1073741824uL);\n let x' : bounded_integer 3 = Cast.uint64_to_uint32 (x `U64.rem` 16777216uL) in\n assert (parse (parse_bounded_integer 3) tl == Some (x', Seq.length tl));\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 16777216);\n assert (U64.v x == (U8.v (uint8.get_bitfield z 0 6) `Prims.op_Multiply` 16777216) + U32.v x')\n end else begin\n assert (1073741824uL `U64.lte` x);\n let lo : bounded_integer 3 = Cast.uint64_to_uint32 (x `U64.rem` 16777216uL) in\n let hi = Cast.uint64_to_uint32 (x `U64.div` 16777216uL) in\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 72057594037927936);\n assert (U64.v x == U32.v lo + (16777216 `Prims.op_Multiply` (U32.v hi + (4294967296 `Prims.op_Multiply` U8.v (uint8.get_bitfield z 0 6)))))\n end\n\n#pop-options\n\nlet serialize_varint =\n Classical.forall_intro parse_varint_eq;\n Classical.forall_intro serialize_varint_correct;\n serialize_varint'\n\nlet varint_in_bounds\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: U62.t)\n: GTot bool\n= min <= U64.v x && U64.v x <= max\n\ninline_for_extraction\nnoextract\nlet synth_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: parse_filter_refine (varint_in_bounds min max))\n: Tot (bounded_int32 min max)\n= Cast.uint64_to_uint32 x\n\nlet parse_bounded_varint min max =\n (parse_varint `parse_filter` varint_in_bounds min max) `parse_synth` synth_bounded_varint min max\n\ninline_for_extraction\nnoextract\nlet synth_bounded_varint_recip\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: bounded_int32 min max)\n: Tot (parse_filter_refine (varint_in_bounds min max))\n= Cast.uint32_to_uint64 x\n\nlet serialize_bounded_varint min max =\n serialize_synth\n _\n (synth_bounded_varint min max)\n (serialize_varint `serialize_filter` varint_in_bounds min max)\n (synth_bounded_varint_recip min max)\n ()\n\n#push-options \"--z3rlimit 16\"\n\nlet varint_len_correct\n x\n= ()\n\n#pop-options\n\nlet bounded_varint_len_correct", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n min: Prims.nat ->\n max: Prims.nat{min <= max /\\ max < 4294967296} ->\n x: LowParse.Spec.BoundedInt.bounded_int32 min max\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Spec.Base.varint_len (FStar.Int.Cast.uint32_to_uint64 x) ==\n FStar.Seq.Base.length (LowParse.Spec.Base.serialize (QUIC.Spec.VarInt.serialize_bounded_varint\n min\n max)\n x))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "LowParse.Spec.BoundedInt.bounded_int32", "QUIC.Spec.VarInt.varint_len_correct", "FStar.Int.Cast.uint32_to_uint64", "Prims.unit", "LowParse.Spec.Combinators.serialize_synth_eq", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.UInt62.t", "QUIC.Spec.VarInt.varint_in_bounds", "LowParse.Spec.Combinators.parse_filter", "QUIC.Spec.VarInt.parse_varint", "QUIC.Spec.VarInt.synth_bounded_varint", "LowParse.Spec.Combinators.serialize_filter", "QUIC.Spec.VarInt.serialize_varint", "QUIC.Spec.VarInt.synth_bounded_varint_recip" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val bounded_varint_len_correct\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n (x: LP.bounded_int32 min max)\n: Lemma\n (QUIC.Spec.Base.varint_len (Cast.uint32_to_uint64 x) == FStar.Seq.length (LP.serialize (serialize_bounded_varint min max) x))\nlet bounded_varint_len_correct min max x =", "completed_definiton": "serialize_synth_eq _\n (synth_bounded_varint min max)\n (serialize_varint `serialize_filter` (varint_in_bounds min max))\n (synth_bounded_varint_recip min max)\n ()\n x;\nvarint_len_correct (Cast.uint32_to_uint64 x)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.parse_varint_payload_30_interval", "original_source_type": "val parse_varint_payload_30_interval (msb: varint_msb_t) (b: bytes)\n : Lemma (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures\n (let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U64.v msb == U64.v v / 16777216))", "source_type": "val parse_varint_payload_30_interval (msb: varint_msb_t) (b: bytes)\n : Lemma (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures\n (let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U64.v msb == U64.v v / 16777216))", "source_definition": "let parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))\n= \n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b;\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) (id_u30) b", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 193, "start_col": 4, "end_line": 195, "end_col": 113 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b\n\nlet parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "msb: QUIC.Spec.VarInt.varint_msb_t -> b: LowParse.Bytes.bytes\n -> FStar.Pervasives.Lemma\n (requires Some? (LowParse.Spec.Base.parse (QUIC.Spec.VarInt.parse_varint_payload_u30 msb) b))\n (ensures\n (let _ = LowParse.Spec.Base.parse (QUIC.Spec.VarInt.parse_varint_payload_u30 msb) b in\n (let FStar.Pervasives.Native.Some #_ (FStar.Pervasives.Native.Mktuple2 #_ #_ v _) = _ in\n 16384 <= FStar.UInt64.v v /\\ FStar.UInt64.v v < 1073741824 /\\\n FStar.UInt64.v msb == FStar.UInt64.v v / 16777216)\n <:\n Type0))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.VarInt.varint_msb_t", "LowParse.Bytes.bytes", "LowParse.Spec.Combinators.parse_synth_eq", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.BoundedInt.parse_bounded_integer_kind", "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.UInt62.t", "QUIC.Spec.VarInt.filter_u30", "LowParse.Spec.Combinators.parse_filter", "LowParse.Spec.Combinators.parse_synth", "LowParse.Spec.BoundedInt.bounded_integer", "LowParse.Spec.BoundedInt.parse_bounded_integer", "QUIC.Spec.VarInt.synth_u30", "QUIC.Spec.VarInt.id_u30", "Prims.unit", "LowParse.Spec.Combinators.parse_filter_eq", "Prims.b2t", "FStar.Pervasives.Native.uu___is_Some", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Base.consumed_length", "LowParse.Spec.Base.parse", "QUIC.Spec.VarInt.parse_varint_payload_u30", "Prims.squash", "Prims.l_and", "Prims.op_LessThanOrEqual", "FStar.UInt64.v", "Prims.op_LessThan", "Prims.eq2", "Prims.int", "Prims.op_Division", "FStar.Pervasives.Native.option", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_varint_payload_30_interval (msb: varint_msb_t) (b: bytes)\n : Lemma (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures\n (let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U64.v msb == U64.v v / 16777216))\nlet parse_varint_payload_30_interval (msb: varint_msb_t) (b: bytes)\n : Lemma (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures\n (let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U64.v msb == U64.v v / 16777216)) =", "completed_definiton": "parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\nparse_filter_eq ((parse_bounded_integer 3) `parse_synth` (synth_u30 msb)) filter_u30 b;\nparse_synth_eq (((parse_bounded_integer 3) `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30)\n (id_u30)\n b", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.parse_varint_payload_interval", "original_source_type": "val parse_varint_payload_interval (tag: U8.t) (b: bytes)\n : Lemma (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures\n (let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\\n (if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else\n if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else\n if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936)))", "source_type": "val parse_varint_payload_interval (tag: U8.t) (b: bytes)\n : Lemma (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures\n (let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\\n (if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else\n if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else\n if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936)))", "source_definition": "let parse_varint_payload_interval\n (tag: U8.t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\ (\n if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936\n )))\n=\n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n assert (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy);\n let msb8 = uint8.get_bitfield tag 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n if kd = 0uy\n then begin\n assert (U64.v v < 64);\n assert (U8.v msb8 == U64.v v)\n end\n else if kd = 1uy\n then begin\n parse_varint_payload_14_interval msb b\n end else if kd = 2uy\n then\n parse_varint_payload_30_interval msb b\n else\n parse_varint_payload_62_interval msb b", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 259, "start_col": 2, "end_line": 281, "end_col": 42 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b\n\nlet parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))\n= \n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b;\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) (id_u30) b\n\nlet parse_varint_payload_62_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\\n U64.v msb == U64.v v / (72057594037927936)\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq (p7) (synth_u62 msb) b;\n parse_filter_eq ((p7) `parse_synth` synth_u62 msb) filter_u62 b;\n parse_synth_eq (((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) (id_u62) b;\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n let Some (lsb, _) = parse (p7) b in\n synth_u62_msb msb lsb\n\nlet parse_varint_payload\n (x: U8.t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let kd = uint8.get_bitfield x 6 8 in\n let msb : varint_msb_t = Cast.uint8_to_uint64 (uint8.get_bitfield x 0 6) in\n if kd = 0uy\n then weaken parse_varint_payload_kind (parse_ret msb)\n else if kd = 1uy\n then parse_varint_payload_u14 msb\n else if kd = 2uy\n then parse_varint_payload_u30 msb\n else parse_varint_payload_u62 msb\n\nmodule BF = LowParse.BitFields\n\nlet parse_varint_payload_interval\n (tag: U8.t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\ (\n if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936\n )))", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "tag: FStar.UInt8.t -> b: LowParse.Bytes.bytes\n -> FStar.Pervasives.Lemma\n (requires Some? (LowParse.Spec.Base.parse (QUIC.Spec.VarInt.parse_varint_payload tag) b))\n (ensures\n (let _ = LowParse.Spec.Base.parse (QUIC.Spec.VarInt.parse_varint_payload tag) b in\n (let FStar.Pervasives.Native.Some #_ (FStar.Pervasives.Native.Mktuple2 #_ #_ v _) = _ in\n let kd = Mkuint_t?.get_bitfield LowParse.BitFields.uint8 tag 6 8 in\n let msb = Mkuint_t?.get_bitfield LowParse.BitFields.uint8 tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\\n (match kd = 0uy with\n | true -> FStar.UInt64.v v < 64 /\\ FStar.UInt8.v msb = FStar.UInt64.v v\n | _ ->\n (match kd = 1uy with\n | true ->\n 64 <= FStar.UInt64.v v /\\ FStar.UInt64.v v < 16384 /\\\n FStar.UInt8.v msb == FStar.UInt64.v v / 256\n | _ ->\n (match kd = 2uy with\n | true ->\n 16384 <= FStar.UInt64.v v /\\ FStar.UInt64.v v < 1073741824 /\\\n FStar.UInt8.v msb == FStar.UInt64.v v / 16777216\n | _ ->\n 1073741824 <= FStar.UInt64.v v /\\\n FStar.UInt8.v msb == FStar.UInt64.v v / 72057594037927936)\n <:\n Prims.logical)\n <:\n Prims.logical))\n <:\n Type0))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt8.t", "LowParse.Bytes.bytes", "QUIC.UInt62.t", "LowParse.Spec.Base.consumed_length", "Prims.op_Equality", "FStar.UInt8.__uint_to_t", "Prims._assert", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt64.n", "FStar.UInt8.n", "FStar.UInt8.v", "FStar.UInt64.v", "Prims.unit", "Prims.b2t", "Prims.op_LessThan", "Prims.bool", "QUIC.Spec.VarInt.parse_varint_payload_14_interval", "QUIC.Spec.VarInt.parse_varint_payload_30_interval", "QUIC.Spec.VarInt.parse_varint_payload_62_interval", "FStar.UInt64.t", "FStar.Int.Cast.uint8_to_uint64", "FStar.UInt.uint_t", "LowParse.BitFields.__proj__Mkuint_t__item__v", "LowParse.BitFields.uint8", "LowParse.BitFields.get_bitfield", "LowParse.BitFields.__proj__Mkuint_t__item__get_bitfield", "FStar.Pervasives.Native.option", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Base.parse", "QUIC.Spec.VarInt.parse_varint_payload", "FStar.Pervasives.assert_norm", "Prims.pow2", "Prims.op_GreaterThan", "QUIC.UInt62.bound", "FStar.Pervasives.Native.uu___is_Some", "Prims.squash", "Prims.l_and", "Prims.op_LessThanOrEqual", "Prims.op_Division", "Prims.logical", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_varint_payload_interval (tag: U8.t) (b: bytes)\n : Lemma (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures\n (let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\\n (if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else\n if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else\n if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936)))\nlet parse_varint_payload_interval (tag: U8.t) (b: bytes)\n : Lemma (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures\n (let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\\n (if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else\n if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else\n if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936))) =", "completed_definiton": "assert_norm (pow2 6 == 64);\nassert_norm (pow2 8 == 256);\nassert (pow2 62 == U64.v U62.bound);\nassert_norm (pow2 32 == 4294967296);\nassert_norm (pow2 24 == 16777216);\nlet Some (v, _) = parse (parse_varint_payload tag) b in\nlet kd = uint8.get_bitfield tag 6 8 in\nassert (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy);\nlet msb8 = uint8.get_bitfield tag 0 6 in\nlet msb = Cast.uint8_to_uint64 msb8 in\nif kd = 0uy\nthen\n (assert (U64.v v < 64);\n assert (U8.v msb8 == U64.v v))\nelse\n if kd = 1uy\n then parse_varint_payload_14_interval msb b\n else\n if kd = 2uy\n then parse_varint_payload_30_interval msb b\n else parse_varint_payload_62_interval msb b", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.parse_varint_payload_14_interval", "original_source_type": "val parse_varint_payload_14_interval (msb: varint_msb_t) (b: bytes)\n : Lemma (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures\n (let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\ U64.v v < 16384 /\\ U64.v msb == U64.v v / 256))", "source_type": "val parse_varint_payload_14_interval (msb: varint_msb_t) (b: bytes)\n : Lemma (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures\n (let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\ U64.v v < 16384 /\\ U64.v msb == U64.v v / 256))", "source_definition": "let parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 172, "start_col": 3, "end_line": 179, "end_col": 95 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "msb: QUIC.Spec.VarInt.varint_msb_t -> b: LowParse.Bytes.bytes\n -> FStar.Pervasives.Lemma\n (requires Some? (LowParse.Spec.Base.parse (QUIC.Spec.VarInt.parse_varint_payload_u14 msb) b))\n (ensures\n (let _ = LowParse.Spec.Base.parse (QUIC.Spec.VarInt.parse_varint_payload_u14 msb) b in\n (let FStar.Pervasives.Native.Some #_ (FStar.Pervasives.Native.Mktuple2 #_ #_ v _) = _ in\n 64 <= FStar.UInt64.v v /\\ FStar.UInt64.v v < 16384 /\\\n FStar.UInt64.v msb == FStar.UInt64.v v / 256)\n <:\n Type0))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.VarInt.varint_msb_t", "LowParse.Bytes.bytes", "LowParse.Spec.Combinators.parse_synth_eq", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.UInt62.t", "QUIC.Spec.VarInt.filter_u14", "LowParse.Spec.Combinators.parse_filter", "LowParse.Spec.Combinators.parse_synth", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "QUIC.Spec.VarInt.synth_u14", "QUIC.Spec.VarInt.id_u14", "Prims.unit", "LowParse.Spec.Combinators.parse_filter_eq", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.int", "Prims.pow2", "Prims._assert", "Prims.l_or", "Prims.b2t", "Prims.op_GreaterThan", "FStar.UInt.size", "FStar.UInt64.n", "FStar.UInt64.v", "QUIC.UInt62.bound", "FStar.Pervasives.Native.uu___is_Some", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Base.consumed_length", "LowParse.Spec.Base.parse", "QUIC.Spec.VarInt.parse_varint_payload_u14", "Prims.squash", "Prims.l_and", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "Prims.op_Division", "FStar.Pervasives.Native.option", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_varint_payload_14_interval (msb: varint_msb_t) (b: bytes)\n : Lemma (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures\n (let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\ U64.v v < 16384 /\\ U64.v msb == U64.v v / 256))\nlet parse_varint_payload_14_interval (msb: varint_msb_t) (b: bytes)\n : Lemma (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures\n (let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\ U64.v v < 16384 /\\ U64.v msb == U64.v v / 256)) =", "completed_definiton": "assert_norm (pow2 6 == 64);\nassert_norm (pow2 8 == 256);\nassert (pow2 62 == U64.v U62.bound);\nassert_norm (pow2 32 == 4294967296);\nassert_norm (pow2 24 == 16777216);\nparse_synth_eq parse_u8 (synth_u14 msb) b;\nparse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\nparse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.parse_varint_eq", "original_source_type": "val parse_varint_eq (b: bytes)\n : Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == parse_varint' b)", "source_type": "val parse_varint_eq (b: bytes)\n : Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == parse_varint' b)", "source_definition": "let parse_varint_eq\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == parse_varint' b)\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n parse_varint_eq_aux b;\n match parse parse_u8 b with\n | None -> ()\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb8 = uint8.get_bitfield hd 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n let b' = Seq.slice b consumed (Seq.length b) in\n assert (tag == 0uy \\/ tag == 1uy \\/ tag == 2uy \\/ tag == 3uy);\n if tag = 0uy\n then ()\n else if tag = 1uy\n then begin\n parse_synth_eq parse_u8 (synth_u14 msb) b';\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b';\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b'\n end else if tag = 2uy\n then begin\n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b';\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b';\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) id_u30 b'\n end else begin\n parse_synth_eq (p7) (synth_u62 msb) b';\n parse_filter_eq (p7 `parse_synth` (synth_u62 msb)) filter_u62 b';\n parse_synth_eq ((p7 `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) id_u62 b'\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 375, "start_col": 2, "end_line": 405, "end_col": 7 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b\n\nlet parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))\n= \n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b;\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) (id_u30) b\n\nlet parse_varint_payload_62_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\\n U64.v msb == U64.v v / (72057594037927936)\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq (p7) (synth_u62 msb) b;\n parse_filter_eq ((p7) `parse_synth` synth_u62 msb) filter_u62 b;\n parse_synth_eq (((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) (id_u62) b;\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n let Some (lsb, _) = parse (p7) b in\n synth_u62_msb msb lsb\n\nlet parse_varint_payload\n (x: U8.t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let kd = uint8.get_bitfield x 6 8 in\n let msb : varint_msb_t = Cast.uint8_to_uint64 (uint8.get_bitfield x 0 6) in\n if kd = 0uy\n then weaken parse_varint_payload_kind (parse_ret msb)\n else if kd = 1uy\n then parse_varint_payload_u14 msb\n else if kd = 2uy\n then parse_varint_payload_u30 msb\n else parse_varint_payload_u62 msb\n\nmodule BF = LowParse.BitFields\n\nlet parse_varint_payload_interval\n (tag: U8.t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\ (\n if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936\n )))\n=\n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n assert (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy);\n let msb8 = uint8.get_bitfield tag 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n if kd = 0uy\n then begin\n assert (U64.v v < 64);\n assert (U8.v msb8 == U64.v v)\n end\n else if kd = 1uy\n then begin\n parse_varint_payload_14_interval msb b\n end else if kd = 2uy\n then\n parse_varint_payload_30_interval msb b\n else\n parse_varint_payload_62_interval msb b\n\n#pop-options\n\nlet parse_varint_payload_and_then_cases_injective : squash (and_then_cases_injective parse_varint_payload) =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n and_then_cases_injective_intro parse_varint_payload (fun x1 x2 b1 b2 ->\n let msb1 = Cast.uint8_to_uint64 (uint8.get_bitfield x1 0 6) in\n let msb2 = Cast.uint8_to_uint64 (uint8.get_bitfield x2 0 6) in\n parse_varint_payload_interval x1 b1;\n parse_varint_payload_interval x2 b2;\n assert (uint8.v (uint8.get_bitfield x1 6 8) == uint8.v (uint8.get_bitfield x2 6 8));\n assert (uint8.v (uint8.get_bitfield x1 0 6) == uint8.v (uint8.get_bitfield x2 0 6));\n BF.get_bitfield_partition_2 6 (U8.v x1) (U8.v x2)\n )\n\nlet parse_varint =\n parse_u8 `and_then` parse_varint_payload\n\nlet parse_varint_eq_aux\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == (match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let b' = Seq.slice b consumed (Seq.length b) in\n match parse (parse_varint_payload hd) b' with\n | None -> None\n | Some (res, consumed') -> Some (res, consumed + consumed')\n ))\n= assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n and_then_eq parse_u8 parse_varint_payload b\n\n#push-options \"--z3rlimit 128\"\n\nlet parse_varint'\n (b: bytes)\n: GTot (option (U62.t & consumed_length b))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (uint8.get_bitfield hd 0 6) in\n let b' = Seq.slice b consumed (Seq.length b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match parse parse_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n else if tag = 2uy\n then begin match parse (parse_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end else begin match parse (parse_u32 `nondep_then` parse_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n\nlet parse_varint_eq\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: LowParse.Bytes.bytes\n -> FStar.Pervasives.Lemma\n (ensures\n Prims.pow2 8 == 256 /\\ Prims.pow2 62 == FStar.UInt64.v QUIC.UInt62.bound /\\\n Prims.pow2 24 == 16777216 /\\ Prims.pow2 32 == 4294967296 /\\\n LowParse.Spec.Base.parse QUIC.Spec.VarInt.parse_varint b == QUIC.Spec.VarInt.parse_varint' b)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "LowParse.Bytes.bytes", "LowParse.Spec.Base.parse", "FStar.UInt8.t", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Base.consumed_length", "Prims.op_Equality", "FStar.UInt8.__uint_to_t", "Prims.bool", "LowParse.Spec.Combinators.parse_synth_eq", "LowParse.Spec.Combinators.parse_filter_kind", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.UInt62.t", "QUIC.Spec.VarInt.filter_u14", "LowParse.Spec.Combinators.parse_filter", "LowParse.Spec.Combinators.parse_synth", "QUIC.Spec.VarInt.synth_u14", "QUIC.Spec.VarInt.id_u14", "Prims.unit", "LowParse.Spec.Combinators.parse_filter_eq", "LowParse.Spec.BoundedInt.parse_bounded_integer_kind", "QUIC.Spec.VarInt.filter_u30", "LowParse.Spec.BoundedInt.bounded_integer", "LowParse.Spec.BoundedInt.parse_bounded_integer", "QUIC.Spec.VarInt.synth_u30", "QUIC.Spec.VarInt.id_u30", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "QUIC.Spec.VarInt.filter_u62", "FStar.Pervasives.Native.tuple2", "FStar.UInt32.t", "QUIC.Spec.VarInt.p7", "QUIC.Spec.VarInt.synth_u62", "QUIC.Spec.VarInt.id_u62", "Prims._assert", "Prims.l_or", "Prims.eq2", "FStar.Seq.Base.seq", "LowParse.Bytes.byte", "FStar.Seq.Base.slice", "FStar.Seq.Base.length", "FStar.UInt64.t", "Prims.b2t", "Prims.int", "FStar.UInt.size", "FStar.UInt64.v", "FStar.UInt8.v", "FStar.Int.Cast.uint8_to_uint64", "FStar.UInt.uint_t", "LowParse.BitFields.__proj__Mkuint_t__item__v", "LowParse.BitFields.uint8", "LowParse.BitFields.get_bitfield", "LowParse.BitFields.__proj__Mkuint_t__item__get_bitfield", "QUIC.Spec.VarInt.parse_varint_eq_aux", "FStar.Pervasives.assert_norm", "Prims.pow2", "Prims.op_GreaterThan", "FStar.UInt64.n", "QUIC.UInt62.bound", "Prims.l_True", "Prims.squash", "Prims.l_and", "FStar.Pervasives.Native.option", "QUIC.Spec.VarInt.parse_varint", "QUIC.Spec.VarInt.parse_varint'", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_varint_eq (b: bytes)\n : Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == parse_varint' b)\nlet parse_varint_eq (b: bytes)\n : Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == parse_varint' b) =", "completed_definiton": "assert_norm (pow2 8 == 256);\nassert_norm (pow2 6 == 64);\nassert (pow2 62 == U64.v U62.bound);\nassert_norm (pow2 24 == 16777216);\nassert_norm (pow2 32 == 4294967296);\nparse_varint_eq_aux b;\nmatch parse parse_u8 b with\n| None -> ()\n| Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb8 = uint8.get_bitfield hd 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n let b' = Seq.slice b consumed (Seq.length b) in\n assert (tag == 0uy \\/ tag == 1uy \\/ tag == 2uy \\/ tag == 3uy);\n if tag = 0uy\n then ()\n else\n if tag = 1uy\n then\n (parse_synth_eq parse_u8 (synth_u14 msb) b';\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b';\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14)\n id_u14\n b')\n else\n if tag = 2uy\n then\n (parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b';\n parse_filter_eq ((parse_bounded_integer 3) `parse_synth` (synth_u30 msb)) filter_u30 b';\n parse_synth_eq (((parse_bounded_integer 3) `parse_synth` (synth_u30 msb))\n `parse_filter`\n filter_u30)\n id_u30\n b')\n else\n (parse_synth_eq (p7) (synth_u62 msb) b';\n parse_filter_eq (p7 `parse_synth` (synth_u62 msb)) filter_u62 b';\n parse_synth_eq ((p7 `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) id_u62 b')", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fst", "name": "QUIC.Spec.VarInt.serialize_varint_correct", "original_source_type": "val serialize_varint_correct (x: U62.t)\n : Lemma\n (let y = serialize_varint' x in\n parse_varint' y == Some (x, Seq.length y))", "source_type": "val serialize_varint_correct (x: U62.t)\n : Lemma\n (let y = serialize_varint' x in\n parse_varint' y == Some (x, Seq.length y))", "source_definition": "let serialize_varint_correct\n (x: U62.t)\n: Lemma\n (let y = serialize_varint' x in\n parse_varint' y == Some (x, Seq.length y)\n )\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n let y = serialize_varint' x in\n let z = get_first_byte x in\n let hd = serialize serialize_u8 z in\n assert (parse parse_u8 hd == Some (z, Seq.length hd));\n assert (Seq.slice hd 0 (Seq.length hd) `Seq.equal` Seq.slice y 0 (Seq.length hd));\n let tl = serialize_varint_payload x in\n assert (Seq.slice y (Seq.length hd) (Seq.length y) `Seq.equal` tl);\n parse_strong_prefix parse_u8 hd y;\n let tg = get_tag x in\n assert (uint8.get_bitfield z 6 8 == tg);\n if tg = 0uy\n then begin\n assert (x `U64.lt` 64uL);\n assert (U64.v x == U8.v (uint8.get_bitfield z 0 6));\n assert (x == Cast.uint8_to_uint64 (uint8.get_bitfield z 0 6));\n assert (y `Seq.equal` hd)\n end else if tg = 1uy\n then begin\n assert (64uL `U64.lte` x /\\ x `U64.lt` 16384uL);\n let x' = Cast.uint64_to_uint8 x in\n assert (parse parse_u8 tl == Some (x', Seq.length tl));\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 256);\n assert (U64.v x == (U8.v (uint8.get_bitfield z 0 6) `Prims.op_Multiply` 256) + U8.v x')\n end else if tg = 2uy\n then begin\n assert (16384uL `U64.lte` x /\\ x `U64.lt` 1073741824uL);\n let x' : bounded_integer 3 = Cast.uint64_to_uint32 (x `U64.rem` 16777216uL) in\n assert (parse (parse_bounded_integer 3) tl == Some (x', Seq.length tl));\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 16777216);\n assert (U64.v x == (U8.v (uint8.get_bitfield z 0 6) `Prims.op_Multiply` 16777216) + U32.v x')\n end else begin\n assert (1073741824uL `U64.lte` x);\n let lo : bounded_integer 3 = Cast.uint64_to_uint32 (x `U64.rem` 16777216uL) in\n let hi = Cast.uint64_to_uint32 (x `U64.div` 16777216uL) in\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 72057594037927936);\n assert (U64.v x == U32.v lo + (16777216 `Prims.op_Multiply` (U32.v hi + (4294967296 `Prims.op_Multiply` U8.v (uint8.get_bitfield z 0 6)))))\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 474, "start_col": 2, "end_line": 515, "end_col": 5 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\n\nopen LowParse.Spec.BoundedInt\nopen LowParse.Spec.BitFields\n\ninline_for_extraction\nlet parse_varint_payload_kind = {\n parser_kind_low = 0;\n parser_kind_high = Some 7;\n parser_kind_subkind = Some ParserStrong;\n parser_kind_metadata = None;\n}\n\nmodule Cast = FStar.Int.Cast\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\ninline_for_extraction\nlet varint_msb_t = (x: U64.t { U64.v x < 64 })\n\n#push-options \"--z3rlimit 32\"\n\ninline_for_extraction\nlet synth_u14\n (msb: varint_msb_t)\n (lsb: U8.t)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound)\n in\n (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb \n\nlet synth_u14_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u14 msb))\n [SMTPat (synth_injective (synth_u14 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u30\n (msb: varint_msb_t)\n (lsb: bounded_integer 3)\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216)\n in\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n\nlet synth_u30_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u30 msb))\n [SMTPat (synth_injective (synth_u30 msb))]\n= ()\n\ninline_for_extraction\nlet synth_u62\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Tot U62.t\n= [@inline_let] let _ =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296)\n in\n match lsb with\n | (hi, lo) ->\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n\nlet synth_u62_msb\n (msb: varint_msb_t)\n (lsb: (U32.t & bounded_integer 3))\n: Lemma\n (U64.v (synth_u62 msb lsb) / 72057594037927936 == U64.v msb)\n= ()\n\nlet synth_u62_injective\n (msb: varint_msb_t)\n: Lemma\n (synth_injective (synth_u62 msb))\n [SMTPat (synth_injective (synth_u62 msb))]\n= ()\n\ninline_for_extraction\nlet filter_u14\n (y: U62.t)\n: Tot bool\n= 64uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u30\n (y: U62.t)\n: Tot bool\n= 16384uL `U64.lte` y\n\ninline_for_extraction\nlet filter_u62\n (y: U62.t)\n: Tot bool\n= 1073741824uL `U64.lte` y\n \ninline_for_extraction\nlet id_u14\n (y: parse_filter_refine filter_u14)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u14\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_u8 `parse_synth` synth_u14 msb)\n `parse_filter` filter_u14)\n `parse_synth` id_u14)\n \ninline_for_extraction\nlet id_u30\n (y: parse_filter_refine filter_u30)\n: Tot U62.t\n= y\n\nlet parse_varint_payload_u30\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n (((parse_bounded_integer 3 `parse_synth` synth_u30 msb)\n `parse_filter` filter_u30)\n `parse_synth` id_u30)\n\ninline_for_extraction\nlet id_u62\n (y: parse_filter_refine filter_u62)\n: Tot U62.t\n= y\n\nlet p7 = parse_u32 `nondep_then` parse_bounded_integer 3\n\nlet parse_varint_payload_u62\n (msb: varint_msb_t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= \n weaken parse_varint_payload_kind\n ((((p7) `parse_synth` synth_u62 msb)\n `parse_filter` filter_u62)\n `parse_synth` id_u62)\n\nlet parse_varint_payload_14_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u14 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u14 msb) b in\n 64 <= U64.v v /\\\n U64.v v < 16384 /\\\n U64.v msb == U64.v v / 256\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq parse_u8 (synth_u14 msb) b;\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b;\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b\n\nlet parse_varint_payload_30_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u30 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u30 msb) b in\n 16384 <= U64.v v /\\\n U64.v v < 1073741824 /\\\n U64.v msb == U64.v v / 16777216\n ))\n= \n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b;\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b;\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) (id_u30) b\n\nlet parse_varint_payload_62_interval\n (msb: varint_msb_t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload_u62 msb) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n 1073741824 <= U64.v v /\\\n U64.v msb == U64.v v / (72057594037927936)\n ))\n= \n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n parse_synth_eq (p7) (synth_u62 msb) b;\n parse_filter_eq ((p7) `parse_synth` synth_u62 msb) filter_u62 b;\n parse_synth_eq (((p7) `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) (id_u62) b;\n let Some (v, _) = parse (parse_varint_payload_u62 msb) b in\n let Some (lsb, _) = parse (p7) b in\n synth_u62_msb msb lsb\n\nlet parse_varint_payload\n (x: U8.t)\n: Tot (parser parse_varint_payload_kind U62.t)\n= assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let kd = uint8.get_bitfield x 6 8 in\n let msb : varint_msb_t = Cast.uint8_to_uint64 (uint8.get_bitfield x 0 6) in\n if kd = 0uy\n then weaken parse_varint_payload_kind (parse_ret msb)\n else if kd = 1uy\n then parse_varint_payload_u14 msb\n else if kd = 2uy\n then parse_varint_payload_u30 msb\n else parse_varint_payload_u62 msb\n\nmodule BF = LowParse.BitFields\n\nlet parse_varint_payload_interval\n (tag: U8.t)\n (b: bytes)\n: Lemma\n (requires (Some? (parse (parse_varint_payload tag) b)))\n (ensures (\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n let msb = uint8.get_bitfield tag 0 6 in\n (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy) /\\ (\n if kd = 0uy\n then U64.v v < 64 /\\ U8.v msb = U64.v v\n else if kd = 1uy\n then 64 <= U64.v v /\\ U64.v v < 16384 /\\ U8.v msb == U64.v v / 256\n else if kd = 2uy\n then 16384 <= U64.v v /\\ U64.v v < 1073741824 /\\ U8.v msb == U64.v v / 16777216\n else 1073741824 <= U64.v v /\\ U8.v msb == U64.v v / 72057594037927936\n )))\n=\n assert_norm (pow2 6 == 64);\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n let Some (v, _) = parse (parse_varint_payload tag) b in\n let kd = uint8.get_bitfield tag 6 8 in\n assert (kd == 0uy \\/ kd == 1uy \\/ kd == 2uy \\/ kd == 3uy);\n let msb8 = uint8.get_bitfield tag 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n if kd = 0uy\n then begin\n assert (U64.v v < 64);\n assert (U8.v msb8 == U64.v v)\n end\n else if kd = 1uy\n then begin\n parse_varint_payload_14_interval msb b\n end else if kd = 2uy\n then\n parse_varint_payload_30_interval msb b\n else\n parse_varint_payload_62_interval msb b\n\n#pop-options\n\nlet parse_varint_payload_and_then_cases_injective : squash (and_then_cases_injective parse_varint_payload) =\n assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 32 == 4294967296);\n assert_norm (pow2 24 == 16777216);\n and_then_cases_injective_intro parse_varint_payload (fun x1 x2 b1 b2 ->\n let msb1 = Cast.uint8_to_uint64 (uint8.get_bitfield x1 0 6) in\n let msb2 = Cast.uint8_to_uint64 (uint8.get_bitfield x2 0 6) in\n parse_varint_payload_interval x1 b1;\n parse_varint_payload_interval x2 b2;\n assert (uint8.v (uint8.get_bitfield x1 6 8) == uint8.v (uint8.get_bitfield x2 6 8));\n assert (uint8.v (uint8.get_bitfield x1 0 6) == uint8.v (uint8.get_bitfield x2 0 6));\n BF.get_bitfield_partition_2 6 (U8.v x1) (U8.v x2)\n )\n\nlet parse_varint =\n parse_u8 `and_then` parse_varint_payload\n\nlet parse_varint_eq_aux\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == (match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let b' = Seq.slice b consumed (Seq.length b) in\n match parse (parse_varint_payload hd) b' with\n | None -> None\n | Some (res, consumed') -> Some (res, consumed + consumed')\n ))\n= assert_norm (pow2 8 == 256);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n and_then_eq parse_u8 parse_varint_payload b\n\n#push-options \"--z3rlimit 128\"\n\nlet parse_varint'\n (b: bytes)\n: GTot (option (U62.t & consumed_length b))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match parse parse_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (uint8.get_bitfield hd 0 6) in\n let b' = Seq.slice b consumed (Seq.length b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match parse parse_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n else if tag = 2uy\n then begin match parse (parse_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end else begin match parse (parse_u32 `nondep_then` parse_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed + consumed')\n else None\n end\n\nlet parse_varint_eq\n (b: bytes)\n: Lemma\n (pow2 8 == 256 /\\ pow2 62 == U64.v U62.bound /\\ pow2 24 == 16777216 /\\ pow2 32 == 4294967296 /\\\n parse parse_varint b == parse_varint' b)\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n parse_varint_eq_aux b;\n match parse parse_u8 b with\n | None -> ()\n | Some (hd, consumed) ->\n let tag = uint8.get_bitfield hd 6 8 in\n let msb8 = uint8.get_bitfield hd 0 6 in\n let msb = Cast.uint8_to_uint64 msb8 in\n let b' = Seq.slice b consumed (Seq.length b) in\n assert (tag == 0uy \\/ tag == 1uy \\/ tag == 2uy \\/ tag == 3uy);\n if tag = 0uy\n then ()\n else if tag = 1uy\n then begin\n parse_synth_eq parse_u8 (synth_u14 msb) b';\n parse_filter_eq (parse_u8 `parse_synth` (synth_u14 msb)) filter_u14 b';\n parse_synth_eq ((parse_u8 `parse_synth` (synth_u14 msb)) `parse_filter` filter_u14) id_u14 b'\n end else if tag = 2uy\n then begin\n parse_synth_eq (parse_bounded_integer 3) (synth_u30 msb) b';\n parse_filter_eq (parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) filter_u30 b';\n parse_synth_eq ((parse_bounded_integer 3 `parse_synth` (synth_u30 msb)) `parse_filter` filter_u30) id_u30 b'\n end else begin\n parse_synth_eq (p7) (synth_u62 msb) b';\n parse_filter_eq (p7 `parse_synth` (synth_u62 msb)) filter_u62 b';\n parse_synth_eq ((p7 `parse_synth` (synth_u62 msb)) `parse_filter` filter_u62) id_u62 b'\n end\n\n#pop-options\n\ninline_for_extraction\nlet get_tag\n (x: U62.t)\n: Tot (bitfield uint8 2)\n= if x `U64.lt` 64uL\n then 0uy\n else if x `U64.lt` 16384uL\n then 1uy\n else if x `U64.lt` 1073741824uL\n then 2uy\n else 3uy\n\ninline_for_extraction\nlet get_msb\n (x: U62.t)\n: Tot varint_msb_t\n= if x `U64.lt` 64uL\n then x\n else if x `U64.lt` 16384uL\n then (x `U64.div` 256uL)\n else if x `U64.lt` 1073741824uL\n then (x `U64.div` 16777216uL)\n else (x `U64.div` 72057594037927936uL)\n\ninline_for_extraction\nlet get_first_byte\n (x: U62.t)\n: Tot U8.t\n= uint8.set_bitfield (uint8.set_bitfield 0uy 0 6 (Cast.uint64_to_uint8 (get_msb x))) 6 8 (get_tag x)\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize_varint_payload\n (x: U62.t)\n: GTot bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then Seq.empty\n else if x `U64.lt` 16384uL\n then serialize serialize_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then serialize (serialize_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else serialize (serialize_u32 `serialize_nondep_then` serialize_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\nlet serialize_varint'\n (x: U62.t)\n: GTot bytes\n= serialize serialize_u8 (get_first_byte x) `Seq.append` serialize_varint_payload x\n\n#pop-options\n\n#push-options \"--z3rlimit 1024 --using_facts_from '*,-FStar.Bytes,-FStar.String,-FStar.Char'\"\n\nlet serialize_varint_correct\n (x: U62.t)\n: Lemma\n (let y = serialize_varint' x in\n parse_varint' y == Some (x, Seq.length y)\n )", "dependencies": { "source_file": "QUIC.Spec.VarInt.fst", "checked_file": "QUIC.Spec.VarInt.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "LowParse.Spec.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BitFields" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 1024, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: QUIC.UInt62.t\n -> FStar.Pervasives.Lemma\n (ensures\n (let y = QUIC.Spec.VarInt.serialize_varint' x in\n QUIC.Spec.VarInt.parse_varint' y ==\n FStar.Pervasives.Native.Some (x, FStar.Seq.Base.length y)))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.UInt62.t", "Prims.op_Equality", "FStar.UInt8.t", "FStar.UInt8.__uint_to_t", "Prims._assert", "FStar.Seq.Base.equal", "LowParse.Bytes.byte", "Prims.unit", "Prims.eq2", "FStar.UInt64.t", "Prims.l_or", "Prims.b2t", "Prims.op_LessThan", "FStar.UInt64.v", "QUIC.UInt62.bound", "Prims.int", "FStar.UInt.size", "FStar.UInt64.n", "FStar.UInt8.n", "FStar.UInt8.v", "LowParse.BitFields.__proj__Mkuint_t__item__get_bitfield", "LowParse.BitFields.uint8", "FStar.Int.Cast.uint8_to_uint64", "FStar.UInt64.lt", "FStar.UInt64.__uint_to_t", "Prims.bool", "Prims.op_Addition", "Prims.op_Multiply", "Prims.op_Division", "FStar.Pervasives.Native.option", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Base.consumed_length", "LowParse.Spec.Base.parse", "LowParse.Spec.Int.parse_u8", "FStar.Pervasives.Native.Some", "FStar.Pervasives.Native.Mktuple2", "FStar.Seq.Base.length", "Prims.op_Modulus", "Prims.pow2", "FStar.Int.Cast.uint64_to_uint8", "Prims.l_and", "FStar.UInt64.lte", "FStar.UInt32.v", "LowParse.Spec.BoundedInt.bounded_integer", "LowParse.Spec.BoundedInt.parse_bounded_integer", "FStar.Int.Cast.uint64_to_uint32", "FStar.UInt64.rem", "FStar.UInt32.t", "FStar.UInt64.div", "FStar.UInt64.uint_to_t", "FStar.UInt.uint_t", "LowParse.BitFields.__proj__Mkuint_t__item__v", "LowParse.BitFields.get_bitfield", "LowParse.BitFields.bitfield", "QUIC.Spec.VarInt.get_tag", "LowParse.Spec.Base.parse_strong_prefix", "LowParse.Spec.Int.parse_u8_kind", "FStar.Seq.Base.slice", "LowParse.Bytes.bytes", "QUIC.Spec.VarInt.serialize_varint_payload", "LowParse.Spec.Base.serialize", "LowParse.Spec.Int.serialize_u8", "QUIC.Spec.VarInt.get_first_byte", "QUIC.Spec.VarInt.serialize_varint'", "FStar.Pervasives.assert_norm", "Prims.op_GreaterThan", "Prims.l_True", "Prims.squash", "QUIC.Spec.VarInt.parse_varint'", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_varint_correct (x: U62.t)\n : Lemma\n (let y = serialize_varint' x in\n parse_varint' y == Some (x, Seq.length y))\nlet serialize_varint_correct (x: U62.t)\n : Lemma\n (let y = serialize_varint' x in\n parse_varint' y == Some (x, Seq.length y)) =", "completed_definiton": "assert_norm (pow2 8 == 256);\nassert_norm (pow2 6 == 64);\nassert (pow2 62 == U64.v U62.bound);\nassert_norm (pow2 24 == 16777216);\nassert_norm (pow2 32 == 4294967296);\nlet y = serialize_varint' x in\nlet z = get_first_byte x in\nlet hd = serialize serialize_u8 z in\nassert (parse parse_u8 hd == Some (z, Seq.length hd));\nassert ((Seq.slice hd 0 (Seq.length hd)) `Seq.equal` (Seq.slice y 0 (Seq.length hd)));\nlet tl = serialize_varint_payload x in\nassert ((Seq.slice y (Seq.length hd) (Seq.length y)) `Seq.equal` tl);\nparse_strong_prefix parse_u8 hd y;\nlet tg = get_tag x in\nassert (uint8.get_bitfield z 6 8 == tg);\nif tg = 0uy\nthen\n (assert (x `U64.lt` 64uL);\n assert (U64.v x == U8.v (uint8.get_bitfield z 0 6));\n assert (x == Cast.uint8_to_uint64 (uint8.get_bitfield z 0 6));\n assert (y `Seq.equal` hd))\nelse\n if tg = 1uy\n then\n (assert (64uL `U64.lte` x /\\ x `U64.lt` 16384uL);\n let x' = Cast.uint64_to_uint8 x in\n assert (parse parse_u8 tl == Some (x', Seq.length tl));\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 256);\n assert (U64.v x == ((U8.v (uint8.get_bitfield z 0 6)) `Prims.op_Multiply` 256) + U8.v x'))\n else\n if tg = 2uy\n then\n (assert (16384uL `U64.lte` x /\\ x `U64.lt` 1073741824uL);\n let x':bounded_integer 3 = Cast.uint64_to_uint32 (x `U64.rem` 16777216uL) in\n assert (parse (parse_bounded_integer 3) tl == Some (x', Seq.length tl));\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 16777216);\n assert (U64.v x ==\n ((U8.v (uint8.get_bitfield z 0 6)) `Prims.op_Multiply` 16777216) + U32.v x'))\n else\n (assert (1073741824uL `U64.lte` x);\n let lo:bounded_integer 3 = Cast.uint64_to_uint32 (x `U64.rem` 16777216uL) in\n let hi = Cast.uint64_to_uint32 (x `U64.div` 16777216uL) in\n assert (U8.v (uint8.get_bitfield z 0 6) == U64.v x / 72057594037927936);\n assert (U64.v x ==\n U32.v lo +\n (16777216\n `Prims.op_Multiply`\n (U32.v hi + (4294967296 `Prims.op_Multiply` (U8.v (uint8.get_bitfield z 0 6)))))))", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Base.fst", "name": "QUIC.Secret.Int.Base.v", "original_source_type": "val v (#t #l: _) (u: int_t t l) : GTot (range_t t)", "source_type": "val v (#t #l: _) (u: int_t t l) : GTot (range_t t)", "source_definition": "let v #t #l (u: int_t t l) : GTot (range_t t) =\n v u", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 11, "start_col": 2, "end_line": 11, "end_col": 5 }, "file_context": "module QUIC.Secret.Int.Base\ninclude Lib.IntTypes\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\nunfold", "dependencies": { "source_file": "QUIC.Secret.Int.Base.fst", "checked_file": "QUIC.Secret.Int.Base.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "Lib.IntTypes" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "u5: Lib.IntTypes.int_t t l -> Prims.GTot (Lib.IntTypes.range_t t)", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Lib.IntTypes.secrecy_level", "Lib.IntTypes.int_t", "Lib.IntTypes.v", "Lib.IntTypes.range_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val v (#t #l: _) (u: int_t t l) : GTot (range_t t)\nlet v #t #l (u: int_t t l) : GTot (range_t t) =", "completed_definiton": "v u", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.Base.fst", "name": "QUIC.Secret.Int.Base.supported_type", "original_source_type": "", "source_type": "val supported_type : _: Lib.IntTypes.inttype -> Prims.bool", "source_definition": "let supported_type = function\n | U8 | U16 | U32 | U64 -> true\n | _ -> false", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 14, "start_col": 21, "end_line": 16, "end_col": 14 }, "file_context": "module QUIC.Secret.Int.Base\ninclude Lib.IntTypes\n\nmodule U8 = FStar.UInt8\nmodule U16 = FStar.UInt16\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\nunfold\nlet v #t #l (u: int_t t l) : GTot (range_t t) =\n v u", "dependencies": { "source_file": "QUIC.Secret.Int.Base.fst", "checked_file": "QUIC.Secret.Int.Base.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "Lib.IntTypes" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Lib.IntTypes.inttype -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let supported_type =", "completed_definiton": "function\n| U8 | U16 | U32 | U64 -> true\n| _ -> false", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.payload_and_pn_length_prop", "original_source_type": "val payload_and_pn_length_prop (x: U62.t) : Tot bool", "source_type": "val payload_and_pn_length_prop (x: U62.t) : Tot bool", "source_definition": "let payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 109, "start_col": 2, "end_line": 109, "end_col": 18 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: QUIC.UInt62.t -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.UInt62.t", "FStar.UInt64.gte", "FStar.UInt64.__uint_to_t", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val payload_and_pn_length_prop (x: U62.t) : Tot bool\nlet payload_and_pn_length_prop (x: U62.t) : Tot bool =", "completed_definiton": "x `U64.gte` 20uL", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "original_source_type": "", "source_type": "val payload_and_pn_length_t' : Type0", "source_definition": "let payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 111, "start_col": 31, "end_line": 111, "end_col": 80 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.UInt62.t", "QUIC.Spec.Header.Public.payload_and_pn_length_prop" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let payload_and_pn_length_t' =", "completed_definiton": "LP.parse_filter_refine payload_and_pn_length_prop", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.first_byte_of_header", "original_source_type": "val first_byte_of_header (short_dcid_len: short_dcid_len_t) (m: header' short_dcid_len)\n : Tot (LPB.bitsum'_type first_byte)", "source_type": "val first_byte_of_header (short_dcid_len: short_dcid_len_t) (m: header' short_dcid_len)\n : Tot (LPB.bitsum'_type first_byte)", "source_definition": "let first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 96, "start_col": 2, "end_line": 96, "end_col": 73 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "short_dcid_len: QUIC.Spec.Base.short_dcid_len_t -> m: QUIC.Spec.Header.Public.header' short_dcid_len\n -> LowParse.Spec.BitSum.bitsum'_type QUIC.Spec.Header.Public.first_byte", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.first_byte_of_header'", "LowParse.Spec.BitSum.bitsum'_type", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "FStar.Pervasives.id" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val first_byte_of_header (short_dcid_len: short_dcid_len_t) (m: header' short_dcid_len)\n : Tot (LPB.bitsum'_type first_byte)\nlet first_byte_of_header (short_dcid_len: short_dcid_len_t) (m: header' short_dcid_len)\n : Tot (LPB.bitsum'_type first_byte) =", "completed_definiton": "first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.long_retry_body_t", "original_source_type": "", "source_type": "val long_retry_body_t : Type0", "source_definition": "let long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 117, "start_col": 24, "end_line": 117, "end_col": 73 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Pervasives.Native.tuple2", "QUIC.Spec.Header.Public.common_long_t", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let long_retry_body_t =", "completed_definiton": "(common_long_t & LP.parse_bounded_vlbytes_t 0 20)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.long_zero_rtt_body_t", "original_source_type": "", "source_type": "val long_zero_rtt_body_t : Type0", "source_definition": "let long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 115, "start_col": 27, "end_line": 115, "end_col": 69 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Pervasives.Native.tuple2", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.payload_and_pn_length_t'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let long_zero_rtt_body_t =", "completed_definiton": "(common_long_t & payload_and_pn_length_t')", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.parse_header", "original_source_type": "val parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))", "source_type": "val parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))", "source_definition": "let parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 285, "start_col": 2, "end_line": 291, "end_col": 38 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "short_dcid_len: QUIC.Spec.Base.short_dcid_len_t\n -> LowParse.Spec.Base.parser (QUIC.Spec.Header.Public.parse_header_kind short_dcid_len)\n (QUIC.Spec.Header.Public.header' short_dcid_len)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "LowParse.Spec.BitSum.parse_bitsum", "LowParse.Spec.Int.parse_u8_kind", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.first_byte_of_header", "QUIC.Spec.Header.Public.header_body_type", "QUIC.Spec.Header.Public.header_synth", "LowParse.Spec.Int.parse_u8", "QUIC.Spec.Header.Public.parse_header_body", "LowParse.Spec.Base.parser", "QUIC.Spec.Header.Public.parse_header_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\nlet parse_header (short_dcid_len: short_dcid_len_t)\n : Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len)) =", "completed_definiton": "LPB.parse_bitsum first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.common_long_t", "original_source_type": "val common_long_t:Type0", "source_type": "val common_long_t:Type0", "source_definition": "let common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 103, "start_col": 2, "end_line": 103, "end_col": 79 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Pervasives.Native.tuple2", "FStar.UInt32.t", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val common_long_t:Type0\nlet common_long_t:Type0 =", "completed_definiton": "(U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.long_handshake_body_t", "original_source_type": "", "source_type": "val long_handshake_body_t : Type0", "source_definition": "let long_handshake_body_t = (common_long_t & payload_and_pn_length_t')", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 116, "start_col": 28, "end_line": 116, "end_col": 70 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Pervasives.Native.tuple2", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.payload_and_pn_length_t'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let long_handshake_body_t =", "completed_definiton": "(common_long_t & payload_and_pn_length_t')", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.first_byte", "original_source_type": "val first_byte:LPB.bitsum' LPB.uint8 8", "source_type": "val first_byte:LPB.bitsum' LPB.uint8 8", "source_definition": "let first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 47, "start_col": 2, "end_line": 62, "end_col": 3 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.BitSum.bitsum' LowParse.BitFields.uint8 8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.BitSum.BitSum'", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.header_form_t", "QUIC.Spec.Header.Public.header_form", "LowParse.Spec.Enum.enum_key", "LowParse.BitFields.bitfield", "Prims.op_Subtraction", "Prims.unit", "QUIC.Spec.Header.Public.fixed_bit", "LowParse.Spec.BitSum.BitField", "LowParse.Spec.BitSum.BitStop", "LowParse.Spec.BitSum.bitsum'", "QUIC.Spec.Header.Public.long_packet_type_t", "QUIC.Spec.Header.Public.long_packet_type" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val first_byte:LPB.bitsum' LPB.uint8 8\nlet first_byte:LPB.bitsum' LPB.uint8 8 =", "completed_definiton": "LPB.BitSum' _\n _\n header_form\n (function\n | Short -> LPB.BitSum' _ _ fixed_bit (fun _ -> LPB.BitField 1 (LPB.BitField 5 (LPB.BitStop ())))\n | Long ->\n LPB.BitSum' _\n _\n fixed_bit\n (fun _ -> LPB.BitSum' _ _ long_packet_type (function | _ -> LPB.BitField 4 (LPB.BitStop ()))\n ))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.serialize_header", "original_source_type": "val serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))", "source_type": "val serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))", "source_definition": "let serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))\n= LPB.serialize_bitsum\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 324, "start_col": 2, "end_line": 336, "end_col": 42 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop\n\nlet serialize_long_zero_rtt_body : LP.serializer parse_long_zero_rtt_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_handshake_body : LP.serializer parse_long_handshake_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_retry_body : LP.serializer parse_long_retry_body = serialize_common_long `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20\nlet serialize_long_initial_body : LP.serializer parse_long_initial_body = serialize_common_long `LP.serialize_nondep_then` (\n LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length)\n\nlet serialize_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.serialize_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize_flbytes (U32.v short_dcid_len))\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n serialize_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n serialize_long_handshake_body\n | (| Long, (| (), (| Initial, () |) |) |) ->\n serialize_long_initial_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n serialize_long_retry_body\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "short_dcid_len: QUIC.Spec.Base.short_dcid_len_t\n -> LowParse.Spec.Base.serializer (QUIC.Spec.Header.Public.parse_header short_dcid_len)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "LowParse.Spec.BitSum.serialize_bitsum", "LowParse.Spec.Int.parse_u8_kind", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.first_byte_of_header", "QUIC.Spec.Header.Public.header_body_type", "QUIC.Spec.Header.Public.header_synth", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "QUIC.Spec.Header.Public.parse_header_body", "QUIC.Spec.Header.Public.serialize_header_body", "LowParse.Spec.Base.serializer", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))\nlet serialize_header (short_dcid_len: short_dcid_len_t)\n : Tot (LP.serializer (parse_header short_dcid_len)) =", "completed_definiton": "LPB.serialize_bitsum #LP.parse_u8_kind #8 #U8.t first_byte #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len)\n (header_synth short_dcid_len) #LP.parse_u8 LP.serialize_u8 #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.header_len'_correct", "original_source_type": "val header_len'_correct\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h))", "source_type": "val header_len'_correct\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h))", "source_definition": "let header_len'_correct\n short_dcid_len h\n= match h with\n | PShort pb spin dcid ->\n header_len'_correct_short short_dcid_len pb spin dcid\n | PLong pb version dcid scid spec ->\n begin match spec with\n | PInitial token payload_and_pn_length ->\n header_len'_correct_long_initial short_dcid_len pb version dcid scid token payload_and_pn_length\n | PHandshake payload_and_pn_length ->\n header_len'_correct_long_handshake short_dcid_len pb version dcid scid payload_and_pn_length\n | PZeroRTT payload_and_pn_length ->\n header_len'_correct_long_zero_rtt short_dcid_len pb version dcid scid payload_and_pn_length\n | PRetry odcid ->\n header_len'_correct_long_retry short_dcid_len version dcid scid pb odcid\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 687, "start_col": 2, "end_line": 700, "end_col": 7 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop\n\nlet serialize_long_zero_rtt_body : LP.serializer parse_long_zero_rtt_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_handshake_body : LP.serializer parse_long_handshake_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_retry_body : LP.serializer parse_long_retry_body = serialize_common_long `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20\nlet serialize_long_initial_body : LP.serializer parse_long_initial_body = serialize_common_long `LP.serialize_nondep_then` (\n LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length)\n\nlet serialize_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.serialize_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize_flbytes (U32.v short_dcid_len))\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n serialize_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n serialize_long_handshake_body\n | (| Long, (| (), (| Initial, () |) |) |) ->\n serialize_long_initial_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n serialize_long_retry_body\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))\n= LPB.serialize_bitsum\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len) h ==\n LP.serialize LP.serialize_u8 (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h)) `Seq.append`\n LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n= LPB.serialize_bitsum_eq'\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n h\n\n#push-options \"--z3rlimit 64\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h\n ))\n= serialize_header_eq short_dcid_len1 h;\n serialize_header_eq short_dcid_len2 h;\n ()\n\n#pop-options\n\nlet serialize_header_is_short\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in\n assert (Seq.index s 0 == x);\n assert (PShort? h <==> LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Short <: U8.t))\n\nlet first_byte_is_retry\n (k: LPB.bitsum'_type first_byte)\n: GTot bool\n= match k with\n | (| Long, (| (), (| Retry, (unused, ()) |) |) |) -> true\n | _ -> false\n\nlet first_byte_is_retry_correct\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (is_retry h <==> first_byte_is_retry (first_byte_of_header short_dcid_len h))\n= ()\n\n#push-options \"--z3rlimit 512\"\n#restart-solver\n\nlet serialize_header_is_retry\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in \n assert (Seq.index s 0 == x);\n assert (is_retry h <==> (\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Long <: U8.t) /\\\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 4 6 == (LowParse.Spec.Enum.enum_repr_of_key long_packet_type Retry <: U8.t)\n ))\n\n#pop-options\n\n#restart-solver\n\n\nlet is_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4))\n= ()\n\nlet set_valid_bitfield_intro'\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb\n )\n= is_valid_bitfield_intro short_dcid_len h\n\nlet set_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb /\\\n LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) == LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)\n )\n= set_valid_bitfield_intro' short_dcid_len h new_pb;\n LPB.bitsum'_key_of_t_set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb\n\nlet mk_header_body_set_valid_bitfield\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) (set_protected_bits h new_pb) ==\n mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h)\n= ()\n\n#push-options \"--z3rlimit 512\"\n\n#restart-solver\n\nlet serialize_get_protected_bits\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (let sq = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length sq > 0 /\\\n get_protected_bits h == LPB.uint8.LPB.get_bitfield (Seq.head sq) 0 (if PShort? h then 5 else 4))\n= let sq = LP.serialize (serialize_header short_dcid_len) h in\n serialize_header_eq\n short_dcid_len\n h;\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h))\n\n#restart-solver\n\nlet serialize_set_protected_bits\n short_dcid_len h new_pb\n= let h' = set_protected_bits h new_pb in\n let sq = LP.serialize (serialize_header short_dcid_len) h in\n let sq' = LP.serialize (serialize_header short_dcid_len) h' in\n set_valid_bitfield_intro short_dcid_len h new_pb;\n serialize_header_eq\n short_dcid_len\n h;\n serialize_header_eq\n short_dcid_len\n h';\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h));\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h'));\n LPB.set_valid_bitfield_correct first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb;\n mk_header_body_set_valid_bitfield short_dcid_len h new_pb;\n assert (LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h'))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h') h') == LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h));\n assert (Seq.tail sq' `Seq.equal` LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h'))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h') h'));\n assert (Seq.tail sq `Seq.equal` LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n\n#pop-options\n\n\nlet header_len'_correct_short\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 5)\n (spin: bool)\n (dcid: vlbytes 0 20)\n: Lemma\n (requires (let h = PShort protected_bits spin dcid in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PShort protected_bits spin dcid in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)\n ))\n= \n let h = PShort protected_bits spin dcid in\n serialize_header_eq short_dcid_len h;\n let tg = first_byte_of_header short_dcid_len h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_length LP.serialize_u8 x;\n assert_norm (first_byte_of_header short_dcid_len (PShort protected_bits spin dcid) == (| Short, (| (), ((if spin then 1uy else 0uy), (protected_bits, ()) ) |) |) );\n assert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len (PShort protected_bits spin dcid)) == (| Short, (| (), () |) |) );\n LP.serialize_length (LP.serialize_flbytes (U32.v short_dcid_len)) dcid\n\nlet length_serialize_common_long\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n: Lemma\n (Seq.length (LP.serialize serialize_common_long (version, (dcid, scid))) == 6 + FB.length dcid + FB.length scid)\n= LP.serialize_nondep_then_eq LP.serialize_u32 (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20) (version, (dcid, scid));\n LP.serialize_length LP.serialize_u32 version;\n LP.serialize_nondep_then_eq (LP.serialize_bounded_vlbytes 0 20) (LP.serialize_bounded_vlbytes 0 20) (dcid, scid);\n LP.length_serialize_bounded_vlbytes 0 20 dcid;\n LP.length_serialize_bounded_vlbytes 0 20 scid\n\nlet length_serialize_payload_and_pn_length\n (payload_and_pn_length: payload_and_pn_length_t)\n: Lemma\n (Seq.length (LP.serialize serialize_payload_and_pn_length payload_and_pn_length) == varint_len payload_and_pn_length)\n= VI.varint_len_correct payload_and_pn_length\n\n#pop-options\n\n#push-options \"--z3rlimit 128 --query_stats\"\n\n#restart-solver\n\nlet header_len'_correct_long_initial\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n (token: vlbytes 0 token_max_len)\n (payload_and_pn_length: payload_and_pn_length_t)\n: Lemma\n (requires (\n let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)\n ))\n=\n let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n serialize_header_eq short_dcid_len h;\n let tg : LPB.bitsum'_type first_byte = (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) in\n assert_norm (first_byte_of_header short_dcid_len h == tg);\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_length LP.serialize_u8 x;\n let kt : LPB.bitsum'_key_type first_byte = (| Long, (| (), (| Initial, () |) |) |) in\n assert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h) == kt );\n LP.length_serialize_nondep_then serialize_common_long (LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length) (version, (dcid, scid)) (token, payload_and_pn_length);\n length_serialize_common_long version dcid scid;\n LP.length_serialize_nondep_then (LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len)) (serialize_payload_and_pn_length) token payload_and_pn_length;\n LP.length_serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) token;\n VI.bounded_varint_len_correct 0 token_max_len (FB.len token);\n length_serialize_payload_and_pn_length payload_and_pn_length\n\n#pop-options\n\n#push-options \"--z3rlimit 128 --query_stats\"\n\n#restart-solver\n\nlet header_len'_correct_long_handshake\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n (payload_and_pn_length: payload_and_pn_length_t)\n: Lemma\n (requires (\n let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)\n ))\n=\n let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\n serialize_header_eq short_dcid_len h;\n let tg : LPB.bitsum'_type first_byte = (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) in\n assert_norm (first_byte_of_header short_dcid_len h == tg);\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_length LP.serialize_u8 x;\n let kt : LPB.bitsum'_key_type first_byte = (| Long, (| (), (| Handshake, () |) |) |) in\n assert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h) == kt );\n LP.length_serialize_nondep_then serialize_common_long serialize_payload_and_pn_length (version, (dcid, scid)) payload_and_pn_length;\n length_serialize_common_long version dcid scid;\n length_serialize_payload_and_pn_length payload_and_pn_length\n\n#restart-solver\n\nlet header_len'_correct_long_zero_rtt\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n (payload_and_pn_length: payload_and_pn_length_t)\n: Lemma\n (requires (\n let h = PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length) in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)\n ))\n=\n let h = PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length) in\n serialize_header_eq short_dcid_len h;\n let tg : LPB.bitsum'_type first_byte = (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) in\n assert_norm (first_byte_of_header short_dcid_len h == tg);\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_length LP.serialize_u8 x;\n let kt : LPB.bitsum'_key_type first_byte = (| Long, (| (), (| ZeroRTT, () |) |) |) in\n assert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h) == kt );\n LP.length_serialize_nondep_then serialize_common_long serialize_payload_and_pn_length (version, (dcid, scid)) payload_and_pn_length;\n length_serialize_common_long version dcid scid;\n length_serialize_payload_and_pn_length payload_and_pn_length\n\n#restart-solver\n\nlet header_len'_correct_long_retry\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n (unused: bitfield 4)\n (odcid: vlbytes 0 20)\n: Lemma\n (requires (\n let h = PLong unused version dcid scid (PRetry odcid) in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PLong unused version dcid scid (PRetry odcid) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)\n ))\n=\n let h = PLong unused version dcid scid (PRetry odcid) in\n serialize_header_eq short_dcid_len h;\n let tg = (| Long, (| (), (| Retry, (unused, ()) |) |) |) in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_length LP.serialize_u8 x;\n let kt : LPB.bitsum'_key_type first_byte = (| Long, (| (), (| Retry, () |) |) |) in\n assert_norm (first_byte_of_header short_dcid_len h == tg );\n assert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h) == kt );\n LP.length_serialize_nondep_then serialize_common_long (LP.serialize_bounded_vlbytes 0 20) (version, (dcid, scid)) odcid;\n length_serialize_common_long version dcid scid;\n LP.length_serialize_bounded_vlbytes 0 20 odcid\n\n#restart-solver\n\nlet header_len'_correct", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "short_dcid_len: QUIC.Spec.Base.short_dcid_len_t -> h: QUIC.Spec.Header.Public.header' short_dcid_len\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Spec.Header.Public.header_len' h ==\n FStar.Seq.Base.length (LowParse.Spec.Base.serialize (QUIC.Spec.Header.Public.serialize_header short_dcid_len\n )\n h))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Base.bitfield", "Prims.bool", "QUIC.Spec.Base.vlbytes", "QUIC.Spec.Header.Public.header_len'_correct_short", "FStar.UInt32.t", "QUIC.Spec.Header.Public.long_header_specifics", "QUIC.Spec.Base.token_max_len", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Header.Public.header_len'_correct_long_initial", "QUIC.Spec.Header.Public.header_len'_correct_long_handshake", "QUIC.Spec.Header.Public.header_len'_correct_long_zero_rtt", "QUIC.Spec.Header.Public.header_len'_correct_long_retry", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_len'_correct\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h))\nlet header_len'_correct short_dcid_len h =", "completed_definiton": "match h with\n| PShort pb spin dcid -> header_len'_correct_short short_dcid_len pb spin dcid\n| PLong pb version dcid scid spec ->\n match spec with\n | PInitial token payload_and_pn_length ->\n header_len'_correct_long_initial short_dcid_len pb version dcid scid token payload_and_pn_length\n | PHandshake payload_and_pn_length ->\n header_len'_correct_long_handshake short_dcid_len pb version dcid scid payload_and_pn_length\n | PZeroRTT payload_and_pn_length ->\n header_len'_correct_long_zero_rtt short_dcid_len pb version dcid scid payload_and_pn_length\n | PRetry odcid -> header_len'_correct_long_retry short_dcid_len version dcid scid pb odcid", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.first_byte_is_retry", "original_source_type": "val first_byte_is_retry (k: LPB.bitsum'_type first_byte) : GTot bool", "source_type": "val first_byte_is_retry (k: LPB.bitsum'_type first_byte) : GTot bool", "source_definition": "let first_byte_is_retry\n (k: LPB.bitsum'_type first_byte)\n: GTot bool\n= match k with\n | (| Long, (| (), (| Retry, (unused, ()) |) |) |) -> true\n | _ -> false", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 391, "start_col": 2, "end_line": 393, "end_col": 14 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop\n\nlet serialize_long_zero_rtt_body : LP.serializer parse_long_zero_rtt_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_handshake_body : LP.serializer parse_long_handshake_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_retry_body : LP.serializer parse_long_retry_body = serialize_common_long `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20\nlet serialize_long_initial_body : LP.serializer parse_long_initial_body = serialize_common_long `LP.serialize_nondep_then` (\n LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length)\n\nlet serialize_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.serialize_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize_flbytes (U32.v short_dcid_len))\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n serialize_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n serialize_long_handshake_body\n | (| Long, (| (), (| Initial, () |) |) |) ->\n serialize_long_initial_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n serialize_long_retry_body\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))\n= LPB.serialize_bitsum\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len) h ==\n LP.serialize LP.serialize_u8 (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h)) `Seq.append`\n LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n= LPB.serialize_bitsum_eq'\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n h\n\n#push-options \"--z3rlimit 64\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h\n ))\n= serialize_header_eq short_dcid_len1 h;\n serialize_header_eq short_dcid_len2 h;\n ()\n\n#pop-options\n\nlet serialize_header_is_short\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in\n assert (Seq.index s 0 == x);\n assert (PShort? h <==> LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Short <: U8.t))\n\nlet first_byte_is_retry\n (k: LPB.bitsum'_type first_byte)", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "k: LowParse.Spec.BitSum.bitsum'_type QUIC.Spec.Header.Public.first_byte -> Prims.GTot Prims.bool", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.BitSum.bitsum'_type", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "LowParse.BitFields.bitfield", "Prims.dtuple2", "LowParse.Spec.Enum.enum_key", "QUIC.Spec.Header.Public.header_form_t", "QUIC.Spec.Header.Public.header_form", "LowParse.Spec.BitSum.bitsum'_type'", "Prims.op_Subtraction", "LowParse.Spec.BitSum.BitSum'", "Prims.unit", "QUIC.Spec.Header.Public.fixed_bit", "LowParse.Spec.BitSum.BitField", "LowParse.Spec.BitSum.BitStop", "LowParse.Spec.BitSum.bitsum'", "QUIC.Spec.Header.Public.long_packet_type_t", "QUIC.Spec.Header.Public.long_packet_type", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val first_byte_is_retry (k: LPB.bitsum'_type first_byte) : GTot bool\nlet first_byte_is_retry (k: LPB.bitsum'_type first_byte) : GTot bool =", "completed_definiton": "match k with\n| (| Long , (| () , (| Retry , (unused, ()) |) |) |) -> true\n| _ -> false", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.serialize_header_eq", "original_source_type": "val serialize_header_eq (short_dcid_len: short_dcid_len_t) (h: header' short_dcid_len)\n : Lemma\n (LP.serialize (serialize_header short_dcid_len) h ==\n (LP.serialize LP.serialize_u8\n (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h)))\n `Seq.append`\n (LP.serialize (serialize_header_body short_dcid_len\n (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)))\n (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h)))", "source_type": "val serialize_header_eq (short_dcid_len: short_dcid_len_t) (h: header' short_dcid_len)\n : Lemma\n (LP.serialize (serialize_header short_dcid_len) h ==\n (LP.serialize LP.serialize_u8\n (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h)))\n `Seq.append`\n (LP.serialize (serialize_header_body short_dcid_len\n (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)))\n (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h)))", "source_definition": "let serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len) h ==\n LP.serialize LP.serialize_u8 (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h)) `Seq.append`\n LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n= LPB.serialize_bitsum_eq'\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n h", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 345, "start_col": 2, "end_line": 358, "end_col": 5 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop\n\nlet serialize_long_zero_rtt_body : LP.serializer parse_long_zero_rtt_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_handshake_body : LP.serializer parse_long_handshake_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_retry_body : LP.serializer parse_long_retry_body = serialize_common_long `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20\nlet serialize_long_initial_body : LP.serializer parse_long_initial_body = serialize_common_long `LP.serialize_nondep_then` (\n LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length)\n\nlet serialize_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.serialize_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize_flbytes (U32.v short_dcid_len))\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n serialize_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n serialize_long_handshake_body\n | (| Long, (| (), (| Initial, () |) |) |) ->\n serialize_long_initial_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n serialize_long_retry_body\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))\n= LPB.serialize_bitsum\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len) h ==\n LP.serialize LP.serialize_u8 (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h)) `Seq.append`", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "short_dcid_len: QUIC.Spec.Base.short_dcid_len_t -> h: QUIC.Spec.Header.Public.header' short_dcid_len\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Base.serialize (QUIC.Spec.Header.Public.serialize_header short_dcid_len) h ==\n FStar.Seq.Base.append (LowParse.Spec.Base.serialize LowParse.Spec.Int.serialize_u8\n (LowParse.Spec.BitSum.synth_bitsum'_recip QUIC.Spec.Header.Public.first_byte\n (QUIC.Spec.Header.Public.first_byte_of_header short_dcid_len h)))\n (LowParse.Spec.Base.serialize (QUIC.Spec.Header.Public.serialize_header_body short_dcid_len\n (LowParse.Spec.BitSum.bitsum'_key_of_t QUIC.Spec.Header.Public.first_byte\n (QUIC.Spec.Header.Public.first_byte_of_header short_dcid_len h)))\n (QUIC.Spec.Header.Public.mk_header_body short_dcid_len\n (QUIC.Spec.Header.Public.first_byte_of_header short_dcid_len h)\n h)))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.Header.Public.header'", "LowParse.Spec.BitSum.serialize_bitsum_eq'", "LowParse.Spec.Int.parse_u8_kind", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "QUIC.Spec.Header.Public.first_byte_of_header", "QUIC.Spec.Header.Public.header_body_type", "QUIC.Spec.Header.Public.header_synth", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "QUIC.Spec.Header.Public.parse_header_body", "QUIC.Spec.Header.Public.serialize_header_body", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "FStar.Seq.Base.seq", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "FStar.Seq.Base.append", "LowParse.Spec.BitSum.synth_bitsum'_recip", "Prims.__proj__Mkdtuple2__item___1", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.parser", "LowParse.Spec.BitSum.bitsum'_key_of_t", "FStar.Pervasives.dsnd", "QUIC.Spec.Header.Public.mk_header_body", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_header_eq (short_dcid_len: short_dcid_len_t) (h: header' short_dcid_len)\n : Lemma\n (LP.serialize (serialize_header short_dcid_len) h ==\n (LP.serialize LP.serialize_u8\n (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h)))\n `Seq.append`\n (LP.serialize (serialize_header_body short_dcid_len\n (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)))\n (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h)))\nlet serialize_header_eq (short_dcid_len: short_dcid_len_t) (h: header' short_dcid_len)\n : Lemma\n (LP.serialize (serialize_header short_dcid_len) h ==\n (LP.serialize LP.serialize_u8\n (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h)))\n `Seq.append`\n (LP.serialize (serialize_header_body short_dcid_len\n (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)))\n (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))) =", "completed_definiton": "LPB.serialize_bitsum_eq' #LP.parse_u8_kind #8 #U8.t first_byte #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len)\n (header_synth short_dcid_len) #LP.parse_u8 LP.serialize_u8 #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len) h", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.serialize_payload_and_pn_length", "original_source_type": "val serialize_payload_and_pn_length:LP.serializer parse_payload_and_pn_length", "source_type": "val serialize_payload_and_pn_length:LP.serializer parse_payload_and_pn_length", "source_definition": "let serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 297, "start_col": 2, "end_line": 297, "end_col": 68 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer QUIC.Spec.Header.Public.parse_payload_and_pn_length", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_filter", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.UInt62.t", "QUIC.Spec.VarInt.parse_varint", "QUIC.Spec.VarInt.serialize_varint", "QUIC.Spec.Header.Public.payload_and_pn_length_prop" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val serialize_payload_and_pn_length:LP.serializer parse_payload_and_pn_length\nlet serialize_payload_and_pn_length:LP.serializer parse_payload_and_pn_length =", "completed_definiton": "LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.serialize_long_initial_body", "original_source_type": "val serialize_long_initial_body:LP.serializer parse_long_initial_body", "source_type": "val serialize_long_initial_body:LP.serializer parse_long_initial_body", "source_definition": "let serialize_long_initial_body : LP.serializer parse_long_initial_body = serialize_common_long `LP.serialize_nondep_then` (\n LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 302, "start_col": 74, "end_line": 303, "end_col": 159 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop\n\nlet serialize_long_zero_rtt_body : LP.serializer parse_long_zero_rtt_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_handshake_body : LP.serializer parse_long_handshake_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer QUIC.Spec.Header.Public.parse_long_initial_body", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Spec.Header.Public.serialize_common_long", "LowParse.Spec.VLGen.parse_bounded_vlgen_kind", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.Base.token_max_len", "LowParse.Spec.Combinators.parse_filter_kind", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Bytes.parse_bounded_vlgenbytes", "QUIC.Spec.VarInt.parse_bounded_varint", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "LowParse.Spec.Bytes.serialize_bounded_vlgenbytes", "QUIC.Spec.VarInt.serialize_bounded_varint", "QUIC.Spec.Header.Public.serialize_payload_and_pn_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_long_initial_body:LP.serializer parse_long_initial_body\nlet serialize_long_initial_body:LP.serializer parse_long_initial_body =", "completed_definiton": "serialize_common_long\n`LP.serialize_nondep_then`\n((LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len))\n `LP.serialize_nondep_then`\n serialize_payload_and_pn_length)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.serialize_common_long", "original_source_type": "val serialize_common_long:LP.serializer parse_common_long", "source_type": "val serialize_common_long:LP.serializer parse_common_long", "source_definition": "let serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 294, "start_col": 2, "end_line": 294, "end_col": 142 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer QUIC.Spec.Header.Public.parse_common_long", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_nondep_then", "LowParse.Spec.Int.parse_u32_kind", "FStar.UInt32.t", "LowParse.Spec.Int.parse_u32", "LowParse.Spec.Int.serialize_u32", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Bytes.parse_bounded_vlbytes", "LowParse.Spec.Bytes.serialize_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_common_long:LP.serializer parse_common_long\nlet serialize_common_long:LP.serializer parse_common_long =", "completed_definiton": "LP.serialize_u32\n`LP.serialize_nondep_then`\n((LP.serialize_bounded_vlbytes 0 20) `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.serialize_long_retry_body", "original_source_type": "val serialize_long_retry_body:LP.serializer parse_long_retry_body", "source_type": "val serialize_long_retry_body:LP.serializer parse_long_retry_body", "source_definition": "let serialize_long_retry_body : LP.serializer parse_long_retry_body = serialize_common_long `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 301, "start_col": 70, "end_line": 301, "end_col": 152 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop\n\nlet serialize_long_zero_rtt_body : LP.serializer parse_long_zero_rtt_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer QUIC.Spec.Header.Public.parse_long_retry_body", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Spec.Header.Public.serialize_common_long", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "LowParse.Spec.Bytes.parse_bounded_vlbytes", "LowParse.Spec.Bytes.serialize_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_long_retry_body:LP.serializer parse_long_retry_body\nlet serialize_long_retry_body:LP.serializer parse_long_retry_body =", "completed_definiton": "serialize_common_long `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.serialize_long_zero_rtt_body", "original_source_type": "val serialize_long_zero_rtt_body:LP.serializer parse_long_zero_rtt_body", "source_type": "val serialize_long_zero_rtt_body:LP.serializer parse_long_zero_rtt_body", "source_definition": "let serialize_long_zero_rtt_body : LP.serializer parse_long_zero_rtt_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 299, "start_col": 76, "end_line": 299, "end_col": 156 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer QUIC.Spec.Header.Public.parse_long_zero_rtt_body", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Spec.Header.Public.serialize_common_long", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "QUIC.Spec.Header.Public.serialize_payload_and_pn_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_long_zero_rtt_body:LP.serializer parse_long_zero_rtt_body\nlet serialize_long_zero_rtt_body:LP.serializer parse_long_zero_rtt_body =", "completed_definiton": "serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.serialize_long_handshake_body", "original_source_type": "val serialize_long_handshake_body:LP.serializer parse_long_handshake_body", "source_type": "val serialize_long_handshake_body:LP.serializer parse_long_handshake_body", "source_definition": "let serialize_long_handshake_body : LP.serializer parse_long_handshake_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 300, "start_col": 78, "end_line": 300, "end_col": 158 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.serializer QUIC.Spec.Header.Public.parse_long_handshake_body", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Combinators.serialize_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Spec.Header.Public.serialize_common_long", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "QUIC.Spec.Header.Public.serialize_payload_and_pn_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_long_handshake_body:LP.serializer parse_long_handshake_body\nlet serialize_long_handshake_body:LP.serializer parse_long_handshake_body =", "completed_definiton": "serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.fixed_bit", "original_source_type": "val fixed_bit:LP.enum unit (LPB.bitfield LPB.uint8 1)", "source_type": "val fixed_bit:LP.enum unit (LPB.bitfield LPB.uint8 1)", "source_definition": "let fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 22, "start_col": 58, "end_line": 24, "end_col": 1 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Enum.enum Prims.unit (LowParse.BitFields.bitfield LowParse.BitFields.uint8 1)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.Cons", "FStar.Pervasives.Native.tuple2", "Prims.unit", "LowParse.BitFields.bitfield", "FStar.UInt8.t", "LowParse.BitFields.uint8", "FStar.Pervasives.Native.Mktuple2", "FStar.UInt8.__uint_to_t", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val fixed_bit:LP.enum unit (LPB.bitfield LPB.uint8 1)\nlet fixed_bit:LP.enum unit (LPB.bitfield LPB.uint8 1) =", "completed_definiton": "[(), 1uy]", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.length_serialize_payload_and_pn_length", "original_source_type": "val length_serialize_payload_and_pn_length (payload_and_pn_length: payload_and_pn_length_t)\n : Lemma\n (Seq.length (LP.serialize serialize_payload_and_pn_length payload_and_pn_length) ==\n varint_len payload_and_pn_length)", "source_type": "val length_serialize_payload_and_pn_length (payload_and_pn_length: payload_and_pn_length_t)\n : Lemma\n (Seq.length (LP.serialize serialize_payload_and_pn_length payload_and_pn_length) ==\n varint_len payload_and_pn_length)", "source_definition": "let length_serialize_payload_and_pn_length\n (payload_and_pn_length: payload_and_pn_length_t)\n: Lemma\n (Seq.length (LP.serialize serialize_payload_and_pn_length payload_and_pn_length) == varint_len payload_and_pn_length)\n= VI.varint_len_correct payload_and_pn_length", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 545, "start_col": 2, "end_line": 545, "end_col": 45 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop\n\nlet serialize_long_zero_rtt_body : LP.serializer parse_long_zero_rtt_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_handshake_body : LP.serializer parse_long_handshake_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_retry_body : LP.serializer parse_long_retry_body = serialize_common_long `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20\nlet serialize_long_initial_body : LP.serializer parse_long_initial_body = serialize_common_long `LP.serialize_nondep_then` (\n LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length)\n\nlet serialize_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.serialize_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize_flbytes (U32.v short_dcid_len))\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n serialize_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n serialize_long_handshake_body\n | (| Long, (| (), (| Initial, () |) |) |) ->\n serialize_long_initial_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n serialize_long_retry_body\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))\n= LPB.serialize_bitsum\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len) h ==\n LP.serialize LP.serialize_u8 (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h)) `Seq.append`\n LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n= LPB.serialize_bitsum_eq'\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n h\n\n#push-options \"--z3rlimit 64\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h\n ))\n= serialize_header_eq short_dcid_len1 h;\n serialize_header_eq short_dcid_len2 h;\n ()\n\n#pop-options\n\nlet serialize_header_is_short\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in\n assert (Seq.index s 0 == x);\n assert (PShort? h <==> LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Short <: U8.t))\n\nlet first_byte_is_retry\n (k: LPB.bitsum'_type first_byte)\n: GTot bool\n= match k with\n | (| Long, (| (), (| Retry, (unused, ()) |) |) |) -> true\n | _ -> false\n\nlet first_byte_is_retry_correct\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (is_retry h <==> first_byte_is_retry (first_byte_of_header short_dcid_len h))\n= ()\n\n#push-options \"--z3rlimit 512\"\n#restart-solver\n\nlet serialize_header_is_retry\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in \n assert (Seq.index s 0 == x);\n assert (is_retry h <==> (\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Long <: U8.t) /\\\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 4 6 == (LowParse.Spec.Enum.enum_repr_of_key long_packet_type Retry <: U8.t)\n ))\n\n#pop-options\n\n#restart-solver\n\n\nlet is_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4))\n= ()\n\nlet set_valid_bitfield_intro'\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb\n )\n= is_valid_bitfield_intro short_dcid_len h\n\nlet set_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb /\\\n LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) == LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)\n )\n= set_valid_bitfield_intro' short_dcid_len h new_pb;\n LPB.bitsum'_key_of_t_set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb\n\nlet mk_header_body_set_valid_bitfield\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) (set_protected_bits h new_pb) ==\n mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h)\n= ()\n\n#push-options \"--z3rlimit 512\"\n\n#restart-solver\n\nlet serialize_get_protected_bits\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (let sq = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length sq > 0 /\\\n get_protected_bits h == LPB.uint8.LPB.get_bitfield (Seq.head sq) 0 (if PShort? h then 5 else 4))\n= let sq = LP.serialize (serialize_header short_dcid_len) h in\n serialize_header_eq\n short_dcid_len\n h;\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h))\n\n#restart-solver\n\nlet serialize_set_protected_bits\n short_dcid_len h new_pb\n= let h' = set_protected_bits h new_pb in\n let sq = LP.serialize (serialize_header short_dcid_len) h in\n let sq' = LP.serialize (serialize_header short_dcid_len) h' in\n set_valid_bitfield_intro short_dcid_len h new_pb;\n serialize_header_eq\n short_dcid_len\n h;\n serialize_header_eq\n short_dcid_len\n h';\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h));\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h'));\n LPB.set_valid_bitfield_correct first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb;\n mk_header_body_set_valid_bitfield short_dcid_len h new_pb;\n assert (LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h'))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h') h') == LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h));\n assert (Seq.tail sq' `Seq.equal` LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h'))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h') h'));\n assert (Seq.tail sq `Seq.equal` LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n\n#pop-options\n\n\nlet header_len'_correct_short\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 5)\n (spin: bool)\n (dcid: vlbytes 0 20)\n: Lemma\n (requires (let h = PShort protected_bits spin dcid in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PShort protected_bits spin dcid in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)\n ))\n= \n let h = PShort protected_bits spin dcid in\n serialize_header_eq short_dcid_len h;\n let tg = first_byte_of_header short_dcid_len h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_length LP.serialize_u8 x;\n assert_norm (first_byte_of_header short_dcid_len (PShort protected_bits spin dcid) == (| Short, (| (), ((if spin then 1uy else 0uy), (protected_bits, ()) ) |) |) );\n assert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len (PShort protected_bits spin dcid)) == (| Short, (| (), () |) |) );\n LP.serialize_length (LP.serialize_flbytes (U32.v short_dcid_len)) dcid\n\nlet length_serialize_common_long\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n: Lemma\n (Seq.length (LP.serialize serialize_common_long (version, (dcid, scid))) == 6 + FB.length dcid + FB.length scid)\n= LP.serialize_nondep_then_eq LP.serialize_u32 (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20) (version, (dcid, scid));\n LP.serialize_length LP.serialize_u32 version;\n LP.serialize_nondep_then_eq (LP.serialize_bounded_vlbytes 0 20) (LP.serialize_bounded_vlbytes 0 20) (dcid, scid);\n LP.length_serialize_bounded_vlbytes 0 20 dcid;\n LP.length_serialize_bounded_vlbytes 0 20 scid\n\nlet length_serialize_payload_and_pn_length\n (payload_and_pn_length: payload_and_pn_length_t)\n: Lemma", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "payload_and_pn_length: QUIC.Spec.Base.payload_and_pn_length_t\n -> FStar.Pervasives.Lemma\n (ensures\n FStar.Seq.Base.length (LowParse.Spec.Base.serialize QUIC.Spec.Header.Public.serialize_payload_and_pn_length\n payload_and_pn_length) ==\n QUIC.Spec.Base.varint_len payload_and_pn_length)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.VarInt.varint_len_correct", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "Prims.nat", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "QUIC.Spec.Header.Public.serialize_payload_and_pn_length", "QUIC.Spec.Base.varint_len", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val length_serialize_payload_and_pn_length (payload_and_pn_length: payload_and_pn_length_t)\n : Lemma\n (Seq.length (LP.serialize serialize_payload_and_pn_length payload_and_pn_length) ==\n varint_len payload_and_pn_length)\nlet length_serialize_payload_and_pn_length (payload_and_pn_length: payload_and_pn_length_t)\n : Lemma\n (Seq.length (LP.serialize serialize_payload_and_pn_length payload_and_pn_length) ==\n varint_len payload_and_pn_length) =", "completed_definiton": "VI.varint_len_correct payload_and_pn_length", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.weaken_parse_bitsum_cases_kind_parse_header_body", "original_source_type": "val weaken_parse_bitsum_cases_kind_parse_header_body (short_dcid_len: short_dcid_len_t)\n : Lemma\n (let k =\n LPB.weaken_parse_bitsum_cases_kind first_byte\n (header_body_type short_dcid_len)\n (parse_header_body short_dcid_len)\n in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n (match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound))\n [\n SMTPat\n (LPB.weaken_parse_bitsum_cases_kind first_byte\n (header_body_type short_dcid_len)\n (parse_header_body short_dcid_len))\n ]", "source_type": "val weaken_parse_bitsum_cases_kind_parse_header_body (short_dcid_len: short_dcid_len_t)\n : Lemma\n (let k =\n LPB.weaken_parse_bitsum_cases_kind first_byte\n (header_body_type short_dcid_len)\n (parse_header_body short_dcid_len)\n in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n (match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound))\n [\n SMTPat\n (LPB.weaken_parse_bitsum_cases_kind first_byte\n (header_body_type short_dcid_len)\n (parse_header_body short_dcid_len))\n ]", "source_definition": "let weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 266, "start_col": 1, "end_line": 273, "end_col": 3 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "short_dcid_len: QUIC.Spec.Base.short_dcid_len_t\n -> FStar.Pervasives.Lemma\n (ensures\n (let k =\n LowParse.Spec.BitSum.weaken_parse_bitsum_cases_kind QUIC.Spec.Header.Public.first_byte\n (QUIC.Spec.Header.Public.header_body_type short_dcid_len)\n (QUIC.Spec.Header.Public.parse_header_body short_dcid_len)\n in\n Mkparser_kind'?.parser_kind_subkind k ==\n FStar.Pervasives.Native.Some LowParse.Spec.Base.ParserStrong /\\\n (match Mkparser_kind'?.parser_kind_high k with\n | FStar.Pervasives.Native.None #_ -> Prims.l_False\n | FStar.Pervasives.Native.Some #_ max -> max + 5 < QUIC.Spec.Base.header_len_bound)))\n [\n SMTPat (LowParse.Spec.BitSum.weaken_parse_bitsum_cases_kind QUIC.Spec.Header.Public.first_byte\n (QUIC.Spec.Header.Public.header_body_type short_dcid_len)\n (QUIC.Spec.Header.Public.parse_header_body short_dcid_len))\n ]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "FStar.Pervasives.assert_norm", "Prims.l_and", "Prims.eq2", "FStar.Pervasives.Native.option", "LowParse.Spec.Base.parser_subkind", "LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_subkind", "FStar.Pervasives.Native.Some", "LowParse.Spec.Base.ParserStrong", "LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_high", "Prims.l_False", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Prims.op_Addition", "QUIC.Spec.Base.header_len_bound", "Prims.logical", "LowParse.Spec.Base.parser_kind", "Prims.l_Forall", "LowParse.Spec.BitSum.bitsum'_key_type", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "LowParse.Spec.Base.is_weaker_than", "FStar.Pervasives.dfst", "LowParse.Spec.Base.parser", "QUIC.Spec.Header.Public.header_body_type", "QUIC.Spec.Header.Public.parse_header_body", "LowParse.Spec.BitSum.weaken_parse_bitsum_cases_kind", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val weaken_parse_bitsum_cases_kind_parse_header_body (short_dcid_len: short_dcid_len_t)\n : Lemma\n (let k =\n LPB.weaken_parse_bitsum_cases_kind first_byte\n (header_body_type short_dcid_len)\n (parse_header_body short_dcid_len)\n in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n (match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound))\n [\n SMTPat\n (LPB.weaken_parse_bitsum_cases_kind first_byte\n (header_body_type short_dcid_len)\n (parse_header_body short_dcid_len))\n ]\nlet weaken_parse_bitsum_cases_kind_parse_header_body (short_dcid_len: short_dcid_len_t)\n : Lemma\n (let k =\n LPB.weaken_parse_bitsum_cases_kind first_byte\n (header_body_type short_dcid_len)\n (parse_header_body short_dcid_len)\n in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n (match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound))\n [\n SMTPat\n (LPB.weaken_parse_bitsum_cases_kind first_byte\n (header_body_type short_dcid_len)\n (parse_header_body short_dcid_len))\n ] =", "completed_definiton": "let k =\n LPB.weaken_parse_bitsum_cases_kind first_byte\n (header_body_type short_dcid_len)\n (parse_header_body short_dcid_len)\nin\nassert_norm (k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n (match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.length_serialize_common_long", "original_source_type": "val length_serialize_common_long (version: U32.t) (dcid scid: vlbytes 0 20)\n : Lemma\n (Seq.length (LP.serialize serialize_common_long (version, (dcid, scid))) ==\n 6 + FB.length dcid + FB.length scid)", "source_type": "val length_serialize_common_long (version: U32.t) (dcid scid: vlbytes 0 20)\n : Lemma\n (Seq.length (LP.serialize serialize_common_long (version, (dcid, scid))) ==\n 6 + FB.length dcid + FB.length scid)", "source_definition": "let length_serialize_common_long\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n: Lemma\n (Seq.length (LP.serialize serialize_common_long (version, (dcid, scid))) == 6 + FB.length dcid + FB.length scid)\n= LP.serialize_nondep_then_eq LP.serialize_u32 (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20) (version, (dcid, scid));\n LP.serialize_length LP.serialize_u32 version;\n LP.serialize_nondep_then_eq (LP.serialize_bounded_vlbytes 0 20) (LP.serialize_bounded_vlbytes 0 20) (dcid, scid);\n LP.length_serialize_bounded_vlbytes 0 20 dcid;\n LP.length_serialize_bounded_vlbytes 0 20 scid", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 535, "start_col": 2, "end_line": 539, "end_col": 47 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop\n\nlet serialize_long_zero_rtt_body : LP.serializer parse_long_zero_rtt_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_handshake_body : LP.serializer parse_long_handshake_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_retry_body : LP.serializer parse_long_retry_body = serialize_common_long `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20\nlet serialize_long_initial_body : LP.serializer parse_long_initial_body = serialize_common_long `LP.serialize_nondep_then` (\n LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length)\n\nlet serialize_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.serialize_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize_flbytes (U32.v short_dcid_len))\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n serialize_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n serialize_long_handshake_body\n | (| Long, (| (), (| Initial, () |) |) |) ->\n serialize_long_initial_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n serialize_long_retry_body\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))\n= LPB.serialize_bitsum\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len) h ==\n LP.serialize LP.serialize_u8 (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h)) `Seq.append`\n LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n= LPB.serialize_bitsum_eq'\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n h\n\n#push-options \"--z3rlimit 64\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h\n ))\n= serialize_header_eq short_dcid_len1 h;\n serialize_header_eq short_dcid_len2 h;\n ()\n\n#pop-options\n\nlet serialize_header_is_short\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in\n assert (Seq.index s 0 == x);\n assert (PShort? h <==> LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Short <: U8.t))\n\nlet first_byte_is_retry\n (k: LPB.bitsum'_type first_byte)\n: GTot bool\n= match k with\n | (| Long, (| (), (| Retry, (unused, ()) |) |) |) -> true\n | _ -> false\n\nlet first_byte_is_retry_correct\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (is_retry h <==> first_byte_is_retry (first_byte_of_header short_dcid_len h))\n= ()\n\n#push-options \"--z3rlimit 512\"\n#restart-solver\n\nlet serialize_header_is_retry\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in \n assert (Seq.index s 0 == x);\n assert (is_retry h <==> (\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Long <: U8.t) /\\\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 4 6 == (LowParse.Spec.Enum.enum_repr_of_key long_packet_type Retry <: U8.t)\n ))\n\n#pop-options\n\n#restart-solver\n\n\nlet is_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4))\n= ()\n\nlet set_valid_bitfield_intro'\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb\n )\n= is_valid_bitfield_intro short_dcid_len h\n\nlet set_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb /\\\n LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) == LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)\n )\n= set_valid_bitfield_intro' short_dcid_len h new_pb;\n LPB.bitsum'_key_of_t_set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb\n\nlet mk_header_body_set_valid_bitfield\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) (set_protected_bits h new_pb) ==\n mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h)\n= ()\n\n#push-options \"--z3rlimit 512\"\n\n#restart-solver\n\nlet serialize_get_protected_bits\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (let sq = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length sq > 0 /\\\n get_protected_bits h == LPB.uint8.LPB.get_bitfield (Seq.head sq) 0 (if PShort? h then 5 else 4))\n= let sq = LP.serialize (serialize_header short_dcid_len) h in\n serialize_header_eq\n short_dcid_len\n h;\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h))\n\n#restart-solver\n\nlet serialize_set_protected_bits\n short_dcid_len h new_pb\n= let h' = set_protected_bits h new_pb in\n let sq = LP.serialize (serialize_header short_dcid_len) h in\n let sq' = LP.serialize (serialize_header short_dcid_len) h' in\n set_valid_bitfield_intro short_dcid_len h new_pb;\n serialize_header_eq\n short_dcid_len\n h;\n serialize_header_eq\n short_dcid_len\n h';\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h));\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h'));\n LPB.set_valid_bitfield_correct first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb;\n mk_header_body_set_valid_bitfield short_dcid_len h new_pb;\n assert (LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h'))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h') h') == LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h));\n assert (Seq.tail sq' `Seq.equal` LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h'))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h') h'));\n assert (Seq.tail sq `Seq.equal` LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n\n#pop-options\n\n\nlet header_len'_correct_short\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 5)\n (spin: bool)\n (dcid: vlbytes 0 20)\n: Lemma\n (requires (let h = PShort protected_bits spin dcid in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PShort protected_bits spin dcid in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)\n ))\n= \n let h = PShort protected_bits spin dcid in\n serialize_header_eq short_dcid_len h;\n let tg = first_byte_of_header short_dcid_len h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_length LP.serialize_u8 x;\n assert_norm (first_byte_of_header short_dcid_len (PShort protected_bits spin dcid) == (| Short, (| (), ((if spin then 1uy else 0uy), (protected_bits, ()) ) |) |) );\n assert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len (PShort protected_bits spin dcid)) == (| Short, (| (), () |) |) );\n LP.serialize_length (LP.serialize_flbytes (U32.v short_dcid_len)) dcid\n\nlet length_serialize_common_long\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n: Lemma", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "version: FStar.UInt32.t -> dcid: QUIC.Spec.Base.vlbytes 0 20 -> scid: QUIC.Spec.Base.vlbytes 0 20\n -> FStar.Pervasives.Lemma\n (ensures\n FStar.Seq.Base.length (LowParse.Spec.Base.serialize QUIC.Spec.Header.Public.serialize_common_long\n (version, FStar.Pervasives.Native.Mktuple2 dcid scid)) ==\n 6 + FStar.Bytes.length dcid + FStar.Bytes.length scid)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "QUIC.Spec.Base.vlbytes", "LowParse.Spec.Bytes.length_serialize_bounded_vlbytes", "Prims.unit", "LowParse.Spec.Combinators.serialize_nondep_then_eq", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "LowParse.Spec.Bytes.parse_bounded_vlbytes", "LowParse.Spec.Bytes.serialize_bounded_vlbytes", "FStar.Pervasives.Native.Mktuple2", "LowParse.Spec.Base.serialize_length", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.Int.parse_u32", "LowParse.Spec.Int.serialize_u32", "LowParse.Spec.Combinators.and_then_kind", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Combinators.serialize_nondep_then", "Prims.l_True", "Prims.squash", "Prims.eq2", "Prims.int", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Spec.Header.Public.serialize_common_long", "Prims.op_Addition", "FStar.Bytes.length", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val length_serialize_common_long (version: U32.t) (dcid scid: vlbytes 0 20)\n : Lemma\n (Seq.length (LP.serialize serialize_common_long (version, (dcid, scid))) ==\n 6 + FB.length dcid + FB.length scid)\nlet length_serialize_common_long (version: U32.t) (dcid scid: vlbytes 0 20)\n : Lemma\n (Seq.length (LP.serialize serialize_common_long (version, (dcid, scid))) ==\n 6 + FB.length dcid + FB.length scid) =", "completed_definiton": "LP.serialize_nondep_then_eq LP.serialize_u32\n ((LP.serialize_bounded_vlbytes 0 20)\n `LP.serialize_nondep_then`\n (LP.serialize_bounded_vlbytes 0 20))\n (version, (dcid, scid));\nLP.serialize_length LP.serialize_u32 version;\nLP.serialize_nondep_then_eq (LP.serialize_bounded_vlbytes 0 20)\n (LP.serialize_bounded_vlbytes 0 20)\n (dcid, scid);\nLP.length_serialize_bounded_vlbytes 0 20 dcid;\nLP.length_serialize_bounded_vlbytes 0 20 scid", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.first_byte_of_header'", "original_source_type": "val first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n : Tot t", "source_type": "val first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n : Tot t", "source_definition": "let first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 74, "start_col": 2, "end_line": 88, "end_col": 7 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n t: Type0 ->\n f: (_: LowParse.Spec.BitSum.bitsum'_type QUIC.Spec.Header.Public.first_byte -> t) ->\n m: QUIC.Spec.Header.Public.header' short_dcid_len\n -> t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "LowParse.Spec.BitSum.bitsum'_type", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Base.bitfield", "Prims.bool", "QUIC.Spec.Base.vlbytes", "Prims.Mkdtuple2", "LowParse.Spec.Enum.enum_key", "QUIC.Spec.Header.Public.header_form_t", "LowParse.BitFields.bitfield", "QUIC.Spec.Header.Public.header_form", "LowParse.Spec.BitSum.bitsum'_type'", "Prims.op_Subtraction", "LowParse.Spec.BitSum.BitSum'", "Prims.unit", "QUIC.Spec.Header.Public.fixed_bit", "LowParse.Spec.BitSum.BitField", "LowParse.Spec.BitSum.BitStop", "LowParse.Spec.BitSum.bitsum'", "QUIC.Spec.Header.Public.long_packet_type_t", "QUIC.Spec.Header.Public.long_packet_type", "QUIC.Spec.Header.Public.Short", "FStar.Pervasives.Native.Mktuple2", "FStar.UInt8.__uint_to_t", "FStar.UInt32.t", "QUIC.Spec.Header.Public.long_header_specifics", "QUIC.Spec.Base.token_max_len", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Header.Public.Long", "QUIC.Spec.Header.Public.Initial", "QUIC.Spec.Header.Public.ZeroRTT", "QUIC.Spec.Header.Public.Handshake", "QUIC.Spec.Header.Public.Retry" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n : Tot t\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n : Tot t =", "completed_definiton": "match m with\n| PShort protected_bits spin dcid ->\n let spin:LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, ())) |) |)\n| PLong protected_bits version dcid scid spec ->\n match spec with\n | PInitial _ payload_and_pn_length -> f (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |)\n | PZeroRTT payload_and_pn_length -> f (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |)\n | PRetry _ -> f (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.long_initial_body_t", "original_source_type": "", "source_type": "val long_initial_body_t : Type0", "source_definition": "let long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 118, "start_col": 26, "end_line": 118, "end_col": 115 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Pervasives.Native.tuple2", "QUIC.Spec.Header.Public.common_long_t", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "QUIC.Spec.Base.token_max_len", "QUIC.Spec.Header.Public.payload_and_pn_length_t'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let long_initial_body_t =", "completed_definiton": "(common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.parse_header_kind", "original_source_type": "val parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 4 < header_len_bound\n end\n })", "source_type": "val parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 4 < header_len_bound\n end\n })", "source_definition": "let parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 280, "start_col": 2, "end_line": 280, "end_col": 120 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "short_dcid_len: QUIC.Spec.Base.short_dcid_len_t\n -> k:\n LowParse.Spec.Base.parser_kind\n { Mkparser_kind'?.parser_kind_subkind k ==\n FStar.Pervasives.Native.Some LowParse.Spec.Base.ParserStrong /\\\n Mkparser_kind'?.parser_kind_low k > 0 /\\\n (match Mkparser_kind'?.parser_kind_high k with\n | FStar.Pervasives.Native.None #_ -> Prims.l_False\n | FStar.Pervasives.Native.Some #_ max -> max + 4 < QUIC.Spec.Base.header_len_bound) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "LowParse.Spec.BitSum.parse_bitsum_kind", "LowParse.Spec.Int.parse_u8_kind", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "QUIC.Spec.Header.Public.header_body_type", "QUIC.Spec.Header.Public.parse_header_body", "LowParse.Spec.Base.parser_kind", "Prims.l_and", "Prims.eq2", "FStar.Pervasives.Native.option", "LowParse.Spec.Base.parser_subkind", "LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_subkind", "FStar.Pervasives.Native.Some", "LowParse.Spec.Base.ParserStrong", "Prims.b2t", "Prims.op_GreaterThan", "LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_low", "LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_high", "Prims.l_False", "Prims.nat", "Prims.op_LessThan", "Prims.op_Addition", "QUIC.Spec.Base.header_len_bound" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_header_kind\n (short_dcid_len: short_dcid_len_t)\n: Tot (k: LP.parser_kind {\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n k.LP.parser_kind_low > 0 /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 4 < header_len_bound\n end\n })\nlet parse_header_kind short_dcid_len =", "completed_definiton": "LPB.parse_bitsum_kind LP.parse_u8_kind\n first_byte\n (header_body_type short_dcid_len)\n (parse_header_body short_dcid_len)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.header_body_type", "original_source_type": "val header_body_type (short_dcid_len: short_dcid_len_t) (k': LPB.bitsum'_key_type first_byte)\n : Tot Type0", "source_type": "val header_body_type (short_dcid_len: short_dcid_len_t) (k': LPB.bitsum'_key_type first_byte)\n : Tot Type0", "source_definition": "let header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 127, "start_col": 2, "end_line": 137, "end_col": 36 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n k': LowParse.Spec.BitSum.bitsum'_key_type QUIC.Spec.Header.Public.first_byte\n -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "LowParse.Spec.BitSum.bitsum'_key_type", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "QUIC.Spec.Header.Public.long_initial_body_t", "QUIC.Spec.Header.Public.long_zero_rtt_body_t", "QUIC.Spec.Header.Public.long_handshake_body_t", "QUIC.Spec.Header.Public.long_retry_body_t", "FStar.Bytes.lbytes", "FStar.UInt32.v" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_body_type (short_dcid_len: short_dcid_len_t) (k': LPB.bitsum'_key_type first_byte)\n : Tot Type0\nlet header_body_type (short_dcid_len: short_dcid_len_t) (k': LPB.bitsum'_key_type first_byte)\n : Tot Type0 =", "completed_definiton": "match k' with\n| (| Long , (| () , (| Initial , () |) |) |) -> long_initial_body_t\n| (| Long , (| () , (| ZeroRTT , () |) |) |) -> long_zero_rtt_body_t\n| (| Long , (| () , (| Handshake , () |) |) |) -> long_handshake_body_t\n| (| Long , (| () , (| Retry , () |) |) |) -> long_retry_body_t\n| (| Short , (| () , () |) |) -> FB.lbytes (U32.v short_dcid_len)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.parse_header_body", "original_source_type": "val parse_header_body (short_dcid_len: short_dcid_len_t) (k': LPB.bitsum'_key_type first_byte)\n : Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))", "source_type": "val parse_header_body (short_dcid_len: short_dcid_len_t) (k': LPB.bitsum'_key_type first_byte)\n : Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))", "source_definition": "let parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 243, "start_col": 2, "end_line": 253, "end_col": 34 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n k': LowParse.Spec.BitSum.bitsum'_key_type QUIC.Spec.Header.Public.first_byte\n -> Prims.dtuple2 LowParse.Spec.Base.parser_kind\n (fun k ->\n LowParse.Spec.Base.parser k (QUIC.Spec.Header.Public.header_body_type short_dcid_len k'))", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "LowParse.Spec.BitSum.bitsum'_key_type", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "Prims.Mkdtuple2", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.parser", "QUIC.Spec.Header.Public.header_body_type", "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some", "LowParse.Spec.Base.weaken", "LowParse.Spec.Base.total_constant_size_parser_kind", "FStar.UInt32.v", "FStar.Bytes.lbytes", "LowParse.Spec.Bytes.parse_flbytes", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "LowParse.Spec.VLGen.parse_bounded_vlgen_kind", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.Base.token_max_len", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.Header.Public.parse_long_initial_body", "QUIC.Spec.Header.Public.parse_long_zero_rtt_body", "QUIC.Spec.Header.Public.parse_long_handshake_body", "QUIC.Spec.Header.Public.parse_long_retry_body", "Prims.dtuple2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_header_body (short_dcid_len: short_dcid_len_t) (k': LPB.bitsum'_key_type first_byte)\n : Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\nlet parse_header_body (short_dcid_len: short_dcid_len_t) (k': LPB.bitsum'_key_type first_byte)\n : Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k')) =", "completed_definiton": "match k' with\n| (| Short , (| () , () |) |) ->\n (| _, LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n| (| Long , (| () , (| Initial , () |) |) |) -> (| _, parse_long_initial_body |)\n| (| Long , (| () , (| ZeroRTT , () |) |) |) -> (| _, parse_long_zero_rtt_body |)\n| (| Long , (| () , (| Handshake , () |) |) |) -> (| _, parse_long_handshake_body |)\n| (| Long , (| () , (| Retry , () |) |) |) -> (| _, parse_long_retry_body |)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.serialize_header_body", "original_source_type": "val serialize_header_body (short_dcid_len: short_dcid_len_t) (k': LPB.bitsum'_key_type first_byte)\n : Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k')))", "source_type": "val serialize_header_body (short_dcid_len: short_dcid_len_t) (k': LPB.bitsum'_key_type first_byte)\n : Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k')))", "source_definition": "let serialize_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.serialize_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize_flbytes (U32.v short_dcid_len))\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n serialize_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n serialize_long_handshake_body\n | (| Long, (| (), (| Initial, () |) |) |) ->\n serialize_long_initial_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n serialize_long_retry_body", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 309, "start_col": 2, "end_line": 319, "end_col": 29 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop\n\nlet serialize_long_zero_rtt_body : LP.serializer parse_long_zero_rtt_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_handshake_body : LP.serializer parse_long_handshake_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_retry_body : LP.serializer parse_long_retry_body = serialize_common_long `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20\nlet serialize_long_initial_body : LP.serializer parse_long_initial_body = serialize_common_long `LP.serialize_nondep_then` (\n LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length)\n\nlet serialize_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n k': LowParse.Spec.BitSum.bitsum'_key_type QUIC.Spec.Header.Public.first_byte\n -> LowParse.Spec.Base.serializer (FStar.Pervasives.dsnd (QUIC.Spec.Header.Public.parse_header_body\n short_dcid_len\n k'))", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "LowParse.Spec.BitSum.bitsum'_key_type", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "LowParse.Spec.Base.coerce", "LowParse.Spec.Combinators.serialize_weaken", "LowParse.Spec.Base.total_constant_size_parser_kind", "FStar.UInt32.v", "FStar.Bytes.lbytes", "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some", "LowParse.Spec.Bytes.parse_flbytes", "LowParse.Spec.Bytes.serialize_flbytes", "QUIC.Spec.Header.Public.serialize_long_zero_rtt_body", "QUIC.Spec.Header.Public.serialize_long_handshake_body", "QUIC.Spec.Header.Public.serialize_long_initial_body", "QUIC.Spec.Header.Public.serialize_long_retry_body", "LowParse.Spec.Base.serializer", "Prims.__proj__Mkdtuple2__item___1", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.parser", "QUIC.Spec.Header.Public.header_body_type", "QUIC.Spec.Header.Public.parse_header_body", "FStar.Pervasives.dsnd" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_header_body (short_dcid_len: short_dcid_len_t) (k': LPB.bitsum'_key_type first_byte)\n : Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k')))\nlet serialize_header_body (short_dcid_len: short_dcid_len_t) (k': LPB.bitsum'_key_type first_byte)\n : Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k'))) =", "completed_definiton": "match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n| (| Short , (| () , () |) |) ->\n LP.serialize_weaken (LP.strong_parser_kind 0 20 None)\n (LP.serialize_flbytes (U32.v short_dcid_len))\n| (| Long , (| () , (| ZeroRTT , () |) |) |) -> serialize_long_zero_rtt_body\n| (| Long , (| () , (| Handshake , () |) |) |) -> serialize_long_handshake_body\n| (| Long , (| () , (| Initial , () |) |) |) -> serialize_long_initial_body\n| (| Long , (| () , (| Retry , () |) |) |) -> serialize_long_retry_body", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.header_synth", "original_source_type": "val header_synth (short_dcid_len: short_dcid_len_t)\n : Tot\n (LPB.synth_case_t first_byte\n (header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len))", "source_type": "val header_synth (short_dcid_len: short_dcid_len_t)\n : Tot\n (LPB.synth_case_t first_byte\n (header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len))", "source_definition": "let header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 214, "start_col": 2, "end_line": 220, "end_col": 3 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "short_dcid_len: QUIC.Spec.Base.short_dcid_len_t\n -> LowParse.Spec.BitSum.synth_case_t QUIC.Spec.Header.Public.first_byte\n (QUIC.Spec.Header.Public.header' short_dcid_len)\n (QUIC.Spec.Header.Public.first_byte_of_header short_dcid_len)\n (QUIC.Spec.Header.Public.header_body_type short_dcid_len)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "LowParse.Spec.BitSum.SynthCase", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.first_byte_of_header", "QUIC.Spec.Header.Public.header_body_type", "QUIC.Spec.Header.Public.mk_header", "LowParse.Spec.BitSum.bitsum'_type", "LowParse.Spec.BitSum.bitsum'_key_of_t", "Prims.unit", "QUIC.Spec.Header.Public.mk_header_body", "LowParse.Spec.Base.refine_with_tag", "LowParse.Spec.BitSum.synth_case_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_synth (short_dcid_len: short_dcid_len_t)\n : Tot\n (LPB.synth_case_t first_byte\n (header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len))\nlet header_synth (short_dcid_len: short_dcid_len_t)\n : Tot\n (LPB.synth_case_t first_byte\n (header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)) =", "completed_definiton": "(LPB.SynthCase #_\n #_\n #_\n #first_byte\n #_\n #(first_byte_of_header short_dcid_len)\n #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ()))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.header_form", "original_source_type": "val header_form:LP.enum header_form_t (LPB.bitfield LPB.uint8 1)", "source_type": "val header_form:LP.enum header_form_t (LPB.bitfield LPB.uint8 1)", "source_definition": "let header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 14, "start_col": 69, "end_line": 17, "end_col": 1 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Enum.enum QUIC.Spec.Header.Public.header_form_t\n (LowParse.BitFields.bitfield LowParse.BitFields.uint8 1)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.Cons", "FStar.Pervasives.Native.tuple2", "QUIC.Spec.Header.Public.header_form_t", "LowParse.BitFields.bitfield", "FStar.UInt8.t", "LowParse.BitFields.uint8", "FStar.Pervasives.Native.Mktuple2", "QUIC.Spec.Header.Public.Long", "FStar.UInt8.__uint_to_t", "QUIC.Spec.Header.Public.Short", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_form:LP.enum header_form_t (LPB.bitfield LPB.uint8 1)\nlet header_form:LP.enum header_form_t (LPB.bitfield LPB.uint8 1) =", "completed_definiton": "[Long, 1uy; Short, 0uy]", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.set_valid_bitfield_intro", "original_source_type": "val set_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n : Lemma\n (LPB.is_valid_bitfield first_byte\n (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))\n 0\n (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) ==\n LPB.set_valid_bitfield first_byte\n (first_byte_of_header short_dcid_len h)\n 0\n (if PShort? h then 5 else 4)\n new_pb /\\\n LPB.bitsum'_key_of_t first_byte\n (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) ==\n LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))", "source_type": "val set_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n : Lemma\n (LPB.is_valid_bitfield first_byte\n (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))\n 0\n (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) ==\n LPB.set_valid_bitfield first_byte\n (first_byte_of_header short_dcid_len h)\n 0\n (if PShort? h then 5 else 4)\n new_pb /\\\n LPB.bitsum'_key_of_t first_byte\n (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) ==\n LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))", "source_definition": "let set_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb /\\\n LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) == LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)\n )\n= set_valid_bitfield_intro' short_dcid_len h new_pb;\n LPB.bitsum'_key_of_t_set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 452, "start_col": 2, "end_line": 453, "end_col": 130 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop\n\nlet serialize_long_zero_rtt_body : LP.serializer parse_long_zero_rtt_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_handshake_body : LP.serializer parse_long_handshake_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_retry_body : LP.serializer parse_long_retry_body = serialize_common_long `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20\nlet serialize_long_initial_body : LP.serializer parse_long_initial_body = serialize_common_long `LP.serialize_nondep_then` (\n LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length)\n\nlet serialize_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.serialize_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize_flbytes (U32.v short_dcid_len))\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n serialize_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n serialize_long_handshake_body\n | (| Long, (| (), (| Initial, () |) |) |) ->\n serialize_long_initial_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n serialize_long_retry_body\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))\n= LPB.serialize_bitsum\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len) h ==\n LP.serialize LP.serialize_u8 (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h)) `Seq.append`\n LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n= LPB.serialize_bitsum_eq'\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n h\n\n#push-options \"--z3rlimit 64\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h\n ))\n= serialize_header_eq short_dcid_len1 h;\n serialize_header_eq short_dcid_len2 h;\n ()\n\n#pop-options\n\nlet serialize_header_is_short\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in\n assert (Seq.index s 0 == x);\n assert (PShort? h <==> LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Short <: U8.t))\n\nlet first_byte_is_retry\n (k: LPB.bitsum'_type first_byte)\n: GTot bool\n= match k with\n | (| Long, (| (), (| Retry, (unused, ()) |) |) |) -> true\n | _ -> false\n\nlet first_byte_is_retry_correct\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (is_retry h <==> first_byte_is_retry (first_byte_of_header short_dcid_len h))\n= ()\n\n#push-options \"--z3rlimit 512\"\n#restart-solver\n\nlet serialize_header_is_retry\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in \n assert (Seq.index s 0 == x);\n assert (is_retry h <==> (\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Long <: U8.t) /\\\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 4 6 == (LowParse.Spec.Enum.enum_repr_of_key long_packet_type Retry <: U8.t)\n ))\n\n#pop-options\n\n#restart-solver\n\n\nlet is_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4))\n= ()\n\nlet set_valid_bitfield_intro'\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb\n )\n= is_valid_bitfield_intro short_dcid_len h\n\nlet set_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb /\\\n LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) == LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n h: QUIC.Spec.Header.Public.header' short_dcid_len ->\n new_pb:\n QUIC.Spec.Base.bitfield (match PShort? h with\n | true -> 5\n | _ -> 4)\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.BitSum.is_valid_bitfield QUIC.Spec.Header.Public.first_byte\n (LowParse.Spec.BitSum.bitsum'_key_of_t QUIC.Spec.Header.Public.first_byte\n (QUIC.Spec.Header.Public.first_byte_of_header short_dcid_len h))\n 0\n (match PShort? h with\n | true -> 5\n | _ -> 4) /\\\n QUIC.Spec.Header.Public.first_byte_of_header short_dcid_len\n (QUIC.Spec.Header.Public.set_protected_bits h new_pb) ==\n LowParse.Spec.BitSum.set_valid_bitfield QUIC.Spec.Header.Public.first_byte\n (QUIC.Spec.Header.Public.first_byte_of_header short_dcid_len h)\n 0\n (match PShort? h with\n | true -> 5\n | _ -> 4)\n new_pb /\\\n LowParse.Spec.BitSum.bitsum'_key_of_t QUIC.Spec.Header.Public.first_byte\n (QUIC.Spec.Header.Public.first_byte_of_header short_dcid_len\n (QUIC.Spec.Header.Public.set_protected_bits h new_pb)) ==\n LowParse.Spec.BitSum.bitsum'_key_of_t QUIC.Spec.Header.Public.first_byte\n (QUIC.Spec.Header.Public.first_byte_of_header short_dcid_len h))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Base.bitfield", "QUIC.Spec.Header.Public.uu___is_PShort", "Prims.bool", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "LowParse.Spec.BitSum.bitsum'_key_of_t_set_valid_bitfield", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "QUIC.Spec.Header.Public.first_byte_of_header", "LowParse.Spec.BitSum.is_valid_bitfield", "LowParse.Spec.BitSum.bitsum'_key_of_t", "Prims.unit", "QUIC.Spec.Header.Public.set_valid_bitfield_intro'", "Prims.l_True", "Prims.squash", "Prims.l_and", "Prims.eq2", "LowParse.Spec.BitSum.bitsum'_type", "QUIC.Spec.Header.Public.set_protected_bits", "LowParse.Spec.BitSum.set_valid_bitfield", "LowParse.Spec.BitSum.bitsum'_key_type", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val set_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n : Lemma\n (LPB.is_valid_bitfield first_byte\n (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))\n 0\n (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) ==\n LPB.set_valid_bitfield first_byte\n (first_byte_of_header short_dcid_len h)\n 0\n (if PShort? h then 5 else 4)\n new_pb /\\\n LPB.bitsum'_key_of_t first_byte\n (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) ==\n LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))\nlet set_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n : Lemma\n (LPB.is_valid_bitfield first_byte\n (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))\n 0\n (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) ==\n LPB.set_valid_bitfield first_byte\n (first_byte_of_header short_dcid_len h)\n 0\n (if PShort? h then 5 else 4)\n new_pb /\\\n LPB.bitsum'_key_of_t first_byte\n (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) ==\n LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) =", "completed_definiton": "set_valid_bitfield_intro' short_dcid_len h new_pb;\nLPB.bitsum'_key_of_t_set_valid_bitfield first_byte\n (first_byte_of_header short_dcid_len h)\n 0\n (if PShort? h then 5 else 4)\n new_pb", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.mk_header", "original_source_type": "val mk_header\n (short_dcid_len: short_dcid_len_t)\n (k': LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n : Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')", "source_type": "val mk_header\n (short_dcid_len: short_dcid_len_t)\n (k': LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n : Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')", "source_definition": "let mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 147, "start_col": 2, "end_line": 171, "end_col": 7 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n k': LowParse.Spec.BitSum.bitsum'_type QUIC.Spec.Header.Public.first_byte ->\n pl:\n QUIC.Spec.Header.Public.header_body_type short_dcid_len\n (LowParse.Spec.BitSum.bitsum'_key_of_t QUIC.Spec.Header.Public.first_byte k')\n -> LowParse.Spec.Base.refine_with_tag (QUIC.Spec.Header.Public.first_byte_of_header short_dcid_len\n )\n k'", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "LowParse.Spec.BitSum.bitsum'_type", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "QUIC.Spec.Header.Public.header_body_type", "LowParse.Spec.BitSum.bitsum'_key_of_t", "LowParse.BitFields.bitfield", "QUIC.Spec.Header.Public.PShort", "FStar.Bytes.lbytes", "FStar.UInt32.v", "LowParse.Spec.Base.coerce", "Prims.bool", "Prims.op_Equality", "FStar.UInt8.__uint_to_t", "FStar.Pervasives.Native.tuple2", "QUIC.Spec.Header.Public.common_long_t", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "QUIC.Spec.Base.token_max_len", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "FStar.UInt32.t", "QUIC.Spec.Header.Public.PLong", "QUIC.Spec.Header.Public.PInitial", "LowParse.Spec.Base.refine_with_tag", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.first_byte_of_header", "QUIC.Spec.Header.Public.PZeroRTT", "QUIC.Spec.Header.Public.PHandshake", "QUIC.Spec.Header.Public.PRetry" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val mk_header\n (short_dcid_len: short_dcid_len_t)\n (k': LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n : Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k': LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n : Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k') =", "completed_definiton": "match k' with\n| (| Short , (| () , (spin, (protected_bits, ())) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n| (| Long , (| () , (| Initial , (protected_bits, ()) |) |) |) ->\n (match\n LP.coerce (common_long_t &\n (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n pl\n with\n | (version, (dcid, scid)), (token, payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length))\n| (| Long , (| () , (| ZeroRTT , (protected_bits, ()) |) |) |) ->\n (match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | (version, (dcid, scid)), payload_and_pn_length ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length))\n| (| Long , (| () , (| Handshake , (protected_bits, ()) |) |) |) ->\n (match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | (version, (dcid, scid)), payload_and_pn_length ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length)))\n| (| Long , (| () , (| Retry , (protected_bits, ()) |) |) |) ->\n match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | (version, (dcid, scid)), odcid -> PLong protected_bits version dcid scid (PRetry odcid)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.serialize_header_is_short", "original_source_type": "val serialize_header_is_short\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma (\n let s = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length s > 0 /\\\n (PShort? h <==> LPB.get_bitfield (U8.v (Seq.index s 0)) 7 8 == 0)\n )", "source_type": "val serialize_header_is_short\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma (\n let s = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length s > 0 /\\\n (PShort? h <==> LPB.get_bitfield (U8.v (Seq.index s 0)) 7 8 == 0)\n )", "source_definition": "let serialize_header_is_short\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in\n assert (Seq.index s 0 == x);\n assert (PShort? h <==> LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Short <: U8.t))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 380, "start_col": 2, "end_line": 386, "end_col": 139 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop\n\nlet serialize_long_zero_rtt_body : LP.serializer parse_long_zero_rtt_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_handshake_body : LP.serializer parse_long_handshake_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_retry_body : LP.serializer parse_long_retry_body = serialize_common_long `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20\nlet serialize_long_initial_body : LP.serializer parse_long_initial_body = serialize_common_long `LP.serialize_nondep_then` (\n LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length)\n\nlet serialize_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.serialize_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize_flbytes (U32.v short_dcid_len))\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n serialize_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n serialize_long_handshake_body\n | (| Long, (| (), (| Initial, () |) |) |) ->\n serialize_long_initial_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n serialize_long_retry_body\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))\n= LPB.serialize_bitsum\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len) h ==\n LP.serialize LP.serialize_u8 (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h)) `Seq.append`\n LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n= LPB.serialize_bitsum_eq'\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n h\n\n#push-options \"--z3rlimit 64\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h\n ))\n= serialize_header_eq short_dcid_len1 h;\n serialize_header_eq short_dcid_len2 h;\n ()\n\n#pop-options\n\nlet serialize_header_is_short\n dl h", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "short_dcid_len: QUIC.Spec.Base.short_dcid_len_t -> h: QUIC.Spec.Header.Public.header' short_dcid_len\n -> FStar.Pervasives.Lemma\n (ensures\n (let s =\n LowParse.Spec.Base.serialize (QUIC.Spec.Header.Public.serialize_header short_dcid_len) h\n in\n FStar.Seq.Base.length s > 0 /\\\n (PShort? h <==>\n LowParse.BitFields.get_bitfield (FStar.UInt8.v (FStar.Seq.Base.index s 0)) 7 8 == 0)))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.Header.Public.header'", "Prims._assert", "Prims.l_iff", "Prims.b2t", "QUIC.Spec.Header.Public.uu___is_PShort", "Prims.eq2", "FStar.UInt8.t", "LowParse.BitFields.__proj__Mkuint_t__item__get_bitfield", "LowParse.BitFields.uint8", "FStar.Seq.Base.index", "LowParse.Bytes.byte", "LowParse.Spec.Enum.enum_repr_of_key", "QUIC.Spec.Header.Public.header_form_t", "LowParse.BitFields.bitfield", "QUIC.Spec.Header.Public.header_form", "QUIC.Spec.Header.Public.Short", "Prims.unit", "LowParse.Bytes.bytes", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "LowParse.Spec.Int.serialize_u8_spec", "LowParse.Spec.Combinators.parse_filter_refine", "LowParse.Spec.BitSum.filter_bitsum'", "QUIC.Spec.Header.Public.first_byte", "LowParse.Spec.BitSum.synth_bitsum'_recip", "LowParse.Spec.BitSum.bitsum'_type", "QUIC.Spec.Header.Public.first_byte_of_header", "QUIC.Spec.Header.Public.serialize_header_eq" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_header_is_short\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma (\n let s = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length s > 0 /\\\n (PShort? h <==> LPB.get_bitfield (U8.v (Seq.index s 0)) 7 8 == 0)\n )\nlet serialize_header_is_short dl h =", "completed_definiton": "serialize_header_eq dl h;\nlet tg = first_byte_of_header dl h in\nlet x = LPB.synth_bitsum'_recip first_byte tg in\nLP.serialize_u8_spec x;\nlet s = LP.serialize (serialize_header dl) h in\nassert (Seq.index s 0 == x);\nassert (PShort? h <==>\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 ==\n (LowParse.Spec.Enum.enum_repr_of_key header_form Short <: U8.t))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.mk_header_body", "original_source_type": "val mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k': LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n : Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))", "source_type": "val mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k': LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n : Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))", "source_definition": "let mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 181, "start_col": 2, "end_line": 205, "end_col": 7 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n k': LowParse.Spec.BitSum.bitsum'_type QUIC.Spec.Header.Public.first_byte ->\n pl:\n LowParse.Spec.Base.refine_with_tag (QUIC.Spec.Header.Public.first_byte_of_header short_dcid_len\n )\n k'\n -> QUIC.Spec.Header.Public.header_body_type short_dcid_len\n (LowParse.Spec.BitSum.bitsum'_key_of_t QUIC.Spec.Header.Public.first_byte k')", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "LowParse.Spec.BitSum.bitsum'_type", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "LowParse.Spec.Base.refine_with_tag", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.first_byte_of_header", "LowParse.BitFields.bitfield", "QUIC.Spec.Base.bitfield", "Prims.bool", "QUIC.Spec.Base.vlbytes", "LowParse.Spec.Base.coerce", "QUIC.Spec.Header.Public.header_body_type", "LowParse.Spec.BitSum.bitsum'_key_of_t", "FStar.Bytes.lbytes", "FStar.UInt32.v", "FStar.UInt32.t", "QUIC.Spec.Base.token_max_len", "QUIC.Spec.Base.payload_and_pn_length_t", "FStar.Pervasives.Native.tuple2", "QUIC.Spec.Header.Public.common_long_t", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "FStar.Pervasives.Native.Mktuple2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k': LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n : Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k': LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n : Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) =", "completed_definiton": "match k' with\n| (| Short , (| () , (spin, (protected_bits, ())) |) |) ->\n (match pl with\n | PShort _ _ dcid ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n ((dcid) <: (FB.lbytes (U32.v short_dcid_len))))\n| (| Long , (| () , (| Initial , (protected_bits, ()) |) |) |) ->\n (match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n (((version, (dcid, scid)), (token, (payload_and_pn_length)))\n <:\n (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n )\n| (| Long , (| () , (| ZeroRTT , (protected_bits, ()) |) |) |) ->\n (match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n (((version, (dcid, scid)), (payload_and_pn_length))\n <:\n (common_long_t & payload_and_pn_length_t')))\n| (| Long , (| () , (| Handshake , (protected_bits, ()) |) |) |) ->\n (match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n (((version, (dcid, scid)), (payload_and_pn_length))\n <:\n (common_long_t & payload_and_pn_length_t')))\n| (| Long , (| () , (| Retry , (protected_bits, ()) |) |) |) ->\n match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.long_packet_type", "original_source_type": "val long_packet_type:LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2)", "source_type": "val long_packet_type:LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2)", "source_definition": "let long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 36, "start_col": 79, "end_line": 41, "end_col": 1 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Enum.enum QUIC.Spec.Header.Public.long_packet_type_t\n (LowParse.BitFields.bitfield LowParse.BitFields.uint8 2)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.Cons", "FStar.Pervasives.Native.tuple2", "QUIC.Spec.Header.Public.long_packet_type_t", "LowParse.BitFields.bitfield", "FStar.UInt8.t", "LowParse.BitFields.uint8", "FStar.Pervasives.Native.Mktuple2", "QUIC.Spec.Header.Public.Initial", "FStar.UInt8.__uint_to_t", "QUIC.Spec.Header.Public.ZeroRTT", "QUIC.Spec.Header.Public.Handshake", "QUIC.Spec.Header.Public.Retry", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val long_packet_type:LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2)\nlet long_packet_type:LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) =", "completed_definiton": "[Initial, 0uy; ZeroRTT, 1uy; Handshake, 2uy; Retry, 3uy]", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.header_len'_correct_short", "original_source_type": "val header_len'_correct_short\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 5)\n (spin: bool)\n (dcid: vlbytes 0 20)\n : Lemma\n (requires\n (let h = PShort protected_bits spin dcid in\n parse_header_prop short_dcid_len h))\n (ensures\n (let h = PShort protected_bits spin dcid in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)))", "source_type": "val header_len'_correct_short\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 5)\n (spin: bool)\n (dcid: vlbytes 0 20)\n : Lemma\n (requires\n (let h = PShort protected_bits spin dcid in\n parse_header_prop short_dcid_len h))\n (ensures\n (let h = PShort protected_bits spin dcid in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)))", "source_definition": "let header_len'_correct_short\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 5)\n (spin: bool)\n (dcid: vlbytes 0 20)\n: Lemma\n (requires (let h = PShort protected_bits spin dcid in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PShort protected_bits spin dcid in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)\n ))\n= \n let h = PShort protected_bits spin dcid in\n serialize_header_eq short_dcid_len h;\n let tg = first_byte_of_header short_dcid_len h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_length LP.serialize_u8 x;\n assert_norm (first_byte_of_header short_dcid_len (PShort protected_bits spin dcid) == (| Short, (| (), ((if spin then 1uy else 0uy), (protected_bits, ()) ) |) |) );\n assert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len (PShort protected_bits spin dcid)) == (| Short, (| (), () |) |) );\n LP.serialize_length (LP.serialize_flbytes (U32.v short_dcid_len)) dcid", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 519, "start_col": 1, "end_line": 527, "end_col": 72 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop\n\nlet serialize_long_zero_rtt_body : LP.serializer parse_long_zero_rtt_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_handshake_body : LP.serializer parse_long_handshake_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_retry_body : LP.serializer parse_long_retry_body = serialize_common_long `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20\nlet serialize_long_initial_body : LP.serializer parse_long_initial_body = serialize_common_long `LP.serialize_nondep_then` (\n LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length)\n\nlet serialize_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.serialize_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize_flbytes (U32.v short_dcid_len))\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n serialize_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n serialize_long_handshake_body\n | (| Long, (| (), (| Initial, () |) |) |) ->\n serialize_long_initial_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n serialize_long_retry_body\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))\n= LPB.serialize_bitsum\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len) h ==\n LP.serialize LP.serialize_u8 (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h)) `Seq.append`\n LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n= LPB.serialize_bitsum_eq'\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n h\n\n#push-options \"--z3rlimit 64\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h\n ))\n= serialize_header_eq short_dcid_len1 h;\n serialize_header_eq short_dcid_len2 h;\n ()\n\n#pop-options\n\nlet serialize_header_is_short\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in\n assert (Seq.index s 0 == x);\n assert (PShort? h <==> LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Short <: U8.t))\n\nlet first_byte_is_retry\n (k: LPB.bitsum'_type first_byte)\n: GTot bool\n= match k with\n | (| Long, (| (), (| Retry, (unused, ()) |) |) |) -> true\n | _ -> false\n\nlet first_byte_is_retry_correct\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (is_retry h <==> first_byte_is_retry (first_byte_of_header short_dcid_len h))\n= ()\n\n#push-options \"--z3rlimit 512\"\n#restart-solver\n\nlet serialize_header_is_retry\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in \n assert (Seq.index s 0 == x);\n assert (is_retry h <==> (\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Long <: U8.t) /\\\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 4 6 == (LowParse.Spec.Enum.enum_repr_of_key long_packet_type Retry <: U8.t)\n ))\n\n#pop-options\n\n#restart-solver\n\n\nlet is_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4))\n= ()\n\nlet set_valid_bitfield_intro'\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb\n )\n= is_valid_bitfield_intro short_dcid_len h\n\nlet set_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb /\\\n LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) == LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)\n )\n= set_valid_bitfield_intro' short_dcid_len h new_pb;\n LPB.bitsum'_key_of_t_set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb\n\nlet mk_header_body_set_valid_bitfield\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) (set_protected_bits h new_pb) ==\n mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h)\n= ()\n\n#push-options \"--z3rlimit 512\"\n\n#restart-solver\n\nlet serialize_get_protected_bits\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (let sq = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length sq > 0 /\\\n get_protected_bits h == LPB.uint8.LPB.get_bitfield (Seq.head sq) 0 (if PShort? h then 5 else 4))\n= let sq = LP.serialize (serialize_header short_dcid_len) h in\n serialize_header_eq\n short_dcid_len\n h;\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h))\n\n#restart-solver\n\nlet serialize_set_protected_bits\n short_dcid_len h new_pb\n= let h' = set_protected_bits h new_pb in\n let sq = LP.serialize (serialize_header short_dcid_len) h in\n let sq' = LP.serialize (serialize_header short_dcid_len) h' in\n set_valid_bitfield_intro short_dcid_len h new_pb;\n serialize_header_eq\n short_dcid_len\n h;\n serialize_header_eq\n short_dcid_len\n h';\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h));\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h'));\n LPB.set_valid_bitfield_correct first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb;\n mk_header_body_set_valid_bitfield short_dcid_len h new_pb;\n assert (LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h'))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h') h') == LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h));\n assert (Seq.tail sq' `Seq.equal` LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h'))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h') h'));\n assert (Seq.tail sq `Seq.equal` LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n\n#pop-options\n\n\nlet header_len'_correct_short\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 5)\n (spin: bool)\n (dcid: vlbytes 0 20)\n: Lemma\n (requires (let h = PShort protected_bits spin dcid in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PShort protected_bits spin dcid in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n protected_bits: QUIC.Spec.Base.bitfield 5 ->\n spin: Prims.bool ->\n dcid: QUIC.Spec.Base.vlbytes 0 20\n -> FStar.Pervasives.Lemma\n (requires\n (let h = QUIC.Spec.Header.Public.PShort protected_bits spin dcid in\n QUIC.Spec.Header.Public.parse_header_prop short_dcid_len h))\n (ensures\n (let h = QUIC.Spec.Header.Public.PShort protected_bits spin dcid in\n QUIC.Spec.Header.Public.header_len' h ==\n FStar.Seq.Base.length (LowParse.Spec.Base.serialize (QUIC.Spec.Header.Public.serialize_header\n short_dcid_len)\n h)))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.Base.bitfield", "Prims.bool", "QUIC.Spec.Base.vlbytes", "LowParse.Spec.Base.serialize_length", "LowParse.Spec.Base.total_constant_size_parser_kind", "FStar.UInt32.v", "FStar.Bytes.lbytes", "LowParse.Spec.Bytes.parse_flbytes", "LowParse.Spec.Bytes.serialize_flbytes", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.dtuple2", "LowParse.Spec.Enum.enum_key", "QUIC.Spec.Header.Public.header_form_t", "LowParse.BitFields.bitfield", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.header_form", "LowParse.Spec.BitSum.bitsum'_key_type", "Prims.op_Subtraction", "LowParse.Spec.BitSum.BitSum'", "QUIC.Spec.Header.Public.fixed_bit", "LowParse.Spec.BitSum.BitField", "LowParse.Spec.BitSum.BitStop", "LowParse.Spec.BitSum.bitsum'", "QUIC.Spec.Header.Public.long_packet_type_t", "QUIC.Spec.Header.Public.long_packet_type", "LowParse.Spec.BitSum.bitsum'_key_of_t", "QUIC.Spec.Header.Public.first_byte", "QUIC.Spec.Header.Public.first_byte_of_header", "QUIC.Spec.Header.Public.PShort", "Prims.Mkdtuple2", "QUIC.Spec.Header.Public.Short", "LowParse.Spec.BitSum.bitsum'_type'", "FStar.Pervasives.Native.Mktuple2", "FStar.UInt8.__uint_to_t", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "LowParse.Spec.Combinators.parse_filter_refine", "LowParse.Spec.BitSum.filter_bitsum'", "LowParse.Spec.BitSum.synth_bitsum'_recip", "LowParse.Spec.BitSum.bitsum'_type", "QUIC.Spec.Header.Public.serialize_header_eq", "QUIC.Spec.Header.Public.header", "QUIC.Spec.Header.Public.parse_header_prop", "Prims.squash", "Prims.int", "Prims.l_or", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThan", "Prims.op_LessThanOrEqual", "QUIC.Spec.Base.header_len_bound", "Prims.op_GreaterThanOrEqual", "QUIC.Spec.Header.Public.header_len'", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_len'_correct_short\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 5)\n (spin: bool)\n (dcid: vlbytes 0 20)\n : Lemma\n (requires\n (let h = PShort protected_bits spin dcid in\n parse_header_prop short_dcid_len h))\n (ensures\n (let h = PShort protected_bits spin dcid in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)))\nlet header_len'_correct_short\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 5)\n (spin: bool)\n (dcid: vlbytes 0 20)\n : Lemma\n (requires\n (let h = PShort protected_bits spin dcid in\n parse_header_prop short_dcid_len h))\n (ensures\n (let h = PShort protected_bits spin dcid in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h))) =", "completed_definiton": "let h = PShort protected_bits spin dcid in\nserialize_header_eq short_dcid_len h;\nlet tg = first_byte_of_header short_dcid_len h in\nlet x = LPB.synth_bitsum'_recip first_byte tg in\nLP.serialize_length LP.serialize_u8 x;\nassert_norm (first_byte_of_header short_dcid_len (PShort protected_bits spin dcid) ==\n (| Short, (| (), ((if spin then 1uy else 0uy), (protected_bits, ())) |) |));\nassert_norm (LPB.bitsum'_key_of_t first_byte\n (first_byte_of_header short_dcid_len (PShort protected_bits spin dcid)) ==\n (| Short, (| (), () |) |));\nLP.serialize_length (LP.serialize_flbytes (U32.v short_dcid_len)) dcid", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.set_valid_bitfield_intro'", "original_source_type": "val set_valid_bitfield_intro'\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n : Lemma\n (LPB.is_valid_bitfield first_byte\n (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))\n 0\n (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) ==\n LPB.set_valid_bitfield first_byte\n (first_byte_of_header short_dcid_len h)\n 0\n (if PShort? h then 5 else 4)\n new_pb)", "source_type": "val set_valid_bitfield_intro'\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n : Lemma\n (LPB.is_valid_bitfield first_byte\n (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))\n 0\n (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) ==\n LPB.set_valid_bitfield first_byte\n (first_byte_of_header short_dcid_len h)\n 0\n (if PShort? h then 5 else 4)\n new_pb)", "source_definition": "let set_valid_bitfield_intro'\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb\n )\n= is_valid_bitfield_intro short_dcid_len h", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 440, "start_col": 2, "end_line": 440, "end_col": 42 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop\n\nlet serialize_long_zero_rtt_body : LP.serializer parse_long_zero_rtt_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_handshake_body : LP.serializer parse_long_handshake_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_retry_body : LP.serializer parse_long_retry_body = serialize_common_long `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20\nlet serialize_long_initial_body : LP.serializer parse_long_initial_body = serialize_common_long `LP.serialize_nondep_then` (\n LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length)\n\nlet serialize_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.serialize_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize_flbytes (U32.v short_dcid_len))\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n serialize_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n serialize_long_handshake_body\n | (| Long, (| (), (| Initial, () |) |) |) ->\n serialize_long_initial_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n serialize_long_retry_body\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))\n= LPB.serialize_bitsum\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len) h ==\n LP.serialize LP.serialize_u8 (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h)) `Seq.append`\n LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n= LPB.serialize_bitsum_eq'\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n h\n\n#push-options \"--z3rlimit 64\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h\n ))\n= serialize_header_eq short_dcid_len1 h;\n serialize_header_eq short_dcid_len2 h;\n ()\n\n#pop-options\n\nlet serialize_header_is_short\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in\n assert (Seq.index s 0 == x);\n assert (PShort? h <==> LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Short <: U8.t))\n\nlet first_byte_is_retry\n (k: LPB.bitsum'_type first_byte)\n: GTot bool\n= match k with\n | (| Long, (| (), (| Retry, (unused, ()) |) |) |) -> true\n | _ -> false\n\nlet first_byte_is_retry_correct\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (is_retry h <==> first_byte_is_retry (first_byte_of_header short_dcid_len h))\n= ()\n\n#push-options \"--z3rlimit 512\"\n#restart-solver\n\nlet serialize_header_is_retry\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in \n assert (Seq.index s 0 == x);\n assert (is_retry h <==> (\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Long <: U8.t) /\\\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 4 6 == (LowParse.Spec.Enum.enum_repr_of_key long_packet_type Retry <: U8.t)\n ))\n\n#pop-options\n\n#restart-solver\n\n\nlet is_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4))\n= ()\n\nlet set_valid_bitfield_intro'\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n h: QUIC.Spec.Header.Public.header' short_dcid_len ->\n new_pb:\n QUIC.Spec.Base.bitfield (match PShort? h with\n | true -> 5\n | _ -> 4)\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.BitSum.is_valid_bitfield QUIC.Spec.Header.Public.first_byte\n (LowParse.Spec.BitSum.bitsum'_key_of_t QUIC.Spec.Header.Public.first_byte\n (QUIC.Spec.Header.Public.first_byte_of_header short_dcid_len h))\n 0\n (match PShort? h with\n | true -> 5\n | _ -> 4) /\\\n QUIC.Spec.Header.Public.first_byte_of_header short_dcid_len\n (QUIC.Spec.Header.Public.set_protected_bits h new_pb) ==\n LowParse.Spec.BitSum.set_valid_bitfield QUIC.Spec.Header.Public.first_byte\n (QUIC.Spec.Header.Public.first_byte_of_header short_dcid_len h)\n 0\n (match PShort? h with\n | true -> 5\n | _ -> 4)\n new_pb)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Base.bitfield", "QUIC.Spec.Header.Public.uu___is_PShort", "Prims.bool", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "QUIC.Spec.Header.Public.is_valid_bitfield_intro", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.l_and", "LowParse.Spec.BitSum.is_valid_bitfield", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "LowParse.Spec.BitSum.bitsum'_key_of_t", "QUIC.Spec.Header.Public.first_byte_of_header", "Prims.eq2", "LowParse.Spec.BitSum.bitsum'_type", "QUIC.Spec.Header.Public.set_protected_bits", "LowParse.Spec.BitSum.set_valid_bitfield", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val set_valid_bitfield_intro'\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n : Lemma\n (LPB.is_valid_bitfield first_byte\n (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))\n 0\n (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) ==\n LPB.set_valid_bitfield first_byte\n (first_byte_of_header short_dcid_len h)\n 0\n (if PShort? h then 5 else 4)\n new_pb)\nlet set_valid_bitfield_intro'\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n : Lemma\n (LPB.is_valid_bitfield first_byte\n (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))\n 0\n (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) ==\n LPB.set_valid_bitfield first_byte\n (first_byte_of_header short_dcid_len h)\n 0\n (if PShort? h then 5 else 4)\n new_pb) =", "completed_definiton": "is_valid_bitfield_intro short_dcid_len h", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.serialize_header_ext", "original_source_type": "val serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h\n ))", "source_type": "val serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h\n ))", "source_definition": "let serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h\n ))\n= serialize_header_eq short_dcid_len1 h;\n serialize_header_eq short_dcid_len2 h;\n ()", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 371, "start_col": 2, "end_line": 373, "end_col": 4 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop\n\nlet serialize_long_zero_rtt_body : LP.serializer parse_long_zero_rtt_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_handshake_body : LP.serializer parse_long_handshake_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_retry_body : LP.serializer parse_long_retry_body = serialize_common_long `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20\nlet serialize_long_initial_body : LP.serializer parse_long_initial_body = serialize_common_long `LP.serialize_nondep_then` (\n LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length)\n\nlet serialize_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.serialize_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize_flbytes (U32.v short_dcid_len))\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n serialize_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n serialize_long_handshake_body\n | (| Long, (| (), (| Initial, () |) |) |) ->\n serialize_long_initial_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n serialize_long_retry_body\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))\n= LPB.serialize_bitsum\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len) h ==\n LP.serialize LP.serialize_u8 (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h)) `Seq.append`\n LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n= LPB.serialize_bitsum_eq'\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n h\n\n#push-options \"--z3rlimit 64\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len1: QUIC.Spec.Base.short_dcid_len_t ->\n short_dcid_len2: QUIC.Spec.Base.short_dcid_len_t ->\n h: QUIC.Spec.Header.Public.header\n -> FStar.Pervasives.Lemma\n (requires\n QUIC.Spec.Header.Public.short_dcid_len_prop short_dcid_len1 h /\\\n QUIC.Spec.Header.Public.short_dcid_len_prop short_dcid_len2 h)\n (ensures\n QUIC.Spec.Header.Public.short_dcid_len_prop short_dcid_len1 h /\\\n QUIC.Spec.Header.Public.short_dcid_len_prop short_dcid_len2 h /\\\n LowParse.Spec.Base.serialize (QUIC.Spec.Header.Public.serialize_header short_dcid_len1) h ==\n LowParse.Spec.Base.serialize (QUIC.Spec.Header.Public.serialize_header short_dcid_len2) h)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.Header.Public.header", "Prims.unit", "QUIC.Spec.Header.Public.serialize_header_eq", "Prims.l_and", "QUIC.Spec.Header.Public.short_dcid_len_prop", "Prims.squash", "Prims.eq2", "LowParse.Bytes.bytes", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h\n ))\nlet serialize_header_ext (short_dcid_len1 short_dcid_len2: short_dcid_len_t) (h: header)\n : Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures\n (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h ==\n LP.serialize (serialize_header short_dcid_len2) h)) =", "completed_definiton": "serialize_header_eq short_dcid_len1 h;\nserialize_header_eq short_dcid_len2 h;\n()", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.header_len'_correct_long_retry", "original_source_type": "val header_len'_correct_long_retry\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid scid: vlbytes 0 20)\n (unused: bitfield 4)\n (odcid: vlbytes 0 20)\n : Lemma\n (requires\n (let h = PLong unused version dcid scid (PRetry odcid) in\n parse_header_prop short_dcid_len h))\n (ensures\n (let h = PLong unused version dcid scid (PRetry odcid) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)))", "source_type": "val header_len'_correct_long_retry\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid scid: vlbytes 0 20)\n (unused: bitfield 4)\n (odcid: vlbytes 0 20)\n : Lemma\n (requires\n (let h = PLong unused version dcid scid (PRetry odcid) in\n parse_header_prop short_dcid_len h))\n (ensures\n (let h = PLong unused version dcid scid (PRetry odcid) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)))", "source_definition": "let header_len'_correct_long_retry\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n (unused: bitfield 4)\n (odcid: vlbytes 0 20)\n: Lemma\n (requires (\n let h = PLong unused version dcid scid (PRetry odcid) in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PLong unused version dcid scid (PRetry odcid) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)\n ))\n=\n let h = PLong unused version dcid scid (PRetry odcid) in\n serialize_header_eq short_dcid_len h;\n let tg = (| Long, (| (), (| Retry, (unused, ()) |) |) |) in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_length LP.serialize_u8 x;\n let kt : LPB.bitsum'_key_type first_byte = (| Long, (| (), (| Retry, () |) |) |) in\n assert_norm (first_byte_of_header short_dcid_len h == tg );\n assert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h) == kt );\n LP.length_serialize_nondep_then serialize_common_long (LP.serialize_bounded_vlbytes 0 20) (version, (dcid, scid)) odcid;\n length_serialize_common_long version dcid scid;\n LP.length_serialize_bounded_vlbytes 0 20 odcid", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 670, "start_col": 1, "end_line": 681, "end_col": 48 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop\n\nlet serialize_long_zero_rtt_body : LP.serializer parse_long_zero_rtt_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_handshake_body : LP.serializer parse_long_handshake_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_retry_body : LP.serializer parse_long_retry_body = serialize_common_long `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20\nlet serialize_long_initial_body : LP.serializer parse_long_initial_body = serialize_common_long `LP.serialize_nondep_then` (\n LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length)\n\nlet serialize_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.serialize_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize_flbytes (U32.v short_dcid_len))\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n serialize_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n serialize_long_handshake_body\n | (| Long, (| (), (| Initial, () |) |) |) ->\n serialize_long_initial_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n serialize_long_retry_body\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))\n= LPB.serialize_bitsum\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len) h ==\n LP.serialize LP.serialize_u8 (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h)) `Seq.append`\n LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n= LPB.serialize_bitsum_eq'\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n h\n\n#push-options \"--z3rlimit 64\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h\n ))\n= serialize_header_eq short_dcid_len1 h;\n serialize_header_eq short_dcid_len2 h;\n ()\n\n#pop-options\n\nlet serialize_header_is_short\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in\n assert (Seq.index s 0 == x);\n assert (PShort? h <==> LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Short <: U8.t))\n\nlet first_byte_is_retry\n (k: LPB.bitsum'_type first_byte)\n: GTot bool\n= match k with\n | (| Long, (| (), (| Retry, (unused, ()) |) |) |) -> true\n | _ -> false\n\nlet first_byte_is_retry_correct\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (is_retry h <==> first_byte_is_retry (first_byte_of_header short_dcid_len h))\n= ()\n\n#push-options \"--z3rlimit 512\"\n#restart-solver\n\nlet serialize_header_is_retry\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in \n assert (Seq.index s 0 == x);\n assert (is_retry h <==> (\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Long <: U8.t) /\\\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 4 6 == (LowParse.Spec.Enum.enum_repr_of_key long_packet_type Retry <: U8.t)\n ))\n\n#pop-options\n\n#restart-solver\n\n\nlet is_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4))\n= ()\n\nlet set_valid_bitfield_intro'\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb\n )\n= is_valid_bitfield_intro short_dcid_len h\n\nlet set_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb /\\\n LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) == LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)\n )\n= set_valid_bitfield_intro' short_dcid_len h new_pb;\n LPB.bitsum'_key_of_t_set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb\n\nlet mk_header_body_set_valid_bitfield\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) (set_protected_bits h new_pb) ==\n mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h)\n= ()\n\n#push-options \"--z3rlimit 512\"\n\n#restart-solver\n\nlet serialize_get_protected_bits\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (let sq = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length sq > 0 /\\\n get_protected_bits h == LPB.uint8.LPB.get_bitfield (Seq.head sq) 0 (if PShort? h then 5 else 4))\n= let sq = LP.serialize (serialize_header short_dcid_len) h in\n serialize_header_eq\n short_dcid_len\n h;\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h))\n\n#restart-solver\n\nlet serialize_set_protected_bits\n short_dcid_len h new_pb\n= let h' = set_protected_bits h new_pb in\n let sq = LP.serialize (serialize_header short_dcid_len) h in\n let sq' = LP.serialize (serialize_header short_dcid_len) h' in\n set_valid_bitfield_intro short_dcid_len h new_pb;\n serialize_header_eq\n short_dcid_len\n h;\n serialize_header_eq\n short_dcid_len\n h';\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h));\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h'));\n LPB.set_valid_bitfield_correct first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb;\n mk_header_body_set_valid_bitfield short_dcid_len h new_pb;\n assert (LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h'))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h') h') == LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h));\n assert (Seq.tail sq' `Seq.equal` LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h'))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h') h'));\n assert (Seq.tail sq `Seq.equal` LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n\n#pop-options\n\n\nlet header_len'_correct_short\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 5)\n (spin: bool)\n (dcid: vlbytes 0 20)\n: Lemma\n (requires (let h = PShort protected_bits spin dcid in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PShort protected_bits spin dcid in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)\n ))\n= \n let h = PShort protected_bits spin dcid in\n serialize_header_eq short_dcid_len h;\n let tg = first_byte_of_header short_dcid_len h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_length LP.serialize_u8 x;\n assert_norm (first_byte_of_header short_dcid_len (PShort protected_bits spin dcid) == (| Short, (| (), ((if spin then 1uy else 0uy), (protected_bits, ()) ) |) |) );\n assert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len (PShort protected_bits spin dcid)) == (| Short, (| (), () |) |) );\n LP.serialize_length (LP.serialize_flbytes (U32.v short_dcid_len)) dcid\n\nlet length_serialize_common_long\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n: Lemma\n (Seq.length (LP.serialize serialize_common_long (version, (dcid, scid))) == 6 + FB.length dcid + FB.length scid)\n= LP.serialize_nondep_then_eq LP.serialize_u32 (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20) (version, (dcid, scid));\n LP.serialize_length LP.serialize_u32 version;\n LP.serialize_nondep_then_eq (LP.serialize_bounded_vlbytes 0 20) (LP.serialize_bounded_vlbytes 0 20) (dcid, scid);\n LP.length_serialize_bounded_vlbytes 0 20 dcid;\n LP.length_serialize_bounded_vlbytes 0 20 scid\n\nlet length_serialize_payload_and_pn_length\n (payload_and_pn_length: payload_and_pn_length_t)\n: Lemma\n (Seq.length (LP.serialize serialize_payload_and_pn_length payload_and_pn_length) == varint_len payload_and_pn_length)\n= VI.varint_len_correct payload_and_pn_length\n\n#pop-options\n\n#push-options \"--z3rlimit 128 --query_stats\"\n\n#restart-solver\n\nlet header_len'_correct_long_initial\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n (token: vlbytes 0 token_max_len)\n (payload_and_pn_length: payload_and_pn_length_t)\n: Lemma\n (requires (\n let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)\n ))\n=\n let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n serialize_header_eq short_dcid_len h;\n let tg : LPB.bitsum'_type first_byte = (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) in\n assert_norm (first_byte_of_header short_dcid_len h == tg);\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_length LP.serialize_u8 x;\n let kt : LPB.bitsum'_key_type first_byte = (| Long, (| (), (| Initial, () |) |) |) in\n assert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h) == kt );\n LP.length_serialize_nondep_then serialize_common_long (LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length) (version, (dcid, scid)) (token, payload_and_pn_length);\n length_serialize_common_long version dcid scid;\n LP.length_serialize_nondep_then (LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len)) (serialize_payload_and_pn_length) token payload_and_pn_length;\n LP.length_serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) token;\n VI.bounded_varint_len_correct 0 token_max_len (FB.len token);\n length_serialize_payload_and_pn_length payload_and_pn_length\n\n#pop-options\n\n#push-options \"--z3rlimit 128 --query_stats\"\n\n#restart-solver\n\nlet header_len'_correct_long_handshake\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n (payload_and_pn_length: payload_and_pn_length_t)\n: Lemma\n (requires (\n let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)\n ))\n=\n let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\n serialize_header_eq short_dcid_len h;\n let tg : LPB.bitsum'_type first_byte = (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) in\n assert_norm (first_byte_of_header short_dcid_len h == tg);\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_length LP.serialize_u8 x;\n let kt : LPB.bitsum'_key_type first_byte = (| Long, (| (), (| Handshake, () |) |) |) in\n assert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h) == kt );\n LP.length_serialize_nondep_then serialize_common_long serialize_payload_and_pn_length (version, (dcid, scid)) payload_and_pn_length;\n length_serialize_common_long version dcid scid;\n length_serialize_payload_and_pn_length payload_and_pn_length\n\n#restart-solver\n\nlet header_len'_correct_long_zero_rtt\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n (payload_and_pn_length: payload_and_pn_length_t)\n: Lemma\n (requires (\n let h = PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length) in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)\n ))\n=\n let h = PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length) in\n serialize_header_eq short_dcid_len h;\n let tg : LPB.bitsum'_type first_byte = (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) in\n assert_norm (first_byte_of_header short_dcid_len h == tg);\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_length LP.serialize_u8 x;\n let kt : LPB.bitsum'_key_type first_byte = (| Long, (| (), (| ZeroRTT, () |) |) |) in\n assert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h) == kt );\n LP.length_serialize_nondep_then serialize_common_long serialize_payload_and_pn_length (version, (dcid, scid)) payload_and_pn_length;\n length_serialize_common_long version dcid scid;\n length_serialize_payload_and_pn_length payload_and_pn_length\n\n#restart-solver\n\nlet header_len'_correct_long_retry\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n (unused: bitfield 4)\n (odcid: vlbytes 0 20)\n: Lemma\n (requires (\n let h = PLong unused version dcid scid (PRetry odcid) in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PLong unused version dcid scid (PRetry odcid) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n version: FStar.UInt32.t ->\n dcid: QUIC.Spec.Base.vlbytes 0 20 ->\n scid: QUIC.Spec.Base.vlbytes 0 20 ->\n unused: QUIC.Spec.Base.bitfield 4 ->\n odcid: QUIC.Spec.Base.vlbytes 0 20\n -> FStar.Pervasives.Lemma\n (requires\n (let h =\n QUIC.Spec.Header.Public.PLong unused\n version\n dcid\n scid\n (QUIC.Spec.Header.Public.PRetry odcid)\n in\n QUIC.Spec.Header.Public.parse_header_prop short_dcid_len h))\n (ensures\n (let h =\n QUIC.Spec.Header.Public.PLong unused\n version\n dcid\n scid\n (QUIC.Spec.Header.Public.PRetry odcid)\n in\n QUIC.Spec.Header.Public.header_len' h ==\n FStar.Seq.Base.length (LowParse.Spec.Base.serialize (QUIC.Spec.Header.Public.serialize_header\n short_dcid_len)\n h)))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "FStar.UInt32.t", "QUIC.Spec.Base.vlbytes", "QUIC.Spec.Base.bitfield", "LowParse.Spec.Bytes.length_serialize_bounded_vlbytes", "Prims.unit", "QUIC.Spec.Header.Public.length_serialize_common_long", "LowParse.Spec.Combinators.length_serialize_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Spec.Header.Public.serialize_common_long", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "LowParse.Spec.Bytes.parse_bounded_vlbytes", "LowParse.Spec.Bytes.serialize_bounded_vlbytes", "FStar.Pervasives.Native.Mktuple2", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.BitSum.bitsum'_key_type", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "LowParse.Spec.BitSum.bitsum'_key_of_t", "QUIC.Spec.Header.Public.first_byte_of_header", "Prims.dtuple2", "LowParse.Spec.Enum.enum_key", "QUIC.Spec.Header.Public.header_form_t", "LowParse.BitFields.bitfield", "QUIC.Spec.Header.Public.header_form", "LowParse.Spec.BitSum.bitsum'_type'", "Prims.op_Subtraction", "LowParse.Spec.BitSum.BitSum'", "QUIC.Spec.Header.Public.fixed_bit", "LowParse.Spec.BitSum.BitField", "LowParse.Spec.BitSum.BitStop", "LowParse.Spec.BitSum.bitsum'", "QUIC.Spec.Header.Public.long_packet_type_t", "QUIC.Spec.Header.Public.long_packet_type", "Prims.Mkdtuple2", "QUIC.Spec.Header.Public.Long", "QUIC.Spec.Header.Public.Retry", "LowParse.Spec.Base.serialize_length", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "LowParse.Spec.Combinators.parse_filter_refine", "LowParse.Spec.BitSum.filter_bitsum'", "LowParse.Spec.BitSum.synth_bitsum'_recip", "QUIC.Spec.Header.Public.serialize_header_eq", "QUIC.Spec.Header.Public.header", "QUIC.Spec.Header.Public.PLong", "QUIC.Spec.Header.Public.PRetry", "QUIC.Spec.Header.Public.parse_header_prop", "Prims.squash", "Prims.int", "Prims.l_or", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThan", "Prims.op_LessThanOrEqual", "QUIC.Spec.Base.header_len_bound", "Prims.op_GreaterThanOrEqual", "QUIC.Spec.Header.Public.header_len'", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_len'_correct_long_retry\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid scid: vlbytes 0 20)\n (unused: bitfield 4)\n (odcid: vlbytes 0 20)\n : Lemma\n (requires\n (let h = PLong unused version dcid scid (PRetry odcid) in\n parse_header_prop short_dcid_len h))\n (ensures\n (let h = PLong unused version dcid scid (PRetry odcid) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)))\nlet header_len'_correct_long_retry\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid scid: vlbytes 0 20)\n (unused: bitfield 4)\n (odcid: vlbytes 0 20)\n : Lemma\n (requires\n (let h = PLong unused version dcid scid (PRetry odcid) in\n parse_header_prop short_dcid_len h))\n (ensures\n (let h = PLong unused version dcid scid (PRetry odcid) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h))) =", "completed_definiton": "let h = PLong unused version dcid scid (PRetry odcid) in\nserialize_header_eq short_dcid_len h;\nlet tg = (| Long, (| (), (| Retry, (unused, ()) |) |) |) in\nlet x = LPB.synth_bitsum'_recip first_byte tg in\nLP.serialize_length LP.serialize_u8 x;\nlet kt:LPB.bitsum'_key_type first_byte = (| Long, (| (), (| Retry, () |) |) |) in\nassert_norm (first_byte_of_header short_dcid_len h == tg);\nassert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h) == kt);\nLP.length_serialize_nondep_then serialize_common_long\n (LP.serialize_bounded_vlbytes 0 20)\n (version, (dcid, scid))\n odcid;\nlength_serialize_common_long version dcid scid;\nLP.length_serialize_bounded_vlbytes 0 20 odcid", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.header_len'_correct_long_handshake", "original_source_type": "val header_len'_correct_long_handshake\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid scid: vlbytes 0 20)\n (payload_and_pn_length: payload_and_pn_length_t)\n : Lemma\n (requires\n (let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\n parse_header_prop short_dcid_len h))\n (ensures\n (let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)))", "source_type": "val header_len'_correct_long_handshake\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid scid: vlbytes 0 20)\n (payload_and_pn_length: payload_and_pn_length_t)\n : Lemma\n (requires\n (let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\n parse_header_prop short_dcid_len h))\n (ensures\n (let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)))", "source_definition": "let header_len'_correct_long_handshake\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n (payload_and_pn_length: payload_and_pn_length_t)\n: Lemma\n (requires (\n let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)\n ))\n=\n let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\n serialize_header_eq short_dcid_len h;\n let tg : LPB.bitsum'_type first_byte = (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) in\n assert_norm (first_byte_of_header short_dcid_len h == tg);\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_length LP.serialize_u8 x;\n let kt : LPB.bitsum'_key_type first_byte = (| Long, (| (), (| Handshake, () |) |) |) in\n assert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h) == kt );\n LP.length_serialize_nondep_then serialize_common_long serialize_payload_and_pn_length (version, (dcid, scid)) payload_and_pn_length;\n length_serialize_common_long version dcid scid;\n length_serialize_payload_and_pn_length payload_and_pn_length", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 608, "start_col": 1, "end_line": 619, "end_col": 62 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop\n\nlet serialize_long_zero_rtt_body : LP.serializer parse_long_zero_rtt_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_handshake_body : LP.serializer parse_long_handshake_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_retry_body : LP.serializer parse_long_retry_body = serialize_common_long `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20\nlet serialize_long_initial_body : LP.serializer parse_long_initial_body = serialize_common_long `LP.serialize_nondep_then` (\n LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length)\n\nlet serialize_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.serialize_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize_flbytes (U32.v short_dcid_len))\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n serialize_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n serialize_long_handshake_body\n | (| Long, (| (), (| Initial, () |) |) |) ->\n serialize_long_initial_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n serialize_long_retry_body\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))\n= LPB.serialize_bitsum\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len) h ==\n LP.serialize LP.serialize_u8 (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h)) `Seq.append`\n LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n= LPB.serialize_bitsum_eq'\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n h\n\n#push-options \"--z3rlimit 64\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h\n ))\n= serialize_header_eq short_dcid_len1 h;\n serialize_header_eq short_dcid_len2 h;\n ()\n\n#pop-options\n\nlet serialize_header_is_short\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in\n assert (Seq.index s 0 == x);\n assert (PShort? h <==> LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Short <: U8.t))\n\nlet first_byte_is_retry\n (k: LPB.bitsum'_type first_byte)\n: GTot bool\n= match k with\n | (| Long, (| (), (| Retry, (unused, ()) |) |) |) -> true\n | _ -> false\n\nlet first_byte_is_retry_correct\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (is_retry h <==> first_byte_is_retry (first_byte_of_header short_dcid_len h))\n= ()\n\n#push-options \"--z3rlimit 512\"\n#restart-solver\n\nlet serialize_header_is_retry\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in \n assert (Seq.index s 0 == x);\n assert (is_retry h <==> (\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Long <: U8.t) /\\\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 4 6 == (LowParse.Spec.Enum.enum_repr_of_key long_packet_type Retry <: U8.t)\n ))\n\n#pop-options\n\n#restart-solver\n\n\nlet is_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4))\n= ()\n\nlet set_valid_bitfield_intro'\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb\n )\n= is_valid_bitfield_intro short_dcid_len h\n\nlet set_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb /\\\n LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) == LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)\n )\n= set_valid_bitfield_intro' short_dcid_len h new_pb;\n LPB.bitsum'_key_of_t_set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb\n\nlet mk_header_body_set_valid_bitfield\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) (set_protected_bits h new_pb) ==\n mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h)\n= ()\n\n#push-options \"--z3rlimit 512\"\n\n#restart-solver\n\nlet serialize_get_protected_bits\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (let sq = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length sq > 0 /\\\n get_protected_bits h == LPB.uint8.LPB.get_bitfield (Seq.head sq) 0 (if PShort? h then 5 else 4))\n= let sq = LP.serialize (serialize_header short_dcid_len) h in\n serialize_header_eq\n short_dcid_len\n h;\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h))\n\n#restart-solver\n\nlet serialize_set_protected_bits\n short_dcid_len h new_pb\n= let h' = set_protected_bits h new_pb in\n let sq = LP.serialize (serialize_header short_dcid_len) h in\n let sq' = LP.serialize (serialize_header short_dcid_len) h' in\n set_valid_bitfield_intro short_dcid_len h new_pb;\n serialize_header_eq\n short_dcid_len\n h;\n serialize_header_eq\n short_dcid_len\n h';\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h));\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h'));\n LPB.set_valid_bitfield_correct first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb;\n mk_header_body_set_valid_bitfield short_dcid_len h new_pb;\n assert (LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h'))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h') h') == LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h));\n assert (Seq.tail sq' `Seq.equal` LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h'))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h') h'));\n assert (Seq.tail sq `Seq.equal` LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n\n#pop-options\n\n\nlet header_len'_correct_short\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 5)\n (spin: bool)\n (dcid: vlbytes 0 20)\n: Lemma\n (requires (let h = PShort protected_bits spin dcid in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PShort protected_bits spin dcid in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)\n ))\n= \n let h = PShort protected_bits spin dcid in\n serialize_header_eq short_dcid_len h;\n let tg = first_byte_of_header short_dcid_len h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_length LP.serialize_u8 x;\n assert_norm (first_byte_of_header short_dcid_len (PShort protected_bits spin dcid) == (| Short, (| (), ((if spin then 1uy else 0uy), (protected_bits, ()) ) |) |) );\n assert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len (PShort protected_bits spin dcid)) == (| Short, (| (), () |) |) );\n LP.serialize_length (LP.serialize_flbytes (U32.v short_dcid_len)) dcid\n\nlet length_serialize_common_long\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n: Lemma\n (Seq.length (LP.serialize serialize_common_long (version, (dcid, scid))) == 6 + FB.length dcid + FB.length scid)\n= LP.serialize_nondep_then_eq LP.serialize_u32 (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20) (version, (dcid, scid));\n LP.serialize_length LP.serialize_u32 version;\n LP.serialize_nondep_then_eq (LP.serialize_bounded_vlbytes 0 20) (LP.serialize_bounded_vlbytes 0 20) (dcid, scid);\n LP.length_serialize_bounded_vlbytes 0 20 dcid;\n LP.length_serialize_bounded_vlbytes 0 20 scid\n\nlet length_serialize_payload_and_pn_length\n (payload_and_pn_length: payload_and_pn_length_t)\n: Lemma\n (Seq.length (LP.serialize serialize_payload_and_pn_length payload_and_pn_length) == varint_len payload_and_pn_length)\n= VI.varint_len_correct payload_and_pn_length\n\n#pop-options\n\n#push-options \"--z3rlimit 128 --query_stats\"\n\n#restart-solver\n\nlet header_len'_correct_long_initial\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n (token: vlbytes 0 token_max_len)\n (payload_and_pn_length: payload_and_pn_length_t)\n: Lemma\n (requires (\n let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)\n ))\n=\n let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n serialize_header_eq short_dcid_len h;\n let tg : LPB.bitsum'_type first_byte = (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) in\n assert_norm (first_byte_of_header short_dcid_len h == tg);\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_length LP.serialize_u8 x;\n let kt : LPB.bitsum'_key_type first_byte = (| Long, (| (), (| Initial, () |) |) |) in\n assert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h) == kt );\n LP.length_serialize_nondep_then serialize_common_long (LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length) (version, (dcid, scid)) (token, payload_and_pn_length);\n length_serialize_common_long version dcid scid;\n LP.length_serialize_nondep_then (LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len)) (serialize_payload_and_pn_length) token payload_and_pn_length;\n LP.length_serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) token;\n VI.bounded_varint_len_correct 0 token_max_len (FB.len token);\n length_serialize_payload_and_pn_length payload_and_pn_length\n\n#pop-options\n\n#push-options \"--z3rlimit 128 --query_stats\"\n\n#restart-solver\n\nlet header_len'_correct_long_handshake\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n (payload_and_pn_length: payload_and_pn_length_t)\n: Lemma\n (requires (\n let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n protected_bits: QUIC.Spec.Base.bitfield 4 ->\n version: FStar.UInt32.t ->\n dcid: QUIC.Spec.Base.vlbytes 0 20 ->\n scid: QUIC.Spec.Base.vlbytes 0 20 ->\n payload_and_pn_length: QUIC.Spec.Base.payload_and_pn_length_t\n -> FStar.Pervasives.Lemma\n (requires\n (let h =\n QUIC.Spec.Header.Public.PLong protected_bits\n version\n dcid\n scid\n (QUIC.Spec.Header.Public.PHandshake payload_and_pn_length)\n in\n QUIC.Spec.Header.Public.parse_header_prop short_dcid_len h))\n (ensures\n (let h =\n QUIC.Spec.Header.Public.PLong protected_bits\n version\n dcid\n scid\n (QUIC.Spec.Header.Public.PHandshake payload_and_pn_length)\n in\n QUIC.Spec.Header.Public.header_len' h ==\n FStar.Seq.Base.length (LowParse.Spec.Base.serialize (QUIC.Spec.Header.Public.serialize_header\n short_dcid_len)\n h)))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.Base.bitfield", "FStar.UInt32.t", "QUIC.Spec.Base.vlbytes", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Header.Public.length_serialize_payload_and_pn_length", "Prims.unit", "QUIC.Spec.Header.Public.length_serialize_common_long", "LowParse.Spec.Combinators.length_serialize_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Spec.Header.Public.serialize_common_long", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "QUIC.Spec.Header.Public.serialize_payload_and_pn_length", "FStar.Pervasives.Native.Mktuple2", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.BitSum.bitsum'_key_type", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "LowParse.Spec.BitSum.bitsum'_key_of_t", "QUIC.Spec.Header.Public.first_byte_of_header", "Prims.Mkdtuple2", "LowParse.Spec.Enum.enum_key", "QUIC.Spec.Header.Public.header_form_t", "LowParse.BitFields.bitfield", "QUIC.Spec.Header.Public.header_form", "Prims.op_Subtraction", "LowParse.Spec.BitSum.BitSum'", "QUIC.Spec.Header.Public.fixed_bit", "LowParse.Spec.BitSum.BitField", "LowParse.Spec.BitSum.BitStop", "LowParse.Spec.BitSum.bitsum'", "QUIC.Spec.Header.Public.long_packet_type_t", "QUIC.Spec.Header.Public.long_packet_type", "QUIC.Spec.Header.Public.Long", "QUIC.Spec.Header.Public.Handshake", "LowParse.Spec.Base.serialize_length", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "LowParse.Spec.Combinators.parse_filter_refine", "LowParse.Spec.BitSum.filter_bitsum'", "LowParse.Spec.BitSum.synth_bitsum'_recip", "LowParse.Spec.BitSum.bitsum'_type", "LowParse.Spec.BitSum.bitsum'_type'", "QUIC.Spec.Header.Public.serialize_header_eq", "QUIC.Spec.Header.Public.header", "QUIC.Spec.Header.Public.PLong", "QUIC.Spec.Header.Public.PHandshake", "QUIC.Spec.Header.Public.parse_header_prop", "Prims.squash", "Prims.int", "Prims.l_or", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThan", "Prims.op_LessThanOrEqual", "QUIC.Spec.Base.header_len_bound", "Prims.op_GreaterThanOrEqual", "QUIC.Spec.Header.Public.header_len'", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_len'_correct_long_handshake\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid scid: vlbytes 0 20)\n (payload_and_pn_length: payload_and_pn_length_t)\n : Lemma\n (requires\n (let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\n parse_header_prop short_dcid_len h))\n (ensures\n (let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)))\nlet header_len'_correct_long_handshake\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid scid: vlbytes 0 20)\n (payload_and_pn_length: payload_and_pn_length_t)\n : Lemma\n (requires\n (let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\n parse_header_prop short_dcid_len h))\n (ensures\n (let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h))) =", "completed_definiton": "let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\nserialize_header_eq short_dcid_len h;\nlet tg:LPB.bitsum'_type first_byte = (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) in\nassert_norm (first_byte_of_header short_dcid_len h == tg);\nlet x = LPB.synth_bitsum'_recip first_byte tg in\nLP.serialize_length LP.serialize_u8 x;\nlet kt:LPB.bitsum'_key_type first_byte = (| Long, (| (), (| Handshake, () |) |) |) in\nassert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h) == kt);\nLP.length_serialize_nondep_then serialize_common_long\n serialize_payload_and_pn_length\n (version, (dcid, scid))\n payload_and_pn_length;\nlength_serialize_common_long version dcid scid;\nlength_serialize_payload_and_pn_length payload_and_pn_length", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.header_len'_correct_long_zero_rtt", "original_source_type": "val header_len'_correct_long_zero_rtt\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid scid: vlbytes 0 20)\n (payload_and_pn_length: payload_and_pn_length_t)\n : Lemma\n (requires\n (let h = PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length) in\n parse_header_prop short_dcid_len h))\n (ensures\n (let h = PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)))", "source_type": "val header_len'_correct_long_zero_rtt\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid scid: vlbytes 0 20)\n (payload_and_pn_length: payload_and_pn_length_t)\n : Lemma\n (requires\n (let h = PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length) in\n parse_header_prop short_dcid_len h))\n (ensures\n (let h = PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)))", "source_definition": "let header_len'_correct_long_zero_rtt\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n (payload_and_pn_length: payload_and_pn_length_t)\n: Lemma\n (requires (\n let h = PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length) in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)\n ))\n=\n let h = PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length) in\n serialize_header_eq short_dcid_len h;\n let tg : LPB.bitsum'_type first_byte = (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) in\n assert_norm (first_byte_of_header short_dcid_len h == tg);\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_length LP.serialize_u8 x;\n let kt : LPB.bitsum'_key_type first_byte = (| Long, (| (), (| ZeroRTT, () |) |) |) in\n assert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h) == kt );\n LP.length_serialize_nondep_then serialize_common_long serialize_payload_and_pn_length (version, (dcid, scid)) payload_and_pn_length;\n length_serialize_common_long version dcid scid;\n length_serialize_payload_and_pn_length payload_and_pn_length", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 639, "start_col": 1, "end_line": 650, "end_col": 62 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop\n\nlet serialize_long_zero_rtt_body : LP.serializer parse_long_zero_rtt_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_handshake_body : LP.serializer parse_long_handshake_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_retry_body : LP.serializer parse_long_retry_body = serialize_common_long `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20\nlet serialize_long_initial_body : LP.serializer parse_long_initial_body = serialize_common_long `LP.serialize_nondep_then` (\n LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length)\n\nlet serialize_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.serialize_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize_flbytes (U32.v short_dcid_len))\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n serialize_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n serialize_long_handshake_body\n | (| Long, (| (), (| Initial, () |) |) |) ->\n serialize_long_initial_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n serialize_long_retry_body\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))\n= LPB.serialize_bitsum\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len) h ==\n LP.serialize LP.serialize_u8 (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h)) `Seq.append`\n LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n= LPB.serialize_bitsum_eq'\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n h\n\n#push-options \"--z3rlimit 64\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h\n ))\n= serialize_header_eq short_dcid_len1 h;\n serialize_header_eq short_dcid_len2 h;\n ()\n\n#pop-options\n\nlet serialize_header_is_short\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in\n assert (Seq.index s 0 == x);\n assert (PShort? h <==> LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Short <: U8.t))\n\nlet first_byte_is_retry\n (k: LPB.bitsum'_type first_byte)\n: GTot bool\n= match k with\n | (| Long, (| (), (| Retry, (unused, ()) |) |) |) -> true\n | _ -> false\n\nlet first_byte_is_retry_correct\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (is_retry h <==> first_byte_is_retry (first_byte_of_header short_dcid_len h))\n= ()\n\n#push-options \"--z3rlimit 512\"\n#restart-solver\n\nlet serialize_header_is_retry\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in \n assert (Seq.index s 0 == x);\n assert (is_retry h <==> (\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Long <: U8.t) /\\\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 4 6 == (LowParse.Spec.Enum.enum_repr_of_key long_packet_type Retry <: U8.t)\n ))\n\n#pop-options\n\n#restart-solver\n\n\nlet is_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4))\n= ()\n\nlet set_valid_bitfield_intro'\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb\n )\n= is_valid_bitfield_intro short_dcid_len h\n\nlet set_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb /\\\n LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) == LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)\n )\n= set_valid_bitfield_intro' short_dcid_len h new_pb;\n LPB.bitsum'_key_of_t_set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb\n\nlet mk_header_body_set_valid_bitfield\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) (set_protected_bits h new_pb) ==\n mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h)\n= ()\n\n#push-options \"--z3rlimit 512\"\n\n#restart-solver\n\nlet serialize_get_protected_bits\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (let sq = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length sq > 0 /\\\n get_protected_bits h == LPB.uint8.LPB.get_bitfield (Seq.head sq) 0 (if PShort? h then 5 else 4))\n= let sq = LP.serialize (serialize_header short_dcid_len) h in\n serialize_header_eq\n short_dcid_len\n h;\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h))\n\n#restart-solver\n\nlet serialize_set_protected_bits\n short_dcid_len h new_pb\n= let h' = set_protected_bits h new_pb in\n let sq = LP.serialize (serialize_header short_dcid_len) h in\n let sq' = LP.serialize (serialize_header short_dcid_len) h' in\n set_valid_bitfield_intro short_dcid_len h new_pb;\n serialize_header_eq\n short_dcid_len\n h;\n serialize_header_eq\n short_dcid_len\n h';\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h));\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h'));\n LPB.set_valid_bitfield_correct first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb;\n mk_header_body_set_valid_bitfield short_dcid_len h new_pb;\n assert (LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h'))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h') h') == LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h));\n assert (Seq.tail sq' `Seq.equal` LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h'))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h') h'));\n assert (Seq.tail sq `Seq.equal` LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n\n#pop-options\n\n\nlet header_len'_correct_short\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 5)\n (spin: bool)\n (dcid: vlbytes 0 20)\n: Lemma\n (requires (let h = PShort protected_bits spin dcid in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PShort protected_bits spin dcid in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)\n ))\n= \n let h = PShort protected_bits spin dcid in\n serialize_header_eq short_dcid_len h;\n let tg = first_byte_of_header short_dcid_len h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_length LP.serialize_u8 x;\n assert_norm (first_byte_of_header short_dcid_len (PShort protected_bits spin dcid) == (| Short, (| (), ((if spin then 1uy else 0uy), (protected_bits, ()) ) |) |) );\n assert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len (PShort protected_bits spin dcid)) == (| Short, (| (), () |) |) );\n LP.serialize_length (LP.serialize_flbytes (U32.v short_dcid_len)) dcid\n\nlet length_serialize_common_long\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n: Lemma\n (Seq.length (LP.serialize serialize_common_long (version, (dcid, scid))) == 6 + FB.length dcid + FB.length scid)\n= LP.serialize_nondep_then_eq LP.serialize_u32 (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20) (version, (dcid, scid));\n LP.serialize_length LP.serialize_u32 version;\n LP.serialize_nondep_then_eq (LP.serialize_bounded_vlbytes 0 20) (LP.serialize_bounded_vlbytes 0 20) (dcid, scid);\n LP.length_serialize_bounded_vlbytes 0 20 dcid;\n LP.length_serialize_bounded_vlbytes 0 20 scid\n\nlet length_serialize_payload_and_pn_length\n (payload_and_pn_length: payload_and_pn_length_t)\n: Lemma\n (Seq.length (LP.serialize serialize_payload_and_pn_length payload_and_pn_length) == varint_len payload_and_pn_length)\n= VI.varint_len_correct payload_and_pn_length\n\n#pop-options\n\n#push-options \"--z3rlimit 128 --query_stats\"\n\n#restart-solver\n\nlet header_len'_correct_long_initial\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n (token: vlbytes 0 token_max_len)\n (payload_and_pn_length: payload_and_pn_length_t)\n: Lemma\n (requires (\n let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)\n ))\n=\n let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n serialize_header_eq short_dcid_len h;\n let tg : LPB.bitsum'_type first_byte = (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) in\n assert_norm (first_byte_of_header short_dcid_len h == tg);\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_length LP.serialize_u8 x;\n let kt : LPB.bitsum'_key_type first_byte = (| Long, (| (), (| Initial, () |) |) |) in\n assert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h) == kt );\n LP.length_serialize_nondep_then serialize_common_long (LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length) (version, (dcid, scid)) (token, payload_and_pn_length);\n length_serialize_common_long version dcid scid;\n LP.length_serialize_nondep_then (LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len)) (serialize_payload_and_pn_length) token payload_and_pn_length;\n LP.length_serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) token;\n VI.bounded_varint_len_correct 0 token_max_len (FB.len token);\n length_serialize_payload_and_pn_length payload_and_pn_length\n\n#pop-options\n\n#push-options \"--z3rlimit 128 --query_stats\"\n\n#restart-solver\n\nlet header_len'_correct_long_handshake\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n (payload_and_pn_length: payload_and_pn_length_t)\n: Lemma\n (requires (\n let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)\n ))\n=\n let h = PLong protected_bits version dcid scid (PHandshake payload_and_pn_length) in\n serialize_header_eq short_dcid_len h;\n let tg : LPB.bitsum'_type first_byte = (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) in\n assert_norm (first_byte_of_header short_dcid_len h == tg);\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_length LP.serialize_u8 x;\n let kt : LPB.bitsum'_key_type first_byte = (| Long, (| (), (| Handshake, () |) |) |) in\n assert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h) == kt );\n LP.length_serialize_nondep_then serialize_common_long serialize_payload_and_pn_length (version, (dcid, scid)) payload_and_pn_length;\n length_serialize_common_long version dcid scid;\n length_serialize_payload_and_pn_length payload_and_pn_length\n\n#restart-solver\n\nlet header_len'_correct_long_zero_rtt\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n (payload_and_pn_length: payload_and_pn_length_t)\n: Lemma\n (requires (\n let h = PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length) in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n protected_bits: QUIC.Spec.Base.bitfield 4 ->\n version: FStar.UInt32.t ->\n dcid: QUIC.Spec.Base.vlbytes 0 20 ->\n scid: QUIC.Spec.Base.vlbytes 0 20 ->\n payload_and_pn_length: QUIC.Spec.Base.payload_and_pn_length_t\n -> FStar.Pervasives.Lemma\n (requires\n (let h =\n QUIC.Spec.Header.Public.PLong protected_bits\n version\n dcid\n scid\n (QUIC.Spec.Header.Public.PZeroRTT payload_and_pn_length)\n in\n QUIC.Spec.Header.Public.parse_header_prop short_dcid_len h))\n (ensures\n (let h =\n QUIC.Spec.Header.Public.PLong protected_bits\n version\n dcid\n scid\n (QUIC.Spec.Header.Public.PZeroRTT payload_and_pn_length)\n in\n QUIC.Spec.Header.Public.header_len' h ==\n FStar.Seq.Base.length (LowParse.Spec.Base.serialize (QUIC.Spec.Header.Public.serialize_header\n short_dcid_len)\n h)))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.Base.bitfield", "FStar.UInt32.t", "QUIC.Spec.Base.vlbytes", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Header.Public.length_serialize_payload_and_pn_length", "Prims.unit", "QUIC.Spec.Header.Public.length_serialize_common_long", "LowParse.Spec.Combinators.length_serialize_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Spec.Header.Public.serialize_common_long", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "QUIC.Spec.Header.Public.serialize_payload_and_pn_length", "FStar.Pervasives.Native.Mktuple2", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.BitSum.bitsum'_key_type", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "LowParse.Spec.BitSum.bitsum'_key_of_t", "QUIC.Spec.Header.Public.first_byte_of_header", "Prims.Mkdtuple2", "LowParse.Spec.Enum.enum_key", "QUIC.Spec.Header.Public.header_form_t", "LowParse.BitFields.bitfield", "QUIC.Spec.Header.Public.header_form", "Prims.op_Subtraction", "LowParse.Spec.BitSum.BitSum'", "QUIC.Spec.Header.Public.fixed_bit", "LowParse.Spec.BitSum.BitField", "LowParse.Spec.BitSum.BitStop", "LowParse.Spec.BitSum.bitsum'", "QUIC.Spec.Header.Public.long_packet_type_t", "QUIC.Spec.Header.Public.long_packet_type", "QUIC.Spec.Header.Public.Long", "QUIC.Spec.Header.Public.ZeroRTT", "LowParse.Spec.Base.serialize_length", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "LowParse.Spec.Combinators.parse_filter_refine", "LowParse.Spec.BitSum.filter_bitsum'", "LowParse.Spec.BitSum.synth_bitsum'_recip", "LowParse.Spec.BitSum.bitsum'_type", "LowParse.Spec.BitSum.bitsum'_type'", "QUIC.Spec.Header.Public.serialize_header_eq", "QUIC.Spec.Header.Public.header", "QUIC.Spec.Header.Public.PLong", "QUIC.Spec.Header.Public.PZeroRTT", "QUIC.Spec.Header.Public.parse_header_prop", "Prims.squash", "Prims.int", "Prims.l_or", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThan", "Prims.op_LessThanOrEqual", "QUIC.Spec.Base.header_len_bound", "Prims.op_GreaterThanOrEqual", "QUIC.Spec.Header.Public.header_len'", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_len'_correct_long_zero_rtt\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid scid: vlbytes 0 20)\n (payload_and_pn_length: payload_and_pn_length_t)\n : Lemma\n (requires\n (let h = PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length) in\n parse_header_prop short_dcid_len h))\n (ensures\n (let h = PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)))\nlet header_len'_correct_long_zero_rtt\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid scid: vlbytes 0 20)\n (payload_and_pn_length: payload_and_pn_length_t)\n : Lemma\n (requires\n (let h = PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length) in\n parse_header_prop short_dcid_len h))\n (ensures\n (let h = PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h))) =", "completed_definiton": "let h = PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length) in\nserialize_header_eq short_dcid_len h;\nlet tg:LPB.bitsum'_type first_byte = (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) in\nassert_norm (first_byte_of_header short_dcid_len h == tg);\nlet x = LPB.synth_bitsum'_recip first_byte tg in\nLP.serialize_length LP.serialize_u8 x;\nlet kt:LPB.bitsum'_key_type first_byte = (| Long, (| (), (| ZeroRTT, () |) |) |) in\nassert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h) == kt);\nLP.length_serialize_nondep_then serialize_common_long\n serialize_payload_and_pn_length\n (version, (dcid, scid))\n payload_and_pn_length;\nlength_serialize_common_long version dcid scid;\nlength_serialize_payload_and_pn_length payload_and_pn_length", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.serialize_get_protected_bits", "original_source_type": "val serialize_get_protected_bits\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (let sq = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length sq > 0 /\\\n get_protected_bits h == LPB.uint8.LPB.get_bitfield (Seq.head sq) 0 (if PShort? h then 5 else 4))", "source_type": "val serialize_get_protected_bits\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (let sq = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length sq > 0 /\\\n get_protected_bits h == LPB.uint8.LPB.get_bitfield (Seq.head sq) 0 (if PShort? h then 5 else 4))", "source_definition": "let serialize_get_protected_bits\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (let sq = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length sq > 0 /\\\n get_protected_bits h == LPB.uint8.LPB.get_bitfield (Seq.head sq) 0 (if PShort? h then 5 else 4))\n= let sq = LP.serialize (serialize_header short_dcid_len) h in\n serialize_header_eq\n short_dcid_len\n h;\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 475, "start_col": 1, "end_line": 479, "end_col": 99 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop\n\nlet serialize_long_zero_rtt_body : LP.serializer parse_long_zero_rtt_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_handshake_body : LP.serializer parse_long_handshake_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_retry_body : LP.serializer parse_long_retry_body = serialize_common_long `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20\nlet serialize_long_initial_body : LP.serializer parse_long_initial_body = serialize_common_long `LP.serialize_nondep_then` (\n LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length)\n\nlet serialize_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.serialize_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize_flbytes (U32.v short_dcid_len))\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n serialize_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n serialize_long_handshake_body\n | (| Long, (| (), (| Initial, () |) |) |) ->\n serialize_long_initial_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n serialize_long_retry_body\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))\n= LPB.serialize_bitsum\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len) h ==\n LP.serialize LP.serialize_u8 (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h)) `Seq.append`\n LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n= LPB.serialize_bitsum_eq'\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n h\n\n#push-options \"--z3rlimit 64\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h\n ))\n= serialize_header_eq short_dcid_len1 h;\n serialize_header_eq short_dcid_len2 h;\n ()\n\n#pop-options\n\nlet serialize_header_is_short\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in\n assert (Seq.index s 0 == x);\n assert (PShort? h <==> LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Short <: U8.t))\n\nlet first_byte_is_retry\n (k: LPB.bitsum'_type first_byte)\n: GTot bool\n= match k with\n | (| Long, (| (), (| Retry, (unused, ()) |) |) |) -> true\n | _ -> false\n\nlet first_byte_is_retry_correct\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (is_retry h <==> first_byte_is_retry (first_byte_of_header short_dcid_len h))\n= ()\n\n#push-options \"--z3rlimit 512\"\n#restart-solver\n\nlet serialize_header_is_retry\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in \n assert (Seq.index s 0 == x);\n assert (is_retry h <==> (\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Long <: U8.t) /\\\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 4 6 == (LowParse.Spec.Enum.enum_repr_of_key long_packet_type Retry <: U8.t)\n ))\n\n#pop-options\n\n#restart-solver\n\n\nlet is_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4))\n= ()\n\nlet set_valid_bitfield_intro'\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb\n )\n= is_valid_bitfield_intro short_dcid_len h\n\nlet set_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb /\\\n LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) == LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)\n )\n= set_valid_bitfield_intro' short_dcid_len h new_pb;\n LPB.bitsum'_key_of_t_set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb\n\nlet mk_header_body_set_valid_bitfield\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) (set_protected_bits h new_pb) ==\n mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h)\n= ()\n\n#push-options \"--z3rlimit 512\"\n\n#restart-solver\n\nlet serialize_get_protected_bits\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (let sq = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length sq > 0 /\\", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 512, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "short_dcid_len: QUIC.Spec.Base.short_dcid_len_t -> h: QUIC.Spec.Header.Public.header' short_dcid_len\n -> FStar.Pervasives.Lemma\n (ensures\n (let sq =\n LowParse.Spec.Base.serialize (QUIC.Spec.Header.Public.serialize_header short_dcid_len) h\n in\n FStar.Seq.Base.length sq > 0 /\\\n QUIC.Spec.Header.Public.get_protected_bits h ==\n Mkuint_t?.get_bitfield LowParse.BitFields.uint8\n (FStar.Seq.Properties.head sq)\n 0\n (match PShort? h with\n | true -> 5\n | _ -> 4)))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.Header.Public.header'", "LowParse.Spec.Int.serialize_u8_spec", "LowParse.Spec.BitSum.synth_bitsum'_recip", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "QUIC.Spec.Header.Public.first_byte_of_header", "Prims.unit", "QUIC.Spec.Header.Public.serialize_header_eq", "LowParse.Bytes.bytes", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "Prims.l_True", "Prims.squash", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThan", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "Prims.eq2", "Prims.l_or", "Prims.op_LessThan", "FStar.UInt8.v", "Prims.pow2", "QUIC.Spec.Header.Public.uu___is_PShort", "Prims.bool", "Prims.nat", "FStar.UInt.uint_t", "LowParse.BitFields.__proj__Mkuint_t__item__v", "LowParse.BitFields.get_bitfield", "FStar.Seq.Properties.head", "Prims.op_LessThanOrEqual", "QUIC.Spec.Header.Public.get_protected_bits", "LowParse.BitFields.__proj__Mkuint_t__item__get_bitfield", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_get_protected_bits\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (let sq = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length sq > 0 /\\\n get_protected_bits h == LPB.uint8.LPB.get_bitfield (Seq.head sq) 0 (if PShort? h then 5 else 4))\nlet serialize_get_protected_bits (short_dcid_len: short_dcid_len_t) (h: header' short_dcid_len)\n : Lemma\n (let sq = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length sq > 0 /\\\n get_protected_bits h ==\n LPB.uint8.LPB.get_bitfield (Seq.head sq) 0 (if PShort? h then 5 else 4)) =", "completed_definiton": "let sq = LP.serialize (serialize_header short_dcid_len) h in\nserialize_header_eq short_dcid_len h;\nLP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.header_len'_correct_long_initial", "original_source_type": "val header_len'_correct_long_initial\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid scid: vlbytes 0 20)\n (token: vlbytes 0 token_max_len)\n (payload_and_pn_length: payload_and_pn_length_t)\n : Lemma\n (requires\n (let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n parse_header_prop short_dcid_len h))\n (ensures\n (let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)))", "source_type": "val header_len'_correct_long_initial\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid scid: vlbytes 0 20)\n (token: vlbytes 0 token_max_len)\n (payload_and_pn_length: payload_and_pn_length_t)\n : Lemma\n (requires\n (let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n parse_header_prop short_dcid_len h))\n (ensures\n (let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)))", "source_definition": "let header_len'_correct_long_initial\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n (token: vlbytes 0 token_max_len)\n (payload_and_pn_length: payload_and_pn_length_t)\n: Lemma\n (requires (\n let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)\n ))\n=\n let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n serialize_header_eq short_dcid_len h;\n let tg : LPB.bitsum'_type first_byte = (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) in\n assert_norm (first_byte_of_header short_dcid_len h == tg);\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_length LP.serialize_u8 x;\n let kt : LPB.bitsum'_key_type first_byte = (| Long, (| (), (| Initial, () |) |) |) in\n assert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h) == kt );\n LP.length_serialize_nondep_then serialize_common_long (LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length) (version, (dcid, scid)) (token, payload_and_pn_length);\n length_serialize_common_long version dcid scid;\n LP.length_serialize_nondep_then (LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len)) (serialize_payload_and_pn_length) token payload_and_pn_length;\n LP.length_serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) token;\n VI.bounded_varint_len_correct 0 token_max_len (FB.len token);\n length_serialize_payload_and_pn_length payload_and_pn_length", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 570, "start_col": 1, "end_line": 584, "end_col": 62 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop\n\nlet serialize_long_zero_rtt_body : LP.serializer parse_long_zero_rtt_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_handshake_body : LP.serializer parse_long_handshake_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_retry_body : LP.serializer parse_long_retry_body = serialize_common_long `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20\nlet serialize_long_initial_body : LP.serializer parse_long_initial_body = serialize_common_long `LP.serialize_nondep_then` (\n LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length)\n\nlet serialize_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.serialize_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize_flbytes (U32.v short_dcid_len))\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n serialize_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n serialize_long_handshake_body\n | (| Long, (| (), (| Initial, () |) |) |) ->\n serialize_long_initial_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n serialize_long_retry_body\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))\n= LPB.serialize_bitsum\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len) h ==\n LP.serialize LP.serialize_u8 (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h)) `Seq.append`\n LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n= LPB.serialize_bitsum_eq'\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n h\n\n#push-options \"--z3rlimit 64\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h\n ))\n= serialize_header_eq short_dcid_len1 h;\n serialize_header_eq short_dcid_len2 h;\n ()\n\n#pop-options\n\nlet serialize_header_is_short\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in\n assert (Seq.index s 0 == x);\n assert (PShort? h <==> LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Short <: U8.t))\n\nlet first_byte_is_retry\n (k: LPB.bitsum'_type first_byte)\n: GTot bool\n= match k with\n | (| Long, (| (), (| Retry, (unused, ()) |) |) |) -> true\n | _ -> false\n\nlet first_byte_is_retry_correct\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (is_retry h <==> first_byte_is_retry (first_byte_of_header short_dcid_len h))\n= ()\n\n#push-options \"--z3rlimit 512\"\n#restart-solver\n\nlet serialize_header_is_retry\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in \n assert (Seq.index s 0 == x);\n assert (is_retry h <==> (\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Long <: U8.t) /\\\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 4 6 == (LowParse.Spec.Enum.enum_repr_of_key long_packet_type Retry <: U8.t)\n ))\n\n#pop-options\n\n#restart-solver\n\n\nlet is_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4))\n= ()\n\nlet set_valid_bitfield_intro'\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb\n )\n= is_valid_bitfield_intro short_dcid_len h\n\nlet set_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb /\\\n LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) == LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)\n )\n= set_valid_bitfield_intro' short_dcid_len h new_pb;\n LPB.bitsum'_key_of_t_set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb\n\nlet mk_header_body_set_valid_bitfield\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) (set_protected_bits h new_pb) ==\n mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h)\n= ()\n\n#push-options \"--z3rlimit 512\"\n\n#restart-solver\n\nlet serialize_get_protected_bits\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (let sq = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length sq > 0 /\\\n get_protected_bits h == LPB.uint8.LPB.get_bitfield (Seq.head sq) 0 (if PShort? h then 5 else 4))\n= let sq = LP.serialize (serialize_header short_dcid_len) h in\n serialize_header_eq\n short_dcid_len\n h;\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h))\n\n#restart-solver\n\nlet serialize_set_protected_bits\n short_dcid_len h new_pb\n= let h' = set_protected_bits h new_pb in\n let sq = LP.serialize (serialize_header short_dcid_len) h in\n let sq' = LP.serialize (serialize_header short_dcid_len) h' in\n set_valid_bitfield_intro short_dcid_len h new_pb;\n serialize_header_eq\n short_dcid_len\n h;\n serialize_header_eq\n short_dcid_len\n h';\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h));\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h'));\n LPB.set_valid_bitfield_correct first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb;\n mk_header_body_set_valid_bitfield short_dcid_len h new_pb;\n assert (LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h'))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h') h') == LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h));\n assert (Seq.tail sq' `Seq.equal` LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h'))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h') h'));\n assert (Seq.tail sq `Seq.equal` LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n\n#pop-options\n\n\nlet header_len'_correct_short\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 5)\n (spin: bool)\n (dcid: vlbytes 0 20)\n: Lemma\n (requires (let h = PShort protected_bits spin dcid in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PShort protected_bits spin dcid in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)\n ))\n= \n let h = PShort protected_bits spin dcid in\n serialize_header_eq short_dcid_len h;\n let tg = first_byte_of_header short_dcid_len h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_length LP.serialize_u8 x;\n assert_norm (first_byte_of_header short_dcid_len (PShort protected_bits spin dcid) == (| Short, (| (), ((if spin then 1uy else 0uy), (protected_bits, ()) ) |) |) );\n assert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len (PShort protected_bits spin dcid)) == (| Short, (| (), () |) |) );\n LP.serialize_length (LP.serialize_flbytes (U32.v short_dcid_len)) dcid\n\nlet length_serialize_common_long\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n: Lemma\n (Seq.length (LP.serialize serialize_common_long (version, (dcid, scid))) == 6 + FB.length dcid + FB.length scid)\n= LP.serialize_nondep_then_eq LP.serialize_u32 (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20) (version, (dcid, scid));\n LP.serialize_length LP.serialize_u32 version;\n LP.serialize_nondep_then_eq (LP.serialize_bounded_vlbytes 0 20) (LP.serialize_bounded_vlbytes 0 20) (dcid, scid);\n LP.length_serialize_bounded_vlbytes 0 20 dcid;\n LP.length_serialize_bounded_vlbytes 0 20 scid\n\nlet length_serialize_payload_and_pn_length\n (payload_and_pn_length: payload_and_pn_length_t)\n: Lemma\n (Seq.length (LP.serialize serialize_payload_and_pn_length payload_and_pn_length) == varint_len payload_and_pn_length)\n= VI.varint_len_correct payload_and_pn_length\n\n#pop-options\n\n#push-options \"--z3rlimit 128 --query_stats\"\n\n#restart-solver\n\nlet header_len'_correct_long_initial\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid: vlbytes 0 20)\n (scid: vlbytes 0 20)\n (token: vlbytes 0 token_max_len)\n (payload_and_pn_length: payload_and_pn_length_t)\n: Lemma\n (requires (\n let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n parse_header_prop short_dcid_len h\n ))\n (ensures (\n let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n protected_bits: QUIC.Spec.Base.bitfield 4 ->\n version: FStar.UInt32.t ->\n dcid: QUIC.Spec.Base.vlbytes 0 20 ->\n scid: QUIC.Spec.Base.vlbytes 0 20 ->\n token: QUIC.Spec.Base.vlbytes 0 QUIC.Spec.Base.token_max_len ->\n payload_and_pn_length: QUIC.Spec.Base.payload_and_pn_length_t\n -> FStar.Pervasives.Lemma\n (requires\n (let h =\n QUIC.Spec.Header.Public.PLong protected_bits\n version\n dcid\n scid\n (QUIC.Spec.Header.Public.PInitial token payload_and_pn_length)\n in\n QUIC.Spec.Header.Public.parse_header_prop short_dcid_len h))\n (ensures\n (let h =\n QUIC.Spec.Header.Public.PLong protected_bits\n version\n dcid\n scid\n (QUIC.Spec.Header.Public.PInitial token payload_and_pn_length)\n in\n QUIC.Spec.Header.Public.header_len' h ==\n FStar.Seq.Base.length (LowParse.Spec.Base.serialize (QUIC.Spec.Header.Public.serialize_header\n short_dcid_len)\n h)))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.Base.bitfield", "FStar.UInt32.t", "QUIC.Spec.Base.vlbytes", "QUIC.Spec.Base.token_max_len", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Header.Public.length_serialize_payload_and_pn_length", "Prims.unit", "QUIC.Spec.VarInt.bounded_varint_len_correct", "FStar.Bytes.len", "LowParse.Spec.Bytes.length_serialize_bounded_vlgenbytes", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.VarInt.parse_bounded_varint", "QUIC.Spec.VarInt.serialize_bounded_varint", "LowParse.Spec.Combinators.length_serialize_nondep_then", "LowParse.Spec.VLGen.parse_bounded_vlgen_kind", "LowParse.Spec.Bytes.parse_all_bytes_kind", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "LowParse.Spec.Bytes.parse_bounded_vlgenbytes", "LowParse.Spec.Bytes.serialize_bounded_vlgenbytes", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "QUIC.Spec.Header.Public.serialize_payload_and_pn_length", "QUIC.Spec.Header.Public.length_serialize_common_long", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Spec.Header.Public.serialize_common_long", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Combinators.serialize_nondep_then", "FStar.Pervasives.Native.Mktuple2", "FStar.Pervasives.assert_norm", "Prims.eq2", "LowParse.Spec.BitSum.bitsum'_key_type", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "LowParse.Spec.BitSum.bitsum'_key_of_t", "QUIC.Spec.Header.Public.first_byte_of_header", "Prims.Mkdtuple2", "LowParse.Spec.Enum.enum_key", "QUIC.Spec.Header.Public.header_form_t", "LowParse.BitFields.bitfield", "QUIC.Spec.Header.Public.header_form", "Prims.op_Subtraction", "LowParse.Spec.BitSum.BitSum'", "QUIC.Spec.Header.Public.fixed_bit", "LowParse.Spec.BitSum.BitField", "LowParse.Spec.BitSum.BitStop", "LowParse.Spec.BitSum.bitsum'", "QUIC.Spec.Header.Public.long_packet_type_t", "QUIC.Spec.Header.Public.long_packet_type", "QUIC.Spec.Header.Public.Long", "QUIC.Spec.Header.Public.Initial", "LowParse.Spec.Base.serialize_length", "LowParse.Spec.Int.parse_u8_kind", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "LowParse.Spec.Combinators.parse_filter_refine", "LowParse.Spec.BitSum.filter_bitsum'", "LowParse.Spec.BitSum.synth_bitsum'_recip", "LowParse.Spec.BitSum.bitsum'_type", "LowParse.Spec.BitSum.bitsum'_type'", "QUIC.Spec.Header.Public.serialize_header_eq", "QUIC.Spec.Header.Public.header", "QUIC.Spec.Header.Public.PLong", "QUIC.Spec.Header.Public.PInitial", "QUIC.Spec.Header.Public.parse_header_prop", "Prims.squash", "Prims.int", "Prims.l_or", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThan", "Prims.op_LessThanOrEqual", "QUIC.Spec.Base.header_len_bound", "Prims.op_GreaterThanOrEqual", "QUIC.Spec.Header.Public.header_len'", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_len'_correct_long_initial\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid scid: vlbytes 0 20)\n (token: vlbytes 0 token_max_len)\n (payload_and_pn_length: payload_and_pn_length_t)\n : Lemma\n (requires\n (let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n parse_header_prop short_dcid_len h))\n (ensures\n (let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h)))\nlet header_len'_correct_long_initial\n (short_dcid_len: short_dcid_len_t)\n (protected_bits: bitfield 4)\n (version: U32.t)\n (dcid scid: vlbytes 0 20)\n (token: vlbytes 0 token_max_len)\n (payload_and_pn_length: payload_and_pn_length_t)\n : Lemma\n (requires\n (let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n parse_header_prop short_dcid_len h))\n (ensures\n (let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\n header_len' h == Seq.length (LP.serialize (serialize_header short_dcid_len) h))) =", "completed_definiton": "let h = PLong protected_bits version dcid scid (PInitial token payload_and_pn_length) in\nserialize_header_eq short_dcid_len h;\nlet tg:LPB.bitsum'_type first_byte = (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) in\nassert_norm (first_byte_of_header short_dcid_len h == tg);\nlet x = LPB.synth_bitsum'_recip first_byte tg in\nLP.serialize_length LP.serialize_u8 x;\nlet kt:LPB.bitsum'_key_type first_byte = (| Long, (| (), (| Initial, () |) |) |) in\nassert_norm (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h) == kt);\nLP.length_serialize_nondep_then serialize_common_long\n ((LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len))\n `LP.serialize_nondep_then`\n serialize_payload_and_pn_length)\n (version, (dcid, scid))\n (token, payload_and_pn_length);\nlength_serialize_common_long version dcid scid;\nLP.length_serialize_nondep_then (LP.serialize_bounded_vlgenbytes 0\n token_max_len\n (VI.serialize_bounded_varint 0 token_max_len))\n (serialize_payload_and_pn_length)\n token\n payload_and_pn_length;\nLP.length_serialize_bounded_vlgenbytes 0\n token_max_len\n (VI.serialize_bounded_varint 0 token_max_len)\n token;\nVI.bounded_varint_len_correct 0 token_max_len (FB.len token);\nlength_serialize_payload_and_pn_length payload_and_pn_length", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.serialize_header_is_retry", "original_source_type": "val serialize_header_is_retry\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma (\n let s = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length s > 0 /\\ (\n is_retry h <==> (\n LPB.get_bitfield (U8.v (Seq.index s 0)) 7 8 == 1 /\\\n LPB.get_bitfield (U8.v (Seq.index s 0)) 4 6 == 3\n )))", "source_type": "val serialize_header_is_retry\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma (\n let s = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length s > 0 /\\ (\n is_retry h <==> (\n LPB.get_bitfield (U8.v (Seq.index s 0)) 7 8 == 1 /\\\n LPB.get_bitfield (U8.v (Seq.index s 0)) 4 6 == 3\n )))", "source_definition": "let serialize_header_is_retry\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in \n assert (Seq.index s 0 == x);\n assert (is_retry h <==> (\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Long <: U8.t) /\\\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 4 6 == (LowParse.Spec.Enum.enum_repr_of_key long_packet_type Retry <: U8.t)\n ))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 408, "start_col": 2, "end_line": 417, "end_col": 4 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop\n\nlet serialize_long_zero_rtt_body : LP.serializer parse_long_zero_rtt_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_handshake_body : LP.serializer parse_long_handshake_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_retry_body : LP.serializer parse_long_retry_body = serialize_common_long `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20\nlet serialize_long_initial_body : LP.serializer parse_long_initial_body = serialize_common_long `LP.serialize_nondep_then` (\n LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length)\n\nlet serialize_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.serialize_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize_flbytes (U32.v short_dcid_len))\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n serialize_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n serialize_long_handshake_body\n | (| Long, (| (), (| Initial, () |) |) |) ->\n serialize_long_initial_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n serialize_long_retry_body\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))\n= LPB.serialize_bitsum\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len) h ==\n LP.serialize LP.serialize_u8 (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h)) `Seq.append`\n LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n= LPB.serialize_bitsum_eq'\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n h\n\n#push-options \"--z3rlimit 64\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h\n ))\n= serialize_header_eq short_dcid_len1 h;\n serialize_header_eq short_dcid_len2 h;\n ()\n\n#pop-options\n\nlet serialize_header_is_short\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in\n assert (Seq.index s 0 == x);\n assert (PShort? h <==> LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Short <: U8.t))\n\nlet first_byte_is_retry\n (k: LPB.bitsum'_type first_byte)\n: GTot bool\n= match k with\n | (| Long, (| (), (| Retry, (unused, ()) |) |) |) -> true\n | _ -> false\n\nlet first_byte_is_retry_correct\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (is_retry h <==> first_byte_is_retry (first_byte_of_header short_dcid_len h))\n= ()\n\n#push-options \"--z3rlimit 512\"\n#restart-solver\n\nlet serialize_header_is_retry\n dl h", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 512, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "short_dcid_len: QUIC.Spec.Base.short_dcid_len_t -> h: QUIC.Spec.Header.Public.header' short_dcid_len\n -> FStar.Pervasives.Lemma\n (ensures\n (let s =\n LowParse.Spec.Base.serialize (QUIC.Spec.Header.Public.serialize_header short_dcid_len) h\n in\n FStar.Seq.Base.length s > 0 /\\\n (QUIC.Spec.Header.Public.is_retry h <==>\n LowParse.BitFields.get_bitfield (FStar.UInt8.v (FStar.Seq.Base.index s 0)) 7 8 == 1 /\\\n LowParse.BitFields.get_bitfield (FStar.UInt8.v (FStar.Seq.Base.index s 0)) 4 6 == 3)))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.Header.Public.header'", "Prims._assert", "Prims.l_iff", "Prims.b2t", "QUIC.Spec.Header.Public.is_retry", "Prims.l_and", "Prims.eq2", "FStar.UInt8.t", "LowParse.BitFields.__proj__Mkuint_t__item__get_bitfield", "LowParse.BitFields.uint8", "FStar.Seq.Base.index", "LowParse.Bytes.byte", "LowParse.Spec.Enum.enum_repr_of_key", "QUIC.Spec.Header.Public.header_form_t", "LowParse.BitFields.bitfield", "QUIC.Spec.Header.Public.header_form", "QUIC.Spec.Header.Public.Long", "QUIC.Spec.Header.Public.long_packet_type_t", "QUIC.Spec.Header.Public.long_packet_type", "QUIC.Spec.Header.Public.Retry", "Prims.unit", "LowParse.Bytes.bytes", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "LowParse.Spec.Int.serialize_u8_spec", "LowParse.Spec.Combinators.parse_filter_refine", "LowParse.Spec.BitSum.filter_bitsum'", "QUIC.Spec.Header.Public.first_byte", "LowParse.Spec.BitSum.synth_bitsum'_recip", "LowParse.Spec.BitSum.bitsum'_type", "QUIC.Spec.Header.Public.first_byte_of_header", "QUIC.Spec.Header.Public.serialize_header_eq" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_header_is_retry\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma (\n let s = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length s > 0 /\\ (\n is_retry h <==> (\n LPB.get_bitfield (U8.v (Seq.index s 0)) 7 8 == 1 /\\\n LPB.get_bitfield (U8.v (Seq.index s 0)) 4 6 == 3\n )))\nlet serialize_header_is_retry dl h =", "completed_definiton": "serialize_header_eq dl h;\nlet tg = first_byte_of_header dl h in\nlet x = LPB.synth_bitsum'_recip first_byte tg in\nLP.serialize_u8_spec x;\nlet s = LP.serialize (serialize_header dl) h in\nassert (Seq.index s 0 == x);\nassert (is_retry h <==>\n (LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 ==\n (LowParse.Spec.Enum.enum_repr_of_key header_form Long <: U8.t) /\\\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 4 6 ==\n (LowParse.Spec.Enum.enum_repr_of_key long_packet_type Retry <: U8.t)))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Public.fst", "name": "QUIC.Spec.Header.Public.serialize_set_protected_bits", "original_source_type": "val serialize_set_protected_bits\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (let sq = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length sq > 0 /\\\n LP.serialize (serialize_header short_dcid_len) (set_protected_bits h new_pb) `Seq.equal`\n (LPB.uint8.LPB.set_bitfield (Seq.head sq) 0 (if PShort? h then 5 else 4) new_pb `Seq.cons` Seq.tail sq))", "source_type": "val serialize_set_protected_bits\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (let sq = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length sq > 0 /\\\n LP.serialize (serialize_header short_dcid_len) (set_protected_bits h new_pb) `Seq.equal`\n (LPB.uint8.LPB.set_bitfield (Seq.head sq) 0 (if PShort? h then 5 else 4) new_pb `Seq.cons` Seq.tail sq))", "source_definition": "let serialize_set_protected_bits\n short_dcid_len h new_pb\n= let h' = set_protected_bits h new_pb in\n let sq = LP.serialize (serialize_header short_dcid_len) h in\n let sq' = LP.serialize (serialize_header short_dcid_len) h' in\n set_valid_bitfield_intro short_dcid_len h new_pb;\n serialize_header_eq\n short_dcid_len\n h;\n serialize_header_eq\n short_dcid_len\n h';\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h));\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h'));\n LPB.set_valid_bitfield_correct first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb;\n mk_header_body_set_valid_bitfield short_dcid_len h new_pb;\n assert (LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h'))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h') h') == LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h));\n assert (Seq.tail sq' `Seq.equal` LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h'))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h') h'));\n assert (Seq.tail sq `Seq.equal` LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 485, "start_col": 1, "end_line": 501, "end_col": 234 }, "file_context": "module QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Spec\nmodule LPB = LowParse.Spec.BitSum\n\ninline_for_extraction\ntype header_form_t =\n | Long\n | Short\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_form : LP.enum header_form_t (LPB.bitfield LPB.uint8 1) = [\n Long, 1uy;\n Short, 0uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet fixed_bit : LP.enum unit (LPB.bitfield LPB.uint8 1) = [\n (), 1uy;\n]\n\ninline_for_extraction\ntype long_packet_type_t =\n | Initial\n | ZeroRTT\n | Handshake\n | Retry\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet long_packet_type : LP.enum long_packet_type_t (LPB.bitfield LPB.uint8 2) = [\n Initial, 0uy;\n ZeroRTT, 1uy;\n Handshake, 2uy;\n Retry, 3uy;\n]\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet first_byte : LPB.bitsum' LPB.uint8 8 =\n LPB.BitSum' _ _ header_form (function\n | Short ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitField (* spin bit *) 1 (\n LPB.BitField (* protected bits *) 5 (\n LPB.BitStop ()\n )\n )\n )\n | Long ->\n LPB.BitSum' _ _ fixed_bit (fun _ ->\n LPB.BitSum' _ _ long_packet_type (function\n | _ -> LPB.BitField (* protected bits *) 4 (LPB.BitStop ())\n )\n )\n )\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet first_byte_of_header'\n (short_dcid_len: short_dcid_len_t)\n (t: Type0)\n (f: (LPB.bitsum'_type first_byte -> Tot t))\n (m: header' short_dcid_len)\n: Tot t\n= match m with\n | PShort protected_bits spin dcid ->\n let spin : LPB.bitfield LPB.uint8 1 = if spin then 1uy else 0uy in\n f (| Short, (| (), (spin, (protected_bits, () ) ) |) |)\n | PLong protected_bits version dcid scid spec ->\n begin match spec with\n | PInitial _ payload_and_pn_length ->\n f (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |)\n | PZeroRTT payload_and_pn_length ->\n f (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |)\n | PHandshake payload_and_pn_length ->\n f (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |)\n | PRetry _ ->\n f (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n end\n\n#pop-options\n\nlet first_byte_of_header\n (short_dcid_len: short_dcid_len_t)\n (m: header' short_dcid_len)\n: Tot (LPB.bitsum'_type first_byte)\n= first_byte_of_header' short_dcid_len (LPB.bitsum'_type first_byte) id m\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet common_long_t\n: Type0\n= (U32.t & (LP.parse_bounded_vlbytes_t 0 20 & LP.parse_bounded_vlbytes_t 0 20))\n\ninline_for_extraction\nlet payload_and_pn_length_prop\n (x: U62.t)\n: Tot bool\n= x `U64.gte` 20uL\n\nlet payload_and_pn_length_t' = LP.parse_filter_refine payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet long_zero_rtt_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_handshake_body_t = (common_long_t & payload_and_pn_length_t')\nlet long_retry_body_t = (common_long_t & LP.parse_bounded_vlbytes_t 0 20)\nlet long_initial_body_t = (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t'))\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_body_type\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot Type0\n= match k' with\n | (| Long, (| (), (| Initial, () |) |) |) ->\n long_initial_body_t\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n long_zero_rtt_body_t\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n long_handshake_body_t\n | (| Long, (| (), (| Retry, () |) |) |) ->\n long_retry_body_t\n | (| Short, (| (), () |) |) ->\n FB.lbytes (U32.v short_dcid_len)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n: Tot (LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ()) ) |) |) ->\n let spin = (spin = 1uy) in\n let dcid = LP.coerce (FB.lbytes (U32.v short_dcid_len)) pl in\n PShort protected_bits spin dcid\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')) pl with\n | ((version, (dcid, scid)), (token, (payload_and_pn_length))) ->\n PLong protected_bits version dcid scid (PInitial token payload_and_pn_length)\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), payload_and_pn_length) ->\n PLong protected_bits version dcid scid (PZeroRTT payload_and_pn_length)\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & payload_and_pn_length_t') pl with\n | ((version, (dcid, scid)), (payload_and_pn_length)) ->\n PLong protected_bits version dcid scid (PHandshake (payload_and_pn_length))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match LP.coerce (common_long_t & LP.parse_bounded_vlbytes_t 0 20) pl with\n | ((version, (dcid, scid)), odcid) ->\n PLong protected_bits version dcid scid (PRetry odcid)\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet mk_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_type first_byte)\n (pl: LP.refine_with_tag (first_byte_of_header short_dcid_len) k')\n: Tot (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k'))\n= match k' with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n begin match pl with\n | PShort _ _ dcid -> LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) ((dcid) <: (FB.lbytes (U32.v short_dcid_len)))\n end\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PInitial token payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (token, (payload_and_pn_length))) <: (common_long_t & (LP.parse_bounded_vlbytes_t 0 token_max_len & payload_and_pn_length_t')))\n end\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PZeroRTT payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PHandshake payload_and_pn_length) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), (payload_and_pn_length)) <: (common_long_t & payload_and_pn_length_t'))\n end\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n begin match pl with\n | PLong _ version dcid scid (PRetry odcid) ->\n LP.coerce (header_body_type short_dcid_len (LPB.bitsum'_key_of_t first_byte k')) (((version, (dcid, scid)), odcid) <: (common_long_t & LP.parse_bounded_vlbytes_t 0 20))\n end\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet header_synth\n (short_dcid_len: short_dcid_len_t)\n: Tot (LPB.synth_case_t first_byte (header' short_dcid_len) (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len))\n= \n (LPB.SynthCase\n #_ #_ #_ #first_byte #_ #(first_byte_of_header short_dcid_len) #(header_body_type short_dcid_len)\n (mk_header short_dcid_len)\n (fun k x y -> ())\n (mk_header_body short_dcid_len)\n (fun k x -> ())\n )\n\nlet parse_common_long : LP.parser _ common_long_t =\n LP.parse_u32 `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Spec.VarInt\n\nlet parse_payload_and_pn_length : LP.parser _ payload_and_pn_length_t' =\n LP.parse_filter VI.parse_varint payload_and_pn_length_prop\n\nlet parse_long_zero_rtt_body : LP.parser _ long_zero_rtt_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_handshake_body : LP.parser _ long_handshake_body_t = parse_common_long `LP.nondep_then` parse_payload_and_pn_length\nlet parse_long_retry_body : LP.parser _ long_retry_body_t = parse_common_long `LP.nondep_then` LP.parse_bounded_vlbytes 0 20\nlet parse_long_initial_body : LP.parser _ long_initial_body_t = parse_common_long `LP.nondep_then` (\n LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length)\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (k: LP.parser_kind & LP.parser k (header_body_type short_dcid_len k'))\n= match k' with\n | (| Short, (| (), () |) |) ->\n (| _ , LP.weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v short_dcid_len)) |)\n | (| Long, (| (), (| Initial, () |) |) |) ->\n (| _, parse_long_initial_body |)\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n (| _, parse_long_zero_rtt_body |)\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n (| _, parse_long_handshake_body |)\n | (| Long, (| (), (| Retry, () |) |) |) ->\n (| _, parse_long_retry_body |)\n\nlet weaken_parse_bitsum_cases_kind_parse_header_body\n (short_dcid_len: short_dcid_len_t)\n: Lemma\n (let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n [SMTPat (LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len))]\n= let k = LPB.weaken_parse_bitsum_cases_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len) in\n assert_norm (\n k.LP.parser_kind_subkind == Some LP.ParserStrong /\\\n begin match k.LP.parser_kind_high with\n | None -> False\n | Some max -> max + 5 < header_len_bound\n end\n )\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet parse_header_kind\n short_dcid_len\n= LPB.parse_bitsum_kind LP.parse_u8_kind first_byte (header_body_type short_dcid_len) (parse_header_body short_dcid_len)\n\nlet parse_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser (parse_header_kind short_dcid_len) (header' short_dcid_len))\n= LPB.parse_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n LP.parse_u8\n (parse_header_body short_dcid_len)\n\nlet serialize_common_long : LP.serializer parse_common_long =\n LP.serialize_u32 `LP.serialize_nondep_then` (LP.serialize_bounded_vlbytes 0 20 `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20)\n\nlet serialize_payload_and_pn_length : LP.serializer parse_payload_and_pn_length =\n LP.serialize_filter VI.serialize_varint payload_and_pn_length_prop\n\nlet serialize_long_zero_rtt_body : LP.serializer parse_long_zero_rtt_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_handshake_body : LP.serializer parse_long_handshake_body = serialize_common_long `LP.serialize_nondep_then` serialize_payload_and_pn_length\nlet serialize_long_retry_body : LP.serializer parse_long_retry_body = serialize_common_long `LP.serialize_nondep_then` LP.serialize_bounded_vlbytes 0 20\nlet serialize_long_initial_body : LP.serializer parse_long_initial_body = serialize_common_long `LP.serialize_nondep_then` (\n LP.serialize_bounded_vlgenbytes 0 token_max_len (VI.serialize_bounded_varint 0 token_max_len) `LP.serialize_nondep_then` serialize_payload_and_pn_length)\n\nlet serialize_header_body\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.serializer (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.serialize_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize_flbytes (U32.v short_dcid_len))\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n serialize_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n serialize_long_handshake_body\n | (| Long, (| (), (| Initial, () |) |) |) ->\n serialize_long_initial_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n serialize_long_retry_body\n\nlet serialize_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer (parse_header short_dcid_len))\n= LPB.serialize_bitsum\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n\nlet serialize_header_eq\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LP.serialize (serialize_header short_dcid_len) h ==\n LP.serialize LP.serialize_u8 (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h)) `Seq.append`\n LP.serialize (serialize_header_body short_dcid_len (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h))) (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h))\n= LPB.serialize_bitsum_eq'\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n LP.serialize_u8\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n h\n\n#push-options \"--z3rlimit 64\"\n\nlet serialize_header_ext\n (short_dcid_len1 short_dcid_len2: short_dcid_len_t)\n (h: header)\n: Lemma\n (requires (short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h))\n (ensures (\n short_dcid_len_prop short_dcid_len1 h /\\ short_dcid_len_prop short_dcid_len2 h /\\\n LP.serialize (serialize_header short_dcid_len1) h == LP.serialize (serialize_header short_dcid_len2) h\n ))\n= serialize_header_eq short_dcid_len1 h;\n serialize_header_eq short_dcid_len2 h;\n ()\n\n#pop-options\n\nlet serialize_header_is_short\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in\n assert (Seq.index s 0 == x);\n assert (PShort? h <==> LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Short <: U8.t))\n\nlet first_byte_is_retry\n (k: LPB.bitsum'_type first_byte)\n: GTot bool\n= match k with\n | (| Long, (| (), (| Retry, (unused, ()) |) |) |) -> true\n | _ -> false\n\nlet first_byte_is_retry_correct\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (is_retry h <==> first_byte_is_retry (first_byte_of_header short_dcid_len h))\n= ()\n\n#push-options \"--z3rlimit 512\"\n#restart-solver\n\nlet serialize_header_is_retry\n dl h\n=\n serialize_header_eq dl h;\n let tg = first_byte_of_header dl h in\n let x = LPB.synth_bitsum'_recip first_byte tg in\n LP.serialize_u8_spec x;\n let s = LP.serialize (serialize_header dl) h in \n assert (Seq.index s 0 == x);\n assert (is_retry h <==> (\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 7 8 == (LowParse.Spec.Enum.enum_repr_of_key header_form Long <: U8.t) /\\\n LPB.uint8.LPB.get_bitfield (Seq.index s 0) 4 6 == (LowParse.Spec.Enum.enum_repr_of_key long_packet_type Retry <: U8.t)\n ))\n\n#pop-options\n\n#restart-solver\n\n\nlet is_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4))\n= ()\n\nlet set_valid_bitfield_intro'\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb\n )\n= is_valid_bitfield_intro short_dcid_len h\n\nlet set_valid_bitfield_intro\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (\n LPB.is_valid_bitfield first_byte (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)) 0 (if PShort? h then 5 else 4) /\\\n first_byte_of_header short_dcid_len (set_protected_bits h new_pb) == LPB.set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb /\\\n LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) == LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)\n )\n= set_valid_bitfield_intro' short_dcid_len h new_pb;\n LPB.bitsum'_key_of_t_set_valid_bitfield first_byte (first_byte_of_header short_dcid_len h) 0 (if PShort? h then 5 else 4) new_pb\n\nlet mk_header_body_set_valid_bitfield\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len (set_protected_bits h new_pb)) (set_protected_bits h new_pb) ==\n mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h)\n= ()\n\n#push-options \"--z3rlimit 512\"\n\n#restart-solver\n\nlet serialize_get_protected_bits\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n: Lemma\n (let sq = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length sq > 0 /\\\n get_protected_bits h == LPB.uint8.LPB.get_bitfield (Seq.head sq) 0 (if PShort? h then 5 else 4))\n= let sq = LP.serialize (serialize_header short_dcid_len) h in\n serialize_header_eq\n short_dcid_len\n h;\n LP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h))\n\n#restart-solver\n\nlet serialize_set_protected_bits", "dependencies": { "source_file": "QUIC.Spec.Header.Public.fst", "checked_file": "QUIC.Spec.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.VarInt.fsti.checked", "prims.fst.checked", "LowParse.Spec.Enum.fst.checked", "LowParse.Spec.BitSum.fst.checked", "LowParse.Spec.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Spec.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 512, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n h: QUIC.Spec.Header.Public.header' short_dcid_len ->\n new_pb:\n QUIC.Spec.Base.bitfield (match PShort? h with\n | true -> 5\n | _ -> 4)\n -> FStar.Pervasives.Lemma\n (ensures\n (let sq =\n LowParse.Spec.Base.serialize (QUIC.Spec.Header.Public.serialize_header short_dcid_len) h\n in\n FStar.Seq.Base.length sq > 0 /\\\n FStar.Seq.Base.equal (LowParse.Spec.Base.serialize (QUIC.Spec.Header.Public.serialize_header\n short_dcid_len)\n (QUIC.Spec.Header.Public.set_protected_bits h new_pb))\n (FStar.Seq.Properties.cons (Mkuint_t?.set_bitfield LowParse.BitFields.uint8\n (FStar.Seq.Properties.head sq)\n 0\n (match PShort? h with\n | true -> 5\n | _ -> 4)\n new_pb)\n (FStar.Seq.Properties.tail sq))))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Base.bitfield", "QUIC.Spec.Header.Public.uu___is_PShort", "Prims.bool", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims._assert", "FStar.Seq.Base.equal", "LowParse.Bytes.byte", "FStar.Seq.Properties.tail", "LowParse.Spec.Base.serialize", "Prims.__proj__Mkdtuple2__item___1", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.parser", "QUIC.Spec.Header.Public.header_body_type", "LowParse.Spec.BitSum.bitsum'_key_of_t", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "QUIC.Spec.Header.Public.first_byte_of_header", "QUIC.Spec.Header.Public.parse_header_body", "FStar.Pervasives.dsnd", "QUIC.Spec.Header.Public.serialize_header_body", "QUIC.Spec.Header.Public.mk_header_body", "Prims.unit", "Prims.eq2", "LowParse.Bytes.bytes", "QUIC.Spec.Header.Public.mk_header_body_set_valid_bitfield", "LowParse.Spec.BitSum.set_valid_bitfield_correct", "LowParse.Spec.BitSum.is_valid_bitfield", "LowParse.Spec.Int.serialize_u8_spec", "LowParse.Spec.BitSum.synth_bitsum'_recip", "QUIC.Spec.Header.Public.serialize_header_eq", "QUIC.Spec.Header.Public.set_valid_bitfield_intro", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "QUIC.Spec.Header.Public.header", "QUIC.Spec.Header.Public.set_protected_bits" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_set_protected_bits\n (short_dcid_len: short_dcid_len_t)\n (h: header' short_dcid_len)\n (new_pb: bitfield (if PShort? h then 5 else 4))\n: Lemma\n (let sq = LP.serialize (serialize_header short_dcid_len) h in\n Seq.length sq > 0 /\\\n LP.serialize (serialize_header short_dcid_len) (set_protected_bits h new_pb) `Seq.equal`\n (LPB.uint8.LPB.set_bitfield (Seq.head sq) 0 (if PShort? h then 5 else 4) new_pb `Seq.cons` Seq.tail sq))\nlet serialize_set_protected_bits short_dcid_len h new_pb =", "completed_definiton": "let h' = set_protected_bits h new_pb in\nlet sq = LP.serialize (serialize_header short_dcid_len) h in\nlet sq' = LP.serialize (serialize_header short_dcid_len) h' in\nset_valid_bitfield_intro short_dcid_len h new_pb;\nserialize_header_eq short_dcid_len h;\nserialize_header_eq short_dcid_len h';\nLP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h));\nLP.serialize_u8_spec (LPB.synth_bitsum'_recip first_byte (first_byte_of_header short_dcid_len h'));\nLPB.set_valid_bitfield_correct first_byte\n (first_byte_of_header short_dcid_len h)\n 0\n (if PShort? h then 5 else 4)\n new_pb;\nmk_header_body_set_valid_bitfield short_dcid_len h new_pb;\nassert (LP.serialize (serialize_header_body short_dcid_len\n (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h')))\n (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h') h') ==\n LP.serialize (serialize_header_body short_dcid_len\n (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)))\n (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h));\nassert ((Seq.tail sq')\n `Seq.equal`\n (LP.serialize (serialize_header_body short_dcid_len\n (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h')))\n (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h') h')));\nassert ((Seq.tail sq)\n `Seq.equal`\n (LP.serialize (serialize_header_body short_dcid_len\n (LPB.bitsum'_key_of_t first_byte (first_byte_of_header short_dcid_len h)))\n (mk_header_body short_dcid_len (first_byte_of_header short_dcid_len h) h)))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.PacketNumber.fst", "name": "QUIC.Impl.PacketNumber.secret_bounded_integer", "original_source_type": "", "source_type": "val secret_bounded_integer : i: LowParse.Spec.BoundedInt.integer_size -> Type0", "source_definition": "let secret_bounded_integer (i: LP.integer_size) = (x: Secret.uint32 { LP.bounded_integer_prop i (U32.uint_to_t (Secret.v x)) })", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 129, "start_col": 50, "end_line": 129, "end_col": 127 }, "file_context": "module QUIC.Impl.PacketNumber\nopen QUIC.Spec.PacketNumber\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule HST = FStar.HyperStack.ST\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule LP = LowParse.Spec\nmodule Seq = QUIC.Secret.Seq\n\nfriend QUIC.Spec.PacketNumber\nmodule Spec = QUIC.Spec.PacketNumber\n\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule E = LowParse.Endianness.BitFields\n\nlet be_to_n_4_eq\n (b: Seq.lseq U8.t 4)\n: Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 2) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 0)\n )))))))\n= assert_norm (pow2 8 == 256);\n E.reveal_be_to_n b;\n let b3 = Seq.slice b 0 3 in\n E.reveal_be_to_n b3;\n let b2 = Seq.slice b3 0 2 in\n E.reveal_be_to_n b2;\n let b1 = Seq.slice b2 0 1 in\n E.reveal_be_to_n b1;\n E.reveal_be_to_n (Seq.slice b1 0 0)\n\n#push-options \"--z3rlimit 64\"\n\nlet read_u32\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse LP.parse_u32 (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n= \n let h = HST.get () in\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n be_to_n_4_eq (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4);\n let b3 = B.index b 3ul in\n let b2 = B.index b 2ul in\n let b1 = B.index b 1ul in\n let b0 = B.index b 0ul in\n Secret.to_u32 b3 `Secret.add` (Secret.to_u32 256ul `Secret.mul` (\n Secret.to_u32 b2 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b1 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b0\n ))))))\n\n#pop-options\n\nmodule BF = LowParse.BitFields\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet read_bounded_integer\n (pn_len: packet_number_length_t)\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse (LP.parse_bounded_integer (Secret.v pn_len)) (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n=\n let h = HST.get () in\n LP.parse_bounded_integer_spec (Secret.v pn_len) (Seq.seq_reveal (B.as_seq h b));\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n E.bitfield_be_to_n_slice (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4) 0 (Secret.v pn_len);\n let x = read_u32 b in\n BF.get_bitfield_full #32 (Secret.v x);\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.get_bitfield x 24ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.get_bitfield x 16ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul`\nSecret.get_bitfield x 8ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` x)\n\n#pop-options\n\nmodule U = FStar.UInt\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet bound_npn\n (pn_len: packet_number_length_t)\n: Tot (x: packet_number_t { Secret.v x == bound_npn' (Secret.v pn_len - 1) })\n= let pn_len_1 = Secret.to_u64 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 0ul) `Secret.mul` Secret.to_u64 256uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 1ul) `Secret.mul` Secret.to_u64 65536uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 2ul) `Secret.mul` Secret.to_u64 16777216uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 3ul) `Secret.mul` Secret.to_u64 4294967296uL)\n\n#pop-options", "dependencies": { "source_file": "QUIC.Impl.PacketNumber.fst", "checked_file": "QUIC.Impl.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.fst.checked", "LowParse.Endianness.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "E", "full_module": "LowParse.Endianness.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: LowParse.Spec.BoundedInt.integer_size -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.BoundedInt.integer_size", "Lib.IntTypes.uint32", "LowParse.Spec.BoundedInt.bounded_integer_prop", "FStar.UInt32.uint_to_t", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let secret_bounded_integer (i: LP.integer_size) =", "completed_definiton": "(x: Secret.uint32{LP.bounded_integer_prop i (U32.uint_to_t (Secret.v x))})", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.PacketNumber.fst", "name": "QUIC.Impl.PacketNumber.write_packet_number", "original_source_type": "val write_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (pn: packet_number_t' last pn_len)\n (b: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h _ h' ->\n let b' = B.gsub b 0ul (U32.uint_to_t (Secret.v pn_len)) in\n B.modifies (B.loc_buffer b') h h' /\\\n Seq.seq_reveal (B.as_seq h' b') == LP.serialize (serialize_packet_number last pn_len) pn\n ))", "source_type": "val write_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (pn: packet_number_t' last pn_len)\n (b: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h _ h' ->\n let b' = B.gsub b 0ul (U32.uint_to_t (Secret.v pn_len)) in\n B.modifies (B.loc_buffer b') h h' /\\\n Seq.seq_reveal (B.as_seq h' b') == LP.serialize (serialize_packet_number last pn_len) pn\n ))", "source_definition": "let write_packet_number\n last pn_len pn b\n= let h = HST.get () in\n LP.serialize_synth_eq\n (LP.lift_parser (parse_reduced_pn pn_len))\n (synth_packet_number last pn_len)\n (LP.lift_serializer (serialize_reduced_pn pn_len))\n (synth_packet_number_recip last pn_len)\n ()\n pn;\n let npn = reduce_pn pn_len pn in\n write_bounded_integer pn_len npn b", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 413, "start_col": 1, "end_line": 422, "end_col": 36 }, "file_context": "module QUIC.Impl.PacketNumber\nopen QUIC.Spec.PacketNumber\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule HST = FStar.HyperStack.ST\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule LP = LowParse.Spec\nmodule Seq = QUIC.Secret.Seq\n\nfriend QUIC.Spec.PacketNumber\nmodule Spec = QUIC.Spec.PacketNumber\n\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule E = LowParse.Endianness.BitFields\n\nlet be_to_n_4_eq\n (b: Seq.lseq U8.t 4)\n: Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 2) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 0)\n )))))))\n= assert_norm (pow2 8 == 256);\n E.reveal_be_to_n b;\n let b3 = Seq.slice b 0 3 in\n E.reveal_be_to_n b3;\n let b2 = Seq.slice b3 0 2 in\n E.reveal_be_to_n b2;\n let b1 = Seq.slice b2 0 1 in\n E.reveal_be_to_n b1;\n E.reveal_be_to_n (Seq.slice b1 0 0)\n\n#push-options \"--z3rlimit 64\"\n\nlet read_u32\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse LP.parse_u32 (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n= \n let h = HST.get () in\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n be_to_n_4_eq (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4);\n let b3 = B.index b 3ul in\n let b2 = B.index b 2ul in\n let b1 = B.index b 1ul in\n let b0 = B.index b 0ul in\n Secret.to_u32 b3 `Secret.add` (Secret.to_u32 256ul `Secret.mul` (\n Secret.to_u32 b2 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b1 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b0\n ))))))\n\n#pop-options\n\nmodule BF = LowParse.BitFields\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet read_bounded_integer\n (pn_len: packet_number_length_t)\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse (LP.parse_bounded_integer (Secret.v pn_len)) (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n=\n let h = HST.get () in\n LP.parse_bounded_integer_spec (Secret.v pn_len) (Seq.seq_reveal (B.as_seq h b));\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n E.bitfield_be_to_n_slice (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4) 0 (Secret.v pn_len);\n let x = read_u32 b in\n BF.get_bitfield_full #32 (Secret.v x);\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.get_bitfield x 24ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.get_bitfield x 16ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul`\nSecret.get_bitfield x 8ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` x)\n\n#pop-options\n\nmodule U = FStar.UInt\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet bound_npn\n (pn_len: packet_number_length_t)\n: Tot (x: packet_number_t { Secret.v x == bound_npn' (Secret.v pn_len - 1) })\n= let pn_len_1 = Secret.to_u64 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 0ul) `Secret.mul` Secret.to_u64 256uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 1ul) `Secret.mul` Secret.to_u64 65536uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 2ul) `Secret.mul` Secret.to_u64 16777216uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 3ul) `Secret.mul` Secret.to_u64 4294967296uL)\n\n#pop-options\n\ninline_for_extraction\nlet secret_bounded_integer (i: LP.integer_size) = (x: Secret.uint32 { LP.bounded_integer_prop i (U32.uint_to_t (Secret.v x)) })\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 2 --initial_ifuel 2 --z3rlimit 4096 --query_stats\"\n\nmodule U62 = QUIC.UInt62\nmodule Lemmas = QUIC.Spec.PacketNumber.Lemmas\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet expand_pn_aux\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: Secret.uint64 { Secret.v pn == expand_pn' (Secret.v pn_len - 1) (Secret.v last) (Secret.v npn) })\n= let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected : U62.secret = last `Secret.add` Secret.to_u64 1uL in\n let bound = bound_npn pn_len in\n let bound_2 = bound `Secret.shift_right` 1ul in\n FStar.UInt.shift_right_value_lemma #64 (Secret.v bound) 1;\n assert (Secret.v bound_2 == Secret.v bound / 2);\n let candidate = Lemmas.replace_modulo expected (8 `Prims.op_Multiply` Secret.v pn_len) (bound `Secret.sub` Secret.to_u64 1uL) (Secret.to_u64 npn) in\n Lemmas.lemma_replace_modulo_bound (Secret.v expected) (8*(Secret.v pn_len)) (Secret.v npn) 62;\n let bound_2_le_expected = bound_2 `Secret.secret_is_le_64` expected in\n let cond_1 =\n bound_2_le_expected `Secret.logand_one_bit`\n (candidate `Secret.secret_is_le_64` ((bound_2_le_expected `Secret.mul` expected) `Secret.sub` (bound_2_le_expected `Secret.mul` bound_2))) `Secret.logand_one_bit`\n (candidate `Secret.secret_is_lt_64` (Secret.to_u64 U62.bound `Secret.sub` bound))\n in\n assert (Secret.v cond_1 == (\n if\n Secret.v bound_2 <= Secret.v expected &&\n Secret.v candidate <= (Secret.v expected - Secret.v bound_2) &&\n Secret.v candidate < U62.v U62.bound - Secret.v bound\n then 1\n else 0\n ));\n let cond_2 =\n Secret.lognot_one_bit cond_1 `Secret.logand_one_bit`\n ((expected `Secret.add` bound_2) `Secret.secret_is_lt_64` candidate) `Secret.logand_one_bit`\n (bound `Secret.secret_is_le_64` candidate)\n in\n assert (Secret.v cond_2 == (\n if\n Secret.v cond_1 = 0 &&\n Secret.v expected + Secret.v bound_2 < Secret.v candidate &&\n Secret.v bound <= Secret.v candidate\n then 1\n else 0\n ));\n (candidate `Secret.add` (cond_1 `Secret.mul` bound)) `Secret.sub` (cond_2 `Secret.mul` bound)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n[@\"opaque_to_smt\"]\nlet expand_pn\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: packet_number_t { pn == synth_packet_number last pn_len (U32.uint_to_t (Secret.v npn)) })\n= expand_pn_aux pn_len last npn\n\n#pop-options\n\nlet read_packet_number\n last pn_len b\n= let h = HST.get () in\n LP.parse_synth_eq (LP.lift_parser (parse_reduced_pn pn_len)) (synth_packet_number last pn_len) (Seq.seq_reveal (B.as_seq h b));\n let npn = read_bounded_integer pn_len b in\n expand_pn pn_len last npn\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet reduce_pn\n (pn_len: packet_number_length_t)\n (pn: packet_number_t)\n: Tot (b: secret_bounded_integer (Secret.v pn_len) { Secret.v b == reduce_pn' (Secret.v pn_len - 1) (Secret.v pn) })\n= let mask = bound_npn pn_len `Secret.sub` Secret.to_u64 1uL in\n Secret.logand_spec pn mask;\n Lemmas.logand_mask #64 (Secret.v pn) (8 `Prims.op_Multiply` Secret.v pn_len);\n Secret.to_u32 (pn `Secret.logand` mask)\n\n#pop-options\n\nlet serialize_u32_spec\n (x: U32.t)\n: Lemma\n (LP.serialize LP.serialize_u32 x == E.n_to_be 4 (U32.v x))\n= LP.parse_u32_spec (E.n_to_be 4 (U32.v x));\n LP.parse_injective LP.parse_u32 (LP.serialize LP.serialize_u32 x) (E.n_to_be 4 (U32.v x))\n\n#push-options \"--z3rlimit 16\"\n\nlet write_u32\n (x: Secret.uint32)\n (b: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h _ h' ->\n let b' = B.gsub b 0ul 4ul in\n B.modifies (B.loc_buffer b') h h' /\\\n Seq.seq_reveal (B.as_seq h' b') `Seq.equal` LP.serialize (LP.serialize_u32) (U32.uint_to_t (Secret.v x))\n ))\n= serialize_u32_spec (U32.uint_to_t (Secret.v x));\n E.index_n_to_be 4 (Secret.v x) 0;\n E.index_n_to_be 4 (Secret.v x) 1;\n E.index_n_to_be 4 (Secret.v x) 2;\n E.index_n_to_be 4 (Secret.v x) 3;\n let b' = B.sub b 0ul 4ul in\n B.upd b' 0ul (Secret.to_u8 (x `Secret.shift_right` 24ul));\n B.upd b' 1ul (Secret.to_u8 (x `Secret.shift_right` 16ul));\n B.upd b' 2ul (Secret.to_u8 (x `Secret.shift_right` 8ul));\n B.upd b' 3ul (Secret.to_u8 x)\n\n#pop-options\n\n#push-options \"--z3rlimit 256\"\n\n#restart-solver\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nlet set_left_bitfield_arg\n (pn_len: packet_number_length_t)\n (pn_len' : U32.t { 1 <= U32.v pn_len' /\\ U32.v pn_len' <= 4 } )\n (x: Secret.uint32 {\n Secret.v pn_len == U32.v pn_len' ==> LP.bounded_integer_prop (Secret.v pn_len) (U32.uint_to_t (Secret.v x))\n })\n (mask: Secret.uint32 { Secret.v mask == pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) - 1 })\n: Tot (y: secret_bounded_integer (U32.v pn_len') {\n Secret.v pn_len == U32.v pn_len' ==> Secret.v y == Secret.v x\n })\n=\n let f () : Lemma\n (requires (Secret.v pn_len == U32.v pn_len'))\n (ensures (\n Secret.v pn_len == U32.v pn_len' /\\\n Secret.v x % pow2 (8 `Prims.op_Multiply` U32.v pn_len' ) == Secret.v x\n ))\n = LP.bounded_integer_prop_equiv (Secret.v pn_len) (U32.uint_to_t (Secret.v x));\n FStar.Math.Lemmas.small_mod (Secret.v x) (pow2 (8 `Prims.op_Multiply` U32.v pn_len'))\n in\n let g () : Lemma\n (Secret.v pn_len == U32.v pn_len' ==>\n Secret.v x % pow2 (8 `Prims.op_Multiply` U32.v pn_len' ) == Secret.v x\n )\n = Classical.move_requires f ()\n in\n g ();\n Lemmas.logand_mask #32 (Secret.v x) (8 `Prims.op_Multiply` U32.v pn_len');\n [@inline_let]\n let y = x `Secret.logand` mask in\n assert (Secret.v y == U.logand #32 (Secret.v x) (Secret.v mask));\n y\n\n#pop-options\n\n#push-options \"--z3rlimit 256\"\n\n#restart-solver\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nval set_left_bitfield_aux\n (pn_len: packet_number_length_t)\n (pn_len' : U32.t { 1 <= U32.v pn_len' /\\ U32.v pn_len' <= 4 } )\n (before: Secret.uint32)\n (x: Secret.uint32 {\n Secret.v pn_len == U32.v pn_len' ==> LP.bounded_integer_prop (Secret.v pn_len) (U32.uint_to_t (Secret.v x))\n })\n (mask: Secret.uint32 { Secret.v mask == pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) - 1 })\n: Tot (after: Secret.uint32 { Secret.v after == (if Secret.v pn_len = U32.v pn_len' then \nBF.set_bitfield #32 (Secret.v before) (8 `Prims.op_Multiply` (4 - Secret.v pn_len)) 32 (Secret.v x <: nat) else 0) })\n\nlet set_left_bitfield_aux\n pn_len pn_len' before x mask\n= \n [@inline_let]\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n (pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 (pn_len' `U32.sub` 1ul)) `Secret.mul` Secret.set_bitfield before (8ul `U32.mul` (4ul `U32.sub` pn_len')) 32ul (set_left_bitfield_arg pn_len pn_len' x mask)\n\n#pop-options\n\n#push-options \"--z3rlimit 128\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet set_left_bitfield\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n: Tot (after: Secret.uint32 { Secret.v after = BF.set_bitfield #32 (Secret.v before) (8 `Prims.op_Multiply` (4 - Secret.v pn_len)) 32 (Secret.v x) })\n=\n BF.set_bitfield_full #32 (Secret.v before) (Secret.v x);\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 16 == 65536);\n assert_norm (pow2 24 == 16777216);\n [@inline_let]\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n set_left_bitfield_aux pn_len 1ul before x (Secret.to_u32 255ul) `Secret.add`\n set_left_bitfield_aux pn_len 2ul before x (Secret.to_u32 65535ul) `Secret.add`\n set_left_bitfield_aux pn_len 3ul before x (Secret.to_u32 16777215ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` x)\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\n#restart-solver\n\nlet set_left_bitfield_left\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n: Lemma\n (Seq.slice (E.n_to_be 4 (Secret.v (set_left_bitfield pn_len before x))) 0 (Secret.v pn_len) == E.n_to_be (Secret.v pn_len) (Secret.v x))\n=\n E.slice_n_to_be_bitfield 4 (Secret.v (set_left_bitfield pn_len before x)) 0 (Secret.v pn_len);\n BF.get_bitfield_set_bitfield_same #32 (Secret.v before) (8 `op_Multiply` (4 - Secret.v pn_len)) 32 (Secret.v x)\n\nlet set_left_bitfield_right\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n: Lemma\n (Seq.slice (E.n_to_be 4 (Secret.v (set_left_bitfield pn_len before x))) (Secret.v pn_len) 4 == Seq.slice (E.n_to_be 4 (Secret.v before)) (Secret.v pn_len) 4)\n= \n E.slice_n_to_be_bitfield 4 (Secret.v (set_left_bitfield pn_len before x)) (Secret.v pn_len) 4;\n E.slice_n_to_be_bitfield 4 (Secret.v before) (Secret.v pn_len) 4;\n BF.get_bitfield_set_bitfield_other #32 (Secret.v before) (8 `op_Multiply` (4 - Secret.v pn_len)) 32 (Secret.v x) 0 (8 `op_Multiply` (4 - Secret.v pn_len))\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet write_bounded_integer\n (pn_len: packet_number_length_t)\n (x: secret_bounded_integer (Secret.v pn_len))\n (b: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h _ h' ->\n let b' = B.gsub b 0ul (U32.uint_to_t (Secret.v pn_len)) in\n B.modifies (B.loc_buffer b') h h' /\\\n Seq.seq_reveal (B.as_seq h' b') `Seq.equal` LP.serialize (LP.serialize_bounded_integer (Secret.v pn_len)) (U32.uint_to_t (Secret.v x))\n ))\n= \n let h = HST.get () in\n let b' = B.sub b 0ul 4ul in\n let before = read_u32 b' in\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b'));\n LP.bounded_integer_prop_equiv (Secret.v pn_len) (U32.uint_to_t (Secret.v x));\n let after = set_left_bitfield pn_len before x in\n write_u32 after b';\n serialize_u32_spec (U32.uint_to_t (Secret.v after));\n LP.serialize_bounded_integer_spec (Secret.v pn_len) (U32.uint_to_t (Secret.v x));\n set_left_bitfield_left pn_len before x;\n set_left_bitfield_right pn_len before x;\n let h' = HST.get () in\n assert (Seq.slice (Seq.seq_reveal (B.as_seq h' b')) (Secret.v pn_len) 4 `Seq.equal` Seq.slice (Seq.seq_reveal (B.as_seq h b')) (Secret.v pn_len) 4);\n assert (Seq.seq_reveal (Seq.slice (B.as_seq h' b') (Secret.v pn_len) 4) `Seq.equal` Seq.slice (Seq.seq_reveal (B.as_seq h' b')) (Secret.v pn_len) 4);\n assert (Seq.seq_reveal (Seq.slice (B.as_seq h b') (Secret.v pn_len) 4) `Seq.equal` Seq.slice (Seq.seq_reveal (B.as_seq h b')) (Secret.v pn_len) 4);\n Seq.seq_reveal_inj (Seq.slice (B.as_seq h' b') (Secret.v pn_len) 4) (Seq.slice (B.as_seq h b') (Secret.v pn_len) 4);\n B.modifies_loc_buffer_from_to_intro b' 0ul (U32.uint_to_t (Secret.v pn_len)) B.loc_none h h'\n\n\n#pop-options\n\nlet write_packet_number", "dependencies": { "source_file": "QUIC.Impl.PacketNumber.fst", "checked_file": "QUIC.Impl.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.fst.checked", "LowParse.Endianness.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "E", "full_module": "LowParse.Endianness.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t' last pn_len ->\n b: LowStar.Buffer.buffer Lib.IntTypes.uint8\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "QUIC.Impl.PacketNumber.write_bounded_integer", "Prims.unit", "QUIC.Impl.PacketNumber.secret_bounded_integer", "Lib.IntTypes.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "Prims.eq2", "Prims.int", "Prims.l_or", "Lib.IntTypes.range", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "QUIC.Spec.PacketNumber.reduce_pn'", "Prims.op_Subtraction", "Lib.IntTypes.U64", "QUIC.Impl.PacketNumber.reduce_pn", "LowParse.Spec.Combinators.serialize_synth_eq", "QUIC.Spec.PacketNumber.parse_packet_number_kind", "LowParse.Spec.BoundedInt.bounded_integer", "QUIC.Secret.Int.Base.v", "LowParse.Spec.Combinators.lift_parser", "QUIC.Spec.PacketNumber.parse_reduced_pn", "QUIC.Spec.PacketNumber.synth_packet_number", "LowParse.Spec.Combinators.lift_serializer", "QUIC.Spec.PacketNumber.serialize_reduced_pn", "QUIC.Spec.PacketNumber.synth_packet_number_recip", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val write_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (pn: packet_number_t' last pn_len)\n (b: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h _ h' ->\n let b' = B.gsub b 0ul (U32.uint_to_t (Secret.v pn_len)) in\n B.modifies (B.loc_buffer b') h h' /\\\n Seq.seq_reveal (B.as_seq h' b') == LP.serialize (serialize_packet_number last pn_len) pn\n ))\nlet write_packet_number last pn_len pn b =", "completed_definiton": "let h = HST.get () in\nLP.serialize_synth_eq (LP.lift_parser (parse_reduced_pn pn_len))\n (synth_packet_number last pn_len)\n (LP.lift_serializer (serialize_reduced_pn pn_len))\n (synth_packet_number_recip last pn_len)\n ()\n pn;\nlet npn = reduce_pn pn_len pn in\nwrite_bounded_integer pn_len npn b", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.PacketNumber.fst", "name": "QUIC.Impl.PacketNumber.be_to_n_4_eq", "original_source_type": "val be_to_n_4_eq (b: Seq.lseq U8.t 4)\n : Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) +\n (256\n `Prims.op_Multiply`\n (U8.v (Seq.index b 2) +\n (256\n `Prims.op_Multiply`\n (U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (U8.v (Seq.index b 0))))))))", "source_type": "val be_to_n_4_eq (b: Seq.lseq U8.t 4)\n : Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) +\n (256\n `Prims.op_Multiply`\n (U8.v (Seq.index b 2) +\n (256\n `Prims.op_Multiply`\n (U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (U8.v (Seq.index b 0))))))))", "source_definition": "let be_to_n_4_eq\n (b: Seq.lseq U8.t 4)\n: Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 2) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 0)\n )))))))\n= assert_norm (pow2 8 == 256);\n E.reveal_be_to_n b;\n let b3 = Seq.slice b 0 3 in\n E.reveal_be_to_n b3;\n let b2 = Seq.slice b3 0 2 in\n E.reveal_be_to_n b2;\n let b1 = Seq.slice b2 0 1 in\n E.reveal_be_to_n b1;\n E.reveal_be_to_n (Seq.slice b1 0 0)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 33, "start_col": 2, "end_line": 41, "end_col": 37 }, "file_context": "module QUIC.Impl.PacketNumber\nopen QUIC.Spec.PacketNumber\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule HST = FStar.HyperStack.ST\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule LP = LowParse.Spec\nmodule Seq = QUIC.Secret.Seq\n\nfriend QUIC.Spec.PacketNumber\nmodule Spec = QUIC.Spec.PacketNumber\n\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule E = LowParse.Endianness.BitFields\n\nlet be_to_n_4_eq\n (b: Seq.lseq U8.t 4)\n: Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 2) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 0)", "dependencies": { "source_file": "QUIC.Impl.PacketNumber.fst", "checked_file": "QUIC.Impl.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.fst.checked", "LowParse.Endianness.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "E", "full_module": "LowParse.Endianness.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: FStar.Seq.Properties.lseq FStar.UInt8.t 4\n -> FStar.Pervasives.Lemma\n (ensures\n FStar.Endianness.be_to_n b ==\n FStar.UInt8.v (FStar.Seq.Base.index b 3) +\n 256 *\n (FStar.UInt8.v (FStar.Seq.Base.index b 2) +\n 256 *\n (FStar.UInt8.v (FStar.Seq.Base.index b 1) + 256 * FStar.UInt8.v (FStar.Seq.Base.index b 0)))\n )", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Properties.lseq", "FStar.UInt8.t", "FStar.Endianness.reveal_be_to_n", "FStar.Seq.Base.slice", "Prims.unit", "FStar.Seq.Base.seq", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.int", "Prims.pow2", "Prims.l_True", "Prims.squash", "FStar.Endianness.be_to_n", "Prims.op_Addition", "FStar.UInt8.v", "FStar.Seq.Base.index", "Prims.op_Multiply", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val be_to_n_4_eq (b: Seq.lseq U8.t 4)\n : Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) +\n (256\n `Prims.op_Multiply`\n (U8.v (Seq.index b 2) +\n (256\n `Prims.op_Multiply`\n (U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (U8.v (Seq.index b 0))))))))\nlet be_to_n_4_eq (b: Seq.lseq U8.t 4)\n : Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) +\n (256\n `Prims.op_Multiply`\n (U8.v (Seq.index b 2) +\n (256\n `Prims.op_Multiply`\n (U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (U8.v (Seq.index b 0)))))))) =", "completed_definiton": "assert_norm (pow2 8 == 256);\nE.reveal_be_to_n b;\nlet b3 = Seq.slice b 0 3 in\nE.reveal_be_to_n b3;\nlet b2 = Seq.slice b3 0 2 in\nE.reveal_be_to_n b2;\nlet b1 = Seq.slice b2 0 1 in\nE.reveal_be_to_n b1;\nE.reveal_be_to_n (Seq.slice b1 0 0)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.PacketNumber.fst", "name": "QUIC.Impl.PacketNumber.read_u32", "original_source_type": "val read_u32 (b: B.buffer Secret.uint8)\n : HST.Stack Secret.uint32\n (requires (fun h -> B.live h b /\\ 4 <= B.length b))\n (ensures\n (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n (match LP.parse LP.parse_u32 (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False)))", "source_type": "val read_u32 (b: B.buffer Secret.uint8)\n : HST.Stack Secret.uint32\n (requires (fun h -> B.live h b /\\ 4 <= B.length b))\n (ensures\n (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n (match LP.parse LP.parse_u32 (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False)))", "source_definition": "let read_u32\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse LP.parse_u32 (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n= \n let h = HST.get () in\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n be_to_n_4_eq (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4);\n let b3 = B.index b 3ul in\n let b2 = B.index b 2ul in\n let b1 = B.index b 1ul in\n let b0 = B.index b 0ul in\n Secret.to_u32 b3 `Secret.add` (Secret.to_u32 256ul `Secret.mul` (\n Secret.to_u32 b2 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b1 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b0\n ))))))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 59, "start_col": 1, "end_line": 71, "end_col": 8 }, "file_context": "module QUIC.Impl.PacketNumber\nopen QUIC.Spec.PacketNumber\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule HST = FStar.HyperStack.ST\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule LP = LowParse.Spec\nmodule Seq = QUIC.Secret.Seq\n\nfriend QUIC.Spec.PacketNumber\nmodule Spec = QUIC.Spec.PacketNumber\n\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule E = LowParse.Endianness.BitFields\n\nlet be_to_n_4_eq\n (b: Seq.lseq U8.t 4)\n: Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 2) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 0)\n )))))))\n= assert_norm (pow2 8 == 256);\n E.reveal_be_to_n b;\n let b3 = Seq.slice b 0 3 in\n E.reveal_be_to_n b3;\n let b2 = Seq.slice b3 0 2 in\n E.reveal_be_to_n b2;\n let b1 = Seq.slice b2 0 1 in\n E.reveal_be_to_n b1;\n E.reveal_be_to_n (Seq.slice b1 0 0)\n\n#push-options \"--z3rlimit 64\"\n\nlet read_u32\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse LP.parse_u32 (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end", "dependencies": { "source_file": "QUIC.Impl.PacketNumber.fst", "checked_file": "QUIC.Impl.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.fst.checked", "LowParse.Endianness.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "E", "full_module": "LowParse.Endianness.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: LowStar.Buffer.buffer Lib.IntTypes.uint8 -> FStar.HyperStack.ST.Stack Lib.IntTypes.uint32", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "Lib.IntTypes.add", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "Lib.IntTypes.to_u32", "Lib.IntTypes.U8", "Lib.IntTypes.mul", "Lib.IntTypes.PUB", "FStar.UInt32.__uint_to_t", "Lib.IntTypes.uint32", "Lib.IntTypes.int_t", "LowStar.Monotonic.Buffer.index", "LowStar.Buffer.trivial_preorder", "Prims.unit", "QUIC.Impl.PacketNumber.be_to_n_4_eq", "FStar.Seq.Base.slice", "Lib.IntTypes.uint_t", "QUIC.Secret.Seq.seq_reveal", "LowStar.Monotonic.Buffer.as_seq", "LowParse.Spec.Int.parse_u32_spec", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "Prims.l_and", "LowStar.Monotonic.Buffer.live", "Prims.b2t", "Prims.op_LessThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_none", "LowParse.Spec.Base.parse", "FStar.UInt32.t", "LowParse.Spec.Int.parse_u32", "LowParse.Spec.Base.consumed_length", "Prims.eq2", "Prims.int", "Prims.l_or", "Lib.IntTypes.range", "FStar.UInt.size", "FStar.UInt32.n", "QUIC.Secret.Int.Base.v", "FStar.UInt32.v", "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_u32 (b: B.buffer Secret.uint8)\n : HST.Stack Secret.uint32\n (requires (fun h -> B.live h b /\\ 4 <= B.length b))\n (ensures\n (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n (match LP.parse LP.parse_u32 (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False)))\nlet read_u32 (b: B.buffer Secret.uint8)\n : HST.Stack Secret.uint32\n (requires (fun h -> B.live h b /\\ 4 <= B.length b))\n (ensures\n (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n (match LP.parse LP.parse_u32 (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False))) =", "completed_definiton": "let h = HST.get () in\nLP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\nbe_to_n_4_eq (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4);\nlet b3 = B.index b 3ul in\nlet b2 = B.index b 2ul in\nlet b1 = B.index b 1ul in\nlet b0 = B.index b 0ul in\n(Secret.to_u32 b3)\n`Secret.add`\n((Secret.to_u32 256ul)\n `Secret.mul`\n ((Secret.to_u32 b2)\n `Secret.add`\n ((Secret.to_u32 256ul)\n `Secret.mul`\n ((Secret.to_u32 b1) `Secret.add` ((Secret.to_u32 256ul) `Secret.mul` (Secret.to_u32 b0))))))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.PacketNumber.fst", "name": "QUIC.Impl.PacketNumber.bound_npn", "original_source_type": "val bound_npn (pn_len: packet_number_length_t)\n : Tot (x: packet_number_t{Secret.v x == bound_npn' (Secret.v pn_len - 1)})", "source_type": "val bound_npn (pn_len: packet_number_length_t)\n : Tot (x: packet_number_t{Secret.v x == bound_npn' (Secret.v pn_len - 1)})", "source_definition": "let bound_npn\n (pn_len: packet_number_length_t)\n: Tot (x: packet_number_t { Secret.v x == bound_npn' (Secret.v pn_len - 1) })\n= let pn_len_1 = Secret.to_u64 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 0ul) `Secret.mul` Secret.to_u64 256uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 1ul) `Secret.mul` Secret.to_u64 65536uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 2ul) `Secret.mul` Secret.to_u64 16777216uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 3ul) `Secret.mul` Secret.to_u64 4294967296uL)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 120, "start_col": 1, "end_line": 124, "end_col": 104 }, "file_context": "module QUIC.Impl.PacketNumber\nopen QUIC.Spec.PacketNumber\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule HST = FStar.HyperStack.ST\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule LP = LowParse.Spec\nmodule Seq = QUIC.Secret.Seq\n\nfriend QUIC.Spec.PacketNumber\nmodule Spec = QUIC.Spec.PacketNumber\n\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule E = LowParse.Endianness.BitFields\n\nlet be_to_n_4_eq\n (b: Seq.lseq U8.t 4)\n: Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 2) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 0)\n )))))))\n= assert_norm (pow2 8 == 256);\n E.reveal_be_to_n b;\n let b3 = Seq.slice b 0 3 in\n E.reveal_be_to_n b3;\n let b2 = Seq.slice b3 0 2 in\n E.reveal_be_to_n b2;\n let b1 = Seq.slice b2 0 1 in\n E.reveal_be_to_n b1;\n E.reveal_be_to_n (Seq.slice b1 0 0)\n\n#push-options \"--z3rlimit 64\"\n\nlet read_u32\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse LP.parse_u32 (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n= \n let h = HST.get () in\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n be_to_n_4_eq (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4);\n let b3 = B.index b 3ul in\n let b2 = B.index b 2ul in\n let b1 = B.index b 1ul in\n let b0 = B.index b 0ul in\n Secret.to_u32 b3 `Secret.add` (Secret.to_u32 256ul `Secret.mul` (\n Secret.to_u32 b2 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b1 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b0\n ))))))\n\n#pop-options\n\nmodule BF = LowParse.BitFields\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet read_bounded_integer\n (pn_len: packet_number_length_t)\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse (LP.parse_bounded_integer (Secret.v pn_len)) (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n=\n let h = HST.get () in\n LP.parse_bounded_integer_spec (Secret.v pn_len) (Seq.seq_reveal (B.as_seq h b));\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n E.bitfield_be_to_n_slice (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4) 0 (Secret.v pn_len);\n let x = read_u32 b in\n BF.get_bitfield_full #32 (Secret.v x);\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.get_bitfield x 24ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.get_bitfield x 16ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul`\nSecret.get_bitfield x 8ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` x)\n\n#pop-options\n\nmodule U = FStar.UInt\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet bound_npn\n (pn_len: packet_number_length_t)", "dependencies": { "source_file": "QUIC.Impl.PacketNumber.fst", "checked_file": "QUIC.Impl.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.fst.checked", "LowParse.Endianness.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "E", "full_module": "LowParse.Endianness.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t\n -> x:\n QUIC.Spec.PacketNumber.Base.packet_number_t\n { QUIC.Secret.Int.Base.v x ==\n QUIC.Spec.PacketNumber.Base.bound_npn' (QUIC.Secret.Int.Base.v pn_len - 1) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "Lib.IntTypes.add", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "Lib.IntTypes.mul", "QUIC.Secret.Int.secrets_are_equal_64_2", "Lib.IntTypes.to_u64", "Lib.IntTypes.U32", "Lib.IntTypes.PUB", "FStar.UInt32.__uint_to_t", "FStar.UInt64.__uint_to_t", "Lib.IntTypes.int_t", "Lib.IntTypes.sub", "Lib.IntTypes.to_u32", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Prims.eq2", "Prims.int", "Prims.l_or", "Lib.IntTypes.range", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "Prims.op_GreaterThan", "Prims.pow2", "Prims.op_Multiply", "Prims.op_Addition", "Prims.op_Subtraction", "QUIC.Secret.Int.Base.v", "QUIC.Spec.PacketNumber.Base.bound_npn'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val bound_npn (pn_len: packet_number_length_t)\n : Tot (x: packet_number_t{Secret.v x == bound_npn' (Secret.v pn_len - 1)})\nlet bound_npn (pn_len: packet_number_length_t)\n : Tot (x: packet_number_t{Secret.v x == bound_npn' (Secret.v pn_len - 1)}) =", "completed_definiton": "let pn_len_1 = Secret.to_u64 (pn_len `Secret.sub` (Secret.to_u32 1ul)) in\n((((pn_len_1 `Secret.secrets_are_equal_64_2` (Secret.to_u64 0ul)) `Secret.mul` (Secret.to_u64 256uL)\n )\n `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` (Secret.to_u64 1ul))\n `Secret.mul`\n (Secret.to_u64 65536uL)))\n `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` (Secret.to_u64 2ul))\n `Secret.mul`\n (Secret.to_u64 16777216uL)))\n`Secret.add`\n((pn_len_1 `Secret.secrets_are_equal_64_2` (Secret.to_u64 3ul))\n `Secret.mul`\n (Secret.to_u64 4294967296uL))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.PacketNumber.fst", "name": "QUIC.Impl.PacketNumber.read_packet_number", "original_source_type": "val read_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (b: B.buffer Secret.uint8)\n: HST.Stack (packet_number_t' last pn_len)\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse (parse_packet_number last pn_len) (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> res == v\n | None -> False\n end\n ))", "source_type": "val read_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (b: B.buffer Secret.uint8)\n: HST.Stack (packet_number_t' last pn_len)\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse (parse_packet_number last pn_len) (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> res == v\n | None -> False\n end\n ))", "source_definition": "let read_packet_number\n last pn_len b\n= let h = HST.get () in\n LP.parse_synth_eq (LP.lift_parser (parse_reduced_pn pn_len)) (synth_packet_number last pn_len) (Seq.seq_reveal (B.as_seq h b));\n let npn = read_bounded_integer pn_len b in\n expand_pn pn_len last npn", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 199, "start_col": 1, "end_line": 202, "end_col": 27 }, "file_context": "module QUIC.Impl.PacketNumber\nopen QUIC.Spec.PacketNumber\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule HST = FStar.HyperStack.ST\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule LP = LowParse.Spec\nmodule Seq = QUIC.Secret.Seq\n\nfriend QUIC.Spec.PacketNumber\nmodule Spec = QUIC.Spec.PacketNumber\n\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule E = LowParse.Endianness.BitFields\n\nlet be_to_n_4_eq\n (b: Seq.lseq U8.t 4)\n: Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 2) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 0)\n )))))))\n= assert_norm (pow2 8 == 256);\n E.reveal_be_to_n b;\n let b3 = Seq.slice b 0 3 in\n E.reveal_be_to_n b3;\n let b2 = Seq.slice b3 0 2 in\n E.reveal_be_to_n b2;\n let b1 = Seq.slice b2 0 1 in\n E.reveal_be_to_n b1;\n E.reveal_be_to_n (Seq.slice b1 0 0)\n\n#push-options \"--z3rlimit 64\"\n\nlet read_u32\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse LP.parse_u32 (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n= \n let h = HST.get () in\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n be_to_n_4_eq (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4);\n let b3 = B.index b 3ul in\n let b2 = B.index b 2ul in\n let b1 = B.index b 1ul in\n let b0 = B.index b 0ul in\n Secret.to_u32 b3 `Secret.add` (Secret.to_u32 256ul `Secret.mul` (\n Secret.to_u32 b2 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b1 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b0\n ))))))\n\n#pop-options\n\nmodule BF = LowParse.BitFields\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet read_bounded_integer\n (pn_len: packet_number_length_t)\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse (LP.parse_bounded_integer (Secret.v pn_len)) (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n=\n let h = HST.get () in\n LP.parse_bounded_integer_spec (Secret.v pn_len) (Seq.seq_reveal (B.as_seq h b));\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n E.bitfield_be_to_n_slice (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4) 0 (Secret.v pn_len);\n let x = read_u32 b in\n BF.get_bitfield_full #32 (Secret.v x);\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.get_bitfield x 24ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.get_bitfield x 16ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul`\nSecret.get_bitfield x 8ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` x)\n\n#pop-options\n\nmodule U = FStar.UInt\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet bound_npn\n (pn_len: packet_number_length_t)\n: Tot (x: packet_number_t { Secret.v x == bound_npn' (Secret.v pn_len - 1) })\n= let pn_len_1 = Secret.to_u64 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 0ul) `Secret.mul` Secret.to_u64 256uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 1ul) `Secret.mul` Secret.to_u64 65536uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 2ul) `Secret.mul` Secret.to_u64 16777216uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 3ul) `Secret.mul` Secret.to_u64 4294967296uL)\n\n#pop-options\n\ninline_for_extraction\nlet secret_bounded_integer (i: LP.integer_size) = (x: Secret.uint32 { LP.bounded_integer_prop i (U32.uint_to_t (Secret.v x)) })\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 2 --initial_ifuel 2 --z3rlimit 4096 --query_stats\"\n\nmodule U62 = QUIC.UInt62\nmodule Lemmas = QUIC.Spec.PacketNumber.Lemmas\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet expand_pn_aux\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: Secret.uint64 { Secret.v pn == expand_pn' (Secret.v pn_len - 1) (Secret.v last) (Secret.v npn) })\n= let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected : U62.secret = last `Secret.add` Secret.to_u64 1uL in\n let bound = bound_npn pn_len in\n let bound_2 = bound `Secret.shift_right` 1ul in\n FStar.UInt.shift_right_value_lemma #64 (Secret.v bound) 1;\n assert (Secret.v bound_2 == Secret.v bound / 2);\n let candidate = Lemmas.replace_modulo expected (8 `Prims.op_Multiply` Secret.v pn_len) (bound `Secret.sub` Secret.to_u64 1uL) (Secret.to_u64 npn) in\n Lemmas.lemma_replace_modulo_bound (Secret.v expected) (8*(Secret.v pn_len)) (Secret.v npn) 62;\n let bound_2_le_expected = bound_2 `Secret.secret_is_le_64` expected in\n let cond_1 =\n bound_2_le_expected `Secret.logand_one_bit`\n (candidate `Secret.secret_is_le_64` ((bound_2_le_expected `Secret.mul` expected) `Secret.sub` (bound_2_le_expected `Secret.mul` bound_2))) `Secret.logand_one_bit`\n (candidate `Secret.secret_is_lt_64` (Secret.to_u64 U62.bound `Secret.sub` bound))\n in\n assert (Secret.v cond_1 == (\n if\n Secret.v bound_2 <= Secret.v expected &&\n Secret.v candidate <= (Secret.v expected - Secret.v bound_2) &&\n Secret.v candidate < U62.v U62.bound - Secret.v bound\n then 1\n else 0\n ));\n let cond_2 =\n Secret.lognot_one_bit cond_1 `Secret.logand_one_bit`\n ((expected `Secret.add` bound_2) `Secret.secret_is_lt_64` candidate) `Secret.logand_one_bit`\n (bound `Secret.secret_is_le_64` candidate)\n in\n assert (Secret.v cond_2 == (\n if\n Secret.v cond_1 = 0 &&\n Secret.v expected + Secret.v bound_2 < Secret.v candidate &&\n Secret.v bound <= Secret.v candidate\n then 1\n else 0\n ));\n (candidate `Secret.add` (cond_1 `Secret.mul` bound)) `Secret.sub` (cond_2 `Secret.mul` bound)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n[@\"opaque_to_smt\"]\nlet expand_pn\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: packet_number_t { pn == synth_packet_number last pn_len (U32.uint_to_t (Secret.v npn)) })\n= expand_pn_aux pn_len last npn\n\n#pop-options\n\nlet read_packet_number", "dependencies": { "source_file": "QUIC.Impl.PacketNumber.fst", "checked_file": "QUIC.Impl.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.fst.checked", "LowParse.Endianness.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "E", "full_module": "LowParse.Endianness.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n b: LowStar.Buffer.buffer Lib.IntTypes.uint8\n -> FStar.HyperStack.ST.Stack (QUIC.Spec.PacketNumber.Base.packet_number_t' last pn_len)", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "QUIC.Impl.PacketNumber.expand_pn", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "Lib.IntTypes.int_t", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "QUIC.Impl.PacketNumber.read_bounded_integer", "Lib.IntTypes.uint32", "Prims.unit", "LowParse.Spec.Combinators.parse_synth_eq", "QUIC.Spec.PacketNumber.parse_packet_number_kind", "LowParse.Spec.BoundedInt.bounded_integer", "QUIC.Secret.Int.Base.v", "LowParse.Spec.Combinators.lift_parser", "QUIC.Spec.PacketNumber.parse_reduced_pn", "QUIC.Spec.PacketNumber.synth_packet_number", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.U8", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Buffer.trivial_preorder", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (b: B.buffer Secret.uint8)\n: HST.Stack (packet_number_t' last pn_len)\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse (parse_packet_number last pn_len) (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> res == v\n | None -> False\n end\n ))\nlet read_packet_number last pn_len b =", "completed_definiton": "let h = HST.get () in\nLP.parse_synth_eq (LP.lift_parser (parse_reduced_pn pn_len))\n (synth_packet_number last pn_len)\n (Seq.seq_reveal (B.as_seq h b));\nlet npn = read_bounded_integer pn_len b in\nexpand_pn pn_len last npn", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.PacketNumber.fst", "name": "QUIC.Impl.PacketNumber.serialize_u32_spec", "original_source_type": "val serialize_u32_spec (x: U32.t) : Lemma (LP.serialize LP.serialize_u32 x == E.n_to_be 4 (U32.v x))", "source_type": "val serialize_u32_spec (x: U32.t) : Lemma (LP.serialize LP.serialize_u32 x == E.n_to_be 4 (U32.v x))", "source_definition": "let serialize_u32_spec\n (x: U32.t)\n: Lemma\n (LP.serialize LP.serialize_u32 x == E.n_to_be 4 (U32.v x))\n= LP.parse_u32_spec (E.n_to_be 4 (U32.v x));\n LP.parse_injective LP.parse_u32 (LP.serialize LP.serialize_u32 x) (E.n_to_be 4 (U32.v x))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 224, "start_col": 2, "end_line": 225, "end_col": 91 }, "file_context": "module QUIC.Impl.PacketNumber\nopen QUIC.Spec.PacketNumber\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule HST = FStar.HyperStack.ST\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule LP = LowParse.Spec\nmodule Seq = QUIC.Secret.Seq\n\nfriend QUIC.Spec.PacketNumber\nmodule Spec = QUIC.Spec.PacketNumber\n\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule E = LowParse.Endianness.BitFields\n\nlet be_to_n_4_eq\n (b: Seq.lseq U8.t 4)\n: Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 2) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 0)\n )))))))\n= assert_norm (pow2 8 == 256);\n E.reveal_be_to_n b;\n let b3 = Seq.slice b 0 3 in\n E.reveal_be_to_n b3;\n let b2 = Seq.slice b3 0 2 in\n E.reveal_be_to_n b2;\n let b1 = Seq.slice b2 0 1 in\n E.reveal_be_to_n b1;\n E.reveal_be_to_n (Seq.slice b1 0 0)\n\n#push-options \"--z3rlimit 64\"\n\nlet read_u32\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse LP.parse_u32 (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n= \n let h = HST.get () in\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n be_to_n_4_eq (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4);\n let b3 = B.index b 3ul in\n let b2 = B.index b 2ul in\n let b1 = B.index b 1ul in\n let b0 = B.index b 0ul in\n Secret.to_u32 b3 `Secret.add` (Secret.to_u32 256ul `Secret.mul` (\n Secret.to_u32 b2 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b1 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b0\n ))))))\n\n#pop-options\n\nmodule BF = LowParse.BitFields\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet read_bounded_integer\n (pn_len: packet_number_length_t)\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse (LP.parse_bounded_integer (Secret.v pn_len)) (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n=\n let h = HST.get () in\n LP.parse_bounded_integer_spec (Secret.v pn_len) (Seq.seq_reveal (B.as_seq h b));\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n E.bitfield_be_to_n_slice (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4) 0 (Secret.v pn_len);\n let x = read_u32 b in\n BF.get_bitfield_full #32 (Secret.v x);\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.get_bitfield x 24ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.get_bitfield x 16ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul`\nSecret.get_bitfield x 8ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` x)\n\n#pop-options\n\nmodule U = FStar.UInt\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet bound_npn\n (pn_len: packet_number_length_t)\n: Tot (x: packet_number_t { Secret.v x == bound_npn' (Secret.v pn_len - 1) })\n= let pn_len_1 = Secret.to_u64 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 0ul) `Secret.mul` Secret.to_u64 256uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 1ul) `Secret.mul` Secret.to_u64 65536uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 2ul) `Secret.mul` Secret.to_u64 16777216uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 3ul) `Secret.mul` Secret.to_u64 4294967296uL)\n\n#pop-options\n\ninline_for_extraction\nlet secret_bounded_integer (i: LP.integer_size) = (x: Secret.uint32 { LP.bounded_integer_prop i (U32.uint_to_t (Secret.v x)) })\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 2 --initial_ifuel 2 --z3rlimit 4096 --query_stats\"\n\nmodule U62 = QUIC.UInt62\nmodule Lemmas = QUIC.Spec.PacketNumber.Lemmas\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet expand_pn_aux\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: Secret.uint64 { Secret.v pn == expand_pn' (Secret.v pn_len - 1) (Secret.v last) (Secret.v npn) })\n= let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected : U62.secret = last `Secret.add` Secret.to_u64 1uL in\n let bound = bound_npn pn_len in\n let bound_2 = bound `Secret.shift_right` 1ul in\n FStar.UInt.shift_right_value_lemma #64 (Secret.v bound) 1;\n assert (Secret.v bound_2 == Secret.v bound / 2);\n let candidate = Lemmas.replace_modulo expected (8 `Prims.op_Multiply` Secret.v pn_len) (bound `Secret.sub` Secret.to_u64 1uL) (Secret.to_u64 npn) in\n Lemmas.lemma_replace_modulo_bound (Secret.v expected) (8*(Secret.v pn_len)) (Secret.v npn) 62;\n let bound_2_le_expected = bound_2 `Secret.secret_is_le_64` expected in\n let cond_1 =\n bound_2_le_expected `Secret.logand_one_bit`\n (candidate `Secret.secret_is_le_64` ((bound_2_le_expected `Secret.mul` expected) `Secret.sub` (bound_2_le_expected `Secret.mul` bound_2))) `Secret.logand_one_bit`\n (candidate `Secret.secret_is_lt_64` (Secret.to_u64 U62.bound `Secret.sub` bound))\n in\n assert (Secret.v cond_1 == (\n if\n Secret.v bound_2 <= Secret.v expected &&\n Secret.v candidate <= (Secret.v expected - Secret.v bound_2) &&\n Secret.v candidate < U62.v U62.bound - Secret.v bound\n then 1\n else 0\n ));\n let cond_2 =\n Secret.lognot_one_bit cond_1 `Secret.logand_one_bit`\n ((expected `Secret.add` bound_2) `Secret.secret_is_lt_64` candidate) `Secret.logand_one_bit`\n (bound `Secret.secret_is_le_64` candidate)\n in\n assert (Secret.v cond_2 == (\n if\n Secret.v cond_1 = 0 &&\n Secret.v expected + Secret.v bound_2 < Secret.v candidate &&\n Secret.v bound <= Secret.v candidate\n then 1\n else 0\n ));\n (candidate `Secret.add` (cond_1 `Secret.mul` bound)) `Secret.sub` (cond_2 `Secret.mul` bound)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n[@\"opaque_to_smt\"]\nlet expand_pn\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: packet_number_t { pn == synth_packet_number last pn_len (U32.uint_to_t (Secret.v npn)) })\n= expand_pn_aux pn_len last npn\n\n#pop-options\n\nlet read_packet_number\n last pn_len b\n= let h = HST.get () in\n LP.parse_synth_eq (LP.lift_parser (parse_reduced_pn pn_len)) (synth_packet_number last pn_len) (Seq.seq_reveal (B.as_seq h b));\n let npn = read_bounded_integer pn_len b in\n expand_pn pn_len last npn\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet reduce_pn\n (pn_len: packet_number_length_t)\n (pn: packet_number_t)\n: Tot (b: secret_bounded_integer (Secret.v pn_len) { Secret.v b == reduce_pn' (Secret.v pn_len - 1) (Secret.v pn) })\n= let mask = bound_npn pn_len `Secret.sub` Secret.to_u64 1uL in\n Secret.logand_spec pn mask;\n Lemmas.logand_mask #64 (Secret.v pn) (8 `Prims.op_Multiply` Secret.v pn_len);\n Secret.to_u32 (pn `Secret.logand` mask)\n\n#pop-options\n\nlet serialize_u32_spec\n (x: U32.t)\n: Lemma", "dependencies": { "source_file": "QUIC.Impl.PacketNumber.fst", "checked_file": "QUIC.Impl.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.fst.checked", "LowParse.Endianness.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "E", "full_module": "LowParse.Endianness.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: FStar.UInt32.t\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Base.serialize LowParse.Spec.Int.serialize_u32 x ==\n FStar.Endianness.n_to_be 4 (FStar.UInt32.v x))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "LowParse.Spec.Base.parse_injective", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.Int.parse_u32", "LowParse.Spec.Base.serialize", "LowParse.Spec.Int.serialize_u32", "FStar.Endianness.n_to_be", "FStar.UInt32.v", "Prims.unit", "LowParse.Spec.Int.parse_u32_spec", "Prims.l_True", "Prims.squash", "Prims.eq2", "FStar.Seq.Base.seq", "FStar.UInt8.t", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_u32_spec (x: U32.t) : Lemma (LP.serialize LP.serialize_u32 x == E.n_to_be 4 (U32.v x))\nlet serialize_u32_spec (x: U32.t) : Lemma (LP.serialize LP.serialize_u32 x == E.n_to_be 4 (U32.v x)) =", "completed_definiton": "LP.parse_u32_spec (E.n_to_be 4 (U32.v x));\nLP.parse_injective LP.parse_u32 (LP.serialize LP.serialize_u32 x) (E.n_to_be 4 (U32.v x))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.PacketNumber.fst", "name": "QUIC.Impl.PacketNumber.expand_pn", "original_source_type": "val expand_pn\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n : Tot\n (pn: packet_number_t{pn == synth_packet_number last pn_len (U32.uint_to_t (Secret.v npn))})", "source_type": "val expand_pn\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n : Tot\n (pn: packet_number_t{pn == synth_packet_number last pn_len (U32.uint_to_t (Secret.v npn))})", "source_definition": "let expand_pn\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: packet_number_t { pn == synth_packet_number last pn_len (U32.uint_to_t (Secret.v npn)) })\n= expand_pn_aux pn_len last npn", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 193, "start_col": 2, "end_line": 193, "end_col": 31 }, "file_context": "module QUIC.Impl.PacketNumber\nopen QUIC.Spec.PacketNumber\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule HST = FStar.HyperStack.ST\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule LP = LowParse.Spec\nmodule Seq = QUIC.Secret.Seq\n\nfriend QUIC.Spec.PacketNumber\nmodule Spec = QUIC.Spec.PacketNumber\n\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule E = LowParse.Endianness.BitFields\n\nlet be_to_n_4_eq\n (b: Seq.lseq U8.t 4)\n: Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 2) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 0)\n )))))))\n= assert_norm (pow2 8 == 256);\n E.reveal_be_to_n b;\n let b3 = Seq.slice b 0 3 in\n E.reveal_be_to_n b3;\n let b2 = Seq.slice b3 0 2 in\n E.reveal_be_to_n b2;\n let b1 = Seq.slice b2 0 1 in\n E.reveal_be_to_n b1;\n E.reveal_be_to_n (Seq.slice b1 0 0)\n\n#push-options \"--z3rlimit 64\"\n\nlet read_u32\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse LP.parse_u32 (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n= \n let h = HST.get () in\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n be_to_n_4_eq (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4);\n let b3 = B.index b 3ul in\n let b2 = B.index b 2ul in\n let b1 = B.index b 1ul in\n let b0 = B.index b 0ul in\n Secret.to_u32 b3 `Secret.add` (Secret.to_u32 256ul `Secret.mul` (\n Secret.to_u32 b2 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b1 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b0\n ))))))\n\n#pop-options\n\nmodule BF = LowParse.BitFields\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet read_bounded_integer\n (pn_len: packet_number_length_t)\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse (LP.parse_bounded_integer (Secret.v pn_len)) (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n=\n let h = HST.get () in\n LP.parse_bounded_integer_spec (Secret.v pn_len) (Seq.seq_reveal (B.as_seq h b));\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n E.bitfield_be_to_n_slice (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4) 0 (Secret.v pn_len);\n let x = read_u32 b in\n BF.get_bitfield_full #32 (Secret.v x);\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.get_bitfield x 24ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.get_bitfield x 16ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul`\nSecret.get_bitfield x 8ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` x)\n\n#pop-options\n\nmodule U = FStar.UInt\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet bound_npn\n (pn_len: packet_number_length_t)\n: Tot (x: packet_number_t { Secret.v x == bound_npn' (Secret.v pn_len - 1) })\n= let pn_len_1 = Secret.to_u64 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 0ul) `Secret.mul` Secret.to_u64 256uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 1ul) `Secret.mul` Secret.to_u64 65536uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 2ul) `Secret.mul` Secret.to_u64 16777216uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 3ul) `Secret.mul` Secret.to_u64 4294967296uL)\n\n#pop-options\n\ninline_for_extraction\nlet secret_bounded_integer (i: LP.integer_size) = (x: Secret.uint32 { LP.bounded_integer_prop i (U32.uint_to_t (Secret.v x)) })\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 2 --initial_ifuel 2 --z3rlimit 4096 --query_stats\"\n\nmodule U62 = QUIC.UInt62\nmodule Lemmas = QUIC.Spec.PacketNumber.Lemmas\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet expand_pn_aux\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: Secret.uint64 { Secret.v pn == expand_pn' (Secret.v pn_len - 1) (Secret.v last) (Secret.v npn) })\n= let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected : U62.secret = last `Secret.add` Secret.to_u64 1uL in\n let bound = bound_npn pn_len in\n let bound_2 = bound `Secret.shift_right` 1ul in\n FStar.UInt.shift_right_value_lemma #64 (Secret.v bound) 1;\n assert (Secret.v bound_2 == Secret.v bound / 2);\n let candidate = Lemmas.replace_modulo expected (8 `Prims.op_Multiply` Secret.v pn_len) (bound `Secret.sub` Secret.to_u64 1uL) (Secret.to_u64 npn) in\n Lemmas.lemma_replace_modulo_bound (Secret.v expected) (8*(Secret.v pn_len)) (Secret.v npn) 62;\n let bound_2_le_expected = bound_2 `Secret.secret_is_le_64` expected in\n let cond_1 =\n bound_2_le_expected `Secret.logand_one_bit`\n (candidate `Secret.secret_is_le_64` ((bound_2_le_expected `Secret.mul` expected) `Secret.sub` (bound_2_le_expected `Secret.mul` bound_2))) `Secret.logand_one_bit`\n (candidate `Secret.secret_is_lt_64` (Secret.to_u64 U62.bound `Secret.sub` bound))\n in\n assert (Secret.v cond_1 == (\n if\n Secret.v bound_2 <= Secret.v expected &&\n Secret.v candidate <= (Secret.v expected - Secret.v bound_2) &&\n Secret.v candidate < U62.v U62.bound - Secret.v bound\n then 1\n else 0\n ));\n let cond_2 =\n Secret.lognot_one_bit cond_1 `Secret.logand_one_bit`\n ((expected `Secret.add` bound_2) `Secret.secret_is_lt_64` candidate) `Secret.logand_one_bit`\n (bound `Secret.secret_is_le_64` candidate)\n in\n assert (Secret.v cond_2 == (\n if\n Secret.v cond_1 = 0 &&\n Secret.v expected + Secret.v bound_2 < Secret.v candidate &&\n Secret.v bound <= Secret.v candidate\n then 1\n else 0\n ));\n (candidate `Secret.add` (cond_1 `Secret.mul` bound)) `Secret.sub` (cond_2 `Secret.mul` bound)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n[@\"opaque_to_smt\"]\nlet expand_pn\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))", "dependencies": { "source_file": "QUIC.Impl.PacketNumber.fst", "checked_file": "QUIC.Impl.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.fst.checked", "LowParse.Endianness.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "E", "full_module": "LowParse.Endianness.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n npn: QUIC.Impl.PacketNumber.secret_bounded_integer (QUIC.Secret.Int.Base.v pn_len)\n -> pn:\n QUIC.Spec.PacketNumber.Base.packet_number_t\n { pn ==\n QUIC.Spec.PacketNumber.synth_packet_number last\n pn_len\n (FStar.UInt32.uint_to_t (QUIC.Secret.Int.Base.v npn)) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Impl.PacketNumber.secret_bounded_integer", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "QUIC.Impl.PacketNumber.expand_pn_aux", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Prims.eq2", "QUIC.Spec.PacketNumber.synth_packet_number", "FStar.UInt32.uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val expand_pn\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n : Tot\n (pn: packet_number_t{pn == synth_packet_number last pn_len (U32.uint_to_t (Secret.v npn))})\nlet expand_pn\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n : Tot\n (pn: packet_number_t{pn == synth_packet_number last pn_len (U32.uint_to_t (Secret.v npn))}) =", "completed_definiton": "expand_pn_aux pn_len last npn", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.PacketNumber.fst", "name": "QUIC.Impl.PacketNumber.write_bounded_integer", "original_source_type": "val write_bounded_integer\n (pn_len: packet_number_length_t)\n (x: secret_bounded_integer (Secret.v pn_len))\n (b: B.buffer Secret.uint8)\n : HST.Stack unit\n (requires (fun h -> B.live h b /\\ 4 <= B.length b))\n (ensures\n (fun h _ h' ->\n let b' = B.gsub b 0ul (U32.uint_to_t (Secret.v pn_len)) in\n B.modifies (B.loc_buffer b') h h' /\\\n (Seq.seq_reveal (B.as_seq h' b'))\n `Seq.equal`\n (LP.serialize (LP.serialize_bounded_integer (Secret.v pn_len))\n (U32.uint_to_t (Secret.v x)))))", "source_type": "val write_bounded_integer\n (pn_len: packet_number_length_t)\n (x: secret_bounded_integer (Secret.v pn_len))\n (b: B.buffer Secret.uint8)\n : HST.Stack unit\n (requires (fun h -> B.live h b /\\ 4 <= B.length b))\n (ensures\n (fun h _ h' ->\n let b' = B.gsub b 0ul (U32.uint_to_t (Secret.v pn_len)) in\n B.modifies (B.loc_buffer b') h h' /\\\n (Seq.seq_reveal (B.as_seq h' b'))\n `Seq.equal`\n (LP.serialize (LP.serialize_bounded_integer (Secret.v pn_len))\n (U32.uint_to_t (Secret.v x)))))", "source_definition": "let write_bounded_integer\n (pn_len: packet_number_length_t)\n (x: secret_bounded_integer (Secret.v pn_len))\n (b: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h _ h' ->\n let b' = B.gsub b 0ul (U32.uint_to_t (Secret.v pn_len)) in\n B.modifies (B.loc_buffer b') h h' /\\\n Seq.seq_reveal (B.as_seq h' b') `Seq.equal` LP.serialize (LP.serialize_bounded_integer (Secret.v pn_len)) (U32.uint_to_t (Secret.v x))\n ))\n= \n let h = HST.get () in\n let b' = B.sub b 0ul 4ul in\n let before = read_u32 b' in\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b'));\n LP.bounded_integer_prop_equiv (Secret.v pn_len) (U32.uint_to_t (Secret.v x));\n let after = set_left_bitfield pn_len before x in\n write_u32 after b';\n serialize_u32_spec (U32.uint_to_t (Secret.v after));\n LP.serialize_bounded_integer_spec (Secret.v pn_len) (U32.uint_to_t (Secret.v x));\n set_left_bitfield_left pn_len before x;\n set_left_bitfield_right pn_len before x;\n let h' = HST.get () in\n assert (Seq.slice (Seq.seq_reveal (B.as_seq h' b')) (Secret.v pn_len) 4 `Seq.equal` Seq.slice (Seq.seq_reveal (B.as_seq h b')) (Secret.v pn_len) 4);\n assert (Seq.seq_reveal (Seq.slice (B.as_seq h' b') (Secret.v pn_len) 4) `Seq.equal` Seq.slice (Seq.seq_reveal (B.as_seq h' b')) (Secret.v pn_len) 4);\n assert (Seq.seq_reveal (Seq.slice (B.as_seq h b') (Secret.v pn_len) 4) `Seq.equal` Seq.slice (Seq.seq_reveal (B.as_seq h b')) (Secret.v pn_len) 4);\n Seq.seq_reveal_inj (Seq.slice (B.as_seq h' b') (Secret.v pn_len) 4) (Seq.slice (B.as_seq h b') (Secret.v pn_len) 4);\n B.modifies_loc_buffer_from_to_intro b' 0ul (U32.uint_to_t (Secret.v pn_len)) B.loc_none h h'", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 389, "start_col": 1, "end_line": 406, "end_col": 94 }, "file_context": "module QUIC.Impl.PacketNumber\nopen QUIC.Spec.PacketNumber\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule HST = FStar.HyperStack.ST\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule LP = LowParse.Spec\nmodule Seq = QUIC.Secret.Seq\n\nfriend QUIC.Spec.PacketNumber\nmodule Spec = QUIC.Spec.PacketNumber\n\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule E = LowParse.Endianness.BitFields\n\nlet be_to_n_4_eq\n (b: Seq.lseq U8.t 4)\n: Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 2) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 0)\n )))))))\n= assert_norm (pow2 8 == 256);\n E.reveal_be_to_n b;\n let b3 = Seq.slice b 0 3 in\n E.reveal_be_to_n b3;\n let b2 = Seq.slice b3 0 2 in\n E.reveal_be_to_n b2;\n let b1 = Seq.slice b2 0 1 in\n E.reveal_be_to_n b1;\n E.reveal_be_to_n (Seq.slice b1 0 0)\n\n#push-options \"--z3rlimit 64\"\n\nlet read_u32\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse LP.parse_u32 (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n= \n let h = HST.get () in\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n be_to_n_4_eq (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4);\n let b3 = B.index b 3ul in\n let b2 = B.index b 2ul in\n let b1 = B.index b 1ul in\n let b0 = B.index b 0ul in\n Secret.to_u32 b3 `Secret.add` (Secret.to_u32 256ul `Secret.mul` (\n Secret.to_u32 b2 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b1 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b0\n ))))))\n\n#pop-options\n\nmodule BF = LowParse.BitFields\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet read_bounded_integer\n (pn_len: packet_number_length_t)\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse (LP.parse_bounded_integer (Secret.v pn_len)) (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n=\n let h = HST.get () in\n LP.parse_bounded_integer_spec (Secret.v pn_len) (Seq.seq_reveal (B.as_seq h b));\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n E.bitfield_be_to_n_slice (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4) 0 (Secret.v pn_len);\n let x = read_u32 b in\n BF.get_bitfield_full #32 (Secret.v x);\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.get_bitfield x 24ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.get_bitfield x 16ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul`\nSecret.get_bitfield x 8ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` x)\n\n#pop-options\n\nmodule U = FStar.UInt\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet bound_npn\n (pn_len: packet_number_length_t)\n: Tot (x: packet_number_t { Secret.v x == bound_npn' (Secret.v pn_len - 1) })\n= let pn_len_1 = Secret.to_u64 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 0ul) `Secret.mul` Secret.to_u64 256uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 1ul) `Secret.mul` Secret.to_u64 65536uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 2ul) `Secret.mul` Secret.to_u64 16777216uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 3ul) `Secret.mul` Secret.to_u64 4294967296uL)\n\n#pop-options\n\ninline_for_extraction\nlet secret_bounded_integer (i: LP.integer_size) = (x: Secret.uint32 { LP.bounded_integer_prop i (U32.uint_to_t (Secret.v x)) })\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 2 --initial_ifuel 2 --z3rlimit 4096 --query_stats\"\n\nmodule U62 = QUIC.UInt62\nmodule Lemmas = QUIC.Spec.PacketNumber.Lemmas\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet expand_pn_aux\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: Secret.uint64 { Secret.v pn == expand_pn' (Secret.v pn_len - 1) (Secret.v last) (Secret.v npn) })\n= let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected : U62.secret = last `Secret.add` Secret.to_u64 1uL in\n let bound = bound_npn pn_len in\n let bound_2 = bound `Secret.shift_right` 1ul in\n FStar.UInt.shift_right_value_lemma #64 (Secret.v bound) 1;\n assert (Secret.v bound_2 == Secret.v bound / 2);\n let candidate = Lemmas.replace_modulo expected (8 `Prims.op_Multiply` Secret.v pn_len) (bound `Secret.sub` Secret.to_u64 1uL) (Secret.to_u64 npn) in\n Lemmas.lemma_replace_modulo_bound (Secret.v expected) (8*(Secret.v pn_len)) (Secret.v npn) 62;\n let bound_2_le_expected = bound_2 `Secret.secret_is_le_64` expected in\n let cond_1 =\n bound_2_le_expected `Secret.logand_one_bit`\n (candidate `Secret.secret_is_le_64` ((bound_2_le_expected `Secret.mul` expected) `Secret.sub` (bound_2_le_expected `Secret.mul` bound_2))) `Secret.logand_one_bit`\n (candidate `Secret.secret_is_lt_64` (Secret.to_u64 U62.bound `Secret.sub` bound))\n in\n assert (Secret.v cond_1 == (\n if\n Secret.v bound_2 <= Secret.v expected &&\n Secret.v candidate <= (Secret.v expected - Secret.v bound_2) &&\n Secret.v candidate < U62.v U62.bound - Secret.v bound\n then 1\n else 0\n ));\n let cond_2 =\n Secret.lognot_one_bit cond_1 `Secret.logand_one_bit`\n ((expected `Secret.add` bound_2) `Secret.secret_is_lt_64` candidate) `Secret.logand_one_bit`\n (bound `Secret.secret_is_le_64` candidate)\n in\n assert (Secret.v cond_2 == (\n if\n Secret.v cond_1 = 0 &&\n Secret.v expected + Secret.v bound_2 < Secret.v candidate &&\n Secret.v bound <= Secret.v candidate\n then 1\n else 0\n ));\n (candidate `Secret.add` (cond_1 `Secret.mul` bound)) `Secret.sub` (cond_2 `Secret.mul` bound)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n[@\"opaque_to_smt\"]\nlet expand_pn\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: packet_number_t { pn == synth_packet_number last pn_len (U32.uint_to_t (Secret.v npn)) })\n= expand_pn_aux pn_len last npn\n\n#pop-options\n\nlet read_packet_number\n last pn_len b\n= let h = HST.get () in\n LP.parse_synth_eq (LP.lift_parser (parse_reduced_pn pn_len)) (synth_packet_number last pn_len) (Seq.seq_reveal (B.as_seq h b));\n let npn = read_bounded_integer pn_len b in\n expand_pn pn_len last npn\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet reduce_pn\n (pn_len: packet_number_length_t)\n (pn: packet_number_t)\n: Tot (b: secret_bounded_integer (Secret.v pn_len) { Secret.v b == reduce_pn' (Secret.v pn_len - 1) (Secret.v pn) })\n= let mask = bound_npn pn_len `Secret.sub` Secret.to_u64 1uL in\n Secret.logand_spec pn mask;\n Lemmas.logand_mask #64 (Secret.v pn) (8 `Prims.op_Multiply` Secret.v pn_len);\n Secret.to_u32 (pn `Secret.logand` mask)\n\n#pop-options\n\nlet serialize_u32_spec\n (x: U32.t)\n: Lemma\n (LP.serialize LP.serialize_u32 x == E.n_to_be 4 (U32.v x))\n= LP.parse_u32_spec (E.n_to_be 4 (U32.v x));\n LP.parse_injective LP.parse_u32 (LP.serialize LP.serialize_u32 x) (E.n_to_be 4 (U32.v x))\n\n#push-options \"--z3rlimit 16\"\n\nlet write_u32\n (x: Secret.uint32)\n (b: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h _ h' ->\n let b' = B.gsub b 0ul 4ul in\n B.modifies (B.loc_buffer b') h h' /\\\n Seq.seq_reveal (B.as_seq h' b') `Seq.equal` LP.serialize (LP.serialize_u32) (U32.uint_to_t (Secret.v x))\n ))\n= serialize_u32_spec (U32.uint_to_t (Secret.v x));\n E.index_n_to_be 4 (Secret.v x) 0;\n E.index_n_to_be 4 (Secret.v x) 1;\n E.index_n_to_be 4 (Secret.v x) 2;\n E.index_n_to_be 4 (Secret.v x) 3;\n let b' = B.sub b 0ul 4ul in\n B.upd b' 0ul (Secret.to_u8 (x `Secret.shift_right` 24ul));\n B.upd b' 1ul (Secret.to_u8 (x `Secret.shift_right` 16ul));\n B.upd b' 2ul (Secret.to_u8 (x `Secret.shift_right` 8ul));\n B.upd b' 3ul (Secret.to_u8 x)\n\n#pop-options\n\n#push-options \"--z3rlimit 256\"\n\n#restart-solver\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nlet set_left_bitfield_arg\n (pn_len: packet_number_length_t)\n (pn_len' : U32.t { 1 <= U32.v pn_len' /\\ U32.v pn_len' <= 4 } )\n (x: Secret.uint32 {\n Secret.v pn_len == U32.v pn_len' ==> LP.bounded_integer_prop (Secret.v pn_len) (U32.uint_to_t (Secret.v x))\n })\n (mask: Secret.uint32 { Secret.v mask == pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) - 1 })\n: Tot (y: secret_bounded_integer (U32.v pn_len') {\n Secret.v pn_len == U32.v pn_len' ==> Secret.v y == Secret.v x\n })\n=\n let f () : Lemma\n (requires (Secret.v pn_len == U32.v pn_len'))\n (ensures (\n Secret.v pn_len == U32.v pn_len' /\\\n Secret.v x % pow2 (8 `Prims.op_Multiply` U32.v pn_len' ) == Secret.v x\n ))\n = LP.bounded_integer_prop_equiv (Secret.v pn_len) (U32.uint_to_t (Secret.v x));\n FStar.Math.Lemmas.small_mod (Secret.v x) (pow2 (8 `Prims.op_Multiply` U32.v pn_len'))\n in\n let g () : Lemma\n (Secret.v pn_len == U32.v pn_len' ==>\n Secret.v x % pow2 (8 `Prims.op_Multiply` U32.v pn_len' ) == Secret.v x\n )\n = Classical.move_requires f ()\n in\n g ();\n Lemmas.logand_mask #32 (Secret.v x) (8 `Prims.op_Multiply` U32.v pn_len');\n [@inline_let]\n let y = x `Secret.logand` mask in\n assert (Secret.v y == U.logand #32 (Secret.v x) (Secret.v mask));\n y\n\n#pop-options\n\n#push-options \"--z3rlimit 256\"\n\n#restart-solver\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nval set_left_bitfield_aux\n (pn_len: packet_number_length_t)\n (pn_len' : U32.t { 1 <= U32.v pn_len' /\\ U32.v pn_len' <= 4 } )\n (before: Secret.uint32)\n (x: Secret.uint32 {\n Secret.v pn_len == U32.v pn_len' ==> LP.bounded_integer_prop (Secret.v pn_len) (U32.uint_to_t (Secret.v x))\n })\n (mask: Secret.uint32 { Secret.v mask == pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) - 1 })\n: Tot (after: Secret.uint32 { Secret.v after == (if Secret.v pn_len = U32.v pn_len' then \nBF.set_bitfield #32 (Secret.v before) (8 `Prims.op_Multiply` (4 - Secret.v pn_len)) 32 (Secret.v x <: nat) else 0) })\n\nlet set_left_bitfield_aux\n pn_len pn_len' before x mask\n= \n [@inline_let]\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n (pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 (pn_len' `U32.sub` 1ul)) `Secret.mul` Secret.set_bitfield before (8ul `U32.mul` (4ul `U32.sub` pn_len')) 32ul (set_left_bitfield_arg pn_len pn_len' x mask)\n\n#pop-options\n\n#push-options \"--z3rlimit 128\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet set_left_bitfield\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n: Tot (after: Secret.uint32 { Secret.v after = BF.set_bitfield #32 (Secret.v before) (8 `Prims.op_Multiply` (4 - Secret.v pn_len)) 32 (Secret.v x) })\n=\n BF.set_bitfield_full #32 (Secret.v before) (Secret.v x);\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 16 == 65536);\n assert_norm (pow2 24 == 16777216);\n [@inline_let]\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n set_left_bitfield_aux pn_len 1ul before x (Secret.to_u32 255ul) `Secret.add`\n set_left_bitfield_aux pn_len 2ul before x (Secret.to_u32 65535ul) `Secret.add`\n set_left_bitfield_aux pn_len 3ul before x (Secret.to_u32 16777215ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` x)\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\n#restart-solver\n\nlet set_left_bitfield_left\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n: Lemma\n (Seq.slice (E.n_to_be 4 (Secret.v (set_left_bitfield pn_len before x))) 0 (Secret.v pn_len) == E.n_to_be (Secret.v pn_len) (Secret.v x))\n=\n E.slice_n_to_be_bitfield 4 (Secret.v (set_left_bitfield pn_len before x)) 0 (Secret.v pn_len);\n BF.get_bitfield_set_bitfield_same #32 (Secret.v before) (8 `op_Multiply` (4 - Secret.v pn_len)) 32 (Secret.v x)\n\nlet set_left_bitfield_right\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n: Lemma\n (Seq.slice (E.n_to_be 4 (Secret.v (set_left_bitfield pn_len before x))) (Secret.v pn_len) 4 == Seq.slice (E.n_to_be 4 (Secret.v before)) (Secret.v pn_len) 4)\n= \n E.slice_n_to_be_bitfield 4 (Secret.v (set_left_bitfield pn_len before x)) (Secret.v pn_len) 4;\n E.slice_n_to_be_bitfield 4 (Secret.v before) (Secret.v pn_len) 4;\n BF.get_bitfield_set_bitfield_other #32 (Secret.v before) (8 `op_Multiply` (4 - Secret.v pn_len)) 32 (Secret.v x) 0 (8 `op_Multiply` (4 - Secret.v pn_len))\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\nlet write_bounded_integer\n (pn_len: packet_number_length_t)\n (x: secret_bounded_integer (Secret.v pn_len))\n (b: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h _ h' ->\n let b' = B.gsub b 0ul (U32.uint_to_t (Secret.v pn_len)) in\n B.modifies (B.loc_buffer b') h h' /\\\n Seq.seq_reveal (B.as_seq h' b') `Seq.equal` LP.serialize (LP.serialize_bounded_integer (Secret.v pn_len)) (U32.uint_to_t (Secret.v x))", "dependencies": { "source_file": "QUIC.Impl.PacketNumber.fst", "checked_file": "QUIC.Impl.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.fst.checked", "LowParse.Endianness.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "E", "full_module": "LowParse.Endianness.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n x: QUIC.Impl.PacketNumber.secret_bounded_integer (QUIC.Secret.Int.Base.v pn_len) ->\n b: LowStar.Buffer.buffer Lib.IntTypes.uint8\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Impl.PacketNumber.secret_bounded_integer", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "LowStar.Monotonic.Buffer.modifies_loc_buffer_from_to_intro", "LowStar.Buffer.trivial_preorder", "FStar.UInt32.__uint_to_t", "FStar.UInt32.uint_to_t", "LowStar.Monotonic.Buffer.loc_none", "Prims.unit", "QUIC.Secret.Seq.seq_reveal_inj", "Lib.IntTypes.U8", "FStar.Seq.Base.slice", "LowStar.Monotonic.Buffer.as_seq", "Prims._assert", "FStar.Seq.Base.equal", "Lib.IntTypes.uint_t", "Lib.IntTypes.PUB", "QUIC.Secret.Seq.seq_reveal", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "QUIC.Impl.PacketNumber.set_left_bitfield_right", "QUIC.Impl.PacketNumber.set_left_bitfield_left", "LowParse.Spec.BoundedInt.serialize_bounded_integer_spec", "QUIC.Impl.PacketNumber.serialize_u32_spec", "QUIC.Impl.PacketNumber.write_u32", "Lib.IntTypes.int_t", "Prims.b2t", "Prims.op_Equality", "Prims.int", "Prims.l_or", "Lib.IntTypes.range", "FStar.UInt.size", "Lib.IntTypes.v", "LowParse.BitFields.set_bitfield", "Prims.op_Multiply", "Prims.op_Subtraction", "QUIC.Impl.PacketNumber.set_left_bitfield", "LowParse.Spec.BoundedInt.bounded_integer_prop_equiv", "LowParse.Spec.Int.parse_u32_spec", "QUIC.Impl.PacketNumber.read_u32", "Lib.IntTypes.uint32", "LowStar.Monotonic.Buffer.mbuffer", "LowStar.Buffer.sub", "FStar.Ghost.hide", "FStar.UInt32.t", "Prims.l_and", "LowStar.Monotonic.Buffer.live", "Prims.op_LessThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_buffer", "LowParse.Spec.Base.serialize", "LowParse.Spec.BoundedInt.parse_bounded_integer_kind", "LowParse.Spec.BoundedInt.bounded_integer", "LowParse.Spec.BoundedInt.parse_bounded_integer", "LowParse.Spec.BoundedInt.serialize_bounded_integer", "LowStar.Buffer.gsub" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val write_bounded_integer\n (pn_len: packet_number_length_t)\n (x: secret_bounded_integer (Secret.v pn_len))\n (b: B.buffer Secret.uint8)\n : HST.Stack unit\n (requires (fun h -> B.live h b /\\ 4 <= B.length b))\n (ensures\n (fun h _ h' ->\n let b' = B.gsub b 0ul (U32.uint_to_t (Secret.v pn_len)) in\n B.modifies (B.loc_buffer b') h h' /\\\n (Seq.seq_reveal (B.as_seq h' b'))\n `Seq.equal`\n (LP.serialize (LP.serialize_bounded_integer (Secret.v pn_len))\n (U32.uint_to_t (Secret.v x)))))\nlet write_bounded_integer\n (pn_len: packet_number_length_t)\n (x: secret_bounded_integer (Secret.v pn_len))\n (b: B.buffer Secret.uint8)\n : HST.Stack unit\n (requires (fun h -> B.live h b /\\ 4 <= B.length b))\n (ensures\n (fun h _ h' ->\n let b' = B.gsub b 0ul (U32.uint_to_t (Secret.v pn_len)) in\n B.modifies (B.loc_buffer b') h h' /\\\n (Seq.seq_reveal (B.as_seq h' b'))\n `Seq.equal`\n (LP.serialize (LP.serialize_bounded_integer (Secret.v pn_len))\n (U32.uint_to_t (Secret.v x))))) =", "completed_definiton": "let h = HST.get () in\nlet b' = B.sub b 0ul 4ul in\nlet before = read_u32 b' in\nLP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b'));\nLP.bounded_integer_prop_equiv (Secret.v pn_len) (U32.uint_to_t (Secret.v x));\nlet after = set_left_bitfield pn_len before x in\nwrite_u32 after b';\nserialize_u32_spec (U32.uint_to_t (Secret.v after));\nLP.serialize_bounded_integer_spec (Secret.v pn_len) (U32.uint_to_t (Secret.v x));\nset_left_bitfield_left pn_len before x;\nset_left_bitfield_right pn_len before x;\nlet h' = HST.get () in\nassert ((Seq.slice (Seq.seq_reveal (B.as_seq h' b')) (Secret.v pn_len) 4)\n `Seq.equal`\n (Seq.slice (Seq.seq_reveal (B.as_seq h b')) (Secret.v pn_len) 4));\nassert ((Seq.seq_reveal (Seq.slice (B.as_seq h' b') (Secret.v pn_len) 4))\n `Seq.equal`\n (Seq.slice (Seq.seq_reveal (B.as_seq h' b')) (Secret.v pn_len) 4));\nassert ((Seq.seq_reveal (Seq.slice (B.as_seq h b') (Secret.v pn_len) 4))\n `Seq.equal`\n (Seq.slice (Seq.seq_reveal (B.as_seq h b')) (Secret.v pn_len) 4));\nSeq.seq_reveal_inj (Seq.slice (B.as_seq h' b') (Secret.v pn_len) 4)\n (Seq.slice (B.as_seq h b') (Secret.v pn_len) 4);\nB.modifies_loc_buffer_from_to_intro b' 0ul (U32.uint_to_t (Secret.v pn_len)) B.loc_none h h'", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.PacketNumber.fst", "name": "QUIC.Impl.PacketNumber.write_u32", "original_source_type": "val write_u32 (x: Secret.uint32) (b: B.buffer Secret.uint8)\n : HST.Stack unit\n (requires (fun h -> B.live h b /\\ 4 <= B.length b))\n (ensures\n (fun h _ h' ->\n let b' = B.gsub b 0ul 4ul in\n B.modifies (B.loc_buffer b') h h' /\\\n (Seq.seq_reveal (B.as_seq h' b'))\n `Seq.equal`\n (LP.serialize (LP.serialize_u32) (U32.uint_to_t (Secret.v x)))))", "source_type": "val write_u32 (x: Secret.uint32) (b: B.buffer Secret.uint8)\n : HST.Stack unit\n (requires (fun h -> B.live h b /\\ 4 <= B.length b))\n (ensures\n (fun h _ h' ->\n let b' = B.gsub b 0ul 4ul in\n B.modifies (B.loc_buffer b') h h' /\\\n (Seq.seq_reveal (B.as_seq h' b'))\n `Seq.equal`\n (LP.serialize (LP.serialize_u32) (U32.uint_to_t (Secret.v x)))))", "source_definition": "let write_u32\n (x: Secret.uint32)\n (b: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h _ h' ->\n let b' = B.gsub b 0ul 4ul in\n B.modifies (B.loc_buffer b') h h' /\\\n Seq.seq_reveal (B.as_seq h' b') `Seq.equal` LP.serialize (LP.serialize_u32) (U32.uint_to_t (Secret.v x))\n ))\n= serialize_u32_spec (U32.uint_to_t (Secret.v x));\n E.index_n_to_be 4 (Secret.v x) 0;\n E.index_n_to_be 4 (Secret.v x) 1;\n E.index_n_to_be 4 (Secret.v x) 2;\n E.index_n_to_be 4 (Secret.v x) 3;\n let b' = B.sub b 0ul 4ul in\n B.upd b' 0ul (Secret.to_u8 (x `Secret.shift_right` 24ul));\n B.upd b' 1ul (Secret.to_u8 (x `Secret.shift_right` 16ul));\n B.upd b' 2ul (Secret.to_u8 (x `Secret.shift_right` 8ul));\n B.upd b' 3ul (Secret.to_u8 x)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 242, "start_col": 2, "end_line": 251, "end_col": 31 }, "file_context": "module QUIC.Impl.PacketNumber\nopen QUIC.Spec.PacketNumber\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule HST = FStar.HyperStack.ST\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule LP = LowParse.Spec\nmodule Seq = QUIC.Secret.Seq\n\nfriend QUIC.Spec.PacketNumber\nmodule Spec = QUIC.Spec.PacketNumber\n\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule E = LowParse.Endianness.BitFields\n\nlet be_to_n_4_eq\n (b: Seq.lseq U8.t 4)\n: Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 2) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 0)\n )))))))\n= assert_norm (pow2 8 == 256);\n E.reveal_be_to_n b;\n let b3 = Seq.slice b 0 3 in\n E.reveal_be_to_n b3;\n let b2 = Seq.slice b3 0 2 in\n E.reveal_be_to_n b2;\n let b1 = Seq.slice b2 0 1 in\n E.reveal_be_to_n b1;\n E.reveal_be_to_n (Seq.slice b1 0 0)\n\n#push-options \"--z3rlimit 64\"\n\nlet read_u32\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse LP.parse_u32 (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n= \n let h = HST.get () in\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n be_to_n_4_eq (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4);\n let b3 = B.index b 3ul in\n let b2 = B.index b 2ul in\n let b1 = B.index b 1ul in\n let b0 = B.index b 0ul in\n Secret.to_u32 b3 `Secret.add` (Secret.to_u32 256ul `Secret.mul` (\n Secret.to_u32 b2 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b1 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b0\n ))))))\n\n#pop-options\n\nmodule BF = LowParse.BitFields\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet read_bounded_integer\n (pn_len: packet_number_length_t)\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse (LP.parse_bounded_integer (Secret.v pn_len)) (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n=\n let h = HST.get () in\n LP.parse_bounded_integer_spec (Secret.v pn_len) (Seq.seq_reveal (B.as_seq h b));\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n E.bitfield_be_to_n_slice (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4) 0 (Secret.v pn_len);\n let x = read_u32 b in\n BF.get_bitfield_full #32 (Secret.v x);\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.get_bitfield x 24ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.get_bitfield x 16ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul`\nSecret.get_bitfield x 8ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` x)\n\n#pop-options\n\nmodule U = FStar.UInt\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet bound_npn\n (pn_len: packet_number_length_t)\n: Tot (x: packet_number_t { Secret.v x == bound_npn' (Secret.v pn_len - 1) })\n= let pn_len_1 = Secret.to_u64 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 0ul) `Secret.mul` Secret.to_u64 256uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 1ul) `Secret.mul` Secret.to_u64 65536uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 2ul) `Secret.mul` Secret.to_u64 16777216uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 3ul) `Secret.mul` Secret.to_u64 4294967296uL)\n\n#pop-options\n\ninline_for_extraction\nlet secret_bounded_integer (i: LP.integer_size) = (x: Secret.uint32 { LP.bounded_integer_prop i (U32.uint_to_t (Secret.v x)) })\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 2 --initial_ifuel 2 --z3rlimit 4096 --query_stats\"\n\nmodule U62 = QUIC.UInt62\nmodule Lemmas = QUIC.Spec.PacketNumber.Lemmas\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet expand_pn_aux\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: Secret.uint64 { Secret.v pn == expand_pn' (Secret.v pn_len - 1) (Secret.v last) (Secret.v npn) })\n= let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected : U62.secret = last `Secret.add` Secret.to_u64 1uL in\n let bound = bound_npn pn_len in\n let bound_2 = bound `Secret.shift_right` 1ul in\n FStar.UInt.shift_right_value_lemma #64 (Secret.v bound) 1;\n assert (Secret.v bound_2 == Secret.v bound / 2);\n let candidate = Lemmas.replace_modulo expected (8 `Prims.op_Multiply` Secret.v pn_len) (bound `Secret.sub` Secret.to_u64 1uL) (Secret.to_u64 npn) in\n Lemmas.lemma_replace_modulo_bound (Secret.v expected) (8*(Secret.v pn_len)) (Secret.v npn) 62;\n let bound_2_le_expected = bound_2 `Secret.secret_is_le_64` expected in\n let cond_1 =\n bound_2_le_expected `Secret.logand_one_bit`\n (candidate `Secret.secret_is_le_64` ((bound_2_le_expected `Secret.mul` expected) `Secret.sub` (bound_2_le_expected `Secret.mul` bound_2))) `Secret.logand_one_bit`\n (candidate `Secret.secret_is_lt_64` (Secret.to_u64 U62.bound `Secret.sub` bound))\n in\n assert (Secret.v cond_1 == (\n if\n Secret.v bound_2 <= Secret.v expected &&\n Secret.v candidate <= (Secret.v expected - Secret.v bound_2) &&\n Secret.v candidate < U62.v U62.bound - Secret.v bound\n then 1\n else 0\n ));\n let cond_2 =\n Secret.lognot_one_bit cond_1 `Secret.logand_one_bit`\n ((expected `Secret.add` bound_2) `Secret.secret_is_lt_64` candidate) `Secret.logand_one_bit`\n (bound `Secret.secret_is_le_64` candidate)\n in\n assert (Secret.v cond_2 == (\n if\n Secret.v cond_1 = 0 &&\n Secret.v expected + Secret.v bound_2 < Secret.v candidate &&\n Secret.v bound <= Secret.v candidate\n then 1\n else 0\n ));\n (candidate `Secret.add` (cond_1 `Secret.mul` bound)) `Secret.sub` (cond_2 `Secret.mul` bound)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n[@\"opaque_to_smt\"]\nlet expand_pn\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: packet_number_t { pn == synth_packet_number last pn_len (U32.uint_to_t (Secret.v npn)) })\n= expand_pn_aux pn_len last npn\n\n#pop-options\n\nlet read_packet_number\n last pn_len b\n= let h = HST.get () in\n LP.parse_synth_eq (LP.lift_parser (parse_reduced_pn pn_len)) (synth_packet_number last pn_len) (Seq.seq_reveal (B.as_seq h b));\n let npn = read_bounded_integer pn_len b in\n expand_pn pn_len last npn\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet reduce_pn\n (pn_len: packet_number_length_t)\n (pn: packet_number_t)\n: Tot (b: secret_bounded_integer (Secret.v pn_len) { Secret.v b == reduce_pn' (Secret.v pn_len - 1) (Secret.v pn) })\n= let mask = bound_npn pn_len `Secret.sub` Secret.to_u64 1uL in\n Secret.logand_spec pn mask;\n Lemmas.logand_mask #64 (Secret.v pn) (8 `Prims.op_Multiply` Secret.v pn_len);\n Secret.to_u32 (pn `Secret.logand` mask)\n\n#pop-options\n\nlet serialize_u32_spec\n (x: U32.t)\n: Lemma\n (LP.serialize LP.serialize_u32 x == E.n_to_be 4 (U32.v x))\n= LP.parse_u32_spec (E.n_to_be 4 (U32.v x));\n LP.parse_injective LP.parse_u32 (LP.serialize LP.serialize_u32 x) (E.n_to_be 4 (U32.v x))\n\n#push-options \"--z3rlimit 16\"\n\nlet write_u32\n (x: Secret.uint32)\n (b: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h _ h' ->\n let b' = B.gsub b 0ul 4ul in\n B.modifies (B.loc_buffer b') h h' /\\\n Seq.seq_reveal (B.as_seq h' b') `Seq.equal` LP.serialize (LP.serialize_u32) (U32.uint_to_t (Secret.v x))", "dependencies": { "source_file": "QUIC.Impl.PacketNumber.fst", "checked_file": "QUIC.Impl.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.fst.checked", "LowParse.Endianness.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "E", "full_module": "LowParse.Endianness.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Lib.IntTypes.uint32 -> b: LowStar.Buffer.buffer Lib.IntTypes.uint8\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.uint32", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "LowStar.Monotonic.Buffer.upd", "LowStar.Buffer.trivial_preorder", "FStar.UInt32.__uint_to_t", "Lib.IntTypes.to_u8", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "Prims.unit", "Lib.IntTypes.shift_right", "LowStar.Monotonic.Buffer.mbuffer", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "LowStar.Buffer.sub", "FStar.Ghost.hide", "FStar.UInt32.t", "LowParse.Endianness.index_n_to_be", "QUIC.Secret.Int.Base.v", "QUIC.Impl.PacketNumber.serialize_u32_spec", "FStar.UInt32.uint_to_t", "FStar.Monotonic.HyperStack.mem", "Prims.l_and", "LowStar.Monotonic.Buffer.live", "Prims.b2t", "Prims.op_LessThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_buffer", "FStar.Seq.Base.equal", "Lib.IntTypes.uint_t", "Lib.IntTypes.PUB", "QUIC.Secret.Seq.seq_reveal", "LowStar.Monotonic.Buffer.as_seq", "LowParse.Spec.Base.serialize", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.Int.parse_u32", "LowParse.Spec.Int.serialize_u32", "LowStar.Buffer.gsub" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val write_u32 (x: Secret.uint32) (b: B.buffer Secret.uint8)\n : HST.Stack unit\n (requires (fun h -> B.live h b /\\ 4 <= B.length b))\n (ensures\n (fun h _ h' ->\n let b' = B.gsub b 0ul 4ul in\n B.modifies (B.loc_buffer b') h h' /\\\n (Seq.seq_reveal (B.as_seq h' b'))\n `Seq.equal`\n (LP.serialize (LP.serialize_u32) (U32.uint_to_t (Secret.v x)))))\nlet write_u32 (x: Secret.uint32) (b: B.buffer Secret.uint8)\n : HST.Stack unit\n (requires (fun h -> B.live h b /\\ 4 <= B.length b))\n (ensures\n (fun h _ h' ->\n let b' = B.gsub b 0ul 4ul in\n B.modifies (B.loc_buffer b') h h' /\\\n (Seq.seq_reveal (B.as_seq h' b'))\n `Seq.equal`\n (LP.serialize (LP.serialize_u32) (U32.uint_to_t (Secret.v x))))) =", "completed_definiton": "serialize_u32_spec (U32.uint_to_t (Secret.v x));\nE.index_n_to_be 4 (Secret.v x) 0;\nE.index_n_to_be 4 (Secret.v x) 1;\nE.index_n_to_be 4 (Secret.v x) 2;\nE.index_n_to_be 4 (Secret.v x) 3;\nlet b' = B.sub b 0ul 4ul in\nB.upd b' 0ul (Secret.to_u8 (x `Secret.shift_right` 24ul));\nB.upd b' 1ul (Secret.to_u8 (x `Secret.shift_right` 16ul));\nB.upd b' 2ul (Secret.to_u8 (x `Secret.shift_right` 8ul));\nB.upd b' 3ul (Secret.to_u8 x)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.PacketNumber.fst", "name": "QUIC.Impl.PacketNumber.read_bounded_integer", "original_source_type": "val read_bounded_integer (pn_len: packet_number_length_t) (b: B.buffer Secret.uint8)\n : HST.Stack Secret.uint32\n (requires (fun h -> B.live h b /\\ 4 <= B.length b))\n (ensures\n (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n (match\n LP.parse (LP.parse_bounded_integer (Secret.v pn_len))\n (Seq.seq_reveal (B.as_seq h b))\n with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False)))", "source_type": "val read_bounded_integer (pn_len: packet_number_length_t) (b: B.buffer Secret.uint8)\n : HST.Stack Secret.uint32\n (requires (fun h -> B.live h b /\\ 4 <= B.length b))\n (ensures\n (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n (match\n LP.parse (LP.parse_bounded_integer (Secret.v pn_len))\n (Seq.seq_reveal (B.as_seq h b))\n with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False)))", "source_definition": "let read_bounded_integer\n (pn_len: packet_number_length_t)\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse (LP.parse_bounded_integer (Secret.v pn_len)) (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n=\n let h = HST.get () in\n LP.parse_bounded_integer_spec (Secret.v pn_len) (Seq.seq_reveal (B.as_seq h b));\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n E.bitfield_be_to_n_slice (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4) 0 (Secret.v pn_len);\n let x = read_u32 b in\n BF.get_bitfield_full #32 (Secret.v x);\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.get_bitfield x 24ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.get_bitfield x 16ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul`\nSecret.get_bitfield x 8ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` x)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 96, "start_col": 1, "end_line": 108, "end_col": 79 }, "file_context": "module QUIC.Impl.PacketNumber\nopen QUIC.Spec.PacketNumber\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule HST = FStar.HyperStack.ST\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule LP = LowParse.Spec\nmodule Seq = QUIC.Secret.Seq\n\nfriend QUIC.Spec.PacketNumber\nmodule Spec = QUIC.Spec.PacketNumber\n\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule E = LowParse.Endianness.BitFields\n\nlet be_to_n_4_eq\n (b: Seq.lseq U8.t 4)\n: Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 2) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 0)\n )))))))\n= assert_norm (pow2 8 == 256);\n E.reveal_be_to_n b;\n let b3 = Seq.slice b 0 3 in\n E.reveal_be_to_n b3;\n let b2 = Seq.slice b3 0 2 in\n E.reveal_be_to_n b2;\n let b1 = Seq.slice b2 0 1 in\n E.reveal_be_to_n b1;\n E.reveal_be_to_n (Seq.slice b1 0 0)\n\n#push-options \"--z3rlimit 64\"\n\nlet read_u32\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse LP.parse_u32 (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n= \n let h = HST.get () in\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n be_to_n_4_eq (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4);\n let b3 = B.index b 3ul in\n let b2 = B.index b 2ul in\n let b1 = B.index b 1ul in\n let b0 = B.index b 0ul in\n Secret.to_u32 b3 `Secret.add` (Secret.to_u32 256ul `Secret.mul` (\n Secret.to_u32 b2 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b1 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b0\n ))))))\n\n#pop-options\n\nmodule BF = LowParse.BitFields\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet read_bounded_integer\n (pn_len: packet_number_length_t)\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse (LP.parse_bounded_integer (Secret.v pn_len)) (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end", "dependencies": { "source_file": "QUIC.Impl.PacketNumber.fst", "checked_file": "QUIC.Impl.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.fst.checked", "LowParse.Endianness.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "E", "full_module": "LowParse.Endianness.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n b: LowStar.Buffer.buffer Lib.IntTypes.uint8\n -> FStar.HyperStack.ST.Stack Lib.IntTypes.uint32", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "Lib.IntTypes.add", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "Lib.IntTypes.mul", "QUIC.Secret.Int.secrets_are_equal_32_2", "Lib.IntTypes.to_u32", "Lib.IntTypes.PUB", "FStar.UInt32.__uint_to_t", "QUIC.Secret.Int.get_bitfield", "Lib.IntTypes.int_t", "Lib.IntTypes.sub", "Prims.unit", "LowParse.BitFields.get_bitfield_full", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.uint32", "QUIC.Impl.PacketNumber.read_u32", "LowParse.Endianness.BitFields.bitfield_be_to_n_slice", "FStar.Seq.Base.slice", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "QUIC.Secret.Seq.seq_reveal", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Buffer.trivial_preorder", "LowParse.Spec.Int.parse_u32_spec", "LowParse.Spec.BoundedInt.parse_bounded_integer_spec", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "Prims.l_and", "LowStar.Monotonic.Buffer.live", "Prims.b2t", "Prims.op_LessThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_none", "LowParse.Spec.Base.parse", "LowParse.Spec.BoundedInt.bounded_integer", "LowParse.Spec.BoundedInt.parse_bounded_integer", "LowParse.Spec.Base.consumed_length", "Prims.eq2", "Prims.int", "Prims.l_or", "Lib.IntTypes.range", "FStar.UInt.size", "FStar.UInt32.n", "FStar.UInt32.v", "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_bounded_integer (pn_len: packet_number_length_t) (b: B.buffer Secret.uint8)\n : HST.Stack Secret.uint32\n (requires (fun h -> B.live h b /\\ 4 <= B.length b))\n (ensures\n (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n (match\n LP.parse (LP.parse_bounded_integer (Secret.v pn_len))\n (Seq.seq_reveal (B.as_seq h b))\n with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False)))\nlet read_bounded_integer (pn_len: packet_number_length_t) (b: B.buffer Secret.uint8)\n : HST.Stack Secret.uint32\n (requires (fun h -> B.live h b /\\ 4 <= B.length b))\n (ensures\n (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n (match\n LP.parse (LP.parse_bounded_integer (Secret.v pn_len))\n (Seq.seq_reveal (B.as_seq h b))\n with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False))) =", "completed_definiton": "let h = HST.get () in\nLP.parse_bounded_integer_spec (Secret.v pn_len) (Seq.seq_reveal (B.as_seq h b));\nLP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\nE.bitfield_be_to_n_slice (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4) 0 (Secret.v pn_len);\nlet x = read_u32 b in\nBF.get_bitfield_full #32 (Secret.v x);\nlet pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` (Secret.to_u32 1ul)) in\n((((pn_len_1 `Secret.secrets_are_equal_32_2` (Secret.to_u32 0ul))\n `Secret.mul`\n (Secret.get_bitfield x 24ul 32ul))\n `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` (Secret.to_u32 1ul))\n `Secret.mul`\n (Secret.get_bitfield x 16ul 32ul)))\n `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` (Secret.to_u32 2ul))\n `Secret.mul`\n (Secret.get_bitfield x 8ul 32ul)))\n`Secret.add`\n((pn_len_1 `Secret.secrets_are_equal_32_2` (Secret.to_u32 3ul)) `Secret.mul` x)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.PacketNumber.fst", "name": "QUIC.Impl.PacketNumber.reduce_pn", "original_source_type": "val reduce_pn (pn_len: packet_number_length_t) (pn: packet_number_t)\n : Tot\n (b:\n secret_bounded_integer (Secret.v pn_len)\n {Secret.v b == reduce_pn' (Secret.v pn_len - 1) (Secret.v pn)})", "source_type": "val reduce_pn (pn_len: packet_number_length_t) (pn: packet_number_t)\n : Tot\n (b:\n secret_bounded_integer (Secret.v pn_len)\n {Secret.v b == reduce_pn' (Secret.v pn_len - 1) (Secret.v pn)})", "source_definition": "let reduce_pn\n (pn_len: packet_number_length_t)\n (pn: packet_number_t)\n: Tot (b: secret_bounded_integer (Secret.v pn_len) { Secret.v b == reduce_pn' (Secret.v pn_len - 1) (Secret.v pn) })\n= let mask = bound_npn pn_len `Secret.sub` Secret.to_u64 1uL in\n Secret.logand_spec pn mask;\n Lemmas.logand_mask #64 (Secret.v pn) (8 `Prims.op_Multiply` Secret.v pn_len);\n Secret.to_u32 (pn `Secret.logand` mask)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 213, "start_col": 1, "end_line": 216, "end_col": 41 }, "file_context": "module QUIC.Impl.PacketNumber\nopen QUIC.Spec.PacketNumber\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule HST = FStar.HyperStack.ST\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule LP = LowParse.Spec\nmodule Seq = QUIC.Secret.Seq\n\nfriend QUIC.Spec.PacketNumber\nmodule Spec = QUIC.Spec.PacketNumber\n\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule E = LowParse.Endianness.BitFields\n\nlet be_to_n_4_eq\n (b: Seq.lseq U8.t 4)\n: Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 2) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 0)\n )))))))\n= assert_norm (pow2 8 == 256);\n E.reveal_be_to_n b;\n let b3 = Seq.slice b 0 3 in\n E.reveal_be_to_n b3;\n let b2 = Seq.slice b3 0 2 in\n E.reveal_be_to_n b2;\n let b1 = Seq.slice b2 0 1 in\n E.reveal_be_to_n b1;\n E.reveal_be_to_n (Seq.slice b1 0 0)\n\n#push-options \"--z3rlimit 64\"\n\nlet read_u32\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse LP.parse_u32 (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n= \n let h = HST.get () in\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n be_to_n_4_eq (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4);\n let b3 = B.index b 3ul in\n let b2 = B.index b 2ul in\n let b1 = B.index b 1ul in\n let b0 = B.index b 0ul in\n Secret.to_u32 b3 `Secret.add` (Secret.to_u32 256ul `Secret.mul` (\n Secret.to_u32 b2 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b1 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b0\n ))))))\n\n#pop-options\n\nmodule BF = LowParse.BitFields\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet read_bounded_integer\n (pn_len: packet_number_length_t)\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse (LP.parse_bounded_integer (Secret.v pn_len)) (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n=\n let h = HST.get () in\n LP.parse_bounded_integer_spec (Secret.v pn_len) (Seq.seq_reveal (B.as_seq h b));\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n E.bitfield_be_to_n_slice (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4) 0 (Secret.v pn_len);\n let x = read_u32 b in\n BF.get_bitfield_full #32 (Secret.v x);\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.get_bitfield x 24ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.get_bitfield x 16ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul`\nSecret.get_bitfield x 8ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` x)\n\n#pop-options\n\nmodule U = FStar.UInt\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet bound_npn\n (pn_len: packet_number_length_t)\n: Tot (x: packet_number_t { Secret.v x == bound_npn' (Secret.v pn_len - 1) })\n= let pn_len_1 = Secret.to_u64 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 0ul) `Secret.mul` Secret.to_u64 256uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 1ul) `Secret.mul` Secret.to_u64 65536uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 2ul) `Secret.mul` Secret.to_u64 16777216uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 3ul) `Secret.mul` Secret.to_u64 4294967296uL)\n\n#pop-options\n\ninline_for_extraction\nlet secret_bounded_integer (i: LP.integer_size) = (x: Secret.uint32 { LP.bounded_integer_prop i (U32.uint_to_t (Secret.v x)) })\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 2 --initial_ifuel 2 --z3rlimit 4096 --query_stats\"\n\nmodule U62 = QUIC.UInt62\nmodule Lemmas = QUIC.Spec.PacketNumber.Lemmas\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet expand_pn_aux\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: Secret.uint64 { Secret.v pn == expand_pn' (Secret.v pn_len - 1) (Secret.v last) (Secret.v npn) })\n= let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected : U62.secret = last `Secret.add` Secret.to_u64 1uL in\n let bound = bound_npn pn_len in\n let bound_2 = bound `Secret.shift_right` 1ul in\n FStar.UInt.shift_right_value_lemma #64 (Secret.v bound) 1;\n assert (Secret.v bound_2 == Secret.v bound / 2);\n let candidate = Lemmas.replace_modulo expected (8 `Prims.op_Multiply` Secret.v pn_len) (bound `Secret.sub` Secret.to_u64 1uL) (Secret.to_u64 npn) in\n Lemmas.lemma_replace_modulo_bound (Secret.v expected) (8*(Secret.v pn_len)) (Secret.v npn) 62;\n let bound_2_le_expected = bound_2 `Secret.secret_is_le_64` expected in\n let cond_1 =\n bound_2_le_expected `Secret.logand_one_bit`\n (candidate `Secret.secret_is_le_64` ((bound_2_le_expected `Secret.mul` expected) `Secret.sub` (bound_2_le_expected `Secret.mul` bound_2))) `Secret.logand_one_bit`\n (candidate `Secret.secret_is_lt_64` (Secret.to_u64 U62.bound `Secret.sub` bound))\n in\n assert (Secret.v cond_1 == (\n if\n Secret.v bound_2 <= Secret.v expected &&\n Secret.v candidate <= (Secret.v expected - Secret.v bound_2) &&\n Secret.v candidate < U62.v U62.bound - Secret.v bound\n then 1\n else 0\n ));\n let cond_2 =\n Secret.lognot_one_bit cond_1 `Secret.logand_one_bit`\n ((expected `Secret.add` bound_2) `Secret.secret_is_lt_64` candidate) `Secret.logand_one_bit`\n (bound `Secret.secret_is_le_64` candidate)\n in\n assert (Secret.v cond_2 == (\n if\n Secret.v cond_1 = 0 &&\n Secret.v expected + Secret.v bound_2 < Secret.v candidate &&\n Secret.v bound <= Secret.v candidate\n then 1\n else 0\n ));\n (candidate `Secret.add` (cond_1 `Secret.mul` bound)) `Secret.sub` (cond_2 `Secret.mul` bound)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n[@\"opaque_to_smt\"]\nlet expand_pn\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: packet_number_t { pn == synth_packet_number last pn_len (U32.uint_to_t (Secret.v npn)) })\n= expand_pn_aux pn_len last npn\n\n#pop-options\n\nlet read_packet_number\n last pn_len b\n= let h = HST.get () in\n LP.parse_synth_eq (LP.lift_parser (parse_reduced_pn pn_len)) (synth_packet_number last pn_len) (Seq.seq_reveal (B.as_seq h b));\n let npn = read_bounded_integer pn_len b in\n expand_pn pn_len last npn\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet reduce_pn\n (pn_len: packet_number_length_t)\n (pn: packet_number_t)", "dependencies": { "source_file": "QUIC.Impl.PacketNumber.fst", "checked_file": "QUIC.Impl.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.fst.checked", "LowParse.Endianness.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "E", "full_module": "LowParse.Endianness.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t\n -> b:\n QUIC.Impl.PacketNumber.secret_bounded_integer (QUIC.Secret.Int.Base.v pn_len)\n { QUIC.Secret.Int.Base.v b ==\n QUIC.Spec.PacketNumber.reduce_pn' (QUIC.Secret.Int.Base.v pn_len - 1)\n (QUIC.Secret.Int.Base.v pn) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Lib.IntTypes.to_u32", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "Lib.IntTypes.logand", "Prims.unit", "QUIC.Spec.PacketNumber.Lemmas.logand_mask", "QUIC.Secret.Int.Base.v", "Prims.op_Multiply", "Lib.IntTypes.U32", "Lib.IntTypes.logand_spec", "Lib.IntTypes.int_t", "Lib.IntTypes.sub", "QUIC.Impl.PacketNumber.bound_npn", "Lib.IntTypes.to_u64", "Lib.IntTypes.PUB", "FStar.UInt64.__uint_to_t", "QUIC.Impl.PacketNumber.secret_bounded_integer", "Prims.eq2", "Prims.int", "Prims.l_or", "Lib.IntTypes.range", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "QUIC.Spec.PacketNumber.reduce_pn'", "Prims.op_Subtraction" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val reduce_pn (pn_len: packet_number_length_t) (pn: packet_number_t)\n : Tot\n (b:\n secret_bounded_integer (Secret.v pn_len)\n {Secret.v b == reduce_pn' (Secret.v pn_len - 1) (Secret.v pn)})\nlet reduce_pn (pn_len: packet_number_length_t) (pn: packet_number_t)\n : Tot\n (b:\n secret_bounded_integer (Secret.v pn_len)\n {Secret.v b == reduce_pn' (Secret.v pn_len - 1) (Secret.v pn)}) =", "completed_definiton": "let mask = (bound_npn pn_len) `Secret.sub` (Secret.to_u64 1uL) in\nSecret.logand_spec pn mask;\nLemmas.logand_mask #64 (Secret.v pn) (8 `Prims.op_Multiply` (Secret.v pn_len));\nSecret.to_u32 (pn `Secret.logand` mask)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.PacketNumber.fst", "name": "QUIC.Impl.PacketNumber.set_left_bitfield_right", "original_source_type": "val set_left_bitfield_right\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n : Lemma\n (Seq.slice (E.n_to_be 4 (Secret.v (set_left_bitfield pn_len before x))) (Secret.v pn_len) 4 ==\n Seq.slice (E.n_to_be 4 (Secret.v before)) (Secret.v pn_len) 4)", "source_type": "val set_left_bitfield_right\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n : Lemma\n (Seq.slice (E.n_to_be 4 (Secret.v (set_left_bitfield pn_len before x))) (Secret.v pn_len) 4 ==\n Seq.slice (E.n_to_be 4 (Secret.v before)) (Secret.v pn_len) 4)", "source_definition": "let set_left_bitfield_right\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n: Lemma\n (Seq.slice (E.n_to_be 4 (Secret.v (set_left_bitfield pn_len before x))) (Secret.v pn_len) 4 == Seq.slice (E.n_to_be 4 (Secret.v before)) (Secret.v pn_len) 4)\n= \n E.slice_n_to_be_bitfield 4 (Secret.v (set_left_bitfield pn_len before x)) (Secret.v pn_len) 4;\n E.slice_n_to_be_bitfield 4 (Secret.v before) (Secret.v pn_len) 4;\n BF.get_bitfield_set_bitfield_other #32 (Secret.v before) (8 `op_Multiply` (4 - Secret.v pn_len)) 32 (Secret.v x) 0 (8 `op_Multiply` (4 - Secret.v pn_len))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 367, "start_col": 2, "end_line": 369, "end_col": 156 }, "file_context": "module QUIC.Impl.PacketNumber\nopen QUIC.Spec.PacketNumber\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule HST = FStar.HyperStack.ST\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule LP = LowParse.Spec\nmodule Seq = QUIC.Secret.Seq\n\nfriend QUIC.Spec.PacketNumber\nmodule Spec = QUIC.Spec.PacketNumber\n\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule E = LowParse.Endianness.BitFields\n\nlet be_to_n_4_eq\n (b: Seq.lseq U8.t 4)\n: Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 2) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 0)\n )))))))\n= assert_norm (pow2 8 == 256);\n E.reveal_be_to_n b;\n let b3 = Seq.slice b 0 3 in\n E.reveal_be_to_n b3;\n let b2 = Seq.slice b3 0 2 in\n E.reveal_be_to_n b2;\n let b1 = Seq.slice b2 0 1 in\n E.reveal_be_to_n b1;\n E.reveal_be_to_n (Seq.slice b1 0 0)\n\n#push-options \"--z3rlimit 64\"\n\nlet read_u32\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse LP.parse_u32 (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n= \n let h = HST.get () in\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n be_to_n_4_eq (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4);\n let b3 = B.index b 3ul in\n let b2 = B.index b 2ul in\n let b1 = B.index b 1ul in\n let b0 = B.index b 0ul in\n Secret.to_u32 b3 `Secret.add` (Secret.to_u32 256ul `Secret.mul` (\n Secret.to_u32 b2 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b1 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b0\n ))))))\n\n#pop-options\n\nmodule BF = LowParse.BitFields\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet read_bounded_integer\n (pn_len: packet_number_length_t)\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse (LP.parse_bounded_integer (Secret.v pn_len)) (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n=\n let h = HST.get () in\n LP.parse_bounded_integer_spec (Secret.v pn_len) (Seq.seq_reveal (B.as_seq h b));\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n E.bitfield_be_to_n_slice (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4) 0 (Secret.v pn_len);\n let x = read_u32 b in\n BF.get_bitfield_full #32 (Secret.v x);\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.get_bitfield x 24ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.get_bitfield x 16ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul`\nSecret.get_bitfield x 8ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` x)\n\n#pop-options\n\nmodule U = FStar.UInt\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet bound_npn\n (pn_len: packet_number_length_t)\n: Tot (x: packet_number_t { Secret.v x == bound_npn' (Secret.v pn_len - 1) })\n= let pn_len_1 = Secret.to_u64 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 0ul) `Secret.mul` Secret.to_u64 256uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 1ul) `Secret.mul` Secret.to_u64 65536uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 2ul) `Secret.mul` Secret.to_u64 16777216uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 3ul) `Secret.mul` Secret.to_u64 4294967296uL)\n\n#pop-options\n\ninline_for_extraction\nlet secret_bounded_integer (i: LP.integer_size) = (x: Secret.uint32 { LP.bounded_integer_prop i (U32.uint_to_t (Secret.v x)) })\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 2 --initial_ifuel 2 --z3rlimit 4096 --query_stats\"\n\nmodule U62 = QUIC.UInt62\nmodule Lemmas = QUIC.Spec.PacketNumber.Lemmas\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet expand_pn_aux\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: Secret.uint64 { Secret.v pn == expand_pn' (Secret.v pn_len - 1) (Secret.v last) (Secret.v npn) })\n= let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected : U62.secret = last `Secret.add` Secret.to_u64 1uL in\n let bound = bound_npn pn_len in\n let bound_2 = bound `Secret.shift_right` 1ul in\n FStar.UInt.shift_right_value_lemma #64 (Secret.v bound) 1;\n assert (Secret.v bound_2 == Secret.v bound / 2);\n let candidate = Lemmas.replace_modulo expected (8 `Prims.op_Multiply` Secret.v pn_len) (bound `Secret.sub` Secret.to_u64 1uL) (Secret.to_u64 npn) in\n Lemmas.lemma_replace_modulo_bound (Secret.v expected) (8*(Secret.v pn_len)) (Secret.v npn) 62;\n let bound_2_le_expected = bound_2 `Secret.secret_is_le_64` expected in\n let cond_1 =\n bound_2_le_expected `Secret.logand_one_bit`\n (candidate `Secret.secret_is_le_64` ((bound_2_le_expected `Secret.mul` expected) `Secret.sub` (bound_2_le_expected `Secret.mul` bound_2))) `Secret.logand_one_bit`\n (candidate `Secret.secret_is_lt_64` (Secret.to_u64 U62.bound `Secret.sub` bound))\n in\n assert (Secret.v cond_1 == (\n if\n Secret.v bound_2 <= Secret.v expected &&\n Secret.v candidate <= (Secret.v expected - Secret.v bound_2) &&\n Secret.v candidate < U62.v U62.bound - Secret.v bound\n then 1\n else 0\n ));\n let cond_2 =\n Secret.lognot_one_bit cond_1 `Secret.logand_one_bit`\n ((expected `Secret.add` bound_2) `Secret.secret_is_lt_64` candidate) `Secret.logand_one_bit`\n (bound `Secret.secret_is_le_64` candidate)\n in\n assert (Secret.v cond_2 == (\n if\n Secret.v cond_1 = 0 &&\n Secret.v expected + Secret.v bound_2 < Secret.v candidate &&\n Secret.v bound <= Secret.v candidate\n then 1\n else 0\n ));\n (candidate `Secret.add` (cond_1 `Secret.mul` bound)) `Secret.sub` (cond_2 `Secret.mul` bound)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n[@\"opaque_to_smt\"]\nlet expand_pn\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: packet_number_t { pn == synth_packet_number last pn_len (U32.uint_to_t (Secret.v npn)) })\n= expand_pn_aux pn_len last npn\n\n#pop-options\n\nlet read_packet_number\n last pn_len b\n= let h = HST.get () in\n LP.parse_synth_eq (LP.lift_parser (parse_reduced_pn pn_len)) (synth_packet_number last pn_len) (Seq.seq_reveal (B.as_seq h b));\n let npn = read_bounded_integer pn_len b in\n expand_pn pn_len last npn\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet reduce_pn\n (pn_len: packet_number_length_t)\n (pn: packet_number_t)\n: Tot (b: secret_bounded_integer (Secret.v pn_len) { Secret.v b == reduce_pn' (Secret.v pn_len - 1) (Secret.v pn) })\n= let mask = bound_npn pn_len `Secret.sub` Secret.to_u64 1uL in\n Secret.logand_spec pn mask;\n Lemmas.logand_mask #64 (Secret.v pn) (8 `Prims.op_Multiply` Secret.v pn_len);\n Secret.to_u32 (pn `Secret.logand` mask)\n\n#pop-options\n\nlet serialize_u32_spec\n (x: U32.t)\n: Lemma\n (LP.serialize LP.serialize_u32 x == E.n_to_be 4 (U32.v x))\n= LP.parse_u32_spec (E.n_to_be 4 (U32.v x));\n LP.parse_injective LP.parse_u32 (LP.serialize LP.serialize_u32 x) (E.n_to_be 4 (U32.v x))\n\n#push-options \"--z3rlimit 16\"\n\nlet write_u32\n (x: Secret.uint32)\n (b: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h _ h' ->\n let b' = B.gsub b 0ul 4ul in\n B.modifies (B.loc_buffer b') h h' /\\\n Seq.seq_reveal (B.as_seq h' b') `Seq.equal` LP.serialize (LP.serialize_u32) (U32.uint_to_t (Secret.v x))\n ))\n= serialize_u32_spec (U32.uint_to_t (Secret.v x));\n E.index_n_to_be 4 (Secret.v x) 0;\n E.index_n_to_be 4 (Secret.v x) 1;\n E.index_n_to_be 4 (Secret.v x) 2;\n E.index_n_to_be 4 (Secret.v x) 3;\n let b' = B.sub b 0ul 4ul in\n B.upd b' 0ul (Secret.to_u8 (x `Secret.shift_right` 24ul));\n B.upd b' 1ul (Secret.to_u8 (x `Secret.shift_right` 16ul));\n B.upd b' 2ul (Secret.to_u8 (x `Secret.shift_right` 8ul));\n B.upd b' 3ul (Secret.to_u8 x)\n\n#pop-options\n\n#push-options \"--z3rlimit 256\"\n\n#restart-solver\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nlet set_left_bitfield_arg\n (pn_len: packet_number_length_t)\n (pn_len' : U32.t { 1 <= U32.v pn_len' /\\ U32.v pn_len' <= 4 } )\n (x: Secret.uint32 {\n Secret.v pn_len == U32.v pn_len' ==> LP.bounded_integer_prop (Secret.v pn_len) (U32.uint_to_t (Secret.v x))\n })\n (mask: Secret.uint32 { Secret.v mask == pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) - 1 })\n: Tot (y: secret_bounded_integer (U32.v pn_len') {\n Secret.v pn_len == U32.v pn_len' ==> Secret.v y == Secret.v x\n })\n=\n let f () : Lemma\n (requires (Secret.v pn_len == U32.v pn_len'))\n (ensures (\n Secret.v pn_len == U32.v pn_len' /\\\n Secret.v x % pow2 (8 `Prims.op_Multiply` U32.v pn_len' ) == Secret.v x\n ))\n = LP.bounded_integer_prop_equiv (Secret.v pn_len) (U32.uint_to_t (Secret.v x));\n FStar.Math.Lemmas.small_mod (Secret.v x) (pow2 (8 `Prims.op_Multiply` U32.v pn_len'))\n in\n let g () : Lemma\n (Secret.v pn_len == U32.v pn_len' ==>\n Secret.v x % pow2 (8 `Prims.op_Multiply` U32.v pn_len' ) == Secret.v x\n )\n = Classical.move_requires f ()\n in\n g ();\n Lemmas.logand_mask #32 (Secret.v x) (8 `Prims.op_Multiply` U32.v pn_len');\n [@inline_let]\n let y = x `Secret.logand` mask in\n assert (Secret.v y == U.logand #32 (Secret.v x) (Secret.v mask));\n y\n\n#pop-options\n\n#push-options \"--z3rlimit 256\"\n\n#restart-solver\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nval set_left_bitfield_aux\n (pn_len: packet_number_length_t)\n (pn_len' : U32.t { 1 <= U32.v pn_len' /\\ U32.v pn_len' <= 4 } )\n (before: Secret.uint32)\n (x: Secret.uint32 {\n Secret.v pn_len == U32.v pn_len' ==> LP.bounded_integer_prop (Secret.v pn_len) (U32.uint_to_t (Secret.v x))\n })\n (mask: Secret.uint32 { Secret.v mask == pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) - 1 })\n: Tot (after: Secret.uint32 { Secret.v after == (if Secret.v pn_len = U32.v pn_len' then \nBF.set_bitfield #32 (Secret.v before) (8 `Prims.op_Multiply` (4 - Secret.v pn_len)) 32 (Secret.v x <: nat) else 0) })\n\nlet set_left_bitfield_aux\n pn_len pn_len' before x mask\n= \n [@inline_let]\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n (pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 (pn_len' `U32.sub` 1ul)) `Secret.mul` Secret.set_bitfield before (8ul `U32.mul` (4ul `U32.sub` pn_len')) 32ul (set_left_bitfield_arg pn_len pn_len' x mask)\n\n#pop-options\n\n#push-options \"--z3rlimit 128\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet set_left_bitfield\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n: Tot (after: Secret.uint32 { Secret.v after = BF.set_bitfield #32 (Secret.v before) (8 `Prims.op_Multiply` (4 - Secret.v pn_len)) 32 (Secret.v x) })\n=\n BF.set_bitfield_full #32 (Secret.v before) (Secret.v x);\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 16 == 65536);\n assert_norm (pow2 24 == 16777216);\n [@inline_let]\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n set_left_bitfield_aux pn_len 1ul before x (Secret.to_u32 255ul) `Secret.add`\n set_left_bitfield_aux pn_len 2ul before x (Secret.to_u32 65535ul) `Secret.add`\n set_left_bitfield_aux pn_len 3ul before x (Secret.to_u32 16777215ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` x)\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\n#restart-solver\n\nlet set_left_bitfield_left\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n: Lemma\n (Seq.slice (E.n_to_be 4 (Secret.v (set_left_bitfield pn_len before x))) 0 (Secret.v pn_len) == E.n_to_be (Secret.v pn_len) (Secret.v x))\n=\n E.slice_n_to_be_bitfield 4 (Secret.v (set_left_bitfield pn_len before x)) 0 (Secret.v pn_len);\n BF.get_bitfield_set_bitfield_same #32 (Secret.v before) (8 `op_Multiply` (4 - Secret.v pn_len)) 32 (Secret.v x)\n\nlet set_left_bitfield_right\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n: Lemma\n (Seq.slice (E.n_to_be 4 (Secret.v (set_left_bitfield pn_len before x))) (Secret.v pn_len) 4 == Seq.slice (E.n_to_be 4 (Secret.v before)) (Secret.v pn_len) 4)", "dependencies": { "source_file": "QUIC.Impl.PacketNumber.fst", "checked_file": "QUIC.Impl.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.fst.checked", "LowParse.Endianness.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "E", "full_module": "LowParse.Endianness.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n before: Lib.IntTypes.uint32 ->\n x: QUIC.Impl.PacketNumber.secret_bounded_integer (QUIC.Secret.Int.Base.v pn_len)\n -> FStar.Pervasives.Lemma\n (ensures\n FStar.Seq.Base.slice (FStar.Endianness.n_to_be 4\n (QUIC.Secret.Int.Base.v (QUIC.Impl.PacketNumber.set_left_bitfield pn_len before x)))\n (QUIC.Secret.Int.Base.v pn_len)\n 4 ==\n FStar.Seq.Base.slice (FStar.Endianness.n_to_be 4 (QUIC.Secret.Int.Base.v before))\n (QUIC.Secret.Int.Base.v pn_len)\n 4)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "Lib.IntTypes.uint32", "QUIC.Impl.PacketNumber.secret_bounded_integer", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "LowParse.BitFields.get_bitfield_set_bitfield_other", "Prims.op_Multiply", "Prims.op_Subtraction", "Prims.unit", "LowParse.Endianness.BitFields.slice_n_to_be_bitfield", "QUIC.Impl.PacketNumber.set_left_bitfield", "Prims.l_True", "Prims.squash", "Prims.eq2", "FStar.Seq.Base.seq", "FStar.UInt8.t", "FStar.Seq.Base.slice", "FStar.Endianness.n_to_be", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val set_left_bitfield_right\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n : Lemma\n (Seq.slice (E.n_to_be 4 (Secret.v (set_left_bitfield pn_len before x))) (Secret.v pn_len) 4 ==\n Seq.slice (E.n_to_be 4 (Secret.v before)) (Secret.v pn_len) 4)\nlet set_left_bitfield_right\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n : Lemma\n (Seq.slice (E.n_to_be 4 (Secret.v (set_left_bitfield pn_len before x))) (Secret.v pn_len) 4 ==\n Seq.slice (E.n_to_be 4 (Secret.v before)) (Secret.v pn_len) 4) =", "completed_definiton": "E.slice_n_to_be_bitfield 4 (Secret.v (set_left_bitfield pn_len before x)) (Secret.v pn_len) 4;\nE.slice_n_to_be_bitfield 4 (Secret.v before) (Secret.v pn_len) 4;\nBF.get_bitfield_set_bitfield_other #32\n (Secret.v before)\n (8 `op_Multiply` (4 - Secret.v pn_len))\n 32\n (Secret.v x)\n 0\n (8 `op_Multiply` (4 - Secret.v pn_len))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.PacketNumber.fst", "name": "QUIC.Impl.PacketNumber.set_left_bitfield_left", "original_source_type": "val set_left_bitfield_left\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n : Lemma\n (Seq.slice (E.n_to_be 4 (Secret.v (set_left_bitfield pn_len before x))) 0 (Secret.v pn_len) ==\n E.n_to_be (Secret.v pn_len) (Secret.v x))", "source_type": "val set_left_bitfield_left\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n : Lemma\n (Seq.slice (E.n_to_be 4 (Secret.v (set_left_bitfield pn_len before x))) 0 (Secret.v pn_len) ==\n E.n_to_be (Secret.v pn_len) (Secret.v x))", "source_definition": "let set_left_bitfield_left\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n: Lemma\n (Seq.slice (E.n_to_be 4 (Secret.v (set_left_bitfield pn_len before x))) 0 (Secret.v pn_len) == E.n_to_be (Secret.v pn_len) (Secret.v x))\n=\n E.slice_n_to_be_bitfield 4 (Secret.v (set_left_bitfield pn_len before x)) 0 (Secret.v pn_len);\n BF.get_bitfield_set_bitfield_same #32 (Secret.v before) (8 `op_Multiply` (4 - Secret.v pn_len)) 32 (Secret.v x)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 357, "start_col": 2, "end_line": 358, "end_col": 113 }, "file_context": "module QUIC.Impl.PacketNumber\nopen QUIC.Spec.PacketNumber\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule HST = FStar.HyperStack.ST\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule LP = LowParse.Spec\nmodule Seq = QUIC.Secret.Seq\n\nfriend QUIC.Spec.PacketNumber\nmodule Spec = QUIC.Spec.PacketNumber\n\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule E = LowParse.Endianness.BitFields\n\nlet be_to_n_4_eq\n (b: Seq.lseq U8.t 4)\n: Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 2) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 0)\n )))))))\n= assert_norm (pow2 8 == 256);\n E.reveal_be_to_n b;\n let b3 = Seq.slice b 0 3 in\n E.reveal_be_to_n b3;\n let b2 = Seq.slice b3 0 2 in\n E.reveal_be_to_n b2;\n let b1 = Seq.slice b2 0 1 in\n E.reveal_be_to_n b1;\n E.reveal_be_to_n (Seq.slice b1 0 0)\n\n#push-options \"--z3rlimit 64\"\n\nlet read_u32\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse LP.parse_u32 (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n= \n let h = HST.get () in\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n be_to_n_4_eq (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4);\n let b3 = B.index b 3ul in\n let b2 = B.index b 2ul in\n let b1 = B.index b 1ul in\n let b0 = B.index b 0ul in\n Secret.to_u32 b3 `Secret.add` (Secret.to_u32 256ul `Secret.mul` (\n Secret.to_u32 b2 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b1 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b0\n ))))))\n\n#pop-options\n\nmodule BF = LowParse.BitFields\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet read_bounded_integer\n (pn_len: packet_number_length_t)\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse (LP.parse_bounded_integer (Secret.v pn_len)) (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n=\n let h = HST.get () in\n LP.parse_bounded_integer_spec (Secret.v pn_len) (Seq.seq_reveal (B.as_seq h b));\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n E.bitfield_be_to_n_slice (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4) 0 (Secret.v pn_len);\n let x = read_u32 b in\n BF.get_bitfield_full #32 (Secret.v x);\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.get_bitfield x 24ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.get_bitfield x 16ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul`\nSecret.get_bitfield x 8ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` x)\n\n#pop-options\n\nmodule U = FStar.UInt\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet bound_npn\n (pn_len: packet_number_length_t)\n: Tot (x: packet_number_t { Secret.v x == bound_npn' (Secret.v pn_len - 1) })\n= let pn_len_1 = Secret.to_u64 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 0ul) `Secret.mul` Secret.to_u64 256uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 1ul) `Secret.mul` Secret.to_u64 65536uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 2ul) `Secret.mul` Secret.to_u64 16777216uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 3ul) `Secret.mul` Secret.to_u64 4294967296uL)\n\n#pop-options\n\ninline_for_extraction\nlet secret_bounded_integer (i: LP.integer_size) = (x: Secret.uint32 { LP.bounded_integer_prop i (U32.uint_to_t (Secret.v x)) })\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 2 --initial_ifuel 2 --z3rlimit 4096 --query_stats\"\n\nmodule U62 = QUIC.UInt62\nmodule Lemmas = QUIC.Spec.PacketNumber.Lemmas\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet expand_pn_aux\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: Secret.uint64 { Secret.v pn == expand_pn' (Secret.v pn_len - 1) (Secret.v last) (Secret.v npn) })\n= let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected : U62.secret = last `Secret.add` Secret.to_u64 1uL in\n let bound = bound_npn pn_len in\n let bound_2 = bound `Secret.shift_right` 1ul in\n FStar.UInt.shift_right_value_lemma #64 (Secret.v bound) 1;\n assert (Secret.v bound_2 == Secret.v bound / 2);\n let candidate = Lemmas.replace_modulo expected (8 `Prims.op_Multiply` Secret.v pn_len) (bound `Secret.sub` Secret.to_u64 1uL) (Secret.to_u64 npn) in\n Lemmas.lemma_replace_modulo_bound (Secret.v expected) (8*(Secret.v pn_len)) (Secret.v npn) 62;\n let bound_2_le_expected = bound_2 `Secret.secret_is_le_64` expected in\n let cond_1 =\n bound_2_le_expected `Secret.logand_one_bit`\n (candidate `Secret.secret_is_le_64` ((bound_2_le_expected `Secret.mul` expected) `Secret.sub` (bound_2_le_expected `Secret.mul` bound_2))) `Secret.logand_one_bit`\n (candidate `Secret.secret_is_lt_64` (Secret.to_u64 U62.bound `Secret.sub` bound))\n in\n assert (Secret.v cond_1 == (\n if\n Secret.v bound_2 <= Secret.v expected &&\n Secret.v candidate <= (Secret.v expected - Secret.v bound_2) &&\n Secret.v candidate < U62.v U62.bound - Secret.v bound\n then 1\n else 0\n ));\n let cond_2 =\n Secret.lognot_one_bit cond_1 `Secret.logand_one_bit`\n ((expected `Secret.add` bound_2) `Secret.secret_is_lt_64` candidate) `Secret.logand_one_bit`\n (bound `Secret.secret_is_le_64` candidate)\n in\n assert (Secret.v cond_2 == (\n if\n Secret.v cond_1 = 0 &&\n Secret.v expected + Secret.v bound_2 < Secret.v candidate &&\n Secret.v bound <= Secret.v candidate\n then 1\n else 0\n ));\n (candidate `Secret.add` (cond_1 `Secret.mul` bound)) `Secret.sub` (cond_2 `Secret.mul` bound)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n[@\"opaque_to_smt\"]\nlet expand_pn\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: packet_number_t { pn == synth_packet_number last pn_len (U32.uint_to_t (Secret.v npn)) })\n= expand_pn_aux pn_len last npn\n\n#pop-options\n\nlet read_packet_number\n last pn_len b\n= let h = HST.get () in\n LP.parse_synth_eq (LP.lift_parser (parse_reduced_pn pn_len)) (synth_packet_number last pn_len) (Seq.seq_reveal (B.as_seq h b));\n let npn = read_bounded_integer pn_len b in\n expand_pn pn_len last npn\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet reduce_pn\n (pn_len: packet_number_length_t)\n (pn: packet_number_t)\n: Tot (b: secret_bounded_integer (Secret.v pn_len) { Secret.v b == reduce_pn' (Secret.v pn_len - 1) (Secret.v pn) })\n= let mask = bound_npn pn_len `Secret.sub` Secret.to_u64 1uL in\n Secret.logand_spec pn mask;\n Lemmas.logand_mask #64 (Secret.v pn) (8 `Prims.op_Multiply` Secret.v pn_len);\n Secret.to_u32 (pn `Secret.logand` mask)\n\n#pop-options\n\nlet serialize_u32_spec\n (x: U32.t)\n: Lemma\n (LP.serialize LP.serialize_u32 x == E.n_to_be 4 (U32.v x))\n= LP.parse_u32_spec (E.n_to_be 4 (U32.v x));\n LP.parse_injective LP.parse_u32 (LP.serialize LP.serialize_u32 x) (E.n_to_be 4 (U32.v x))\n\n#push-options \"--z3rlimit 16\"\n\nlet write_u32\n (x: Secret.uint32)\n (b: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h _ h' ->\n let b' = B.gsub b 0ul 4ul in\n B.modifies (B.loc_buffer b') h h' /\\\n Seq.seq_reveal (B.as_seq h' b') `Seq.equal` LP.serialize (LP.serialize_u32) (U32.uint_to_t (Secret.v x))\n ))\n= serialize_u32_spec (U32.uint_to_t (Secret.v x));\n E.index_n_to_be 4 (Secret.v x) 0;\n E.index_n_to_be 4 (Secret.v x) 1;\n E.index_n_to_be 4 (Secret.v x) 2;\n E.index_n_to_be 4 (Secret.v x) 3;\n let b' = B.sub b 0ul 4ul in\n B.upd b' 0ul (Secret.to_u8 (x `Secret.shift_right` 24ul));\n B.upd b' 1ul (Secret.to_u8 (x `Secret.shift_right` 16ul));\n B.upd b' 2ul (Secret.to_u8 (x `Secret.shift_right` 8ul));\n B.upd b' 3ul (Secret.to_u8 x)\n\n#pop-options\n\n#push-options \"--z3rlimit 256\"\n\n#restart-solver\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nlet set_left_bitfield_arg\n (pn_len: packet_number_length_t)\n (pn_len' : U32.t { 1 <= U32.v pn_len' /\\ U32.v pn_len' <= 4 } )\n (x: Secret.uint32 {\n Secret.v pn_len == U32.v pn_len' ==> LP.bounded_integer_prop (Secret.v pn_len) (U32.uint_to_t (Secret.v x))\n })\n (mask: Secret.uint32 { Secret.v mask == pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) - 1 })\n: Tot (y: secret_bounded_integer (U32.v pn_len') {\n Secret.v pn_len == U32.v pn_len' ==> Secret.v y == Secret.v x\n })\n=\n let f () : Lemma\n (requires (Secret.v pn_len == U32.v pn_len'))\n (ensures (\n Secret.v pn_len == U32.v pn_len' /\\\n Secret.v x % pow2 (8 `Prims.op_Multiply` U32.v pn_len' ) == Secret.v x\n ))\n = LP.bounded_integer_prop_equiv (Secret.v pn_len) (U32.uint_to_t (Secret.v x));\n FStar.Math.Lemmas.small_mod (Secret.v x) (pow2 (8 `Prims.op_Multiply` U32.v pn_len'))\n in\n let g () : Lemma\n (Secret.v pn_len == U32.v pn_len' ==>\n Secret.v x % pow2 (8 `Prims.op_Multiply` U32.v pn_len' ) == Secret.v x\n )\n = Classical.move_requires f ()\n in\n g ();\n Lemmas.logand_mask #32 (Secret.v x) (8 `Prims.op_Multiply` U32.v pn_len');\n [@inline_let]\n let y = x `Secret.logand` mask in\n assert (Secret.v y == U.logand #32 (Secret.v x) (Secret.v mask));\n y\n\n#pop-options\n\n#push-options \"--z3rlimit 256\"\n\n#restart-solver\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nval set_left_bitfield_aux\n (pn_len: packet_number_length_t)\n (pn_len' : U32.t { 1 <= U32.v pn_len' /\\ U32.v pn_len' <= 4 } )\n (before: Secret.uint32)\n (x: Secret.uint32 {\n Secret.v pn_len == U32.v pn_len' ==> LP.bounded_integer_prop (Secret.v pn_len) (U32.uint_to_t (Secret.v x))\n })\n (mask: Secret.uint32 { Secret.v mask == pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) - 1 })\n: Tot (after: Secret.uint32 { Secret.v after == (if Secret.v pn_len = U32.v pn_len' then \nBF.set_bitfield #32 (Secret.v before) (8 `Prims.op_Multiply` (4 - Secret.v pn_len)) 32 (Secret.v x <: nat) else 0) })\n\nlet set_left_bitfield_aux\n pn_len pn_len' before x mask\n= \n [@inline_let]\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n (pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 (pn_len' `U32.sub` 1ul)) `Secret.mul` Secret.set_bitfield before (8ul `U32.mul` (4ul `U32.sub` pn_len')) 32ul (set_left_bitfield_arg pn_len pn_len' x mask)\n\n#pop-options\n\n#push-options \"--z3rlimit 128\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet set_left_bitfield\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n: Tot (after: Secret.uint32 { Secret.v after = BF.set_bitfield #32 (Secret.v before) (8 `Prims.op_Multiply` (4 - Secret.v pn_len)) 32 (Secret.v x) })\n=\n BF.set_bitfield_full #32 (Secret.v before) (Secret.v x);\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 16 == 65536);\n assert_norm (pow2 24 == 16777216);\n [@inline_let]\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n set_left_bitfield_aux pn_len 1ul before x (Secret.to_u32 255ul) `Secret.add`\n set_left_bitfield_aux pn_len 2ul before x (Secret.to_u32 65535ul) `Secret.add`\n set_left_bitfield_aux pn_len 3ul before x (Secret.to_u32 16777215ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` x)\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\n#restart-solver\n\nlet set_left_bitfield_left\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n: Lemma\n (Seq.slice (E.n_to_be 4 (Secret.v (set_left_bitfield pn_len before x))) 0 (Secret.v pn_len) == E.n_to_be (Secret.v pn_len) (Secret.v x))", "dependencies": { "source_file": "QUIC.Impl.PacketNumber.fst", "checked_file": "QUIC.Impl.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.fst.checked", "LowParse.Endianness.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "E", "full_module": "LowParse.Endianness.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n before: Lib.IntTypes.uint32 ->\n x: QUIC.Impl.PacketNumber.secret_bounded_integer (QUIC.Secret.Int.Base.v pn_len)\n -> FStar.Pervasives.Lemma\n (ensures\n FStar.Seq.Base.slice (FStar.Endianness.n_to_be 4\n (QUIC.Secret.Int.Base.v (QUIC.Impl.PacketNumber.set_left_bitfield pn_len before x)))\n 0\n (QUIC.Secret.Int.Base.v pn_len) ==\n FStar.Endianness.n_to_be (QUIC.Secret.Int.Base.v pn_len) (QUIC.Secret.Int.Base.v x))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "Lib.IntTypes.uint32", "QUIC.Impl.PacketNumber.secret_bounded_integer", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "LowParse.BitFields.get_bitfield_set_bitfield_same", "Prims.op_Multiply", "Prims.op_Subtraction", "Prims.unit", "LowParse.Endianness.BitFields.slice_n_to_be_bitfield", "QUIC.Impl.PacketNumber.set_left_bitfield", "Prims.l_True", "Prims.squash", "Prims.eq2", "FStar.Seq.Base.seq", "FStar.UInt8.t", "FStar.Seq.Base.slice", "FStar.Endianness.n_to_be", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val set_left_bitfield_left\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n : Lemma\n (Seq.slice (E.n_to_be 4 (Secret.v (set_left_bitfield pn_len before x))) 0 (Secret.v pn_len) ==\n E.n_to_be (Secret.v pn_len) (Secret.v x))\nlet set_left_bitfield_left\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n : Lemma\n (Seq.slice (E.n_to_be 4 (Secret.v (set_left_bitfield pn_len before x))) 0 (Secret.v pn_len) ==\n E.n_to_be (Secret.v pn_len) (Secret.v x)) =", "completed_definiton": "E.slice_n_to_be_bitfield 4 (Secret.v (set_left_bitfield pn_len before x)) 0 (Secret.v pn_len);\nBF.get_bitfield_set_bitfield_same #32\n (Secret.v before)\n (8 `op_Multiply` (4 - Secret.v pn_len))\n 32\n (Secret.v x)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.PacketNumber.fst", "name": "QUIC.Impl.PacketNumber.set_left_bitfield_aux", "original_source_type": "val set_left_bitfield_aux\n (pn_len: packet_number_length_t)\n (pn_len' : U32.t { 1 <= U32.v pn_len' /\\ U32.v pn_len' <= 4 } )\n (before: Secret.uint32)\n (x: Secret.uint32 {\n Secret.v pn_len == U32.v pn_len' ==> LP.bounded_integer_prop (Secret.v pn_len) (U32.uint_to_t (Secret.v x))\n })\n (mask: Secret.uint32 { Secret.v mask == pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) - 1 })\n: Tot (after: Secret.uint32 { Secret.v after == (if Secret.v pn_len = U32.v pn_len' then \nBF.set_bitfield #32 (Secret.v before) (8 `Prims.op_Multiply` (4 - Secret.v pn_len)) 32 (Secret.v x <: nat) else 0) })", "source_type": "val set_left_bitfield_aux\n (pn_len: packet_number_length_t)\n (pn_len' : U32.t { 1 <= U32.v pn_len' /\\ U32.v pn_len' <= 4 } )\n (before: Secret.uint32)\n (x: Secret.uint32 {\n Secret.v pn_len == U32.v pn_len' ==> LP.bounded_integer_prop (Secret.v pn_len) (U32.uint_to_t (Secret.v x))\n })\n (mask: Secret.uint32 { Secret.v mask == pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) - 1 })\n: Tot (after: Secret.uint32 { Secret.v after == (if Secret.v pn_len = U32.v pn_len' then \nBF.set_bitfield #32 (Secret.v before) (8 `Prims.op_Multiply` (4 - Secret.v pn_len)) 32 (Secret.v x <: nat) else 0) })", "source_definition": "let set_left_bitfield_aux\n pn_len pn_len' before x mask\n= \n [@inline_let]\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n (pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 (pn_len' `U32.sub` 1ul)) `Secret.mul` Secret.set_bitfield before (8ul `U32.mul` (4ul `U32.sub` pn_len')) 32ul (set_left_bitfield_arg pn_len pn_len' x mask)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 316, "start_col": 2, "end_line": 318, "end_col": 213 }, "file_context": "module QUIC.Impl.PacketNumber\nopen QUIC.Spec.PacketNumber\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule HST = FStar.HyperStack.ST\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule LP = LowParse.Spec\nmodule Seq = QUIC.Secret.Seq\n\nfriend QUIC.Spec.PacketNumber\nmodule Spec = QUIC.Spec.PacketNumber\n\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule E = LowParse.Endianness.BitFields\n\nlet be_to_n_4_eq\n (b: Seq.lseq U8.t 4)\n: Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 2) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 0)\n )))))))\n= assert_norm (pow2 8 == 256);\n E.reveal_be_to_n b;\n let b3 = Seq.slice b 0 3 in\n E.reveal_be_to_n b3;\n let b2 = Seq.slice b3 0 2 in\n E.reveal_be_to_n b2;\n let b1 = Seq.slice b2 0 1 in\n E.reveal_be_to_n b1;\n E.reveal_be_to_n (Seq.slice b1 0 0)\n\n#push-options \"--z3rlimit 64\"\n\nlet read_u32\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse LP.parse_u32 (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n= \n let h = HST.get () in\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n be_to_n_4_eq (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4);\n let b3 = B.index b 3ul in\n let b2 = B.index b 2ul in\n let b1 = B.index b 1ul in\n let b0 = B.index b 0ul in\n Secret.to_u32 b3 `Secret.add` (Secret.to_u32 256ul `Secret.mul` (\n Secret.to_u32 b2 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b1 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b0\n ))))))\n\n#pop-options\n\nmodule BF = LowParse.BitFields\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet read_bounded_integer\n (pn_len: packet_number_length_t)\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse (LP.parse_bounded_integer (Secret.v pn_len)) (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n=\n let h = HST.get () in\n LP.parse_bounded_integer_spec (Secret.v pn_len) (Seq.seq_reveal (B.as_seq h b));\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n E.bitfield_be_to_n_slice (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4) 0 (Secret.v pn_len);\n let x = read_u32 b in\n BF.get_bitfield_full #32 (Secret.v x);\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.get_bitfield x 24ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.get_bitfield x 16ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul`\nSecret.get_bitfield x 8ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` x)\n\n#pop-options\n\nmodule U = FStar.UInt\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet bound_npn\n (pn_len: packet_number_length_t)\n: Tot (x: packet_number_t { Secret.v x == bound_npn' (Secret.v pn_len - 1) })\n= let pn_len_1 = Secret.to_u64 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 0ul) `Secret.mul` Secret.to_u64 256uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 1ul) `Secret.mul` Secret.to_u64 65536uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 2ul) `Secret.mul` Secret.to_u64 16777216uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 3ul) `Secret.mul` Secret.to_u64 4294967296uL)\n\n#pop-options\n\ninline_for_extraction\nlet secret_bounded_integer (i: LP.integer_size) = (x: Secret.uint32 { LP.bounded_integer_prop i (U32.uint_to_t (Secret.v x)) })\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 2 --initial_ifuel 2 --z3rlimit 4096 --query_stats\"\n\nmodule U62 = QUIC.UInt62\nmodule Lemmas = QUIC.Spec.PacketNumber.Lemmas\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet expand_pn_aux\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: Secret.uint64 { Secret.v pn == expand_pn' (Secret.v pn_len - 1) (Secret.v last) (Secret.v npn) })\n= let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected : U62.secret = last `Secret.add` Secret.to_u64 1uL in\n let bound = bound_npn pn_len in\n let bound_2 = bound `Secret.shift_right` 1ul in\n FStar.UInt.shift_right_value_lemma #64 (Secret.v bound) 1;\n assert (Secret.v bound_2 == Secret.v bound / 2);\n let candidate = Lemmas.replace_modulo expected (8 `Prims.op_Multiply` Secret.v pn_len) (bound `Secret.sub` Secret.to_u64 1uL) (Secret.to_u64 npn) in\n Lemmas.lemma_replace_modulo_bound (Secret.v expected) (8*(Secret.v pn_len)) (Secret.v npn) 62;\n let bound_2_le_expected = bound_2 `Secret.secret_is_le_64` expected in\n let cond_1 =\n bound_2_le_expected `Secret.logand_one_bit`\n (candidate `Secret.secret_is_le_64` ((bound_2_le_expected `Secret.mul` expected) `Secret.sub` (bound_2_le_expected `Secret.mul` bound_2))) `Secret.logand_one_bit`\n (candidate `Secret.secret_is_lt_64` (Secret.to_u64 U62.bound `Secret.sub` bound))\n in\n assert (Secret.v cond_1 == (\n if\n Secret.v bound_2 <= Secret.v expected &&\n Secret.v candidate <= (Secret.v expected - Secret.v bound_2) &&\n Secret.v candidate < U62.v U62.bound - Secret.v bound\n then 1\n else 0\n ));\n let cond_2 =\n Secret.lognot_one_bit cond_1 `Secret.logand_one_bit`\n ((expected `Secret.add` bound_2) `Secret.secret_is_lt_64` candidate) `Secret.logand_one_bit`\n (bound `Secret.secret_is_le_64` candidate)\n in\n assert (Secret.v cond_2 == (\n if\n Secret.v cond_1 = 0 &&\n Secret.v expected + Secret.v bound_2 < Secret.v candidate &&\n Secret.v bound <= Secret.v candidate\n then 1\n else 0\n ));\n (candidate `Secret.add` (cond_1 `Secret.mul` bound)) `Secret.sub` (cond_2 `Secret.mul` bound)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n[@\"opaque_to_smt\"]\nlet expand_pn\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: packet_number_t { pn == synth_packet_number last pn_len (U32.uint_to_t (Secret.v npn)) })\n= expand_pn_aux pn_len last npn\n\n#pop-options\n\nlet read_packet_number\n last pn_len b\n= let h = HST.get () in\n LP.parse_synth_eq (LP.lift_parser (parse_reduced_pn pn_len)) (synth_packet_number last pn_len) (Seq.seq_reveal (B.as_seq h b));\n let npn = read_bounded_integer pn_len b in\n expand_pn pn_len last npn\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet reduce_pn\n (pn_len: packet_number_length_t)\n (pn: packet_number_t)\n: Tot (b: secret_bounded_integer (Secret.v pn_len) { Secret.v b == reduce_pn' (Secret.v pn_len - 1) (Secret.v pn) })\n= let mask = bound_npn pn_len `Secret.sub` Secret.to_u64 1uL in\n Secret.logand_spec pn mask;\n Lemmas.logand_mask #64 (Secret.v pn) (8 `Prims.op_Multiply` Secret.v pn_len);\n Secret.to_u32 (pn `Secret.logand` mask)\n\n#pop-options\n\nlet serialize_u32_spec\n (x: U32.t)\n: Lemma\n (LP.serialize LP.serialize_u32 x == E.n_to_be 4 (U32.v x))\n= LP.parse_u32_spec (E.n_to_be 4 (U32.v x));\n LP.parse_injective LP.parse_u32 (LP.serialize LP.serialize_u32 x) (E.n_to_be 4 (U32.v x))\n\n#push-options \"--z3rlimit 16\"\n\nlet write_u32\n (x: Secret.uint32)\n (b: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h _ h' ->\n let b' = B.gsub b 0ul 4ul in\n B.modifies (B.loc_buffer b') h h' /\\\n Seq.seq_reveal (B.as_seq h' b') `Seq.equal` LP.serialize (LP.serialize_u32) (U32.uint_to_t (Secret.v x))\n ))\n= serialize_u32_spec (U32.uint_to_t (Secret.v x));\n E.index_n_to_be 4 (Secret.v x) 0;\n E.index_n_to_be 4 (Secret.v x) 1;\n E.index_n_to_be 4 (Secret.v x) 2;\n E.index_n_to_be 4 (Secret.v x) 3;\n let b' = B.sub b 0ul 4ul in\n B.upd b' 0ul (Secret.to_u8 (x `Secret.shift_right` 24ul));\n B.upd b' 1ul (Secret.to_u8 (x `Secret.shift_right` 16ul));\n B.upd b' 2ul (Secret.to_u8 (x `Secret.shift_right` 8ul));\n B.upd b' 3ul (Secret.to_u8 x)\n\n#pop-options\n\n#push-options \"--z3rlimit 256\"\n\n#restart-solver\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nlet set_left_bitfield_arg\n (pn_len: packet_number_length_t)\n (pn_len' : U32.t { 1 <= U32.v pn_len' /\\ U32.v pn_len' <= 4 } )\n (x: Secret.uint32 {\n Secret.v pn_len == U32.v pn_len' ==> LP.bounded_integer_prop (Secret.v pn_len) (U32.uint_to_t (Secret.v x))\n })\n (mask: Secret.uint32 { Secret.v mask == pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) - 1 })\n: Tot (y: secret_bounded_integer (U32.v pn_len') {\n Secret.v pn_len == U32.v pn_len' ==> Secret.v y == Secret.v x\n })\n=\n let f () : Lemma\n (requires (Secret.v pn_len == U32.v pn_len'))\n (ensures (\n Secret.v pn_len == U32.v pn_len' /\\\n Secret.v x % pow2 (8 `Prims.op_Multiply` U32.v pn_len' ) == Secret.v x\n ))\n = LP.bounded_integer_prop_equiv (Secret.v pn_len) (U32.uint_to_t (Secret.v x));\n FStar.Math.Lemmas.small_mod (Secret.v x) (pow2 (8 `Prims.op_Multiply` U32.v pn_len'))\n in\n let g () : Lemma\n (Secret.v pn_len == U32.v pn_len' ==>\n Secret.v x % pow2 (8 `Prims.op_Multiply` U32.v pn_len' ) == Secret.v x\n )\n = Classical.move_requires f ()\n in\n g ();\n Lemmas.logand_mask #32 (Secret.v x) (8 `Prims.op_Multiply` U32.v pn_len');\n [@inline_let]\n let y = x `Secret.logand` mask in\n assert (Secret.v y == U.logand #32 (Secret.v x) (Secret.v mask));\n y\n\n#pop-options\n\n#push-options \"--z3rlimit 256\"\n\n#restart-solver\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nval set_left_bitfield_aux\n (pn_len: packet_number_length_t)\n (pn_len' : U32.t { 1 <= U32.v pn_len' /\\ U32.v pn_len' <= 4 } )\n (before: Secret.uint32)\n (x: Secret.uint32 {\n Secret.v pn_len == U32.v pn_len' ==> LP.bounded_integer_prop (Secret.v pn_len) (U32.uint_to_t (Secret.v x))\n })\n (mask: Secret.uint32 { Secret.v mask == pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) - 1 })\n: Tot (after: Secret.uint32 { Secret.v after == (if Secret.v pn_len = U32.v pn_len' then \nBF.set_bitfield #32 (Secret.v before) (8 `Prims.op_Multiply` (4 - Secret.v pn_len)) 32 (Secret.v x <: nat) else 0) })\n\nlet set_left_bitfield_aux\n pn_len pn_len' before x mask", "dependencies": { "source_file": "QUIC.Impl.PacketNumber.fst", "checked_file": "QUIC.Impl.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.fst.checked", "LowParse.Endianness.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "E", "full_module": "LowParse.Endianness.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 256, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n pn_len': FStar.UInt32.t{1 <= FStar.UInt32.v pn_len' /\\ FStar.UInt32.v pn_len' <= 4} ->\n before: Lib.IntTypes.uint32 ->\n x:\n Lib.IntTypes.uint32\n { QUIC.Secret.Int.Base.v pn_len == FStar.UInt32.v pn_len' ==>\n LowParse.Spec.BoundedInt.bounded_integer_prop (QUIC.Secret.Int.Base.v pn_len)\n (FStar.UInt32.uint_to_t (QUIC.Secret.Int.Base.v x)) } ->\n mask:\n Lib.IntTypes.uint32\n {QUIC.Secret.Int.Base.v mask == Prims.pow2 (8 * FStar.UInt32.v pn_len') - 1}\n -> after:\n Lib.IntTypes.uint32\n { QUIC.Secret.Int.Base.v after ==\n (match QUIC.Secret.Int.Base.v pn_len = FStar.UInt32.v pn_len' with\n | true ->\n LowParse.BitFields.set_bitfield (QUIC.Secret.Int.Base.v before)\n (8 * (4 - QUIC.Secret.Int.Base.v pn_len))\n 32\n (QUIC.Secret.Int.Base.v x)\n | _ -> 0) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "FStar.UInt32.t", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "Lib.IntTypes.uint32", "Prims.l_imp", "Prims.eq2", "Prims.int", "Prims.l_or", "Lib.IntTypes.range", "Lib.IntTypes.U32", "FStar.UInt.size", "FStar.UInt32.n", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.SEC", "LowParse.Spec.BoundedInt.bounded_integer_prop", "FStar.UInt32.uint_to_t", "Prims.op_Subtraction", "Prims.pow2", "Prims.op_Multiply", "Lib.IntTypes.mul", "QUIC.Secret.Int.secrets_are_equal_32_2", "Lib.IntTypes.to_u32", "Lib.IntTypes.PUB", "FStar.UInt32.sub", "FStar.UInt32.__uint_to_t", "QUIC.Secret.Int.set_bitfield", "FStar.UInt32.mul", "QUIC.Impl.PacketNumber.set_left_bitfield_arg", "Lib.IntTypes.int_t", "Lib.IntTypes.sub", "Prims.op_Equality", "LowParse.BitFields.set_bitfield", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val set_left_bitfield_aux\n (pn_len: packet_number_length_t)\n (pn_len' : U32.t { 1 <= U32.v pn_len' /\\ U32.v pn_len' <= 4 } )\n (before: Secret.uint32)\n (x: Secret.uint32 {\n Secret.v pn_len == U32.v pn_len' ==> LP.bounded_integer_prop (Secret.v pn_len) (U32.uint_to_t (Secret.v x))\n })\n (mask: Secret.uint32 { Secret.v mask == pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) - 1 })\n: Tot (after: Secret.uint32 { Secret.v after == (if Secret.v pn_len = U32.v pn_len' then \nBF.set_bitfield #32 (Secret.v before) (8 `Prims.op_Multiply` (4 - Secret.v pn_len)) 32 (Secret.v x <: nat) else 0) })\nlet set_left_bitfield_aux pn_len pn_len' before x mask =", "completed_definiton": "[@@ inline_let ]let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` (Secret.to_u32 1ul)) in\n(pn_len_1 `Secret.secrets_are_equal_32_2` (Secret.to_u32 (pn_len' `U32.sub` 1ul)))\n`Secret.mul`\n(Secret.set_bitfield before\n (8ul `U32.mul` (4ul `U32.sub` pn_len'))\n 32ul\n (set_left_bitfield_arg pn_len pn_len' x mask))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.PacketNumber.fst", "name": "QUIC.Impl.PacketNumber.set_left_bitfield", "original_source_type": "val set_left_bitfield\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n : Tot\n (after:\n Secret.uint32\n { Secret.v after =\n BF.set_bitfield #32\n (Secret.v before)\n (8 `Prims.op_Multiply` (4 - Secret.v pn_len))\n 32\n (Secret.v x) })", "source_type": "val set_left_bitfield\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n : Tot\n (after:\n Secret.uint32\n { Secret.v after =\n BF.set_bitfield #32\n (Secret.v before)\n (8 `Prims.op_Multiply` (4 - Secret.v pn_len))\n 32\n (Secret.v x) })", "source_definition": "let set_left_bitfield\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n: Tot (after: Secret.uint32 { Secret.v after = BF.set_bitfield #32 (Secret.v before) (8 `Prims.op_Multiply` (4 - Secret.v pn_len)) 32 (Secret.v x) })\n=\n BF.set_bitfield_full #32 (Secret.v before) (Secret.v x);\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 16 == 65536);\n assert_norm (pow2 24 == 16777216);\n [@inline_let]\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n set_left_bitfield_aux pn_len 1ul before x (Secret.to_u32 255ul) `Secret.add`\n set_left_bitfield_aux pn_len 2ul before x (Secret.to_u32 65535ul) `Secret.add`\n set_left_bitfield_aux pn_len 3ul before x (Secret.to_u32 16777215ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` x)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 333, "start_col": 2, "end_line": 342, "end_col": 79 }, "file_context": "module QUIC.Impl.PacketNumber\nopen QUIC.Spec.PacketNumber\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule HST = FStar.HyperStack.ST\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule LP = LowParse.Spec\nmodule Seq = QUIC.Secret.Seq\n\nfriend QUIC.Spec.PacketNumber\nmodule Spec = QUIC.Spec.PacketNumber\n\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule E = LowParse.Endianness.BitFields\n\nlet be_to_n_4_eq\n (b: Seq.lseq U8.t 4)\n: Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 2) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 0)\n )))))))\n= assert_norm (pow2 8 == 256);\n E.reveal_be_to_n b;\n let b3 = Seq.slice b 0 3 in\n E.reveal_be_to_n b3;\n let b2 = Seq.slice b3 0 2 in\n E.reveal_be_to_n b2;\n let b1 = Seq.slice b2 0 1 in\n E.reveal_be_to_n b1;\n E.reveal_be_to_n (Seq.slice b1 0 0)\n\n#push-options \"--z3rlimit 64\"\n\nlet read_u32\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse LP.parse_u32 (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n= \n let h = HST.get () in\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n be_to_n_4_eq (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4);\n let b3 = B.index b 3ul in\n let b2 = B.index b 2ul in\n let b1 = B.index b 1ul in\n let b0 = B.index b 0ul in\n Secret.to_u32 b3 `Secret.add` (Secret.to_u32 256ul `Secret.mul` (\n Secret.to_u32 b2 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b1 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b0\n ))))))\n\n#pop-options\n\nmodule BF = LowParse.BitFields\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet read_bounded_integer\n (pn_len: packet_number_length_t)\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse (LP.parse_bounded_integer (Secret.v pn_len)) (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n=\n let h = HST.get () in\n LP.parse_bounded_integer_spec (Secret.v pn_len) (Seq.seq_reveal (B.as_seq h b));\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n E.bitfield_be_to_n_slice (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4) 0 (Secret.v pn_len);\n let x = read_u32 b in\n BF.get_bitfield_full #32 (Secret.v x);\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.get_bitfield x 24ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.get_bitfield x 16ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul`\nSecret.get_bitfield x 8ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` x)\n\n#pop-options\n\nmodule U = FStar.UInt\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet bound_npn\n (pn_len: packet_number_length_t)\n: Tot (x: packet_number_t { Secret.v x == bound_npn' (Secret.v pn_len - 1) })\n= let pn_len_1 = Secret.to_u64 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 0ul) `Secret.mul` Secret.to_u64 256uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 1ul) `Secret.mul` Secret.to_u64 65536uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 2ul) `Secret.mul` Secret.to_u64 16777216uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 3ul) `Secret.mul` Secret.to_u64 4294967296uL)\n\n#pop-options\n\ninline_for_extraction\nlet secret_bounded_integer (i: LP.integer_size) = (x: Secret.uint32 { LP.bounded_integer_prop i (U32.uint_to_t (Secret.v x)) })\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 2 --initial_ifuel 2 --z3rlimit 4096 --query_stats\"\n\nmodule U62 = QUIC.UInt62\nmodule Lemmas = QUIC.Spec.PacketNumber.Lemmas\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet expand_pn_aux\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: Secret.uint64 { Secret.v pn == expand_pn' (Secret.v pn_len - 1) (Secret.v last) (Secret.v npn) })\n= let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected : U62.secret = last `Secret.add` Secret.to_u64 1uL in\n let bound = bound_npn pn_len in\n let bound_2 = bound `Secret.shift_right` 1ul in\n FStar.UInt.shift_right_value_lemma #64 (Secret.v bound) 1;\n assert (Secret.v bound_2 == Secret.v bound / 2);\n let candidate = Lemmas.replace_modulo expected (8 `Prims.op_Multiply` Secret.v pn_len) (bound `Secret.sub` Secret.to_u64 1uL) (Secret.to_u64 npn) in\n Lemmas.lemma_replace_modulo_bound (Secret.v expected) (8*(Secret.v pn_len)) (Secret.v npn) 62;\n let bound_2_le_expected = bound_2 `Secret.secret_is_le_64` expected in\n let cond_1 =\n bound_2_le_expected `Secret.logand_one_bit`\n (candidate `Secret.secret_is_le_64` ((bound_2_le_expected `Secret.mul` expected) `Secret.sub` (bound_2_le_expected `Secret.mul` bound_2))) `Secret.logand_one_bit`\n (candidate `Secret.secret_is_lt_64` (Secret.to_u64 U62.bound `Secret.sub` bound))\n in\n assert (Secret.v cond_1 == (\n if\n Secret.v bound_2 <= Secret.v expected &&\n Secret.v candidate <= (Secret.v expected - Secret.v bound_2) &&\n Secret.v candidate < U62.v U62.bound - Secret.v bound\n then 1\n else 0\n ));\n let cond_2 =\n Secret.lognot_one_bit cond_1 `Secret.logand_one_bit`\n ((expected `Secret.add` bound_2) `Secret.secret_is_lt_64` candidate) `Secret.logand_one_bit`\n (bound `Secret.secret_is_le_64` candidate)\n in\n assert (Secret.v cond_2 == (\n if\n Secret.v cond_1 = 0 &&\n Secret.v expected + Secret.v bound_2 < Secret.v candidate &&\n Secret.v bound <= Secret.v candidate\n then 1\n else 0\n ));\n (candidate `Secret.add` (cond_1 `Secret.mul` bound)) `Secret.sub` (cond_2 `Secret.mul` bound)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n[@\"opaque_to_smt\"]\nlet expand_pn\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: packet_number_t { pn == synth_packet_number last pn_len (U32.uint_to_t (Secret.v npn)) })\n= expand_pn_aux pn_len last npn\n\n#pop-options\n\nlet read_packet_number\n last pn_len b\n= let h = HST.get () in\n LP.parse_synth_eq (LP.lift_parser (parse_reduced_pn pn_len)) (synth_packet_number last pn_len) (Seq.seq_reveal (B.as_seq h b));\n let npn = read_bounded_integer pn_len b in\n expand_pn pn_len last npn\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet reduce_pn\n (pn_len: packet_number_length_t)\n (pn: packet_number_t)\n: Tot (b: secret_bounded_integer (Secret.v pn_len) { Secret.v b == reduce_pn' (Secret.v pn_len - 1) (Secret.v pn) })\n= let mask = bound_npn pn_len `Secret.sub` Secret.to_u64 1uL in\n Secret.logand_spec pn mask;\n Lemmas.logand_mask #64 (Secret.v pn) (8 `Prims.op_Multiply` Secret.v pn_len);\n Secret.to_u32 (pn `Secret.logand` mask)\n\n#pop-options\n\nlet serialize_u32_spec\n (x: U32.t)\n: Lemma\n (LP.serialize LP.serialize_u32 x == E.n_to_be 4 (U32.v x))\n= LP.parse_u32_spec (E.n_to_be 4 (U32.v x));\n LP.parse_injective LP.parse_u32 (LP.serialize LP.serialize_u32 x) (E.n_to_be 4 (U32.v x))\n\n#push-options \"--z3rlimit 16\"\n\nlet write_u32\n (x: Secret.uint32)\n (b: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h _ h' ->\n let b' = B.gsub b 0ul 4ul in\n B.modifies (B.loc_buffer b') h h' /\\\n Seq.seq_reveal (B.as_seq h' b') `Seq.equal` LP.serialize (LP.serialize_u32) (U32.uint_to_t (Secret.v x))\n ))\n= serialize_u32_spec (U32.uint_to_t (Secret.v x));\n E.index_n_to_be 4 (Secret.v x) 0;\n E.index_n_to_be 4 (Secret.v x) 1;\n E.index_n_to_be 4 (Secret.v x) 2;\n E.index_n_to_be 4 (Secret.v x) 3;\n let b' = B.sub b 0ul 4ul in\n B.upd b' 0ul (Secret.to_u8 (x `Secret.shift_right` 24ul));\n B.upd b' 1ul (Secret.to_u8 (x `Secret.shift_right` 16ul));\n B.upd b' 2ul (Secret.to_u8 (x `Secret.shift_right` 8ul));\n B.upd b' 3ul (Secret.to_u8 x)\n\n#pop-options\n\n#push-options \"--z3rlimit 256\"\n\n#restart-solver\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nlet set_left_bitfield_arg\n (pn_len: packet_number_length_t)\n (pn_len' : U32.t { 1 <= U32.v pn_len' /\\ U32.v pn_len' <= 4 } )\n (x: Secret.uint32 {\n Secret.v pn_len == U32.v pn_len' ==> LP.bounded_integer_prop (Secret.v pn_len) (U32.uint_to_t (Secret.v x))\n })\n (mask: Secret.uint32 { Secret.v mask == pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) - 1 })\n: Tot (y: secret_bounded_integer (U32.v pn_len') {\n Secret.v pn_len == U32.v pn_len' ==> Secret.v y == Secret.v x\n })\n=\n let f () : Lemma\n (requires (Secret.v pn_len == U32.v pn_len'))\n (ensures (\n Secret.v pn_len == U32.v pn_len' /\\\n Secret.v x % pow2 (8 `Prims.op_Multiply` U32.v pn_len' ) == Secret.v x\n ))\n = LP.bounded_integer_prop_equiv (Secret.v pn_len) (U32.uint_to_t (Secret.v x));\n FStar.Math.Lemmas.small_mod (Secret.v x) (pow2 (8 `Prims.op_Multiply` U32.v pn_len'))\n in\n let g () : Lemma\n (Secret.v pn_len == U32.v pn_len' ==>\n Secret.v x % pow2 (8 `Prims.op_Multiply` U32.v pn_len' ) == Secret.v x\n )\n = Classical.move_requires f ()\n in\n g ();\n Lemmas.logand_mask #32 (Secret.v x) (8 `Prims.op_Multiply` U32.v pn_len');\n [@inline_let]\n let y = x `Secret.logand` mask in\n assert (Secret.v y == U.logand #32 (Secret.v x) (Secret.v mask));\n y\n\n#pop-options\n\n#push-options \"--z3rlimit 256\"\n\n#restart-solver\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nval set_left_bitfield_aux\n (pn_len: packet_number_length_t)\n (pn_len' : U32.t { 1 <= U32.v pn_len' /\\ U32.v pn_len' <= 4 } )\n (before: Secret.uint32)\n (x: Secret.uint32 {\n Secret.v pn_len == U32.v pn_len' ==> LP.bounded_integer_prop (Secret.v pn_len) (U32.uint_to_t (Secret.v x))\n })\n (mask: Secret.uint32 { Secret.v mask == pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) - 1 })\n: Tot (after: Secret.uint32 { Secret.v after == (if Secret.v pn_len = U32.v pn_len' then \nBF.set_bitfield #32 (Secret.v before) (8 `Prims.op_Multiply` (4 - Secret.v pn_len)) 32 (Secret.v x <: nat) else 0) })\n\nlet set_left_bitfield_aux\n pn_len pn_len' before x mask\n= \n [@inline_let]\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n (pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 (pn_len' `U32.sub` 1ul)) `Secret.mul` Secret.set_bitfield before (8ul `U32.mul` (4ul `U32.sub` pn_len')) 32ul (set_left_bitfield_arg pn_len pn_len' x mask)\n\n#pop-options\n\n#push-options \"--z3rlimit 128\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet set_left_bitfield\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n: Tot (after: Secret.uint32 { Secret.v after = BF.set_bitfield #32 (Secret.v before) (8 `Prims.op_Multiply` (4 - Secret.v pn_len)) 32 (Secret.v x) })", "dependencies": { "source_file": "QUIC.Impl.PacketNumber.fst", "checked_file": "QUIC.Impl.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.fst.checked", "LowParse.Endianness.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "E", "full_module": "LowParse.Endianness.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n before: Lib.IntTypes.uint32 ->\n x: QUIC.Impl.PacketNumber.secret_bounded_integer (QUIC.Secret.Int.Base.v pn_len)\n -> after:\n Lib.IntTypes.uint32\n { QUIC.Secret.Int.Base.v after =\n LowParse.BitFields.set_bitfield (QUIC.Secret.Int.Base.v before)\n (8 * (4 - QUIC.Secret.Int.Base.v pn_len))\n 32\n (QUIC.Secret.Int.Base.v x) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "Lib.IntTypes.uint32", "QUIC.Impl.PacketNumber.secret_bounded_integer", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "Lib.IntTypes.add", "QUIC.Impl.PacketNumber.set_left_bitfield_aux", "FStar.UInt32.__uint_to_t", "Lib.IntTypes.to_u32", "Lib.IntTypes.PUB", "Lib.IntTypes.mul", "QUIC.Secret.Int.secrets_are_equal_32_2", "Lib.IntTypes.int_t", "Lib.IntTypes.sub", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.int", "Prims.pow2", "LowParse.BitFields.set_bitfield_full", "Prims.b2t", "Prims.op_Equality", "Prims.l_or", "Lib.IntTypes.range", "FStar.UInt.size", "LowParse.BitFields.set_bitfield", "Prims.op_Multiply", "Prims.op_Subtraction" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val set_left_bitfield\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n : Tot\n (after:\n Secret.uint32\n { Secret.v after =\n BF.set_bitfield #32\n (Secret.v before)\n (8 `Prims.op_Multiply` (4 - Secret.v pn_len))\n 32\n (Secret.v x) })\nlet set_left_bitfield\n (pn_len: packet_number_length_t)\n (before: Secret.uint32)\n (x: secret_bounded_integer (Secret.v pn_len))\n : Tot\n (after:\n Secret.uint32\n { Secret.v after =\n BF.set_bitfield #32\n (Secret.v before)\n (8 `Prims.op_Multiply` (4 - Secret.v pn_len))\n 32\n (Secret.v x) }) =", "completed_definiton": "BF.set_bitfield_full #32 (Secret.v before) (Secret.v x);\nassert_norm (pow2 8 == 256);\nassert_norm (pow2 16 == 65536);\nassert_norm (pow2 24 == 16777216);\n[@@ inline_let ]let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` (Secret.to_u32 1ul)) in\n(((set_left_bitfield_aux pn_len 1ul before x (Secret.to_u32 255ul))\n `Secret.add`\n (set_left_bitfield_aux pn_len 2ul before x (Secret.to_u32 65535ul)))\n `Secret.add`\n (set_left_bitfield_aux pn_len 3ul before x (Secret.to_u32 16777215ul)))\n`Secret.add`\n((pn_len_1 `Secret.secrets_are_equal_32_2` (Secret.to_u32 3ul)) `Secret.mul` x)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.PacketNumber.fst", "name": "QUIC.Impl.PacketNumber.set_left_bitfield_arg", "original_source_type": "val set_left_bitfield_arg\n (pn_len: packet_number_length_t)\n (pn_len': U32.t{1 <= U32.v pn_len' /\\ U32.v pn_len' <= 4})\n (x:\n Secret.uint32\n { Secret.v pn_len == U32.v pn_len' ==>\n LP.bounded_integer_prop (Secret.v pn_len) (U32.uint_to_t (Secret.v x)) })\n (mask: Secret.uint32{Secret.v mask == pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) - 1})\n : Tot\n (y:\n secret_bounded_integer (U32.v pn_len')\n {Secret.v pn_len == U32.v pn_len' ==> Secret.v y == Secret.v x})", "source_type": "val set_left_bitfield_arg\n (pn_len: packet_number_length_t)\n (pn_len': U32.t{1 <= U32.v pn_len' /\\ U32.v pn_len' <= 4})\n (x:\n Secret.uint32\n { Secret.v pn_len == U32.v pn_len' ==>\n LP.bounded_integer_prop (Secret.v pn_len) (U32.uint_to_t (Secret.v x)) })\n (mask: Secret.uint32{Secret.v mask == pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) - 1})\n : Tot\n (y:\n secret_bounded_integer (U32.v pn_len')\n {Secret.v pn_len == U32.v pn_len' ==> Secret.v y == Secret.v x})", "source_definition": "let set_left_bitfield_arg\n (pn_len: packet_number_length_t)\n (pn_len' : U32.t { 1 <= U32.v pn_len' /\\ U32.v pn_len' <= 4 } )\n (x: Secret.uint32 {\n Secret.v pn_len == U32.v pn_len' ==> LP.bounded_integer_prop (Secret.v pn_len) (U32.uint_to_t (Secret.v x))\n })\n (mask: Secret.uint32 { Secret.v mask == pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) - 1 })\n: Tot (y: secret_bounded_integer (U32.v pn_len') {\n Secret.v pn_len == U32.v pn_len' ==> Secret.v y == Secret.v x\n })\n=\n let f () : Lemma\n (requires (Secret.v pn_len == U32.v pn_len'))\n (ensures (\n Secret.v pn_len == U32.v pn_len' /\\\n Secret.v x % pow2 (8 `Prims.op_Multiply` U32.v pn_len' ) == Secret.v x\n ))\n = LP.bounded_integer_prop_equiv (Secret.v pn_len) (U32.uint_to_t (Secret.v x));\n FStar.Math.Lemmas.small_mod (Secret.v x) (pow2 (8 `Prims.op_Multiply` U32.v pn_len'))\n in\n let g () : Lemma\n (Secret.v pn_len == U32.v pn_len' ==>\n Secret.v x % pow2 (8 `Prims.op_Multiply` U32.v pn_len' ) == Secret.v x\n )\n = Classical.move_requires f ()\n in\n g ();\n Lemmas.logand_mask #32 (Secret.v x) (8 `Prims.op_Multiply` U32.v pn_len');\n [@inline_let]\n let y = x `Secret.logand` mask in\n assert (Secret.v y == U.logand #32 (Secret.v x) (Secret.v mask));\n y", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 271, "start_col": 1, "end_line": 292, "end_col": 3 }, "file_context": "module QUIC.Impl.PacketNumber\nopen QUIC.Spec.PacketNumber\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule HST = FStar.HyperStack.ST\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule LP = LowParse.Spec\nmodule Seq = QUIC.Secret.Seq\n\nfriend QUIC.Spec.PacketNumber\nmodule Spec = QUIC.Spec.PacketNumber\n\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule E = LowParse.Endianness.BitFields\n\nlet be_to_n_4_eq\n (b: Seq.lseq U8.t 4)\n: Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 2) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 0)\n )))))))\n= assert_norm (pow2 8 == 256);\n E.reveal_be_to_n b;\n let b3 = Seq.slice b 0 3 in\n E.reveal_be_to_n b3;\n let b2 = Seq.slice b3 0 2 in\n E.reveal_be_to_n b2;\n let b1 = Seq.slice b2 0 1 in\n E.reveal_be_to_n b1;\n E.reveal_be_to_n (Seq.slice b1 0 0)\n\n#push-options \"--z3rlimit 64\"\n\nlet read_u32\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse LP.parse_u32 (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n= \n let h = HST.get () in\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n be_to_n_4_eq (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4);\n let b3 = B.index b 3ul in\n let b2 = B.index b 2ul in\n let b1 = B.index b 1ul in\n let b0 = B.index b 0ul in\n Secret.to_u32 b3 `Secret.add` (Secret.to_u32 256ul `Secret.mul` (\n Secret.to_u32 b2 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b1 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b0\n ))))))\n\n#pop-options\n\nmodule BF = LowParse.BitFields\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet read_bounded_integer\n (pn_len: packet_number_length_t)\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse (LP.parse_bounded_integer (Secret.v pn_len)) (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n=\n let h = HST.get () in\n LP.parse_bounded_integer_spec (Secret.v pn_len) (Seq.seq_reveal (B.as_seq h b));\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n E.bitfield_be_to_n_slice (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4) 0 (Secret.v pn_len);\n let x = read_u32 b in\n BF.get_bitfield_full #32 (Secret.v x);\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.get_bitfield x 24ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.get_bitfield x 16ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul`\nSecret.get_bitfield x 8ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` x)\n\n#pop-options\n\nmodule U = FStar.UInt\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet bound_npn\n (pn_len: packet_number_length_t)\n: Tot (x: packet_number_t { Secret.v x == bound_npn' (Secret.v pn_len - 1) })\n= let pn_len_1 = Secret.to_u64 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 0ul) `Secret.mul` Secret.to_u64 256uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 1ul) `Secret.mul` Secret.to_u64 65536uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 2ul) `Secret.mul` Secret.to_u64 16777216uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 3ul) `Secret.mul` Secret.to_u64 4294967296uL)\n\n#pop-options\n\ninline_for_extraction\nlet secret_bounded_integer (i: LP.integer_size) = (x: Secret.uint32 { LP.bounded_integer_prop i (U32.uint_to_t (Secret.v x)) })\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 2 --initial_ifuel 2 --z3rlimit 4096 --query_stats\"\n\nmodule U62 = QUIC.UInt62\nmodule Lemmas = QUIC.Spec.PacketNumber.Lemmas\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet expand_pn_aux\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: Secret.uint64 { Secret.v pn == expand_pn' (Secret.v pn_len - 1) (Secret.v last) (Secret.v npn) })\n= let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected : U62.secret = last `Secret.add` Secret.to_u64 1uL in\n let bound = bound_npn pn_len in\n let bound_2 = bound `Secret.shift_right` 1ul in\n FStar.UInt.shift_right_value_lemma #64 (Secret.v bound) 1;\n assert (Secret.v bound_2 == Secret.v bound / 2);\n let candidate = Lemmas.replace_modulo expected (8 `Prims.op_Multiply` Secret.v pn_len) (bound `Secret.sub` Secret.to_u64 1uL) (Secret.to_u64 npn) in\n Lemmas.lemma_replace_modulo_bound (Secret.v expected) (8*(Secret.v pn_len)) (Secret.v npn) 62;\n let bound_2_le_expected = bound_2 `Secret.secret_is_le_64` expected in\n let cond_1 =\n bound_2_le_expected `Secret.logand_one_bit`\n (candidate `Secret.secret_is_le_64` ((bound_2_le_expected `Secret.mul` expected) `Secret.sub` (bound_2_le_expected `Secret.mul` bound_2))) `Secret.logand_one_bit`\n (candidate `Secret.secret_is_lt_64` (Secret.to_u64 U62.bound `Secret.sub` bound))\n in\n assert (Secret.v cond_1 == (\n if\n Secret.v bound_2 <= Secret.v expected &&\n Secret.v candidate <= (Secret.v expected - Secret.v bound_2) &&\n Secret.v candidate < U62.v U62.bound - Secret.v bound\n then 1\n else 0\n ));\n let cond_2 =\n Secret.lognot_one_bit cond_1 `Secret.logand_one_bit`\n ((expected `Secret.add` bound_2) `Secret.secret_is_lt_64` candidate) `Secret.logand_one_bit`\n (bound `Secret.secret_is_le_64` candidate)\n in\n assert (Secret.v cond_2 == (\n if\n Secret.v cond_1 = 0 &&\n Secret.v expected + Secret.v bound_2 < Secret.v candidate &&\n Secret.v bound <= Secret.v candidate\n then 1\n else 0\n ));\n (candidate `Secret.add` (cond_1 `Secret.mul` bound)) `Secret.sub` (cond_2 `Secret.mul` bound)\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n[@\"opaque_to_smt\"]\nlet expand_pn\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: packet_number_t { pn == synth_packet_number last pn_len (U32.uint_to_t (Secret.v npn)) })\n= expand_pn_aux pn_len last npn\n\n#pop-options\n\nlet read_packet_number\n last pn_len b\n= let h = HST.get () in\n LP.parse_synth_eq (LP.lift_parser (parse_reduced_pn pn_len)) (synth_packet_number last pn_len) (Seq.seq_reveal (B.as_seq h b));\n let npn = read_bounded_integer pn_len b in\n expand_pn pn_len last npn\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet reduce_pn\n (pn_len: packet_number_length_t)\n (pn: packet_number_t)\n: Tot (b: secret_bounded_integer (Secret.v pn_len) { Secret.v b == reduce_pn' (Secret.v pn_len - 1) (Secret.v pn) })\n= let mask = bound_npn pn_len `Secret.sub` Secret.to_u64 1uL in\n Secret.logand_spec pn mask;\n Lemmas.logand_mask #64 (Secret.v pn) (8 `Prims.op_Multiply` Secret.v pn_len);\n Secret.to_u32 (pn `Secret.logand` mask)\n\n#pop-options\n\nlet serialize_u32_spec\n (x: U32.t)\n: Lemma\n (LP.serialize LP.serialize_u32 x == E.n_to_be 4 (U32.v x))\n= LP.parse_u32_spec (E.n_to_be 4 (U32.v x));\n LP.parse_injective LP.parse_u32 (LP.serialize LP.serialize_u32 x) (E.n_to_be 4 (U32.v x))\n\n#push-options \"--z3rlimit 16\"\n\nlet write_u32\n (x: Secret.uint32)\n (b: B.buffer Secret.uint8)\n: HST.Stack unit\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h _ h' ->\n let b' = B.gsub b 0ul 4ul in\n B.modifies (B.loc_buffer b') h h' /\\\n Seq.seq_reveal (B.as_seq h' b') `Seq.equal` LP.serialize (LP.serialize_u32) (U32.uint_to_t (Secret.v x))\n ))\n= serialize_u32_spec (U32.uint_to_t (Secret.v x));\n E.index_n_to_be 4 (Secret.v x) 0;\n E.index_n_to_be 4 (Secret.v x) 1;\n E.index_n_to_be 4 (Secret.v x) 2;\n E.index_n_to_be 4 (Secret.v x) 3;\n let b' = B.sub b 0ul 4ul in\n B.upd b' 0ul (Secret.to_u8 (x `Secret.shift_right` 24ul));\n B.upd b' 1ul (Secret.to_u8 (x `Secret.shift_right` 16ul));\n B.upd b' 2ul (Secret.to_u8 (x `Secret.shift_right` 8ul));\n B.upd b' 3ul (Secret.to_u8 x)\n\n#pop-options\n\n#push-options \"--z3rlimit 256\"\n\n#restart-solver\n\ninline_for_extraction\n[@\"opaque_to_smt\"]\nlet set_left_bitfield_arg\n (pn_len: packet_number_length_t)\n (pn_len' : U32.t { 1 <= U32.v pn_len' /\\ U32.v pn_len' <= 4 } )\n (x: Secret.uint32 {\n Secret.v pn_len == U32.v pn_len' ==> LP.bounded_integer_prop (Secret.v pn_len) (U32.uint_to_t (Secret.v x))\n })\n (mask: Secret.uint32 { Secret.v mask == pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) - 1 })\n: Tot (y: secret_bounded_integer (U32.v pn_len') {\n Secret.v pn_len == U32.v pn_len' ==> Secret.v y == Secret.v x", "dependencies": { "source_file": "QUIC.Impl.PacketNumber.fst", "checked_file": "QUIC.Impl.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.fst.checked", "LowParse.Endianness.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "E", "full_module": "LowParse.Endianness.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 256, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n pn_len': FStar.UInt32.t{1 <= FStar.UInt32.v pn_len' /\\ FStar.UInt32.v pn_len' <= 4} ->\n x:\n Lib.IntTypes.uint32\n { QUIC.Secret.Int.Base.v pn_len == FStar.UInt32.v pn_len' ==>\n LowParse.Spec.BoundedInt.bounded_integer_prop (QUIC.Secret.Int.Base.v pn_len)\n (FStar.UInt32.uint_to_t (QUIC.Secret.Int.Base.v x)) } ->\n mask:\n Lib.IntTypes.uint32\n {QUIC.Secret.Int.Base.v mask == Prims.pow2 (8 * FStar.UInt32.v pn_len') - 1}\n -> y:\n QUIC.Impl.PacketNumber.secret_bounded_integer (FStar.UInt32.v pn_len')\n { QUIC.Secret.Int.Base.v pn_len == FStar.UInt32.v pn_len' ==>\n QUIC.Secret.Int.Base.v y == QUIC.Secret.Int.Base.v x }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "FStar.UInt32.t", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "Lib.IntTypes.uint32", "Prims.l_imp", "Prims.eq2", "Prims.int", "Prims.l_or", "Lib.IntTypes.range", "Lib.IntTypes.U32", "FStar.UInt.size", "FStar.UInt32.n", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.SEC", "LowParse.Spec.BoundedInt.bounded_integer_prop", "FStar.UInt32.uint_to_t", "Prims.op_Subtraction", "Prims.pow2", "Prims.op_Multiply", "Prims.unit", "Prims._assert", "FStar.UInt.logand", "Lib.IntTypes.int_t", "Lib.IntTypes.logand", "QUIC.Spec.PacketNumber.Lemmas.logand_mask", "Prims.l_True", "Prims.squash", "Lib.IntTypes.v", "Prims.op_Modulus", "Prims.Nil", "FStar.Pervasives.pattern", "FStar.Classical.move_requires", "FStar.Math.Lemmas.small_mod", "LowParse.Spec.BoundedInt.bounded_integer_prop_equiv", "QUIC.Impl.PacketNumber.secret_bounded_integer", "Lib.IntTypes.range_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val set_left_bitfield_arg\n (pn_len: packet_number_length_t)\n (pn_len': U32.t{1 <= U32.v pn_len' /\\ U32.v pn_len' <= 4})\n (x:\n Secret.uint32\n { Secret.v pn_len == U32.v pn_len' ==>\n LP.bounded_integer_prop (Secret.v pn_len) (U32.uint_to_t (Secret.v x)) })\n (mask: Secret.uint32{Secret.v mask == pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) - 1})\n : Tot\n (y:\n secret_bounded_integer (U32.v pn_len')\n {Secret.v pn_len == U32.v pn_len' ==> Secret.v y == Secret.v x})\nlet set_left_bitfield_arg\n (pn_len: packet_number_length_t)\n (pn_len': U32.t{1 <= U32.v pn_len' /\\ U32.v pn_len' <= 4})\n (x:\n Secret.uint32\n { Secret.v pn_len == U32.v pn_len' ==>\n LP.bounded_integer_prop (Secret.v pn_len) (U32.uint_to_t (Secret.v x)) })\n (mask: Secret.uint32{Secret.v mask == pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) - 1})\n : Tot\n (y:\n secret_bounded_integer (U32.v pn_len')\n {Secret.v pn_len == U32.v pn_len' ==> Secret.v y == Secret.v x}) =", "completed_definiton": "let f ()\n : Lemma (requires (Secret.v pn_len == U32.v pn_len'))\n (ensures\n (Secret.v pn_len == U32.v pn_len' /\\\n Secret.v x % pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) == Secret.v x)) =\n LP.bounded_integer_prop_equiv (Secret.v pn_len) (U32.uint_to_t (Secret.v x));\n FStar.Math.Lemmas.small_mod (Secret.v x) (pow2 (8 `Prims.op_Multiply` (U32.v pn_len')))\nin\nlet g ()\n : Lemma\n (Secret.v pn_len == U32.v pn_len' ==>\n Secret.v x % pow2 (8 `Prims.op_Multiply` (U32.v pn_len')) == Secret.v x) =\n Classical.move_requires f ()\nin\ng ();\nLemmas.logand_mask #32 (Secret.v x) (8 `Prims.op_Multiply` (U32.v pn_len'));\n[@@ inline_let ]let y = x `Secret.logand` mask in\nassert (Secret.v y == U.logand #32 (Secret.v x) (Secret.v mask));\ny", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.PacketNumber.fst", "name": "QUIC.Impl.PacketNumber.expand_pn_aux", "original_source_type": "val expand_pn_aux\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n : Tot\n (pn:\n Secret.uint64{Secret.v pn == expand_pn' (Secret.v pn_len - 1) (Secret.v last) (Secret.v npn)})", "source_type": "val expand_pn_aux\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n : Tot\n (pn:\n Secret.uint64{Secret.v pn == expand_pn' (Secret.v pn_len - 1) (Secret.v last) (Secret.v npn)})", "source_definition": "let expand_pn_aux\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n: Tot (pn: Secret.uint64 { Secret.v pn == expand_pn' (Secret.v pn_len - 1) (Secret.v last) (Secret.v npn) })\n= let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected : U62.secret = last `Secret.add` Secret.to_u64 1uL in\n let bound = bound_npn pn_len in\n let bound_2 = bound `Secret.shift_right` 1ul in\n FStar.UInt.shift_right_value_lemma #64 (Secret.v bound) 1;\n assert (Secret.v bound_2 == Secret.v bound / 2);\n let candidate = Lemmas.replace_modulo expected (8 `Prims.op_Multiply` Secret.v pn_len) (bound `Secret.sub` Secret.to_u64 1uL) (Secret.to_u64 npn) in\n Lemmas.lemma_replace_modulo_bound (Secret.v expected) (8*(Secret.v pn_len)) (Secret.v npn) 62;\n let bound_2_le_expected = bound_2 `Secret.secret_is_le_64` expected in\n let cond_1 =\n bound_2_le_expected `Secret.logand_one_bit`\n (candidate `Secret.secret_is_le_64` ((bound_2_le_expected `Secret.mul` expected) `Secret.sub` (bound_2_le_expected `Secret.mul` bound_2))) `Secret.logand_one_bit`\n (candidate `Secret.secret_is_lt_64` (Secret.to_u64 U62.bound `Secret.sub` bound))\n in\n assert (Secret.v cond_1 == (\n if\n Secret.v bound_2 <= Secret.v expected &&\n Secret.v candidate <= (Secret.v expected - Secret.v bound_2) &&\n Secret.v candidate < U62.v U62.bound - Secret.v bound\n then 1\n else 0\n ));\n let cond_2 =\n Secret.lognot_one_bit cond_1 `Secret.logand_one_bit`\n ((expected `Secret.add` bound_2) `Secret.secret_is_lt_64` candidate) `Secret.logand_one_bit`\n (bound `Secret.secret_is_le_64` candidate)\n in\n assert (Secret.v cond_2 == (\n if\n Secret.v cond_1 = 0 &&\n Secret.v expected + Secret.v bound_2 < Secret.v candidate &&\n Secret.v bound <= Secret.v candidate\n then 1\n else 0\n ));\n (candidate `Secret.add` (cond_1 `Secret.mul` bound)) `Secret.sub` (cond_2 `Secret.mul` bound)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 145, "start_col": 2, "end_line": 181, "end_col": 95 }, "file_context": "module QUIC.Impl.PacketNumber\nopen QUIC.Spec.PacketNumber\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule HST = FStar.HyperStack.ST\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Secret = QUIC.Secret.Int\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule LP = LowParse.Spec\nmodule Seq = QUIC.Secret.Seq\n\nfriend QUIC.Spec.PacketNumber\nmodule Spec = QUIC.Spec.PacketNumber\n\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule E = LowParse.Endianness.BitFields\n\nlet be_to_n_4_eq\n (b: Seq.lseq U8.t 4)\n: Lemma\n (E.be_to_n b ==\n U8.v (Seq.index b 3) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 2) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 1) + (256 `Prims.op_Multiply` (\n U8.v (Seq.index b 0)\n )))))))\n= assert_norm (pow2 8 == 256);\n E.reveal_be_to_n b;\n let b3 = Seq.slice b 0 3 in\n E.reveal_be_to_n b3;\n let b2 = Seq.slice b3 0 2 in\n E.reveal_be_to_n b2;\n let b1 = Seq.slice b2 0 1 in\n E.reveal_be_to_n b1;\n E.reveal_be_to_n (Seq.slice b1 0 0)\n\n#push-options \"--z3rlimit 64\"\n\nlet read_u32\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse LP.parse_u32 (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n= \n let h = HST.get () in\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n be_to_n_4_eq (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4);\n let b3 = B.index b 3ul in\n let b2 = B.index b 2ul in\n let b1 = B.index b 1ul in\n let b0 = B.index b 0ul in\n Secret.to_u32 b3 `Secret.add` (Secret.to_u32 256ul `Secret.mul` (\n Secret.to_u32 b2 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b1 `Secret.add` (Secret.to_u32 256ul `Secret.mul` ( \n Secret.to_u32 b0\n ))))))\n\n#pop-options\n\nmodule BF = LowParse.BitFields\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nnoextract\nlet read_bounded_integer\n (pn_len: packet_number_length_t)\n (b: B.buffer Secret.uint8)\n: HST.Stack Secret.uint32\n (requires (fun h ->\n B.live h b /\\\n 4 <= B.length b\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin match LP.parse (LP.parse_bounded_integer (Secret.v pn_len)) (Seq.seq_reveal (B.as_seq h b)) with\n | Some (v, _) -> Secret.v res == U32.v v\n | None -> False\n end\n ))\n=\n let h = HST.get () in\n LP.parse_bounded_integer_spec (Secret.v pn_len) (Seq.seq_reveal (B.as_seq h b));\n LP.parse_u32_spec (Seq.seq_reveal (B.as_seq h b));\n E.bitfield_be_to_n_slice (Seq.slice (Seq.seq_reveal (B.as_seq h b)) 0 4) 0 (Secret.v pn_len);\n let x = read_u32 b in\n BF.get_bitfield_full #32 (Secret.v x);\n let pn_len_1 = Secret.to_u32 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 0ul) `Secret.mul` Secret.get_bitfield x 24ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 1ul) `Secret.mul` Secret.get_bitfield x 16ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 2ul) `Secret.mul`\nSecret.get_bitfield x 8ul 32ul) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_32_2` Secret.to_u32 3ul) `Secret.mul` x)\n\n#pop-options\n\nmodule U = FStar.UInt\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet bound_npn\n (pn_len: packet_number_length_t)\n: Tot (x: packet_number_t { Secret.v x == bound_npn' (Secret.v pn_len - 1) })\n= let pn_len_1 = Secret.to_u64 (pn_len `Secret.sub` Secret.to_u32 1ul) in\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 0ul) `Secret.mul` Secret.to_u64 256uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 1ul) `Secret.mul` Secret.to_u64 65536uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 2ul) `Secret.mul` Secret.to_u64 16777216uL) `Secret.add`\n ((pn_len_1 `Secret.secrets_are_equal_64_2` Secret.to_u64 3ul) `Secret.mul` Secret.to_u64 4294967296uL)\n\n#pop-options\n\ninline_for_extraction\nlet secret_bounded_integer (i: LP.integer_size) = (x: Secret.uint32 { LP.bounded_integer_prop i (U32.uint_to_t (Secret.v x)) })\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 2 --initial_ifuel 2 --z3rlimit 4096 --query_stats\"\n\nmodule U62 = QUIC.UInt62\nmodule Lemmas = QUIC.Spec.PacketNumber.Lemmas\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet expand_pn_aux\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))", "dependencies": { "source_file": "QUIC.Impl.PacketNumber.fst", "checked_file": "QUIC.Impl.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.Spec.fst.checked", "LowParse.Endianness.BitFields.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "E", "full_module": "LowParse.Endianness.BitFields" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Base" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 2, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 4096, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n npn: QUIC.Impl.PacketNumber.secret_bounded_integer (QUIC.Secret.Int.Base.v pn_len)\n -> pn:\n Lib.IntTypes.uint64\n { QUIC.Secret.Int.Base.v pn ==\n QUIC.Spec.PacketNumber.expand_pn' (QUIC.Secret.Int.Base.v pn_len - 1)\n (QUIC.Secret.Int.Base.v last)\n (QUIC.Secret.Int.Base.v npn) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Impl.PacketNumber.secret_bounded_integer", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "Lib.IntTypes.sub", "Lib.IntTypes.U64", "Lib.IntTypes.add", "Lib.IntTypes.mul", "Prims.unit", "Prims._assert", "Prims.eq2", "Prims.int", "Prims.op_AmpAmp", "Prims.op_Equality", "Prims.op_LessThan", "Prims.op_Addition", "Prims.op_LessThanOrEqual", "Prims.bool", "Lib.IntTypes.int_t", "Lib.IntTypes.v", "QUIC.Secret.Int.logand_one_bit", "QUIC.Secret.Int.lognot_one_bit", "QUIC.Secret.Int.secret_is_lt_64", "QUIC.Secret.Int.secret_is_le_64", "Prims.op_Subtraction", "FStar.UInt64.v", "QUIC.UInt62.bound", "Lib.IntTypes.cast", "Lib.IntTypes.PUB", "Lib.IntTypes.to_u64", "QUIC.Spec.PacketNumber.Lemmas.lemma_replace_modulo_bound", "FStar.Mul.op_Star", "QUIC.Spec.PacketNumber.Lemmas.replace_modulo", "FStar.Ghost.hide", "Prims.nat", "Prims.op_Multiply", "FStar.UInt64.__uint_to_t", "Prims.op_Division", "FStar.UInt.shift_right_value_lemma", "Lib.IntTypes.shift_right", "FStar.UInt32.__uint_to_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Prims.l_or", "Lib.IntTypes.range", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "Prims.op_GreaterThan", "Prims.pow2", "QUIC.Spec.PacketNumber.Base.bound_npn'", "QUIC.Impl.PacketNumber.bound_npn", "QUIC.UInt62.secret", "Lib.IntTypes.uint64", "QUIC.Spec.PacketNumber.Base.in_window", "Prims.op_Modulus", "QUIC.Spec.PacketNumber.expand_pn'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val expand_pn_aux\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n : Tot\n (pn:\n Secret.uint64{Secret.v pn == expand_pn' (Secret.v pn_len - 1) (Secret.v last) (Secret.v npn)})\nlet expand_pn_aux\n (pn_len: packet_number_length_t)\n (last: last_packet_number_t)\n (npn: secret_bounded_integer (Secret.v pn_len))\n : Tot\n (pn:\n Secret.uint64{Secret.v pn == expand_pn' (Secret.v pn_len - 1) (Secret.v last) (Secret.v npn)}) =", "completed_definiton": "let open FStar.Mul in\nlet open FStar.Math.Lemmas in\nlet expected:U62.secret = last `Secret.add` (Secret.to_u64 1uL) in\nlet bound = bound_npn pn_len in\nlet bound_2 = bound `Secret.shift_right` 1ul in\nFStar.UInt.shift_right_value_lemma #64 (Secret.v bound) 1;\nassert (Secret.v bound_2 == Secret.v bound / 2);\nlet candidate =\n Lemmas.replace_modulo expected\n (8 `Prims.op_Multiply` (Secret.v pn_len))\n (bound `Secret.sub` (Secret.to_u64 1uL))\n (Secret.to_u64 npn)\nin\nLemmas.lemma_replace_modulo_bound (Secret.v expected) (8 * (Secret.v pn_len)) (Secret.v npn) 62;\nlet bound_2_le_expected = bound_2 `Secret.secret_is_le_64` expected in\nlet cond_1 =\n (bound_2_le_expected\n `Secret.logand_one_bit`\n (candidate\n `Secret.secret_is_le_64`\n ((bound_2_le_expected `Secret.mul` expected)\n `Secret.sub`\n (bound_2_le_expected `Secret.mul` bound_2))))\n `Secret.logand_one_bit`\n (candidate `Secret.secret_is_lt_64` ((Secret.to_u64 U62.bound) `Secret.sub` bound))\nin\nassert (Secret.v cond_1 ==\n (if\n Secret.v bound_2 <= Secret.v expected &&\n Secret.v candidate <= (Secret.v expected - Secret.v bound_2) &&\n Secret.v candidate < U62.v U62.bound - Secret.v bound\n then 1\n else 0));\nlet cond_2 =\n ((Secret.lognot_one_bit cond_1)\n `Secret.logand_one_bit`\n ((expected `Secret.add` bound_2) `Secret.secret_is_lt_64` candidate))\n `Secret.logand_one_bit`\n (bound `Secret.secret_is_le_64` candidate)\nin\nassert (Secret.v cond_2 ==\n (if\n Secret.v cond_1 = 0 && Secret.v expected + Secret.v bound_2 < Secret.v candidate &&\n Secret.v bound <= Secret.v candidate\n then 1\n else 0));\n(candidate `Secret.add` (cond_1 `Secret.mul` bound)) `Secret.sub` (cond_2 `Secret.mul` bound)", "isa_cross_project_example": true }, { "file_name": "Model.Helpers.fsti", "name": "Model.Helpers.lbytes", "original_source_type": "", "source_type": "val lbytes : l: Prims.nat -> Type0", "source_definition": "let lbytes (l:nat) = b:Seq.seq Lib.IntTypes.uint8 { Seq.length b = l }", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.Helpers.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 3, "start_col": 21, "end_line": 3, "end_col": 70 }, "file_context": "module Model.Helpers", "dependencies": { "source_file": "Model.Helpers.fsti", "checked_file": "Model.Helpers.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.RandomSequence.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "l: Prims.nat -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "FStar.Seq.Base.seq", "Lib.IntTypes.uint8", "Prims.b2t", "Prims.op_Equality", "FStar.Seq.Base.length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let lbytes (l: nat) =", "completed_definiton": "b: Seq.seq Lib.IntTypes.uint8 {Seq.length b = l}", "isa_cross_project_example": true }, { "file_name": "Model.Helpers.fsti", "name": "Model.Helpers.hide", "original_source_type": "val hide (b: Seq.seq UInt8.t) : lbytes (Seq.length b)", "source_type": "val hide (b: Seq.seq UInt8.t) : lbytes (Seq.length b)", "source_definition": "let hide (b:Seq.seq UInt8.t) : lbytes (Seq.length b) =\n Seq.init (Seq.length b) (fun i -> Lib.RawIntTypes.u8_from_UInt8 (Seq.index b i))", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.Helpers.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 6, "start_col": 2, "end_line": 6, "end_col": 82 }, "file_context": "module Model.Helpers\n\nlet lbytes (l:nat) = b:Seq.seq Lib.IntTypes.uint8 { Seq.length b = l }", "dependencies": { "source_file": "Model.Helpers.fsti", "checked_file": "Model.Helpers.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.RandomSequence.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: FStar.Seq.Base.seq FStar.UInt8.t -> Model.Helpers.lbytes (FStar.Seq.Base.length b)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "FStar.UInt8.t", "FStar.Seq.Base.init", "Lib.IntTypes.uint8", "FStar.Seq.Base.length", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Lib.RawIntTypes.u8_from_UInt8", "FStar.Seq.Base.index", "Model.Helpers.lbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hide (b: Seq.seq UInt8.t) : lbytes (Seq.length b)\nlet hide (b: Seq.seq UInt8.t) : lbytes (Seq.length b) =", "completed_definiton": "Seq.init (Seq.length b) (fun i -> Lib.RawIntTypes.u8_from_UInt8 (Seq.index b i))", "isa_cross_project_example": true }, { "file_name": "Model.Helpers.fsti", "name": "Model.Helpers.reveal", "original_source_type": "val reveal (#l: _) (b: lbytes l) : (QUIC.Spec.lbytes l)", "source_type": "val reveal (#l: _) (b: lbytes l) : (QUIC.Spec.lbytes l)", "source_definition": "let reveal #l (b:lbytes l) : (QUIC.Spec.lbytes l) =\n Seq.init l (fun i -> Lib.RawIntTypes.u8_to_UInt8 (Seq.index b i))", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.Helpers.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 15, "start_col": 2, "end_line": 15, "end_col": 67 }, "file_context": "module Model.Helpers\n\nlet lbytes (l:nat) = b:Seq.seq Lib.IntTypes.uint8 { Seq.length b = l }\n\nlet hide (b:Seq.seq UInt8.t) : lbytes (Seq.length b) =\n Seq.init (Seq.length b) (fun i -> Lib.RawIntTypes.u8_from_UInt8 (Seq.index b i))\n\nlet hide_eq (b:Seq.seq UInt8.t) : Lemma\n (ensures hide b == QUIC.Secret.Seq.seq_hide #Lib.IntTypes.U8 b)\n [ SMTPat (QUIC.Secret.Seq.seq_hide #Lib.IntTypes.U8 b) ]\n= \n assert (hide b `Seq.equal` QUIC.Secret.Seq.seq_hide b)", "dependencies": { "source_file": "Model.Helpers.fsti", "checked_file": "Model.Helpers.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.RandomSequence.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: Model.Helpers.lbytes l -> QUIC.Spec.Base.lbytes l", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Model.Helpers.lbytes", "FStar.Seq.Base.init", "FStar.UInt8.t", "Prims.b2t", "Prims.op_LessThan", "Lib.RawIntTypes.u8_to_UInt8", "FStar.Seq.Base.index", "Lib.IntTypes.uint8", "QUIC.Spec.Base.lbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val reveal (#l: _) (b: lbytes l) : (QUIC.Spec.lbytes l)\nlet reveal #l (b: lbytes l) : (QUIC.Spec.lbytes l) =", "completed_definiton": "Seq.init l (fun i -> Lib.RawIntTypes.u8_to_UInt8 (Seq.index b i))", "isa_cross_project_example": true }, { "file_name": "Model.Helpers.fsti", "name": "Model.Helpers.random", "original_source_type": "val random (l: nat{l < pow2 32})\n : HyperStack.ST.ST (lbytes l) (requires fun h0 -> True) (ensures fun h0 _ h1 -> h0 == h1)", "source_type": "val random (l: nat{l < pow2 32})\n : HyperStack.ST.ST (lbytes l) (requires fun h0 -> True) (ensures fun h0 _ h1 -> h0 == h1)", "source_definition": "let random (l: nat { l < pow2 32 })\n : HyperStack.ST.ST (lbytes l)\n (requires fun h0 -> True)\n (ensures fun h0 _ h1 -> h0 == h1)\n =\n let open Lib.RandomSequence in\n snd (crypto_random entropy0 l)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.Helpers.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 37, "start_col": 2, "end_line": 38, "end_col": 32 }, "file_context": "module Model.Helpers\n\nlet lbytes (l:nat) = b:Seq.seq Lib.IntTypes.uint8 { Seq.length b = l }\n\nlet hide (b:Seq.seq UInt8.t) : lbytes (Seq.length b) =\n Seq.init (Seq.length b) (fun i -> Lib.RawIntTypes.u8_from_UInt8 (Seq.index b i))\n\nlet hide_eq (b:Seq.seq UInt8.t) : Lemma\n (ensures hide b == QUIC.Secret.Seq.seq_hide #Lib.IntTypes.U8 b)\n [ SMTPat (QUIC.Secret.Seq.seq_hide #Lib.IntTypes.U8 b) ]\n= \n assert (hide b `Seq.equal` QUIC.Secret.Seq.seq_hide b)\n\nlet reveal #l (b:lbytes l) : (QUIC.Spec.lbytes l) =\n Seq.init l (fun i -> Lib.RawIntTypes.u8_to_UInt8 (Seq.index b i)) \n\nlet reveal_eq (b:Seq.seq Lib.IntTypes.uint8): Lemma\n (ensures reveal #(Seq.length b) b == QUIC.Secret.Seq.seq_reveal b)\n [ SMTPat (QUIC.Secret.Seq.seq_reveal b) ]\n= \n assert (reveal #(Seq.length b) b `Seq.equal` QUIC.Secret.Seq.seq_reveal b)\n\n\nval correct (#l: nat) (b:Seq.seq UInt8.t{Seq.length b = l})\n : Lemma (reveal #l (hide b) == b)\n [SMTPat (reveal #l (hide b))]\n\nval correct2 (#l: nat) (b:lbytes l)\n : Lemma (hide (reveal #l b) == b)\n [SMTPat (hide (reveal #l b))]\n\nlet random (l: nat { l < pow2 32 })\n : HyperStack.ST.ST (lbytes l)\n (requires fun h0 -> True)\n (ensures fun h0 _ h1 -> h0 == h1)", "dependencies": { "source_file": "Model.Helpers.fsti", "checked_file": "Model.Helpers.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.RandomSequence.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "l: Prims.nat{l < Prims.pow2 32} -> FStar.HyperStack.ST.ST (Model.Helpers.lbytes l)", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Prims.pow2", "FStar.Pervasives.Native.snd", "Lib.RandomSequence.entropy", "Lib.ByteSequence.lbytes", "Lib.RandomSequence.crypto_random", "Lib.RandomSequence.entropy0", "Model.Helpers.lbytes", "FStar.Monotonic.HyperStack.mem", "Prims.l_True", "Prims.eq2" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val random (l: nat{l < pow2 32})\n : HyperStack.ST.ST (lbytes l) (requires fun h0 -> True) (ensures fun h0 _ h1 -> h0 == h1)\nlet random (l: nat{l < pow2 32})\n : HyperStack.ST.ST (lbytes l) (requires fun h0 -> True) (ensures fun h0 _ h1 -> h0 == h1) =", "completed_definiton": "let open Lib.RandomSequence in snd (crypto_random entropy0 l)", "isa_cross_project_example": true }, { "file_name": "Model.Helpers.fsti", "name": "Model.Helpers.reveal_eq", "original_source_type": "val reveal_eq (b: Seq.seq Lib.IntTypes.uint8)\n : Lemma (ensures reveal #(Seq.length b) b == QUIC.Secret.Seq.seq_reveal b)\n [SMTPat (QUIC.Secret.Seq.seq_reveal b)]", "source_type": "val reveal_eq (b: Seq.seq Lib.IntTypes.uint8)\n : Lemma (ensures reveal #(Seq.length b) b == QUIC.Secret.Seq.seq_reveal b)\n [SMTPat (QUIC.Secret.Seq.seq_reveal b)]", "source_definition": "let reveal_eq (b:Seq.seq Lib.IntTypes.uint8): Lemma\n (ensures reveal #(Seq.length b) b == QUIC.Secret.Seq.seq_reveal b)\n [ SMTPat (QUIC.Secret.Seq.seq_reveal b) ]\n= \n assert (reveal #(Seq.length b) b `Seq.equal` QUIC.Secret.Seq.seq_reveal b)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.Helpers.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 21, "start_col": 2, "end_line": 21, "end_col": 76 }, "file_context": "module Model.Helpers\n\nlet lbytes (l:nat) = b:Seq.seq Lib.IntTypes.uint8 { Seq.length b = l }\n\nlet hide (b:Seq.seq UInt8.t) : lbytes (Seq.length b) =\n Seq.init (Seq.length b) (fun i -> Lib.RawIntTypes.u8_from_UInt8 (Seq.index b i))\n\nlet hide_eq (b:Seq.seq UInt8.t) : Lemma\n (ensures hide b == QUIC.Secret.Seq.seq_hide #Lib.IntTypes.U8 b)\n [ SMTPat (QUIC.Secret.Seq.seq_hide #Lib.IntTypes.U8 b) ]\n= \n assert (hide b `Seq.equal` QUIC.Secret.Seq.seq_hide b)\n\nlet reveal #l (b:lbytes l) : (QUIC.Spec.lbytes l) =\n Seq.init l (fun i -> Lib.RawIntTypes.u8_to_UInt8 (Seq.index b i)) \n\nlet reveal_eq (b:Seq.seq Lib.IntTypes.uint8): Lemma\n (ensures reveal #(Seq.length b) b == QUIC.Secret.Seq.seq_reveal b)\n [ SMTPat (QUIC.Secret.Seq.seq_reveal b) ]", "dependencies": { "source_file": "Model.Helpers.fsti", "checked_file": "Model.Helpers.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.RandomSequence.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: FStar.Seq.Base.seq Lib.IntTypes.uint8\n -> FStar.Pervasives.Lemma (ensures Model.Helpers.reveal b == QUIC.Secret.Seq.seq_reveal b)\n [SMTPat (QUIC.Secret.Seq.seq_reveal b)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Lib.IntTypes.uint8", "Prims._assert", "FStar.Seq.Base.equal", "QUIC.Spec.Base.byte", "Model.Helpers.reveal", "FStar.Seq.Base.length", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Lib.IntTypes.uint_t", "Lib.IntTypes.PUB", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val reveal_eq (b: Seq.seq Lib.IntTypes.uint8)\n : Lemma (ensures reveal #(Seq.length b) b == QUIC.Secret.Seq.seq_reveal b)\n [SMTPat (QUIC.Secret.Seq.seq_reveal b)]\nlet reveal_eq (b: Seq.seq Lib.IntTypes.uint8)\n : Lemma (ensures reveal #(Seq.length b) b == QUIC.Secret.Seq.seq_reveal b)\n [SMTPat (QUIC.Secret.Seq.seq_reveal b)] =", "completed_definiton": "assert ((reveal #(Seq.length b) b) `Seq.equal` (QUIC.Secret.Seq.seq_reveal b))", "isa_cross_project_example": true }, { "file_name": "Model.Helpers.fsti", "name": "Model.Helpers.hide_eq", "original_source_type": "val hide_eq (b: Seq.seq UInt8.t)\n : Lemma (ensures hide b == QUIC.Secret.Seq.seq_hide #Lib.IntTypes.U8 b)\n [SMTPat (QUIC.Secret.Seq.seq_hide #Lib.IntTypes.U8 b)]", "source_type": "val hide_eq (b: Seq.seq UInt8.t)\n : Lemma (ensures hide b == QUIC.Secret.Seq.seq_hide #Lib.IntTypes.U8 b)\n [SMTPat (QUIC.Secret.Seq.seq_hide #Lib.IntTypes.U8 b)]", "source_definition": "let hide_eq (b:Seq.seq UInt8.t) : Lemma\n (ensures hide b == QUIC.Secret.Seq.seq_hide #Lib.IntTypes.U8 b)\n [ SMTPat (QUIC.Secret.Seq.seq_hide #Lib.IntTypes.U8 b) ]\n= \n assert (hide b `Seq.equal` QUIC.Secret.Seq.seq_hide b)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.Helpers.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 12, "start_col": 2, "end_line": 12, "end_col": 56 }, "file_context": "module Model.Helpers\n\nlet lbytes (l:nat) = b:Seq.seq Lib.IntTypes.uint8 { Seq.length b = l }\n\nlet hide (b:Seq.seq UInt8.t) : lbytes (Seq.length b) =\n Seq.init (Seq.length b) (fun i -> Lib.RawIntTypes.u8_from_UInt8 (Seq.index b i))\n\nlet hide_eq (b:Seq.seq UInt8.t) : Lemma\n (ensures hide b == QUIC.Secret.Seq.seq_hide #Lib.IntTypes.U8 b)\n [ SMTPat (QUIC.Secret.Seq.seq_hide #Lib.IntTypes.U8 b) ]", "dependencies": { "source_file": "Model.Helpers.fsti", "checked_file": "Model.Helpers.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.RandomSequence.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: FStar.Seq.Base.seq FStar.UInt8.t\n -> FStar.Pervasives.Lemma (ensures Model.Helpers.hide b == QUIC.Secret.Seq.seq_hide b)\n [SMTPat (QUIC.Secret.Seq.seq_hide b)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "FStar.UInt8.t", "Prims._assert", "FStar.Seq.Base.equal", "Lib.IntTypes.uint8", "Model.Helpers.hide", "QUIC.Secret.Seq.seq_hide", "Lib.IntTypes.U8", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Lib.IntTypes.uint_t", "Lib.IntTypes.SEC", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val hide_eq (b: Seq.seq UInt8.t)\n : Lemma (ensures hide b == QUIC.Secret.Seq.seq_hide #Lib.IntTypes.U8 b)\n [SMTPat (QUIC.Secret.Seq.seq_hide #Lib.IntTypes.U8 b)]\nlet hide_eq (b: Seq.seq UInt8.t)\n : Lemma (ensures hide b == QUIC.Secret.Seq.seq_hide #Lib.IntTypes.U8 b)\n [SMTPat (QUIC.Secret.Seq.seq_hide #Lib.IntTypes.U8 b)] =", "completed_definiton": "assert ((hide b) `Seq.equal` (QUIC.Secret.Seq.seq_hide b))", "isa_cross_project_example": true }, { "file_name": "Model.Helpers.fsti", "name": "Model.Helpers.lbytes_eq", "original_source_type": "val lbytes_eq (x y: Seq.seq Lib.IntTypes.uint8)\n : Tot (b: bool{b <==> x `Seq.equal` y}) (decreases (Seq.length x))", "source_type": "val lbytes_eq (x y: Seq.seq Lib.IntTypes.uint8)\n : Tot (b: bool{b <==> x `Seq.equal` y}) (decreases (Seq.length x))", "source_definition": "let rec lbytes_eq (x y: Seq.seq Lib.IntTypes.uint8): Tot (b:bool { b <==> x `Seq.equal` y }) (decreases (Seq.length x)) =\n if Seq.length x = 0 && Seq.length y = 0 then\n true\n else if Seq.length x = 0 && Seq.length y <> 0 then\n false\n else if Seq.length x <> 0 && Seq.length y = 0 then\n false\n else\n let hx = Seq.head x in\n let hy = Seq.head y in\n let tx = Seq.tail x in\n let ty = Seq.tail y in\n if Lib.RawIntTypes.u8_to_UInt8 hx = Lib.RawIntTypes.u8_to_UInt8 hy && lbytes_eq tx ty then begin\n assert (x `Seq.equal` Seq.append (Seq.create 1 hx) tx);\n assert (y `Seq.equal` Seq.append (Seq.create 1 hy) ty);\n assert (Seq.index (Seq.create 1 hx) 0 == Seq.index (Seq.create 1 hy) 0);\n assert (Seq.create 1 hx `Seq.equal` Seq.create 1 hy);\n true\n end else\n false", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.Helpers.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 41, "start_col": 2, "end_line": 59, "end_col": 11 }, "file_context": "module Model.Helpers\n\nlet lbytes (l:nat) = b:Seq.seq Lib.IntTypes.uint8 { Seq.length b = l }\n\nlet hide (b:Seq.seq UInt8.t) : lbytes (Seq.length b) =\n Seq.init (Seq.length b) (fun i -> Lib.RawIntTypes.u8_from_UInt8 (Seq.index b i))\n\nlet hide_eq (b:Seq.seq UInt8.t) : Lemma\n (ensures hide b == QUIC.Secret.Seq.seq_hide #Lib.IntTypes.U8 b)\n [ SMTPat (QUIC.Secret.Seq.seq_hide #Lib.IntTypes.U8 b) ]\n= \n assert (hide b `Seq.equal` QUIC.Secret.Seq.seq_hide b)\n\nlet reveal #l (b:lbytes l) : (QUIC.Spec.lbytes l) =\n Seq.init l (fun i -> Lib.RawIntTypes.u8_to_UInt8 (Seq.index b i)) \n\nlet reveal_eq (b:Seq.seq Lib.IntTypes.uint8): Lemma\n (ensures reveal #(Seq.length b) b == QUIC.Secret.Seq.seq_reveal b)\n [ SMTPat (QUIC.Secret.Seq.seq_reveal b) ]\n= \n assert (reveal #(Seq.length b) b `Seq.equal` QUIC.Secret.Seq.seq_reveal b)\n\n\nval correct (#l: nat) (b:Seq.seq UInt8.t{Seq.length b = l})\n : Lemma (reveal #l (hide b) == b)\n [SMTPat (reveal #l (hide b))]\n\nval correct2 (#l: nat) (b:lbytes l)\n : Lemma (hide (reveal #l b) == b)\n [SMTPat (hide (reveal #l b))]\n\nlet random (l: nat { l < pow2 32 })\n : HyperStack.ST.ST (lbytes l)\n (requires fun h0 -> True)\n (ensures fun h0 _ h1 -> h0 == h1)\n =\n let open Lib.RandomSequence in\n snd (crypto_random entropy0 l)", "dependencies": { "source_file": "Model.Helpers.fsti", "checked_file": "Model.Helpers.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.RandomSequence.fsti.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: FStar.Seq.Base.seq Lib.IntTypes.uint8 -> y: FStar.Seq.Base.seq Lib.IntTypes.uint8\n -> Prims.Tot (b: Prims.bool{b <==> FStar.Seq.Base.equal x y})", "effect": "Prims.Tot", "effect_flags": [ "total", "" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Lib.IntTypes.uint8", "Prims.op_AmpAmp", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "Prims.bool", "Prims.op_disEquality", "FStar.UInt8.t", "Prims.l_or", "Prims.b2t", "Lib.IntTypes.range", "Lib.IntTypes.U8", "FStar.UInt.size", "FStar.UInt8.n", "Lib.IntTypes.uint_v", "Lib.IntTypes.SEC", "FStar.UInt8.v", "Lib.RawIntTypes.u8_to_UInt8", "Model.Helpers.lbytes_eq", "Prims.unit", "Prims._assert", "FStar.Seq.Base.equal", "FStar.Seq.Base.create", "Prims.eq2", "FStar.Seq.Base.index", "FStar.Seq.Base.append", "Prims.l_iff", "Lib.IntTypes.int_t", "FStar.Seq.Properties.tail", "FStar.Seq.Properties.head" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lbytes_eq (x y: Seq.seq Lib.IntTypes.uint8)\n : Tot (b: bool{b <==> x `Seq.equal` y}) (decreases (Seq.length x))\nlet rec lbytes_eq (x y: Seq.seq Lib.IntTypes.uint8)\n : Tot (b: bool{b <==> x `Seq.equal` y}) (decreases (Seq.length x)) =", "completed_definiton": "if Seq.length x = 0 && Seq.length y = 0\nthen true\nelse\n if Seq.length x = 0 && Seq.length y <> 0\n then false\n else\n if Seq.length x <> 0 && Seq.length y = 0\n then false\n else\n let hx = Seq.head x in\n let hy = Seq.head y in\n let tx = Seq.tail x in\n let ty = Seq.tail y in\n if Lib.RawIntTypes.u8_to_UInt8 hx = Lib.RawIntTypes.u8_to_UInt8 hy && lbytes_eq tx ty\n then\n (assert (x `Seq.equal` (Seq.append (Seq.create 1 hx) tx));\n assert (y `Seq.equal` (Seq.append (Seq.create 1 hy) ty));\n assert (Seq.index (Seq.create 1 hx) 0 == Seq.index (Seq.create 1 hy) 0);\n assert ((Seq.create 1 hx) `Seq.equal` (Seq.create 1 hy));\n true)\n else false", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.pp_bitsum_norm_tac", "original_source_type": "val pp_bitsum_norm_tac: Prims.unit -> LT.Tac unit", "source_type": "val pp_bitsum_norm_tac: Prims.unit -> LT.Tac unit", "source_definition": "let pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 67, "start_col": 2, "end_line": 68, "end_col": 13 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit -> FStar.Tactics.Effect.Tac Prims.unit", "effect": "FStar.Tactics.Effect.Tac", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Tactics.V1.Derived.trefl", "FStar.Tactics.V1.Builtins.norm", "Prims.Cons", "FStar.Pervasives.norm_step", "FStar.Pervasives.primops", "FStar.Pervasives.iota", "FStar.Pervasives.zeta", "FStar.Pervasives.delta_attr", "Prims.string", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val pp_bitsum_norm_tac: Prims.unit -> LT.Tac unit\nlet pp_bitsum_norm_tac () : LT.Tac unit =", "completed_definiton": "LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\nLT.trefl ()", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.validate_header", "original_source_type": "val validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))", "source_type": "val validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))", "source_definition": "let validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 89, "start_col": 2, "end_line": 99, "end_col": 35 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "short_dcid_len: QUIC.Spec.Base.short_dcid_len_t\n -> LowParse.Low.Base.validator (QUIC.Spec.Header.Public.parse_header short_dcid_len)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "LowParse.Low.BitSum.validate_bitsum", "LowParse.Spec.Int.parse_u8_kind", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.first_byte_of_header", "QUIC.Spec.Header.Public.header_body_type", "QUIC.Spec.Header.Public.header_synth", "LowParse.Spec.Int.parse_u8", "LowParse.Low.Int.validate_u8", "LowParse.Low.Int.read_u8", "QUIC.Impl.Header.Public.filter_first_byte", "QUIC.Spec.Header.Public.parse_header_body", "QUIC.Impl.Header.Public.validate_header_body_cases", "QUIC.Impl.Header.Public.mk_validate_header_body_cases", "LowParse.Low.Base.validator", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\nlet validate_header (short_dcid_len: short_dcid_len_t)\n : Tot (LP.validator (parse_header short_dcid_len)) =", "completed_definiton": "LPB.validate_bitsum first_byte (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len) (header_synth short_dcid_len) (LP.validate_u8 ()) LP.read_u8\n (filter_first_byte) (parse_header_body short_dcid_len) (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.mk_validate_header_body_cases", "original_source_type": "val mk_validate_header_body_cases:LPB.validate_bitsum_cases_t first_byte", "source_type": "val mk_validate_header_body_cases:LPB.validate_bitsum_cases_t first_byte", "source_definition": "let mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 84, "start_col": 2, "end_line": 84, "end_col": 46 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.BitSum.validate_bitsum_cases_t QUIC.Spec.Header.Public.first_byte", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.BitSum.validate_bitsum_cases_bitsum'_intro", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.header_form_t", "Prims.Cons", "FStar.Pervasives.Native.tuple2", "LowParse.BitFields.bitfield", "FStar.Pervasives.Native.Mktuple2", "QUIC.Spec.Header.Public.Long", "FStar.UInt8.__uint_to_t", "QUIC.Spec.Header.Public.Short", "Prims.Nil", "LowParse.Spec.Enum.enum_key", "LowParse.Spec.BitSum.BitSum'", "Prims.unit", "QUIC.Spec.Header.Public.fixed_bit", "LowParse.Spec.BitSum.BitField", "LowParse.Spec.BitSum.BitStop", "LowParse.Spec.BitSum.bitsum'", "Prims.op_Subtraction", "QUIC.Spec.Header.Public.long_packet_type_t", "QUIC.Spec.Header.Public.long_packet_type", "LowParse.Low.BitSum.validate_bitsum_cases_bitsum'_cons", "QUIC.Spec.Header.Public.Initial", "QUIC.Spec.Header.Public.ZeroRTT", "QUIC.Spec.Header.Public.Handshake", "QUIC.Spec.Header.Public.Retry", "LowParse.Low.BitSum.validate_bitsum_cases_bitfield", "LowParse.Low.BitSum.validate_bitsum_cases_bitstop", "FStar.List.Tot.Base.append", "LowParse.Low.BitSum.validate_bitsum_cases_bitsum'_nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val mk_validate_header_body_cases:LPB.validate_bitsum_cases_t first_byte\nlet mk_validate_header_body_cases:LPB.validate_bitsum_cases_t first_byte =", "completed_definiton": "(LPB.mk_validate_bitsum_cases_t' first_byte)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.filter_first_byte", "original_source_type": "val filter_first_byte:(LPB.filter_bitsum'_t first_byte)", "source_type": "val filter_first_byte:(LPB.filter_bitsum'_t first_byte)", "source_definition": "let filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 76, "start_col": 2, "end_line": 76, "end_col": 39 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.BitSum.filter_bitsum'_t QUIC.Spec.Header.Public.first_byte", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.BitSum.filter_bitsum'_bitsum'_intro", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.header_form_t", "Prims.Cons", "FStar.Pervasives.Native.tuple2", "LowParse.BitFields.bitfield", "FStar.Pervasives.Native.Mktuple2", "QUIC.Spec.Header.Public.Long", "FStar.UInt8.__uint_to_t", "QUIC.Spec.Header.Public.Short", "Prims.Nil", "LowParse.Spec.Enum.enum_key", "LowParse.Spec.BitSum.BitSum'", "Prims.unit", "QUIC.Spec.Header.Public.fixed_bit", "LowParse.Spec.BitSum.BitField", "LowParse.Spec.BitSum.BitStop", "LowParse.Spec.BitSum.bitsum'", "Prims.op_Subtraction", "QUIC.Spec.Header.Public.long_packet_type_t", "QUIC.Spec.Header.Public.long_packet_type", "LowParse.Spec.BitSum.filter_bitsum'_bitsum'_cons", "QUIC.Spec.Header.Public.Initial", "QUIC.Spec.Header.Public.ZeroRTT", "QUIC.Spec.Header.Public.Handshake", "QUIC.Spec.Header.Public.Retry", "LowParse.Spec.BitSum.filter_bitsum'_bitfield", "LowParse.Spec.BitSum.filter_bitsum'_bitstop", "FStar.List.Tot.Base.append", "LowParse.Spec.BitSum.filter_bitsum'_bitsum'_nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val filter_first_byte:(LPB.filter_bitsum'_t first_byte)\nlet filter_first_byte:(LPB.filter_bitsum'_t first_byte) =", "completed_definiton": "(LPB.mk_filter_bitsum'_t' first_byte)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.synth_first_byte", "original_source_type": "val synth_first_byte:(LPB.synth_bitsum'_recip_t first_byte)", "source_type": "val synth_first_byte:(LPB.synth_bitsum'_recip_t first_byte)", "source_definition": "let synth_first_byte\n: (LPB.synth_bitsum'_recip_t first_byte)\n=\n (LPB.mk_synth_bitsum'_recip first_byte)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 432, "start_col": 2, "end_line": 432, "end_col": 41 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) == (| Long, (| (), (| Retry, () |) |) |) );\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)\n\n#pop-options\n\nlet valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures (\n LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_initial_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0 sl pos\n\ninline_for_extraction\nlet read_payload_and_pn_length : LP.leaf_reader parse_payload_and_pn_length =\n LP.read_filter VI.read_varint payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Initial, () |) |) |) );\n valid_long_initial_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len)) (parse_payload_and_pn_length) sl pos3;\n let token = LP.get_bounded_vlgenbytes_contents 0 token_max_len (VI.read_bounded_varint 0 token_max_len) (VI.jump_bounded_varint 0 token_max_len) sl pos3 in\n let token_len = LP.bounded_vlgenbytes_payload_length 0 token_max_len (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let pos4 = LP.jump_bounded_vlgenbytes 0 token_max_len (VI.jump_bounded_varint 0 token_max_len) (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos4 in\n let spec = PInitial (payload_and_pn_length) token token_len in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures (\n LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_handshake_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` VI.parse_varint)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_handshake\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Handshake, () |) |) |) );\n valid_long_handshake_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PHandshake payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_zero_rtt_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_zero_rtt_body h0 sl pos))\n (ensures (\n LP.valid parse_long_zero_rtt_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_zero_rtt_body h0 sl pos)\n (LP.get_valid_pos parse_long_zero_rtt_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_zero_rtt_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_zero_rtt\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) == (| Long, (| (), (| ZeroRTT, () |) |) |) );\n valid_long_zero_rtt_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PZeroRTT payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet read_header_body\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (read_header_body_t sl cid_len tg)\n= fun len ->\n let h0 = HST.get () in\n match tg with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n read_header_body_short sl cid_len spin protected_bits len\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n read_header_body_long_retry sl cid_len protected_bits len\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n read_header_body_long_initial sl cid_len protected_bits len\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n read_header_body_long_handshake sl cid_len protected_bits len\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n read_header_body_long_zero_rtt sl cid_len protected_bits len\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --fuel 4 --ifuel 4 --query_stats\"\n\nlet read_header packet packet_len cid_len =\n let h0 = HST.get () in\n let sl = LP.make_slice packet packet_len in\n LP.valid_facts (parse_header cid_len) h0 sl 0ul;\n assert_spinoff (B.as_seq h0 packet `Seq.equal` LP.bytes_of_slice_from h0 sl 0ul);\n assert_norm (\n let k = parse_header_kind cid_len in\n Some? k.LP.parser_kind_high /\\\n k.LP.parser_kind_subkind == Some LP.ParserStrong\n );\n begin\n LPB.valid_bitsum_elim\n #LP.parse_u8_kind\n #8\n #U8.t\n #LPB.uint8\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n LP.parse_u8\n (parse_header_body cid_len)\n h0\n sl\n 0ul;\n let r = LP.read_u8 sl 0ul in\n let res = destr_first_byte\n (read_header_body_t sl cid_len)\n (fun _ cond dt df len' -> if cond then dt () len' else df () len')\n (read_header_body sl cid_len)\n r\n ()\n in\n res\n end\n\n#pop-options\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet synth_first_byte\n: (LPB.synth_bitsum'_recip_t first_byte)", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.BitSum.synth_bitsum'_recip_t QUIC.Spec.Header.Public.first_byte", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.BitSum.synth_bitsum'_recip_BitSum_intro", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.header_form_t", "Prims.Cons", "FStar.Pervasives.Native.tuple2", "LowParse.BitFields.bitfield", "FStar.Pervasives.Native.Mktuple2", "QUIC.Spec.Header.Public.Long", "FStar.UInt8.__uint_to_t", "QUIC.Spec.Header.Public.Short", "Prims.Nil", "LowParse.Spec.Enum.enum_key", "LowParse.Spec.BitSum.BitSum'", "Prims.unit", "QUIC.Spec.Header.Public.fixed_bit", "LowParse.Spec.BitSum.BitField", "LowParse.Spec.BitSum.BitStop", "LowParse.Spec.BitSum.bitsum'", "Prims.op_Subtraction", "QUIC.Spec.Header.Public.long_packet_type_t", "QUIC.Spec.Header.Public.long_packet_type", "LowParse.Spec.BitSum.synth_bitsum'_recip_BitSum_cons", "QUIC.Spec.Header.Public.Initial", "QUIC.Spec.Header.Public.ZeroRTT", "QUIC.Spec.Header.Public.Handshake", "QUIC.Spec.Header.Public.Retry", "LowParse.Spec.BitSum.synth_bitsum'_recip_BitSum_cons_nil", "LowParse.Spec.BitSum.synth_bitsum'_recip_BitField", "LowParse.Spec.BitSum.synth_bitsum'_recip_BitStop", "FStar.List.Tot.Base.append" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_first_byte:(LPB.synth_bitsum'_recip_t first_byte)\nlet synth_first_byte:(LPB.synth_bitsum'_recip_t first_byte) =", "completed_definiton": "(LPB.mk_synth_bitsum'_recip first_byte)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.read_header_body_post", "original_source_type": "val read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h': HS.mem)\n : GTot Type0", "source_type": "val read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h': HS.mem)\n : GTot Type0", "source_definition": "let read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 122, "start_col": 2, "end_line": 128, "end_col": 5 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n sl:\n LowParse.Slice.slice (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte) ->\n cid_len: FStar.UInt32.t{FStar.UInt32.v cid_len <= 20} ->\n tg: LowParse.Spec.BitSum.bitsum'_type QUIC.Spec.Header.Public.first_byte ->\n h: FStar.Monotonic.HyperStack.mem ->\n x: QUIC.Impl.Header.Public.header ->\n h': FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.slice", "LowStar.Buffer.trivial_preorder", "LowParse.Bytes.byte", "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "LowParse.Spec.BitSum.bitsum'_type", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "FStar.Monotonic.HyperStack.mem", "QUIC.Impl.Header.Public.header", "Prims.l_and", "LowParse.Low.Base.Spec.valid", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.parse_header", "FStar.UInt32.__uint_to_t", "QUIC.Impl.Header.Public.header_live", "LowStar.Monotonic.Buffer.loc_includes", "LowParse.Slice.loc_slice_from_to", "QUIC.Impl.Header.Public.header_footprint", "Prims.eq2", "QUIC.Spec.Header.Public.header", "QUIC.Impl.Header.Public.g_header", "LowParse.Low.Base.Spec.get_valid_pos", "LowParse.Low.Base.Spec.contents" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h': HS.mem)\n : GTot Type0\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h': HS.mem)\n : GTot Type0 =", "completed_definiton": "LP.valid (parse_header cid_len) h sl 0ul /\\\n(let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\ (LP.loc_slice_from_to sl 0ul len) `B.loc_includes` (header_footprint x) /\\\n g_header x h' == hd)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.validate_payload_and_pn_length", "original_source_type": "val validate_payload_and_pn_length:LP.validator parse_payload_and_pn_length", "source_type": "val validate_payload_and_pn_length:LP.validator parse_payload_and_pn_length", "source_definition": "let validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 17, "start_col": 2, "end_line": 21, "end_col": 43 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator QUIC.Spec.Header.Public.parse_payload_and_pn_length", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.validate_filter", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.UInt62.t", "QUIC.Spec.VarInt.parse_varint", "QUIC.Impl.VarInt.validate_varint", "QUIC.Impl.VarInt.read_varint", "QUIC.Spec.Header.Public.payload_and_pn_length_prop", "Prims.bool", "Prims.eq2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val validate_payload_and_pn_length:LP.validator parse_payload_and_pn_length\nlet validate_payload_and_pn_length:LP.validator parse_payload_and_pn_length =", "completed_definiton": "LP.validate_filter VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.read_header_body_t", "original_source_type": "val read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (tg: LPB.bitsum'_type first_byte)\n : Tot (Type u#0)", "source_type": "val read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (tg: LPB.bitsum'_type first_byte)\n : Tot (Type u#0)", "source_definition": "let read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 137, "start_col": 2, "end_line": 150, "end_col": 4 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n sl:\n LowParse.Slice.slice (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte) ->\n cid_len: FStar.UInt32.t{FStar.UInt32.v cid_len <= 20} ->\n tg: LowParse.Spec.BitSum.bitsum'_type QUIC.Spec.Header.Public.first_byte\n -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.slice", "LowStar.Buffer.trivial_preorder", "LowParse.Bytes.byte", "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "LowParse.Spec.BitSum.bitsum'_type", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "Prims.unit", "QUIC.Impl.Header.Public.header", "FStar.Monotonic.HyperStack.mem", "Prims.l_and", "LowParse.Low.Base.Spec.valid", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.parse_header", "FStar.UInt32.__uint_to_t", "LowParse.Slice.__proj__Mkslice__item__len", "LowParse.Low.Base.Spec.valid_pos", "Prims.__proj__Mkdtuple2__item___1", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.parser", "QUIC.Spec.Header.Public.header_body_type", "LowParse.Spec.BitSum.bitsum'_key_of_t", "QUIC.Spec.Header.Public.parse_header_body", "Prims.eq2", "QUIC.Spec.Header.Public.header", "Prims.l_or", "QUIC.Spec.Header.Public.parse_header_prop", "QUIC.Spec.Header.Public.first_byte_of_header", "LowParse.Low.Base.Spec.contents", "LowParse.Spec.BitSum.__proj__SynthCase__item__f", "QUIC.Spec.Header.Public.header_synth", "LowParse.Low.Base.Spec.get_valid_pos", "FStar.Pervasives.dsnd", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_none", "QUIC.Impl.Header.Public.read_header_body_post" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (tg: LPB.bitsum'_type first_byte)\n : Tot (Type u#0)\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (tg: LPB.bitsum'_type first_byte)\n : Tot (Type u#0) =", "completed_definiton": "unit\n -> HST.Stack header\n (requires\n (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\\n (let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\ LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul ==\n (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul))))\n (ensures\n (fun h x h' -> B.modifies B.loc_none h h' /\\ read_header_body_post sl cid_len tg h x h'))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.validate_long_handshake_body", "original_source_type": "val validate_long_handshake_body:LP.validator parse_long_handshake_body", "source_type": "val validate_long_handshake_body:LP.validator parse_long_handshake_body", "source_definition": "let validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 29, "start_col": 2, "end_line": 29, "end_col": 79 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator QUIC.Spec.Header.Public.parse_long_handshake_body", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.validate_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Impl.Header.Public.validate_common_long", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "QUIC.Impl.Header.Public.validate_payload_and_pn_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val validate_long_handshake_body:LP.validator parse_long_handshake_body\nlet validate_long_handshake_body:LP.validator parse_long_handshake_body =", "completed_definiton": "validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.validate_common_long", "original_source_type": "val validate_common_long:LP.validator parse_common_long", "source_type": "val validate_common_long:LP.validator parse_common_long", "source_definition": "let validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 11, "start_col": 2, "end_line": 11, "end_col": 140 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator QUIC.Spec.Header.Public.parse_common_long", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.validate_nondep_then", "LowParse.Spec.Int.parse_u32_kind", "FStar.UInt32.t", "LowParse.Spec.Int.parse_u32", "LowParse.Low.Int.validate_u32", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Bytes.parse_bounded_vlbytes", "LowParse.Low.Bytes.validate_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val validate_common_long:LP.validator parse_common_long\nlet validate_common_long:LP.validator parse_common_long =", "completed_definiton": "(LP.validate_u32 ())\n`LP.validate_nondep_then`\n((LP.validate_bounded_vlbytes 0 20) `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.get_pb", "original_source_type": "val get_pb (h: header) : Tot (secret_bitfield (if PShort? h then 5 else 4))", "source_type": "val get_pb (h: header) : Tot (secret_bitfield (if PShort? h then 5 else 4))", "source_definition": "let get_pb\n (h: header)\n: Tot (secret_bitfield (if PShort? h then 5 else 4))\n= \n match h with\n | PShort pb spin cid cid_len ->\n pb\n | PLong pb version dcid dcil scid scil spec ->\n pb", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 897, "start_col": 2, "end_line": 901, "end_col": 6 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) == (| Long, (| (), (| Retry, () |) |) |) );\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)\n\n#pop-options\n\nlet valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures (\n LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_initial_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0 sl pos\n\ninline_for_extraction\nlet read_payload_and_pn_length : LP.leaf_reader parse_payload_and_pn_length =\n LP.read_filter VI.read_varint payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Initial, () |) |) |) );\n valid_long_initial_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len)) (parse_payload_and_pn_length) sl pos3;\n let token = LP.get_bounded_vlgenbytes_contents 0 token_max_len (VI.read_bounded_varint 0 token_max_len) (VI.jump_bounded_varint 0 token_max_len) sl pos3 in\n let token_len = LP.bounded_vlgenbytes_payload_length 0 token_max_len (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let pos4 = LP.jump_bounded_vlgenbytes 0 token_max_len (VI.jump_bounded_varint 0 token_max_len) (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos4 in\n let spec = PInitial (payload_and_pn_length) token token_len in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures (\n LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_handshake_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` VI.parse_varint)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_handshake\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Handshake, () |) |) |) );\n valid_long_handshake_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PHandshake payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_zero_rtt_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_zero_rtt_body h0 sl pos))\n (ensures (\n LP.valid parse_long_zero_rtt_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_zero_rtt_body h0 sl pos)\n (LP.get_valid_pos parse_long_zero_rtt_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_zero_rtt_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_zero_rtt\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) == (| Long, (| (), (| ZeroRTT, () |) |) |) );\n valid_long_zero_rtt_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PZeroRTT payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet read_header_body\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (read_header_body_t sl cid_len tg)\n= fun len ->\n let h0 = HST.get () in\n match tg with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n read_header_body_short sl cid_len spin protected_bits len\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n read_header_body_long_retry sl cid_len protected_bits len\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n read_header_body_long_initial sl cid_len protected_bits len\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n read_header_body_long_handshake sl cid_len protected_bits len\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n read_header_body_long_zero_rtt sl cid_len protected_bits len\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --fuel 4 --ifuel 4 --query_stats\"\n\nlet read_header packet packet_len cid_len =\n let h0 = HST.get () in\n let sl = LP.make_slice packet packet_len in\n LP.valid_facts (parse_header cid_len) h0 sl 0ul;\n assert_spinoff (B.as_seq h0 packet `Seq.equal` LP.bytes_of_slice_from h0 sl 0ul);\n assert_norm (\n let k = parse_header_kind cid_len in\n Some? k.LP.parser_kind_high /\\\n k.LP.parser_kind_subkind == Some LP.ParserStrong\n );\n begin\n LPB.valid_bitsum_elim\n #LP.parse_u8_kind\n #8\n #U8.t\n #LPB.uint8\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n LP.parse_u8\n (parse_header_body cid_len)\n h0\n sl\n 0ul;\n let r = LP.read_u8 sl 0ul in\n let res = destr_first_byte\n (read_header_body_t sl cid_len)\n (fun _ cond dt df len' -> if cond then dt () len' else df () len')\n (read_header_body sl cid_len)\n r\n ()\n in\n res\n end\n\n#pop-options\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet synth_first_byte\n: (LPB.synth_bitsum'_recip_t first_byte)\n=\n (LPB.mk_synth_bitsum'_recip first_byte)\n\nmodule LW = LowParse.Low.Writers.Instances\n\n#push-options \"--z3rlimit 64 --max_fuel 4 --initial_fuel 4\"\n\ninline_for_extraction\nnoextract\nlet swrite_header_short\n (protected_bits: bitfield 5)\n (spin: bool)\n (cid: B.buffer U8.t)\n (cid_len: U32.t {\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n })\n (h0: HS.mem {\n B.live h0 cid\n })\n (out: LP.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer cid) (LP.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header cid_len) h0 0 out 0ul {\n LW.swvalue w == S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))\n })\n= \n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Short, (| (), ((if spin then 1uy else 0uy), (protected_bits, ())) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Short, (| (), () |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header cid_len (S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body cid_len k) h0 _ out 0ul =\n LW.swrite_weaken (LP.strong_parser_kind 0 20 None) (LW.swrite_flbytes h0 out 0ul cid_len cid)\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body cid_len)\n (serialize_header_body cid_len)\n tg\n s\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet swrite_common_long\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter serialize_common_long h0 0 out 0ul {\n LW.swvalue w == (version, (FB.hide (B.as_seq h0 dcid), FB.hide (B.as_seq h0 scid)))\n })\n= LW.swrite_leaf LP.write_u32 h0 out 0ul version `LW.swrite_nondep_then` (\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 dcid_len dcid `LW.swrite_nondep_then`\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 scid_len scid\n )\n\ninline_for_extraction\nlet swrite_payload_and_pn_length\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem)\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _))\n: Tot (w: LW.swriter (serialize_payload_and_pn_length) h0 0 out 0ul {\n LW.swvalue w == payload_and_pn_length\n })\n= payload_and_pn_length_prop `LW.swrite_filter` LW.swrite_leaf (LP.leaf_writer_strong_of_serializer32 VI.write_varint ()) h0 out 0ul payload_and_pn_length\n\n#push-options \"--z3rlimit 128 --max_fuel 4 --initial_fuel 4\"\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_initial\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (token: B.buffer U8.t)\n (token_length: U32.t {\n let v = U32.v token_length in\n v == B.length token /\\\n 0 <= v /\\ v <= token_max_len\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid /\\\n B.live h0 token\n })\n (out: LP.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint ((B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) `B.loc_union` B.loc_buffer token) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PInitial (FB.hide (B.as_seq h0 token)) payload_and_pn_length)\n })\n= \n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| Initial, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PInitial (FB.hide (B.as_seq h0 token)) payload_and_pn_length)) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then` (\n LW.swrite_bounded_vlgenbytes h0 out 0ul 0 token_max_len (LP.leaf_writer_strong_of_serializer32 (VI.write_bounded_varint 0 token_max_len) ()) token_length token `LW.swrite_nondep_then`\n swrite_payload_and_pn_length payload_and_pn_length h0 out\n )\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_zeroRTT\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PZeroRTT payload_and_pn_length)\n })\n=\n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| ZeroRTT, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PZeroRTT payload_and_pn_length)) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then`\n swrite_payload_and_pn_length payload_and_pn_length h0 out\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_handshake\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PHandshake payload_and_pn_length)\n })\n= [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| Handshake, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PHandshake payload_and_pn_length)) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then`\n swrite_payload_and_pn_length payload_and_pn_length h0 out\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_retry\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (odcid: B.buffer U8.t)\n (odcid_len: U32.t {\n let len = U32.v odcid_len in\n len == B.length odcid /\\\n 0 <= len /\\ len <= 20\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid /\\\n B.live h0 odcid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint ((B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) `B.loc_union` B.loc_buffer odcid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PRetry (FB.hide (B.as_seq h0 odcid)))\n })\n= [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| Retry, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PRetry (FB.hide (B.as_seq h0 odcid)))) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 0 out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then`\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 odcid_len odcid\n in\n LW.swrite_bitsum\n h0\n 0\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s\n\n#pop-options\n\n#restart-solver\n\ninline_for_extraction\nval write_header_aux\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n (out: B.buffer U8.t)\n (out_len: U32.t { U32.v out_len <= B.length out })\n: HST.Stack U32.t\n (requires (fun h0 ->\n (PShort? h ==> PShort?.cid_len h == short_dcid_len) /\\\n header_live h h0 /\\\n B.live h0 out /\\\n B.loc_disjoint (header_footprint h) (B.loc_buffer out) /\\\n Seq.length (LP.serialize (serialize_header short_dcid_len) (set_protected_bits (g_header h h0) 0uy)) <= U32.v out_len\n ))\n (ensures (fun h0 len h1 ->\n let gh = set_protected_bits (g_header h h0) 0uy in\n let s = LP.serialize (serialize_header short_dcid_len) gh in\n U32.v len <= U32.v out_len /\\\n B.modifies (B.loc_buffer out) h0 h1 /\\\n Seq.slice (B.as_seq h1 out) 0 (U32.v len) == s \n ))\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet write_header_aux\n short_dcid_len h out out_len\n= let h0 = HST.get () in\n let sl = LW.make_slice out out_len in\n LW.serialized_length_eq (serialize_header short_dcid_len) (set_protected_bits (g_header h h0) 0uy);\n let len = match h with\n | PShort pb spin cid cid_len ->\n LW.swrite (swrite_header_short 0uy spin cid cid_len h0 sl) 0ul\n | PLong pb version dcid dcil scid scil spec ->\n begin match spec with\n | PInitial payload_and_pn_length token token_length ->\n LW.swrite (swrite_header_long_initial 0uy short_dcid_len version dcid dcil scid scil payload_and_pn_length token token_length h0 sl) 0ul\n | PZeroRTT payload_and_pn_length ->\n LW.swrite (swrite_header_long_zeroRTT 0uy short_dcid_len version dcid dcil scid scil payload_and_pn_length h0 sl) 0ul\n | PHandshake payload_and_pn_length ->\n LW.swrite (swrite_header_long_handshake 0uy short_dcid_len version dcid dcil scid scil payload_and_pn_length h0 sl) 0ul\n | PRetry odcid odcil ->\n LW.swrite (swrite_header_long_retry 0uy short_dcid_len version dcid dcil scid scil odcid odcil h0 sl) 0ul\n end\n in\n let h1 = HST.get () in\n LP.valid_pos_valid_exact (parse_header short_dcid_len) h1 sl 0ul len;\n LP.valid_exact_serialize (serialize_header short_dcid_len) h1 sl 0ul len;\n len\n\n#pop-options\n\nlet get_pb\n (h: header)\n: Tot (secret_bitfield (if PShort? h then 5 else 4))", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LW", "full_module": "LowParse.Low.Writers.Instances" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Impl.Header.Public.header\n -> QUIC.Spec.Base.secret_bitfield (match PShort? h with\n | true -> 5\n | _ -> 4)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Public.header", "QUIC.Spec.Base.secret_bitfield", "Prims.bool", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.op_LessThanOrEqual", "FStar.UInt.uint_t", "FStar.UInt32.v", "QUIC.Impl.Header.Public.long_header_specifics", "QUIC.Impl.Header.Public.uu___is_PShort", "Prims.nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val get_pb (h: header) : Tot (secret_bitfield (if PShort? h then 5 else 4))\nlet get_pb (h: header) : Tot (secret_bitfield (if PShort? h then 5 else 4)) =", "completed_definiton": "match h with\n| PShort pb spin cid cid_len -> pb\n| PLong pb version dcid dcil scid scil spec -> pb", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.validate_long_retry_body", "original_source_type": "val validate_long_retry_body:LP.validator parse_long_retry_body", "source_type": "val validate_long_retry_body:LP.validator parse_long_retry_body", "source_definition": "let validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 33, "start_col": 2, "end_line": 33, "end_col": 81 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator QUIC.Spec.Header.Public.parse_long_retry_body", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.validate_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Impl.Header.Public.validate_common_long", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "LowParse.Spec.Bytes.parse_bounded_vlbytes", "LowParse.Low.Bytes.validate_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val validate_long_retry_body:LP.validator parse_long_retry_body\nlet validate_long_retry_body:LP.validator parse_long_retry_body =", "completed_definiton": "validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.validate_long_zero_rtt_body", "original_source_type": "val validate_long_zero_rtt_body:LP.validator parse_long_zero_rtt_body", "source_type": "val validate_long_zero_rtt_body:LP.validator parse_long_zero_rtt_body", "source_definition": "let validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 25, "start_col": 2, "end_line": 25, "end_col": 79 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator QUIC.Spec.Header.Public.parse_long_zero_rtt_body", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.validate_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Impl.Header.Public.validate_common_long", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "QUIC.Impl.Header.Public.validate_payload_and_pn_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val validate_long_zero_rtt_body:LP.validator parse_long_zero_rtt_body\nlet validate_long_zero_rtt_body:LP.validator parse_long_zero_rtt_body =", "completed_definiton": "validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.read_payload_and_pn_length", "original_source_type": "val read_payload_and_pn_length:LP.leaf_reader parse_payload_and_pn_length", "source_type": "val read_payload_and_pn_length:LP.leaf_reader parse_payload_and_pn_length", "source_definition": "let read_payload_and_pn_length : LP.leaf_reader parse_payload_and_pn_length =\n LP.read_filter VI.read_varint payload_and_pn_length_prop", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 226, "start_col": 2, "end_line": 226, "end_col": 58 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) == (| Long, (| (), (| Retry, () |) |) |) );\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)\n\n#pop-options\n\nlet valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures (\n LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_initial_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0 sl pos\n\ninline_for_extraction", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.leaf_reader QUIC.Spec.Header.Public.parse_payload_and_pn_length", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.read_filter", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.UInt62.t", "QUIC.Spec.VarInt.parse_varint", "QUIC.Impl.VarInt.read_varint", "QUIC.Spec.Header.Public.payload_and_pn_length_prop" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val read_payload_and_pn_length:LP.leaf_reader parse_payload_and_pn_length\nlet read_payload_and_pn_length:LP.leaf_reader parse_payload_and_pn_length =", "completed_definiton": "LP.read_filter VI.read_varint payload_and_pn_length_prop", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.valid_long_handshake_body_elim", "original_source_type": "val valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n : Lemma (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures\n (LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos)))", "source_type": "val valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n : Lemma (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures\n (LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos)))", "source_definition": "let valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures (\n LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_handshake_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` VI.parse_varint)\n h0 sl pos", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 278, "start_col": 2, "end_line": 281, "end_col": 13 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) == (| Long, (| (), (| Retry, () |) |) |) );\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)\n\n#pop-options\n\nlet valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures (\n LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_initial_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0 sl pos\n\ninline_for_extraction\nlet read_payload_and_pn_length : LP.leaf_reader parse_payload_and_pn_length =\n LP.read_filter VI.read_varint payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Initial, () |) |) |) );\n valid_long_initial_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len)) (parse_payload_and_pn_length) sl pos3;\n let token = LP.get_bounded_vlgenbytes_contents 0 token_max_len (VI.read_bounded_varint 0 token_max_len) (VI.jump_bounded_varint 0 token_max_len) sl pos3 in\n let token_len = LP.bounded_vlgenbytes_payload_length 0 token_max_len (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let pos4 = LP.jump_bounded_vlgenbytes 0 token_max_len (VI.jump_bounded_varint 0 token_max_len) (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos4 in\n let spec = PInitial (payload_and_pn_length) token token_len in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures (\n LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos)", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n h0: FStar.Monotonic.HyperStack.mem ->\n sl:\n LowParse.Slice.slice (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte) ->\n pos: FStar.UInt32.t\n -> FStar.Pervasives.Lemma\n (requires\n LowParse.Low.Base.Spec.valid QUIC.Spec.Header.Public.parse_long_handshake_body h0 sl pos)\n (ensures\n LowParse.Low.Base.Spec.valid QUIC.Spec.Header.Public.parse_long_handshake_body h0 sl pos /\\\n LowParse.Low.Base.Spec.valid_content_pos (LowParse.Spec.Combinators.nondep_then QUIC.Spec.Header.Public.parse_common_long\n QUIC.Spec.Header.Public.parse_payload_and_pn_length)\n h0\n sl\n pos\n (LowParse.Low.Base.Spec.contents QUIC.Spec.Header.Public.parse_long_handshake_body\n h0\n sl\n pos)\n (LowParse.Low.Base.Spec.get_valid_pos QUIC.Spec.Header.Public.parse_long_handshake_body\n h0\n sl\n pos))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Monotonic.HyperStack.mem", "LowParse.Slice.slice", "LowStar.Buffer.trivial_preorder", "LowParse.Bytes.byte", "FStar.UInt32.t", "LowParse.Low.Base.Spec.valid_facts", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.VarInt.parse_varint_kind", "FStar.Pervasives.Native.tuple2", "QUIC.Spec.Header.Public.common_long_t", "QUIC.UInt62.t", "LowParse.Spec.Combinators.nondep_then", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Spec.VarInt.parse_varint", "Prims.unit", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.Header.Public.long_handshake_body_t", "QUIC.Spec.Header.Public.parse_long_handshake_body", "LowParse.Low.Base.Spec.valid", "Prims.squash", "Prims.l_and", "LowParse.Low.Base.Spec.valid_content_pos", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "LowParse.Low.Base.Spec.contents", "LowParse.Low.Base.Spec.get_valid_pos", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n : Lemma (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures\n (LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos)))\nlet valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n : Lemma (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures\n (LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos))) =", "completed_definiton": "LP.valid_facts parse_long_handshake_body h0 sl pos;\nLP.valid_facts (parse_common_long `LP.nondep_then` VI.parse_varint) h0 sl pos", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.valid_long_zero_rtt_body_elim", "original_source_type": "val valid_long_zero_rtt_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n : Lemma (requires (LP.valid parse_long_zero_rtt_body h0 sl pos))\n (ensures\n (LP.valid parse_long_zero_rtt_body h0 sl pos /\\\n LP.valid_content_pos (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_zero_rtt_body h0 sl pos)\n (LP.get_valid_pos parse_long_zero_rtt_body h0 sl pos)))", "source_type": "val valid_long_zero_rtt_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n : Lemma (requires (LP.valid parse_long_zero_rtt_body h0 sl pos))\n (ensures\n (LP.valid parse_long_zero_rtt_body h0 sl pos /\\\n LP.valid_content_pos (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_zero_rtt_body h0 sl pos)\n (LP.get_valid_pos parse_long_zero_rtt_body h0 sl pos)))", "source_definition": "let valid_long_zero_rtt_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_zero_rtt_body h0 sl pos))\n (ensures (\n LP.valid parse_long_zero_rtt_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_zero_rtt_body h0 sl pos)\n (LP.get_valid_pos parse_long_zero_rtt_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_zero_rtt_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0 sl pos", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 329, "start_col": 2, "end_line": 332, "end_col": 13 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) == (| Long, (| (), (| Retry, () |) |) |) );\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)\n\n#pop-options\n\nlet valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures (\n LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_initial_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0 sl pos\n\ninline_for_extraction\nlet read_payload_and_pn_length : LP.leaf_reader parse_payload_and_pn_length =\n LP.read_filter VI.read_varint payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Initial, () |) |) |) );\n valid_long_initial_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len)) (parse_payload_and_pn_length) sl pos3;\n let token = LP.get_bounded_vlgenbytes_contents 0 token_max_len (VI.read_bounded_varint 0 token_max_len) (VI.jump_bounded_varint 0 token_max_len) sl pos3 in\n let token_len = LP.bounded_vlgenbytes_payload_length 0 token_max_len (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let pos4 = LP.jump_bounded_vlgenbytes 0 token_max_len (VI.jump_bounded_varint 0 token_max_len) (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos4 in\n let spec = PInitial (payload_and_pn_length) token token_len in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures (\n LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_handshake_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` VI.parse_varint)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_handshake\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Handshake, () |) |) |) );\n valid_long_handshake_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PHandshake payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_zero_rtt_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_zero_rtt_body h0 sl pos))\n (ensures (\n LP.valid parse_long_zero_rtt_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_zero_rtt_body h0 sl pos)\n (LP.get_valid_pos parse_long_zero_rtt_body h0 sl pos)", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n h0: FStar.Monotonic.HyperStack.mem ->\n sl:\n LowParse.Slice.slice (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte) ->\n pos: FStar.UInt32.t\n -> FStar.Pervasives.Lemma\n (requires\n LowParse.Low.Base.Spec.valid QUIC.Spec.Header.Public.parse_long_zero_rtt_body h0 sl pos)\n (ensures\n LowParse.Low.Base.Spec.valid QUIC.Spec.Header.Public.parse_long_zero_rtt_body h0 sl pos /\\\n LowParse.Low.Base.Spec.valid_content_pos (LowParse.Spec.Combinators.nondep_then QUIC.Spec.Header.Public.parse_common_long\n QUIC.Spec.Header.Public.parse_payload_and_pn_length)\n h0\n sl\n pos\n (LowParse.Low.Base.Spec.contents QUIC.Spec.Header.Public.parse_long_zero_rtt_body\n h0\n sl\n pos)\n (LowParse.Low.Base.Spec.get_valid_pos QUIC.Spec.Header.Public.parse_long_zero_rtt_body\n h0\n sl\n pos))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Monotonic.HyperStack.mem", "LowParse.Slice.slice", "LowStar.Buffer.trivial_preorder", "LowParse.Bytes.byte", "FStar.UInt32.t", "LowParse.Low.Base.Spec.valid_facts", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "FStar.Pervasives.Native.tuple2", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "LowParse.Spec.Combinators.nondep_then", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "Prims.unit", "QUIC.Spec.Header.Public.long_zero_rtt_body_t", "QUIC.Spec.Header.Public.parse_long_zero_rtt_body", "LowParse.Low.Base.Spec.valid", "Prims.squash", "Prims.l_and", "LowParse.Low.Base.Spec.valid_content_pos", "LowParse.Low.Base.Spec.contents", "LowParse.Low.Base.Spec.get_valid_pos", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val valid_long_zero_rtt_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n : Lemma (requires (LP.valid parse_long_zero_rtt_body h0 sl pos))\n (ensures\n (LP.valid parse_long_zero_rtt_body h0 sl pos /\\\n LP.valid_content_pos (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_zero_rtt_body h0 sl pos)\n (LP.get_valid_pos parse_long_zero_rtt_body h0 sl pos)))\nlet valid_long_zero_rtt_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n : Lemma (requires (LP.valid parse_long_zero_rtt_body h0 sl pos))\n (ensures\n (LP.valid parse_long_zero_rtt_body h0 sl pos /\\\n LP.valid_content_pos (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_zero_rtt_body h0 sl pos)\n (LP.get_valid_pos parse_long_zero_rtt_body h0 sl pos))) =", "completed_definiton": "LP.valid_facts parse_long_zero_rtt_body h0 sl pos;\nLP.valid_facts (parse_common_long `LP.nondep_then` parse_payload_and_pn_length) h0 sl pos", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.valid_long_initial_body_elim", "original_source_type": "val valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n : Lemma (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures\n (LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos (parse_common_long\n `LP.nondep_then`\n ((LP.parse_bounded_vlgenbytes 0\n token_max_len\n (VI.parse_bounded_varint 0 token_max_len))\n `LP.nondep_then`\n parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)))", "source_type": "val valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n : Lemma (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures\n (LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos (parse_common_long\n `LP.nondep_then`\n ((LP.parse_bounded_vlgenbytes 0\n token_max_len\n (VI.parse_bounded_varint 0 token_max_len))\n `LP.nondep_then`\n parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)))", "source_definition": "let valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures (\n LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_initial_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0 sl pos", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 219, "start_col": 2, "end_line": 222, "end_col": 13 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) == (| Long, (| (), (| Retry, () |) |) |) );\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)\n\n#pop-options\n\nlet valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures (\n LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n h0: FStar.Monotonic.HyperStack.mem ->\n sl:\n LowParse.Slice.slice (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte) ->\n pos: FStar.UInt32.t\n -> FStar.Pervasives.Lemma\n (requires\n LowParse.Low.Base.Spec.valid QUIC.Spec.Header.Public.parse_long_initial_body h0 sl pos)\n (ensures\n LowParse.Low.Base.Spec.valid QUIC.Spec.Header.Public.parse_long_initial_body h0 sl pos /\\\n LowParse.Low.Base.Spec.valid_content_pos (LowParse.Spec.Combinators.nondep_then QUIC.Spec.Header.Public.parse_common_long\n (LowParse.Spec.Combinators.nondep_then (LowParse.Spec.Bytes.parse_bounded_vlgenbytes 0\n QUIC.Spec.Base.token_max_len\n (QUIC.Spec.VarInt.parse_bounded_varint 0 QUIC.Spec.Base.token_max_len))\n QUIC.Spec.Header.Public.parse_payload_and_pn_length))\n h0\n sl\n pos\n (LowParse.Low.Base.Spec.contents QUIC.Spec.Header.Public.parse_long_initial_body h0 sl pos\n )\n (LowParse.Low.Base.Spec.get_valid_pos QUIC.Spec.Header.Public.parse_long_initial_body\n h0\n sl\n pos))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Monotonic.HyperStack.mem", "LowParse.Slice.slice", "LowStar.Buffer.trivial_preorder", "LowParse.Bytes.byte", "FStar.UInt32.t", "LowParse.Low.Base.Spec.valid_facts", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "LowParse.Spec.VLGen.parse_bounded_vlgen_kind", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.Base.token_max_len", "LowParse.Spec.Combinators.parse_filter_kind", "FStar.Pervasives.Native.tuple2", "QUIC.Spec.Header.Public.common_long_t", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "LowParse.Spec.Combinators.nondep_then", "QUIC.Spec.Header.Public.parse_common_long", "LowParse.Spec.Bytes.parse_bounded_vlgenbytes", "QUIC.Spec.VarInt.parse_bounded_varint", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "Prims.unit", "QUIC.Spec.Header.Public.long_initial_body_t", "QUIC.Spec.Header.Public.parse_long_initial_body", "LowParse.Low.Base.Spec.valid", "Prims.squash", "Prims.l_and", "LowParse.Low.Base.Spec.valid_content_pos", "LowParse.Low.Base.Spec.contents", "LowParse.Low.Base.Spec.get_valid_pos", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n : Lemma (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures\n (LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos (parse_common_long\n `LP.nondep_then`\n ((LP.parse_bounded_vlgenbytes 0\n token_max_len\n (VI.parse_bounded_varint 0 token_max_len))\n `LP.nondep_then`\n parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)))\nlet valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n : Lemma (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures\n (LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos (parse_common_long\n `LP.nondep_then`\n ((LP.parse_bounded_vlgenbytes 0\n token_max_len\n (VI.parse_bounded_varint 0 token_max_len))\n `LP.nondep_then`\n parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos))) =", "completed_definiton": "LP.valid_facts parse_long_initial_body h0 sl pos;\nLP.valid_facts (parse_common_long\n `LP.nondep_then`\n ((LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len))\n `LP.nondep_then`\n parse_payload_and_pn_length))\n h0\n sl\n pos", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.validate_long_initial_body", "original_source_type": "val validate_long_initial_body:LP.validator parse_long_initial_body", "source_type": "val validate_long_initial_body:LP.validator parse_long_initial_body", "source_definition": "let validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 37, "start_col": 2, "end_line": 37, "end_col": 292 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Low.Base.validator QUIC.Spec.Header.Public.parse_long_initial_body", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Low.Combinators.validate_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Impl.Header.Public.validate_common_long", "LowParse.Spec.VLGen.parse_bounded_vlgen_kind", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.Base.token_max_len", "LowParse.Spec.Combinators.parse_filter_kind", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Bytes.parse_bounded_vlgenbytes", "QUIC.Spec.VarInt.parse_bounded_varint", "FStar.UInt32.v", "FStar.UInt32.__uint_to_t", "FStar.UInt32.uint_to_t", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "LowParse.Low.Bytes.validate_bounded_vlgenbytes", "QUIC.Impl.VarInt.validate_bounded_varint", "QUIC.Impl.VarInt.read_bounded_varint", "QUIC.Impl.Header.Public.validate_payload_and_pn_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val validate_long_initial_body:LP.validator parse_long_initial_body\nlet validate_long_initial_body:LP.validator parse_long_initial_body =", "completed_definiton": "validate_common_long\n`LP.validate_nondep_then`\n((LP.validate_bounded_vlgenbytes 0\n 0ul\n token_max_len\n (U32.uint_to_t token_max_len)\n (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len))\n (VI.read_bounded_varint 0 token_max_len))\n `LP.validate_nondep_then`\n validate_payload_and_pn_length)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.swrite_payload_and_pn_length", "original_source_type": "val swrite_payload_and_pn_length\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem)\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _))\n : Tot\n (w:\n LW.swriter (serialize_payload_and_pn_length) h0 0 out 0ul\n {LW.swvalue w == payload_and_pn_length})", "source_type": "val swrite_payload_and_pn_length\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem)\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _))\n : Tot\n (w:\n LW.swriter (serialize_payload_and_pn_length) h0 0 out 0ul\n {LW.swvalue w == payload_and_pn_length})", "source_definition": "let swrite_payload_and_pn_length\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem)\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _))\n: Tot (w: LW.swriter (serialize_payload_and_pn_length) h0 0 out 0ul {\n LW.swvalue w == payload_and_pn_length\n })\n= payload_and_pn_length_prop `LW.swrite_filter` LW.swrite_leaf (LP.leaf_writer_strong_of_serializer32 VI.write_varint ()) h0 out 0ul payload_and_pn_length", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 539, "start_col": 2, "end_line": 539, "end_col": 154 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) == (| Long, (| (), (| Retry, () |) |) |) );\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)\n\n#pop-options\n\nlet valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures (\n LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_initial_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0 sl pos\n\ninline_for_extraction\nlet read_payload_and_pn_length : LP.leaf_reader parse_payload_and_pn_length =\n LP.read_filter VI.read_varint payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Initial, () |) |) |) );\n valid_long_initial_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len)) (parse_payload_and_pn_length) sl pos3;\n let token = LP.get_bounded_vlgenbytes_contents 0 token_max_len (VI.read_bounded_varint 0 token_max_len) (VI.jump_bounded_varint 0 token_max_len) sl pos3 in\n let token_len = LP.bounded_vlgenbytes_payload_length 0 token_max_len (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let pos4 = LP.jump_bounded_vlgenbytes 0 token_max_len (VI.jump_bounded_varint 0 token_max_len) (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos4 in\n let spec = PInitial (payload_and_pn_length) token token_len in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures (\n LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_handshake_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` VI.parse_varint)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_handshake\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Handshake, () |) |) |) );\n valid_long_handshake_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PHandshake payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_zero_rtt_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_zero_rtt_body h0 sl pos))\n (ensures (\n LP.valid parse_long_zero_rtt_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_zero_rtt_body h0 sl pos)\n (LP.get_valid_pos parse_long_zero_rtt_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_zero_rtt_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_zero_rtt\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) == (| Long, (| (), (| ZeroRTT, () |) |) |) );\n valid_long_zero_rtt_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PZeroRTT payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet read_header_body\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (read_header_body_t sl cid_len tg)\n= fun len ->\n let h0 = HST.get () in\n match tg with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n read_header_body_short sl cid_len spin protected_bits len\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n read_header_body_long_retry sl cid_len protected_bits len\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n read_header_body_long_initial sl cid_len protected_bits len\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n read_header_body_long_handshake sl cid_len protected_bits len\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n read_header_body_long_zero_rtt sl cid_len protected_bits len\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --fuel 4 --ifuel 4 --query_stats\"\n\nlet read_header packet packet_len cid_len =\n let h0 = HST.get () in\n let sl = LP.make_slice packet packet_len in\n LP.valid_facts (parse_header cid_len) h0 sl 0ul;\n assert_spinoff (B.as_seq h0 packet `Seq.equal` LP.bytes_of_slice_from h0 sl 0ul);\n assert_norm (\n let k = parse_header_kind cid_len in\n Some? k.LP.parser_kind_high /\\\n k.LP.parser_kind_subkind == Some LP.ParserStrong\n );\n begin\n LPB.valid_bitsum_elim\n #LP.parse_u8_kind\n #8\n #U8.t\n #LPB.uint8\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n LP.parse_u8\n (parse_header_body cid_len)\n h0\n sl\n 0ul;\n let r = LP.read_u8 sl 0ul in\n let res = destr_first_byte\n (read_header_body_t sl cid_len)\n (fun _ cond dt df len' -> if cond then dt () len' else df () len')\n (read_header_body sl cid_len)\n r\n ()\n in\n res\n end\n\n#pop-options\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet synth_first_byte\n: (LPB.synth_bitsum'_recip_t first_byte)\n=\n (LPB.mk_synth_bitsum'_recip first_byte)\n\nmodule LW = LowParse.Low.Writers.Instances\n\n#push-options \"--z3rlimit 64 --max_fuel 4 --initial_fuel 4\"\n\ninline_for_extraction\nnoextract\nlet swrite_header_short\n (protected_bits: bitfield 5)\n (spin: bool)\n (cid: B.buffer U8.t)\n (cid_len: U32.t {\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n })\n (h0: HS.mem {\n B.live h0 cid\n })\n (out: LP.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer cid) (LP.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header cid_len) h0 0 out 0ul {\n LW.swvalue w == S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))\n })\n= \n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Short, (| (), ((if spin then 1uy else 0uy), (protected_bits, ())) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Short, (| (), () |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header cid_len (S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body cid_len k) h0 _ out 0ul =\n LW.swrite_weaken (LP.strong_parser_kind 0 20 None) (LW.swrite_flbytes h0 out 0ul cid_len cid)\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body cid_len)\n (serialize_header_body cid_len)\n tg\n s\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet swrite_common_long\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter serialize_common_long h0 0 out 0ul {\n LW.swvalue w == (version, (FB.hide (B.as_seq h0 dcid), FB.hide (B.as_seq h0 scid)))\n })\n= LW.swrite_leaf LP.write_u32 h0 out 0ul version `LW.swrite_nondep_then` (\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 dcid_len dcid `LW.swrite_nondep_then`\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 scid_len scid\n )\n\ninline_for_extraction\nlet swrite_payload_and_pn_length\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem)\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _))\n: Tot (w: LW.swriter (serialize_payload_and_pn_length) h0 0 out 0ul {\n LW.swvalue w == payload_and_pn_length", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LW", "full_module": "LowParse.Low.Writers.Instances" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n payload_and_pn_length: QUIC.Spec.Base.payload_and_pn_length_t ->\n h0: FStar.Monotonic.HyperStack.mem ->\n out:\n LowParse.Slice.slice (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n -> w:\n LowParse.Low.Writers.swriter QUIC.Spec.Header.Public.serialize_payload_and_pn_length\n h0\n 0\n out\n 0ul {LowParse.Low.Writers.swvalue w == payload_and_pn_length}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.payload_and_pn_length_t", "FStar.Monotonic.HyperStack.mem", "LowParse.Slice.slice", "LowStar.Buffer.trivial_preorder", "LowParse.Bytes.byte", "LowParse.Low.Writers.Instances.swrite_filter", "FStar.UInt32.__uint_to_t", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.UInt62.t", "QUIC.Spec.VarInt.parse_varint", "QUIC.Spec.VarInt.serialize_varint", "QUIC.Spec.Header.Public.payload_and_pn_length_prop", "LowParse.Low.Writers.swrite_leaf", "LowParse.Low.Base.leaf_writer_strong_of_serializer32", "QUIC.Impl.VarInt.write_varint", "LowParse.Low.Writers.swriter", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "QUIC.Spec.Header.Public.serialize_payload_and_pn_length", "Prims.eq2", "FStar.UInt64.t", "Prims.l_or", "Prims.l_and", "Prims.b2t", "Prims.op_LessThan", "FStar.UInt64.v", "QUIC.UInt62.bound", "Prims.bool", "Prims.op_GreaterThanOrEqual", "LowParse.Low.Writers.swvalue" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val swrite_payload_and_pn_length\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem)\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _))\n : Tot\n (w:\n LW.swriter (serialize_payload_and_pn_length) h0 0 out 0ul\n {LW.swvalue w == payload_and_pn_length})\nlet swrite_payload_and_pn_length\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem)\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _))\n : Tot\n (w:\n LW.swriter (serialize_payload_and_pn_length) h0 0 out 0ul\n {LW.swvalue w == payload_and_pn_length}) =", "completed_definiton": "payload_and_pn_length_prop\n`LW.swrite_filter`\n(LW.swrite_leaf (LP.leaf_writer_strong_of_serializer32 VI.write_varint ())\n h0\n out\n 0ul\n payload_and_pn_length)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.validate_header_body_cases", "original_source_type": "val validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k': LPB.bitsum'_key_type first_byte)\n : Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))", "source_type": "val validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k': LPB.bitsum'_key_type first_byte)\n : Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))", "source_definition": "let validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 50, "start_col": 2, "end_line": 60, "end_col": 28 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n k': LowParse.Spec.BitSum.bitsum'_key_type QUIC.Spec.Header.Public.first_byte\n -> LowParse.Low.Base.validator (FStar.Pervasives.dsnd (QUIC.Spec.Header.Public.parse_header_body short_dcid_len\n k'))", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "LowParse.Spec.BitSum.bitsum'_key_type", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "LowParse.Spec.Base.coerce", "LowParse.Low.Combinators.validate_weaken", "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some", "LowParse.Spec.Base.total_constant_size_parser_kind", "FStar.UInt32.v", "FStar.Bytes.lbytes", "LowParse.Spec.Bytes.parse_flbytes", "LowParse.Low.Bytes.validate_flbytes", "FStar.Int.Cast.uint32_to_uint64", "QUIC.Impl.Header.Public.validate_long_initial_body", "QUIC.Impl.Header.Public.validate_long_zero_rtt_body", "QUIC.Impl.Header.Public.validate_long_handshake_body", "QUIC.Impl.Header.Public.validate_long_retry_body", "LowParse.Low.Base.validator", "Prims.__proj__Mkdtuple2__item___1", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.parser", "QUIC.Spec.Header.Public.header_body_type", "QUIC.Spec.Header.Public.parse_header_body", "FStar.Pervasives.dsnd" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k': LPB.bitsum'_key_type first_byte)\n : Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k': LPB.bitsum'_key_type first_byte)\n : Tot (LP.validator (dsnd (parse_header_body short_dcid_len k'))) =", "completed_definiton": "match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n| (| Short , (| () , () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None)\n (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len))\n ()\n| (| Long , (| () , (| Initial , () |) |) |) -> validate_long_initial_body\n| (| Long , (| () , (| ZeroRTT , () |) |) |) -> validate_long_zero_rtt_body\n| (| Long , (| () , (| Handshake , () |) |) |) -> validate_long_handshake_body\n| (| Long , (| () , (| Retry , () |) |) |) -> validate_long_retry_body", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.swrite_common_long", "original_source_type": "val swrite_common_long\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len:\n U32.t\n { let len = U32.v dcid_len in\n len == B.length dcid /\\ 0 <= len /\\ len <= 20 })\n (scid: B.buffer U8.t)\n (scid_len:\n U32.t\n { let len = U32.v scid_len in\n len == B.length scid /\\ 0 <= len /\\ len <= 20 })\n (h0: HS.mem{B.live h0 dcid /\\ B.live h0 scid})\n (out:\n LW.slice (B.trivial_preorder _) (B.trivial_preorder _)\n { B.loc_disjoint ((B.loc_buffer dcid) `B.loc_union` (B.loc_buffer scid))\n (LW.loc_slice_from out 0ul) })\n : Tot\n (w:\n LW.swriter serialize_common_long h0 0 out 0ul\n {LW.swvalue w == (version, (FB.hide (B.as_seq h0 dcid), FB.hide (B.as_seq h0 scid)))})", "source_type": "val swrite_common_long\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len:\n U32.t\n { let len = U32.v dcid_len in\n len == B.length dcid /\\ 0 <= len /\\ len <= 20 })\n (scid: B.buffer U8.t)\n (scid_len:\n U32.t\n { let len = U32.v scid_len in\n len == B.length scid /\\ 0 <= len /\\ len <= 20 })\n (h0: HS.mem{B.live h0 dcid /\\ B.live h0 scid})\n (out:\n LW.slice (B.trivial_preorder _) (B.trivial_preorder _)\n { B.loc_disjoint ((B.loc_buffer dcid) `B.loc_union` (B.loc_buffer scid))\n (LW.loc_slice_from out 0ul) })\n : Tot\n (w:\n LW.swriter serialize_common_long h0 0 out 0ul\n {LW.swvalue w == (version, (FB.hide (B.as_seq h0 dcid), FB.hide (B.as_seq h0 scid)))})", "source_definition": "let swrite_common_long\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter serialize_common_long h0 0 out 0ul {\n LW.swvalue w == (version, (FB.hide (B.as_seq h0 dcid), FB.hide (B.as_seq h0 scid)))\n })\n= LW.swrite_leaf LP.write_u32 h0 out 0ul version `LW.swrite_nondep_then` (\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 dcid_len dcid `LW.swrite_nondep_then`\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 scid_len scid\n )", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 526, "start_col": 2, "end_line": 529, "end_col": 3 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) == (| Long, (| (), (| Retry, () |) |) |) );\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)\n\n#pop-options\n\nlet valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures (\n LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_initial_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0 sl pos\n\ninline_for_extraction\nlet read_payload_and_pn_length : LP.leaf_reader parse_payload_and_pn_length =\n LP.read_filter VI.read_varint payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Initial, () |) |) |) );\n valid_long_initial_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len)) (parse_payload_and_pn_length) sl pos3;\n let token = LP.get_bounded_vlgenbytes_contents 0 token_max_len (VI.read_bounded_varint 0 token_max_len) (VI.jump_bounded_varint 0 token_max_len) sl pos3 in\n let token_len = LP.bounded_vlgenbytes_payload_length 0 token_max_len (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let pos4 = LP.jump_bounded_vlgenbytes 0 token_max_len (VI.jump_bounded_varint 0 token_max_len) (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos4 in\n let spec = PInitial (payload_and_pn_length) token token_len in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures (\n LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_handshake_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` VI.parse_varint)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_handshake\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Handshake, () |) |) |) );\n valid_long_handshake_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PHandshake payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_zero_rtt_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_zero_rtt_body h0 sl pos))\n (ensures (\n LP.valid parse_long_zero_rtt_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_zero_rtt_body h0 sl pos)\n (LP.get_valid_pos parse_long_zero_rtt_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_zero_rtt_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_zero_rtt\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) == (| Long, (| (), (| ZeroRTT, () |) |) |) );\n valid_long_zero_rtt_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PZeroRTT payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet read_header_body\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (read_header_body_t sl cid_len tg)\n= fun len ->\n let h0 = HST.get () in\n match tg with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n read_header_body_short sl cid_len spin protected_bits len\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n read_header_body_long_retry sl cid_len protected_bits len\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n read_header_body_long_initial sl cid_len protected_bits len\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n read_header_body_long_handshake sl cid_len protected_bits len\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n read_header_body_long_zero_rtt sl cid_len protected_bits len\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --fuel 4 --ifuel 4 --query_stats\"\n\nlet read_header packet packet_len cid_len =\n let h0 = HST.get () in\n let sl = LP.make_slice packet packet_len in\n LP.valid_facts (parse_header cid_len) h0 sl 0ul;\n assert_spinoff (B.as_seq h0 packet `Seq.equal` LP.bytes_of_slice_from h0 sl 0ul);\n assert_norm (\n let k = parse_header_kind cid_len in\n Some? k.LP.parser_kind_high /\\\n k.LP.parser_kind_subkind == Some LP.ParserStrong\n );\n begin\n LPB.valid_bitsum_elim\n #LP.parse_u8_kind\n #8\n #U8.t\n #LPB.uint8\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n LP.parse_u8\n (parse_header_body cid_len)\n h0\n sl\n 0ul;\n let r = LP.read_u8 sl 0ul in\n let res = destr_first_byte\n (read_header_body_t sl cid_len)\n (fun _ cond dt df len' -> if cond then dt () len' else df () len')\n (read_header_body sl cid_len)\n r\n ()\n in\n res\n end\n\n#pop-options\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet synth_first_byte\n: (LPB.synth_bitsum'_recip_t first_byte)\n=\n (LPB.mk_synth_bitsum'_recip first_byte)\n\nmodule LW = LowParse.Low.Writers.Instances\n\n#push-options \"--z3rlimit 64 --max_fuel 4 --initial_fuel 4\"\n\ninline_for_extraction\nnoextract\nlet swrite_header_short\n (protected_bits: bitfield 5)\n (spin: bool)\n (cid: B.buffer U8.t)\n (cid_len: U32.t {\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n })\n (h0: HS.mem {\n B.live h0 cid\n })\n (out: LP.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer cid) (LP.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header cid_len) h0 0 out 0ul {\n LW.swvalue w == S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))\n })\n= \n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Short, (| (), ((if spin then 1uy else 0uy), (protected_bits, ())) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Short, (| (), () |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header cid_len (S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body cid_len k) h0 _ out 0ul =\n LW.swrite_weaken (LP.strong_parser_kind 0 20 None) (LW.swrite_flbytes h0 out 0ul cid_len cid)\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body cid_len)\n (serialize_header_body cid_len)\n tg\n s\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet swrite_common_long\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter serialize_common_long h0 0 out 0ul {\n LW.swvalue w == (version, (FB.hide (B.as_seq h0 dcid), FB.hide (B.as_seq h0 scid)))", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LW", "full_module": "LowParse.Low.Writers.Instances" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n version: FStar.UInt32.t ->\n dcid: LowStar.Buffer.buffer FStar.UInt8.t ->\n dcid_len:\n FStar.UInt32.t\n { let len = FStar.UInt32.v dcid_len in\n len == LowStar.Monotonic.Buffer.length dcid /\\ 0 <= len /\\ len <= 20 } ->\n scid: LowStar.Buffer.buffer FStar.UInt8.t ->\n scid_len:\n FStar.UInt32.t\n { let len = FStar.UInt32.v scid_len in\n len == LowStar.Monotonic.Buffer.length scid /\\ 0 <= len /\\ len <= 20 } ->\n h0:\n FStar.Monotonic.HyperStack.mem\n {LowStar.Monotonic.Buffer.live h0 dcid /\\ LowStar.Monotonic.Buffer.live h0 scid} ->\n out:\n LowParse.Slice.slice (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n { LowStar.Monotonic.Buffer.loc_disjoint (LowStar.Monotonic.Buffer.loc_union (LowStar.Monotonic.Buffer.loc_buffer\n dcid)\n (LowStar.Monotonic.Buffer.loc_buffer scid))\n (LowParse.Slice.loc_slice_from out 0ul) }\n -> w:\n LowParse.Low.Writers.swriter QUIC.Spec.Header.Public.serialize_common_long h0 0 out 0ul\n { LowParse.Low.Writers.swvalue w ==\n FStar.Pervasives.Native.Mktuple2 version\n (FStar.Bytes.hide (LowStar.Monotonic.Buffer.as_seq h0 dcid),\n FStar.Bytes.hide (LowStar.Monotonic.Buffer.as_seq h0 scid)) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "LowStar.Buffer.buffer", "FStar.UInt8.t", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.op_LessThanOrEqual", "FStar.UInt.uint_t", "FStar.UInt32.v", "FStar.Monotonic.HyperStack.mem", "LowStar.Monotonic.Buffer.live", "LowParse.Slice.slice", "LowParse.Bytes.byte", "LowStar.Monotonic.Buffer.loc_disjoint", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.loc_buffer", "LowParse.Slice.loc_slice_from", "FStar.UInt32.__uint_to_t", "LowParse.Low.Writers.Instances.swrite_nondep_then", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.Int.parse_u32", "LowParse.Spec.Int.serialize_u32", "LowParse.Low.Writers.swrite_leaf", "LowParse.Low.Int.write_u32", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Bytes.parse_bounded_vlbytes", "LowParse.Spec.Combinators.serialize_nondep_then", "LowParse.Spec.Bytes.serialize_bounded_vlbytes", "LowParse.Low.Writers.Instances.max", "LowParse.Low.Writers.Instances.swrite_bounded_vlbytes", "LowParse.Low.Writers.swriter", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Spec.Header.Public.serialize_common_long", "LowParse.Low.Writers.swvalue", "FStar.Pervasives.Native.Mktuple2", "FStar.Bytes.hide", "LowStar.Monotonic.Buffer.as_seq" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val swrite_common_long\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len:\n U32.t\n { let len = U32.v dcid_len in\n len == B.length dcid /\\ 0 <= len /\\ len <= 20 })\n (scid: B.buffer U8.t)\n (scid_len:\n U32.t\n { let len = U32.v scid_len in\n len == B.length scid /\\ 0 <= len /\\ len <= 20 })\n (h0: HS.mem{B.live h0 dcid /\\ B.live h0 scid})\n (out:\n LW.slice (B.trivial_preorder _) (B.trivial_preorder _)\n { B.loc_disjoint ((B.loc_buffer dcid) `B.loc_union` (B.loc_buffer scid))\n (LW.loc_slice_from out 0ul) })\n : Tot\n (w:\n LW.swriter serialize_common_long h0 0 out 0ul\n {LW.swvalue w == (version, (FB.hide (B.as_seq h0 dcid), FB.hide (B.as_seq h0 scid)))})\nlet swrite_common_long\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len:\n U32.t\n { let len = U32.v dcid_len in\n len == B.length dcid /\\ 0 <= len /\\ len <= 20 })\n (scid: B.buffer U8.t)\n (scid_len:\n U32.t\n { let len = U32.v scid_len in\n len == B.length scid /\\ 0 <= len /\\ len <= 20 })\n (h0: HS.mem{B.live h0 dcid /\\ B.live h0 scid})\n (out:\n LW.slice (B.trivial_preorder _) (B.trivial_preorder _)\n { B.loc_disjoint ((B.loc_buffer dcid) `B.loc_union` (B.loc_buffer scid))\n (LW.loc_slice_from out 0ul) })\n : Tot\n (w:\n LW.swriter serialize_common_long h0 0 out 0ul\n {LW.swvalue w == (version, (FB.hide (B.as_seq h0 dcid), FB.hide (B.as_seq h0 scid)))}) =", "completed_definiton": "(LW.swrite_leaf LP.write_u32 h0 out 0ul version)\n`LW.swrite_nondep_then`\n((LW.swrite_bounded_vlbytes h0 out 0ul 0 20 dcid_len dcid)\n `LW.swrite_nondep_then`\n (LW.swrite_bounded_vlbytes h0 out 0ul 0 20 scid_len scid))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.header_len_correct", "original_source_type": "val header_len_correct\n (dcid_len: short_dcid_len_t)\n (m: HS.mem)\n (h: header { parse_header_prop dcid_len (g_header h m) })\n: Lemma\n (U32.v (header_len h) == Seq.length (LP.serialize (serialize_header dcid_len) (g_header h m)))", "source_type": "val header_len_correct\n (dcid_len: short_dcid_len_t)\n (m: HS.mem)\n (h: header { parse_header_prop dcid_len (g_header h m) })\n: Lemma\n (U32.v (header_len h) == Seq.length (LP.serialize (serialize_header dcid_len) (g_header h m)))", "source_definition": "let header_len_correct\n dcid_len m h\n= let hs = g_header h m in\n let f () : Lemma (U32.v (header_len h) == header_len' hs) =\n match h with\n | PLong pb version dcid dcil scid scil spec ->\n begin match spec with\n | PInitial payload_and_pn_length token token_length ->\n VI.bounded_varint_len_correct 0 token_max_len token_length;\n VI.varint_len_correct payload_and_pn_length\n | PZeroRTT payload_and_pn_length ->\n VI.varint_len_correct payload_and_pn_length\n | PHandshake payload_and_pn_length ->\n VI.varint_len_correct payload_and_pn_length\n | PRetry odcid odcil -> ()\n end\n | _ -> ()\n in\n f ();\n header_len'_correct dcid_len hs", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 994, "start_col": 1, "end_line": 1011, "end_col": 33 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) == (| Long, (| (), (| Retry, () |) |) |) );\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)\n\n#pop-options\n\nlet valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures (\n LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_initial_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0 sl pos\n\ninline_for_extraction\nlet read_payload_and_pn_length : LP.leaf_reader parse_payload_and_pn_length =\n LP.read_filter VI.read_varint payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Initial, () |) |) |) );\n valid_long_initial_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len)) (parse_payload_and_pn_length) sl pos3;\n let token = LP.get_bounded_vlgenbytes_contents 0 token_max_len (VI.read_bounded_varint 0 token_max_len) (VI.jump_bounded_varint 0 token_max_len) sl pos3 in\n let token_len = LP.bounded_vlgenbytes_payload_length 0 token_max_len (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let pos4 = LP.jump_bounded_vlgenbytes 0 token_max_len (VI.jump_bounded_varint 0 token_max_len) (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos4 in\n let spec = PInitial (payload_and_pn_length) token token_len in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures (\n LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_handshake_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` VI.parse_varint)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_handshake\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Handshake, () |) |) |) );\n valid_long_handshake_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PHandshake payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_zero_rtt_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_zero_rtt_body h0 sl pos))\n (ensures (\n LP.valid parse_long_zero_rtt_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_zero_rtt_body h0 sl pos)\n (LP.get_valid_pos parse_long_zero_rtt_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_zero_rtt_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_zero_rtt\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) == (| Long, (| (), (| ZeroRTT, () |) |) |) );\n valid_long_zero_rtt_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PZeroRTT payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet read_header_body\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (read_header_body_t sl cid_len tg)\n= fun len ->\n let h0 = HST.get () in\n match tg with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n read_header_body_short sl cid_len spin protected_bits len\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n read_header_body_long_retry sl cid_len protected_bits len\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n read_header_body_long_initial sl cid_len protected_bits len\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n read_header_body_long_handshake sl cid_len protected_bits len\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n read_header_body_long_zero_rtt sl cid_len protected_bits len\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --fuel 4 --ifuel 4 --query_stats\"\n\nlet read_header packet packet_len cid_len =\n let h0 = HST.get () in\n let sl = LP.make_slice packet packet_len in\n LP.valid_facts (parse_header cid_len) h0 sl 0ul;\n assert_spinoff (B.as_seq h0 packet `Seq.equal` LP.bytes_of_slice_from h0 sl 0ul);\n assert_norm (\n let k = parse_header_kind cid_len in\n Some? k.LP.parser_kind_high /\\\n k.LP.parser_kind_subkind == Some LP.ParserStrong\n );\n begin\n LPB.valid_bitsum_elim\n #LP.parse_u8_kind\n #8\n #U8.t\n #LPB.uint8\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n LP.parse_u8\n (parse_header_body cid_len)\n h0\n sl\n 0ul;\n let r = LP.read_u8 sl 0ul in\n let res = destr_first_byte\n (read_header_body_t sl cid_len)\n (fun _ cond dt df len' -> if cond then dt () len' else df () len')\n (read_header_body sl cid_len)\n r\n ()\n in\n res\n end\n\n#pop-options\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet synth_first_byte\n: (LPB.synth_bitsum'_recip_t first_byte)\n=\n (LPB.mk_synth_bitsum'_recip first_byte)\n\nmodule LW = LowParse.Low.Writers.Instances\n\n#push-options \"--z3rlimit 64 --max_fuel 4 --initial_fuel 4\"\n\ninline_for_extraction\nnoextract\nlet swrite_header_short\n (protected_bits: bitfield 5)\n (spin: bool)\n (cid: B.buffer U8.t)\n (cid_len: U32.t {\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n })\n (h0: HS.mem {\n B.live h0 cid\n })\n (out: LP.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer cid) (LP.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header cid_len) h0 0 out 0ul {\n LW.swvalue w == S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))\n })\n= \n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Short, (| (), ((if spin then 1uy else 0uy), (protected_bits, ())) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Short, (| (), () |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header cid_len (S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body cid_len k) h0 _ out 0ul =\n LW.swrite_weaken (LP.strong_parser_kind 0 20 None) (LW.swrite_flbytes h0 out 0ul cid_len cid)\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body cid_len)\n (serialize_header_body cid_len)\n tg\n s\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet swrite_common_long\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter serialize_common_long h0 0 out 0ul {\n LW.swvalue w == (version, (FB.hide (B.as_seq h0 dcid), FB.hide (B.as_seq h0 scid)))\n })\n= LW.swrite_leaf LP.write_u32 h0 out 0ul version `LW.swrite_nondep_then` (\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 dcid_len dcid `LW.swrite_nondep_then`\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 scid_len scid\n )\n\ninline_for_extraction\nlet swrite_payload_and_pn_length\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem)\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _))\n: Tot (w: LW.swriter (serialize_payload_and_pn_length) h0 0 out 0ul {\n LW.swvalue w == payload_and_pn_length\n })\n= payload_and_pn_length_prop `LW.swrite_filter` LW.swrite_leaf (LP.leaf_writer_strong_of_serializer32 VI.write_varint ()) h0 out 0ul payload_and_pn_length\n\n#push-options \"--z3rlimit 128 --max_fuel 4 --initial_fuel 4\"\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_initial\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (token: B.buffer U8.t)\n (token_length: U32.t {\n let v = U32.v token_length in\n v == B.length token /\\\n 0 <= v /\\ v <= token_max_len\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid /\\\n B.live h0 token\n })\n (out: LP.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint ((B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) `B.loc_union` B.loc_buffer token) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PInitial (FB.hide (B.as_seq h0 token)) payload_and_pn_length)\n })\n= \n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| Initial, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PInitial (FB.hide (B.as_seq h0 token)) payload_and_pn_length)) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then` (\n LW.swrite_bounded_vlgenbytes h0 out 0ul 0 token_max_len (LP.leaf_writer_strong_of_serializer32 (VI.write_bounded_varint 0 token_max_len) ()) token_length token `LW.swrite_nondep_then`\n swrite_payload_and_pn_length payload_and_pn_length h0 out\n )\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_zeroRTT\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PZeroRTT payload_and_pn_length)\n })\n=\n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| ZeroRTT, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PZeroRTT payload_and_pn_length)) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then`\n swrite_payload_and_pn_length payload_and_pn_length h0 out\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_handshake\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PHandshake payload_and_pn_length)\n })\n= [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| Handshake, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PHandshake payload_and_pn_length)) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then`\n swrite_payload_and_pn_length payload_and_pn_length h0 out\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_retry\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (odcid: B.buffer U8.t)\n (odcid_len: U32.t {\n let len = U32.v odcid_len in\n len == B.length odcid /\\\n 0 <= len /\\ len <= 20\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid /\\\n B.live h0 odcid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint ((B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) `B.loc_union` B.loc_buffer odcid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PRetry (FB.hide (B.as_seq h0 odcid)))\n })\n= [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| Retry, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PRetry (FB.hide (B.as_seq h0 odcid)))) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 0 out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then`\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 odcid_len odcid\n in\n LW.swrite_bitsum\n h0\n 0\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s\n\n#pop-options\n\n#restart-solver\n\ninline_for_extraction\nval write_header_aux\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n (out: B.buffer U8.t)\n (out_len: U32.t { U32.v out_len <= B.length out })\n: HST.Stack U32.t\n (requires (fun h0 ->\n (PShort? h ==> PShort?.cid_len h == short_dcid_len) /\\\n header_live h h0 /\\\n B.live h0 out /\\\n B.loc_disjoint (header_footprint h) (B.loc_buffer out) /\\\n Seq.length (LP.serialize (serialize_header short_dcid_len) (set_protected_bits (g_header h h0) 0uy)) <= U32.v out_len\n ))\n (ensures (fun h0 len h1 ->\n let gh = set_protected_bits (g_header h h0) 0uy in\n let s = LP.serialize (serialize_header short_dcid_len) gh in\n U32.v len <= U32.v out_len /\\\n B.modifies (B.loc_buffer out) h0 h1 /\\\n Seq.slice (B.as_seq h1 out) 0 (U32.v len) == s \n ))\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet write_header_aux\n short_dcid_len h out out_len\n= let h0 = HST.get () in\n let sl = LW.make_slice out out_len in\n LW.serialized_length_eq (serialize_header short_dcid_len) (set_protected_bits (g_header h h0) 0uy);\n let len = match h with\n | PShort pb spin cid cid_len ->\n LW.swrite (swrite_header_short 0uy spin cid cid_len h0 sl) 0ul\n | PLong pb version dcid dcil scid scil spec ->\n begin match spec with\n | PInitial payload_and_pn_length token token_length ->\n LW.swrite (swrite_header_long_initial 0uy short_dcid_len version dcid dcil scid scil payload_and_pn_length token token_length h0 sl) 0ul\n | PZeroRTT payload_and_pn_length ->\n LW.swrite (swrite_header_long_zeroRTT 0uy short_dcid_len version dcid dcil scid scil payload_and_pn_length h0 sl) 0ul\n | PHandshake payload_and_pn_length ->\n LW.swrite (swrite_header_long_handshake 0uy short_dcid_len version dcid dcil scid scil payload_and_pn_length h0 sl) 0ul\n | PRetry odcid odcil ->\n LW.swrite (swrite_header_long_retry 0uy short_dcid_len version dcid dcil scid scil odcid odcil h0 sl) 0ul\n end\n in\n let h1 = HST.get () in\n LP.valid_pos_valid_exact (parse_header short_dcid_len) h1 sl 0ul len;\n LP.valid_exact_serialize (serialize_header short_dcid_len) h1 sl 0ul len;\n len\n\n#pop-options\n\nlet get_pb\n (h: header)\n: Tot (secret_bitfield (if PShort? h then 5 else 4))\n= \n match h with\n | PShort pb spin cid cid_len ->\n pb\n | PLong pb version dcid dcil scid scil spec ->\n pb\n\nlet get_pb_correct\n (h: header)\n (m: HS.mem)\n: Lemma\n (ensures (Secret.v (get_pb h) == U8.v (get_protected_bits (g_header h m))))\n= ()\n\nlet get_pb_complete\n (h: header)\n (m: HS.mem)\n: Lemma\n (set_protected_bits (set_protected_bits (g_header h m) 0uy) (U8.uint_to_t (Secret.v (get_pb h))) == g_header h m)\n= ()\n\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule Seq = QUIC.Secret.Seq\n\n#pop-options\n\n#push-options \"--z3rlimit 128 --query_stats\"\n\n#restart-solver\n\nlet write_header\n short_dcid_len h out out_len\n=\n let h0 = HST.get () in\n let pb = get_pb h in\n serialize_set_protected_bits short_dcid_len (g_header h h0) 0uy;\n assert (Seq.length (LP.serialize (serialize_header short_dcid_len) (set_protected_bits (g_header h h0) 0uy)) == Seq.length (LP.serialize (serialize_header short_dcid_len) (g_header h h0)));\n let len = write_header_aux short_dcid_len h out out_len in\n let h1 = HST.get () in\n let f () : Lemma (\n let s = Seq.slice (B.as_seq h1 out) 0 (U32.v len) in\n Seq.length s > 0 /\\\n LP.serialize (serialize_header short_dcid_len) (g_header h h0) ==\n LPB.uint8.LPB.set_bitfield (Seq.head s) 0 (if PShort? h then 5 else 4) (U8.uint_to_t (Secret.v pb) <: U8.t) `Seq.cons` Seq.tail s\n )\n =\n get_pb_complete h h0;\n serialize_set_protected_bits short_dcid_len (set_protected_bits (g_header h h0) 0uy) (U8.uint_to_t (Secret.v pb) <: U8.t)\n in\n f ();\n let post\n ()\n (contl: Seq.lseq U8.t 0)\n (cont: Seq.lseq U8.t (U32.v len))\n (contr: Seq.lseq U8.t (B.length out - U32.v len))\n (m: HS.mem)\n : GTot Type0\n =\n let s = Seq.slice (B.as_seq h1 out) 0 (U32.v len) in\n Seq.length s > 0 /\\\n cont `Seq.equal` (LPB.uint8.LPB.set_bitfield (Seq.head s) 0 (if PShort? h then 5 else 4) (U8.uint_to_t (Secret.v pb) <: U8.t) `Seq.cons` Seq.tail s)\n in\n SecretBuffer.with_buffer_hide\n #unit\n out\n 0ul\n len\n h1\n B.loc_none\n B.loc_none\n 1ul 0ul 0ul 1ul 1ul 0ul\n post\n (fun _ bl bs br ->\n let x = B.index bs 0ul in\n let y =\n if PShort? h\n then Secret.set_bitfield #Secret.U8 x 0ul 5ul pb\n else Secret.set_bitfield #Secret.U8 x 0ul 4ul pb\n in\n assert (\n let s = Seq.slice (B.as_seq h1 out) 0 (U32.v len) in\n Secret.reveal #Secret.U8 y == LPB.uint8.LPB.set_bitfield (Seq.head s) 0 (if PShort? h then 5 else 4) (U8.uint_to_t (Secret.v pb) <: U8.t)\n );\n SecretBuffer.buffer_update_strong bs 0ul y;\n let h2 = HST.get () in\n assert (\n let s = Seq.slice (B.as_seq h1 out) 0 (U32.v len) in\n Seq.length s > 0 /\\\n B.as_seq h2 bs `Seq.equal` Seq.cons y (Seq.tail (Seq.seq_hide #Secret.U8 s))\n )\n )\n ;\n len\n\n#restart-solver\n\nlet header_len_correct", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "LW", "full_module": "LowParse.Low.Writers.Instances" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n m: FStar.Monotonic.HyperStack.mem ->\n h:\n QUIC.Impl.Header.Public.header\n {QUIC.Spec.Header.Public.parse_header_prop dcid_len (QUIC.Impl.Header.Public.g_header h m)}\n -> FStar.Pervasives.Lemma\n (ensures\n FStar.UInt32.v (QUIC.Impl.Header.Public.header_len h) ==\n FStar.Seq.Base.length (LowParse.Spec.Base.serialize (QUIC.Spec.Header.Public.serialize_header dcid_len\n )\n (QUIC.Impl.Header.Public.g_header h m)))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "FStar.Monotonic.HyperStack.mem", "QUIC.Impl.Header.Public.header", "QUIC.Spec.Header.Public.parse_header_prop", "QUIC.Impl.Header.Public.g_header", "QUIC.Spec.Header.Public.header_len'_correct", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThan", "Prims.op_LessThanOrEqual", "QUIC.Spec.Base.header_len_bound", "FStar.UInt32.v", "QUIC.Impl.Header.Public.header_len", "QUIC.Spec.Header.Public.header_len'", "Prims.Nil", "FStar.Pervasives.pattern", "QUIC.Spec.Base.secret_bitfield", "FStar.UInt32.t", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.n", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "FStar.UInt.uint_t", "QUIC.Impl.Header.Public.long_header_specifics", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Base.token_max_len", "QUIC.Impl.VarInt.varint_len_correct", "QUIC.Impl.VarInt.bounded_varint_len_correct", "Prims.op_Equality", "QUIC.Spec.Header.Public.header" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_len_correct\n (dcid_len: short_dcid_len_t)\n (m: HS.mem)\n (h: header { parse_header_prop dcid_len (g_header h m) })\n: Lemma\n (U32.v (header_len h) == Seq.length (LP.serialize (serialize_header dcid_len) (g_header h m)))\nlet header_len_correct dcid_len m h =", "completed_definiton": "let hs = g_header h m in\nlet f () : Lemma (U32.v (header_len h) == header_len' hs) =\n match h with\n | PLong pb version dcid dcil scid scil spec ->\n (match spec with\n | PInitial payload_and_pn_length token token_length ->\n VI.bounded_varint_len_correct 0 token_max_len token_length;\n VI.varint_len_correct payload_and_pn_length\n | PZeroRTT payload_and_pn_length -> VI.varint_len_correct payload_and_pn_length\n | PHandshake payload_and_pn_length -> VI.varint_len_correct payload_and_pn_length\n | PRetry odcid odcil -> ())\n | _ -> ()\nin\nf ();\nheader_len'_correct dcid_len hs", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.read_header_body", "original_source_type": "val read_header_body\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (tg: LPB.bitsum'_type first_byte)\n : Tot (read_header_body_t sl cid_len tg)", "source_type": "val read_header_body\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (tg: LPB.bitsum'_type first_byte)\n : Tot (read_header_body_t sl cid_len tg)", "source_definition": "let read_header_body\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (read_header_body_t sl cid_len tg)\n= fun len ->\n let h0 = HST.get () in\n match tg with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n read_header_body_short sl cid_len spin protected_bits len\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n read_header_body_long_retry sl cid_len protected_bits len\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n read_header_body_long_initial sl cid_len protected_bits len\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n read_header_body_long_handshake sl cid_len protected_bits len\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n read_header_body_long_zero_rtt sl cid_len protected_bits len", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 371, "start_col": 2, "end_line": 383, "end_col": 64 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) == (| Long, (| (), (| Retry, () |) |) |) );\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)\n\n#pop-options\n\nlet valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures (\n LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_initial_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0 sl pos\n\ninline_for_extraction\nlet read_payload_and_pn_length : LP.leaf_reader parse_payload_and_pn_length =\n LP.read_filter VI.read_varint payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Initial, () |) |) |) );\n valid_long_initial_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len)) (parse_payload_and_pn_length) sl pos3;\n let token = LP.get_bounded_vlgenbytes_contents 0 token_max_len (VI.read_bounded_varint 0 token_max_len) (VI.jump_bounded_varint 0 token_max_len) sl pos3 in\n let token_len = LP.bounded_vlgenbytes_payload_length 0 token_max_len (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let pos4 = LP.jump_bounded_vlgenbytes 0 token_max_len (VI.jump_bounded_varint 0 token_max_len) (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos4 in\n let spec = PInitial (payload_and_pn_length) token token_len in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures (\n LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_handshake_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` VI.parse_varint)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_handshake\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Handshake, () |) |) |) );\n valid_long_handshake_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PHandshake payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_zero_rtt_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_zero_rtt_body h0 sl pos))\n (ensures (\n LP.valid parse_long_zero_rtt_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_zero_rtt_body h0 sl pos)\n (LP.get_valid_pos parse_long_zero_rtt_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_zero_rtt_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_zero_rtt\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) == (| Long, (| (), (| ZeroRTT, () |) |) |) );\n valid_long_zero_rtt_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PZeroRTT payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet read_header_body\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n sl:\n LowParse.Slice.slice (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte) ->\n cid_len: FStar.UInt32.t{FStar.UInt32.v cid_len <= 20} ->\n tg: LowParse.Spec.BitSum.bitsum'_type QUIC.Spec.Header.Public.first_byte\n -> QUIC.Impl.Header.Public.read_header_body_t sl cid_len tg", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.slice", "LowStar.Buffer.trivial_preorder", "LowParse.Bytes.byte", "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "LowParse.Spec.BitSum.bitsum'_type", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "Prims.unit", "LowParse.BitFields.bitfield", "QUIC.Impl.Header.Public.read_header_body_short", "QUIC.Impl.Header.Public.header", "QUIC.Impl.Header.Public.read_header_body_long_retry", "QUIC.Impl.Header.Public.read_header_body_long_initial", "QUIC.Impl.Header.Public.read_header_body_long_handshake", "QUIC.Impl.Header.Public.read_header_body_long_zero_rtt", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "QUIC.Impl.Header.Public.read_header_body_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_header_body\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (tg: LPB.bitsum'_type first_byte)\n : Tot (read_header_body_t sl cid_len tg)\nlet read_header_body\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (tg: LPB.bitsum'_type first_byte)\n : Tot (read_header_body_t sl cid_len tg) =", "completed_definiton": "fun len ->\n let h0 = HST.get () in\n match tg with\n | (| Short , (| () , (spin, (protected_bits, ())) |) |) ->\n read_header_body_short sl cid_len spin protected_bits len\n | (| Long , (| () , (| Retry , (protected_bits, ()) |) |) |) ->\n read_header_body_long_retry sl cid_len protected_bits len\n | (| Long , (| () , (| Initial , (protected_bits, ()) |) |) |) ->\n read_header_body_long_initial sl cid_len protected_bits len\n | (| Long , (| () , (| Handshake , (protected_bits, ()) |) |) |) ->\n read_header_body_long_handshake sl cid_len protected_bits len\n | (| Long , (| () , (| ZeroRTT , (protected_bits, ()) |) |) |) ->\n read_header_body_long_zero_rtt sl cid_len protected_bits len", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.read_header_body_short", "original_source_type": "val read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n : Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, ())) |) |))", "source_type": "val read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n : Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, ())) |) |))", "source_definition": "let read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 162, "start_col": 2, "end_line": 169, "end_col": 76 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 9, "max_fuel": 9, "initial_ifuel": 9, "max_ifuel": 9, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n sl:\n LowParse.Slice.slice (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte) ->\n cid_len: FStar.UInt32.t{FStar.UInt32.v cid_len <= 20} ->\n spin: LowParse.BitFields.bitfield LowParse.BitFields.uint8 1 ->\n protected_bits: LowParse.BitFields.bitfield LowParse.BitFields.uint8 5\n -> QUIC.Impl.Header.Public.read_header_body_t sl\n cid_len\n (|\n QUIC.Spec.Header.Public.Short,\n (| (), FStar.Pervasives.Native.Mktuple2 spin (protected_bits, ()) |)\n |)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.slice", "LowStar.Buffer.trivial_preorder", "LowParse.Bytes.byte", "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "LowParse.BitFields.bitfield", "FStar.UInt8.t", "LowParse.BitFields.uint8", "Prims.unit", "QUIC.Impl.Header.Public.PShort", "QUIC.Secret.Int.hide", "Lib.IntTypes.U8", "Lib.IntTypes.PUB", "Prims.op_Equality", "FStar.UInt8.__uint_to_t", "QUIC.Impl.Header.Public.header", "LowStar.Monotonic.Buffer.mbuffer", "LowStar.Buffer.sub", "LowParse.Slice.__proj__Mkslice__item__base", "FStar.UInt32.__uint_to_t", "FStar.Ghost.hide", "FStar.UInt32.sub", "LowParse.Low.Bytes.jump_flbytes", "LowParse.Low.Bytes.valid_flbytes_elim", "LowParse.Low.Base.valid_weaken", "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some", "LowParse.Spec.Base.total_constant_size_parser_kind", "FStar.Bytes.lbytes", "LowParse.Spec.Bytes.parse_flbytes", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.dtuple2", "LowParse.Spec.Enum.enum_key", "QUIC.Spec.Header.Public.header_form_t", "QUIC.Spec.Header.Public.header_form", "LowParse.Spec.BitSum.bitsum'_key_type", "Prims.op_Subtraction", "LowParse.Spec.BitSum.BitSum'", "QUIC.Spec.Header.Public.fixed_bit", "LowParse.Spec.BitSum.BitField", "LowParse.Spec.BitSum.BitStop", "LowParse.Spec.BitSum.bitsum'", "QUIC.Spec.Header.Public.long_packet_type_t", "QUIC.Spec.Header.Public.long_packet_type", "LowParse.Spec.BitSum.bitsum'_key_of_t", "QUIC.Spec.Header.Public.first_byte", "Prims.Mkdtuple2", "LowParse.Spec.BitSum.bitsum'_type'", "QUIC.Spec.Header.Public.Short", "FStar.Pervasives.Native.Mktuple2", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "QUIC.Impl.Header.Public.read_header_body_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n : Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, ())) |) |))\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n : Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, ())) |) |)) =", "completed_definiton": "fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ())) |) |) ==\n (| Short, (| (), () |) |));\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.swrite_header_long_handshake", "original_source_type": "val swrite_header_long_handshake\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len:\n U32.t\n { let len = U32.v dcid_len in\n len == B.length dcid /\\ 0 <= len /\\ len <= 20 })\n (scid: B.buffer U8.t)\n (scid_len:\n U32.t\n { let len = U32.v scid_len in\n len == B.length scid /\\ 0 <= len /\\ len <= 20 })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem{B.live h0 dcid /\\ B.live h0 scid})\n (out:\n LW.slice (B.trivial_preorder _) (B.trivial_preorder _)\n { B.loc_disjoint ((B.loc_buffer dcid) `B.loc_union` (B.loc_buffer scid))\n (LW.loc_slice_from out 0ul) })\n : Tot\n (w:\n LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul\n { LW.swvalue w ==\n S.PLong protected_bits\n version\n (FB.hide (B.as_seq h0 dcid))\n (FB.hide (B.as_seq h0 scid))\n (S.PHandshake payload_and_pn_length) })", "source_type": "val swrite_header_long_handshake\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len:\n U32.t\n { let len = U32.v dcid_len in\n len == B.length dcid /\\ 0 <= len /\\ len <= 20 })\n (scid: B.buffer U8.t)\n (scid_len:\n U32.t\n { let len = U32.v scid_len in\n len == B.length scid /\\ 0 <= len /\\ len <= 20 })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem{B.live h0 dcid /\\ B.live h0 scid})\n (out:\n LW.slice (B.trivial_preorder _) (B.trivial_preorder _)\n { B.loc_disjoint ((B.loc_buffer dcid) `B.loc_union` (B.loc_buffer scid))\n (LW.loc_slice_from out 0ul) })\n : Tot\n (w:\n LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul\n { LW.swvalue w ==\n S.PLong protected_bits\n version\n (FB.hide (B.as_seq h0 dcid))\n (FB.hide (B.as_seq h0 scid))\n (S.PHandshake payload_and_pn_length) })", "source_definition": "let swrite_header_long_handshake\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PHandshake payload_and_pn_length)\n })\n= [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| Handshake, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PHandshake payload_and_pn_length)) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then`\n swrite_payload_and_pn_length payload_and_pn_length h0 out\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 721, "start_col": 2, "end_line": 759, "end_col": 5 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) == (| Long, (| (), (| Retry, () |) |) |) );\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)\n\n#pop-options\n\nlet valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures (\n LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_initial_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0 sl pos\n\ninline_for_extraction\nlet read_payload_and_pn_length : LP.leaf_reader parse_payload_and_pn_length =\n LP.read_filter VI.read_varint payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Initial, () |) |) |) );\n valid_long_initial_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len)) (parse_payload_and_pn_length) sl pos3;\n let token = LP.get_bounded_vlgenbytes_contents 0 token_max_len (VI.read_bounded_varint 0 token_max_len) (VI.jump_bounded_varint 0 token_max_len) sl pos3 in\n let token_len = LP.bounded_vlgenbytes_payload_length 0 token_max_len (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let pos4 = LP.jump_bounded_vlgenbytes 0 token_max_len (VI.jump_bounded_varint 0 token_max_len) (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos4 in\n let spec = PInitial (payload_and_pn_length) token token_len in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures (\n LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_handshake_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` VI.parse_varint)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_handshake\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Handshake, () |) |) |) );\n valid_long_handshake_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PHandshake payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_zero_rtt_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_zero_rtt_body h0 sl pos))\n (ensures (\n LP.valid parse_long_zero_rtt_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_zero_rtt_body h0 sl pos)\n (LP.get_valid_pos parse_long_zero_rtt_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_zero_rtt_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_zero_rtt\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) == (| Long, (| (), (| ZeroRTT, () |) |) |) );\n valid_long_zero_rtt_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PZeroRTT payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet read_header_body\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (read_header_body_t sl cid_len tg)\n= fun len ->\n let h0 = HST.get () in\n match tg with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n read_header_body_short sl cid_len spin protected_bits len\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n read_header_body_long_retry sl cid_len protected_bits len\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n read_header_body_long_initial sl cid_len protected_bits len\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n read_header_body_long_handshake sl cid_len protected_bits len\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n read_header_body_long_zero_rtt sl cid_len protected_bits len\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --fuel 4 --ifuel 4 --query_stats\"\n\nlet read_header packet packet_len cid_len =\n let h0 = HST.get () in\n let sl = LP.make_slice packet packet_len in\n LP.valid_facts (parse_header cid_len) h0 sl 0ul;\n assert_spinoff (B.as_seq h0 packet `Seq.equal` LP.bytes_of_slice_from h0 sl 0ul);\n assert_norm (\n let k = parse_header_kind cid_len in\n Some? k.LP.parser_kind_high /\\\n k.LP.parser_kind_subkind == Some LP.ParserStrong\n );\n begin\n LPB.valid_bitsum_elim\n #LP.parse_u8_kind\n #8\n #U8.t\n #LPB.uint8\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n LP.parse_u8\n (parse_header_body cid_len)\n h0\n sl\n 0ul;\n let r = LP.read_u8 sl 0ul in\n let res = destr_first_byte\n (read_header_body_t sl cid_len)\n (fun _ cond dt df len' -> if cond then dt () len' else df () len')\n (read_header_body sl cid_len)\n r\n ()\n in\n res\n end\n\n#pop-options\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet synth_first_byte\n: (LPB.synth_bitsum'_recip_t first_byte)\n=\n (LPB.mk_synth_bitsum'_recip first_byte)\n\nmodule LW = LowParse.Low.Writers.Instances\n\n#push-options \"--z3rlimit 64 --max_fuel 4 --initial_fuel 4\"\n\ninline_for_extraction\nnoextract\nlet swrite_header_short\n (protected_bits: bitfield 5)\n (spin: bool)\n (cid: B.buffer U8.t)\n (cid_len: U32.t {\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n })\n (h0: HS.mem {\n B.live h0 cid\n })\n (out: LP.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer cid) (LP.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header cid_len) h0 0 out 0ul {\n LW.swvalue w == S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))\n })\n= \n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Short, (| (), ((if spin then 1uy else 0uy), (protected_bits, ())) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Short, (| (), () |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header cid_len (S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body cid_len k) h0 _ out 0ul =\n LW.swrite_weaken (LP.strong_parser_kind 0 20 None) (LW.swrite_flbytes h0 out 0ul cid_len cid)\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body cid_len)\n (serialize_header_body cid_len)\n tg\n s\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet swrite_common_long\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter serialize_common_long h0 0 out 0ul {\n LW.swvalue w == (version, (FB.hide (B.as_seq h0 dcid), FB.hide (B.as_seq h0 scid)))\n })\n= LW.swrite_leaf LP.write_u32 h0 out 0ul version `LW.swrite_nondep_then` (\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 dcid_len dcid `LW.swrite_nondep_then`\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 scid_len scid\n )\n\ninline_for_extraction\nlet swrite_payload_and_pn_length\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem)\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _))\n: Tot (w: LW.swriter (serialize_payload_and_pn_length) h0 0 out 0ul {\n LW.swvalue w == payload_and_pn_length\n })\n= payload_and_pn_length_prop `LW.swrite_filter` LW.swrite_leaf (LP.leaf_writer_strong_of_serializer32 VI.write_varint ()) h0 out 0ul payload_and_pn_length\n\n#push-options \"--z3rlimit 128 --max_fuel 4 --initial_fuel 4\"\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_initial\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (token: B.buffer U8.t)\n (token_length: U32.t {\n let v = U32.v token_length in\n v == B.length token /\\\n 0 <= v /\\ v <= token_max_len\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid /\\\n B.live h0 token\n })\n (out: LP.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint ((B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) `B.loc_union` B.loc_buffer token) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PInitial (FB.hide (B.as_seq h0 token)) payload_and_pn_length)\n })\n= \n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| Initial, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PInitial (FB.hide (B.as_seq h0 token)) payload_and_pn_length)) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then` (\n LW.swrite_bounded_vlgenbytes h0 out 0ul 0 token_max_len (LP.leaf_writer_strong_of_serializer32 (VI.write_bounded_varint 0 token_max_len) ()) token_length token `LW.swrite_nondep_then`\n swrite_payload_and_pn_length payload_and_pn_length h0 out\n )\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_zeroRTT\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PZeroRTT payload_and_pn_length)\n })\n=\n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| ZeroRTT, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PZeroRTT payload_and_pn_length)) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then`\n swrite_payload_and_pn_length payload_and_pn_length h0 out\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_handshake\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PHandshake payload_and_pn_length)", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LW", "full_module": "LowParse.Low.Writers.Instances" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 4, "max_fuel": 4, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n protected_bits: QUIC.Spec.Base.bitfield 4 ->\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n version: FStar.UInt32.t ->\n dcid: LowStar.Buffer.buffer FStar.UInt8.t ->\n dcid_len:\n FStar.UInt32.t\n { let len = FStar.UInt32.v dcid_len in\n len == LowStar.Monotonic.Buffer.length dcid /\\ 0 <= len /\\ len <= 20 } ->\n scid: LowStar.Buffer.buffer FStar.UInt8.t ->\n scid_len:\n FStar.UInt32.t\n { let len = FStar.UInt32.v scid_len in\n len == LowStar.Monotonic.Buffer.length scid /\\ 0 <= len /\\ len <= 20 } ->\n payload_and_pn_length: QUIC.Spec.Base.payload_and_pn_length_t ->\n h0:\n FStar.Monotonic.HyperStack.mem\n {LowStar.Monotonic.Buffer.live h0 dcid /\\ LowStar.Monotonic.Buffer.live h0 scid} ->\n out:\n LowParse.Slice.slice (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n { LowStar.Monotonic.Buffer.loc_disjoint (LowStar.Monotonic.Buffer.loc_union (LowStar.Monotonic.Buffer.loc_buffer\n dcid)\n (LowStar.Monotonic.Buffer.loc_buffer scid))\n (LowParse.Slice.loc_slice_from out 0ul) }\n -> w:\n LowParse.Low.Writers.swriter (QUIC.Spec.Header.Public.serialize_header short_dcid_len)\n h0\n 0\n out\n 0ul\n { LowParse.Low.Writers.swvalue w ==\n QUIC.Spec.Header.Public.PLong protected_bits\n version\n (FStar.Bytes.hide (LowStar.Monotonic.Buffer.as_seq h0 dcid))\n (FStar.Bytes.hide (LowStar.Monotonic.Buffer.as_seq h0 scid))\n (QUIC.Spec.Header.Public.PHandshake payload_and_pn_length) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bitfield", "QUIC.Spec.Base.short_dcid_len_t", "FStar.UInt32.t", "LowStar.Buffer.buffer", "FStar.UInt8.t", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.op_LessThanOrEqual", "FStar.UInt.uint_t", "FStar.UInt32.v", "QUIC.Spec.Base.payload_and_pn_length_t", "FStar.Monotonic.HyperStack.mem", "LowStar.Monotonic.Buffer.live", "LowParse.Slice.slice", "LowParse.Bytes.byte", "LowStar.Monotonic.Buffer.loc_disjoint", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.loc_buffer", "LowParse.Slice.loc_slice_from", "FStar.UInt32.__uint_to_t", "LowParse.Low.Writers.Instances.swrite_bitsum", "LowParse.Low.Writers.Instances.max", "LowParse.Spec.Int.parse_u8_kind", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.first_byte_of_header", "QUIC.Spec.Header.Public.header_body_type", "QUIC.Spec.Header.Public.header_synth", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "LowParse.Low.Int.write_u8", "QUIC.Impl.Header.Public.synth_first_byte", "QUIC.Spec.Header.Public.parse_header_body", "QUIC.Spec.Header.Public.serialize_header_body", "LowParse.Low.Writers.swriter", "Prims.__proj__Mkdtuple2__item___1", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.parser", "FStar.Pervasives.dsnd", "FStar.UInt32.uint_to_t", "LowParse.Low.Writers.Instances.swrite_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Spec.Header.Public.serialize_common_long", "QUIC.Impl.Header.Public.swrite_common_long", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "QUIC.Spec.Header.Public.serialize_payload_and_pn_length", "QUIC.Impl.Header.Public.swrite_payload_and_pn_length", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.BitSum.bitsum'_type", "QUIC.Spec.Header.Public.PLong", "FStar.Bytes.hide", "LowStar.Monotonic.Buffer.as_seq", "QUIC.Spec.Header.Public.PHandshake", "LowParse.Spec.BitSum.bitsum'_key_type", "LowParse.Spec.BitSum.bitsum'_key_of_t", "Prims.Mkdtuple2", "LowParse.Spec.Enum.enum_key", "QUIC.Spec.Header.Public.header_form_t", "LowParse.BitFields.bitfield", "QUIC.Spec.Header.Public.header_form", "Prims.op_Subtraction", "LowParse.Spec.BitSum.BitSum'", "QUIC.Spec.Header.Public.fixed_bit", "LowParse.Spec.BitSum.BitField", "LowParse.Spec.BitSum.BitStop", "LowParse.Spec.BitSum.bitsum'", "QUIC.Spec.Header.Public.long_packet_type_t", "QUIC.Spec.Header.Public.long_packet_type", "QUIC.Spec.Header.Public.Long", "QUIC.Spec.Header.Public.Handshake", "LowParse.Spec.BitSum.bitsum'_type'", "FStar.Pervasives.Native.Mktuple2", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "QUIC.Spec.Header.Public.header", "LowParse.Low.Writers.swvalue" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val swrite_header_long_handshake\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len:\n U32.t\n { let len = U32.v dcid_len in\n len == B.length dcid /\\ 0 <= len /\\ len <= 20 })\n (scid: B.buffer U8.t)\n (scid_len:\n U32.t\n { let len = U32.v scid_len in\n len == B.length scid /\\ 0 <= len /\\ len <= 20 })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem{B.live h0 dcid /\\ B.live h0 scid})\n (out:\n LW.slice (B.trivial_preorder _) (B.trivial_preorder _)\n { B.loc_disjoint ((B.loc_buffer dcid) `B.loc_union` (B.loc_buffer scid))\n (LW.loc_slice_from out 0ul) })\n : Tot\n (w:\n LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul\n { LW.swvalue w ==\n S.PLong protected_bits\n version\n (FB.hide (B.as_seq h0 dcid))\n (FB.hide (B.as_seq h0 scid))\n (S.PHandshake payload_and_pn_length) })\nlet swrite_header_long_handshake\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len:\n U32.t\n { let len = U32.v dcid_len in\n len == B.length dcid /\\ 0 <= len /\\ len <= 20 })\n (scid: B.buffer U8.t)\n (scid_len:\n U32.t\n { let len = U32.v scid_len in\n len == B.length scid /\\ 0 <= len /\\ len <= 20 })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem{B.live h0 dcid /\\ B.live h0 scid})\n (out:\n LW.slice (B.trivial_preorder _) (B.trivial_preorder _)\n { B.loc_disjoint ((B.loc_buffer dcid) `B.loc_union` (B.loc_buffer scid))\n (LW.loc_slice_from out 0ul) })\n : Tot\n (w:\n LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul\n { LW.swvalue w ==\n S.PLong protected_bits\n version\n (FB.hide (B.as_seq h0 dcid))\n (FB.hide (B.as_seq h0 scid))\n (S.PHandshake payload_and_pn_length) }) =", "completed_definiton": "[@@ inline_let ]let tg:LPB.bitsum'_type first_byte =\n (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |)\nin\n[@@ inline_let ]let k:LPB.bitsum'_key_type first_byte = (| Long, (| (), (| Handshake, () |) |) |) in\n[@@ inline_let ]let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len\n (S.PLong protected_bits\n version\n (FB.hide (B.as_seq h0 dcid))\n (FB.hide (B.as_seq h0 scid))\n (S.PHandshake payload_and_pn_length)) ==\n tg)\nin\n[@@ inline_let ]let s:LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n (swrite_common_long version dcid dcid_len scid scid_len h0 out)\n `LW.swrite_nondep_then`\n (swrite_payload_and_pn_length payload_and_pn_length h0 out)\nin\nLW.swrite_bitsum h0 _ out 0ul #LP.parse_u8_kind #8 #U8.t first_byte #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len)\n (header_synth short_dcid_len) #LP.parse_u8 #LP.serialize_u8 LP.write_u8 synth_first_byte\n #(parse_header_body short_dcid_len) (serialize_header_body short_dcid_len) tg s", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.swrite_header_long_zeroRTT", "original_source_type": "val swrite_header_long_zeroRTT\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len:\n U32.t\n { let len = U32.v dcid_len in\n len == B.length dcid /\\ 0 <= len /\\ len <= 20 })\n (scid: B.buffer U8.t)\n (scid_len:\n U32.t\n { let len = U32.v scid_len in\n len == B.length scid /\\ 0 <= len /\\ len <= 20 })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem{B.live h0 dcid /\\ B.live h0 scid})\n (out:\n LW.slice (B.trivial_preorder _) (B.trivial_preorder _)\n { B.loc_disjoint ((B.loc_buffer dcid) `B.loc_union` (B.loc_buffer scid))\n (LW.loc_slice_from out 0ul) })\n : Tot\n (w:\n LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul\n { LW.swvalue w ==\n S.PLong protected_bits\n version\n (FB.hide (B.as_seq h0 dcid))\n (FB.hide (B.as_seq h0 scid))\n (S.PZeroRTT payload_and_pn_length) })", "source_type": "val swrite_header_long_zeroRTT\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len:\n U32.t\n { let len = U32.v dcid_len in\n len == B.length dcid /\\ 0 <= len /\\ len <= 20 })\n (scid: B.buffer U8.t)\n (scid_len:\n U32.t\n { let len = U32.v scid_len in\n len == B.length scid /\\ 0 <= len /\\ len <= 20 })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem{B.live h0 dcid /\\ B.live h0 scid})\n (out:\n LW.slice (B.trivial_preorder _) (B.trivial_preorder _)\n { B.loc_disjoint ((B.loc_buffer dcid) `B.loc_union` (B.loc_buffer scid))\n (LW.loc_slice_from out 0ul) })\n : Tot\n (w:\n LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul\n { LW.swvalue w ==\n S.PLong protected_bits\n version\n (FB.hide (B.as_seq h0 dcid))\n (FB.hide (B.as_seq h0 scid))\n (S.PZeroRTT payload_and_pn_length) })", "source_definition": "let swrite_header_long_zeroRTT\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PZeroRTT payload_and_pn_length)\n })\n=\n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| ZeroRTT, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PZeroRTT payload_and_pn_length)) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then`\n swrite_payload_and_pn_length payload_and_pn_length h0 out\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 652, "start_col": 2, "end_line": 690, "end_col": 5 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) == (| Long, (| (), (| Retry, () |) |) |) );\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)\n\n#pop-options\n\nlet valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures (\n LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_initial_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0 sl pos\n\ninline_for_extraction\nlet read_payload_and_pn_length : LP.leaf_reader parse_payload_and_pn_length =\n LP.read_filter VI.read_varint payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Initial, () |) |) |) );\n valid_long_initial_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len)) (parse_payload_and_pn_length) sl pos3;\n let token = LP.get_bounded_vlgenbytes_contents 0 token_max_len (VI.read_bounded_varint 0 token_max_len) (VI.jump_bounded_varint 0 token_max_len) sl pos3 in\n let token_len = LP.bounded_vlgenbytes_payload_length 0 token_max_len (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let pos4 = LP.jump_bounded_vlgenbytes 0 token_max_len (VI.jump_bounded_varint 0 token_max_len) (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos4 in\n let spec = PInitial (payload_and_pn_length) token token_len in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures (\n LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_handshake_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` VI.parse_varint)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_handshake\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Handshake, () |) |) |) );\n valid_long_handshake_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PHandshake payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_zero_rtt_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_zero_rtt_body h0 sl pos))\n (ensures (\n LP.valid parse_long_zero_rtt_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_zero_rtt_body h0 sl pos)\n (LP.get_valid_pos parse_long_zero_rtt_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_zero_rtt_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_zero_rtt\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) == (| Long, (| (), (| ZeroRTT, () |) |) |) );\n valid_long_zero_rtt_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PZeroRTT payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet read_header_body\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (read_header_body_t sl cid_len tg)\n= fun len ->\n let h0 = HST.get () in\n match tg with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n read_header_body_short sl cid_len spin protected_bits len\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n read_header_body_long_retry sl cid_len protected_bits len\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n read_header_body_long_initial sl cid_len protected_bits len\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n read_header_body_long_handshake sl cid_len protected_bits len\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n read_header_body_long_zero_rtt sl cid_len protected_bits len\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --fuel 4 --ifuel 4 --query_stats\"\n\nlet read_header packet packet_len cid_len =\n let h0 = HST.get () in\n let sl = LP.make_slice packet packet_len in\n LP.valid_facts (parse_header cid_len) h0 sl 0ul;\n assert_spinoff (B.as_seq h0 packet `Seq.equal` LP.bytes_of_slice_from h0 sl 0ul);\n assert_norm (\n let k = parse_header_kind cid_len in\n Some? k.LP.parser_kind_high /\\\n k.LP.parser_kind_subkind == Some LP.ParserStrong\n );\n begin\n LPB.valid_bitsum_elim\n #LP.parse_u8_kind\n #8\n #U8.t\n #LPB.uint8\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n LP.parse_u8\n (parse_header_body cid_len)\n h0\n sl\n 0ul;\n let r = LP.read_u8 sl 0ul in\n let res = destr_first_byte\n (read_header_body_t sl cid_len)\n (fun _ cond dt df len' -> if cond then dt () len' else df () len')\n (read_header_body sl cid_len)\n r\n ()\n in\n res\n end\n\n#pop-options\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet synth_first_byte\n: (LPB.synth_bitsum'_recip_t first_byte)\n=\n (LPB.mk_synth_bitsum'_recip first_byte)\n\nmodule LW = LowParse.Low.Writers.Instances\n\n#push-options \"--z3rlimit 64 --max_fuel 4 --initial_fuel 4\"\n\ninline_for_extraction\nnoextract\nlet swrite_header_short\n (protected_bits: bitfield 5)\n (spin: bool)\n (cid: B.buffer U8.t)\n (cid_len: U32.t {\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n })\n (h0: HS.mem {\n B.live h0 cid\n })\n (out: LP.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer cid) (LP.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header cid_len) h0 0 out 0ul {\n LW.swvalue w == S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))\n })\n= \n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Short, (| (), ((if spin then 1uy else 0uy), (protected_bits, ())) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Short, (| (), () |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header cid_len (S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body cid_len k) h0 _ out 0ul =\n LW.swrite_weaken (LP.strong_parser_kind 0 20 None) (LW.swrite_flbytes h0 out 0ul cid_len cid)\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body cid_len)\n (serialize_header_body cid_len)\n tg\n s\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet swrite_common_long\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter serialize_common_long h0 0 out 0ul {\n LW.swvalue w == (version, (FB.hide (B.as_seq h0 dcid), FB.hide (B.as_seq h0 scid)))\n })\n= LW.swrite_leaf LP.write_u32 h0 out 0ul version `LW.swrite_nondep_then` (\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 dcid_len dcid `LW.swrite_nondep_then`\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 scid_len scid\n )\n\ninline_for_extraction\nlet swrite_payload_and_pn_length\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem)\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _))\n: Tot (w: LW.swriter (serialize_payload_and_pn_length) h0 0 out 0ul {\n LW.swvalue w == payload_and_pn_length\n })\n= payload_and_pn_length_prop `LW.swrite_filter` LW.swrite_leaf (LP.leaf_writer_strong_of_serializer32 VI.write_varint ()) h0 out 0ul payload_and_pn_length\n\n#push-options \"--z3rlimit 128 --max_fuel 4 --initial_fuel 4\"\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_initial\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (token: B.buffer U8.t)\n (token_length: U32.t {\n let v = U32.v token_length in\n v == B.length token /\\\n 0 <= v /\\ v <= token_max_len\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid /\\\n B.live h0 token\n })\n (out: LP.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint ((B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) `B.loc_union` B.loc_buffer token) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PInitial (FB.hide (B.as_seq h0 token)) payload_and_pn_length)\n })\n= \n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| Initial, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PInitial (FB.hide (B.as_seq h0 token)) payload_and_pn_length)) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then` (\n LW.swrite_bounded_vlgenbytes h0 out 0ul 0 token_max_len (LP.leaf_writer_strong_of_serializer32 (VI.write_bounded_varint 0 token_max_len) ()) token_length token `LW.swrite_nondep_then`\n swrite_payload_and_pn_length payload_and_pn_length h0 out\n )\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_zeroRTT\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PZeroRTT payload_and_pn_length)\n })", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LW", "full_module": "LowParse.Low.Writers.Instances" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 4, "max_fuel": 4, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n protected_bits: QUIC.Spec.Base.bitfield 4 ->\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n version: FStar.UInt32.t ->\n dcid: LowStar.Buffer.buffer FStar.UInt8.t ->\n dcid_len:\n FStar.UInt32.t\n { let len = FStar.UInt32.v dcid_len in\n len == LowStar.Monotonic.Buffer.length dcid /\\ 0 <= len /\\ len <= 20 } ->\n scid: LowStar.Buffer.buffer FStar.UInt8.t ->\n scid_len:\n FStar.UInt32.t\n { let len = FStar.UInt32.v scid_len in\n len == LowStar.Monotonic.Buffer.length scid /\\ 0 <= len /\\ len <= 20 } ->\n payload_and_pn_length: QUIC.Spec.Base.payload_and_pn_length_t ->\n h0:\n FStar.Monotonic.HyperStack.mem\n {LowStar.Monotonic.Buffer.live h0 dcid /\\ LowStar.Monotonic.Buffer.live h0 scid} ->\n out:\n LowParse.Slice.slice (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n { LowStar.Monotonic.Buffer.loc_disjoint (LowStar.Monotonic.Buffer.loc_union (LowStar.Monotonic.Buffer.loc_buffer\n dcid)\n (LowStar.Monotonic.Buffer.loc_buffer scid))\n (LowParse.Slice.loc_slice_from out 0ul) }\n -> w:\n LowParse.Low.Writers.swriter (QUIC.Spec.Header.Public.serialize_header short_dcid_len)\n h0\n 0\n out\n 0ul\n { LowParse.Low.Writers.swvalue w ==\n QUIC.Spec.Header.Public.PLong protected_bits\n version\n (FStar.Bytes.hide (LowStar.Monotonic.Buffer.as_seq h0 dcid))\n (FStar.Bytes.hide (LowStar.Monotonic.Buffer.as_seq h0 scid))\n (QUIC.Spec.Header.Public.PZeroRTT payload_and_pn_length) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bitfield", "QUIC.Spec.Base.short_dcid_len_t", "FStar.UInt32.t", "LowStar.Buffer.buffer", "FStar.UInt8.t", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.op_LessThanOrEqual", "FStar.UInt.uint_t", "FStar.UInt32.v", "QUIC.Spec.Base.payload_and_pn_length_t", "FStar.Monotonic.HyperStack.mem", "LowStar.Monotonic.Buffer.live", "LowParse.Slice.slice", "LowParse.Bytes.byte", "LowStar.Monotonic.Buffer.loc_disjoint", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.loc_buffer", "LowParse.Slice.loc_slice_from", "FStar.UInt32.__uint_to_t", "LowParse.Low.Writers.Instances.swrite_bitsum", "LowParse.Low.Writers.Instances.max", "LowParse.Spec.Int.parse_u8_kind", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.first_byte_of_header", "QUIC.Spec.Header.Public.header_body_type", "QUIC.Spec.Header.Public.header_synth", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "LowParse.Low.Int.write_u8", "QUIC.Impl.Header.Public.synth_first_byte", "QUIC.Spec.Header.Public.parse_header_body", "QUIC.Spec.Header.Public.serialize_header_body", "LowParse.Low.Writers.swriter", "Prims.__proj__Mkdtuple2__item___1", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.parser", "FStar.Pervasives.dsnd", "FStar.UInt32.uint_to_t", "LowParse.Low.Writers.Instances.swrite_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Spec.Header.Public.serialize_common_long", "QUIC.Impl.Header.Public.swrite_common_long", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "QUIC.Spec.Header.Public.serialize_payload_and_pn_length", "QUIC.Impl.Header.Public.swrite_payload_and_pn_length", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.BitSum.bitsum'_type", "QUIC.Spec.Header.Public.PLong", "FStar.Bytes.hide", "LowStar.Monotonic.Buffer.as_seq", "QUIC.Spec.Header.Public.PZeroRTT", "LowParse.Spec.BitSum.bitsum'_key_type", "LowParse.Spec.BitSum.bitsum'_key_of_t", "Prims.Mkdtuple2", "LowParse.Spec.Enum.enum_key", "QUIC.Spec.Header.Public.header_form_t", "LowParse.BitFields.bitfield", "QUIC.Spec.Header.Public.header_form", "Prims.op_Subtraction", "LowParse.Spec.BitSum.BitSum'", "QUIC.Spec.Header.Public.fixed_bit", "LowParse.Spec.BitSum.BitField", "LowParse.Spec.BitSum.BitStop", "LowParse.Spec.BitSum.bitsum'", "QUIC.Spec.Header.Public.long_packet_type_t", "QUIC.Spec.Header.Public.long_packet_type", "QUIC.Spec.Header.Public.Long", "QUIC.Spec.Header.Public.ZeroRTT", "LowParse.Spec.BitSum.bitsum'_type'", "FStar.Pervasives.Native.Mktuple2", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "QUIC.Spec.Header.Public.header", "LowParse.Low.Writers.swvalue" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val swrite_header_long_zeroRTT\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len:\n U32.t\n { let len = U32.v dcid_len in\n len == B.length dcid /\\ 0 <= len /\\ len <= 20 })\n (scid: B.buffer U8.t)\n (scid_len:\n U32.t\n { let len = U32.v scid_len in\n len == B.length scid /\\ 0 <= len /\\ len <= 20 })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem{B.live h0 dcid /\\ B.live h0 scid})\n (out:\n LW.slice (B.trivial_preorder _) (B.trivial_preorder _)\n { B.loc_disjoint ((B.loc_buffer dcid) `B.loc_union` (B.loc_buffer scid))\n (LW.loc_slice_from out 0ul) })\n : Tot\n (w:\n LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul\n { LW.swvalue w ==\n S.PLong protected_bits\n version\n (FB.hide (B.as_seq h0 dcid))\n (FB.hide (B.as_seq h0 scid))\n (S.PZeroRTT payload_and_pn_length) })\nlet swrite_header_long_zeroRTT\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len:\n U32.t\n { let len = U32.v dcid_len in\n len == B.length dcid /\\ 0 <= len /\\ len <= 20 })\n (scid: B.buffer U8.t)\n (scid_len:\n U32.t\n { let len = U32.v scid_len in\n len == B.length scid /\\ 0 <= len /\\ len <= 20 })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem{B.live h0 dcid /\\ B.live h0 scid})\n (out:\n LW.slice (B.trivial_preorder _) (B.trivial_preorder _)\n { B.loc_disjoint ((B.loc_buffer dcid) `B.loc_union` (B.loc_buffer scid))\n (LW.loc_slice_from out 0ul) })\n : Tot\n (w:\n LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul\n { LW.swvalue w ==\n S.PLong protected_bits\n version\n (FB.hide (B.as_seq h0 dcid))\n (FB.hide (B.as_seq h0 scid))\n (S.PZeroRTT payload_and_pn_length) }) =", "completed_definiton": "[@@ inline_let ]let tg:LPB.bitsum'_type first_byte =\n (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |)\nin\n[@@ inline_let ]let k:LPB.bitsum'_key_type first_byte = (| Long, (| (), (| ZeroRTT, () |) |) |) in\n[@@ inline_let ]let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len\n (S.PLong protected_bits\n version\n (FB.hide (B.as_seq h0 dcid))\n (FB.hide (B.as_seq h0 scid))\n (S.PZeroRTT payload_and_pn_length)) ==\n tg)\nin\n[@@ inline_let ]let s:LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n (swrite_common_long version dcid dcid_len scid scid_len h0 out)\n `LW.swrite_nondep_then`\n (swrite_payload_and_pn_length payload_and_pn_length h0 out)\nin\nLW.swrite_bitsum h0 _ out 0ul #LP.parse_u8_kind #8 #U8.t first_byte #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len)\n (header_synth short_dcid_len) #LP.parse_u8 #LP.serialize_u8 LP.write_u8 synth_first_byte\n #(parse_header_body short_dcid_len) (serialize_header_body short_dcid_len) tg s", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.swrite_header_long_retry", "original_source_type": "val swrite_header_long_retry\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len:\n U32.t\n { let len = U32.v dcid_len in\n len == B.length dcid /\\ 0 <= len /\\ len <= 20 })\n (scid: B.buffer U8.t)\n (scid_len:\n U32.t\n { let len = U32.v scid_len in\n len == B.length scid /\\ 0 <= len /\\ len <= 20 })\n (odcid: B.buffer U8.t)\n (odcid_len:\n U32.t\n { let len = U32.v odcid_len in\n len == B.length odcid /\\ 0 <= len /\\ len <= 20 })\n (h0: HS.mem{B.live h0 dcid /\\ B.live h0 scid /\\ B.live h0 odcid})\n (out:\n LW.slice (B.trivial_preorder _) (B.trivial_preorder _)\n { B.loc_disjoint (((B.loc_buffer dcid) `B.loc_union` (B.loc_buffer scid))\n `B.loc_union`\n (B.loc_buffer odcid))\n (LW.loc_slice_from out 0ul) })\n : Tot\n (w:\n LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul\n { LW.swvalue w ==\n S.PLong protected_bits\n version\n (FB.hide (B.as_seq h0 dcid))\n (FB.hide (B.as_seq h0 scid))\n (S.PRetry (FB.hide (B.as_seq h0 odcid))) })", "source_type": "val swrite_header_long_retry\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len:\n U32.t\n { let len = U32.v dcid_len in\n len == B.length dcid /\\ 0 <= len /\\ len <= 20 })\n (scid: B.buffer U8.t)\n (scid_len:\n U32.t\n { let len = U32.v scid_len in\n len == B.length scid /\\ 0 <= len /\\ len <= 20 })\n (odcid: B.buffer U8.t)\n (odcid_len:\n U32.t\n { let len = U32.v odcid_len in\n len == B.length odcid /\\ 0 <= len /\\ len <= 20 })\n (h0: HS.mem{B.live h0 dcid /\\ B.live h0 scid /\\ B.live h0 odcid})\n (out:\n LW.slice (B.trivial_preorder _) (B.trivial_preorder _)\n { B.loc_disjoint (((B.loc_buffer dcid) `B.loc_union` (B.loc_buffer scid))\n `B.loc_union`\n (B.loc_buffer odcid))\n (LW.loc_slice_from out 0ul) })\n : Tot\n (w:\n LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul\n { LW.swvalue w ==\n S.PLong protected_bits\n version\n (FB.hide (B.as_seq h0 dcid))\n (FB.hide (B.as_seq h0 scid))\n (S.PRetry (FB.hide (B.as_seq h0 odcid))) })", "source_definition": "let swrite_header_long_retry\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (odcid: B.buffer U8.t)\n (odcid_len: U32.t {\n let len = U32.v odcid_len in\n len == B.length odcid /\\\n 0 <= len /\\ len <= 20\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid /\\\n B.live h0 odcid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint ((B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) `B.loc_union` B.loc_buffer odcid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PRetry (FB.hide (B.as_seq h0 odcid)))\n })\n= [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| Retry, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PRetry (FB.hide (B.as_seq h0 odcid)))) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 0 out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then`\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 odcid_len odcid\n in\n LW.swrite_bitsum\n h0\n 0\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 796, "start_col": 2, "end_line": 834, "end_col": 5 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) == (| Long, (| (), (| Retry, () |) |) |) );\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)\n\n#pop-options\n\nlet valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures (\n LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_initial_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0 sl pos\n\ninline_for_extraction\nlet read_payload_and_pn_length : LP.leaf_reader parse_payload_and_pn_length =\n LP.read_filter VI.read_varint payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Initial, () |) |) |) );\n valid_long_initial_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len)) (parse_payload_and_pn_length) sl pos3;\n let token = LP.get_bounded_vlgenbytes_contents 0 token_max_len (VI.read_bounded_varint 0 token_max_len) (VI.jump_bounded_varint 0 token_max_len) sl pos3 in\n let token_len = LP.bounded_vlgenbytes_payload_length 0 token_max_len (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let pos4 = LP.jump_bounded_vlgenbytes 0 token_max_len (VI.jump_bounded_varint 0 token_max_len) (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos4 in\n let spec = PInitial (payload_and_pn_length) token token_len in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures (\n LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_handshake_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` VI.parse_varint)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_handshake\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Handshake, () |) |) |) );\n valid_long_handshake_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PHandshake payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_zero_rtt_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_zero_rtt_body h0 sl pos))\n (ensures (\n LP.valid parse_long_zero_rtt_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_zero_rtt_body h0 sl pos)\n (LP.get_valid_pos parse_long_zero_rtt_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_zero_rtt_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_zero_rtt\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) == (| Long, (| (), (| ZeroRTT, () |) |) |) );\n valid_long_zero_rtt_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PZeroRTT payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet read_header_body\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (read_header_body_t sl cid_len tg)\n= fun len ->\n let h0 = HST.get () in\n match tg with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n read_header_body_short sl cid_len spin protected_bits len\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n read_header_body_long_retry sl cid_len protected_bits len\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n read_header_body_long_initial sl cid_len protected_bits len\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n read_header_body_long_handshake sl cid_len protected_bits len\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n read_header_body_long_zero_rtt sl cid_len protected_bits len\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --fuel 4 --ifuel 4 --query_stats\"\n\nlet read_header packet packet_len cid_len =\n let h0 = HST.get () in\n let sl = LP.make_slice packet packet_len in\n LP.valid_facts (parse_header cid_len) h0 sl 0ul;\n assert_spinoff (B.as_seq h0 packet `Seq.equal` LP.bytes_of_slice_from h0 sl 0ul);\n assert_norm (\n let k = parse_header_kind cid_len in\n Some? k.LP.parser_kind_high /\\\n k.LP.parser_kind_subkind == Some LP.ParserStrong\n );\n begin\n LPB.valid_bitsum_elim\n #LP.parse_u8_kind\n #8\n #U8.t\n #LPB.uint8\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n LP.parse_u8\n (parse_header_body cid_len)\n h0\n sl\n 0ul;\n let r = LP.read_u8 sl 0ul in\n let res = destr_first_byte\n (read_header_body_t sl cid_len)\n (fun _ cond dt df len' -> if cond then dt () len' else df () len')\n (read_header_body sl cid_len)\n r\n ()\n in\n res\n end\n\n#pop-options\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet synth_first_byte\n: (LPB.synth_bitsum'_recip_t first_byte)\n=\n (LPB.mk_synth_bitsum'_recip first_byte)\n\nmodule LW = LowParse.Low.Writers.Instances\n\n#push-options \"--z3rlimit 64 --max_fuel 4 --initial_fuel 4\"\n\ninline_for_extraction\nnoextract\nlet swrite_header_short\n (protected_bits: bitfield 5)\n (spin: bool)\n (cid: B.buffer U8.t)\n (cid_len: U32.t {\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n })\n (h0: HS.mem {\n B.live h0 cid\n })\n (out: LP.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer cid) (LP.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header cid_len) h0 0 out 0ul {\n LW.swvalue w == S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))\n })\n= \n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Short, (| (), ((if spin then 1uy else 0uy), (protected_bits, ())) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Short, (| (), () |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header cid_len (S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body cid_len k) h0 _ out 0ul =\n LW.swrite_weaken (LP.strong_parser_kind 0 20 None) (LW.swrite_flbytes h0 out 0ul cid_len cid)\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body cid_len)\n (serialize_header_body cid_len)\n tg\n s\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet swrite_common_long\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter serialize_common_long h0 0 out 0ul {\n LW.swvalue w == (version, (FB.hide (B.as_seq h0 dcid), FB.hide (B.as_seq h0 scid)))\n })\n= LW.swrite_leaf LP.write_u32 h0 out 0ul version `LW.swrite_nondep_then` (\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 dcid_len dcid `LW.swrite_nondep_then`\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 scid_len scid\n )\n\ninline_for_extraction\nlet swrite_payload_and_pn_length\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem)\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _))\n: Tot (w: LW.swriter (serialize_payload_and_pn_length) h0 0 out 0ul {\n LW.swvalue w == payload_and_pn_length\n })\n= payload_and_pn_length_prop `LW.swrite_filter` LW.swrite_leaf (LP.leaf_writer_strong_of_serializer32 VI.write_varint ()) h0 out 0ul payload_and_pn_length\n\n#push-options \"--z3rlimit 128 --max_fuel 4 --initial_fuel 4\"\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_initial\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (token: B.buffer U8.t)\n (token_length: U32.t {\n let v = U32.v token_length in\n v == B.length token /\\\n 0 <= v /\\ v <= token_max_len\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid /\\\n B.live h0 token\n })\n (out: LP.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint ((B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) `B.loc_union` B.loc_buffer token) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PInitial (FB.hide (B.as_seq h0 token)) payload_and_pn_length)\n })\n= \n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| Initial, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PInitial (FB.hide (B.as_seq h0 token)) payload_and_pn_length)) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then` (\n LW.swrite_bounded_vlgenbytes h0 out 0ul 0 token_max_len (LP.leaf_writer_strong_of_serializer32 (VI.write_bounded_varint 0 token_max_len) ()) token_length token `LW.swrite_nondep_then`\n swrite_payload_and_pn_length payload_and_pn_length h0 out\n )\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_zeroRTT\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PZeroRTT payload_and_pn_length)\n })\n=\n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| ZeroRTT, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PZeroRTT payload_and_pn_length)) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then`\n swrite_payload_and_pn_length payload_and_pn_length h0 out\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_handshake\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PHandshake payload_and_pn_length)\n })\n= [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| Handshake, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PHandshake payload_and_pn_length)) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then`\n swrite_payload_and_pn_length payload_and_pn_length h0 out\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_retry\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (odcid: B.buffer U8.t)\n (odcid_len: U32.t {\n let len = U32.v odcid_len in\n len == B.length odcid /\\\n 0 <= len /\\ len <= 20\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid /\\\n B.live h0 odcid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint ((B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) `B.loc_union` B.loc_buffer odcid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PRetry (FB.hide (B.as_seq h0 odcid)))", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LW", "full_module": "LowParse.Low.Writers.Instances" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 4, "max_fuel": 4, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n protected_bits: QUIC.Spec.Base.bitfield 4 ->\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n version: FStar.UInt32.t ->\n dcid: LowStar.Buffer.buffer FStar.UInt8.t ->\n dcid_len:\n FStar.UInt32.t\n { let len = FStar.UInt32.v dcid_len in\n len == LowStar.Monotonic.Buffer.length dcid /\\ 0 <= len /\\ len <= 20 } ->\n scid: LowStar.Buffer.buffer FStar.UInt8.t ->\n scid_len:\n FStar.UInt32.t\n { let len = FStar.UInt32.v scid_len in\n len == LowStar.Monotonic.Buffer.length scid /\\ 0 <= len /\\ len <= 20 } ->\n odcid: LowStar.Buffer.buffer FStar.UInt8.t ->\n odcid_len:\n FStar.UInt32.t\n { let len = FStar.UInt32.v odcid_len in\n len == LowStar.Monotonic.Buffer.length odcid /\\ 0 <= len /\\ len <= 20 } ->\n h0:\n FStar.Monotonic.HyperStack.mem\n { LowStar.Monotonic.Buffer.live h0 dcid /\\ LowStar.Monotonic.Buffer.live h0 scid /\\\n LowStar.Monotonic.Buffer.live h0 odcid } ->\n out:\n LowParse.Slice.slice (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n { LowStar.Monotonic.Buffer.loc_disjoint (LowStar.Monotonic.Buffer.loc_union (LowStar.Monotonic.Buffer.loc_union\n (LowStar.Monotonic.Buffer.loc_buffer dcid)\n (LowStar.Monotonic.Buffer.loc_buffer scid))\n (LowStar.Monotonic.Buffer.loc_buffer odcid))\n (LowParse.Slice.loc_slice_from out 0ul) }\n -> w:\n LowParse.Low.Writers.swriter (QUIC.Spec.Header.Public.serialize_header short_dcid_len)\n h0\n 0\n out\n 0ul\n { LowParse.Low.Writers.swvalue w ==\n QUIC.Spec.Header.Public.PLong protected_bits\n version\n (FStar.Bytes.hide (LowStar.Monotonic.Buffer.as_seq h0 dcid))\n (FStar.Bytes.hide (LowStar.Monotonic.Buffer.as_seq h0 scid))\n (QUIC.Spec.Header.Public.PRetry\n (FStar.Bytes.hide (LowStar.Monotonic.Buffer.as_seq h0 odcid))) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bitfield", "QUIC.Spec.Base.short_dcid_len_t", "FStar.UInt32.t", "LowStar.Buffer.buffer", "FStar.UInt8.t", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.op_LessThanOrEqual", "FStar.UInt.uint_t", "FStar.UInt32.v", "FStar.Monotonic.HyperStack.mem", "LowStar.Monotonic.Buffer.live", "LowParse.Slice.slice", "LowParse.Bytes.byte", "LowStar.Monotonic.Buffer.loc_disjoint", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.loc_buffer", "LowParse.Slice.loc_slice_from", "FStar.UInt32.__uint_to_t", "LowParse.Low.Writers.Instances.swrite_bitsum", "LowParse.Spec.Int.parse_u8_kind", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.first_byte_of_header", "QUIC.Spec.Header.Public.header_body_type", "QUIC.Spec.Header.Public.header_synth", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "LowParse.Low.Int.write_u8", "QUIC.Impl.Header.Public.synth_first_byte", "QUIC.Spec.Header.Public.parse_header_body", "QUIC.Spec.Header.Public.serialize_header_body", "LowParse.Low.Writers.swriter", "Prims.__proj__Mkdtuple2__item___1", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.parser", "FStar.Pervasives.dsnd", "FStar.UInt32.uint_to_t", "LowParse.Low.Writers.Instances.swrite_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Spec.Header.Public.serialize_common_long", "QUIC.Impl.Header.Public.swrite_common_long", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "LowParse.Spec.Bytes.parse_bounded_vlbytes", "LowParse.Spec.Bytes.serialize_bounded_vlbytes", "LowParse.Low.Writers.Instances.swrite_bounded_vlbytes", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.BitSum.bitsum'_type", "QUIC.Spec.Header.Public.PLong", "FStar.Bytes.hide", "LowStar.Monotonic.Buffer.as_seq", "QUIC.Spec.Header.Public.PRetry", "LowParse.Spec.BitSum.bitsum'_key_type", "LowParse.Spec.BitSum.bitsum'_key_of_t", "Prims.Mkdtuple2", "LowParse.Spec.Enum.enum_key", "QUIC.Spec.Header.Public.header_form_t", "LowParse.BitFields.bitfield", "QUIC.Spec.Header.Public.header_form", "Prims.op_Subtraction", "LowParse.Spec.BitSum.BitSum'", "QUIC.Spec.Header.Public.fixed_bit", "LowParse.Spec.BitSum.BitField", "LowParse.Spec.BitSum.BitStop", "LowParse.Spec.BitSum.bitsum'", "QUIC.Spec.Header.Public.long_packet_type_t", "QUIC.Spec.Header.Public.long_packet_type", "QUIC.Spec.Header.Public.Long", "QUIC.Spec.Header.Public.Retry", "LowParse.Spec.BitSum.bitsum'_type'", "FStar.Pervasives.Native.Mktuple2", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "QUIC.Spec.Header.Public.header", "LowParse.Low.Writers.swvalue" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val swrite_header_long_retry\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len:\n U32.t\n { let len = U32.v dcid_len in\n len == B.length dcid /\\ 0 <= len /\\ len <= 20 })\n (scid: B.buffer U8.t)\n (scid_len:\n U32.t\n { let len = U32.v scid_len in\n len == B.length scid /\\ 0 <= len /\\ len <= 20 })\n (odcid: B.buffer U8.t)\n (odcid_len:\n U32.t\n { let len = U32.v odcid_len in\n len == B.length odcid /\\ 0 <= len /\\ len <= 20 })\n (h0: HS.mem{B.live h0 dcid /\\ B.live h0 scid /\\ B.live h0 odcid})\n (out:\n LW.slice (B.trivial_preorder _) (B.trivial_preorder _)\n { B.loc_disjoint (((B.loc_buffer dcid) `B.loc_union` (B.loc_buffer scid))\n `B.loc_union`\n (B.loc_buffer odcid))\n (LW.loc_slice_from out 0ul) })\n : Tot\n (w:\n LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul\n { LW.swvalue w ==\n S.PLong protected_bits\n version\n (FB.hide (B.as_seq h0 dcid))\n (FB.hide (B.as_seq h0 scid))\n (S.PRetry (FB.hide (B.as_seq h0 odcid))) })\nlet swrite_header_long_retry\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len:\n U32.t\n { let len = U32.v dcid_len in\n len == B.length dcid /\\ 0 <= len /\\ len <= 20 })\n (scid: B.buffer U8.t)\n (scid_len:\n U32.t\n { let len = U32.v scid_len in\n len == B.length scid /\\ 0 <= len /\\ len <= 20 })\n (odcid: B.buffer U8.t)\n (odcid_len:\n U32.t\n { let len = U32.v odcid_len in\n len == B.length odcid /\\ 0 <= len /\\ len <= 20 })\n (h0: HS.mem{B.live h0 dcid /\\ B.live h0 scid /\\ B.live h0 odcid})\n (out:\n LW.slice (B.trivial_preorder _) (B.trivial_preorder _)\n { B.loc_disjoint (((B.loc_buffer dcid) `B.loc_union` (B.loc_buffer scid))\n `B.loc_union`\n (B.loc_buffer odcid))\n (LW.loc_slice_from out 0ul) })\n : Tot\n (w:\n LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul\n { LW.swvalue w ==\n S.PLong protected_bits\n version\n (FB.hide (B.as_seq h0 dcid))\n (FB.hide (B.as_seq h0 scid))\n (S.PRetry (FB.hide (B.as_seq h0 odcid))) }) =", "completed_definiton": "[@@ inline_let ]let tg:LPB.bitsum'_type first_byte =\n (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |)\nin\n[@@ inline_let ]let k:LPB.bitsum'_key_type first_byte = (| Long, (| (), (| Retry, () |) |) |) in\n[@@ inline_let ]let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len\n (S.PLong protected_bits\n version\n (FB.hide (B.as_seq h0 dcid))\n (FB.hide (B.as_seq h0 scid))\n (S.PRetry (FB.hide (B.as_seq h0 odcid)))) ==\n tg)\nin\n[@@ inline_let ]let s:LW.swriter (serialize_header_body short_dcid_len k) h0 0 out 0ul =\n (swrite_common_long version dcid dcid_len scid scid_len h0 out)\n `LW.swrite_nondep_then`\n (LW.swrite_bounded_vlbytes h0 out 0ul 0 20 odcid_len odcid)\nin\nLW.swrite_bitsum h0 0 out 0ul #LP.parse_u8_kind #8 #U8.t first_byte #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len)\n (header_synth short_dcid_len) #LP.parse_u8 #LP.serialize_u8 LP.write_u8 synth_first_byte\n #(parse_header_body short_dcid_len) (serialize_header_body short_dcid_len) tg s", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.swrite_header_long_initial", "original_source_type": "val swrite_header_long_initial\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len:\n U32.t\n { let len = U32.v dcid_len in\n len == B.length dcid /\\ 0 <= len /\\ len <= 20 })\n (scid: B.buffer U8.t)\n (scid_len:\n U32.t\n { let len = U32.v scid_len in\n len == B.length scid /\\ 0 <= len /\\ len <= 20 })\n (payload_and_pn_length: payload_and_pn_length_t)\n (token: B.buffer U8.t)\n (token_length:\n U32.t\n { let v = U32.v token_length in\n v == B.length token /\\ 0 <= v /\\ v <= token_max_len })\n (h0: HS.mem{B.live h0 dcid /\\ B.live h0 scid /\\ B.live h0 token})\n (out:\n LP.slice (B.trivial_preorder _) (B.trivial_preorder _)\n { B.loc_disjoint (((B.loc_buffer dcid) `B.loc_union` (B.loc_buffer scid))\n `B.loc_union`\n (B.loc_buffer token))\n (LW.loc_slice_from out 0ul) })\n : Tot\n (w:\n LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul\n { LW.swvalue w ==\n S.PLong protected_bits\n version\n (FB.hide (B.as_seq h0 dcid))\n (FB.hide (B.as_seq h0 scid))\n (S.PInitial (FB.hide (B.as_seq h0 token)) payload_and_pn_length) })", "source_type": "val swrite_header_long_initial\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len:\n U32.t\n { let len = U32.v dcid_len in\n len == B.length dcid /\\ 0 <= len /\\ len <= 20 })\n (scid: B.buffer U8.t)\n (scid_len:\n U32.t\n { let len = U32.v scid_len in\n len == B.length scid /\\ 0 <= len /\\ len <= 20 })\n (payload_and_pn_length: payload_and_pn_length_t)\n (token: B.buffer U8.t)\n (token_length:\n U32.t\n { let v = U32.v token_length in\n v == B.length token /\\ 0 <= v /\\ v <= token_max_len })\n (h0: HS.mem{B.live h0 dcid /\\ B.live h0 scid /\\ B.live h0 token})\n (out:\n LP.slice (B.trivial_preorder _) (B.trivial_preorder _)\n { B.loc_disjoint (((B.loc_buffer dcid) `B.loc_union` (B.loc_buffer scid))\n `B.loc_union`\n (B.loc_buffer token))\n (LW.loc_slice_from out 0ul) })\n : Tot\n (w:\n LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul\n { LW.swvalue w ==\n S.PLong protected_bits\n version\n (FB.hide (B.as_seq h0 dcid))\n (FB.hide (B.as_seq h0 scid))\n (S.PInitial (FB.hide (B.as_seq h0 token)) payload_and_pn_length) })", "source_definition": "let swrite_header_long_initial\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (token: B.buffer U8.t)\n (token_length: U32.t {\n let v = U32.v token_length in\n v == B.length token /\\\n 0 <= v /\\ v <= token_max_len\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid /\\\n B.live h0 token\n })\n (out: LP.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint ((B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) `B.loc_union` B.loc_buffer token) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PInitial (FB.hide (B.as_seq h0 token)) payload_and_pn_length)\n })\n= \n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| Initial, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PInitial (FB.hide (B.as_seq h0 token)) payload_and_pn_length)) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then` (\n LW.swrite_bounded_vlgenbytes h0 out 0ul 0 token_max_len (LP.leaf_writer_strong_of_serializer32 (VI.write_bounded_varint 0 token_max_len) ()) token_length token `LW.swrite_nondep_then`\n swrite_payload_and_pn_length payload_and_pn_length h0 out\n )\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 580, "start_col": 2, "end_line": 620, "end_col": 5 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) == (| Long, (| (), (| Retry, () |) |) |) );\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)\n\n#pop-options\n\nlet valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures (\n LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_initial_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0 sl pos\n\ninline_for_extraction\nlet read_payload_and_pn_length : LP.leaf_reader parse_payload_and_pn_length =\n LP.read_filter VI.read_varint payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Initial, () |) |) |) );\n valid_long_initial_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len)) (parse_payload_and_pn_length) sl pos3;\n let token = LP.get_bounded_vlgenbytes_contents 0 token_max_len (VI.read_bounded_varint 0 token_max_len) (VI.jump_bounded_varint 0 token_max_len) sl pos3 in\n let token_len = LP.bounded_vlgenbytes_payload_length 0 token_max_len (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let pos4 = LP.jump_bounded_vlgenbytes 0 token_max_len (VI.jump_bounded_varint 0 token_max_len) (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos4 in\n let spec = PInitial (payload_and_pn_length) token token_len in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures (\n LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_handshake_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` VI.parse_varint)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_handshake\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Handshake, () |) |) |) );\n valid_long_handshake_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PHandshake payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_zero_rtt_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_zero_rtt_body h0 sl pos))\n (ensures (\n LP.valid parse_long_zero_rtt_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_zero_rtt_body h0 sl pos)\n (LP.get_valid_pos parse_long_zero_rtt_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_zero_rtt_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_zero_rtt\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) == (| Long, (| (), (| ZeroRTT, () |) |) |) );\n valid_long_zero_rtt_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PZeroRTT payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet read_header_body\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (read_header_body_t sl cid_len tg)\n= fun len ->\n let h0 = HST.get () in\n match tg with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n read_header_body_short sl cid_len spin protected_bits len\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n read_header_body_long_retry sl cid_len protected_bits len\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n read_header_body_long_initial sl cid_len protected_bits len\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n read_header_body_long_handshake sl cid_len protected_bits len\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n read_header_body_long_zero_rtt sl cid_len protected_bits len\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --fuel 4 --ifuel 4 --query_stats\"\n\nlet read_header packet packet_len cid_len =\n let h0 = HST.get () in\n let sl = LP.make_slice packet packet_len in\n LP.valid_facts (parse_header cid_len) h0 sl 0ul;\n assert_spinoff (B.as_seq h0 packet `Seq.equal` LP.bytes_of_slice_from h0 sl 0ul);\n assert_norm (\n let k = parse_header_kind cid_len in\n Some? k.LP.parser_kind_high /\\\n k.LP.parser_kind_subkind == Some LP.ParserStrong\n );\n begin\n LPB.valid_bitsum_elim\n #LP.parse_u8_kind\n #8\n #U8.t\n #LPB.uint8\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n LP.parse_u8\n (parse_header_body cid_len)\n h0\n sl\n 0ul;\n let r = LP.read_u8 sl 0ul in\n let res = destr_first_byte\n (read_header_body_t sl cid_len)\n (fun _ cond dt df len' -> if cond then dt () len' else df () len')\n (read_header_body sl cid_len)\n r\n ()\n in\n res\n end\n\n#pop-options\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet synth_first_byte\n: (LPB.synth_bitsum'_recip_t first_byte)\n=\n (LPB.mk_synth_bitsum'_recip first_byte)\n\nmodule LW = LowParse.Low.Writers.Instances\n\n#push-options \"--z3rlimit 64 --max_fuel 4 --initial_fuel 4\"\n\ninline_for_extraction\nnoextract\nlet swrite_header_short\n (protected_bits: bitfield 5)\n (spin: bool)\n (cid: B.buffer U8.t)\n (cid_len: U32.t {\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n })\n (h0: HS.mem {\n B.live h0 cid\n })\n (out: LP.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer cid) (LP.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header cid_len) h0 0 out 0ul {\n LW.swvalue w == S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))\n })\n= \n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Short, (| (), ((if spin then 1uy else 0uy), (protected_bits, ())) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Short, (| (), () |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header cid_len (S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body cid_len k) h0 _ out 0ul =\n LW.swrite_weaken (LP.strong_parser_kind 0 20 None) (LW.swrite_flbytes h0 out 0ul cid_len cid)\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body cid_len)\n (serialize_header_body cid_len)\n tg\n s\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet swrite_common_long\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter serialize_common_long h0 0 out 0ul {\n LW.swvalue w == (version, (FB.hide (B.as_seq h0 dcid), FB.hide (B.as_seq h0 scid)))\n })\n= LW.swrite_leaf LP.write_u32 h0 out 0ul version `LW.swrite_nondep_then` (\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 dcid_len dcid `LW.swrite_nondep_then`\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 scid_len scid\n )\n\ninline_for_extraction\nlet swrite_payload_and_pn_length\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem)\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _))\n: Tot (w: LW.swriter (serialize_payload_and_pn_length) h0 0 out 0ul {\n LW.swvalue w == payload_and_pn_length\n })\n= payload_and_pn_length_prop `LW.swrite_filter` LW.swrite_leaf (LP.leaf_writer_strong_of_serializer32 VI.write_varint ()) h0 out 0ul payload_and_pn_length\n\n#push-options \"--z3rlimit 128 --max_fuel 4 --initial_fuel 4\"\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_initial\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (token: B.buffer U8.t)\n (token_length: U32.t {\n let v = U32.v token_length in\n v == B.length token /\\\n 0 <= v /\\ v <= token_max_len\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid /\\\n B.live h0 token\n })\n (out: LP.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint ((B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) `B.loc_union` B.loc_buffer token) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PInitial (FB.hide (B.as_seq h0 token)) payload_and_pn_length)\n })", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LW", "full_module": "LowParse.Low.Writers.Instances" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 4, "max_fuel": 4, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n protected_bits: QUIC.Spec.Base.bitfield 4 ->\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n version: FStar.UInt32.t ->\n dcid: LowStar.Buffer.buffer FStar.UInt8.t ->\n dcid_len:\n FStar.UInt32.t\n { let len = FStar.UInt32.v dcid_len in\n len == LowStar.Monotonic.Buffer.length dcid /\\ 0 <= len /\\ len <= 20 } ->\n scid: LowStar.Buffer.buffer FStar.UInt8.t ->\n scid_len:\n FStar.UInt32.t\n { let len = FStar.UInt32.v scid_len in\n len == LowStar.Monotonic.Buffer.length scid /\\ 0 <= len /\\ len <= 20 } ->\n payload_and_pn_length: QUIC.Spec.Base.payload_and_pn_length_t ->\n token: LowStar.Buffer.buffer FStar.UInt8.t ->\n token_length:\n FStar.UInt32.t\n { let v = FStar.UInt32.v token_length in\n v == LowStar.Monotonic.Buffer.length token /\\ 0 <= v /\\ v <= QUIC.Spec.Base.token_max_len\n } ->\n h0:\n FStar.Monotonic.HyperStack.mem\n { LowStar.Monotonic.Buffer.live h0 dcid /\\ LowStar.Monotonic.Buffer.live h0 scid /\\\n LowStar.Monotonic.Buffer.live h0 token } ->\n out:\n LowParse.Slice.slice (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n { LowStar.Monotonic.Buffer.loc_disjoint (LowStar.Monotonic.Buffer.loc_union (LowStar.Monotonic.Buffer.loc_union\n (LowStar.Monotonic.Buffer.loc_buffer dcid)\n (LowStar.Monotonic.Buffer.loc_buffer scid))\n (LowStar.Monotonic.Buffer.loc_buffer token))\n (LowParse.Slice.loc_slice_from out 0ul) }\n -> w:\n LowParse.Low.Writers.swriter (QUIC.Spec.Header.Public.serialize_header short_dcid_len)\n h0\n 0\n out\n 0ul\n { LowParse.Low.Writers.swvalue w ==\n QUIC.Spec.Header.Public.PLong protected_bits\n version\n (FStar.Bytes.hide (LowStar.Monotonic.Buffer.as_seq h0 dcid))\n (FStar.Bytes.hide (LowStar.Monotonic.Buffer.as_seq h0 scid))\n (QUIC.Spec.Header.Public.PInitial\n (FStar.Bytes.hide (LowStar.Monotonic.Buffer.as_seq h0 token)) payload_and_pn_length) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bitfield", "QUIC.Spec.Base.short_dcid_len_t", "FStar.UInt32.t", "LowStar.Buffer.buffer", "FStar.UInt8.t", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.op_LessThanOrEqual", "FStar.UInt.uint_t", "FStar.UInt32.v", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Base.token_max_len", "FStar.Monotonic.HyperStack.mem", "LowStar.Monotonic.Buffer.live", "LowParse.Slice.slice", "LowParse.Bytes.byte", "LowStar.Monotonic.Buffer.loc_disjoint", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.loc_buffer", "LowParse.Slice.loc_slice_from", "FStar.UInt32.__uint_to_t", "LowParse.Low.Writers.Instances.swrite_bitsum", "LowParse.Low.Writers.Instances.max", "LowParse.Spec.Int.parse_u8_kind", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.first_byte_of_header", "QUIC.Spec.Header.Public.header_body_type", "QUIC.Spec.Header.Public.header_synth", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "LowParse.Low.Int.write_u8", "QUIC.Impl.Header.Public.synth_first_byte", "QUIC.Spec.Header.Public.parse_header_body", "QUIC.Spec.Header.Public.serialize_header_body", "LowParse.Low.Writers.swriter", "Prims.__proj__Mkdtuple2__item___1", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.parser", "FStar.Pervasives.dsnd", "FStar.UInt32.uint_to_t", "LowParse.Low.Writers.Instances.swrite_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Spec.Header.Public.serialize_common_long", "QUIC.Impl.Header.Public.swrite_common_long", "LowParse.Spec.VLGen.parse_bounded_vlgen_kind", "QUIC.Spec.VarInt.parse_varint_kind", "LowParse.Spec.Combinators.parse_filter_kind", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Bytes.parse_bounded_vlgenbytes", "QUIC.Spec.VarInt.parse_bounded_varint", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "LowParse.Spec.Combinators.serialize_nondep_then", "LowParse.Spec.Bytes.serialize_bounded_vlgenbytes", "QUIC.Spec.VarInt.serialize_bounded_varint", "QUIC.Spec.Header.Public.serialize_payload_and_pn_length", "LowParse.Low.Writers.Instances.swrite_bounded_vlgenbytes", "LowParse.Low.Base.leaf_writer_strong_of_serializer32", "LowParse.Spec.BoundedInt.bounded_int32", "QUIC.Impl.VarInt.write_bounded_varint", "QUIC.Impl.Header.Public.swrite_payload_and_pn_length", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.BitSum.bitsum'_type", "QUIC.Spec.Header.Public.PLong", "FStar.Bytes.hide", "LowStar.Monotonic.Buffer.as_seq", "QUIC.Spec.Header.Public.PInitial", "LowParse.Spec.BitSum.bitsum'_key_type", "LowParse.Spec.BitSum.bitsum'_key_of_t", "Prims.Mkdtuple2", "LowParse.Spec.Enum.enum_key", "QUIC.Spec.Header.Public.header_form_t", "LowParse.BitFields.bitfield", "QUIC.Spec.Header.Public.header_form", "Prims.op_Subtraction", "LowParse.Spec.BitSum.BitSum'", "QUIC.Spec.Header.Public.fixed_bit", "LowParse.Spec.BitSum.BitField", "LowParse.Spec.BitSum.BitStop", "LowParse.Spec.BitSum.bitsum'", "QUIC.Spec.Header.Public.long_packet_type_t", "QUIC.Spec.Header.Public.long_packet_type", "QUIC.Spec.Header.Public.Long", "QUIC.Spec.Header.Public.Initial", "LowParse.Spec.BitSum.bitsum'_type'", "FStar.Pervasives.Native.Mktuple2", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "QUIC.Spec.Header.Public.header", "LowParse.Low.Writers.swvalue" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val swrite_header_long_initial\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len:\n U32.t\n { let len = U32.v dcid_len in\n len == B.length dcid /\\ 0 <= len /\\ len <= 20 })\n (scid: B.buffer U8.t)\n (scid_len:\n U32.t\n { let len = U32.v scid_len in\n len == B.length scid /\\ 0 <= len /\\ len <= 20 })\n (payload_and_pn_length: payload_and_pn_length_t)\n (token: B.buffer U8.t)\n (token_length:\n U32.t\n { let v = U32.v token_length in\n v == B.length token /\\ 0 <= v /\\ v <= token_max_len })\n (h0: HS.mem{B.live h0 dcid /\\ B.live h0 scid /\\ B.live h0 token})\n (out:\n LP.slice (B.trivial_preorder _) (B.trivial_preorder _)\n { B.loc_disjoint (((B.loc_buffer dcid) `B.loc_union` (B.loc_buffer scid))\n `B.loc_union`\n (B.loc_buffer token))\n (LW.loc_slice_from out 0ul) })\n : Tot\n (w:\n LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul\n { LW.swvalue w ==\n S.PLong protected_bits\n version\n (FB.hide (B.as_seq h0 dcid))\n (FB.hide (B.as_seq h0 scid))\n (S.PInitial (FB.hide (B.as_seq h0 token)) payload_and_pn_length) })\nlet swrite_header_long_initial\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len:\n U32.t\n { let len = U32.v dcid_len in\n len == B.length dcid /\\ 0 <= len /\\ len <= 20 })\n (scid: B.buffer U8.t)\n (scid_len:\n U32.t\n { let len = U32.v scid_len in\n len == B.length scid /\\ 0 <= len /\\ len <= 20 })\n (payload_and_pn_length: payload_and_pn_length_t)\n (token: B.buffer U8.t)\n (token_length:\n U32.t\n { let v = U32.v token_length in\n v == B.length token /\\ 0 <= v /\\ v <= token_max_len })\n (h0: HS.mem{B.live h0 dcid /\\ B.live h0 scid /\\ B.live h0 token})\n (out:\n LP.slice (B.trivial_preorder _) (B.trivial_preorder _)\n { B.loc_disjoint (((B.loc_buffer dcid) `B.loc_union` (B.loc_buffer scid))\n `B.loc_union`\n (B.loc_buffer token))\n (LW.loc_slice_from out 0ul) })\n : Tot\n (w:\n LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul\n { LW.swvalue w ==\n S.PLong protected_bits\n version\n (FB.hide (B.as_seq h0 dcid))\n (FB.hide (B.as_seq h0 scid))\n (S.PInitial (FB.hide (B.as_seq h0 token)) payload_and_pn_length) }) =", "completed_definiton": "[@@ inline_let ]let tg:LPB.bitsum'_type first_byte =\n (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |)\nin\n[@@ inline_let ]let k:LPB.bitsum'_key_type first_byte = (| Long, (| (), (| Initial, () |) |) |) in\n[@@ inline_let ]let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len\n (S.PLong protected_bits\n version\n (FB.hide (B.as_seq h0 dcid))\n (FB.hide (B.as_seq h0 scid))\n (S.PInitial (FB.hide (B.as_seq h0 token)) payload_and_pn_length)) ==\n tg)\nin\n[@@ inline_let ]let s:LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n (swrite_common_long version dcid dcid_len scid scid_len h0 out)\n `LW.swrite_nondep_then`\n ((LW.swrite_bounded_vlgenbytes h0\n out\n 0ul\n 0\n token_max_len\n (LP.leaf_writer_strong_of_serializer32 (VI.write_bounded_varint 0 token_max_len) ())\n token_length\n token)\n `LW.swrite_nondep_then`\n (swrite_payload_and_pn_length payload_and_pn_length h0 out))\nin\nLW.swrite_bitsum h0 _ out 0ul #LP.parse_u8_kind #8 #U8.t first_byte #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len) (header_body_type short_dcid_len)\n (header_synth short_dcid_len) #LP.parse_u8 #LP.serialize_u8 LP.write_u8 synth_first_byte\n #(parse_header_body short_dcid_len) (serialize_header_body short_dcid_len) tg s", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.write_header_aux", "original_source_type": "val write_header_aux\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n (out: B.buffer U8.t)\n (out_len: U32.t { U32.v out_len <= B.length out })\n: HST.Stack U32.t\n (requires (fun h0 ->\n (PShort? h ==> PShort?.cid_len h == short_dcid_len) /\\\n header_live h h0 /\\\n B.live h0 out /\\\n B.loc_disjoint (header_footprint h) (B.loc_buffer out) /\\\n Seq.length (LP.serialize (serialize_header short_dcid_len) (set_protected_bits (g_header h h0) 0uy)) <= U32.v out_len\n ))\n (ensures (fun h0 len h1 ->\n let gh = set_protected_bits (g_header h h0) 0uy in\n let s = LP.serialize (serialize_header short_dcid_len) gh in\n U32.v len <= U32.v out_len /\\\n B.modifies (B.loc_buffer out) h0 h1 /\\\n Seq.slice (B.as_seq h1 out) 0 (U32.v len) == s \n ))", "source_type": "val write_header_aux\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n (out: B.buffer U8.t)\n (out_len: U32.t { U32.v out_len <= B.length out })\n: HST.Stack U32.t\n (requires (fun h0 ->\n (PShort? h ==> PShort?.cid_len h == short_dcid_len) /\\\n header_live h h0 /\\\n B.live h0 out /\\\n B.loc_disjoint (header_footprint h) (B.loc_buffer out) /\\\n Seq.length (LP.serialize (serialize_header short_dcid_len) (set_protected_bits (g_header h h0) 0uy)) <= U32.v out_len\n ))\n (ensures (fun h0 len h1 ->\n let gh = set_protected_bits (g_header h h0) 0uy in\n let s = LP.serialize (serialize_header short_dcid_len) gh in\n U32.v len <= U32.v out_len /\\\n B.modifies (B.loc_buffer out) h0 h1 /\\\n Seq.slice (B.as_seq h1 out) 0 (U32.v len) == s \n ))", "source_definition": "let write_header_aux\n short_dcid_len h out out_len\n= let h0 = HST.get () in\n let sl = LW.make_slice out out_len in\n LW.serialized_length_eq (serialize_header short_dcid_len) (set_protected_bits (g_header h h0) 0uy);\n let len = match h with\n | PShort pb spin cid cid_len ->\n LW.swrite (swrite_header_short 0uy spin cid cid_len h0 sl) 0ul\n | PLong pb version dcid dcil scid scil spec ->\n begin match spec with\n | PInitial payload_and_pn_length token token_length ->\n LW.swrite (swrite_header_long_initial 0uy short_dcid_len version dcid dcil scid scil payload_and_pn_length token token_length h0 sl) 0ul\n | PZeroRTT payload_and_pn_length ->\n LW.swrite (swrite_header_long_zeroRTT 0uy short_dcid_len version dcid dcil scid scil payload_and_pn_length h0 sl) 0ul\n | PHandshake payload_and_pn_length ->\n LW.swrite (swrite_header_long_handshake 0uy short_dcid_len version dcid dcil scid scil payload_and_pn_length h0 sl) 0ul\n | PRetry odcid odcil ->\n LW.swrite (swrite_header_long_retry 0uy short_dcid_len version dcid dcil scid scil odcid odcil h0 sl) 0ul\n end\n in\n let h1 = HST.get () in\n LP.valid_pos_valid_exact (parse_header short_dcid_len) h1 sl 0ul len;\n LP.valid_exact_serialize (serialize_header short_dcid_len) h1 sl 0ul len;\n len", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 868, "start_col": 1, "end_line": 889, "end_col": 5 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) == (| Long, (| (), (| Retry, () |) |) |) );\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)\n\n#pop-options\n\nlet valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures (\n LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_initial_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0 sl pos\n\ninline_for_extraction\nlet read_payload_and_pn_length : LP.leaf_reader parse_payload_and_pn_length =\n LP.read_filter VI.read_varint payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Initial, () |) |) |) );\n valid_long_initial_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len)) (parse_payload_and_pn_length) sl pos3;\n let token = LP.get_bounded_vlgenbytes_contents 0 token_max_len (VI.read_bounded_varint 0 token_max_len) (VI.jump_bounded_varint 0 token_max_len) sl pos3 in\n let token_len = LP.bounded_vlgenbytes_payload_length 0 token_max_len (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let pos4 = LP.jump_bounded_vlgenbytes 0 token_max_len (VI.jump_bounded_varint 0 token_max_len) (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos4 in\n let spec = PInitial (payload_and_pn_length) token token_len in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures (\n LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_handshake_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` VI.parse_varint)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_handshake\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Handshake, () |) |) |) );\n valid_long_handshake_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PHandshake payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_zero_rtt_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_zero_rtt_body h0 sl pos))\n (ensures (\n LP.valid parse_long_zero_rtt_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_zero_rtt_body h0 sl pos)\n (LP.get_valid_pos parse_long_zero_rtt_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_zero_rtt_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_zero_rtt\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) == (| Long, (| (), (| ZeroRTT, () |) |) |) );\n valid_long_zero_rtt_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PZeroRTT payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet read_header_body\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (read_header_body_t sl cid_len tg)\n= fun len ->\n let h0 = HST.get () in\n match tg with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n read_header_body_short sl cid_len spin protected_bits len\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n read_header_body_long_retry sl cid_len protected_bits len\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n read_header_body_long_initial sl cid_len protected_bits len\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n read_header_body_long_handshake sl cid_len protected_bits len\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n read_header_body_long_zero_rtt sl cid_len protected_bits len\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --fuel 4 --ifuel 4 --query_stats\"\n\nlet read_header packet packet_len cid_len =\n let h0 = HST.get () in\n let sl = LP.make_slice packet packet_len in\n LP.valid_facts (parse_header cid_len) h0 sl 0ul;\n assert_spinoff (B.as_seq h0 packet `Seq.equal` LP.bytes_of_slice_from h0 sl 0ul);\n assert_norm (\n let k = parse_header_kind cid_len in\n Some? k.LP.parser_kind_high /\\\n k.LP.parser_kind_subkind == Some LP.ParserStrong\n );\n begin\n LPB.valid_bitsum_elim\n #LP.parse_u8_kind\n #8\n #U8.t\n #LPB.uint8\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n LP.parse_u8\n (parse_header_body cid_len)\n h0\n sl\n 0ul;\n let r = LP.read_u8 sl 0ul in\n let res = destr_first_byte\n (read_header_body_t sl cid_len)\n (fun _ cond dt df len' -> if cond then dt () len' else df () len')\n (read_header_body sl cid_len)\n r\n ()\n in\n res\n end\n\n#pop-options\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet synth_first_byte\n: (LPB.synth_bitsum'_recip_t first_byte)\n=\n (LPB.mk_synth_bitsum'_recip first_byte)\n\nmodule LW = LowParse.Low.Writers.Instances\n\n#push-options \"--z3rlimit 64 --max_fuel 4 --initial_fuel 4\"\n\ninline_for_extraction\nnoextract\nlet swrite_header_short\n (protected_bits: bitfield 5)\n (spin: bool)\n (cid: B.buffer U8.t)\n (cid_len: U32.t {\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n })\n (h0: HS.mem {\n B.live h0 cid\n })\n (out: LP.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer cid) (LP.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header cid_len) h0 0 out 0ul {\n LW.swvalue w == S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))\n })\n= \n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Short, (| (), ((if spin then 1uy else 0uy), (protected_bits, ())) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Short, (| (), () |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header cid_len (S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body cid_len k) h0 _ out 0ul =\n LW.swrite_weaken (LP.strong_parser_kind 0 20 None) (LW.swrite_flbytes h0 out 0ul cid_len cid)\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body cid_len)\n (serialize_header_body cid_len)\n tg\n s\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet swrite_common_long\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter serialize_common_long h0 0 out 0ul {\n LW.swvalue w == (version, (FB.hide (B.as_seq h0 dcid), FB.hide (B.as_seq h0 scid)))\n })\n= LW.swrite_leaf LP.write_u32 h0 out 0ul version `LW.swrite_nondep_then` (\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 dcid_len dcid `LW.swrite_nondep_then`\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 scid_len scid\n )\n\ninline_for_extraction\nlet swrite_payload_and_pn_length\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem)\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _))\n: Tot (w: LW.swriter (serialize_payload_and_pn_length) h0 0 out 0ul {\n LW.swvalue w == payload_and_pn_length\n })\n= payload_and_pn_length_prop `LW.swrite_filter` LW.swrite_leaf (LP.leaf_writer_strong_of_serializer32 VI.write_varint ()) h0 out 0ul payload_and_pn_length\n\n#push-options \"--z3rlimit 128 --max_fuel 4 --initial_fuel 4\"\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_initial\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (token: B.buffer U8.t)\n (token_length: U32.t {\n let v = U32.v token_length in\n v == B.length token /\\\n 0 <= v /\\ v <= token_max_len\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid /\\\n B.live h0 token\n })\n (out: LP.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint ((B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) `B.loc_union` B.loc_buffer token) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PInitial (FB.hide (B.as_seq h0 token)) payload_and_pn_length)\n })\n= \n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| Initial, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PInitial (FB.hide (B.as_seq h0 token)) payload_and_pn_length)) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then` (\n LW.swrite_bounded_vlgenbytes h0 out 0ul 0 token_max_len (LP.leaf_writer_strong_of_serializer32 (VI.write_bounded_varint 0 token_max_len) ()) token_length token `LW.swrite_nondep_then`\n swrite_payload_and_pn_length payload_and_pn_length h0 out\n )\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_zeroRTT\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PZeroRTT payload_and_pn_length)\n })\n=\n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| ZeroRTT, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PZeroRTT payload_and_pn_length)) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then`\n swrite_payload_and_pn_length payload_and_pn_length h0 out\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_handshake\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PHandshake payload_and_pn_length)\n })\n= [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| Handshake, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PHandshake payload_and_pn_length)) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then`\n swrite_payload_and_pn_length payload_and_pn_length h0 out\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_retry\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (odcid: B.buffer U8.t)\n (odcid_len: U32.t {\n let len = U32.v odcid_len in\n len == B.length odcid /\\\n 0 <= len /\\ len <= 20\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid /\\\n B.live h0 odcid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint ((B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) `B.loc_union` B.loc_buffer odcid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PRetry (FB.hide (B.as_seq h0 odcid)))\n })\n= [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| Retry, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PRetry (FB.hide (B.as_seq h0 odcid)))) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 0 out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then`\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 odcid_len odcid\n in\n LW.swrite_bitsum\n h0\n 0\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s\n\n#pop-options\n\n#restart-solver\n\ninline_for_extraction\nval write_header_aux\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n (out: B.buffer U8.t)\n (out_len: U32.t { U32.v out_len <= B.length out })\n: HST.Stack U32.t\n (requires (fun h0 ->\n (PShort? h ==> PShort?.cid_len h == short_dcid_len) /\\\n header_live h h0 /\\\n B.live h0 out /\\\n B.loc_disjoint (header_footprint h) (B.loc_buffer out) /\\\n Seq.length (LP.serialize (serialize_header short_dcid_len) (set_protected_bits (g_header h h0) 0uy)) <= U32.v out_len\n ))\n (ensures (fun h0 len h1 ->\n let gh = set_protected_bits (g_header h h0) 0uy in\n let s = LP.serialize (serialize_header short_dcid_len) gh in\n U32.v len <= U32.v out_len /\\\n B.modifies (B.loc_buffer out) h0 h1 /\\\n Seq.slice (B.as_seq h1 out) 0 (U32.v len) == s \n ))\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet write_header_aux", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LW", "full_module": "LowParse.Low.Writers.Instances" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n h: QUIC.Impl.Header.Public.header ->\n out: LowStar.Buffer.buffer FStar.UInt8.t ->\n out_len: FStar.UInt32.t{FStar.UInt32.v out_len <= LowStar.Monotonic.Buffer.length out}\n -> FStar.HyperStack.ST.Stack FStar.UInt32.t", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Impl.Header.Public.header", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.unit", "LowParse.Low.Base.Spec.valid_exact_serialize", "LowParse.Slice.srel_of_buffer_srel", "LowParse.Bytes.byte", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "FStar.UInt32.__uint_to_t", "LowParse.Low.Base.Spec.valid_pos_valid_exact", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "QUIC.Spec.Base.secret_bitfield", "Prims.bool", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.op_GreaterThanOrEqual", "FStar.UInt.uint_t", "LowParse.Low.Writers.swrite", "QUIC.Impl.Header.Public.swrite_header_short", "FStar.UInt8.__uint_to_t", "QUIC.Impl.Header.Public.long_header_specifics", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Base.token_max_len", "QUIC.Impl.Header.Public.swrite_header_long_initial", "QUIC.Impl.Header.Public.swrite_header_long_zeroRTT", "QUIC.Impl.Header.Public.swrite_header_long_handshake", "Prims.op_Equality", "QUIC.Impl.Header.Public.swrite_header_long_retry", "LowParse.Low.Base.Spec.serialized_length_eq", "QUIC.Spec.Header.Public.set_protected_bits", "QUIC.Impl.Header.Public.g_header", "LowParse.Slice.slice", "LowParse.Slice.make_slice" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val write_header_aux\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n (out: B.buffer U8.t)\n (out_len: U32.t { U32.v out_len <= B.length out })\n: HST.Stack U32.t\n (requires (fun h0 ->\n (PShort? h ==> PShort?.cid_len h == short_dcid_len) /\\\n header_live h h0 /\\\n B.live h0 out /\\\n B.loc_disjoint (header_footprint h) (B.loc_buffer out) /\\\n Seq.length (LP.serialize (serialize_header short_dcid_len) (set_protected_bits (g_header h h0) 0uy)) <= U32.v out_len\n ))\n (ensures (fun h0 len h1 ->\n let gh = set_protected_bits (g_header h h0) 0uy in\n let s = LP.serialize (serialize_header short_dcid_len) gh in\n U32.v len <= U32.v out_len /\\\n B.modifies (B.loc_buffer out) h0 h1 /\\\n Seq.slice (B.as_seq h1 out) 0 (U32.v len) == s \n ))\nlet write_header_aux short_dcid_len h out out_len =", "completed_definiton": "let h0 = HST.get () in\nlet sl = LW.make_slice out out_len in\nLW.serialized_length_eq (serialize_header short_dcid_len) (set_protected_bits (g_header h h0) 0uy);\nlet len =\n match h with\n | PShort pb spin cid cid_len -> LW.swrite (swrite_header_short 0uy spin cid cid_len h0 sl) 0ul\n | PLong pb version dcid dcil scid scil spec ->\n match spec with\n | PInitial payload_and_pn_length token token_length ->\n LW.swrite (swrite_header_long_initial 0uy short_dcid_len version dcid dcil scid scil\n payload_and_pn_length token token_length h0 sl)\n 0ul\n | PZeroRTT payload_and_pn_length ->\n LW.swrite (swrite_header_long_zeroRTT 0uy short_dcid_len version dcid dcil scid scil\n payload_and_pn_length h0 sl)\n 0ul\n | PHandshake payload_and_pn_length ->\n LW.swrite (swrite_header_long_handshake 0uy short_dcid_len version dcid dcil scid scil\n payload_and_pn_length h0 sl)\n 0ul\n | PRetry odcid odcil ->\n LW.swrite (swrite_header_long_retry 0uy short_dcid_len version dcid dcil scid scil odcid odcil\n h0 sl)\n 0ul\nin\nlet h1 = HST.get () in\nLP.valid_pos_valid_exact (parse_header short_dcid_len) h1 sl 0ul len;\nLP.valid_exact_serialize (serialize_header short_dcid_len) h1 sl 0ul len;\nlen", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.swrite_header_short", "original_source_type": "val swrite_header_short\n (protected_bits: bitfield 5)\n (spin: bool)\n (cid: B.buffer U8.t)\n (cid_len:\n U32.t\n { let l = U32.v cid_len in\n l == B.length cid /\\ 0 <= l /\\ l <= 20 })\n (h0: HS.mem{B.live h0 cid})\n (out:\n LP.slice (B.trivial_preorder _) (B.trivial_preorder _)\n {B.loc_disjoint (B.loc_buffer cid) (LP.loc_slice_from out 0ul)})\n : Tot\n (w:\n LW.swriter (serialize_header cid_len) h0 0 out 0ul\n {LW.swvalue w == S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))})", "source_type": "val swrite_header_short\n (protected_bits: bitfield 5)\n (spin: bool)\n (cid: B.buffer U8.t)\n (cid_len:\n U32.t\n { let l = U32.v cid_len in\n l == B.length cid /\\ 0 <= l /\\ l <= 20 })\n (h0: HS.mem{B.live h0 cid})\n (out:\n LP.slice (B.trivial_preorder _) (B.trivial_preorder _)\n {B.loc_disjoint (B.loc_buffer cid) (LP.loc_slice_from out 0ul)})\n : Tot\n (w:\n LW.swriter (serialize_header cid_len) h0 0 out 0ul\n {LW.swvalue w == S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))})", "source_definition": "let swrite_header_short\n (protected_bits: bitfield 5)\n (spin: bool)\n (cid: B.buffer U8.t)\n (cid_len: U32.t {\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n })\n (h0: HS.mem {\n B.live h0 cid\n })\n (out: LP.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer cid) (LP.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header cid_len) h0 0 out 0ul {\n LW.swvalue w == S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))\n })\n= \n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Short, (| (), ((if spin then 1uy else 0uy), (protected_bits, ())) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Short, (| (), () |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header cid_len (S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body cid_len k) h0 _ out 0ul =\n LW.swrite_weaken (LP.strong_parser_kind 0 20 None) (LW.swrite_flbytes h0 out 0ul cid_len cid)\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body cid_len)\n (serialize_header_body cid_len)\n tg\n s", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 459, "start_col": 2, "end_line": 496, "end_col": 5 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) == (| Long, (| (), (| Retry, () |) |) |) );\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)\n\n#pop-options\n\nlet valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures (\n LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_initial_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0 sl pos\n\ninline_for_extraction\nlet read_payload_and_pn_length : LP.leaf_reader parse_payload_and_pn_length =\n LP.read_filter VI.read_varint payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Initial, () |) |) |) );\n valid_long_initial_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len)) (parse_payload_and_pn_length) sl pos3;\n let token = LP.get_bounded_vlgenbytes_contents 0 token_max_len (VI.read_bounded_varint 0 token_max_len) (VI.jump_bounded_varint 0 token_max_len) sl pos3 in\n let token_len = LP.bounded_vlgenbytes_payload_length 0 token_max_len (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let pos4 = LP.jump_bounded_vlgenbytes 0 token_max_len (VI.jump_bounded_varint 0 token_max_len) (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos4 in\n let spec = PInitial (payload_and_pn_length) token token_len in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures (\n LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_handshake_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` VI.parse_varint)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_handshake\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Handshake, () |) |) |) );\n valid_long_handshake_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PHandshake payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_zero_rtt_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_zero_rtt_body h0 sl pos))\n (ensures (\n LP.valid parse_long_zero_rtt_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_zero_rtt_body h0 sl pos)\n (LP.get_valid_pos parse_long_zero_rtt_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_zero_rtt_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_zero_rtt\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) == (| Long, (| (), (| ZeroRTT, () |) |) |) );\n valid_long_zero_rtt_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PZeroRTT payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet read_header_body\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (read_header_body_t sl cid_len tg)\n= fun len ->\n let h0 = HST.get () in\n match tg with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n read_header_body_short sl cid_len spin protected_bits len\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n read_header_body_long_retry sl cid_len protected_bits len\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n read_header_body_long_initial sl cid_len protected_bits len\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n read_header_body_long_handshake sl cid_len protected_bits len\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n read_header_body_long_zero_rtt sl cid_len protected_bits len\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --fuel 4 --ifuel 4 --query_stats\"\n\nlet read_header packet packet_len cid_len =\n let h0 = HST.get () in\n let sl = LP.make_slice packet packet_len in\n LP.valid_facts (parse_header cid_len) h0 sl 0ul;\n assert_spinoff (B.as_seq h0 packet `Seq.equal` LP.bytes_of_slice_from h0 sl 0ul);\n assert_norm (\n let k = parse_header_kind cid_len in\n Some? k.LP.parser_kind_high /\\\n k.LP.parser_kind_subkind == Some LP.ParserStrong\n );\n begin\n LPB.valid_bitsum_elim\n #LP.parse_u8_kind\n #8\n #U8.t\n #LPB.uint8\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n LP.parse_u8\n (parse_header_body cid_len)\n h0\n sl\n 0ul;\n let r = LP.read_u8 sl 0ul in\n let res = destr_first_byte\n (read_header_body_t sl cid_len)\n (fun _ cond dt df len' -> if cond then dt () len' else df () len')\n (read_header_body sl cid_len)\n r\n ()\n in\n res\n end\n\n#pop-options\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet synth_first_byte\n: (LPB.synth_bitsum'_recip_t first_byte)\n=\n (LPB.mk_synth_bitsum'_recip first_byte)\n\nmodule LW = LowParse.Low.Writers.Instances\n\n#push-options \"--z3rlimit 64 --max_fuel 4 --initial_fuel 4\"\n\ninline_for_extraction\nnoextract\nlet swrite_header_short\n (protected_bits: bitfield 5)\n (spin: bool)\n (cid: B.buffer U8.t)\n (cid_len: U32.t {\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n })\n (h0: HS.mem {\n B.live h0 cid\n })\n (out: LP.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer cid) (LP.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header cid_len) h0 0 out 0ul {\n LW.swvalue w == S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))\n })", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LW", "full_module": "LowParse.Low.Writers.Instances" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 4, "max_fuel": 4, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n protected_bits: QUIC.Spec.Base.bitfield 5 ->\n spin: Prims.bool ->\n cid: LowStar.Buffer.buffer FStar.UInt8.t ->\n cid_len:\n FStar.UInt32.t\n { let l = FStar.UInt32.v cid_len in\n l == LowStar.Monotonic.Buffer.length cid /\\ 0 <= l /\\ l <= 20 } ->\n h0: FStar.Monotonic.HyperStack.mem{LowStar.Monotonic.Buffer.live h0 cid} ->\n out:\n LowParse.Slice.slice (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n { LowStar.Monotonic.Buffer.loc_disjoint (LowStar.Monotonic.Buffer.loc_buffer cid)\n (LowParse.Slice.loc_slice_from out 0ul) }\n -> w:\n LowParse.Low.Writers.swriter (QUIC.Spec.Header.Public.serialize_header cid_len) h0 0 out 0ul\n { LowParse.Low.Writers.swvalue w ==\n QUIC.Spec.Header.Public.PShort protected_bits\n spin\n (FStar.Bytes.hide (LowStar.Monotonic.Buffer.as_seq h0 cid)) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bitfield", "Prims.bool", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.op_LessThanOrEqual", "FStar.UInt.uint_t", "FStar.UInt32.v", "FStar.Monotonic.HyperStack.mem", "LowStar.Monotonic.Buffer.live", "LowParse.Slice.slice", "LowParse.Bytes.byte", "LowStar.Monotonic.Buffer.loc_disjoint", "LowStar.Monotonic.Buffer.loc_buffer", "LowParse.Slice.loc_slice_from", "FStar.UInt32.__uint_to_t", "LowParse.Low.Writers.Instances.swrite_bitsum", "LowParse.Spec.Int.parse_u8_kind", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.first_byte_of_header", "QUIC.Spec.Header.Public.header_body_type", "QUIC.Spec.Header.Public.header_synth", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "LowParse.Low.Int.write_u8", "QUIC.Impl.Header.Public.synth_first_byte", "QUIC.Spec.Header.Public.parse_header_body", "QUIC.Spec.Header.Public.serialize_header_body", "LowParse.Low.Writers.swriter", "Prims.__proj__Mkdtuple2__item___1", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.parser", "FStar.Pervasives.dsnd", "FStar.UInt32.uint_to_t", "LowParse.Low.Writers.Instances.swrite_weaken", "LowParse.Spec.Base.total_constant_size_parser_kind", "FStar.Bytes.lbytes", "LowParse.Spec.Bytes.parse_flbytes", "LowParse.Spec.Bytes.serialize_flbytes", "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some", "LowParse.Low.Writers.Instances.swrite_flbytes", "Prims.unit", "FStar.Pervasives.assert_norm", "LowParse.Spec.BitSum.bitsum'_type", "QUIC.Spec.Header.Public.PShort", "FStar.Bytes.hide", "LowStar.Monotonic.Buffer.as_seq", "LowParse.Spec.BitSum.bitsum'_key_type", "LowParse.Spec.BitSum.bitsum'_key_of_t", "Prims.Mkdtuple2", "LowParse.Spec.Enum.enum_key", "QUIC.Spec.Header.Public.header_form_t", "LowParse.BitFields.bitfield", "QUIC.Spec.Header.Public.header_form", "Prims.op_Subtraction", "LowParse.Spec.BitSum.BitSum'", "QUIC.Spec.Header.Public.fixed_bit", "LowParse.Spec.BitSum.BitField", "LowParse.Spec.BitSum.BitStop", "LowParse.Spec.BitSum.bitsum'", "QUIC.Spec.Header.Public.long_packet_type_t", "QUIC.Spec.Header.Public.long_packet_type", "QUIC.Spec.Header.Public.Short", "LowParse.Spec.BitSum.bitsum'_type'", "FStar.Pervasives.Native.Mktuple2", "FStar.UInt8.__uint_to_t", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "QUIC.Spec.Header.Public.header", "LowParse.Low.Writers.swvalue" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val swrite_header_short\n (protected_bits: bitfield 5)\n (spin: bool)\n (cid: B.buffer U8.t)\n (cid_len:\n U32.t\n { let l = U32.v cid_len in\n l == B.length cid /\\ 0 <= l /\\ l <= 20 })\n (h0: HS.mem{B.live h0 cid})\n (out:\n LP.slice (B.trivial_preorder _) (B.trivial_preorder _)\n {B.loc_disjoint (B.loc_buffer cid) (LP.loc_slice_from out 0ul)})\n : Tot\n (w:\n LW.swriter (serialize_header cid_len) h0 0 out 0ul\n {LW.swvalue w == S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))})\nlet swrite_header_short\n (protected_bits: bitfield 5)\n (spin: bool)\n (cid: B.buffer U8.t)\n (cid_len:\n U32.t\n { let l = U32.v cid_len in\n l == B.length cid /\\ 0 <= l /\\ l <= 20 })\n (h0: HS.mem{B.live h0 cid})\n (out:\n LP.slice (B.trivial_preorder _) (B.trivial_preorder _)\n {B.loc_disjoint (B.loc_buffer cid) (LP.loc_slice_from out 0ul)})\n : Tot\n (w:\n LW.swriter (serialize_header cid_len) h0 0 out 0ul\n {LW.swvalue w == S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))}) =", "completed_definiton": "[@@ inline_let ]let tg:LPB.bitsum'_type first_byte =\n (| Short, (| (), ((if spin then 1uy else 0uy), (protected_bits, ())) |) |)\nin\n[@@ inline_let ]let k:LPB.bitsum'_key_type first_byte = (| Short, (| (), () |) |) in\n[@@ inline_let ]let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header cid_len\n (S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))) ==\n tg)\nin\n[@@ inline_let ]let s:LW.swriter (serialize_header_body cid_len k) h0 _ out 0ul =\n LW.swrite_weaken (LP.strong_parser_kind 0 20 None) (LW.swrite_flbytes h0 out 0ul cid_len cid)\nin\nLW.swrite_bitsum h0 _ out 0ul #LP.parse_u8_kind #8 #U8.t first_byte #(header' cid_len)\n (first_byte_of_header cid_len) (header_body_type cid_len) (header_synth cid_len) #LP.parse_u8\n #LP.serialize_u8 LP.write_u8 synth_first_byte #(parse_header_body cid_len)\n (serialize_header_body cid_len) tg s", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.read_header", "original_source_type": "val read_header\n (packet: B.buffer U8.t)\n (packet_len: U32.t { let v = U32.v packet_len in v == B.length packet })\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n: HST.Stack header\n (requires (fun h ->\n B.live h packet /\\\n Some? (LP.parse (parse_header cid_len) (B.as_seq h packet))\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin\n let Some (x, len) = LP.parse (parse_header cid_len) (B.as_seq h packet) in\n header_live res h' /\\\n len <= B.length packet /\\\n B.loc_buffer (B.gsub packet 0ul (U32.uint_to_t len)) `B.loc_includes` header_footprint res /\\\n g_header res h' == x\n end\n ))", "source_type": "val read_header\n (packet: B.buffer U8.t)\n (packet_len: U32.t { let v = U32.v packet_len in v == B.length packet })\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n: HST.Stack header\n (requires (fun h ->\n B.live h packet /\\\n Some? (LP.parse (parse_header cid_len) (B.as_seq h packet))\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin\n let Some (x, len) = LP.parse (parse_header cid_len) (B.as_seq h packet) in\n header_live res h' /\\\n len <= B.length packet /\\\n B.loc_buffer (B.gsub packet 0ul (U32.uint_to_t len)) `B.loc_includes` header_footprint res /\\\n g_header res h' == x\n end\n ))", "source_definition": "let read_header packet packet_len cid_len =\n let h0 = HST.get () in\n let sl = LP.make_slice packet packet_len in\n LP.valid_facts (parse_header cid_len) h0 sl 0ul;\n assert_spinoff (B.as_seq h0 packet `Seq.equal` LP.bytes_of_slice_from h0 sl 0ul);\n assert_norm (\n let k = parse_header_kind cid_len in\n Some? k.LP.parser_kind_high /\\\n k.LP.parser_kind_subkind == Some LP.ParserStrong\n );\n begin\n LPB.valid_bitsum_elim\n #LP.parse_u8_kind\n #8\n #U8.t\n #LPB.uint8\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n LP.parse_u8\n (parse_header_body cid_len)\n h0\n sl\n 0ul;\n let r = LP.read_u8 sl 0ul in\n let res = destr_first_byte\n (read_header_body_t sl cid_len)\n (fun _ cond dt df len' -> if cond then dt () len' else df () len')\n (read_header_body sl cid_len)\n r\n ()\n in\n res\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 387, "start_col": 43, "end_line": 422, "end_col": 5 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) == (| Long, (| (), (| Retry, () |) |) |) );\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)\n\n#pop-options\n\nlet valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures (\n LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_initial_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0 sl pos\n\ninline_for_extraction\nlet read_payload_and_pn_length : LP.leaf_reader parse_payload_and_pn_length =\n LP.read_filter VI.read_varint payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Initial, () |) |) |) );\n valid_long_initial_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len)) (parse_payload_and_pn_length) sl pos3;\n let token = LP.get_bounded_vlgenbytes_contents 0 token_max_len (VI.read_bounded_varint 0 token_max_len) (VI.jump_bounded_varint 0 token_max_len) sl pos3 in\n let token_len = LP.bounded_vlgenbytes_payload_length 0 token_max_len (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let pos4 = LP.jump_bounded_vlgenbytes 0 token_max_len (VI.jump_bounded_varint 0 token_max_len) (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos4 in\n let spec = PInitial (payload_and_pn_length) token token_len in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures (\n LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_handshake_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` VI.parse_varint)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_handshake\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Handshake, () |) |) |) );\n valid_long_handshake_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PHandshake payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_zero_rtt_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_zero_rtt_body h0 sl pos))\n (ensures (\n LP.valid parse_long_zero_rtt_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_zero_rtt_body h0 sl pos)\n (LP.get_valid_pos parse_long_zero_rtt_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_zero_rtt_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_zero_rtt\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) == (| Long, (| (), (| ZeroRTT, () |) |) |) );\n valid_long_zero_rtt_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PZeroRTT payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet read_header_body\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (read_header_body_t sl cid_len tg)\n= fun len ->\n let h0 = HST.get () in\n match tg with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n read_header_body_short sl cid_len spin protected_bits len\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n read_header_body_long_retry sl cid_len protected_bits len\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n read_header_body_long_initial sl cid_len protected_bits len\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n read_header_body_long_handshake sl cid_len protected_bits len\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n read_header_body_long_zero_rtt sl cid_len protected_bits len\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --fuel 4 --ifuel 4 --query_stats\"", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 4, "max_fuel": 4, "initial_ifuel": 4, "max_ifuel": 4, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 1024, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n packet: LowStar.Buffer.buffer FStar.UInt8.t ->\n packet_len:\n FStar.UInt32.t\n { let v = FStar.UInt32.v packet_len in\n v == LowStar.Monotonic.Buffer.length packet } ->\n cid_len: FStar.UInt32.t{FStar.UInt32.v cid_len <= 20}\n -> FStar.HyperStack.ST.Stack QUIC.Impl.Header.Public.header", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "FStar.UInt.uint_t", "FStar.UInt32.v", "Prims.op_LessThanOrEqual", "QUIC.Impl.Header.Public.header", "QUIC.Impl.Header.Public.destr_first_byte", "QUIC.Impl.Header.Public.read_header_body_t", "FStar.Ghost.erased", "LowParse.Spec.BitSum.bitsum'_type", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "Prims.bool", "LowParse.Spec.Combinators.cond_true", "FStar.Ghost.reveal", "LowParse.Spec.Combinators.cond_false", "Prims.unit", "QUIC.Impl.Header.Public.read_header_body", "LowParse.Low.Int.read_u8", "LowParse.Slice.srel_of_buffer_srel", "LowParse.Bytes.byte", "FStar.UInt32.__uint_to_t", "LowParse.Low.BitSum.valid_bitsum_elim", "LowParse.Spec.Int.parse_u8_kind", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.first_byte_of_header", "QUIC.Spec.Header.Public.header_body_type", "QUIC.Spec.Header.Public.header_synth", "LowParse.Spec.Int.parse_u8", "QUIC.Spec.Header.Public.parse_header_body", "FStar.Pervasives.assert_norm", "Prims.l_and", "FStar.Pervasives.Native.uu___is_Some", "Prims.nat", "LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_high", "FStar.Pervasives.Native.option", "LowParse.Spec.Base.parser_subkind", "LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_subkind", "FStar.Pervasives.Native.Some", "LowParse.Spec.Base.ParserStrong", "LowParse.Spec.Base.parser_kind", "Prims.op_GreaterThan", "LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_low", "Prims.l_False", "Prims.op_LessThan", "Prims.op_Addition", "QUIC.Spec.Base.header_len_bound", "QUIC.Spec.Header.Public.parse_header_kind", "FStar.Pervasives.assert_spinoff", "FStar.Seq.Base.equal", "LowStar.Monotonic.Buffer.as_seq", "LowParse.Slice.bytes_of_slice_from", "LowParse.Low.Base.Spec.valid_facts", "QUIC.Spec.Header.Public.parse_header", "LowParse.Slice.slice", "LowParse.Slice.make_slice", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_header\n (packet: B.buffer U8.t)\n (packet_len: U32.t { let v = U32.v packet_len in v == B.length packet })\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n: HST.Stack header\n (requires (fun h ->\n B.live h packet /\\\n Some? (LP.parse (parse_header cid_len) (B.as_seq h packet))\n ))\n (ensures (fun h res h' ->\n B.modifies B.loc_none h h' /\\\n begin\n let Some (x, len) = LP.parse (parse_header cid_len) (B.as_seq h packet) in\n header_live res h' /\\\n len <= B.length packet /\\\n B.loc_buffer (B.gsub packet 0ul (U32.uint_to_t len)) `B.loc_includes` header_footprint res /\\\n g_header res h' == x\n end\n ))\nlet read_header packet packet_len cid_len =", "completed_definiton": "let h0 = HST.get () in\nlet sl = LP.make_slice packet packet_len in\nLP.valid_facts (parse_header cid_len) h0 sl 0ul;\nassert_spinoff ((B.as_seq h0 packet) `Seq.equal` (LP.bytes_of_slice_from h0 sl 0ul));\nassert_norm (let k = parse_header_kind cid_len in\n Some? k.LP.parser_kind_high /\\ k.LP.parser_kind_subkind == Some LP.ParserStrong);\nLPB.valid_bitsum_elim #LP.parse_u8_kind #8 #U8.t #LPB.uint8 first_byte #(header' cid_len)\n (first_byte_of_header cid_len) (header_body_type cid_len) (header_synth cid_len) LP.parse_u8\n (parse_header_body cid_len) h0 sl 0ul;\nlet r = LP.read_u8 sl 0ul in\nlet res =\n destr_first_byte (read_header_body_t sl cid_len)\n (fun _ cond dt df len' -> if cond then dt () len' else df () len')\n (read_header_body sl cid_len)\n r\n ()\nin\nres", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.write_header", "original_source_type": "val write_header\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n (out: B.buffer U8.t)\n (out_len: U32.t { U32.v out_len <= B.length out })\n: HST.Stack U32.t\n (requires (fun h0 ->\n (PShort? h ==> PShort?.cid_len h == short_dcid_len) /\\\n header_live h h0 /\\\n B.live h0 out /\\\n B.loc_disjoint (header_footprint h) (B.loc_buffer out) /\\\n Seq.length (LP.serialize (serialize_header short_dcid_len) (g_header h h0)) <= U32.v out_len\n ))\n (ensures (fun h0 len h1 ->\n let gh = g_header h h0 in\n let s = LP.serialize (serialize_header short_dcid_len) gh in\n B.modifies (B.loc_buffer out) h0 h1 /\\\n U32.v len <= U32.v out_len /\\\n Seq.slice (B.as_seq h1 out) 0 (U32.v len) == s \n ))", "source_type": "val write_header\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n (out: B.buffer U8.t)\n (out_len: U32.t { U32.v out_len <= B.length out })\n: HST.Stack U32.t\n (requires (fun h0 ->\n (PShort? h ==> PShort?.cid_len h == short_dcid_len) /\\\n header_live h h0 /\\\n B.live h0 out /\\\n B.loc_disjoint (header_footprint h) (B.loc_buffer out) /\\\n Seq.length (LP.serialize (serialize_header short_dcid_len) (g_header h h0)) <= U32.v out_len\n ))\n (ensures (fun h0 len h1 ->\n let gh = g_header h h0 in\n let s = LP.serialize (serialize_header short_dcid_len) gh in\n B.modifies (B.loc_buffer out) h0 h1 /\\\n U32.v len <= U32.v out_len /\\\n Seq.slice (B.as_seq h1 out) 0 (U32.v len) == s \n ))", "source_definition": "let write_header\n short_dcid_len h out out_len\n=\n let h0 = HST.get () in\n let pb = get_pb h in\n serialize_set_protected_bits short_dcid_len (g_header h h0) 0uy;\n assert (Seq.length (LP.serialize (serialize_header short_dcid_len) (set_protected_bits (g_header h h0) 0uy)) == Seq.length (LP.serialize (serialize_header short_dcid_len) (g_header h h0)));\n let len = write_header_aux short_dcid_len h out out_len in\n let h1 = HST.get () in\n let f () : Lemma (\n let s = Seq.slice (B.as_seq h1 out) 0 (U32.v len) in\n Seq.length s > 0 /\\\n LP.serialize (serialize_header short_dcid_len) (g_header h h0) ==\n LPB.uint8.LPB.set_bitfield (Seq.head s) 0 (if PShort? h then 5 else 4) (U8.uint_to_t (Secret.v pb) <: U8.t) `Seq.cons` Seq.tail s\n )\n =\n get_pb_complete h h0;\n serialize_set_protected_bits short_dcid_len (set_protected_bits (g_header h h0) 0uy) (U8.uint_to_t (Secret.v pb) <: U8.t)\n in\n f ();\n let post\n ()\n (contl: Seq.lseq U8.t 0)\n (cont: Seq.lseq U8.t (U32.v len))\n (contr: Seq.lseq U8.t (B.length out - U32.v len))\n (m: HS.mem)\n : GTot Type0\n =\n let s = Seq.slice (B.as_seq h1 out) 0 (U32.v len) in\n Seq.length s > 0 /\\\n cont `Seq.equal` (LPB.uint8.LPB.set_bitfield (Seq.head s) 0 (if PShort? h then 5 else 4) (U8.uint_to_t (Secret.v pb) <: U8.t) `Seq.cons` Seq.tail s)\n in\n SecretBuffer.with_buffer_hide\n #unit\n out\n 0ul\n len\n h1\n B.loc_none\n B.loc_none\n 1ul 0ul 0ul 1ul 1ul 0ul\n post\n (fun _ bl bs br ->\n let x = B.index bs 0ul in\n let y =\n if PShort? h\n then Secret.set_bitfield #Secret.U8 x 0ul 5ul pb\n else Secret.set_bitfield #Secret.U8 x 0ul 4ul pb\n in\n assert (\n let s = Seq.slice (B.as_seq h1 out) 0 (U32.v len) in\n Secret.reveal #Secret.U8 y == LPB.uint8.LPB.set_bitfield (Seq.head s) 0 (if PShort? h then 5 else 4) (U8.uint_to_t (Secret.v pb) <: U8.t)\n );\n SecretBuffer.buffer_update_strong bs 0ul y;\n let h2 = HST.get () in\n assert (\n let s = Seq.slice (B.as_seq h1 out) 0 (U32.v len) in\n Seq.length s > 0 /\\\n B.as_seq h2 bs `Seq.equal` Seq.cons y (Seq.tail (Seq.seq_hide #Secret.U8 s))\n )\n )\n ;\n len", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 928, "start_col": 1, "end_line": 988, "end_col": 5 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) == (| Long, (| (), (| Retry, () |) |) |) );\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)\n\n#pop-options\n\nlet valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures (\n LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_initial_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0 sl pos\n\ninline_for_extraction\nlet read_payload_and_pn_length : LP.leaf_reader parse_payload_and_pn_length =\n LP.read_filter VI.read_varint payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Initial, () |) |) |) );\n valid_long_initial_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len)) (parse_payload_and_pn_length) sl pos3;\n let token = LP.get_bounded_vlgenbytes_contents 0 token_max_len (VI.read_bounded_varint 0 token_max_len) (VI.jump_bounded_varint 0 token_max_len) sl pos3 in\n let token_len = LP.bounded_vlgenbytes_payload_length 0 token_max_len (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let pos4 = LP.jump_bounded_vlgenbytes 0 token_max_len (VI.jump_bounded_varint 0 token_max_len) (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos4 in\n let spec = PInitial (payload_and_pn_length) token token_len in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures (\n LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_handshake_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` VI.parse_varint)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_handshake\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Handshake, () |) |) |) );\n valid_long_handshake_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PHandshake payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_zero_rtt_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_zero_rtt_body h0 sl pos))\n (ensures (\n LP.valid parse_long_zero_rtt_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_zero_rtt_body h0 sl pos)\n (LP.get_valid_pos parse_long_zero_rtt_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_zero_rtt_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_zero_rtt\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) == (| Long, (| (), (| ZeroRTT, () |) |) |) );\n valid_long_zero_rtt_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PZeroRTT payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet read_header_body\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (read_header_body_t sl cid_len tg)\n= fun len ->\n let h0 = HST.get () in\n match tg with\n | (| Short, (| (), (spin, (protected_bits, ())) |) |) ->\n read_header_body_short sl cid_len spin protected_bits len\n | (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ->\n read_header_body_long_retry sl cid_len protected_bits len\n | (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ->\n read_header_body_long_initial sl cid_len protected_bits len\n | (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ->\n read_header_body_long_handshake sl cid_len protected_bits len\n | (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ->\n read_header_body_long_zero_rtt sl cid_len protected_bits len\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --fuel 4 --ifuel 4 --query_stats\"\n\nlet read_header packet packet_len cid_len =\n let h0 = HST.get () in\n let sl = LP.make_slice packet packet_len in\n LP.valid_facts (parse_header cid_len) h0 sl 0ul;\n assert_spinoff (B.as_seq h0 packet `Seq.equal` LP.bytes_of_slice_from h0 sl 0ul);\n assert_norm (\n let k = parse_header_kind cid_len in\n Some? k.LP.parser_kind_high /\\\n k.LP.parser_kind_subkind == Some LP.ParserStrong\n );\n begin\n LPB.valid_bitsum_elim\n #LP.parse_u8_kind\n #8\n #U8.t\n #LPB.uint8\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n LP.parse_u8\n (parse_header_body cid_len)\n h0\n sl\n 0ul;\n let r = LP.read_u8 sl 0ul in\n let res = destr_first_byte\n (read_header_body_t sl cid_len)\n (fun _ cond dt df len' -> if cond then dt () len' else df () len')\n (read_header_body sl cid_len)\n r\n ()\n in\n res\n end\n\n#pop-options\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet synth_first_byte\n: (LPB.synth_bitsum'_recip_t first_byte)\n=\n (LPB.mk_synth_bitsum'_recip first_byte)\n\nmodule LW = LowParse.Low.Writers.Instances\n\n#push-options \"--z3rlimit 64 --max_fuel 4 --initial_fuel 4\"\n\ninline_for_extraction\nnoextract\nlet swrite_header_short\n (protected_bits: bitfield 5)\n (spin: bool)\n (cid: B.buffer U8.t)\n (cid_len: U32.t {\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n })\n (h0: HS.mem {\n B.live h0 cid\n })\n (out: LP.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer cid) (LP.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header cid_len) h0 0 out 0ul {\n LW.swvalue w == S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))\n })\n= \n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Short, (| (), ((if spin then 1uy else 0uy), (protected_bits, ())) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Short, (| (), () |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header cid_len (S.PShort protected_bits spin (FB.hide (B.as_seq h0 cid))) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body cid_len k) h0 _ out 0ul =\n LW.swrite_weaken (LP.strong_parser_kind 0 20 None) (LW.swrite_flbytes h0 out 0ul cid_len cid)\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' cid_len)\n (first_byte_of_header cid_len)\n (header_body_type cid_len)\n (header_synth cid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body cid_len)\n (serialize_header_body cid_len)\n tg\n s\n\n#pop-options\n\ninline_for_extraction\nnoextract\nlet swrite_common_long\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter serialize_common_long h0 0 out 0ul {\n LW.swvalue w == (version, (FB.hide (B.as_seq h0 dcid), FB.hide (B.as_seq h0 scid)))\n })\n= LW.swrite_leaf LP.write_u32 h0 out 0ul version `LW.swrite_nondep_then` (\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 dcid_len dcid `LW.swrite_nondep_then`\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 scid_len scid\n )\n\ninline_for_extraction\nlet swrite_payload_and_pn_length\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem)\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _))\n: Tot (w: LW.swriter (serialize_payload_and_pn_length) h0 0 out 0ul {\n LW.swvalue w == payload_and_pn_length\n })\n= payload_and_pn_length_prop `LW.swrite_filter` LW.swrite_leaf (LP.leaf_writer_strong_of_serializer32 VI.write_varint ()) h0 out 0ul payload_and_pn_length\n\n#push-options \"--z3rlimit 128 --max_fuel 4 --initial_fuel 4\"\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_initial\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (token: B.buffer U8.t)\n (token_length: U32.t {\n let v = U32.v token_length in\n v == B.length token /\\\n 0 <= v /\\ v <= token_max_len\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid /\\\n B.live h0 token\n })\n (out: LP.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint ((B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) `B.loc_union` B.loc_buffer token) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PInitial (FB.hide (B.as_seq h0 token)) payload_and_pn_length)\n })\n= \n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| Initial, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PInitial (FB.hide (B.as_seq h0 token)) payload_and_pn_length)) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then` (\n LW.swrite_bounded_vlgenbytes h0 out 0ul 0 token_max_len (LP.leaf_writer_strong_of_serializer32 (VI.write_bounded_varint 0 token_max_len) ()) token_length token `LW.swrite_nondep_then`\n swrite_payload_and_pn_length payload_and_pn_length h0 out\n )\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_zeroRTT\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PZeroRTT payload_and_pn_length)\n })\n=\n [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| ZeroRTT, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PZeroRTT payload_and_pn_length)) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then`\n swrite_payload_and_pn_length payload_and_pn_length h0 out\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_handshake\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (payload_and_pn_length: payload_and_pn_length_t)\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PHandshake payload_and_pn_length)\n })\n= [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| Handshake, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PHandshake payload_and_pn_length)) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 _ out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then`\n swrite_payload_and_pn_length payload_and_pn_length h0 out\n in\n LW.swrite_bitsum\n h0\n _\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s\n\ninline_for_extraction\nnoextract\nlet swrite_header_long_retry\n (protected_bits: bitfield 4)\n (short_dcid_len: short_dcid_len_t)\n (version: U32.t)\n (dcid: B.buffer U8.t)\n (dcid_len: U32.t {\n let len = U32.v dcid_len in\n len == B.length dcid /\\\n 0 <= len /\\ len <= 20\n })\n (scid: B.buffer U8.t)\n (scid_len: U32.t {\n let len = U32.v scid_len in\n len == B.length scid /\\\n 0 <= len /\\ len <= 20\n })\n (odcid: B.buffer U8.t)\n (odcid_len: U32.t {\n let len = U32.v odcid_len in\n len == B.length odcid /\\\n 0 <= len /\\ len <= 20\n })\n (h0: HS.mem {\n B.live h0 dcid /\\\n B.live h0 scid /\\\n B.live h0 odcid\n })\n (out: LW.slice (B.trivial_preorder _) (B.trivial_preorder _) {\n B.loc_disjoint ((B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) `B.loc_union` B.loc_buffer odcid) (LW.loc_slice_from out 0ul)\n })\n: Tot (w: LW.swriter (serialize_header short_dcid_len) h0 0 out 0ul {\n LW.swvalue w == S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PRetry (FB.hide (B.as_seq h0 odcid)))\n })\n= [@inline_let]\n let tg : LPB.bitsum'_type first_byte =\n (| Long, (| (), (| Retry, (protected_bits, () ) |) |) |)\n in\n [@inline_let]\n let k : LPB.bitsum'_key_type first_byte =\n (| Long, (| (), (| Retry, () |) |) |)\n in\n [@inline_let]\n let _ =\n assert_norm (LPB.bitsum'_key_of_t first_byte tg == k);\n assert_norm (first_byte_of_header short_dcid_len (S.PLong protected_bits version (FB.hide (B.as_seq h0 dcid)) (FB.hide (B.as_seq h0 scid)) (S.PRetry (FB.hide (B.as_seq h0 odcid)))) == tg)\n in\n [@inline_let]\n let s : LW.swriter (serialize_header_body short_dcid_len k) h0 0 out 0ul =\n swrite_common_long version dcid dcid_len scid scid_len h0 out `LW.swrite_nondep_then`\n LW.swrite_bounded_vlbytes h0 out 0ul 0 20 odcid_len odcid\n in\n LW.swrite_bitsum\n h0\n 0\n out\n 0ul\n #LP.parse_u8_kind\n #8\n #U8.t\n first_byte\n #(header' short_dcid_len)\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n #LP.parse_u8\n #LP.serialize_u8\n LP.write_u8\n synth_first_byte\n #(parse_header_body short_dcid_len)\n (serialize_header_body short_dcid_len)\n tg\n s\n\n#pop-options\n\n#restart-solver\n\ninline_for_extraction\nval write_header_aux\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n (out: B.buffer U8.t)\n (out_len: U32.t { U32.v out_len <= B.length out })\n: HST.Stack U32.t\n (requires (fun h0 ->\n (PShort? h ==> PShort?.cid_len h == short_dcid_len) /\\\n header_live h h0 /\\\n B.live h0 out /\\\n B.loc_disjoint (header_footprint h) (B.loc_buffer out) /\\\n Seq.length (LP.serialize (serialize_header short_dcid_len) (set_protected_bits (g_header h h0) 0uy)) <= U32.v out_len\n ))\n (ensures (fun h0 len h1 ->\n let gh = set_protected_bits (g_header h h0) 0uy in\n let s = LP.serialize (serialize_header short_dcid_len) gh in\n U32.v len <= U32.v out_len /\\\n B.modifies (B.loc_buffer out) h0 h1 /\\\n Seq.slice (B.as_seq h1 out) 0 (U32.v len) == s \n ))\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet write_header_aux\n short_dcid_len h out out_len\n= let h0 = HST.get () in\n let sl = LW.make_slice out out_len in\n LW.serialized_length_eq (serialize_header short_dcid_len) (set_protected_bits (g_header h h0) 0uy);\n let len = match h with\n | PShort pb spin cid cid_len ->\n LW.swrite (swrite_header_short 0uy spin cid cid_len h0 sl) 0ul\n | PLong pb version dcid dcil scid scil spec ->\n begin match spec with\n | PInitial payload_and_pn_length token token_length ->\n LW.swrite (swrite_header_long_initial 0uy short_dcid_len version dcid dcil scid scil payload_and_pn_length token token_length h0 sl) 0ul\n | PZeroRTT payload_and_pn_length ->\n LW.swrite (swrite_header_long_zeroRTT 0uy short_dcid_len version dcid dcil scid scil payload_and_pn_length h0 sl) 0ul\n | PHandshake payload_and_pn_length ->\n LW.swrite (swrite_header_long_handshake 0uy short_dcid_len version dcid dcil scid scil payload_and_pn_length h0 sl) 0ul\n | PRetry odcid odcil ->\n LW.swrite (swrite_header_long_retry 0uy short_dcid_len version dcid dcil scid scil odcid odcil h0 sl) 0ul\n end\n in\n let h1 = HST.get () in\n LP.valid_pos_valid_exact (parse_header short_dcid_len) h1 sl 0ul len;\n LP.valid_exact_serialize (serialize_header short_dcid_len) h1 sl 0ul len;\n len\n\n#pop-options\n\nlet get_pb\n (h: header)\n: Tot (secret_bitfield (if PShort? h then 5 else 4))\n= \n match h with\n | PShort pb spin cid cid_len ->\n pb\n | PLong pb version dcid dcil scid scil spec ->\n pb\n\nlet get_pb_correct\n (h: header)\n (m: HS.mem)\n: Lemma\n (ensures (Secret.v (get_pb h) == U8.v (get_protected_bits (g_header h m))))\n= ()\n\nlet get_pb_complete\n (h: header)\n (m: HS.mem)\n: Lemma\n (set_protected_bits (set_protected_bits (g_header h m) 0uy) (U8.uint_to_t (Secret.v (get_pb h))) == g_header h m)\n= ()\n\nmodule SecretBuffer = QUIC.Secret.Buffer\nmodule Seq = QUIC.Secret.Seq\n\n#pop-options\n\n#push-options \"--z3rlimit 128 --query_stats\"\n\n#restart-solver\n\nlet write_header", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "LW", "full_module": "LowParse.Low.Writers.Instances" }, { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n h: QUIC.Impl.Header.Public.header ->\n out: LowStar.Buffer.buffer FStar.UInt8.t ->\n out_len: FStar.UInt32.t{FStar.UInt32.v out_len <= LowStar.Monotonic.Buffer.length out}\n -> FStar.HyperStack.ST.Stack FStar.UInt32.t", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Impl.Header.Public.header", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.unit", "QUIC.Secret.Buffer.with_buffer_hide", "FStar.UInt32.__uint_to_t", "FStar.Ghost.hide", "LowStar.Monotonic.Buffer.loc", "LowStar.Monotonic.Buffer.loc_none", "FStar.Ghost.erased", "Prims.eq2", "Prims.int", "Prims.l_or", "Prims.op_GreaterThanOrEqual", "FStar.UInt.size", "FStar.UInt32.n", "Lib.IntTypes.uint8", "Prims.op_Subtraction", "Prims._assert", "Prims.l_and", "Prims.op_GreaterThan", "FStar.Seq.Base.length", "FStar.Seq.Base.equal", "LowStar.Monotonic.Buffer.as_seq", "FStar.Seq.Properties.cons", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "FStar.Seq.Properties.tail", "QUIC.Secret.Seq.seq_hide", "FStar.Seq.Base.seq", "FStar.Seq.Base.slice", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "QUIC.Secret.Buffer.buffer_update_strong", "FStar.UInt.uint_t", "LowParse.BitFields.__proj__Mkuint_t__item__v", "LowParse.BitFields.uint8", "LowParse.BitFields.set_bitfield", "FStar.Seq.Properties.head", "QUIC.Impl.Header.Public.uu___is_PShort", "Prims.bool", "Prims.nat", "FStar.UInt8.uint_to_t", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.range_t", "Lib.IntTypes.PUB", "QUIC.Secret.Int.reveal", "LowParse.BitFields.__proj__Mkuint_t__item__set_bitfield", "Lib.IntTypes.int_t", "QUIC.Secret.Int.set_bitfield", "LowStar.Monotonic.Buffer.index", "FStar.Seq.Properties.lseq", "Prims.l_True", "Prims.squash", "LowParse.Bytes.byte", "LowParse.Spec.Base.serialize", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "QUIC.Impl.Header.Public.g_header", "Lib.IntTypes.v", "Prims.Nil", "FStar.Pervasives.pattern", "QUIC.Spec.Header.Public.serialize_set_protected_bits", "QUIC.Spec.Header.Public.set_protected_bits", "FStar.UInt8.__uint_to_t", "QUIC.Impl.Header.Public.get_pb_complete", "QUIC.Impl.Header.Public.write_header_aux", "QUIC.Spec.Base.secret_bitfield", "QUIC.Impl.Header.Public.get_pb" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val write_header\n (short_dcid_len: short_dcid_len_t)\n (h: header)\n (out: B.buffer U8.t)\n (out_len: U32.t { U32.v out_len <= B.length out })\n: HST.Stack U32.t\n (requires (fun h0 ->\n (PShort? h ==> PShort?.cid_len h == short_dcid_len) /\\\n header_live h h0 /\\\n B.live h0 out /\\\n B.loc_disjoint (header_footprint h) (B.loc_buffer out) /\\\n Seq.length (LP.serialize (serialize_header short_dcid_len) (g_header h h0)) <= U32.v out_len\n ))\n (ensures (fun h0 len h1 ->\n let gh = g_header h h0 in\n let s = LP.serialize (serialize_header short_dcid_len) gh in\n B.modifies (B.loc_buffer out) h0 h1 /\\\n U32.v len <= U32.v out_len /\\\n Seq.slice (B.as_seq h1 out) 0 (U32.v len) == s \n ))\nlet write_header short_dcid_len h out out_len =", "completed_definiton": "let h0 = HST.get () in\nlet pb = get_pb h in\nserialize_set_protected_bits short_dcid_len (g_header h h0) 0uy;\nassert (Seq.length (LP.serialize (serialize_header short_dcid_len)\n (set_protected_bits (g_header h h0) 0uy)) ==\n Seq.length (LP.serialize (serialize_header short_dcid_len) (g_header h h0)));\nlet len = write_header_aux short_dcid_len h out out_len in\nlet h1 = HST.get () in\nlet f ()\n : Lemma\n (let s = Seq.slice (B.as_seq h1 out) 0 (U32.v len) in\n Seq.length s > 0 /\\\n LP.serialize (serialize_header short_dcid_len) (g_header h h0) ==\n (LPB.uint8.LPB.set_bitfield (Seq.head s)\n 0\n (if PShort? h then 5 else 4)\n (U8.uint_to_t (Secret.v pb) <: U8.t))\n `Seq.cons`\n (Seq.tail s)) =\n get_pb_complete h h0;\n serialize_set_protected_bits short_dcid_len\n (set_protected_bits (g_header h h0) 0uy)\n (U8.uint_to_t (Secret.v pb) <: U8.t)\nin\nf ();\nlet post\n ()\n (contl: Seq.lseq U8.t 0)\n (cont: Seq.lseq U8.t (U32.v len))\n (contr: Seq.lseq U8.t (B.length out - U32.v len))\n (m: HS.mem)\n : GTot Type0 =\n let s = Seq.slice (B.as_seq h1 out) 0 (U32.v len) in\n Seq.length s > 0 /\\\n cont\n `Seq.equal`\n ((LPB.uint8.LPB.set_bitfield (Seq.head s)\n 0\n (if PShort? h then 5 else 4)\n (U8.uint_to_t (Secret.v pb) <: U8.t))\n `Seq.cons`\n (Seq.tail s))\nin\nSecretBuffer.with_buffer_hide #unit out 0ul len h1 B.loc_none B.loc_none 1ul 0ul 0ul 1ul 1ul 0ul\n post\n (fun _ bl bs br ->\n let x = B.index bs 0ul in\n let y =\n if PShort? h\n then Secret.set_bitfield #Secret.U8 x 0ul 5ul pb\n else Secret.set_bitfield #Secret.U8 x 0ul 4ul pb\n in\n assert (let s = Seq.slice (B.as_seq h1 out) 0 (U32.v len) in\n Secret.reveal #Secret.U8 y ==\n LPB.uint8.LPB.set_bitfield (Seq.head s)\n 0\n (if PShort? h then 5 else 4)\n (U8.uint_to_t (Secret.v pb) <: U8.t));\n SecretBuffer.buffer_update_strong bs 0ul y;\n let h2 = HST.get () in\n assert (let s = Seq.slice (B.as_seq h1 out) 0 (U32.v len) in\n Seq.length s > 0 /\\\n (B.as_seq h2 bs) `Seq.equal` (Seq.cons y (Seq.tail (Seq.seq_hide #Secret.U8 s)))));\nlen", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.read_header_body_long_retry", "original_source_type": "val read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (protected_bits: LPB.bitfield LPB.uint8 4)\n : Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |))", "source_type": "val read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (protected_bits: LPB.bitfield LPB.uint8 4)\n : Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |))", "source_definition": "let read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) == (| Long, (| (), (| Retry, () |) |) |) );\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 182, "start_col": 2, "end_line": 199, "end_col": 92 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 9, "max_fuel": 9, "initial_ifuel": 9, "max_ifuel": 9, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 256, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n sl:\n LowParse.Slice.slice (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte) ->\n cid_len: FStar.UInt32.t{FStar.UInt32.v cid_len <= 20} ->\n protected_bits: LowParse.BitFields.bitfield LowParse.BitFields.uint8 4\n -> QUIC.Impl.Header.Public.read_header_body_t sl\n cid_len\n (|\n QUIC.Spec.Header.Public.Long,\n (|\n (),\n (| QUIC.Spec.Header.Public.Retry, FStar.Pervasives.Native.Mktuple2 protected_bits () |)\n |)\n |)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.slice", "LowStar.Buffer.trivial_preorder", "LowParse.Bytes.byte", "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "LowParse.BitFields.bitfield", "FStar.UInt8.t", "LowParse.BitFields.uint8", "Prims.unit", "QUIC.Impl.Header.Public.PLong", "QUIC.Secret.Int.hide", "Lib.IntTypes.U8", "Lib.IntTypes.PUB", "QUIC.Impl.Header.Public.long_header_specifics", "QUIC.Impl.Header.Public.PRetry", "QUIC.Impl.Header.Public.header", "LowParse.Low.Bytes.bounded_vlbytes_payload_length", "LowStar.Buffer.buffer", "LowParse.Low.Bytes.get_vlbytes_contents", "LowParse.Low.Bytes.jump_bounded_vlbytes", "LowParse.Low.Combinators.valid_nondep_then", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "LowParse.Spec.Bytes.parse_bounded_vlbytes", "LowParse.Low.Int.jump_u32", "FStar.UInt32.__uint_to_t", "LowParse.Low.Int.read_u32", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.Int.parse_u32", "LowParse.Spec.Combinators.and_then_kind", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Combinators.nondep_then", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.dtuple2", "LowParse.Spec.Enum.enum_key", "QUIC.Spec.Header.Public.header_form_t", "QUIC.Spec.Header.Public.header_form", "LowParse.Spec.BitSum.bitsum'_key_type", "Prims.op_Subtraction", "LowParse.Spec.BitSum.BitSum'", "QUIC.Spec.Header.Public.fixed_bit", "LowParse.Spec.BitSum.BitField", "LowParse.Spec.BitSum.BitStop", "LowParse.Spec.BitSum.bitsum'", "QUIC.Spec.Header.Public.long_packet_type_t", "QUIC.Spec.Header.Public.long_packet_type", "LowParse.Spec.BitSum.bitsum'_key_of_t", "QUIC.Spec.Header.Public.first_byte", "Prims.Mkdtuple2", "LowParse.Spec.BitSum.bitsum'_type'", "QUIC.Spec.Header.Public.Long", "QUIC.Spec.Header.Public.Retry", "FStar.Pervasives.Native.Mktuple2", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "QUIC.Impl.Header.Public.read_header_body_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (protected_bits: LPB.bitfield LPB.uint8 4)\n : Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |))\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (protected_bits: LPB.bitfield LPB.uint8 4)\n : Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |)) =", "completed_definiton": "fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte\n (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) ==\n (| Long, (| (), (| Retry, () |) |) |));\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0\n LP.parse_u32\n ((LP.parse_bounded_vlbytes 0 20) `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20))\n sl\n 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.read_header_body_long_zero_rtt", "original_source_type": "val read_header_body_long_zero_rtt\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (protected_bits: LPB.bitfield LPB.uint8 4)\n : Tot (read_header_body_t sl cid_len (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |))", "source_type": "val read_header_body_long_zero_rtt\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (protected_bits: LPB.bitfield LPB.uint8 4)\n : Tot (read_header_body_t sl cid_len (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |))", "source_definition": "let read_header_body_long_zero_rtt\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| ZeroRTT, (protected_bits, () ) |) |) |) == (| Long, (| (), (| ZeroRTT, () |) |) |) );\n valid_long_zero_rtt_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PZeroRTT payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 343, "start_col": 2, "end_line": 360, "end_col": 90 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) == (| Long, (| (), (| Retry, () |) |) |) );\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)\n\n#pop-options\n\nlet valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures (\n LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_initial_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0 sl pos\n\ninline_for_extraction\nlet read_payload_and_pn_length : LP.leaf_reader parse_payload_and_pn_length =\n LP.read_filter VI.read_varint payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Initial, () |) |) |) );\n valid_long_initial_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len)) (parse_payload_and_pn_length) sl pos3;\n let token = LP.get_bounded_vlgenbytes_contents 0 token_max_len (VI.read_bounded_varint 0 token_max_len) (VI.jump_bounded_varint 0 token_max_len) sl pos3 in\n let token_len = LP.bounded_vlgenbytes_payload_length 0 token_max_len (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let pos4 = LP.jump_bounded_vlgenbytes 0 token_max_len (VI.jump_bounded_varint 0 token_max_len) (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos4 in\n let spec = PInitial (payload_and_pn_length) token token_len in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures (\n LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_handshake_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` VI.parse_varint)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_handshake\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Handshake, () |) |) |) );\n valid_long_handshake_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PHandshake payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_zero_rtt_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_zero_rtt_body h0 sl pos))\n (ensures (\n LP.valid parse_long_zero_rtt_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_zero_rtt_body h0 sl pos)\n (LP.get_valid_pos parse_long_zero_rtt_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_zero_rtt_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_zero_rtt\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 9, "max_fuel": 9, "initial_ifuel": 9, "max_ifuel": 9, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 512, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n sl:\n LowParse.Slice.slice (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte) ->\n cid_len: FStar.UInt32.t{FStar.UInt32.v cid_len <= 20} ->\n protected_bits: LowParse.BitFields.bitfield LowParse.BitFields.uint8 4\n -> QUIC.Impl.Header.Public.read_header_body_t sl\n cid_len\n (|\n QUIC.Spec.Header.Public.Long,\n (|\n (),\n (| QUIC.Spec.Header.Public.ZeroRTT, FStar.Pervasives.Native.Mktuple2 protected_bits () |)\n |)\n |)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.slice", "LowStar.Buffer.trivial_preorder", "LowParse.Bytes.byte", "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "LowParse.BitFields.bitfield", "FStar.UInt8.t", "LowParse.BitFields.uint8", "Prims.unit", "QUIC.Impl.Header.Public.PLong", "QUIC.Secret.Int.hide", "Lib.IntTypes.U8", "Lib.IntTypes.PUB", "QUIC.Impl.Header.Public.long_header_specifics", "QUIC.Impl.Header.Public.PZeroRTT", "QUIC.Impl.Header.Public.header", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "QUIC.Impl.Header.Public.read_payload_and_pn_length", "LowParse.Low.Bytes.jump_bounded_vlbytes", "LowParse.Low.Bytes.bounded_vlbytes_payload_length", "LowStar.Buffer.buffer", "LowParse.Low.Bytes.get_vlbytes_contents", "LowParse.Low.Combinators.valid_nondep_then", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "LowParse.Spec.Bytes.parse_bounded_vlbytes", "LowParse.Low.Int.jump_u32", "FStar.UInt32.__uint_to_t", "LowParse.Low.Int.read_u32", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.Int.parse_u32", "LowParse.Spec.Combinators.and_then_kind", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Combinators.nondep_then", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "QUIC.Impl.Header.Public.valid_long_zero_rtt_body_elim", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.dtuple2", "LowParse.Spec.Enum.enum_key", "QUIC.Spec.Header.Public.header_form_t", "QUIC.Spec.Header.Public.header_form", "LowParse.Spec.BitSum.bitsum'_key_type", "Prims.op_Subtraction", "LowParse.Spec.BitSum.BitSum'", "QUIC.Spec.Header.Public.fixed_bit", "LowParse.Spec.BitSum.BitField", "LowParse.Spec.BitSum.BitStop", "LowParse.Spec.BitSum.bitsum'", "QUIC.Spec.Header.Public.long_packet_type_t", "QUIC.Spec.Header.Public.long_packet_type", "LowParse.Spec.BitSum.bitsum'_key_of_t", "QUIC.Spec.Header.Public.first_byte", "Prims.Mkdtuple2", "LowParse.Spec.BitSum.bitsum'_type'", "QUIC.Spec.Header.Public.Long", "QUIC.Spec.Header.Public.ZeroRTT", "FStar.Pervasives.Native.Mktuple2", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "QUIC.Impl.Header.Public.read_header_body_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_header_body_long_zero_rtt\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (protected_bits: LPB.bitfield LPB.uint8 4)\n : Tot (read_header_body_t sl cid_len (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |))\nlet read_header_body_long_zero_rtt\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (protected_bits: LPB.bitfield LPB.uint8 4)\n : Tot (read_header_body_t sl cid_len (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |)) =", "completed_definiton": "fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte\n (| Long, (| (), (| ZeroRTT, (protected_bits, ()) |) |) |) ==\n (| Long, (| (), (| ZeroRTT, () |) |) |));\n valid_long_zero_rtt_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0\n LP.parse_u32\n ((LP.parse_bounded_vlbytes 0 20) `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20))\n sl\n 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PZeroRTT payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.read_header_body_long_handshake", "original_source_type": "val read_header_body_long_handshake\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (protected_bits: LPB.bitfield LPB.uint8 4)\n : Tot\n (read_header_body_t sl cid_len (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |))", "source_type": "val read_header_body_long_handshake\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (protected_bits: LPB.bitfield LPB.uint8 4)\n : Tot\n (read_header_body_t sl cid_len (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |))", "source_definition": "let read_header_body_long_handshake\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Handshake, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Handshake, () |) |) |) );\n valid_long_handshake_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PHandshake payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 292, "start_col": 2, "end_line": 309, "end_col": 90 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) == (| Long, (| (), (| Retry, () |) |) |) );\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)\n\n#pop-options\n\nlet valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures (\n LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_initial_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0 sl pos\n\ninline_for_extraction\nlet read_payload_and_pn_length : LP.leaf_reader parse_payload_and_pn_length =\n LP.read_filter VI.read_varint payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Initial, () |) |) |) );\n valid_long_initial_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len)) (parse_payload_and_pn_length) sl pos3;\n let token = LP.get_bounded_vlgenbytes_contents 0 token_max_len (VI.read_bounded_varint 0 token_max_len) (VI.jump_bounded_varint 0 token_max_len) sl pos3 in\n let token_len = LP.bounded_vlgenbytes_payload_length 0 token_max_len (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let pos4 = LP.jump_bounded_vlgenbytes 0 token_max_len (VI.jump_bounded_varint 0 token_max_len) (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos4 in\n let spec = PInitial (payload_and_pn_length) token token_len in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec\n\n#pop-options\n\nlet valid_long_handshake_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_handshake_body h0 sl pos))\n (ensures (\n LP.valid parse_long_handshake_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` parse_payload_and_pn_length)\n h0\n sl\n pos\n (LP.contents parse_long_handshake_body h0 sl pos)\n (LP.get_valid_pos parse_long_handshake_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_handshake_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` VI.parse_varint)\n h0 sl pos\n\n#push-options \"--z3rlimit 512 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_handshake\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 9, "max_fuel": 9, "initial_ifuel": 9, "max_ifuel": 9, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 512, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n sl:\n LowParse.Slice.slice (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte) ->\n cid_len: FStar.UInt32.t{FStar.UInt32.v cid_len <= 20} ->\n protected_bits: LowParse.BitFields.bitfield LowParse.BitFields.uint8 4\n -> QUIC.Impl.Header.Public.read_header_body_t sl\n cid_len\n (|\n QUIC.Spec.Header.Public.Long,\n (|\n (),\n (|\n QUIC.Spec.Header.Public.Handshake,\n FStar.Pervasives.Native.Mktuple2 protected_bits ()\n |)\n |)\n |)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.slice", "LowStar.Buffer.trivial_preorder", "LowParse.Bytes.byte", "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "LowParse.BitFields.bitfield", "FStar.UInt8.t", "LowParse.BitFields.uint8", "Prims.unit", "QUIC.Impl.Header.Public.PLong", "QUIC.Secret.Int.hide", "Lib.IntTypes.U8", "Lib.IntTypes.PUB", "QUIC.Impl.Header.Public.long_header_specifics", "QUIC.Impl.Header.Public.PHandshake", "QUIC.Impl.Header.Public.header", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "QUIC.Impl.Header.Public.read_payload_and_pn_length", "LowParse.Low.Bytes.jump_bounded_vlbytes", "LowParse.Low.Bytes.bounded_vlbytes_payload_length", "LowStar.Buffer.buffer", "LowParse.Low.Bytes.get_vlbytes_contents", "LowParse.Low.Combinators.valid_nondep_then", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "LowParse.Spec.Bytes.parse_bounded_vlbytes", "LowParse.Low.Int.jump_u32", "FStar.UInt32.__uint_to_t", "LowParse.Low.Int.read_u32", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.Int.parse_u32", "LowParse.Spec.Combinators.and_then_kind", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Combinators.nondep_then", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "QUIC.Impl.Header.Public.valid_long_handshake_body_elim", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.dtuple2", "LowParse.Spec.Enum.enum_key", "QUIC.Spec.Header.Public.header_form_t", "QUIC.Spec.Header.Public.header_form", "LowParse.Spec.BitSum.bitsum'_key_type", "Prims.op_Subtraction", "LowParse.Spec.BitSum.BitSum'", "QUIC.Spec.Header.Public.fixed_bit", "LowParse.Spec.BitSum.BitField", "LowParse.Spec.BitSum.BitStop", "LowParse.Spec.BitSum.bitsum'", "QUIC.Spec.Header.Public.long_packet_type_t", "QUIC.Spec.Header.Public.long_packet_type", "LowParse.Spec.BitSum.bitsum'_key_of_t", "QUIC.Spec.Header.Public.first_byte", "Prims.Mkdtuple2", "LowParse.Spec.BitSum.bitsum'_type'", "QUIC.Spec.Header.Public.Long", "QUIC.Spec.Header.Public.Handshake", "FStar.Pervasives.Native.Mktuple2", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "QUIC.Impl.Header.Public.read_header_body_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_header_body_long_handshake\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (protected_bits: LPB.bitfield LPB.uint8 4)\n : Tot\n (read_header_body_t sl cid_len (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |))\nlet read_header_body_long_handshake\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (protected_bits: LPB.bitfield LPB.uint8 4)\n : Tot\n (read_header_body_t sl cid_len (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |)) =", "completed_definiton": "fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte\n (| Long, (| (), (| Handshake, (protected_bits, ()) |) |) |) ==\n (| Long, (| (), (| Handshake, () |) |) |));\n valid_long_handshake_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long parse_payload_and_pn_length sl 1ul;\n LP.valid_nondep_then h0\n LP.parse_u32\n ((LP.parse_bounded_vlbytes 0 20) `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20))\n sl\n 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos3 in\n let spec = PHandshake payload_and_pn_length in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Public.fst", "name": "QUIC.Impl.Header.Public.read_header_body_long_initial", "original_source_type": "val read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (protected_bits: LPB.bitfield LPB.uint8 4)\n : Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |))", "source_type": "val read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (protected_bits: LPB.bitfield LPB.uint8 4)\n : Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |))", "source_definition": "let read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Initial, (protected_bits, () ) |) |) |) == (| Long, (| (), (| Initial, () |) |) |) );\n valid_long_initial_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len)) (parse_payload_and_pn_length) sl pos3;\n let token = LP.get_bounded_vlgenbytes_contents 0 token_max_len (VI.read_bounded_varint 0 token_max_len) (VI.jump_bounded_varint 0 token_max_len) sl pos3 in\n let token_len = LP.bounded_vlgenbytes_payload_length 0 token_max_len (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let pos4 = LP.jump_bounded_vlgenbytes 0 token_max_len (VI.jump_bounded_varint 0 token_max_len) (VI.read_bounded_varint 0 token_max_len) sl pos3 in\n let payload_and_pn_length = read_payload_and_pn_length sl pos4 in\n let spec = PInitial (payload_and_pn_length) token token_len in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Public.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 237, "start_col": 2, "end_line": 258, "end_col": 90 }, "file_context": "module QUIC.Impl.Header.Public\nopen QUIC.Spec.Header.Public\nopen QUIC.Impl.Base\n\nfriend QUIC.Spec.Header.Public\n\nmodule LP = LowParse.Low\n\ninline_for_extraction\nlet validate_common_long : LP.validator parse_common_long =\n LP.validate_u32 () `LP.validate_nondep_then` (LP.validate_bounded_vlbytes 0 20 `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20)\n\nmodule VI = QUIC.Impl.VarInt\n\ninline_for_extraction\nlet validate_payload_and_pn_length : LP.validator parse_payload_and_pn_length =\n LP.validate_filter\n VI.validate_varint\n VI.read_varint\n payload_and_pn_length_prop\n (fun x -> payload_and_pn_length_prop x)\n\ninline_for_extraction\nlet validate_long_zero_rtt_body : LP.validator parse_long_zero_rtt_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_handshake_body : LP.validator parse_long_handshake_body =\n validate_common_long `LP.validate_nondep_then` validate_payload_and_pn_length\n\ninline_for_extraction\nlet validate_long_retry_body : LP.validator parse_long_retry_body =\n validate_common_long `LP.validate_nondep_then` LP.validate_bounded_vlbytes 0 20\n\ninline_for_extraction\nlet validate_long_initial_body : LP.validator parse_long_initial_body =\n validate_common_long `LP.validate_nondep_then` (LP.validate_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (VI.validate_bounded_varint 0ul (U32.uint_to_t token_max_len)) (VI.read_bounded_varint 0 token_max_len) `LP.validate_nondep_then` validate_payload_and_pn_length)\n\nmodule LPB = LowParse.Low.BitSum\n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\n[@LPB.filter_bitsum'_t_attr]\ninline_for_extraction\nnoextract\nlet validate_header_body_cases\n (short_dcid_len: short_dcid_len_t)\n (k' : LPB.bitsum'_key_type first_byte)\n: Tot (LP.validator (dsnd (parse_header_body short_dcid_len k')))\n= match LP.coerce (LPB.bitsum'_key_type first_byte) k' with\n | (| Short, (| (), () |) |) ->\n LP.validate_weaken (LP.strong_parser_kind 0 20 None) (LP.validate_flbytes (U32.v short_dcid_len) (FStar.Int.Cast.uint32_to_uint64 short_dcid_len)) ()\n | (| Long, (| (), (| Initial, () |) |) |) ->\n validate_long_initial_body\n | (| Long, (| (), (| ZeroRTT, () |) |) |) ->\n validate_long_zero_rtt_body\n | (| Long, (| (), (| Handshake, () |) |) |) ->\n validate_long_handshake_body\n | (| Long, (| (), (| Retry, () |) |) |) ->\n validate_long_retry_body\n\n\n(* TODO: move to something like LowParse.Spec.Tac.BitSum *)\nmodule LT = LowParse.TacLib\nnoextract\nlet pp_bitsum_norm_tac () : LT.Tac unit =\n LT.norm [primops; iota; zeta; delta_attr [`%LPB.filter_bitsum'_t_attr]];\n LT.trefl ()\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet filter_first_byte\n: (LPB.filter_bitsum'_t first_byte)\n=\n (LPB.mk_filter_bitsum'_t' first_byte)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet mk_validate_header_body_cases\n: LPB.validate_bitsum_cases_t first_byte\n=\n (LPB.mk_validate_bitsum_cases_t' first_byte)\n\nlet validate_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.validator (parse_header short_dcid_len))\n= LPB.validate_bitsum\n first_byte\n (first_byte_of_header short_dcid_len)\n (header_body_type short_dcid_len)\n (header_synth short_dcid_len)\n (LP.validate_u8 ())\n LP.read_u8\n (filter_first_byte)\n (parse_header_body short_dcid_len)\n (validate_header_body_cases short_dcid_len)\n (mk_validate_header_body_cases)\n\n[@@ (LT.postprocess_with pp_bitsum_norm_tac) ]\ninline_for_extraction\nnoextract\nlet destr_first_byte\n: (LPB.destr_bitsum'_t first_byte)\n=\n (LPB.mk_destr_bitsum'_t first_byte)\n\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\nlet read_header_body_post\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n (h: HS.mem)\n (x: header)\n (h' : HS.mem)\n: GTot Type0\n= LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let hd = LP.contents (parse_header cid_len) h sl 0ul in\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n header_live x h' /\\\n LP.loc_slice_from_to sl 0ul len `B.loc_includes` header_footprint x /\\\n g_header x h' == hd\n )\n\ninline_for_extraction\nnoextract\nlet read_header_body_t\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (tg: LPB.bitsum'_type first_byte)\n: Tot (Type u#0)\n= unit ->\n HST.Stack header\n (requires (fun h ->\n let p = dsnd (parse_header_body cid_len (LPB.bitsum'_key_of_t first_byte tg)) in\n LP.valid (parse_header cid_len) h sl 0ul /\\ (\n let len = LP.get_valid_pos (parse_header cid_len) h sl 0ul in\n 1 <= U32.v sl.LP.len /\\\n LP.valid_pos p h sl 1ul len /\\\n LP.contents (parse_header cid_len) h sl 0ul == (header_synth cid_len).LPB.f tg (LP.contents p h sl 1ul)\n )))\n (ensures (fun h x h' ->\n B.modifies B.loc_none h h' /\\\n read_header_body_post sl cid_len tg h x h'\n ))\n\n#push-options \"--z3rlimit 128 --z3cliopt smt.arith.nl=false --using_facts_from '*,-FStar.Int.Cast' --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_short\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (spin: LPB.bitfield LPB.uint8 1)\n (protected_bits: LPB.bitfield LPB.uint8 5)\n: Tot (read_header_body_t sl cid_len (| Short, (| (), (spin, (protected_bits, () ) ) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Short, (| (), (spin, (protected_bits, ()) ) |) |) == (| Short, (| (), () |) |) );\n LP.valid_weaken (LP.strong_parser_kind 0 20 None) (LP.parse_flbytes (U32.v cid_len)) h0 sl 1ul;\n LP.valid_flbytes_elim h0 (U32.v cid_len) sl 1ul;\n let pos = LP.jump_flbytes (U32.v cid_len) cid_len sl 1ul in\n let dcid = B.sub sl.LP.base 1ul (pos `U32.sub` 1ul) in\n PShort (Secret.hide #Secret.U8 protected_bits) (spin = 1uy) dcid cid_len\n\n#pop-options\n\n#push-options \"--z3rlimit 256 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_retry\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)\n: Tot (read_header_body_t sl cid_len (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) )\n= fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte (| Long, (| (), (| Retry, (protected_bits, ()) |) |) |) == (| Long, (| (), (| Retry, () |) |) |) );\n LP.valid_nondep_then h0 parse_common_long (LP.parse_bounded_vlbytes 0 20) sl 1ul;\n LP.valid_nondep_then h0 LP.parse_u32 (LP.parse_bounded_vlbytes 0 20 `LP.nondep_then` LP.parse_bounded_vlbytes 0 20) sl 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n let odcid = LP.get_vlbytes_contents 0 20 sl pos3 in\n let odcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos3 in\n let spec = PRetry odcid odcid_len in\n (PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec)\n\n#pop-options\n\nlet valid_long_initial_body_elim\n (h0: HS.mem)\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (pos: U32.t)\n: Lemma\n (requires (LP.valid parse_long_initial_body h0 sl pos))\n (ensures (\n LP.valid parse_long_initial_body h0 sl pos /\\\n LP.valid_content_pos\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0\n sl\n pos\n (LP.contents parse_long_initial_body h0 sl pos)\n (LP.get_valid_pos parse_long_initial_body h0 sl pos)\n ))\n= LP.valid_facts parse_long_initial_body h0 sl pos;\n LP.valid_facts\n (parse_common_long `LP.nondep_then` (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len) `LP.nondep_then` parse_payload_and_pn_length))\n h0 sl pos\n\ninline_for_extraction\nlet read_payload_and_pn_length : LP.leaf_reader parse_payload_and_pn_length =\n LP.read_filter VI.read_varint payload_and_pn_length_prop\n\n#push-options \"--z3rlimit 1024 --z3cliopt smt.arith.nl=false --query_stats --max_fuel 9 --initial_fuel 9 --max_ifuel 9 --initial_ifuel 9 --query_stats\"\n\n#restart-solver\n\nlet read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t { U32.v cid_len <= 20 } )\n (protected_bits: LPB.bitfield LPB.uint8 4)", "dependencies": { "source_file": "QUIC.Impl.Header.Public.fst", "checked_file": "QUIC.Impl.Header.Public.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.VarInt.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowParse.TacLib.fst.checked", "LowParse.Low.Writers.Instances.fst.checked", "LowParse.Low.BitSum.fst.checked", "LowParse.Low.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LT", "full_module": "LowParse.TacLib" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.Low.BitSum" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Impl.VarInt" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Low.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 9, "max_fuel": 9, "initial_ifuel": 9, "max_ifuel": 9, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [ "smt.arith.nl=false" ], "z3smtopt": [], "z3refresh": false, "z3rlimit": 1024, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n sl:\n LowParse.Slice.slice (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte)\n (LowStar.Buffer.trivial_preorder LowParse.Bytes.byte) ->\n cid_len: FStar.UInt32.t{FStar.UInt32.v cid_len <= 20} ->\n protected_bits: LowParse.BitFields.bitfield LowParse.BitFields.uint8 4\n -> QUIC.Impl.Header.Public.read_header_body_t sl\n cid_len\n (|\n QUIC.Spec.Header.Public.Long,\n (|\n (),\n (| QUIC.Spec.Header.Public.Initial, FStar.Pervasives.Native.Mktuple2 protected_bits () |)\n |)\n |)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Slice.slice", "LowStar.Buffer.trivial_preorder", "LowParse.Bytes.byte", "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "LowParse.BitFields.bitfield", "FStar.UInt8.t", "LowParse.BitFields.uint8", "Prims.unit", "QUIC.Impl.Header.Public.PLong", "QUIC.Secret.Int.hide", "Lib.IntTypes.U8", "Lib.IntTypes.PUB", "QUIC.Impl.Header.Public.long_header_specifics", "QUIC.Impl.Header.Public.PInitial", "QUIC.Impl.Header.Public.header", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "QUIC.Impl.Header.Public.read_payload_and_pn_length", "LowParse.Low.Bytes.jump_bounded_vlgenbytes", "QUIC.Spec.Base.token_max_len", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.VarInt.parse_bounded_varint", "QUIC.Impl.VarInt.jump_bounded_varint", "QUIC.Impl.VarInt.read_bounded_varint", "LowParse.Low.Bytes.bounded_vlgenbytes_payload_length", "LowStar.Buffer.buffer", "LowParse.Low.Bytes.get_bounded_vlgenbytes_contents", "LowParse.Low.Combinators.valid_nondep_then", "LowParse.Spec.VLGen.parse_bounded_vlgen_kind", "LowParse.Spec.Bytes.parse_all_bytes_kind", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "LowParse.Spec.Bytes.parse_bounded_vlgenbytes", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "LowParse.Low.Bytes.jump_bounded_vlbytes", "LowParse.Low.Bytes.bounded_vlbytes_payload_length", "LowParse.Low.Bytes.get_vlbytes_contents", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_bounded_vlbytes", "LowParse.Low.Int.jump_u32", "FStar.UInt32.__uint_to_t", "LowParse.Low.Int.read_u32", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.Int.parse_u32", "LowParse.Spec.Combinators.and_then_kind", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Combinators.nondep_then", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Impl.Header.Public.valid_long_initial_body_elim", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.dtuple2", "LowParse.Spec.Enum.enum_key", "QUIC.Spec.Header.Public.header_form_t", "QUIC.Spec.Header.Public.header_form", "LowParse.Spec.BitSum.bitsum'_key_type", "Prims.op_Subtraction", "LowParse.Spec.BitSum.BitSum'", "QUIC.Spec.Header.Public.fixed_bit", "LowParse.Spec.BitSum.BitField", "LowParse.Spec.BitSum.BitStop", "LowParse.Spec.BitSum.bitsum'", "QUIC.Spec.Header.Public.long_packet_type_t", "QUIC.Spec.Header.Public.long_packet_type", "LowParse.Spec.BitSum.bitsum'_key_of_t", "QUIC.Spec.Header.Public.first_byte", "Prims.Mkdtuple2", "LowParse.Spec.BitSum.bitsum'_type'", "QUIC.Spec.Header.Public.Long", "QUIC.Spec.Header.Public.Initial", "FStar.Pervasives.Native.Mktuple2", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "QUIC.Impl.Header.Public.read_header_body_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (protected_bits: LPB.bitfield LPB.uint8 4)\n : Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |))\nlet read_header_body_long_initial\n (sl: LP.slice (B.trivial_preorder _) (B.trivial_preorder _))\n (cid_len: U32.t{U32.v cid_len <= 20})\n (protected_bits: LPB.bitfield LPB.uint8 4)\n : Tot (read_header_body_t sl cid_len (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |)) =", "completed_definiton": "fun len ->\n let h0 = HST.get () in\n assert_norm (LPB.bitsum'_key_of_t first_byte\n (| Long, (| (), (| Initial, (protected_bits, ()) |) |) |) ==\n (| Long, (| (), (| Initial, () |) |) |));\n valid_long_initial_body_elim h0 sl 1ul;\n LP.valid_nondep_then h0\n parse_common_long\n ((LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len))\n `LP.nondep_then`\n parse_payload_and_pn_length)\n sl\n 1ul;\n LP.valid_nondep_then h0\n LP.parse_u32\n ((LP.parse_bounded_vlbytes 0 20) `LP.nondep_then` (LP.parse_bounded_vlbytes 0 20))\n sl\n 1ul;\n let version = LP.read_u32 sl 1ul in\n let pos1 = LP.jump_u32 sl 1ul in\n LP.valid_nondep_then h0 (LP.parse_bounded_vlbytes 0 20) (LP.parse_bounded_vlbytes 0 20) sl pos1;\n let dcid = LP.get_vlbytes_contents 0 20 sl pos1 in\n let dcid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos1 in\n let pos2 = LP.jump_bounded_vlbytes 0 20 sl pos1 in\n let scid = LP.get_vlbytes_contents 0 20 sl pos2 in\n let scid_len = LP.bounded_vlbytes_payload_length 0 20 sl pos2 in\n let pos3 = LP.jump_bounded_vlbytes 0 20 sl pos2 in\n LP.valid_nondep_then h0\n (LP.parse_bounded_vlgenbytes 0 token_max_len (VI.parse_bounded_varint 0 token_max_len))\n (parse_payload_and_pn_length)\n sl\n pos3;\n let token =\n LP.get_bounded_vlgenbytes_contents 0\n token_max_len\n (VI.read_bounded_varint 0 token_max_len)\n (VI.jump_bounded_varint 0 token_max_len)\n sl\n pos3\n in\n let token_len =\n LP.bounded_vlgenbytes_payload_length 0\n token_max_len\n (VI.read_bounded_varint 0 token_max_len)\n sl\n pos3\n in\n let pos4 =\n LP.jump_bounded_vlgenbytes 0\n token_max_len\n (VI.jump_bounded_varint 0 token_max_len)\n (VI.read_bounded_varint 0 token_max_len)\n sl\n pos3\n in\n let payload_and_pn_length = read_payload_and_pn_length sl pos4 in\n let spec = PInitial (payload_and_pn_length) token token_len in\n PLong (Secret.hide #Secret.U8 protected_bits) version dcid dcid_len scid scid_len spec", "isa_cross_project_example": true }, { "file_name": "QUIC.fsti", "name": "QUIC.u2", "original_source_type": "", "source_type": "val u2 : Type0", "source_definition": "let u2 = QImpl.u2", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 38, "start_col": 9, "end_line": 38, "end_col": 17 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.Impl\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule Secret = QUIC.Secret.Int\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n#set-options \"--fuel 0 --ifuel 0\"\n\ntype nat62 = n:nat{n < pow2 62}\n\nlet cipher_keysize (a:QSpec.ea) =\n Spec.Agile.Cipher.key_length (Spec.Agile.AEAD.cipher_alg_of_supported_alg a)\n\n/// Low-level types used in this API\n/// --------------------------------", "dependencies": { "source_file": "QUIC.fsti", "checked_file": "QUIC.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lib.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.u2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let u2 =", "completed_definiton": "QImpl.u2", "isa_cross_project_example": true }, { "file_name": "QUIC.fsti", "name": "QUIC.u62", "original_source_type": "", "source_type": "val u62 : Type0", "source_definition": "let u62 = QImpl.u62", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 40, "start_col": 10, "end_line": 40, "end_col": 19 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.Impl\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule Secret = QUIC.Secret.Int\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n#set-options \"--fuel 0 --ifuel 0\"\n\ntype nat62 = n:nat{n < pow2 62}\n\nlet cipher_keysize (a:QSpec.ea) =\n Spec.Agile.Cipher.key_length (Spec.Agile.AEAD.cipher_alg_of_supported_alg a)\n\n/// Low-level types used in this API\n/// --------------------------------\n\nlet u2 = QImpl.u2", "dependencies": { "source_file": "QUIC.fsti", "checked_file": "QUIC.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lib.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.u62" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let u62 =", "completed_definiton": "QImpl.u62", "isa_cross_project_example": true }, { "file_name": "QUIC.fsti", "name": "QUIC.u4", "original_source_type": "", "source_type": "val u4 : Type0", "source_definition": "let u4 = QImpl.u4", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 39, "start_col": 9, "end_line": 39, "end_col": 17 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.Impl\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule Secret = QUIC.Secret.Int\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n#set-options \"--fuel 0 --ifuel 0\"\n\ntype nat62 = n:nat{n < pow2 62}\n\nlet cipher_keysize (a:QSpec.ea) =\n Spec.Agile.Cipher.key_length (Spec.Agile.AEAD.cipher_alg_of_supported_alg a)\n\n/// Low-level types used in this API\n/// --------------------------------", "dependencies": { "source_file": "QUIC.fsti", "checked_file": "QUIC.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lib.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.u4" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let u4 =", "completed_definiton": "QImpl.u4", "isa_cross_project_example": true }, { "file_name": "QUIC.fsti", "name": "QUIC.receivable", "original_source_type": "", "source_type": "val receivable : s: QUIC.state i -> h: FStar.Monotonic.HyperStack.mem{QUIC.invariant h s} -> Prims.GTot Prims.bool", "source_definition": "let receivable (#i: index) (s: state i) (h: HS.mem { invariant h s }) =\n Secret.v (g_last_packet_number s h) + 1 < pow2 62", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 73, "start_col": 2, "end_line": 73, "end_col": 51 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.Impl\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule Secret = QUIC.Secret.Int\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n#set-options \"--fuel 0 --ifuel 0\"\n\ntype nat62 = n:nat{n < pow2 62}\n\nlet cipher_keysize (a:QSpec.ea) =\n Spec.Agile.Cipher.key_length (Spec.Agile.AEAD.cipher_alg_of_supported_alg a)\n\n/// Low-level types used in this API\n/// --------------------------------\n\nlet u2 = QImpl.u2\nlet u4 = QImpl.u4\nlet u62 = QImpl.u62\n\nval index:eqtype\n\nval alg: index -> GTot QSpec.ea\nval halg: index -> GTot QSpec.ha\n\nlet traffic_secret i =\n Spec.Hash.Definitions.bytes_hash (halg i)\n\n// Switch state: either QModel or QImpl\nval state: index -> Type u#1\n\nval footprint: #i:index -> HS.mem -> state i -> GTot B.loc\nval invariant: #i:index -> HS.mem -> state i -> Type0\n\nval g_traffic_secret: #i:index -> state i -> HS.mem -> GTot (traffic_secret i)\nval g_initial_packet_number: #i:index -> (s: state i) -> (h: HS.mem) -> GTot PN.packet_number_t\nval g_last_packet_number: #i:index -> (s:state i) -> (h: HS.mem { invariant h s }) ->\n GTot (pn: PN.packet_number_t {\n let open Lib.IntTypes in\n Secret.v pn >= Secret.v #U64 #SEC (g_initial_packet_number s h)\n })\nval g_next_packet_number: #i:index -> (s:state i) -> (h: HS.mem { invariant h s }) ->\n GTot (pn: PN.packet_number_t {\n let open Lib.IntTypes in\n Secret.v pn >= Secret.v #U64 #SEC (g_initial_packet_number s h)\n })\n\nlet incrementable (#i: index) (s: state i) (h: HS.mem { invariant h s }) =\n Secret.v (g_next_packet_number s h) + 1 < pow2 62", "dependencies": { "source_file": "QUIC.fsti", "checked_file": "QUIC.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lib.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: QUIC.state i -> h: FStar.Monotonic.HyperStack.mem{QUIC.invariant h s} -> Prims.GTot Prims.bool", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.index", "QUIC.state", "FStar.Monotonic.HyperStack.mem", "QUIC.invariant", "Prims.op_LessThan", "Prims.op_Addition", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "QUIC.g_last_packet_number", "Prims.pow2", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let receivable (#i: index) (s: state i) (h: HS.mem{invariant h s}) =", "completed_definiton": "Secret.v (g_last_packet_number s h) + 1 < pow2 62", "isa_cross_project_example": true }, { "file_name": "QUIC.fsti", "name": "QUIC.incrementable", "original_source_type": "", "source_type": "val incrementable : s: QUIC.state i -> h: FStar.Monotonic.HyperStack.mem{QUIC.invariant h s} -> Prims.GTot Prims.bool", "source_definition": "let incrementable (#i: index) (s: state i) (h: HS.mem { invariant h s }) =\n Secret.v (g_next_packet_number s h) + 1 < pow2 62", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 70, "start_col": 2, "end_line": 70, "end_col": 51 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.Impl\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule Secret = QUIC.Secret.Int\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n#set-options \"--fuel 0 --ifuel 0\"\n\ntype nat62 = n:nat{n < pow2 62}\n\nlet cipher_keysize (a:QSpec.ea) =\n Spec.Agile.Cipher.key_length (Spec.Agile.AEAD.cipher_alg_of_supported_alg a)\n\n/// Low-level types used in this API\n/// --------------------------------\n\nlet u2 = QImpl.u2\nlet u4 = QImpl.u4\nlet u62 = QImpl.u62\n\nval index:eqtype\n\nval alg: index -> GTot QSpec.ea\nval halg: index -> GTot QSpec.ha\n\nlet traffic_secret i =\n Spec.Hash.Definitions.bytes_hash (halg i)\n\n// Switch state: either QModel or QImpl\nval state: index -> Type u#1\n\nval footprint: #i:index -> HS.mem -> state i -> GTot B.loc\nval invariant: #i:index -> HS.mem -> state i -> Type0\n\nval g_traffic_secret: #i:index -> state i -> HS.mem -> GTot (traffic_secret i)\nval g_initial_packet_number: #i:index -> (s: state i) -> (h: HS.mem) -> GTot PN.packet_number_t\nval g_last_packet_number: #i:index -> (s:state i) -> (h: HS.mem { invariant h s }) ->\n GTot (pn: PN.packet_number_t {\n let open Lib.IntTypes in\n Secret.v pn >= Secret.v #U64 #SEC (g_initial_packet_number s h)\n })\nval g_next_packet_number: #i:index -> (s:state i) -> (h: HS.mem { invariant h s }) ->\n GTot (pn: PN.packet_number_t {\n let open Lib.IntTypes in\n Secret.v pn >= Secret.v #U64 #SEC (g_initial_packet_number s h)\n })", "dependencies": { "source_file": "QUIC.fsti", "checked_file": "QUIC.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lib.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: QUIC.state i -> h: FStar.Monotonic.HyperStack.mem{QUIC.invariant h s} -> Prims.GTot Prims.bool", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.index", "QUIC.state", "FStar.Monotonic.HyperStack.mem", "QUIC.invariant", "Prims.op_LessThan", "Prims.op_Addition", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "QUIC.g_next_packet_number", "Prims.pow2", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let incrementable (#i: index) (s: state i) (h: HS.mem{invariant h s}) =", "completed_definiton": "Secret.v (g_next_packet_number s h) + 1 < pow2 62", "isa_cross_project_example": true }, { "file_name": "QUIC.fsti", "name": "QUIC.cipher_keysize", "original_source_type": "", "source_type": "val cipher_keysize : a: QUIC.Spec.Crypto.ea -> Lib.IntTypes.size_nat", "source_definition": "let cipher_keysize (a:QSpec.ea) =\n Spec.Agile.Cipher.key_length (Spec.Agile.AEAD.cipher_alg_of_supported_alg a)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 33, "start_col": 2, "end_line": 33, "end_col": 78 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.Impl\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule Secret = QUIC.Secret.Int\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n#set-options \"--fuel 0 --ifuel 0\"\n\ntype nat62 = n:nat{n < pow2 62}", "dependencies": { "source_file": "QUIC.fsti", "checked_file": "QUIC.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lib.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: QUIC.Spec.Crypto.ea -> Lib.IntTypes.size_nat", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.Cipher.key_length", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "Lib.IntTypes.size_nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let cipher_keysize (a: QSpec.ea) =", "completed_definiton": "Spec.Agile.Cipher.key_length (Spec.Agile.AEAD.cipher_alg_of_supported_alg a)", "isa_cross_project_example": true }, { "file_name": "QUIC.fsti", "name": "QUIC.traffic_secret", "original_source_type": "", "source_type": "val traffic_secret : i: QUIC.index -> Type0", "source_definition": "let traffic_secret i =\n Spec.Hash.Definitions.bytes_hash (halg i)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 48, "start_col": 2, "end_line": 48, "end_col": 43 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.Impl\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule Secret = QUIC.Secret.Int\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n#set-options \"--fuel 0 --ifuel 0\"\n\ntype nat62 = n:nat{n < pow2 62}\n\nlet cipher_keysize (a:QSpec.ea) =\n Spec.Agile.Cipher.key_length (Spec.Agile.AEAD.cipher_alg_of_supported_alg a)\n\n/// Low-level types used in this API\n/// --------------------------------\n\nlet u2 = QImpl.u2\nlet u4 = QImpl.u4\nlet u62 = QImpl.u62\n\nval index:eqtype\n\nval alg: index -> GTot QSpec.ea\nval halg: index -> GTot QSpec.ha", "dependencies": { "source_file": "QUIC.fsti", "checked_file": "QUIC.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lib.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: QUIC.index -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.index", "Spec.Hash.Definitions.bytes_hash", "QUIC.halg" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let traffic_secret i =", "completed_definiton": "Spec.Hash.Definitions.bytes_hash (halg i)", "isa_cross_project_example": true }, { "file_name": "QUIC.fsti", "name": "QUIC.decrypt_post", "original_source_type": "val decrypt_post\n (i: index)\n (s: state i)\n (dst: B.pointer QImpl.result)\n (packet: B.buffer U8.t)\n (len: U32.t)\n (cid_len: U8.t)\n (h0: HS.mem)\n (res: error_code)\n (h1: HS.mem)\n : Pure Type0\n (requires\n U8.v cid_len <= 20 /\\ U32.v len == B.length packet /\\ invariant h0 s /\\ receivable s h0)\n (ensures fun _ -> True)", "source_type": "val decrypt_post\n (i: index)\n (s: state i)\n (dst: B.pointer QImpl.result)\n (packet: B.buffer U8.t)\n (len: U32.t)\n (cid_len: U8.t)\n (h0: HS.mem)\n (res: error_code)\n (h1: HS.mem)\n : Pure Type0\n (requires\n U8.v cid_len <= 20 /\\ U32.v len == B.length packet /\\ invariant h0 s /\\ receivable s h0)\n (ensures fun _ -> True)", "source_definition": "let decrypt_post (i: index)\n (s:state i)\n (dst: B.pointer QImpl.result)\n (packet: B.buffer U8.t)\n (len: U32.t)\n (cid_len: U8.t)\n (h0: HS.mem)\n (res: error_code)\n (h1: HS.mem): Pure Type0\n (requires\n U8.v cid_len <= 20 /\\\n U32.v len == B.length packet /\\\n invariant h0 s /\\\n receivable s h0)\n (ensures fun _ -> True)\n=\n let s0 = g_traffic_secret s h0 in\n let k = QSpec.(derive_secret (halg i) s0 label_key (Spec.Agile.AEAD.key_length (alg i))) in\n let iv = QSpec.(derive_secret (halg i) s0 label_iv 12) in\n let pne = QSpec.(derive_secret (halg i) s0 label_hp (cipher_keysize (alg i))) in\n let prev = g_last_packet_number s h0 in\n invariant h1 s /\\\n footprint h1 s == footprint h0 s /\\\n begin\n let r = B.deref h1 dst in\n let x = g_last_packet_number in\n let y = packet in\n let open QImpl in\n let packet = y in\n let g_last_packet_number = x in\n match res with\n | Success ->\n // prev is known to be >= g_initial_packet_number (see lemma invariant_packet_number)\n Secret.v (g_last_packet_number s h1) == FStar.Math.Lib.max (Secret.v prev) (Secret.v r.QImplBase.pn) /\\ (\n\n // Lengths\n r.header_len == header_len r.header /\\\n Secret.v r.header_len + Secret.v r.plain_len <= Secret.v r.total_len /\\\n Secret.v r.total_len <= B.length packet /\\\n B.(loc_includes (loc_buffer (B.gsub packet 0ul (Secret.reveal r.header_len))) (header_footprint r.header)) /\\\n header_live r.header h1 /\\\n Secret.v r.total_len <= B.length packet /\\\n\n // Contents\n (\n let fmt = B.as_seq h1 (B.gsub packet 0ul (Secret.reveal r.header_len)) in\n let plain =\n B.as_seq h1 (B.gsub packet (Secret.reveal r.header_len) (Secret.reveal r.plain_len)) in\n let rem = B.as_seq h0 (B.gsub packet (Secret.reveal r.total_len) (B.len packet `U32.sub `Secret.reveal r.total_len)) in\n match QSpec.decrypt (alg i) k iv pne (Secret.v prev) (U8.v cid_len) (B.as_seq h0 packet) with\n | QSpec.Success h' plain' rem' ->\n h' == g_header r.header h1 r.pn /\\\n fmt == QUIC.Spec.Header.Parse.format_header h' /\\\n plain' == plain /\\\n rem' == rem\n | _ -> False\n ))\n | DecodeError ->\n QSpec.Failure? (QSpec.decrypt (alg i) k iv pne (Secret.v prev) (U8.v cid_len) (B.as_seq h0 packet))\n | AuthenticationFailure ->\n QSpec.Failure? (QSpec.decrypt (alg i) k iv pne (Secret.v prev) (U8.v cid_len) (B.as_seq h0 packet)) /\\\n Secret.v r.total_len <= B.length packet\n | _ ->\n False\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 145, "start_col": 1, "end_line": 194, "end_col": 5 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.Impl\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\nmodule PN = QUIC.Spec.PacketNumber.Base\n\nmodule Secret = QUIC.Secret.Int\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n#set-options \"--fuel 0 --ifuel 0\"\n\ntype nat62 = n:nat{n < pow2 62}\n\nlet cipher_keysize (a:QSpec.ea) =\n Spec.Agile.Cipher.key_length (Spec.Agile.AEAD.cipher_alg_of_supported_alg a)\n\n/// Low-level types used in this API\n/// --------------------------------\n\nlet u2 = QImpl.u2\nlet u4 = QImpl.u4\nlet u62 = QImpl.u62\n\nval index:eqtype\n\nval alg: index -> GTot QSpec.ea\nval halg: index -> GTot QSpec.ha\n\nlet traffic_secret i =\n Spec.Hash.Definitions.bytes_hash (halg i)\n\n// Switch state: either QModel or QImpl\nval state: index -> Type u#1\n\nval footprint: #i:index -> HS.mem -> state i -> GTot B.loc\nval invariant: #i:index -> HS.mem -> state i -> Type0\n\nval g_traffic_secret: #i:index -> state i -> HS.mem -> GTot (traffic_secret i)\nval g_initial_packet_number: #i:index -> (s: state i) -> (h: HS.mem) -> GTot PN.packet_number_t\nval g_last_packet_number: #i:index -> (s:state i) -> (h: HS.mem { invariant h s }) ->\n GTot (pn: PN.packet_number_t {\n let open Lib.IntTypes in\n Secret.v pn >= Secret.v #U64 #SEC (g_initial_packet_number s h)\n })\nval g_next_packet_number: #i:index -> (s:state i) -> (h: HS.mem { invariant h s }) ->\n GTot (pn: PN.packet_number_t {\n let open Lib.IntTypes in\n Secret.v pn >= Secret.v #U64 #SEC (g_initial_packet_number s h)\n })\n\nlet incrementable (#i: index) (s: state i) (h: HS.mem { invariant h s }) =\n Secret.v (g_next_packet_number s h) + 1 < pow2 62\n\nlet receivable (#i: index) (s: state i) (h: HS.mem { invariant h s }) =\n Secret.v (g_last_packet_number s h) + 1 < pow2 62\n\n#push-options \"--z3rlimit 15\"\n\nval encrypt: #i:(*G.erased *)index -> (\n //let i = G.reveal i in\n s: state i ->\n dst: B.buffer U8.t ->\n dst_pn: B.pointer PN.packet_number_t ->\n h: QImplBase.header ->\n plain: B.buffer Secret.uint8 ->\n plain_len: U32.t ->\n ST error_code\n (requires fun h0 ->\n not (QImpl.is_retry h) /\\ // until it's supported in Model.QUIC\n // Memory & preservation\n B.live h0 plain /\\ B.live h0 dst /\\ B.live h0 dst_pn /\\\n QImplBase.header_live h h0 /\\\n B.(all_disjoint [ footprint h0 s; loc_buffer dst; loc_buffer dst_pn; QImpl.header_footprint h; loc_buffer plain ]) /\\\n invariant h0 s /\\\n incrementable s h0 /\\\n B.length plain == U32.v plain_len /\\ (\n let clen =\n if QImplBase.is_retry h then\n 0\n else\n U32.v plain_len + Spec.Agile.AEAD.tag_length (alg i)\n in\n (if QImplBase.is_retry h then U32.v plain_len == 0 else 3 <= U32.v plain_len /\\ U32.v plain_len < QSpec.max_plain_length) /\\\n (QImplBase.has_payload_length h ==> Secret.v (QImplBase.payload_length h) == clen) /\\\n B.length dst == Secret.v (QImplBase.header_len h) + clen\n ))\n (ensures fun h0 r h1 ->\n match r with\n | Success ->\n // Memory & preservation\n B.(modifies (footprint h0 s `loc_union` loc_buffer dst `loc_union` loc_buffer dst_pn)) h0 h1 /\\\n invariant h1 s /\\\n footprint h1 s == footprint h0 s /\\ (\n // Functional correctness\n let ts = g_traffic_secret s h0 in\n let open QUIC.Spec in\n let k = derive_secret (halg i) ts label_key (Spec.Agile.AEAD.key_length (alg i)) in\n let iv = derive_secret (halg i) ts label_iv 12 in\n let pne = derive_secret (halg i) ts label_hp (cipher_keysize (alg i)) in\n let plain = B.as_seq h0 plain in\n let packet: packet = B.as_seq h1 dst in\n let pn = g_next_packet_number s h0 `Secret.add` Secret.to_u64 1uL in\n B.deref h1 dst_pn == pn /\\\n packet `Seq.equal` encrypt (alg i) k iv pne (QImpl.g_header h h0 pn) (QUIC.Secret.Seq.seq_reveal plain) /\\\n g_next_packet_number s h1 == pn)\n | _ ->\n False))\n\n#pop-options\n\nunfold\nlet decrypt_post (i: index)\n (s:state i)\n (dst: B.pointer QImpl.result)\n (packet: B.buffer U8.t)\n (len: U32.t)\n (cid_len: U8.t)\n (h0: HS.mem)\n (res: error_code)\n (h1: HS.mem): Pure Type0\n (requires\n U8.v cid_len <= 20 /\\\n U32.v len == B.length packet /\\\n invariant h0 s /\\\n receivable s h0)", "dependencies": { "source_file": "QUIC.fsti", "checked_file": "QUIC.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Math.Lib.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n i: QUIC.index ->\n s: QUIC.state i ->\n dst: LowStar.Buffer.pointer QUIC.Impl.Header.Base.result ->\n packet: LowStar.Buffer.buffer FStar.UInt8.t ->\n len: FStar.UInt32.t ->\n cid_len: FStar.UInt8.t ->\n h0: FStar.Monotonic.HyperStack.mem ->\n res: EverCrypt.Error.error_code ->\n h1: FStar.Monotonic.HyperStack.mem\n -> Prims.Pure Type0", "effect": "Prims.Pure", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.index", "QUIC.state", "LowStar.Buffer.pointer", "QUIC.Impl.Header.Base.result", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "FStar.Monotonic.HyperStack.mem", "EverCrypt.Error.error_code", "Prims.l_and", "QUIC.invariant", "Prims.eq2", "LowStar.Monotonic.Buffer.loc", "QUIC.footprint", "Prims.int", "Prims.l_or", "Lib.IntTypes.range", "Lib.IntTypes.U64", "Prims.l_imp", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.SEC", "QUIC.Impl.Header.Base.__proj__Mkresult__item__pn", "Prims.op_Equality", "Prims.op_LessThan", "FStar.Math.Lib.max", "Lib.IntTypes.uint32", "QUIC.Impl.Header.Base.__proj__Mkresult__item__header_len", "QUIC.Impl.Header.Base.header_len", "QUIC.Impl.Header.Base.__proj__Mkresult__item__header", "Prims.op_LessThanOrEqual", "Prims.op_Addition", "Lib.IntTypes.U32", "QUIC.Impl.Header.Base.__proj__Mkresult__item__plain_len", "QUIC.Impl.Header.Base.__proj__Mkresult__item__total_len", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "LowStar.Monotonic.Buffer.loc_includes", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Buffer.gsub", "FStar.UInt32.__uint_to_t", "QUIC.Secret.Int.reveal", "QUIC.Impl.Header.Base.header_footprint", "QUIC.Impl.Header.Base.header_live", "QUIC.Spec.decrypt", "QUIC.alg", "FStar.UInt8.v", "LowStar.Monotonic.Buffer.as_seq", "QUIC.Spec.Header.Base.header", "QUIC.Spec.Base.bytes", "QUIC.Impl.Header.Base.g_header", "FStar.Seq.Base.seq", "QUIC.Spec.Base.byte", "QUIC.Spec.Header.Parse.format_header", "QUIC.Spec.result", "Prims.l_False", "Prims.logical", "FStar.UInt32.sub", "LowStar.Monotonic.Buffer.len", "QUIC.Spec.uu___is_Failure", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Lib.IntTypes.v", "QUIC.g_initial_packet_number", "QUIC.g_last_packet_number", "LowStar.Monotonic.Buffer.deref", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "QUIC.Spec.Crypto.derive_secret", "QUIC.halg", "QUIC.Spec.Crypto.label_hp", "QUIC.Spec.Crypto.cipher_keysize", "QUIC.Spec.Crypto.label_iv", "QUIC.Spec.Crypto.label_key", "Spec.Agile.AEAD.key_length", "QUIC.traffic_secret", "QUIC.g_traffic_secret", "FStar.UInt.size", "FStar.UInt32.n", "FStar.UInt32.v", "QUIC.receivable", "Prims.l_True" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val decrypt_post\n (i: index)\n (s: state i)\n (dst: B.pointer QImpl.result)\n (packet: B.buffer U8.t)\n (len: U32.t)\n (cid_len: U8.t)\n (h0: HS.mem)\n (res: error_code)\n (h1: HS.mem)\n : Pure Type0\n (requires\n U8.v cid_len <= 20 /\\ U32.v len == B.length packet /\\ invariant h0 s /\\ receivable s h0)\n (ensures fun _ -> True)\nlet decrypt_post\n (i: index)\n (s: state i)\n (dst: B.pointer QImpl.result)\n (packet: B.buffer U8.t)\n (len: U32.t)\n (cid_len: U8.t)\n (h0: HS.mem)\n (res: error_code)\n (h1: HS.mem)\n : Pure Type0\n (requires\n U8.v cid_len <= 20 /\\ U32.v len == B.length packet /\\ invariant h0 s /\\ receivable s h0)\n (ensures fun _ -> True) =", "completed_definiton": "let s0 = g_traffic_secret s h0 in\nlet k =\n let open QSpec in derive_secret (halg i) s0 label_key (Spec.Agile.AEAD.key_length (alg i))\nin\nlet iv = let open QSpec in derive_secret (halg i) s0 label_iv 12 in\nlet pne = let open QSpec in derive_secret (halg i) s0 label_hp (cipher_keysize (alg i)) in\nlet prev = g_last_packet_number s h0 in\ninvariant h1 s /\\ footprint h1 s == footprint h0 s /\\\n(let r = B.deref h1 dst in\n let x = g_last_packet_number in\n let y = packet in\n let open QImpl in\n let packet = y in\n let g_last_packet_number = x in\n match res with\n | Success ->\n Secret.v (g_last_packet_number s h1) ==\n FStar.Math.Lib.max (Secret.v prev) (Secret.v r.QImplBase.pn) /\\\n (r.header_len == header_len r.header /\\\n Secret.v r.header_len + Secret.v r.plain_len <= Secret.v r.total_len /\\\n Secret.v r.total_len <= B.length packet /\\\n B.(loc_includes (loc_buffer (B.gsub packet 0ul (Secret.reveal r.header_len)))\n (header_footprint r.header)) /\\ header_live r.header h1 /\\\n Secret.v r.total_len <= B.length packet /\\\n (let fmt = B.as_seq h1 (B.gsub packet 0ul (Secret.reveal r.header_len)) in\n let plain =\n B.as_seq h1 (B.gsub packet (Secret.reveal r.header_len) (Secret.reveal r.plain_len))\n in\n let rem =\n B.as_seq h0\n (B.gsub packet\n (Secret.reveal r.total_len)\n ((B.len packet) `U32.sub` (Secret.reveal r.total_len)))\n in\n match\n QSpec.decrypt (alg i) k iv pne (Secret.v prev) (U8.v cid_len) (B.as_seq h0 packet)\n with\n | QSpec.Success h' plain' rem' ->\n h' == g_header r.header h1 r.pn /\\ fmt == QUIC.Spec.Header.Parse.format_header h' /\\\n plain' == plain /\\ rem' == rem\n | _ -> False))\n | DecodeError ->\n QSpec.Failure? (QSpec.decrypt (alg i)\n k\n iv\n pne\n (Secret.v prev)\n (U8.v cid_len)\n (B.as_seq h0 packet))\n | AuthenticationFailure ->\n QSpec.Failure? (QSpec.decrypt (alg i)\n k\n iv\n pne\n (Secret.v prev)\n (U8.v cid_len)\n (B.as_seq h0 packet)) /\\ Secret.v r.total_len <= B.length packet\n | _ -> False)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.fst", "name": "QUIC.Spec.PacketNumber.max", "original_source_type": "val max (a b: int) : Tot (n: int{n >= a /\\ n >= b})", "source_type": "val max (a b: int) : Tot (n: int{n >= a /\\ n >= b})", "source_definition": "let max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 51, "start_col": 2, "end_line": 51, "end_col": 24 }, "file_context": "module QUIC.Spec.PacketNumber\nopen QUIC.Spec.PacketNumber.Lemmas\nopen LowParse.Spec.Combinators\nopen LowParse.Spec.BoundedInt\n\n(* From https://tools.ietf.org/html/draft-ietf-quic-transport-22#appendix-A *)\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule Secret = QUIC.Secret.Int\n\nlet reduce_pn'\n (pn_len: nat { pn_len < 4 })\n (pn: nat)\n: Tot nat\n= pn % (bound_npn' pn_len)\n\nlet in_window_self (pn_len: nat { pn_len < 4 }) (pn:nat) : Lemma\n (in_window pn_len pn (if pn = 0 then 0 else pn - 1))\n= ()\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet expand_pn'\n (pn_len: nat { pn_len < 4 })\n (last: nat { last + 1 < pow2 62})\n (npn: nat { npn < bound_npn' pn_len })\n: Tot (pn: nat { pn < pow2 62 /\\ in_window pn_len last pn /\\ pn % bound_npn' pn_len == npn })\n=\n let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected = last + 1 in\n let bound = bound_npn' pn_len in\n let candidate = replace_modulo' expected bound npn in\n lemma_replace_modulo_bound expected (8*(pn_len+1)) npn 62;\n if candidate <= last + 1 - bound/2\n && candidate < pow2 62 - bound then // the test for overflow (candidate < pow2 62 - bound) is not present in draft 22.\n let _ = lemma_mod_plus candidate 1 bound in\n candidate + bound\n else if candidate > last + 1 + bound/2\n && candidate >= bound then // in draft 22 the test for underflow (candidate >= bound) uses a strict inequality, which makes it impossible to expand npn to 0\n let _ = lemma_mod_plus candidate (-1) bound in\n candidate - bound\n else candidate\n#pop-options", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.fst", "checked_file": "QUIC.Spec.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.Spec.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Combinators" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Prims.int -> b: Prims.int -> n: Prims.int{n >= a /\\ n >= b}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.int", "Prims.op_GreaterThan", "Prims.bool", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThanOrEqual" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val max (a b: int) : Tot (n: int{n >= a /\\ n >= b})\nlet max (a b: int) : Tot (n: int{n >= a /\\ n >= b}) =", "completed_definiton": "if a > b then a else b", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.fst", "name": "QUIC.Spec.PacketNumber.parse_packet_number", "original_source_type": "val parse_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Tot (parser parse_packet_number_kind (packet_number_t' last pn_len))", "source_type": "val parse_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Tot (parser parse_packet_number_kind (packet_number_t' last pn_len))", "source_definition": "let parse_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Tot (parser parse_packet_number_kind (packet_number_t' last pn_len) )\n= lift_parser (parse_reduced_pn pn_len) `parse_synth` synth_packet_number last pn_len", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 134, "start_col": 2, "end_line": 134, "end_col": 85 }, "file_context": "module QUIC.Spec.PacketNumber\nopen QUIC.Spec.PacketNumber.Lemmas\nopen LowParse.Spec.Combinators\nopen LowParse.Spec.BoundedInt\n\n(* From https://tools.ietf.org/html/draft-ietf-quic-transport-22#appendix-A *)\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule Secret = QUIC.Secret.Int\n\nlet reduce_pn'\n (pn_len: nat { pn_len < 4 })\n (pn: nat)\n: Tot nat\n= pn % (bound_npn' pn_len)\n\nlet in_window_self (pn_len: nat { pn_len < 4 }) (pn:nat) : Lemma\n (in_window pn_len pn (if pn = 0 then 0 else pn - 1))\n= ()\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet expand_pn'\n (pn_len: nat { pn_len < 4 })\n (last: nat { last + 1 < pow2 62})\n (npn: nat { npn < bound_npn' pn_len })\n: Tot (pn: nat { pn < pow2 62 /\\ in_window pn_len last pn /\\ pn % bound_npn' pn_len == npn })\n=\n let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected = last + 1 in\n let bound = bound_npn' pn_len in\n let candidate = replace_modulo' expected bound npn in\n lemma_replace_modulo_bound expected (8*(pn_len+1)) npn 62;\n if candidate <= last + 1 - bound/2\n && candidate < pow2 62 - bound then // the test for overflow (candidate < pow2 62 - bound) is not present in draft 22.\n let _ = lemma_mod_plus candidate 1 bound in\n candidate + bound\n else if candidate > last + 1 + bound/2\n && candidate >= bound then // in draft 22 the test for underflow (candidate >= bound) uses a strict inequality, which makes it impossible to expand npn to 0\n let _ = lemma_mod_plus candidate (-1) bound in\n candidate - bound\n else candidate\n#pop-options\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\nlet lemma_uniqueness_in_window (pn_len: nat { pn_len < 4 }) (last: nat { last < pow2 62 }) (x: nat {x < pow2 62}) (y:nat {y < pow2 62}) : Lemma\n (requires (\n let h = bound_npn' pn_len in\n in_window pn_len last x /\\\n in_window pn_len last y /\\\n x%h = y%h))\n (ensures x = y) =\n let open FStar.Math.Lemmas in\n pow2_lt_compat 62 (8 `op_Multiply` (pn_len+1));\n let h = bound_npn' pn_len in\n if last+1 < h/2 && x < h then\n lemma_mod_plus_injective h 0 x y\n else if last+1 >= pow2 62 - h/2 && x >= pow2 62 - h then\n let low = pow2 62 - h in\n lemma_mod_plus_injective h low (x-low) (y-low)\n else\n let low = max (last+2-h/2) 0 in\n lemma_mod_plus_injective h low (x-low) (y-low)\n\nval lemma_parse_pn_correct : (pn_len: nat { pn_len < 4 }) -> last:nat{last+1 < pow2 62} -> (pn: nat { pn < U64.v U62.bound }) -> Lemma\n (requires in_window pn_len last pn)\n (ensures expand_pn' pn_len last (reduce_pn' pn_len pn) = pn)\n\nlet lemma_parse_pn_correct pn_len last pn =\n lemma_uniqueness_in_window pn_len last pn (expand_pn' pn_len last (reduce_pn' pn_len pn))\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nlet synth_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (npn: bounded_integer (Secret.v pn_len))\n: GTot (packet_number_t' last pn_len)\n= Secret.to_u64 (U64.uint_to_t (expand_pn' (Secret.v pn_len - 1) (Secret.v last) (U32.v npn)))\n\n#pop-options\n\nlet synth_packet_number_recip\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (pn: packet_number_t' last pn_len)\n: GTot (bounded_integer (Secret.v pn_len))\n= U32.uint_to_t (reduce_pn' (Secret.v pn_len - 1) (Secret.v pn))\n\n#push-options \"--z3rlimit 512\"\n\nlet synth_packet_number_injective\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Lemma\n (synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len))\n [SMTPat \n (synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len))\n ]\n= synth_inverse_intro' #(packet_number_t' last pn_len) #(bounded_integer (Secret.v pn_len)) (synth_packet_number_recip last pn_len) (synth_packet_number last pn_len) (fun pn -> ());\n synth_inverse_synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len)\n\nlet synth_packet_number_recip_inverse\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Lemma\n (synth_inverse #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len))\n [SMTPat (synth_inverse #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len))]\n= synth_inverse_intro' #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len) (fun pn ->\n lemma_parse_pn_correct (Secret.v pn_len - 1) (Secret.v last) (Secret.v pn)\n )\n\n#pop-options\n\n\nlet parse_reduced_pn\n (pn_len: packet_number_length_t)\n ()\n: GTot (parser parse_packet_number_kind (bounded_integer (Secret.v pn_len)))\n= weaken parse_packet_number_kind (parse_bounded_integer (Secret.v pn_len))\n\nlet parse_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.fst", "checked_file": "QUIC.Spec.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.Spec.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Combinators" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t\n -> LowParse.Spec.Base.parser QUIC.Spec.PacketNumber.parse_packet_number_kind\n (QUIC.Spec.PacketNumber.Base.packet_number_t' last pn_len)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "LowParse.Spec.Combinators.parse_synth", "QUIC.Spec.PacketNumber.parse_packet_number_kind", "LowParse.Spec.BoundedInt.bounded_integer", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "LowParse.Spec.Combinators.lift_parser", "QUIC.Spec.PacketNumber.parse_reduced_pn", "QUIC.Spec.PacketNumber.synth_packet_number", "LowParse.Spec.Base.parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Tot (parser parse_packet_number_kind (packet_number_t' last pn_len))\nlet parse_packet_number (last: last_packet_number_t) (pn_len: packet_number_length_t)\n : Tot (parser parse_packet_number_kind (packet_number_t' last pn_len)) =", "completed_definiton": "(lift_parser (parse_reduced_pn pn_len)) `parse_synth` (synth_packet_number last pn_len)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.fst", "name": "QUIC.Spec.PacketNumber.serialize_packet_number", "original_source_type": "val serialize_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Tot (serializer (parse_packet_number last pn_len))", "source_type": "val serialize_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Tot (serializer (parse_packet_number last pn_len))", "source_definition": "let serialize_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Tot (serializer (parse_packet_number last pn_len))\n= serialize_synth\n (lift_parser (parse_reduced_pn pn_len))\n (synth_packet_number last pn_len)\n (lift_serializer (serialize_reduced_pn pn_len))\n (synth_packet_number_recip last pn_len)\n ()", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 165, "start_col": 2, "end_line": 170, "end_col": 6 }, "file_context": "module QUIC.Spec.PacketNumber\nopen QUIC.Spec.PacketNumber.Lemmas\nopen LowParse.Spec.Combinators\nopen LowParse.Spec.BoundedInt\n\n(* From https://tools.ietf.org/html/draft-ietf-quic-transport-22#appendix-A *)\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule Secret = QUIC.Secret.Int\n\nlet reduce_pn'\n (pn_len: nat { pn_len < 4 })\n (pn: nat)\n: Tot nat\n= pn % (bound_npn' pn_len)\n\nlet in_window_self (pn_len: nat { pn_len < 4 }) (pn:nat) : Lemma\n (in_window pn_len pn (if pn = 0 then 0 else pn - 1))\n= ()\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet expand_pn'\n (pn_len: nat { pn_len < 4 })\n (last: nat { last + 1 < pow2 62})\n (npn: nat { npn < bound_npn' pn_len })\n: Tot (pn: nat { pn < pow2 62 /\\ in_window pn_len last pn /\\ pn % bound_npn' pn_len == npn })\n=\n let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected = last + 1 in\n let bound = bound_npn' pn_len in\n let candidate = replace_modulo' expected bound npn in\n lemma_replace_modulo_bound expected (8*(pn_len+1)) npn 62;\n if candidate <= last + 1 - bound/2\n && candidate < pow2 62 - bound then // the test for overflow (candidate < pow2 62 - bound) is not present in draft 22.\n let _ = lemma_mod_plus candidate 1 bound in\n candidate + bound\n else if candidate > last + 1 + bound/2\n && candidate >= bound then // in draft 22 the test for underflow (candidate >= bound) uses a strict inequality, which makes it impossible to expand npn to 0\n let _ = lemma_mod_plus candidate (-1) bound in\n candidate - bound\n else candidate\n#pop-options\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\nlet lemma_uniqueness_in_window (pn_len: nat { pn_len < 4 }) (last: nat { last < pow2 62 }) (x: nat {x < pow2 62}) (y:nat {y < pow2 62}) : Lemma\n (requires (\n let h = bound_npn' pn_len in\n in_window pn_len last x /\\\n in_window pn_len last y /\\\n x%h = y%h))\n (ensures x = y) =\n let open FStar.Math.Lemmas in\n pow2_lt_compat 62 (8 `op_Multiply` (pn_len+1));\n let h = bound_npn' pn_len in\n if last+1 < h/2 && x < h then\n lemma_mod_plus_injective h 0 x y\n else if last+1 >= pow2 62 - h/2 && x >= pow2 62 - h then\n let low = pow2 62 - h in\n lemma_mod_plus_injective h low (x-low) (y-low)\n else\n let low = max (last+2-h/2) 0 in\n lemma_mod_plus_injective h low (x-low) (y-low)\n\nval lemma_parse_pn_correct : (pn_len: nat { pn_len < 4 }) -> last:nat{last+1 < pow2 62} -> (pn: nat { pn < U64.v U62.bound }) -> Lemma\n (requires in_window pn_len last pn)\n (ensures expand_pn' pn_len last (reduce_pn' pn_len pn) = pn)\n\nlet lemma_parse_pn_correct pn_len last pn =\n lemma_uniqueness_in_window pn_len last pn (expand_pn' pn_len last (reduce_pn' pn_len pn))\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nlet synth_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (npn: bounded_integer (Secret.v pn_len))\n: GTot (packet_number_t' last pn_len)\n= Secret.to_u64 (U64.uint_to_t (expand_pn' (Secret.v pn_len - 1) (Secret.v last) (U32.v npn)))\n\n#pop-options\n\nlet synth_packet_number_recip\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (pn: packet_number_t' last pn_len)\n: GTot (bounded_integer (Secret.v pn_len))\n= U32.uint_to_t (reduce_pn' (Secret.v pn_len - 1) (Secret.v pn))\n\n#push-options \"--z3rlimit 512\"\n\nlet synth_packet_number_injective\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Lemma\n (synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len))\n [SMTPat \n (synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len))\n ]\n= synth_inverse_intro' #(packet_number_t' last pn_len) #(bounded_integer (Secret.v pn_len)) (synth_packet_number_recip last pn_len) (synth_packet_number last pn_len) (fun pn -> ());\n synth_inverse_synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len)\n\nlet synth_packet_number_recip_inverse\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Lemma\n (synth_inverse #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len))\n [SMTPat (synth_inverse #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len))]\n= synth_inverse_intro' #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len) (fun pn ->\n lemma_parse_pn_correct (Secret.v pn_len - 1) (Secret.v last) (Secret.v pn)\n )\n\n#pop-options\n\n\nlet parse_reduced_pn\n (pn_len: packet_number_length_t)\n ()\n: GTot (parser parse_packet_number_kind (bounded_integer (Secret.v pn_len)))\n= weaken parse_packet_number_kind (parse_bounded_integer (Secret.v pn_len))\n\nlet parse_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Tot (parser parse_packet_number_kind (packet_number_t' last pn_len) )\n= lift_parser (parse_reduced_pn pn_len) `parse_synth` synth_packet_number last pn_len\n\nlet parse_packet_number_kind'_correct\n last pn_len\n= let p = parse_bounded_integer (Secret.v pn_len) `parse_synth` synth_packet_number last pn_len in\n let f\n (input: bytes)\n : Lemma\n (parse (parse_packet_number last pn_len) input == parse p input)\n = parse_synth_eq\n (lift_parser (parse_reduced_pn pn_len))\n (synth_packet_number last pn_len)\n input;\n parse_synth_eq\n (parse_bounded_integer (Secret.v pn_len))\n (synth_packet_number last pn_len)\n input\n in\n Classical.forall_intro f;\n parser_kind_prop_ext (total_constant_size_parser_kind (Secret.v pn_len)) (parse_packet_number last pn_len) p\n\nlet serialize_reduced_pn\n (pn_len: packet_number_length_t)\n (x: unit)\n: GTot (serializer (parse_reduced_pn pn_len ()))\n= serialize_weaken parse_packet_number_kind (serialize_bounded_integer (Secret.v pn_len))\n\nlet serialize_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.fst", "checked_file": "QUIC.Spec.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.Spec.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Combinators" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t\n -> LowParse.Spec.Base.serializer (QUIC.Spec.PacketNumber.parse_packet_number last pn_len)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "LowParse.Spec.Combinators.serialize_synth", "QUIC.Spec.PacketNumber.parse_packet_number_kind", "LowParse.Spec.BoundedInt.bounded_integer", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "LowParse.Spec.Combinators.lift_parser", "QUIC.Spec.PacketNumber.parse_reduced_pn", "QUIC.Spec.PacketNumber.synth_packet_number", "LowParse.Spec.Combinators.lift_serializer", "QUIC.Spec.PacketNumber.serialize_reduced_pn", "QUIC.Spec.PacketNumber.synth_packet_number_recip", "LowParse.Spec.Base.serializer", "QUIC.Spec.PacketNumber.parse_packet_number" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Tot (serializer (parse_packet_number last pn_len))\nlet serialize_packet_number (last: last_packet_number_t) (pn_len: packet_number_length_t)\n : Tot (serializer (parse_packet_number last pn_len)) =", "completed_definiton": "serialize_synth (lift_parser (parse_reduced_pn pn_len))\n (synth_packet_number last pn_len)\n (lift_serializer (serialize_reduced_pn pn_len))\n (synth_packet_number_recip last pn_len)\n ()", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.fst", "name": "QUIC.Spec.PacketNumber.reduce_pn'", "original_source_type": "val reduce_pn' (pn_len: nat{pn_len < 4}) (pn: nat) : Tot nat", "source_type": "val reduce_pn' (pn_len: nat{pn_len < 4}) (pn: nat) : Tot nat", "source_definition": "let reduce_pn'\n (pn_len: nat { pn_len < 4 })\n (pn: nat)\n: Tot nat\n= pn % (bound_npn' pn_len)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 20, "start_col": 2, "end_line": 20, "end_col": 26 }, "file_context": "module QUIC.Spec.PacketNumber\nopen QUIC.Spec.PacketNumber.Lemmas\nopen LowParse.Spec.Combinators\nopen LowParse.Spec.BoundedInt\n\n(* From https://tools.ietf.org/html/draft-ietf-quic-transport-22#appendix-A *)\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule Secret = QUIC.Secret.Int\n\nlet reduce_pn'\n (pn_len: nat { pn_len < 4 })\n (pn: nat)", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.fst", "checked_file": "QUIC.Spec.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.Spec.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Combinators" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "pn_len: Prims.nat{pn_len < 4} -> pn: Prims.nat -> Prims.nat", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Prims.op_Modulus", "QUIC.Spec.PacketNumber.Base.bound_npn'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val reduce_pn' (pn_len: nat{pn_len < 4}) (pn: nat) : Tot nat\nlet reduce_pn' (pn_len: nat{pn_len < 4}) (pn: nat) : Tot nat =", "completed_definiton": "pn % (bound_npn' pn_len)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.fst", "name": "QUIC.Spec.PacketNumber.parse_reduced_pn", "original_source_type": "val parse_reduced_pn: pn_len: packet_number_length_t -> Prims.unit\n -> GTot (parser parse_packet_number_kind (bounded_integer (Secret.v pn_len)))", "source_type": "val parse_reduced_pn: pn_len: packet_number_length_t -> Prims.unit\n -> GTot (parser parse_packet_number_kind (bounded_integer (Secret.v pn_len)))", "source_definition": "let parse_reduced_pn\n (pn_len: packet_number_length_t)\n ()\n: GTot (parser parse_packet_number_kind (bounded_integer (Secret.v pn_len)))\n= weaken parse_packet_number_kind (parse_bounded_integer (Secret.v pn_len))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 128, "start_col": 2, "end_line": 128, "end_col": 75 }, "file_context": "module QUIC.Spec.PacketNumber\nopen QUIC.Spec.PacketNumber.Lemmas\nopen LowParse.Spec.Combinators\nopen LowParse.Spec.BoundedInt\n\n(* From https://tools.ietf.org/html/draft-ietf-quic-transport-22#appendix-A *)\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule Secret = QUIC.Secret.Int\n\nlet reduce_pn'\n (pn_len: nat { pn_len < 4 })\n (pn: nat)\n: Tot nat\n= pn % (bound_npn' pn_len)\n\nlet in_window_self (pn_len: nat { pn_len < 4 }) (pn:nat) : Lemma\n (in_window pn_len pn (if pn = 0 then 0 else pn - 1))\n= ()\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet expand_pn'\n (pn_len: nat { pn_len < 4 })\n (last: nat { last + 1 < pow2 62})\n (npn: nat { npn < bound_npn' pn_len })\n: Tot (pn: nat { pn < pow2 62 /\\ in_window pn_len last pn /\\ pn % bound_npn' pn_len == npn })\n=\n let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected = last + 1 in\n let bound = bound_npn' pn_len in\n let candidate = replace_modulo' expected bound npn in\n lemma_replace_modulo_bound expected (8*(pn_len+1)) npn 62;\n if candidate <= last + 1 - bound/2\n && candidate < pow2 62 - bound then // the test for overflow (candidate < pow2 62 - bound) is not present in draft 22.\n let _ = lemma_mod_plus candidate 1 bound in\n candidate + bound\n else if candidate > last + 1 + bound/2\n && candidate >= bound then // in draft 22 the test for underflow (candidate >= bound) uses a strict inequality, which makes it impossible to expand npn to 0\n let _ = lemma_mod_plus candidate (-1) bound in\n candidate - bound\n else candidate\n#pop-options\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\nlet lemma_uniqueness_in_window (pn_len: nat { pn_len < 4 }) (last: nat { last < pow2 62 }) (x: nat {x < pow2 62}) (y:nat {y < pow2 62}) : Lemma\n (requires (\n let h = bound_npn' pn_len in\n in_window pn_len last x /\\\n in_window pn_len last y /\\\n x%h = y%h))\n (ensures x = y) =\n let open FStar.Math.Lemmas in\n pow2_lt_compat 62 (8 `op_Multiply` (pn_len+1));\n let h = bound_npn' pn_len in\n if last+1 < h/2 && x < h then\n lemma_mod_plus_injective h 0 x y\n else if last+1 >= pow2 62 - h/2 && x >= pow2 62 - h then\n let low = pow2 62 - h in\n lemma_mod_plus_injective h low (x-low) (y-low)\n else\n let low = max (last+2-h/2) 0 in\n lemma_mod_plus_injective h low (x-low) (y-low)\n\nval lemma_parse_pn_correct : (pn_len: nat { pn_len < 4 }) -> last:nat{last+1 < pow2 62} -> (pn: nat { pn < U64.v U62.bound }) -> Lemma\n (requires in_window pn_len last pn)\n (ensures expand_pn' pn_len last (reduce_pn' pn_len pn) = pn)\n\nlet lemma_parse_pn_correct pn_len last pn =\n lemma_uniqueness_in_window pn_len last pn (expand_pn' pn_len last (reduce_pn' pn_len pn))\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nlet synth_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (npn: bounded_integer (Secret.v pn_len))\n: GTot (packet_number_t' last pn_len)\n= Secret.to_u64 (U64.uint_to_t (expand_pn' (Secret.v pn_len - 1) (Secret.v last) (U32.v npn)))\n\n#pop-options\n\nlet synth_packet_number_recip\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (pn: packet_number_t' last pn_len)\n: GTot (bounded_integer (Secret.v pn_len))\n= U32.uint_to_t (reduce_pn' (Secret.v pn_len - 1) (Secret.v pn))\n\n#push-options \"--z3rlimit 512\"\n\nlet synth_packet_number_injective\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Lemma\n (synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len))\n [SMTPat \n (synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len))\n ]\n= synth_inverse_intro' #(packet_number_t' last pn_len) #(bounded_integer (Secret.v pn_len)) (synth_packet_number_recip last pn_len) (synth_packet_number last pn_len) (fun pn -> ());\n synth_inverse_synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len)\n\nlet synth_packet_number_recip_inverse\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Lemma\n (synth_inverse #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len))\n [SMTPat (synth_inverse #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len))]\n= synth_inverse_intro' #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len) (fun pn ->\n lemma_parse_pn_correct (Secret.v pn_len - 1) (Secret.v last) (Secret.v pn)\n )\n\n#pop-options\n\n\nlet parse_reduced_pn\n (pn_len: packet_number_length_t)\n ()", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.fst", "checked_file": "QUIC.Spec.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.Spec.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Combinators" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t -> _: Prims.unit\n -> Prims.GTot\n (LowParse.Spec.Base.parser QUIC.Spec.PacketNumber.parse_packet_number_kind\n (LowParse.Spec.BoundedInt.bounded_integer (QUIC.Secret.Int.Base.v pn_len)))", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "Prims.unit", "LowParse.Spec.Base.weaken", "QUIC.Spec.PacketNumber.parse_packet_number_kind", "LowParse.Spec.BoundedInt.parse_bounded_integer_kind", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "LowParse.Spec.BoundedInt.bounded_integer", "LowParse.Spec.BoundedInt.parse_bounded_integer", "LowParse.Spec.Base.parser" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_reduced_pn: pn_len: packet_number_length_t -> Prims.unit\n -> GTot (parser parse_packet_number_kind (bounded_integer (Secret.v pn_len)))\nlet parse_reduced_pn (pn_len: packet_number_length_t) ()\n : GTot (parser parse_packet_number_kind (bounded_integer (Secret.v pn_len))) =", "completed_definiton": "weaken parse_packet_number_kind (parse_bounded_integer (Secret.v pn_len))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.fst", "name": "QUIC.Spec.PacketNumber.serialize_reduced_pn", "original_source_type": "val serialize_reduced_pn (pn_len: packet_number_length_t) (x: unit)\n : GTot (serializer (parse_reduced_pn pn_len ()))", "source_type": "val serialize_reduced_pn (pn_len: packet_number_length_t) (x: unit)\n : GTot (serializer (parse_reduced_pn pn_len ()))", "source_definition": "let serialize_reduced_pn\n (pn_len: packet_number_length_t)\n (x: unit)\n: GTot (serializer (parse_reduced_pn pn_len ()))\n= serialize_weaken parse_packet_number_kind (serialize_bounded_integer (Secret.v pn_len))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 159, "start_col": 2, "end_line": 159, "end_col": 89 }, "file_context": "module QUIC.Spec.PacketNumber\nopen QUIC.Spec.PacketNumber.Lemmas\nopen LowParse.Spec.Combinators\nopen LowParse.Spec.BoundedInt\n\n(* From https://tools.ietf.org/html/draft-ietf-quic-transport-22#appendix-A *)\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule Secret = QUIC.Secret.Int\n\nlet reduce_pn'\n (pn_len: nat { pn_len < 4 })\n (pn: nat)\n: Tot nat\n= pn % (bound_npn' pn_len)\n\nlet in_window_self (pn_len: nat { pn_len < 4 }) (pn:nat) : Lemma\n (in_window pn_len pn (if pn = 0 then 0 else pn - 1))\n= ()\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet expand_pn'\n (pn_len: nat { pn_len < 4 })\n (last: nat { last + 1 < pow2 62})\n (npn: nat { npn < bound_npn' pn_len })\n: Tot (pn: nat { pn < pow2 62 /\\ in_window pn_len last pn /\\ pn % bound_npn' pn_len == npn })\n=\n let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected = last + 1 in\n let bound = bound_npn' pn_len in\n let candidate = replace_modulo' expected bound npn in\n lemma_replace_modulo_bound expected (8*(pn_len+1)) npn 62;\n if candidate <= last + 1 - bound/2\n && candidate < pow2 62 - bound then // the test for overflow (candidate < pow2 62 - bound) is not present in draft 22.\n let _ = lemma_mod_plus candidate 1 bound in\n candidate + bound\n else if candidate > last + 1 + bound/2\n && candidate >= bound then // in draft 22 the test for underflow (candidate >= bound) uses a strict inequality, which makes it impossible to expand npn to 0\n let _ = lemma_mod_plus candidate (-1) bound in\n candidate - bound\n else candidate\n#pop-options\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\nlet lemma_uniqueness_in_window (pn_len: nat { pn_len < 4 }) (last: nat { last < pow2 62 }) (x: nat {x < pow2 62}) (y:nat {y < pow2 62}) : Lemma\n (requires (\n let h = bound_npn' pn_len in\n in_window pn_len last x /\\\n in_window pn_len last y /\\\n x%h = y%h))\n (ensures x = y) =\n let open FStar.Math.Lemmas in\n pow2_lt_compat 62 (8 `op_Multiply` (pn_len+1));\n let h = bound_npn' pn_len in\n if last+1 < h/2 && x < h then\n lemma_mod_plus_injective h 0 x y\n else if last+1 >= pow2 62 - h/2 && x >= pow2 62 - h then\n let low = pow2 62 - h in\n lemma_mod_plus_injective h low (x-low) (y-low)\n else\n let low = max (last+2-h/2) 0 in\n lemma_mod_plus_injective h low (x-low) (y-low)\n\nval lemma_parse_pn_correct : (pn_len: nat { pn_len < 4 }) -> last:nat{last+1 < pow2 62} -> (pn: nat { pn < U64.v U62.bound }) -> Lemma\n (requires in_window pn_len last pn)\n (ensures expand_pn' pn_len last (reduce_pn' pn_len pn) = pn)\n\nlet lemma_parse_pn_correct pn_len last pn =\n lemma_uniqueness_in_window pn_len last pn (expand_pn' pn_len last (reduce_pn' pn_len pn))\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nlet synth_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (npn: bounded_integer (Secret.v pn_len))\n: GTot (packet_number_t' last pn_len)\n= Secret.to_u64 (U64.uint_to_t (expand_pn' (Secret.v pn_len - 1) (Secret.v last) (U32.v npn)))\n\n#pop-options\n\nlet synth_packet_number_recip\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (pn: packet_number_t' last pn_len)\n: GTot (bounded_integer (Secret.v pn_len))\n= U32.uint_to_t (reduce_pn' (Secret.v pn_len - 1) (Secret.v pn))\n\n#push-options \"--z3rlimit 512\"\n\nlet synth_packet_number_injective\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Lemma\n (synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len))\n [SMTPat \n (synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len))\n ]\n= synth_inverse_intro' #(packet_number_t' last pn_len) #(bounded_integer (Secret.v pn_len)) (synth_packet_number_recip last pn_len) (synth_packet_number last pn_len) (fun pn -> ());\n synth_inverse_synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len)\n\nlet synth_packet_number_recip_inverse\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Lemma\n (synth_inverse #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len))\n [SMTPat (synth_inverse #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len))]\n= synth_inverse_intro' #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len) (fun pn ->\n lemma_parse_pn_correct (Secret.v pn_len - 1) (Secret.v last) (Secret.v pn)\n )\n\n#pop-options\n\n\nlet parse_reduced_pn\n (pn_len: packet_number_length_t)\n ()\n: GTot (parser parse_packet_number_kind (bounded_integer (Secret.v pn_len)))\n= weaken parse_packet_number_kind (parse_bounded_integer (Secret.v pn_len))\n\nlet parse_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Tot (parser parse_packet_number_kind (packet_number_t' last pn_len) )\n= lift_parser (parse_reduced_pn pn_len) `parse_synth` synth_packet_number last pn_len\n\nlet parse_packet_number_kind'_correct\n last pn_len\n= let p = parse_bounded_integer (Secret.v pn_len) `parse_synth` synth_packet_number last pn_len in\n let f\n (input: bytes)\n : Lemma\n (parse (parse_packet_number last pn_len) input == parse p input)\n = parse_synth_eq\n (lift_parser (parse_reduced_pn pn_len))\n (synth_packet_number last pn_len)\n input;\n parse_synth_eq\n (parse_bounded_integer (Secret.v pn_len))\n (synth_packet_number last pn_len)\n input\n in\n Classical.forall_intro f;\n parser_kind_prop_ext (total_constant_size_parser_kind (Secret.v pn_len)) (parse_packet_number last pn_len) p\n\nlet serialize_reduced_pn\n (pn_len: packet_number_length_t)\n (x: unit)", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.fst", "checked_file": "QUIC.Spec.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.Spec.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Combinators" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t -> x: Prims.unit\n -> Prims.GTot (LowParse.Spec.Base.serializer (QUIC.Spec.PacketNumber.parse_reduced_pn pn_len ()))", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "Prims.unit", "LowParse.Spec.Combinators.serialize_weaken", "LowParse.Spec.BoundedInt.parse_bounded_integer_kind", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "LowParse.Spec.BoundedInt.bounded_integer", "QUIC.Spec.PacketNumber.parse_packet_number_kind", "LowParse.Spec.BoundedInt.parse_bounded_integer", "LowParse.Spec.BoundedInt.serialize_bounded_integer", "LowParse.Spec.Base.serializer", "QUIC.Spec.PacketNumber.parse_reduced_pn" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_reduced_pn (pn_len: packet_number_length_t) (x: unit)\n : GTot (serializer (parse_reduced_pn pn_len ()))\nlet serialize_reduced_pn (pn_len: packet_number_length_t) (x: unit)\n : GTot (serializer (parse_reduced_pn pn_len ())) =", "completed_definiton": "serialize_weaken parse_packet_number_kind (serialize_bounded_integer (Secret.v pn_len))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.fst", "name": "QUIC.Spec.PacketNumber.serialize_packet_number_ext", "original_source_type": "val serialize_packet_number_ext\n (last1 last2: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (pn: packet_number_t)\n: Lemma\n (requires (\n in_window (Secret.v pn_len - 1) (Secret.v last1) (Secret.v pn) /\\\n in_window (Secret.v pn_len - 1) (Secret.v last2) (Secret.v pn)\n ))\n (ensures (\n serialize (serialize_packet_number last1 pn_len) pn == serialize (serialize_packet_number last2 pn_len) pn\n ))", "source_type": "val serialize_packet_number_ext\n (last1 last2: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (pn: packet_number_t)\n: Lemma\n (requires (\n in_window (Secret.v pn_len - 1) (Secret.v last1) (Secret.v pn) /\\\n in_window (Secret.v pn_len - 1) (Secret.v last2) (Secret.v pn)\n ))\n (ensures (\n serialize (serialize_packet_number last1 pn_len) pn == serialize (serialize_packet_number last2 pn_len) pn\n ))", "source_definition": "let serialize_packet_number_ext\n last1 last2 pn_len pn\n= serialize_synth_eq \n (lift_parser (parse_reduced_pn pn_len))\n (synth_packet_number last1 pn_len)\n (lift_serializer (serialize_reduced_pn pn_len))\n (synth_packet_number_recip last1 pn_len)\n ()\n pn;\n serialize_synth_eq \n (lift_parser (parse_reduced_pn pn_len))\n (synth_packet_number last2 pn_len)\n (lift_serializer (serialize_reduced_pn pn_len))\n (synth_packet_number_recip last2 pn_len)\n ()\n pn", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 174, "start_col": 2, "end_line": 187, "end_col": 6 }, "file_context": "module QUIC.Spec.PacketNumber\nopen QUIC.Spec.PacketNumber.Lemmas\nopen LowParse.Spec.Combinators\nopen LowParse.Spec.BoundedInt\n\n(* From https://tools.ietf.org/html/draft-ietf-quic-transport-22#appendix-A *)\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule Secret = QUIC.Secret.Int\n\nlet reduce_pn'\n (pn_len: nat { pn_len < 4 })\n (pn: nat)\n: Tot nat\n= pn % (bound_npn' pn_len)\n\nlet in_window_self (pn_len: nat { pn_len < 4 }) (pn:nat) : Lemma\n (in_window pn_len pn (if pn = 0 then 0 else pn - 1))\n= ()\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet expand_pn'\n (pn_len: nat { pn_len < 4 })\n (last: nat { last + 1 < pow2 62})\n (npn: nat { npn < bound_npn' pn_len })\n: Tot (pn: nat { pn < pow2 62 /\\ in_window pn_len last pn /\\ pn % bound_npn' pn_len == npn })\n=\n let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected = last + 1 in\n let bound = bound_npn' pn_len in\n let candidate = replace_modulo' expected bound npn in\n lemma_replace_modulo_bound expected (8*(pn_len+1)) npn 62;\n if candidate <= last + 1 - bound/2\n && candidate < pow2 62 - bound then // the test for overflow (candidate < pow2 62 - bound) is not present in draft 22.\n let _ = lemma_mod_plus candidate 1 bound in\n candidate + bound\n else if candidate > last + 1 + bound/2\n && candidate >= bound then // in draft 22 the test for underflow (candidate >= bound) uses a strict inequality, which makes it impossible to expand npn to 0\n let _ = lemma_mod_plus candidate (-1) bound in\n candidate - bound\n else candidate\n#pop-options\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\nlet lemma_uniqueness_in_window (pn_len: nat { pn_len < 4 }) (last: nat { last < pow2 62 }) (x: nat {x < pow2 62}) (y:nat {y < pow2 62}) : Lemma\n (requires (\n let h = bound_npn' pn_len in\n in_window pn_len last x /\\\n in_window pn_len last y /\\\n x%h = y%h))\n (ensures x = y) =\n let open FStar.Math.Lemmas in\n pow2_lt_compat 62 (8 `op_Multiply` (pn_len+1));\n let h = bound_npn' pn_len in\n if last+1 < h/2 && x < h then\n lemma_mod_plus_injective h 0 x y\n else if last+1 >= pow2 62 - h/2 && x >= pow2 62 - h then\n let low = pow2 62 - h in\n lemma_mod_plus_injective h low (x-low) (y-low)\n else\n let low = max (last+2-h/2) 0 in\n lemma_mod_plus_injective h low (x-low) (y-low)\n\nval lemma_parse_pn_correct : (pn_len: nat { pn_len < 4 }) -> last:nat{last+1 < pow2 62} -> (pn: nat { pn < U64.v U62.bound }) -> Lemma\n (requires in_window pn_len last pn)\n (ensures expand_pn' pn_len last (reduce_pn' pn_len pn) = pn)\n\nlet lemma_parse_pn_correct pn_len last pn =\n lemma_uniqueness_in_window pn_len last pn (expand_pn' pn_len last (reduce_pn' pn_len pn))\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nlet synth_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (npn: bounded_integer (Secret.v pn_len))\n: GTot (packet_number_t' last pn_len)\n= Secret.to_u64 (U64.uint_to_t (expand_pn' (Secret.v pn_len - 1) (Secret.v last) (U32.v npn)))\n\n#pop-options\n\nlet synth_packet_number_recip\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (pn: packet_number_t' last pn_len)\n: GTot (bounded_integer (Secret.v pn_len))\n= U32.uint_to_t (reduce_pn' (Secret.v pn_len - 1) (Secret.v pn))\n\n#push-options \"--z3rlimit 512\"\n\nlet synth_packet_number_injective\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Lemma\n (synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len))\n [SMTPat \n (synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len))\n ]\n= synth_inverse_intro' #(packet_number_t' last pn_len) #(bounded_integer (Secret.v pn_len)) (synth_packet_number_recip last pn_len) (synth_packet_number last pn_len) (fun pn -> ());\n synth_inverse_synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len)\n\nlet synth_packet_number_recip_inverse\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Lemma\n (synth_inverse #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len))\n [SMTPat (synth_inverse #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len))]\n= synth_inverse_intro' #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len) (fun pn ->\n lemma_parse_pn_correct (Secret.v pn_len - 1) (Secret.v last) (Secret.v pn)\n )\n\n#pop-options\n\n\nlet parse_reduced_pn\n (pn_len: packet_number_length_t)\n ()\n: GTot (parser parse_packet_number_kind (bounded_integer (Secret.v pn_len)))\n= weaken parse_packet_number_kind (parse_bounded_integer (Secret.v pn_len))\n\nlet parse_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Tot (parser parse_packet_number_kind (packet_number_t' last pn_len) )\n= lift_parser (parse_reduced_pn pn_len) `parse_synth` synth_packet_number last pn_len\n\nlet parse_packet_number_kind'_correct\n last pn_len\n= let p = parse_bounded_integer (Secret.v pn_len) `parse_synth` synth_packet_number last pn_len in\n let f\n (input: bytes)\n : Lemma\n (parse (parse_packet_number last pn_len) input == parse p input)\n = parse_synth_eq\n (lift_parser (parse_reduced_pn pn_len))\n (synth_packet_number last pn_len)\n input;\n parse_synth_eq\n (parse_bounded_integer (Secret.v pn_len))\n (synth_packet_number last pn_len)\n input\n in\n Classical.forall_intro f;\n parser_kind_prop_ext (total_constant_size_parser_kind (Secret.v pn_len)) (parse_packet_number last pn_len) p\n\nlet serialize_reduced_pn\n (pn_len: packet_number_length_t)\n (x: unit)\n: GTot (serializer (parse_reduced_pn pn_len ()))\n= serialize_weaken parse_packet_number_kind (serialize_bounded_integer (Secret.v pn_len))\n\nlet serialize_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Tot (serializer (parse_packet_number last pn_len))\n= serialize_synth\n (lift_parser (parse_reduced_pn pn_len))\n (synth_packet_number last pn_len)\n (lift_serializer (serialize_reduced_pn pn_len))\n (synth_packet_number_recip last pn_len)\n ()\n\nlet serialize_packet_number_ext", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.fst", "checked_file": "QUIC.Spec.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.Spec.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Combinators" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n last1: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n last2: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t\n -> FStar.Pervasives.Lemma\n (requires\n QUIC.Spec.PacketNumber.Base.in_window (QUIC.Secret.Int.Base.v pn_len - 1)\n (QUIC.Secret.Int.Base.v last1)\n (QUIC.Secret.Int.Base.v pn) /\\\n QUIC.Spec.PacketNumber.Base.in_window (QUIC.Secret.Int.Base.v pn_len - 1)\n (QUIC.Secret.Int.Base.v last2)\n (QUIC.Secret.Int.Base.v pn))\n (ensures\n LowParse.Spec.Base.serialize (QUIC.Spec.PacketNumber.serialize_packet_number last1 pn_len)\n pn ==\n LowParse.Spec.Base.serialize (QUIC.Spec.PacketNumber.serialize_packet_number last2 pn_len)\n pn)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "LowParse.Spec.Combinators.serialize_synth_eq", "QUIC.Spec.PacketNumber.parse_packet_number_kind", "LowParse.Spec.BoundedInt.bounded_integer", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "LowParse.Spec.Combinators.lift_parser", "QUIC.Spec.PacketNumber.parse_reduced_pn", "QUIC.Spec.PacketNumber.synth_packet_number", "LowParse.Spec.Combinators.lift_serializer", "QUIC.Spec.PacketNumber.serialize_reduced_pn", "QUIC.Spec.PacketNumber.synth_packet_number_recip", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize_packet_number_ext\n (last1 last2: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (pn: packet_number_t)\n: Lemma\n (requires (\n in_window (Secret.v pn_len - 1) (Secret.v last1) (Secret.v pn) /\\\n in_window (Secret.v pn_len - 1) (Secret.v last2) (Secret.v pn)\n ))\n (ensures (\n serialize (serialize_packet_number last1 pn_len) pn == serialize (serialize_packet_number last2 pn_len) pn\n ))\nlet serialize_packet_number_ext last1 last2 pn_len pn =", "completed_definiton": "serialize_synth_eq (lift_parser (parse_reduced_pn pn_len))\n (synth_packet_number last1 pn_len)\n (lift_serializer (serialize_reduced_pn pn_len))\n (synth_packet_number_recip last1 pn_len)\n ()\n pn;\nserialize_synth_eq (lift_parser (parse_reduced_pn pn_len))\n (synth_packet_number last2 pn_len)\n (lift_serializer (serialize_reduced_pn pn_len))\n (synth_packet_number_recip last2 pn_len)\n ()\n pn", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.fst", "name": "QUIC.Spec.PacketNumber.parse_packet_number_kind'_correct", "original_source_type": "val parse_packet_number_kind'_correct\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Lemma\n (parser_kind_prop (parse_packet_number_kind' pn_len) (parse_packet_number last pn_len))", "source_type": "val parse_packet_number_kind'_correct\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Lemma\n (parser_kind_prop (parse_packet_number_kind' pn_len) (parse_packet_number last pn_len))", "source_definition": "let parse_packet_number_kind'_correct\n last pn_len\n= let p = parse_bounded_integer (Secret.v pn_len) `parse_synth` synth_packet_number last pn_len in\n let f\n (input: bytes)\n : Lemma\n (parse (parse_packet_number last pn_len) input == parse p input)\n = parse_synth_eq\n (lift_parser (parse_reduced_pn pn_len))\n (synth_packet_number last pn_len)\n input;\n parse_synth_eq\n (parse_bounded_integer (Secret.v pn_len))\n (synth_packet_number last pn_len)\n input\n in\n Classical.forall_intro f;\n parser_kind_prop_ext (total_constant_size_parser_kind (Secret.v pn_len)) (parse_packet_number last pn_len) p", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 138, "start_col": 1, "end_line": 153, "end_col": 110 }, "file_context": "module QUIC.Spec.PacketNumber\nopen QUIC.Spec.PacketNumber.Lemmas\nopen LowParse.Spec.Combinators\nopen LowParse.Spec.BoundedInt\n\n(* From https://tools.ietf.org/html/draft-ietf-quic-transport-22#appendix-A *)\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule Secret = QUIC.Secret.Int\n\nlet reduce_pn'\n (pn_len: nat { pn_len < 4 })\n (pn: nat)\n: Tot nat\n= pn % (bound_npn' pn_len)\n\nlet in_window_self (pn_len: nat { pn_len < 4 }) (pn:nat) : Lemma\n (in_window pn_len pn (if pn = 0 then 0 else pn - 1))\n= ()\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet expand_pn'\n (pn_len: nat { pn_len < 4 })\n (last: nat { last + 1 < pow2 62})\n (npn: nat { npn < bound_npn' pn_len })\n: Tot (pn: nat { pn < pow2 62 /\\ in_window pn_len last pn /\\ pn % bound_npn' pn_len == npn })\n=\n let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected = last + 1 in\n let bound = bound_npn' pn_len in\n let candidate = replace_modulo' expected bound npn in\n lemma_replace_modulo_bound expected (8*(pn_len+1)) npn 62;\n if candidate <= last + 1 - bound/2\n && candidate < pow2 62 - bound then // the test for overflow (candidate < pow2 62 - bound) is not present in draft 22.\n let _ = lemma_mod_plus candidate 1 bound in\n candidate + bound\n else if candidate > last + 1 + bound/2\n && candidate >= bound then // in draft 22 the test for underflow (candidate >= bound) uses a strict inequality, which makes it impossible to expand npn to 0\n let _ = lemma_mod_plus candidate (-1) bound in\n candidate - bound\n else candidate\n#pop-options\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\nlet lemma_uniqueness_in_window (pn_len: nat { pn_len < 4 }) (last: nat { last < pow2 62 }) (x: nat {x < pow2 62}) (y:nat {y < pow2 62}) : Lemma\n (requires (\n let h = bound_npn' pn_len in\n in_window pn_len last x /\\\n in_window pn_len last y /\\\n x%h = y%h))\n (ensures x = y) =\n let open FStar.Math.Lemmas in\n pow2_lt_compat 62 (8 `op_Multiply` (pn_len+1));\n let h = bound_npn' pn_len in\n if last+1 < h/2 && x < h then\n lemma_mod_plus_injective h 0 x y\n else if last+1 >= pow2 62 - h/2 && x >= pow2 62 - h then\n let low = pow2 62 - h in\n lemma_mod_plus_injective h low (x-low) (y-low)\n else\n let low = max (last+2-h/2) 0 in\n lemma_mod_plus_injective h low (x-low) (y-low)\n\nval lemma_parse_pn_correct : (pn_len: nat { pn_len < 4 }) -> last:nat{last+1 < pow2 62} -> (pn: nat { pn < U64.v U62.bound }) -> Lemma\n (requires in_window pn_len last pn)\n (ensures expand_pn' pn_len last (reduce_pn' pn_len pn) = pn)\n\nlet lemma_parse_pn_correct pn_len last pn =\n lemma_uniqueness_in_window pn_len last pn (expand_pn' pn_len last (reduce_pn' pn_len pn))\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nlet synth_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (npn: bounded_integer (Secret.v pn_len))\n: GTot (packet_number_t' last pn_len)\n= Secret.to_u64 (U64.uint_to_t (expand_pn' (Secret.v pn_len - 1) (Secret.v last) (U32.v npn)))\n\n#pop-options\n\nlet synth_packet_number_recip\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (pn: packet_number_t' last pn_len)\n: GTot (bounded_integer (Secret.v pn_len))\n= U32.uint_to_t (reduce_pn' (Secret.v pn_len - 1) (Secret.v pn))\n\n#push-options \"--z3rlimit 512\"\n\nlet synth_packet_number_injective\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Lemma\n (synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len))\n [SMTPat \n (synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len))\n ]\n= synth_inverse_intro' #(packet_number_t' last pn_len) #(bounded_integer (Secret.v pn_len)) (synth_packet_number_recip last pn_len) (synth_packet_number last pn_len) (fun pn -> ());\n synth_inverse_synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len)\n\nlet synth_packet_number_recip_inverse\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Lemma\n (synth_inverse #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len))\n [SMTPat (synth_inverse #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len))]\n= synth_inverse_intro' #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len) (fun pn ->\n lemma_parse_pn_correct (Secret.v pn_len - 1) (Secret.v last) (Secret.v pn)\n )\n\n#pop-options\n\n\nlet parse_reduced_pn\n (pn_len: packet_number_length_t)\n ()\n: GTot (parser parse_packet_number_kind (bounded_integer (Secret.v pn_len)))\n= weaken parse_packet_number_kind (parse_bounded_integer (Secret.v pn_len))\n\nlet parse_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Tot (parser parse_packet_number_kind (packet_number_t' last pn_len) )\n= lift_parser (parse_reduced_pn pn_len) `parse_synth` synth_packet_number last pn_len\n\nlet parse_packet_number_kind'_correct", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.fst", "checked_file": "QUIC.Spec.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.Spec.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Combinators" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Base.parser_kind_prop (QUIC.Spec.PacketNumber.parse_packet_number_kind' pn_len)\n (QUIC.Spec.PacketNumber.parse_packet_number last pn_len))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "LowParse.Spec.Base.parser_kind_prop_ext", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "LowParse.Spec.Base.total_constant_size_parser_kind", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "QUIC.Spec.PacketNumber.parse_packet_number", "Prims.unit", "FStar.Classical.forall_intro", "LowParse.Bytes.bytes", "Prims.eq2", "FStar.Pervasives.Native.option", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Base.consumed_length", "LowParse.Spec.Base.parse", "Prims.l_True", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern", "LowParse.Spec.Combinators.parse_synth_eq", "LowParse.Spec.BoundedInt.parse_bounded_integer_kind", "LowParse.Spec.BoundedInt.bounded_integer", "LowParse.Spec.BoundedInt.parse_bounded_integer", "QUIC.Spec.PacketNumber.synth_packet_number", "QUIC.Spec.PacketNumber.parse_packet_number_kind", "LowParse.Spec.Combinators.lift_parser", "QUIC.Spec.PacketNumber.parse_reduced_pn", "LowParse.Spec.Base.parser", "Lib.IntTypes.v", "LowParse.Spec.Combinators.parse_synth" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_packet_number_kind'_correct\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Lemma\n (parser_kind_prop (parse_packet_number_kind' pn_len) (parse_packet_number last pn_len))\nlet parse_packet_number_kind'_correct last pn_len =", "completed_definiton": "let p = (parse_bounded_integer (Secret.v pn_len)) `parse_synth` (synth_packet_number last pn_len) in\nlet f (input: bytes) : Lemma (parse (parse_packet_number last pn_len) input == parse p input) =\n parse_synth_eq (lift_parser (parse_reduced_pn pn_len)) (synth_packet_number last pn_len) input;\n parse_synth_eq (parse_bounded_integer (Secret.v pn_len)) (synth_packet_number last pn_len) input\nin\nClassical.forall_intro f;\nparser_kind_prop_ext (total_constant_size_parser_kind (Secret.v pn_len))\n (parse_packet_number last pn_len)\n p", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.fst", "name": "QUIC.Spec.PacketNumber.lemma_parse_pn_correct", "original_source_type": "val lemma_parse_pn_correct : (pn_len: nat { pn_len < 4 }) -> last:nat{last+1 < pow2 62} -> (pn: nat { pn < U64.v U62.bound }) -> Lemma\n (requires in_window pn_len last pn)\n (ensures expand_pn' pn_len last (reduce_pn' pn_len pn) = pn)", "source_type": "val lemma_parse_pn_correct : (pn_len: nat { pn_len < 4 }) -> last:nat{last+1 < pow2 62} -> (pn: nat { pn < U64.v U62.bound }) -> Lemma\n (requires in_window pn_len last pn)\n (ensures expand_pn' pn_len last (reduce_pn' pn_len pn) = pn)", "source_definition": "let lemma_parse_pn_correct pn_len last pn =\n lemma_uniqueness_in_window pn_len last pn (expand_pn' pn_len last (reduce_pn' pn_len pn))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 77, "start_col": 2, "end_line": 77, "end_col": 91 }, "file_context": "module QUIC.Spec.PacketNumber\nopen QUIC.Spec.PacketNumber.Lemmas\nopen LowParse.Spec.Combinators\nopen LowParse.Spec.BoundedInt\n\n(* From https://tools.ietf.org/html/draft-ietf-quic-transport-22#appendix-A *)\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule Secret = QUIC.Secret.Int\n\nlet reduce_pn'\n (pn_len: nat { pn_len < 4 })\n (pn: nat)\n: Tot nat\n= pn % (bound_npn' pn_len)\n\nlet in_window_self (pn_len: nat { pn_len < 4 }) (pn:nat) : Lemma\n (in_window pn_len pn (if pn = 0 then 0 else pn - 1))\n= ()\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet expand_pn'\n (pn_len: nat { pn_len < 4 })\n (last: nat { last + 1 < pow2 62})\n (npn: nat { npn < bound_npn' pn_len })\n: Tot (pn: nat { pn < pow2 62 /\\ in_window pn_len last pn /\\ pn % bound_npn' pn_len == npn })\n=\n let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected = last + 1 in\n let bound = bound_npn' pn_len in\n let candidate = replace_modulo' expected bound npn in\n lemma_replace_modulo_bound expected (8*(pn_len+1)) npn 62;\n if candidate <= last + 1 - bound/2\n && candidate < pow2 62 - bound then // the test for overflow (candidate < pow2 62 - bound) is not present in draft 22.\n let _ = lemma_mod_plus candidate 1 bound in\n candidate + bound\n else if candidate > last + 1 + bound/2\n && candidate >= bound then // in draft 22 the test for underflow (candidate >= bound) uses a strict inequality, which makes it impossible to expand npn to 0\n let _ = lemma_mod_plus candidate (-1) bound in\n candidate - bound\n else candidate\n#pop-options\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\nlet lemma_uniqueness_in_window (pn_len: nat { pn_len < 4 }) (last: nat { last < pow2 62 }) (x: nat {x < pow2 62}) (y:nat {y < pow2 62}) : Lemma\n (requires (\n let h = bound_npn' pn_len in\n in_window pn_len last x /\\\n in_window pn_len last y /\\\n x%h = y%h))\n (ensures x = y) =\n let open FStar.Math.Lemmas in\n pow2_lt_compat 62 (8 `op_Multiply` (pn_len+1));\n let h = bound_npn' pn_len in\n if last+1 < h/2 && x < h then\n lemma_mod_plus_injective h 0 x y\n else if last+1 >= pow2 62 - h/2 && x >= pow2 62 - h then\n let low = pow2 62 - h in\n lemma_mod_plus_injective h low (x-low) (y-low)\n else\n let low = max (last+2-h/2) 0 in\n lemma_mod_plus_injective h low (x-low) (y-low)\n\nval lemma_parse_pn_correct : (pn_len: nat { pn_len < 4 }) -> last:nat{last+1 < pow2 62} -> (pn: nat { pn < U64.v U62.bound }) -> Lemma\n (requires in_window pn_len last pn)\n (ensures expand_pn' pn_len last (reduce_pn' pn_len pn) = pn)", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.fst", "checked_file": "QUIC.Spec.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.Spec.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Combinators" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n pn_len: Prims.nat{pn_len < 4} ->\n last: Prims.nat{last + 1 < Prims.pow2 62} ->\n pn: Prims.nat{pn < FStar.UInt64.v QUIC.UInt62.bound}\n -> FStar.Pervasives.Lemma (requires QUIC.Spec.PacketNumber.Base.in_window pn_len last pn)\n (ensures\n QUIC.Spec.PacketNumber.expand_pn' pn_len last (QUIC.Spec.PacketNumber.reduce_pn' pn_len pn) =\n pn)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Prims.op_Addition", "Prims.pow2", "FStar.UInt64.v", "QUIC.UInt62.bound", "QUIC.Spec.PacketNumber.lemma_uniqueness_in_window", "QUIC.Spec.PacketNumber.expand_pn'", "QUIC.Spec.PacketNumber.reduce_pn'", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_parse_pn_correct : (pn_len: nat { pn_len < 4 }) -> last:nat{last+1 < pow2 62} -> (pn: nat { pn < U64.v U62.bound }) -> Lemma\n (requires in_window pn_len last pn)\n (ensures expand_pn' pn_len last (reduce_pn' pn_len pn) = pn)\nlet lemma_parse_pn_correct pn_len last pn =", "completed_definiton": "lemma_uniqueness_in_window pn_len last pn (expand_pn' pn_len last (reduce_pn' pn_len pn))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.fst", "name": "QUIC.Spec.PacketNumber.synth_packet_number_recip", "original_source_type": "val synth_packet_number_recip\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (pn: packet_number_t' last pn_len)\n : GTot (bounded_integer (Secret.v pn_len))", "source_type": "val synth_packet_number_recip\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (pn: packet_number_t' last pn_len)\n : GTot (bounded_integer (Secret.v pn_len))", "source_definition": "let synth_packet_number_recip\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (pn: packet_number_t' last pn_len)\n: GTot (bounded_integer (Secret.v pn_len))\n= U32.uint_to_t (reduce_pn' (Secret.v pn_len - 1) (Secret.v pn))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 96, "start_col": 2, "end_line": 96, "end_col": 64 }, "file_context": "module QUIC.Spec.PacketNumber\nopen QUIC.Spec.PacketNumber.Lemmas\nopen LowParse.Spec.Combinators\nopen LowParse.Spec.BoundedInt\n\n(* From https://tools.ietf.org/html/draft-ietf-quic-transport-22#appendix-A *)\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule Secret = QUIC.Secret.Int\n\nlet reduce_pn'\n (pn_len: nat { pn_len < 4 })\n (pn: nat)\n: Tot nat\n= pn % (bound_npn' pn_len)\n\nlet in_window_self (pn_len: nat { pn_len < 4 }) (pn:nat) : Lemma\n (in_window pn_len pn (if pn = 0 then 0 else pn - 1))\n= ()\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet expand_pn'\n (pn_len: nat { pn_len < 4 })\n (last: nat { last + 1 < pow2 62})\n (npn: nat { npn < bound_npn' pn_len })\n: Tot (pn: nat { pn < pow2 62 /\\ in_window pn_len last pn /\\ pn % bound_npn' pn_len == npn })\n=\n let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected = last + 1 in\n let bound = bound_npn' pn_len in\n let candidate = replace_modulo' expected bound npn in\n lemma_replace_modulo_bound expected (8*(pn_len+1)) npn 62;\n if candidate <= last + 1 - bound/2\n && candidate < pow2 62 - bound then // the test for overflow (candidate < pow2 62 - bound) is not present in draft 22.\n let _ = lemma_mod_plus candidate 1 bound in\n candidate + bound\n else if candidate > last + 1 + bound/2\n && candidate >= bound then // in draft 22 the test for underflow (candidate >= bound) uses a strict inequality, which makes it impossible to expand npn to 0\n let _ = lemma_mod_plus candidate (-1) bound in\n candidate - bound\n else candidate\n#pop-options\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\nlet lemma_uniqueness_in_window (pn_len: nat { pn_len < 4 }) (last: nat { last < pow2 62 }) (x: nat {x < pow2 62}) (y:nat {y < pow2 62}) : Lemma\n (requires (\n let h = bound_npn' pn_len in\n in_window pn_len last x /\\\n in_window pn_len last y /\\\n x%h = y%h))\n (ensures x = y) =\n let open FStar.Math.Lemmas in\n pow2_lt_compat 62 (8 `op_Multiply` (pn_len+1));\n let h = bound_npn' pn_len in\n if last+1 < h/2 && x < h then\n lemma_mod_plus_injective h 0 x y\n else if last+1 >= pow2 62 - h/2 && x >= pow2 62 - h then\n let low = pow2 62 - h in\n lemma_mod_plus_injective h low (x-low) (y-low)\n else\n let low = max (last+2-h/2) 0 in\n lemma_mod_plus_injective h low (x-low) (y-low)\n\nval lemma_parse_pn_correct : (pn_len: nat { pn_len < 4 }) -> last:nat{last+1 < pow2 62} -> (pn: nat { pn < U64.v U62.bound }) -> Lemma\n (requires in_window pn_len last pn)\n (ensures expand_pn' pn_len last (reduce_pn' pn_len pn) = pn)\n\nlet lemma_parse_pn_correct pn_len last pn =\n lemma_uniqueness_in_window pn_len last pn (expand_pn' pn_len last (reduce_pn' pn_len pn))\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nlet synth_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (npn: bounded_integer (Secret.v pn_len))\n: GTot (packet_number_t' last pn_len)\n= Secret.to_u64 (U64.uint_to_t (expand_pn' (Secret.v pn_len - 1) (Secret.v last) (U32.v npn)))\n\n#pop-options\n\nlet synth_packet_number_recip\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (pn: packet_number_t' last pn_len)", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.fst", "checked_file": "QUIC.Spec.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.Spec.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Combinators" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t' last pn_len\n -> Prims.GTot (LowParse.Spec.BoundedInt.bounded_integer (QUIC.Secret.Int.Base.v pn_len))", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "FStar.UInt32.uint_to_t", "QUIC.Spec.PacketNumber.reduce_pn'", "Prims.op_Subtraction", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "Lib.IntTypes.U64", "LowParse.Spec.BoundedInt.bounded_integer" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_packet_number_recip\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (pn: packet_number_t' last pn_len)\n : GTot (bounded_integer (Secret.v pn_len))\nlet synth_packet_number_recip\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (pn: packet_number_t' last pn_len)\n : GTot (bounded_integer (Secret.v pn_len)) =", "completed_definiton": "U32.uint_to_t (reduce_pn' (Secret.v pn_len - 1) (Secret.v pn))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.fst", "name": "QUIC.Spec.PacketNumber.expand_pn'", "original_source_type": "val expand_pn'\n (pn_len: nat{pn_len < 4})\n (last: nat{last + 1 < pow2 62})\n (npn: nat{npn < bound_npn' pn_len})\n : Tot (pn: nat{pn < pow2 62 /\\ in_window pn_len last pn /\\ pn % bound_npn' pn_len == npn})", "source_type": "val expand_pn'\n (pn_len: nat{pn_len < 4})\n (last: nat{last + 1 < pow2 62})\n (npn: nat{npn < bound_npn' pn_len})\n : Tot (pn: nat{pn < pow2 62 /\\ in_window pn_len last pn /\\ pn % bound_npn' pn_len == npn})", "source_definition": "let expand_pn'\n (pn_len: nat { pn_len < 4 })\n (last: nat { last + 1 < pow2 62})\n (npn: nat { npn < bound_npn' pn_len })\n: Tot (pn: nat { pn < pow2 62 /\\ in_window pn_len last pn /\\ pn % bound_npn' pn_len == npn })\n=\n let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected = last + 1 in\n let bound = bound_npn' pn_len in\n let candidate = replace_modulo' expected bound npn in\n lemma_replace_modulo_bound expected (8*(pn_len+1)) npn 62;\n if candidate <= last + 1 - bound/2\n && candidate < pow2 62 - bound then // the test for overflow (candidate < pow2 62 - bound) is not present in draft 22.\n let _ = lemma_mod_plus candidate 1 bound in\n candidate + bound\n else if candidate > last + 1 + bound/2\n && candidate >= bound then // in draft 22 the test for underflow (candidate >= bound) uses a strict inequality, which makes it impossible to expand npn to 0\n let _ = lemma_mod_plus candidate (-1) bound in\n candidate - bound\n else candidate", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 33, "start_col": 2, "end_line": 47, "end_col": 16 }, "file_context": "module QUIC.Spec.PacketNumber\nopen QUIC.Spec.PacketNumber.Lemmas\nopen LowParse.Spec.Combinators\nopen LowParse.Spec.BoundedInt\n\n(* From https://tools.ietf.org/html/draft-ietf-quic-transport-22#appendix-A *)\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule Secret = QUIC.Secret.Int\n\nlet reduce_pn'\n (pn_len: nat { pn_len < 4 })\n (pn: nat)\n: Tot nat\n= pn % (bound_npn' pn_len)\n\nlet in_window_self (pn_len: nat { pn_len < 4 }) (pn:nat) : Lemma\n (in_window pn_len pn (if pn = 0 then 0 else pn - 1))\n= ()\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet expand_pn'\n (pn_len: nat { pn_len < 4 })\n (last: nat { last + 1 < pow2 62})\n (npn: nat { npn < bound_npn' pn_len })\n: Tot (pn: nat { pn < pow2 62 /\\ in_window pn_len last pn /\\ pn % bound_npn' pn_len == npn })", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.fst", "checked_file": "QUIC.Spec.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.Spec.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Combinators" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 1, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n pn_len: Prims.nat{pn_len < 4} ->\n last: Prims.nat{last + 1 < Prims.pow2 62} ->\n npn: Prims.nat{npn < QUIC.Spec.PacketNumber.Base.bound_npn' pn_len}\n -> pn:\n Prims.nat\n { pn < Prims.pow2 62 /\\ QUIC.Spec.PacketNumber.Base.in_window pn_len last pn /\\\n pn % QUIC.Spec.PacketNumber.Base.bound_npn' pn_len == npn }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Prims.op_Addition", "Prims.pow2", "QUIC.Spec.PacketNumber.Base.bound_npn'", "Prims.op_AmpAmp", "Prims.op_LessThanOrEqual", "Prims.op_Subtraction", "Prims.op_Division", "Prims.unit", "FStar.Math.Lemmas.lemma_mod_plus", "Prims.bool", "Prims.op_GreaterThan", "Prims.op_GreaterThanOrEqual", "Prims.op_Minus", "Prims.l_and", "QUIC.Spec.PacketNumber.Base.in_window", "Prims.eq2", "Prims.int", "Prims.op_Modulus", "QUIC.Spec.PacketNumber.Lemmas.lemma_replace_modulo_bound", "FStar.Mul.op_Star", "QUIC.Spec.PacketNumber.Lemmas.replace_modulo'", "Prims.l_or", "Prims.op_Multiply" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val expand_pn'\n (pn_len: nat{pn_len < 4})\n (last: nat{last + 1 < pow2 62})\n (npn: nat{npn < bound_npn' pn_len})\n : Tot (pn: nat{pn < pow2 62 /\\ in_window pn_len last pn /\\ pn % bound_npn' pn_len == npn})\nlet expand_pn'\n (pn_len: nat{pn_len < 4})\n (last: nat{last + 1 < pow2 62})\n (npn: nat{npn < bound_npn' pn_len})\n : Tot (pn: nat{pn < pow2 62 /\\ in_window pn_len last pn /\\ pn % bound_npn' pn_len == npn}) =", "completed_definiton": "let open FStar.Mul in\nlet open FStar.Math.Lemmas in\nlet expected = last + 1 in\nlet bound = bound_npn' pn_len in\nlet candidate = replace_modulo' expected bound npn in\nlemma_replace_modulo_bound expected (8 * (pn_len + 1)) npn 62;\nif candidate <= last + 1 - bound / 2 && candidate < pow2 62 - bound\nthen\n let _ = lemma_mod_plus candidate 1 bound in\n candidate + bound\nelse\n if candidate > last + 1 + bound / 2 && candidate >= bound\n then\n let _ = lemma_mod_plus candidate (- 1) bound in\n candidate - bound\n else candidate", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.fst", "name": "QUIC.Spec.PacketNumber.synth_packet_number", "original_source_type": "val synth_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (npn: bounded_integer (Secret.v pn_len))\n : GTot (packet_number_t' last pn_len)", "source_type": "val synth_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (npn: bounded_integer (Secret.v pn_len))\n : GTot (packet_number_t' last pn_len)", "source_definition": "let synth_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (npn: bounded_integer (Secret.v pn_len))\n: GTot (packet_number_t' last pn_len)\n= Secret.to_u64 (U64.uint_to_t (expand_pn' (Secret.v pn_len - 1) (Secret.v last) (U32.v npn)))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 87, "start_col": 2, "end_line": 87, "end_col": 94 }, "file_context": "module QUIC.Spec.PacketNumber\nopen QUIC.Spec.PacketNumber.Lemmas\nopen LowParse.Spec.Combinators\nopen LowParse.Spec.BoundedInt\n\n(* From https://tools.ietf.org/html/draft-ietf-quic-transport-22#appendix-A *)\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule Secret = QUIC.Secret.Int\n\nlet reduce_pn'\n (pn_len: nat { pn_len < 4 })\n (pn: nat)\n: Tot nat\n= pn % (bound_npn' pn_len)\n\nlet in_window_self (pn_len: nat { pn_len < 4 }) (pn:nat) : Lemma\n (in_window pn_len pn (if pn = 0 then 0 else pn - 1))\n= ()\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet expand_pn'\n (pn_len: nat { pn_len < 4 })\n (last: nat { last + 1 < pow2 62})\n (npn: nat { npn < bound_npn' pn_len })\n: Tot (pn: nat { pn < pow2 62 /\\ in_window pn_len last pn /\\ pn % bound_npn' pn_len == npn })\n=\n let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected = last + 1 in\n let bound = bound_npn' pn_len in\n let candidate = replace_modulo' expected bound npn in\n lemma_replace_modulo_bound expected (8*(pn_len+1)) npn 62;\n if candidate <= last + 1 - bound/2\n && candidate < pow2 62 - bound then // the test for overflow (candidate < pow2 62 - bound) is not present in draft 22.\n let _ = lemma_mod_plus candidate 1 bound in\n candidate + bound\n else if candidate > last + 1 + bound/2\n && candidate >= bound then // in draft 22 the test for underflow (candidate >= bound) uses a strict inequality, which makes it impossible to expand npn to 0\n let _ = lemma_mod_plus candidate (-1) bound in\n candidate - bound\n else candidate\n#pop-options\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\nlet lemma_uniqueness_in_window (pn_len: nat { pn_len < 4 }) (last: nat { last < pow2 62 }) (x: nat {x < pow2 62}) (y:nat {y < pow2 62}) : Lemma\n (requires (\n let h = bound_npn' pn_len in\n in_window pn_len last x /\\\n in_window pn_len last y /\\\n x%h = y%h))\n (ensures x = y) =\n let open FStar.Math.Lemmas in\n pow2_lt_compat 62 (8 `op_Multiply` (pn_len+1));\n let h = bound_npn' pn_len in\n if last+1 < h/2 && x < h then\n lemma_mod_plus_injective h 0 x y\n else if last+1 >= pow2 62 - h/2 && x >= pow2 62 - h then\n let low = pow2 62 - h in\n lemma_mod_plus_injective h low (x-low) (y-low)\n else\n let low = max (last+2-h/2) 0 in\n lemma_mod_plus_injective h low (x-low) (y-low)\n\nval lemma_parse_pn_correct : (pn_len: nat { pn_len < 4 }) -> last:nat{last+1 < pow2 62} -> (pn: nat { pn < U64.v U62.bound }) -> Lemma\n (requires in_window pn_len last pn)\n (ensures expand_pn' pn_len last (reduce_pn' pn_len pn) = pn)\n\nlet lemma_parse_pn_correct pn_len last pn =\n lemma_uniqueness_in_window pn_len last pn (expand_pn' pn_len last (reduce_pn' pn_len pn))\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nlet synth_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (npn: bounded_integer (Secret.v pn_len))", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.fst", "checked_file": "QUIC.Spec.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.Spec.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Combinators" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n npn: LowParse.Spec.BoundedInt.bounded_integer (QUIC.Secret.Int.Base.v pn_len)\n -> Prims.GTot (QUIC.Spec.PacketNumber.Base.packet_number_t' last pn_len)", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "LowParse.Spec.BoundedInt.bounded_integer", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "Lib.IntTypes.to_u64", "Lib.IntTypes.U64", "Lib.IntTypes.PUB", "FStar.UInt64.uint_to_t", "QUIC.Spec.PacketNumber.expand_pn'", "Prims.op_Subtraction", "FStar.UInt32.v", "QUIC.Spec.PacketNumber.Base.packet_number_t'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (npn: bounded_integer (Secret.v pn_len))\n : GTot (packet_number_t' last pn_len)\nlet synth_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (npn: bounded_integer (Secret.v pn_len))\n : GTot (packet_number_t' last pn_len) =", "completed_definiton": "Secret.to_u64 (U64.uint_to_t (expand_pn' (Secret.v pn_len - 1) (Secret.v last) (U32.v npn)))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.fst", "name": "QUIC.Spec.PacketNumber.lemma_uniqueness_in_window", "original_source_type": "val lemma_uniqueness_in_window\n (pn_len: nat{pn_len < 4})\n (last: nat{last < pow2 62})\n (x: nat{x < pow2 62})\n (y: nat{y < pow2 62})\n : Lemma\n (requires\n (let h = bound_npn' pn_len in\n in_window pn_len last x /\\ in_window pn_len last y /\\ x % h = y % h)) (ensures x = y)", "source_type": "val lemma_uniqueness_in_window\n (pn_len: nat{pn_len < 4})\n (last: nat{last < pow2 62})\n (x: nat{x < pow2 62})\n (y: nat{y < pow2 62})\n : Lemma\n (requires\n (let h = bound_npn' pn_len in\n in_window pn_len last x /\\ in_window pn_len last y /\\ x % h = y % h)) (ensures x = y)", "source_definition": "let lemma_uniqueness_in_window (pn_len: nat { pn_len < 4 }) (last: nat { last < pow2 62 }) (x: nat {x < pow2 62}) (y:nat {y < pow2 62}) : Lemma\n (requires (\n let h = bound_npn' pn_len in\n in_window pn_len last x /\\\n in_window pn_len last y /\\\n x%h = y%h))\n (ensures x = y) =\n let open FStar.Math.Lemmas in\n pow2_lt_compat 62 (8 `op_Multiply` (pn_len+1));\n let h = bound_npn' pn_len in\n if last+1 < h/2 && x < h then\n lemma_mod_plus_injective h 0 x y\n else if last+1 >= pow2 62 - h/2 && x >= pow2 62 - h then\n let low = pow2 62 - h in\n lemma_mod_plus_injective h low (x-low) (y-low)\n else\n let low = max (last+2-h/2) 0 in\n lemma_mod_plus_injective h low (x-low) (y-low)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 60, "start_col": 2, "end_line": 70, "end_col": 50 }, "file_context": "module QUIC.Spec.PacketNumber\nopen QUIC.Spec.PacketNumber.Lemmas\nopen LowParse.Spec.Combinators\nopen LowParse.Spec.BoundedInt\n\n(* From https://tools.ietf.org/html/draft-ietf-quic-transport-22#appendix-A *)\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule Secret = QUIC.Secret.Int\n\nlet reduce_pn'\n (pn_len: nat { pn_len < 4 })\n (pn: nat)\n: Tot nat\n= pn % (bound_npn' pn_len)\n\nlet in_window_self (pn_len: nat { pn_len < 4 }) (pn:nat) : Lemma\n (in_window pn_len pn (if pn = 0 then 0 else pn - 1))\n= ()\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet expand_pn'\n (pn_len: nat { pn_len < 4 })\n (last: nat { last + 1 < pow2 62})\n (npn: nat { npn < bound_npn' pn_len })\n: Tot (pn: nat { pn < pow2 62 /\\ in_window pn_len last pn /\\ pn % bound_npn' pn_len == npn })\n=\n let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected = last + 1 in\n let bound = bound_npn' pn_len in\n let candidate = replace_modulo' expected bound npn in\n lemma_replace_modulo_bound expected (8*(pn_len+1)) npn 62;\n if candidate <= last + 1 - bound/2\n && candidate < pow2 62 - bound then // the test for overflow (candidate < pow2 62 - bound) is not present in draft 22.\n let _ = lemma_mod_plus candidate 1 bound in\n candidate + bound\n else if candidate > last + 1 + bound/2\n && candidate >= bound then // in draft 22 the test for underflow (candidate >= bound) uses a strict inequality, which makes it impossible to expand npn to 0\n let _ = lemma_mod_plus candidate (-1) bound in\n candidate - bound\n else candidate\n#pop-options\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\nlet lemma_uniqueness_in_window (pn_len: nat { pn_len < 4 }) (last: nat { last < pow2 62 }) (x: nat {x < pow2 62}) (y:nat {y < pow2 62}) : Lemma\n (requires (\n let h = bound_npn' pn_len in\n in_window pn_len last x /\\\n in_window pn_len last y /\\\n x%h = y%h))", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.fst", "checked_file": "QUIC.Spec.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.Spec.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Combinators" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n pn_len: Prims.nat{pn_len < 4} ->\n last: Prims.nat{last < Prims.pow2 62} ->\n x: Prims.nat{x < Prims.pow2 62} ->\n y: Prims.nat{y < Prims.pow2 62}\n -> FStar.Pervasives.Lemma\n (requires\n (let h = QUIC.Spec.PacketNumber.Base.bound_npn' pn_len in\n QUIC.Spec.PacketNumber.Base.in_window pn_len last x /\\\n QUIC.Spec.PacketNumber.Base.in_window pn_len last y /\\ x % h = y % h)) (ensures x = y)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Prims.pow2", "Prims.op_AmpAmp", "Prims.op_Addition", "Prims.op_Division", "FStar.Math.Lemmas.lemma_mod_plus_injective", "Prims.bool", "Prims.op_GreaterThanOrEqual", "Prims.op_Subtraction", "Prims.int", "Prims.l_and", "QUIC.Spec.PacketNumber.max", "Prims.unit", "Prims.eq2", "Prims.l_or", "Prims.op_GreaterThan", "Prims.op_Multiply", "QUIC.Spec.PacketNumber.Base.bound_npn'", "FStar.Math.Lemmas.pow2_lt_compat", "QUIC.Spec.PacketNumber.Base.in_window", "Prims.op_Equality", "Prims.op_Modulus", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_uniqueness_in_window\n (pn_len: nat{pn_len < 4})\n (last: nat{last < pow2 62})\n (x: nat{x < pow2 62})\n (y: nat{y < pow2 62})\n : Lemma\n (requires\n (let h = bound_npn' pn_len in\n in_window pn_len last x /\\ in_window pn_len last y /\\ x % h = y % h)) (ensures x = y)\nlet lemma_uniqueness_in_window\n (pn_len: nat{pn_len < 4})\n (last: nat{last < pow2 62})\n (x: nat{x < pow2 62})\n (y: nat{y < pow2 62})\n : Lemma\n (requires\n (let h = bound_npn' pn_len in\n in_window pn_len last x /\\ in_window pn_len last y /\\ x % h = y % h)) (ensures x = y) =", "completed_definiton": "let open FStar.Math.Lemmas in\npow2_lt_compat 62 (8 `op_Multiply` (pn_len + 1));\nlet h = bound_npn' pn_len in\nif last + 1 < h / 2 && x < h\nthen lemma_mod_plus_injective h 0 x y\nelse\n if last + 1 >= pow2 62 - h / 2 && x >= pow2 62 - h\n then\n let low = pow2 62 - h in\n lemma_mod_plus_injective h low (x - low) (y - low)\n else\n let low = max (last + 2 - h / 2) 0 in\n lemma_mod_plus_injective h low (x - low) (y - low)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.fst", "name": "QUIC.Spec.PacketNumber.synth_packet_number_recip_inverse", "original_source_type": "val synth_packet_number_recip_inverse (last: last_packet_number_t) (pn_len: packet_number_length_t)\n : Lemma\n (synth_inverse #(bounded_integer (Secret.v pn_len))\n #(packet_number_t' last pn_len)\n (synth_packet_number last pn_len)\n (synth_packet_number_recip last pn_len))\n [\n SMTPat\n (synth_inverse #(bounded_integer (Secret.v pn_len))\n #(packet_number_t' last pn_len)\n (synth_packet_number last pn_len)\n (synth_packet_number_recip last pn_len))\n ]", "source_type": "val synth_packet_number_recip_inverse (last: last_packet_number_t) (pn_len: packet_number_length_t)\n : Lemma\n (synth_inverse #(bounded_integer (Secret.v pn_len))\n #(packet_number_t' last pn_len)\n (synth_packet_number last pn_len)\n (synth_packet_number_recip last pn_len))\n [\n SMTPat\n (synth_inverse #(bounded_integer (Secret.v pn_len))\n #(packet_number_t' last pn_len)\n (synth_packet_number last pn_len)\n (synth_packet_number_recip last pn_len))\n ]", "source_definition": "let synth_packet_number_recip_inverse\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Lemma\n (synth_inverse #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len))\n [SMTPat (synth_inverse #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len))]\n= synth_inverse_intro' #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len) (fun pn ->\n lemma_parse_pn_correct (Secret.v pn_len - 1) (Secret.v last) (Secret.v pn)\n )", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 117, "start_col": 2, "end_line": 119, "end_col": 3 }, "file_context": "module QUIC.Spec.PacketNumber\nopen QUIC.Spec.PacketNumber.Lemmas\nopen LowParse.Spec.Combinators\nopen LowParse.Spec.BoundedInt\n\n(* From https://tools.ietf.org/html/draft-ietf-quic-transport-22#appendix-A *)\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule Secret = QUIC.Secret.Int\n\nlet reduce_pn'\n (pn_len: nat { pn_len < 4 })\n (pn: nat)\n: Tot nat\n= pn % (bound_npn' pn_len)\n\nlet in_window_self (pn_len: nat { pn_len < 4 }) (pn:nat) : Lemma\n (in_window pn_len pn (if pn = 0 then 0 else pn - 1))\n= ()\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet expand_pn'\n (pn_len: nat { pn_len < 4 })\n (last: nat { last + 1 < pow2 62})\n (npn: nat { npn < bound_npn' pn_len })\n: Tot (pn: nat { pn < pow2 62 /\\ in_window pn_len last pn /\\ pn % bound_npn' pn_len == npn })\n=\n let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected = last + 1 in\n let bound = bound_npn' pn_len in\n let candidate = replace_modulo' expected bound npn in\n lemma_replace_modulo_bound expected (8*(pn_len+1)) npn 62;\n if candidate <= last + 1 - bound/2\n && candidate < pow2 62 - bound then // the test for overflow (candidate < pow2 62 - bound) is not present in draft 22.\n let _ = lemma_mod_plus candidate 1 bound in\n candidate + bound\n else if candidate > last + 1 + bound/2\n && candidate >= bound then // in draft 22 the test for underflow (candidate >= bound) uses a strict inequality, which makes it impossible to expand npn to 0\n let _ = lemma_mod_plus candidate (-1) bound in\n candidate - bound\n else candidate\n#pop-options\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\nlet lemma_uniqueness_in_window (pn_len: nat { pn_len < 4 }) (last: nat { last < pow2 62 }) (x: nat {x < pow2 62}) (y:nat {y < pow2 62}) : Lemma\n (requires (\n let h = bound_npn' pn_len in\n in_window pn_len last x /\\\n in_window pn_len last y /\\\n x%h = y%h))\n (ensures x = y) =\n let open FStar.Math.Lemmas in\n pow2_lt_compat 62 (8 `op_Multiply` (pn_len+1));\n let h = bound_npn' pn_len in\n if last+1 < h/2 && x < h then\n lemma_mod_plus_injective h 0 x y\n else if last+1 >= pow2 62 - h/2 && x >= pow2 62 - h then\n let low = pow2 62 - h in\n lemma_mod_plus_injective h low (x-low) (y-low)\n else\n let low = max (last+2-h/2) 0 in\n lemma_mod_plus_injective h low (x-low) (y-low)\n\nval lemma_parse_pn_correct : (pn_len: nat { pn_len < 4 }) -> last:nat{last+1 < pow2 62} -> (pn: nat { pn < U64.v U62.bound }) -> Lemma\n (requires in_window pn_len last pn)\n (ensures expand_pn' pn_len last (reduce_pn' pn_len pn) = pn)\n\nlet lemma_parse_pn_correct pn_len last pn =\n lemma_uniqueness_in_window pn_len last pn (expand_pn' pn_len last (reduce_pn' pn_len pn))\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nlet synth_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (npn: bounded_integer (Secret.v pn_len))\n: GTot (packet_number_t' last pn_len)\n= Secret.to_u64 (U64.uint_to_t (expand_pn' (Secret.v pn_len - 1) (Secret.v last) (U32.v npn)))\n\n#pop-options\n\nlet synth_packet_number_recip\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (pn: packet_number_t' last pn_len)\n: GTot (bounded_integer (Secret.v pn_len))\n= U32.uint_to_t (reduce_pn' (Secret.v pn_len - 1) (Secret.v pn))\n\n#push-options \"--z3rlimit 512\"\n\nlet synth_packet_number_injective\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Lemma\n (synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len))\n [SMTPat \n (synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len))\n ]\n= synth_inverse_intro' #(packet_number_t' last pn_len) #(bounded_integer (Secret.v pn_len)) (synth_packet_number_recip last pn_len) (synth_packet_number last pn_len) (fun pn -> ());\n synth_inverse_synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len)\n\nlet synth_packet_number_recip_inverse\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Lemma\n (synth_inverse #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len))", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.fst", "checked_file": "QUIC.Spec.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.Spec.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Combinators" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 512, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_inverse (QUIC.Spec.PacketNumber.synth_packet_number last\n pn_len)\n (QUIC.Spec.PacketNumber.synth_packet_number_recip last pn_len))\n [\n SMTPat (LowParse.Spec.Combinators.synth_inverse (QUIC.Spec.PacketNumber.synth_packet_number last\n pn_len)\n (QUIC.Spec.PacketNumber.synth_packet_number_recip last pn_len))\n ]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "LowParse.Spec.Combinators.synth_inverse_intro'", "LowParse.Spec.BoundedInt.bounded_integer", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "QUIC.Spec.PacketNumber.synth_packet_number", "QUIC.Spec.PacketNumber.synth_packet_number_recip", "QUIC.Spec.PacketNumber.lemma_parse_pn_correct", "Prims.op_Subtraction", "Lib.IntTypes.U64", "Prims.unit", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_inverse", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_packet_number_recip_inverse (last: last_packet_number_t) (pn_len: packet_number_length_t)\n : Lemma\n (synth_inverse #(bounded_integer (Secret.v pn_len))\n #(packet_number_t' last pn_len)\n (synth_packet_number last pn_len)\n (synth_packet_number_recip last pn_len))\n [\n SMTPat\n (synth_inverse #(bounded_integer (Secret.v pn_len))\n #(packet_number_t' last pn_len)\n (synth_packet_number last pn_len)\n (synth_packet_number_recip last pn_len))\n ]\nlet synth_packet_number_recip_inverse (last: last_packet_number_t) (pn_len: packet_number_length_t)\n : Lemma\n (synth_inverse #(bounded_integer (Secret.v pn_len))\n #(packet_number_t' last pn_len)\n (synth_packet_number last pn_len)\n (synth_packet_number_recip last pn_len))\n [\n SMTPat\n (synth_inverse #(bounded_integer (Secret.v pn_len))\n #(packet_number_t' last pn_len)\n (synth_packet_number last pn_len)\n (synth_packet_number_recip last pn_len))\n ] =", "completed_definiton": "synth_inverse_intro' #(bounded_integer (Secret.v pn_len))\n #(packet_number_t' last pn_len)\n (synth_packet_number last pn_len)\n (synth_packet_number_recip last pn_len)\n (fun pn -> lemma_parse_pn_correct (Secret.v pn_len - 1) (Secret.v last) (Secret.v pn))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.fst", "name": "QUIC.Spec.PacketNumber.synth_packet_number_injective", "original_source_type": "val synth_packet_number_injective (last: last_packet_number_t) (pn_len: packet_number_length_t)\n : Lemma\n (synth_injective #(bounded_integer (Secret.v pn_len))\n #(packet_number_t' last pn_len)\n (synth_packet_number last pn_len))\n [\n SMTPat\n (synth_injective #(bounded_integer (Secret.v pn_len))\n #(packet_number_t' last pn_len)\n (synth_packet_number last pn_len))\n ]", "source_type": "val synth_packet_number_injective (last: last_packet_number_t) (pn_len: packet_number_length_t)\n : Lemma\n (synth_injective #(bounded_integer (Secret.v pn_len))\n #(packet_number_t' last pn_len)\n (synth_packet_number last pn_len))\n [\n SMTPat\n (synth_injective #(bounded_integer (Secret.v pn_len))\n #(packet_number_t' last pn_len)\n (synth_packet_number last pn_len))\n ]", "source_definition": "let synth_packet_number_injective\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Lemma\n (synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len))\n [SMTPat \n (synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len))\n ]\n= synth_inverse_intro' #(packet_number_t' last pn_len) #(bounded_integer (Secret.v pn_len)) (synth_packet_number_recip last pn_len) (synth_packet_number last pn_len) (fun pn -> ());\n synth_inverse_synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len) (synth_packet_number_recip last pn_len)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 108, "start_col": 2, "end_line": 109, "end_col": 174 }, "file_context": "module QUIC.Spec.PacketNumber\nopen QUIC.Spec.PacketNumber.Lemmas\nopen LowParse.Spec.Combinators\nopen LowParse.Spec.BoundedInt\n\n(* From https://tools.ietf.org/html/draft-ietf-quic-transport-22#appendix-A *)\n\nmodule Cast = FStar.Int.Cast\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U16 = FStar.UInt16\nmodule U8 = FStar.UInt8\n\nmodule Secret = QUIC.Secret.Int\n\nlet reduce_pn'\n (pn_len: nat { pn_len < 4 })\n (pn: nat)\n: Tot nat\n= pn % (bound_npn' pn_len)\n\nlet in_window_self (pn_len: nat { pn_len < 4 }) (pn:nat) : Lemma\n (in_window pn_len pn (if pn = 0 then 0 else pn - 1))\n= ()\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet expand_pn'\n (pn_len: nat { pn_len < 4 })\n (last: nat { last + 1 < pow2 62})\n (npn: nat { npn < bound_npn' pn_len })\n: Tot (pn: nat { pn < pow2 62 /\\ in_window pn_len last pn /\\ pn % bound_npn' pn_len == npn })\n=\n let open FStar.Mul in\n let open FStar.Math.Lemmas in\n let expected = last + 1 in\n let bound = bound_npn' pn_len in\n let candidate = replace_modulo' expected bound npn in\n lemma_replace_modulo_bound expected (8*(pn_len+1)) npn 62;\n if candidate <= last + 1 - bound/2\n && candidate < pow2 62 - bound then // the test for overflow (candidate < pow2 62 - bound) is not present in draft 22.\n let _ = lemma_mod_plus candidate 1 bound in\n candidate + bound\n else if candidate > last + 1 + bound/2\n && candidate >= bound then // in draft 22 the test for underflow (candidate >= bound) uses a strict inequality, which makes it impossible to expand npn to 0\n let _ = lemma_mod_plus candidate (-1) bound in\n candidate - bound\n else candidate\n#pop-options\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\nlet lemma_uniqueness_in_window (pn_len: nat { pn_len < 4 }) (last: nat { last < pow2 62 }) (x: nat {x < pow2 62}) (y:nat {y < pow2 62}) : Lemma\n (requires (\n let h = bound_npn' pn_len in\n in_window pn_len last x /\\\n in_window pn_len last y /\\\n x%h = y%h))\n (ensures x = y) =\n let open FStar.Math.Lemmas in\n pow2_lt_compat 62 (8 `op_Multiply` (pn_len+1));\n let h = bound_npn' pn_len in\n if last+1 < h/2 && x < h then\n lemma_mod_plus_injective h 0 x y\n else if last+1 >= pow2 62 - h/2 && x >= pow2 62 - h then\n let low = pow2 62 - h in\n lemma_mod_plus_injective h low (x-low) (y-low)\n else\n let low = max (last+2-h/2) 0 in\n lemma_mod_plus_injective h low (x-low) (y-low)\n\nval lemma_parse_pn_correct : (pn_len: nat { pn_len < 4 }) -> last:nat{last+1 < pow2 62} -> (pn: nat { pn < U64.v U62.bound }) -> Lemma\n (requires in_window pn_len last pn)\n (ensures expand_pn' pn_len last (reduce_pn' pn_len pn) = pn)\n\nlet lemma_parse_pn_correct pn_len last pn =\n lemma_uniqueness_in_window pn_len last pn (expand_pn' pn_len last (reduce_pn' pn_len pn))\n\n#push-options \"--z3rlimit 16\"\n\ninline_for_extraction\nlet synth_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (npn: bounded_integer (Secret.v pn_len))\n: GTot (packet_number_t' last pn_len)\n= Secret.to_u64 (U64.uint_to_t (expand_pn' (Secret.v pn_len - 1) (Secret.v last) (U32.v npn)))\n\n#pop-options\n\nlet synth_packet_number_recip\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n (pn: packet_number_t' last pn_len)\n: GTot (bounded_integer (Secret.v pn_len))\n= U32.uint_to_t (reduce_pn' (Secret.v pn_len - 1) (Secret.v pn))\n\n#push-options \"--z3rlimit 512\"\n\nlet synth_packet_number_injective\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Lemma\n (synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len))\n [SMTPat \n (synth_injective #(bounded_integer (Secret.v pn_len)) #(packet_number_t' last pn_len) (synth_packet_number last pn_len))", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.fst", "checked_file": "QUIC.Spec.PacketNumber.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Combinators.fsti.checked", "LowParse.Spec.BoundedInt.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Combinators" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 512, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.Spec.Combinators.synth_injective (QUIC.Spec.PacketNumber.synth_packet_number last\n pn_len))\n [\n SMTPat (LowParse.Spec.Combinators.synth_injective (QUIC.Spec.PacketNumber.synth_packet_number\n last\n pn_len))\n ]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "LowParse.Spec.Combinators.synth_inverse_synth_injective", "LowParse.Spec.BoundedInt.bounded_integer", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "QUIC.Spec.PacketNumber.synth_packet_number", "QUIC.Spec.PacketNumber.synth_packet_number_recip", "Prims.unit", "LowParse.Spec.Combinators.synth_inverse_intro'", "Prims.l_True", "Prims.squash", "LowParse.Spec.Combinators.synth_injective", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_packet_number_injective (last: last_packet_number_t) (pn_len: packet_number_length_t)\n : Lemma\n (synth_injective #(bounded_integer (Secret.v pn_len))\n #(packet_number_t' last pn_len)\n (synth_packet_number last pn_len))\n [\n SMTPat\n (synth_injective #(bounded_integer (Secret.v pn_len))\n #(packet_number_t' last pn_len)\n (synth_packet_number last pn_len))\n ]\nlet synth_packet_number_injective (last: last_packet_number_t) (pn_len: packet_number_length_t)\n : Lemma\n (synth_injective #(bounded_integer (Secret.v pn_len))\n #(packet_number_t' last pn_len)\n (synth_packet_number last pn_len))\n [\n SMTPat\n (synth_injective #(bounded_integer (Secret.v pn_len))\n #(packet_number_t' last pn_len)\n (synth_packet_number last pn_len))\n ] =", "completed_definiton": "synth_inverse_intro' #(packet_number_t' last pn_len)\n #(bounded_integer (Secret.v pn_len))\n (synth_packet_number_recip last pn_len)\n (synth_packet_number last pn_len)\n (fun pn -> ());\nsynth_inverse_synth_injective #(bounded_integer (Secret.v pn_len))\n #(packet_number_t' last pn_len)\n (synth_packet_number last pn_len)\n (synth_packet_number_recip last pn_len)", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fsti", "name": "QUIC.State.state", "original_source_type": "", "source_type": "val state : i: QUIC.State.index -> Type0", "source_definition": "let state i = B.pointer (state_s i)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 39, "start_col": 14, "end_line": 39, "end_col": 35 }, "file_context": "module QUIC.State\n\nopen EverCrypt.Error\ninclude QUIC.Spec.Crypto\ninclude QUIC.Impl.Header.Base\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Seq = QUIC.Secret.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule HST = FStar.HyperStack.ST\nmodule Secret = QUIC.Secret.Int\nmodule G = FStar.Ghost\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule Base = QUIC.Impl.Header.Base\nmodule Spec = QUIC.Spec\n\n#set-options \"--z3rlimit 16\"\n\n/// This is not a cryptographic index; rather, this is just a regular type\n/// index, where instead of indexing on a single algorithm (like, say, AEAD), we\n/// index on two values.\n///\n/// The record is here to limit the profileration of hide/reveal in the stateful\n/// functions, and to give easier projectors (, ).\ntype index = {\n hash_alg: ha;\n aead_alg: ea\n}\n\n\n/// Boilerplate\n/// -----------\n\n[@CAbstractStruct]\nval state_s: index -> Type0", "dependencies": { "source_file": "QUIC.State.fsti", "checked_file": "QUIC.State.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Crypto.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: QUIC.State.index -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.State.index", "LowStar.Buffer.pointer", "QUIC.State.state_s" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let state i =", "completed_definiton": "B.pointer (state_s i)", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fsti", "name": "QUIC.State.footprint", "original_source_type": "", "source_type": "val footprint : m: FStar.Monotonic.HyperStack.mem -> s: QUIC.State.state i\n -> Prims.GTot LowStar.Monotonic.Buffer.loc", "source_definition": "let footprint (#i:index) (m: HS.mem) (s: state i) =\n B.(loc_union (loc_addr_of_buffer s) (footprint_s m (B.deref m s)))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 43, "start_col": 2, "end_line": 43, "end_col": 68 }, "file_context": "module QUIC.State\n\nopen EverCrypt.Error\ninclude QUIC.Spec.Crypto\ninclude QUIC.Impl.Header.Base\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Seq = QUIC.Secret.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule HST = FStar.HyperStack.ST\nmodule Secret = QUIC.Secret.Int\nmodule G = FStar.Ghost\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule Base = QUIC.Impl.Header.Base\nmodule Spec = QUIC.Spec\n\n#set-options \"--z3rlimit 16\"\n\n/// This is not a cryptographic index; rather, this is just a regular type\n/// index, where instead of indexing on a single algorithm (like, say, AEAD), we\n/// index on two values.\n///\n/// The record is here to limit the profileration of hide/reveal in the stateful\n/// functions, and to give easier projectors (, ).\ntype index = {\n hash_alg: ha;\n aead_alg: ea\n}\n\n\n/// Boilerplate\n/// -----------\n\n[@CAbstractStruct]\nval state_s: index -> Type0\n\nlet state i = B.pointer (state_s i)\n\nval footprint_s: #i:index -> HS.mem -> state_s i -> GTot B.loc", "dependencies": { "source_file": "QUIC.State.fsti", "checked_file": "QUIC.State.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Crypto.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "m: FStar.Monotonic.HyperStack.mem -> s: QUIC.State.state i\n -> Prims.GTot LowStar.Monotonic.Buffer.loc", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.State.index", "FStar.Monotonic.HyperStack.mem", "QUIC.State.state", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.loc_addr_of_buffer", "QUIC.State.state_s", "LowStar.Buffer.trivial_preorder", "QUIC.State.footprint_s", "LowStar.Monotonic.Buffer.deref", "LowStar.Monotonic.Buffer.loc" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let footprint (#i: index) (m: HS.mem) (s: state i) =", "completed_definiton": "let open B in loc_union (loc_addr_of_buffer s) (footprint_s m (B.deref m s))", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fsti", "name": "QUIC.State.incrementable", "original_source_type": "", "source_type": "val incrementable : s: QUIC.State.state i -> h: FStar.Monotonic.HyperStack.mem{QUIC.State.invariant h s}\n -> Prims.GTot Prims.bool", "source_definition": "let incrementable (#i: index) (s: state i) (h: HS.mem { invariant h s }) =\n Secret.v (g_last_packet_number (B.deref h s) h) + 1 < pow2 62", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 113, "start_col": 2, "end_line": 113, "end_col": 63 }, "file_context": "module QUIC.State\n\nopen EverCrypt.Error\ninclude QUIC.Spec.Crypto\ninclude QUIC.Impl.Header.Base\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Seq = QUIC.Secret.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule HST = FStar.HyperStack.ST\nmodule Secret = QUIC.Secret.Int\nmodule G = FStar.Ghost\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule Base = QUIC.Impl.Header.Base\nmodule Spec = QUIC.Spec\n\n#set-options \"--z3rlimit 16\"\n\n/// This is not a cryptographic index; rather, this is just a regular type\n/// index, where instead of indexing on a single algorithm (like, say, AEAD), we\n/// index on two values.\n///\n/// The record is here to limit the profileration of hide/reveal in the stateful\n/// functions, and to give easier projectors (, ).\ntype index = {\n hash_alg: ha;\n aead_alg: ea\n}\n\n\n/// Boilerplate\n/// -----------\n\n[@CAbstractStruct]\nval state_s: index -> Type0\n\nlet state i = B.pointer (state_s i)\n\nval footprint_s: #i:index -> HS.mem -> state_s i -> GTot B.loc\nlet footprint (#i:index) (m: HS.mem) (s: state i) =\n B.(loc_union (loc_addr_of_buffer s) (footprint_s m (B.deref m s)))\n\nlet loc_includes_union_l_footprint_s\n (m: HS.mem)\n (l1 l2: B.loc) (#a: index) (s: state_s a)\n: Lemma\n (requires (\n B.loc_includes l1 (footprint_s m s) \\/ B.loc_includes l2 (footprint_s m s)\n ))\n (ensures (B.loc_includes (B.loc_union l1 l2) (footprint_s m s)))\n [SMTPat (B.loc_includes (B.loc_union l1 l2) (footprint_s m s))]\n= B.loc_includes_union_l l1 l2 (footprint_s m s)\n\n/// Ghost accessors (not needing the invariant)\n/// -------------------------------------------\n///\n/// We need to define those, so that we can state a framing lemma for them.\n/// Attempting a new convention to distinguish ghost accessors from stateful\n/// functions: a ``g_`` prefix.\n\n/// See remark for ``g_initial_packet_number`` below.\nval g_traffic_secret: #i:index -> (s: state_s i) ->\n GTot (Spec.Hash.Definitions.bytes_hash i.hash_alg)\n\n#push-options \"--max_ifuel 1\" // inversion on hash_alg\nlet hash_is_keysized #i (s: state_s i): Lemma\n (ensures (keysized i.hash_alg (Seq.length (g_traffic_secret s))))\n [ SMTPat (g_traffic_secret s) ]\n=\n assert_norm (512 < pow2 61);\n assert_norm (512 < pow2 125)\n#pop-options\n\n/// Note that this one does *NOT* take the memory as an argument. (This is\n/// because the initial packet number is erased in the concrete state.) Callers\n/// should be able to derive, from this, that the initial packet number remains\n/// the same, thanks to the precise use of footprint_s in encrypt/decrypt.\nval g_initial_packet_number: #i:index -> (s: state_s i) -> GTot PN.packet_number_t\n\n/// Invariant\n/// ---------\n\nval invariant_s: (#i:index) -> HS.mem -> state_s i -> Type0\nlet invariant (#i:index) (m: HS.mem) (s: state i) =\n let r = B.frameOf s in\n HST.is_eternal_region r /\\\n B.loc_includes (B.loc_region_only true r) (footprint m s) /\\\n B.live m s /\\\n B.(loc_disjoint (loc_addr_of_buffer s) (footprint_s m (B.deref m s))) /\\\n invariant_s m (B.get m s 0)\n\nval invariant_loc_in_footprint\n (#i: index)\n (s: state i)\n (m: HS.mem)\n: Lemma\n (requires (invariant m s))\n (ensures (B.loc_in (footprint m s) m))\n [SMTPat (invariant m s)]\n\n\n/// Ghost accessors needing the invariant\n/// -------------------------------------\n\nval g_last_packet_number: #i:index -> (s: state_s i) -> (h: HS.mem { invariant_s h s }) ->\n GTot (pn: PN.packet_number_t {\n Secret.v pn >= Secret.v (g_initial_packet_number s)\n })", "dependencies": { "source_file": "QUIC.State.fsti", "checked_file": "QUIC.State.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Crypto.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: QUIC.State.state i -> h: FStar.Monotonic.HyperStack.mem{QUIC.State.invariant h s}\n -> Prims.GTot Prims.bool", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.State.index", "QUIC.State.state", "FStar.Monotonic.HyperStack.mem", "QUIC.State.invariant", "Prims.op_LessThan", "Prims.op_Addition", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "QUIC.State.g_last_packet_number", "LowStar.Monotonic.Buffer.deref", "QUIC.State.state_s", "LowStar.Buffer.trivial_preorder", "Prims.pow2", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let incrementable (#i: index) (s: state i) (h: HS.mem{invariant h s}) =", "completed_definiton": "Secret.v (g_last_packet_number (B.deref h s) h) + 1 < pow2 62", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fsti", "name": "QUIC.State.invariant", "original_source_type": "", "source_type": "val invariant : m: FStar.Monotonic.HyperStack.mem -> s: QUIC.State.state i -> Prims.logical", "source_definition": "let invariant (#i:index) (m: HS.mem) (s: state i) =\n let r = B.frameOf s in\n HST.is_eternal_region r /\\\n B.loc_includes (B.loc_region_only true r) (footprint m s) /\\\n B.live m s /\\\n B.(loc_disjoint (loc_addr_of_buffer s) (footprint_s m (B.deref m s))) /\\\n invariant_s m (B.get m s 0)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 86, "start_col": 51, "end_line": 92, "end_col": 29 }, "file_context": "module QUIC.State\n\nopen EverCrypt.Error\ninclude QUIC.Spec.Crypto\ninclude QUIC.Impl.Header.Base\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Seq = QUIC.Secret.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule HST = FStar.HyperStack.ST\nmodule Secret = QUIC.Secret.Int\nmodule G = FStar.Ghost\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule Base = QUIC.Impl.Header.Base\nmodule Spec = QUIC.Spec\n\n#set-options \"--z3rlimit 16\"\n\n/// This is not a cryptographic index; rather, this is just a regular type\n/// index, where instead of indexing on a single algorithm (like, say, AEAD), we\n/// index on two values.\n///\n/// The record is here to limit the profileration of hide/reveal in the stateful\n/// functions, and to give easier projectors (, ).\ntype index = {\n hash_alg: ha;\n aead_alg: ea\n}\n\n\n/// Boilerplate\n/// -----------\n\n[@CAbstractStruct]\nval state_s: index -> Type0\n\nlet state i = B.pointer (state_s i)\n\nval footprint_s: #i:index -> HS.mem -> state_s i -> GTot B.loc\nlet footprint (#i:index) (m: HS.mem) (s: state i) =\n B.(loc_union (loc_addr_of_buffer s) (footprint_s m (B.deref m s)))\n\nlet loc_includes_union_l_footprint_s\n (m: HS.mem)\n (l1 l2: B.loc) (#a: index) (s: state_s a)\n: Lemma\n (requires (\n B.loc_includes l1 (footprint_s m s) \\/ B.loc_includes l2 (footprint_s m s)\n ))\n (ensures (B.loc_includes (B.loc_union l1 l2) (footprint_s m s)))\n [SMTPat (B.loc_includes (B.loc_union l1 l2) (footprint_s m s))]\n= B.loc_includes_union_l l1 l2 (footprint_s m s)\n\n/// Ghost accessors (not needing the invariant)\n/// -------------------------------------------\n///\n/// We need to define those, so that we can state a framing lemma for them.\n/// Attempting a new convention to distinguish ghost accessors from stateful\n/// functions: a ``g_`` prefix.\n\n/// See remark for ``g_initial_packet_number`` below.\nval g_traffic_secret: #i:index -> (s: state_s i) ->\n GTot (Spec.Hash.Definitions.bytes_hash i.hash_alg)\n\n#push-options \"--max_ifuel 1\" // inversion on hash_alg\nlet hash_is_keysized #i (s: state_s i): Lemma\n (ensures (keysized i.hash_alg (Seq.length (g_traffic_secret s))))\n [ SMTPat (g_traffic_secret s) ]\n=\n assert_norm (512 < pow2 61);\n assert_norm (512 < pow2 125)\n#pop-options\n\n/// Note that this one does *NOT* take the memory as an argument. (This is\n/// because the initial packet number is erased in the concrete state.) Callers\n/// should be able to derive, from this, that the initial packet number remains\n/// the same, thanks to the precise use of footprint_s in encrypt/decrypt.\nval g_initial_packet_number: #i:index -> (s: state_s i) -> GTot PN.packet_number_t\n\n/// Invariant\n/// ---------", "dependencies": { "source_file": "QUIC.State.fsti", "checked_file": "QUIC.State.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Crypto.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "m: FStar.Monotonic.HyperStack.mem -> s: QUIC.State.state i -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.State.index", "FStar.Monotonic.HyperStack.mem", "QUIC.State.state", "Prims.l_and", "FStar.HyperStack.ST.is_eternal_region", "LowStar.Monotonic.Buffer.loc_includes", "LowStar.Monotonic.Buffer.loc_region_only", "QUIC.State.footprint", "LowStar.Monotonic.Buffer.live", "QUIC.State.state_s", "LowStar.Buffer.trivial_preorder", "LowStar.Monotonic.Buffer.loc_disjoint", "LowStar.Monotonic.Buffer.loc_addr_of_buffer", "QUIC.State.footprint_s", "LowStar.Monotonic.Buffer.deref", "QUIC.State.invariant_s", "LowStar.Monotonic.Buffer.get", "FStar.Monotonic.HyperHeap.rid", "LowStar.Monotonic.Buffer.frameOf", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let invariant (#i: index) (m: HS.mem) (s: state i) =", "completed_definiton": "let r = B.frameOf s in\nHST.is_eternal_region r /\\ B.loc_includes (B.loc_region_only true r) (footprint m s) /\\ B.live m s /\\\nB.(loc_disjoint (loc_addr_of_buffer s) (footprint_s m (B.deref m s))) /\\ invariant_s m (B.get m s 0)", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fsti", "name": "QUIC.State.loc_includes_union_l_footprint_s", "original_source_type": "val loc_includes_union_l_footprint_s (m: HS.mem) (l1 l2: B.loc) (#a: index) (s: state_s a)\n : Lemma (requires (B.loc_includes l1 (footprint_s m s) \\/ B.loc_includes l2 (footprint_s m s)))\n (ensures (B.loc_includes (B.loc_union l1 l2) (footprint_s m s)))\n [SMTPat (B.loc_includes (B.loc_union l1 l2) (footprint_s m s))]", "source_type": "val loc_includes_union_l_footprint_s (m: HS.mem) (l1 l2: B.loc) (#a: index) (s: state_s a)\n : Lemma (requires (B.loc_includes l1 (footprint_s m s) \\/ B.loc_includes l2 (footprint_s m s)))\n (ensures (B.loc_includes (B.loc_union l1 l2) (footprint_s m s)))\n [SMTPat (B.loc_includes (B.loc_union l1 l2) (footprint_s m s))]", "source_definition": "let loc_includes_union_l_footprint_s\n (m: HS.mem)\n (l1 l2: B.loc) (#a: index) (s: state_s a)\n: Lemma\n (requires (\n B.loc_includes l1 (footprint_s m s) \\/ B.loc_includes l2 (footprint_s m s)\n ))\n (ensures (B.loc_includes (B.loc_union l1 l2) (footprint_s m s)))\n [SMTPat (B.loc_includes (B.loc_union l1 l2) (footprint_s m s))]\n= B.loc_includes_union_l l1 l2 (footprint_s m s)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 54, "start_col": 2, "end_line": 54, "end_col": 48 }, "file_context": "module QUIC.State\n\nopen EverCrypt.Error\ninclude QUIC.Spec.Crypto\ninclude QUIC.Impl.Header.Base\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Seq = QUIC.Secret.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule HST = FStar.HyperStack.ST\nmodule Secret = QUIC.Secret.Int\nmodule G = FStar.Ghost\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule Base = QUIC.Impl.Header.Base\nmodule Spec = QUIC.Spec\n\n#set-options \"--z3rlimit 16\"\n\n/// This is not a cryptographic index; rather, this is just a regular type\n/// index, where instead of indexing on a single algorithm (like, say, AEAD), we\n/// index on two values.\n///\n/// The record is here to limit the profileration of hide/reveal in the stateful\n/// functions, and to give easier projectors (, ).\ntype index = {\n hash_alg: ha;\n aead_alg: ea\n}\n\n\n/// Boilerplate\n/// -----------\n\n[@CAbstractStruct]\nval state_s: index -> Type0\n\nlet state i = B.pointer (state_s i)\n\nval footprint_s: #i:index -> HS.mem -> state_s i -> GTot B.loc\nlet footprint (#i:index) (m: HS.mem) (s: state i) =\n B.(loc_union (loc_addr_of_buffer s) (footprint_s m (B.deref m s)))\n\nlet loc_includes_union_l_footprint_s\n (m: HS.mem)\n (l1 l2: B.loc) (#a: index) (s: state_s a)\n: Lemma\n (requires (\n B.loc_includes l1 (footprint_s m s) \\/ B.loc_includes l2 (footprint_s m s)\n ))\n (ensures (B.loc_includes (B.loc_union l1 l2) (footprint_s m s)))", "dependencies": { "source_file": "QUIC.State.fsti", "checked_file": "QUIC.State.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Crypto.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n m: FStar.Monotonic.HyperStack.mem ->\n l1: LowStar.Monotonic.Buffer.loc ->\n l2: LowStar.Monotonic.Buffer.loc ->\n s: QUIC.State.state_s a\n -> FStar.Pervasives.Lemma\n (requires\n LowStar.Monotonic.Buffer.loc_includes l1 (QUIC.State.footprint_s m s) \\/\n LowStar.Monotonic.Buffer.loc_includes l2 (QUIC.State.footprint_s m s))\n (ensures\n LowStar.Monotonic.Buffer.loc_includes (LowStar.Monotonic.Buffer.loc_union l1 l2)\n (QUIC.State.footprint_s m s))\n [\n SMTPat (LowStar.Monotonic.Buffer.loc_includes (LowStar.Monotonic.Buffer.loc_union l1 l2)\n (QUIC.State.footprint_s m s))\n ]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Monotonic.HyperStack.mem", "LowStar.Monotonic.Buffer.loc", "QUIC.State.index", "QUIC.State.state_s", "LowStar.Monotonic.Buffer.loc_includes_union_l", "QUIC.State.footprint_s", "Prims.unit", "Prims.l_or", "LowStar.Monotonic.Buffer.loc_includes", "Prims.squash", "LowStar.Monotonic.Buffer.loc_union", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val loc_includes_union_l_footprint_s (m: HS.mem) (l1 l2: B.loc) (#a: index) (s: state_s a)\n : Lemma (requires (B.loc_includes l1 (footprint_s m s) \\/ B.loc_includes l2 (footprint_s m s)))\n (ensures (B.loc_includes (B.loc_union l1 l2) (footprint_s m s)))\n [SMTPat (B.loc_includes (B.loc_union l1 l2) (footprint_s m s))]\nlet loc_includes_union_l_footprint_s (m: HS.mem) (l1 l2: B.loc) (#a: index) (s: state_s a)\n : Lemma (requires (B.loc_includes l1 (footprint_s m s) \\/ B.loc_includes l2 (footprint_s m s)))\n (ensures (B.loc_includes (B.loc_union l1 l2) (footprint_s m s)))\n [SMTPat (B.loc_includes (B.loc_union l1 l2) (footprint_s m s))] =", "completed_definiton": "B.loc_includes_union_l l1 l2 (footprint_s m s)", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fsti", "name": "QUIC.State.derive_iv", "original_source_type": "val derive_iv (i: index) (s: state i) (h: HS.mem) : GTot (Seq.seq Secret.uint8)", "source_type": "val derive_iv (i: index) (s: state i) (h: HS.mem) : GTot (Seq.seq Secret.uint8)", "source_definition": "let derive_iv\n (i: index)\n (s: state i)\n (h: HS.mem)\n: GTot (Seq.seq Secret.uint8)\n= let s0 = g_traffic_secret (B.deref h s) in\n Spec.derive_secret i.hash_alg s0 Spec.label_iv 12", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 223, "start_col": 1, "end_line": 224, "end_col": 51 }, "file_context": "module QUIC.State\n\nopen EverCrypt.Error\ninclude QUIC.Spec.Crypto\ninclude QUIC.Impl.Header.Base\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Seq = QUIC.Secret.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule HST = FStar.HyperStack.ST\nmodule Secret = QUIC.Secret.Int\nmodule G = FStar.Ghost\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule Base = QUIC.Impl.Header.Base\nmodule Spec = QUIC.Spec\n\n#set-options \"--z3rlimit 16\"\n\n/// This is not a cryptographic index; rather, this is just a regular type\n/// index, where instead of indexing on a single algorithm (like, say, AEAD), we\n/// index on two values.\n///\n/// The record is here to limit the profileration of hide/reveal in the stateful\n/// functions, and to give easier projectors (, ).\ntype index = {\n hash_alg: ha;\n aead_alg: ea\n}\n\n\n/// Boilerplate\n/// -----------\n\n[@CAbstractStruct]\nval state_s: index -> Type0\n\nlet state i = B.pointer (state_s i)\n\nval footprint_s: #i:index -> HS.mem -> state_s i -> GTot B.loc\nlet footprint (#i:index) (m: HS.mem) (s: state i) =\n B.(loc_union (loc_addr_of_buffer s) (footprint_s m (B.deref m s)))\n\nlet loc_includes_union_l_footprint_s\n (m: HS.mem)\n (l1 l2: B.loc) (#a: index) (s: state_s a)\n: Lemma\n (requires (\n B.loc_includes l1 (footprint_s m s) \\/ B.loc_includes l2 (footprint_s m s)\n ))\n (ensures (B.loc_includes (B.loc_union l1 l2) (footprint_s m s)))\n [SMTPat (B.loc_includes (B.loc_union l1 l2) (footprint_s m s))]\n= B.loc_includes_union_l l1 l2 (footprint_s m s)\n\n/// Ghost accessors (not needing the invariant)\n/// -------------------------------------------\n///\n/// We need to define those, so that we can state a framing lemma for them.\n/// Attempting a new convention to distinguish ghost accessors from stateful\n/// functions: a ``g_`` prefix.\n\n/// See remark for ``g_initial_packet_number`` below.\nval g_traffic_secret: #i:index -> (s: state_s i) ->\n GTot (Spec.Hash.Definitions.bytes_hash i.hash_alg)\n\n#push-options \"--max_ifuel 1\" // inversion on hash_alg\nlet hash_is_keysized #i (s: state_s i): Lemma\n (ensures (keysized i.hash_alg (Seq.length (g_traffic_secret s))))\n [ SMTPat (g_traffic_secret s) ]\n=\n assert_norm (512 < pow2 61);\n assert_norm (512 < pow2 125)\n#pop-options\n\n/// Note that this one does *NOT* take the memory as an argument. (This is\n/// because the initial packet number is erased in the concrete state.) Callers\n/// should be able to derive, from this, that the initial packet number remains\n/// the same, thanks to the precise use of footprint_s in encrypt/decrypt.\nval g_initial_packet_number: #i:index -> (s: state_s i) -> GTot PN.packet_number_t\n\n/// Invariant\n/// ---------\n\nval invariant_s: (#i:index) -> HS.mem -> state_s i -> Type0\nlet invariant (#i:index) (m: HS.mem) (s: state i) =\n let r = B.frameOf s in\n HST.is_eternal_region r /\\\n B.loc_includes (B.loc_region_only true r) (footprint m s) /\\\n B.live m s /\\\n B.(loc_disjoint (loc_addr_of_buffer s) (footprint_s m (B.deref m s))) /\\\n invariant_s m (B.get m s 0)\n\nval invariant_loc_in_footprint\n (#i: index)\n (s: state i)\n (m: HS.mem)\n: Lemma\n (requires (invariant m s))\n (ensures (B.loc_in (footprint m s) m))\n [SMTPat (invariant m s)]\n\n\n/// Ghost accessors needing the invariant\n/// -------------------------------------\n\nval g_last_packet_number: #i:index -> (s: state_s i) -> (h: HS.mem { invariant_s h s }) ->\n GTot (pn: PN.packet_number_t {\n Secret.v pn >= Secret.v (g_initial_packet_number s)\n })\n\nlet incrementable (#i: index) (s: state i) (h: HS.mem { invariant h s }) =\n Secret.v (g_last_packet_number (B.deref h s) h) + 1 < pow2 62\n\n/// Preserving all the ghost accessors via a single framing lemma only works\n/// because we don't do stack allocation. See comments in\n/// EverCrypt.Hash.Incremental.\nval frame_invariant: #i:index -> l:B.loc -> s:state i -> h0:HS.mem -> h1:HS.mem -> Lemma\n (requires (\n invariant h0 s /\\\n B.loc_disjoint l (footprint h0 s) /\\\n B.modifies l h0 h1))\n (ensures (\n invariant h1 s /\\\n footprint h0 s == footprint h1 s /\\\n g_last_packet_number (B.deref h0 s) h0 == g_last_packet_number (B.deref h1 s) h0 /\\\n g_traffic_secret (B.deref h0 s) == g_traffic_secret (B.deref h1 s)\n ))\n // Assertion failure: unexpected pattern term\n [ SMTPatOr [\n [ SMTPat (B.modifies l h0 h1); SMTPat (invariant h1 s) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (footprint h1 s) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (g_last_packet_number (B.deref h1 s)) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (g_traffic_secret (B.deref h1 s)) ]\n ] ]\n\n\n\n/// Actual stateful API\n/// -------------------\n\nval aead_alg_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack ea\n (requires (fun h0 -> invariant #(G.reveal i) h0 s))\n (ensures (fun h0 a h1 ->\n a == (G.reveal i).aead_alg /\\\n h0 == h1))\n\nval hash_alg_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack ha\n (requires (fun h0 -> invariant #(G.reveal i) h0 s))\n (ensures (fun h0 a h1 ->\n a == (G.reveal i).hash_alg /\\\n h0 == h1))\n\nval last_packet_number_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack PN.packet_number_t\n (requires fun h0 -> invariant h0 s)\n (ensures fun h0 ctr h1 ->\n ctr == g_last_packet_number (B.deref h0 s) h0 /\\\n h0 == h1)\n\n// : we could be defensive and allow callers to pass potentially unsupported\n// algorithms; however, this would require a lot more machinery as we would not\n// even be able to state the index type, since index currently has a refinement\n// that the two algorithms are supported. We would have to separate index into\n// index0 and a well-formedness refinement. Not sure it's worth it. We can\n// always perform redundant tests inside the definition of create to be fully\n// defensive.\ninline_for_extraction noextract\nlet create_in_st (i:index) =\n r:HS.rid ->\n dst: B.pointer (B.pointer_or_null (state_s i)) ->\n initial_pn:PN.packet_number_t ->\n traffic_secret:B.buffer Secret.uint8 {\n B.length traffic_secret = Spec.Hash.Definitions.hash_length i.hash_alg\n } ->\n HST.ST error_code\n (requires fun h0 ->\n // : we could require that ``dst`` point to NULL prior to calling\n // ``create`` (otherwise, it's a memory leak). Other modules don't enforce\n // this (see AEAD) so for now, let's make the caller's life easier and not\n // demand anything.\n HST.is_eternal_region r /\\\n B.live h0 dst /\\ B.live h0 traffic_secret /\\\n B.disjoint dst traffic_secret)\n (ensures (fun h0 e h1 ->\n match e with\n | UnsupportedAlgorithm ->\n B.(modifies loc_none h0 h1)\n | Success ->\n let s = B.deref h1 dst in\n not (B.g_is_null s) /\\\n invariant h1 s /\\\n\n B.(modifies (loc_buffer dst) h0 h1) /\\\n B.fresh_loc (footprint h1 s) h0 h1 /\\\n\n g_traffic_secret (B.deref h1 s) == B.as_seq h0 traffic_secret /\\ \n g_last_packet_number (B.deref h1 s) h1 == initial_pn /\\\n\n g_initial_packet_number (B.deref h1 s) == initial_pn\n | _ ->\n False))\n\n// The index is passed at run-time.\nval create_in: i:index -> create_in_st i\n\n\n(* Useful shortcuts *)\n\nlet derive_k\n (i: index)\n (s: state i)\n (h: HS.mem)\n: GTot (Seq.seq Secret.uint8)\n=\n let s0 = g_traffic_secret (B.deref h s) in\n Spec.derive_secret i.hash_alg s0 Spec.label_key (Spec.Agile.AEAD.key_length i.aead_alg)\n\nlet derive_iv\n (i: index)\n (s: state i)\n (h: HS.mem)", "dependencies": { "source_file": "QUIC.State.fsti", "checked_file": "QUIC.State.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Crypto.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: QUIC.State.index -> s: QUIC.State.state i -> h: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot (FStar.Seq.Base.seq Lib.IntTypes.uint8)", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.State.index", "QUIC.State.state", "FStar.Monotonic.HyperStack.mem", "QUIC.Spec.Crypto.derive_secret", "QUIC.State.__proj__Mkindex__item__hash_alg", "QUIC.Spec.Crypto.label_iv", "Spec.Hash.Definitions.bytes_hash", "QUIC.State.g_traffic_secret", "LowStar.Monotonic.Buffer.deref", "QUIC.State.state_s", "LowStar.Buffer.trivial_preorder", "FStar.Seq.Base.seq", "Lib.IntTypes.uint8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val derive_iv (i: index) (s: state i) (h: HS.mem) : GTot (Seq.seq Secret.uint8)\nlet derive_iv (i: index) (s: state i) (h: HS.mem) : GTot (Seq.seq Secret.uint8) =", "completed_definiton": "let s0 = g_traffic_secret (B.deref h s) in\nSpec.derive_secret i.hash_alg s0 Spec.label_iv 12", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fsti", "name": "QUIC.State.derive_k", "original_source_type": "val derive_k (i: index) (s: state i) (h: HS.mem) : GTot (Seq.seq Secret.uint8)", "source_type": "val derive_k (i: index) (s: state i) (h: HS.mem) : GTot (Seq.seq Secret.uint8)", "source_definition": "let derive_k\n (i: index)\n (s: state i)\n (h: HS.mem)\n: GTot (Seq.seq Secret.uint8)\n=\n let s0 = g_traffic_secret (B.deref h s) in\n Spec.derive_secret i.hash_alg s0 Spec.label_key (Spec.Agile.AEAD.key_length i.aead_alg)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 214, "start_col": 1, "end_line": 216, "end_col": 89 }, "file_context": "module QUIC.State\n\nopen EverCrypt.Error\ninclude QUIC.Spec.Crypto\ninclude QUIC.Impl.Header.Base\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Seq = QUIC.Secret.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule HST = FStar.HyperStack.ST\nmodule Secret = QUIC.Secret.Int\nmodule G = FStar.Ghost\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule Base = QUIC.Impl.Header.Base\nmodule Spec = QUIC.Spec\n\n#set-options \"--z3rlimit 16\"\n\n/// This is not a cryptographic index; rather, this is just a regular type\n/// index, where instead of indexing on a single algorithm (like, say, AEAD), we\n/// index on two values.\n///\n/// The record is here to limit the profileration of hide/reveal in the stateful\n/// functions, and to give easier projectors (, ).\ntype index = {\n hash_alg: ha;\n aead_alg: ea\n}\n\n\n/// Boilerplate\n/// -----------\n\n[@CAbstractStruct]\nval state_s: index -> Type0\n\nlet state i = B.pointer (state_s i)\n\nval footprint_s: #i:index -> HS.mem -> state_s i -> GTot B.loc\nlet footprint (#i:index) (m: HS.mem) (s: state i) =\n B.(loc_union (loc_addr_of_buffer s) (footprint_s m (B.deref m s)))\n\nlet loc_includes_union_l_footprint_s\n (m: HS.mem)\n (l1 l2: B.loc) (#a: index) (s: state_s a)\n: Lemma\n (requires (\n B.loc_includes l1 (footprint_s m s) \\/ B.loc_includes l2 (footprint_s m s)\n ))\n (ensures (B.loc_includes (B.loc_union l1 l2) (footprint_s m s)))\n [SMTPat (B.loc_includes (B.loc_union l1 l2) (footprint_s m s))]\n= B.loc_includes_union_l l1 l2 (footprint_s m s)\n\n/// Ghost accessors (not needing the invariant)\n/// -------------------------------------------\n///\n/// We need to define those, so that we can state a framing lemma for them.\n/// Attempting a new convention to distinguish ghost accessors from stateful\n/// functions: a ``g_`` prefix.\n\n/// See remark for ``g_initial_packet_number`` below.\nval g_traffic_secret: #i:index -> (s: state_s i) ->\n GTot (Spec.Hash.Definitions.bytes_hash i.hash_alg)\n\n#push-options \"--max_ifuel 1\" // inversion on hash_alg\nlet hash_is_keysized #i (s: state_s i): Lemma\n (ensures (keysized i.hash_alg (Seq.length (g_traffic_secret s))))\n [ SMTPat (g_traffic_secret s) ]\n=\n assert_norm (512 < pow2 61);\n assert_norm (512 < pow2 125)\n#pop-options\n\n/// Note that this one does *NOT* take the memory as an argument. (This is\n/// because the initial packet number is erased in the concrete state.) Callers\n/// should be able to derive, from this, that the initial packet number remains\n/// the same, thanks to the precise use of footprint_s in encrypt/decrypt.\nval g_initial_packet_number: #i:index -> (s: state_s i) -> GTot PN.packet_number_t\n\n/// Invariant\n/// ---------\n\nval invariant_s: (#i:index) -> HS.mem -> state_s i -> Type0\nlet invariant (#i:index) (m: HS.mem) (s: state i) =\n let r = B.frameOf s in\n HST.is_eternal_region r /\\\n B.loc_includes (B.loc_region_only true r) (footprint m s) /\\\n B.live m s /\\\n B.(loc_disjoint (loc_addr_of_buffer s) (footprint_s m (B.deref m s))) /\\\n invariant_s m (B.get m s 0)\n\nval invariant_loc_in_footprint\n (#i: index)\n (s: state i)\n (m: HS.mem)\n: Lemma\n (requires (invariant m s))\n (ensures (B.loc_in (footprint m s) m))\n [SMTPat (invariant m s)]\n\n\n/// Ghost accessors needing the invariant\n/// -------------------------------------\n\nval g_last_packet_number: #i:index -> (s: state_s i) -> (h: HS.mem { invariant_s h s }) ->\n GTot (pn: PN.packet_number_t {\n Secret.v pn >= Secret.v (g_initial_packet_number s)\n })\n\nlet incrementable (#i: index) (s: state i) (h: HS.mem { invariant h s }) =\n Secret.v (g_last_packet_number (B.deref h s) h) + 1 < pow2 62\n\n/// Preserving all the ghost accessors via a single framing lemma only works\n/// because we don't do stack allocation. See comments in\n/// EverCrypt.Hash.Incremental.\nval frame_invariant: #i:index -> l:B.loc -> s:state i -> h0:HS.mem -> h1:HS.mem -> Lemma\n (requires (\n invariant h0 s /\\\n B.loc_disjoint l (footprint h0 s) /\\\n B.modifies l h0 h1))\n (ensures (\n invariant h1 s /\\\n footprint h0 s == footprint h1 s /\\\n g_last_packet_number (B.deref h0 s) h0 == g_last_packet_number (B.deref h1 s) h0 /\\\n g_traffic_secret (B.deref h0 s) == g_traffic_secret (B.deref h1 s)\n ))\n // Assertion failure: unexpected pattern term\n [ SMTPatOr [\n [ SMTPat (B.modifies l h0 h1); SMTPat (invariant h1 s) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (footprint h1 s) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (g_last_packet_number (B.deref h1 s)) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (g_traffic_secret (B.deref h1 s)) ]\n ] ]\n\n\n\n/// Actual stateful API\n/// -------------------\n\nval aead_alg_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack ea\n (requires (fun h0 -> invariant #(G.reveal i) h0 s))\n (ensures (fun h0 a h1 ->\n a == (G.reveal i).aead_alg /\\\n h0 == h1))\n\nval hash_alg_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack ha\n (requires (fun h0 -> invariant #(G.reveal i) h0 s))\n (ensures (fun h0 a h1 ->\n a == (G.reveal i).hash_alg /\\\n h0 == h1))\n\nval last_packet_number_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack PN.packet_number_t\n (requires fun h0 -> invariant h0 s)\n (ensures fun h0 ctr h1 ->\n ctr == g_last_packet_number (B.deref h0 s) h0 /\\\n h0 == h1)\n\n// : we could be defensive and allow callers to pass potentially unsupported\n// algorithms; however, this would require a lot more machinery as we would not\n// even be able to state the index type, since index currently has a refinement\n// that the two algorithms are supported. We would have to separate index into\n// index0 and a well-formedness refinement. Not sure it's worth it. We can\n// always perform redundant tests inside the definition of create to be fully\n// defensive.\ninline_for_extraction noextract\nlet create_in_st (i:index) =\n r:HS.rid ->\n dst: B.pointer (B.pointer_or_null (state_s i)) ->\n initial_pn:PN.packet_number_t ->\n traffic_secret:B.buffer Secret.uint8 {\n B.length traffic_secret = Spec.Hash.Definitions.hash_length i.hash_alg\n } ->\n HST.ST error_code\n (requires fun h0 ->\n // : we could require that ``dst`` point to NULL prior to calling\n // ``create`` (otherwise, it's a memory leak). Other modules don't enforce\n // this (see AEAD) so for now, let's make the caller's life easier and not\n // demand anything.\n HST.is_eternal_region r /\\\n B.live h0 dst /\\ B.live h0 traffic_secret /\\\n B.disjoint dst traffic_secret)\n (ensures (fun h0 e h1 ->\n match e with\n | UnsupportedAlgorithm ->\n B.(modifies loc_none h0 h1)\n | Success ->\n let s = B.deref h1 dst in\n not (B.g_is_null s) /\\\n invariant h1 s /\\\n\n B.(modifies (loc_buffer dst) h0 h1) /\\\n B.fresh_loc (footprint h1 s) h0 h1 /\\\n\n g_traffic_secret (B.deref h1 s) == B.as_seq h0 traffic_secret /\\ \n g_last_packet_number (B.deref h1 s) h1 == initial_pn /\\\n\n g_initial_packet_number (B.deref h1 s) == initial_pn\n | _ ->\n False))\n\n// The index is passed at run-time.\nval create_in: i:index -> create_in_st i\n\n\n(* Useful shortcuts *)\n\nlet derive_k\n (i: index)\n (s: state i)\n (h: HS.mem)", "dependencies": { "source_file": "QUIC.State.fsti", "checked_file": "QUIC.State.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Crypto.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: QUIC.State.index -> s: QUIC.State.state i -> h: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot (FStar.Seq.Base.seq Lib.IntTypes.uint8)", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.State.index", "QUIC.State.state", "FStar.Monotonic.HyperStack.mem", "QUIC.Spec.Crypto.derive_secret", "QUIC.State.__proj__Mkindex__item__hash_alg", "QUIC.Spec.Crypto.label_key", "Spec.Agile.AEAD.key_length", "QUIC.State.__proj__Mkindex__item__aead_alg", "Spec.Hash.Definitions.bytes_hash", "QUIC.State.g_traffic_secret", "LowStar.Monotonic.Buffer.deref", "QUIC.State.state_s", "LowStar.Buffer.trivial_preorder", "FStar.Seq.Base.seq", "Lib.IntTypes.uint8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val derive_k (i: index) (s: state i) (h: HS.mem) : GTot (Seq.seq Secret.uint8)\nlet derive_k (i: index) (s: state i) (h: HS.mem) : GTot (Seq.seq Secret.uint8) =", "completed_definiton": "let s0 = g_traffic_secret (B.deref h s) in\nSpec.derive_secret i.hash_alg s0 Spec.label_key (Spec.Agile.AEAD.key_length i.aead_alg)", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fsti", "name": "QUIC.State.derive_pne", "original_source_type": "val derive_pne (i: index) (s: state i) (h: HS.mem) : GTot (Seq.seq Secret.uint8)", "source_type": "val derive_pne (i: index) (s: state i) (h: HS.mem) : GTot (Seq.seq Secret.uint8)", "source_definition": "let derive_pne\n (i: index)\n (s: state i)\n (h: HS.mem)\n: GTot (Seq.seq Secret.uint8)\n= let s0 = g_traffic_secret (B.deref h s) in\n Spec.derive_secret i.hash_alg s0 Spec.label_hp (cipher_keysize i.aead_alg)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 231, "start_col": 1, "end_line": 232, "end_col": 76 }, "file_context": "module QUIC.State\n\nopen EverCrypt.Error\ninclude QUIC.Spec.Crypto\ninclude QUIC.Impl.Header.Base\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Seq = QUIC.Secret.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule HST = FStar.HyperStack.ST\nmodule Secret = QUIC.Secret.Int\nmodule G = FStar.Ghost\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule Base = QUIC.Impl.Header.Base\nmodule Spec = QUIC.Spec\n\n#set-options \"--z3rlimit 16\"\n\n/// This is not a cryptographic index; rather, this is just a regular type\n/// index, where instead of indexing on a single algorithm (like, say, AEAD), we\n/// index on two values.\n///\n/// The record is here to limit the profileration of hide/reveal in the stateful\n/// functions, and to give easier projectors (, ).\ntype index = {\n hash_alg: ha;\n aead_alg: ea\n}\n\n\n/// Boilerplate\n/// -----------\n\n[@CAbstractStruct]\nval state_s: index -> Type0\n\nlet state i = B.pointer (state_s i)\n\nval footprint_s: #i:index -> HS.mem -> state_s i -> GTot B.loc\nlet footprint (#i:index) (m: HS.mem) (s: state i) =\n B.(loc_union (loc_addr_of_buffer s) (footprint_s m (B.deref m s)))\n\nlet loc_includes_union_l_footprint_s\n (m: HS.mem)\n (l1 l2: B.loc) (#a: index) (s: state_s a)\n: Lemma\n (requires (\n B.loc_includes l1 (footprint_s m s) \\/ B.loc_includes l2 (footprint_s m s)\n ))\n (ensures (B.loc_includes (B.loc_union l1 l2) (footprint_s m s)))\n [SMTPat (B.loc_includes (B.loc_union l1 l2) (footprint_s m s))]\n= B.loc_includes_union_l l1 l2 (footprint_s m s)\n\n/// Ghost accessors (not needing the invariant)\n/// -------------------------------------------\n///\n/// We need to define those, so that we can state a framing lemma for them.\n/// Attempting a new convention to distinguish ghost accessors from stateful\n/// functions: a ``g_`` prefix.\n\n/// See remark for ``g_initial_packet_number`` below.\nval g_traffic_secret: #i:index -> (s: state_s i) ->\n GTot (Spec.Hash.Definitions.bytes_hash i.hash_alg)\n\n#push-options \"--max_ifuel 1\" // inversion on hash_alg\nlet hash_is_keysized #i (s: state_s i): Lemma\n (ensures (keysized i.hash_alg (Seq.length (g_traffic_secret s))))\n [ SMTPat (g_traffic_secret s) ]\n=\n assert_norm (512 < pow2 61);\n assert_norm (512 < pow2 125)\n#pop-options\n\n/// Note that this one does *NOT* take the memory as an argument. (This is\n/// because the initial packet number is erased in the concrete state.) Callers\n/// should be able to derive, from this, that the initial packet number remains\n/// the same, thanks to the precise use of footprint_s in encrypt/decrypt.\nval g_initial_packet_number: #i:index -> (s: state_s i) -> GTot PN.packet_number_t\n\n/// Invariant\n/// ---------\n\nval invariant_s: (#i:index) -> HS.mem -> state_s i -> Type0\nlet invariant (#i:index) (m: HS.mem) (s: state i) =\n let r = B.frameOf s in\n HST.is_eternal_region r /\\\n B.loc_includes (B.loc_region_only true r) (footprint m s) /\\\n B.live m s /\\\n B.(loc_disjoint (loc_addr_of_buffer s) (footprint_s m (B.deref m s))) /\\\n invariant_s m (B.get m s 0)\n\nval invariant_loc_in_footprint\n (#i: index)\n (s: state i)\n (m: HS.mem)\n: Lemma\n (requires (invariant m s))\n (ensures (B.loc_in (footprint m s) m))\n [SMTPat (invariant m s)]\n\n\n/// Ghost accessors needing the invariant\n/// -------------------------------------\n\nval g_last_packet_number: #i:index -> (s: state_s i) -> (h: HS.mem { invariant_s h s }) ->\n GTot (pn: PN.packet_number_t {\n Secret.v pn >= Secret.v (g_initial_packet_number s)\n })\n\nlet incrementable (#i: index) (s: state i) (h: HS.mem { invariant h s }) =\n Secret.v (g_last_packet_number (B.deref h s) h) + 1 < pow2 62\n\n/// Preserving all the ghost accessors via a single framing lemma only works\n/// because we don't do stack allocation. See comments in\n/// EverCrypt.Hash.Incremental.\nval frame_invariant: #i:index -> l:B.loc -> s:state i -> h0:HS.mem -> h1:HS.mem -> Lemma\n (requires (\n invariant h0 s /\\\n B.loc_disjoint l (footprint h0 s) /\\\n B.modifies l h0 h1))\n (ensures (\n invariant h1 s /\\\n footprint h0 s == footprint h1 s /\\\n g_last_packet_number (B.deref h0 s) h0 == g_last_packet_number (B.deref h1 s) h0 /\\\n g_traffic_secret (B.deref h0 s) == g_traffic_secret (B.deref h1 s)\n ))\n // Assertion failure: unexpected pattern term\n [ SMTPatOr [\n [ SMTPat (B.modifies l h0 h1); SMTPat (invariant h1 s) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (footprint h1 s) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (g_last_packet_number (B.deref h1 s)) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (g_traffic_secret (B.deref h1 s)) ]\n ] ]\n\n\n\n/// Actual stateful API\n/// -------------------\n\nval aead_alg_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack ea\n (requires (fun h0 -> invariant #(G.reveal i) h0 s))\n (ensures (fun h0 a h1 ->\n a == (G.reveal i).aead_alg /\\\n h0 == h1))\n\nval hash_alg_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack ha\n (requires (fun h0 -> invariant #(G.reveal i) h0 s))\n (ensures (fun h0 a h1 ->\n a == (G.reveal i).hash_alg /\\\n h0 == h1))\n\nval last_packet_number_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack PN.packet_number_t\n (requires fun h0 -> invariant h0 s)\n (ensures fun h0 ctr h1 ->\n ctr == g_last_packet_number (B.deref h0 s) h0 /\\\n h0 == h1)\n\n// : we could be defensive and allow callers to pass potentially unsupported\n// algorithms; however, this would require a lot more machinery as we would not\n// even be able to state the index type, since index currently has a refinement\n// that the two algorithms are supported. We would have to separate index into\n// index0 and a well-formedness refinement. Not sure it's worth it. We can\n// always perform redundant tests inside the definition of create to be fully\n// defensive.\ninline_for_extraction noextract\nlet create_in_st (i:index) =\n r:HS.rid ->\n dst: B.pointer (B.pointer_or_null (state_s i)) ->\n initial_pn:PN.packet_number_t ->\n traffic_secret:B.buffer Secret.uint8 {\n B.length traffic_secret = Spec.Hash.Definitions.hash_length i.hash_alg\n } ->\n HST.ST error_code\n (requires fun h0 ->\n // : we could require that ``dst`` point to NULL prior to calling\n // ``create`` (otherwise, it's a memory leak). Other modules don't enforce\n // this (see AEAD) so for now, let's make the caller's life easier and not\n // demand anything.\n HST.is_eternal_region r /\\\n B.live h0 dst /\\ B.live h0 traffic_secret /\\\n B.disjoint dst traffic_secret)\n (ensures (fun h0 e h1 ->\n match e with\n | UnsupportedAlgorithm ->\n B.(modifies loc_none h0 h1)\n | Success ->\n let s = B.deref h1 dst in\n not (B.g_is_null s) /\\\n invariant h1 s /\\\n\n B.(modifies (loc_buffer dst) h0 h1) /\\\n B.fresh_loc (footprint h1 s) h0 h1 /\\\n\n g_traffic_secret (B.deref h1 s) == B.as_seq h0 traffic_secret /\\ \n g_last_packet_number (B.deref h1 s) h1 == initial_pn /\\\n\n g_initial_packet_number (B.deref h1 s) == initial_pn\n | _ ->\n False))\n\n// The index is passed at run-time.\nval create_in: i:index -> create_in_st i\n\n\n(* Useful shortcuts *)\n\nlet derive_k\n (i: index)\n (s: state i)\n (h: HS.mem)\n: GTot (Seq.seq Secret.uint8)\n=\n let s0 = g_traffic_secret (B.deref h s) in\n Spec.derive_secret i.hash_alg s0 Spec.label_key (Spec.Agile.AEAD.key_length i.aead_alg)\n\nlet derive_iv\n (i: index)\n (s: state i)\n (h: HS.mem)\n: GTot (Seq.seq Secret.uint8)\n= let s0 = g_traffic_secret (B.deref h s) in\n Spec.derive_secret i.hash_alg s0 Spec.label_iv 12\n\nlet derive_pne\n (i: index)\n (s: state i)\n (h: HS.mem)", "dependencies": { "source_file": "QUIC.State.fsti", "checked_file": "QUIC.State.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Crypto.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: QUIC.State.index -> s: QUIC.State.state i -> h: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot (FStar.Seq.Base.seq Lib.IntTypes.uint8)", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.State.index", "QUIC.State.state", "FStar.Monotonic.HyperStack.mem", "QUIC.Spec.Crypto.derive_secret", "QUIC.State.__proj__Mkindex__item__hash_alg", "QUIC.Spec.Crypto.label_hp", "QUIC.Spec.Crypto.cipher_keysize", "QUIC.State.__proj__Mkindex__item__aead_alg", "Spec.Hash.Definitions.bytes_hash", "QUIC.State.g_traffic_secret", "LowStar.Monotonic.Buffer.deref", "QUIC.State.state_s", "LowStar.Buffer.trivial_preorder", "FStar.Seq.Base.seq", "Lib.IntTypes.uint8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val derive_pne (i: index) (s: state i) (h: HS.mem) : GTot (Seq.seq Secret.uint8)\nlet derive_pne (i: index) (s: state i) (h: HS.mem) : GTot (Seq.seq Secret.uint8) =", "completed_definiton": "let s0 = g_traffic_secret (B.deref h s) in\nSpec.derive_secret i.hash_alg s0 Spec.label_hp (cipher_keysize i.aead_alg)", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fsti", "name": "QUIC.State.hash_is_keysized", "original_source_type": "val hash_is_keysized (#i: _) (s: state_s i)\n : Lemma (ensures (keysized i.hash_alg (Seq.length (g_traffic_secret s))))\n [SMTPat (g_traffic_secret s)]", "source_type": "val hash_is_keysized (#i: _) (s: state_s i)\n : Lemma (ensures (keysized i.hash_alg (Seq.length (g_traffic_secret s))))\n [SMTPat (g_traffic_secret s)]", "source_definition": "let hash_is_keysized #i (s: state_s i): Lemma\n (ensures (keysized i.hash_alg (Seq.length (g_traffic_secret s))))\n [ SMTPat (g_traffic_secret s) ]\n=\n assert_norm (512 < pow2 61);\n assert_norm (512 < pow2 125)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 72, "start_col": 2, "end_line": 73, "end_col": 30 }, "file_context": "module QUIC.State\n\nopen EverCrypt.Error\ninclude QUIC.Spec.Crypto\ninclude QUIC.Impl.Header.Base\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Seq = QUIC.Secret.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule HST = FStar.HyperStack.ST\nmodule Secret = QUIC.Secret.Int\nmodule G = FStar.Ghost\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule Base = QUIC.Impl.Header.Base\nmodule Spec = QUIC.Spec\n\n#set-options \"--z3rlimit 16\"\n\n/// This is not a cryptographic index; rather, this is just a regular type\n/// index, where instead of indexing on a single algorithm (like, say, AEAD), we\n/// index on two values.\n///\n/// The record is here to limit the profileration of hide/reveal in the stateful\n/// functions, and to give easier projectors (, ).\ntype index = {\n hash_alg: ha;\n aead_alg: ea\n}\n\n\n/// Boilerplate\n/// -----------\n\n[@CAbstractStruct]\nval state_s: index -> Type0\n\nlet state i = B.pointer (state_s i)\n\nval footprint_s: #i:index -> HS.mem -> state_s i -> GTot B.loc\nlet footprint (#i:index) (m: HS.mem) (s: state i) =\n B.(loc_union (loc_addr_of_buffer s) (footprint_s m (B.deref m s)))\n\nlet loc_includes_union_l_footprint_s\n (m: HS.mem)\n (l1 l2: B.loc) (#a: index) (s: state_s a)\n: Lemma\n (requires (\n B.loc_includes l1 (footprint_s m s) \\/ B.loc_includes l2 (footprint_s m s)\n ))\n (ensures (B.loc_includes (B.loc_union l1 l2) (footprint_s m s)))\n [SMTPat (B.loc_includes (B.loc_union l1 l2) (footprint_s m s))]\n= B.loc_includes_union_l l1 l2 (footprint_s m s)\n\n/// Ghost accessors (not needing the invariant)\n/// -------------------------------------------\n///\n/// We need to define those, so that we can state a framing lemma for them.\n/// Attempting a new convention to distinguish ghost accessors from stateful\n/// functions: a ``g_`` prefix.\n\n/// See remark for ``g_initial_packet_number`` below.\nval g_traffic_secret: #i:index -> (s: state_s i) ->\n GTot (Spec.Hash.Definitions.bytes_hash i.hash_alg)\n\n#push-options \"--max_ifuel 1\" // inversion on hash_alg\nlet hash_is_keysized #i (s: state_s i): Lemma\n (ensures (keysized i.hash_alg (Seq.length (g_traffic_secret s))))\n [ SMTPat (g_traffic_secret s) ]", "dependencies": { "source_file": "QUIC.State.fsti", "checked_file": "QUIC.State.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Crypto.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 1, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: QUIC.State.state_s i\n -> FStar.Pervasives.Lemma\n (ensures\n QUIC.Spec.Crypto.keysized (Mkindex?.hash_alg i)\n (FStar.Seq.Base.length (QUIC.State.g_traffic_secret s)))\n [SMTPat (QUIC.State.g_traffic_secret s)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.State.index", "QUIC.State.state_s", "FStar.Pervasives.assert_norm", "Prims.b2t", "Prims.op_LessThan", "Prims.pow2", "Prims.unit", "Prims.l_True", "Prims.squash", "QUIC.Spec.Crypto.keysized", "QUIC.State.__proj__Mkindex__item__hash_alg", "FStar.Seq.Base.length", "Lib.IntTypes.uint8", "QUIC.State.g_traffic_secret", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Spec.Hash.Definitions.bytes_hash", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val hash_is_keysized (#i: _) (s: state_s i)\n : Lemma (ensures (keysized i.hash_alg (Seq.length (g_traffic_secret s))))\n [SMTPat (g_traffic_secret s)]\nlet hash_is_keysized #i (s: state_s i)\n : Lemma (ensures (keysized i.hash_alg (Seq.length (g_traffic_secret s))))\n [SMTPat (g_traffic_secret s)] =", "completed_definiton": "assert_norm (512 < pow2 61);\nassert_norm (512 < pow2 125)", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fsti", "name": "QUIC.State.create_in_st", "original_source_type": "", "source_type": "val create_in_st : i: QUIC.State.index -> Type0", "source_definition": "let create_in_st (i:index) =\n r:HS.rid ->\n dst: B.pointer (B.pointer_or_null (state_s i)) ->\n initial_pn:PN.packet_number_t ->\n traffic_secret:B.buffer Secret.uint8 {\n B.length traffic_secret = Spec.Hash.Definitions.hash_length i.hash_alg\n } ->\n HST.ST error_code\n (requires fun h0 ->\n // : we could require that ``dst`` point to NULL prior to calling\n // ``create`` (otherwise, it's a memory leak). Other modules don't enforce\n // this (see AEAD) so for now, let's make the caller's life easier and not\n // demand anything.\n HST.is_eternal_region r /\\\n B.live h0 dst /\\ B.live h0 traffic_secret /\\\n B.disjoint dst traffic_secret)\n (ensures (fun h0 e h1 ->\n match e with\n | UnsupportedAlgorithm ->\n B.(modifies loc_none h0 h1)\n | Success ->\n let s = B.deref h1 dst in\n not (B.g_is_null s) /\\\n invariant h1 s /\\\n\n B.(modifies (loc_buffer dst) h0 h1) /\\\n B.fresh_loc (footprint h1 s) h0 h1 /\\\n\n g_traffic_secret (B.deref h1 s) == B.as_seq h0 traffic_secret /\\ \n g_last_packet_number (B.deref h1 s) h1 == initial_pn /\\\n\n g_initial_packet_number (B.deref h1 s) == initial_pn\n | _ ->\n False))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 169, "start_col": 2, "end_line": 201, "end_col": 17 }, "file_context": "module QUIC.State\n\nopen EverCrypt.Error\ninclude QUIC.Spec.Crypto\ninclude QUIC.Impl.Header.Base\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Seq = QUIC.Secret.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule HST = FStar.HyperStack.ST\nmodule Secret = QUIC.Secret.Int\nmodule G = FStar.Ghost\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule Base = QUIC.Impl.Header.Base\nmodule Spec = QUIC.Spec\n\n#set-options \"--z3rlimit 16\"\n\n/// This is not a cryptographic index; rather, this is just a regular type\n/// index, where instead of indexing on a single algorithm (like, say, AEAD), we\n/// index on two values.\n///\n/// The record is here to limit the profileration of hide/reveal in the stateful\n/// functions, and to give easier projectors (, ).\ntype index = {\n hash_alg: ha;\n aead_alg: ea\n}\n\n\n/// Boilerplate\n/// -----------\n\n[@CAbstractStruct]\nval state_s: index -> Type0\n\nlet state i = B.pointer (state_s i)\n\nval footprint_s: #i:index -> HS.mem -> state_s i -> GTot B.loc\nlet footprint (#i:index) (m: HS.mem) (s: state i) =\n B.(loc_union (loc_addr_of_buffer s) (footprint_s m (B.deref m s)))\n\nlet loc_includes_union_l_footprint_s\n (m: HS.mem)\n (l1 l2: B.loc) (#a: index) (s: state_s a)\n: Lemma\n (requires (\n B.loc_includes l1 (footprint_s m s) \\/ B.loc_includes l2 (footprint_s m s)\n ))\n (ensures (B.loc_includes (B.loc_union l1 l2) (footprint_s m s)))\n [SMTPat (B.loc_includes (B.loc_union l1 l2) (footprint_s m s))]\n= B.loc_includes_union_l l1 l2 (footprint_s m s)\n\n/// Ghost accessors (not needing the invariant)\n/// -------------------------------------------\n///\n/// We need to define those, so that we can state a framing lemma for them.\n/// Attempting a new convention to distinguish ghost accessors from stateful\n/// functions: a ``g_`` prefix.\n\n/// See remark for ``g_initial_packet_number`` below.\nval g_traffic_secret: #i:index -> (s: state_s i) ->\n GTot (Spec.Hash.Definitions.bytes_hash i.hash_alg)\n\n#push-options \"--max_ifuel 1\" // inversion on hash_alg\nlet hash_is_keysized #i (s: state_s i): Lemma\n (ensures (keysized i.hash_alg (Seq.length (g_traffic_secret s))))\n [ SMTPat (g_traffic_secret s) ]\n=\n assert_norm (512 < pow2 61);\n assert_norm (512 < pow2 125)\n#pop-options\n\n/// Note that this one does *NOT* take the memory as an argument. (This is\n/// because the initial packet number is erased in the concrete state.) Callers\n/// should be able to derive, from this, that the initial packet number remains\n/// the same, thanks to the precise use of footprint_s in encrypt/decrypt.\nval g_initial_packet_number: #i:index -> (s: state_s i) -> GTot PN.packet_number_t\n\n/// Invariant\n/// ---------\n\nval invariant_s: (#i:index) -> HS.mem -> state_s i -> Type0\nlet invariant (#i:index) (m: HS.mem) (s: state i) =\n let r = B.frameOf s in\n HST.is_eternal_region r /\\\n B.loc_includes (B.loc_region_only true r) (footprint m s) /\\\n B.live m s /\\\n B.(loc_disjoint (loc_addr_of_buffer s) (footprint_s m (B.deref m s))) /\\\n invariant_s m (B.get m s 0)\n\nval invariant_loc_in_footprint\n (#i: index)\n (s: state i)\n (m: HS.mem)\n: Lemma\n (requires (invariant m s))\n (ensures (B.loc_in (footprint m s) m))\n [SMTPat (invariant m s)]\n\n\n/// Ghost accessors needing the invariant\n/// -------------------------------------\n\nval g_last_packet_number: #i:index -> (s: state_s i) -> (h: HS.mem { invariant_s h s }) ->\n GTot (pn: PN.packet_number_t {\n Secret.v pn >= Secret.v (g_initial_packet_number s)\n })\n\nlet incrementable (#i: index) (s: state i) (h: HS.mem { invariant h s }) =\n Secret.v (g_last_packet_number (B.deref h s) h) + 1 < pow2 62\n\n/// Preserving all the ghost accessors via a single framing lemma only works\n/// because we don't do stack allocation. See comments in\n/// EverCrypt.Hash.Incremental.\nval frame_invariant: #i:index -> l:B.loc -> s:state i -> h0:HS.mem -> h1:HS.mem -> Lemma\n (requires (\n invariant h0 s /\\\n B.loc_disjoint l (footprint h0 s) /\\\n B.modifies l h0 h1))\n (ensures (\n invariant h1 s /\\\n footprint h0 s == footprint h1 s /\\\n g_last_packet_number (B.deref h0 s) h0 == g_last_packet_number (B.deref h1 s) h0 /\\\n g_traffic_secret (B.deref h0 s) == g_traffic_secret (B.deref h1 s)\n ))\n // Assertion failure: unexpected pattern term\n [ SMTPatOr [\n [ SMTPat (B.modifies l h0 h1); SMTPat (invariant h1 s) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (footprint h1 s) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (g_last_packet_number (B.deref h1 s)) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (g_traffic_secret (B.deref h1 s)) ]\n ] ]\n\n\n\n/// Actual stateful API\n/// -------------------\n\nval aead_alg_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack ea\n (requires (fun h0 -> invariant #(G.reveal i) h0 s))\n (ensures (fun h0 a h1 ->\n a == (G.reveal i).aead_alg /\\\n h0 == h1))\n\nval hash_alg_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack ha\n (requires (fun h0 -> invariant #(G.reveal i) h0 s))\n (ensures (fun h0 a h1 ->\n a == (G.reveal i).hash_alg /\\\n h0 == h1))\n\nval last_packet_number_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack PN.packet_number_t\n (requires fun h0 -> invariant h0 s)\n (ensures fun h0 ctr h1 ->\n ctr == g_last_packet_number (B.deref h0 s) h0 /\\\n h0 == h1)\n\n// : we could be defensive and allow callers to pass potentially unsupported\n// algorithms; however, this would require a lot more machinery as we would not\n// even be able to state the index type, since index currently has a refinement\n// that the two algorithms are supported. We would have to separate index into\n// index0 and a well-formedness refinement. Not sure it's worth it. We can\n// always perform redundant tests inside the definition of create to be fully\n// defensive.\ninline_for_extraction noextract", "dependencies": { "source_file": "QUIC.State.fsti", "checked_file": "QUIC.State.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Crypto.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: QUIC.State.index -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.State.index", "FStar.Monotonic.HyperHeap.rid", "LowStar.Buffer.pointer", "LowStar.Buffer.pointer_or_null", "QUIC.State.state_s", "QUIC.Spec.PacketNumber.Base.packet_number_t", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "Prims.b2t", "Prims.op_Equality", "Prims.nat", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Spec.Hash.Definitions.hash_length", "QUIC.State.__proj__Mkindex__item__hash_alg", "EverCrypt.Error.error_code", "FStar.Monotonic.HyperStack.mem", "Prims.l_and", "FStar.HyperStack.ST.is_eternal_region", "LowStar.Monotonic.Buffer.live", "LowStar.Monotonic.Buffer.disjoint", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_none", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "QUIC.State.invariant", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Monotonic.Buffer.fresh_loc", "QUIC.State.footprint", "Prims.eq2", "FStar.Seq.Base.seq", "QUIC.State.g_traffic_secret", "LowStar.Monotonic.Buffer.deref", "LowStar.Monotonic.Buffer.as_seq", "QUIC.State.g_last_packet_number", "QUIC.State.g_initial_packet_number", "Prims.l_False" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let create_in_st (i: index) =", "completed_definiton": "\n r: HS.rid ->\n dst: B.pointer (B.pointer_or_null (state_s i)) ->\n initial_pn: PN.packet_number_t ->\n traffic_secret:\n B.buffer Secret.uint8 {B.length traffic_secret = Spec.Hash.Definitions.hash_length i.hash_alg}\n -> HST.ST error_code\n (requires\n fun h0 ->\n HST.is_eternal_region r /\\ B.live h0 dst /\\ B.live h0 traffic_secret /\\\n B.disjoint dst traffic_secret)\n (ensures\n (fun h0 e h1 ->\n match e with\n | UnsupportedAlgorithm -> let open B in modifies loc_none h0 h1\n | Success ->\n let s = B.deref h1 dst in\n not (B.g_is_null s) /\\ invariant h1 s /\\ B.(modifies (loc_buffer dst) h0 h1) /\\\n B.fresh_loc (footprint h1 s) h0 h1 /\\\n g_traffic_secret (B.deref h1 s) == B.as_seq h0 traffic_secret /\\\n g_last_packet_number (B.deref h1 s) h1 == initial_pn /\\\n g_initial_packet_number (B.deref h1 s) == initial_pn\n | _ -> False))", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fsti", "name": "QUIC.State.decrypt_post", "original_source_type": "val decrypt_post\n (i: index)\n (s: state i)\n (dst: B.pointer result)\n (packet: B.buffer U8.t)\n (len: U32.t)\n (cid_len: U8.t)\n (h0: HS.mem)\n (res: error_code)\n (h1: HS.mem)\n : Pure Type0\n (requires\n U8.v cid_len <= 20 /\\ U32.v len == B.length packet /\\ invariant h0 s /\\ incrementable s h0)\n (ensures fun _ -> True)", "source_type": "val decrypt_post\n (i: index)\n (s: state i)\n (dst: B.pointer result)\n (packet: B.buffer U8.t)\n (len: U32.t)\n (cid_len: U8.t)\n (h0: HS.mem)\n (res: error_code)\n (h1: HS.mem)\n : Pure Type0\n (requires\n U8.v cid_len <= 20 /\\ U32.v len == B.length packet /\\ invariant h0 s /\\ incrementable s h0)\n (ensures fun _ -> True)", "source_definition": "let decrypt_post (i: index)\n (s:state i)\n (dst: B.pointer result)\n (packet: B.buffer U8.t)\n (len: U32.t)\n (cid_len: U8.t)\n (h0: HS.mem)\n (res: error_code)\n (h1: HS.mem): Pure Type0\n (requires\n U8.v cid_len <= 20 /\\\n U32.v len == B.length packet /\\\n invariant h0 s /\\\n incrementable s h0)\n (ensures fun _ -> True)\n=\n let max (x y: nat) : Tot nat = if x >= y then x else y in\n let k = derive_k i s h0 in\n let iv = derive_iv i s h0 in\n let pne = derive_pne i s h0 in\n let prev = g_last_packet_number (B.deref h0 s) h0 in\n invariant h1 s /\\\n footprint_s h1 (B.deref h1 s) == footprint_s h0 (B.deref h0 s) /\\\n begin\n let r = B.deref h1 dst in\n match res with\n | Success ->\n // prev is known to be >= g_initial_packet_number (see lemma invariant_packet_number)\n Secret.v (g_last_packet_number (B.deref h1 s) h1) == max (Secret.v prev) (Secret.v r.Base.pn) /\\ (\n\n // Lengths\n r.header_len == header_len r.header /\\\n Secret.v r.header_len + Secret.v r.plain_len <= Secret.v r.total_len /\\\n Secret.v r.total_len <= B.length packet /\\\n B.(loc_includes (loc_buffer (B.gsub packet 0ul (Secret.reveal r.header_len))) (header_footprint r.header)) /\\\n header_live r.header h1 /\\\n Secret.v r.total_len <= B.length packet /\\\n \n // Contents\n (\n let fmt = B.as_seq h1 (B.gsub packet 0ul (Secret.reveal r.header_len)) in\n let plain =\n B.as_seq h1 (B.gsub packet (Secret.reveal r.header_len) (Secret.reveal r.plain_len)) in\n let rem = B.as_seq h0 (B.gsub packet (Secret.reveal r.total_len) (B.len packet `U32.sub `Secret.reveal r.total_len)) in\n match Spec.decrypt i.aead_alg k iv pne (Secret.v prev) (U8.v cid_len) (B.as_seq h0 packet) with\n | Spec.Success h' plain' rem' ->\n h' == g_header r.header h1 r.Base.pn /\\\n fmt == QUIC.Spec.Header.Parse.format_header h' /\\\n plain' == plain /\\\n rem' == rem\n | _ -> False\n ))\n | DecodeError ->\n Spec.Failure? (Spec.decrypt i.aead_alg k iv pne (Secret.v prev) (U8.v cid_len) (B.as_seq h0 packet))\n | AuthenticationFailure ->\n Spec.Failure? (Spec.decrypt i.aead_alg k iv pne (Secret.v prev) (U8.v cid_len) (B.as_seq h0 packet)) /\\\n Secret.v r.total_len <= B.length packet\n | _ ->\n False\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 307, "start_col": 1, "end_line": 351, "end_col": 5 }, "file_context": "module QUIC.State\n\nopen EverCrypt.Error\ninclude QUIC.Spec.Crypto\ninclude QUIC.Impl.Header.Base\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule Seq = QUIC.Secret.Seq\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule HST = FStar.HyperStack.ST\nmodule Secret = QUIC.Secret.Int\nmodule G = FStar.Ghost\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule Base = QUIC.Impl.Header.Base\nmodule Spec = QUIC.Spec\n\n#set-options \"--z3rlimit 16\"\n\n/// This is not a cryptographic index; rather, this is just a regular type\n/// index, where instead of indexing on a single algorithm (like, say, AEAD), we\n/// index on two values.\n///\n/// The record is here to limit the profileration of hide/reveal in the stateful\n/// functions, and to give easier projectors (, ).\ntype index = {\n hash_alg: ha;\n aead_alg: ea\n}\n\n\n/// Boilerplate\n/// -----------\n\n[@CAbstractStruct]\nval state_s: index -> Type0\n\nlet state i = B.pointer (state_s i)\n\nval footprint_s: #i:index -> HS.mem -> state_s i -> GTot B.loc\nlet footprint (#i:index) (m: HS.mem) (s: state i) =\n B.(loc_union (loc_addr_of_buffer s) (footprint_s m (B.deref m s)))\n\nlet loc_includes_union_l_footprint_s\n (m: HS.mem)\n (l1 l2: B.loc) (#a: index) (s: state_s a)\n: Lemma\n (requires (\n B.loc_includes l1 (footprint_s m s) \\/ B.loc_includes l2 (footprint_s m s)\n ))\n (ensures (B.loc_includes (B.loc_union l1 l2) (footprint_s m s)))\n [SMTPat (B.loc_includes (B.loc_union l1 l2) (footprint_s m s))]\n= B.loc_includes_union_l l1 l2 (footprint_s m s)\n\n/// Ghost accessors (not needing the invariant)\n/// -------------------------------------------\n///\n/// We need to define those, so that we can state a framing lemma for them.\n/// Attempting a new convention to distinguish ghost accessors from stateful\n/// functions: a ``g_`` prefix.\n\n/// See remark for ``g_initial_packet_number`` below.\nval g_traffic_secret: #i:index -> (s: state_s i) ->\n GTot (Spec.Hash.Definitions.bytes_hash i.hash_alg)\n\n#push-options \"--max_ifuel 1\" // inversion on hash_alg\nlet hash_is_keysized #i (s: state_s i): Lemma\n (ensures (keysized i.hash_alg (Seq.length (g_traffic_secret s))))\n [ SMTPat (g_traffic_secret s) ]\n=\n assert_norm (512 < pow2 61);\n assert_norm (512 < pow2 125)\n#pop-options\n\n/// Note that this one does *NOT* take the memory as an argument. (This is\n/// because the initial packet number is erased in the concrete state.) Callers\n/// should be able to derive, from this, that the initial packet number remains\n/// the same, thanks to the precise use of footprint_s in encrypt/decrypt.\nval g_initial_packet_number: #i:index -> (s: state_s i) -> GTot PN.packet_number_t\n\n/// Invariant\n/// ---------\n\nval invariant_s: (#i:index) -> HS.mem -> state_s i -> Type0\nlet invariant (#i:index) (m: HS.mem) (s: state i) =\n let r = B.frameOf s in\n HST.is_eternal_region r /\\\n B.loc_includes (B.loc_region_only true r) (footprint m s) /\\\n B.live m s /\\\n B.(loc_disjoint (loc_addr_of_buffer s) (footprint_s m (B.deref m s))) /\\\n invariant_s m (B.get m s 0)\n\nval invariant_loc_in_footprint\n (#i: index)\n (s: state i)\n (m: HS.mem)\n: Lemma\n (requires (invariant m s))\n (ensures (B.loc_in (footprint m s) m))\n [SMTPat (invariant m s)]\n\n\n/// Ghost accessors needing the invariant\n/// -------------------------------------\n\nval g_last_packet_number: #i:index -> (s: state_s i) -> (h: HS.mem { invariant_s h s }) ->\n GTot (pn: PN.packet_number_t {\n Secret.v pn >= Secret.v (g_initial_packet_number s)\n })\n\nlet incrementable (#i: index) (s: state i) (h: HS.mem { invariant h s }) =\n Secret.v (g_last_packet_number (B.deref h s) h) + 1 < pow2 62\n\n/// Preserving all the ghost accessors via a single framing lemma only works\n/// because we don't do stack allocation. See comments in\n/// EverCrypt.Hash.Incremental.\nval frame_invariant: #i:index -> l:B.loc -> s:state i -> h0:HS.mem -> h1:HS.mem -> Lemma\n (requires (\n invariant h0 s /\\\n B.loc_disjoint l (footprint h0 s) /\\\n B.modifies l h0 h1))\n (ensures (\n invariant h1 s /\\\n footprint h0 s == footprint h1 s /\\\n g_last_packet_number (B.deref h0 s) h0 == g_last_packet_number (B.deref h1 s) h0 /\\\n g_traffic_secret (B.deref h0 s) == g_traffic_secret (B.deref h1 s)\n ))\n // Assertion failure: unexpected pattern term\n [ SMTPatOr [\n [ SMTPat (B.modifies l h0 h1); SMTPat (invariant h1 s) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (footprint h1 s) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (g_last_packet_number (B.deref h1 s)) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (g_traffic_secret (B.deref h1 s)) ]\n ] ]\n\n\n\n/// Actual stateful API\n/// -------------------\n\nval aead_alg_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack ea\n (requires (fun h0 -> invariant #(G.reveal i) h0 s))\n (ensures (fun h0 a h1 ->\n a == (G.reveal i).aead_alg /\\\n h0 == h1))\n\nval hash_alg_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack ha\n (requires (fun h0 -> invariant #(G.reveal i) h0 s))\n (ensures (fun h0 a h1 ->\n a == (G.reveal i).hash_alg /\\\n h0 == h1))\n\nval last_packet_number_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack PN.packet_number_t\n (requires fun h0 -> invariant h0 s)\n (ensures fun h0 ctr h1 ->\n ctr == g_last_packet_number (B.deref h0 s) h0 /\\\n h0 == h1)\n\n// : we could be defensive and allow callers to pass potentially unsupported\n// algorithms; however, this would require a lot more machinery as we would not\n// even be able to state the index type, since index currently has a refinement\n// that the two algorithms are supported. We would have to separate index into\n// index0 and a well-formedness refinement. Not sure it's worth it. We can\n// always perform redundant tests inside the definition of create to be fully\n// defensive.\ninline_for_extraction noextract\nlet create_in_st (i:index) =\n r:HS.rid ->\n dst: B.pointer (B.pointer_or_null (state_s i)) ->\n initial_pn:PN.packet_number_t ->\n traffic_secret:B.buffer Secret.uint8 {\n B.length traffic_secret = Spec.Hash.Definitions.hash_length i.hash_alg\n } ->\n HST.ST error_code\n (requires fun h0 ->\n // : we could require that ``dst`` point to NULL prior to calling\n // ``create`` (otherwise, it's a memory leak). Other modules don't enforce\n // this (see AEAD) so for now, let's make the caller's life easier and not\n // demand anything.\n HST.is_eternal_region r /\\\n B.live h0 dst /\\ B.live h0 traffic_secret /\\\n B.disjoint dst traffic_secret)\n (ensures (fun h0 e h1 ->\n match e with\n | UnsupportedAlgorithm ->\n B.(modifies loc_none h0 h1)\n | Success ->\n let s = B.deref h1 dst in\n not (B.g_is_null s) /\\\n invariant h1 s /\\\n\n B.(modifies (loc_buffer dst) h0 h1) /\\\n B.fresh_loc (footprint h1 s) h0 h1 /\\\n\n g_traffic_secret (B.deref h1 s) == B.as_seq h0 traffic_secret /\\ \n g_last_packet_number (B.deref h1 s) h1 == initial_pn /\\\n\n g_initial_packet_number (B.deref h1 s) == initial_pn\n | _ ->\n False))\n\n// The index is passed at run-time.\nval create_in: i:index -> create_in_st i\n\n\n(* Useful shortcuts *)\n\nlet derive_k\n (i: index)\n (s: state i)\n (h: HS.mem)\n: GTot (Seq.seq Secret.uint8)\n=\n let s0 = g_traffic_secret (B.deref h s) in\n Spec.derive_secret i.hash_alg s0 Spec.label_key (Spec.Agile.AEAD.key_length i.aead_alg)\n\nlet derive_iv\n (i: index)\n (s: state i)\n (h: HS.mem)\n: GTot (Seq.seq Secret.uint8)\n= let s0 = g_traffic_secret (B.deref h s) in\n Spec.derive_secret i.hash_alg s0 Spec.label_iv 12\n\nlet derive_pne\n (i: index)\n (s: state i)\n (h: HS.mem)\n: GTot (Seq.seq Secret.uint8)\n= let s0 = g_traffic_secret (B.deref h s) in\n Spec.derive_secret i.hash_alg s0 Spec.label_hp (cipher_keysize i.aead_alg)\n\nval encrypt: #i:G.erased index -> (\n let i = G.reveal i in\n s: state i ->\n dst: B.buffer U8.t ->\n dst_pn: B.pointer PN.packet_number_t ->\n h: header ->\n plain: B.buffer Secret.uint8 ->\n plain_len: U32.t ->\n HST.Stack error_code\n (requires fun h0 ->\n // Memory & preservation\n B.live h0 plain /\\ B.live h0 dst /\\ B.live h0 dst_pn /\\\n header_live h h0 /\\\n B.(all_disjoint [ footprint h0 s; loc_buffer dst; loc_buffer dst_pn; header_footprint h; loc_buffer plain ]) /\\\n invariant h0 s /\\\n incrementable s h0 /\\\n B.length plain == U32.v plain_len /\\ (\n let clen = if is_retry h then 0 else U32.v plain_len + Spec.Agile.AEAD.tag_length i.aead_alg in\n (if is_retry h then U32.v plain_len == 0 else 3 <= U32.v plain_len /\\ U32.v plain_len < Spec.max_plain_length) /\\\n (has_payload_length h ==> Secret.v (payload_length h) == clen) /\\\n B.length dst == Secret.v (header_len h) + clen\n ))\n (ensures fun h0 r h1 ->\n match r with\n | Success ->\n // Memory & preservation\n B.(modifies (footprint_s h0 (deref h0 s) `loc_union` loc_buffer dst `loc_union` loc_buffer dst_pn)) h0 h1 /\\\n invariant h1 s /\\\n footprint_s h1 (B.deref h1 s) == footprint_s h0 (B.deref h0 s) /\\ (\n // Functional correctness\n let k = derive_k i s h0 in\n let iv = derive_iv i s h0 in\n let pne = derive_pne i s h0 in\n let plain = B.as_seq h0 plain in\n let packet: packet = B.as_seq h1 dst in\n let pn = g_last_packet_number (B.deref h0 s) h0 `Secret.add` Secret.to_u64 1uL in\n B.deref h1 dst_pn == pn /\\\n packet == Spec.encrypt i.aead_alg k iv pne (g_header h h0 pn) (Seq.seq_reveal plain) /\\\n g_last_packet_number (B.deref h1 s) h1 == pn)\n | _ ->\n False))\n\nval initial_secrets (dst_client: B.buffer Secret.uint8)\n (dst_server: B.buffer Secret.uint8)\n (cid: B.buffer Secret.uint8)\n (cid_len: U32.t):\n HST.Stack unit\n (requires (fun h0 ->\n B.(all_live h0 [ buf dst_client; buf dst_server; buf cid ]) /\\\n B.length dst_client = Spec.Agile.Hash.(hash_length SHA2_256) /\\\n B.length dst_server = Spec.Agile.Hash.(hash_length SHA2_256) /\\\n B.length cid = U32.v cid_len /\\\n U32.v cid_len <= 20 /\\\n B.(all_disjoint [ loc_buffer dst_client; loc_buffer dst_server; loc_buffer cid ])))\n (ensures (fun h0 _ h1 ->\n B.(modifies (loc_buffer dst_client `loc_union` loc_buffer dst_server) h0 h1)))\n\nunfold\nlet decrypt_post (i: index)\n (s:state i)\n (dst: B.pointer result)\n (packet: B.buffer U8.t)\n (len: U32.t)\n (cid_len: U8.t)\n (h0: HS.mem)\n (res: error_code)\n (h1: HS.mem): Pure Type0\n (requires\n U8.v cid_len <= 20 /\\\n U32.v len == B.length packet /\\\n invariant h0 s /\\\n incrementable s h0)", "dependencies": { "source_file": "QUIC.State.fsti", "checked_file": "QUIC.State.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Crypto.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n i: QUIC.State.index ->\n s: QUIC.State.state i ->\n dst: LowStar.Buffer.pointer QUIC.Impl.Header.Base.result ->\n packet: LowStar.Buffer.buffer FStar.UInt8.t ->\n len: FStar.UInt32.t ->\n cid_len: FStar.UInt8.t ->\n h0: FStar.Monotonic.HyperStack.mem ->\n res: EverCrypt.Error.error_code ->\n h1: FStar.Monotonic.HyperStack.mem\n -> Prims.Pure Type0", "effect": "Prims.Pure", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.State.index", "QUIC.State.state", "LowStar.Buffer.pointer", "QUIC.Impl.Header.Base.result", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "FStar.Monotonic.HyperStack.mem", "EverCrypt.Error.error_code", "Prims.l_and", "QUIC.State.invariant", "Prims.eq2", "LowStar.Monotonic.Buffer.loc", "QUIC.State.footprint_s", "LowStar.Monotonic.Buffer.deref", "QUIC.State.state_s", "LowStar.Buffer.trivial_preorder", "Prims.int", "Prims.l_or", "Lib.IntTypes.range", "Lib.IntTypes.U64", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.SEC", "QUIC.State.g_last_packet_number", "QUIC.Impl.Header.Base.__proj__Mkresult__item__pn", "Lib.IntTypes.uint32", "QUIC.Impl.Header.Base.__proj__Mkresult__item__header_len", "QUIC.Impl.Header.Base.header_len", "QUIC.Impl.Header.Base.__proj__Mkresult__item__header", "Prims.op_LessThanOrEqual", "Prims.op_Addition", "Lib.IntTypes.U32", "QUIC.Impl.Header.Base.__proj__Mkresult__item__plain_len", "QUIC.Impl.Header.Base.__proj__Mkresult__item__total_len", "LowStar.Monotonic.Buffer.length", "LowStar.Monotonic.Buffer.loc_includes", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Buffer.gsub", "FStar.UInt32.__uint_to_t", "QUIC.Secret.Int.reveal", "QUIC.Impl.Header.Base.header_footprint", "QUIC.Impl.Header.Base.header_live", "QUIC.Spec.decrypt", "QUIC.State.__proj__Mkindex__item__aead_alg", "FStar.UInt8.v", "LowStar.Monotonic.Buffer.as_seq", "QUIC.Spec.Header.Base.header", "QUIC.Spec.Base.bytes", "QUIC.Impl.Header.Base.g_header", "FStar.Seq.Base.seq", "QUIC.Spec.Base.byte", "QUIC.Spec.Header.Parse.format_header", "QUIC.Spec.result", "Prims.l_False", "Prims.logical", "FStar.UInt32.sub", "LowStar.Monotonic.Buffer.len", "QUIC.Spec.uu___is_Failure", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Lib.IntTypes.v", "QUIC.State.g_initial_packet_number", "LowStar.Monotonic.Buffer.get", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "QUIC.State.derive_pne", "QUIC.State.derive_iv", "QUIC.State.derive_k", "Prims.nat", "Prims.bool", "FStar.UInt.size", "FStar.UInt32.n", "FStar.UInt32.v", "QUIC.State.incrementable", "Prims.l_True" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val decrypt_post\n (i: index)\n (s: state i)\n (dst: B.pointer result)\n (packet: B.buffer U8.t)\n (len: U32.t)\n (cid_len: U8.t)\n (h0: HS.mem)\n (res: error_code)\n (h1: HS.mem)\n : Pure Type0\n (requires\n U8.v cid_len <= 20 /\\ U32.v len == B.length packet /\\ invariant h0 s /\\ incrementable s h0)\n (ensures fun _ -> True)\nlet decrypt_post\n (i: index)\n (s: state i)\n (dst: B.pointer result)\n (packet: B.buffer U8.t)\n (len: U32.t)\n (cid_len: U8.t)\n (h0: HS.mem)\n (res: error_code)\n (h1: HS.mem)\n : Pure Type0\n (requires\n U8.v cid_len <= 20 /\\ U32.v len == B.length packet /\\ invariant h0 s /\\ incrementable s h0)\n (ensures fun _ -> True) =", "completed_definiton": "let max (x y: nat) : Tot nat = if x >= y then x else y in\nlet k = derive_k i s h0 in\nlet iv = derive_iv i s h0 in\nlet pne = derive_pne i s h0 in\nlet prev = g_last_packet_number (B.deref h0 s) h0 in\ninvariant h1 s /\\ footprint_s h1 (B.deref h1 s) == footprint_s h0 (B.deref h0 s) /\\\n(let r = B.deref h1 dst in\n match res with\n | Success ->\n Secret.v (g_last_packet_number (B.deref h1 s) h1) == max (Secret.v prev) (Secret.v r.Base.pn) /\\\n (r.header_len == header_len r.header /\\\n Secret.v r.header_len + Secret.v r.plain_len <= Secret.v r.total_len /\\\n Secret.v r.total_len <= B.length packet /\\\n B.(loc_includes (loc_buffer (B.gsub packet 0ul (Secret.reveal r.header_len)))\n (header_footprint r.header)) /\\ header_live r.header h1 /\\\n Secret.v r.total_len <= B.length packet /\\\n (let fmt = B.as_seq h1 (B.gsub packet 0ul (Secret.reveal r.header_len)) in\n let plain =\n B.as_seq h1 (B.gsub packet (Secret.reveal r.header_len) (Secret.reveal r.plain_len))\n in\n let rem =\n B.as_seq h0\n (B.gsub packet\n (Secret.reveal r.total_len)\n ((B.len packet) `U32.sub` (Secret.reveal r.total_len)))\n in\n match\n Spec.decrypt i.aead_alg k iv pne (Secret.v prev) (U8.v cid_len) (B.as_seq h0 packet)\n with\n | Spec.Success h' plain' rem' ->\n h' == g_header r.header h1 r.Base.pn /\\ fmt == QUIC.Spec.Header.Parse.format_header h' /\\\n plain' == plain /\\ rem' == rem\n | _ -> False))\n | DecodeError ->\n Spec.Failure? (Spec.decrypt i.aead_alg\n k\n iv\n pne\n (Secret.v prev)\n (U8.v cid_len)\n (B.as_seq h0 packet))\n | AuthenticationFailure ->\n Spec.Failure? (Spec.decrypt i.aead_alg\n k\n iv\n pne\n (Secret.v prev)\n (U8.v cid_len)\n (B.as_seq h0 packet)) /\\ Secret.v r.total_len <= B.length packet\n | _ -> False)", "isa_cross_project_example": true }, { "file_name": "Mem.fst", "name": "Mem.model", "original_source_type": "", "source_type": "val model : Prims.bool", "source_definition": "let model = Model.Flags.model", "source": { "project_name": "everquic-crypto", "file_name": "src/Mem.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 38, "start_col": 12, "end_line": 38, "end_col": 29 }, "file_context": "module Mem\n\n/// * Sets a uniform Low* HyperStack-based memory model, gathering\n/// abbreviations and top-level regions.\n///\n/// * Depends on Flags, as we do not to extract the global TLS region\n/// and its contents (only ideal stuff).\n///\n/// Coding guidelines (aligned to EverCrypt)\n/// - avoid eternal refs and buffers (fstar may deprecate them in lowstar)\n/// - use LowStar.Buffer\n/// - use monotonic buffers\n///\n/// - migrate from Bytes --> Spec-level sequences or Buffer [will take a while]\n/// - enable divergence checking (try it out on a Everest feature branch?)\n/// - use abbreviations wisely, e.g. only those to be defined in this file\n/// (no clear consensus yet)\n/// - use FStar.Integers (but avoid opening it because of v n etc... IntegersOps?)\n///\n/// - [create parent_region ...] may allocate a private sub-region,\n/// unless its state is e.g. just a single transparent reference;\n/// the caller usually tracks it using locations rather than regions.\n\nopen FStar.Error\n\ninclude FStar.HyperStack\ninclude FStar.HyperStack.ST\n\nopen LowStar.Buffer\nopen LowStar.BufferOps\n\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--z3rlimit 40 --max_fuel 0 --max_ifuel 0\"", "dependencies": { "source_file": "Mem.fst", "checked_file": "Mem.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Model.Flags.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 40, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.Flags.model" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let model =", "completed_definiton": "Model.Flags.model", "isa_cross_project_example": true }, { "file_name": "Mem.fst", "name": "Mem.loc_ae_region", "original_source_type": "val loc_ae_region: unit -> GTot loc", "source_type": "val loc_ae_region: unit -> GTot loc", "source_definition": "let loc_ae_region _ = loc_region_only true q_ae_region", "source": { "project_name": "everquic-crypto", "file_name": "src/Mem.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 172, "start_col": 22, "end_line": 172, "end_col": 54 }, "file_context": "module Mem\n\n/// * Sets a uniform Low* HyperStack-based memory model, gathering\n/// abbreviations and top-level regions.\n///\n/// * Depends on Flags, as we do not to extract the global TLS region\n/// and its contents (only ideal stuff).\n///\n/// Coding guidelines (aligned to EverCrypt)\n/// - avoid eternal refs and buffers (fstar may deprecate them in lowstar)\n/// - use LowStar.Buffer\n/// - use monotonic buffers\n///\n/// - migrate from Bytes --> Spec-level sequences or Buffer [will take a while]\n/// - enable divergence checking (try it out on a Everest feature branch?)\n/// - use abbreviations wisely, e.g. only those to be defined in this file\n/// (no clear consensus yet)\n/// - use FStar.Integers (but avoid opening it because of v n etc... IntegersOps?)\n///\n/// - [create parent_region ...] may allocate a private sub-region,\n/// unless its state is e.g. just a single transparent reference;\n/// the caller usually tracks it using locations rather than regions.\n\nopen FStar.Error\n\ninclude FStar.HyperStack\ninclude FStar.HyperStack.ST\n\nopen LowStar.Buffer\nopen LowStar.BufferOps\n\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--z3rlimit 40 --max_fuel 0 --max_ifuel 0\"\n\ninline_for_extraction noextract\nlet model = Model.Flags.model\n\n// START quic-specific version of what was originally found in miTLS Mem.fst\nlet rgn = r:erid{r =!= root}\n\ntype fresh_subregion child parent h0 h1 =\n fresh_region child h0 h1 /\\ extends child parent\n\ntype subrgn p = r:rgn{parent r == p}\n\nlet quic_region: rgn = new_region root\ntype subq = subrgn quic_region\n// END quic-specific stuff\n\n/// Top-level disjointness\n/// ----------------------\n///\n/// We define an infrastructure for allocating a set of regions that are know\n/// automatically to be disjoint from each other.\n\n#push-options \"--max_ifuel 1\"\n\n(** r `rlist_disjoint` l holds if r is disjoint from all regions in l *)\nval rlist_disjoint: subq -> list subq -> Type0\nlet rec rlist_disjoint r = function\n | [] -> True\n | r' :: l -> r `HS.disjoint` r' /\\ rlist_disjoint r l\n\n(** r_pairwise_disjoint l holds if all regions in l are pairwise disjoint *)\nval r_pairwise_disjoint: list subq -> Type0\nlet rec r_pairwise_disjoint = function\n | [] -> True\n | r :: l -> rlist_disjoint r l /\\ r_pairwise_disjoint l\n\n(** r_fresh l h0 h1 holds when all regions in l are fresh between h0 and h1 *)\nval r_fresh: list subq -> mem -> mem -> Type0\nlet rec r_fresh l h0 h1 =\n match l with\n | [] -> True\n | r :: l -> fresh_region r h0 h1 /\\ r_fresh l h0 h1\n\nval fresh_back (r:rgn) (h0 h1 h2:mem) : Lemma\n (requires fresh_region r h1 h2 /\\ modifies_none h0 h1)\n (ensures fresh_region r h0 h2)\n// [SMTPat (fresh_region r h1 h2); SMTPat (modifies_none h0 h1)]\nlet fresh_back r h0 h1 h2 = ()\n\n#pop-options\n\n#push-options \"--max_fuel 1 --max_ifuel 1\"\n\nval r_fresh_back (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h1 h2 /\\ modifies_none h0 h1)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_back l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_back l' h0 h1 h2\n\nval r_fresh_fwd (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ modifies_none h1 h2)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_fwd l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_fwd l' h0 h1 h2\n\nval r_fresh_disjoint (r:subq) (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ fresh_region r h1 h2)\n (ensures rlist_disjoint r l)\nlet rec r_fresh_disjoint r l h0 h1 h2 =\n match l with\n | [] -> ()\n | r' :: l' ->\n lemma_extends_disjoint quic_region r r';\n r_fresh_disjoint r l' h0 h1 h2\n\nval r_fresh_forall: l:list subq -> h0:mem -> h1:mem -> Lemma\n ((forall r.{:pattern fresh_region r h0 h1} List.Tot.mem r l ==> fresh_region r h0 h1) <==>\n r_fresh l h0 h1)\nlet rec r_fresh_forall l h0 h1 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_forall l' h0 h1\n\n(** Allocates n pairwise disjoint subregions of tls_region *)\nval r_disjoint_alloc: n:nat -> ST (l:list subq)\n (requires fun h0 -> True)\n (ensures fun h0 l h1 ->\n modifies_none h0 h1 /\\\n r_fresh l h0 h1 /\\\n List.Tot.length l == n /\\\n r_pairwise_disjoint l)\n\nlet rec r_disjoint_alloc n =\n if n = 0 then []\n else\n begin\n let h0 = ST.get () in\n let l = r_disjoint_alloc (n-1) in\n let h1 = ST.get () in\n let r = new_region quic_region in\n let h2 = ST.get () in\n r_fresh_disjoint r l h0 h1 h2;\n r_fresh_fwd l h0 h1 h2;\n r :: l\n end\n\n#pop-options\n\n// We use region disjointness as a coarse grained way of framing invariants.\nlet top_regions: (l:list subq{List.Tot.length l == 5 /\\ r_pairwise_disjoint l})\n = r_disjoint_alloc 5\n\nlet q_ae_region = List.Tot.index top_regions 0\nlet q_pne_region = List.Tot.index top_regions 1\nlet q_idx_region = List.Tot.index top_regions 2\n\n#push-options \"--z3rlimit 40 --max_fuel 5 --max_ifuel 0\"\n\nval top_regions_disjoint: i:nat{i < 5} -> j:nat{j < 5} -> Lemma\n (requires i <> j)\n (ensures (List.Tot.index top_regions i) `HS.disjoint` (List.Tot.index top_regions j))\n [SMTPat (List.Tot.index top_regions i); SMTPat (List.Tot.index top_regions j)]\nlet top_regions_disjoint i j = ()\n\n#pop-options\n\n/// Loc-based disjointness\n///\n/// `loc_region_only` has GTot effect so we need to thunk these to avoid\n/// problems with top-level masked effects", "dependencies": { "source_file": "Mem.fst", "checked_file": "Mem.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Model.Flags.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 40, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit -> Prims.GTot LowStar.Monotonic.Buffer.loc", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "LowStar.Monotonic.Buffer.loc_region_only", "Mem.q_ae_region", "LowStar.Monotonic.Buffer.loc" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val loc_ae_region: unit -> GTot loc\nlet loc_ae_region _ =", "completed_definiton": "loc_region_only true q_ae_region", "isa_cross_project_example": true }, { "file_name": "Mem.fst", "name": "Mem.loc_pne_region", "original_source_type": "val loc_pne_region: unit -> GTot loc", "source_type": "val loc_pne_region: unit -> GTot loc", "source_definition": "let loc_pne_region _ = loc_region_only true q_pne_region", "source": { "project_name": "everquic-crypto", "file_name": "src/Mem.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 175, "start_col": 23, "end_line": 175, "end_col": 56 }, "file_context": "module Mem\n\n/// * Sets a uniform Low* HyperStack-based memory model, gathering\n/// abbreviations and top-level regions.\n///\n/// * Depends on Flags, as we do not to extract the global TLS region\n/// and its contents (only ideal stuff).\n///\n/// Coding guidelines (aligned to EverCrypt)\n/// - avoid eternal refs and buffers (fstar may deprecate them in lowstar)\n/// - use LowStar.Buffer\n/// - use monotonic buffers\n///\n/// - migrate from Bytes --> Spec-level sequences or Buffer [will take a while]\n/// - enable divergence checking (try it out on a Everest feature branch?)\n/// - use abbreviations wisely, e.g. only those to be defined in this file\n/// (no clear consensus yet)\n/// - use FStar.Integers (but avoid opening it because of v n etc... IntegersOps?)\n///\n/// - [create parent_region ...] may allocate a private sub-region,\n/// unless its state is e.g. just a single transparent reference;\n/// the caller usually tracks it using locations rather than regions.\n\nopen FStar.Error\n\ninclude FStar.HyperStack\ninclude FStar.HyperStack.ST\n\nopen LowStar.Buffer\nopen LowStar.BufferOps\n\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--z3rlimit 40 --max_fuel 0 --max_ifuel 0\"\n\ninline_for_extraction noextract\nlet model = Model.Flags.model\n\n// START quic-specific version of what was originally found in miTLS Mem.fst\nlet rgn = r:erid{r =!= root}\n\ntype fresh_subregion child parent h0 h1 =\n fresh_region child h0 h1 /\\ extends child parent\n\ntype subrgn p = r:rgn{parent r == p}\n\nlet quic_region: rgn = new_region root\ntype subq = subrgn quic_region\n// END quic-specific stuff\n\n/// Top-level disjointness\n/// ----------------------\n///\n/// We define an infrastructure for allocating a set of regions that are know\n/// automatically to be disjoint from each other.\n\n#push-options \"--max_ifuel 1\"\n\n(** r `rlist_disjoint` l holds if r is disjoint from all regions in l *)\nval rlist_disjoint: subq -> list subq -> Type0\nlet rec rlist_disjoint r = function\n | [] -> True\n | r' :: l -> r `HS.disjoint` r' /\\ rlist_disjoint r l\n\n(** r_pairwise_disjoint l holds if all regions in l are pairwise disjoint *)\nval r_pairwise_disjoint: list subq -> Type0\nlet rec r_pairwise_disjoint = function\n | [] -> True\n | r :: l -> rlist_disjoint r l /\\ r_pairwise_disjoint l\n\n(** r_fresh l h0 h1 holds when all regions in l are fresh between h0 and h1 *)\nval r_fresh: list subq -> mem -> mem -> Type0\nlet rec r_fresh l h0 h1 =\n match l with\n | [] -> True\n | r :: l -> fresh_region r h0 h1 /\\ r_fresh l h0 h1\n\nval fresh_back (r:rgn) (h0 h1 h2:mem) : Lemma\n (requires fresh_region r h1 h2 /\\ modifies_none h0 h1)\n (ensures fresh_region r h0 h2)\n// [SMTPat (fresh_region r h1 h2); SMTPat (modifies_none h0 h1)]\nlet fresh_back r h0 h1 h2 = ()\n\n#pop-options\n\n#push-options \"--max_fuel 1 --max_ifuel 1\"\n\nval r_fresh_back (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h1 h2 /\\ modifies_none h0 h1)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_back l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_back l' h0 h1 h2\n\nval r_fresh_fwd (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ modifies_none h1 h2)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_fwd l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_fwd l' h0 h1 h2\n\nval r_fresh_disjoint (r:subq) (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ fresh_region r h1 h2)\n (ensures rlist_disjoint r l)\nlet rec r_fresh_disjoint r l h0 h1 h2 =\n match l with\n | [] -> ()\n | r' :: l' ->\n lemma_extends_disjoint quic_region r r';\n r_fresh_disjoint r l' h0 h1 h2\n\nval r_fresh_forall: l:list subq -> h0:mem -> h1:mem -> Lemma\n ((forall r.{:pattern fresh_region r h0 h1} List.Tot.mem r l ==> fresh_region r h0 h1) <==>\n r_fresh l h0 h1)\nlet rec r_fresh_forall l h0 h1 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_forall l' h0 h1\n\n(** Allocates n pairwise disjoint subregions of tls_region *)\nval r_disjoint_alloc: n:nat -> ST (l:list subq)\n (requires fun h0 -> True)\n (ensures fun h0 l h1 ->\n modifies_none h0 h1 /\\\n r_fresh l h0 h1 /\\\n List.Tot.length l == n /\\\n r_pairwise_disjoint l)\n\nlet rec r_disjoint_alloc n =\n if n = 0 then []\n else\n begin\n let h0 = ST.get () in\n let l = r_disjoint_alloc (n-1) in\n let h1 = ST.get () in\n let r = new_region quic_region in\n let h2 = ST.get () in\n r_fresh_disjoint r l h0 h1 h2;\n r_fresh_fwd l h0 h1 h2;\n r :: l\n end\n\n#pop-options\n\n// We use region disjointness as a coarse grained way of framing invariants.\nlet top_regions: (l:list subq{List.Tot.length l == 5 /\\ r_pairwise_disjoint l})\n = r_disjoint_alloc 5\n\nlet q_ae_region = List.Tot.index top_regions 0\nlet q_pne_region = List.Tot.index top_regions 1\nlet q_idx_region = List.Tot.index top_regions 2\n\n#push-options \"--z3rlimit 40 --max_fuel 5 --max_ifuel 0\"\n\nval top_regions_disjoint: i:nat{i < 5} -> j:nat{j < 5} -> Lemma\n (requires i <> j)\n (ensures (List.Tot.index top_regions i) `HS.disjoint` (List.Tot.index top_regions j))\n [SMTPat (List.Tot.index top_regions i); SMTPat (List.Tot.index top_regions j)]\nlet top_regions_disjoint i j = ()\n\n#pop-options\n\n/// Loc-based disjointness\n///\n/// `loc_region_only` has GTot effect so we need to thunk these to avoid\n/// problems with top-level masked effects\n\nval loc_ae_region: unit -> GTot loc\nlet loc_ae_region _ = loc_region_only true q_ae_region", "dependencies": { "source_file": "Mem.fst", "checked_file": "Mem.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Model.Flags.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 40, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit -> Prims.GTot LowStar.Monotonic.Buffer.loc", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "LowStar.Monotonic.Buffer.loc_region_only", "Mem.q_pne_region", "LowStar.Monotonic.Buffer.loc" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val loc_pne_region: unit -> GTot loc\nlet loc_pne_region _ =", "completed_definiton": "loc_region_only true q_pne_region", "isa_cross_project_example": true }, { "file_name": "Mem.fst", "name": "Mem.loc_idx_region", "original_source_type": "val loc_idx_region: unit -> GTot loc", "source_type": "val loc_idx_region: unit -> GTot loc", "source_definition": "let loc_idx_region _ = loc_region_only true q_idx_region", "source": { "project_name": "everquic-crypto", "file_name": "src/Mem.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 178, "start_col": 23, "end_line": 178, "end_col": 56 }, "file_context": "module Mem\n\n/// * Sets a uniform Low* HyperStack-based memory model, gathering\n/// abbreviations and top-level regions.\n///\n/// * Depends on Flags, as we do not to extract the global TLS region\n/// and its contents (only ideal stuff).\n///\n/// Coding guidelines (aligned to EverCrypt)\n/// - avoid eternal refs and buffers (fstar may deprecate them in lowstar)\n/// - use LowStar.Buffer\n/// - use monotonic buffers\n///\n/// - migrate from Bytes --> Spec-level sequences or Buffer [will take a while]\n/// - enable divergence checking (try it out on a Everest feature branch?)\n/// - use abbreviations wisely, e.g. only those to be defined in this file\n/// (no clear consensus yet)\n/// - use FStar.Integers (but avoid opening it because of v n etc... IntegersOps?)\n///\n/// - [create parent_region ...] may allocate a private sub-region,\n/// unless its state is e.g. just a single transparent reference;\n/// the caller usually tracks it using locations rather than regions.\n\nopen FStar.Error\n\ninclude FStar.HyperStack\ninclude FStar.HyperStack.ST\n\nopen LowStar.Buffer\nopen LowStar.BufferOps\n\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--z3rlimit 40 --max_fuel 0 --max_ifuel 0\"\n\ninline_for_extraction noextract\nlet model = Model.Flags.model\n\n// START quic-specific version of what was originally found in miTLS Mem.fst\nlet rgn = r:erid{r =!= root}\n\ntype fresh_subregion child parent h0 h1 =\n fresh_region child h0 h1 /\\ extends child parent\n\ntype subrgn p = r:rgn{parent r == p}\n\nlet quic_region: rgn = new_region root\ntype subq = subrgn quic_region\n// END quic-specific stuff\n\n/// Top-level disjointness\n/// ----------------------\n///\n/// We define an infrastructure for allocating a set of regions that are know\n/// automatically to be disjoint from each other.\n\n#push-options \"--max_ifuel 1\"\n\n(** r `rlist_disjoint` l holds if r is disjoint from all regions in l *)\nval rlist_disjoint: subq -> list subq -> Type0\nlet rec rlist_disjoint r = function\n | [] -> True\n | r' :: l -> r `HS.disjoint` r' /\\ rlist_disjoint r l\n\n(** r_pairwise_disjoint l holds if all regions in l are pairwise disjoint *)\nval r_pairwise_disjoint: list subq -> Type0\nlet rec r_pairwise_disjoint = function\n | [] -> True\n | r :: l -> rlist_disjoint r l /\\ r_pairwise_disjoint l\n\n(** r_fresh l h0 h1 holds when all regions in l are fresh between h0 and h1 *)\nval r_fresh: list subq -> mem -> mem -> Type0\nlet rec r_fresh l h0 h1 =\n match l with\n | [] -> True\n | r :: l -> fresh_region r h0 h1 /\\ r_fresh l h0 h1\n\nval fresh_back (r:rgn) (h0 h1 h2:mem) : Lemma\n (requires fresh_region r h1 h2 /\\ modifies_none h0 h1)\n (ensures fresh_region r h0 h2)\n// [SMTPat (fresh_region r h1 h2); SMTPat (modifies_none h0 h1)]\nlet fresh_back r h0 h1 h2 = ()\n\n#pop-options\n\n#push-options \"--max_fuel 1 --max_ifuel 1\"\n\nval r_fresh_back (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h1 h2 /\\ modifies_none h0 h1)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_back l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_back l' h0 h1 h2\n\nval r_fresh_fwd (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ modifies_none h1 h2)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_fwd l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_fwd l' h0 h1 h2\n\nval r_fresh_disjoint (r:subq) (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ fresh_region r h1 h2)\n (ensures rlist_disjoint r l)\nlet rec r_fresh_disjoint r l h0 h1 h2 =\n match l with\n | [] -> ()\n | r' :: l' ->\n lemma_extends_disjoint quic_region r r';\n r_fresh_disjoint r l' h0 h1 h2\n\nval r_fresh_forall: l:list subq -> h0:mem -> h1:mem -> Lemma\n ((forall r.{:pattern fresh_region r h0 h1} List.Tot.mem r l ==> fresh_region r h0 h1) <==>\n r_fresh l h0 h1)\nlet rec r_fresh_forall l h0 h1 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_forall l' h0 h1\n\n(** Allocates n pairwise disjoint subregions of tls_region *)\nval r_disjoint_alloc: n:nat -> ST (l:list subq)\n (requires fun h0 -> True)\n (ensures fun h0 l h1 ->\n modifies_none h0 h1 /\\\n r_fresh l h0 h1 /\\\n List.Tot.length l == n /\\\n r_pairwise_disjoint l)\n\nlet rec r_disjoint_alloc n =\n if n = 0 then []\n else\n begin\n let h0 = ST.get () in\n let l = r_disjoint_alloc (n-1) in\n let h1 = ST.get () in\n let r = new_region quic_region in\n let h2 = ST.get () in\n r_fresh_disjoint r l h0 h1 h2;\n r_fresh_fwd l h0 h1 h2;\n r :: l\n end\n\n#pop-options\n\n// We use region disjointness as a coarse grained way of framing invariants.\nlet top_regions: (l:list subq{List.Tot.length l == 5 /\\ r_pairwise_disjoint l})\n = r_disjoint_alloc 5\n\nlet q_ae_region = List.Tot.index top_regions 0\nlet q_pne_region = List.Tot.index top_regions 1\nlet q_idx_region = List.Tot.index top_regions 2\n\n#push-options \"--z3rlimit 40 --max_fuel 5 --max_ifuel 0\"\n\nval top_regions_disjoint: i:nat{i < 5} -> j:nat{j < 5} -> Lemma\n (requires i <> j)\n (ensures (List.Tot.index top_regions i) `HS.disjoint` (List.Tot.index top_regions j))\n [SMTPat (List.Tot.index top_regions i); SMTPat (List.Tot.index top_regions j)]\nlet top_regions_disjoint i j = ()\n\n#pop-options\n\n/// Loc-based disjointness\n///\n/// `loc_region_only` has GTot effect so we need to thunk these to avoid\n/// problems with top-level masked effects\n\nval loc_ae_region: unit -> GTot loc\nlet loc_ae_region _ = loc_region_only true q_ae_region\n\nval loc_pne_region: unit -> GTot loc\nlet loc_pne_region _ = loc_region_only true q_pne_region", "dependencies": { "source_file": "Mem.fst", "checked_file": "Mem.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Model.Flags.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 40, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit -> Prims.GTot LowStar.Monotonic.Buffer.loc", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "LowStar.Monotonic.Buffer.loc_region_only", "Mem.q_idx_region", "LowStar.Monotonic.Buffer.loc" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val loc_idx_region: unit -> GTot loc\nlet loc_idx_region _ =", "completed_definiton": "loc_region_only true q_idx_region", "isa_cross_project_example": true }, { "file_name": "Mem.fst", "name": "Mem.top_regions", "original_source_type": "val top_regions:(l: list subq {List.Tot.length l == 5 /\\ r_pairwise_disjoint l})", "source_type": "val top_regions:(l: list subq {List.Tot.length l == 5 /\\ r_pairwise_disjoint l})", "source_definition": "let top_regions: (l:list subq{List.Tot.length l == 5 /\\ r_pairwise_disjoint l})\n = r_disjoint_alloc 5", "source": { "project_name": "everquic-crypto", "file_name": "src/Mem.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 150, "start_col": 4, "end_line": 150, "end_col": 22 }, "file_context": "module Mem\n\n/// * Sets a uniform Low* HyperStack-based memory model, gathering\n/// abbreviations and top-level regions.\n///\n/// * Depends on Flags, as we do not to extract the global TLS region\n/// and its contents (only ideal stuff).\n///\n/// Coding guidelines (aligned to EverCrypt)\n/// - avoid eternal refs and buffers (fstar may deprecate them in lowstar)\n/// - use LowStar.Buffer\n/// - use monotonic buffers\n///\n/// - migrate from Bytes --> Spec-level sequences or Buffer [will take a while]\n/// - enable divergence checking (try it out on a Everest feature branch?)\n/// - use abbreviations wisely, e.g. only those to be defined in this file\n/// (no clear consensus yet)\n/// - use FStar.Integers (but avoid opening it because of v n etc... IntegersOps?)\n///\n/// - [create parent_region ...] may allocate a private sub-region,\n/// unless its state is e.g. just a single transparent reference;\n/// the caller usually tracks it using locations rather than regions.\n\nopen FStar.Error\n\ninclude FStar.HyperStack\ninclude FStar.HyperStack.ST\n\nopen LowStar.Buffer\nopen LowStar.BufferOps\n\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--z3rlimit 40 --max_fuel 0 --max_ifuel 0\"\n\ninline_for_extraction noextract\nlet model = Model.Flags.model\n\n// START quic-specific version of what was originally found in miTLS Mem.fst\nlet rgn = r:erid{r =!= root}\n\ntype fresh_subregion child parent h0 h1 =\n fresh_region child h0 h1 /\\ extends child parent\n\ntype subrgn p = r:rgn{parent r == p}\n\nlet quic_region: rgn = new_region root\ntype subq = subrgn quic_region\n// END quic-specific stuff\n\n/// Top-level disjointness\n/// ----------------------\n///\n/// We define an infrastructure for allocating a set of regions that are know\n/// automatically to be disjoint from each other.\n\n#push-options \"--max_ifuel 1\"\n\n(** r `rlist_disjoint` l holds if r is disjoint from all regions in l *)\nval rlist_disjoint: subq -> list subq -> Type0\nlet rec rlist_disjoint r = function\n | [] -> True\n | r' :: l -> r `HS.disjoint` r' /\\ rlist_disjoint r l\n\n(** r_pairwise_disjoint l holds if all regions in l are pairwise disjoint *)\nval r_pairwise_disjoint: list subq -> Type0\nlet rec r_pairwise_disjoint = function\n | [] -> True\n | r :: l -> rlist_disjoint r l /\\ r_pairwise_disjoint l\n\n(** r_fresh l h0 h1 holds when all regions in l are fresh between h0 and h1 *)\nval r_fresh: list subq -> mem -> mem -> Type0\nlet rec r_fresh l h0 h1 =\n match l with\n | [] -> True\n | r :: l -> fresh_region r h0 h1 /\\ r_fresh l h0 h1\n\nval fresh_back (r:rgn) (h0 h1 h2:mem) : Lemma\n (requires fresh_region r h1 h2 /\\ modifies_none h0 h1)\n (ensures fresh_region r h0 h2)\n// [SMTPat (fresh_region r h1 h2); SMTPat (modifies_none h0 h1)]\nlet fresh_back r h0 h1 h2 = ()\n\n#pop-options\n\n#push-options \"--max_fuel 1 --max_ifuel 1\"\n\nval r_fresh_back (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h1 h2 /\\ modifies_none h0 h1)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_back l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_back l' h0 h1 h2\n\nval r_fresh_fwd (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ modifies_none h1 h2)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_fwd l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_fwd l' h0 h1 h2\n\nval r_fresh_disjoint (r:subq) (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ fresh_region r h1 h2)\n (ensures rlist_disjoint r l)\nlet rec r_fresh_disjoint r l h0 h1 h2 =\n match l with\n | [] -> ()\n | r' :: l' ->\n lemma_extends_disjoint quic_region r r';\n r_fresh_disjoint r l' h0 h1 h2\n\nval r_fresh_forall: l:list subq -> h0:mem -> h1:mem -> Lemma\n ((forall r.{:pattern fresh_region r h0 h1} List.Tot.mem r l ==> fresh_region r h0 h1) <==>\n r_fresh l h0 h1)\nlet rec r_fresh_forall l h0 h1 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_forall l' h0 h1\n\n(** Allocates n pairwise disjoint subregions of tls_region *)\nval r_disjoint_alloc: n:nat -> ST (l:list subq)\n (requires fun h0 -> True)\n (ensures fun h0 l h1 ->\n modifies_none h0 h1 /\\\n r_fresh l h0 h1 /\\\n List.Tot.length l == n /\\\n r_pairwise_disjoint l)\n\nlet rec r_disjoint_alloc n =\n if n = 0 then []\n else\n begin\n let h0 = ST.get () in\n let l = r_disjoint_alloc (n-1) in\n let h1 = ST.get () in\n let r = new_region quic_region in\n let h2 = ST.get () in\n r_fresh_disjoint r l h0 h1 h2;\n r_fresh_fwd l h0 h1 h2;\n r :: l\n end\n\n#pop-options\n\n// We use region disjointness as a coarse grained way of framing invariants.", "dependencies": { "source_file": "Mem.fst", "checked_file": "Mem.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Model.Flags.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 40, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "l: Prims.list Mem.subq {FStar.List.Tot.Base.length l == 5 /\\ Mem.r_pairwise_disjoint l}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Mem.r_disjoint_alloc", "Prims.list", "Mem.subq" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val top_regions:(l: list subq {List.Tot.length l == 5 /\\ r_pairwise_disjoint l})\nlet top_regions:(l: list subq {List.Tot.length l == 5 /\\ r_pairwise_disjoint l}) =", "completed_definiton": "r_disjoint_alloc 5", "isa_cross_project_example": true }, { "file_name": "Mem.fst", "name": "Mem.rgn", "original_source_type": "", "source_type": "val rgn : Type0", "source_definition": "let rgn = r:erid{r =!= root}", "source": { "project_name": "everquic-crypto", "file_name": "src/Mem.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 41, "start_col": 10, "end_line": 41, "end_col": 28 }, "file_context": "module Mem\n\n/// * Sets a uniform Low* HyperStack-based memory model, gathering\n/// abbreviations and top-level regions.\n///\n/// * Depends on Flags, as we do not to extract the global TLS region\n/// and its contents (only ideal stuff).\n///\n/// Coding guidelines (aligned to EverCrypt)\n/// - avoid eternal refs and buffers (fstar may deprecate them in lowstar)\n/// - use LowStar.Buffer\n/// - use monotonic buffers\n///\n/// - migrate from Bytes --> Spec-level sequences or Buffer [will take a while]\n/// - enable divergence checking (try it out on a Everest feature branch?)\n/// - use abbreviations wisely, e.g. only those to be defined in this file\n/// (no clear consensus yet)\n/// - use FStar.Integers (but avoid opening it because of v n etc... IntegersOps?)\n///\n/// - [create parent_region ...] may allocate a private sub-region,\n/// unless its state is e.g. just a single transparent reference;\n/// the caller usually tracks it using locations rather than regions.\n\nopen FStar.Error\n\ninclude FStar.HyperStack\ninclude FStar.HyperStack.ST\n\nopen LowStar.Buffer\nopen LowStar.BufferOps\n\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--z3rlimit 40 --max_fuel 0 --max_ifuel 0\"\n\ninline_for_extraction noextract\nlet model = Model.Flags.model", "dependencies": { "source_file": "Mem.fst", "checked_file": "Mem.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Model.Flags.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 40, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.HyperStack.ST.erid", "Prims.l_not", "Prims.eq2", "FStar.Monotonic.HyperHeap.rid", "Prims.l_or", "FStar.HyperStack.ST.is_eternal_region", "Prims.l_and", "Prims.int", "FStar.Monotonic.HyperHeap.color", "Prims.b2t", "Prims.op_Negation", "FStar.Monotonic.HyperHeap.rid_freeable", "FStar.Monotonic.HyperHeap.root" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let rgn =", "completed_definiton": "r: erid{r =!= root}", "isa_cross_project_example": true }, { "file_name": "Mem.fst", "name": "Mem.q_ae_region", "original_source_type": "", "source_type": "val q_ae_region : Mem.subq", "source_definition": "let q_ae_region = List.Tot.index top_regions 0", "source": { "project_name": "everquic-crypto", "file_name": "src/Mem.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 152, "start_col": 18, "end_line": 152, "end_col": 46 }, "file_context": "module Mem\n\n/// * Sets a uniform Low* HyperStack-based memory model, gathering\n/// abbreviations and top-level regions.\n///\n/// * Depends on Flags, as we do not to extract the global TLS region\n/// and its contents (only ideal stuff).\n///\n/// Coding guidelines (aligned to EverCrypt)\n/// - avoid eternal refs and buffers (fstar may deprecate them in lowstar)\n/// - use LowStar.Buffer\n/// - use monotonic buffers\n///\n/// - migrate from Bytes --> Spec-level sequences or Buffer [will take a while]\n/// - enable divergence checking (try it out on a Everest feature branch?)\n/// - use abbreviations wisely, e.g. only those to be defined in this file\n/// (no clear consensus yet)\n/// - use FStar.Integers (but avoid opening it because of v n etc... IntegersOps?)\n///\n/// - [create parent_region ...] may allocate a private sub-region,\n/// unless its state is e.g. just a single transparent reference;\n/// the caller usually tracks it using locations rather than regions.\n\nopen FStar.Error\n\ninclude FStar.HyperStack\ninclude FStar.HyperStack.ST\n\nopen LowStar.Buffer\nopen LowStar.BufferOps\n\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--z3rlimit 40 --max_fuel 0 --max_ifuel 0\"\n\ninline_for_extraction noextract\nlet model = Model.Flags.model\n\n// START quic-specific version of what was originally found in miTLS Mem.fst\nlet rgn = r:erid{r =!= root}\n\ntype fresh_subregion child parent h0 h1 =\n fresh_region child h0 h1 /\\ extends child parent\n\ntype subrgn p = r:rgn{parent r == p}\n\nlet quic_region: rgn = new_region root\ntype subq = subrgn quic_region\n// END quic-specific stuff\n\n/// Top-level disjointness\n/// ----------------------\n///\n/// We define an infrastructure for allocating a set of regions that are know\n/// automatically to be disjoint from each other.\n\n#push-options \"--max_ifuel 1\"\n\n(** r `rlist_disjoint` l holds if r is disjoint from all regions in l *)\nval rlist_disjoint: subq -> list subq -> Type0\nlet rec rlist_disjoint r = function\n | [] -> True\n | r' :: l -> r `HS.disjoint` r' /\\ rlist_disjoint r l\n\n(** r_pairwise_disjoint l holds if all regions in l are pairwise disjoint *)\nval r_pairwise_disjoint: list subq -> Type0\nlet rec r_pairwise_disjoint = function\n | [] -> True\n | r :: l -> rlist_disjoint r l /\\ r_pairwise_disjoint l\n\n(** r_fresh l h0 h1 holds when all regions in l are fresh between h0 and h1 *)\nval r_fresh: list subq -> mem -> mem -> Type0\nlet rec r_fresh l h0 h1 =\n match l with\n | [] -> True\n | r :: l -> fresh_region r h0 h1 /\\ r_fresh l h0 h1\n\nval fresh_back (r:rgn) (h0 h1 h2:mem) : Lemma\n (requires fresh_region r h1 h2 /\\ modifies_none h0 h1)\n (ensures fresh_region r h0 h2)\n// [SMTPat (fresh_region r h1 h2); SMTPat (modifies_none h0 h1)]\nlet fresh_back r h0 h1 h2 = ()\n\n#pop-options\n\n#push-options \"--max_fuel 1 --max_ifuel 1\"\n\nval r_fresh_back (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h1 h2 /\\ modifies_none h0 h1)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_back l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_back l' h0 h1 h2\n\nval r_fresh_fwd (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ modifies_none h1 h2)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_fwd l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_fwd l' h0 h1 h2\n\nval r_fresh_disjoint (r:subq) (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ fresh_region r h1 h2)\n (ensures rlist_disjoint r l)\nlet rec r_fresh_disjoint r l h0 h1 h2 =\n match l with\n | [] -> ()\n | r' :: l' ->\n lemma_extends_disjoint quic_region r r';\n r_fresh_disjoint r l' h0 h1 h2\n\nval r_fresh_forall: l:list subq -> h0:mem -> h1:mem -> Lemma\n ((forall r.{:pattern fresh_region r h0 h1} List.Tot.mem r l ==> fresh_region r h0 h1) <==>\n r_fresh l h0 h1)\nlet rec r_fresh_forall l h0 h1 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_forall l' h0 h1\n\n(** Allocates n pairwise disjoint subregions of tls_region *)\nval r_disjoint_alloc: n:nat -> ST (l:list subq)\n (requires fun h0 -> True)\n (ensures fun h0 l h1 ->\n modifies_none h0 h1 /\\\n r_fresh l h0 h1 /\\\n List.Tot.length l == n /\\\n r_pairwise_disjoint l)\n\nlet rec r_disjoint_alloc n =\n if n = 0 then []\n else\n begin\n let h0 = ST.get () in\n let l = r_disjoint_alloc (n-1) in\n let h1 = ST.get () in\n let r = new_region quic_region in\n let h2 = ST.get () in\n r_fresh_disjoint r l h0 h1 h2;\n r_fresh_fwd l h0 h1 h2;\n r :: l\n end\n\n#pop-options\n\n// We use region disjointness as a coarse grained way of framing invariants.\nlet top_regions: (l:list subq{List.Tot.length l == 5 /\\ r_pairwise_disjoint l})\n = r_disjoint_alloc 5", "dependencies": { "source_file": "Mem.fst", "checked_file": "Mem.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Model.Flags.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 40, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Mem.subq", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.List.Tot.Base.index", "Mem.subq", "Mem.top_regions" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let q_ae_region =", "completed_definiton": "List.Tot.index top_regions 0", "isa_cross_project_example": true }, { "file_name": "Mem.fst", "name": "Mem.r_fresh", "original_source_type": "val r_fresh: list subq -> mem -> mem -> Type0", "source_type": "val r_fresh: list subq -> mem -> mem -> Type0", "source_definition": "let rec r_fresh l h0 h1 =\n match l with\n | [] -> True\n | r :: l -> fresh_region r h0 h1 /\\ r_fresh l h0 h1", "source": { "project_name": "everquic-crypto", "file_name": "src/Mem.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 75, "start_col": 2, "end_line": 77, "end_col": 53 }, "file_context": "module Mem\n\n/// * Sets a uniform Low* HyperStack-based memory model, gathering\n/// abbreviations and top-level regions.\n///\n/// * Depends on Flags, as we do not to extract the global TLS region\n/// and its contents (only ideal stuff).\n///\n/// Coding guidelines (aligned to EverCrypt)\n/// - avoid eternal refs and buffers (fstar may deprecate them in lowstar)\n/// - use LowStar.Buffer\n/// - use monotonic buffers\n///\n/// - migrate from Bytes --> Spec-level sequences or Buffer [will take a while]\n/// - enable divergence checking (try it out on a Everest feature branch?)\n/// - use abbreviations wisely, e.g. only those to be defined in this file\n/// (no clear consensus yet)\n/// - use FStar.Integers (but avoid opening it because of v n etc... IntegersOps?)\n///\n/// - [create parent_region ...] may allocate a private sub-region,\n/// unless its state is e.g. just a single transparent reference;\n/// the caller usually tracks it using locations rather than regions.\n\nopen FStar.Error\n\ninclude FStar.HyperStack\ninclude FStar.HyperStack.ST\n\nopen LowStar.Buffer\nopen LowStar.BufferOps\n\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--z3rlimit 40 --max_fuel 0 --max_ifuel 0\"\n\ninline_for_extraction noextract\nlet model = Model.Flags.model\n\n// START quic-specific version of what was originally found in miTLS Mem.fst\nlet rgn = r:erid{r =!= root}\n\ntype fresh_subregion child parent h0 h1 =\n fresh_region child h0 h1 /\\ extends child parent\n\ntype subrgn p = r:rgn{parent r == p}\n\nlet quic_region: rgn = new_region root\ntype subq = subrgn quic_region\n// END quic-specific stuff\n\n/// Top-level disjointness\n/// ----------------------\n///\n/// We define an infrastructure for allocating a set of regions that are know\n/// automatically to be disjoint from each other.\n\n#push-options \"--max_ifuel 1\"\n\n(** r `rlist_disjoint` l holds if r is disjoint from all regions in l *)\nval rlist_disjoint: subq -> list subq -> Type0\nlet rec rlist_disjoint r = function\n | [] -> True\n | r' :: l -> r `HS.disjoint` r' /\\ rlist_disjoint r l\n\n(** r_pairwise_disjoint l holds if all regions in l are pairwise disjoint *)\nval r_pairwise_disjoint: list subq -> Type0\nlet rec r_pairwise_disjoint = function\n | [] -> True\n | r :: l -> rlist_disjoint r l /\\ r_pairwise_disjoint l\n\n(** r_fresh l h0 h1 holds when all regions in l are fresh between h0 and h1 *)\nval r_fresh: list subq -> mem -> mem -> Type0", "dependencies": { "source_file": "Mem.fst", "checked_file": "Mem.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Model.Flags.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 1, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 40, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "l: Prims.list Mem.subq -> h0: FStar.Monotonic.HyperStack.mem -> h1: FStar.Monotonic.HyperStack.mem\n -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.list", "Mem.subq", "FStar.Monotonic.HyperStack.mem", "Prims.l_True", "Prims.l_and", "FStar.Monotonic.HyperStack.fresh_region", "Mem.r_fresh" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val r_fresh: list subq -> mem -> mem -> Type0\nlet rec r_fresh l h0 h1 =", "completed_definiton": "match l with\n| [] -> True\n| r :: l -> fresh_region r h0 h1 /\\ r_fresh l h0 h1", "isa_cross_project_example": true }, { "file_name": "Mem.fst", "name": "Mem.q_pne_region", "original_source_type": "", "source_type": "val q_pne_region : Mem.subq", "source_definition": "let q_pne_region = List.Tot.index top_regions 1", "source": { "project_name": "everquic-crypto", "file_name": "src/Mem.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 153, "start_col": 19, "end_line": 153, "end_col": 47 }, "file_context": "module Mem\n\n/// * Sets a uniform Low* HyperStack-based memory model, gathering\n/// abbreviations and top-level regions.\n///\n/// * Depends on Flags, as we do not to extract the global TLS region\n/// and its contents (only ideal stuff).\n///\n/// Coding guidelines (aligned to EverCrypt)\n/// - avoid eternal refs and buffers (fstar may deprecate them in lowstar)\n/// - use LowStar.Buffer\n/// - use monotonic buffers\n///\n/// - migrate from Bytes --> Spec-level sequences or Buffer [will take a while]\n/// - enable divergence checking (try it out on a Everest feature branch?)\n/// - use abbreviations wisely, e.g. only those to be defined in this file\n/// (no clear consensus yet)\n/// - use FStar.Integers (but avoid opening it because of v n etc... IntegersOps?)\n///\n/// - [create parent_region ...] may allocate a private sub-region,\n/// unless its state is e.g. just a single transparent reference;\n/// the caller usually tracks it using locations rather than regions.\n\nopen FStar.Error\n\ninclude FStar.HyperStack\ninclude FStar.HyperStack.ST\n\nopen LowStar.Buffer\nopen LowStar.BufferOps\n\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--z3rlimit 40 --max_fuel 0 --max_ifuel 0\"\n\ninline_for_extraction noextract\nlet model = Model.Flags.model\n\n// START quic-specific version of what was originally found in miTLS Mem.fst\nlet rgn = r:erid{r =!= root}\n\ntype fresh_subregion child parent h0 h1 =\n fresh_region child h0 h1 /\\ extends child parent\n\ntype subrgn p = r:rgn{parent r == p}\n\nlet quic_region: rgn = new_region root\ntype subq = subrgn quic_region\n// END quic-specific stuff\n\n/// Top-level disjointness\n/// ----------------------\n///\n/// We define an infrastructure for allocating a set of regions that are know\n/// automatically to be disjoint from each other.\n\n#push-options \"--max_ifuel 1\"\n\n(** r `rlist_disjoint` l holds if r is disjoint from all regions in l *)\nval rlist_disjoint: subq -> list subq -> Type0\nlet rec rlist_disjoint r = function\n | [] -> True\n | r' :: l -> r `HS.disjoint` r' /\\ rlist_disjoint r l\n\n(** r_pairwise_disjoint l holds if all regions in l are pairwise disjoint *)\nval r_pairwise_disjoint: list subq -> Type0\nlet rec r_pairwise_disjoint = function\n | [] -> True\n | r :: l -> rlist_disjoint r l /\\ r_pairwise_disjoint l\n\n(** r_fresh l h0 h1 holds when all regions in l are fresh between h0 and h1 *)\nval r_fresh: list subq -> mem -> mem -> Type0\nlet rec r_fresh l h0 h1 =\n match l with\n | [] -> True\n | r :: l -> fresh_region r h0 h1 /\\ r_fresh l h0 h1\n\nval fresh_back (r:rgn) (h0 h1 h2:mem) : Lemma\n (requires fresh_region r h1 h2 /\\ modifies_none h0 h1)\n (ensures fresh_region r h0 h2)\n// [SMTPat (fresh_region r h1 h2); SMTPat (modifies_none h0 h1)]\nlet fresh_back r h0 h1 h2 = ()\n\n#pop-options\n\n#push-options \"--max_fuel 1 --max_ifuel 1\"\n\nval r_fresh_back (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h1 h2 /\\ modifies_none h0 h1)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_back l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_back l' h0 h1 h2\n\nval r_fresh_fwd (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ modifies_none h1 h2)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_fwd l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_fwd l' h0 h1 h2\n\nval r_fresh_disjoint (r:subq) (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ fresh_region r h1 h2)\n (ensures rlist_disjoint r l)\nlet rec r_fresh_disjoint r l h0 h1 h2 =\n match l with\n | [] -> ()\n | r' :: l' ->\n lemma_extends_disjoint quic_region r r';\n r_fresh_disjoint r l' h0 h1 h2\n\nval r_fresh_forall: l:list subq -> h0:mem -> h1:mem -> Lemma\n ((forall r.{:pattern fresh_region r h0 h1} List.Tot.mem r l ==> fresh_region r h0 h1) <==>\n r_fresh l h0 h1)\nlet rec r_fresh_forall l h0 h1 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_forall l' h0 h1\n\n(** Allocates n pairwise disjoint subregions of tls_region *)\nval r_disjoint_alloc: n:nat -> ST (l:list subq)\n (requires fun h0 -> True)\n (ensures fun h0 l h1 ->\n modifies_none h0 h1 /\\\n r_fresh l h0 h1 /\\\n List.Tot.length l == n /\\\n r_pairwise_disjoint l)\n\nlet rec r_disjoint_alloc n =\n if n = 0 then []\n else\n begin\n let h0 = ST.get () in\n let l = r_disjoint_alloc (n-1) in\n let h1 = ST.get () in\n let r = new_region quic_region in\n let h2 = ST.get () in\n r_fresh_disjoint r l h0 h1 h2;\n r_fresh_fwd l h0 h1 h2;\n r :: l\n end\n\n#pop-options\n\n// We use region disjointness as a coarse grained way of framing invariants.\nlet top_regions: (l:list subq{List.Tot.length l == 5 /\\ r_pairwise_disjoint l})\n = r_disjoint_alloc 5", "dependencies": { "source_file": "Mem.fst", "checked_file": "Mem.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Model.Flags.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 40, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Mem.subq", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.List.Tot.Base.index", "Mem.subq", "Mem.top_regions" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let q_pne_region =", "completed_definiton": "List.Tot.index top_regions 1", "isa_cross_project_example": true }, { "file_name": "Mem.fst", "name": "Mem.quic_region", "original_source_type": "val quic_region:rgn", "source_type": "val quic_region:rgn", "source_definition": "let quic_region: rgn = new_region root", "source": { "project_name": "everquic-crypto", "file_name": "src/Mem.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 48, "start_col": 23, "end_line": 48, "end_col": 38 }, "file_context": "module Mem\n\n/// * Sets a uniform Low* HyperStack-based memory model, gathering\n/// abbreviations and top-level regions.\n///\n/// * Depends on Flags, as we do not to extract the global TLS region\n/// and its contents (only ideal stuff).\n///\n/// Coding guidelines (aligned to EverCrypt)\n/// - avoid eternal refs and buffers (fstar may deprecate them in lowstar)\n/// - use LowStar.Buffer\n/// - use monotonic buffers\n///\n/// - migrate from Bytes --> Spec-level sequences or Buffer [will take a while]\n/// - enable divergence checking (try it out on a Everest feature branch?)\n/// - use abbreviations wisely, e.g. only those to be defined in this file\n/// (no clear consensus yet)\n/// - use FStar.Integers (but avoid opening it because of v n etc... IntegersOps?)\n///\n/// - [create parent_region ...] may allocate a private sub-region,\n/// unless its state is e.g. just a single transparent reference;\n/// the caller usually tracks it using locations rather than regions.\n\nopen FStar.Error\n\ninclude FStar.HyperStack\ninclude FStar.HyperStack.ST\n\nopen LowStar.Buffer\nopen LowStar.BufferOps\n\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--z3rlimit 40 --max_fuel 0 --max_ifuel 0\"\n\ninline_for_extraction noextract\nlet model = Model.Flags.model\n\n// START quic-specific version of what was originally found in miTLS Mem.fst\nlet rgn = r:erid{r =!= root}\n\ntype fresh_subregion child parent h0 h1 =\n fresh_region child h0 h1 /\\ extends child parent\n\ntype subrgn p = r:rgn{parent r == p}", "dependencies": { "source_file": "Mem.fst", "checked_file": "Mem.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Model.Flags.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 40, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Mem.rgn", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.HyperStack.ST.new_region", "FStar.Monotonic.HyperHeap.root", "FStar.Monotonic.HyperHeap.rid" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val quic_region:rgn\nlet quic_region:rgn =", "completed_definiton": "new_region root", "isa_cross_project_example": true }, { "file_name": "Mem.fst", "name": "Mem.r_pairwise_disjoint", "original_source_type": "val r_pairwise_disjoint: list subq -> Type0", "source_type": "val r_pairwise_disjoint: list subq -> Type0", "source_definition": "let rec r_pairwise_disjoint = function\n | [] -> True\n | r :: l -> rlist_disjoint r l /\\ r_pairwise_disjoint l", "source": { "project_name": "everquic-crypto", "file_name": "src/Mem.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 68, "start_col": 30, "end_line": 70, "end_col": 57 }, "file_context": "module Mem\n\n/// * Sets a uniform Low* HyperStack-based memory model, gathering\n/// abbreviations and top-level regions.\n///\n/// * Depends on Flags, as we do not to extract the global TLS region\n/// and its contents (only ideal stuff).\n///\n/// Coding guidelines (aligned to EverCrypt)\n/// - avoid eternal refs and buffers (fstar may deprecate them in lowstar)\n/// - use LowStar.Buffer\n/// - use monotonic buffers\n///\n/// - migrate from Bytes --> Spec-level sequences or Buffer [will take a while]\n/// - enable divergence checking (try it out on a Everest feature branch?)\n/// - use abbreviations wisely, e.g. only those to be defined in this file\n/// (no clear consensus yet)\n/// - use FStar.Integers (but avoid opening it because of v n etc... IntegersOps?)\n///\n/// - [create parent_region ...] may allocate a private sub-region,\n/// unless its state is e.g. just a single transparent reference;\n/// the caller usually tracks it using locations rather than regions.\n\nopen FStar.Error\n\ninclude FStar.HyperStack\ninclude FStar.HyperStack.ST\n\nopen LowStar.Buffer\nopen LowStar.BufferOps\n\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--z3rlimit 40 --max_fuel 0 --max_ifuel 0\"\n\ninline_for_extraction noextract\nlet model = Model.Flags.model\n\n// START quic-specific version of what was originally found in miTLS Mem.fst\nlet rgn = r:erid{r =!= root}\n\ntype fresh_subregion child parent h0 h1 =\n fresh_region child h0 h1 /\\ extends child parent\n\ntype subrgn p = r:rgn{parent r == p}\n\nlet quic_region: rgn = new_region root\ntype subq = subrgn quic_region\n// END quic-specific stuff\n\n/// Top-level disjointness\n/// ----------------------\n///\n/// We define an infrastructure for allocating a set of regions that are know\n/// automatically to be disjoint from each other.\n\n#push-options \"--max_ifuel 1\"\n\n(** r `rlist_disjoint` l holds if r is disjoint from all regions in l *)\nval rlist_disjoint: subq -> list subq -> Type0\nlet rec rlist_disjoint r = function\n | [] -> True\n | r' :: l -> r `HS.disjoint` r' /\\ rlist_disjoint r l\n\n(** r_pairwise_disjoint l holds if all regions in l are pairwise disjoint *)", "dependencies": { "source_file": "Mem.fst", "checked_file": "Mem.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Model.Flags.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 1, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 40, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.list Mem.subq -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.list", "Mem.subq", "Prims.l_True", "Prims.l_and", "Mem.rlist_disjoint", "Mem.r_pairwise_disjoint" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val r_pairwise_disjoint: list subq -> Type0\nlet rec r_pairwise_disjoint =", "completed_definiton": "function\n| [] -> True\n| r :: l -> rlist_disjoint r l /\\ r_pairwise_disjoint l", "isa_cross_project_example": true }, { "file_name": "Mem.fst", "name": "Mem.rlist_disjoint", "original_source_type": "val rlist_disjoint: subq -> list subq -> Type0", "source_type": "val rlist_disjoint: subq -> list subq -> Type0", "source_definition": "let rec rlist_disjoint r = function\n | [] -> True\n | r' :: l -> r `HS.disjoint` r' /\\ rlist_disjoint r l", "source": { "project_name": "everquic-crypto", "file_name": "src/Mem.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 62, "start_col": 27, "end_line": 64, "end_col": 55 }, "file_context": "module Mem\n\n/// * Sets a uniform Low* HyperStack-based memory model, gathering\n/// abbreviations and top-level regions.\n///\n/// * Depends on Flags, as we do not to extract the global TLS region\n/// and its contents (only ideal stuff).\n///\n/// Coding guidelines (aligned to EverCrypt)\n/// - avoid eternal refs and buffers (fstar may deprecate them in lowstar)\n/// - use LowStar.Buffer\n/// - use monotonic buffers\n///\n/// - migrate from Bytes --> Spec-level sequences or Buffer [will take a while]\n/// - enable divergence checking (try it out on a Everest feature branch?)\n/// - use abbreviations wisely, e.g. only those to be defined in this file\n/// (no clear consensus yet)\n/// - use FStar.Integers (but avoid opening it because of v n etc... IntegersOps?)\n///\n/// - [create parent_region ...] may allocate a private sub-region,\n/// unless its state is e.g. just a single transparent reference;\n/// the caller usually tracks it using locations rather than regions.\n\nopen FStar.Error\n\ninclude FStar.HyperStack\ninclude FStar.HyperStack.ST\n\nopen LowStar.Buffer\nopen LowStar.BufferOps\n\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--z3rlimit 40 --max_fuel 0 --max_ifuel 0\"\n\ninline_for_extraction noextract\nlet model = Model.Flags.model\n\n// START quic-specific version of what was originally found in miTLS Mem.fst\nlet rgn = r:erid{r =!= root}\n\ntype fresh_subregion child parent h0 h1 =\n fresh_region child h0 h1 /\\ extends child parent\n\ntype subrgn p = r:rgn{parent r == p}\n\nlet quic_region: rgn = new_region root\ntype subq = subrgn quic_region\n// END quic-specific stuff\n\n/// Top-level disjointness\n/// ----------------------\n///\n/// We define an infrastructure for allocating a set of regions that are know\n/// automatically to be disjoint from each other.\n\n#push-options \"--max_ifuel 1\"\n\n(** r `rlist_disjoint` l holds if r is disjoint from all regions in l *)", "dependencies": { "source_file": "Mem.fst", "checked_file": "Mem.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Model.Flags.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 1, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 40, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "r: Mem.subq -> _: Prims.list Mem.subq -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Mem.subq", "Prims.list", "Prims.l_True", "Prims.l_and", "Prims.b2t", "FStar.Monotonic.HyperHeap.disjoint", "Mem.rlist_disjoint" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val rlist_disjoint: subq -> list subq -> Type0\nlet rec rlist_disjoint r =", "completed_definiton": "function\n| [] -> True\n| r' :: l -> r `HS.disjoint` r' /\\ rlist_disjoint r l", "isa_cross_project_example": true }, { "file_name": "Mem.fst", "name": "Mem.q_idx_region", "original_source_type": "", "source_type": "val q_idx_region : Mem.subq", "source_definition": "let q_idx_region = List.Tot.index top_regions 2", "source": { "project_name": "everquic-crypto", "file_name": "src/Mem.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 154, "start_col": 19, "end_line": 154, "end_col": 47 }, "file_context": "module Mem\n\n/// * Sets a uniform Low* HyperStack-based memory model, gathering\n/// abbreviations and top-level regions.\n///\n/// * Depends on Flags, as we do not to extract the global TLS region\n/// and its contents (only ideal stuff).\n///\n/// Coding guidelines (aligned to EverCrypt)\n/// - avoid eternal refs and buffers (fstar may deprecate them in lowstar)\n/// - use LowStar.Buffer\n/// - use monotonic buffers\n///\n/// - migrate from Bytes --> Spec-level sequences or Buffer [will take a while]\n/// - enable divergence checking (try it out on a Everest feature branch?)\n/// - use abbreviations wisely, e.g. only those to be defined in this file\n/// (no clear consensus yet)\n/// - use FStar.Integers (but avoid opening it because of v n etc... IntegersOps?)\n///\n/// - [create parent_region ...] may allocate a private sub-region,\n/// unless its state is e.g. just a single transparent reference;\n/// the caller usually tracks it using locations rather than regions.\n\nopen FStar.Error\n\ninclude FStar.HyperStack\ninclude FStar.HyperStack.ST\n\nopen LowStar.Buffer\nopen LowStar.BufferOps\n\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--z3rlimit 40 --max_fuel 0 --max_ifuel 0\"\n\ninline_for_extraction noextract\nlet model = Model.Flags.model\n\n// START quic-specific version of what was originally found in miTLS Mem.fst\nlet rgn = r:erid{r =!= root}\n\ntype fresh_subregion child parent h0 h1 =\n fresh_region child h0 h1 /\\ extends child parent\n\ntype subrgn p = r:rgn{parent r == p}\n\nlet quic_region: rgn = new_region root\ntype subq = subrgn quic_region\n// END quic-specific stuff\n\n/// Top-level disjointness\n/// ----------------------\n///\n/// We define an infrastructure for allocating a set of regions that are know\n/// automatically to be disjoint from each other.\n\n#push-options \"--max_ifuel 1\"\n\n(** r `rlist_disjoint` l holds if r is disjoint from all regions in l *)\nval rlist_disjoint: subq -> list subq -> Type0\nlet rec rlist_disjoint r = function\n | [] -> True\n | r' :: l -> r `HS.disjoint` r' /\\ rlist_disjoint r l\n\n(** r_pairwise_disjoint l holds if all regions in l are pairwise disjoint *)\nval r_pairwise_disjoint: list subq -> Type0\nlet rec r_pairwise_disjoint = function\n | [] -> True\n | r :: l -> rlist_disjoint r l /\\ r_pairwise_disjoint l\n\n(** r_fresh l h0 h1 holds when all regions in l are fresh between h0 and h1 *)\nval r_fresh: list subq -> mem -> mem -> Type0\nlet rec r_fresh l h0 h1 =\n match l with\n | [] -> True\n | r :: l -> fresh_region r h0 h1 /\\ r_fresh l h0 h1\n\nval fresh_back (r:rgn) (h0 h1 h2:mem) : Lemma\n (requires fresh_region r h1 h2 /\\ modifies_none h0 h1)\n (ensures fresh_region r h0 h2)\n// [SMTPat (fresh_region r h1 h2); SMTPat (modifies_none h0 h1)]\nlet fresh_back r h0 h1 h2 = ()\n\n#pop-options\n\n#push-options \"--max_fuel 1 --max_ifuel 1\"\n\nval r_fresh_back (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h1 h2 /\\ modifies_none h0 h1)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_back l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_back l' h0 h1 h2\n\nval r_fresh_fwd (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ modifies_none h1 h2)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_fwd l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_fwd l' h0 h1 h2\n\nval r_fresh_disjoint (r:subq) (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ fresh_region r h1 h2)\n (ensures rlist_disjoint r l)\nlet rec r_fresh_disjoint r l h0 h1 h2 =\n match l with\n | [] -> ()\n | r' :: l' ->\n lemma_extends_disjoint quic_region r r';\n r_fresh_disjoint r l' h0 h1 h2\n\nval r_fresh_forall: l:list subq -> h0:mem -> h1:mem -> Lemma\n ((forall r.{:pattern fresh_region r h0 h1} List.Tot.mem r l ==> fresh_region r h0 h1) <==>\n r_fresh l h0 h1)\nlet rec r_fresh_forall l h0 h1 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_forall l' h0 h1\n\n(** Allocates n pairwise disjoint subregions of tls_region *)\nval r_disjoint_alloc: n:nat -> ST (l:list subq)\n (requires fun h0 -> True)\n (ensures fun h0 l h1 ->\n modifies_none h0 h1 /\\\n r_fresh l h0 h1 /\\\n List.Tot.length l == n /\\\n r_pairwise_disjoint l)\n\nlet rec r_disjoint_alloc n =\n if n = 0 then []\n else\n begin\n let h0 = ST.get () in\n let l = r_disjoint_alloc (n-1) in\n let h1 = ST.get () in\n let r = new_region quic_region in\n let h2 = ST.get () in\n r_fresh_disjoint r l h0 h1 h2;\n r_fresh_fwd l h0 h1 h2;\n r :: l\n end\n\n#pop-options\n\n// We use region disjointness as a coarse grained way of framing invariants.\nlet top_regions: (l:list subq{List.Tot.length l == 5 /\\ r_pairwise_disjoint l})\n = r_disjoint_alloc 5\n\nlet q_ae_region = List.Tot.index top_regions 0", "dependencies": { "source_file": "Mem.fst", "checked_file": "Mem.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Model.Flags.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 40, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Mem.subq", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.List.Tot.Base.index", "Mem.subq", "Mem.top_regions" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let q_idx_region =", "completed_definiton": "List.Tot.index top_regions 2", "isa_cross_project_example": true }, { "file_name": "Mem.fst", "name": "Mem.r_fresh_back", "original_source_type": "val r_fresh_back (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h1 h2 /\\ modifies_none h0 h1)\n (ensures r_fresh l h0 h2)", "source_type": "val r_fresh_back (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h1 h2 /\\ modifies_none h0 h1)\n (ensures r_fresh l h0 h2)", "source_definition": "let rec r_fresh_back l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_back l' h0 h1 h2", "source": { "project_name": "everquic-crypto", "file_name": "src/Mem.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 93, "start_col": 2, "end_line": 95, "end_col": 39 }, "file_context": "module Mem\n\n/// * Sets a uniform Low* HyperStack-based memory model, gathering\n/// abbreviations and top-level regions.\n///\n/// * Depends on Flags, as we do not to extract the global TLS region\n/// and its contents (only ideal stuff).\n///\n/// Coding guidelines (aligned to EverCrypt)\n/// - avoid eternal refs and buffers (fstar may deprecate them in lowstar)\n/// - use LowStar.Buffer\n/// - use monotonic buffers\n///\n/// - migrate from Bytes --> Spec-level sequences or Buffer [will take a while]\n/// - enable divergence checking (try it out on a Everest feature branch?)\n/// - use abbreviations wisely, e.g. only those to be defined in this file\n/// (no clear consensus yet)\n/// - use FStar.Integers (but avoid opening it because of v n etc... IntegersOps?)\n///\n/// - [create parent_region ...] may allocate a private sub-region,\n/// unless its state is e.g. just a single transparent reference;\n/// the caller usually tracks it using locations rather than regions.\n\nopen FStar.Error\n\ninclude FStar.HyperStack\ninclude FStar.HyperStack.ST\n\nopen LowStar.Buffer\nopen LowStar.BufferOps\n\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--z3rlimit 40 --max_fuel 0 --max_ifuel 0\"\n\ninline_for_extraction noextract\nlet model = Model.Flags.model\n\n// START quic-specific version of what was originally found in miTLS Mem.fst\nlet rgn = r:erid{r =!= root}\n\ntype fresh_subregion child parent h0 h1 =\n fresh_region child h0 h1 /\\ extends child parent\n\ntype subrgn p = r:rgn{parent r == p}\n\nlet quic_region: rgn = new_region root\ntype subq = subrgn quic_region\n// END quic-specific stuff\n\n/// Top-level disjointness\n/// ----------------------\n///\n/// We define an infrastructure for allocating a set of regions that are know\n/// automatically to be disjoint from each other.\n\n#push-options \"--max_ifuel 1\"\n\n(** r `rlist_disjoint` l holds if r is disjoint from all regions in l *)\nval rlist_disjoint: subq -> list subq -> Type0\nlet rec rlist_disjoint r = function\n | [] -> True\n | r' :: l -> r `HS.disjoint` r' /\\ rlist_disjoint r l\n\n(** r_pairwise_disjoint l holds if all regions in l are pairwise disjoint *)\nval r_pairwise_disjoint: list subq -> Type0\nlet rec r_pairwise_disjoint = function\n | [] -> True\n | r :: l -> rlist_disjoint r l /\\ r_pairwise_disjoint l\n\n(** r_fresh l h0 h1 holds when all regions in l are fresh between h0 and h1 *)\nval r_fresh: list subq -> mem -> mem -> Type0\nlet rec r_fresh l h0 h1 =\n match l with\n | [] -> True\n | r :: l -> fresh_region r h0 h1 /\\ r_fresh l h0 h1\n\nval fresh_back (r:rgn) (h0 h1 h2:mem) : Lemma\n (requires fresh_region r h1 h2 /\\ modifies_none h0 h1)\n (ensures fresh_region r h0 h2)\n// [SMTPat (fresh_region r h1 h2); SMTPat (modifies_none h0 h1)]\nlet fresh_back r h0 h1 h2 = ()\n\n#pop-options\n\n#push-options \"--max_fuel 1 --max_ifuel 1\"\n\nval r_fresh_back (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h1 h2 /\\ modifies_none h0 h1)\n (ensures r_fresh l h0 h2)", "dependencies": { "source_file": "Mem.fst", "checked_file": "Mem.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Model.Flags.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 1, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 40, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n l: Prims.list Mem.subq ->\n h0: FStar.Monotonic.HyperStack.mem ->\n h1: FStar.Monotonic.HyperStack.mem ->\n h2: FStar.Monotonic.HyperStack.mem\n -> FStar.Pervasives.Lemma\n (requires Mem.r_fresh l h1 h2 /\\ FStar.HyperStack.ST.modifies_none h0 h1)\n (ensures Mem.r_fresh l h0 h2)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.list", "Mem.subq", "FStar.Monotonic.HyperStack.mem", "Mem.r_fresh_back", "Prims.unit" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val r_fresh_back (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h1 h2 /\\ modifies_none h0 h1)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_back l h0 h1 h2 =", "completed_definiton": "match l with\n| [] -> ()\n| r :: l' -> r_fresh_back l' h0 h1 h2", "isa_cross_project_example": true }, { "file_name": "Mem.fst", "name": "Mem.r_fresh_fwd", "original_source_type": "val r_fresh_fwd (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ modifies_none h1 h2)\n (ensures r_fresh l h0 h2)", "source_type": "val r_fresh_fwd (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ modifies_none h1 h2)\n (ensures r_fresh l h0 h2)", "source_definition": "let rec r_fresh_fwd l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_fwd l' h0 h1 h2", "source": { "project_name": "everquic-crypto", "file_name": "src/Mem.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 101, "start_col": 2, "end_line": 103, "end_col": 38 }, "file_context": "module Mem\n\n/// * Sets a uniform Low* HyperStack-based memory model, gathering\n/// abbreviations and top-level regions.\n///\n/// * Depends on Flags, as we do not to extract the global TLS region\n/// and its contents (only ideal stuff).\n///\n/// Coding guidelines (aligned to EverCrypt)\n/// - avoid eternal refs and buffers (fstar may deprecate them in lowstar)\n/// - use LowStar.Buffer\n/// - use monotonic buffers\n///\n/// - migrate from Bytes --> Spec-level sequences or Buffer [will take a while]\n/// - enable divergence checking (try it out on a Everest feature branch?)\n/// - use abbreviations wisely, e.g. only those to be defined in this file\n/// (no clear consensus yet)\n/// - use FStar.Integers (but avoid opening it because of v n etc... IntegersOps?)\n///\n/// - [create parent_region ...] may allocate a private sub-region,\n/// unless its state is e.g. just a single transparent reference;\n/// the caller usually tracks it using locations rather than regions.\n\nopen FStar.Error\n\ninclude FStar.HyperStack\ninclude FStar.HyperStack.ST\n\nopen LowStar.Buffer\nopen LowStar.BufferOps\n\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--z3rlimit 40 --max_fuel 0 --max_ifuel 0\"\n\ninline_for_extraction noextract\nlet model = Model.Flags.model\n\n// START quic-specific version of what was originally found in miTLS Mem.fst\nlet rgn = r:erid{r =!= root}\n\ntype fresh_subregion child parent h0 h1 =\n fresh_region child h0 h1 /\\ extends child parent\n\ntype subrgn p = r:rgn{parent r == p}\n\nlet quic_region: rgn = new_region root\ntype subq = subrgn quic_region\n// END quic-specific stuff\n\n/// Top-level disjointness\n/// ----------------------\n///\n/// We define an infrastructure for allocating a set of regions that are know\n/// automatically to be disjoint from each other.\n\n#push-options \"--max_ifuel 1\"\n\n(** r `rlist_disjoint` l holds if r is disjoint from all regions in l *)\nval rlist_disjoint: subq -> list subq -> Type0\nlet rec rlist_disjoint r = function\n | [] -> True\n | r' :: l -> r `HS.disjoint` r' /\\ rlist_disjoint r l\n\n(** r_pairwise_disjoint l holds if all regions in l are pairwise disjoint *)\nval r_pairwise_disjoint: list subq -> Type0\nlet rec r_pairwise_disjoint = function\n | [] -> True\n | r :: l -> rlist_disjoint r l /\\ r_pairwise_disjoint l\n\n(** r_fresh l h0 h1 holds when all regions in l are fresh between h0 and h1 *)\nval r_fresh: list subq -> mem -> mem -> Type0\nlet rec r_fresh l h0 h1 =\n match l with\n | [] -> True\n | r :: l -> fresh_region r h0 h1 /\\ r_fresh l h0 h1\n\nval fresh_back (r:rgn) (h0 h1 h2:mem) : Lemma\n (requires fresh_region r h1 h2 /\\ modifies_none h0 h1)\n (ensures fresh_region r h0 h2)\n// [SMTPat (fresh_region r h1 h2); SMTPat (modifies_none h0 h1)]\nlet fresh_back r h0 h1 h2 = ()\n\n#pop-options\n\n#push-options \"--max_fuel 1 --max_ifuel 1\"\n\nval r_fresh_back (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h1 h2 /\\ modifies_none h0 h1)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_back l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_back l' h0 h1 h2\n\nval r_fresh_fwd (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ modifies_none h1 h2)\n (ensures r_fresh l h0 h2)", "dependencies": { "source_file": "Mem.fst", "checked_file": "Mem.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Model.Flags.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 1, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 40, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n l: Prims.list Mem.subq ->\n h0: FStar.Monotonic.HyperStack.mem ->\n h1: FStar.Monotonic.HyperStack.mem ->\n h2: FStar.Monotonic.HyperStack.mem\n -> FStar.Pervasives.Lemma\n (requires Mem.r_fresh l h0 h1 /\\ FStar.HyperStack.ST.modifies_none h1 h2)\n (ensures Mem.r_fresh l h0 h2)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.list", "Mem.subq", "FStar.Monotonic.HyperStack.mem", "Mem.r_fresh_fwd", "Prims.unit" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val r_fresh_fwd (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ modifies_none h1 h2)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_fwd l h0 h1 h2 =", "completed_definiton": "match l with\n| [] -> ()\n| r :: l' -> r_fresh_fwd l' h0 h1 h2", "isa_cross_project_example": true }, { "file_name": "Mem.fst", "name": "Mem.r_fresh_disjoint", "original_source_type": "val r_fresh_disjoint (r:subq) (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ fresh_region r h1 h2)\n (ensures rlist_disjoint r l)", "source_type": "val r_fresh_disjoint (r:subq) (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ fresh_region r h1 h2)\n (ensures rlist_disjoint r l)", "source_definition": "let rec r_fresh_disjoint r l h0 h1 h2 =\n match l with\n | [] -> ()\n | r' :: l' ->\n lemma_extends_disjoint quic_region r r';\n r_fresh_disjoint r l' h0 h1 h2", "source": { "project_name": "everquic-crypto", "file_name": "src/Mem.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 109, "start_col": 2, "end_line": 113, "end_col": 34 }, "file_context": "module Mem\n\n/// * Sets a uniform Low* HyperStack-based memory model, gathering\n/// abbreviations and top-level regions.\n///\n/// * Depends on Flags, as we do not to extract the global TLS region\n/// and its contents (only ideal stuff).\n///\n/// Coding guidelines (aligned to EverCrypt)\n/// - avoid eternal refs and buffers (fstar may deprecate them in lowstar)\n/// - use LowStar.Buffer\n/// - use monotonic buffers\n///\n/// - migrate from Bytes --> Spec-level sequences or Buffer [will take a while]\n/// - enable divergence checking (try it out on a Everest feature branch?)\n/// - use abbreviations wisely, e.g. only those to be defined in this file\n/// (no clear consensus yet)\n/// - use FStar.Integers (but avoid opening it because of v n etc... IntegersOps?)\n///\n/// - [create parent_region ...] may allocate a private sub-region,\n/// unless its state is e.g. just a single transparent reference;\n/// the caller usually tracks it using locations rather than regions.\n\nopen FStar.Error\n\ninclude FStar.HyperStack\ninclude FStar.HyperStack.ST\n\nopen LowStar.Buffer\nopen LowStar.BufferOps\n\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--z3rlimit 40 --max_fuel 0 --max_ifuel 0\"\n\ninline_for_extraction noextract\nlet model = Model.Flags.model\n\n// START quic-specific version of what was originally found in miTLS Mem.fst\nlet rgn = r:erid{r =!= root}\n\ntype fresh_subregion child parent h0 h1 =\n fresh_region child h0 h1 /\\ extends child parent\n\ntype subrgn p = r:rgn{parent r == p}\n\nlet quic_region: rgn = new_region root\ntype subq = subrgn quic_region\n// END quic-specific stuff\n\n/// Top-level disjointness\n/// ----------------------\n///\n/// We define an infrastructure for allocating a set of regions that are know\n/// automatically to be disjoint from each other.\n\n#push-options \"--max_ifuel 1\"\n\n(** r `rlist_disjoint` l holds if r is disjoint from all regions in l *)\nval rlist_disjoint: subq -> list subq -> Type0\nlet rec rlist_disjoint r = function\n | [] -> True\n | r' :: l -> r `HS.disjoint` r' /\\ rlist_disjoint r l\n\n(** r_pairwise_disjoint l holds if all regions in l are pairwise disjoint *)\nval r_pairwise_disjoint: list subq -> Type0\nlet rec r_pairwise_disjoint = function\n | [] -> True\n | r :: l -> rlist_disjoint r l /\\ r_pairwise_disjoint l\n\n(** r_fresh l h0 h1 holds when all regions in l are fresh between h0 and h1 *)\nval r_fresh: list subq -> mem -> mem -> Type0\nlet rec r_fresh l h0 h1 =\n match l with\n | [] -> True\n | r :: l -> fresh_region r h0 h1 /\\ r_fresh l h0 h1\n\nval fresh_back (r:rgn) (h0 h1 h2:mem) : Lemma\n (requires fresh_region r h1 h2 /\\ modifies_none h0 h1)\n (ensures fresh_region r h0 h2)\n// [SMTPat (fresh_region r h1 h2); SMTPat (modifies_none h0 h1)]\nlet fresh_back r h0 h1 h2 = ()\n\n#pop-options\n\n#push-options \"--max_fuel 1 --max_ifuel 1\"\n\nval r_fresh_back (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h1 h2 /\\ modifies_none h0 h1)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_back l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_back l' h0 h1 h2\n\nval r_fresh_fwd (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ modifies_none h1 h2)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_fwd l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_fwd l' h0 h1 h2\n\nval r_fresh_disjoint (r:subq) (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ fresh_region r h1 h2)\n (ensures rlist_disjoint r l)", "dependencies": { "source_file": "Mem.fst", "checked_file": "Mem.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Model.Flags.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 1, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 40, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n r: Mem.subq ->\n l: Prims.list Mem.subq ->\n h0: FStar.Monotonic.HyperStack.mem ->\n h1: FStar.Monotonic.HyperStack.mem ->\n h2: FStar.Monotonic.HyperStack.mem\n -> FStar.Pervasives.Lemma\n (requires Mem.r_fresh l h0 h1 /\\ FStar.Monotonic.HyperStack.fresh_region r h1 h2)\n (ensures Mem.rlist_disjoint r l)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Mem.subq", "Prims.list", "FStar.Monotonic.HyperStack.mem", "Mem.r_fresh_disjoint", "Prims.unit", "FStar.Monotonic.HyperHeap.lemma_extends_disjoint", "Mem.quic_region" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val r_fresh_disjoint (r:subq) (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ fresh_region r h1 h2)\n (ensures rlist_disjoint r l)\nlet rec r_fresh_disjoint r l h0 h1 h2 =", "completed_definiton": "match l with\n| [] -> ()\n| r' :: l' ->\n lemma_extends_disjoint quic_region r r';\n r_fresh_disjoint r l' h0 h1 h2", "isa_cross_project_example": true }, { "file_name": "Mem.fst", "name": "Mem.r_disjoint_alloc", "original_source_type": "val r_disjoint_alloc: n:nat -> ST (l:list subq)\n (requires fun h0 -> True)\n (ensures fun h0 l h1 ->\n modifies_none h0 h1 /\\\n r_fresh l h0 h1 /\\\n List.Tot.length l == n /\\\n r_pairwise_disjoint l)", "source_type": "val r_disjoint_alloc: n:nat -> ST (l:list subq)\n (requires fun h0 -> True)\n (ensures fun h0 l h1 ->\n modifies_none h0 h1 /\\\n r_fresh l h0 h1 /\\\n List.Tot.length l == n /\\\n r_pairwise_disjoint l)", "source_definition": "let rec r_disjoint_alloc n =\n if n = 0 then []\n else\n begin\n let h0 = ST.get () in\n let l = r_disjoint_alloc (n-1) in\n let h1 = ST.get () in\n let r = new_region quic_region in\n let h2 = ST.get () in\n r_fresh_disjoint r l h0 h1 h2;\n r_fresh_fwd l h0 h1 h2;\n r :: l\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/Mem.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 133, "start_col": 2, "end_line": 144, "end_col": 7 }, "file_context": "module Mem\n\n/// * Sets a uniform Low* HyperStack-based memory model, gathering\n/// abbreviations and top-level regions.\n///\n/// * Depends on Flags, as we do not to extract the global TLS region\n/// and its contents (only ideal stuff).\n///\n/// Coding guidelines (aligned to EverCrypt)\n/// - avoid eternal refs and buffers (fstar may deprecate them in lowstar)\n/// - use LowStar.Buffer\n/// - use monotonic buffers\n///\n/// - migrate from Bytes --> Spec-level sequences or Buffer [will take a while]\n/// - enable divergence checking (try it out on a Everest feature branch?)\n/// - use abbreviations wisely, e.g. only those to be defined in this file\n/// (no clear consensus yet)\n/// - use FStar.Integers (but avoid opening it because of v n etc... IntegersOps?)\n///\n/// - [create parent_region ...] may allocate a private sub-region,\n/// unless its state is e.g. just a single transparent reference;\n/// the caller usually tracks it using locations rather than regions.\n\nopen FStar.Error\n\ninclude FStar.HyperStack\ninclude FStar.HyperStack.ST\n\nopen LowStar.Buffer\nopen LowStar.BufferOps\n\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--z3rlimit 40 --max_fuel 0 --max_ifuel 0\"\n\ninline_for_extraction noextract\nlet model = Model.Flags.model\n\n// START quic-specific version of what was originally found in miTLS Mem.fst\nlet rgn = r:erid{r =!= root}\n\ntype fresh_subregion child parent h0 h1 =\n fresh_region child h0 h1 /\\ extends child parent\n\ntype subrgn p = r:rgn{parent r == p}\n\nlet quic_region: rgn = new_region root\ntype subq = subrgn quic_region\n// END quic-specific stuff\n\n/// Top-level disjointness\n/// ----------------------\n///\n/// We define an infrastructure for allocating a set of regions that are know\n/// automatically to be disjoint from each other.\n\n#push-options \"--max_ifuel 1\"\n\n(** r `rlist_disjoint` l holds if r is disjoint from all regions in l *)\nval rlist_disjoint: subq -> list subq -> Type0\nlet rec rlist_disjoint r = function\n | [] -> True\n | r' :: l -> r `HS.disjoint` r' /\\ rlist_disjoint r l\n\n(** r_pairwise_disjoint l holds if all regions in l are pairwise disjoint *)\nval r_pairwise_disjoint: list subq -> Type0\nlet rec r_pairwise_disjoint = function\n | [] -> True\n | r :: l -> rlist_disjoint r l /\\ r_pairwise_disjoint l\n\n(** r_fresh l h0 h1 holds when all regions in l are fresh between h0 and h1 *)\nval r_fresh: list subq -> mem -> mem -> Type0\nlet rec r_fresh l h0 h1 =\n match l with\n | [] -> True\n | r :: l -> fresh_region r h0 h1 /\\ r_fresh l h0 h1\n\nval fresh_back (r:rgn) (h0 h1 h2:mem) : Lemma\n (requires fresh_region r h1 h2 /\\ modifies_none h0 h1)\n (ensures fresh_region r h0 h2)\n// [SMTPat (fresh_region r h1 h2); SMTPat (modifies_none h0 h1)]\nlet fresh_back r h0 h1 h2 = ()\n\n#pop-options\n\n#push-options \"--max_fuel 1 --max_ifuel 1\"\n\nval r_fresh_back (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h1 h2 /\\ modifies_none h0 h1)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_back l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_back l' h0 h1 h2\n\nval r_fresh_fwd (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ modifies_none h1 h2)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_fwd l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_fwd l' h0 h1 h2\n\nval r_fresh_disjoint (r:subq) (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ fresh_region r h1 h2)\n (ensures rlist_disjoint r l)\nlet rec r_fresh_disjoint r l h0 h1 h2 =\n match l with\n | [] -> ()\n | r' :: l' ->\n lemma_extends_disjoint quic_region r r';\n r_fresh_disjoint r l' h0 h1 h2\n\nval r_fresh_forall: l:list subq -> h0:mem -> h1:mem -> Lemma\n ((forall r.{:pattern fresh_region r h0 h1} List.Tot.mem r l ==> fresh_region r h0 h1) <==>\n r_fresh l h0 h1)\nlet rec r_fresh_forall l h0 h1 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_forall l' h0 h1\n\n(** Allocates n pairwise disjoint subregions of tls_region *)\nval r_disjoint_alloc: n:nat -> ST (l:list subq)\n (requires fun h0 -> True)\n (ensures fun h0 l h1 ->\n modifies_none h0 h1 /\\\n r_fresh l h0 h1 /\\\n List.Tot.length l == n /\\\n r_pairwise_disjoint l)", "dependencies": { "source_file": "Mem.fst", "checked_file": "Mem.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Model.Flags.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 1, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 40, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "n: Prims.nat -> FStar.HyperStack.ST.ST (Prims.list Mem.subq)", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.op_Equality", "Prims.int", "Prims.Nil", "Mem.subq", "Prims.list", "Prims.bool", "Prims.Cons", "Prims.unit", "Mem.r_fresh_fwd", "Mem.r_fresh_disjoint", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "FStar.Monotonic.HyperHeap.rid", "FStar.HyperStack.ST.new_region", "Mem.quic_region", "Mem.r_disjoint_alloc", "Prims.op_Subtraction" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val r_disjoint_alloc: n:nat -> ST (l:list subq)\n (requires fun h0 -> True)\n (ensures fun h0 l h1 ->\n modifies_none h0 h1 /\\\n r_fresh l h0 h1 /\\\n List.Tot.length l == n /\\\n r_pairwise_disjoint l)\nlet rec r_disjoint_alloc n =", "completed_definiton": "if n = 0\nthen []\nelse\n let h0 = ST.get () in\n let l = r_disjoint_alloc (n - 1) in\n let h1 = ST.get () in\n let r = new_region quic_region in\n let h2 = ST.get () in\n r_fresh_disjoint r l h0 h1 h2;\n r_fresh_fwd l h0 h1 h2;\n r :: l", "isa_cross_project_example": true }, { "file_name": "Mem.fst", "name": "Mem.r_fresh_forall", "original_source_type": "val r_fresh_forall: l:list subq -> h0:mem -> h1:mem -> Lemma\n ((forall r.{:pattern fresh_region r h0 h1} List.Tot.mem r l ==> fresh_region r h0 h1) <==>\n r_fresh l h0 h1)", "source_type": "val r_fresh_forall: l:list subq -> h0:mem -> h1:mem -> Lemma\n ((forall r.{:pattern fresh_region r h0 h1} List.Tot.mem r l ==> fresh_region r h0 h1) <==>\n r_fresh l h0 h1)", "source_definition": "let rec r_fresh_forall l h0 h1 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_forall l' h0 h1", "source": { "project_name": "everquic-crypto", "file_name": "src/Mem.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 119, "start_col": 2, "end_line": 121, "end_col": 38 }, "file_context": "module Mem\n\n/// * Sets a uniform Low* HyperStack-based memory model, gathering\n/// abbreviations and top-level regions.\n///\n/// * Depends on Flags, as we do not to extract the global TLS region\n/// and its contents (only ideal stuff).\n///\n/// Coding guidelines (aligned to EverCrypt)\n/// - avoid eternal refs and buffers (fstar may deprecate them in lowstar)\n/// - use LowStar.Buffer\n/// - use monotonic buffers\n///\n/// - migrate from Bytes --> Spec-level sequences or Buffer [will take a while]\n/// - enable divergence checking (try it out on a Everest feature branch?)\n/// - use abbreviations wisely, e.g. only those to be defined in this file\n/// (no clear consensus yet)\n/// - use FStar.Integers (but avoid opening it because of v n etc... IntegersOps?)\n///\n/// - [create parent_region ...] may allocate a private sub-region,\n/// unless its state is e.g. just a single transparent reference;\n/// the caller usually tracks it using locations rather than regions.\n\nopen FStar.Error\n\ninclude FStar.HyperStack\ninclude FStar.HyperStack.ST\n\nopen LowStar.Buffer\nopen LowStar.BufferOps\n\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--z3rlimit 40 --max_fuel 0 --max_ifuel 0\"\n\ninline_for_extraction noextract\nlet model = Model.Flags.model\n\n// START quic-specific version of what was originally found in miTLS Mem.fst\nlet rgn = r:erid{r =!= root}\n\ntype fresh_subregion child parent h0 h1 =\n fresh_region child h0 h1 /\\ extends child parent\n\ntype subrgn p = r:rgn{parent r == p}\n\nlet quic_region: rgn = new_region root\ntype subq = subrgn quic_region\n// END quic-specific stuff\n\n/// Top-level disjointness\n/// ----------------------\n///\n/// We define an infrastructure for allocating a set of regions that are know\n/// automatically to be disjoint from each other.\n\n#push-options \"--max_ifuel 1\"\n\n(** r `rlist_disjoint` l holds if r is disjoint from all regions in l *)\nval rlist_disjoint: subq -> list subq -> Type0\nlet rec rlist_disjoint r = function\n | [] -> True\n | r' :: l -> r `HS.disjoint` r' /\\ rlist_disjoint r l\n\n(** r_pairwise_disjoint l holds if all regions in l are pairwise disjoint *)\nval r_pairwise_disjoint: list subq -> Type0\nlet rec r_pairwise_disjoint = function\n | [] -> True\n | r :: l -> rlist_disjoint r l /\\ r_pairwise_disjoint l\n\n(** r_fresh l h0 h1 holds when all regions in l are fresh between h0 and h1 *)\nval r_fresh: list subq -> mem -> mem -> Type0\nlet rec r_fresh l h0 h1 =\n match l with\n | [] -> True\n | r :: l -> fresh_region r h0 h1 /\\ r_fresh l h0 h1\n\nval fresh_back (r:rgn) (h0 h1 h2:mem) : Lemma\n (requires fresh_region r h1 h2 /\\ modifies_none h0 h1)\n (ensures fresh_region r h0 h2)\n// [SMTPat (fresh_region r h1 h2); SMTPat (modifies_none h0 h1)]\nlet fresh_back r h0 h1 h2 = ()\n\n#pop-options\n\n#push-options \"--max_fuel 1 --max_ifuel 1\"\n\nval r_fresh_back (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h1 h2 /\\ modifies_none h0 h1)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_back l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_back l' h0 h1 h2\n\nval r_fresh_fwd (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ modifies_none h1 h2)\n (ensures r_fresh l h0 h2)\nlet rec r_fresh_fwd l h0 h1 h2 =\n match l with\n | [] -> ()\n | r :: l' -> r_fresh_fwd l' h0 h1 h2\n\nval r_fresh_disjoint (r:subq) (l:list subq) (h0 h1 h2:mem) : Lemma\n (requires r_fresh l h0 h1 /\\ fresh_region r h1 h2)\n (ensures rlist_disjoint r l)\nlet rec r_fresh_disjoint r l h0 h1 h2 =\n match l with\n | [] -> ()\n | r' :: l' ->\n lemma_extends_disjoint quic_region r r';\n r_fresh_disjoint r l' h0 h1 h2\n\nval r_fresh_forall: l:list subq -> h0:mem -> h1:mem -> Lemma\n ((forall r.{:pattern fresh_region r h0 h1} List.Tot.mem r l ==> fresh_region r h0 h1) <==>\n r_fresh l h0 h1)", "dependencies": { "source_file": "Mem.fst", "checked_file": "Mem.fst.checked", "interface_file": false, "dependencies": [ "prims.fst.checked", "Model.Flags.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Error.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Error" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 1, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 40, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "l: Prims.list Mem.subq -> h0: FStar.Monotonic.HyperStack.mem -> h1: FStar.Monotonic.HyperStack.mem\n -> FStar.Pervasives.Lemma\n (ensures\n (forall (r:\n FStar.Monotonic.HyperHeap.rid\n { FStar.HyperStack.ST.is_eternal_region r /\\ ~(r == FStar.Monotonic.HyperHeap.root) /\\\n FStar.Monotonic.HyperHeap.parent r == Mem.quic_region }).\n {:pattern FStar.Monotonic.HyperStack.fresh_region r h0 h1}\n FStar.List.Tot.Base.mem r l ==> FStar.Monotonic.HyperStack.fresh_region r h0 h1) <==>\n Mem.r_fresh l h0 h1)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.list", "Mem.subq", "FStar.Monotonic.HyperStack.mem", "Mem.r_fresh_forall", "Prims.unit" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val r_fresh_forall: l:list subq -> h0:mem -> h1:mem -> Lemma\n ((forall r.{:pattern fresh_region r h0 h1} List.Tot.mem r l ==> fresh_region r h0 h1) <==>\n r_fresh l h0 h1)\nlet rec r_fresh_forall l h0 h1 =", "completed_definiton": "match l with\n| [] -> ()\n| r :: l' -> r_fresh_forall l' h0 h1", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.suffix", "original_source_type": "", "source_type": "val suffix : b: QUIC.Spec.Base.bytes -> n: Prims.nat{n <= FStar.Seq.Base.length b}\n -> FStar.Seq.Base.seq QUIC.Spec.Base.byte", "source_definition": "let suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 9, "start_col": 48, "end_line": 9, "end_col": 72 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: QUIC.Spec.Base.bytes -> n: Prims.nat{n <= FStar.Seq.Base.length b}\n -> FStar.Seq.Base.seq QUIC.Spec.Base.byte", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bytes", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "FStar.Seq.Base.slice", "FStar.Seq.Base.seq" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let suffix (b: bytes) (n: nat{n <= S.length b}) =", "completed_definiton": "S.slice b n (S.length b)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.xor_involutive", "original_source_type": "val xor_involutive (b1 b2: byte)\n : Lemma (requires True) (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1)", "source_type": "val xor_involutive (b1 b2: byte)\n : Lemma (requires True) (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1)", "source_definition": "let xor_involutive (b1 b2:byte) : Lemma\n (requires True)\n (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1) =\n FStar.UInt.logxor_associative (U8.v b1) (U8.v b2) (U8.v b2);\n FStar.UInt.logxor_self (U8.v b2);\n FStar.UInt.logxor_commutative (FStar.UInt.zero 8) (U8.v b1);\n FStar.UInt.logxor_lemma_1 (U8.v b1)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 419, "start_col": 2, "end_line": 422, "end_col": 37 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')\n\n#pop-options\n\nlet pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0\n ))\n= S.lemma_split a pos_split;\n pointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos\n\nlet pointwise_op_slice_other\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n (from to: nat)\n: Lemma\n (requires (\n S.length b2 + pos <= S.length b1 /\\\n from <= to /\\\n to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)\n ))\n (ensures (\n S.slice (pointwise_op f b1 b2 pos) from to `S.equal` S.slice b1 from to\n ))\n= let phi\n (i: nat { from <= i /\\ i < to })\n : Lemma\n (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i)\n = if to <= pos\n then pointwise_index1 f b1 b2 i pos\n else pointwise_index3 f b1 b2 i pos\n in\n Classical.forall_intro phi\n\n\n// application: byte-wise xor\nlet xor_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logxor b1 b2 pos\n\n\n// proof of involution of the operator (uses extensionality for the\n// byte-wise variant)\nlet xor_involutive (b1 b2:byte) : Lemma\n (requires True)", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b1: QUIC.Spec.Base.byte -> b2: QUIC.Spec.Base.byte\n -> FStar.Pervasives.Lemma (ensures FStar.UInt8.logxor (FStar.UInt8.logxor b1 b2) b2 = b1)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.byte", "FStar.UInt.logxor_lemma_1", "FStar.UInt8.n", "FStar.UInt8.v", "Prims.unit", "FStar.UInt.logxor_commutative", "FStar.UInt.zero", "FStar.UInt.logxor_self", "FStar.UInt.logxor_associative", "Prims.l_True", "Prims.squash", "Prims.b2t", "Prims.op_Equality", "FStar.UInt8.t", "FStar.UInt8.logxor", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val xor_involutive (b1 b2: byte)\n : Lemma (requires True) (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1)\nlet xor_involutive (b1 b2: byte)\n : Lemma (requires True) (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1) =", "completed_definiton": "FStar.UInt.logxor_associative (U8.v b1) (U8.v b2) (U8.v b2);\nFStar.UInt.logxor_self (U8.v b2);\nFStar.UInt.logxor_commutative (FStar.UInt.zero 8) (U8.v b1);\nFStar.UInt.logxor_lemma_1 (U8.v b1)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.and_inplace", "original_source_type": "val and_inplace (b1 b2: bytes) (pos: nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2))", "source_type": "val and_inplace (b1 b2: bytes) (pos: nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2))", "source_definition": "let and_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logand b1 b2 pos", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 533, "start_col": 2, "end_line": 533, "end_col": 34 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')\n\n#pop-options\n\nlet pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0\n ))\n= S.lemma_split a pos_split;\n pointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos\n\nlet pointwise_op_slice_other\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n (from to: nat)\n: Lemma\n (requires (\n S.length b2 + pos <= S.length b1 /\\\n from <= to /\\\n to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)\n ))\n (ensures (\n S.slice (pointwise_op f b1 b2 pos) from to `S.equal` S.slice b1 from to\n ))\n= let phi\n (i: nat { from <= i /\\ i < to })\n : Lemma\n (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i)\n = if to <= pos\n then pointwise_index1 f b1 b2 i pos\n else pointwise_index3 f b1 b2 i pos\n in\n Classical.forall_intro phi\n\n\n// application: byte-wise xor\nlet xor_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logxor b1 b2 pos\n\n\n// proof of involution of the operator (uses extensionality for the\n// byte-wise variant)\nlet xor_involutive (b1 b2:byte) : Lemma\n (requires True)\n (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1) =\n FStar.UInt.logxor_associative (U8.v b1) (U8.v b2) (U8.v b2);\n FStar.UInt.logxor_self (U8.v b2);\n FStar.UInt.logxor_commutative (FStar.UInt.zero 8) (U8.v b1);\n FStar.UInt.logxor_lemma_1 (U8.v b1)\n\n\nlet xor_inplace_involutive (b1 b2:bytes) (pos:nat) : Lemma\n (requires S.length b2 + pos <= S.length b1)\n (ensures S.equal (xor_inplace (xor_inplace b1 b2 pos) b2 pos) b1)\n (decreases (S.length b2)) =\n let xor = xor_inplace (xor_inplace b1 b2 pos) b2 pos in\n let step (i:nat{i < S.length b1}) : Lemma (S.index xor i = S.index b1 i) =\n if i < pos then begin\n pointwise_index1 U8.logxor b1 b2 i pos;\n pointwise_index1 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else if i >= pos+S.length b2 then begin\n pointwise_index3 U8.logxor b1 b2 i pos;\n pointwise_index3 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else begin\n pointwise_index2 U8.logxor b1 b2 i pos;\n pointwise_index2 U8.logxor (xor_inplace b1 b2 pos) b2 i pos;\n xor_involutive (S.index b1 i) (S.index b2 (i-pos))\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet xor_inplace_commutative (b b1 b2:bytes) (pos1 pos2:nat) : Lemma\n (requires\n S.length b1 + pos1 <= S.length b /\\\n S.length b2 + pos2 <= S.length b)\n (ensures S.equal\n (xor_inplace (xor_inplace b b1 pos1) b2 pos2)\n (xor_inplace (xor_inplace b b2 pos2) b1 pos1)) =\n let xor1 = xor_inplace (xor_inplace b b1 pos1) b2 pos2 in\n let xor2 = xor_inplace (xor_inplace b b2 pos2) b1 pos1 in\n let step (i:nat{i < S.length b}) : Lemma (S.index xor1 i = S.index xor2 i) =\n if i < pos1 then begin\n pointwise_index1 U8.logxor b b1 i pos1;\n pointwise_index1 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else if i >= pos1 + S.length b1 then begin\n pointwise_index3 U8.logxor b b1 i pos1;\n pointwise_index3 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else begin\n pointwise_index2 U8.logxor b b1 i pos1;\n pointwise_index2 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n let ind = U8.v (S.index b i) in\n let ind1 = U8.v (S.index b1 (i-pos1)) in\n let ind2 = U8.v (S.index b2 (i-pos2)) in\n FStar.UInt.logxor_associative #8 ind ind1 ind2;\n FStar.UInt.logxor_associative #8 ind ind2 ind1;\n FStar.UInt.logxor_commutative #8 ind1 ind2;\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end in\n\n FStar.Classical.forall_intro step\n\nlet xor_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (pos: nat)\n: Lemma\n (requires (pos + S.length b <= S.length a))\n (ensures (xor_inplace a b pos `S.equal` a))\n= let psi\n (i: nat {i < S.length a})\n : Lemma\n (S.index (xor_inplace a b pos) i == S.index a i)\n = if i < pos\n then pointwise_index1 U8.logxor a b i pos\n else if i >= pos + S.length b\n then pointwise_index3 U8.logxor a b i pos\n else begin\n pointwise_index2 U8.logxor a b i pos;\n phi (i - pos);\n FStar.UInt.logxor_lemma_1 (U8.v (S.index a i))\n end\n in\n Classical.forall_intro psi\n\nlet and_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b1: QUIC.Spec.Base.bytes -> b2: QUIC.Spec.Base.bytes -> pos: Prims.nat\n -> Prims.Pure QUIC.Spec.Base.bytes", "effect": "Prims.Pure", "effect_flags": [ "" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bytes", "Prims.nat", "QUIC.Spec.Lemmas.pointwise_op", "QUIC.Spec.Base.byte", "FStar.UInt8.logand", "FStar.Seq.Base.length", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_Addition", "Prims.eq2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val and_inplace (b1 b2: bytes) (pos: nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2))\nlet and_inplace (b1 b2: bytes) (pos: nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =", "completed_definiton": "pointwise_op U8.logand b1 b2 pos", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.max", "original_source_type": "val max (a b: int) : Tot (n: int{n >= a /\\ n >= b})", "source_type": "val max (a b: int) : Tot (n: int{n >= a /\\ n >= b})", "source_definition": "let max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 12, "start_col": 2, "end_line": 12, "end_col": 24 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Prims.int -> b: Prims.int -> n: Prims.int{n >= a /\\ n >= b}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.int", "Prims.op_GreaterThan", "Prims.bool", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThanOrEqual" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val max (a b: int) : Tot (n: int{n >= a /\\ n >= b})\nlet max (a b: int) : Tot (n: int{n >= a /\\ n >= b}) =", "completed_definiton": "if a > b then a else b", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.slice_trans", "original_source_type": "val slice_trans (#a: Type) (b: S.seq a) (i j k: nat)\n : Lemma (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k))", "source_type": "val slice_trans (#a: Type) (b: S.seq a) (i j k: nat)\n : Lemma (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k))", "source_definition": "let slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 157, "start_col": 2, "end_line": 157, "end_col": 37 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: FStar.Seq.Base.seq a -> i: Prims.nat -> j: Prims.nat -> k: Prims.nat\n -> FStar.Pervasives.Lemma (requires i <= j /\\ j <= k /\\ k <= FStar.Seq.Base.length b)\n (ensures\n FStar.Seq.Base.slice b i k == FStar.Seq.Base.slice b i j @| FStar.Seq.Base.slice b j k)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.nat", "FStar.Seq.Properties.lemma_split", "FStar.Seq.Base.slice", "Prims.op_Subtraction", "Prims.unit", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "Prims.squash", "Prims.eq2", "FStar.Seq.Base.op_At_Bar", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val slice_trans (#a: Type) (b: S.seq a) (i j k: nat)\n : Lemma (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k))\nlet slice_trans (#a: Type) (b: S.seq a) (i j k: nat)\n : Lemma (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =", "completed_definiton": "S.lemma_split (S.slice b i k) (j - i)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.pointwise_op_empty", "original_source_type": "val pointwise_op_empty (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (pos: nat)\n : Lemma (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))", "source_type": "val pointwise_op_empty (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (pos: nat)\n : Lemma (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))", "source_definition": "let pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 193, "start_col": 2, "end_line": 193, "end_col": 31 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "f: (_: a -> _: a -> a) -> b1: FStar.Seq.Base.seq a -> b2: FStar.Seq.Base.seq a -> pos: Prims.nat\n -> FStar.Pervasives.Lemma\n (requires FStar.Seq.Base.length b2 == 0 /\\ pos <= FStar.Seq.Base.length b1)\n (ensures QUIC.Spec.Lemmas.pointwise_op f b1 b2 pos == b1)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.nat", "Prims._assert", "FStar.Seq.Base.equal", "FStar.Seq.Base.empty", "Prims.unit", "Prims.l_and", "Prims.eq2", "Prims.int", "FStar.Seq.Base.length", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.squash", "QUIC.Spec.Lemmas.pointwise_op", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val pointwise_op_empty (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (pos: nat)\n : Lemma (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\nlet pointwise_op_empty (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (pos: nat)\n : Lemma (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1)) =", "completed_definiton": "assert (b2 `S.equal` S.empty)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.xor_inplace", "original_source_type": "val xor_inplace (b1 b2: bytes) (pos: nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2))", "source_type": "val xor_inplace (b1 b2: bytes) (pos: nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2))", "source_definition": "let xor_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logxor b1 b2 pos", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 411, "start_col": 2, "end_line": 411, "end_col": 34 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')\n\n#pop-options\n\nlet pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0\n ))\n= S.lemma_split a pos_split;\n pointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos\n\nlet pointwise_op_slice_other\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n (from to: nat)\n: Lemma\n (requires (\n S.length b2 + pos <= S.length b1 /\\\n from <= to /\\\n to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)\n ))\n (ensures (\n S.slice (pointwise_op f b1 b2 pos) from to `S.equal` S.slice b1 from to\n ))\n= let phi\n (i: nat { from <= i /\\ i < to })\n : Lemma\n (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i)\n = if to <= pos\n then pointwise_index1 f b1 b2 i pos\n else pointwise_index3 f b1 b2 i pos\n in\n Classical.forall_intro phi\n\n\n// application: byte-wise xor\nlet xor_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b1: QUIC.Spec.Base.bytes -> b2: QUIC.Spec.Base.bytes -> pos: Prims.nat\n -> Prims.Pure QUIC.Spec.Base.bytes", "effect": "Prims.Pure", "effect_flags": [ "" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bytes", "Prims.nat", "QUIC.Spec.Lemmas.pointwise_op", "QUIC.Spec.Base.byte", "FStar.UInt8.logxor", "FStar.Seq.Base.length", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_Addition", "Prims.eq2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val xor_inplace (b1 b2: bytes) (pos: nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2))\nlet xor_inplace (b1 b2: bytes) (pos: nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =", "completed_definiton": "pointwise_op U8.logxor b1 b2 pos", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.pointwise_op_slice_other", "original_source_type": "val pointwise_op_slice_other (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (pos from to: nat)\n : Lemma\n (requires\n (S.length b2 + pos <= S.length b1 /\\ from <= to /\\ to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)))\n (ensures ((S.slice (pointwise_op f b1 b2 pos) from to) `S.equal` (S.slice b1 from to)))", "source_type": "val pointwise_op_slice_other (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (pos from to: nat)\n : Lemma\n (requires\n (S.length b2 + pos <= S.length b1 /\\ from <= to /\\ to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)))\n (ensures ((S.slice (pointwise_op f b1 b2 pos) from to) `S.equal` (S.slice b1 from to)))", "source_definition": "let pointwise_op_slice_other\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n (from to: nat)\n: Lemma\n (requires (\n S.length b2 + pos <= S.length b1 /\\\n from <= to /\\\n to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)\n ))\n (ensures (\n S.slice (pointwise_op f b1 b2 pos) from to `S.equal` S.slice b1 from to\n ))\n= let phi\n (i: nat { from <= i /\\ i < to })\n : Lemma\n (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i)\n = if to <= pos\n then pointwise_index1 f b1 b2 i pos\n else pointwise_index3 f b1 b2 i pos\n in\n Classical.forall_intro phi", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 394, "start_col": 1, "end_line": 402, "end_col": 28 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')\n\n#pop-options\n\nlet pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0\n ))\n= S.lemma_split a pos_split;\n pointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos\n\nlet pointwise_op_slice_other\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n (from to: nat)\n: Lemma\n (requires (\n S.length b2 + pos <= S.length b1 /\\\n from <= to /\\\n to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)\n ))\n (ensures (\n S.slice (pointwise_op f b1 b2 pos) from to `S.equal` S.slice b1 from to", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n f: (_: a -> _: a -> a) ->\n b1: FStar.Seq.Base.seq a ->\n b2: FStar.Seq.Base.seq a ->\n pos: Prims.nat ->\n from: Prims.nat ->\n to: Prims.nat\n -> FStar.Pervasives.Lemma\n (requires\n FStar.Seq.Base.length b2 + pos <= FStar.Seq.Base.length b1 /\\ from <= to /\\\n to <= FStar.Seq.Base.length b1 /\\ (to <= pos \\/ pos + FStar.Seq.Base.length b2 <= from))\n (ensures\n FStar.Seq.Base.equal (FStar.Seq.Base.slice (QUIC.Spec.Lemmas.pointwise_op f b1 b2 pos)\n from\n to)\n (FStar.Seq.Base.slice b1 from to))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.nat", "FStar.Classical.forall_intro", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "Prims.eq2", "FStar.Seq.Base.index", "QUIC.Spec.Lemmas.pointwise_op", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern", "QUIC.Spec.Lemmas.pointwise_index1", "Prims.bool", "QUIC.Spec.Lemmas.pointwise_index3", "Prims.op_Addition", "FStar.Seq.Base.length", "Prims.l_or", "FStar.Seq.Base.equal", "FStar.Seq.Base.slice" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val pointwise_op_slice_other (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (pos from to: nat)\n : Lemma\n (requires\n (S.length b2 + pos <= S.length b1 /\\ from <= to /\\ to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)))\n (ensures ((S.slice (pointwise_op f b1 b2 pos) from to) `S.equal` (S.slice b1 from to)))\nlet pointwise_op_slice_other (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (pos from to: nat)\n : Lemma\n (requires\n (S.length b2 + pos <= S.length b1 /\\ from <= to /\\ to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)))\n (ensures ((S.slice (pointwise_op f b1 b2 pos) from to) `S.equal` (S.slice b1 from to))) =", "completed_definiton": "let phi (i: nat{from <= i /\\ i < to}) : Lemma (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i)\n=\n if to <= pos then pointwise_index1 f b1 b2 i pos else pointwise_index3 f b1 b2 i pos\nin\nClassical.forall_intro phi", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.index_n_to_be_zero_left", "original_source_type": "val index_n_to_be_zero_left (len n j i: nat)\n : Lemma (requires (i < j /\\ j <= len /\\ n < pow2 (8 * (len - j))))\n (ensures\n (pow2 (8 * (len - j)) <= pow2 (8 * len) /\\\n U8.v (FStar.Seq.index (FStar.Endianness.n_to_be len n) i) == 0))", "source_type": "val index_n_to_be_zero_left (len n j i: nat)\n : Lemma (requires (i < j /\\ j <= len /\\ n < pow2 (8 * (len - j))))\n (ensures\n (pow2 (8 * (len - j)) <= pow2 (8 * len) /\\\n U8.v (FStar.Seq.index (FStar.Endianness.n_to_be len n) i) == 0))", "source_definition": "let index_n_to_be_zero_left\n (len: nat)\n (n: nat)\n (j: nat)\n (i: nat)\n: Lemma\n (requires (\n i < j /\\\n j <= len /\\\n n < pow2 (8 * (len - j))\n ))\n (ensures (\n pow2 (8 * (len - j)) <= pow2 (8 * len) /\\\n U8.v (FStar.Seq.index (FStar.Endianness.n_to_be len n) i) == 0\n ))\n= let open FStar.Math.Lemmas in\n pow2_le_compat (8 * len) (8 * (len - j));\n pow2_le_compat (8 * (len - 1 - i)) (8 * (len - j));\n small_division_lemma_1 n (pow2 (8 * (len - 1 - i)));\n index_n_to_be len n i", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 758, "start_col": 2, "end_line": 762, "end_col": 23 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')\n\n#pop-options\n\nlet pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0\n ))\n= S.lemma_split a pos_split;\n pointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos\n\nlet pointwise_op_slice_other\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n (from to: nat)\n: Lemma\n (requires (\n S.length b2 + pos <= S.length b1 /\\\n from <= to /\\\n to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)\n ))\n (ensures (\n S.slice (pointwise_op f b1 b2 pos) from to `S.equal` S.slice b1 from to\n ))\n= let phi\n (i: nat { from <= i /\\ i < to })\n : Lemma\n (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i)\n = if to <= pos\n then pointwise_index1 f b1 b2 i pos\n else pointwise_index3 f b1 b2 i pos\n in\n Classical.forall_intro phi\n\n\n// application: byte-wise xor\nlet xor_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logxor b1 b2 pos\n\n\n// proof of involution of the operator (uses extensionality for the\n// byte-wise variant)\nlet xor_involutive (b1 b2:byte) : Lemma\n (requires True)\n (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1) =\n FStar.UInt.logxor_associative (U8.v b1) (U8.v b2) (U8.v b2);\n FStar.UInt.logxor_self (U8.v b2);\n FStar.UInt.logxor_commutative (FStar.UInt.zero 8) (U8.v b1);\n FStar.UInt.logxor_lemma_1 (U8.v b1)\n\n\nlet xor_inplace_involutive (b1 b2:bytes) (pos:nat) : Lemma\n (requires S.length b2 + pos <= S.length b1)\n (ensures S.equal (xor_inplace (xor_inplace b1 b2 pos) b2 pos) b1)\n (decreases (S.length b2)) =\n let xor = xor_inplace (xor_inplace b1 b2 pos) b2 pos in\n let step (i:nat{i < S.length b1}) : Lemma (S.index xor i = S.index b1 i) =\n if i < pos then begin\n pointwise_index1 U8.logxor b1 b2 i pos;\n pointwise_index1 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else if i >= pos+S.length b2 then begin\n pointwise_index3 U8.logxor b1 b2 i pos;\n pointwise_index3 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else begin\n pointwise_index2 U8.logxor b1 b2 i pos;\n pointwise_index2 U8.logxor (xor_inplace b1 b2 pos) b2 i pos;\n xor_involutive (S.index b1 i) (S.index b2 (i-pos))\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet xor_inplace_commutative (b b1 b2:bytes) (pos1 pos2:nat) : Lemma\n (requires\n S.length b1 + pos1 <= S.length b /\\\n S.length b2 + pos2 <= S.length b)\n (ensures S.equal\n (xor_inplace (xor_inplace b b1 pos1) b2 pos2)\n (xor_inplace (xor_inplace b b2 pos2) b1 pos1)) =\n let xor1 = xor_inplace (xor_inplace b b1 pos1) b2 pos2 in\n let xor2 = xor_inplace (xor_inplace b b2 pos2) b1 pos1 in\n let step (i:nat{i < S.length b}) : Lemma (S.index xor1 i = S.index xor2 i) =\n if i < pos1 then begin\n pointwise_index1 U8.logxor b b1 i pos1;\n pointwise_index1 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else if i >= pos1 + S.length b1 then begin\n pointwise_index3 U8.logxor b b1 i pos1;\n pointwise_index3 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else begin\n pointwise_index2 U8.logxor b b1 i pos1;\n pointwise_index2 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n let ind = U8.v (S.index b i) in\n let ind1 = U8.v (S.index b1 (i-pos1)) in\n let ind2 = U8.v (S.index b2 (i-pos2)) in\n FStar.UInt.logxor_associative #8 ind ind1 ind2;\n FStar.UInt.logxor_associative #8 ind ind2 ind1;\n FStar.UInt.logxor_commutative #8 ind1 ind2;\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end in\n\n FStar.Classical.forall_intro step\n\nlet xor_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (pos: nat)\n: Lemma\n (requires (pos + S.length b <= S.length a))\n (ensures (xor_inplace a b pos `S.equal` a))\n= let psi\n (i: nat {i < S.length a})\n : Lemma\n (S.index (xor_inplace a b pos) i == S.index a i)\n = if i < pos\n then pointwise_index1 U8.logxor a b i pos\n else if i >= pos + S.length b\n then pointwise_index3 U8.logxor a b i pos\n else begin\n pointwise_index2 U8.logxor a b i pos;\n phi (i - pos);\n FStar.UInt.logxor_lemma_1 (U8.v (S.index a i))\n end\n in\n Classical.forall_intro psi\n\nlet and_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logand b1 b2 pos\n\nlet and_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (i: nat {i < S.length a})\n: Lemma\n (requires (S.length b == S.length a))\n (ensures (S.index (and_inplace a b 0) i == 0uy))\n= pointwise_index2 U8.logand a b i 0;\n phi i;\n FStar.UInt.logand_lemma_1 (U8.v (S.index a i))\n\nlet rec bitwise_op (f:bool->bool->bool) (l1 l2:list bool) : Pure (list bool)\n (requires List.Tot.length l1 = List.Tot.length l2)\n (ensures fun l -> List.Tot.length l = List.Tot.length l1) =\n match l1,l2 with\n | [],[] -> []\n | x1::t1,x2::t2 -> f x1 x2 :: bitwise_op f t1 t2\n\n\nlet rec lemma_bitwise_op_index (f:bool->bool->bool) (l1 l2:list bool) (n:nat) : Lemma\n (requires List.Tot.length l1 = List.Tot.length l2 /\\ n < List.Tot.length l1)\n (ensures List.Tot.index (bitwise_op f l1 l2) n = f (List.Tot.index l1 n) (List.Tot.index l2 n)) =\n match l1,l2 with\n | [],[] -> ()\n | x1::t1,x2::t2 ->\n if n = 0 then ()\n else lemma_bitwise_op_index f t1 t2 (n-1)\n\nlet rec list_to_seq (#a:Type) (l:list a) : (s:(S.seq a){S.length s = List.Tot.length l /\\ (forall i. S.index s i == List.Tot.index l i)}) =\n match l with\n | [] -> S.empty\n | h :: t -> S.(create 1 h @| list_to_seq t)\n\nlet rec rev_seq (#a:Type) (s:S.seq a) : Pure (S.seq a)\n (requires True)\n (ensures fun s' -> S.length s = S.length s')\n (decreases (S.length s)) =\n if S.length s = 0 then S.empty\n else\n let _ = S.lemma_empty s in\n S.(rev_seq S.(slice s 1 (length s)) @| create 1 (index s 0))\n\n\nlet rec lemma_rev_seq (#a:Type) (s:S.seq a) (i:nat) : Lemma\n (requires i < S.length s)\n (ensures\n S.length (rev_seq s) = S.length s /\\\n S.index s i == S.index (rev_seq s) (S.length s-1-i))\n (decreases (i))=\n if S.length s = 0 then ()\n else if i = 0 then ()\n else lemma_rev_seq (S.slice s 1 (S.length s)) (i-1)\n\n#restart-solver\n\nlet lemma_arithmetic1 (a b c d e:int) : Lemma\n ((a+b+c+d)+(e-d) = (a+c+e)+b) =\n ()\n\nlet lemma_arithmetic2 (a b c d:int) : Lemma\n (a+(b-c)+d = a + ((b+d)-c)) =\n ()\n\nlet lemma_arithmetic3 (a b c:int) : Lemma\n ((a+b)-c = (a-c)+b) =\n ()\n\n\nlet lemma_propagate_mul_mod (a b:nat) : Lemma\n (requires b > 0)\n (ensures (\n let open FStar.Mul in\n (2*a) % (2*b) = 2 * (a % b))) =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_div_mod a b;\n lemma_div_mod (2*a) b;\n let (p,r) = ((a/b)*(2*b), 2*(a%b)) in\n assert (2*a = p + r);\n modulo_distributivity p r (2*b);\n multiple_modulo_lemma (a/b) (2*b);\n modulo_range_lemma a b;\n small_mod r (2*b)\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1 --z3rlimit 256\" // strange that F* has so much trouble completing this induction\nlet recompose_pow2_assoc (n:pos) (a:nat) : Lemma\n (let open FStar.Mul in 2 * (pow2 (n-1) * a) = pow2 n * a) =\n ()\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1 --z3rlimit 512\" // strange that F* has so much trouble completing this induction\nlet rec lemma_propagate_pow_mod (a b n:nat) : Lemma\n (requires b > 0)\n (ensures (\n let open FStar.Mul in\n (pow2 n * a) % (pow2 n * b) = pow2 n * (a % b))) =\n let open FStar.Mul in\n let open FStar.Math.Lemmas in\n if n = 0 then ()\n else begin\n let res = (pow2 n * a) % (pow2 n * b) in\n lemma_propagate_mul_mod (pow2 (n-1) * a) (pow2 (n-1) * b);\n assert (res = 2 * ((pow2 (n-1) * a) % (pow2 (n-1) * b)));\n lemma_propagate_pow_mod a b (n-1);\n assert (res = 2 * (pow2 (n-1) * (a%b)));\n recompose_pow2_assoc n (a%b)\n end\n#pop-options\n\n\n#restart-solver\nlet lemma_modulo_shift_byte (a:nat) (i:pos) : Lemma\n (let open FStar.Mul in\n (pow2 8 * a) % (pow2 (8*i)) = pow2 8 * (a % pow2 (8*(i-1)))) =\n let sub = 8 `op_Multiply` (i-1) in\n FStar.Math.Lemmas.pow2_plus 8 sub;\n lemma_propagate_pow_mod a (pow2 sub) 8\n\nlet rec reveal_be_to_n_slice (b:bytes) (i j:nat) : Lemma\n (requires i < j /\\ j <= S.length b)\n (ensures (\n let open FStar.Mul in\n let open FStar.Endianness in\n let h = U8.v (S.index b (j-1)) in\n be_to_n (S.slice b i j) = h + pow2 8 * be_to_n (S.slice b i (j - 1)))) =\n FStar.Endianness.reveal_be_to_n (S.slice b i j)\n\nlet rec lemma_correctness_slice_be_to_n (b:bytes) (i:nat) : Lemma\n (requires i <= S.length b)\n (ensures (\n let open FStar.Endianness in\n let open FStar.Mul in\n be_to_n b % pow2 (8 * i) =\n be_to_n (S.slice b (S.length b - i) (S.length b))))\n (decreases i) =\n let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n if i = 0 then reveal_be_to_n S.empty\n else begin\n reveal_be_to_n b;\n let h = U8.v (S.index b (S.length b - 1)) in\n let l = S.slice b 0 (S.length b - 1) in\n let pow = pow2 (8*i) in\n //assert (be_to_n b = h + pow2 8 * be_to_n l);\n modulo_distributivity h (pow2 8 * be_to_n l) pow;\n pow2_le_compat (8*i) 8;\n small_mod h pow;\n //assert (be_to_n b % pow = (h + (pow2 8 * be_to_n l)%pow) % pow);\n lemma_modulo_shift_byte (be_to_n l) i;\n lemma_correctness_slice_be_to_n l (i-1);\n //assert (be_to_n b % pow = (h + pow2 8 * be_to_n (S.slice b (S.length b - i) (S.length b - 1))) % pow);\n reveal_be_to_n_slice b (S.length b - i) (S.length b);\n //assert (be_to_n b % pow = be_to_n (S.slice b (S.length b - i) (S.length b)) % pow);\n lemma_be_to_n_is_bounded (S.slice b (S.length b - i) (S.length b));\n FStar.Math.Lemmas.small_mod (be_to_n (S.slice b (S.length b - i) (S.length b))) pow\n end\n\nopen FStar.Mul\n\nlet rec index_be_to_n\n (b: bytes)\n (i: nat)\n: Lemma\n (requires (\n i < S.length b\n ))\n (ensures (\n U8.v (FStar.Seq.index b i) == (FStar.Endianness.be_to_n b / pow2 (8 * (S.length b - 1 - i))) % pow2 8\n ))\n (decreases (S.length b))\n= let open FStar.Endianness in\n reveal_be_to_n b;\n if i = S.length b - 1\n then ()\n else begin\n let l = S.length b in\n let l' = l - 1 in\n let b' = S.slice b 0 l' in\n index_be_to_n b' i;\n assert (FStar.Seq.index b i == FStar.Seq.index b' i);\n let open FStar.Math.Lemmas in\n let x = be_to_n b in\n let x' = be_to_n b' in\n assert (U8.v (FStar.Seq.index b i) == x' / pow2 (8 * (l' - 1 - i)) % pow2 8);\n let y = (U8.v (S.last b) + pow2 8 * x') / pow2 (8 * (l - 1 - i)) % pow2 8 in\n pow2_plus 8 (8 * (l' - 1 - i));\n division_multiplication_lemma (U8.v (S.last b) + pow2 8 * x') (pow2 8) (pow2 (8 * (l' - 1 - i)));\n assert (pow2 8 * x' == x' * pow2 8);\n division_addition_lemma (U8.v (S.last b)) (pow2 8) x';\n small_division_lemma_1 (U8.v (S.last b)) (pow2 8);\n assert (y == x' / pow2 (8 * (l' - 1 - i)) % pow2 8)\n end\n\nlet index_n_to_be\n (len: nat)\n (n: nat)\n (i: nat)\n: Lemma\n (requires (\n i < len /\\\n n < pow2 (8 * len)\n ))\n (ensures (\n U8.v (FStar.Seq.index (FStar.Endianness.n_to_be len n) i)) == (n / pow2 (8 * (len - 1 - i)) % pow2 8\n ))\n= index_be_to_n (FStar.Endianness.n_to_be len n) i\n\nlet index_n_to_be_zero_left\n (len: nat)\n (n: nat)\n (j: nat)\n (i: nat)\n: Lemma\n (requires (\n i < j /\\\n j <= len /\\\n n < pow2 (8 * (len - j))\n ))\n (ensures (\n pow2 (8 * (len - j)) <= pow2 (8 * len) /\\\n U8.v (FStar.Seq.index (FStar.Endianness.n_to_be len n) i) == 0", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "len: Prims.nat -> n: Prims.nat -> j: Prims.nat -> i: Prims.nat\n -> FStar.Pervasives.Lemma (requires i < j /\\ j <= len /\\ n < Prims.pow2 (8 * (len - j)))\n (ensures\n Prims.pow2 (8 * (len - j)) <= Prims.pow2 (8 * len) /\\\n FStar.UInt8.v (FStar.Seq.Base.index (FStar.Endianness.n_to_be len n) i) == 0)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "QUIC.Spec.Lemmas.index_n_to_be", "Prims.unit", "FStar.Math.Lemmas.small_division_lemma_1", "Prims.pow2", "FStar.Mul.op_Star", "Prims.op_Subtraction", "FStar.Math.Lemmas.pow2_le_compat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThan", "Prims.op_LessThanOrEqual", "Prims.squash", "Prims.eq2", "Prims.int", "FStar.UInt8.v", "FStar.Seq.Base.index", "FStar.UInt8.t", "FStar.Endianness.n_to_be", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val index_n_to_be_zero_left (len n j i: nat)\n : Lemma (requires (i < j /\\ j <= len /\\ n < pow2 (8 * (len - j))))\n (ensures\n (pow2 (8 * (len - j)) <= pow2 (8 * len) /\\\n U8.v (FStar.Seq.index (FStar.Endianness.n_to_be len n) i) == 0))\nlet index_n_to_be_zero_left (len n j i: nat)\n : Lemma (requires (i < j /\\ j <= len /\\ n < pow2 (8 * (len - j))))\n (ensures\n (pow2 (8 * (len - j)) <= pow2 (8 * len) /\\\n U8.v (FStar.Seq.index (FStar.Endianness.n_to_be len n) i) == 0)) =", "completed_definiton": "let open FStar.Math.Lemmas in\npow2_le_compat (8 * len) (8 * (len - j));\npow2_le_compat (8 * (len - 1 - i)) (8 * (len - j));\nsmall_division_lemma_1 n (pow2 (8 * (len - 1 - i)));\nindex_n_to_be len n i", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.lemma_pow2_div2", "original_source_type": "val lemma_pow2_div2 (a b c: nat) : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))", "source_type": "val lemma_pow2_div2 (a b c: nat) : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))", "source_definition": "let lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 60, "start_col": 2, "end_line": 62, "end_col": 51 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Prims.nat -> b: Prims.nat -> c: Prims.nat\n -> FStar.Pervasives.Lemma (ensures a / Prims.pow2 b / Prims.pow2 c == a / Prims.pow2 (c + b))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "FStar.Math.Lemmas.division_multiplication_lemma", "Prims.pow2", "Prims.unit", "FStar.Math.Lemmas.pow2_plus", "Prims.l_True", "Prims.squash", "Prims.eq2", "Prims.int", "Prims.op_Division", "Prims.op_Addition", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_pow2_div2 (a b c: nat) : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\nlet lemma_pow2_div2 (a b c: nat) : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b))) =", "completed_definiton": "let open FStar.Math.Lemmas in\npow2_plus b c;\ndivision_multiplication_lemma a (pow2 b) (pow2 c)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.add_offset", "original_source_type": "val add_offset (#a: Type) (b: S.seq a) (i: nat) (p1 p2: S.seq a)\n : Lemma (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1 @| p2))\n (ensures\n (S.length S.(p1 @| p2) == S.length p1 + S.length p2 /\\\n S.slice b (i + S.length p1) (S.length b) == p2))", "source_type": "val add_offset (#a: Type) (b: S.seq a) (i: nat) (p1 p2: S.seq a)\n : Lemma (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1 @| p2))\n (ensures\n (S.length S.(p1 @| p2) == S.length p1 + S.length p2 /\\\n S.slice b (i + S.length p1) (S.length b) == p2))", "source_definition": "let add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 150, "start_col": 2, "end_line": 152, "end_col": 33 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: FStar.Seq.Base.seq a -> i: Prims.nat -> p1: FStar.Seq.Base.seq a -> p2: FStar.Seq.Base.seq a\n -> FStar.Pervasives.Lemma\n (requires\n i <= FStar.Seq.Base.length b /\\\n FStar.Seq.Base.slice b i (FStar.Seq.Base.length b) == p1 @| p2)\n (ensures\n FStar.Seq.Base.length (p1 @| p2) == FStar.Seq.Base.length p1 + FStar.Seq.Base.length p2 /\\\n FStar.Seq.Base.slice b (i + FStar.Seq.Base.length p1) (FStar.Seq.Base.length b) == p2)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.nat", "QUIC.Spec.Lemmas.compose_split", "FStar.Seq.Base.length", "Prims.unit", "QUIC.Spec.Lemmas.append_slices2", "Prims._assert", "Prims.b2t", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.op_At_Bar", "Prims.op_Addition", "Prims.l_and", "Prims.op_LessThanOrEqual", "Prims.eq2", "FStar.Seq.Base.slice", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val add_offset (#a: Type) (b: S.seq a) (i: nat) (p1 p2: S.seq a)\n : Lemma (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1 @| p2))\n (ensures\n (S.length S.(p1 @| p2) == S.length p1 + S.length p2 /\\\n S.slice b (i + S.length p1) (S.length b) == p2))\nlet add_offset (#a: Type) (b: S.seq a) (i: nat) (p1 p2: S.seq a)\n : Lemma (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1 @| p2))\n (ensures\n (S.length S.(p1 @| p2) == S.length p1 + S.length p2 /\\\n S.slice b (i + S.length p1) (S.length b) == p2)) =", "completed_definiton": "assert (S.length S.(p1 @| p2) = S.length p1 + S.length p2);\nappend_slices2 p1 p2;\ncompose_split b i (S.length p1)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.lemma_be_index_bytes", "original_source_type": "val lemma_be_index_bytes (l: pos) (b: bytes)\n : Lemma (requires S.length b >= l)\n (ensures\n FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l - 1)) =\n U8.v (S.index b 0))", "source_type": "val lemma_be_index_bytes (l: pos) (b: bytes)\n : Lemma (requires S.length b >= l)\n (ensures\n FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l - 1)) =\n U8.v (S.index b 0))", "source_definition": "let lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 102, "start_col": 2, "end_line": 106, "end_col": 35 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "l: Prims.pos -> b: QUIC.Spec.Base.bytes\n -> FStar.Pervasives.Lemma (requires FStar.Seq.Base.length b >= l)\n (ensures\n FStar.Endianness.be_to_n (FStar.Seq.Base.slice b 0 l) / Prims.pow2 (8 * (l - 1)) =\n FStar.UInt8.v (FStar.Seq.Base.index b 0))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.pos", "QUIC.Spec.Base.bytes", "FStar.Endianness.n_to_be_be_to_n", "FStar.Seq.Base.slice", "QUIC.Spec.Base.byte", "Prims.unit", "QUIC.Spec.Lemmas.lemma_be_index", "FStar.Endianness.lemma_be_to_n_is_bounded", "Prims.nat", "FStar.Endianness.be_to_n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "FStar.Seq.Base.length", "Prims.squash", "Prims.op_Equality", "Prims.int", "Prims.op_Division", "Prims.pow2", "Prims.op_Multiply", "Prims.op_Subtraction", "FStar.UInt8.v", "FStar.Seq.Base.index", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_be_index_bytes (l: pos) (b: bytes)\n : Lemma (requires S.length b >= l)\n (ensures\n FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l - 1)) =\n U8.v (S.index b 0))\nlet lemma_be_index_bytes (l: pos) (b: bytes)\n : Lemma (requires S.length b >= l)\n (ensures\n FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l - 1)) =\n U8.v (S.index b 0)) =", "completed_definiton": "let open FStar.Endianness in\nlet n = be_to_n (S.slice b 0 l) in\nlemma_be_to_n_is_bounded (S.slice b 0 l);\nlemma_be_index l n;\nn_to_be_be_to_n l (S.slice b 0 l)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.and_inplace_zero", "original_source_type": "val and_inplace_zero\n (a b: bytes)\n (phi: (i: nat{i < S.length b} -> Lemma (S.index b i == 0uy)))\n (i: nat{i < S.length a})\n : Lemma (requires (S.length b == S.length a)) (ensures (S.index (and_inplace a b 0) i == 0uy))", "source_type": "val and_inplace_zero\n (a b: bytes)\n (phi: (i: nat{i < S.length b} -> Lemma (S.index b i == 0uy)))\n (i: nat{i < S.length a})\n : Lemma (requires (S.length b == S.length a)) (ensures (S.index (and_inplace a b 0) i == 0uy))", "source_definition": "let and_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (i: nat {i < S.length a})\n: Lemma\n (requires (S.length b == S.length a))\n (ensures (S.index (and_inplace a b 0) i == 0uy))\n= pointwise_index2 U8.logand a b i 0;\n phi i;\n FStar.UInt.logand_lemma_1 (U8.v (S.index a i))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 542, "start_col": 2, "end_line": 544, "end_col": 48 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')\n\n#pop-options\n\nlet pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0\n ))\n= S.lemma_split a pos_split;\n pointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos\n\nlet pointwise_op_slice_other\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n (from to: nat)\n: Lemma\n (requires (\n S.length b2 + pos <= S.length b1 /\\\n from <= to /\\\n to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)\n ))\n (ensures (\n S.slice (pointwise_op f b1 b2 pos) from to `S.equal` S.slice b1 from to\n ))\n= let phi\n (i: nat { from <= i /\\ i < to })\n : Lemma\n (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i)\n = if to <= pos\n then pointwise_index1 f b1 b2 i pos\n else pointwise_index3 f b1 b2 i pos\n in\n Classical.forall_intro phi\n\n\n// application: byte-wise xor\nlet xor_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logxor b1 b2 pos\n\n\n// proof of involution of the operator (uses extensionality for the\n// byte-wise variant)\nlet xor_involutive (b1 b2:byte) : Lemma\n (requires True)\n (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1) =\n FStar.UInt.logxor_associative (U8.v b1) (U8.v b2) (U8.v b2);\n FStar.UInt.logxor_self (U8.v b2);\n FStar.UInt.logxor_commutative (FStar.UInt.zero 8) (U8.v b1);\n FStar.UInt.logxor_lemma_1 (U8.v b1)\n\n\nlet xor_inplace_involutive (b1 b2:bytes) (pos:nat) : Lemma\n (requires S.length b2 + pos <= S.length b1)\n (ensures S.equal (xor_inplace (xor_inplace b1 b2 pos) b2 pos) b1)\n (decreases (S.length b2)) =\n let xor = xor_inplace (xor_inplace b1 b2 pos) b2 pos in\n let step (i:nat{i < S.length b1}) : Lemma (S.index xor i = S.index b1 i) =\n if i < pos then begin\n pointwise_index1 U8.logxor b1 b2 i pos;\n pointwise_index1 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else if i >= pos+S.length b2 then begin\n pointwise_index3 U8.logxor b1 b2 i pos;\n pointwise_index3 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else begin\n pointwise_index2 U8.logxor b1 b2 i pos;\n pointwise_index2 U8.logxor (xor_inplace b1 b2 pos) b2 i pos;\n xor_involutive (S.index b1 i) (S.index b2 (i-pos))\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet xor_inplace_commutative (b b1 b2:bytes) (pos1 pos2:nat) : Lemma\n (requires\n S.length b1 + pos1 <= S.length b /\\\n S.length b2 + pos2 <= S.length b)\n (ensures S.equal\n (xor_inplace (xor_inplace b b1 pos1) b2 pos2)\n (xor_inplace (xor_inplace b b2 pos2) b1 pos1)) =\n let xor1 = xor_inplace (xor_inplace b b1 pos1) b2 pos2 in\n let xor2 = xor_inplace (xor_inplace b b2 pos2) b1 pos1 in\n let step (i:nat{i < S.length b}) : Lemma (S.index xor1 i = S.index xor2 i) =\n if i < pos1 then begin\n pointwise_index1 U8.logxor b b1 i pos1;\n pointwise_index1 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else if i >= pos1 + S.length b1 then begin\n pointwise_index3 U8.logxor b b1 i pos1;\n pointwise_index3 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else begin\n pointwise_index2 U8.logxor b b1 i pos1;\n pointwise_index2 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n let ind = U8.v (S.index b i) in\n let ind1 = U8.v (S.index b1 (i-pos1)) in\n let ind2 = U8.v (S.index b2 (i-pos2)) in\n FStar.UInt.logxor_associative #8 ind ind1 ind2;\n FStar.UInt.logxor_associative #8 ind ind2 ind1;\n FStar.UInt.logxor_commutative #8 ind1 ind2;\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end in\n\n FStar.Classical.forall_intro step\n\nlet xor_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (pos: nat)\n: Lemma\n (requires (pos + S.length b <= S.length a))\n (ensures (xor_inplace a b pos `S.equal` a))\n= let psi\n (i: nat {i < S.length a})\n : Lemma\n (S.index (xor_inplace a b pos) i == S.index a i)\n = if i < pos\n then pointwise_index1 U8.logxor a b i pos\n else if i >= pos + S.length b\n then pointwise_index3 U8.logxor a b i pos\n else begin\n pointwise_index2 U8.logxor a b i pos;\n phi (i - pos);\n FStar.UInt.logxor_lemma_1 (U8.v (S.index a i))\n end\n in\n Classical.forall_intro psi\n\nlet and_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logand b1 b2 pos\n\nlet and_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (i: nat {i < S.length a})\n: Lemma\n (requires (S.length b == S.length a))", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Base.bytes ->\n b: QUIC.Spec.Base.bytes ->\n phi:\n (i: Prims.nat{i < FStar.Seq.Base.length b}\n -> FStar.Pervasives.Lemma (ensures FStar.Seq.Base.index b i == 0uy)) ->\n i: Prims.nat{i < FStar.Seq.Base.length a}\n -> FStar.Pervasives.Lemma (requires FStar.Seq.Base.length b == FStar.Seq.Base.length a)\n (ensures FStar.Seq.Base.index (QUIC.Spec.Lemmas.and_inplace a b 0) i == 0uy)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bytes", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "FStar.UInt8.t", "FStar.Seq.Base.index", "FStar.UInt8.__uint_to_t", "Prims.Nil", "FStar.Pervasives.pattern", "FStar.UInt.logand_lemma_1", "FStar.UInt8.n", "FStar.UInt8.v", "QUIC.Spec.Lemmas.pointwise_index2", "FStar.UInt8.logand", "QUIC.Spec.Lemmas.and_inplace" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val and_inplace_zero\n (a b: bytes)\n (phi: (i: nat{i < S.length b} -> Lemma (S.index b i == 0uy)))\n (i: nat{i < S.length a})\n : Lemma (requires (S.length b == S.length a)) (ensures (S.index (and_inplace a b 0) i == 0uy))\nlet and_inplace_zero\n (a b: bytes)\n (phi: (i: nat{i < S.length b} -> Lemma (S.index b i == 0uy)))\n (i: nat{i < S.length a})\n : Lemma (requires (S.length b == S.length a)) (ensures (S.index (and_inplace a b 0) i == 0uy)) =", "completed_definiton": "pointwise_index2 U8.logand a b i 0;\nphi i;\nFStar.UInt.logand_lemma_1 (U8.v (S.index a i))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.pointwise_op", "original_source_type": "val pointwise_op (#a: Type0) (f: (a -> a -> a)) (b1 b2: S.seq a) (pos: nat)\n : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2))", "source_type": "val pointwise_op (#a: Type0) (f: (a -> a -> a)) (b1 b2: S.seq a) (pos: nat)\n : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2))", "source_definition": "let rec pointwise_op (#a:Type0) (f:a->a->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 182, "start_col": 2, "end_line": 186, "end_col": 74 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "f: (_: a -> _: a -> a) -> b1: FStar.Seq.Base.seq a -> b2: FStar.Seq.Base.seq a -> pos: Prims.nat\n -> Prims.Pure (FStar.Seq.Base.seq a)", "effect": "Prims.Pure", "effect_flags": [ "" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.nat", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "Prims.bool", "QUIC.Spec.Lemmas.pointwise_op", "FStar.Seq.Base.upd", "FStar.Seq.Base.slice", "Prims.op_Addition", "FStar.Seq.Base.index", "Prims.unit", "FStar.Seq.Base.lemma_empty", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.eq2" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val pointwise_op (#a: Type0) (f: (a -> a -> a)) (b1 b2: S.seq a) (pos: nat)\n : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2))\nlet rec pointwise_op (#a: Type0) (f: (a -> a -> a)) (b1 b2: S.seq a) (pos: nat)\n : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =", "completed_definiton": "if S.length b2 = 0\nthen b1\nelse\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.lemma_mod_pow2", "original_source_type": "val lemma_mod_pow2 (a b: nat)\n : Lemma (requires a >= b) (ensures pow2 a % pow2 b == 0) [SMTPat (pow2 a % pow2 b)]", "source_type": "val lemma_mod_pow2 (a b: nat)\n : Lemma (requires a >= b) (ensures pow2 a % pow2 b == 0) [SMTPat (pow2 a % pow2 b)]", "source_definition": "let lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 19, "start_col": 2, "end_line": 22, "end_col": 19 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Prims.nat -> b: Prims.nat\n -> FStar.Pervasives.Lemma (requires a >= b)\n (ensures Prims.pow2 a % Prims.pow2 b == 0)\n [SMTPat (Prims.pow2 a % Prims.pow2 b)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "FStar.Math.Lemmas.pow2_plus", "Prims.op_Subtraction", "Prims.unit", "FStar.Math.Lemmas.pow2_minus", "FStar.Math.Lemmas.lemma_div_mod", "Prims.pow2", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "Prims.squash", "Prims.eq2", "Prims.int", "Prims.op_Modulus", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_mod_pow2 (a b: nat)\n : Lemma (requires a >= b) (ensures pow2 a % pow2 b == 0) [SMTPat (pow2 a % pow2 b)]\nlet lemma_mod_pow2 (a b: nat)\n : Lemma (requires a >= b) (ensures pow2 a % pow2 b == 0) [SMTPat (pow2 a % pow2 b)] =", "completed_definiton": "let open FStar.Math.Lemmas in\nlemma_div_mod (pow2 a) (pow2 b);\npow2_minus a b;\npow2_plus b (a - b)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.pointwise_index", "original_source_type": "val pointwise_index (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (i pos: nat)\n : Lemma (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures\n (S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i ==\n (if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i - pos)))))", "source_type": "val pointwise_index (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (i pos: nat)\n : Lemma (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures\n (S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i ==\n (if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i - pos)))))", "source_definition": "let pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 250, "start_col": 2, "end_line": 254, "end_col": 37 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n f: (_: a -> _: a -> a) ->\n b1: FStar.Seq.Base.seq a ->\n b2: FStar.Seq.Base.seq a ->\n i: Prims.nat ->\n pos: Prims.nat\n -> FStar.Pervasives.Lemma\n (requires\n FStar.Seq.Base.length b2 + pos <= FStar.Seq.Base.length b1 /\\ i < FStar.Seq.Base.length b1)\n (ensures\n FStar.Seq.Base.length b2 + pos <= FStar.Seq.Base.length b1 /\\ i < FStar.Seq.Base.length b1 /\\\n FStar.Seq.Base.index (QUIC.Spec.Lemmas.pointwise_op f b1 b2 pos) i ==\n (match FStar.Seq.Base.length b2 + pos <= i || i < pos with\n | true -> FStar.Seq.Base.index b1 i\n | _ -> f (FStar.Seq.Base.index b1 i) (FStar.Seq.Base.index b2 (i - pos))))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.nat", "Prims.op_LessThan", "QUIC.Spec.Lemmas.pointwise_index1", "Prims.bool", "Prims.op_LessThanOrEqual", "Prims.op_Addition", "FStar.Seq.Base.length", "QUIC.Spec.Lemmas.pointwise_index3", "QUIC.Spec.Lemmas.pointwise_index2", "Prims.unit", "Prims.l_and", "Prims.b2t", "Prims.squash", "Prims.eq2", "FStar.Seq.Base.index", "QUIC.Spec.Lemmas.pointwise_op", "Prims.op_BarBar", "Prims.op_Subtraction", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val pointwise_index (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (i pos: nat)\n : Lemma (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures\n (S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i ==\n (if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i - pos)))))\nlet pointwise_index (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (i pos: nat)\n : Lemma (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures\n (S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i ==\n (if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i - pos))))) =", "completed_definiton": "if i < pos\nthen pointwise_index1 f b1 b2 i pos\nelse\n if S.length b2 + pos <= i then pointwise_index3 f b1 b2 i pos else pointwise_index2 f b1 b2 i pos", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.lemma_propagate_mul_mod", "original_source_type": "val lemma_propagate_mul_mod (a b: nat)\n : Lemma (requires b > 0) (ensures (let open FStar.Mul in (2 * a) % (2 * b) = 2 * (a % b)))", "source_type": "val lemma_propagate_mul_mod (a b: nat)\n : Lemma (requires b > 0) (ensures (let open FStar.Mul in (2 * a) % (2 * b) = 2 * (a % b)))", "source_definition": "let lemma_propagate_mul_mod (a b:nat) : Lemma\n (requires b > 0)\n (ensures (\n let open FStar.Mul in\n (2*a) % (2*b) = 2 * (a % b))) =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_div_mod a b;\n lemma_div_mod (2*a) b;\n let (p,r) = ((a/b)*(2*b), 2*(a%b)) in\n assert (2*a = p + r);\n modulo_distributivity p r (2*b);\n multiple_modulo_lemma (a/b) (2*b);\n modulo_range_lemma a b;\n small_mod r (2*b)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 608, "start_col": 2, "end_line": 617, "end_col": 19 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')\n\n#pop-options\n\nlet pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0\n ))\n= S.lemma_split a pos_split;\n pointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos\n\nlet pointwise_op_slice_other\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n (from to: nat)\n: Lemma\n (requires (\n S.length b2 + pos <= S.length b1 /\\\n from <= to /\\\n to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)\n ))\n (ensures (\n S.slice (pointwise_op f b1 b2 pos) from to `S.equal` S.slice b1 from to\n ))\n= let phi\n (i: nat { from <= i /\\ i < to })\n : Lemma\n (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i)\n = if to <= pos\n then pointwise_index1 f b1 b2 i pos\n else pointwise_index3 f b1 b2 i pos\n in\n Classical.forall_intro phi\n\n\n// application: byte-wise xor\nlet xor_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logxor b1 b2 pos\n\n\n// proof of involution of the operator (uses extensionality for the\n// byte-wise variant)\nlet xor_involutive (b1 b2:byte) : Lemma\n (requires True)\n (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1) =\n FStar.UInt.logxor_associative (U8.v b1) (U8.v b2) (U8.v b2);\n FStar.UInt.logxor_self (U8.v b2);\n FStar.UInt.logxor_commutative (FStar.UInt.zero 8) (U8.v b1);\n FStar.UInt.logxor_lemma_1 (U8.v b1)\n\n\nlet xor_inplace_involutive (b1 b2:bytes) (pos:nat) : Lemma\n (requires S.length b2 + pos <= S.length b1)\n (ensures S.equal (xor_inplace (xor_inplace b1 b2 pos) b2 pos) b1)\n (decreases (S.length b2)) =\n let xor = xor_inplace (xor_inplace b1 b2 pos) b2 pos in\n let step (i:nat{i < S.length b1}) : Lemma (S.index xor i = S.index b1 i) =\n if i < pos then begin\n pointwise_index1 U8.logxor b1 b2 i pos;\n pointwise_index1 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else if i >= pos+S.length b2 then begin\n pointwise_index3 U8.logxor b1 b2 i pos;\n pointwise_index3 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else begin\n pointwise_index2 U8.logxor b1 b2 i pos;\n pointwise_index2 U8.logxor (xor_inplace b1 b2 pos) b2 i pos;\n xor_involutive (S.index b1 i) (S.index b2 (i-pos))\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet xor_inplace_commutative (b b1 b2:bytes) (pos1 pos2:nat) : Lemma\n (requires\n S.length b1 + pos1 <= S.length b /\\\n S.length b2 + pos2 <= S.length b)\n (ensures S.equal\n (xor_inplace (xor_inplace b b1 pos1) b2 pos2)\n (xor_inplace (xor_inplace b b2 pos2) b1 pos1)) =\n let xor1 = xor_inplace (xor_inplace b b1 pos1) b2 pos2 in\n let xor2 = xor_inplace (xor_inplace b b2 pos2) b1 pos1 in\n let step (i:nat{i < S.length b}) : Lemma (S.index xor1 i = S.index xor2 i) =\n if i < pos1 then begin\n pointwise_index1 U8.logxor b b1 i pos1;\n pointwise_index1 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else if i >= pos1 + S.length b1 then begin\n pointwise_index3 U8.logxor b b1 i pos1;\n pointwise_index3 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else begin\n pointwise_index2 U8.logxor b b1 i pos1;\n pointwise_index2 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n let ind = U8.v (S.index b i) in\n let ind1 = U8.v (S.index b1 (i-pos1)) in\n let ind2 = U8.v (S.index b2 (i-pos2)) in\n FStar.UInt.logxor_associative #8 ind ind1 ind2;\n FStar.UInt.logxor_associative #8 ind ind2 ind1;\n FStar.UInt.logxor_commutative #8 ind1 ind2;\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end in\n\n FStar.Classical.forall_intro step\n\nlet xor_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (pos: nat)\n: Lemma\n (requires (pos + S.length b <= S.length a))\n (ensures (xor_inplace a b pos `S.equal` a))\n= let psi\n (i: nat {i < S.length a})\n : Lemma\n (S.index (xor_inplace a b pos) i == S.index a i)\n = if i < pos\n then pointwise_index1 U8.logxor a b i pos\n else if i >= pos + S.length b\n then pointwise_index3 U8.logxor a b i pos\n else begin\n pointwise_index2 U8.logxor a b i pos;\n phi (i - pos);\n FStar.UInt.logxor_lemma_1 (U8.v (S.index a i))\n end\n in\n Classical.forall_intro psi\n\nlet and_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logand b1 b2 pos\n\nlet and_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (i: nat {i < S.length a})\n: Lemma\n (requires (S.length b == S.length a))\n (ensures (S.index (and_inplace a b 0) i == 0uy))\n= pointwise_index2 U8.logand a b i 0;\n phi i;\n FStar.UInt.logand_lemma_1 (U8.v (S.index a i))\n\nlet rec bitwise_op (f:bool->bool->bool) (l1 l2:list bool) : Pure (list bool)\n (requires List.Tot.length l1 = List.Tot.length l2)\n (ensures fun l -> List.Tot.length l = List.Tot.length l1) =\n match l1,l2 with\n | [],[] -> []\n | x1::t1,x2::t2 -> f x1 x2 :: bitwise_op f t1 t2\n\n\nlet rec lemma_bitwise_op_index (f:bool->bool->bool) (l1 l2:list bool) (n:nat) : Lemma\n (requires List.Tot.length l1 = List.Tot.length l2 /\\ n < List.Tot.length l1)\n (ensures List.Tot.index (bitwise_op f l1 l2) n = f (List.Tot.index l1 n) (List.Tot.index l2 n)) =\n match l1,l2 with\n | [],[] -> ()\n | x1::t1,x2::t2 ->\n if n = 0 then ()\n else lemma_bitwise_op_index f t1 t2 (n-1)\n\nlet rec list_to_seq (#a:Type) (l:list a) : (s:(S.seq a){S.length s = List.Tot.length l /\\ (forall i. S.index s i == List.Tot.index l i)}) =\n match l with\n | [] -> S.empty\n | h :: t -> S.(create 1 h @| list_to_seq t)\n\nlet rec rev_seq (#a:Type) (s:S.seq a) : Pure (S.seq a)\n (requires True)\n (ensures fun s' -> S.length s = S.length s')\n (decreases (S.length s)) =\n if S.length s = 0 then S.empty\n else\n let _ = S.lemma_empty s in\n S.(rev_seq S.(slice s 1 (length s)) @| create 1 (index s 0))\n\n\nlet rec lemma_rev_seq (#a:Type) (s:S.seq a) (i:nat) : Lemma\n (requires i < S.length s)\n (ensures\n S.length (rev_seq s) = S.length s /\\\n S.index s i == S.index (rev_seq s) (S.length s-1-i))\n (decreases (i))=\n if S.length s = 0 then ()\n else if i = 0 then ()\n else lemma_rev_seq (S.slice s 1 (S.length s)) (i-1)\n\n#restart-solver\n\nlet lemma_arithmetic1 (a b c d e:int) : Lemma\n ((a+b+c+d)+(e-d) = (a+c+e)+b) =\n ()\n\nlet lemma_arithmetic2 (a b c d:int) : Lemma\n (a+(b-c)+d = a + ((b+d)-c)) =\n ()\n\nlet lemma_arithmetic3 (a b c:int) : Lemma\n ((a+b)-c = (a-c)+b) =\n ()\n\n\nlet lemma_propagate_mul_mod (a b:nat) : Lemma\n (requires b > 0)\n (ensures (\n let open FStar.Mul in", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Prims.nat -> b: Prims.nat\n -> FStar.Pervasives.Lemma (requires b > 0) (ensures 2 * a % (2 * b) = 2 * (a % b))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.int", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "FStar.Math.Lemmas.small_mod", "FStar.Mul.op_Star", "Prims.unit", "FStar.Math.Lemmas.modulo_range_lemma", "FStar.Math.Lemmas.multiple_modulo_lemma", "Prims.op_Division", "FStar.Math.Lemmas.modulo_distributivity", "Prims._assert", "Prims.op_Equality", "Prims.op_Addition", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.Mktuple2", "Prims.op_Modulus", "FStar.Math.Lemmas.lemma_div_mod", "Prims.op_GreaterThan", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_propagate_mul_mod (a b: nat)\n : Lemma (requires b > 0) (ensures (let open FStar.Mul in (2 * a) % (2 * b) = 2 * (a % b)))\nlet lemma_propagate_mul_mod (a b: nat)\n : Lemma (requires b > 0) (ensures (let open FStar.Mul in (2 * a) % (2 * b) = 2 * (a % b))) =", "completed_definiton": "let open FStar.Math.Lemmas in\nlet open FStar.Mul in\nlemma_div_mod a b;\nlemma_div_mod (2 * a) b;\nlet p, r = ((a / b) * (2 * b), 2 * (a % b)) in\nassert (2 * a = p + r);\nmodulo_distributivity p r (2 * b);\nmultiple_modulo_lemma (a / b) (2 * b);\nmodulo_range_lemma a b;\nsmall_mod r (2 * b)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.xor_inplace_zero", "original_source_type": "val xor_inplace_zero\n (a b: bytes)\n (phi: (i: nat{i < S.length b} -> Lemma (S.index b i == 0uy)))\n (pos: nat)\n : Lemma (requires (pos + S.length b <= S.length a))\n (ensures ((xor_inplace a b pos) `S.equal` a))", "source_type": "val xor_inplace_zero\n (a b: bytes)\n (phi: (i: nat{i < S.length b} -> Lemma (S.index b i == 0uy)))\n (pos: nat)\n : Lemma (requires (pos + S.length b <= S.length a))\n (ensures ((xor_inplace a b pos) `S.equal` a))", "source_definition": "let xor_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (pos: nat)\n: Lemma\n (requires (pos + S.length b <= S.length a))\n (ensures (xor_inplace a b pos `S.equal` a))\n= let psi\n (i: nat {i < S.length a})\n : Lemma\n (S.index (xor_inplace a b pos) i == S.index a i)\n = if i < pos\n then pointwise_index1 U8.logxor a b i pos\n else if i >= pos + S.length b\n then pointwise_index3 U8.logxor a b i pos\n else begin\n pointwise_index2 U8.logxor a b i pos;\n phi (i - pos);\n FStar.UInt.logxor_lemma_1 (U8.v (S.index a i))\n end\n in\n Classical.forall_intro psi", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 512, "start_col": 1, "end_line": 526, "end_col": 28 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')\n\n#pop-options\n\nlet pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0\n ))\n= S.lemma_split a pos_split;\n pointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos\n\nlet pointwise_op_slice_other\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n (from to: nat)\n: Lemma\n (requires (\n S.length b2 + pos <= S.length b1 /\\\n from <= to /\\\n to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)\n ))\n (ensures (\n S.slice (pointwise_op f b1 b2 pos) from to `S.equal` S.slice b1 from to\n ))\n= let phi\n (i: nat { from <= i /\\ i < to })\n : Lemma\n (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i)\n = if to <= pos\n then pointwise_index1 f b1 b2 i pos\n else pointwise_index3 f b1 b2 i pos\n in\n Classical.forall_intro phi\n\n\n// application: byte-wise xor\nlet xor_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logxor b1 b2 pos\n\n\n// proof of involution of the operator (uses extensionality for the\n// byte-wise variant)\nlet xor_involutive (b1 b2:byte) : Lemma\n (requires True)\n (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1) =\n FStar.UInt.logxor_associative (U8.v b1) (U8.v b2) (U8.v b2);\n FStar.UInt.logxor_self (U8.v b2);\n FStar.UInt.logxor_commutative (FStar.UInt.zero 8) (U8.v b1);\n FStar.UInt.logxor_lemma_1 (U8.v b1)\n\n\nlet xor_inplace_involutive (b1 b2:bytes) (pos:nat) : Lemma\n (requires S.length b2 + pos <= S.length b1)\n (ensures S.equal (xor_inplace (xor_inplace b1 b2 pos) b2 pos) b1)\n (decreases (S.length b2)) =\n let xor = xor_inplace (xor_inplace b1 b2 pos) b2 pos in\n let step (i:nat{i < S.length b1}) : Lemma (S.index xor i = S.index b1 i) =\n if i < pos then begin\n pointwise_index1 U8.logxor b1 b2 i pos;\n pointwise_index1 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else if i >= pos+S.length b2 then begin\n pointwise_index3 U8.logxor b1 b2 i pos;\n pointwise_index3 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else begin\n pointwise_index2 U8.logxor b1 b2 i pos;\n pointwise_index2 U8.logxor (xor_inplace b1 b2 pos) b2 i pos;\n xor_involutive (S.index b1 i) (S.index b2 (i-pos))\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet xor_inplace_commutative (b b1 b2:bytes) (pos1 pos2:nat) : Lemma\n (requires\n S.length b1 + pos1 <= S.length b /\\\n S.length b2 + pos2 <= S.length b)\n (ensures S.equal\n (xor_inplace (xor_inplace b b1 pos1) b2 pos2)\n (xor_inplace (xor_inplace b b2 pos2) b1 pos1)) =\n let xor1 = xor_inplace (xor_inplace b b1 pos1) b2 pos2 in\n let xor2 = xor_inplace (xor_inplace b b2 pos2) b1 pos1 in\n let step (i:nat{i < S.length b}) : Lemma (S.index xor1 i = S.index xor2 i) =\n if i < pos1 then begin\n pointwise_index1 U8.logxor b b1 i pos1;\n pointwise_index1 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else if i >= pos1 + S.length b1 then begin\n pointwise_index3 U8.logxor b b1 i pos1;\n pointwise_index3 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else begin\n pointwise_index2 U8.logxor b b1 i pos1;\n pointwise_index2 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n let ind = U8.v (S.index b i) in\n let ind1 = U8.v (S.index b1 (i-pos1)) in\n let ind2 = U8.v (S.index b2 (i-pos2)) in\n FStar.UInt.logxor_associative #8 ind ind1 ind2;\n FStar.UInt.logxor_associative #8 ind ind2 ind1;\n FStar.UInt.logxor_commutative #8 ind1 ind2;\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end in\n\n FStar.Classical.forall_intro step\n\nlet xor_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (pos: nat)\n: Lemma\n (requires (pos + S.length b <= S.length a))", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Base.bytes ->\n b: QUIC.Spec.Base.bytes ->\n phi:\n (i: Prims.nat{i < FStar.Seq.Base.length b}\n -> FStar.Pervasives.Lemma (ensures FStar.Seq.Base.index b i == 0uy)) ->\n pos: Prims.nat\n -> FStar.Pervasives.Lemma (requires pos + FStar.Seq.Base.length b <= FStar.Seq.Base.length a)\n (ensures FStar.Seq.Base.equal (QUIC.Spec.Lemmas.xor_inplace a b pos) a)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bytes", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "FStar.UInt8.t", "FStar.Seq.Base.index", "FStar.UInt8.__uint_to_t", "Prims.Nil", "FStar.Pervasives.pattern", "FStar.Classical.forall_intro", "QUIC.Spec.Lemmas.xor_inplace", "QUIC.Spec.Lemmas.pointwise_index1", "FStar.UInt8.logxor", "Prims.bool", "Prims.op_GreaterThanOrEqual", "Prims.op_Addition", "QUIC.Spec.Lemmas.pointwise_index3", "FStar.UInt.logxor_lemma_1", "FStar.UInt8.n", "FStar.UInt8.v", "Prims.op_Subtraction", "QUIC.Spec.Lemmas.pointwise_index2", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.equal" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val xor_inplace_zero\n (a b: bytes)\n (phi: (i: nat{i < S.length b} -> Lemma (S.index b i == 0uy)))\n (pos: nat)\n : Lemma (requires (pos + S.length b <= S.length a))\n (ensures ((xor_inplace a b pos) `S.equal` a))\nlet xor_inplace_zero\n (a b: bytes)\n (phi: (i: nat{i < S.length b} -> Lemma (S.index b i == 0uy)))\n (pos: nat)\n : Lemma (requires (pos + S.length b <= S.length a))\n (ensures ((xor_inplace a b pos) `S.equal` a)) =", "completed_definiton": "let psi (i: nat{i < S.length a}) : Lemma (S.index (xor_inplace a b pos) i == S.index a i) =\n if i < pos\n then pointwise_index1 U8.logxor a b i pos\n else\n if i >= pos + S.length b\n then pointwise_index3 U8.logxor a b i pos\n else\n (pointwise_index2 U8.logxor a b i pos;\n phi (i - pos);\n FStar.UInt.logxor_lemma_1 (U8.v (S.index a i)))\nin\nClassical.forall_intro psi", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.lemma_pow2_div", "original_source_type": "val lemma_pow2_div (a b k: nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))", "source_type": "val lemma_pow2_div (a b k: nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))", "source_definition": "let lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 48, "start_col": 2, "end_line": 53, "end_col": 16 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Prims.nat -> b: Prims.nat -> k: Prims.nat\n -> FStar.Pervasives.Lemma (requires a >= k /\\ b >= k)\n (ensures\n (Prims.pow2 a + Prims.pow2 b) / Prims.pow2 k == Prims.pow2 (a - k) + Prims.pow2 (b - k))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "FStar.Math.Lemmas.pow2_minus", "Prims.unit", "FStar.Math.Lemmas.division_addition_lemma", "Prims.pow2", "Prims.op_Subtraction", "FStar.Math.Lemmas.pow2_plus", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "Prims.squash", "Prims.eq2", "Prims.int", "Prims.op_Division", "Prims.op_Addition", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_pow2_div (a b k: nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\nlet lemma_pow2_div (a b k: nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k)) =", "completed_definiton": "let open FStar.Math.Lemmas in\nlet open FStar.Mul in\npow2_plus k (b - k);\ndivision_addition_lemma (pow2 a) (pow2 k) (pow2 (b - k));\npow2_minus b k;\npow2_minus a k", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.lemma_divrem2", "original_source_type": "val lemma_divrem2 (k a n: nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))", "source_type": "val lemma_divrem2 (k a n: nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))", "source_definition": "let lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 30, "start_col": 2, "end_line": 35, "end_col": 16 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "k: Prims.nat -> a: Prims.nat -> n: Prims.nat\n -> FStar.Pervasives.Lemma (requires a >= k /\\ n < Prims.pow2 k)\n (ensures\n (Prims.pow2 a + n) % Prims.pow2 k == n /\\\n (Prims.pow2 a + n) / Prims.pow2 k == Prims.pow2 (a - k))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "FStar.Math.Lemmas.pow2_minus", "Prims.unit", "FStar.Math.Lemmas.lemma_div_mod", "Prims.op_Addition", "Prims.pow2", "FStar.Math.Lemmas.small_mod", "FStar.Math.Lemmas.modulo_distributivity", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "Prims.op_LessThan", "Prims.squash", "Prims.eq2", "Prims.int", "Prims.op_Modulus", "Prims.op_Division", "Prims.op_Subtraction", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_divrem2 (k a n: nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\nlet lemma_divrem2 (k a n: nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k))) =", "completed_definiton": "let open FStar.Math.Lemmas in\nlet open FStar.Mul in\nmodulo_distributivity (pow2 a) n (pow2 k);\nsmall_mod n (pow2 k);\nlemma_div_mod (pow2 a + n) (pow2 k);\npow2_minus a k", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.xor_inplace_involutive", "original_source_type": "val xor_inplace_involutive (b1 b2: bytes) (pos: nat)\n : Lemma (requires S.length b2 + pos <= S.length b1)\n (ensures S.equal (xor_inplace (xor_inplace b1 b2 pos) b2 pos) b1)\n (decreases (S.length b2))", "source_type": "val xor_inplace_involutive (b1 b2: bytes) (pos: nat)\n : Lemma (requires S.length b2 + pos <= S.length b1)\n (ensures S.equal (xor_inplace (xor_inplace b1 b2 pos) b2 pos) b1)\n (decreases (S.length b2))", "source_definition": "let xor_inplace_involutive (b1 b2:bytes) (pos:nat) : Lemma\n (requires S.length b2 + pos <= S.length b1)\n (ensures S.equal (xor_inplace (xor_inplace b1 b2 pos) b2 pos) b1)\n (decreases (S.length b2)) =\n let xor = xor_inplace (xor_inplace b1 b2 pos) b2 pos in\n let step (i:nat{i < S.length b1}) : Lemma (S.index xor i = S.index b1 i) =\n if i < pos then begin\n pointwise_index1 U8.logxor b1 b2 i pos;\n pointwise_index1 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else if i >= pos+S.length b2 then begin\n pointwise_index3 U8.logxor b1 b2 i pos;\n pointwise_index3 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else begin\n pointwise_index2 U8.logxor b1 b2 i pos;\n pointwise_index2 U8.logxor (xor_inplace b1 b2 pos) b2 i pos;\n xor_involutive (S.index b1 i) (S.index b2 (i-pos))\n end in\n\n FStar.Classical.forall_intro step", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 428, "start_col": 29, "end_line": 443, "end_col": 35 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')\n\n#pop-options\n\nlet pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0\n ))\n= S.lemma_split a pos_split;\n pointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos\n\nlet pointwise_op_slice_other\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n (from to: nat)\n: Lemma\n (requires (\n S.length b2 + pos <= S.length b1 /\\\n from <= to /\\\n to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)\n ))\n (ensures (\n S.slice (pointwise_op f b1 b2 pos) from to `S.equal` S.slice b1 from to\n ))\n= let phi\n (i: nat { from <= i /\\ i < to })\n : Lemma\n (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i)\n = if to <= pos\n then pointwise_index1 f b1 b2 i pos\n else pointwise_index3 f b1 b2 i pos\n in\n Classical.forall_intro phi\n\n\n// application: byte-wise xor\nlet xor_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logxor b1 b2 pos\n\n\n// proof of involution of the operator (uses extensionality for the\n// byte-wise variant)\nlet xor_involutive (b1 b2:byte) : Lemma\n (requires True)\n (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1) =\n FStar.UInt.logxor_associative (U8.v b1) (U8.v b2) (U8.v b2);\n FStar.UInt.logxor_self (U8.v b2);\n FStar.UInt.logxor_commutative (FStar.UInt.zero 8) (U8.v b1);\n FStar.UInt.logxor_lemma_1 (U8.v b1)\n\n\nlet xor_inplace_involutive (b1 b2:bytes) (pos:nat) : Lemma\n (requires S.length b2 + pos <= S.length b1)", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b1: QUIC.Spec.Base.bytes -> b2: QUIC.Spec.Base.bytes -> pos: Prims.nat\n -> FStar.Pervasives.Lemma (requires FStar.Seq.Base.length b2 + pos <= FStar.Seq.Base.length b1)\n (ensures\n FStar.Seq.Base.equal (QUIC.Spec.Lemmas.xor_inplace (QUIC.Spec.Lemmas.xor_inplace b1 b2 pos)\n b2\n pos)\n b1)\n (decreases FStar.Seq.Base.length b2)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma", "" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bytes", "Prims.nat", "FStar.Classical.forall_intro", "Prims.b2t", "Prims.op_LessThan", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "Prims.op_Equality", "FStar.Seq.Base.index", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern", "QUIC.Spec.Lemmas.pointwise_index1", "FStar.UInt8.logxor", "QUIC.Spec.Lemmas.xor_inplace", "Prims.bool", "Prims.op_GreaterThanOrEqual", "Prims.op_Addition", "QUIC.Spec.Lemmas.pointwise_index3", "QUIC.Spec.Lemmas.xor_involutive", "Prims.op_Subtraction", "QUIC.Spec.Lemmas.pointwise_index2", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.equal" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val xor_inplace_involutive (b1 b2: bytes) (pos: nat)\n : Lemma (requires S.length b2 + pos <= S.length b1)\n (ensures S.equal (xor_inplace (xor_inplace b1 b2 pos) b2 pos) b1)\n (decreases (S.length b2))\nlet xor_inplace_involutive (b1 b2: bytes) (pos: nat)\n : Lemma (requires S.length b2 + pos <= S.length b1)\n (ensures S.equal (xor_inplace (xor_inplace b1 b2 pos) b2 pos) b1)\n (decreases (S.length b2)) =", "completed_definiton": "let xor = xor_inplace (xor_inplace b1 b2 pos) b2 pos in\nlet step (i: nat{i < S.length b1}) : Lemma (S.index xor i = S.index b1 i) =\n if i < pos\n then\n (pointwise_index1 U8.logxor b1 b2 i pos;\n pointwise_index1 U8.logxor (xor_inplace b1 b2 pos) b2 i pos)\n else\n if i >= pos + S.length b2\n then\n (pointwise_index3 U8.logxor b1 b2 i pos;\n pointwise_index3 U8.logxor (xor_inplace b1 b2 pos) b2 i pos)\n else\n (pointwise_index2 U8.logxor b1 b2 i pos;\n pointwise_index2 U8.logxor (xor_inplace b1 b2 pos) b2 i pos;\n xor_involutive (S.index b1 i) (S.index b2 (i - pos)))\nin\nFStar.Classical.forall_intro step", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.lemma_div_sub_small", "original_source_type": "val lemma_div_sub_small (l n x: nat)\n : Lemma (requires l > 1)\n (ensures\n (n - n % pow2 8) / pow2 (8 `op_Multiply` (l - 1)) == n / pow2 (8 `op_Multiply` (l - 1)))", "source_type": "val lemma_div_sub_small (l n x: nat)\n : Lemma (requires l > 1)\n (ensures\n (n - n % pow2 8) / pow2 (8 `op_Multiply` (l - 1)) == n / pow2 (8 `op_Multiply` (l - 1)))", "source_definition": "let lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 68, "start_col": 2, "end_line": 72, "end_col": 46 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "l: Prims.nat -> n: Prims.nat -> x: Prims.nat\n -> FStar.Pervasives.Lemma (requires l > 1)\n (ensures (n - n % Prims.pow2 8) / Prims.pow2 (8 * (l - 1)) == n / Prims.pow2 (8 * (l - 1)))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "QUIC.Spec.Lemmas.lemma_pow2_div2", "Prims.op_Subtraction", "Prims.op_Modulus", "Prims.pow2", "FStar.Mul.op_Star", "Prims.unit", "FStar.Math.Lemmas.lemma_mod_spec", "Prims.b2t", "Prims.op_GreaterThan", "Prims.squash", "Prims.eq2", "Prims.int", "Prims.op_Division", "Prims.op_Multiply", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_div_sub_small (l n x: nat)\n : Lemma (requires l > 1)\n (ensures\n (n - n % pow2 8) / pow2 (8 `op_Multiply` (l - 1)) == n / pow2 (8 `op_Multiply` (l - 1)))\nlet lemma_div_sub_small (l n x: nat)\n : Lemma (requires l > 1)\n (ensures\n (n - n % pow2 8) / pow2 (8 `op_Multiply` (l - 1)) == n / pow2 (8 `op_Multiply` (l - 1))) =", "completed_definiton": "let open FStar.Math.Lemmas in\nlet open FStar.Mul in\nlemma_mod_spec n (pow2 8);\nlemma_pow2_div2 n 8 (8 * (l - 2));\nlemma_pow2_div2 (n - n % pow2 8) 8 (8 * (l - 2))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.lemma_modulo_shift_byte", "original_source_type": "val lemma_modulo_shift_byte (a: nat) (i: pos)\n : Lemma\n (let open FStar.Mul in (pow2 8 * a) % (pow2 (8 * i)) = pow2 8 * (a % pow2 (8 * (i - 1))))", "source_type": "val lemma_modulo_shift_byte (a: nat) (i: pos)\n : Lemma\n (let open FStar.Mul in (pow2 8 * a) % (pow2 (8 * i)) = pow2 8 * (a % pow2 (8 * (i - 1))))", "source_definition": "let lemma_modulo_shift_byte (a:nat) (i:pos) : Lemma\n (let open FStar.Mul in\n (pow2 8 * a) % (pow2 (8*i)) = pow2 8 * (a % pow2 (8*(i-1)))) =\n let sub = 8 `op_Multiply` (i-1) in\n FStar.Math.Lemmas.pow2_plus 8 sub;\n lemma_propagate_pow_mod a (pow2 sub) 8", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 648, "start_col": 64, "end_line": 651, "end_col": 40 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')\n\n#pop-options\n\nlet pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0\n ))\n= S.lemma_split a pos_split;\n pointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos\n\nlet pointwise_op_slice_other\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n (from to: nat)\n: Lemma\n (requires (\n S.length b2 + pos <= S.length b1 /\\\n from <= to /\\\n to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)\n ))\n (ensures (\n S.slice (pointwise_op f b1 b2 pos) from to `S.equal` S.slice b1 from to\n ))\n= let phi\n (i: nat { from <= i /\\ i < to })\n : Lemma\n (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i)\n = if to <= pos\n then pointwise_index1 f b1 b2 i pos\n else pointwise_index3 f b1 b2 i pos\n in\n Classical.forall_intro phi\n\n\n// application: byte-wise xor\nlet xor_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logxor b1 b2 pos\n\n\n// proof of involution of the operator (uses extensionality for the\n// byte-wise variant)\nlet xor_involutive (b1 b2:byte) : Lemma\n (requires True)\n (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1) =\n FStar.UInt.logxor_associative (U8.v b1) (U8.v b2) (U8.v b2);\n FStar.UInt.logxor_self (U8.v b2);\n FStar.UInt.logxor_commutative (FStar.UInt.zero 8) (U8.v b1);\n FStar.UInt.logxor_lemma_1 (U8.v b1)\n\n\nlet xor_inplace_involutive (b1 b2:bytes) (pos:nat) : Lemma\n (requires S.length b2 + pos <= S.length b1)\n (ensures S.equal (xor_inplace (xor_inplace b1 b2 pos) b2 pos) b1)\n (decreases (S.length b2)) =\n let xor = xor_inplace (xor_inplace b1 b2 pos) b2 pos in\n let step (i:nat{i < S.length b1}) : Lemma (S.index xor i = S.index b1 i) =\n if i < pos then begin\n pointwise_index1 U8.logxor b1 b2 i pos;\n pointwise_index1 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else if i >= pos+S.length b2 then begin\n pointwise_index3 U8.logxor b1 b2 i pos;\n pointwise_index3 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else begin\n pointwise_index2 U8.logxor b1 b2 i pos;\n pointwise_index2 U8.logxor (xor_inplace b1 b2 pos) b2 i pos;\n xor_involutive (S.index b1 i) (S.index b2 (i-pos))\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet xor_inplace_commutative (b b1 b2:bytes) (pos1 pos2:nat) : Lemma\n (requires\n S.length b1 + pos1 <= S.length b /\\\n S.length b2 + pos2 <= S.length b)\n (ensures S.equal\n (xor_inplace (xor_inplace b b1 pos1) b2 pos2)\n (xor_inplace (xor_inplace b b2 pos2) b1 pos1)) =\n let xor1 = xor_inplace (xor_inplace b b1 pos1) b2 pos2 in\n let xor2 = xor_inplace (xor_inplace b b2 pos2) b1 pos1 in\n let step (i:nat{i < S.length b}) : Lemma (S.index xor1 i = S.index xor2 i) =\n if i < pos1 then begin\n pointwise_index1 U8.logxor b b1 i pos1;\n pointwise_index1 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else if i >= pos1 + S.length b1 then begin\n pointwise_index3 U8.logxor b b1 i pos1;\n pointwise_index3 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else begin\n pointwise_index2 U8.logxor b b1 i pos1;\n pointwise_index2 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n let ind = U8.v (S.index b i) in\n let ind1 = U8.v (S.index b1 (i-pos1)) in\n let ind2 = U8.v (S.index b2 (i-pos2)) in\n FStar.UInt.logxor_associative #8 ind ind1 ind2;\n FStar.UInt.logxor_associative #8 ind ind2 ind1;\n FStar.UInt.logxor_commutative #8 ind1 ind2;\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end in\n\n FStar.Classical.forall_intro step\n\nlet xor_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (pos: nat)\n: Lemma\n (requires (pos + S.length b <= S.length a))\n (ensures (xor_inplace a b pos `S.equal` a))\n= let psi\n (i: nat {i < S.length a})\n : Lemma\n (S.index (xor_inplace a b pos) i == S.index a i)\n = if i < pos\n then pointwise_index1 U8.logxor a b i pos\n else if i >= pos + S.length b\n then pointwise_index3 U8.logxor a b i pos\n else begin\n pointwise_index2 U8.logxor a b i pos;\n phi (i - pos);\n FStar.UInt.logxor_lemma_1 (U8.v (S.index a i))\n end\n in\n Classical.forall_intro psi\n\nlet and_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logand b1 b2 pos\n\nlet and_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (i: nat {i < S.length a})\n: Lemma\n (requires (S.length b == S.length a))\n (ensures (S.index (and_inplace a b 0) i == 0uy))\n= pointwise_index2 U8.logand a b i 0;\n phi i;\n FStar.UInt.logand_lemma_1 (U8.v (S.index a i))\n\nlet rec bitwise_op (f:bool->bool->bool) (l1 l2:list bool) : Pure (list bool)\n (requires List.Tot.length l1 = List.Tot.length l2)\n (ensures fun l -> List.Tot.length l = List.Tot.length l1) =\n match l1,l2 with\n | [],[] -> []\n | x1::t1,x2::t2 -> f x1 x2 :: bitwise_op f t1 t2\n\n\nlet rec lemma_bitwise_op_index (f:bool->bool->bool) (l1 l2:list bool) (n:nat) : Lemma\n (requires List.Tot.length l1 = List.Tot.length l2 /\\ n < List.Tot.length l1)\n (ensures List.Tot.index (bitwise_op f l1 l2) n = f (List.Tot.index l1 n) (List.Tot.index l2 n)) =\n match l1,l2 with\n | [],[] -> ()\n | x1::t1,x2::t2 ->\n if n = 0 then ()\n else lemma_bitwise_op_index f t1 t2 (n-1)\n\nlet rec list_to_seq (#a:Type) (l:list a) : (s:(S.seq a){S.length s = List.Tot.length l /\\ (forall i. S.index s i == List.Tot.index l i)}) =\n match l with\n | [] -> S.empty\n | h :: t -> S.(create 1 h @| list_to_seq t)\n\nlet rec rev_seq (#a:Type) (s:S.seq a) : Pure (S.seq a)\n (requires True)\n (ensures fun s' -> S.length s = S.length s')\n (decreases (S.length s)) =\n if S.length s = 0 then S.empty\n else\n let _ = S.lemma_empty s in\n S.(rev_seq S.(slice s 1 (length s)) @| create 1 (index s 0))\n\n\nlet rec lemma_rev_seq (#a:Type) (s:S.seq a) (i:nat) : Lemma\n (requires i < S.length s)\n (ensures\n S.length (rev_seq s) = S.length s /\\\n S.index s i == S.index (rev_seq s) (S.length s-1-i))\n (decreases (i))=\n if S.length s = 0 then ()\n else if i = 0 then ()\n else lemma_rev_seq (S.slice s 1 (S.length s)) (i-1)\n\n#restart-solver\n\nlet lemma_arithmetic1 (a b c d e:int) : Lemma\n ((a+b+c+d)+(e-d) = (a+c+e)+b) =\n ()\n\nlet lemma_arithmetic2 (a b c d:int) : Lemma\n (a+(b-c)+d = a + ((b+d)-c)) =\n ()\n\nlet lemma_arithmetic3 (a b c:int) : Lemma\n ((a+b)-c = (a-c)+b) =\n ()\n\n\nlet lemma_propagate_mul_mod (a b:nat) : Lemma\n (requires b > 0)\n (ensures (\n let open FStar.Mul in\n (2*a) % (2*b) = 2 * (a % b))) =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_div_mod a b;\n lemma_div_mod (2*a) b;\n let (p,r) = ((a/b)*(2*b), 2*(a%b)) in\n assert (2*a = p + r);\n modulo_distributivity p r (2*b);\n multiple_modulo_lemma (a/b) (2*b);\n modulo_range_lemma a b;\n small_mod r (2*b)\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1 --z3rlimit 256\" // strange that F* has so much trouble completing this induction\nlet recompose_pow2_assoc (n:pos) (a:nat) : Lemma\n (let open FStar.Mul in 2 * (pow2 (n-1) * a) = pow2 n * a) =\n ()\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1 --z3rlimit 512\" // strange that F* has so much trouble completing this induction\nlet rec lemma_propagate_pow_mod (a b n:nat) : Lemma\n (requires b > 0)\n (ensures (\n let open FStar.Mul in\n (pow2 n * a) % (pow2 n * b) = pow2 n * (a % b))) =\n let open FStar.Mul in\n let open FStar.Math.Lemmas in\n if n = 0 then ()\n else begin\n let res = (pow2 n * a) % (pow2 n * b) in\n lemma_propagate_mul_mod (pow2 (n-1) * a) (pow2 (n-1) * b);\n assert (res = 2 * ((pow2 (n-1) * a) % (pow2 (n-1) * b)));\n lemma_propagate_pow_mod a b (n-1);\n assert (res = 2 * (pow2 (n-1) * (a%b)));\n recompose_pow2_assoc n (a%b)\n end\n#pop-options\n\n\n#restart-solver\nlet lemma_modulo_shift_byte (a:nat) (i:pos) : Lemma", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Prims.nat -> i: Prims.pos\n -> FStar.Pervasives.Lemma\n (ensures Prims.pow2 8 * a % Prims.pow2 (8 * i) = Prims.pow2 8 * (a % Prims.pow2 (8 * (i - 1))))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.pos", "QUIC.Spec.Lemmas.lemma_propagate_pow_mod", "Prims.pow2", "Prims.unit", "FStar.Math.Lemmas.pow2_plus", "Prims.int", "Prims.op_Multiply", "Prims.op_Subtraction", "Prims.l_True", "Prims.squash", "Prims.b2t", "Prims.op_Equality", "Prims.op_Modulus", "FStar.Mul.op_Star", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_modulo_shift_byte (a: nat) (i: pos)\n : Lemma\n (let open FStar.Mul in (pow2 8 * a) % (pow2 (8 * i)) = pow2 8 * (a % pow2 (8 * (i - 1))))\nlet lemma_modulo_shift_byte (a: nat) (i: pos)\n : Lemma\n (let open FStar.Mul in (pow2 8 * a) % (pow2 (8 * i)) = pow2 8 * (a % pow2 (8 * (i - 1)))) =", "completed_definiton": "let sub = 8 `op_Multiply` (i - 1) in\nFStar.Math.Lemmas.pow2_plus 8 sub;\nlemma_propagate_pow_mod a (pow2 sub) 8", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.pointwise_index1", "original_source_type": "val pointwise_index1 (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (i pos: nat)\n : Lemma (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2))", "source_type": "val pointwise_index1 (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (i pos: nat)\n : Lemma (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2))", "source_definition": "let rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 200, "start_col": 2, "end_line": 208, "end_col": 5 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n f: (_: a -> _: a -> a) ->\n b1: FStar.Seq.Base.seq a ->\n b2: FStar.Seq.Base.seq a ->\n i: Prims.nat ->\n pos: Prims.nat\n -> FStar.Pervasives.Lemma\n (requires FStar.Seq.Base.length b2 + pos <= FStar.Seq.Base.length b1 /\\ i < pos)\n (ensures\n FStar.Seq.Base.index (QUIC.Spec.Lemmas.pointwise_op f b1 b2 pos) i ==\n FStar.Seq.Base.index b1 i)\n (decreases FStar.Seq.Base.length b2)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma", "" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.nat", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "Prims.bool", "QUIC.Spec.Lemmas.pointwise_index1", "FStar.Seq.Base.upd", "FStar.Seq.Base.slice", "Prims.op_Addition", "Prims.unit", "Prims._assert", "Prims.eq2", "FStar.Seq.Base.index", "FStar.Seq.Base.lemma_index_upd2", "QUIC.Spec.Lemmas.pointwise_op", "FStar.Seq.Base.lemma_empty", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val pointwise_index1 (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (i pos: nat)\n : Lemma (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2))\nlet rec pointwise_index1 (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (i pos: nat)\n : Lemma (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =", "completed_definiton": "if Seq.length b2 = 0\nthen ()\nelse\n (S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos ==\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.bitwise_op", "original_source_type": "val bitwise_op (f: (bool -> bool -> bool)) (l1 l2: list bool)\n : Pure (list bool)\n (requires List.Tot.length l1 = List.Tot.length l2)\n (ensures fun l -> List.Tot.length l = List.Tot.length l1)", "source_type": "val bitwise_op (f: (bool -> bool -> bool)) (l1 l2: list bool)\n : Pure (list bool)\n (requires List.Tot.length l1 = List.Tot.length l2)\n (ensures fun l -> List.Tot.length l = List.Tot.length l1)", "source_definition": "let rec bitwise_op (f:bool->bool->bool) (l1 l2:list bool) : Pure (list bool)\n (requires List.Tot.length l1 = List.Tot.length l2)\n (ensures fun l -> List.Tot.length l = List.Tot.length l1) =\n match l1,l2 with\n | [],[] -> []\n | x1::t1,x2::t2 -> f x1 x2 :: bitwise_op f t1 t2", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 549, "start_col": 2, "end_line": 551, "end_col": 50 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')\n\n#pop-options\n\nlet pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0\n ))\n= S.lemma_split a pos_split;\n pointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos\n\nlet pointwise_op_slice_other\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n (from to: nat)\n: Lemma\n (requires (\n S.length b2 + pos <= S.length b1 /\\\n from <= to /\\\n to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)\n ))\n (ensures (\n S.slice (pointwise_op f b1 b2 pos) from to `S.equal` S.slice b1 from to\n ))\n= let phi\n (i: nat { from <= i /\\ i < to })\n : Lemma\n (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i)\n = if to <= pos\n then pointwise_index1 f b1 b2 i pos\n else pointwise_index3 f b1 b2 i pos\n in\n Classical.forall_intro phi\n\n\n// application: byte-wise xor\nlet xor_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logxor b1 b2 pos\n\n\n// proof of involution of the operator (uses extensionality for the\n// byte-wise variant)\nlet xor_involutive (b1 b2:byte) : Lemma\n (requires True)\n (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1) =\n FStar.UInt.logxor_associative (U8.v b1) (U8.v b2) (U8.v b2);\n FStar.UInt.logxor_self (U8.v b2);\n FStar.UInt.logxor_commutative (FStar.UInt.zero 8) (U8.v b1);\n FStar.UInt.logxor_lemma_1 (U8.v b1)\n\n\nlet xor_inplace_involutive (b1 b2:bytes) (pos:nat) : Lemma\n (requires S.length b2 + pos <= S.length b1)\n (ensures S.equal (xor_inplace (xor_inplace b1 b2 pos) b2 pos) b1)\n (decreases (S.length b2)) =\n let xor = xor_inplace (xor_inplace b1 b2 pos) b2 pos in\n let step (i:nat{i < S.length b1}) : Lemma (S.index xor i = S.index b1 i) =\n if i < pos then begin\n pointwise_index1 U8.logxor b1 b2 i pos;\n pointwise_index1 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else if i >= pos+S.length b2 then begin\n pointwise_index3 U8.logxor b1 b2 i pos;\n pointwise_index3 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else begin\n pointwise_index2 U8.logxor b1 b2 i pos;\n pointwise_index2 U8.logxor (xor_inplace b1 b2 pos) b2 i pos;\n xor_involutive (S.index b1 i) (S.index b2 (i-pos))\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet xor_inplace_commutative (b b1 b2:bytes) (pos1 pos2:nat) : Lemma\n (requires\n S.length b1 + pos1 <= S.length b /\\\n S.length b2 + pos2 <= S.length b)\n (ensures S.equal\n (xor_inplace (xor_inplace b b1 pos1) b2 pos2)\n (xor_inplace (xor_inplace b b2 pos2) b1 pos1)) =\n let xor1 = xor_inplace (xor_inplace b b1 pos1) b2 pos2 in\n let xor2 = xor_inplace (xor_inplace b b2 pos2) b1 pos1 in\n let step (i:nat{i < S.length b}) : Lemma (S.index xor1 i = S.index xor2 i) =\n if i < pos1 then begin\n pointwise_index1 U8.logxor b b1 i pos1;\n pointwise_index1 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else if i >= pos1 + S.length b1 then begin\n pointwise_index3 U8.logxor b b1 i pos1;\n pointwise_index3 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else begin\n pointwise_index2 U8.logxor b b1 i pos1;\n pointwise_index2 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n let ind = U8.v (S.index b i) in\n let ind1 = U8.v (S.index b1 (i-pos1)) in\n let ind2 = U8.v (S.index b2 (i-pos2)) in\n FStar.UInt.logxor_associative #8 ind ind1 ind2;\n FStar.UInt.logxor_associative #8 ind ind2 ind1;\n FStar.UInt.logxor_commutative #8 ind1 ind2;\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end in\n\n FStar.Classical.forall_intro step\n\nlet xor_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (pos: nat)\n: Lemma\n (requires (pos + S.length b <= S.length a))\n (ensures (xor_inplace a b pos `S.equal` a))\n= let psi\n (i: nat {i < S.length a})\n : Lemma\n (S.index (xor_inplace a b pos) i == S.index a i)\n = if i < pos\n then pointwise_index1 U8.logxor a b i pos\n else if i >= pos + S.length b\n then pointwise_index3 U8.logxor a b i pos\n else begin\n pointwise_index2 U8.logxor a b i pos;\n phi (i - pos);\n FStar.UInt.logxor_lemma_1 (U8.v (S.index a i))\n end\n in\n Classical.forall_intro psi\n\nlet and_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logand b1 b2 pos\n\nlet and_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (i: nat {i < S.length a})\n: Lemma\n (requires (S.length b == S.length a))\n (ensures (S.index (and_inplace a b 0) i == 0uy))\n= pointwise_index2 U8.logand a b i 0;\n phi i;\n FStar.UInt.logand_lemma_1 (U8.v (S.index a i))\n\nlet rec bitwise_op (f:bool->bool->bool) (l1 l2:list bool) : Pure (list bool)\n (requires List.Tot.length l1 = List.Tot.length l2)", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n f: (_: Prims.bool -> _: Prims.bool -> Prims.bool) ->\n l1: Prims.list Prims.bool ->\n l2: Prims.list Prims.bool\n -> Prims.Pure (Prims.list Prims.bool)", "effect": "Prims.Pure", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Prims.bool", "Prims.list", "FStar.Pervasives.Native.Mktuple2", "Prims.Nil", "Prims.Cons", "QUIC.Spec.Lemmas.bitwise_op", "Prims.b2t", "Prims.op_Equality", "Prims.nat", "FStar.List.Tot.Base.length" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val bitwise_op (f: (bool -> bool -> bool)) (l1 l2: list bool)\n : Pure (list bool)\n (requires List.Tot.length l1 = List.Tot.length l2)\n (ensures fun l -> List.Tot.length l = List.Tot.length l1)\nlet rec bitwise_op (f: (bool -> bool -> bool)) (l1 l2: list bool)\n : Pure (list bool)\n (requires List.Tot.length l1 = List.Tot.length l2)\n (ensures fun l -> List.Tot.length l = List.Tot.length l1) =", "completed_definiton": "match l1, l2 with\n| [], [] -> []\n| x1 :: t1, x2 :: t2 -> f x1 x2 :: bitwise_op f t1 t2", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.pointwise_op_pref", "original_source_type": "val pointwise_op_pref (#a: Type) (f: (a -> a -> a)) (a1 a2 b: S.seq a) (pos: nat)\n : Lemma (requires S.length b + pos <= S.length a1)\n (ensures S.equal (pointwise_op f S.(a1 @| a2) b pos) S.(pointwise_op f a1 b pos @| a2))", "source_type": "val pointwise_op_pref (#a: Type) (f: (a -> a -> a)) (a1 a2 b: S.seq a) (pos: nat)\n : Lemma (requires S.length b + pos <= S.length a1)\n (ensures S.equal (pointwise_op f S.(a1 @| a2) b pos) S.(pointwise_op f a1 b pos @| a2))", "source_definition": "let pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 287, "start_col": 42, "end_line": 303, "end_col": 35 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n f: (_: a -> _: a -> a) ->\n a1: FStar.Seq.Base.seq a ->\n a2: FStar.Seq.Base.seq a ->\n b: FStar.Seq.Base.seq a ->\n pos: Prims.nat\n -> FStar.Pervasives.Lemma (requires FStar.Seq.Base.length b + pos <= FStar.Seq.Base.length a1)\n (ensures\n FStar.Seq.Base.equal (QUIC.Spec.Lemmas.pointwise_op f (a1 @| a2) b pos)\n (QUIC.Spec.Lemmas.pointwise_op f a1 b pos @| a2))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.nat", "FStar.Classical.forall_intro", "Prims.l_and", "Prims.b2t", "Prims.op_LessThan", "FStar.Seq.Base.length", "Prims.eq2", "FStar.Seq.Base.index", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern", "QUIC.Spec.Lemmas.pointwise_index1", "FStar.Seq.Base.op_At_Bar", "Prims.bool", "Prims.op_Addition", "QUIC.Spec.Lemmas.pointwise_index2", "QUIC.Spec.Lemmas.pointwise_index3", "QUIC.Spec.Lemmas.pointwise_op", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.equal" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val pointwise_op_pref (#a: Type) (f: (a -> a -> a)) (a1 a2 b: S.seq a) (pos: nat)\n : Lemma (requires S.length b + pos <= S.length a1)\n (ensures S.equal (pointwise_op f S.(a1 @| a2) b pos) S.(pointwise_op f a1 b pos @| a2))\nlet pointwise_op_pref (#a: Type) (f: (a -> a -> a)) (a1 a2 b: S.seq a) (pos: nat)\n : Lemma (requires S.length b + pos <= S.length a1)\n (ensures S.equal (pointwise_op f S.(a1 @| a2) b pos) S.(pointwise_op f a1 b pos @| a2)) =", "completed_definiton": "let b1 = pointwise_op f S.(a1 @| a2) b pos in\nlet b2 = let open S in pointwise_op f a1 b pos @| a2 in\nlet step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos\n then\n (pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos)\n else\n if i < S.length b + pos\n then\n (pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos)\n else\n (pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos)\nin\nFStar.Classical.forall_intro step", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.pointwise_index2", "original_source_type": "val pointwise_index2 (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (i pos: nat)\n : Lemma (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i - pos))))\n (decreases (S.length b2))", "source_type": "val pointwise_index2 (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (i pos: nat)\n : Lemma (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i - pos))))\n (decreases (S.length b2))", "source_definition": "let rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 215, "start_col": 2, "end_line": 225, "end_col": 5 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n f: (_: a -> _: a -> a) ->\n b1: FStar.Seq.Base.seq a ->\n b2: FStar.Seq.Base.seq a ->\n i: Prims.nat ->\n pos: Prims.nat\n -> FStar.Pervasives.Lemma\n (requires\n FStar.Seq.Base.length b2 + pos <= FStar.Seq.Base.length b1 /\\ pos <= i /\\\n i < FStar.Seq.Base.length b2 + pos)\n (ensures\n FStar.Seq.Base.index (QUIC.Spec.Lemmas.pointwise_op f b1 b2 pos) i ==\n f (FStar.Seq.Base.index b1 i) (FStar.Seq.Base.index b2 (i - pos)))\n (decreases FStar.Seq.Base.length b2)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma", "" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.nat", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "Prims.bool", "FStar.Seq.Base.lemma_index_upd1", "Prims.unit", "QUIC.Spec.Lemmas.pointwise_index1", "FStar.Seq.Base.upd", "FStar.Seq.Base.slice", "Prims.op_Addition", "QUIC.Spec.Lemmas.pointwise_index2", "Prims._assert", "Prims.eq2", "QUIC.Spec.Lemmas.pointwise_op", "FStar.Seq.Base.index", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "Prims.squash", "Prims.op_Subtraction", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val pointwise_index2 (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (i pos: nat)\n : Lemma (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i - pos))))\n (decreases (S.length b2))\nlet rec pointwise_index2 (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (i pos: nat)\n : Lemma (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i - pos))))\n (decreases (S.length b2)) =", "completed_definiton": "if Seq.length b2 = 0\nthen ()\nelse\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos ==\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n if i = pos\n then\n (pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos + 1);\n S.lemma_index_upd1 b1 pos x)\n else pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.xor_inplace_commutative", "original_source_type": "val xor_inplace_commutative (b b1 b2: bytes) (pos1 pos2: nat)\n : Lemma (requires S.length b1 + pos1 <= S.length b /\\ S.length b2 + pos2 <= S.length b)\n (ensures\n S.equal (xor_inplace (xor_inplace b b1 pos1) b2 pos2)\n (xor_inplace (xor_inplace b b2 pos2) b1 pos1))", "source_type": "val xor_inplace_commutative (b b1 b2: bytes) (pos1 pos2: nat)\n : Lemma (requires S.length b1 + pos1 <= S.length b /\\ S.length b2 + pos2 <= S.length b)\n (ensures\n S.equal (xor_inplace (xor_inplace b b1 pos1) b2 pos2)\n (xor_inplace (xor_inplace b b2 pos2) b1 pos1))", "source_definition": "let xor_inplace_commutative (b b1 b2:bytes) (pos1 pos2:nat) : Lemma\n (requires\n S.length b1 + pos1 <= S.length b /\\\n S.length b2 + pos2 <= S.length b)\n (ensures S.equal\n (xor_inplace (xor_inplace b b1 pos1) b2 pos2)\n (xor_inplace (xor_inplace b b2 pos2) b1 pos1)) =\n let xor1 = xor_inplace (xor_inplace b b1 pos1) b2 pos2 in\n let xor2 = xor_inplace (xor_inplace b b2 pos2) b1 pos1 in\n let step (i:nat{i < S.length b}) : Lemma (S.index xor1 i = S.index xor2 i) =\n if i < pos1 then begin\n pointwise_index1 U8.logxor b b1 i pos1;\n pointwise_index1 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else if i >= pos1 + S.length b1 then begin\n pointwise_index3 U8.logxor b b1 i pos1;\n pointwise_index3 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else begin\n pointwise_index2 U8.logxor b b1 i pos1;\n pointwise_index2 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n let ind = U8.v (S.index b i) in\n let ind1 = U8.v (S.index b1 (i-pos1)) in\n let ind2 = U8.v (S.index b2 (i-pos2)) in\n FStar.UInt.logxor_associative #8 ind ind1 ind2;\n FStar.UInt.logxor_associative #8 ind ind2 ind1;\n FStar.UInt.logxor_commutative #8 ind1 ind2;\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end in\n\n FStar.Classical.forall_intro step", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 452, "start_col": 52, "end_line": 503, "end_col": 35 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')\n\n#pop-options\n\nlet pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0\n ))\n= S.lemma_split a pos_split;\n pointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos\n\nlet pointwise_op_slice_other\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n (from to: nat)\n: Lemma\n (requires (\n S.length b2 + pos <= S.length b1 /\\\n from <= to /\\\n to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)\n ))\n (ensures (\n S.slice (pointwise_op f b1 b2 pos) from to `S.equal` S.slice b1 from to\n ))\n= let phi\n (i: nat { from <= i /\\ i < to })\n : Lemma\n (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i)\n = if to <= pos\n then pointwise_index1 f b1 b2 i pos\n else pointwise_index3 f b1 b2 i pos\n in\n Classical.forall_intro phi\n\n\n// application: byte-wise xor\nlet xor_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logxor b1 b2 pos\n\n\n// proof of involution of the operator (uses extensionality for the\n// byte-wise variant)\nlet xor_involutive (b1 b2:byte) : Lemma\n (requires True)\n (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1) =\n FStar.UInt.logxor_associative (U8.v b1) (U8.v b2) (U8.v b2);\n FStar.UInt.logxor_self (U8.v b2);\n FStar.UInt.logxor_commutative (FStar.UInt.zero 8) (U8.v b1);\n FStar.UInt.logxor_lemma_1 (U8.v b1)\n\n\nlet xor_inplace_involutive (b1 b2:bytes) (pos:nat) : Lemma\n (requires S.length b2 + pos <= S.length b1)\n (ensures S.equal (xor_inplace (xor_inplace b1 b2 pos) b2 pos) b1)\n (decreases (S.length b2)) =\n let xor = xor_inplace (xor_inplace b1 b2 pos) b2 pos in\n let step (i:nat{i < S.length b1}) : Lemma (S.index xor i = S.index b1 i) =\n if i < pos then begin\n pointwise_index1 U8.logxor b1 b2 i pos;\n pointwise_index1 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else if i >= pos+S.length b2 then begin\n pointwise_index3 U8.logxor b1 b2 i pos;\n pointwise_index3 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else begin\n pointwise_index2 U8.logxor b1 b2 i pos;\n pointwise_index2 U8.logxor (xor_inplace b1 b2 pos) b2 i pos;\n xor_involutive (S.index b1 i) (S.index b2 (i-pos))\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet xor_inplace_commutative (b b1 b2:bytes) (pos1 pos2:nat) : Lemma\n (requires\n S.length b1 + pos1 <= S.length b /\\\n S.length b2 + pos2 <= S.length b)\n (ensures S.equal", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b: QUIC.Spec.Base.bytes ->\n b1: QUIC.Spec.Base.bytes ->\n b2: QUIC.Spec.Base.bytes ->\n pos1: Prims.nat ->\n pos2: Prims.nat\n -> FStar.Pervasives.Lemma\n (requires\n FStar.Seq.Base.length b1 + pos1 <= FStar.Seq.Base.length b /\\\n FStar.Seq.Base.length b2 + pos2 <= FStar.Seq.Base.length b)\n (ensures\n FStar.Seq.Base.equal (QUIC.Spec.Lemmas.xor_inplace (QUIC.Spec.Lemmas.xor_inplace b b1 pos1)\n b2\n pos2)\n (QUIC.Spec.Lemmas.xor_inplace (QUIC.Spec.Lemmas.xor_inplace b b2 pos2) b1 pos1))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bytes", "Prims.nat", "FStar.Classical.forall_intro", "Prims.b2t", "Prims.op_LessThan", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "Prims.op_Equality", "FStar.Seq.Base.index", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern", "QUIC.Spec.Lemmas.pointwise_index1", "FStar.UInt8.logxor", "QUIC.Spec.Lemmas.xor_inplace", "Prims.bool", "Prims.op_GreaterThanOrEqual", "Prims.op_Addition", "QUIC.Spec.Lemmas.pointwise_index3", "QUIC.Spec.Lemmas.pointwise_index2", "FStar.UInt.logxor_commutative", "FStar.UInt.logxor_associative", "FStar.UInt.uint_t", "FStar.UInt8.v", "Prims.op_Subtraction", "Prims.l_and", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.equal" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val xor_inplace_commutative (b b1 b2: bytes) (pos1 pos2: nat)\n : Lemma (requires S.length b1 + pos1 <= S.length b /\\ S.length b2 + pos2 <= S.length b)\n (ensures\n S.equal (xor_inplace (xor_inplace b b1 pos1) b2 pos2)\n (xor_inplace (xor_inplace b b2 pos2) b1 pos1))\nlet xor_inplace_commutative (b b1 b2: bytes) (pos1 pos2: nat)\n : Lemma (requires S.length b1 + pos1 <= S.length b /\\ S.length b2 + pos2 <= S.length b)\n (ensures\n S.equal (xor_inplace (xor_inplace b b1 pos1) b2 pos2)\n (xor_inplace (xor_inplace b b2 pos2) b1 pos1)) =", "completed_definiton": "let xor1 = xor_inplace (xor_inplace b b1 pos1) b2 pos2 in\nlet xor2 = xor_inplace (xor_inplace b b2 pos2) b1 pos1 in\nlet step (i: nat{i < S.length b}) : Lemma (S.index xor1 i = S.index xor2 i) =\n if i < pos1\n then\n (pointwise_index1 U8.logxor b b1 i pos1;\n pointwise_index1 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2\n then\n (pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2)\n else\n if i >= pos2 + S.length b2\n then\n (pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2)\n else\n (pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2))\n else\n if i >= pos1 + S.length b1\n then\n (pointwise_index3 U8.logxor b b1 i pos1;\n pointwise_index3 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2\n then\n (pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2)\n else\n if i >= pos2 + S.length b2\n then\n (pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2)\n else\n (pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2))\n else\n (pointwise_index2 U8.logxor b b1 i pos1;\n pointwise_index2 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2\n then\n (pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2)\n else\n if i >= pos2 + S.length b2\n then\n (pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2)\n else\n let ind = U8.v (S.index b i) in\n let ind1 = U8.v (S.index b1 (i - pos1)) in\n let ind2 = U8.v (S.index b2 (i - pos2)) in\n FStar.UInt.logxor_associative #8 ind ind1 ind2;\n FStar.UInt.logxor_associative #8 ind ind2 ind1;\n FStar.UInt.logxor_commutative #8 ind1 ind2;\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2)\nin\nFStar.Classical.forall_intro step", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.index_n_to_be_zero_right", "original_source_type": "val index_n_to_be_zero_right (len n i: nat)\n : Lemma (requires (i < len /\\ n < pow2 (8 * len) /\\ n % pow2 (8 * (len - i)) == 0))\n (ensures (U8.v (FStar.Seq.index (FStar.Endianness.n_to_be len n) i) == 0))", "source_type": "val index_n_to_be_zero_right (len n i: nat)\n : Lemma (requires (i < len /\\ n < pow2 (8 * len) /\\ n % pow2 (8 * (len - i)) == 0))\n (ensures (U8.v (FStar.Seq.index (FStar.Endianness.n_to_be len n) i) == 0))", "source_definition": "let index_n_to_be_zero_right\n (len: nat)\n (n: nat)\n (i: nat)\n: Lemma\n (requires (\n i < len /\\\n n < pow2 (8 * len) /\\\n n % pow2 (8 * (len - i)) == 0\n ))\n (ensures (\n U8.v (FStar.Seq.index (FStar.Endianness.n_to_be len n) i) == 0\n ))\n= index_n_to_be len n i;\n let open FStar.Math.Lemmas in\n modulo_division_lemma n (pow2 (8 * (len - 1 - i))) (pow2 8);\n pow2_plus (8 * (len - 1 - i)) 8", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 777, "start_col": 2, "end_line": 780, "end_col": 33 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')\n\n#pop-options\n\nlet pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0\n ))\n= S.lemma_split a pos_split;\n pointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos\n\nlet pointwise_op_slice_other\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n (from to: nat)\n: Lemma\n (requires (\n S.length b2 + pos <= S.length b1 /\\\n from <= to /\\\n to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)\n ))\n (ensures (\n S.slice (pointwise_op f b1 b2 pos) from to `S.equal` S.slice b1 from to\n ))\n= let phi\n (i: nat { from <= i /\\ i < to })\n : Lemma\n (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i)\n = if to <= pos\n then pointwise_index1 f b1 b2 i pos\n else pointwise_index3 f b1 b2 i pos\n in\n Classical.forall_intro phi\n\n\n// application: byte-wise xor\nlet xor_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logxor b1 b2 pos\n\n\n// proof of involution of the operator (uses extensionality for the\n// byte-wise variant)\nlet xor_involutive (b1 b2:byte) : Lemma\n (requires True)\n (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1) =\n FStar.UInt.logxor_associative (U8.v b1) (U8.v b2) (U8.v b2);\n FStar.UInt.logxor_self (U8.v b2);\n FStar.UInt.logxor_commutative (FStar.UInt.zero 8) (U8.v b1);\n FStar.UInt.logxor_lemma_1 (U8.v b1)\n\n\nlet xor_inplace_involutive (b1 b2:bytes) (pos:nat) : Lemma\n (requires S.length b2 + pos <= S.length b1)\n (ensures S.equal (xor_inplace (xor_inplace b1 b2 pos) b2 pos) b1)\n (decreases (S.length b2)) =\n let xor = xor_inplace (xor_inplace b1 b2 pos) b2 pos in\n let step (i:nat{i < S.length b1}) : Lemma (S.index xor i = S.index b1 i) =\n if i < pos then begin\n pointwise_index1 U8.logxor b1 b2 i pos;\n pointwise_index1 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else if i >= pos+S.length b2 then begin\n pointwise_index3 U8.logxor b1 b2 i pos;\n pointwise_index3 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else begin\n pointwise_index2 U8.logxor b1 b2 i pos;\n pointwise_index2 U8.logxor (xor_inplace b1 b2 pos) b2 i pos;\n xor_involutive (S.index b1 i) (S.index b2 (i-pos))\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet xor_inplace_commutative (b b1 b2:bytes) (pos1 pos2:nat) : Lemma\n (requires\n S.length b1 + pos1 <= S.length b /\\\n S.length b2 + pos2 <= S.length b)\n (ensures S.equal\n (xor_inplace (xor_inplace b b1 pos1) b2 pos2)\n (xor_inplace (xor_inplace b b2 pos2) b1 pos1)) =\n let xor1 = xor_inplace (xor_inplace b b1 pos1) b2 pos2 in\n let xor2 = xor_inplace (xor_inplace b b2 pos2) b1 pos1 in\n let step (i:nat{i < S.length b}) : Lemma (S.index xor1 i = S.index xor2 i) =\n if i < pos1 then begin\n pointwise_index1 U8.logxor b b1 i pos1;\n pointwise_index1 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else if i >= pos1 + S.length b1 then begin\n pointwise_index3 U8.logxor b b1 i pos1;\n pointwise_index3 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else begin\n pointwise_index2 U8.logxor b b1 i pos1;\n pointwise_index2 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n let ind = U8.v (S.index b i) in\n let ind1 = U8.v (S.index b1 (i-pos1)) in\n let ind2 = U8.v (S.index b2 (i-pos2)) in\n FStar.UInt.logxor_associative #8 ind ind1 ind2;\n FStar.UInt.logxor_associative #8 ind ind2 ind1;\n FStar.UInt.logxor_commutative #8 ind1 ind2;\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end in\n\n FStar.Classical.forall_intro step\n\nlet xor_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (pos: nat)\n: Lemma\n (requires (pos + S.length b <= S.length a))\n (ensures (xor_inplace a b pos `S.equal` a))\n= let psi\n (i: nat {i < S.length a})\n : Lemma\n (S.index (xor_inplace a b pos) i == S.index a i)\n = if i < pos\n then pointwise_index1 U8.logxor a b i pos\n else if i >= pos + S.length b\n then pointwise_index3 U8.logxor a b i pos\n else begin\n pointwise_index2 U8.logxor a b i pos;\n phi (i - pos);\n FStar.UInt.logxor_lemma_1 (U8.v (S.index a i))\n end\n in\n Classical.forall_intro psi\n\nlet and_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logand b1 b2 pos\n\nlet and_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (i: nat {i < S.length a})\n: Lemma\n (requires (S.length b == S.length a))\n (ensures (S.index (and_inplace a b 0) i == 0uy))\n= pointwise_index2 U8.logand a b i 0;\n phi i;\n FStar.UInt.logand_lemma_1 (U8.v (S.index a i))\n\nlet rec bitwise_op (f:bool->bool->bool) (l1 l2:list bool) : Pure (list bool)\n (requires List.Tot.length l1 = List.Tot.length l2)\n (ensures fun l -> List.Tot.length l = List.Tot.length l1) =\n match l1,l2 with\n | [],[] -> []\n | x1::t1,x2::t2 -> f x1 x2 :: bitwise_op f t1 t2\n\n\nlet rec lemma_bitwise_op_index (f:bool->bool->bool) (l1 l2:list bool) (n:nat) : Lemma\n (requires List.Tot.length l1 = List.Tot.length l2 /\\ n < List.Tot.length l1)\n (ensures List.Tot.index (bitwise_op f l1 l2) n = f (List.Tot.index l1 n) (List.Tot.index l2 n)) =\n match l1,l2 with\n | [],[] -> ()\n | x1::t1,x2::t2 ->\n if n = 0 then ()\n else lemma_bitwise_op_index f t1 t2 (n-1)\n\nlet rec list_to_seq (#a:Type) (l:list a) : (s:(S.seq a){S.length s = List.Tot.length l /\\ (forall i. S.index s i == List.Tot.index l i)}) =\n match l with\n | [] -> S.empty\n | h :: t -> S.(create 1 h @| list_to_seq t)\n\nlet rec rev_seq (#a:Type) (s:S.seq a) : Pure (S.seq a)\n (requires True)\n (ensures fun s' -> S.length s = S.length s')\n (decreases (S.length s)) =\n if S.length s = 0 then S.empty\n else\n let _ = S.lemma_empty s in\n S.(rev_seq S.(slice s 1 (length s)) @| create 1 (index s 0))\n\n\nlet rec lemma_rev_seq (#a:Type) (s:S.seq a) (i:nat) : Lemma\n (requires i < S.length s)\n (ensures\n S.length (rev_seq s) = S.length s /\\\n S.index s i == S.index (rev_seq s) (S.length s-1-i))\n (decreases (i))=\n if S.length s = 0 then ()\n else if i = 0 then ()\n else lemma_rev_seq (S.slice s 1 (S.length s)) (i-1)\n\n#restart-solver\n\nlet lemma_arithmetic1 (a b c d e:int) : Lemma\n ((a+b+c+d)+(e-d) = (a+c+e)+b) =\n ()\n\nlet lemma_arithmetic2 (a b c d:int) : Lemma\n (a+(b-c)+d = a + ((b+d)-c)) =\n ()\n\nlet lemma_arithmetic3 (a b c:int) : Lemma\n ((a+b)-c = (a-c)+b) =\n ()\n\n\nlet lemma_propagate_mul_mod (a b:nat) : Lemma\n (requires b > 0)\n (ensures (\n let open FStar.Mul in\n (2*a) % (2*b) = 2 * (a % b))) =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_div_mod a b;\n lemma_div_mod (2*a) b;\n let (p,r) = ((a/b)*(2*b), 2*(a%b)) in\n assert (2*a = p + r);\n modulo_distributivity p r (2*b);\n multiple_modulo_lemma (a/b) (2*b);\n modulo_range_lemma a b;\n small_mod r (2*b)\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1 --z3rlimit 256\" // strange that F* has so much trouble completing this induction\nlet recompose_pow2_assoc (n:pos) (a:nat) : Lemma\n (let open FStar.Mul in 2 * (pow2 (n-1) * a) = pow2 n * a) =\n ()\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1 --z3rlimit 512\" // strange that F* has so much trouble completing this induction\nlet rec lemma_propagate_pow_mod (a b n:nat) : Lemma\n (requires b > 0)\n (ensures (\n let open FStar.Mul in\n (pow2 n * a) % (pow2 n * b) = pow2 n * (a % b))) =\n let open FStar.Mul in\n let open FStar.Math.Lemmas in\n if n = 0 then ()\n else begin\n let res = (pow2 n * a) % (pow2 n * b) in\n lemma_propagate_mul_mod (pow2 (n-1) * a) (pow2 (n-1) * b);\n assert (res = 2 * ((pow2 (n-1) * a) % (pow2 (n-1) * b)));\n lemma_propagate_pow_mod a b (n-1);\n assert (res = 2 * (pow2 (n-1) * (a%b)));\n recompose_pow2_assoc n (a%b)\n end\n#pop-options\n\n\n#restart-solver\nlet lemma_modulo_shift_byte (a:nat) (i:pos) : Lemma\n (let open FStar.Mul in\n (pow2 8 * a) % (pow2 (8*i)) = pow2 8 * (a % pow2 (8*(i-1)))) =\n let sub = 8 `op_Multiply` (i-1) in\n FStar.Math.Lemmas.pow2_plus 8 sub;\n lemma_propagate_pow_mod a (pow2 sub) 8\n\nlet rec reveal_be_to_n_slice (b:bytes) (i j:nat) : Lemma\n (requires i < j /\\ j <= S.length b)\n (ensures (\n let open FStar.Mul in\n let open FStar.Endianness in\n let h = U8.v (S.index b (j-1)) in\n be_to_n (S.slice b i j) = h + pow2 8 * be_to_n (S.slice b i (j - 1)))) =\n FStar.Endianness.reveal_be_to_n (S.slice b i j)\n\nlet rec lemma_correctness_slice_be_to_n (b:bytes) (i:nat) : Lemma\n (requires i <= S.length b)\n (ensures (\n let open FStar.Endianness in\n let open FStar.Mul in\n be_to_n b % pow2 (8 * i) =\n be_to_n (S.slice b (S.length b - i) (S.length b))))\n (decreases i) =\n let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n if i = 0 then reveal_be_to_n S.empty\n else begin\n reveal_be_to_n b;\n let h = U8.v (S.index b (S.length b - 1)) in\n let l = S.slice b 0 (S.length b - 1) in\n let pow = pow2 (8*i) in\n //assert (be_to_n b = h + pow2 8 * be_to_n l);\n modulo_distributivity h (pow2 8 * be_to_n l) pow;\n pow2_le_compat (8*i) 8;\n small_mod h pow;\n //assert (be_to_n b % pow = (h + (pow2 8 * be_to_n l)%pow) % pow);\n lemma_modulo_shift_byte (be_to_n l) i;\n lemma_correctness_slice_be_to_n l (i-1);\n //assert (be_to_n b % pow = (h + pow2 8 * be_to_n (S.slice b (S.length b - i) (S.length b - 1))) % pow);\n reveal_be_to_n_slice b (S.length b - i) (S.length b);\n //assert (be_to_n b % pow = be_to_n (S.slice b (S.length b - i) (S.length b)) % pow);\n lemma_be_to_n_is_bounded (S.slice b (S.length b - i) (S.length b));\n FStar.Math.Lemmas.small_mod (be_to_n (S.slice b (S.length b - i) (S.length b))) pow\n end\n\nopen FStar.Mul\n\nlet rec index_be_to_n\n (b: bytes)\n (i: nat)\n: Lemma\n (requires (\n i < S.length b\n ))\n (ensures (\n U8.v (FStar.Seq.index b i) == (FStar.Endianness.be_to_n b / pow2 (8 * (S.length b - 1 - i))) % pow2 8\n ))\n (decreases (S.length b))\n= let open FStar.Endianness in\n reveal_be_to_n b;\n if i = S.length b - 1\n then ()\n else begin\n let l = S.length b in\n let l' = l - 1 in\n let b' = S.slice b 0 l' in\n index_be_to_n b' i;\n assert (FStar.Seq.index b i == FStar.Seq.index b' i);\n let open FStar.Math.Lemmas in\n let x = be_to_n b in\n let x' = be_to_n b' in\n assert (U8.v (FStar.Seq.index b i) == x' / pow2 (8 * (l' - 1 - i)) % pow2 8);\n let y = (U8.v (S.last b) + pow2 8 * x') / pow2 (8 * (l - 1 - i)) % pow2 8 in\n pow2_plus 8 (8 * (l' - 1 - i));\n division_multiplication_lemma (U8.v (S.last b) + pow2 8 * x') (pow2 8) (pow2 (8 * (l' - 1 - i)));\n assert (pow2 8 * x' == x' * pow2 8);\n division_addition_lemma (U8.v (S.last b)) (pow2 8) x';\n small_division_lemma_1 (U8.v (S.last b)) (pow2 8);\n assert (y == x' / pow2 (8 * (l' - 1 - i)) % pow2 8)\n end\n\nlet index_n_to_be\n (len: nat)\n (n: nat)\n (i: nat)\n: Lemma\n (requires (\n i < len /\\\n n < pow2 (8 * len)\n ))\n (ensures (\n U8.v (FStar.Seq.index (FStar.Endianness.n_to_be len n) i)) == (n / pow2 (8 * (len - 1 - i)) % pow2 8\n ))\n= index_be_to_n (FStar.Endianness.n_to_be len n) i\n\nlet index_n_to_be_zero_left\n (len: nat)\n (n: nat)\n (j: nat)\n (i: nat)\n: Lemma\n (requires (\n i < j /\\\n j <= len /\\\n n < pow2 (8 * (len - j))\n ))\n (ensures (\n pow2 (8 * (len - j)) <= pow2 (8 * len) /\\\n U8.v (FStar.Seq.index (FStar.Endianness.n_to_be len n) i) == 0\n ))\n= let open FStar.Math.Lemmas in\n pow2_le_compat (8 * len) (8 * (len - j));\n pow2_le_compat (8 * (len - 1 - i)) (8 * (len - j));\n small_division_lemma_1 n (pow2 (8 * (len - 1 - i)));\n index_n_to_be len n i\n\nlet index_n_to_be_zero_right\n (len: nat)\n (n: nat)\n (i: nat)\n: Lemma\n (requires (\n i < len /\\\n n < pow2 (8 * len) /\\\n n % pow2 (8 * (len - i)) == 0\n ))\n (ensures (\n U8.v (FStar.Seq.index (FStar.Endianness.n_to_be len n) i) == 0", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "len: Prims.nat -> n: Prims.nat -> i: Prims.nat\n -> FStar.Pervasives.Lemma\n (requires i < len /\\ n < Prims.pow2 (8 * len) /\\ n % Prims.pow2 (8 * (len - i)) == 0)\n (ensures FStar.UInt8.v (FStar.Seq.Base.index (FStar.Endianness.n_to_be len n) i) == 0)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "FStar.Math.Lemmas.pow2_plus", "FStar.Mul.op_Star", "Prims.op_Subtraction", "Prims.unit", "FStar.Math.Lemmas.modulo_division_lemma", "Prims.pow2", "QUIC.Spec.Lemmas.index_n_to_be", "Prims.l_and", "Prims.b2t", "Prims.op_LessThan", "Prims.eq2", "Prims.int", "Prims.op_Modulus", "Prims.squash", "FStar.UInt8.v", "FStar.Seq.Base.index", "FStar.UInt8.t", "FStar.Endianness.n_to_be", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val index_n_to_be_zero_right (len n i: nat)\n : Lemma (requires (i < len /\\ n < pow2 (8 * len) /\\ n % pow2 (8 * (len - i)) == 0))\n (ensures (U8.v (FStar.Seq.index (FStar.Endianness.n_to_be len n) i) == 0))\nlet index_n_to_be_zero_right (len n i: nat)\n : Lemma (requires (i < len /\\ n < pow2 (8 * len) /\\ n % pow2 (8 * (len - i)) == 0))\n (ensures (U8.v (FStar.Seq.index (FStar.Endianness.n_to_be len n) i) == 0)) =", "completed_definiton": "index_n_to_be len n i;\nlet open FStar.Math.Lemmas in\nmodulo_division_lemma n (pow2 (8 * (len - 1 - i))) (pow2 8);\npow2_plus (8 * (len - 1 - i)) 8", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.pointwise_op_suff", "original_source_type": "val pointwise_op_suff (#a: Type) (f: (a -> a -> a)) (a1 a2 b: S.seq a) (pos: nat)\n : Lemma (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1)))", "source_type": "val pointwise_op_suff (#a: Type) (f: (a -> a -> a)) (a1 a2 b: S.seq a) (pos: nat)\n : Lemma (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1)))", "source_definition": "let pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 261, "start_col": 58, "end_line": 279, "end_col": 35 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n f: (_: a -> _: a -> a) ->\n a1: FStar.Seq.Base.seq a ->\n a2: FStar.Seq.Base.seq a ->\n b: FStar.Seq.Base.seq a ->\n pos: Prims.nat\n -> FStar.Pervasives.Lemma\n (requires\n pos >= FStar.Seq.Base.length a1 /\\\n FStar.Seq.Base.length b + pos <= FStar.Seq.Base.length a1 + FStar.Seq.Base.length a2)\n (ensures\n FStar.Seq.Base.equal (QUIC.Spec.Lemmas.pointwise_op f (a1 @| a2) b pos)\n (a1 @| QUIC.Spec.Lemmas.pointwise_op f a2 b (pos - FStar.Seq.Base.length a1)))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.nat", "FStar.Classical.forall_intro", "Prims.l_and", "Prims.b2t", "Prims.op_LessThan", "FStar.Seq.Base.length", "Prims.eq2", "FStar.Seq.Base.index", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern", "QUIC.Spec.Lemmas.pointwise_index1", "FStar.Seq.Base.op_At_Bar", "Prims.bool", "Prims.op_Subtraction", "Prims.op_Addition", "QUIC.Spec.Lemmas.pointwise_index2", "QUIC.Spec.Lemmas.pointwise_index3", "QUIC.Spec.Lemmas.pointwise_op", "Prims.op_GreaterThanOrEqual", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.equal" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val pointwise_op_suff (#a: Type) (f: (a -> a -> a)) (a1 a2 b: S.seq a) (pos: nat)\n : Lemma (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1)))\nlet pointwise_op_suff (#a: Type) (f: (a -> a -> a)) (a1 a2 b: S.seq a) (pos: nat)\n : Lemma (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =", "completed_definiton": "let b1 = pointwise_op f S.(a1 @| a2) b pos in\nlet b2 = let open S in a1 @| pointwise_op f a2 b (pos - S.length a1) in\nlet step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1\n then pointwise_index1 f S.(a1 @| a2) b i pos\n else\n if i < pos\n then\n (pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i - S.length a1) (pos - S.length a1))\n else\n if i < S.length b + pos\n then\n (pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i - S.length a1) (pos - S.length a1))\n else\n (pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i - S.length a1) (pos - S.length a1))\nin\nFStar.Classical.forall_intro step", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.lemma_bitwise_op_index", "original_source_type": "val lemma_bitwise_op_index (f: (bool -> bool -> bool)) (l1 l2: list bool) (n: nat)\n : Lemma (requires List.Tot.length l1 = List.Tot.length l2 /\\ n < List.Tot.length l1)\n (ensures List.Tot.index (bitwise_op f l1 l2) n = f (List.Tot.index l1 n) (List.Tot.index l2 n)\n )", "source_type": "val lemma_bitwise_op_index (f: (bool -> bool -> bool)) (l1 l2: list bool) (n: nat)\n : Lemma (requires List.Tot.length l1 = List.Tot.length l2 /\\ n < List.Tot.length l1)\n (ensures List.Tot.index (bitwise_op f l1 l2) n = f (List.Tot.index l1 n) (List.Tot.index l2 n)\n )", "source_definition": "let rec lemma_bitwise_op_index (f:bool->bool->bool) (l1 l2:list bool) (n:nat) : Lemma\n (requires List.Tot.length l1 = List.Tot.length l2 /\\ n < List.Tot.length l1)\n (ensures List.Tot.index (bitwise_op f l1 l2) n = f (List.Tot.index l1 n) (List.Tot.index l2 n)) =\n match l1,l2 with\n | [],[] -> ()\n | x1::t1,x2::t2 ->\n if n = 0 then ()\n else lemma_bitwise_op_index f t1 t2 (n-1)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 557, "start_col": 2, "end_line": 561, "end_col": 45 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')\n\n#pop-options\n\nlet pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0\n ))\n= S.lemma_split a pos_split;\n pointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos\n\nlet pointwise_op_slice_other\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n (from to: nat)\n: Lemma\n (requires (\n S.length b2 + pos <= S.length b1 /\\\n from <= to /\\\n to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)\n ))\n (ensures (\n S.slice (pointwise_op f b1 b2 pos) from to `S.equal` S.slice b1 from to\n ))\n= let phi\n (i: nat { from <= i /\\ i < to })\n : Lemma\n (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i)\n = if to <= pos\n then pointwise_index1 f b1 b2 i pos\n else pointwise_index3 f b1 b2 i pos\n in\n Classical.forall_intro phi\n\n\n// application: byte-wise xor\nlet xor_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logxor b1 b2 pos\n\n\n// proof of involution of the operator (uses extensionality for the\n// byte-wise variant)\nlet xor_involutive (b1 b2:byte) : Lemma\n (requires True)\n (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1) =\n FStar.UInt.logxor_associative (U8.v b1) (U8.v b2) (U8.v b2);\n FStar.UInt.logxor_self (U8.v b2);\n FStar.UInt.logxor_commutative (FStar.UInt.zero 8) (U8.v b1);\n FStar.UInt.logxor_lemma_1 (U8.v b1)\n\n\nlet xor_inplace_involutive (b1 b2:bytes) (pos:nat) : Lemma\n (requires S.length b2 + pos <= S.length b1)\n (ensures S.equal (xor_inplace (xor_inplace b1 b2 pos) b2 pos) b1)\n (decreases (S.length b2)) =\n let xor = xor_inplace (xor_inplace b1 b2 pos) b2 pos in\n let step (i:nat{i < S.length b1}) : Lemma (S.index xor i = S.index b1 i) =\n if i < pos then begin\n pointwise_index1 U8.logxor b1 b2 i pos;\n pointwise_index1 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else if i >= pos+S.length b2 then begin\n pointwise_index3 U8.logxor b1 b2 i pos;\n pointwise_index3 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else begin\n pointwise_index2 U8.logxor b1 b2 i pos;\n pointwise_index2 U8.logxor (xor_inplace b1 b2 pos) b2 i pos;\n xor_involutive (S.index b1 i) (S.index b2 (i-pos))\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet xor_inplace_commutative (b b1 b2:bytes) (pos1 pos2:nat) : Lemma\n (requires\n S.length b1 + pos1 <= S.length b /\\\n S.length b2 + pos2 <= S.length b)\n (ensures S.equal\n (xor_inplace (xor_inplace b b1 pos1) b2 pos2)\n (xor_inplace (xor_inplace b b2 pos2) b1 pos1)) =\n let xor1 = xor_inplace (xor_inplace b b1 pos1) b2 pos2 in\n let xor2 = xor_inplace (xor_inplace b b2 pos2) b1 pos1 in\n let step (i:nat{i < S.length b}) : Lemma (S.index xor1 i = S.index xor2 i) =\n if i < pos1 then begin\n pointwise_index1 U8.logxor b b1 i pos1;\n pointwise_index1 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else if i >= pos1 + S.length b1 then begin\n pointwise_index3 U8.logxor b b1 i pos1;\n pointwise_index3 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else begin\n pointwise_index2 U8.logxor b b1 i pos1;\n pointwise_index2 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n let ind = U8.v (S.index b i) in\n let ind1 = U8.v (S.index b1 (i-pos1)) in\n let ind2 = U8.v (S.index b2 (i-pos2)) in\n FStar.UInt.logxor_associative #8 ind ind1 ind2;\n FStar.UInt.logxor_associative #8 ind ind2 ind1;\n FStar.UInt.logxor_commutative #8 ind1 ind2;\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end in\n\n FStar.Classical.forall_intro step\n\nlet xor_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (pos: nat)\n: Lemma\n (requires (pos + S.length b <= S.length a))\n (ensures (xor_inplace a b pos `S.equal` a))\n= let psi\n (i: nat {i < S.length a})\n : Lemma\n (S.index (xor_inplace a b pos) i == S.index a i)\n = if i < pos\n then pointwise_index1 U8.logxor a b i pos\n else if i >= pos + S.length b\n then pointwise_index3 U8.logxor a b i pos\n else begin\n pointwise_index2 U8.logxor a b i pos;\n phi (i - pos);\n FStar.UInt.logxor_lemma_1 (U8.v (S.index a i))\n end\n in\n Classical.forall_intro psi\n\nlet and_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logand b1 b2 pos\n\nlet and_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (i: nat {i < S.length a})\n: Lemma\n (requires (S.length b == S.length a))\n (ensures (S.index (and_inplace a b 0) i == 0uy))\n= pointwise_index2 U8.logand a b i 0;\n phi i;\n FStar.UInt.logand_lemma_1 (U8.v (S.index a i))\n\nlet rec bitwise_op (f:bool->bool->bool) (l1 l2:list bool) : Pure (list bool)\n (requires List.Tot.length l1 = List.Tot.length l2)\n (ensures fun l -> List.Tot.length l = List.Tot.length l1) =\n match l1,l2 with\n | [],[] -> []\n | x1::t1,x2::t2 -> f x1 x2 :: bitwise_op f t1 t2\n\n\nlet rec lemma_bitwise_op_index (f:bool->bool->bool) (l1 l2:list bool) (n:nat) : Lemma\n (requires List.Tot.length l1 = List.Tot.length l2 /\\ n < List.Tot.length l1)", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n f: (_: Prims.bool -> _: Prims.bool -> Prims.bool) ->\n l1: Prims.list Prims.bool ->\n l2: Prims.list Prims.bool ->\n n: Prims.nat\n -> FStar.Pervasives.Lemma\n (requires\n FStar.List.Tot.Base.length l1 = FStar.List.Tot.Base.length l2 /\\\n n < FStar.List.Tot.Base.length l1)\n (ensures\n FStar.List.Tot.Base.index (QUIC.Spec.Lemmas.bitwise_op f l1 l2) n =\n f (FStar.List.Tot.Base.index l1 n) (FStar.List.Tot.Base.index l2 n))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.bool", "Prims.list", "Prims.nat", "FStar.Pervasives.Native.Mktuple2", "Prims.op_Equality", "Prims.int", "QUIC.Spec.Lemmas.lemma_bitwise_op_index", "Prims.op_Subtraction", "Prims.unit", "Prims.l_and", "Prims.b2t", "FStar.List.Tot.Base.length", "Prims.op_LessThan", "Prims.squash", "FStar.List.Tot.Base.index", "QUIC.Spec.Lemmas.bitwise_op", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_bitwise_op_index (f: (bool -> bool -> bool)) (l1 l2: list bool) (n: nat)\n : Lemma (requires List.Tot.length l1 = List.Tot.length l2 /\\ n < List.Tot.length l1)\n (ensures List.Tot.index (bitwise_op f l1 l2) n = f (List.Tot.index l1 n) (List.Tot.index l2 n)\n )\nlet rec lemma_bitwise_op_index (f: (bool -> bool -> bool)) (l1 l2: list bool) (n: nat)\n : Lemma (requires List.Tot.length l1 = List.Tot.length l2 /\\ n < List.Tot.length l1)\n (ensures List.Tot.index (bitwise_op f l1 l2) n = f (List.Tot.index l1 n) (List.Tot.index l2 n)\n ) =", "completed_definiton": "match l1, l2 with\n| [], [] -> ()\n| x1 :: t1, x2 :: t2 -> if n = 0 then () else lemma_bitwise_op_index f t1 t2 (n - 1)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.lemma_correctness_slice_be_to_n", "original_source_type": "val lemma_correctness_slice_be_to_n (b: bytes) (i: nat)\n : Lemma (requires i <= S.length b)\n (ensures\n (let open FStar.Endianness in\n let open FStar.Mul in\n be_to_n b % pow2 (8 * i) = be_to_n (S.slice b (S.length b - i) (S.length b))))\n (decreases i)", "source_type": "val lemma_correctness_slice_be_to_n (b: bytes) (i: nat)\n : Lemma (requires i <= S.length b)\n (ensures\n (let open FStar.Endianness in\n let open FStar.Mul in\n be_to_n b % pow2 (8 * i) = be_to_n (S.slice b (S.length b - i) (S.length b))))\n (decreases i)", "source_definition": "let rec lemma_correctness_slice_be_to_n (b:bytes) (i:nat) : Lemma\n (requires i <= S.length b)\n (ensures (\n let open FStar.Endianness in\n let open FStar.Mul in\n be_to_n b % pow2 (8 * i) =\n be_to_n (S.slice b (S.length b - i) (S.length b))))\n (decreases i) =\n let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n if i = 0 then reveal_be_to_n S.empty\n else begin\n reveal_be_to_n b;\n let h = U8.v (S.index b (S.length b - 1)) in\n let l = S.slice b 0 (S.length b - 1) in\n let pow = pow2 (8*i) in\n //assert (be_to_n b = h + pow2 8 * be_to_n l);\n modulo_distributivity h (pow2 8 * be_to_n l) pow;\n pow2_le_compat (8*i) 8;\n small_mod h pow;\n //assert (be_to_n b % pow = (h + (pow2 8 * be_to_n l)%pow) % pow);\n lemma_modulo_shift_byte (be_to_n l) i;\n lemma_correctness_slice_be_to_n l (i-1);\n //assert (be_to_n b % pow = (h + pow2 8 * be_to_n (S.slice b (S.length b - i) (S.length b - 1))) % pow);\n reveal_be_to_n_slice b (S.length b - i) (S.length b);\n //assert (be_to_n b % pow = be_to_n (S.slice b (S.length b - i) (S.length b)) % pow);\n lemma_be_to_n_is_bounded (S.slice b (S.length b - i) (S.length b));\n FStar.Math.Lemmas.small_mod (be_to_n (S.slice b (S.length b - i) (S.length b))) pow\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 670, "start_col": 2, "end_line": 691, "end_col": 5 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')\n\n#pop-options\n\nlet pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0\n ))\n= S.lemma_split a pos_split;\n pointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos\n\nlet pointwise_op_slice_other\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n (from to: nat)\n: Lemma\n (requires (\n S.length b2 + pos <= S.length b1 /\\\n from <= to /\\\n to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)\n ))\n (ensures (\n S.slice (pointwise_op f b1 b2 pos) from to `S.equal` S.slice b1 from to\n ))\n= let phi\n (i: nat { from <= i /\\ i < to })\n : Lemma\n (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i)\n = if to <= pos\n then pointwise_index1 f b1 b2 i pos\n else pointwise_index3 f b1 b2 i pos\n in\n Classical.forall_intro phi\n\n\n// application: byte-wise xor\nlet xor_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logxor b1 b2 pos\n\n\n// proof of involution of the operator (uses extensionality for the\n// byte-wise variant)\nlet xor_involutive (b1 b2:byte) : Lemma\n (requires True)\n (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1) =\n FStar.UInt.logxor_associative (U8.v b1) (U8.v b2) (U8.v b2);\n FStar.UInt.logxor_self (U8.v b2);\n FStar.UInt.logxor_commutative (FStar.UInt.zero 8) (U8.v b1);\n FStar.UInt.logxor_lemma_1 (U8.v b1)\n\n\nlet xor_inplace_involutive (b1 b2:bytes) (pos:nat) : Lemma\n (requires S.length b2 + pos <= S.length b1)\n (ensures S.equal (xor_inplace (xor_inplace b1 b2 pos) b2 pos) b1)\n (decreases (S.length b2)) =\n let xor = xor_inplace (xor_inplace b1 b2 pos) b2 pos in\n let step (i:nat{i < S.length b1}) : Lemma (S.index xor i = S.index b1 i) =\n if i < pos then begin\n pointwise_index1 U8.logxor b1 b2 i pos;\n pointwise_index1 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else if i >= pos+S.length b2 then begin\n pointwise_index3 U8.logxor b1 b2 i pos;\n pointwise_index3 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else begin\n pointwise_index2 U8.logxor b1 b2 i pos;\n pointwise_index2 U8.logxor (xor_inplace b1 b2 pos) b2 i pos;\n xor_involutive (S.index b1 i) (S.index b2 (i-pos))\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet xor_inplace_commutative (b b1 b2:bytes) (pos1 pos2:nat) : Lemma\n (requires\n S.length b1 + pos1 <= S.length b /\\\n S.length b2 + pos2 <= S.length b)\n (ensures S.equal\n (xor_inplace (xor_inplace b b1 pos1) b2 pos2)\n (xor_inplace (xor_inplace b b2 pos2) b1 pos1)) =\n let xor1 = xor_inplace (xor_inplace b b1 pos1) b2 pos2 in\n let xor2 = xor_inplace (xor_inplace b b2 pos2) b1 pos1 in\n let step (i:nat{i < S.length b}) : Lemma (S.index xor1 i = S.index xor2 i) =\n if i < pos1 then begin\n pointwise_index1 U8.logxor b b1 i pos1;\n pointwise_index1 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else if i >= pos1 + S.length b1 then begin\n pointwise_index3 U8.logxor b b1 i pos1;\n pointwise_index3 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else begin\n pointwise_index2 U8.logxor b b1 i pos1;\n pointwise_index2 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n let ind = U8.v (S.index b i) in\n let ind1 = U8.v (S.index b1 (i-pos1)) in\n let ind2 = U8.v (S.index b2 (i-pos2)) in\n FStar.UInt.logxor_associative #8 ind ind1 ind2;\n FStar.UInt.logxor_associative #8 ind ind2 ind1;\n FStar.UInt.logxor_commutative #8 ind1 ind2;\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end in\n\n FStar.Classical.forall_intro step\n\nlet xor_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (pos: nat)\n: Lemma\n (requires (pos + S.length b <= S.length a))\n (ensures (xor_inplace a b pos `S.equal` a))\n= let psi\n (i: nat {i < S.length a})\n : Lemma\n (S.index (xor_inplace a b pos) i == S.index a i)\n = if i < pos\n then pointwise_index1 U8.logxor a b i pos\n else if i >= pos + S.length b\n then pointwise_index3 U8.logxor a b i pos\n else begin\n pointwise_index2 U8.logxor a b i pos;\n phi (i - pos);\n FStar.UInt.logxor_lemma_1 (U8.v (S.index a i))\n end\n in\n Classical.forall_intro psi\n\nlet and_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logand b1 b2 pos\n\nlet and_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (i: nat {i < S.length a})\n: Lemma\n (requires (S.length b == S.length a))\n (ensures (S.index (and_inplace a b 0) i == 0uy))\n= pointwise_index2 U8.logand a b i 0;\n phi i;\n FStar.UInt.logand_lemma_1 (U8.v (S.index a i))\n\nlet rec bitwise_op (f:bool->bool->bool) (l1 l2:list bool) : Pure (list bool)\n (requires List.Tot.length l1 = List.Tot.length l2)\n (ensures fun l -> List.Tot.length l = List.Tot.length l1) =\n match l1,l2 with\n | [],[] -> []\n | x1::t1,x2::t2 -> f x1 x2 :: bitwise_op f t1 t2\n\n\nlet rec lemma_bitwise_op_index (f:bool->bool->bool) (l1 l2:list bool) (n:nat) : Lemma\n (requires List.Tot.length l1 = List.Tot.length l2 /\\ n < List.Tot.length l1)\n (ensures List.Tot.index (bitwise_op f l1 l2) n = f (List.Tot.index l1 n) (List.Tot.index l2 n)) =\n match l1,l2 with\n | [],[] -> ()\n | x1::t1,x2::t2 ->\n if n = 0 then ()\n else lemma_bitwise_op_index f t1 t2 (n-1)\n\nlet rec list_to_seq (#a:Type) (l:list a) : (s:(S.seq a){S.length s = List.Tot.length l /\\ (forall i. S.index s i == List.Tot.index l i)}) =\n match l with\n | [] -> S.empty\n | h :: t -> S.(create 1 h @| list_to_seq t)\n\nlet rec rev_seq (#a:Type) (s:S.seq a) : Pure (S.seq a)\n (requires True)\n (ensures fun s' -> S.length s = S.length s')\n (decreases (S.length s)) =\n if S.length s = 0 then S.empty\n else\n let _ = S.lemma_empty s in\n S.(rev_seq S.(slice s 1 (length s)) @| create 1 (index s 0))\n\n\nlet rec lemma_rev_seq (#a:Type) (s:S.seq a) (i:nat) : Lemma\n (requires i < S.length s)\n (ensures\n S.length (rev_seq s) = S.length s /\\\n S.index s i == S.index (rev_seq s) (S.length s-1-i))\n (decreases (i))=\n if S.length s = 0 then ()\n else if i = 0 then ()\n else lemma_rev_seq (S.slice s 1 (S.length s)) (i-1)\n\n#restart-solver\n\nlet lemma_arithmetic1 (a b c d e:int) : Lemma\n ((a+b+c+d)+(e-d) = (a+c+e)+b) =\n ()\n\nlet lemma_arithmetic2 (a b c d:int) : Lemma\n (a+(b-c)+d = a + ((b+d)-c)) =\n ()\n\nlet lemma_arithmetic3 (a b c:int) : Lemma\n ((a+b)-c = (a-c)+b) =\n ()\n\n\nlet lemma_propagate_mul_mod (a b:nat) : Lemma\n (requires b > 0)\n (ensures (\n let open FStar.Mul in\n (2*a) % (2*b) = 2 * (a % b))) =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_div_mod a b;\n lemma_div_mod (2*a) b;\n let (p,r) = ((a/b)*(2*b), 2*(a%b)) in\n assert (2*a = p + r);\n modulo_distributivity p r (2*b);\n multiple_modulo_lemma (a/b) (2*b);\n modulo_range_lemma a b;\n small_mod r (2*b)\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1 --z3rlimit 256\" // strange that F* has so much trouble completing this induction\nlet recompose_pow2_assoc (n:pos) (a:nat) : Lemma\n (let open FStar.Mul in 2 * (pow2 (n-1) * a) = pow2 n * a) =\n ()\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1 --z3rlimit 512\" // strange that F* has so much trouble completing this induction\nlet rec lemma_propagate_pow_mod (a b n:nat) : Lemma\n (requires b > 0)\n (ensures (\n let open FStar.Mul in\n (pow2 n * a) % (pow2 n * b) = pow2 n * (a % b))) =\n let open FStar.Mul in\n let open FStar.Math.Lemmas in\n if n = 0 then ()\n else begin\n let res = (pow2 n * a) % (pow2 n * b) in\n lemma_propagate_mul_mod (pow2 (n-1) * a) (pow2 (n-1) * b);\n assert (res = 2 * ((pow2 (n-1) * a) % (pow2 (n-1) * b)));\n lemma_propagate_pow_mod a b (n-1);\n assert (res = 2 * (pow2 (n-1) * (a%b)));\n recompose_pow2_assoc n (a%b)\n end\n#pop-options\n\n\n#restart-solver\nlet lemma_modulo_shift_byte (a:nat) (i:pos) : Lemma\n (let open FStar.Mul in\n (pow2 8 * a) % (pow2 (8*i)) = pow2 8 * (a % pow2 (8*(i-1)))) =\n let sub = 8 `op_Multiply` (i-1) in\n FStar.Math.Lemmas.pow2_plus 8 sub;\n lemma_propagate_pow_mod a (pow2 sub) 8\n\nlet rec reveal_be_to_n_slice (b:bytes) (i j:nat) : Lemma\n (requires i < j /\\ j <= S.length b)\n (ensures (\n let open FStar.Mul in\n let open FStar.Endianness in\n let h = U8.v (S.index b (j-1)) in\n be_to_n (S.slice b i j) = h + pow2 8 * be_to_n (S.slice b i (j - 1)))) =\n FStar.Endianness.reveal_be_to_n (S.slice b i j)\n\nlet rec lemma_correctness_slice_be_to_n (b:bytes) (i:nat) : Lemma\n (requires i <= S.length b)\n (ensures (\n let open FStar.Endianness in\n let open FStar.Mul in\n be_to_n b % pow2 (8 * i) =\n be_to_n (S.slice b (S.length b - i) (S.length b))))", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: QUIC.Spec.Base.bytes -> i: Prims.nat\n -> FStar.Pervasives.Lemma (requires i <= FStar.Seq.Base.length b)\n (ensures\n FStar.Endianness.be_to_n b % Prims.pow2 (8 * i) =\n FStar.Endianness.be_to_n (FStar.Seq.Base.slice b\n (FStar.Seq.Base.length b - i)\n (FStar.Seq.Base.length b)))\n (decreases i)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma", "" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bytes", "Prims.nat", "Prims.op_Equality", "Prims.int", "FStar.Endianness.reveal_be_to_n", "FStar.Seq.Base.empty", "FStar.UInt8.t", "Prims.bool", "FStar.Math.Lemmas.small_mod", "FStar.Endianness.be_to_n", "FStar.Seq.Base.slice", "QUIC.Spec.Base.byte", "Prims.op_Subtraction", "FStar.Seq.Base.length", "Prims.unit", "FStar.Endianness.lemma_be_to_n_is_bounded", "QUIC.Spec.Lemmas.reveal_be_to_n_slice", "QUIC.Spec.Lemmas.lemma_correctness_slice_be_to_n", "QUIC.Spec.Lemmas.lemma_modulo_shift_byte", "FStar.Math.Lemmas.pow2_le_compat", "FStar.Mul.op_Star", "FStar.Math.Lemmas.modulo_distributivity", "Prims.pow2", "Prims.pos", "FStar.Seq.Base.seq", "FStar.UInt.uint_t", "FStar.UInt8.v", "FStar.Seq.Base.index", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.squash", "Prims.op_Modulus", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_correctness_slice_be_to_n (b: bytes) (i: nat)\n : Lemma (requires i <= S.length b)\n (ensures\n (let open FStar.Endianness in\n let open FStar.Mul in\n be_to_n b % pow2 (8 * i) = be_to_n (S.slice b (S.length b - i) (S.length b))))\n (decreases i)\nlet rec lemma_correctness_slice_be_to_n (b: bytes) (i: nat)\n : Lemma (requires i <= S.length b)\n (ensures\n (let open FStar.Endianness in\n let open FStar.Mul in\n be_to_n b % pow2 (8 * i) = be_to_n (S.slice b (S.length b - i) (S.length b))))\n (decreases i) =", "completed_definiton": "let open FStar.Endianness in\nlet open FStar.Math.Lemmas in\nlet open FStar.Mul in\nif i = 0\nthen reveal_be_to_n S.empty\nelse\n (reveal_be_to_n b;\n let h = U8.v (S.index b (S.length b - 1)) in\n let l = S.slice b 0 (S.length b - 1) in\n let pow = pow2 (8 * i) in\n modulo_distributivity h (pow2 8 * be_to_n l) pow;\n pow2_le_compat (8 * i) 8;\n small_mod h pow;\n lemma_modulo_shift_byte (be_to_n l) i;\n lemma_correctness_slice_be_to_n l (i - 1);\n reveal_be_to_n_slice b (S.length b - i) (S.length b);\n lemma_be_to_n_is_bounded (S.slice b (S.length b - i) (S.length b));\n FStar.Math.Lemmas.small_mod (be_to_n (S.slice b (S.length b - i) (S.length b))) pow)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.reveal_be_to_n_slice", "original_source_type": "val reveal_be_to_n_slice (b: bytes) (i j: nat)\n : Lemma (requires i < j /\\ j <= S.length b)\n (ensures\n (let open FStar.Mul in\n let open FStar.Endianness in\n let h = U8.v (S.index b (j - 1)) in\n be_to_n (S.slice b i j) = h + pow2 8 * be_to_n (S.slice b i (j - 1))))", "source_type": "val reveal_be_to_n_slice (b: bytes) (i j: nat)\n : Lemma (requires i < j /\\ j <= S.length b)\n (ensures\n (let open FStar.Mul in\n let open FStar.Endianness in\n let h = U8.v (S.index b (j - 1)) in\n be_to_n (S.slice b i j) = h + pow2 8 * be_to_n (S.slice b i (j - 1))))", "source_definition": "let rec reveal_be_to_n_slice (b:bytes) (i j:nat) : Lemma\n (requires i < j /\\ j <= S.length b)\n (ensures (\n let open FStar.Mul in\n let open FStar.Endianness in\n let h = U8.v (S.index b (j-1)) in\n be_to_n (S.slice b i j) = h + pow2 8 * be_to_n (S.slice b i (j - 1)))) =\n FStar.Endianness.reveal_be_to_n (S.slice b i j)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 660, "start_col": 2, "end_line": 660, "end_col": 49 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')\n\n#pop-options\n\nlet pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0\n ))\n= S.lemma_split a pos_split;\n pointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos\n\nlet pointwise_op_slice_other\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n (from to: nat)\n: Lemma\n (requires (\n S.length b2 + pos <= S.length b1 /\\\n from <= to /\\\n to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)\n ))\n (ensures (\n S.slice (pointwise_op f b1 b2 pos) from to `S.equal` S.slice b1 from to\n ))\n= let phi\n (i: nat { from <= i /\\ i < to })\n : Lemma\n (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i)\n = if to <= pos\n then pointwise_index1 f b1 b2 i pos\n else pointwise_index3 f b1 b2 i pos\n in\n Classical.forall_intro phi\n\n\n// application: byte-wise xor\nlet xor_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logxor b1 b2 pos\n\n\n// proof of involution of the operator (uses extensionality for the\n// byte-wise variant)\nlet xor_involutive (b1 b2:byte) : Lemma\n (requires True)\n (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1) =\n FStar.UInt.logxor_associative (U8.v b1) (U8.v b2) (U8.v b2);\n FStar.UInt.logxor_self (U8.v b2);\n FStar.UInt.logxor_commutative (FStar.UInt.zero 8) (U8.v b1);\n FStar.UInt.logxor_lemma_1 (U8.v b1)\n\n\nlet xor_inplace_involutive (b1 b2:bytes) (pos:nat) : Lemma\n (requires S.length b2 + pos <= S.length b1)\n (ensures S.equal (xor_inplace (xor_inplace b1 b2 pos) b2 pos) b1)\n (decreases (S.length b2)) =\n let xor = xor_inplace (xor_inplace b1 b2 pos) b2 pos in\n let step (i:nat{i < S.length b1}) : Lemma (S.index xor i = S.index b1 i) =\n if i < pos then begin\n pointwise_index1 U8.logxor b1 b2 i pos;\n pointwise_index1 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else if i >= pos+S.length b2 then begin\n pointwise_index3 U8.logxor b1 b2 i pos;\n pointwise_index3 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else begin\n pointwise_index2 U8.logxor b1 b2 i pos;\n pointwise_index2 U8.logxor (xor_inplace b1 b2 pos) b2 i pos;\n xor_involutive (S.index b1 i) (S.index b2 (i-pos))\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet xor_inplace_commutative (b b1 b2:bytes) (pos1 pos2:nat) : Lemma\n (requires\n S.length b1 + pos1 <= S.length b /\\\n S.length b2 + pos2 <= S.length b)\n (ensures S.equal\n (xor_inplace (xor_inplace b b1 pos1) b2 pos2)\n (xor_inplace (xor_inplace b b2 pos2) b1 pos1)) =\n let xor1 = xor_inplace (xor_inplace b b1 pos1) b2 pos2 in\n let xor2 = xor_inplace (xor_inplace b b2 pos2) b1 pos1 in\n let step (i:nat{i < S.length b}) : Lemma (S.index xor1 i = S.index xor2 i) =\n if i < pos1 then begin\n pointwise_index1 U8.logxor b b1 i pos1;\n pointwise_index1 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else if i >= pos1 + S.length b1 then begin\n pointwise_index3 U8.logxor b b1 i pos1;\n pointwise_index3 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else begin\n pointwise_index2 U8.logxor b b1 i pos1;\n pointwise_index2 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n let ind = U8.v (S.index b i) in\n let ind1 = U8.v (S.index b1 (i-pos1)) in\n let ind2 = U8.v (S.index b2 (i-pos2)) in\n FStar.UInt.logxor_associative #8 ind ind1 ind2;\n FStar.UInt.logxor_associative #8 ind ind2 ind1;\n FStar.UInt.logxor_commutative #8 ind1 ind2;\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end in\n\n FStar.Classical.forall_intro step\n\nlet xor_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (pos: nat)\n: Lemma\n (requires (pos + S.length b <= S.length a))\n (ensures (xor_inplace a b pos `S.equal` a))\n= let psi\n (i: nat {i < S.length a})\n : Lemma\n (S.index (xor_inplace a b pos) i == S.index a i)\n = if i < pos\n then pointwise_index1 U8.logxor a b i pos\n else if i >= pos + S.length b\n then pointwise_index3 U8.logxor a b i pos\n else begin\n pointwise_index2 U8.logxor a b i pos;\n phi (i - pos);\n FStar.UInt.logxor_lemma_1 (U8.v (S.index a i))\n end\n in\n Classical.forall_intro psi\n\nlet and_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logand b1 b2 pos\n\nlet and_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (i: nat {i < S.length a})\n: Lemma\n (requires (S.length b == S.length a))\n (ensures (S.index (and_inplace a b 0) i == 0uy))\n= pointwise_index2 U8.logand a b i 0;\n phi i;\n FStar.UInt.logand_lemma_1 (U8.v (S.index a i))\n\nlet rec bitwise_op (f:bool->bool->bool) (l1 l2:list bool) : Pure (list bool)\n (requires List.Tot.length l1 = List.Tot.length l2)\n (ensures fun l -> List.Tot.length l = List.Tot.length l1) =\n match l1,l2 with\n | [],[] -> []\n | x1::t1,x2::t2 -> f x1 x2 :: bitwise_op f t1 t2\n\n\nlet rec lemma_bitwise_op_index (f:bool->bool->bool) (l1 l2:list bool) (n:nat) : Lemma\n (requires List.Tot.length l1 = List.Tot.length l2 /\\ n < List.Tot.length l1)\n (ensures List.Tot.index (bitwise_op f l1 l2) n = f (List.Tot.index l1 n) (List.Tot.index l2 n)) =\n match l1,l2 with\n | [],[] -> ()\n | x1::t1,x2::t2 ->\n if n = 0 then ()\n else lemma_bitwise_op_index f t1 t2 (n-1)\n\nlet rec list_to_seq (#a:Type) (l:list a) : (s:(S.seq a){S.length s = List.Tot.length l /\\ (forall i. S.index s i == List.Tot.index l i)}) =\n match l with\n | [] -> S.empty\n | h :: t -> S.(create 1 h @| list_to_seq t)\n\nlet rec rev_seq (#a:Type) (s:S.seq a) : Pure (S.seq a)\n (requires True)\n (ensures fun s' -> S.length s = S.length s')\n (decreases (S.length s)) =\n if S.length s = 0 then S.empty\n else\n let _ = S.lemma_empty s in\n S.(rev_seq S.(slice s 1 (length s)) @| create 1 (index s 0))\n\n\nlet rec lemma_rev_seq (#a:Type) (s:S.seq a) (i:nat) : Lemma\n (requires i < S.length s)\n (ensures\n S.length (rev_seq s) = S.length s /\\\n S.index s i == S.index (rev_seq s) (S.length s-1-i))\n (decreases (i))=\n if S.length s = 0 then ()\n else if i = 0 then ()\n else lemma_rev_seq (S.slice s 1 (S.length s)) (i-1)\n\n#restart-solver\n\nlet lemma_arithmetic1 (a b c d e:int) : Lemma\n ((a+b+c+d)+(e-d) = (a+c+e)+b) =\n ()\n\nlet lemma_arithmetic2 (a b c d:int) : Lemma\n (a+(b-c)+d = a + ((b+d)-c)) =\n ()\n\nlet lemma_arithmetic3 (a b c:int) : Lemma\n ((a+b)-c = (a-c)+b) =\n ()\n\n\nlet lemma_propagate_mul_mod (a b:nat) : Lemma\n (requires b > 0)\n (ensures (\n let open FStar.Mul in\n (2*a) % (2*b) = 2 * (a % b))) =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_div_mod a b;\n lemma_div_mod (2*a) b;\n let (p,r) = ((a/b)*(2*b), 2*(a%b)) in\n assert (2*a = p + r);\n modulo_distributivity p r (2*b);\n multiple_modulo_lemma (a/b) (2*b);\n modulo_range_lemma a b;\n small_mod r (2*b)\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1 --z3rlimit 256\" // strange that F* has so much trouble completing this induction\nlet recompose_pow2_assoc (n:pos) (a:nat) : Lemma\n (let open FStar.Mul in 2 * (pow2 (n-1) * a) = pow2 n * a) =\n ()\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1 --z3rlimit 512\" // strange that F* has so much trouble completing this induction\nlet rec lemma_propagate_pow_mod (a b n:nat) : Lemma\n (requires b > 0)\n (ensures (\n let open FStar.Mul in\n (pow2 n * a) % (pow2 n * b) = pow2 n * (a % b))) =\n let open FStar.Mul in\n let open FStar.Math.Lemmas in\n if n = 0 then ()\n else begin\n let res = (pow2 n * a) % (pow2 n * b) in\n lemma_propagate_mul_mod (pow2 (n-1) * a) (pow2 (n-1) * b);\n assert (res = 2 * ((pow2 (n-1) * a) % (pow2 (n-1) * b)));\n lemma_propagate_pow_mod a b (n-1);\n assert (res = 2 * (pow2 (n-1) * (a%b)));\n recompose_pow2_assoc n (a%b)\n end\n#pop-options\n\n\n#restart-solver\nlet lemma_modulo_shift_byte (a:nat) (i:pos) : Lemma\n (let open FStar.Mul in\n (pow2 8 * a) % (pow2 (8*i)) = pow2 8 * (a % pow2 (8*(i-1)))) =\n let sub = 8 `op_Multiply` (i-1) in\n FStar.Math.Lemmas.pow2_plus 8 sub;\n lemma_propagate_pow_mod a (pow2 sub) 8\n\nlet rec reveal_be_to_n_slice (b:bytes) (i j:nat) : Lemma\n (requires i < j /\\ j <= S.length b)\n (ensures (\n let open FStar.Mul in\n let open FStar.Endianness in\n let h = U8.v (S.index b (j-1)) in", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: QUIC.Spec.Base.bytes -> i: Prims.nat -> j: Prims.nat\n -> FStar.Pervasives.Lemma (requires i < j /\\ j <= FStar.Seq.Base.length b)\n (ensures\n (let h = FStar.UInt8.v (FStar.Seq.Base.index b (j - 1)) in\n FStar.Endianness.be_to_n (FStar.Seq.Base.slice b i j) =\n h + Prims.pow2 8 * FStar.Endianness.be_to_n (FStar.Seq.Base.slice b i (j - 1))))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bytes", "Prims.nat", "FStar.Endianness.reveal_be_to_n", "FStar.Seq.Base.slice", "QUIC.Spec.Base.byte", "Prims.unit", "Prims.l_and", "Prims.b2t", "Prims.op_LessThan", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "Prims.squash", "Prims.op_Equality", "Prims.int", "FStar.Endianness.be_to_n", "Prims.op_Addition", "FStar.Mul.op_Star", "Prims.pow2", "Prims.op_Subtraction", "FStar.UInt.uint_t", "FStar.UInt8.v", "FStar.Seq.Base.index", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val reveal_be_to_n_slice (b: bytes) (i j: nat)\n : Lemma (requires i < j /\\ j <= S.length b)\n (ensures\n (let open FStar.Mul in\n let open FStar.Endianness in\n let h = U8.v (S.index b (j - 1)) in\n be_to_n (S.slice b i j) = h + pow2 8 * be_to_n (S.slice b i (j - 1))))\nlet rec reveal_be_to_n_slice (b: bytes) (i j: nat)\n : Lemma (requires i < j /\\ j <= S.length b)\n (ensures\n (let open FStar.Mul in\n let open FStar.Endianness in\n let h = U8.v (S.index b (j - 1)) in\n be_to_n (S.slice b i j) = h + pow2 8 * be_to_n (S.slice b i (j - 1)))) =", "completed_definiton": "FStar.Endianness.reveal_be_to_n (S.slice b i j)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.index_be_to_n", "original_source_type": "val index_be_to_n (b: bytes) (i: nat)\n : Lemma (requires (i < S.length b))\n (ensures\n (U8.v (FStar.Seq.index b i) ==\n (FStar.Endianness.be_to_n b / pow2 (8 * (S.length b - 1 - i))) % pow2 8))\n (decreases (S.length b))", "source_type": "val index_be_to_n (b: bytes) (i: nat)\n : Lemma (requires (i < S.length b))\n (ensures\n (U8.v (FStar.Seq.index b i) ==\n (FStar.Endianness.be_to_n b / pow2 (8 * (S.length b - 1 - i))) % pow2 8))\n (decreases (S.length b))", "source_definition": "let rec index_be_to_n\n (b: bytes)\n (i: nat)\n: Lemma\n (requires (\n i < S.length b\n ))\n (ensures (\n U8.v (FStar.Seq.index b i) == (FStar.Endianness.be_to_n b / pow2 (8 * (S.length b - 1 - i))) % pow2 8\n ))\n (decreases (S.length b))\n= let open FStar.Endianness in\n reveal_be_to_n b;\n if i = S.length b - 1\n then ()\n else begin\n let l = S.length b in\n let l' = l - 1 in\n let b' = S.slice b 0 l' in\n index_be_to_n b' i;\n assert (FStar.Seq.index b i == FStar.Seq.index b' i);\n let open FStar.Math.Lemmas in\n let x = be_to_n b in\n let x' = be_to_n b' in\n assert (U8.v (FStar.Seq.index b i) == x' / pow2 (8 * (l' - 1 - i)) % pow2 8);\n let y = (U8.v (S.last b) + pow2 8 * x') / pow2 (8 * (l - 1 - i)) % pow2 8 in\n pow2_plus 8 (8 * (l' - 1 - i));\n division_multiplication_lemma (U8.v (S.last b) + pow2 8 * x') (pow2 8) (pow2 (8 * (l' - 1 - i)));\n assert (pow2 8 * x' == x' * pow2 8);\n division_addition_lemma (U8.v (S.last b)) (pow2 8) x';\n small_division_lemma_1 (U8.v (S.last b)) (pow2 8);\n assert (y == x' / pow2 (8 * (l' - 1 - i)) % pow2 8)\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 706, "start_col": 2, "end_line": 727, "end_col": 5 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')\n\n#pop-options\n\nlet pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0\n ))\n= S.lemma_split a pos_split;\n pointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos\n\nlet pointwise_op_slice_other\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n (from to: nat)\n: Lemma\n (requires (\n S.length b2 + pos <= S.length b1 /\\\n from <= to /\\\n to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)\n ))\n (ensures (\n S.slice (pointwise_op f b1 b2 pos) from to `S.equal` S.slice b1 from to\n ))\n= let phi\n (i: nat { from <= i /\\ i < to })\n : Lemma\n (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i)\n = if to <= pos\n then pointwise_index1 f b1 b2 i pos\n else pointwise_index3 f b1 b2 i pos\n in\n Classical.forall_intro phi\n\n\n// application: byte-wise xor\nlet xor_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logxor b1 b2 pos\n\n\n// proof of involution of the operator (uses extensionality for the\n// byte-wise variant)\nlet xor_involutive (b1 b2:byte) : Lemma\n (requires True)\n (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1) =\n FStar.UInt.logxor_associative (U8.v b1) (U8.v b2) (U8.v b2);\n FStar.UInt.logxor_self (U8.v b2);\n FStar.UInt.logxor_commutative (FStar.UInt.zero 8) (U8.v b1);\n FStar.UInt.logxor_lemma_1 (U8.v b1)\n\n\nlet xor_inplace_involutive (b1 b2:bytes) (pos:nat) : Lemma\n (requires S.length b2 + pos <= S.length b1)\n (ensures S.equal (xor_inplace (xor_inplace b1 b2 pos) b2 pos) b1)\n (decreases (S.length b2)) =\n let xor = xor_inplace (xor_inplace b1 b2 pos) b2 pos in\n let step (i:nat{i < S.length b1}) : Lemma (S.index xor i = S.index b1 i) =\n if i < pos then begin\n pointwise_index1 U8.logxor b1 b2 i pos;\n pointwise_index1 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else if i >= pos+S.length b2 then begin\n pointwise_index3 U8.logxor b1 b2 i pos;\n pointwise_index3 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else begin\n pointwise_index2 U8.logxor b1 b2 i pos;\n pointwise_index2 U8.logxor (xor_inplace b1 b2 pos) b2 i pos;\n xor_involutive (S.index b1 i) (S.index b2 (i-pos))\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet xor_inplace_commutative (b b1 b2:bytes) (pos1 pos2:nat) : Lemma\n (requires\n S.length b1 + pos1 <= S.length b /\\\n S.length b2 + pos2 <= S.length b)\n (ensures S.equal\n (xor_inplace (xor_inplace b b1 pos1) b2 pos2)\n (xor_inplace (xor_inplace b b2 pos2) b1 pos1)) =\n let xor1 = xor_inplace (xor_inplace b b1 pos1) b2 pos2 in\n let xor2 = xor_inplace (xor_inplace b b2 pos2) b1 pos1 in\n let step (i:nat{i < S.length b}) : Lemma (S.index xor1 i = S.index xor2 i) =\n if i < pos1 then begin\n pointwise_index1 U8.logxor b b1 i pos1;\n pointwise_index1 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else if i >= pos1 + S.length b1 then begin\n pointwise_index3 U8.logxor b b1 i pos1;\n pointwise_index3 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else begin\n pointwise_index2 U8.logxor b b1 i pos1;\n pointwise_index2 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n let ind = U8.v (S.index b i) in\n let ind1 = U8.v (S.index b1 (i-pos1)) in\n let ind2 = U8.v (S.index b2 (i-pos2)) in\n FStar.UInt.logxor_associative #8 ind ind1 ind2;\n FStar.UInt.logxor_associative #8 ind ind2 ind1;\n FStar.UInt.logxor_commutative #8 ind1 ind2;\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end in\n\n FStar.Classical.forall_intro step\n\nlet xor_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (pos: nat)\n: Lemma\n (requires (pos + S.length b <= S.length a))\n (ensures (xor_inplace a b pos `S.equal` a))\n= let psi\n (i: nat {i < S.length a})\n : Lemma\n (S.index (xor_inplace a b pos) i == S.index a i)\n = if i < pos\n then pointwise_index1 U8.logxor a b i pos\n else if i >= pos + S.length b\n then pointwise_index3 U8.logxor a b i pos\n else begin\n pointwise_index2 U8.logxor a b i pos;\n phi (i - pos);\n FStar.UInt.logxor_lemma_1 (U8.v (S.index a i))\n end\n in\n Classical.forall_intro psi\n\nlet and_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logand b1 b2 pos\n\nlet and_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (i: nat {i < S.length a})\n: Lemma\n (requires (S.length b == S.length a))\n (ensures (S.index (and_inplace a b 0) i == 0uy))\n= pointwise_index2 U8.logand a b i 0;\n phi i;\n FStar.UInt.logand_lemma_1 (U8.v (S.index a i))\n\nlet rec bitwise_op (f:bool->bool->bool) (l1 l2:list bool) : Pure (list bool)\n (requires List.Tot.length l1 = List.Tot.length l2)\n (ensures fun l -> List.Tot.length l = List.Tot.length l1) =\n match l1,l2 with\n | [],[] -> []\n | x1::t1,x2::t2 -> f x1 x2 :: bitwise_op f t1 t2\n\n\nlet rec lemma_bitwise_op_index (f:bool->bool->bool) (l1 l2:list bool) (n:nat) : Lemma\n (requires List.Tot.length l1 = List.Tot.length l2 /\\ n < List.Tot.length l1)\n (ensures List.Tot.index (bitwise_op f l1 l2) n = f (List.Tot.index l1 n) (List.Tot.index l2 n)) =\n match l1,l2 with\n | [],[] -> ()\n | x1::t1,x2::t2 ->\n if n = 0 then ()\n else lemma_bitwise_op_index f t1 t2 (n-1)\n\nlet rec list_to_seq (#a:Type) (l:list a) : (s:(S.seq a){S.length s = List.Tot.length l /\\ (forall i. S.index s i == List.Tot.index l i)}) =\n match l with\n | [] -> S.empty\n | h :: t -> S.(create 1 h @| list_to_seq t)\n\nlet rec rev_seq (#a:Type) (s:S.seq a) : Pure (S.seq a)\n (requires True)\n (ensures fun s' -> S.length s = S.length s')\n (decreases (S.length s)) =\n if S.length s = 0 then S.empty\n else\n let _ = S.lemma_empty s in\n S.(rev_seq S.(slice s 1 (length s)) @| create 1 (index s 0))\n\n\nlet rec lemma_rev_seq (#a:Type) (s:S.seq a) (i:nat) : Lemma\n (requires i < S.length s)\n (ensures\n S.length (rev_seq s) = S.length s /\\\n S.index s i == S.index (rev_seq s) (S.length s-1-i))\n (decreases (i))=\n if S.length s = 0 then ()\n else if i = 0 then ()\n else lemma_rev_seq (S.slice s 1 (S.length s)) (i-1)\n\n#restart-solver\n\nlet lemma_arithmetic1 (a b c d e:int) : Lemma\n ((a+b+c+d)+(e-d) = (a+c+e)+b) =\n ()\n\nlet lemma_arithmetic2 (a b c d:int) : Lemma\n (a+(b-c)+d = a + ((b+d)-c)) =\n ()\n\nlet lemma_arithmetic3 (a b c:int) : Lemma\n ((a+b)-c = (a-c)+b) =\n ()\n\n\nlet lemma_propagate_mul_mod (a b:nat) : Lemma\n (requires b > 0)\n (ensures (\n let open FStar.Mul in\n (2*a) % (2*b) = 2 * (a % b))) =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_div_mod a b;\n lemma_div_mod (2*a) b;\n let (p,r) = ((a/b)*(2*b), 2*(a%b)) in\n assert (2*a = p + r);\n modulo_distributivity p r (2*b);\n multiple_modulo_lemma (a/b) (2*b);\n modulo_range_lemma a b;\n small_mod r (2*b)\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1 --z3rlimit 256\" // strange that F* has so much trouble completing this induction\nlet recompose_pow2_assoc (n:pos) (a:nat) : Lemma\n (let open FStar.Mul in 2 * (pow2 (n-1) * a) = pow2 n * a) =\n ()\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1 --z3rlimit 512\" // strange that F* has so much trouble completing this induction\nlet rec lemma_propagate_pow_mod (a b n:nat) : Lemma\n (requires b > 0)\n (ensures (\n let open FStar.Mul in\n (pow2 n * a) % (pow2 n * b) = pow2 n * (a % b))) =\n let open FStar.Mul in\n let open FStar.Math.Lemmas in\n if n = 0 then ()\n else begin\n let res = (pow2 n * a) % (pow2 n * b) in\n lemma_propagate_mul_mod (pow2 (n-1) * a) (pow2 (n-1) * b);\n assert (res = 2 * ((pow2 (n-1) * a) % (pow2 (n-1) * b)));\n lemma_propagate_pow_mod a b (n-1);\n assert (res = 2 * (pow2 (n-1) * (a%b)));\n recompose_pow2_assoc n (a%b)\n end\n#pop-options\n\n\n#restart-solver\nlet lemma_modulo_shift_byte (a:nat) (i:pos) : Lemma\n (let open FStar.Mul in\n (pow2 8 * a) % (pow2 (8*i)) = pow2 8 * (a % pow2 (8*(i-1)))) =\n let sub = 8 `op_Multiply` (i-1) in\n FStar.Math.Lemmas.pow2_plus 8 sub;\n lemma_propagate_pow_mod a (pow2 sub) 8\n\nlet rec reveal_be_to_n_slice (b:bytes) (i j:nat) : Lemma\n (requires i < j /\\ j <= S.length b)\n (ensures (\n let open FStar.Mul in\n let open FStar.Endianness in\n let h = U8.v (S.index b (j-1)) in\n be_to_n (S.slice b i j) = h + pow2 8 * be_to_n (S.slice b i (j - 1)))) =\n FStar.Endianness.reveal_be_to_n (S.slice b i j)\n\nlet rec lemma_correctness_slice_be_to_n (b:bytes) (i:nat) : Lemma\n (requires i <= S.length b)\n (ensures (\n let open FStar.Endianness in\n let open FStar.Mul in\n be_to_n b % pow2 (8 * i) =\n be_to_n (S.slice b (S.length b - i) (S.length b))))\n (decreases i) =\n let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n if i = 0 then reveal_be_to_n S.empty\n else begin\n reveal_be_to_n b;\n let h = U8.v (S.index b (S.length b - 1)) in\n let l = S.slice b 0 (S.length b - 1) in\n let pow = pow2 (8*i) in\n //assert (be_to_n b = h + pow2 8 * be_to_n l);\n modulo_distributivity h (pow2 8 * be_to_n l) pow;\n pow2_le_compat (8*i) 8;\n small_mod h pow;\n //assert (be_to_n b % pow = (h + (pow2 8 * be_to_n l)%pow) % pow);\n lemma_modulo_shift_byte (be_to_n l) i;\n lemma_correctness_slice_be_to_n l (i-1);\n //assert (be_to_n b % pow = (h + pow2 8 * be_to_n (S.slice b (S.length b - i) (S.length b - 1))) % pow);\n reveal_be_to_n_slice b (S.length b - i) (S.length b);\n //assert (be_to_n b % pow = be_to_n (S.slice b (S.length b - i) (S.length b)) % pow);\n lemma_be_to_n_is_bounded (S.slice b (S.length b - i) (S.length b));\n FStar.Math.Lemmas.small_mod (be_to_n (S.slice b (S.length b - i) (S.length b))) pow\n end\n\nopen FStar.Mul\n\nlet rec index_be_to_n\n (b: bytes)\n (i: nat)\n: Lemma\n (requires (\n i < S.length b\n ))\n (ensures (\n U8.v (FStar.Seq.index b i) == (FStar.Endianness.be_to_n b / pow2 (8 * (S.length b - 1 - i))) % pow2 8\n ))", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: QUIC.Spec.Base.bytes -> i: Prims.nat\n -> FStar.Pervasives.Lemma (requires i < FStar.Seq.Base.length b)\n (ensures\n FStar.UInt8.v (FStar.Seq.Base.index b i) ==\n FStar.Endianness.be_to_n b / Prims.pow2 (8 * (FStar.Seq.Base.length b - 1 - i)) %\n Prims.pow2 8)\n (decreases FStar.Seq.Base.length b)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma", "" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bytes", "Prims.nat", "Prims.op_Equality", "Prims.int", "Prims.op_Subtraction", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "Prims.bool", "Prims._assert", "Prims.eq2", "Prims.op_Modulus", "Prims.op_Division", "Prims.pow2", "FStar.Mul.op_Star", "Prims.unit", "FStar.Math.Lemmas.small_division_lemma_1", "FStar.UInt8.v", "FStar.Seq.Properties.last", "FStar.Math.Lemmas.division_addition_lemma", "FStar.Math.Lemmas.division_multiplication_lemma", "Prims.op_Addition", "FStar.Math.Lemmas.pow2_plus", "FStar.Seq.Base.index", "FStar.Endianness.be_to_n", "QUIC.Spec.Lemmas.index_be_to_n", "FStar.Seq.Base.seq", "FStar.Seq.Base.slice", "FStar.Endianness.reveal_be_to_n", "Prims.b2t", "Prims.op_LessThan", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val index_be_to_n (b: bytes) (i: nat)\n : Lemma (requires (i < S.length b))\n (ensures\n (U8.v (FStar.Seq.index b i) ==\n (FStar.Endianness.be_to_n b / pow2 (8 * (S.length b - 1 - i))) % pow2 8))\n (decreases (S.length b))\nlet rec index_be_to_n (b: bytes) (i: nat)\n : Lemma (requires (i < S.length b))\n (ensures\n (U8.v (FStar.Seq.index b i) ==\n (FStar.Endianness.be_to_n b / pow2 (8 * (S.length b - 1 - i))) % pow2 8))\n (decreases (S.length b)) =", "completed_definiton": "let open FStar.Endianness in\nreveal_be_to_n b;\nif i = S.length b - 1\nthen ()\nelse\n let l = S.length b in\n let l' = l - 1 in\n let b' = S.slice b 0 l' in\n index_be_to_n b' i;\n assert (FStar.Seq.index b i == FStar.Seq.index b' i);\n let open FStar.Math.Lemmas in\n let x = be_to_n b in\n let x' = be_to_n b' in\n assert (U8.v (FStar.Seq.index b i) == x' / pow2 (8 * (l' - 1 - i)) % pow2 8);\n let y = (U8.v (S.last b) + pow2 8 * x') / pow2 (8 * (l - 1 - i)) % pow2 8 in\n pow2_plus 8 (8 * (l' - 1 - i));\n division_multiplication_lemma (U8.v (S.last b) + pow2 8 * x') (pow2 8) (pow2 (8 * (l' - 1 - i)));\n assert (pow2 8 * x' == x' * pow2 8);\n division_addition_lemma (U8.v (S.last b)) (pow2 8) x';\n small_division_lemma_1 (U8.v (S.last b)) (pow2 8);\n assert (y == x' / pow2 (8 * (l' - 1 - i)) % pow2 8)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.pointwise_op_dec", "original_source_type": "val pointwise_op_dec (#a: Type) (f: (a -> a -> a)) (a1 a2 b: S.seq a) (pos: nat)\n : Lemma\n (requires\n pos <= S.length a1 /\\ S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n (let open S in\n let b1, b2 = S.split b (length a1 - pos) in\n equal (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0)))", "source_type": "val pointwise_op_dec (#a: Type) (f: (a -> a -> a)) (a1 a2 b: S.seq a) (pos: nat)\n : Lemma\n (requires\n pos <= S.length a1 /\\ S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n (let open S in\n let b1, b2 = S.split b (length a1 - pos) in\n equal (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0)))", "source_definition": "let pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 317, "start_col": 2, "end_line": 336, "end_col": 35 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n f: (_: a -> _: a -> a) ->\n a1: FStar.Seq.Base.seq a ->\n a2: FStar.Seq.Base.seq a ->\n b: FStar.Seq.Base.seq a ->\n pos: Prims.nat\n -> FStar.Pervasives.Lemma\n (requires\n pos <= FStar.Seq.Base.length a1 /\\ FStar.Seq.Base.length a1 <= FStar.Seq.Base.length b + pos /\\\n FStar.Seq.Base.length b + pos <= FStar.Seq.Base.length a1 + FStar.Seq.Base.length a2)\n (ensures\n (let _ = FStar.Seq.Properties.split b (FStar.Seq.Base.length a1 - pos) in\n (let FStar.Pervasives.Native.Mktuple2 #_ #_ b1 b2 = _ in\n FStar.Seq.Base.equal (QUIC.Spec.Lemmas.pointwise_op f (a1 @| a2) b pos)\n (QUIC.Spec.Lemmas.pointwise_op f a1 b1 pos @| QUIC.Spec.Lemmas.pointwise_op f a2 b2 0)\n )\n <:\n Type0))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.nat", "FStar.Classical.forall_intro", "Prims.l_and", "Prims.b2t", "Prims.op_LessThan", "FStar.Seq.Base.length", "Prims.eq2", "FStar.Seq.Base.index", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern", "QUIC.Spec.Lemmas.pointwise_index1", "FStar.Seq.Base.op_At_Bar", "Prims.bool", "QUIC.Spec.Lemmas.pointwise_index2", "Prims.op_Addition", "Prims.op_Subtraction", "QUIC.Spec.Lemmas.pointwise_index3", "QUIC.Spec.Lemmas.pointwise_op", "FStar.Pervasives.Native.tuple2", "FStar.Seq.Properties.split", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.equal" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val pointwise_op_dec (#a: Type) (f: (a -> a -> a)) (a1 a2 b: S.seq a) (pos: nat)\n : Lemma\n (requires\n pos <= S.length a1 /\\ S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n (let open S in\n let b1, b2 = S.split b (length a1 - pos) in\n equal (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0)))\nlet pointwise_op_dec (#a: Type) (f: (a -> a -> a)) (a1 a2 b: S.seq a) (pos: nat)\n : Lemma\n (requires\n pos <= S.length a1 /\\ S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n (let open S in\n let b1, b2 = S.split b (length a1 - pos) in\n equal (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =", "completed_definiton": "let open S in\nlet b1, b2 = S.split b (length a1 - pos) in\nlet p = pointwise_op f (a1 @| a2) b pos in\nlet q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\nlet step i : Lemma (S.index p i == S.index q i) =\n if i < pos\n then\n (pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos)\n else\n if i < length a1\n then\n (pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos)\n else\n if i < length b + pos\n then\n (pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i - length a1) 0)\n else\n (pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i - length a1) 0)\nin\nFStar.Classical.forall_intro step", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.pointwise_op_append_r", "original_source_type": "val pointwise_op_append_r (#t: Type) (f: (t -> t -> t)) (a b1 b2: S.seq t) (pos: nat)\n : Lemma (requires (pos + S.length b1 + S.length b2 <= S.length a))\n (ensures\n (pointwise_op f a (S.append b1 b2) pos ==\n ((pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos)\n `S.append`\n (pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0))))", "source_type": "val pointwise_op_append_r (#t: Type) (f: (t -> t -> t)) (a b1 b2: S.seq t) (pos: nat)\n : Lemma (requires (pos + S.length b1 + S.length b2 <= S.length a))\n (ensures\n (pointwise_op f a (S.append b1 b2) pos ==\n ((pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos)\n `S.append`\n (pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0))))", "source_definition": "let pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 354, "start_col": 2, "end_line": 357, "end_col": 47 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n f: (_: t -> _: t -> t) ->\n a: FStar.Seq.Base.seq t ->\n b1: FStar.Seq.Base.seq t ->\n b2: FStar.Seq.Base.seq t ->\n pos: Prims.nat\n -> FStar.Pervasives.Lemma\n (requires pos + FStar.Seq.Base.length b1 + FStar.Seq.Base.length b2 <= FStar.Seq.Base.length a\n )\n (ensures\n QUIC.Spec.Lemmas.pointwise_op f a (FStar.Seq.Base.append b1 b2) pos ==\n FStar.Seq.Base.append (QUIC.Spec.Lemmas.pointwise_op f\n (FStar.Seq.Base.slice a 0 (pos + FStar.Seq.Base.length b1))\n b1\n pos)\n (QUIC.Spec.Lemmas.pointwise_op f\n (FStar.Seq.Base.slice a (pos + FStar.Seq.Base.length b1) (FStar.Seq.Base.length a))\n b2\n 0))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.nat", "Prims._assert", "Prims.l_and", "FStar.Seq.Base.equal", "Prims.unit", "FStar.Pervasives.Native.tuple2", "FStar.Seq.Properties.split", "FStar.Seq.Base.append", "FStar.Seq.Base.length", "QUIC.Spec.Lemmas.pointwise_op_dec", "FStar.Seq.Base.slice", "Prims.op_Addition", "FStar.Seq.Properties.lemma_split", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.squash", "Prims.eq2", "QUIC.Spec.Lemmas.pointwise_op", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val pointwise_op_append_r (#t: Type) (f: (t -> t -> t)) (a b1 b2: S.seq t) (pos: nat)\n : Lemma (requires (pos + S.length b1 + S.length b2 <= S.length a))\n (ensures\n (pointwise_op f a (S.append b1 b2) pos ==\n ((pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos)\n `S.append`\n (pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0))))\nlet pointwise_op_append_r (#t: Type) (f: (t -> t -> t)) (a b1 b2: S.seq t) (pos: nat)\n : Lemma (requires (pos + S.length b1 + S.length b2 <= S.length a))\n (ensures\n (pointwise_op f a (S.append b1 b2) pos ==\n ((pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos)\n `S.append`\n (pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0)))) =", "completed_definiton": "S.lemma_split a (pos + S.length b1);\npointwise_op_dec f\n (S.slice a 0 (pos + S.length b1))\n (S.slice a (pos + S.length b1) (S.length a))\n (S.append b1 b2)\n pos;\nlet b1', b2' = S.split (b1 `S.append` b2) (S.length b1) in\nassert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.extensionality_slice", "original_source_type": "val extensionality_slice (#a: Type) (b1 b2: S.seq a) (i j: nat)\n : Lemma\n (requires\n S.length b1 = S.length b2 /\\ i <= j /\\ j <= S.length b1 /\\\n (forall (k: nat{i <= k /\\ k < j}). S.index b1 k == S.index b2 k))\n (ensures S.equal (S.slice b1 i j) (S.slice b2 i j))", "source_type": "val extensionality_slice (#a: Type) (b1 b2: S.seq a) (i j: nat)\n : Lemma\n (requires\n S.length b1 = S.length b2 /\\ i <= j /\\ j <= S.length b1 /\\\n (forall (k: nat{i <= k /\\ k < j}). S.index b1 k == S.index b2 k))\n (ensures S.equal (S.slice b1 i j) (S.slice b2 i j))", "source_definition": "let extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ k= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b1: FStar.Seq.Base.seq a -> b2: FStar.Seq.Base.seq a -> i: Prims.nat -> j: Prims.nat\n -> FStar.Pervasives.Lemma\n (requires\n FStar.Seq.Base.length b1 = FStar.Seq.Base.length b2 /\\ i <= j /\\\n j <= FStar.Seq.Base.length b1 /\\\n (forall (k: Prims.nat{i <= k /\\ k < j}).\n FStar.Seq.Base.index b1 k == FStar.Seq.Base.index b2 k))\n (ensures FStar.Seq.Base.equal (FStar.Seq.Base.slice b1 i j) (FStar.Seq.Base.slice b2 i j))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.nat", "FStar.Classical.forall_intro", "Prims.b2t", "Prims.op_LessThan", "Prims.op_Subtraction", "Prims.eq2", "FStar.Seq.Base.index", "FStar.Seq.Base.slice", "Prims.op_Addition", "Prims.unit", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "Prims.l_True", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern", "Prims.l_and", "Prims.op_Equality", "Prims.l_Forall", "FStar.Seq.Base.equal" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val extensionality_slice (#a: Type) (b1 b2: S.seq a) (i j: nat)\n : Lemma\n (requires\n S.length b1 = S.length b2 /\\ i <= j /\\ j <= S.length b1 /\\\n (forall (k: nat{i <= k /\\ k < j}). S.index b1 k == S.index b2 k))\n (ensures S.equal (S.slice b1 i j) (S.slice b2 i j))\nlet extensionality_slice (#a: Type) (b1 b2: S.seq a) (i j: nat)\n : Lemma\n (requires\n S.length b1 = S.length b2 /\\ i <= j /\\ j <= S.length b1 /\\\n (forall (k: nat{i <= k /\\ k < j}). S.index b1 k == S.index b2 k))\n (ensures S.equal (S.slice b1 i j) (S.slice b2 i j)) =", "completed_definiton": "let index_slice_aux (b: S.seq a) (i j k: nat)\n : Lemma (requires i <= j /\\ j <= S.length b /\\ k < j - i)\n (ensures S.index (S.slice b i j) k == S.index b (i + k)) =\n ()\nin\nlet index_slice (b: S.seq a {j <= S.length b}) (k: nat{k < j - i})\n : Lemma (S.index (S.slice b i j) k == S.index b (i + k)) =\n index_slice_aux b i j k\nin\nFStar.Classical.forall_intro (index_slice b1);\nFStar.Classical.forall_intro (index_slice b2)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.lemma_be_index", "original_source_type": "val lemma_be_index (l: pos) (n: nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma\n (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0) == n / pow2 (8 `op_Multiply` (l - 1))\n ) (decreases %[l])", "source_type": "val lemma_be_index (l: pos) (n: nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma\n (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0) == n / pow2 (8 `op_Multiply` (l - 1))\n ) (decreases %[l])", "source_definition": "let rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 80, "start_col": 2, "end_line": 95, "end_col": 37 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 20, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "l: Prims.pos -> n: Prims.nat{n < Prims.pow2 (8 * l)}\n -> FStar.Pervasives.Lemma\n (ensures\n FStar.UInt8.v (FStar.Seq.Base.index (FStar.Endianness.n_to_be l n) 0) ==\n n / Prims.pow2 (8 * (l - 1))) (decreases l)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma", "" ], "mutual_with": [], "ideal_premises": [ "Prims.pos", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Prims.pow2", "Prims.op_Multiply", "Prims.op_Equality", "Prims.int", "Prims.bool", "QUIC.Spec.Lemmas.lemma_div_sub_small", "FStar.UInt8.v", "Prims.unit", "QUIC.Spec.Lemmas.lemma_pow2_div2", "Prims.op_Subtraction", "FStar.Mul.op_Star", "QUIC.Spec.Lemmas.lemma_be_index", "FStar.Endianness.be_to_n", "FStar.Endianness.lemma_be_to_n_is_bounded", "Prims._assert", "Prims.eq2", "Prims.op_Modulus", "FStar.Endianness.reveal_be_to_n", "FStar.UInt8.t", "FStar.Seq.Base.index", "FStar.Seq.Base.seq", "FStar.Seq.Base.slice", "FStar.Seq.Properties.last", "FStar.Endianness.bytes", "Prims.l_and", "FStar.Seq.Base.length", "FStar.Endianness.n_to_be", "Prims.l_True", "Prims.squash", "Prims.op_Division", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_be_index (l: pos) (n: nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma\n (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0) == n / pow2 (8 `op_Multiply` (l - 1))\n ) (decreases %[l])\nlet rec lemma_be_index (l: pos) (n: nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma\n (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0) == n / pow2 (8 `op_Multiply` (l - 1))\n ) (decreases %[l]) =", "completed_definiton": "let open FStar.Endianness in\nlet open FStar.Mul in\nlet b = n_to_be l n in\nlet b0 = S.index b 0 in\nreveal_be_to_n b;\nif l = 1\nthen ()\nelse\n let b1 = S.last b in\n let b' = S.slice b 0 (l - 1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert (U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l - 1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l - 1) - 8);\n lemma_div_sub_small l n (U8.v b1)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.pointwise_index3", "original_source_type": "val pointwise_index3 (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (i pos: nat)\n : Lemma (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2))", "source_type": "val pointwise_index3 (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (i pos: nat)\n : Lemma (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2))", "source_definition": "let rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 232, "start_col": 2, "end_line": 237, "end_col": 5 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n f: (_: a -> _: a -> a) ->\n b1: FStar.Seq.Base.seq a ->\n b2: FStar.Seq.Base.seq a ->\n i: Prims.nat ->\n pos: Prims.nat\n -> FStar.Pervasives.Lemma\n (requires FStar.Seq.Base.length b2 + pos <= i /\\ i < FStar.Seq.Base.length b1)\n (ensures\n FStar.Seq.Base.index (QUIC.Spec.Lemmas.pointwise_op f b1 b2 pos) i ==\n FStar.Seq.Base.index b1 i)\n (decreases FStar.Seq.Base.length b2)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma", "" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.nat", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "Prims.bool", "QUIC.Spec.Lemmas.pointwise_index3", "FStar.Seq.Base.upd", "FStar.Seq.Base.slice", "Prims.op_Addition", "FStar.Seq.Base.index", "Prims.unit", "FStar.Seq.Base.lemma_empty", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "Prims.squash", "Prims.eq2", "QUIC.Spec.Lemmas.pointwise_op", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val pointwise_index3 (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (i pos: nat)\n : Lemma (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2))\nlet rec pointwise_index3 (#a: Type) (f: (a -> a -> a)) (b1 b2: S.seq a) (i pos: nat)\n : Lemma (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =", "completed_definiton": "if Seq.length b2 = 0\nthen ()\nelse\n (S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1))", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.index_n_to_be", "original_source_type": "val index_n_to_be (len n i: nat)\n : Lemma (requires (i < len /\\ n < pow2 (8 * len)))\n (ensures\n (U8.v (FStar.Seq.index (FStar.Endianness.n_to_be len n) i)) ==\n (n / pow2 (8 * (len - 1 - i)) % pow2 8))", "source_type": "val index_n_to_be (len n i: nat)\n : Lemma (requires (i < len /\\ n < pow2 (8 * len)))\n (ensures\n (U8.v (FStar.Seq.index (FStar.Endianness.n_to_be len n) i)) ==\n (n / pow2 (8 * (len - 1 - i)) % pow2 8))", "source_definition": "let index_n_to_be\n (len: nat)\n (n: nat)\n (i: nat)\n: Lemma\n (requires (\n i < len /\\\n n < pow2 (8 * len)\n ))\n (ensures (\n U8.v (FStar.Seq.index (FStar.Endianness.n_to_be len n) i)) == (n / pow2 (8 * (len - 1 - i)) % pow2 8\n ))\n= index_be_to_n (FStar.Endianness.n_to_be len n) i", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 741, "start_col": 2, "end_line": 741, "end_col": 50 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')\n\n#pop-options\n\nlet pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0\n ))\n= S.lemma_split a pos_split;\n pointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos\n\nlet pointwise_op_slice_other\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n (from to: nat)\n: Lemma\n (requires (\n S.length b2 + pos <= S.length b1 /\\\n from <= to /\\\n to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)\n ))\n (ensures (\n S.slice (pointwise_op f b1 b2 pos) from to `S.equal` S.slice b1 from to\n ))\n= let phi\n (i: nat { from <= i /\\ i < to })\n : Lemma\n (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i)\n = if to <= pos\n then pointwise_index1 f b1 b2 i pos\n else pointwise_index3 f b1 b2 i pos\n in\n Classical.forall_intro phi\n\n\n// application: byte-wise xor\nlet xor_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logxor b1 b2 pos\n\n\n// proof of involution of the operator (uses extensionality for the\n// byte-wise variant)\nlet xor_involutive (b1 b2:byte) : Lemma\n (requires True)\n (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1) =\n FStar.UInt.logxor_associative (U8.v b1) (U8.v b2) (U8.v b2);\n FStar.UInt.logxor_self (U8.v b2);\n FStar.UInt.logxor_commutative (FStar.UInt.zero 8) (U8.v b1);\n FStar.UInt.logxor_lemma_1 (U8.v b1)\n\n\nlet xor_inplace_involutive (b1 b2:bytes) (pos:nat) : Lemma\n (requires S.length b2 + pos <= S.length b1)\n (ensures S.equal (xor_inplace (xor_inplace b1 b2 pos) b2 pos) b1)\n (decreases (S.length b2)) =\n let xor = xor_inplace (xor_inplace b1 b2 pos) b2 pos in\n let step (i:nat{i < S.length b1}) : Lemma (S.index xor i = S.index b1 i) =\n if i < pos then begin\n pointwise_index1 U8.logxor b1 b2 i pos;\n pointwise_index1 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else if i >= pos+S.length b2 then begin\n pointwise_index3 U8.logxor b1 b2 i pos;\n pointwise_index3 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else begin\n pointwise_index2 U8.logxor b1 b2 i pos;\n pointwise_index2 U8.logxor (xor_inplace b1 b2 pos) b2 i pos;\n xor_involutive (S.index b1 i) (S.index b2 (i-pos))\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet xor_inplace_commutative (b b1 b2:bytes) (pos1 pos2:nat) : Lemma\n (requires\n S.length b1 + pos1 <= S.length b /\\\n S.length b2 + pos2 <= S.length b)\n (ensures S.equal\n (xor_inplace (xor_inplace b b1 pos1) b2 pos2)\n (xor_inplace (xor_inplace b b2 pos2) b1 pos1)) =\n let xor1 = xor_inplace (xor_inplace b b1 pos1) b2 pos2 in\n let xor2 = xor_inplace (xor_inplace b b2 pos2) b1 pos1 in\n let step (i:nat{i < S.length b}) : Lemma (S.index xor1 i = S.index xor2 i) =\n if i < pos1 then begin\n pointwise_index1 U8.logxor b b1 i pos1;\n pointwise_index1 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else if i >= pos1 + S.length b1 then begin\n pointwise_index3 U8.logxor b b1 i pos1;\n pointwise_index3 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else begin\n pointwise_index2 U8.logxor b b1 i pos1;\n pointwise_index2 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n let ind = U8.v (S.index b i) in\n let ind1 = U8.v (S.index b1 (i-pos1)) in\n let ind2 = U8.v (S.index b2 (i-pos2)) in\n FStar.UInt.logxor_associative #8 ind ind1 ind2;\n FStar.UInt.logxor_associative #8 ind ind2 ind1;\n FStar.UInt.logxor_commutative #8 ind1 ind2;\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end in\n\n FStar.Classical.forall_intro step\n\nlet xor_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (pos: nat)\n: Lemma\n (requires (pos + S.length b <= S.length a))\n (ensures (xor_inplace a b pos `S.equal` a))\n= let psi\n (i: nat {i < S.length a})\n : Lemma\n (S.index (xor_inplace a b pos) i == S.index a i)\n = if i < pos\n then pointwise_index1 U8.logxor a b i pos\n else if i >= pos + S.length b\n then pointwise_index3 U8.logxor a b i pos\n else begin\n pointwise_index2 U8.logxor a b i pos;\n phi (i - pos);\n FStar.UInt.logxor_lemma_1 (U8.v (S.index a i))\n end\n in\n Classical.forall_intro psi\n\nlet and_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logand b1 b2 pos\n\nlet and_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (i: nat {i < S.length a})\n: Lemma\n (requires (S.length b == S.length a))\n (ensures (S.index (and_inplace a b 0) i == 0uy))\n= pointwise_index2 U8.logand a b i 0;\n phi i;\n FStar.UInt.logand_lemma_1 (U8.v (S.index a i))\n\nlet rec bitwise_op (f:bool->bool->bool) (l1 l2:list bool) : Pure (list bool)\n (requires List.Tot.length l1 = List.Tot.length l2)\n (ensures fun l -> List.Tot.length l = List.Tot.length l1) =\n match l1,l2 with\n | [],[] -> []\n | x1::t1,x2::t2 -> f x1 x2 :: bitwise_op f t1 t2\n\n\nlet rec lemma_bitwise_op_index (f:bool->bool->bool) (l1 l2:list bool) (n:nat) : Lemma\n (requires List.Tot.length l1 = List.Tot.length l2 /\\ n < List.Tot.length l1)\n (ensures List.Tot.index (bitwise_op f l1 l2) n = f (List.Tot.index l1 n) (List.Tot.index l2 n)) =\n match l1,l2 with\n | [],[] -> ()\n | x1::t1,x2::t2 ->\n if n = 0 then ()\n else lemma_bitwise_op_index f t1 t2 (n-1)\n\nlet rec list_to_seq (#a:Type) (l:list a) : (s:(S.seq a){S.length s = List.Tot.length l /\\ (forall i. S.index s i == List.Tot.index l i)}) =\n match l with\n | [] -> S.empty\n | h :: t -> S.(create 1 h @| list_to_seq t)\n\nlet rec rev_seq (#a:Type) (s:S.seq a) : Pure (S.seq a)\n (requires True)\n (ensures fun s' -> S.length s = S.length s')\n (decreases (S.length s)) =\n if S.length s = 0 then S.empty\n else\n let _ = S.lemma_empty s in\n S.(rev_seq S.(slice s 1 (length s)) @| create 1 (index s 0))\n\n\nlet rec lemma_rev_seq (#a:Type) (s:S.seq a) (i:nat) : Lemma\n (requires i < S.length s)\n (ensures\n S.length (rev_seq s) = S.length s /\\\n S.index s i == S.index (rev_seq s) (S.length s-1-i))\n (decreases (i))=\n if S.length s = 0 then ()\n else if i = 0 then ()\n else lemma_rev_seq (S.slice s 1 (S.length s)) (i-1)\n\n#restart-solver\n\nlet lemma_arithmetic1 (a b c d e:int) : Lemma\n ((a+b+c+d)+(e-d) = (a+c+e)+b) =\n ()\n\nlet lemma_arithmetic2 (a b c d:int) : Lemma\n (a+(b-c)+d = a + ((b+d)-c)) =\n ()\n\nlet lemma_arithmetic3 (a b c:int) : Lemma\n ((a+b)-c = (a-c)+b) =\n ()\n\n\nlet lemma_propagate_mul_mod (a b:nat) : Lemma\n (requires b > 0)\n (ensures (\n let open FStar.Mul in\n (2*a) % (2*b) = 2 * (a % b))) =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_div_mod a b;\n lemma_div_mod (2*a) b;\n let (p,r) = ((a/b)*(2*b), 2*(a%b)) in\n assert (2*a = p + r);\n modulo_distributivity p r (2*b);\n multiple_modulo_lemma (a/b) (2*b);\n modulo_range_lemma a b;\n small_mod r (2*b)\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1 --z3rlimit 256\" // strange that F* has so much trouble completing this induction\nlet recompose_pow2_assoc (n:pos) (a:nat) : Lemma\n (let open FStar.Mul in 2 * (pow2 (n-1) * a) = pow2 n * a) =\n ()\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1 --z3rlimit 512\" // strange that F* has so much trouble completing this induction\nlet rec lemma_propagate_pow_mod (a b n:nat) : Lemma\n (requires b > 0)\n (ensures (\n let open FStar.Mul in\n (pow2 n * a) % (pow2 n * b) = pow2 n * (a % b))) =\n let open FStar.Mul in\n let open FStar.Math.Lemmas in\n if n = 0 then ()\n else begin\n let res = (pow2 n * a) % (pow2 n * b) in\n lemma_propagate_mul_mod (pow2 (n-1) * a) (pow2 (n-1) * b);\n assert (res = 2 * ((pow2 (n-1) * a) % (pow2 (n-1) * b)));\n lemma_propagate_pow_mod a b (n-1);\n assert (res = 2 * (pow2 (n-1) * (a%b)));\n recompose_pow2_assoc n (a%b)\n end\n#pop-options\n\n\n#restart-solver\nlet lemma_modulo_shift_byte (a:nat) (i:pos) : Lemma\n (let open FStar.Mul in\n (pow2 8 * a) % (pow2 (8*i)) = pow2 8 * (a % pow2 (8*(i-1)))) =\n let sub = 8 `op_Multiply` (i-1) in\n FStar.Math.Lemmas.pow2_plus 8 sub;\n lemma_propagate_pow_mod a (pow2 sub) 8\n\nlet rec reveal_be_to_n_slice (b:bytes) (i j:nat) : Lemma\n (requires i < j /\\ j <= S.length b)\n (ensures (\n let open FStar.Mul in\n let open FStar.Endianness in\n let h = U8.v (S.index b (j-1)) in\n be_to_n (S.slice b i j) = h + pow2 8 * be_to_n (S.slice b i (j - 1)))) =\n FStar.Endianness.reveal_be_to_n (S.slice b i j)\n\nlet rec lemma_correctness_slice_be_to_n (b:bytes) (i:nat) : Lemma\n (requires i <= S.length b)\n (ensures (\n let open FStar.Endianness in\n let open FStar.Mul in\n be_to_n b % pow2 (8 * i) =\n be_to_n (S.slice b (S.length b - i) (S.length b))))\n (decreases i) =\n let open FStar.Endianness in\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n if i = 0 then reveal_be_to_n S.empty\n else begin\n reveal_be_to_n b;\n let h = U8.v (S.index b (S.length b - 1)) in\n let l = S.slice b 0 (S.length b - 1) in\n let pow = pow2 (8*i) in\n //assert (be_to_n b = h + pow2 8 * be_to_n l);\n modulo_distributivity h (pow2 8 * be_to_n l) pow;\n pow2_le_compat (8*i) 8;\n small_mod h pow;\n //assert (be_to_n b % pow = (h + (pow2 8 * be_to_n l)%pow) % pow);\n lemma_modulo_shift_byte (be_to_n l) i;\n lemma_correctness_slice_be_to_n l (i-1);\n //assert (be_to_n b % pow = (h + pow2 8 * be_to_n (S.slice b (S.length b - i) (S.length b - 1))) % pow);\n reveal_be_to_n_slice b (S.length b - i) (S.length b);\n //assert (be_to_n b % pow = be_to_n (S.slice b (S.length b - i) (S.length b)) % pow);\n lemma_be_to_n_is_bounded (S.slice b (S.length b - i) (S.length b));\n FStar.Math.Lemmas.small_mod (be_to_n (S.slice b (S.length b - i) (S.length b))) pow\n end\n\nopen FStar.Mul\n\nlet rec index_be_to_n\n (b: bytes)\n (i: nat)\n: Lemma\n (requires (\n i < S.length b\n ))\n (ensures (\n U8.v (FStar.Seq.index b i) == (FStar.Endianness.be_to_n b / pow2 (8 * (S.length b - 1 - i))) % pow2 8\n ))\n (decreases (S.length b))\n= let open FStar.Endianness in\n reveal_be_to_n b;\n if i = S.length b - 1\n then ()\n else begin\n let l = S.length b in\n let l' = l - 1 in\n let b' = S.slice b 0 l' in\n index_be_to_n b' i;\n assert (FStar.Seq.index b i == FStar.Seq.index b' i);\n let open FStar.Math.Lemmas in\n let x = be_to_n b in\n let x' = be_to_n b' in\n assert (U8.v (FStar.Seq.index b i) == x' / pow2 (8 * (l' - 1 - i)) % pow2 8);\n let y = (U8.v (S.last b) + pow2 8 * x') / pow2 (8 * (l - 1 - i)) % pow2 8 in\n pow2_plus 8 (8 * (l' - 1 - i));\n division_multiplication_lemma (U8.v (S.last b) + pow2 8 * x') (pow2 8) (pow2 (8 * (l' - 1 - i)));\n assert (pow2 8 * x' == x' * pow2 8);\n division_addition_lemma (U8.v (S.last b)) (pow2 8) x';\n small_division_lemma_1 (U8.v (S.last b)) (pow2 8);\n assert (y == x' / pow2 (8 * (l' - 1 - i)) % pow2 8)\n end\n\nlet index_n_to_be\n (len: nat)\n (n: nat)\n (i: nat)\n: Lemma\n (requires (\n i < len /\\\n n < pow2 (8 * len)\n ))\n (ensures (\n U8.v (FStar.Seq.index (FStar.Endianness.n_to_be len n) i)) == (n / pow2 (8 * (len - 1 - i)) % pow2 8", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "len: Prims.nat -> n: Prims.nat -> i: Prims.nat\n -> FStar.Pervasives.Lemma (requires i < len /\\ n < Prims.pow2 (8 * len))\n (ensures\n FStar.UInt8.v (FStar.Seq.Base.index (FStar.Endianness.n_to_be len n) i) ==\n n / Prims.pow2 (8 * (len - 1 - i)) % Prims.pow2 8)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "QUIC.Spec.Lemmas.index_be_to_n", "FStar.Endianness.n_to_be", "Prims.unit", "Prims.l_and", "Prims.b2t", "Prims.op_LessThan", "Prims.pow2", "FStar.Mul.op_Star", "Prims.squash", "Prims.eq2", "Prims.int", "FStar.UInt8.v", "FStar.Seq.Base.index", "FStar.UInt8.t", "Prims.op_Modulus", "Prims.op_Division", "Prims.op_Subtraction", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val index_n_to_be (len n i: nat)\n : Lemma (requires (i < len /\\ n < pow2 (8 * len)))\n (ensures\n (U8.v (FStar.Seq.index (FStar.Endianness.n_to_be len n) i)) ==\n (n / pow2 (8 * (len - 1 - i)) % pow2 8))\nlet index_n_to_be (len n i: nat)\n : Lemma (requires (i < len /\\ n < pow2 (8 * len)))\n (ensures\n (U8.v (FStar.Seq.index (FStar.Endianness.n_to_be len n) i)) ==\n (n / pow2 (8 * (len - 1 - i)) % pow2 8)) =", "completed_definiton": "index_be_to_n (FStar.Endianness.n_to_be len n) i", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.rev_seq", "original_source_type": "val rev_seq (#a: Type) (s: S.seq a)\n : Pure (S.seq a)\n (requires True)\n (ensures fun s' -> S.length s = S.length s')\n (decreases (S.length s))", "source_type": "val rev_seq (#a: Type) (s: S.seq a)\n : Pure (S.seq a)\n (requires True)\n (ensures fun s' -> S.length s = S.length s')\n (decreases (S.length s))", "source_definition": "let rec rev_seq (#a:Type) (s:S.seq a) : Pure (S.seq a)\n (requires True)\n (ensures fun s' -> S.length s = S.length s')\n (decreases (S.length s)) =\n if S.length s = 0 then S.empty\n else\n let _ = S.lemma_empty s in\n S.(rev_seq S.(slice s 1 (length s)) @| create 1 (index s 0))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 572, "start_col": 2, "end_line": 575, "end_col": 64 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')\n\n#pop-options\n\nlet pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0\n ))\n= S.lemma_split a pos_split;\n pointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos\n\nlet pointwise_op_slice_other\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n (from to: nat)\n: Lemma\n (requires (\n S.length b2 + pos <= S.length b1 /\\\n from <= to /\\\n to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)\n ))\n (ensures (\n S.slice (pointwise_op f b1 b2 pos) from to `S.equal` S.slice b1 from to\n ))\n= let phi\n (i: nat { from <= i /\\ i < to })\n : Lemma\n (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i)\n = if to <= pos\n then pointwise_index1 f b1 b2 i pos\n else pointwise_index3 f b1 b2 i pos\n in\n Classical.forall_intro phi\n\n\n// application: byte-wise xor\nlet xor_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logxor b1 b2 pos\n\n\n// proof of involution of the operator (uses extensionality for the\n// byte-wise variant)\nlet xor_involutive (b1 b2:byte) : Lemma\n (requires True)\n (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1) =\n FStar.UInt.logxor_associative (U8.v b1) (U8.v b2) (U8.v b2);\n FStar.UInt.logxor_self (U8.v b2);\n FStar.UInt.logxor_commutative (FStar.UInt.zero 8) (U8.v b1);\n FStar.UInt.logxor_lemma_1 (U8.v b1)\n\n\nlet xor_inplace_involutive (b1 b2:bytes) (pos:nat) : Lemma\n (requires S.length b2 + pos <= S.length b1)\n (ensures S.equal (xor_inplace (xor_inplace b1 b2 pos) b2 pos) b1)\n (decreases (S.length b2)) =\n let xor = xor_inplace (xor_inplace b1 b2 pos) b2 pos in\n let step (i:nat{i < S.length b1}) : Lemma (S.index xor i = S.index b1 i) =\n if i < pos then begin\n pointwise_index1 U8.logxor b1 b2 i pos;\n pointwise_index1 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else if i >= pos+S.length b2 then begin\n pointwise_index3 U8.logxor b1 b2 i pos;\n pointwise_index3 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else begin\n pointwise_index2 U8.logxor b1 b2 i pos;\n pointwise_index2 U8.logxor (xor_inplace b1 b2 pos) b2 i pos;\n xor_involutive (S.index b1 i) (S.index b2 (i-pos))\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet xor_inplace_commutative (b b1 b2:bytes) (pos1 pos2:nat) : Lemma\n (requires\n S.length b1 + pos1 <= S.length b /\\\n S.length b2 + pos2 <= S.length b)\n (ensures S.equal\n (xor_inplace (xor_inplace b b1 pos1) b2 pos2)\n (xor_inplace (xor_inplace b b2 pos2) b1 pos1)) =\n let xor1 = xor_inplace (xor_inplace b b1 pos1) b2 pos2 in\n let xor2 = xor_inplace (xor_inplace b b2 pos2) b1 pos1 in\n let step (i:nat{i < S.length b}) : Lemma (S.index xor1 i = S.index xor2 i) =\n if i < pos1 then begin\n pointwise_index1 U8.logxor b b1 i pos1;\n pointwise_index1 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else if i >= pos1 + S.length b1 then begin\n pointwise_index3 U8.logxor b b1 i pos1;\n pointwise_index3 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else begin\n pointwise_index2 U8.logxor b b1 i pos1;\n pointwise_index2 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n let ind = U8.v (S.index b i) in\n let ind1 = U8.v (S.index b1 (i-pos1)) in\n let ind2 = U8.v (S.index b2 (i-pos2)) in\n FStar.UInt.logxor_associative #8 ind ind1 ind2;\n FStar.UInt.logxor_associative #8 ind ind2 ind1;\n FStar.UInt.logxor_commutative #8 ind1 ind2;\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end in\n\n FStar.Classical.forall_intro step\n\nlet xor_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (pos: nat)\n: Lemma\n (requires (pos + S.length b <= S.length a))\n (ensures (xor_inplace a b pos `S.equal` a))\n= let psi\n (i: nat {i < S.length a})\n : Lemma\n (S.index (xor_inplace a b pos) i == S.index a i)\n = if i < pos\n then pointwise_index1 U8.logxor a b i pos\n else if i >= pos + S.length b\n then pointwise_index3 U8.logxor a b i pos\n else begin\n pointwise_index2 U8.logxor a b i pos;\n phi (i - pos);\n FStar.UInt.logxor_lemma_1 (U8.v (S.index a i))\n end\n in\n Classical.forall_intro psi\n\nlet and_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logand b1 b2 pos\n\nlet and_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (i: nat {i < S.length a})\n: Lemma\n (requires (S.length b == S.length a))\n (ensures (S.index (and_inplace a b 0) i == 0uy))\n= pointwise_index2 U8.logand a b i 0;\n phi i;\n FStar.UInt.logand_lemma_1 (U8.v (S.index a i))\n\nlet rec bitwise_op (f:bool->bool->bool) (l1 l2:list bool) : Pure (list bool)\n (requires List.Tot.length l1 = List.Tot.length l2)\n (ensures fun l -> List.Tot.length l = List.Tot.length l1) =\n match l1,l2 with\n | [],[] -> []\n | x1::t1,x2::t2 -> f x1 x2 :: bitwise_op f t1 t2\n\n\nlet rec lemma_bitwise_op_index (f:bool->bool->bool) (l1 l2:list bool) (n:nat) : Lemma\n (requires List.Tot.length l1 = List.Tot.length l2 /\\ n < List.Tot.length l1)\n (ensures List.Tot.index (bitwise_op f l1 l2) n = f (List.Tot.index l1 n) (List.Tot.index l2 n)) =\n match l1,l2 with\n | [],[] -> ()\n | x1::t1,x2::t2 ->\n if n = 0 then ()\n else lemma_bitwise_op_index f t1 t2 (n-1)\n\nlet rec list_to_seq (#a:Type) (l:list a) : (s:(S.seq a){S.length s = List.Tot.length l /\\ (forall i. S.index s i == List.Tot.index l i)}) =\n match l with\n | [] -> S.empty\n | h :: t -> S.(create 1 h @| list_to_seq t)\n\nlet rec rev_seq (#a:Type) (s:S.seq a) : Pure (S.seq a)\n (requires True)\n (ensures fun s' -> S.length s = S.length s')", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: FStar.Seq.Base.seq a -> Prims.Pure (FStar.Seq.Base.seq a)", "effect": "Prims.Pure", "effect_flags": [ "" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "FStar.Seq.Base.empty", "Prims.bool", "FStar.Seq.Base.op_At_Bar", "QUIC.Spec.Lemmas.rev_seq", "FStar.Seq.Base.slice", "FStar.Seq.Base.create", "FStar.Seq.Base.index", "Prims.unit", "FStar.Seq.Base.lemma_empty", "Prims.l_True", "Prims.b2t", "Prims.nat" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val rev_seq (#a: Type) (s: S.seq a)\n : Pure (S.seq a)\n (requires True)\n (ensures fun s' -> S.length s = S.length s')\n (decreases (S.length s))\nlet rec rev_seq (#a: Type) (s: S.seq a)\n : Pure (S.seq a)\n (requires True)\n (ensures fun s' -> S.length s = S.length s')\n (decreases (S.length s)) =", "completed_definiton": "if S.length s = 0\nthen S.empty\nelse\n let _ = S.lemma_empty s in\n let open S in rev_seq S.(slice s 1 (length s)) @| create 1 (index s 0)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.lemma_rev_seq", "original_source_type": "val lemma_rev_seq (#a: Type) (s: S.seq a) (i: nat)\n : Lemma (requires i < S.length s)\n (ensures\n S.length (rev_seq s) = S.length s /\\ S.index s i == S.index (rev_seq s) (S.length s - 1 - i)\n )\n (decreases (i))", "source_type": "val lemma_rev_seq (#a: Type) (s: S.seq a) (i: nat)\n : Lemma (requires i < S.length s)\n (ensures\n S.length (rev_seq s) = S.length s /\\ S.index s i == S.index (rev_seq s) (S.length s - 1 - i)\n )\n (decreases (i))", "source_definition": "let rec lemma_rev_seq (#a:Type) (s:S.seq a) (i:nat) : Lemma\n (requires i < S.length s)\n (ensures\n S.length (rev_seq s) = S.length s /\\\n S.index s i == S.index (rev_seq s) (S.length s-1-i))\n (decreases (i))=\n if S.length s = 0 then ()\n else if i = 0 then ()\n else lemma_rev_seq (S.slice s 1 (S.length s)) (i-1)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 584, "start_col": 2, "end_line": 586, "end_col": 53 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')\n\n#pop-options\n\nlet pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0\n ))\n= S.lemma_split a pos_split;\n pointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos\n\nlet pointwise_op_slice_other\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n (from to: nat)\n: Lemma\n (requires (\n S.length b2 + pos <= S.length b1 /\\\n from <= to /\\\n to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)\n ))\n (ensures (\n S.slice (pointwise_op f b1 b2 pos) from to `S.equal` S.slice b1 from to\n ))\n= let phi\n (i: nat { from <= i /\\ i < to })\n : Lemma\n (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i)\n = if to <= pos\n then pointwise_index1 f b1 b2 i pos\n else pointwise_index3 f b1 b2 i pos\n in\n Classical.forall_intro phi\n\n\n// application: byte-wise xor\nlet xor_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logxor b1 b2 pos\n\n\n// proof of involution of the operator (uses extensionality for the\n// byte-wise variant)\nlet xor_involutive (b1 b2:byte) : Lemma\n (requires True)\n (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1) =\n FStar.UInt.logxor_associative (U8.v b1) (U8.v b2) (U8.v b2);\n FStar.UInt.logxor_self (U8.v b2);\n FStar.UInt.logxor_commutative (FStar.UInt.zero 8) (U8.v b1);\n FStar.UInt.logxor_lemma_1 (U8.v b1)\n\n\nlet xor_inplace_involutive (b1 b2:bytes) (pos:nat) : Lemma\n (requires S.length b2 + pos <= S.length b1)\n (ensures S.equal (xor_inplace (xor_inplace b1 b2 pos) b2 pos) b1)\n (decreases (S.length b2)) =\n let xor = xor_inplace (xor_inplace b1 b2 pos) b2 pos in\n let step (i:nat{i < S.length b1}) : Lemma (S.index xor i = S.index b1 i) =\n if i < pos then begin\n pointwise_index1 U8.logxor b1 b2 i pos;\n pointwise_index1 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else if i >= pos+S.length b2 then begin\n pointwise_index3 U8.logxor b1 b2 i pos;\n pointwise_index3 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else begin\n pointwise_index2 U8.logxor b1 b2 i pos;\n pointwise_index2 U8.logxor (xor_inplace b1 b2 pos) b2 i pos;\n xor_involutive (S.index b1 i) (S.index b2 (i-pos))\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet xor_inplace_commutative (b b1 b2:bytes) (pos1 pos2:nat) : Lemma\n (requires\n S.length b1 + pos1 <= S.length b /\\\n S.length b2 + pos2 <= S.length b)\n (ensures S.equal\n (xor_inplace (xor_inplace b b1 pos1) b2 pos2)\n (xor_inplace (xor_inplace b b2 pos2) b1 pos1)) =\n let xor1 = xor_inplace (xor_inplace b b1 pos1) b2 pos2 in\n let xor2 = xor_inplace (xor_inplace b b2 pos2) b1 pos1 in\n let step (i:nat{i < S.length b}) : Lemma (S.index xor1 i = S.index xor2 i) =\n if i < pos1 then begin\n pointwise_index1 U8.logxor b b1 i pos1;\n pointwise_index1 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else if i >= pos1 + S.length b1 then begin\n pointwise_index3 U8.logxor b b1 i pos1;\n pointwise_index3 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else begin\n pointwise_index2 U8.logxor b b1 i pos1;\n pointwise_index2 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n let ind = U8.v (S.index b i) in\n let ind1 = U8.v (S.index b1 (i-pos1)) in\n let ind2 = U8.v (S.index b2 (i-pos2)) in\n FStar.UInt.logxor_associative #8 ind ind1 ind2;\n FStar.UInt.logxor_associative #8 ind ind2 ind1;\n FStar.UInt.logxor_commutative #8 ind1 ind2;\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end in\n\n FStar.Classical.forall_intro step\n\nlet xor_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (pos: nat)\n: Lemma\n (requires (pos + S.length b <= S.length a))\n (ensures (xor_inplace a b pos `S.equal` a))\n= let psi\n (i: nat {i < S.length a})\n : Lemma\n (S.index (xor_inplace a b pos) i == S.index a i)\n = if i < pos\n then pointwise_index1 U8.logxor a b i pos\n else if i >= pos + S.length b\n then pointwise_index3 U8.logxor a b i pos\n else begin\n pointwise_index2 U8.logxor a b i pos;\n phi (i - pos);\n FStar.UInt.logxor_lemma_1 (U8.v (S.index a i))\n end\n in\n Classical.forall_intro psi\n\nlet and_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logand b1 b2 pos\n\nlet and_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (i: nat {i < S.length a})\n: Lemma\n (requires (S.length b == S.length a))\n (ensures (S.index (and_inplace a b 0) i == 0uy))\n= pointwise_index2 U8.logand a b i 0;\n phi i;\n FStar.UInt.logand_lemma_1 (U8.v (S.index a i))\n\nlet rec bitwise_op (f:bool->bool->bool) (l1 l2:list bool) : Pure (list bool)\n (requires List.Tot.length l1 = List.Tot.length l2)\n (ensures fun l -> List.Tot.length l = List.Tot.length l1) =\n match l1,l2 with\n | [],[] -> []\n | x1::t1,x2::t2 -> f x1 x2 :: bitwise_op f t1 t2\n\n\nlet rec lemma_bitwise_op_index (f:bool->bool->bool) (l1 l2:list bool) (n:nat) : Lemma\n (requires List.Tot.length l1 = List.Tot.length l2 /\\ n < List.Tot.length l1)\n (ensures List.Tot.index (bitwise_op f l1 l2) n = f (List.Tot.index l1 n) (List.Tot.index l2 n)) =\n match l1,l2 with\n | [],[] -> ()\n | x1::t1,x2::t2 ->\n if n = 0 then ()\n else lemma_bitwise_op_index f t1 t2 (n-1)\n\nlet rec list_to_seq (#a:Type) (l:list a) : (s:(S.seq a){S.length s = List.Tot.length l /\\ (forall i. S.index s i == List.Tot.index l i)}) =\n match l with\n | [] -> S.empty\n | h :: t -> S.(create 1 h @| list_to_seq t)\n\nlet rec rev_seq (#a:Type) (s:S.seq a) : Pure (S.seq a)\n (requires True)\n (ensures fun s' -> S.length s = S.length s')\n (decreases (S.length s)) =\n if S.length s = 0 then S.empty\n else\n let _ = S.lemma_empty s in\n S.(rev_seq S.(slice s 1 (length s)) @| create 1 (index s 0))\n\n\nlet rec lemma_rev_seq (#a:Type) (s:S.seq a) (i:nat) : Lemma\n (requires i < S.length s)\n (ensures\n S.length (rev_seq s) = S.length s /\\\n S.index s i == S.index (rev_seq s) (S.length s-1-i))", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: FStar.Seq.Base.seq a -> i: Prims.nat\n -> FStar.Pervasives.Lemma (requires i < FStar.Seq.Base.length s)\n (ensures\n FStar.Seq.Base.length (QUIC.Spec.Lemmas.rev_seq s) = FStar.Seq.Base.length s /\\\n FStar.Seq.Base.index s i ==\n FStar.Seq.Base.index (QUIC.Spec.Lemmas.rev_seq s) (FStar.Seq.Base.length s - 1 - i))\n (decreases i)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma", "" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.nat", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "Prims.bool", "QUIC.Spec.Lemmas.lemma_rev_seq", "FStar.Seq.Base.slice", "Prims.op_Subtraction", "Prims.unit", "Prims.b2t", "Prims.op_LessThan", "Prims.squash", "Prims.l_and", "QUIC.Spec.Lemmas.rev_seq", "Prims.eq2", "FStar.Seq.Base.index", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_rev_seq (#a: Type) (s: S.seq a) (i: nat)\n : Lemma (requires i < S.length s)\n (ensures\n S.length (rev_seq s) = S.length s /\\ S.index s i == S.index (rev_seq s) (S.length s - 1 - i)\n )\n (decreases (i))\nlet rec lemma_rev_seq (#a: Type) (s: S.seq a) (i: nat)\n : Lemma (requires i < S.length s)\n (ensures\n S.length (rev_seq s) = S.length s /\\ S.index s i == S.index (rev_seq s) (S.length s - 1 - i)\n )\n (decreases (i)) =", "completed_definiton": "if S.length s = 0\nthen ()\nelse if i = 0 then () else lemma_rev_seq (S.slice s 1 (S.length s)) (i - 1)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.pointwise_op_split", "original_source_type": "val pointwise_op_split (#t: Type) (f: (t -> t -> t)) (a b: S.seq t) (pos pos_split: nat)\n : Lemma\n (requires\n (pos <= pos_split /\\ pos_split <= pos + S.length b /\\ pos + S.length b <= S.length a))\n (ensures\n (let a1, a2 = S.split a pos_split in\n let b1, b2 = S.split b (pos_split - pos) in\n pointwise_op f a b pos == (pointwise_op f a1 b1 pos) `S.append` (pointwise_op f a2 b2 0)))", "source_type": "val pointwise_op_split (#t: Type) (f: (t -> t -> t)) (a b: S.seq t) (pos pos_split: nat)\n : Lemma\n (requires\n (pos <= pos_split /\\ pos_split <= pos + S.length b /\\ pos + S.length b <= S.length a))\n (ensures\n (let a1, a2 = S.split a pos_split in\n let b1, b2 = S.split b (pos_split - pos) in\n pointwise_op f a b pos == (pointwise_op f a1 b1 pos) `S.append` (pointwise_op f a2 b2 0)))", "source_definition": "let pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0\n ))\n= S.lemma_split a pos_split;\n pointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 378, "start_col": 2, "end_line": 379, "end_col": 85 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')\n\n#pop-options\n\nlet pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n f: (_: t -> _: t -> t) ->\n a: FStar.Seq.Base.seq t ->\n b: FStar.Seq.Base.seq t ->\n pos: Prims.nat ->\n pos_split: Prims.nat\n -> FStar.Pervasives.Lemma\n (requires\n pos <= pos_split /\\ pos_split <= pos + FStar.Seq.Base.length b /\\\n pos + FStar.Seq.Base.length b <= FStar.Seq.Base.length a)\n (ensures\n (let _ = FStar.Seq.Properties.split a pos_split in\n (let FStar.Pervasives.Native.Mktuple2 #_ #_ a1 a2 = _ in\n let _ = FStar.Seq.Properties.split b (pos_split - pos) in\n (let FStar.Pervasives.Native.Mktuple2 #_ #_ b1 b2 = _ in\n QUIC.Spec.Lemmas.pointwise_op f a b pos ==\n FStar.Seq.Base.append (QUIC.Spec.Lemmas.pointwise_op f a1 b1 pos)\n (QUIC.Spec.Lemmas.pointwise_op f a2 b2 0))\n <:\n Type0)\n <:\n Type0))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.nat", "QUIC.Spec.Lemmas.pointwise_op_dec", "FStar.Seq.Base.slice", "FStar.Seq.Base.length", "Prims.unit", "FStar.Seq.Properties.lemma_split", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_Addition", "Prims.squash", "Prims.eq2", "QUIC.Spec.Lemmas.pointwise_op", "FStar.Seq.Base.append", "FStar.Pervasives.Native.tuple2", "FStar.Seq.Properties.split", "Prims.op_Subtraction", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val pointwise_op_split (#t: Type) (f: (t -> t -> t)) (a b: S.seq t) (pos pos_split: nat)\n : Lemma\n (requires\n (pos <= pos_split /\\ pos_split <= pos + S.length b /\\ pos + S.length b <= S.length a))\n (ensures\n (let a1, a2 = S.split a pos_split in\n let b1, b2 = S.split b (pos_split - pos) in\n pointwise_op f a b pos == (pointwise_op f a1 b1 pos) `S.append` (pointwise_op f a2 b2 0)))\nlet pointwise_op_split (#t: Type) (f: (t -> t -> t)) (a b: S.seq t) (pos pos_split: nat)\n : Lemma\n (requires\n (pos <= pos_split /\\ pos_split <= pos + S.length b /\\ pos + S.length b <= S.length a))\n (ensures\n (let a1, a2 = S.split a pos_split in\n let b1, b2 = S.split b (pos_split - pos) in\n pointwise_op f a b pos == (pointwise_op f a1 b1 pos) `S.append` (pointwise_op f a2 b2 0))) =", "completed_definiton": "S.lemma_split a pos_split;\npointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Lemmas.fst", "name": "QUIC.Spec.Lemmas.lemma_propagate_pow_mod", "original_source_type": "val lemma_propagate_pow_mod (a b n: nat)\n : Lemma (requires b > 0)\n (ensures (let open FStar.Mul in (pow2 n * a) % (pow2 n * b) = pow2 n * (a % b)))", "source_type": "val lemma_propagate_pow_mod (a b n: nat)\n : Lemma (requires b > 0)\n (ensures (let open FStar.Mul in (pow2 n * a) % (pow2 n * b) = pow2 n * (a % b)))", "source_definition": "let rec lemma_propagate_pow_mod (a b n:nat) : Lemma\n (requires b > 0)\n (ensures (\n let open FStar.Mul in\n (pow2 n * a) % (pow2 n * b) = pow2 n * (a % b))) =\n let open FStar.Mul in\n let open FStar.Math.Lemmas in\n if n = 0 then ()\n else begin\n let res = (pow2 n * a) % (pow2 n * b) in\n lemma_propagate_mul_mod (pow2 (n-1) * a) (pow2 (n-1) * b);\n assert (res = 2 * ((pow2 (n-1) * a) % (pow2 (n-1) * b)));\n lemma_propagate_pow_mod a b (n-1);\n assert (res = 2 * (pow2 (n-1) * (a%b)));\n recompose_pow2_assoc n (a%b)\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 631, "start_col": 2, "end_line": 641, "end_col": 5 }, "file_context": "module QUIC.Spec.Lemmas\nopen QUIC.Spec.Base\n\nmodule S = FStar.Seq\nmodule U8 = FStar.UInt8\n\n(* library lemmas *)\n\nlet suffix (b:bytes) (n:nat{n <= S.length b}) = S.slice b n (S.length b)\n\nlet max (a b:int) : Tot (n:int{n >= a /\\ n >= b}) =\n if a > b then a else b // this must exist somewhere...\n\n// Move to FStar.Math.Lemmas?\nlet lemma_mod_pow2 (a:nat) (b:nat) : Lemma\n (requires a >= b) (ensures pow2 a % pow2 b == 0)\n [SMTPat (pow2 a % pow2 b)]\n =\n let open FStar.Math.Lemmas in\n lemma_div_mod (pow2 a) (pow2 b);\n pow2_minus a b;\n pow2_plus b (a-b)\n\n#push-options \"--z3rlimit 16\"\n\nlet lemma_divrem2 (k:nat) (a:nat) (n:nat)\n : Lemma (requires a >= k /\\ n < pow2 k)\n (ensures ((pow2 a + n) % pow2 k == n /\\ (pow2 a + n) / pow2 k == pow2 (a - k)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n modulo_distributivity (pow2 a) n (pow2 k);\n small_mod n (pow2 k);\n lemma_div_mod (pow2 a + n) (pow2 k);\n pow2_minus a k\n\n#pop-options\n\n// We really should have this pattern already...\nlet lemma_mod0 (x:pos) : Lemma (0 % x == 0)\n [SMTPat (0 % x)] = ()\n\n// Move to FStar.Math.Lemmas?\nlet lemma_pow2_div (a:nat) (b:nat) (k:nat)\n : Lemma (requires a >= k /\\ b >= k)\n (ensures (pow2 a + pow2 b) / pow2 k == pow2 (a - k) + pow2 (b - k))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n pow2_plus k (b - k);\n division_addition_lemma (pow2 a) (pow2 k) (pow2 (b-k));\n pow2_minus b k;\n pow2_minus a k\n\n#restart-solver\n\nlet lemma_pow2_div2 (a:nat) (b:nat) (c:nat)\n : Lemma ((a / pow2 b) / pow2 c == a / (pow2 (c + b)))\n =\n let open FStar.Math.Lemmas in\n pow2_plus b c;\n division_multiplication_lemma a (pow2 b) (pow2 c)\n\nlet lemma_div_sub_small (l:nat) (n:nat) (x:nat)\n : Lemma (requires l > 1)\n (ensures (n - n % pow2 8) / pow2 (8 `op_Multiply` (l-1)) == n / pow2 (8 `op_Multiply` (l-1)))\n =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_mod_spec n (pow2 8);\n lemma_pow2_div2 n 8 (8*(l-2));\n lemma_pow2_div2 (n - n % pow2 8) 8 (8*(l-2))\n\n#push-options \"--z3rlimit 20\"\nlet rec lemma_be_index (l:pos) (n:nat{n < pow2 (8 `op_Multiply` l)})\n : Lemma (ensures U8.v (S.index (FStar.Endianness.n_to_be l n) 0)\n == n / pow2 (8 `op_Multiply` (l-1)))\n (decreases %[l])\n =\n let open FStar.Endianness in\n let open FStar.Mul in\n let b = n_to_be l n in\n let b0 = S.index b 0 in\n reveal_be_to_n b;\n if l = 1 then ()\n else\n let b1 = S.last b in\n let b' = S.slice b 0 (l-1) in\n let b0' = S.index b' 0 in\n reveal_be_to_n b';\n assert(U8.v b1 == n % pow2 8);\n lemma_be_to_n_is_bounded b';\n lemma_be_index (l-1) (be_to_n b');\n lemma_pow2_div2 (n - U8.v b1) 8 (8 * (l-1) - 8);\n lemma_div_sub_small l n (U8.v b1)\n#pop-options\n\n\nlet lemma_be_index_bytes (l:pos) (b:bytes) : Lemma\n (requires S.length b >= l)\n (ensures FStar.Endianness.be_to_n (S.slice b 0 l) / pow2 (8 `op_Multiply` (l-1)) = U8.v (S.index b 0)) =\n let open FStar.Endianness in\n let n = be_to_n (S.slice b 0 l) in\n lemma_be_to_n_is_bounded (S.slice b 0 l);\n lemma_be_index l n;\n n_to_be_be_to_n l (S.slice b 0 l)\n\n\n/// generic lemmas for sequences\n\nlet append_slices1 (#a:Type) (s1 s2:S.seq a) : Lemma\n (S.equal s1 (S.slice (S.append s1 s2) 0 (S.length s1))) =\n ()\n\nlet append_slices2 (#a:Type) (s1 s2:S.seq a) : Lemma\n (Seq.equal s2 (Seq.slice (Seq.append s1 s2) (Seq.length s1) (Seq.length s1 + Seq.length s2))) =\n ()\n\nlet append_slices3 (#a:Type) (s1 s2:S.seq a) : Lemma\n ( (forall (i:nat) (j:nat).\n i <= j /\\ j <= Seq.length s2 ==>\n Seq.equal (Seq.slice s2 i j)\n (Seq.slice (Seq.append s1 s2) (Seq.length s1 + i) (Seq.length s1 + j)))) =\n ()\n\nlet lemma_create_slice b i : Lemma\n (requires S.length b >= i)\n (ensures S.(equal (create 1 (index b i)) (slice b i (i+1)))) =\n ()\n\nlet lemma_append_assoc (#a:Type) (u v w:S.seq a) : Lemma\n (S.equal S.(u @| v @| w) S.((u @| v) @| w)) =\n ()\n\nlet compose_split (#a:Type) (b:S.seq a) (i j:nat) : Lemma\n (requires i+j <= S.length b)\n (ensures snd (S.split (snd (S.split b i)) j) == snd (S.split b (i+j))) =\n ()\n\nlet lemma_compose_slice (#a:Type) (b:S.seq a) (i j k l:nat) : Lemma\n (requires i <= j /\\ j <= S.length b /\\ k <= l /\\ k <= j - i /\\ l <= j - i)\n (ensures S.slice (S.slice b i j) k l == S.slice b (i+k) (i+l)) =\n ()\n\nlet add_offset (#a:Type) (b:S.seq a) (i:nat) (p1 p2:S.seq a) : Lemma\n (requires i <= S.length b /\\ S.slice b i (S.length b) == S.(p1@|p2))\n (ensures (\n S.length S.(p1@|p2) == S.length p1+S.length p2 /\\\n S.slice b (i+S.length p1) (S.length b) == p2)) =\n assert (S.length S.(p1@|p2) = S.length p1+S.length p2);\n append_slices2 p1 p2;\n compose_split b i (S.length p1)\n\nlet slice_trans (#a:Type) (b:S.seq a) (i j k:nat) : Lemma\n (requires i <= j /\\ j <= k /\\ k <= S.length b)\n (ensures S.slice b i k == S.(slice b i j @| slice b j k)) =\n S.lemma_split (S.slice b i k) (j-i)\n\nlet extensionality_slice (#a:Type) (b1 b2:S.seq a) (i j:nat) : Lemma\n (requires\n S.length b1 = S.length b2 /\\\n i <= j /\\ j <= S.length b1 /\\\n (forall (k:nat{i<=k /\\ ka->a) (b1 b2:S.seq a) (pos:nat) : Pure (S.seq a)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n if S.length b2 = 0 then b1\n else\n let _ = S.lemma_empty b2 in\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1)\n\nlet pointwise_op_empty\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n: Lemma\n (requires (S.length b2 == 0 /\\ pos <= S.length b1))\n (ensures (pointwise_op f b1 b2 pos == b1))\n= assert (b2 `S.equal` S.empty)\n\n// three lemmas to recover indexes after application of bitwise_op\nlet rec pointwise_index1 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos + 1));\n S.lemma_index_upd2 b1 pos x i;\n assert (S.index (S.upd b1 pos x) i == S.index b1 i);\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos + 1)\n end\n\n\nlet rec pointwise_index2 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ pos <= i /\\ i < S.length b2 + pos))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == f (S.index b1 i) (S.index b2 (i-pos))))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n let x = f (S.index b1 pos) (S.index b2 0) in\n assert (pointwise_op f b1 b2 pos == pointwise_op f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) (pos+1));\n if i = pos then begin\n pointwise_index1 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) pos (pos+1);\n S.lemma_index_upd1 b1 pos x\n end\n else\n pointwise_index2 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\n\nlet rec pointwise_index3 (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat) : Lemma\n (requires (S.length b2 + pos <= i /\\ i < S.length b1))\n (ensures (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i))\n (decreases (S.length b2)) =\n if Seq.length b2 = 0 then ()\n else begin\n S.lemma_empty b2;\n let x = f (S.index b1 pos) (S.index b2 0) in\n pointwise_index3 f (S.upd b1 pos x) (S.slice b2 1 (S.length b2)) i (pos+1)\n end\n\nlet pointwise_index\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (i pos:nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1 /\\ i < S.length b1 /\\\n S.index (pointwise_op f b1 b2 pos) i == (\n if S.length b2 + pos <= i || i < pos\n then S.index b1 i\n else f (S.index b1 i) (S.index b2 (i-pos))\n )))\n= if i < pos\n then pointwise_index1 f b1 b2 i pos\n else if S.length b2 + pos <= i\n then pointwise_index3 f b1 b2 i pos\n else pointwise_index2 f b1 b2 i pos\n\nlet pointwise_op_suff (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires pos >= S.length a1 /\\ S.length b + pos <= S.length a1 + S.length a2)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(a1 @| pointwise_op f a2 b (pos - S.length a1))) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(a1 @| pointwise_op f a2 b (pos - S.length a1)) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < S.length a1 then pointwise_index1 f S.(a1 @| a2) b i pos\n else begin\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a2 b (i-S.length a1) (pos-S.length a1)\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a2 b (i-S.length a1) (pos-S.length a1)\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n pointwise_index3 f a2 b (i-S.length a1) (pos-S.length a1)\n end\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_pref (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires S.length b + pos <= S.length a1)\n (ensures\n S.equal\n (pointwise_op f S.(a1 @| a2) b pos)\n S.(pointwise_op f a1 b pos @| a2)) =\n let b1 = pointwise_op f S.(a1 @| a2) b pos in\n let b2 = S.(pointwise_op f a1 b pos @| a2) in\n let step i : Lemma (S.index b1 i == S.index b2 i) =\n if i < pos then begin\n pointwise_index1 f S.(a1 @| a2) b i pos;\n pointwise_index1 f a1 b i pos\n end else if i < S.length b + pos then begin\n pointwise_index2 f S.(a1 @| a2) b i pos;\n pointwise_index2 f a1 b i pos\n end else begin\n pointwise_index3 f S.(a1 @| a2) b i pos;\n if i < S.length a1 then pointwise_index3 f a1 b i pos\n else ()\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet pointwise_op_dec (#a:Type) (f:a->a->a) (a1 a2 b:S.seq a) (pos:nat) : Lemma\n (requires\n pos <= S.length a1 /\\\n S.length a1 <= S.length b + pos /\\\n S.length b + pos <= S.length a1 + S.length a2)\n (ensures (\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n equal\n (pointwise_op f (a1 @| a2) b pos)\n (pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0))) =\n let open S in\n let (b1,b2) = S.split b (length a1 - pos) in\n let p = pointwise_op f (a1 @| a2) b pos in\n let q = pointwise_op f a1 b1 pos @| pointwise_op f a2 b2 0 in\n let step i : Lemma (S.index p i == S.index q i) =\n if i < pos then begin\n pointwise_index1 f (a1 @| a2) b i pos;\n pointwise_index1 f a1 b1 i pos\n end else if i < length a1 then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a1 b1 i pos\n end else if i < length b + pos then begin\n pointwise_index2 f (a1 @| a2) b i pos;\n pointwise_index2 f a2 b2 (i-length a1) 0\n end else begin\n pointwise_index3 f (a1 @| a2) b i pos;\n pointwise_index3 f a2 b2 (i-length a1) 0\n end in\n\n FStar.Classical.forall_intro step\n\n#push-options \"--z3rlimit 32\"\n\nlet pointwise_op_append_r\n (#t: Type)\n (f: t -> t -> t)\n (a b1 b2: S.seq t)\n (pos: nat)\n: Lemma\n (requires (\n pos + S.length b1 + S.length b2 <= S.length a\n ))\n (ensures (\n pointwise_op f a (S.append b1 b2) pos == (\n pointwise_op f (S.slice a 0 (pos + S.length b1)) b1 pos `S.append`\n pointwise_op f (S.slice a (pos + S.length b1) (S.length a)) b2 0\n )))\n= S.lemma_split a (pos + S.length b1);\n pointwise_op_dec f (S.slice a 0 (pos + S.length b1)) (S.slice a (pos + S.length b1) (S.length a)) (S.append b1 b2) pos;\n let (b1', b2') = S.split (b1 `S.append` b2) (S.length b1) in\n assert (b1 `S.equal` b1' /\\ b2 `S.equal` b2')\n\n#pop-options\n\nlet pointwise_op_split\n (#t: Type)\n (f: t -> t -> t)\n (a b: S.seq t)\n (pos: nat)\n (pos_split: nat)\n: Lemma\n (requires (\n pos <= pos_split /\\\n pos_split <= pos + S.length b /\\\n pos + S.length b <= S.length a\n ))\n (ensures (\n let (a1, a2) = S.split a pos_split in\n let (b1, b2) = S.split b (pos_split - pos) in\n pointwise_op f a b pos == pointwise_op f a1 b1 pos `S.append` pointwise_op f a2 b2 0\n ))\n= S.lemma_split a pos_split;\n pointwise_op_dec f (S.slice a 0 pos_split) (S.slice a pos_split (S.length a)) b pos\n\nlet pointwise_op_slice_other\n (#a:Type) (f:a->a->a) (b1 b2:S.seq a) (pos:nat)\n (from to: nat)\n: Lemma\n (requires (\n S.length b2 + pos <= S.length b1 /\\\n from <= to /\\\n to <= S.length b1 /\\\n (to <= pos \\/ pos + S.length b2 <= from)\n ))\n (ensures (\n S.slice (pointwise_op f b1 b2 pos) from to `S.equal` S.slice b1 from to\n ))\n= let phi\n (i: nat { from <= i /\\ i < to })\n : Lemma\n (S.index (pointwise_op f b1 b2 pos) i == S.index b1 i)\n = if to <= pos\n then pointwise_index1 f b1 b2 i pos\n else pointwise_index3 f b1 b2 i pos\n in\n Classical.forall_intro phi\n\n\n// application: byte-wise xor\nlet xor_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logxor b1 b2 pos\n\n\n// proof of involution of the operator (uses extensionality for the\n// byte-wise variant)\nlet xor_involutive (b1 b2:byte) : Lemma\n (requires True)\n (ensures (b1 `U8.logxor` b2) `U8.logxor` b2 = b1) =\n FStar.UInt.logxor_associative (U8.v b1) (U8.v b2) (U8.v b2);\n FStar.UInt.logxor_self (U8.v b2);\n FStar.UInt.logxor_commutative (FStar.UInt.zero 8) (U8.v b1);\n FStar.UInt.logxor_lemma_1 (U8.v b1)\n\n\nlet xor_inplace_involutive (b1 b2:bytes) (pos:nat) : Lemma\n (requires S.length b2 + pos <= S.length b1)\n (ensures S.equal (xor_inplace (xor_inplace b1 b2 pos) b2 pos) b1)\n (decreases (S.length b2)) =\n let xor = xor_inplace (xor_inplace b1 b2 pos) b2 pos in\n let step (i:nat{i < S.length b1}) : Lemma (S.index xor i = S.index b1 i) =\n if i < pos then begin\n pointwise_index1 U8.logxor b1 b2 i pos;\n pointwise_index1 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else if i >= pos+S.length b2 then begin\n pointwise_index3 U8.logxor b1 b2 i pos;\n pointwise_index3 U8.logxor (xor_inplace b1 b2 pos) b2 i pos\n end else begin\n pointwise_index2 U8.logxor b1 b2 i pos;\n pointwise_index2 U8.logxor (xor_inplace b1 b2 pos) b2 i pos;\n xor_involutive (S.index b1 i) (S.index b2 (i-pos))\n end in\n\n FStar.Classical.forall_intro step\n\n\nlet xor_inplace_commutative (b b1 b2:bytes) (pos1 pos2:nat) : Lemma\n (requires\n S.length b1 + pos1 <= S.length b /\\\n S.length b2 + pos2 <= S.length b)\n (ensures S.equal\n (xor_inplace (xor_inplace b b1 pos1) b2 pos2)\n (xor_inplace (xor_inplace b b2 pos2) b1 pos1)) =\n let xor1 = xor_inplace (xor_inplace b b1 pos1) b2 pos2 in\n let xor2 = xor_inplace (xor_inplace b b2 pos2) b1 pos1 in\n let step (i:nat{i < S.length b}) : Lemma (S.index xor1 i = S.index xor2 i) =\n if i < pos1 then begin\n pointwise_index1 U8.logxor b b1 i pos1;\n pointwise_index1 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else if i >= pos1 + S.length b1 then begin\n pointwise_index3 U8.logxor b b1 i pos1;\n pointwise_index3 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end else begin\n pointwise_index2 U8.logxor b b1 i pos1;\n pointwise_index2 U8.logxor (xor_inplace b b2 pos2) b1 i pos1;\n if i < pos2 then begin\n pointwise_index1 U8.logxor b b2 i pos2;\n pointwise_index1 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else if i >= pos2 + S.length b2 then begin\n pointwise_index3 U8.logxor b b2 i pos2;\n pointwise_index3 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end else begin\n let ind = U8.v (S.index b i) in\n let ind1 = U8.v (S.index b1 (i-pos1)) in\n let ind2 = U8.v (S.index b2 (i-pos2)) in\n FStar.UInt.logxor_associative #8 ind ind1 ind2;\n FStar.UInt.logxor_associative #8 ind ind2 ind1;\n FStar.UInt.logxor_commutative #8 ind1 ind2;\n pointwise_index2 U8.logxor b b2 i pos2;\n pointwise_index2 U8.logxor (xor_inplace b b1 pos1) b2 i pos2\n end\n end in\n\n FStar.Classical.forall_intro step\n\nlet xor_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (pos: nat)\n: Lemma\n (requires (pos + S.length b <= S.length a))\n (ensures (xor_inplace a b pos `S.equal` a))\n= let psi\n (i: nat {i < S.length a})\n : Lemma\n (S.index (xor_inplace a b pos) i == S.index a i)\n = if i < pos\n then pointwise_index1 U8.logxor a b i pos\n else if i >= pos + S.length b\n then pointwise_index3 U8.logxor a b i pos\n else begin\n pointwise_index2 U8.logxor a b i pos;\n phi (i - pos);\n FStar.UInt.logxor_lemma_1 (U8.v (S.index a i))\n end\n in\n Classical.forall_intro psi\n\nlet and_inplace (b1 b2:bytes) (pos:nat)\n : Pure bytes\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n (decreases (S.length b2)) =\n pointwise_op U8.logand b1 b2 pos\n\nlet and_inplace_zero\n (a b: bytes)\n (phi: (i: nat {i < S.length b}) -> Lemma (S.index b i == 0uy))\n (i: nat {i < S.length a})\n: Lemma\n (requires (S.length b == S.length a))\n (ensures (S.index (and_inplace a b 0) i == 0uy))\n= pointwise_index2 U8.logand a b i 0;\n phi i;\n FStar.UInt.logand_lemma_1 (U8.v (S.index a i))\n\nlet rec bitwise_op (f:bool->bool->bool) (l1 l2:list bool) : Pure (list bool)\n (requires List.Tot.length l1 = List.Tot.length l2)\n (ensures fun l -> List.Tot.length l = List.Tot.length l1) =\n match l1,l2 with\n | [],[] -> []\n | x1::t1,x2::t2 -> f x1 x2 :: bitwise_op f t1 t2\n\n\nlet rec lemma_bitwise_op_index (f:bool->bool->bool) (l1 l2:list bool) (n:nat) : Lemma\n (requires List.Tot.length l1 = List.Tot.length l2 /\\ n < List.Tot.length l1)\n (ensures List.Tot.index (bitwise_op f l1 l2) n = f (List.Tot.index l1 n) (List.Tot.index l2 n)) =\n match l1,l2 with\n | [],[] -> ()\n | x1::t1,x2::t2 ->\n if n = 0 then ()\n else lemma_bitwise_op_index f t1 t2 (n-1)\n\nlet rec list_to_seq (#a:Type) (l:list a) : (s:(S.seq a){S.length s = List.Tot.length l /\\ (forall i. S.index s i == List.Tot.index l i)}) =\n match l with\n | [] -> S.empty\n | h :: t -> S.(create 1 h @| list_to_seq t)\n\nlet rec rev_seq (#a:Type) (s:S.seq a) : Pure (S.seq a)\n (requires True)\n (ensures fun s' -> S.length s = S.length s')\n (decreases (S.length s)) =\n if S.length s = 0 then S.empty\n else\n let _ = S.lemma_empty s in\n S.(rev_seq S.(slice s 1 (length s)) @| create 1 (index s 0))\n\n\nlet rec lemma_rev_seq (#a:Type) (s:S.seq a) (i:nat) : Lemma\n (requires i < S.length s)\n (ensures\n S.length (rev_seq s) = S.length s /\\\n S.index s i == S.index (rev_seq s) (S.length s-1-i))\n (decreases (i))=\n if S.length s = 0 then ()\n else if i = 0 then ()\n else lemma_rev_seq (S.slice s 1 (S.length s)) (i-1)\n\n#restart-solver\n\nlet lemma_arithmetic1 (a b c d e:int) : Lemma\n ((a+b+c+d)+(e-d) = (a+c+e)+b) =\n ()\n\nlet lemma_arithmetic2 (a b c d:int) : Lemma\n (a+(b-c)+d = a + ((b+d)-c)) =\n ()\n\nlet lemma_arithmetic3 (a b c:int) : Lemma\n ((a+b)-c = (a-c)+b) =\n ()\n\n\nlet lemma_propagate_mul_mod (a b:nat) : Lemma\n (requires b > 0)\n (ensures (\n let open FStar.Mul in\n (2*a) % (2*b) = 2 * (a % b))) =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_div_mod a b;\n lemma_div_mod (2*a) b;\n let (p,r) = ((a/b)*(2*b), 2*(a%b)) in\n assert (2*a = p + r);\n modulo_distributivity p r (2*b);\n multiple_modulo_lemma (a/b) (2*b);\n modulo_range_lemma a b;\n small_mod r (2*b)\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1 --z3rlimit 256\" // strange that F* has so much trouble completing this induction\nlet recompose_pow2_assoc (n:pos) (a:nat) : Lemma\n (let open FStar.Mul in 2 * (pow2 (n-1) * a) = pow2 n * a) =\n ()\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1 --z3rlimit 512\" // strange that F* has so much trouble completing this induction\nlet rec lemma_propagate_pow_mod (a b n:nat) : Lemma\n (requires b > 0)\n (ensures (\n let open FStar.Mul in", "dependencies": { "source_file": "QUIC.Spec.Lemmas.fst", "checked_file": "QUIC.Spec.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 1, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 512, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Prims.nat -> b: Prims.nat -> n: Prims.nat\n -> FStar.Pervasives.Lemma (requires b > 0)\n (ensures Prims.pow2 n * a % (Prims.pow2 n * b) = Prims.pow2 n * (a % b))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.op_Equality", "Prims.int", "Prims.bool", "QUIC.Spec.Lemmas.recompose_pow2_assoc", "Prims.op_Modulus", "Prims.unit", "Prims._assert", "Prims.b2t", "FStar.Mul.op_Star", "Prims.pow2", "Prims.op_Subtraction", "QUIC.Spec.Lemmas.lemma_propagate_pow_mod", "QUIC.Spec.Lemmas.lemma_propagate_mul_mod", "Prims.op_GreaterThan", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_propagate_pow_mod (a b n: nat)\n : Lemma (requires b > 0)\n (ensures (let open FStar.Mul in (pow2 n * a) % (pow2 n * b) = pow2 n * (a % b)))\nlet rec lemma_propagate_pow_mod (a b n: nat)\n : Lemma (requires b > 0)\n (ensures (let open FStar.Mul in (pow2 n * a) % (pow2 n * b) = pow2 n * (a % b))) =", "completed_definiton": "let open FStar.Mul in\nlet open FStar.Math.Lemmas in\nif n = 0\nthen ()\nelse\n let res = (pow2 n * a) % (pow2 n * b) in\n lemma_propagate_mul_mod (pow2 (n - 1) * a) (pow2 (n - 1) * b);\n assert (res = 2 * ((pow2 (n - 1) * a) % (pow2 (n - 1) * b)));\n lemma_propagate_pow_mod a b (n - 1);\n assert (res = 2 * (pow2 (n - 1) * (a % b)));\n recompose_pow2_assoc n (a % b)", "isa_cross_project_example": true }, { "file_name": "QUIC.UInt62.fst", "name": "QUIC.UInt62.secret", "original_source_type": "", "source_type": "val secret : Type0", "source_definition": "let secret = (x: Secret.uint64 { Secret.v x < U64.v bound })", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.UInt62.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 17, "start_col": 13, "end_line": 17, "end_col": 60 }, "file_context": "module QUIC.UInt62\nmodule U64 = FStar.UInt64\ninclude FStar.UInt64\n\ninline_for_extraction\nlet bound : (bound: U64.t { U64.v bound == pow2 62 }) =\n [@inline_let] let v = 4611686018427387904uL in\n [@inline_let] let _ = assert_norm (U64.v v == pow2 62) in\n v\n\ninline_for_extraction\nlet t = (x: U64.t { U64.v x < U64.v bound })\n\nmodule Secret = QUIC.Secret.Int", "dependencies": { "source_file": "QUIC.UInt62.fst", "checked_file": "QUIC.UInt62.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.uint64", "Prims.b2t", "Prims.op_LessThan", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "FStar.UInt64.v", "QUIC.UInt62.bound" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let secret =", "completed_definiton": "(x: Secret.uint64{Secret.v x < U64.v bound})", "isa_cross_project_example": true }, { "file_name": "QUIC.UInt62.fst", "name": "QUIC.UInt62.bound", "original_source_type": "val bound:(bound: U64.t{U64.v bound == pow2 62})", "source_type": "val bound:(bound: U64.t{U64.v bound == pow2 62})", "source_definition": "let bound : (bound: U64.t { U64.v bound == pow2 62 }) =\n [@inline_let] let v = 4611686018427387904uL in\n [@inline_let] let _ = assert_norm (U64.v v == pow2 62) in\n v", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.UInt62.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 7, "start_col": 2, "end_line": 9, "end_col": 3 }, "file_context": "module QUIC.UInt62\nmodule U64 = FStar.UInt64\ninclude FStar.UInt64\n\ninline_for_extraction", "dependencies": { "source_file": "QUIC.UInt62.fst", "checked_file": "QUIC.UInt62.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "bound: FStar.UInt64.t{FStar.UInt64.v bound == Prims.pow2 62}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt64.n", "Prims.b2t", "Prims.op_GreaterThan", "FStar.UInt64.v", "Prims.pow2", "FStar.UInt64.t", "FStar.UInt64.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val bound:(bound: U64.t{U64.v bound == pow2 62})\nlet bound:(bound: U64.t{U64.v bound == pow2 62}) =", "completed_definiton": "[@@ inline_let ]let v = 4611686018427387904uL in\n[@@ inline_let ]let _ = assert_norm (U64.v v == pow2 62) in\nv", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.fsti", "name": "QUIC.Spec.iv_t", "original_source_type": "", "source_type": "val iv_t : a: QUIC.Spec.Crypto.ea -> Type0", "source_definition": "let iv_t (a: ea) = (x: AEAD.iv a { Seq.length x == 12 })", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 37, "start_col": 19, "end_line": 37, "end_col": 56 }, "file_context": "module QUIC.Spec\n\ninclude QUIC.Spec.Header.Base\ninclude QUIC.Spec.Crypto\n\nmodule Seq = FStar.Seq\nmodule HD = Spec.Hash.Definitions\nmodule AEAD = Spec.Agile.AEAD\nmodule Cipher = Spec.Agile.Cipher\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Secret = QUIC.Secret.Int\n\nnoeq\ntype h_result =\n| H_Success:\n h: header ->\n cipher: cbytes' (is_retry h) ->\n rem: bytes ->\n h_result\n| H_Failure\n\n// TODO: add a prefix lemma on header_decrypt, if ever useful\n\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\n\n\nnoeq\ntype result =\n| Success: \n h: header ->\n plain: bytes ->\n remainder: bytes ->\n result\n| Failure", "dependencies": { "source_file": "QUIC.Spec.fsti", "checked_file": "QUIC.Spec.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.Crypto.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: QUIC.Spec.Crypto.ea -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.AEAD.iv", "Prims.eq2", "Prims.int", "FStar.Seq.Base.length", "Spec.Agile.AEAD.uint8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let iv_t (a: ea) =", "completed_definiton": "(x: AEAD.iv a {Seq.length x == 12})", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Crypto.fst", "name": "QUIC.Spec.Crypto.label_iv_l", "original_source_type": "val label_iv_l:List.Tot.llist U8.t 2", "source_type": "val label_iv_l:List.Tot.llist U8.t 2", "source_definition": "let label_iv_l: List.Tot.llist U8.t 2 =\n [@inline_let]\n let l = [ 0x69uy; 0x76uy ] in\n assert_norm (List.Tot.length l = 2);\n l", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Crypto.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 44, "start_col": 2, "end_line": 47, "end_col": 3 }, "file_context": "module QUIC.Spec.Crypto\n\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule HKDF = Spec.Agile.HKDF\n\ninline_for_extraction\nnoextract\nlet prefix_l: List.Tot.llist U8.t 11 =\n // : \"tls13 quic \"\n [@inline_let]\n let l = [0x74uy; 0x6cuy; 0x73uy; 0x31uy; 0x33uy;\n 0x20uy; 0x71uy; 0x75uy; 0x69uy; 0x63uy; 0x20uy] in\n assert_norm (List.Tot.length l == 11);\n l\n\nnoextract\nlet prefix: lbytes 11 =\n Seq.seq_of_list prefix_l\n\n#push-options \"--z3rlimit 10\"\nlet lemma_hash_lengths (a:ha)\n : Lemma (HD.hash_length a <= 64 /\\ HD.word_length a <= 8 /\\\n HD.block_length a <= 128 /\\\n (if Some? (HD.max_input_length a) then Some?.v (HD.max_input_length a) >= pow2 61 - 1 else True))\n =\n assert_norm(pow2 61 < pow2 125)\n#pop-options\n\ninline_for_extraction\nnoextract\nlet label_key_l: List.Tot.llist U8.t 3 =\n [@inline_let]\n let l = [ 0x6buy; 0x65uy; 0x79uy ] in\n assert_norm (List.Tot.length l = 3);\n l\n\nlet label_key =\n Seq.seq_of_list label_key_l\n\ninline_for_extraction\nnoextract", "dependencies": { "source_file": "QUIC.Spec.Crypto.fst", "checked_file": "QUIC.Spec.Crypto.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "FStar.List.Tot.Properties.llist FStar.UInt8.t 2", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.b2t", "Prims.op_Equality", "Prims.int", "FStar.List.Tot.Base.length", "FStar.UInt8.t", "Prims.list", "Prims.Cons", "FStar.UInt8.__uint_to_t", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val label_iv_l:List.Tot.llist U8.t 2\nlet label_iv_l:List.Tot.llist U8.t 2 =", "completed_definiton": "[@@ inline_let ]let l = [0x69uy; 0x76uy] in\nassert_norm (List.Tot.length l = 2);\nl", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Crypto.fst", "name": "QUIC.Spec.Crypto.label_hp_l", "original_source_type": "val label_hp_l:List.Tot.llist U8.t 2", "source_type": "val label_hp_l:List.Tot.llist U8.t 2", "source_definition": "let label_hp_l: List.Tot.llist U8.t 2 =\n [@inline_let]\n let l = [ 0x68uy; 0x70uy ] in\n assert_norm (List.Tot.length l = 2);\n l", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Crypto.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 55, "start_col": 2, "end_line": 58, "end_col": 3 }, "file_context": "module QUIC.Spec.Crypto\n\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule HKDF = Spec.Agile.HKDF\n\ninline_for_extraction\nnoextract\nlet prefix_l: List.Tot.llist U8.t 11 =\n // : \"tls13 quic \"\n [@inline_let]\n let l = [0x74uy; 0x6cuy; 0x73uy; 0x31uy; 0x33uy;\n 0x20uy; 0x71uy; 0x75uy; 0x69uy; 0x63uy; 0x20uy] in\n assert_norm (List.Tot.length l == 11);\n l\n\nnoextract\nlet prefix: lbytes 11 =\n Seq.seq_of_list prefix_l\n\n#push-options \"--z3rlimit 10\"\nlet lemma_hash_lengths (a:ha)\n : Lemma (HD.hash_length a <= 64 /\\ HD.word_length a <= 8 /\\\n HD.block_length a <= 128 /\\\n (if Some? (HD.max_input_length a) then Some?.v (HD.max_input_length a) >= pow2 61 - 1 else True))\n =\n assert_norm(pow2 61 < pow2 125)\n#pop-options\n\ninline_for_extraction\nnoextract\nlet label_key_l: List.Tot.llist U8.t 3 =\n [@inline_let]\n let l = [ 0x6buy; 0x65uy; 0x79uy ] in\n assert_norm (List.Tot.length l = 3);\n l\n\nlet label_key =\n Seq.seq_of_list label_key_l\n\ninline_for_extraction\nnoextract\nlet label_iv_l: List.Tot.llist U8.t 2 =\n [@inline_let]\n let l = [ 0x69uy; 0x76uy ] in\n assert_norm (List.Tot.length l = 2);\n l\n\nlet label_iv =\n Seq.seq_of_list label_iv_l\n\ninline_for_extraction\nnoextract", "dependencies": { "source_file": "QUIC.Spec.Crypto.fst", "checked_file": "QUIC.Spec.Crypto.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "FStar.List.Tot.Properties.llist FStar.UInt8.t 2", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.b2t", "Prims.op_Equality", "Prims.int", "FStar.List.Tot.Base.length", "FStar.UInt8.t", "Prims.list", "Prims.Cons", "FStar.UInt8.__uint_to_t", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val label_hp_l:List.Tot.llist U8.t 2\nlet label_hp_l:List.Tot.llist U8.t 2 =", "completed_definiton": "[@@ inline_let ]let l = [0x68uy; 0x70uy] in\nassert_norm (List.Tot.length l = 2);\nl", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Crypto.fst", "name": "QUIC.Spec.Crypto.label_key_l", "original_source_type": "val label_key_l:List.Tot.llist U8.t 3", "source_type": "val label_key_l:List.Tot.llist U8.t 3", "source_definition": "let label_key_l: List.Tot.llist U8.t 3 =\n [@inline_let]\n let l = [ 0x6buy; 0x65uy; 0x79uy ] in\n assert_norm (List.Tot.length l = 3);\n l", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Crypto.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 33, "start_col": 2, "end_line": 36, "end_col": 3 }, "file_context": "module QUIC.Spec.Crypto\n\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule HKDF = Spec.Agile.HKDF\n\ninline_for_extraction\nnoextract\nlet prefix_l: List.Tot.llist U8.t 11 =\n // : \"tls13 quic \"\n [@inline_let]\n let l = [0x74uy; 0x6cuy; 0x73uy; 0x31uy; 0x33uy;\n 0x20uy; 0x71uy; 0x75uy; 0x69uy; 0x63uy; 0x20uy] in\n assert_norm (List.Tot.length l == 11);\n l\n\nnoextract\nlet prefix: lbytes 11 =\n Seq.seq_of_list prefix_l\n\n#push-options \"--z3rlimit 10\"\nlet lemma_hash_lengths (a:ha)\n : Lemma (HD.hash_length a <= 64 /\\ HD.word_length a <= 8 /\\\n HD.block_length a <= 128 /\\\n (if Some? (HD.max_input_length a) then Some?.v (HD.max_input_length a) >= pow2 61 - 1 else True))\n =\n assert_norm(pow2 61 < pow2 125)\n#pop-options\n\ninline_for_extraction\nnoextract", "dependencies": { "source_file": "QUIC.Spec.Crypto.fst", "checked_file": "QUIC.Spec.Crypto.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "FStar.List.Tot.Properties.llist FStar.UInt8.t 3", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.b2t", "Prims.op_Equality", "Prims.int", "FStar.List.Tot.Base.length", "FStar.UInt8.t", "Prims.list", "Prims.Cons", "FStar.UInt8.__uint_to_t", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val label_key_l:List.Tot.llist U8.t 3\nlet label_key_l:List.Tot.llist U8.t 3 =", "completed_definiton": "[@@ inline_let ]let l = [0x6buy; 0x65uy; 0x79uy] in\nassert_norm (List.Tot.length l = 3);\nl", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Crypto.fst", "name": "QUIC.Spec.Crypto.prefix_l", "original_source_type": "val prefix_l:List.Tot.llist U8.t 11", "source_type": "val prefix_l:List.Tot.llist U8.t 11", "source_definition": "let prefix_l: List.Tot.llist U8.t 11 =\n // : \"tls13 quic \"\n [@inline_let]\n let l = [0x74uy; 0x6cuy; 0x73uy; 0x31uy; 0x33uy;\n 0x20uy; 0x71uy; 0x75uy; 0x69uy; 0x63uy; 0x20uy] in\n assert_norm (List.Tot.length l == 11);\n l", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Crypto.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 11, "start_col": 2, "end_line": 15, "end_col": 3 }, "file_context": "module QUIC.Spec.Crypto\n\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule HKDF = Spec.Agile.HKDF\n\ninline_for_extraction\nnoextract\nlet prefix_l: List.Tot.llist U8.t 11 =", "dependencies": { "source_file": "QUIC.Spec.Crypto.fst", "checked_file": "QUIC.Spec.Crypto.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "FStar.List.Tot.Properties.llist FStar.UInt8.t 11", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.int", "FStar.List.Tot.Base.length", "FStar.UInt8.t", "Prims.list", "Prims.Cons", "FStar.UInt8.__uint_to_t", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val prefix_l:List.Tot.llist U8.t 11\nlet prefix_l:List.Tot.llist U8.t 11 =", "completed_definiton": "[@@ inline_let ]let l =\n [0x74uy; 0x6cuy; 0x73uy; 0x31uy; 0x33uy; 0x20uy; 0x71uy; 0x75uy; 0x69uy; 0x63uy; 0x20uy]\nin\nassert_norm (List.Tot.length l == 11);\nl", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Crypto.fst", "name": "QUIC.Spec.Crypto.label_hp", "original_source_type": "val label_hp: lbytes 2", "source_type": "val label_hp: lbytes 2", "source_definition": "let label_hp =\n Seq.seq_of_list label_hp_l", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Crypto.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 61, "start_col": 2, "end_line": 61, "end_col": 28 }, "file_context": "module QUIC.Spec.Crypto\n\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule HKDF = Spec.Agile.HKDF\n\ninline_for_extraction\nnoextract\nlet prefix_l: List.Tot.llist U8.t 11 =\n // : \"tls13 quic \"\n [@inline_let]\n let l = [0x74uy; 0x6cuy; 0x73uy; 0x31uy; 0x33uy;\n 0x20uy; 0x71uy; 0x75uy; 0x69uy; 0x63uy; 0x20uy] in\n assert_norm (List.Tot.length l == 11);\n l\n\nnoextract\nlet prefix: lbytes 11 =\n Seq.seq_of_list prefix_l\n\n#push-options \"--z3rlimit 10\"\nlet lemma_hash_lengths (a:ha)\n : Lemma (HD.hash_length a <= 64 /\\ HD.word_length a <= 8 /\\\n HD.block_length a <= 128 /\\\n (if Some? (HD.max_input_length a) then Some?.v (HD.max_input_length a) >= pow2 61 - 1 else True))\n =\n assert_norm(pow2 61 < pow2 125)\n#pop-options\n\ninline_for_extraction\nnoextract\nlet label_key_l: List.Tot.llist U8.t 3 =\n [@inline_let]\n let l = [ 0x6buy; 0x65uy; 0x79uy ] in\n assert_norm (List.Tot.length l = 3);\n l\n\nlet label_key =\n Seq.seq_of_list label_key_l\n\ninline_for_extraction\nnoextract\nlet label_iv_l: List.Tot.llist U8.t 2 =\n [@inline_let]\n let l = [ 0x69uy; 0x76uy ] in\n assert_norm (List.Tot.length l = 2);\n l\n\nlet label_iv =\n Seq.seq_of_list label_iv_l\n\ninline_for_extraction\nnoextract\nlet label_hp_l: List.Tot.llist U8.t 2 =\n [@inline_let]\n let l = [ 0x68uy; 0x70uy ] in\n assert_norm (List.Tot.length l = 2);\n l", "dependencies": { "source_file": "QUIC.Spec.Crypto.fst", "checked_file": "QUIC.Spec.Crypto.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "QUIC.Spec.Base.lbytes 2", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Properties.seq_of_list", "FStar.UInt8.t", "QUIC.Spec.Crypto.label_hp_l" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val label_hp: lbytes 2\nlet label_hp =", "completed_definiton": "Seq.seq_of_list label_hp_l", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Crypto.fst", "name": "QUIC.Spec.Crypto.label_iv", "original_source_type": "val label_iv: lbytes 2", "source_type": "val label_iv: lbytes 2", "source_definition": "let label_iv =\n Seq.seq_of_list label_iv_l", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Crypto.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 50, "start_col": 2, "end_line": 50, "end_col": 28 }, "file_context": "module QUIC.Spec.Crypto\n\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule HKDF = Spec.Agile.HKDF\n\ninline_for_extraction\nnoextract\nlet prefix_l: List.Tot.llist U8.t 11 =\n // : \"tls13 quic \"\n [@inline_let]\n let l = [0x74uy; 0x6cuy; 0x73uy; 0x31uy; 0x33uy;\n 0x20uy; 0x71uy; 0x75uy; 0x69uy; 0x63uy; 0x20uy] in\n assert_norm (List.Tot.length l == 11);\n l\n\nnoextract\nlet prefix: lbytes 11 =\n Seq.seq_of_list prefix_l\n\n#push-options \"--z3rlimit 10\"\nlet lemma_hash_lengths (a:ha)\n : Lemma (HD.hash_length a <= 64 /\\ HD.word_length a <= 8 /\\\n HD.block_length a <= 128 /\\\n (if Some? (HD.max_input_length a) then Some?.v (HD.max_input_length a) >= pow2 61 - 1 else True))\n =\n assert_norm(pow2 61 < pow2 125)\n#pop-options\n\ninline_for_extraction\nnoextract\nlet label_key_l: List.Tot.llist U8.t 3 =\n [@inline_let]\n let l = [ 0x6buy; 0x65uy; 0x79uy ] in\n assert_norm (List.Tot.length l = 3);\n l\n\nlet label_key =\n Seq.seq_of_list label_key_l\n\ninline_for_extraction\nnoextract\nlet label_iv_l: List.Tot.llist U8.t 2 =\n [@inline_let]\n let l = [ 0x69uy; 0x76uy ] in\n assert_norm (List.Tot.length l = 2);\n l", "dependencies": { "source_file": "QUIC.Spec.Crypto.fst", "checked_file": "QUIC.Spec.Crypto.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "QUIC.Spec.Base.lbytes 2", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Properties.seq_of_list", "FStar.UInt8.t", "QUIC.Spec.Crypto.label_iv_l" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val label_iv: lbytes 2\nlet label_iv =", "completed_definiton": "Seq.seq_of_list label_iv_l", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Crypto.fst", "name": "QUIC.Spec.Crypto.prefix", "original_source_type": "val prefix:lbytes 11", "source_type": "val prefix:lbytes 11", "source_definition": "let prefix: lbytes 11 =\n Seq.seq_of_list prefix_l", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Crypto.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 19, "start_col": 2, "end_line": 19, "end_col": 26 }, "file_context": "module QUIC.Spec.Crypto\n\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule HKDF = Spec.Agile.HKDF\n\ninline_for_extraction\nnoextract\nlet prefix_l: List.Tot.llist U8.t 11 =\n // : \"tls13 quic \"\n [@inline_let]\n let l = [0x74uy; 0x6cuy; 0x73uy; 0x31uy; 0x33uy;\n 0x20uy; 0x71uy; 0x75uy; 0x69uy; 0x63uy; 0x20uy] in\n assert_norm (List.Tot.length l == 11);\n l\n\nnoextract", "dependencies": { "source_file": "QUIC.Spec.Crypto.fst", "checked_file": "QUIC.Spec.Crypto.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "QUIC.Spec.Base.lbytes 11", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Properties.seq_of_list", "FStar.UInt8.t", "QUIC.Spec.Crypto.prefix_l" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val prefix:lbytes 11\nlet prefix:lbytes 11 =", "completed_definiton": "Seq.seq_of_list prefix_l", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Crypto.fst", "name": "QUIC.Spec.Crypto.label_key", "original_source_type": "val label_key: lbytes 3", "source_type": "val label_key: lbytes 3", "source_definition": "let label_key =\n Seq.seq_of_list label_key_l", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Crypto.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 39, "start_col": 2, "end_line": 39, "end_col": 29 }, "file_context": "module QUIC.Spec.Crypto\n\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule HKDF = Spec.Agile.HKDF\n\ninline_for_extraction\nnoextract\nlet prefix_l: List.Tot.llist U8.t 11 =\n // : \"tls13 quic \"\n [@inline_let]\n let l = [0x74uy; 0x6cuy; 0x73uy; 0x31uy; 0x33uy;\n 0x20uy; 0x71uy; 0x75uy; 0x69uy; 0x63uy; 0x20uy] in\n assert_norm (List.Tot.length l == 11);\n l\n\nnoextract\nlet prefix: lbytes 11 =\n Seq.seq_of_list prefix_l\n\n#push-options \"--z3rlimit 10\"\nlet lemma_hash_lengths (a:ha)\n : Lemma (HD.hash_length a <= 64 /\\ HD.word_length a <= 8 /\\\n HD.block_length a <= 128 /\\\n (if Some? (HD.max_input_length a) then Some?.v (HD.max_input_length a) >= pow2 61 - 1 else True))\n =\n assert_norm(pow2 61 < pow2 125)\n#pop-options\n\ninline_for_extraction\nnoextract\nlet label_key_l: List.Tot.llist U8.t 3 =\n [@inline_let]\n let l = [ 0x6buy; 0x65uy; 0x79uy ] in\n assert_norm (List.Tot.length l = 3);\n l", "dependencies": { "source_file": "QUIC.Spec.Crypto.fst", "checked_file": "QUIC.Spec.Crypto.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "QUIC.Spec.Base.lbytes 3", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Properties.seq_of_list", "FStar.UInt8.t", "QUIC.Spec.Crypto.label_key_l" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val label_key: lbytes 3\nlet label_key =", "completed_definiton": "Seq.seq_of_list label_key_l", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Crypto.fst", "name": "QUIC.Spec.Crypto.lemma_hash_lengths", "original_source_type": "val lemma_hash_lengths (a: ha)\n : Lemma\n (HD.hash_length a <= 64 /\\ HD.word_length a <= 8 /\\ HD.block_length a <= 128 /\\\n (if Some? (HD.max_input_length a)\n then Some?.v (HD.max_input_length a) >= pow2 61 - 1\n else True))", "source_type": "val lemma_hash_lengths (a: ha)\n : Lemma\n (HD.hash_length a <= 64 /\\ HD.word_length a <= 8 /\\ HD.block_length a <= 128 /\\\n (if Some? (HD.max_input_length a)\n then Some?.v (HD.max_input_length a) >= pow2 61 - 1\n else True))", "source_definition": "let lemma_hash_lengths (a:ha)\n : Lemma (HD.hash_length a <= 64 /\\ HD.word_length a <= 8 /\\\n HD.block_length a <= 128 /\\\n (if Some? (HD.max_input_length a) then Some?.v (HD.max_input_length a) >= pow2 61 - 1 else True))\n =\n assert_norm(pow2 61 < pow2 125)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Crypto.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 27, "start_col": 2, "end_line": 27, "end_col": 33 }, "file_context": "module QUIC.Spec.Crypto\n\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule HKDF = Spec.Agile.HKDF\n\ninline_for_extraction\nnoextract\nlet prefix_l: List.Tot.llist U8.t 11 =\n // : \"tls13 quic \"\n [@inline_let]\n let l = [0x74uy; 0x6cuy; 0x73uy; 0x31uy; 0x33uy;\n 0x20uy; 0x71uy; 0x75uy; 0x69uy; 0x63uy; 0x20uy] in\n assert_norm (List.Tot.length l == 11);\n l\n\nnoextract\nlet prefix: lbytes 11 =\n Seq.seq_of_list prefix_l\n\n#push-options \"--z3rlimit 10\"\nlet lemma_hash_lengths (a:ha)\n : Lemma (HD.hash_length a <= 64 /\\ HD.word_length a <= 8 /\\\n HD.block_length a <= 128 /\\\n (if Some? (HD.max_input_length a) then Some?.v (HD.max_input_length a) >= pow2 61 - 1 else True))", "dependencies": { "source_file": "QUIC.Spec.Crypto.fst", "checked_file": "QUIC.Spec.Crypto.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 10, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: QUIC.Spec.Crypto.ha\n -> FStar.Pervasives.Lemma\n (ensures\n Spec.Hash.Definitions.hash_length a <= 64 /\\ Spec.Hash.Definitions.word_length a <= 8 /\\\n Spec.Hash.Definitions.block_length a <= 128 /\\\n (match Some? (Spec.Hash.Definitions.max_input_length a) with\n | true -> Some?.v (Spec.Hash.Definitions.max_input_length a) >= Prims.pow2 61 - 1\n | _ -> Prims.l_True))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ha", "FStar.Pervasives.assert_norm", "Prims.b2t", "Prims.op_LessThan", "Prims.pow2", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.l_and", "Prims.op_LessThanOrEqual", "Spec.Hash.Definitions.hash_length", "Spec.Hash.Definitions.word_length", "Spec.Hash.Definitions.block_length", "FStar.Pervasives.Native.uu___is_Some", "Prims.pos", "Spec.Hash.Definitions.max_input_length", "Prims.op_GreaterThanOrEqual", "FStar.Pervasives.Native.__proj__Some__item__v", "Prims.op_Subtraction", "Prims.bool", "Prims.logical", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_hash_lengths (a: ha)\n : Lemma\n (HD.hash_length a <= 64 /\\ HD.word_length a <= 8 /\\ HD.block_length a <= 128 /\\\n (if Some? (HD.max_input_length a)\n then Some?.v (HD.max_input_length a) >= pow2 61 - 1\n else True))\nlet lemma_hash_lengths (a: ha)\n : Lemma\n (HD.hash_length a <= 64 /\\ HD.word_length a <= 8 /\\ HD.block_length a <= 128 /\\\n (if Some? (HD.max_input_length a)\n then Some?.v (HD.max_input_length a) >= pow2 61 - 1\n else True)) =", "completed_definiton": "assert_norm (pow2 61 < pow2 125)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Crypto.fst", "name": "QUIC.Spec.Crypto.derive_secret", "original_source_type": "val derive_secret:\n a: ha ->\n prk:HD.bytes_hash a ->\n label: bytes ->\n len: nat ->\n Pure (Seq.seq Secret.uint8)\n (requires len <= 255 /\\\n Seq.length label <= 244 /\\\n keysized a (Seq.length prk)\n )\n (ensures fun out ->\n Seq.length out == len\n )", "source_type": "val derive_secret:\n a: ha ->\n prk:HD.bytes_hash a ->\n label: bytes ->\n len: nat ->\n Pure (Seq.seq Secret.uint8)\n (requires len <= 255 /\\\n Seq.length label <= 244 /\\\n keysized a (Seq.length prk)\n )\n (ensures fun out ->\n Seq.length out == len\n )", "source_definition": "let derive_secret a prk label len =\n let open Seq in\n let z = Seq.create 1 0uy in\n let lb = Seq.create 1 (U8.uint_to_t len) in // len <= 255\n let llen = Seq.create 1 (U8.uint_to_t (11 + Seq.length label)) in\n let info = z @| lb @| llen @| prefix @| label @| z in\n lemma_hash_lengths a;\n assert_norm(452 < pow2 61);\n HKDF.expand a prk (Seq.seq_hide info) len", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Crypto.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 64, "start_col": 2, "end_line": 71, "end_col": 43 }, "file_context": "module QUIC.Spec.Crypto\n\nmodule U8 = FStar.UInt8\nmodule Seq = QUIC.Secret.Seq\nmodule HKDF = Spec.Agile.HKDF\n\ninline_for_extraction\nnoextract\nlet prefix_l: List.Tot.llist U8.t 11 =\n // : \"tls13 quic \"\n [@inline_let]\n let l = [0x74uy; 0x6cuy; 0x73uy; 0x31uy; 0x33uy;\n 0x20uy; 0x71uy; 0x75uy; 0x69uy; 0x63uy; 0x20uy] in\n assert_norm (List.Tot.length l == 11);\n l\n\nnoextract\nlet prefix: lbytes 11 =\n Seq.seq_of_list prefix_l\n\n#push-options \"--z3rlimit 10\"\nlet lemma_hash_lengths (a:ha)\n : Lemma (HD.hash_length a <= 64 /\\ HD.word_length a <= 8 /\\\n HD.block_length a <= 128 /\\\n (if Some? (HD.max_input_length a) then Some?.v (HD.max_input_length a) >= pow2 61 - 1 else True))\n =\n assert_norm(pow2 61 < pow2 125)\n#pop-options\n\ninline_for_extraction\nnoextract\nlet label_key_l: List.Tot.llist U8.t 3 =\n [@inline_let]\n let l = [ 0x6buy; 0x65uy; 0x79uy ] in\n assert_norm (List.Tot.length l = 3);\n l\n\nlet label_key =\n Seq.seq_of_list label_key_l\n\ninline_for_extraction\nnoextract\nlet label_iv_l: List.Tot.llist U8.t 2 =\n [@inline_let]\n let l = [ 0x69uy; 0x76uy ] in\n assert_norm (List.Tot.length l = 2);\n l\n\nlet label_iv =\n Seq.seq_of_list label_iv_l\n\ninline_for_extraction\nnoextract\nlet label_hp_l: List.Tot.llist U8.t 2 =\n [@inline_let]\n let l = [ 0x68uy; 0x70uy ] in\n assert_norm (List.Tot.length l = 2);\n l\n\nlet label_hp =\n Seq.seq_of_list label_hp_l", "dependencies": { "source_file": "QUIC.Spec.Crypto.fst", "checked_file": "QUIC.Spec.Crypto.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ha ->\n prk: Spec.Hash.Definitions.bytes_hash a ->\n label: QUIC.Spec.Base.bytes ->\n len: Prims.nat\n -> Prims.Pure (FStar.Seq.Base.seq Lib.IntTypes.uint8)", "effect": "Prims.Pure", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ha", "Spec.Hash.Definitions.bytes_hash", "QUIC.Spec.Base.bytes", "Prims.nat", "Spec.Agile.HKDF.expand", "QUIC.Secret.Seq.seq_hide", "Lib.IntTypes.U8", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.b2t", "Prims.op_LessThan", "Prims.pow2", "QUIC.Spec.Crypto.lemma_hash_lengths", "FStar.Seq.Base.seq", "QUIC.Spec.Base.byte", "FStar.Seq.Base.op_At_Bar", "QUIC.Spec.Crypto.prefix", "FStar.Seq.Base.create", "FStar.UInt8.uint_to_t", "Prims.op_Addition", "FStar.Seq.Base.length", "FStar.UInt8.__uint_to_t", "Lib.IntTypes.uint8" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val derive_secret:\n a: ha ->\n prk:HD.bytes_hash a ->\n label: bytes ->\n len: nat ->\n Pure (Seq.seq Secret.uint8)\n (requires len <= 255 /\\\n Seq.length label <= 244 /\\\n keysized a (Seq.length prk)\n )\n (ensures fun out ->\n Seq.length out == len\n )\nlet derive_secret a prk label len =", "completed_definiton": "let open Seq in\nlet z = Seq.create 1 0uy in\nlet lb = Seq.create 1 (U8.uint_to_t len) in\nlet llen = Seq.create 1 (U8.uint_to_t (11 + Seq.length label)) in\nlet info = z @| lb @| llen @| prefix @| label @| z in\nlemma_hash_lengths a;\nassert_norm (452 < pow2 61);\nHKDF.expand a prk (Seq.seq_hide info) len", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.stream_writer", "original_source_type": "val stream_writer: (k:id) -> Type u#1", "source_type": "val stream_writer: (k:id) -> Type u#1", "source_definition": "let stream_writer = stream_writer'", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 81, "start_col": 20, "end_line": 81, "end_col": 34 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "k: Model.QUIC.id -> Type", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.stream_writer'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val stream_writer: (k:id) -> Type u#1\nlet stream_writer =", "completed_definiton": "stream_writer'", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.stream_reader", "original_source_type": "val stream_reader: #k:id -> w:stream_writer k -> Type u#1", "source_type": "val stream_reader: #k:id -> w:stream_writer k -> Type u#1", "source_definition": "let stream_reader = stream_reader'", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 91, "start_col": 20, "end_line": 91, "end_col": 34 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.QUIC.stream_writer k -> Type", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.stream_reader'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val stream_reader: #k:id -> w:stream_writer k -> Type u#1\nlet stream_reader =", "completed_definiton": "stream_reader'", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.writer_info", "original_source_type": "val writer_info: #k:id -> w:stream_writer k -> info", "source_type": "val writer_info: #k:id -> w:stream_writer k -> info", "source_definition": "let writer_info #k w = w.info", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 93, "start_col": 23, "end_line": 93, "end_col": 29 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.QUIC.stream_writer k -> Model.QUIC.info", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Model.QUIC.__proj__Writer__item__info", "Model.QUIC.info" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val writer_info: #k:id -> w:stream_writer k -> info\nlet writer_info #k w =", "completed_definiton": "w.info", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.reader_aead_state", "original_source_type": "val reader_aead_state : #k:id -> #w:stream_writer k -> r:stream_reader w ->\n ar:AEAD.aead_reader (writer_aead_state w)", "source_type": "val reader_aead_state : #k:id -> #w:stream_writer k -> r:stream_reader w ->\n ar:AEAD.aead_reader (writer_aead_state w)", "source_definition": "let reader_aead_state #k #w r = r.aer", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 102, "start_col": 32, "end_line": 102, "end_col": 37 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "r: Model.QUIC.stream_reader w -> Model.AEAD.aead_reader (Model.QUIC.writer_aead_state w)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Model.QUIC.stream_reader", "Model.QUIC.__proj__Reader__item__aer", "Model.AEAD.aead_reader", "FStar.Pervasives.dfst", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Prims.b2t", "Model.PNE.is_safe", "Model.AEAD.is_safe", "Model.QUIC.writer_aead_state" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val reader_aead_state : #k:id -> #w:stream_writer k -> r:stream_reader w ->\n ar:AEAD.aead_reader (writer_aead_state w)\nlet reader_aead_state #k #w r =", "completed_definiton": "r.aer", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.writer_offset", "original_source_type": "val writer_offset: #k:id -> w:stream_writer k -> pn", "source_type": "val writer_offset: #k:id -> w:stream_writer k -> pn", "source_definition": "let writer_offset #k w = w.offset", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 167, "start_col": 25, "end_line": 167, "end_col": 33 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h\n\nlet invariant #k w h =\n AEAD.winvariant w.ae h /\\\n PNE.invariant w.pne h /\\\n h `HS.contains` w.ctr /\\\n fresh_nonces w h /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` AEAD.wfootprint w.ae\n\nlet rinvariant #k #w r h = invariant w h /\\\n h `HS.contains` r.last /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr)", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.QUIC.stream_writer k -> Model.QUIC.pn", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Model.QUIC.__proj__Writer__item__offset", "Model.QUIC.pn" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val writer_offset: #k:id -> w:stream_writer k -> pn\nlet writer_offset #k w =", "completed_definiton": "w.offset", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.writer_pne_state", "original_source_type": "val writer_pne_state : #k:id -> w:stream_writer k -> PNE.pne_state (writer_pne_info w)", "source_type": "val writer_pne_state : #k:id -> w:stream_writer k -> PNE.pne_state (writer_pne_info w)", "source_definition": "let writer_pne_state #k w = w.pne", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 104, "start_col": 28, "end_line": 104, "end_col": 33 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.QUIC.stream_writer k -> Model.PNE.pne_state (Model.QUIC.writer_pne_info w)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Model.QUIC.__proj__Writer__item__pne", "Model.PNE.pne_state", "FStar.Pervasives.dsnd", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Prims.b2t", "Model.PNE.is_safe", "Model.AEAD.is_safe", "Model.QUIC.writer_pne_info" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val writer_pne_state : #k:id -> w:stream_writer k -> PNE.pne_state (writer_pne_info w)\nlet writer_pne_state #k w =", "completed_definiton": "w.pne", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.reader_pne_state", "original_source_type": "val reader_pne_state : #k:id -> #w:stream_writer k -> r:stream_reader w -> PNE.pne_state (reader_pne_info r)", "source_type": "val reader_pne_state : #k:id -> #w:stream_writer k -> r:stream_reader w -> PNE.pne_state (reader_pne_info r)", "source_definition": "let reader_pne_state #k #w r = w.pne", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 105, "start_col": 31, "end_line": 105, "end_col": 36 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "r: Model.QUIC.stream_reader w -> Model.PNE.pne_state (Model.QUIC.reader_pne_info r)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Model.QUIC.stream_reader", "Model.QUIC.__proj__Writer__item__pne", "Model.PNE.pne_state", "FStar.Pervasives.dsnd", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Prims.b2t", "Model.PNE.is_safe", "Model.AEAD.is_safe", "Model.QUIC.reader_pne_info" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val reader_pne_state : #k:id -> #w:stream_writer k -> r:stream_reader w -> PNE.pne_state (reader_pne_info r)\nlet reader_pne_state #k #w r =", "completed_definiton": "w.pne", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.footprint", "original_source_type": "val footprint: #k:id -> w:stream_writer k -> GTot M.loc", "source_type": "val footprint: #k:id -> w:stream_writer k -> GTot M.loc", "source_definition": "let footprint #k w = (AEAD.wfootprint w.ae)\n `B.loc_union` (PNE.footprint w.pne)\n `B.loc_union` B.loc_mreference w.ctr", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 179, "start_col": 21, "end_line": 181, "end_col": 38 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h\n\nlet invariant #k w h =\n AEAD.winvariant w.ae h /\\\n PNE.invariant w.pne h /\\\n h `HS.contains` w.ctr /\\\n fresh_nonces w h /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` AEAD.wfootprint w.ae\n\nlet rinvariant #k #w r h = invariant w h /\\\n h `HS.contains` r.last /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr)\n\nlet writer_offset #k w = w.offset\nlet reader_offset #k #w r = w.offset\n\nlet wctrT #k w h = HS.sel h w.ctr\nlet wctr #k w = !w.ctr\n\nlet writer_static_iv #k w = w.siv\nlet reader_static_iv #k #w r = w.siv\n\nlet expected_pnT #k #w r h = HS.sel h r.last\nlet expected_pn #k #w r = !r.last", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.QUIC.stream_writer k -> Prims.GTot LowStar.Monotonic.Buffer.loc", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "LowStar.Monotonic.Buffer.loc_union", "Model.AEAD.wfootprint", "FStar.Pervasives.dfst", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Prims.b2t", "Model.PNE.is_safe", "Model.AEAD.is_safe", "Model.QUIC.__proj__Writer__item__ae", "Model.PNE.footprint", "FStar.Pervasives.dsnd", "Model.QUIC.__proj__Writer__item__pne_info", "Model.QUIC.__proj__Writer__item__pne", "LowStar.Monotonic.Buffer.loc_mreference", "Model.QUIC._ctr", "Model.QUIC.__proj__Writer__item__offset", "FStar.Heap.trivial_preorder", "Model.QUIC.__proj__Writer__item__ctr", "LowStar.Monotonic.Buffer.loc" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val footprint: #k:id -> w:stream_writer k -> GTot M.loc\nlet footprint #k w =", "completed_definiton": "((AEAD.wfootprint w.ae) `B.loc_union` (PNE.footprint w.pne)) `B.loc_union` (B.loc_mreference w.ctr)", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.fresh_nonces", "original_source_type": "val fresh_nonces (#k: id) (w: stream_writer k) (h: mem) : GTot Type0", "source_type": "val fresh_nonces (#k: id) (w: stream_writer k) (h: mem) : GTot Type0", "source_definition": "let fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 152, "start_col": 2, "end_line": 152, "end_col": 40 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.QUIC.stream_writer k -> h: FStar.Monotonic.HyperStack.mem -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "FStar.Monotonic.HyperStack.mem", "Model.QUIC.fresh_nonces_from", "FStar.Monotonic.HyperStack.sel", "Model.QUIC._ctr", "Model.QUIC.__proj__Writer__item__offset", "FStar.Heap.trivial_preorder", "Model.QUIC.__proj__Writer__item__ctr" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val fresh_nonces (#k: id) (w: stream_writer k) (h: mem) : GTot Type0\nlet fresh_nonces (#k: id) (w: stream_writer k) (h: mem) : GTot Type0 =", "completed_definiton": "fresh_nonces_from (HS.sel h w.ctr) w h", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.writer_static_iv", "original_source_type": "val writer_static_iv: #k:id -> w:stream_writer k -> qiv k", "source_type": "val writer_static_iv: #k:id -> w:stream_writer k -> qiv k", "source_definition": "let writer_static_iv #k w = w.siv", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 173, "start_col": 28, "end_line": 173, "end_col": 33 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h\n\nlet invariant #k w h =\n AEAD.winvariant w.ae h /\\\n PNE.invariant w.pne h /\\\n h `HS.contains` w.ctr /\\\n fresh_nonces w h /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` AEAD.wfootprint w.ae\n\nlet rinvariant #k #w r h = invariant w h /\\\n h `HS.contains` r.last /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr)\n\nlet writer_offset #k w = w.offset\nlet reader_offset #k #w r = w.offset\n\nlet wctrT #k w h = HS.sel h w.ctr\nlet wctr #k w = !w.ctr", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.QUIC.stream_writer k -> Model.QUIC.qiv k", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Model.QUIC.__proj__Writer__item__siv", "Model.QUIC.qiv" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val writer_static_iv: #k:id -> w:stream_writer k -> qiv k\nlet writer_static_iv #k w =", "completed_definiton": "w.siv", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.rfootprint", "original_source_type": "val rfootprint: #k:id -> #w:stream_writer k -> r:stream_reader w -> GTot M.loc", "source_type": "val rfootprint: #k:id -> #w:stream_writer k -> r:stream_reader w -> GTot M.loc", "source_definition": "let rfootprint #k #w r = footprint w `B.loc_union` B.loc_mreference r.last", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 183, "start_col": 25, "end_line": 183, "end_col": 74 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h\n\nlet invariant #k w h =\n AEAD.winvariant w.ae h /\\\n PNE.invariant w.pne h /\\\n h `HS.contains` w.ctr /\\\n fresh_nonces w h /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` AEAD.wfootprint w.ae\n\nlet rinvariant #k #w r h = invariant w h /\\\n h `HS.contains` r.last /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr)\n\nlet writer_offset #k w = w.offset\nlet reader_offset #k #w r = w.offset\n\nlet wctrT #k w h = HS.sel h w.ctr\nlet wctr #k w = !w.ctr\n\nlet writer_static_iv #k w = w.siv\nlet reader_static_iv #k #w r = w.siv\n\nlet expected_pnT #k #w r h = HS.sel h r.last\nlet expected_pn #k #w r = !r.last\n\nlet footprint #k w = (AEAD.wfootprint w.ae)\n `B.loc_union` (PNE.footprint w.pne)\n `B.loc_union` B.loc_mreference w.ctr", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "r: Model.QUIC.stream_reader w -> Prims.GTot LowStar.Monotonic.Buffer.loc", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Model.QUIC.stream_reader", "LowStar.Monotonic.Buffer.loc_union", "Model.QUIC.footprint", "LowStar.Monotonic.Buffer.loc_mreference", "Model.QUIC._last", "Model.QUIC.__proj__Writer__item__offset", "FStar.Heap.trivial_preorder", "Model.QUIC.__proj__Reader__item__last", "LowStar.Monotonic.Buffer.loc" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val rfootprint: #k:id -> #w:stream_writer k -> r:stream_reader w -> GTot M.loc\nlet rfootprint #k #w r =", "completed_definiton": "(footprint w) `B.loc_union` (B.loc_mreference r.last)", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.reader_offset", "original_source_type": "val reader_offset: #k:id -> #w:stream_writer k -> stream_reader w -> pn", "source_type": "val reader_offset: #k:id -> #w:stream_writer k -> stream_reader w -> pn", "source_definition": "let reader_offset #k #w r = w.offset", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 168, "start_col": 28, "end_line": 168, "end_col": 36 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h\n\nlet invariant #k w h =\n AEAD.winvariant w.ae h /\\\n PNE.invariant w.pne h /\\\n h `HS.contains` w.ctr /\\\n fresh_nonces w h /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` AEAD.wfootprint w.ae\n\nlet rinvariant #k #w r h = invariant w h /\\\n h `HS.contains` r.last /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr)", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "r: Model.QUIC.stream_reader w -> Model.QUIC.pn", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Model.QUIC.stream_reader", "Model.QUIC.__proj__Writer__item__offset", "Model.QUIC.pn" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val reader_offset: #k:id -> #w:stream_writer k -> stream_reader w -> pn\nlet reader_offset #k #w r =", "completed_definiton": "w.offset", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.writer_aead_state", "original_source_type": "val writer_aead_state : (#k:id) -> (w:stream_writer k) ->\n aw:AEAD.aead_writer (dfst k)", "source_type": "val writer_aead_state : (#k:id) -> (w:stream_writer k) ->\n aw:AEAD.aead_writer (dfst k)", "source_definition": "let writer_aead_state #k w = w.ae", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 101, "start_col": 29, "end_line": 101, "end_col": 33 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.QUIC.stream_writer k -> Model.AEAD.aead_writer (FStar.Pervasives.dfst k)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Model.QUIC.__proj__Writer__item__ae", "Model.AEAD.aead_writer", "FStar.Pervasives.dfst", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Prims.b2t", "Model.PNE.is_safe", "Model.AEAD.is_safe" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val writer_aead_state : (#k:id) -> (w:stream_writer k) ->\n aw:AEAD.aead_writer (dfst k)\nlet writer_aead_state #k w =", "completed_definiton": "w.ae", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.rinvariant", "original_source_type": "val rinvariant: #k:id -> #w:stream_writer k -> r:stream_reader w -> h:mem ->\n t:Type0{t ==> invariant w h}", "source_type": "val rinvariant: #k:id -> #w:stream_writer k -> r:stream_reader w -> h:mem ->\n t:Type0{t ==> invariant w h}", "source_definition": "let rinvariant #k #w r h = invariant w h /\\\n h `HS.contains` r.last /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 163, "start_col": 27, "end_line": 165, "end_col": 64 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h\n\nlet invariant #k w h =\n AEAD.winvariant w.ae h /\\\n PNE.invariant w.pne h /\\\n h `HS.contains` w.ctr /\\\n fresh_nonces w h /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` AEAD.wfootprint w.ae", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "r: Model.QUIC.stream_reader w -> h: FStar.Monotonic.HyperStack.mem\n -> t: Type0{t ==> Model.QUIC.invariant w h}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Model.QUIC.stream_reader", "FStar.Monotonic.HyperStack.mem", "Prims.l_and", "Model.QUIC.invariant", "FStar.Monotonic.HyperStack.contains", "Model.QUIC._last", "Model.QUIC.__proj__Writer__item__offset", "FStar.Heap.trivial_preorder", "Model.QUIC.__proj__Reader__item__last", "LowStar.Monotonic.Buffer.loc_disjoint", "Model.AEAD.wfootprint", "FStar.Pervasives.dfst", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Prims.b2t", "Model.PNE.is_safe", "Model.AEAD.is_safe", "Model.QUIC.__proj__Writer__item__ae", "LowStar.Monotonic.Buffer.loc_mreference", "Model.QUIC._ctr", "Model.QUIC.__proj__Writer__item__ctr", "Prims.l_imp" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val rinvariant: #k:id -> #w:stream_writer k -> r:stream_reader w -> h:mem ->\n t:Type0{t ==> invariant w h}\nlet rinvariant #k #w r h =", "completed_definiton": "invariant w h /\\ h `HS.contains` r.last /\\\n(AEAD.wfootprint w.ae) `B.loc_disjoint` (B.loc_mreference w.ctr)", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.mk", "original_source_type": "val mk (j: PNE.id) (l: pnl) (n: Helpers.lbytes l) (b: PNE.length_bits l)\n : p: pne_plain j l {as_bytes j l p == (n, b)}", "source_type": "val mk (j: PNE.id) (l: pnl) (n: Helpers.lbytes l) (b: PNE.length_bits l)\n : p: pne_plain j l {as_bytes j l p == (n, b)}", "source_definition": "let mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 33, "start_col": 114, "end_line": 33, "end_col": 132 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "j: Model.PNE.id -> l: Model.QUIC.pnl -> n: Model.Helpers.lbytes l -> b: Model.PNE.length_bits l\n -> p: Model.QUIC.pne_plain j l {Model.QUIC.as_bytes j l p == FStar.Pervasives.Native.Mktuple2 n b}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.id", "Model.QUIC.pnl", "Model.Helpers.lbytes", "Model.PNE.length_bits", "FStar.Pervasives.Native.Mktuple2", "QUIC.Spec.Base.lbytes", "Model.Helpers.reveal", "Model.QUIC.pne_plain", "Prims.eq2", "FStar.Pervasives.Native.tuple2", "Model.QUIC.as_bytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val mk (j: PNE.id) (l: pnl) (n: Helpers.lbytes l) (b: PNE.length_bits l)\n : p: pne_plain j l {as_bytes j l p == (n, b)}\nlet mk (j: PNE.id) (l: pnl) (n: Helpers.lbytes l) (b: PNE.length_bits l)\n : p: pne_plain j l {as_bytes j l p == (n, b)} =", "completed_definiton": "Helpers.reveal n, b", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.pne_pkg", "original_source_type": "val pne_pkg: PNE.pne_plain_pkg", "source_type": "val pne_pkg: PNE.pne_plain_pkg", "source_definition": "let pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 63, "start_col": 2, "end_line": 63, "end_col": 60 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Model.PNE.pne_plain_pkg", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.PNEPlainPkg", "Model.QUIC.pne_plain", "Model.QUIC.as_bytes", "Model.QUIC.repr", "Model.QUIC.mk", "Model.QUIC.pnenc", "Model.QUIC.lemma_xor" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val pne_pkg: PNE.pne_plain_pkg\nlet pne_pkg =", "completed_definiton": "PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.reader_static_iv", "original_source_type": "val reader_static_iv: #k:id -> #w:stream_writer k -> r:stream_reader w ->\n iv:qiv k{iv == writer_static_iv w}", "source_type": "val reader_static_iv: #k:id -> #w:stream_writer k -> r:stream_reader w ->\n iv:qiv k{iv == writer_static_iv w}", "source_definition": "let reader_static_iv #k #w r = w.siv", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 174, "start_col": 31, "end_line": 174, "end_col": 36 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h\n\nlet invariant #k w h =\n AEAD.winvariant w.ae h /\\\n PNE.invariant w.pne h /\\\n h `HS.contains` w.ctr /\\\n fresh_nonces w h /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` AEAD.wfootprint w.ae\n\nlet rinvariant #k #w r h = invariant w h /\\\n h `HS.contains` r.last /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr)\n\nlet writer_offset #k w = w.offset\nlet reader_offset #k #w r = w.offset\n\nlet wctrT #k w h = HS.sel h w.ctr\nlet wctr #k w = !w.ctr", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "r: Model.QUIC.stream_reader w -> iv: Model.QUIC.qiv k {iv == Model.QUIC.writer_static_iv w}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Model.QUIC.stream_reader", "Model.QUIC.__proj__Writer__item__siv", "Model.QUIC.qiv", "Prims.eq2", "Model.QUIC.writer_static_iv" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val reader_static_iv: #k:id -> #w:stream_writer k -> r:stream_reader w ->\n iv:qiv k{iv == writer_static_iv w}\nlet reader_static_iv #k #w r =", "completed_definiton": "w.siv", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.invariant", "original_source_type": "val invariant: #k:id -> w:stream_writer k -> h:mem ->\n t:Type0{t ==> AEAD.winvariant (writer_aead_state w) h}", "source_type": "val invariant: #k:id -> w:stream_writer k -> h:mem ->\n t:Type0{t ==> AEAD.winvariant (writer_aead_state w) h}", "source_definition": "let invariant #k w h =\n AEAD.winvariant w.ae h /\\\n PNE.invariant w.pne h /\\\n h `HS.contains` w.ctr /\\\n fresh_nonces w h /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` AEAD.wfootprint w.ae", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 155, "start_col": 2, "end_line": 161, "end_col": 59 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.QUIC.stream_writer k -> h: FStar.Monotonic.HyperStack.mem\n -> t: Type0{t ==> Model.AEAD.winvariant (Model.QUIC.writer_aead_state w) h}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "FStar.Monotonic.HyperStack.mem", "Prims.l_and", "Model.AEAD.winvariant", "FStar.Pervasives.dfst", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Prims.b2t", "Model.PNE.is_safe", "Model.AEAD.is_safe", "Model.QUIC.__proj__Writer__item__ae", "Model.PNE.invariant", "FStar.Pervasives.dsnd", "Model.QUIC.__proj__Writer__item__pne_info", "Model.QUIC.__proj__Writer__item__pne", "FStar.Monotonic.HyperStack.contains", "Model.QUIC._ctr", "Model.QUIC.__proj__Writer__item__offset", "FStar.Heap.trivial_preorder", "Model.QUIC.__proj__Writer__item__ctr", "Model.QUIC.fresh_nonces", "LowStar.Monotonic.Buffer.loc_disjoint", "Model.AEAD.wfootprint", "LowStar.Monotonic.Buffer.loc_mreference", "Model.PNE.footprint", "Prims.l_imp", "Model.QUIC.writer_aead_state" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val invariant: #k:id -> w:stream_writer k -> h:mem ->\n t:Type0{t ==> AEAD.winvariant (writer_aead_state w) h}\nlet invariant #k w h =", "completed_definiton": "AEAD.winvariant w.ae h /\\ PNE.invariant w.pne h /\\ h `HS.contains` w.ctr /\\ fresh_nonces w h /\\\n(AEAD.wfootprint w.ae) `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n(PNE.footprint w.pne) `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n(PNE.footprint w.pne) `B.loc_disjoint` (AEAD.wfootprint w.ae)", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.nonce_of_ctr", "original_source_type": "val nonce_of_ctr (#i: _) (w: stream_writer i) (n: nat{n < pow2 62 /\\ n >= w.offset})\n : Tot AEAD.nonce", "source_type": "val nonce_of_ctr (#i: _) (w: stream_writer i) (n: nat{n < pow2 62 /\\ n >= w.offset})\n : Tot AEAD.nonce", "source_definition": "let nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 109, "start_col": 3, "end_line": 112, "end_col": 41 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.QUIC.stream_writer i -> n: Prims.nat{n < Prims.pow2 62 /\\ n >= Writer?.offset w}\n -> Model.AEAD.nonce", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThan", "Prims.pow2", "Prims.op_GreaterThanOrEqual", "Model.QUIC.__proj__Writer__item__offset", "QUIC.Spec.Lemmas.xor_inplace", "Model.QUIC.__proj__Writer__item__siv", "FStar.Endianness.bytes", "Prims.eq2", "FStar.Seq.Base.length", "FStar.UInt8.t", "FStar.Endianness.be_to_n", "FStar.Endianness.n_to_be", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.op_Multiply", "Model.AEAD.nonce" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val nonce_of_ctr (#i: _) (w: stream_writer i) (n: nat{n < pow2 62 /\\ n >= w.offset})\n : Tot AEAD.nonce\nlet nonce_of_ctr #i (w: stream_writer i) (n: nat{n < pow2 62 /\\ n >= w.offset}) : Tot AEAD.nonce =", "completed_definiton": "let _ = assert_norm (pow2 62 < pow2 (8 `op_Multiply` 12)) in\nlet pn = FStar.Endianness.n_to_be 12 n in\nQUIC.Spec.Lemmas.xor_inplace pn w.siv 0", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.reader_ae_info", "original_source_type": "val reader_ae_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> a:AEAD.info (dfst k){a.AEAD.min_len == 3}", "source_type": "val reader_ae_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> a:AEAD.info (dfst k){a.AEAD.min_len == 3}", "source_definition": "let reader_ae_info #k #w r = AEAD.rgetinfo r.aer", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 97, "start_col": 29, "end_line": 97, "end_col": 48 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "r: Model.QUIC.stream_reader w\n -> a: Model.AEAD.info (FStar.Pervasives.dfst k) {Mkinfo'?.min_len a == 3}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Model.QUIC.stream_reader", "Model.AEAD.rgetinfo", "FStar.Pervasives.dfst", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Prims.b2t", "Model.PNE.is_safe", "Model.AEAD.is_safe", "Model.QUIC.__proj__Writer__item__ae", "Model.QUIC.__proj__Reader__item__aer", "Model.AEAD.info", "Prims.eq2", "Prims.int", "Model.AEAD.__proj__Mkinfo'__item__min_len" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val reader_ae_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> a:AEAD.info (dfst k){a.AEAD.min_len == 3}\nlet reader_ae_info #k #w r =", "completed_definiton": "AEAD.rgetinfo r.aer", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.as_bytes", "original_source_type": "val as_bytes (j: PNE.id) (l: pnl) (x: pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l)", "source_type": "val as_bytes (j: PNE.id) (l: pnl) (x: pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l)", "source_definition": "let as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 30, "start_col": 97, "end_line": 30, "end_col": 134 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "j: Model.PNE.id -> l: Model.QUIC.pnl -> x: Model.QUIC.pne_plain j l\n -> Prims.GTot (Model.Helpers.lbytes l * Model.PNE.length_bits l)", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.id", "Model.QUIC.pnl", "Model.QUIC.pne_plain", "QUIC.Spec.Base.lbytes", "Model.PNE.length_bits", "FStar.Pervasives.Native.Mktuple2", "Model.Helpers.lbytes", "Model.Helpers.hide", "FStar.Pervasives.Native.tuple2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val as_bytes (j: PNE.id) (l: pnl) (x: pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l)\nlet as_bytes (j: PNE.id) (l: pnl) (x: pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) =", "completed_definiton": "let n, b = x in\n(Helpers.hide n, b)", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.pne_plain", "original_source_type": "val pne_plain (j: PNE.id) (l: pnl) : eqtype", "source_type": "val pne_plain (j: PNE.id) (l: pnl) : eqtype", "source_definition": "let pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 29, "start_col": 44, "end_line": 29, "end_col": 77 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "j: Model.PNE.id -> l: Model.QUIC.pnl -> Prims.eqtype", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.id", "Model.QUIC.pnl", "FStar.Pervasives.Native.tuple2", "QUIC.Spec.Base.lbytes", "Model.PNE.length_bits", "Prims.eqtype" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val pne_plain (j: PNE.id) (l: pnl) : eqtype\nlet pne_plain (j: PNE.id) (l: pnl) : eqtype =", "completed_definiton": "Spec.lbytes l & PNE.length_bits l", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.wctrT", "original_source_type": "val wctrT: #k:id -> w:stream_writer k -> h:mem{invariant w h} -> \n GTot (n:nat{n >= writer_offset w /\\ n <= max_ctr})", "source_type": "val wctrT: #k:id -> w:stream_writer k -> h:mem{invariant w h} -> \n GTot (n:nat{n >= writer_offset w /\\ n <= max_ctr})", "source_definition": "let wctrT #k w h = HS.sel h w.ctr", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 170, "start_col": 19, "end_line": 170, "end_col": 33 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h\n\nlet invariant #k w h =\n AEAD.winvariant w.ae h /\\\n PNE.invariant w.pne h /\\\n h `HS.contains` w.ctr /\\\n fresh_nonces w h /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` AEAD.wfootprint w.ae\n\nlet rinvariant #k #w r h = invariant w h /\\\n h `HS.contains` r.last /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr)\n\nlet writer_offset #k w = w.offset\nlet reader_offset #k #w r = w.offset", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.QUIC.stream_writer k -> h: FStar.Monotonic.HyperStack.mem{Model.QUIC.invariant w h}\n -> Prims.GTot (n: Prims.nat{n >= Model.QUIC.writer_offset w /\\ n <= Model.QUIC.max_ctr})", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "FStar.Monotonic.HyperStack.mem", "Model.QUIC.invariant", "FStar.Monotonic.HyperStack.sel", "Model.QUIC._ctr", "Model.QUIC.__proj__Writer__item__offset", "FStar.Heap.trivial_preorder", "Model.QUIC.__proj__Writer__item__ctr", "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "Model.QUIC.writer_offset", "Prims.op_LessThanOrEqual", "Model.QUIC.max_ctr" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val wctrT: #k:id -> w:stream_writer k -> h:mem{invariant w h} -> \n GTot (n:nat{n >= writer_offset w /\\ n <= max_ctr})\nlet wctrT #k w h =", "completed_definiton": "HS.sel h w.ctr", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.reader_info", "original_source_type": "val reader_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> i:info{i == writer_info w}", "source_type": "val reader_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> i:info{i == writer_info w}", "source_definition": "let reader_info #k #w r = w.info", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 94, "start_col": 26, "end_line": 94, "end_col": 32 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "r: Model.QUIC.stream_reader w -> i: Model.QUIC.info{i == Model.QUIC.writer_info w}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Model.QUIC.stream_reader", "Model.QUIC.__proj__Writer__item__info", "Model.QUIC.info", "Prims.eq2", "Model.QUIC.writer_info" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val reader_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> i:info{i == writer_info w}\nlet reader_info #k #w r =", "completed_definiton": "w.info", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.fresh_nonces_from", "original_source_type": "val fresh_nonces_from (j: nat) (#k: id) (w: stream_writer k) (h: mem) : GTot Type0", "source_type": "val fresh_nonces_from (j: nat) (#k: id) (w: stream_writer k) (h: mem) : GTot Type0", "source_definition": "let fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 144, "start_col": 2, "end_line": 145, "end_col": 47 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "j: Prims.nat -> w: Model.QUIC.stream_writer k -> h: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Model.QUIC.id", "Model.QUIC.stream_writer", "FStar.Monotonic.HyperStack.mem", "Prims.l_Forall", "Prims.int", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "Prims.op_LessThan", "Prims.pow2", "Model.QUIC.__proj__Writer__item__offset", "Prims.l_imp", "Prims.op_GreaterThan", "Model.QUIC.safe", "Model.AEAD.fresh_nonce", "FStar.Pervasives.dfst", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Model.PNE.is_safe", "Model.AEAD.is_safe", "Model.QUIC.__proj__Writer__item__ae", "Model.QUIC.nonce_of_ctr" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val fresh_nonces_from (j: nat) (#k: id) (w: stream_writer k) (h: mem) : GTot Type0\nlet fresh_nonces_from (j: nat) (#k: id) (w: stream_writer k) (h: mem) : GTot Type0 =", "completed_definiton": "(forall i. (i > j /\\ safe k) ==> AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.writer_ae_info", "original_source_type": "val writer_ae_info: #k:id -> w:stream_writer k -> a:AEAD.info (dfst k){a.AEAD.min_len == 3}", "source_type": "val writer_ae_info: #k:id -> w:stream_writer k -> a:AEAD.info (dfst k){a.AEAD.min_len == 3}", "source_definition": "let writer_ae_info #k w = AEAD.wgetinfo w.ae", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 96, "start_col": 26, "end_line": 96, "end_col": 44 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.QUIC.stream_writer k\n -> a: Model.AEAD.info (FStar.Pervasives.dfst k) {Mkinfo'?.min_len a == 3}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Model.AEAD.wgetinfo", "FStar.Pervasives.dfst", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Prims.b2t", "Model.PNE.is_safe", "Model.AEAD.is_safe", "Model.QUIC.__proj__Writer__item__ae", "Model.AEAD.info", "Prims.eq2", "Prims.int", "Model.AEAD.__proj__Mkinfo'__item__min_len" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val writer_ae_info: #k:id -> w:stream_writer k -> a:AEAD.info (dfst k){a.AEAD.min_len == 3}\nlet writer_ae_info #k w =", "completed_definiton": "AEAD.wgetinfo w.ae", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.repr", "original_source_type": "val repr (j: PNE.unsafe_id) (l: pnl) (x: pne_plain j l)\n : b: (Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x}", "source_type": "val repr (j: PNE.unsafe_id) (l: pnl) (x: pne_plain j l)\n : b: (Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x}", "source_definition": "let repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 31, "start_col": 118, "end_line": 32, "end_col": 36 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "j: Model.PNE.unsafe_id -> l: Model.QUIC.pnl -> x: Model.QUIC.pne_plain j l\n -> b: (Model.Helpers.lbytes l * Model.PNE.length_bits l) {b == Model.QUIC.as_bytes j l x}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.unsafe_id", "Model.QUIC.pnl", "Model.QUIC.pne_plain", "QUIC.Spec.Base.lbytes", "Model.PNE.length_bits", "FStar.Pervasives.Native.Mktuple2", "Model.Helpers.lbytes", "Model.Helpers.hide", "FStar.Pervasives.Native.tuple2", "Prims.eq2", "Model.QUIC.as_bytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val repr (j: PNE.unsafe_id) (l: pnl) (x: pne_plain j l)\n : b: (Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x}\nlet repr (j: PNE.unsafe_id) (l: pnl) (x: pne_plain j l)\n : b: (Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =", "completed_definiton": "let n, b = x in\n(Helpers.hide n, b)", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.nonce_of_ctr_injective", "original_source_type": "val nonce_of_ctr_injective\n (#i: _)\n (w: stream_writer i)\n (n1: nat{n1 < pow2 62 /\\ n1 >= w.offset})\n (n2: nat{n2 < pow2 62 /\\ n2 >= w.offset})\n : Lemma (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2)) (ensures (n1 == n2))", "source_type": "val nonce_of_ctr_injective\n (#i: _)\n (w: stream_writer i)\n (n1: nat{n1 < pow2 62 /\\ n1 >= w.offset})\n (n2: nat{n2 < pow2 62 /\\ n2 >= w.offset})\n : Lemma (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2)) (ensures (n1 == n2))", "source_definition": "let nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 121, "start_col": 1, "end_line": 126, "end_col": 53 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n w: Model.QUIC.stream_writer i ->\n n1: Prims.nat{n1 < Prims.pow2 62 /\\ n1 >= Writer?.offset w} ->\n n2: Prims.nat{n2 < Prims.pow2 62 /\\ n2 >= Writer?.offset w}\n -> FStar.Pervasives.Lemma (requires Model.QUIC.nonce_of_ctr w n1 == Model.QUIC.nonce_of_ctr w n2)\n (ensures n1 == n2)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThan", "Prims.pow2", "Prims.op_GreaterThanOrEqual", "Model.QUIC.__proj__Writer__item__offset", "QUIC.Spec.Lemmas.xor_inplace_involutive", "Model.QUIC.__proj__Writer__item__siv", "Prims.unit", "FStar.Endianness.bytes", "Prims.eq2", "FStar.Seq.Base.length", "FStar.UInt8.t", "FStar.Endianness.be_to_n", "FStar.Endianness.n_to_be", "FStar.Pervasives.assert_norm", "Prims.op_Multiply", "Model.AEAD.nonce", "Model.QUIC.nonce_of_ctr", "Prims.squash", "Prims.l_or", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val nonce_of_ctr_injective\n (#i: _)\n (w: stream_writer i)\n (n1: nat{n1 < pow2 62 /\\ n1 >= w.offset})\n (n2: nat{n2 < pow2 62 /\\ n2 >= w.offset})\n : Lemma (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2)) (ensures (n1 == n2))\nlet nonce_of_ctr_injective\n #i\n (w: stream_writer i)\n (n1: nat{n1 < pow2 62 /\\ n1 >= w.offset})\n (n2: nat{n2 < pow2 62 /\\ n2 >= w.offset})\n : Lemma (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2)) (ensures (n1 == n2)) =", "completed_definiton": "let _ = assert_norm (pow2 62 < pow2 (8 `op_Multiply` 12)) in\nlet pn1 = FStar.Endianness.n_to_be 12 n1 in\nlet pn2 = FStar.Endianness.n_to_be 12 n2 in\nQUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\nQUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.expected_pnT", "original_source_type": "val expected_pnT: #k:id -> #w:stream_writer k -> r:stream_reader w -> h:mem{rinvariant r h} ->\n GTot (n:nat{n >= writer_offset w /\\ n < max_ctr})", "source_type": "val expected_pnT: #k:id -> #w:stream_writer k -> r:stream_reader w -> h:mem{rinvariant r h} ->\n GTot (n:nat{n >= writer_offset w /\\ n < max_ctr})", "source_definition": "let expected_pnT #k #w r h = HS.sel h r.last", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 176, "start_col": 29, "end_line": 176, "end_col": 44 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h\n\nlet invariant #k w h =\n AEAD.winvariant w.ae h /\\\n PNE.invariant w.pne h /\\\n h `HS.contains` w.ctr /\\\n fresh_nonces w h /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` AEAD.wfootprint w.ae\n\nlet rinvariant #k #w r h = invariant w h /\\\n h `HS.contains` r.last /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr)\n\nlet writer_offset #k w = w.offset\nlet reader_offset #k #w r = w.offset\n\nlet wctrT #k w h = HS.sel h w.ctr\nlet wctr #k w = !w.ctr\n\nlet writer_static_iv #k w = w.siv\nlet reader_static_iv #k #w r = w.siv", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "r: Model.QUIC.stream_reader w -> h: FStar.Monotonic.HyperStack.mem{Model.QUIC.rinvariant r h}\n -> Prims.GTot (n: Prims.nat{n >= Model.QUIC.writer_offset w /\\ n < Model.QUIC.max_ctr})", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Model.QUIC.stream_reader", "FStar.Monotonic.HyperStack.mem", "Model.QUIC.rinvariant", "FStar.Monotonic.HyperStack.sel", "Model.QUIC._last", "Model.QUIC.__proj__Writer__item__offset", "FStar.Heap.trivial_preorder", "Model.QUIC.__proj__Reader__item__last", "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "Model.QUIC.writer_offset", "Prims.op_LessThan", "Model.QUIC.max_ctr" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val expected_pnT: #k:id -> #w:stream_writer k -> r:stream_reader w -> h:mem{rinvariant r h} ->\n GTot (n:nat{n >= writer_offset w /\\ n < max_ctr})\nlet expected_pnT #k #w r h =", "completed_definiton": "HS.sel h r.last", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.extend", "original_source_type": "val extend (#l: pnl) (b: Spec.lbytes l) (l': pnl) : Spec.lbytes l'", "source_type": "val extend (#l: pnl) (b: Spec.lbytes l) (l': pnl) : Spec.lbytes l'", "source_definition": "let extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 37, "start_col": 2, "end_line": 38, "end_col": 42 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: QUIC.Spec.Base.lbytes l -> l': Model.QUIC.pnl -> QUIC.Spec.Base.lbytes l'", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.pnl", "QUIC.Spec.Base.lbytes", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.slice", "QUIC.Spec.Base.byte", "Prims.bool", "FStar.Seq.Base.append", "FStar.Seq.Base.create", "Prims.op_Subtraction", "FStar.UInt8.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val extend (#l: pnl) (b: Spec.lbytes l) (l': pnl) : Spec.lbytes l'\nlet extend (#l: pnl) (b: Spec.lbytes l) (l': pnl) : Spec.lbytes l' =", "completed_definiton": "if l' <= l then Seq.slice b 0 l' else Seq.append (Seq.create (l' - l) 0uy) b", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.writer_pne_info", "original_source_type": "val writer_pne_info: #k:id -> w:stream_writer k -> a:PNE.info (dsnd k){a.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (writer_ae_info w).AEAD.alg /\\ a.PNE.halg == (writer_ae_info w).AEAD.halg}", "source_type": "val writer_pne_info: #k:id -> w:stream_writer k -> a:PNE.info (dsnd k){a.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (writer_ae_info w).AEAD.alg /\\ a.PNE.halg == (writer_ae_info w).AEAD.halg}", "source_definition": "let writer_pne_info #k w = w.pne_info", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 98, "start_col": 27, "end_line": 98, "end_col": 37 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.QUIC.stream_writer k\n -> a:\n Model.PNE.info (FStar.Pervasives.dsnd k)\n { Mkinfo'?.calg a ==\n Spec.Agile.AEAD.cipher_alg_of_supported_alg (Mkinfo'?.alg (Model.QUIC.writer_ae_info w)) /\\\n Mkinfo'?.halg a == Mkinfo'?.halg (Model.QUIC.writer_ae_info w) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Model.QUIC.__proj__Writer__item__pne_info", "Model.PNE.info", "FStar.Pervasives.dsnd", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Prims.b2t", "Model.PNE.is_safe", "Model.AEAD.is_safe", "Prims.l_and", "Prims.eq2", "Spec.Agile.Cipher.cipher_alg", "Model.PNE.__proj__Mkinfo'__item__calg", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "Model.AEAD.__proj__Mkinfo'__item__alg", "Model.QUIC.writer_ae_info", "Model.Indexing.ha", "Model.PNE.__proj__Mkinfo'__item__halg", "Model.AEAD.__proj__Mkinfo'__item__halg" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val writer_pne_info: #k:id -> w:stream_writer k -> a:PNE.info (dsnd k){a.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (writer_ae_info w).AEAD.alg /\\ a.PNE.halg == (writer_ae_info w).AEAD.halg}\nlet writer_pne_info #k w =", "completed_definiton": "w.pne_info", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.reader_pne_info", "original_source_type": "val reader_pne_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> a:PNE.info (dsnd k){a.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (reader_ae_info r).AEAD.alg /\\ a.PNE.halg == (reader_ae_info r).AEAD.halg}", "source_type": "val reader_pne_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> a:PNE.info (dsnd k){a.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (reader_ae_info r).AEAD.alg /\\ a.PNE.halg == (reader_ae_info r).AEAD.halg}", "source_definition": "let reader_pne_info #k #w r = w.pne_info", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 99, "start_col": 30, "end_line": 99, "end_col": 40 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "r: Model.QUIC.stream_reader w\n -> a:\n Model.PNE.info (FStar.Pervasives.dsnd k)\n { Mkinfo'?.calg a ==\n Spec.Agile.AEAD.cipher_alg_of_supported_alg (Mkinfo'?.alg (Model.QUIC.reader_ae_info r)) /\\\n Mkinfo'?.halg a == Mkinfo'?.halg (Model.QUIC.reader_ae_info r) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Model.QUIC.stream_reader", "Model.QUIC.__proj__Writer__item__pne_info", "Model.PNE.info", "FStar.Pervasives.dsnd", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Prims.b2t", "Model.PNE.is_safe", "Model.AEAD.is_safe", "Prims.l_and", "Prims.eq2", "Spec.Agile.Cipher.cipher_alg", "Model.PNE.__proj__Mkinfo'__item__calg", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "Model.AEAD.__proj__Mkinfo'__item__alg", "Model.QUIC.reader_ae_info", "Model.Indexing.ha", "Model.PNE.__proj__Mkinfo'__item__halg", "Model.AEAD.__proj__Mkinfo'__item__halg" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val reader_pne_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> a:PNE.info (dsnd k){a.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (reader_ae_info r).AEAD.alg /\\ a.PNE.halg == (reader_ae_info r).AEAD.halg}\nlet reader_pne_info #k #w r =", "completed_definiton": "w.pne_info", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.wframe_log", "original_source_type": "val wframe_log: #k:id{AEAD.is_safe (dfst k)} -> w:stream_writer k -> l:Seq.seq (AEAD.entry (dfst k) (AEAD.wgetinfo (writer_aead_state w))) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n invariant w h0 /\\\n AEAD.wlog (writer_aead_state w) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (footprint w))\n (ensures invariant w h1 ==> AEAD.wlog (writer_aead_state w) h1 == l)", "source_type": "val wframe_log: #k:id{AEAD.is_safe (dfst k)} -> w:stream_writer k -> l:Seq.seq (AEAD.entry (dfst k) (AEAD.wgetinfo (writer_aead_state w))) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n invariant w h0 /\\\n AEAD.wlog (writer_aead_state w) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (footprint w))\n (ensures invariant w h1 ==> AEAD.wlog (writer_aead_state w) h1 == l)", "source_definition": "let wframe_log #k w t h0 l h1 =\n AEAD.frame_log l w.ae h0 h1", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 195, "start_col": 2, "end_line": 195, "end_col": 29 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h\n\nlet invariant #k w h =\n AEAD.winvariant w.ae h /\\\n PNE.invariant w.pne h /\\\n h `HS.contains` w.ctr /\\\n fresh_nonces w h /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` AEAD.wfootprint w.ae\n\nlet rinvariant #k #w r h = invariant w h /\\\n h `HS.contains` r.last /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr)\n\nlet writer_offset #k w = w.offset\nlet reader_offset #k #w r = w.offset\n\nlet wctrT #k w h = HS.sel h w.ctr\nlet wctr #k w = !w.ctr\n\nlet writer_static_iv #k w = w.siv\nlet reader_static_iv #k #w r = w.siv\n\nlet expected_pnT #k #w r h = HS.sel h r.last\nlet expected_pn #k #w r = !r.last\n\nlet footprint #k w = (AEAD.wfootprint w.ae)\n `B.loc_union` (PNE.footprint w.pne)\n `B.loc_union` B.loc_mreference w.ctr\n\nlet rfootprint #k #w r = footprint w `B.loc_union` B.loc_mreference r.last\n\nlet frame_invariant #k w h0 l h1 =\n AEAD.wframe_invariant l w.ae h0 h1;\n PNE.frame_invariant w.pne l h0 h1;\n if safe k then AEAD.frame_log l w.ae h0 h1\n\nlet rframe_invariant #k #w r h0 l h1 =\n AEAD.wframe_invariant l w.ae h0 h1;\n PNE.frame_invariant w.pne l h0 h1", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n w: Model.QUIC.stream_writer k ->\n l:\n FStar.Seq.Base.seq (Model.AEAD.entry (FStar.Pervasives.dfst k)\n (Model.AEAD.wgetinfo (Model.QUIC.writer_aead_state w))) ->\n h0: FStar.Monotonic.HyperStack.mem ->\n ri: LowStar.Monotonic.Buffer.loc ->\n h1: FStar.Monotonic.HyperStack.mem\n -> FStar.Pervasives.Lemma\n (requires\n Model.QUIC.invariant w h0 /\\ Model.AEAD.wlog (Model.QUIC.writer_aead_state w) h0 == l /\\\n LowStar.Monotonic.Buffer.modifies ri h0 h1 /\\\n LowStar.Monotonic.Buffer.loc_disjoint ri (Model.QUIC.footprint w))\n (ensures\n Model.QUIC.invariant w h1 ==> Model.AEAD.wlog (Model.QUIC.writer_aead_state w) h1 == l)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Prims.b2t", "Model.AEAD.is_safe", "FStar.Pervasives.dfst", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Model.PNE.is_safe", "Model.QUIC.stream_writer", "FStar.Seq.Base.seq", "Model.AEAD.entry", "Model.AEAD.wgetinfo", "Model.QUIC.writer_aead_state", "FStar.Monotonic.HyperStack.mem", "LowStar.Monotonic.Buffer.loc", "Model.AEAD.frame_log", "Model.QUIC.__proj__Writer__item__ae", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val wframe_log: #k:id{AEAD.is_safe (dfst k)} -> w:stream_writer k -> l:Seq.seq (AEAD.entry (dfst k) (AEAD.wgetinfo (writer_aead_state w))) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n invariant w h0 /\\\n AEAD.wlog (writer_aead_state w) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (footprint w))\n (ensures invariant w h1 ==> AEAD.wlog (writer_aead_state w) h1 == l)\nlet wframe_log #k w t h0 l h1 =", "completed_definiton": "AEAD.frame_log l w.ae h0 h1", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.nonce_of_ctr_injective'", "original_source_type": "val nonce_of_ctr_injective'\n (#i: _)\n (w: stream_writer i)\n (n1: nat{n1 < pow2 62 /\\ n1 >= w.offset})\n (n2: nat{n2 < pow2 62 /\\ n2 >= w.offset})\n : Lemma (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)", "source_type": "val nonce_of_ctr_injective'\n (#i: _)\n (w: stream_writer i)\n (n1: nat{n1 < pow2 62 /\\ n1 >= w.offset})\n (n2: nat{n2 < pow2 62 /\\ n2 >= w.offset})\n : Lemma (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)", "source_definition": "let nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 135, "start_col": 2, "end_line": 135, "end_col": 58 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n w: Model.QUIC.stream_writer i ->\n n1: Prims.nat{n1 < Prims.pow2 62 /\\ n1 >= Writer?.offset w} ->\n n2: Prims.nat{n2 < Prims.pow2 62 /\\ n2 >= Writer?.offset w}\n -> FStar.Pervasives.Lemma\n (ensures n1 <> n2 ==> Model.QUIC.nonce_of_ctr w n1 <> Model.QUIC.nonce_of_ctr w n2)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThan", "Prims.pow2", "Prims.op_GreaterThanOrEqual", "Model.QUIC.__proj__Writer__item__offset", "FStar.Classical.move_requires", "Prims.eq2", "Model.AEAD.nonce", "Model.QUIC.nonce_of_ctr", "Prims.l_or", "Model.QUIC.nonce_of_ctr_injective", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.l_imp", "Prims.op_disEquality", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val nonce_of_ctr_injective'\n (#i: _)\n (w: stream_writer i)\n (n1: nat{n1 < pow2 62 /\\ n1 >= w.offset})\n (n2: nat{n2 < pow2 62 /\\ n2 >= w.offset})\n : Lemma (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\nlet nonce_of_ctr_injective'\n #i\n (w: stream_writer i)\n (n1: nat{n1 < pow2 62 /\\ n1 >= w.offset})\n (n2: nat{n2 < pow2 62 /\\ n2 >= w.offset})\n : Lemma (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2) =", "completed_definiton": "Classical.move_requires (nonce_of_ctr_injective w n1) n2", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.wctr", "original_source_type": "val wctr: #k:id -> w:stream_writer k -> ST (n:nat{n >= writer_offset w /\\ n <= max_ctr})\n (requires fun h0 -> invariant w h0)\n (ensures fun h0 c h1 -> h0 == h1 /\\ c = wctrT w h1)", "source_type": "val wctr: #k:id -> w:stream_writer k -> ST (n:nat{n >= writer_offset w /\\ n <= max_ctr})\n (requires fun h0 -> invariant w h0)\n (ensures fun h0 c h1 -> h0 == h1 /\\ c = wctrT w h1)", "source_definition": "let wctr #k w = !w.ctr", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 171, "start_col": 16, "end_line": 171, "end_col": 22 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h\n\nlet invariant #k w h =\n AEAD.winvariant w.ae h /\\\n PNE.invariant w.pne h /\\\n h `HS.contains` w.ctr /\\\n fresh_nonces w h /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` AEAD.wfootprint w.ae\n\nlet rinvariant #k #w r h = invariant w h /\\\n h `HS.contains` r.last /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr)\n\nlet writer_offset #k w = w.offset\nlet reader_offset #k #w r = w.offset", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.QUIC.stream_writer k\n -> FStar.HyperStack.ST.ST\n (n: Prims.nat{n >= Model.QUIC.writer_offset w /\\ n <= Model.QUIC.max_ctr})", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "FStar.HyperStack.ST.op_Bang", "Model.QUIC._ctr", "Model.QUIC.__proj__Writer__item__offset", "FStar.Heap.trivial_preorder", "Model.QUIC.__proj__Writer__item__ctr", "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "Model.QUIC.writer_offset", "Prims.op_LessThanOrEqual", "Model.QUIC.max_ctr" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val wctr: #k:id -> w:stream_writer k -> ST (n:nat{n >= writer_offset w /\\ n <= max_ctr})\n (requires fun h0 -> invariant w h0)\n (ensures fun h0 c h1 -> h0 == h1 /\\ c = wctrT w h1)\nlet wctr #k w =", "completed_definiton": "!w.ctr", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.rframe_pnlog", "original_source_type": "val rframe_pnlog: #k:id{PNE.is_safe (dsnd k)} -> #w:stream_writer k -> r:stream_reader w -> l:Seq.seq (PNE.entry (reader_pne_info r)) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n rinvariant r h0 /\\\n PNE.table (reader_pne_state r) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (rfootprint r))\n (ensures PNE.table (reader_pne_state r) h1 == l)", "source_type": "val rframe_pnlog: #k:id{PNE.is_safe (dsnd k)} -> #w:stream_writer k -> r:stream_reader w -> l:Seq.seq (PNE.entry (reader_pne_info r)) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n rinvariant r h0 /\\\n PNE.table (reader_pne_state r) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (rfootprint r))\n (ensures PNE.table (reader_pne_state r) h1 == l)", "source_definition": "let rframe_pnlog #k #w r t h0 l h1 =\n PNE.frame_table w.pne l h0 h1", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 204, "start_col": 2, "end_line": 204, "end_col": 31 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h\n\nlet invariant #k w h =\n AEAD.winvariant w.ae h /\\\n PNE.invariant w.pne h /\\\n h `HS.contains` w.ctr /\\\n fresh_nonces w h /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` AEAD.wfootprint w.ae\n\nlet rinvariant #k #w r h = invariant w h /\\\n h `HS.contains` r.last /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr)\n\nlet writer_offset #k w = w.offset\nlet reader_offset #k #w r = w.offset\n\nlet wctrT #k w h = HS.sel h w.ctr\nlet wctr #k w = !w.ctr\n\nlet writer_static_iv #k w = w.siv\nlet reader_static_iv #k #w r = w.siv\n\nlet expected_pnT #k #w r h = HS.sel h r.last\nlet expected_pn #k #w r = !r.last\n\nlet footprint #k w = (AEAD.wfootprint w.ae)\n `B.loc_union` (PNE.footprint w.pne)\n `B.loc_union` B.loc_mreference w.ctr\n\nlet rfootprint #k #w r = footprint w `B.loc_union` B.loc_mreference r.last\n\nlet frame_invariant #k w h0 l h1 =\n AEAD.wframe_invariant l w.ae h0 h1;\n PNE.frame_invariant w.pne l h0 h1;\n if safe k then AEAD.frame_log l w.ae h0 h1\n\nlet rframe_invariant #k #w r h0 l h1 =\n AEAD.wframe_invariant l w.ae h0 h1;\n PNE.frame_invariant w.pne l h0 h1\n\nlet wframe_log #k w t h0 l h1 =\n AEAD.frame_log l w.ae h0 h1\n \nlet rframe_log #k #w r t h0 l h1 =\n AEAD.frame_log l w.ae h0 h1\n\nlet wframe_pnlog #k w t h0 l h1 =\n PNE.frame_table w.pne l h0 h1", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n r: Model.QUIC.stream_reader w ->\n l: FStar.Seq.Base.seq (Model.PNE.entry (Model.QUIC.reader_pne_info r)) ->\n h0: FStar.Monotonic.HyperStack.mem ->\n ri: LowStar.Monotonic.Buffer.loc ->\n h1: FStar.Monotonic.HyperStack.mem\n -> FStar.Pervasives.Lemma\n (requires\n Model.QUIC.rinvariant r h0 /\\ Model.PNE.table (Model.QUIC.reader_pne_state r) h0 == l /\\\n LowStar.Monotonic.Buffer.modifies ri h0 h1 /\\\n LowStar.Monotonic.Buffer.loc_disjoint ri (Model.QUIC.rfootprint r))\n (ensures Model.PNE.table (Model.QUIC.reader_pne_state r) h1 == l)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Prims.b2t", "Model.PNE.is_safe", "FStar.Pervasives.dsnd", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Model.AEAD.is_safe", "Model.QUIC.stream_writer", "Model.QUIC.stream_reader", "FStar.Seq.Base.seq", "Model.PNE.entry", "Model.QUIC.reader_pne_info", "FStar.Monotonic.HyperStack.mem", "LowStar.Monotonic.Buffer.loc", "Model.PNE.frame_table", "Model.QUIC.__proj__Writer__item__pne_info", "Model.QUIC.__proj__Writer__item__pne", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val rframe_pnlog: #k:id{PNE.is_safe (dsnd k)} -> #w:stream_writer k -> r:stream_reader w -> l:Seq.seq (PNE.entry (reader_pne_info r)) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n rinvariant r h0 /\\\n PNE.table (reader_pne_state r) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (rfootprint r))\n (ensures PNE.table (reader_pne_state r) h1 == l)\nlet rframe_pnlog #k #w r t h0 l h1 =", "completed_definiton": "PNE.frame_table w.pne l h0 h1", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.expected_pn", "original_source_type": "val expected_pn: #k:id -> #w:stream_writer k -> r:stream_reader w ->\n ST (n:nat{n >= writer_offset w /\\ n <= max_ctr})\n (requires fun h0 -> rinvariant r h0)\n (ensures fun h0 c h1 -> h0 == h1 /\\\n (c == expected_pnT #k #w r h0))", "source_type": "val expected_pn: #k:id -> #w:stream_writer k -> r:stream_reader w ->\n ST (n:nat{n >= writer_offset w /\\ n <= max_ctr})\n (requires fun h0 -> rinvariant r h0)\n (ensures fun h0 c h1 -> h0 == h1 /\\\n (c == expected_pnT #k #w r h0))", "source_definition": "let expected_pn #k #w r = !r.last", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 177, "start_col": 26, "end_line": 177, "end_col": 33 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h\n\nlet invariant #k w h =\n AEAD.winvariant w.ae h /\\\n PNE.invariant w.pne h /\\\n h `HS.contains` w.ctr /\\\n fresh_nonces w h /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` AEAD.wfootprint w.ae\n\nlet rinvariant #k #w r h = invariant w h /\\\n h `HS.contains` r.last /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr)\n\nlet writer_offset #k w = w.offset\nlet reader_offset #k #w r = w.offset\n\nlet wctrT #k w h = HS.sel h w.ctr\nlet wctr #k w = !w.ctr\n\nlet writer_static_iv #k w = w.siv\nlet reader_static_iv #k #w r = w.siv", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "r: Model.QUIC.stream_reader w\n -> FStar.HyperStack.ST.ST\n (n: Prims.nat{n >= Model.QUIC.writer_offset w /\\ n <= Model.QUIC.max_ctr})", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Model.QUIC.stream_reader", "FStar.HyperStack.ST.op_Bang", "Model.QUIC._last", "Model.QUIC.__proj__Writer__item__offset", "FStar.Heap.trivial_preorder", "Model.QUIC.__proj__Reader__item__last", "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "Model.QUIC.writer_offset", "Prims.op_LessThanOrEqual", "Model.QUIC.max_ctr" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val expected_pn: #k:id -> #w:stream_writer k -> r:stream_reader w ->\n ST (n:nat{n >= writer_offset w /\\ n <= max_ctr})\n (requires fun h0 -> rinvariant r h0)\n (ensures fun h0 c h1 -> h0 == h1 /\\\n (c == expected_pnT #k #w r h0))\nlet expected_pn #k #w r =", "completed_definiton": "!r.last", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.wframe_pnlog", "original_source_type": "val wframe_pnlog: #k:id{PNE.is_safe (dsnd k)} -> w:stream_writer k -> l:Seq.seq (PNE.entry (writer_pne_info w)) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n invariant w h0 /\\\n PNE.table (writer_pne_state w) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (footprint w))\n (ensures PNE.table (writer_pne_state w) h1 == l)", "source_type": "val wframe_pnlog: #k:id{PNE.is_safe (dsnd k)} -> w:stream_writer k -> l:Seq.seq (PNE.entry (writer_pne_info w)) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n invariant w h0 /\\\n PNE.table (writer_pne_state w) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (footprint w))\n (ensures PNE.table (writer_pne_state w) h1 == l)", "source_definition": "let wframe_pnlog #k w t h0 l h1 =\n PNE.frame_table w.pne l h0 h1", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 201, "start_col": 2, "end_line": 201, "end_col": 31 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h\n\nlet invariant #k w h =\n AEAD.winvariant w.ae h /\\\n PNE.invariant w.pne h /\\\n h `HS.contains` w.ctr /\\\n fresh_nonces w h /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` AEAD.wfootprint w.ae\n\nlet rinvariant #k #w r h = invariant w h /\\\n h `HS.contains` r.last /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr)\n\nlet writer_offset #k w = w.offset\nlet reader_offset #k #w r = w.offset\n\nlet wctrT #k w h = HS.sel h w.ctr\nlet wctr #k w = !w.ctr\n\nlet writer_static_iv #k w = w.siv\nlet reader_static_iv #k #w r = w.siv\n\nlet expected_pnT #k #w r h = HS.sel h r.last\nlet expected_pn #k #w r = !r.last\n\nlet footprint #k w = (AEAD.wfootprint w.ae)\n `B.loc_union` (PNE.footprint w.pne)\n `B.loc_union` B.loc_mreference w.ctr\n\nlet rfootprint #k #w r = footprint w `B.loc_union` B.loc_mreference r.last\n\nlet frame_invariant #k w h0 l h1 =\n AEAD.wframe_invariant l w.ae h0 h1;\n PNE.frame_invariant w.pne l h0 h1;\n if safe k then AEAD.frame_log l w.ae h0 h1\n\nlet rframe_invariant #k #w r h0 l h1 =\n AEAD.wframe_invariant l w.ae h0 h1;\n PNE.frame_invariant w.pne l h0 h1\n\nlet wframe_log #k w t h0 l h1 =\n AEAD.frame_log l w.ae h0 h1\n \nlet rframe_log #k #w r t h0 l h1 =\n AEAD.frame_log l w.ae h0 h1", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n w: Model.QUIC.stream_writer k ->\n l: FStar.Seq.Base.seq (Model.PNE.entry (Model.QUIC.writer_pne_info w)) ->\n h0: FStar.Monotonic.HyperStack.mem ->\n ri: LowStar.Monotonic.Buffer.loc ->\n h1: FStar.Monotonic.HyperStack.mem\n -> FStar.Pervasives.Lemma\n (requires\n Model.QUIC.invariant w h0 /\\ Model.PNE.table (Model.QUIC.writer_pne_state w) h0 == l /\\\n LowStar.Monotonic.Buffer.modifies ri h0 h1 /\\\n LowStar.Monotonic.Buffer.loc_disjoint ri (Model.QUIC.footprint w))\n (ensures Model.PNE.table (Model.QUIC.writer_pne_state w) h1 == l)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Prims.b2t", "Model.PNE.is_safe", "FStar.Pervasives.dsnd", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Model.AEAD.is_safe", "Model.QUIC.stream_writer", "FStar.Seq.Base.seq", "Model.PNE.entry", "Model.QUIC.writer_pne_info", "FStar.Monotonic.HyperStack.mem", "LowStar.Monotonic.Buffer.loc", "Model.PNE.frame_table", "Model.QUIC.__proj__Writer__item__pne_info", "Model.QUIC.__proj__Writer__item__pne", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val wframe_pnlog: #k:id{PNE.is_safe (dsnd k)} -> w:stream_writer k -> l:Seq.seq (PNE.entry (writer_pne_info w)) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n invariant w h0 /\\\n PNE.table (writer_pne_state w) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (footprint w))\n (ensures PNE.table (writer_pne_state w) h1 == l)\nlet wframe_pnlog #k w t h0 l h1 =", "completed_definiton": "PNE.frame_table w.pne l h0 h1", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.createReader", "original_source_type": "val createReader: parent:rgn -> #k:id -> w:stream_writer k ->\n ST (stream_reader w)\n (requires fun h0 -> invariant w h0 /\\\n writer_offset w < max_ctr)\n (ensures fun h0 r h1 ->\n invariant w h1 /\\ rinvariant r h1 /\\\n M.modifies (rfootprint r) h0 h1 /\\\n expected_pnT r h1 == writer_offset w)", "source_type": "val createReader: parent:rgn -> #k:id -> w:stream_writer k ->\n ST (stream_reader w)\n (requires fun h0 -> invariant w h0 /\\\n writer_offset w < max_ctr)\n (ensures fun h0 r h1 ->\n invariant w h1 /\\ rinvariant r h1 /\\\n M.modifies (rfootprint r) h0 h1 /\\\n expected_pnT r h1 == writer_offset w)", "source_definition": "let createReader rgn #k w =\n let h0 = get () in\n let last = ralloc rgn (writer_offset w) in\n let h1 = get () in\n frame_invariant w h0 M.loc_none h1;\n let aer = AEAD.gen_reader w.ae in\n Reader aer last", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 251, "start_col": 27, "end_line": 257, "end_col": 17 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h\n\nlet invariant #k w h =\n AEAD.winvariant w.ae h /\\\n PNE.invariant w.pne h /\\\n h `HS.contains` w.ctr /\\\n fresh_nonces w h /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` AEAD.wfootprint w.ae\n\nlet rinvariant #k #w r h = invariant w h /\\\n h `HS.contains` r.last /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr)\n\nlet writer_offset #k w = w.offset\nlet reader_offset #k #w r = w.offset\n\nlet wctrT #k w h = HS.sel h w.ctr\nlet wctr #k w = !w.ctr\n\nlet writer_static_iv #k w = w.siv\nlet reader_static_iv #k #w r = w.siv\n\nlet expected_pnT #k #w r h = HS.sel h r.last\nlet expected_pn #k #w r = !r.last\n\nlet footprint #k w = (AEAD.wfootprint w.ae)\n `B.loc_union` (PNE.footprint w.pne)\n `B.loc_union` B.loc_mreference w.ctr\n\nlet rfootprint #k #w r = footprint w `B.loc_union` B.loc_mreference r.last\n\nlet frame_invariant #k w h0 l h1 =\n AEAD.wframe_invariant l w.ae h0 h1;\n PNE.frame_invariant w.pne l h0 h1;\n if safe k then AEAD.frame_log l w.ae h0 h1\n\nlet rframe_invariant #k #w r h0 l h1 =\n AEAD.wframe_invariant l w.ae h0 h1;\n PNE.frame_invariant w.pne l h0 h1\n\nlet wframe_log #k w t h0 l h1 =\n AEAD.frame_log l w.ae h0 h1\n \nlet rframe_log #k #w r t h0 l h1 =\n AEAD.frame_log l w.ae h0 h1\n\nlet wframe_pnlog #k w t h0 l h1 =\n PNE.frame_table w.pne l h0 h1\n\nlet rframe_pnlog #k #w r t h0 l h1 =\n PNE.frame_table w.pne l h0 h1\n\n(* HACK, the interleaving of `val coerce` into this file fails to verify\nwithout increasing the rlimit, but increasing it in the fsti wouldn't\ntake effect here (see FStar issue #2854 and the others linked from\nthere. So, increase rlimit here and pop it after `let coerce`, so we are\nsure to catch it. *)\n#push-options \"--z3rlimit 40\"\n\nlet create k u u1 u2 init =\n let open Model.Helpers in\n let alg = u1.AEAD.alg in\n let siv = random 12 in\n (**) let h0 = get() in\n let ae = AEAD.gen (dfst k) u1 in\n (**) let h1 = get () in \n let pne = PNE.create (dsnd k) u2 in\n (**) let h2 = get () in\n let ctr = ralloc u.region init in\n (**) let h3 = get () in \n (**) AEAD.wframe_invariant M.loc_none ae h1 h3;\n (**) PNE.frame_invariant pne M.loc_none h2 h3;\n if safe k then\n begin\n (**) AEAD.frame_log M.loc_none ae h1 h3;\n (**) PNE.frame_table pne M.loc_none h2 h3\n end;\n Writer u init (reveal siv) ae u2 pne ctr\n\nlet coerce k u u1 u2 init ts =\n let open Model.Helpers in\n let alg = u1.AEAD.alg in\n let siv : Model.Helpers.lbytes 12 = Spec.derive_secret u1.AEAD.halg ts Spec.label_iv 12 in\n let h0 = get() in\n let u1 : AEAD.info (dfst k) = u1 in\n let ae = AEAD.quic_coerce u1 ts in\n let h1 = get () in\n let pne = PNE.quic_coerce (dsnd k) u2 ts in\n let h2 = get () in\n let ctr = ralloc u.region init in\n let h3 = get () in \n AEAD.wframe_invariant M.loc_none ae h1 h3;\n PNE.frame_invariant pne M.loc_none h2 h3;\n Writer u init (reveal siv) ae u2 pne ctr\n\n#push-options \"--z3rlimit 400 --query_stats\"", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 400, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "parent: Mem.rgn -> w: Model.QUIC.stream_writer k\n -> FStar.HyperStack.ST.ST (Model.QUIC.stream_reader w)", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Mem.rgn", "Model.QUIC.id", "Model.QUIC.stream_writer", "Model.QUIC.Reader", "Model.QUIC.stream_reader", "Model.AEAD.aead_reader", "FStar.Pervasives.dfst", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Prims.b2t", "Model.PNE.is_safe", "Model.AEAD.is_safe", "Model.QUIC.__proj__Writer__item__ae", "Model.AEAD.gen_reader", "Prims.unit", "Model.QUIC.frame_invariant", "LowStar.Monotonic.Buffer.loc_none", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "FStar.HyperStack.ST.mref", "Model.QUIC._last", "Model.QUIC.__proj__Writer__item__offset", "FStar.Heap.trivial_preorder", "FStar.HyperStack.ST.ralloc", "Model.QUIC.writer_offset" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val createReader: parent:rgn -> #k:id -> w:stream_writer k ->\n ST (stream_reader w)\n (requires fun h0 -> invariant w h0 /\\\n writer_offset w < max_ctr)\n (ensures fun h0 r h1 ->\n invariant w h1 /\\ rinvariant r h1 /\\\n M.modifies (rfootprint r) h0 h1 /\\\n expected_pnT r h1 == writer_offset w)\nlet createReader rgn #k w =", "completed_definiton": "let h0 = get () in\nlet last = ralloc rgn (writer_offset w) in\nlet h1 = get () in\nframe_invariant w h0 M.loc_none h1;\nlet aer = AEAD.gen_reader w.ae in\nReader aer last", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.rframe_log", "original_source_type": "val rframe_log: #k:id{AEAD.is_safe (dfst k)} -> #w:stream_writer k -> r:stream_reader w -> l:Seq.seq (AEAD.entry (dfst k) (AEAD.rgetinfo (reader_aead_state r))) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n invariant w h0 /\\\n AEAD.rlog (reader_aead_state r) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (rfootprint r))\n (ensures invariant w h1 ==> AEAD.rlog (reader_aead_state r) h1 == l)", "source_type": "val rframe_log: #k:id{AEAD.is_safe (dfst k)} -> #w:stream_writer k -> r:stream_reader w -> l:Seq.seq (AEAD.entry (dfst k) (AEAD.rgetinfo (reader_aead_state r))) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n invariant w h0 /\\\n AEAD.rlog (reader_aead_state r) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (rfootprint r))\n (ensures invariant w h1 ==> AEAD.rlog (reader_aead_state r) h1 == l)", "source_definition": "let rframe_log #k #w r t h0 l h1 =\n AEAD.frame_log l w.ae h0 h1", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 198, "start_col": 2, "end_line": 198, "end_col": 29 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h\n\nlet invariant #k w h =\n AEAD.winvariant w.ae h /\\\n PNE.invariant w.pne h /\\\n h `HS.contains` w.ctr /\\\n fresh_nonces w h /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` AEAD.wfootprint w.ae\n\nlet rinvariant #k #w r h = invariant w h /\\\n h `HS.contains` r.last /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr)\n\nlet writer_offset #k w = w.offset\nlet reader_offset #k #w r = w.offset\n\nlet wctrT #k w h = HS.sel h w.ctr\nlet wctr #k w = !w.ctr\n\nlet writer_static_iv #k w = w.siv\nlet reader_static_iv #k #w r = w.siv\n\nlet expected_pnT #k #w r h = HS.sel h r.last\nlet expected_pn #k #w r = !r.last\n\nlet footprint #k w = (AEAD.wfootprint w.ae)\n `B.loc_union` (PNE.footprint w.pne)\n `B.loc_union` B.loc_mreference w.ctr\n\nlet rfootprint #k #w r = footprint w `B.loc_union` B.loc_mreference r.last\n\nlet frame_invariant #k w h0 l h1 =\n AEAD.wframe_invariant l w.ae h0 h1;\n PNE.frame_invariant w.pne l h0 h1;\n if safe k then AEAD.frame_log l w.ae h0 h1\n\nlet rframe_invariant #k #w r h0 l h1 =\n AEAD.wframe_invariant l w.ae h0 h1;\n PNE.frame_invariant w.pne l h0 h1\n\nlet wframe_log #k w t h0 l h1 =\n AEAD.frame_log l w.ae h0 h1", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n r: Model.QUIC.stream_reader w ->\n l:\n FStar.Seq.Base.seq (Model.AEAD.entry (FStar.Pervasives.dfst k)\n (Model.AEAD.rgetinfo (Model.QUIC.reader_aead_state r))) ->\n h0: FStar.Monotonic.HyperStack.mem ->\n ri: LowStar.Monotonic.Buffer.loc ->\n h1: FStar.Monotonic.HyperStack.mem\n -> FStar.Pervasives.Lemma\n (requires\n Model.QUIC.invariant w h0 /\\ Model.AEAD.rlog (Model.QUIC.reader_aead_state r) h0 == l /\\\n LowStar.Monotonic.Buffer.modifies ri h0 h1 /\\\n LowStar.Monotonic.Buffer.loc_disjoint ri (Model.QUIC.rfootprint r))\n (ensures\n Model.QUIC.invariant w h1 ==> Model.AEAD.rlog (Model.QUIC.reader_aead_state r) h1 == l)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Prims.b2t", "Model.AEAD.is_safe", "FStar.Pervasives.dfst", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Model.PNE.is_safe", "Model.QUIC.stream_writer", "Model.QUIC.stream_reader", "FStar.Seq.Base.seq", "Model.AEAD.entry", "Model.AEAD.rgetinfo", "Model.QUIC.writer_aead_state", "Model.QUIC.reader_aead_state", "FStar.Monotonic.HyperStack.mem", "LowStar.Monotonic.Buffer.loc", "Model.AEAD.frame_log", "Model.QUIC.__proj__Writer__item__ae", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val rframe_log: #k:id{AEAD.is_safe (dfst k)} -> #w:stream_writer k -> r:stream_reader w -> l:Seq.seq (AEAD.entry (dfst k) (AEAD.rgetinfo (reader_aead_state r))) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n invariant w h0 /\\\n AEAD.rlog (reader_aead_state r) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (rfootprint r))\n (ensures invariant w h1 ==> AEAD.rlog (reader_aead_state r) h1 == l)\nlet rframe_log #k #w r t h0 l h1 =", "completed_definiton": "AEAD.frame_log l w.ae h0 h1", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.pnenc", "original_source_type": "val pnenc (j: PNE.id) (l: pnl) (p: pne_plain j l) (c: PNE.pne_cipherpad)\n : (l': pnl & pne_plain j l')", "source_type": "val pnenc (j: PNE.id) (l: pnl) (p: pne_plain j l) (c: PNE.pne_cipherpad)\n : (l': pnl & pne_plain j l')", "source_definition": "let pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 41, "start_col": 31, "end_line": 51, "end_col": 25 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "j: Model.PNE.id -> l: Model.QUIC.pnl -> p: Model.QUIC.pne_plain j l -> c: Model.PNE.pne_cipherpad\n -> Prims.dtuple2 Model.QUIC.pnl (fun l' -> Model.QUIC.pne_plain j l')", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.id", "Model.QUIC.pnl", "Model.QUIC.pne_plain", "Model.PNE.pne_cipherpad", "QUIC.Spec.Base.lbytes", "Model.PNE.length_bits", "Model.Helpers.lbytes", "Model.PNE.bits", "Prims.Mkdtuple2", "FStar.Pervasives.Native.Mktuple2", "QUIC.Spec.Base.bytes", "QUIC.Spec.Lemmas.xor_inplace", "FStar.Seq.Base.slice", "QUIC.Spec.Base.byte", "Model.Helpers.reveal", "Model.QUIC.extend", "Prims.op_Addition", "LowParse.BitFields.get_bitfield", "LowParse.BitFields.set_bitfield", "Prims.unit", "LowParse.BitFields.set_bitfield_bound", "LowParse.BitFields.ubitfield", "Prims.op_Subtraction", "FStar.UInt.logxor", "QUIC.UInt.lemma_logxor_lt", "Prims.dtuple2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val pnenc (j: PNE.id) (l: pnl) (p: pne_plain j l) (c: PNE.pne_cipherpad)\n : (l': pnl & pne_plain j l')\nlet pnenc (j: PNE.id) (l: pnl) (p: pne_plain j l) (c: PNE.pne_cipherpad)\n : (l': pnl & pne_plain j l') =", "completed_definiton": "let npn, bits = p in\nlet pnm, bm = c in\nQUIC.UInt.lemma_logxor_lt #8 bits bm 5;\nlet v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\nBF.set_bitfield_bound bits 5 0 5 v;\nlet bits':PNE.bits = BF.set_bitfield bits 0 5 v in\nlet ln:pnl = BF.get_bitfield bits' 0 2 + 1 in\nlet npn':Spec.lbytes ln = extend #l npn ln in\nlet npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n(| ln, (npn', bits') |)", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.frame_invariant", "original_source_type": "val frame_invariant: #k:id -> w:stream_writer k -> h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n (invariant w h0 /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (footprint w)))\n (ensures invariant w h1 /\\\n wctrT w h0 == wctrT w h1)\n //AEAD.wlog (writer_aead_state w) h1 == AEAD.wlog (writer_aead_state w) h0 /\\\n //PNE.table (writer_pne_state w) h1 == PNE.table (writer_pne_state w) h0)\n [ SMTPat (M.modifies ri h0 h1); SMTPat (invariant w h1) ]", "source_type": "val frame_invariant: #k:id -> w:stream_writer k -> h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n (invariant w h0 /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (footprint w)))\n (ensures invariant w h1 /\\\n wctrT w h0 == wctrT w h1)\n //AEAD.wlog (writer_aead_state w) h1 == AEAD.wlog (writer_aead_state w) h0 /\\\n //PNE.table (writer_pne_state w) h1 == PNE.table (writer_pne_state w) h0)\n [ SMTPat (M.modifies ri h0 h1); SMTPat (invariant w h1) ]", "source_definition": "let frame_invariant #k w h0 l h1 =\n AEAD.wframe_invariant l w.ae h0 h1;\n PNE.frame_invariant w.pne l h0 h1;\n if safe k then AEAD.frame_log l w.ae h0 h1", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 186, "start_col": 2, "end_line": 188, "end_col": 44 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h\n\nlet invariant #k w h =\n AEAD.winvariant w.ae h /\\\n PNE.invariant w.pne h /\\\n h `HS.contains` w.ctr /\\\n fresh_nonces w h /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` AEAD.wfootprint w.ae\n\nlet rinvariant #k #w r h = invariant w h /\\\n h `HS.contains` r.last /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr)\n\nlet writer_offset #k w = w.offset\nlet reader_offset #k #w r = w.offset\n\nlet wctrT #k w h = HS.sel h w.ctr\nlet wctr #k w = !w.ctr\n\nlet writer_static_iv #k w = w.siv\nlet reader_static_iv #k #w r = w.siv\n\nlet expected_pnT #k #w r h = HS.sel h r.last\nlet expected_pn #k #w r = !r.last\n\nlet footprint #k w = (AEAD.wfootprint w.ae)\n `B.loc_union` (PNE.footprint w.pne)\n `B.loc_union` B.loc_mreference w.ctr\n\nlet rfootprint #k #w r = footprint w `B.loc_union` B.loc_mreference r.last", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n w: Model.QUIC.stream_writer k ->\n h0: FStar.Monotonic.HyperStack.mem ->\n ri: LowStar.Monotonic.Buffer.loc ->\n h1: FStar.Monotonic.HyperStack.mem\n -> FStar.Pervasives.Lemma\n (requires\n Model.QUIC.invariant w h0 /\\ LowStar.Monotonic.Buffer.modifies ri h0 h1 /\\\n LowStar.Monotonic.Buffer.loc_disjoint ri (Model.QUIC.footprint w))\n (ensures Model.QUIC.invariant w h1 /\\ Model.QUIC.wctrT w h0 == Model.QUIC.wctrT w h1)\n [SMTPat (LowStar.Monotonic.Buffer.modifies ri h0 h1); SMTPat (Model.QUIC.invariant w h1)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "FStar.Monotonic.HyperStack.mem", "LowStar.Monotonic.Buffer.loc", "Model.QUIC.safe", "Model.AEAD.frame_log", "FStar.Pervasives.dfst", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Prims.b2t", "Model.PNE.is_safe", "Model.AEAD.is_safe", "Model.QUIC.__proj__Writer__item__ae", "Prims.bool", "Prims.unit", "Model.PNE.frame_invariant", "FStar.Pervasives.dsnd", "Model.QUIC.__proj__Writer__item__pne_info", "Model.QUIC.__proj__Writer__item__pne", "Model.AEAD.wframe_invariant" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val frame_invariant: #k:id -> w:stream_writer k -> h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n (invariant w h0 /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (footprint w)))\n (ensures invariant w h1 /\\\n wctrT w h0 == wctrT w h1)\n //AEAD.wlog (writer_aead_state w) h1 == AEAD.wlog (writer_aead_state w) h0 /\\\n //PNE.table (writer_pne_state w) h1 == PNE.table (writer_pne_state w) h0)\n [ SMTPat (M.modifies ri h0 h1); SMTPat (invariant w h1) ]\nlet frame_invariant #k w h0 l h1 =", "completed_definiton": "AEAD.wframe_invariant l w.ae h0 h1;\nPNE.frame_invariant w.pne l h0 h1;\nif safe k then AEAD.frame_log l w.ae h0 h1", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.rframe_invariant", "original_source_type": "val rframe_invariant: #k:id -> #w:stream_writer k -> r:stream_reader w ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n (rinvariant r h0 /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (rfootprint r)))\n (ensures rinvariant r h1 /\\\n expected_pnT r h0 == expected_pnT r h1)\n [ SMTPat (M.modifies ri h0 h1); SMTPat (rinvariant r h1) ]", "source_type": "val rframe_invariant: #k:id -> #w:stream_writer k -> r:stream_reader w ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n (rinvariant r h0 /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (rfootprint r)))\n (ensures rinvariant r h1 /\\\n expected_pnT r h0 == expected_pnT r h1)\n [ SMTPat (M.modifies ri h0 h1); SMTPat (rinvariant r h1) ]", "source_definition": "let rframe_invariant #k #w r h0 l h1 =\n AEAD.wframe_invariant l w.ae h0 h1;\n PNE.frame_invariant w.pne l h0 h1", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 191, "start_col": 2, "end_line": 192, "end_col": 35 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h\n\nlet invariant #k w h =\n AEAD.winvariant w.ae h /\\\n PNE.invariant w.pne h /\\\n h `HS.contains` w.ctr /\\\n fresh_nonces w h /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` AEAD.wfootprint w.ae\n\nlet rinvariant #k #w r h = invariant w h /\\\n h `HS.contains` r.last /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr)\n\nlet writer_offset #k w = w.offset\nlet reader_offset #k #w r = w.offset\n\nlet wctrT #k w h = HS.sel h w.ctr\nlet wctr #k w = !w.ctr\n\nlet writer_static_iv #k w = w.siv\nlet reader_static_iv #k #w r = w.siv\n\nlet expected_pnT #k #w r h = HS.sel h r.last\nlet expected_pn #k #w r = !r.last\n\nlet footprint #k w = (AEAD.wfootprint w.ae)\n `B.loc_union` (PNE.footprint w.pne)\n `B.loc_union` B.loc_mreference w.ctr\n\nlet rfootprint #k #w r = footprint w `B.loc_union` B.loc_mreference r.last\n\nlet frame_invariant #k w h0 l h1 =\n AEAD.wframe_invariant l w.ae h0 h1;\n PNE.frame_invariant w.pne l h0 h1;\n if safe k then AEAD.frame_log l w.ae h0 h1", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n r: Model.QUIC.stream_reader w ->\n h0: FStar.Monotonic.HyperStack.mem ->\n ri: LowStar.Monotonic.Buffer.loc ->\n h1: FStar.Monotonic.HyperStack.mem\n -> FStar.Pervasives.Lemma\n (requires\n Model.QUIC.rinvariant r h0 /\\ LowStar.Monotonic.Buffer.modifies ri h0 h1 /\\\n LowStar.Monotonic.Buffer.loc_disjoint ri (Model.QUIC.rfootprint r))\n (ensures\n Model.QUIC.rinvariant r h1 /\\ Model.QUIC.expected_pnT r h0 == Model.QUIC.expected_pnT r h1)\n [SMTPat (LowStar.Monotonic.Buffer.modifies ri h0 h1); SMTPat (Model.QUIC.rinvariant r h1)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Model.QUIC.stream_reader", "FStar.Monotonic.HyperStack.mem", "LowStar.Monotonic.Buffer.loc", "Model.PNE.frame_invariant", "FStar.Pervasives.dsnd", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Prims.b2t", "Model.PNE.is_safe", "Model.AEAD.is_safe", "Model.QUIC.__proj__Writer__item__pne_info", "Model.QUIC.__proj__Writer__item__pne", "Prims.unit", "Model.AEAD.wframe_invariant", "FStar.Pervasives.dfst", "Model.QUIC.__proj__Writer__item__ae" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val rframe_invariant: #k:id -> #w:stream_writer k -> r:stream_reader w ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n (rinvariant r h0 /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (rfootprint r)))\n (ensures rinvariant r h1 /\\\n expected_pnT r h0 == expected_pnT r h1)\n [ SMTPat (M.modifies ri h0 h1); SMTPat (rinvariant r h1) ]\nlet rframe_invariant #k #w r h0 l h1 =", "completed_definiton": "AEAD.wframe_invariant l w.ae h0 h1;\nPNE.frame_invariant w.pne l h0 h1", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.create", "original_source_type": "val create: k:id -> u:info ->\n u1:AEAD.info (dfst k) -> u2:PNE.info (dsnd k) -> init: pn ->\n ST (stream_writer k)\n (requires fun h0 -> u2.PNE.calg ==\n Spec.Agile.AEAD.cipher_alg_of_supported_alg u1.AEAD.alg /\\\n u2.PNE.halg == u1.AEAD.halg /\\\n u2.PNE.plain == pne_pkg /\\\n u1.AEAD.min_len == 3)\n (ensures fun h0 w h1 ->\n invariant w h1 /\\\n M.modifies (footprint w) h0 h1 /\\\n writer_offset w == init /\\\n writer_ae_info w == u1 /\\\n writer_pne_info w == u2 /\\\n writer_info w == u /\\\n wctrT w h1 == writer_offset w /\\\n (safe k ==>\n (AEAD.wlog (writer_aead_state w) h1 == Seq.empty /\\\n PNE.table (writer_pne_state w) h1 == Seq.empty\n ))\n )", "source_type": "val create: k:id -> u:info ->\n u1:AEAD.info (dfst k) -> u2:PNE.info (dsnd k) -> init: pn ->\n ST (stream_writer k)\n (requires fun h0 -> u2.PNE.calg ==\n Spec.Agile.AEAD.cipher_alg_of_supported_alg u1.AEAD.alg /\\\n u2.PNE.halg == u1.AEAD.halg /\\\n u2.PNE.plain == pne_pkg /\\\n u1.AEAD.min_len == 3)\n (ensures fun h0 w h1 ->\n invariant w h1 /\\\n M.modifies (footprint w) h0 h1 /\\\n writer_offset w == init /\\\n writer_ae_info w == u1 /\\\n writer_pne_info w == u2 /\\\n writer_info w == u /\\\n wctrT w h1 == writer_offset w /\\\n (safe k ==>\n (AEAD.wlog (writer_aead_state w) h1 == Seq.empty /\\\n PNE.table (writer_pne_state w) h1 == Seq.empty\n ))\n )", "source_definition": "let create k u u1 u2 init =\n let open Model.Helpers in\n let alg = u1.AEAD.alg in\n let siv = random 12 in\n (**) let h0 = get() in\n let ae = AEAD.gen (dfst k) u1 in\n (**) let h1 = get () in \n let pne = PNE.create (dsnd k) u2 in\n (**) let h2 = get () in\n let ctr = ralloc u.region init in\n (**) let h3 = get () in \n (**) AEAD.wframe_invariant M.loc_none ae h1 h3;\n (**) PNE.frame_invariant pne M.loc_none h2 h3;\n if safe k then\n begin\n (**) AEAD.frame_log M.loc_none ae h1 h3;\n (**) PNE.frame_table pne M.loc_none h2 h3\n end;\n Writer u init (reveal siv) ae u2 pne ctr", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 214, "start_col": 2, "end_line": 231, "end_col": 42 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h\n\nlet invariant #k w h =\n AEAD.winvariant w.ae h /\\\n PNE.invariant w.pne h /\\\n h `HS.contains` w.ctr /\\\n fresh_nonces w h /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` AEAD.wfootprint w.ae\n\nlet rinvariant #k #w r h = invariant w h /\\\n h `HS.contains` r.last /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr)\n\nlet writer_offset #k w = w.offset\nlet reader_offset #k #w r = w.offset\n\nlet wctrT #k w h = HS.sel h w.ctr\nlet wctr #k w = !w.ctr\n\nlet writer_static_iv #k w = w.siv\nlet reader_static_iv #k #w r = w.siv\n\nlet expected_pnT #k #w r h = HS.sel h r.last\nlet expected_pn #k #w r = !r.last\n\nlet footprint #k w = (AEAD.wfootprint w.ae)\n `B.loc_union` (PNE.footprint w.pne)\n `B.loc_union` B.loc_mreference w.ctr\n\nlet rfootprint #k #w r = footprint w `B.loc_union` B.loc_mreference r.last\n\nlet frame_invariant #k w h0 l h1 =\n AEAD.wframe_invariant l w.ae h0 h1;\n PNE.frame_invariant w.pne l h0 h1;\n if safe k then AEAD.frame_log l w.ae h0 h1\n\nlet rframe_invariant #k #w r h0 l h1 =\n AEAD.wframe_invariant l w.ae h0 h1;\n PNE.frame_invariant w.pne l h0 h1\n\nlet wframe_log #k w t h0 l h1 =\n AEAD.frame_log l w.ae h0 h1\n \nlet rframe_log #k #w r t h0 l h1 =\n AEAD.frame_log l w.ae h0 h1\n\nlet wframe_pnlog #k w t h0 l h1 =\n PNE.frame_table w.pne l h0 h1\n\nlet rframe_pnlog #k #w r t h0 l h1 =\n PNE.frame_table w.pne l h0 h1\n\n(* HACK, the interleaving of `val coerce` into this file fails to verify\nwithout increasing the rlimit, but increasing it in the fsti wouldn't\ntake effect here (see FStar issue #2854 and the others linked from\nthere. So, increase rlimit here and pop it after `let coerce`, so we are\nsure to catch it. *)\n#push-options \"--z3rlimit 40\"", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 40, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n k: Model.QUIC.id ->\n u202: Model.QUIC.info ->\n u1: Model.AEAD.info (FStar.Pervasives.dfst k) ->\n u2: Model.PNE.info (FStar.Pervasives.dsnd k) ->\n init: Model.QUIC.pn\n -> FStar.HyperStack.ST.ST (Model.QUIC.stream_writer k)", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.info", "Model.AEAD.info", "FStar.Pervasives.dfst", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Prims.b2t", "Model.PNE.is_safe", "Model.AEAD.is_safe", "Model.PNE.info", "FStar.Pervasives.dsnd", "Model.QUIC.pn", "Model.QUIC.Writer", "Model.Helpers.reveal", "Prims.unit", "Model.QUIC.safe", "Model.PNE.frame_table", "LowStar.Monotonic.Buffer.loc_none", "Model.AEAD.frame_log", "Prims.bool", "Model.PNE.frame_invariant", "Model.AEAD.wframe_invariant", "Model.QUIC.stream_writer", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "FStar.HyperStack.ST.mref", "Model.QUIC._ctr", "FStar.Heap.trivial_preorder", "FStar.HyperStack.ST.ralloc", "Model.QUIC.__proj__Mkinfo__item__region", "Model.PNE.pne_state", "Model.PNE.create", "Model.AEAD.aead_writer", "Model.AEAD.gen", "Model.Helpers.lbytes", "Model.Helpers.random", "Model.AEAD.alg", "Model.AEAD.__proj__Mkinfo'__item__alg" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val create: k:id -> u:info ->\n u1:AEAD.info (dfst k) -> u2:PNE.info (dsnd k) -> init: pn ->\n ST (stream_writer k)\n (requires fun h0 -> u2.PNE.calg ==\n Spec.Agile.AEAD.cipher_alg_of_supported_alg u1.AEAD.alg /\\\n u2.PNE.halg == u1.AEAD.halg /\\\n u2.PNE.plain == pne_pkg /\\\n u1.AEAD.min_len == 3)\n (ensures fun h0 w h1 ->\n invariant w h1 /\\\n M.modifies (footprint w) h0 h1 /\\\n writer_offset w == init /\\\n writer_ae_info w == u1 /\\\n writer_pne_info w == u2 /\\\n writer_info w == u /\\\n wctrT w h1 == writer_offset w /\\\n (safe k ==>\n (AEAD.wlog (writer_aead_state w) h1 == Seq.empty /\\\n PNE.table (writer_pne_state w) h1 == Seq.empty\n ))\n )\nlet create k u u1 u2 init =", "completed_definiton": "let open Model.Helpers in\nlet alg = u1.AEAD.alg in\nlet siv = random 12 in\nlet h0 = get () in\nlet ae = AEAD.gen (dfst k) u1 in\nlet h1 = get () in\nlet pne = PNE.create (dsnd k) u2 in\nlet h2 = get () in\nlet ctr = ralloc u.region init in\nlet h3 = get () in\nAEAD.wframe_invariant M.loc_none ae h1 h3;\nPNE.frame_invariant pne M.loc_none h2 h3;\nif safe k\nthen\n (AEAD.frame_log M.loc_none ae h1 h3;\n PNE.frame_table pne M.loc_none h2 h3);\nWriter u init (reveal siv) ae u2 pne ctr", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.coerce", "original_source_type": "val coerce: k:unsafe_id -> u:info ->\n u1:AEAD.info (dfst k) -> u2:PNE.info (dsnd k) -> \n init: pn -> ts:AEAD.traffic_secret u1.AEAD.halg ->\n ST (stream_writer k)\n (requires fun h0 -> u2.PNE.calg ==\n Spec.Agile.AEAD.cipher_alg_of_supported_alg u1.AEAD.alg /\\\n u2.PNE.halg == u1.AEAD.halg /\\\n u2.PNE.plain == pne_pkg /\\\n u1.AEAD.min_len == 3)\n (ensures fun h0 w h1 ->\n let (k1, k2) = writer_leak w in\n invariant w h1 /\\\n M.modifies (footprint w) h0 h1 /\\\n writer_offset w == init /\\\n wctrT w h1 == writer_offset w /\\\n writer_ae_info w == u1 /\\\n writer_pne_info w == u2 /\\\n writer_info w == u /\\\n Model.Helpers.hide (writer_static_iv w) ==\n Spec.derive_secret u1.AEAD.halg ts\n Spec.label_iv 12 /\\\n Model.Helpers.hide k1 == Spec.derive_secret u1.AEAD.halg ts\n Spec.label_key (SAE.key_length u1.AEAD.alg) /\\\n Model.Helpers.hide k2 == QUIC.Spec.derive_secret u2.PNE.halg ts\n QUIC.Spec.label_hp (PNE.key_len u2)\n )", "source_type": "val coerce: k:unsafe_id -> u:info ->\n u1:AEAD.info (dfst k) -> u2:PNE.info (dsnd k) -> \n init: pn -> ts:AEAD.traffic_secret u1.AEAD.halg ->\n ST (stream_writer k)\n (requires fun h0 -> u2.PNE.calg ==\n Spec.Agile.AEAD.cipher_alg_of_supported_alg u1.AEAD.alg /\\\n u2.PNE.halg == u1.AEAD.halg /\\\n u2.PNE.plain == pne_pkg /\\\n u1.AEAD.min_len == 3)\n (ensures fun h0 w h1 ->\n let (k1, k2) = writer_leak w in\n invariant w h1 /\\\n M.modifies (footprint w) h0 h1 /\\\n writer_offset w == init /\\\n wctrT w h1 == writer_offset w /\\\n writer_ae_info w == u1 /\\\n writer_pne_info w == u2 /\\\n writer_info w == u /\\\n Model.Helpers.hide (writer_static_iv w) ==\n Spec.derive_secret u1.AEAD.halg ts\n Spec.label_iv 12 /\\\n Model.Helpers.hide k1 == Spec.derive_secret u1.AEAD.halg ts\n Spec.label_key (SAE.key_length u1.AEAD.alg) /\\\n Model.Helpers.hide k2 == QUIC.Spec.derive_secret u2.PNE.halg ts\n QUIC.Spec.label_hp (PNE.key_len u2)\n )", "source_definition": "let coerce k u u1 u2 init ts =\n let open Model.Helpers in\n let alg = u1.AEAD.alg in\n let siv : Model.Helpers.lbytes 12 = Spec.derive_secret u1.AEAD.halg ts Spec.label_iv 12 in\n let h0 = get() in\n let u1 : AEAD.info (dfst k) = u1 in\n let ae = AEAD.quic_coerce u1 ts in\n let h1 = get () in\n let pne = PNE.quic_coerce (dsnd k) u2 ts in\n let h2 = get () in\n let ctr = ralloc u.region init in\n let h3 = get () in \n AEAD.wframe_invariant M.loc_none ae h1 h3;\n PNE.frame_invariant pne M.loc_none h2 h3;\n Writer u init (reveal siv) ae u2 pne ctr", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 234, "start_col": 2, "end_line": 247, "end_col": 42 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h\n\nlet invariant #k w h =\n AEAD.winvariant w.ae h /\\\n PNE.invariant w.pne h /\\\n h `HS.contains` w.ctr /\\\n fresh_nonces w h /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` AEAD.wfootprint w.ae\n\nlet rinvariant #k #w r h = invariant w h /\\\n h `HS.contains` r.last /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr)\n\nlet writer_offset #k w = w.offset\nlet reader_offset #k #w r = w.offset\n\nlet wctrT #k w h = HS.sel h w.ctr\nlet wctr #k w = !w.ctr\n\nlet writer_static_iv #k w = w.siv\nlet reader_static_iv #k #w r = w.siv\n\nlet expected_pnT #k #w r h = HS.sel h r.last\nlet expected_pn #k #w r = !r.last\n\nlet footprint #k w = (AEAD.wfootprint w.ae)\n `B.loc_union` (PNE.footprint w.pne)\n `B.loc_union` B.loc_mreference w.ctr\n\nlet rfootprint #k #w r = footprint w `B.loc_union` B.loc_mreference r.last\n\nlet frame_invariant #k w h0 l h1 =\n AEAD.wframe_invariant l w.ae h0 h1;\n PNE.frame_invariant w.pne l h0 h1;\n if safe k then AEAD.frame_log l w.ae h0 h1\n\nlet rframe_invariant #k #w r h0 l h1 =\n AEAD.wframe_invariant l w.ae h0 h1;\n PNE.frame_invariant w.pne l h0 h1\n\nlet wframe_log #k w t h0 l h1 =\n AEAD.frame_log l w.ae h0 h1\n \nlet rframe_log #k #w r t h0 l h1 =\n AEAD.frame_log l w.ae h0 h1\n\nlet wframe_pnlog #k w t h0 l h1 =\n PNE.frame_table w.pne l h0 h1\n\nlet rframe_pnlog #k #w r t h0 l h1 =\n PNE.frame_table w.pne l h0 h1\n\n(* HACK, the interleaving of `val coerce` into this file fails to verify\nwithout increasing the rlimit, but increasing it in the fsti wouldn't\ntake effect here (see FStar issue #2854 and the others linked from\nthere. So, increase rlimit here and pop it after `let coerce`, so we are\nsure to catch it. *)\n#push-options \"--z3rlimit 40\"\n\nlet create k u u1 u2 init =\n let open Model.Helpers in\n let alg = u1.AEAD.alg in\n let siv = random 12 in\n (**) let h0 = get() in\n let ae = AEAD.gen (dfst k) u1 in\n (**) let h1 = get () in \n let pne = PNE.create (dsnd k) u2 in\n (**) let h2 = get () in\n let ctr = ralloc u.region init in\n (**) let h3 = get () in \n (**) AEAD.wframe_invariant M.loc_none ae h1 h3;\n (**) PNE.frame_invariant pne M.loc_none h2 h3;\n if safe k then\n begin\n (**) AEAD.frame_log M.loc_none ae h1 h3;\n (**) PNE.frame_table pne M.loc_none h2 h3\n end;\n Writer u init (reveal siv) ae u2 pne ctr", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 40, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n k: Model.QUIC.unsafe_id ->\n u208: Model.QUIC.info ->\n u1: Model.AEAD.info (FStar.Pervasives.dfst k) ->\n u2: Model.PNE.info (FStar.Pervasives.dsnd k) ->\n init: Model.QUIC.pn ->\n ts: Model.AEAD.traffic_secret (Mkinfo'?.halg u1)\n -> FStar.HyperStack.ST.ST (Model.QUIC.stream_writer k)", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Model.QUIC.unsafe_id", "Model.QUIC.info", "Model.AEAD.info", "FStar.Pervasives.dfst", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Prims.b2t", "Model.PNE.is_safe", "Model.AEAD.is_safe", "Model.PNE.info", "FStar.Pervasives.dsnd", "Model.QUIC.pn", "Model.AEAD.traffic_secret", "Model.AEAD.__proj__Mkinfo'__item__halg", "Model.QUIC.Writer", "Model.Helpers.reveal", "Prims.unit", "Model.PNE.frame_invariant", "LowStar.Monotonic.Buffer.loc_none", "Model.AEAD.wframe_invariant", "Model.QUIC.stream_writer", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "FStar.HyperStack.ST.mref", "Model.QUIC._ctr", "FStar.Heap.trivial_preorder", "FStar.HyperStack.ST.ralloc", "Model.QUIC.__proj__Mkinfo__item__region", "Model.PNE.pne_state", "Model.PNE.quic_coerce", "Model.AEAD.aead_writer", "Model.AEAD.quic_coerce", "Model.Helpers.lbytes", "QUIC.Spec.Crypto.derive_secret", "QUIC.Spec.Crypto.label_iv", "Model.AEAD.alg", "Model.AEAD.__proj__Mkinfo'__item__alg" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val coerce: k:unsafe_id -> u:info ->\n u1:AEAD.info (dfst k) -> u2:PNE.info (dsnd k) -> \n init: pn -> ts:AEAD.traffic_secret u1.AEAD.halg ->\n ST (stream_writer k)\n (requires fun h0 -> u2.PNE.calg ==\n Spec.Agile.AEAD.cipher_alg_of_supported_alg u1.AEAD.alg /\\\n u2.PNE.halg == u1.AEAD.halg /\\\n u2.PNE.plain == pne_pkg /\\\n u1.AEAD.min_len == 3)\n (ensures fun h0 w h1 ->\n let (k1, k2) = writer_leak w in\n invariant w h1 /\\\n M.modifies (footprint w) h0 h1 /\\\n writer_offset w == init /\\\n wctrT w h1 == writer_offset w /\\\n writer_ae_info w == u1 /\\\n writer_pne_info w == u2 /\\\n writer_info w == u /\\\n Model.Helpers.hide (writer_static_iv w) ==\n Spec.derive_secret u1.AEAD.halg ts\n Spec.label_iv 12 /\\\n Model.Helpers.hide k1 == Spec.derive_secret u1.AEAD.halg ts\n Spec.label_key (SAE.key_length u1.AEAD.alg) /\\\n Model.Helpers.hide k2 == QUIC.Spec.derive_secret u2.PNE.halg ts\n QUIC.Spec.label_hp (PNE.key_len u2)\n )\nlet coerce k u u1 u2 init ts =", "completed_definiton": "let open Model.Helpers in\nlet alg = u1.AEAD.alg in\nlet siv:Model.Helpers.lbytes 12 = Spec.derive_secret u1.AEAD.halg ts Spec.label_iv 12 in\nlet h0 = get () in\nlet u1:AEAD.info (dfst k) = u1 in\nlet ae = AEAD.quic_coerce u1 ts in\nlet h1 = get () in\nlet pne = PNE.quic_coerce (dsnd k) u2 ts in\nlet h2 = get () in\nlet ctr = ralloc u.region init in\nlet h3 = get () in\nAEAD.wframe_invariant M.loc_none ae h1 h3;\nPNE.frame_invariant pne M.loc_none h2 h3;\nWriter u init (reveal siv) ae u2 pne ctr", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fst", "name": "Model.QUIC.set_pne", "original_source_type": "val set_pne (h: Spec.header) (#ln: pnl) (pne: PNE.pne_cipher ln) (c1: Spec.bytes)\n : Pure Spec.packet\n (requires\n not (Spec.is_retry h) /\\ ln == Lib.RawIntTypes.uint_to_nat (TSpec.pn_length h) /\\\n Seq.length c1 < pow2 32 - Spec.header_len_bound)\n (ensures fun r -> True)", "source_type": "val set_pne (h: Spec.header) (#ln: pnl) (pne: PNE.pne_cipher ln) (c1: Spec.bytes)\n : Pure Spec.packet\n (requires\n not (Spec.is_retry h) /\\ ln == Lib.RawIntTypes.uint_to_nat (TSpec.pn_length h) /\\\n Seq.length c1 < pow2 32 - Spec.header_len_bound)\n (ensures fun r -> True)", "source_definition": "let set_pne (h:Spec.header) (#ln:pnl) (pne:PNE.pne_cipher ln) (c1:Spec.bytes)\n : Pure Spec.packet\n (requires not (Spec.is_retry h) /\\ ln == Lib.RawIntTypes.uint_to_nat (TSpec.pn_length h) /\\\n Seq.length c1 < pow2 32 - Spec.header_len_bound)\n (ensures fun r -> True)\n =\n let pne, bits = pne in\n let r = TSpec.format_header h in\n let pno = TSpec.pn_offset h in\n assert(pno == Seq.length r - ln);\n assert (Seq.length r <= Spec.header_len_bound);\n assert (ln == Seq.length pne);\n let protected_bits = if Spec.MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v (Seq.index r 0)) 0 protected_bits (BF.get_bitfield (U8.v (Seq.index r 0) `FStar.UInt.logxor` bits) 0 protected_bits) in\n let r' = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 pno `Seq.append` Helpers.reveal pne `Seq.append` c1) in\n assert (Seq.length r' == Seq.length r + Seq.length c1);\n r'", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 273, "start_col": 3, "end_line": 284, "end_col": 4 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nfriend QUIC.TotSpec\n\nmodule Spec = QUIC.Spec\nmodule TSpec = QUIC.TotSpec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\n\nopen FStar.HyperStack.ST\nopen FStar.UInt32\nopen Mem\n\nlet pne_plain (j:PNE.id) (l:pnl) : eqtype = Spec.lbytes l & PNE.length_bits l\nlet as_bytes (j:PNE.id) (l:pnl) (x:pne_plain j l) : GTot (Helpers.lbytes l & PNE.length_bits l) = let (n,b) = x in (Helpers.hide n, b)\nlet repr (j:PNE.unsafe_id) (l:pnl) (x:pne_plain j l) : b:(Helpers.lbytes l & PNE.length_bits l){b == as_bytes j l x} =\n let (n,b)=x in (Helpers.hide n, b)\nlet mk (j:PNE.id) (l:pnl) (n:Helpers.lbytes l) (b:PNE.length_bits l) : p:pne_plain j l{as_bytes j l p == (n,b)} = Helpers.reveal n,b\n\nlet extend (#l:pnl) (b:Spec.lbytes l) (l':pnl)\n : Spec.lbytes l' =\n if l' <= l then Seq.slice b 0 l'\n else Seq.append (Seq.create (l'-l) 0z) b\n\nlet pnenc (j:PNE.id) (l:pnl) (p:pne_plain j l) (c:PNE.pne_cipherpad)\n : (l':pnl & pne_plain j l') =\n let npn, bits = p in\n let pnm, bm = c in\n QUIC.UInt.lemma_logxor_lt #8 bits bm 5;\n let v = BF.get_bitfield #8 (bits `FStar.UInt.logxor` bm) 0 5 in\n BF.set_bitfield_bound bits 5 0 5 v;\n let bits' : PNE.bits = BF.set_bitfield bits 0 5 v in\n let ln : pnl = BF.get_bitfield bits' 0 2 + 1 in\n let npn' : Spec.lbytes ln = extend #l npn ln in \n let npn'' = QUIC.Spec.Lemmas.xor_inplace npn' (Seq.slice (Helpers.reveal pnm) 0 ln) 0 in\n (| ln, (npn', bits') |)\n\nlet lemma_xor (j:PNE.id) (l:pnl) (p:(Spec.lbytes l & PNE.length_bits l)) (c:PNE.pne_cipherpad)\n : Lemma (requires True)\n (ensures (let (| l', b' |) = pnenc j l p c in\n let _, bits = as_bytes j l' b' in\n let l:pnl = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n l == (l' <: pnl)))\n = ()\n\n// The (abstract) type of encrypted QUIC headers,\nlet pne_pkg =\n PNE.PNEPlainPkg pne_plain as_bytes repr mk pnenc lemma_xor\n\ntype _ctr (offset:pn) = p:pn{p >= offset}\n\nnoeq type stream_writer' (i:id) = \n| Writer:\n info: info ->\n offset: pn ->\n siv: Spec.lbytes 12 ->\n ae: AE.aead_writer (dfst i){(AEAD.wgetinfo ae).AEAD.min_len == 3} ->\n pne_info: PNE.info (dsnd i){\n pne_info.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (AEAD.wgetinfo ae).AEAD.alg /\\\n pne_info.PNE.halg == (AEAD.wgetinfo ae).AEAD.halg /\\\n pne_info.PNE.plain == pne_pkg} ->\n pne: PNE.pne_state pne_info ->\n ctr: reference (_ctr offset) ->\n stream_writer' i\n\nlet stream_writer = stream_writer'\n\ntype _last (offset:pn) = p:nat{p >= offset /\\ p < max_ctr}\n\nnoeq type stream_reader' (#i:id) (w:stream_writer i) = \n| Reader:\n aer: AE.aead_reader (w.ae) ->\n last: reference (_last w.offset) ->\n stream_reader' w\n\nlet stream_reader = stream_reader'\n\nlet writer_info #k w = w.info\nlet reader_info #k #w r = w.info\n\nlet writer_ae_info #k w = AEAD.wgetinfo w.ae\nlet reader_ae_info #k #w r = AEAD.rgetinfo r.aer\nlet writer_pne_info #k w = w.pne_info\nlet reader_pne_info #k #w r = w.pne_info\n\nlet writer_aead_state #k w = w.ae\nlet reader_aead_state #k #w r = r.aer\n\nlet writer_pne_state #k w = w.pne\nlet reader_pne_state #k #w r = w.pne\n\nlet nonce_of_ctr #i (w:stream_writer i) (n:nat{n < pow2 62 /\\ n>=w.offset})\n : Tot AEAD.nonce\n =\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn = FStar.Endianness.n_to_be 12 n in\n QUIC.Spec.Lemmas.xor_inplace pn w.siv 0\n\nlet nonce_of_ctr_injective\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (requires (nonce_of_ctr w n1 == nonce_of_ctr w n2))\n (ensures (n1 == n2))\n=\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pn1 = FStar.Endianness.n_to_be 12 n1 in\n let pn2 = FStar.Endianness.n_to_be 12 n2 in\n QUIC.Spec.Lemmas.xor_inplace_involutive pn1 w.siv 0;\n QUIC.Spec.Lemmas.xor_inplace_involutive pn2 w.siv 0\n\nlet nonce_of_ctr_injective'\n #i (w:stream_writer i)\n (n1:nat{n1 < pow2 62 /\\ n1>=w.offset})\n (n2:nat{n2 < pow2 62 /\\ n2>=w.offset})\n: Lemma\n (n1 <> n2 ==> nonce_of_ctr w n1 <> nonce_of_ctr w n2)\n=\n Classical.move_requires (nonce_of_ctr_injective w n1) n2\n\nlet fresh_nonces_from\n (j: nat)\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n=\n (forall i. (i > j /\\ safe k) ==>\n AEAD.fresh_nonce w.ae (nonce_of_ctr w i) h)\n\nlet fresh_nonces\n (#k:id)\n (w:stream_writer k)\n (h:mem)\n: GTot Type0\n= fresh_nonces_from (HS.sel h w.ctr) w h\n\nlet invariant #k w h =\n AEAD.winvariant w.ae h /\\\n PNE.invariant w.pne h /\\\n h `HS.contains` w.ctr /\\\n fresh_nonces w h /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` (B.loc_mreference w.ctr) /\\\n PNE.footprint w.pne `B.loc_disjoint` AEAD.wfootprint w.ae\n\nlet rinvariant #k #w r h = invariant w h /\\\n h `HS.contains` r.last /\\\n AEAD.wfootprint w.ae `B.loc_disjoint` (B.loc_mreference w.ctr)\n\nlet writer_offset #k w = w.offset\nlet reader_offset #k #w r = w.offset\n\nlet wctrT #k w h = HS.sel h w.ctr\nlet wctr #k w = !w.ctr\n\nlet writer_static_iv #k w = w.siv\nlet reader_static_iv #k #w r = w.siv\n\nlet expected_pnT #k #w r h = HS.sel h r.last\nlet expected_pn #k #w r = !r.last\n\nlet footprint #k w = (AEAD.wfootprint w.ae)\n `B.loc_union` (PNE.footprint w.pne)\n `B.loc_union` B.loc_mreference w.ctr\n\nlet rfootprint #k #w r = footprint w `B.loc_union` B.loc_mreference r.last\n\nlet frame_invariant #k w h0 l h1 =\n AEAD.wframe_invariant l w.ae h0 h1;\n PNE.frame_invariant w.pne l h0 h1;\n if safe k then AEAD.frame_log l w.ae h0 h1\n\nlet rframe_invariant #k #w r h0 l h1 =\n AEAD.wframe_invariant l w.ae h0 h1;\n PNE.frame_invariant w.pne l h0 h1\n\nlet wframe_log #k w t h0 l h1 =\n AEAD.frame_log l w.ae h0 h1\n \nlet rframe_log #k #w r t h0 l h1 =\n AEAD.frame_log l w.ae h0 h1\n\nlet wframe_pnlog #k w t h0 l h1 =\n PNE.frame_table w.pne l h0 h1\n\nlet rframe_pnlog #k #w r t h0 l h1 =\n PNE.frame_table w.pne l h0 h1\n\n(* HACK, the interleaving of `val coerce` into this file fails to verify\nwithout increasing the rlimit, but increasing it in the fsti wouldn't\ntake effect here (see FStar issue #2854 and the others linked from\nthere. So, increase rlimit here and pop it after `let coerce`, so we are\nsure to catch it. *)\n#push-options \"--z3rlimit 40\"\n\nlet create k u u1 u2 init =\n let open Model.Helpers in\n let alg = u1.AEAD.alg in\n let siv = random 12 in\n (**) let h0 = get() in\n let ae = AEAD.gen (dfst k) u1 in\n (**) let h1 = get () in \n let pne = PNE.create (dsnd k) u2 in\n (**) let h2 = get () in\n let ctr = ralloc u.region init in\n (**) let h3 = get () in \n (**) AEAD.wframe_invariant M.loc_none ae h1 h3;\n (**) PNE.frame_invariant pne M.loc_none h2 h3;\n if safe k then\n begin\n (**) AEAD.frame_log M.loc_none ae h1 h3;\n (**) PNE.frame_table pne M.loc_none h2 h3\n end;\n Writer u init (reveal siv) ae u2 pne ctr\n\nlet coerce k u u1 u2 init ts =\n let open Model.Helpers in\n let alg = u1.AEAD.alg in\n let siv : Model.Helpers.lbytes 12 = Spec.derive_secret u1.AEAD.halg ts Spec.label_iv 12 in\n let h0 = get() in\n let u1 : AEAD.info (dfst k) = u1 in\n let ae = AEAD.quic_coerce u1 ts in\n let h1 = get () in\n let pne = PNE.quic_coerce (dsnd k) u2 ts in\n let h2 = get () in\n let ctr = ralloc u.region init in\n let h3 = get () in \n AEAD.wframe_invariant M.loc_none ae h1 h3;\n PNE.frame_invariant pne M.loc_none h2 h3;\n Writer u init (reveal siv) ae u2 pne ctr\n\n#push-options \"--z3rlimit 400 --query_stats\"\n\nlet createReader rgn #k w =\n let h0 = get () in\n let last = ralloc rgn (writer_offset w) in\n let h1 = get () in\n frame_invariant w h0 M.loc_none h1;\n let aer = AEAD.gen_reader w.ae in\n Reader aer last\n\n(* Another HACK: set_pn gets interleaved here *)\n\n#pop-options\n#pop-options\n\n#push-options \"--z3rlimit 256 --fuel 0\"\nprivate let lemma_eq_add (a b c:nat) : Lemma (requires a == b - c)\n (ensures a + c == b) = ()\n\nlet set_pne (h:Spec.header) (#ln:pnl) (pne:PNE.pne_cipher ln) (c1:Spec.bytes)\n : Pure Spec.packet\n (requires not (Spec.is_retry h) /\\ ln == Lib.RawIntTypes.uint_to_nat (TSpec.pn_length h) /\\\n Seq.length c1 < pow2 32 - Spec.header_len_bound)", "dependencies": { "source_file": "Model.QUIC.fst", "checked_file": "Model.QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.UInt.fst.checked", "QUIC.TotSpec.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 256, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header -> pne: Model.PNE.pne_cipher ln -> c1: QUIC.Spec.Base.bytes\n -> Prims.Pure QUIC.Spec.Crypto.packet", "effect": "Prims.Pure", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "Model.QUIC.pnl", "Model.PNE.pne_cipher", "QUIC.Spec.Base.bytes", "Model.Helpers.lbytes", "Model.PNE.bits", "Prims.unit", "Prims._assert", "Prims.eq2", "Prims.int", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "Prims.op_Addition", "FStar.Seq.Base.seq", "FStar.Seq.Properties.cons", "FStar.UInt8.uint_to_t", "FStar.Seq.Base.append", "FStar.Seq.Base.slice", "Model.Helpers.reveal", "FStar.UInt.uint_t", "LowParse.BitFields.set_bitfield", "FStar.UInt8.n", "FStar.UInt8.v", "FStar.Seq.Base.index", "LowParse.BitFields.get_bitfield", "FStar.UInt.logxor", "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "QUIC.Spec.Header.Base.uu___is_MShort", "Prims.bool", "Lib.IntTypes.uint8", "QUIC.Spec.Base.header_len_bound", "Prims.op_Subtraction", "QUIC.Spec.Header.Parse.pn_offset", "QUIC.TotSpec.pn_offset", "QUIC.Spec.Header.Parse.format_header", "QUIC.TotSpec.format_header", "QUIC.Spec.Crypto.packet", "Prims.op_Negation", "QUIC.Spec.Header.Base.is_retry", "Prims.l_or", "Prims.op_GreaterThanOrEqual", "Prims.op_Equality", "Lib.IntTypes.range", "Lib.IntTypes.U32", "Lib.IntTypes.uint_v", "Lib.IntTypes.SEC", "QUIC.Spec.Header.Base.pn_length", "Lib.RawIntTypes.uint_to_nat", "Prims.op_LessThan", "Prims.pow2", "Prims.l_True" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val set_pne (h: Spec.header) (#ln: pnl) (pne: PNE.pne_cipher ln) (c1: Spec.bytes)\n : Pure Spec.packet\n (requires\n not (Spec.is_retry h) /\\ ln == Lib.RawIntTypes.uint_to_nat (TSpec.pn_length h) /\\\n Seq.length c1 < pow2 32 - Spec.header_len_bound)\n (ensures fun r -> True)\nlet set_pne (h: Spec.header) (#ln: pnl) (pne: PNE.pne_cipher ln) (c1: Spec.bytes)\n : Pure Spec.packet\n (requires\n not (Spec.is_retry h) /\\ ln == Lib.RawIntTypes.uint_to_nat (TSpec.pn_length h) /\\\n Seq.length c1 < pow2 32 - Spec.header_len_bound)\n (ensures fun r -> True) =", "completed_definiton": "let pne, bits = pne in\nlet r = TSpec.format_header h in\nlet pno = TSpec.pn_offset h in\nassert (pno == Seq.length r - ln);\nassert (Seq.length r <= Spec.header_len_bound);\nassert (ln == Seq.length pne);\nlet protected_bits = if Spec.MShort? h then 5 else 4 in\nlet f' =\n BF.set_bitfield (U8.v (Seq.index r 0))\n 0\n protected_bits\n (BF.get_bitfield ((U8.v (Seq.index r 0)) `FStar.UInt.logxor` bits) 0 protected_bits)\nin\nlet r' =\n Seq.cons (U8.uint_to_t f')\n (((Seq.slice r 1 pno) `Seq.append` (Helpers.reveal pne)) `Seq.append` c1)\nin\nassert (Seq.length r' == Seq.length r + Seq.length c1);\nr'", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.parse32_public_header", "original_source_type": "val parse32_public_header (short_dcid_len: short_dcid_len_t)\n : Tot (LP.parser32 (Public.parse_header short_dcid_len))", "source_type": "val parse32_public_header (short_dcid_len: short_dcid_len_t)\n : Tot (LP.parser32 (Public.parse_header short_dcid_len))", "source_definition": "let parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 260, "start_col": 2, "end_line": 267, "end_col": 40 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "short_dcid_len: QUIC.Spec.Base.short_dcid_len_t\n -> LowParse.SLow.Base.parser32 (QUIC.Spec.Header.Public.parse_header short_dcid_len)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "LowParse.SLow.BitSum.parse32_bitsum", "LowParse.Spec.Int.parse_u8_kind", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.first_byte_of_header", "QUIC.Spec.Header.Public.header_body_type", "QUIC.Spec.Header.Public.header_synth", "LowParse.Spec.Int.parse_u8", "LowParse.SLow.Int.parse32_u8", "QUIC.Spec.Header.Public.parse_header_body", "QUIC.TotSpec.parse32_header_body", "LowParse.SLow.Base.parser32", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse32_public_header (short_dcid_len: short_dcid_len_t)\n : Tot (LP.parser32 (Public.parse_header short_dcid_len))\nlet parse32_public_header (short_dcid_len: short_dcid_len_t)\n : Tot (LP.parser32 (Public.parse_header short_dcid_len)) =", "completed_definiton": "LPB.parse32_bitsum Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.parse32_packet_number", "original_source_type": "val parse32_packet_number (last: PN.last_packet_number_t) (pn_len: PN.packet_number_length_t)\n : Tot (LP.parser32 (PN.parse_packet_number last pn_len))", "source_type": "val parse32_packet_number (last: PN.last_packet_number_t) (pn_len: PN.packet_number_length_t)\n : Tot (LP.parser32 (PN.parse_packet_number last pn_len))", "source_definition": "let parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 172, "start_col": 2, "end_line": 177, "end_col": 6 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t\n -> LowParse.SLow.Base.parser32 (QUIC.Spec.PacketNumber.parse_packet_number last pn_len)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "LowParse.SLow.Combinators.parse32_synth", "QUIC.Spec.PacketNumber.parse_packet_number_kind", "LowParse.Spec.BoundedInt.bounded_integer", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "LowParse.Spec.Combinators.lift_parser", "QUIC.Spec.PacketNumber.parse_reduced_pn", "QUIC.Spec.PacketNumber.synth_packet_number", "QUIC.TotSpec.synth_packet_number'", "LowParse.SLow.Combinators.lift_parser32", "QUIC.TotSpec.parse32_reduced_pn", "LowParse.SLow.Base.parser32", "QUIC.Spec.PacketNumber.parse_packet_number" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse32_packet_number (last: PN.last_packet_number_t) (pn_len: PN.packet_number_length_t)\n : Tot (LP.parser32 (PN.parse_packet_number last pn_len))\nlet parse32_packet_number (last: PN.last_packet_number_t) (pn_len: PN.packet_number_length_t)\n : Tot (LP.parser32 (PN.parse_packet_number last pn_len)) =", "completed_definiton": "LP.parse32_synth _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.serialize32_public_header", "original_source_type": "val serialize32_public_header (short_dcid_len: short_dcid_len_t)\n : Tot (LP.serializer32 (Public.serialize_header short_dcid_len))", "source_type": "val serialize32_public_header (short_dcid_len: short_dcid_len_t)\n : Tot (LP.serializer32 (Public.serialize_header short_dcid_len))", "source_definition": "let serialize32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer32 (Public.serialize_header short_dcid_len))\n= LPB.serialize32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.serialize32_u8\n #(Public.parse_header_body short_dcid_len)\n (Public.serialize_header_body short_dcid_len)\n (serialize32_header_body short_dcid_len)\n ()", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 318, "start_col": 2, "end_line": 327, "end_col": 6 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )\n\nlet serialize32_long_retry_body : LP.serializer32 Public.serialize_long_retry_body =\n serialize32_common_long `LP.serialize32_nondep_then` LP.serialize32_bounded_vlbytes 0 20 \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.serialize32_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize32_flbytes (U32.v short_dcid_len))\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n serialize32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n serialize32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n serialize32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n serialize32_long_retry_body\n\n#pop-options\n\nlet serialize32_public_header\n (short_dcid_len: short_dcid_len_t)", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "short_dcid_len: QUIC.Spec.Base.short_dcid_len_t\n -> LowParse.SLow.Base.serializer32 (QUIC.Spec.Header.Public.serialize_header short_dcid_len)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "LowParse.SLow.BitSum.serialize32_bitsum", "LowParse.Spec.Int.parse_u8_kind", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.first_byte_of_header", "QUIC.Spec.Header.Public.header_body_type", "QUIC.Spec.Header.Public.header_synth", "LowParse.Spec.Int.parse_u8", "LowParse.Spec.Int.serialize_u8", "LowParse.SLow.Int.serialize32_u8", "QUIC.Spec.Header.Public.parse_header_body", "QUIC.Spec.Header.Public.serialize_header_body", "QUIC.TotSpec.serialize32_header_body", "LowParse.SLow.Base.serializer32", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize32_public_header (short_dcid_len: short_dcid_len_t)\n : Tot (LP.serializer32 (Public.serialize_header short_dcid_len))\nlet serialize32_public_header (short_dcid_len: short_dcid_len_t)\n : Tot (LP.serializer32 (Public.serialize_header short_dcid_len)) =", "completed_definiton": "LPB.serialize32_bitsum Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.serialize32_u8\n #(Public.parse_header_body short_dcid_len)\n (Public.serialize_header_body short_dcid_len)\n (serialize32_header_body short_dcid_len)\n ()", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.serialize32_packet_number", "original_source_type": "val serialize32_packet_number (last: PN.last_packet_number_t) (pn_len: PN.packet_number_length_t)\n : Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))", "source_type": "val serialize32_packet_number (last: PN.last_packet_number_t) (pn_len: PN.packet_number_length_t)\n : Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))", "source_definition": "let serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 199, "start_col": 2, "end_line": 206, "end_col": 6 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t\n -> LowParse.SLow.Base.serializer32 (QUIC.Spec.PacketNumber.serialize_packet_number last pn_len)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "LowParse.SLow.Combinators.serialize32_synth", "QUIC.Spec.PacketNumber.parse_packet_number_kind", "LowParse.Spec.BoundedInt.bounded_integer", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "LowParse.Spec.Combinators.lift_parser", "QUIC.Spec.PacketNumber.parse_reduced_pn", "QUIC.Spec.PacketNumber.synth_packet_number", "LowParse.Spec.Combinators.lift_serializer", "QUIC.Spec.PacketNumber.serialize_reduced_pn", "LowParse.SLow.Combinators.lift_serializer32", "Lib.RawIntTypes.uint_to_nat", "QUIC.TotSpec.serialize32_reduced_pn", "QUIC.Spec.PacketNumber.synth_packet_number_recip", "QUIC.TotSpec.synth_packet_number_recip'", "LowParse.SLow.Base.serializer32", "QUIC.Spec.PacketNumber.parse_packet_number", "QUIC.Spec.PacketNumber.serialize_packet_number" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize32_packet_number (last: PN.last_packet_number_t) (pn_len: PN.packet_number_length_t)\n : Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\nlet serialize32_packet_number (last: PN.last_packet_number_t) (pn_len: PN.packet_number_length_t)\n : Tot (LP.serializer32 (PN.serialize_packet_number last pn_len)) =", "completed_definiton": "LP.serialize32_synth (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind\n #(LP.bounded_integer (Declassify.uint_to_nat pn_len))\n (PN.parse_reduced_pn pn_len)\n (PN.serialize_reduced_pn pn_len)\n (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.parse32_long_zero_rtt_body", "original_source_type": "val parse32_long_zero_rtt_body:LP.parser32 Public.parse_long_zero_rtt_body", "source_type": "val parse32_long_zero_rtt_body:LP.parser32 Public.parse_long_zero_rtt_body", "source_definition": "let parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 223, "start_col": 2, "end_line": 223, "end_col": 76 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 QUIC.Spec.Header.Public.parse_long_zero_rtt_body", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.TotSpec.parse32_common_long", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "QUIC.TotSpec.parse32_payload_and_pn_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse32_long_zero_rtt_body:LP.parser32 Public.parse_long_zero_rtt_body\nlet parse32_long_zero_rtt_body:LP.parser32 Public.parse_long_zero_rtt_body =", "completed_definiton": "parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.parse32_payload_and_pn_length", "original_source_type": "val parse32_payload_and_pn_length:LP.parser32 Public.parse_payload_and_pn_length", "source_type": "val parse32_payload_and_pn_length:LP.parser32 Public.parse_payload_and_pn_length", "source_definition": "let parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 217, "start_col": 2, "end_line": 220, "end_col": 50 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 QUIC.Spec.Header.Public.parse_payload_and_pn_length", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_filter", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.UInt62.t", "QUIC.Spec.VarInt.parse_varint", "QUIC.TotSpec.parse32_varint", "QUIC.Spec.Header.Public.payload_and_pn_length_prop", "Prims.bool", "Prims.eq2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val parse32_payload_and_pn_length:LP.parser32 Public.parse_payload_and_pn_length\nlet parse32_payload_and_pn_length:LP.parser32 Public.parse_payload_and_pn_length =", "completed_definiton": "LP.parse32_filter parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.parse32_varint", "original_source_type": "val parse32_varint:LP.parser32 VI.parse_varint", "source_type": "val parse32_varint:LP.parser32 VI.parse_varint", "source_definition": "let parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 89, "start_col": 2, "end_line": 91, "end_col": 25 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 QUIC.Spec.VarInt.parse_varint", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Base.bytes32", "QUIC.TotSpec.parse32_varint'", "Prims.unit", "QUIC.TotSpec.parse32_varint'_correct", "FStar.Pervasives.Native.option", "FStar.Pervasives.Native.tuple2", "QUIC.UInt62.t", "FStar.UInt32.t", "LowParse.SLow.Base.parser32_correct", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.VarInt.parse_varint" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val parse32_varint:LP.parser32 VI.parse_varint\nlet parse32_varint:LP.parser32 VI.parse_varint =", "completed_definiton": "fun input ->\n parse32_varint'_correct input;\n parse32_varint' input", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.seq_reveal", "original_source_type": "val seq_reveal (x: Seq.seq Secret.uint8) : Tot (y: Seq.seq byte {y `Seq.equal` (Seq.seq_reveal x)})", "source_type": "val seq_reveal (x: Seq.seq Secret.uint8) : Tot (y: Seq.seq byte {y `Seq.equal` (Seq.seq_reveal x)})", "source_definition": "let seq_reveal\n (x: Seq.seq Secret.uint8)\n: Tot (y: Seq.seq byte { y `Seq.equal` Seq.seq_reveal x })\n= seq_reveal' x Seq.empty", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 463, "start_col": 2, "end_line": 463, "end_col": 25 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )\n\nlet serialize32_long_retry_body : LP.serializer32 Public.serialize_long_retry_body =\n serialize32_common_long `LP.serialize32_nondep_then` LP.serialize32_bounded_vlbytes 0 20 \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.serialize32_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize32_flbytes (U32.v short_dcid_len))\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n serialize32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n serialize32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n serialize32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n serialize32_long_retry_body\n\n#pop-options\n\nlet serialize32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer32 (Public.serialize_header short_dcid_len))\n= LPB.serialize32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.serialize32_u8\n #(Public.parse_header_body short_dcid_len)\n (Public.serialize_header_body short_dcid_len)\n (serialize32_header_body short_dcid_len)\n ()\n\n#push-options \"--z3rlimit 64\"\n\nlet lp_parse32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser32 (Parse.lp_parse_header short_dcid_len last))\n= fun x ->\n Parse.lp_parse_header_eq short_dcid_len last (B32.reveal x); ((\n match parse32_public_header short_dcid_len x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (Parse.synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n LP.parser32_consumes (parse32_public_header short_dcid_len) x;\n assert (U32.v consumed <= B32.length x);\n match parse32_packet_number last (Parse.get_pn_length ph) (B32.slice x consumed (B32.len x)) with\n | None -> None\n | Some (pn, consumed') ->\n Some (Parse.synth_header short_dcid_len last (| ph, pn |), consumed `U32.add` consumed')\n end\n ) <: (y: _ { LP.parser32_correct (Parse.lp_parse_header short_dcid_len last) x y } ))\n\n#pop-options\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 5 { y == Parse.mk_short_protected_bits reserved_bits key_phase pnl })\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 4 { y == Parse.mk_long_protected_bits reserved_bits pnl })\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2\n (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))\n ) 2 4 reserved_bits\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: Parse.header' short_dcid_len last)\n: Tot (y: dtuple2 (Public.header' short_dcid_len) (Parse.packet_number_opt short_dcid_len last) { y == Parse.synth_header_recip short_dcid_len last x })\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n Parse.mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\n#push-options \"--z3rlimit 128\"\n\n#restart-solver\n\nlet serialize32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer32 (Parse.serialize_header short_dcid_len last))\n= fun h ->\n Parse.serialize_header_eq short_dcid_len last h;\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n serialize32_public_header short_dcid_len ph `B32.append`\n (if is_retry h\n then B32.empty_bytes\n else serialize32_packet_number last (pn_length h) pn)\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet parse_header\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (b:bytes)\n: Tot (r: Parse.h_result { r == Parse.parse_header cid_len last b })\n= match LP.parse_tot_seq_of_parser32 (lp_parse32_header (U32.uint_to_t cid_len) (Secret.to_u64 (U64.uint_to_t last))) b with\n | None -> Parse.H_Failure\n | Some (h, consumed) -> Parse.H_Success h (Seq.slice b consumed (Seq.length b))\n\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet last_packet_number\n (h: header)\n: Tot (y: PN.last_packet_number_t { y == Parse.last_packet_number h })\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in\n if Declassify.uint_to_nat pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\n[@\"opaque_to_smt\"]\nlet format_header\n (h: header)\n: Tot (y: bytes { y == Parse.format_header h })\n=\n Parse.in_window_last_packet_number h;\n LP.serialize_tot_seq_of_serializer32 (serialize32_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\n(* header protection *)\n\n[@\"opaque_to_smt\"]\nirreducible\nlet rec seq_reveal'\n (x: Seq.seq Secret.uint8)\n (accu: Seq.seq byte)\n: Tot (y: Seq.seq byte { y `Seq.equal` (accu `Seq.append` Seq.seq_reveal x) })\n (decreases (Seq.length x))\n= if Seq.length x = 0\n then accu\n else (seq_reveal' (Seq.slice x 1 (Seq.length x)) (Seq.append accu (Seq.create 1 (Declassify.u8_to_UInt8 (Seq.index x 0)))) <: Seq.seq byte)\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet seq_reveal\n (x: Seq.seq Secret.uint8)", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: FStar.Seq.Base.seq Lib.IntTypes.uint8\n -> y:\n FStar.Seq.Base.seq QUIC.Spec.Base.byte {FStar.Seq.Base.equal y (QUIC.Secret.Seq.seq_reveal x)}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Lib.IntTypes.uint8", "QUIC.TotSpec.seq_reveal'", "FStar.Seq.Base.empty", "QUIC.Spec.Base.byte", "FStar.Seq.Base.equal", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.U8", "Lib.IntTypes.SEC" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val seq_reveal (x: Seq.seq Secret.uint8) : Tot (y: Seq.seq byte {y `Seq.equal` (Seq.seq_reveal x)})\nlet seq_reveal (x: Seq.seq Secret.uint8) : Tot (y: Seq.seq byte {y `Seq.equal` (Seq.seq_reveal x)}) =", "completed_definiton": "seq_reveal' x Seq.empty", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.serialize32_payload_and_pn_length", "original_source_type": "val serialize32_payload_and_pn_length:LP.serializer32 Public.serialize_payload_and_pn_length", "source_type": "val serialize32_payload_and_pn_length:LP.serializer32 Public.serialize_payload_and_pn_length", "source_definition": "let serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 276, "start_col": 2, "end_line": 278, "end_col": 37 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 QUIC.Spec.Header.Public.serialize_payload_and_pn_length", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_filter", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.UInt62.t", "QUIC.Spec.VarInt.parse_varint", "QUIC.Spec.VarInt.serialize_varint", "QUIC.TotSpec.serialize32_varint", "QUIC.Spec.Header.Public.payload_and_pn_length_prop" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val serialize32_payload_and_pn_length:LP.serializer32 Public.serialize_payload_and_pn_length\nlet serialize32_payload_and_pn_length:LP.serializer32 Public.serialize_payload_and_pn_length =", "completed_definiton": "LP.serialize32_filter serialize32_varint Public.payload_and_pn_length_prop", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.parse32_common_long", "original_source_type": "val parse32_common_long:LP.parser32 Public.parse_common_long", "source_type": "val parse32_common_long:LP.parser32 Public.parse_common_long", "source_definition": "let parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 211, "start_col": 2, "end_line": 214, "end_col": 3 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 QUIC.Spec.Header.Public.parse_common_long", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_nondep_then", "LowParse.Spec.Int.parse_u32_kind", "FStar.UInt32.t", "LowParse.Spec.Int.parse_u32", "LowParse.SLow.Int.parse32_u32", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Bytes.parse_bounded_vlbytes", "LowParse.SLow.Bytes.parse32_bounded_vlbytes", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse32_common_long:LP.parser32 Public.parse_common_long\nlet parse32_common_long:LP.parser32 Public.parse_common_long =", "completed_definiton": "LP.parse32_u32\n`LP.parse32_nondep_then`\n((LP.parse32_bounded_vlbytes 0 0ul 20 20ul)\n `LP.parse32_nondep_then`\n (LP.parse32_bounded_vlbytes 0 0ul 20 20ul))", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.putative_pn_offset", "original_source_type": "val putative_pn_offset (cid_len: nat) (x: bytes)\n : Tot (y: option nat {y == Parse.putative_pn_offset cid_len x})", "source_type": "val putative_pn_offset (cid_len: nat) (x: bytes)\n : Tot (y: option nat {y == Parse.putative_pn_offset cid_len x})", "source_definition": "let putative_pn_offset\n (cid_len: nat)\n (x: bytes)\n: Tot (y: option nat { y == Parse.putative_pn_offset cid_len x })\n= if cid_len > 20\n then None\n else\n match LP.parse_tot_seq_of_parser32 (parse32_public_header (U32.uint_to_t cid_len)) x with\n | None -> None\n | Some (_, consumed) ->\n LP.parser_kind_prop_equiv (Public.parse_header_kind (U32.uint_to_t cid_len)) (Public.parse_header (U32.uint_to_t cid_len));\n Some (consumed <: nat)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 530, "start_col": 2, "end_line": 537, "end_col": 28 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )\n\nlet serialize32_long_retry_body : LP.serializer32 Public.serialize_long_retry_body =\n serialize32_common_long `LP.serialize32_nondep_then` LP.serialize32_bounded_vlbytes 0 20 \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.serialize32_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize32_flbytes (U32.v short_dcid_len))\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n serialize32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n serialize32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n serialize32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n serialize32_long_retry_body\n\n#pop-options\n\nlet serialize32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer32 (Public.serialize_header short_dcid_len))\n= LPB.serialize32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.serialize32_u8\n #(Public.parse_header_body short_dcid_len)\n (Public.serialize_header_body short_dcid_len)\n (serialize32_header_body short_dcid_len)\n ()\n\n#push-options \"--z3rlimit 64\"\n\nlet lp_parse32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser32 (Parse.lp_parse_header short_dcid_len last))\n= fun x ->\n Parse.lp_parse_header_eq short_dcid_len last (B32.reveal x); ((\n match parse32_public_header short_dcid_len x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (Parse.synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n LP.parser32_consumes (parse32_public_header short_dcid_len) x;\n assert (U32.v consumed <= B32.length x);\n match parse32_packet_number last (Parse.get_pn_length ph) (B32.slice x consumed (B32.len x)) with\n | None -> None\n | Some (pn, consumed') ->\n Some (Parse.synth_header short_dcid_len last (| ph, pn |), consumed `U32.add` consumed')\n end\n ) <: (y: _ { LP.parser32_correct (Parse.lp_parse_header short_dcid_len last) x y } ))\n\n#pop-options\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 5 { y == Parse.mk_short_protected_bits reserved_bits key_phase pnl })\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 4 { y == Parse.mk_long_protected_bits reserved_bits pnl })\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2\n (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))\n ) 2 4 reserved_bits\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: Parse.header' short_dcid_len last)\n: Tot (y: dtuple2 (Public.header' short_dcid_len) (Parse.packet_number_opt short_dcid_len last) { y == Parse.synth_header_recip short_dcid_len last x })\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n Parse.mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\n#push-options \"--z3rlimit 128\"\n\n#restart-solver\n\nlet serialize32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer32 (Parse.serialize_header short_dcid_len last))\n= fun h ->\n Parse.serialize_header_eq short_dcid_len last h;\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n serialize32_public_header short_dcid_len ph `B32.append`\n (if is_retry h\n then B32.empty_bytes\n else serialize32_packet_number last (pn_length h) pn)\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet parse_header\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (b:bytes)\n: Tot (r: Parse.h_result { r == Parse.parse_header cid_len last b })\n= match LP.parse_tot_seq_of_parser32 (lp_parse32_header (U32.uint_to_t cid_len) (Secret.to_u64 (U64.uint_to_t last))) b with\n | None -> Parse.H_Failure\n | Some (h, consumed) -> Parse.H_Success h (Seq.slice b consumed (Seq.length b))\n\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet last_packet_number\n (h: header)\n: Tot (y: PN.last_packet_number_t { y == Parse.last_packet_number h })\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in\n if Declassify.uint_to_nat pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\n[@\"opaque_to_smt\"]\nlet format_header\n (h: header)\n: Tot (y: bytes { y == Parse.format_header h })\n=\n Parse.in_window_last_packet_number h;\n LP.serialize_tot_seq_of_serializer32 (serialize32_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\n(* header protection *)\n\n[@\"opaque_to_smt\"]\nirreducible\nlet rec seq_reveal'\n (x: Seq.seq Secret.uint8)\n (accu: Seq.seq byte)\n: Tot (y: Seq.seq byte { y `Seq.equal` (accu `Seq.append` Seq.seq_reveal x) })\n (decreases (Seq.length x))\n= if Seq.length x = 0\n then accu\n else (seq_reveal' (Seq.slice x 1 (Seq.length x)) (Seq.append accu (Seq.create 1 (Declassify.u8_to_UInt8 (Seq.index x 0)))) <: Seq.seq byte)\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet seq_reveal\n (x: Seq.seq Secret.uint8)\n: Tot (y: Seq.seq byte { y `Seq.equal` Seq.seq_reveal x })\n= seq_reveal' x Seq.empty\n\n[@\"opaque_to_smt\"]\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: Tot (y: Seq.lseq Secret.uint8 16 { y == Header.block_of_sample a k sample })\n=\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet pn_offset\n (h: header { ~ (is_retry h) })\n: Tot (y: nat { y == Parse.pn_offset h })\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Seq.length (LP.serialize_tot_seq_of_serializer32 (serialize32_public_header cid_len) ph)\n\n#push-options \"--z3rlimit 32\"\nlet header_encrypt\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n: Tot (b: bytes { b == Header.header_encrypt a hpk h c })\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = format_header h `Seq.append` c in\n if is_retry h\n then\n r\n else\n let pn_offset = pn_offset h in\n let pn_len = Declassify.uint_to_nat (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Header.pn_sizemask pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet putative_pn_offset\n (cid_len: nat)\n (x: bytes)", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "cid_len: Prims.nat -> x: QUIC.Spec.Base.bytes\n -> y:\n FStar.Pervasives.Native.option Prims.nat\n {y == QUIC.Spec.Header.Parse.putative_pn_offset cid_len x}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "QUIC.Spec.Base.bytes", "Prims.op_GreaterThan", "FStar.Pervasives.Native.None", "Prims.bool", "LowParse.SLow.Base.parse_tot_seq_of_parser32", "QUIC.Spec.Header.Public.parse_header_kind", "FStar.UInt32.uint_to_t", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Public.parse_header", "QUIC.TotSpec.parse32_public_header", "LowParse.Spec.Base.consumed_length", "FStar.Pervasives.Native.Some", "Prims.unit", "LowParse.Spec.Base.parser_kind_prop_equiv", "FStar.Pervasives.Native.option", "Prims.eq2", "QUIC.Spec.Header.Parse.putative_pn_offset" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val putative_pn_offset (cid_len: nat) (x: bytes)\n : Tot (y: option nat {y == Parse.putative_pn_offset cid_len x})\nlet putative_pn_offset (cid_len: nat) (x: bytes)\n : Tot (y: option nat {y == Parse.putative_pn_offset cid_len x}) =", "completed_definiton": "if cid_len > 20\nthen None\nelse\n match LP.parse_tot_seq_of_parser32 (parse32_public_header (U32.uint_to_t cid_len)) x with\n | None -> None\n | Some (_, consumed) ->\n LP.parser_kind_prop_equiv (Public.parse_header_kind (U32.uint_to_t cid_len))\n (Public.parse_header (U32.uint_to_t cid_len));\n Some (consumed <: nat)", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.parse32_long_handshake_body", "original_source_type": "val parse32_long_handshake_body:LP.parser32 Public.parse_long_handshake_body", "source_type": "val parse32_long_handshake_body:LP.parser32 Public.parse_long_handshake_body", "source_definition": "let parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 226, "start_col": 2, "end_line": 226, "end_col": 76 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 QUIC.Spec.Header.Public.parse_long_handshake_body", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.TotSpec.parse32_common_long", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "QUIC.TotSpec.parse32_payload_and_pn_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse32_long_handshake_body:LP.parser32 Public.parse_long_handshake_body\nlet parse32_long_handshake_body:LP.parser32 Public.parse_long_handshake_body =", "completed_definiton": "parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.iv_for_encrypt_decrypt", "original_source_type": "val iv_for_encrypt_decrypt (a: ea) (siv: Spec.iv_t a) (h: header{~(is_retry h)})\n : Tot (y: Spec.iv_t a {y == Spec.iv_for_encrypt_decrypt a siv h})", "source_type": "val iv_for_encrypt_decrypt (a: ea) (siv: Spec.iv_t a) (h: header{~(is_retry h)})\n : Tot (y: Spec.iv_t a {y == Spec.iv_for_encrypt_decrypt a siv h})", "source_definition": "let iv_for_encrypt_decrypt\n (a: ea)\n (siv: Spec.iv_t a)\n (h: header { ~ (is_retry h) })\n: Tot (y: Spec.iv_t a { y == Spec.iv_for_encrypt_decrypt a siv h })\n=\n let pn_len = Declassify.uint_to_nat (pn_length h) - 1 in\n let seqn = packet_number h in\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pnb = FStar.Endianness.n_to_be 12 (Declassify.uint_to_nat seqn) in\n Seq.seq_hide #Secret.U8 (Lemmas.xor_inplace pnb (seq_reveal siv) 0)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 644, "start_col": 1, "end_line": 649, "end_col": 69 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )\n\nlet serialize32_long_retry_body : LP.serializer32 Public.serialize_long_retry_body =\n serialize32_common_long `LP.serialize32_nondep_then` LP.serialize32_bounded_vlbytes 0 20 \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.serialize32_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize32_flbytes (U32.v short_dcid_len))\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n serialize32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n serialize32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n serialize32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n serialize32_long_retry_body\n\n#pop-options\n\nlet serialize32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer32 (Public.serialize_header short_dcid_len))\n= LPB.serialize32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.serialize32_u8\n #(Public.parse_header_body short_dcid_len)\n (Public.serialize_header_body short_dcid_len)\n (serialize32_header_body short_dcid_len)\n ()\n\n#push-options \"--z3rlimit 64\"\n\nlet lp_parse32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser32 (Parse.lp_parse_header short_dcid_len last))\n= fun x ->\n Parse.lp_parse_header_eq short_dcid_len last (B32.reveal x); ((\n match parse32_public_header short_dcid_len x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (Parse.synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n LP.parser32_consumes (parse32_public_header short_dcid_len) x;\n assert (U32.v consumed <= B32.length x);\n match parse32_packet_number last (Parse.get_pn_length ph) (B32.slice x consumed (B32.len x)) with\n | None -> None\n | Some (pn, consumed') ->\n Some (Parse.synth_header short_dcid_len last (| ph, pn |), consumed `U32.add` consumed')\n end\n ) <: (y: _ { LP.parser32_correct (Parse.lp_parse_header short_dcid_len last) x y } ))\n\n#pop-options\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 5 { y == Parse.mk_short_protected_bits reserved_bits key_phase pnl })\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 4 { y == Parse.mk_long_protected_bits reserved_bits pnl })\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2\n (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))\n ) 2 4 reserved_bits\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: Parse.header' short_dcid_len last)\n: Tot (y: dtuple2 (Public.header' short_dcid_len) (Parse.packet_number_opt short_dcid_len last) { y == Parse.synth_header_recip short_dcid_len last x })\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n Parse.mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\n#push-options \"--z3rlimit 128\"\n\n#restart-solver\n\nlet serialize32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer32 (Parse.serialize_header short_dcid_len last))\n= fun h ->\n Parse.serialize_header_eq short_dcid_len last h;\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n serialize32_public_header short_dcid_len ph `B32.append`\n (if is_retry h\n then B32.empty_bytes\n else serialize32_packet_number last (pn_length h) pn)\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet parse_header\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (b:bytes)\n: Tot (r: Parse.h_result { r == Parse.parse_header cid_len last b })\n= match LP.parse_tot_seq_of_parser32 (lp_parse32_header (U32.uint_to_t cid_len) (Secret.to_u64 (U64.uint_to_t last))) b with\n | None -> Parse.H_Failure\n | Some (h, consumed) -> Parse.H_Success h (Seq.slice b consumed (Seq.length b))\n\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet last_packet_number\n (h: header)\n: Tot (y: PN.last_packet_number_t { y == Parse.last_packet_number h })\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in\n if Declassify.uint_to_nat pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\n[@\"opaque_to_smt\"]\nlet format_header\n (h: header)\n: Tot (y: bytes { y == Parse.format_header h })\n=\n Parse.in_window_last_packet_number h;\n LP.serialize_tot_seq_of_serializer32 (serialize32_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\n(* header protection *)\n\n[@\"opaque_to_smt\"]\nirreducible\nlet rec seq_reveal'\n (x: Seq.seq Secret.uint8)\n (accu: Seq.seq byte)\n: Tot (y: Seq.seq byte { y `Seq.equal` (accu `Seq.append` Seq.seq_reveal x) })\n (decreases (Seq.length x))\n= if Seq.length x = 0\n then accu\n else (seq_reveal' (Seq.slice x 1 (Seq.length x)) (Seq.append accu (Seq.create 1 (Declassify.u8_to_UInt8 (Seq.index x 0)))) <: Seq.seq byte)\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet seq_reveal\n (x: Seq.seq Secret.uint8)\n: Tot (y: Seq.seq byte { y `Seq.equal` Seq.seq_reveal x })\n= seq_reveal' x Seq.empty\n\n[@\"opaque_to_smt\"]\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: Tot (y: Seq.lseq Secret.uint8 16 { y == Header.block_of_sample a k sample })\n=\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet pn_offset\n (h: header { ~ (is_retry h) })\n: Tot (y: nat { y == Parse.pn_offset h })\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Seq.length (LP.serialize_tot_seq_of_serializer32 (serialize32_public_header cid_len) ph)\n\n#push-options \"--z3rlimit 32\"\nlet header_encrypt\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n: Tot (b: bytes { b == Header.header_encrypt a hpk h c })\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = format_header h `Seq.append` c in\n if is_retry h\n then\n r\n else\n let pn_offset = pn_offset h in\n let pn_len = Declassify.uint_to_nat (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Header.pn_sizemask pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet putative_pn_offset\n (cid_len: nat)\n (x: bytes)\n: Tot (y: option nat { y == Parse.putative_pn_offset cid_len x })\n= if cid_len > 20\n then None\n else\n match LP.parse_tot_seq_of_parser32 (parse32_public_header (U32.uint_to_t cid_len)) x with\n | None -> None\n | Some (_, consumed) ->\n LP.parser_kind_prop_equiv (Public.parse_header_kind (U32.uint_to_t cid_len)) (Public.parse_header (U32.uint_to_t cid_len));\n Some (consumed <: nat)\n\n[@\"opaque_to_smt\"]\nlet header_decrypt_aux\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Tot (y: option Header.header_decrypt_aux_t { y == Header.header_decrypt_aux a hpk cid_len packet })\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n Header.is_short = is_short;\n Header.is_retry = is_retry;\n Header.packet = packet;\n Header.pn_offset = ();\n Header.pn_len = ();\n })\n else\n match putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset+16)) in\n let mask = seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Header.pn_sizemask pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n Header.is_short = is_short;\n Header.is_retry = is_retry;\n Header.packet = packet'';\n Header.pn_offset = pn_offset;\n Header.pn_len = pn_len;\n })\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet header_decrypt\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (packet: packet)\n: Tot (r: Header.h_result { r == Header.header_decrypt a hpk cid_len last packet })\n=\n let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then Header.H_Failure\n else\n match header_decrypt_aux a hpk cid_len packet with\n | None -> Header.H_Failure\n | Some r ->\n let packet'' = r.Header.packet in\n begin match parse_header cid_len last packet'' with\n | Parse.H_Failure -> Header.H_Failure\n | Parse.H_Success h rem' ->\n Header.header_decrypt_aux_post_parse a hpk cid_len last packet;\n if is_retry h\n then\n Header.H_Success h Seq.empty rem'\n else\n let clen = if has_payload_length h then Declassify.uint_to_nat (payload_length h) else Seq.length rem' in\n assert_norm (16 < max_cipher_length - 1);\n (* payload_length is secret, so, to stay constant-time, we\n must not check for failure. Instead, we compute some length\n that might be garbage if bounds on payload_length do not hold. *)\n let clen = Header.max (Header.min (Header.min clen (Seq.length rem')) (max_cipher_length - 1)) 16 in\n assert (clen < max_cipher_length);\n assert (clen <= Seq.length rem');\n assert (16 <= clen);\n let c = Seq.slice rem' 0 clen in\n let rem = Seq.slice rem' clen (Seq.length rem') in\n Header.H_Success h c rem\n end\n\n#pop-options\n\n(* header and packet protection *)\n\n[@\"opaque_to_smt\"]\nlet iv_for_encrypt_decrypt\n (a: ea)\n (siv: Spec.iv_t a)\n (h: header { ~ (is_retry h) })", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n siv: QUIC.Spec.iv_t a ->\n h: QUIC.Spec.Header.Base.header{~(QUIC.Spec.Header.Base.is_retry h)}\n -> y: QUIC.Spec.iv_t a {y == QUIC.Spec.iv_for_encrypt_decrypt a siv h}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "QUIC.Spec.iv_t", "QUIC.Spec.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Spec.Header.Base.is_retry", "QUIC.Secret.Seq.seq_hide", "Lib.IntTypes.U8", "QUIC.Spec.Lemmas.xor_inplace", "QUIC.TotSpec.seq_reveal", "FStar.Endianness.bytes", "Prims.l_and", "Prims.eq2", "Prims.nat", "FStar.Seq.Base.length", "FStar.UInt8.t", "Lib.RawIntTypes.uint_to_nat", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "FStar.Endianness.be_to_n", "FStar.Endianness.n_to_be", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.op_LessThan", "Prims.pow2", "Prims.op_Multiply", "QUIC.Spec.PacketNumber.Base.packet_number_t", "QUIC.Spec.Header.Base.packet_number", "Prims.int", "Prims.op_Subtraction", "Lib.IntTypes.U32", "QUIC.Spec.Header.Base.pn_length", "QUIC.Spec.iv_for_encrypt_decrypt" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val iv_for_encrypt_decrypt (a: ea) (siv: Spec.iv_t a) (h: header{~(is_retry h)})\n : Tot (y: Spec.iv_t a {y == Spec.iv_for_encrypt_decrypt a siv h})\nlet iv_for_encrypt_decrypt (a: ea) (siv: Spec.iv_t a) (h: header{~(is_retry h)})\n : Tot (y: Spec.iv_t a {y == Spec.iv_for_encrypt_decrypt a siv h}) =", "completed_definiton": "let pn_len = Declassify.uint_to_nat (pn_length h) - 1 in\nlet seqn = packet_number h in\nlet _ = assert_norm (pow2 62 < pow2 (8 `op_Multiply` 12)) in\nlet pnb = FStar.Endianness.n_to_be 12 (Declassify.uint_to_nat seqn) in\nSeq.seq_hide #Secret.U8 (Lemmas.xor_inplace pnb (seq_reveal siv) 0)", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.seq_reveal'", "original_source_type": "val seq_reveal' (x: Seq.seq Secret.uint8) (accu: Seq.seq byte)\n : Tot (y: Seq.seq byte {y `Seq.equal` (accu `Seq.append` (Seq.seq_reveal x))})\n (decreases (Seq.length x))", "source_type": "val seq_reveal' (x: Seq.seq Secret.uint8) (accu: Seq.seq byte)\n : Tot (y: Seq.seq byte {y `Seq.equal` (accu `Seq.append` (Seq.seq_reveal x))})\n (decreases (Seq.length x))", "source_definition": "let rec seq_reveal'\n (x: Seq.seq Secret.uint8)\n (accu: Seq.seq byte)\n: Tot (y: Seq.seq byte { y `Seq.equal` (accu `Seq.append` Seq.seq_reveal x) })\n (decreases (Seq.length x))\n= if Seq.length x = 0\n then accu\n else (seq_reveal' (Seq.slice x 1 (Seq.length x)) (Seq.append accu (Seq.create 1 (Declassify.u8_to_UInt8 (Seq.index x 0)))) <: Seq.seq byte)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 454, "start_col": 2, "end_line": 456, "end_col": 141 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )\n\nlet serialize32_long_retry_body : LP.serializer32 Public.serialize_long_retry_body =\n serialize32_common_long `LP.serialize32_nondep_then` LP.serialize32_bounded_vlbytes 0 20 \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.serialize32_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize32_flbytes (U32.v short_dcid_len))\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n serialize32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n serialize32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n serialize32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n serialize32_long_retry_body\n\n#pop-options\n\nlet serialize32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer32 (Public.serialize_header short_dcid_len))\n= LPB.serialize32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.serialize32_u8\n #(Public.parse_header_body short_dcid_len)\n (Public.serialize_header_body short_dcid_len)\n (serialize32_header_body short_dcid_len)\n ()\n\n#push-options \"--z3rlimit 64\"\n\nlet lp_parse32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser32 (Parse.lp_parse_header short_dcid_len last))\n= fun x ->\n Parse.lp_parse_header_eq short_dcid_len last (B32.reveal x); ((\n match parse32_public_header short_dcid_len x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (Parse.synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n LP.parser32_consumes (parse32_public_header short_dcid_len) x;\n assert (U32.v consumed <= B32.length x);\n match parse32_packet_number last (Parse.get_pn_length ph) (B32.slice x consumed (B32.len x)) with\n | None -> None\n | Some (pn, consumed') ->\n Some (Parse.synth_header short_dcid_len last (| ph, pn |), consumed `U32.add` consumed')\n end\n ) <: (y: _ { LP.parser32_correct (Parse.lp_parse_header short_dcid_len last) x y } ))\n\n#pop-options\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 5 { y == Parse.mk_short_protected_bits reserved_bits key_phase pnl })\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 4 { y == Parse.mk_long_protected_bits reserved_bits pnl })\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2\n (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))\n ) 2 4 reserved_bits\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: Parse.header' short_dcid_len last)\n: Tot (y: dtuple2 (Public.header' short_dcid_len) (Parse.packet_number_opt short_dcid_len last) { y == Parse.synth_header_recip short_dcid_len last x })\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n Parse.mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\n#push-options \"--z3rlimit 128\"\n\n#restart-solver\n\nlet serialize32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer32 (Parse.serialize_header short_dcid_len last))\n= fun h ->\n Parse.serialize_header_eq short_dcid_len last h;\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n serialize32_public_header short_dcid_len ph `B32.append`\n (if is_retry h\n then B32.empty_bytes\n else serialize32_packet_number last (pn_length h) pn)\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet parse_header\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (b:bytes)\n: Tot (r: Parse.h_result { r == Parse.parse_header cid_len last b })\n= match LP.parse_tot_seq_of_parser32 (lp_parse32_header (U32.uint_to_t cid_len) (Secret.to_u64 (U64.uint_to_t last))) b with\n | None -> Parse.H_Failure\n | Some (h, consumed) -> Parse.H_Success h (Seq.slice b consumed (Seq.length b))\n\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet last_packet_number\n (h: header)\n: Tot (y: PN.last_packet_number_t { y == Parse.last_packet_number h })\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in\n if Declassify.uint_to_nat pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\n[@\"opaque_to_smt\"]\nlet format_header\n (h: header)\n: Tot (y: bytes { y == Parse.format_header h })\n=\n Parse.in_window_last_packet_number h;\n LP.serialize_tot_seq_of_serializer32 (serialize32_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\n(* header protection *)\n\n[@\"opaque_to_smt\"]\nirreducible\nlet rec seq_reveal'\n (x: Seq.seq Secret.uint8)\n (accu: Seq.seq byte)\n: Tot (y: Seq.seq byte { y `Seq.equal` (accu `Seq.append` Seq.seq_reveal x) })", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: FStar.Seq.Base.seq Lib.IntTypes.uint8 -> accu: FStar.Seq.Base.seq QUIC.Spec.Base.byte\n -> Prims.Tot\n (y:\n FStar.Seq.Base.seq QUIC.Spec.Base.byte\n {FStar.Seq.Base.equal y (FStar.Seq.Base.append accu (QUIC.Secret.Seq.seq_reveal x))})", "effect": "Prims.Tot", "effect_flags": [ "total", "" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Lib.IntTypes.uint8", "QUIC.Spec.Base.byte", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "Prims.bool", "QUIC.TotSpec.seq_reveal'", "FStar.Seq.Base.slice", "FStar.Seq.Base.append", "FStar.Seq.Base.create", "Lib.RawIntTypes.u8_to_UInt8", "FStar.Seq.Base.index", "FStar.Seq.Base.equal", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.U8", "Lib.IntTypes.SEC" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val seq_reveal' (x: Seq.seq Secret.uint8) (accu: Seq.seq byte)\n : Tot (y: Seq.seq byte {y `Seq.equal` (accu `Seq.append` (Seq.seq_reveal x))})\n (decreases (Seq.length x))\nlet rec seq_reveal' (x: Seq.seq Secret.uint8) (accu: Seq.seq byte)\n : Tot (y: Seq.seq byte {y `Seq.equal` (accu `Seq.append` (Seq.seq_reveal x))})\n (decreases (Seq.length x)) =", "completed_definiton": "if Seq.length x = 0\nthen accu\nelse\n (seq_reveal' (Seq.slice x 1 (Seq.length x))\n (Seq.append accu (Seq.create 1 (Declassify.u8_to_UInt8 (Seq.index x 0))))\n <:\n Seq.seq byte)", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.serialize32_long_zero_rtt_body", "original_source_type": "val serialize32_long_zero_rtt_body:LP.serializer32 Public.serialize_long_zero_rtt_body", "source_type": "val serialize32_long_zero_rtt_body:LP.serializer32 Public.serialize_long_zero_rtt_body", "source_definition": "let serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 281, "start_col": 2, "end_line": 281, "end_col": 88 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 QUIC.Spec.Header.Public.serialize_long_zero_rtt_body", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Spec.Header.Public.serialize_common_long", "QUIC.TotSpec.serialize32_common_long", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "QUIC.Spec.Header.Public.serialize_payload_and_pn_length", "QUIC.TotSpec.serialize32_payload_and_pn_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize32_long_zero_rtt_body:LP.serializer32 Public.serialize_long_zero_rtt_body\nlet serialize32_long_zero_rtt_body:LP.serializer32 Public.serialize_long_zero_rtt_body =", "completed_definiton": "serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.parse32_long_retry_body", "original_source_type": "val parse32_long_retry_body:LP.parser32 Public.parse_long_retry_body", "source_type": "val parse32_long_retry_body:LP.parser32 Public.parse_long_retry_body", "source_definition": "let parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 235, "start_col": 2, "end_line": 235, "end_col": 87 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 QUIC.Spec.Header.Public.parse_long_retry_body", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.TotSpec.parse32_common_long", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "LowParse.Spec.Bytes.parse_bounded_vlbytes", "LowParse.SLow.Bytes.parse32_bounded_vlbytes", "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse32_long_retry_body:LP.parser32 Public.parse_long_retry_body\nlet parse32_long_retry_body:LP.parser32 Public.parse_long_retry_body =", "completed_definiton": "parse32_common_long `LP.parse32_nondep_then` (LP.parse32_bounded_vlbytes 0 0ul 20 20ul)", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.serialize32_long_handshake_body", "original_source_type": "val serialize32_long_handshake_body:LP.serializer32 Public.serialize_long_handshake_body", "source_type": "val serialize32_long_handshake_body:LP.serializer32 Public.serialize_long_handshake_body", "source_definition": "let serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 284, "start_col": 2, "end_line": 284, "end_col": 88 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 QUIC.Spec.Header.Public.serialize_long_handshake_body", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Spec.Header.Public.serialize_common_long", "QUIC.TotSpec.serialize32_common_long", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "QUIC.Spec.Header.Public.serialize_payload_and_pn_length", "QUIC.TotSpec.serialize32_payload_and_pn_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize32_long_handshake_body:LP.serializer32 Public.serialize_long_handshake_body\nlet serialize32_long_handshake_body:LP.serializer32 Public.serialize_long_handshake_body =", "completed_definiton": "serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.serialize32_long_retry_body", "original_source_type": "val serialize32_long_retry_body:LP.serializer32 Public.serialize_long_retry_body", "source_type": "val serialize32_long_retry_body:LP.serializer32 Public.serialize_long_retry_body", "source_definition": "let serialize32_long_retry_body : LP.serializer32 Public.serialize_long_retry_body =\n serialize32_common_long `LP.serialize32_nondep_then` LP.serialize32_bounded_vlbytes 0 20", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 293, "start_col": 2, "end_line": 293, "end_col": 90 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 QUIC.Spec.Header.Public.serialize_long_retry_body", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Spec.Header.Public.serialize_common_long", "QUIC.TotSpec.serialize32_common_long", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "LowParse.Spec.Bytes.parse_bounded_vlbytes", "LowParse.Spec.Bytes.serialize_bounded_vlbytes", "LowParse.SLow.Bytes.serialize32_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize32_long_retry_body:LP.serializer32 Public.serialize_long_retry_body\nlet serialize32_long_retry_body:LP.serializer32 Public.serialize_long_retry_body =", "completed_definiton": "serialize32_common_long `LP.serialize32_nondep_then` (LP.serialize32_bounded_vlbytes 0 20)", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.format_header", "original_source_type": "val format_header (h: header) : Tot (y: bytes{y == Parse.format_header h})", "source_type": "val format_header (h: header) : Tot (y: bytes{y == Parse.format_header h})", "source_definition": "let format_header\n (h: header)\n: Tot (y: bytes { y == Parse.format_header h })\n=\n Parse.in_window_last_packet_number h;\n LP.serialize_tot_seq_of_serializer32 (serialize32_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 442, "start_col": 2, "end_line": 443, "end_col": 113 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )\n\nlet serialize32_long_retry_body : LP.serializer32 Public.serialize_long_retry_body =\n serialize32_common_long `LP.serialize32_nondep_then` LP.serialize32_bounded_vlbytes 0 20 \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.serialize32_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize32_flbytes (U32.v short_dcid_len))\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n serialize32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n serialize32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n serialize32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n serialize32_long_retry_body\n\n#pop-options\n\nlet serialize32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer32 (Public.serialize_header short_dcid_len))\n= LPB.serialize32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.serialize32_u8\n #(Public.parse_header_body short_dcid_len)\n (Public.serialize_header_body short_dcid_len)\n (serialize32_header_body short_dcid_len)\n ()\n\n#push-options \"--z3rlimit 64\"\n\nlet lp_parse32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser32 (Parse.lp_parse_header short_dcid_len last))\n= fun x ->\n Parse.lp_parse_header_eq short_dcid_len last (B32.reveal x); ((\n match parse32_public_header short_dcid_len x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (Parse.synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n LP.parser32_consumes (parse32_public_header short_dcid_len) x;\n assert (U32.v consumed <= B32.length x);\n match parse32_packet_number last (Parse.get_pn_length ph) (B32.slice x consumed (B32.len x)) with\n | None -> None\n | Some (pn, consumed') ->\n Some (Parse.synth_header short_dcid_len last (| ph, pn |), consumed `U32.add` consumed')\n end\n ) <: (y: _ { LP.parser32_correct (Parse.lp_parse_header short_dcid_len last) x y } ))\n\n#pop-options\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 5 { y == Parse.mk_short_protected_bits reserved_bits key_phase pnl })\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 4 { y == Parse.mk_long_protected_bits reserved_bits pnl })\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2\n (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))\n ) 2 4 reserved_bits\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: Parse.header' short_dcid_len last)\n: Tot (y: dtuple2 (Public.header' short_dcid_len) (Parse.packet_number_opt short_dcid_len last) { y == Parse.synth_header_recip short_dcid_len last x })\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n Parse.mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\n#push-options \"--z3rlimit 128\"\n\n#restart-solver\n\nlet serialize32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer32 (Parse.serialize_header short_dcid_len last))\n= fun h ->\n Parse.serialize_header_eq short_dcid_len last h;\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n serialize32_public_header short_dcid_len ph `B32.append`\n (if is_retry h\n then B32.empty_bytes\n else serialize32_packet_number last (pn_length h) pn)\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet parse_header\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (b:bytes)\n: Tot (r: Parse.h_result { r == Parse.parse_header cid_len last b })\n= match LP.parse_tot_seq_of_parser32 (lp_parse32_header (U32.uint_to_t cid_len) (Secret.to_u64 (U64.uint_to_t last))) b with\n | None -> Parse.H_Failure\n | Some (h, consumed) -> Parse.H_Success h (Seq.slice b consumed (Seq.length b))\n\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet last_packet_number\n (h: header)\n: Tot (y: PN.last_packet_number_t { y == Parse.last_packet_number h })\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in\n if Declassify.uint_to_nat pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\n[@\"opaque_to_smt\"]\nlet format_header\n (h: header)\n: Tot (y: bytes { y == Parse.format_header h })", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header\n -> y: QUIC.Spec.Base.bytes{y == QUIC.Spec.Header.Parse.format_header h}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "LowParse.SLow.Base.serialize_tot_seq_of_serializer32", "QUIC.Spec.Header.Parse.parse_header_kind", "FStar.UInt32.uint_to_t", "QUIC.Spec.Header.Base.dcid_len", "QUIC.Spec.Header.Parse.header'", "QUIC.TotSpec.last_packet_number", "QUIC.Spec.Header.Parse.lp_parse_header", "QUIC.Spec.Header.Parse.serialize_header", "QUIC.TotSpec.serialize32_header", "Prims.unit", "QUIC.Spec.Header.Parse.in_window_last_packet_number", "QUIC.Spec.Base.bytes", "Prims.eq2", "QUIC.Spec.Header.Parse.format_header" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val format_header (h: header) : Tot (y: bytes{y == Parse.format_header h})\nlet format_header (h: header) : Tot (y: bytes{y == Parse.format_header h}) =", "completed_definiton": "Parse.in_window_last_packet_number h;\nLP.serialize_tot_seq_of_serializer32 (serialize32_header (U32.uint_to_t (dcid_len h))\n (last_packet_number h))\n h", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.serialize32_common_long", "original_source_type": "val serialize32_common_long:LP.serializer32 Public.serialize_common_long", "source_type": "val serialize32_common_long:LP.serializer32 Public.serialize_common_long", "source_definition": "let serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 270, "start_col": 2, "end_line": 273, "end_col": 3 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 QUIC.Spec.Header.Public.serialize_common_long", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_nondep_then", "LowParse.Spec.Int.parse_u32_kind", "FStar.UInt32.t", "LowParse.Spec.Int.parse_u32", "LowParse.Spec.Int.serialize_u32", "LowParse.SLow.Int.serialize32_u32", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Bytes.parse_bounded_vlbytes", "LowParse.Spec.Combinators.serialize_nondep_then", "LowParse.Spec.Bytes.serialize_bounded_vlbytes", "LowParse.SLow.Bytes.serialize32_bounded_vlbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize32_common_long:LP.serializer32 Public.serialize_common_long\nlet serialize32_common_long:LP.serializer32 Public.serialize_common_long =", "completed_definiton": "LP.serialize32_u32\n`LP.serialize32_nondep_then`\n((LP.serialize32_bounded_vlbytes 0 20)\n `LP.serialize32_nondep_then`\n (LP.serialize32_bounded_vlbytes 0 20))", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.parse32_reduced_pn", "original_source_type": "val parse32_reduced_pn (pn_len: PN.packet_number_length_t)\n : Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))", "source_type": "val parse32_reduced_pn (pn_len: PN.packet_number_length_t)\n : Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))", "source_definition": "let parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 164, "start_col": 2, "end_line": 166, "end_col": 64 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t\n -> LowParse.SLow.Base.parser32 (QUIC.Spec.PacketNumber.parse_reduced_pn pn_len ())", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "LowParse.SLow.Combinators.parse32_weaken", "QUIC.Spec.PacketNumber.parse_packet_number_kind", "LowParse.Spec.BoundedInt.parse_bounded_integer_kind", "Lib.RawIntTypes.uint_to_nat", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "LowParse.Spec.BoundedInt.bounded_integer", "LowParse.Spec.BoundedInt.parse_bounded_integer", "LowParse.SLow.BoundedInt.parse32_bounded_integer", "LowParse.SLow.Base.parser32", "QUIC.Secret.Int.Base.v", "QUIC.Spec.PacketNumber.parse_reduced_pn" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse32_reduced_pn (pn_len: PN.packet_number_length_t)\n : Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\nlet parse32_reduced_pn (pn_len: PN.packet_number_length_t)\n : Tot (LP.parser32 (PN.parse_reduced_pn pn_len ())) =", "completed_definiton": "LP.parse32_weaken PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.mk_long_protected_bits", "original_source_type": "val mk_long_protected_bits (reserved_bits: bitfield 2) (pnl: PN.packet_number_length_t)\n : Tot (y: bitfield 4 {y == Parse.mk_long_protected_bits reserved_bits pnl})", "source_type": "val mk_long_protected_bits (reserved_bits: bitfield 2) (pnl: PN.packet_number_length_t)\n : Tot (y: bitfield 4 {y == Parse.mk_long_protected_bits reserved_bits pnl})", "source_definition": "let mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 4 { y == Parse.mk_long_protected_bits reserved_bits pnl })\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2\n (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))\n ) 2 4 reserved_bits", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 368, "start_col": 2, "end_line": 372, "end_col": 21 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )\n\nlet serialize32_long_retry_body : LP.serializer32 Public.serialize_long_retry_body =\n serialize32_common_long `LP.serialize32_nondep_then` LP.serialize32_bounded_vlbytes 0 20 \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.serialize32_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize32_flbytes (U32.v short_dcid_len))\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n serialize32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n serialize32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n serialize32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n serialize32_long_retry_body\n\n#pop-options\n\nlet serialize32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer32 (Public.serialize_header short_dcid_len))\n= LPB.serialize32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.serialize32_u8\n #(Public.parse_header_body short_dcid_len)\n (Public.serialize_header_body short_dcid_len)\n (serialize32_header_body short_dcid_len)\n ()\n\n#push-options \"--z3rlimit 64\"\n\nlet lp_parse32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser32 (Parse.lp_parse_header short_dcid_len last))\n= fun x ->\n Parse.lp_parse_header_eq short_dcid_len last (B32.reveal x); ((\n match parse32_public_header short_dcid_len x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (Parse.synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n LP.parser32_consumes (parse32_public_header short_dcid_len) x;\n assert (U32.v consumed <= B32.length x);\n match parse32_packet_number last (Parse.get_pn_length ph) (B32.slice x consumed (B32.len x)) with\n | None -> None\n | Some (pn, consumed') ->\n Some (Parse.synth_header short_dcid_len last (| ph, pn |), consumed `U32.add` consumed')\n end\n ) <: (y: _ { LP.parser32_correct (Parse.lp_parse_header short_dcid_len last) x y } ))\n\n#pop-options\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 5 { y == Parse.mk_short_protected_bits reserved_bits key_phase pnl })\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "reserved_bits: QUIC.Spec.Base.bitfield 2 -> pnl: QUIC.Spec.PacketNumber.Base.packet_number_length_t\n -> y:\n QUIC.Spec.Base.bitfield 4 {y == QUIC.Spec.Header.Parse.mk_long_protected_bits reserved_bits pnl}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bitfield", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "LowParse.BitFields.__proj__Mkuint_t__item__set_bitfield", "FStar.UInt8.t", "LowParse.BitFields.uint8", "FStar.UInt8.__uint_to_t", "Lib.RawIntTypes.u8_to_UInt8", "QUIC.Secret.Int.cast_down", "Lib.IntTypes.U32", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "Lib.IntTypes.sub", "Lib.IntTypes.to_u32", "Lib.IntTypes.PUB", "FStar.UInt32.__uint_to_t", "Prims.unit", "LowParse.BitFields.set_bitfield_bound", "LowParse.BitFields.set_bitfield", "Prims.op_Subtraction", "QUIC.Secret.Int.Base.v", "FStar.UInt8.v", "Prims.eq2", "QUIC.Spec.Header.Parse.mk_long_protected_bits" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val mk_long_protected_bits (reserved_bits: bitfield 2) (pnl: PN.packet_number_length_t)\n : Tot (y: bitfield 4 {y == Parse.mk_long_protected_bits reserved_bits pnl})\nlet mk_long_protected_bits (reserved_bits: bitfield 2) (pnl: PN.packet_number_length_t)\n : Tot (y: bitfield 4 {y == Parse.mk_long_protected_bits reserved_bits pnl}) =", "completed_definiton": "BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\nBF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\nBF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy\n 0\n 2\n (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` (Secret.to_u32 1ul)))))\n 2\n 4\n reserved_bits", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.serialize32_reduced_pn", "original_source_type": "val serialize32_reduced_pn (pn_len: PN.packet_number_length_t)\n : Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))", "source_type": "val serialize32_reduced_pn (pn_len: PN.packet_number_length_t)\n : Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))", "source_definition": "let serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 182, "start_col": 2, "end_line": 184, "end_col": 68 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t\n -> LowParse.SLow.Base.serializer32 (QUIC.Spec.PacketNumber.serialize_reduced_pn pn_len ())", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "LowParse.SLow.Combinators.serialize32_weaken", "QUIC.Spec.PacketNumber.parse_packet_number_kind", "LowParse.Spec.BoundedInt.parse_bounded_integer_kind", "Lib.RawIntTypes.uint_to_nat", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "LowParse.Spec.BoundedInt.bounded_integer", "LowParse.Spec.BoundedInt.parse_bounded_integer", "LowParse.Spec.BoundedInt.serialize_bounded_integer", "LowParse.SLow.BoundedInt.serialize32_bounded_integer", "LowParse.SLow.Base.serializer32", "QUIC.Secret.Int.Base.v", "QUIC.Spec.PacketNumber.parse_reduced_pn", "QUIC.Spec.PacketNumber.serialize_reduced_pn" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize32_reduced_pn (pn_len: PN.packet_number_length_t)\n : Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\nlet serialize32_reduced_pn (pn_len: PN.packet_number_length_t)\n : Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ())) =", "completed_definiton": "LP.serialize32_weaken PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.last_packet_number", "original_source_type": "val last_packet_number (h: header)\n : Tot (y: PN.last_packet_number_t{y == Parse.last_packet_number h})", "source_type": "val last_packet_number (h: header)\n : Tot (y: PN.last_packet_number_t{y == Parse.last_packet_number h})", "source_definition": "let last_packet_number\n (h: header)\n: Tot (y: PN.last_packet_number_t { y == Parse.last_packet_number h })\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in\n if Declassify.uint_to_nat pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 434, "start_col": 2, "end_line": 435, "end_col": 96 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )\n\nlet serialize32_long_retry_body : LP.serializer32 Public.serialize_long_retry_body =\n serialize32_common_long `LP.serialize32_nondep_then` LP.serialize32_bounded_vlbytes 0 20 \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.serialize32_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize32_flbytes (U32.v short_dcid_len))\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n serialize32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n serialize32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n serialize32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n serialize32_long_retry_body\n\n#pop-options\n\nlet serialize32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer32 (Public.serialize_header short_dcid_len))\n= LPB.serialize32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.serialize32_u8\n #(Public.parse_header_body short_dcid_len)\n (Public.serialize_header_body short_dcid_len)\n (serialize32_header_body short_dcid_len)\n ()\n\n#push-options \"--z3rlimit 64\"\n\nlet lp_parse32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser32 (Parse.lp_parse_header short_dcid_len last))\n= fun x ->\n Parse.lp_parse_header_eq short_dcid_len last (B32.reveal x); ((\n match parse32_public_header short_dcid_len x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (Parse.synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n LP.parser32_consumes (parse32_public_header short_dcid_len) x;\n assert (U32.v consumed <= B32.length x);\n match parse32_packet_number last (Parse.get_pn_length ph) (B32.slice x consumed (B32.len x)) with\n | None -> None\n | Some (pn, consumed') ->\n Some (Parse.synth_header short_dcid_len last (| ph, pn |), consumed `U32.add` consumed')\n end\n ) <: (y: _ { LP.parser32_correct (Parse.lp_parse_header short_dcid_len last) x y } ))\n\n#pop-options\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 5 { y == Parse.mk_short_protected_bits reserved_bits key_phase pnl })\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 4 { y == Parse.mk_long_protected_bits reserved_bits pnl })\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2\n (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))\n ) 2 4 reserved_bits\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: Parse.header' short_dcid_len last)\n: Tot (y: dtuple2 (Public.header' short_dcid_len) (Parse.packet_number_opt short_dcid_len last) { y == Parse.synth_header_recip short_dcid_len last x })\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n Parse.mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\n#push-options \"--z3rlimit 128\"\n\n#restart-solver\n\nlet serialize32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer32 (Parse.serialize_header short_dcid_len last))\n= fun h ->\n Parse.serialize_header_eq short_dcid_len last h;\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n serialize32_public_header short_dcid_len ph `B32.append`\n (if is_retry h\n then B32.empty_bytes\n else serialize32_packet_number last (pn_length h) pn)\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet parse_header\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (b:bytes)\n: Tot (r: Parse.h_result { r == Parse.parse_header cid_len last b })\n= match LP.parse_tot_seq_of_parser32 (lp_parse32_header (U32.uint_to_t cid_len) (Secret.to_u64 (U64.uint_to_t last))) b with\n | None -> Parse.H_Failure\n | Some (h, consumed) -> Parse.H_Success h (Seq.slice b consumed (Seq.length b))\n\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet last_packet_number\n (h: header)", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header\n -> y:\n QUIC.Spec.PacketNumber.Base.last_packet_number_t\n {y == QUIC.Spec.Header.Parse.last_packet_number h}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "QUIC.Spec.Header.Base.is_retry", "Lib.IntTypes.to_u64", "Lib.IntTypes.U64", "Lib.IntTypes.PUB", "FStar.UInt64.__uint_to_t", "Prims.bool", "Prims.op_Equality", "Prims.int", "Lib.RawIntTypes.uint_to_nat", "Lib.IntTypes.SEC", "Lib.IntTypes.sub", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "Prims.eq2", "QUIC.Spec.Header.Parse.last_packet_number", "QUIC.Spec.PacketNumber.Base.packet_number_t", "QUIC.Spec.Header.Base.packet_number" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val last_packet_number (h: header)\n : Tot (y: PN.last_packet_number_t{y == Parse.last_packet_number h})\nlet last_packet_number (h: header)\n : Tot (y: PN.last_packet_number_t{y == Parse.last_packet_number h}) =", "completed_definiton": "if is_retry h\nthen Secret.to_u64 0uL\nelse\n let pn = packet_number h in\n if Declassify.uint_to_nat pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` (Secret.to_u64 1uL)", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.block_of_sample", "original_source_type": "val block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: Tot (y: Seq.lseq Secret.uint8 16 { y == QUIC.Spec.Header.block_of_sample a k sample })", "source_type": "val block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: Tot (y: Seq.lseq Secret.uint8 16 { y == QUIC.Spec.Header.block_of_sample a k sample })", "source_definition": "let block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: Tot (y: Seq.lseq Secret.uint8 16 { y == Header.block_of_sample a k sample })\n=\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 472, "start_col": 2, "end_line": 485, "end_col": 48 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )\n\nlet serialize32_long_retry_body : LP.serializer32 Public.serialize_long_retry_body =\n serialize32_common_long `LP.serialize32_nondep_then` LP.serialize32_bounded_vlbytes 0 20 \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.serialize32_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize32_flbytes (U32.v short_dcid_len))\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n serialize32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n serialize32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n serialize32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n serialize32_long_retry_body\n\n#pop-options\n\nlet serialize32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer32 (Public.serialize_header short_dcid_len))\n= LPB.serialize32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.serialize32_u8\n #(Public.parse_header_body short_dcid_len)\n (Public.serialize_header_body short_dcid_len)\n (serialize32_header_body short_dcid_len)\n ()\n\n#push-options \"--z3rlimit 64\"\n\nlet lp_parse32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser32 (Parse.lp_parse_header short_dcid_len last))\n= fun x ->\n Parse.lp_parse_header_eq short_dcid_len last (B32.reveal x); ((\n match parse32_public_header short_dcid_len x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (Parse.synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n LP.parser32_consumes (parse32_public_header short_dcid_len) x;\n assert (U32.v consumed <= B32.length x);\n match parse32_packet_number last (Parse.get_pn_length ph) (B32.slice x consumed (B32.len x)) with\n | None -> None\n | Some (pn, consumed') ->\n Some (Parse.synth_header short_dcid_len last (| ph, pn |), consumed `U32.add` consumed')\n end\n ) <: (y: _ { LP.parser32_correct (Parse.lp_parse_header short_dcid_len last) x y } ))\n\n#pop-options\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 5 { y == Parse.mk_short_protected_bits reserved_bits key_phase pnl })\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 4 { y == Parse.mk_long_protected_bits reserved_bits pnl })\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2\n (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))\n ) 2 4 reserved_bits\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: Parse.header' short_dcid_len last)\n: Tot (y: dtuple2 (Public.header' short_dcid_len) (Parse.packet_number_opt short_dcid_len last) { y == Parse.synth_header_recip short_dcid_len last x })\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n Parse.mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\n#push-options \"--z3rlimit 128\"\n\n#restart-solver\n\nlet serialize32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer32 (Parse.serialize_header short_dcid_len last))\n= fun h ->\n Parse.serialize_header_eq short_dcid_len last h;\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n serialize32_public_header short_dcid_len ph `B32.append`\n (if is_retry h\n then B32.empty_bytes\n else serialize32_packet_number last (pn_length h) pn)\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet parse_header\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (b:bytes)\n: Tot (r: Parse.h_result { r == Parse.parse_header cid_len last b })\n= match LP.parse_tot_seq_of_parser32 (lp_parse32_header (U32.uint_to_t cid_len) (Secret.to_u64 (U64.uint_to_t last))) b with\n | None -> Parse.H_Failure\n | Some (h, consumed) -> Parse.H_Success h (Seq.slice b consumed (Seq.length b))\n\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet last_packet_number\n (h: header)\n: Tot (y: PN.last_packet_number_t { y == Parse.last_packet_number h })\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in\n if Declassify.uint_to_nat pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\n[@\"opaque_to_smt\"]\nlet format_header\n (h: header)\n: Tot (y: bytes { y == Parse.format_header h })\n=\n Parse.in_window_last_packet_number h;\n LP.serialize_tot_seq_of_serializer32 (serialize32_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\n(* header protection *)\n\n[@\"opaque_to_smt\"]\nirreducible\nlet rec seq_reveal'\n (x: Seq.seq Secret.uint8)\n (accu: Seq.seq byte)\n: Tot (y: Seq.seq byte { y `Seq.equal` (accu `Seq.append` Seq.seq_reveal x) })\n (decreases (Seq.length x))\n= if Seq.length x = 0\n then accu\n else (seq_reveal' (Seq.slice x 1 (Seq.length x)) (Seq.append accu (Seq.create 1 (Declassify.u8_to_UInt8 (Seq.index x 0)))) <: Seq.seq byte)\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet seq_reveal\n (x: Seq.seq Secret.uint8)\n: Tot (y: Seq.seq byte { y `Seq.equal` Seq.seq_reveal x })\n= seq_reveal' x Seq.empty\n\n[@\"opaque_to_smt\"]\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: Tot (y: Seq.lseq Secret.uint8 16 { y == Header.block_of_sample a k sample })", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: Spec.Agile.Cipher.cipher_alg ->\n k: Spec.Agile.Cipher.key a ->\n sample: FStar.Seq.Properties.lseq Lib.IntTypes.uint8 16\n -> y:\n FStar.Seq.Properties.lseq Lib.IntTypes.uint8 16\n {y == QUIC.Spec.Header.block_of_sample a k sample}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Spec.Agile.Cipher.cipher_alg", "Spec.Agile.Cipher.key", "FStar.Seq.Properties.lseq", "Lib.IntTypes.uint8", "Spec.Agile.Cipher.ctr", "Spec.Agile.Cipher.nonce", "FStar.Seq.Base.slice", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "Spec.Agile.Cipher.ctr_block", "Prims.eq2", "QUIC.Spec.Header.block_of_sample", "FStar.Pervasives.Native.tuple2", "FStar.Seq.Base.seq", "FStar.Pervasives.Native.Mktuple2", "FStar.Endianness.le_to_n", "QUIC.TotSpec.seq_reveal", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.b2t", "Prims.op_Equality", "Prims.pos", "Prims.pow2", "FStar.Mul.op_Star", "FStar.Endianness.lemma_le_to_n_is_bounded", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.int_t", "FStar.Seq.Properties.split", "FStar.Endianness.be_to_n", "FStar.Endianness.lemma_be_to_n_is_bounded" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: Tot (y: Seq.lseq Secret.uint8 16 { y == QUIC.Spec.Header.block_of_sample a k sample })\nlet block_of_sample (a: Cipher.cipher_alg) (k: Cipher.key a) (sample: Seq.lseq Secret.uint8 16)\n : Tot (y: Seq.lseq Secret.uint8 16 {y == Header.block_of_sample a k sample}) =", "completed_definiton": "let open FStar.Mul in\nlet ctr, iv =\n match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (seq_reveal ctr_bytes), iv\nin\n(Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.serialize32_varint_payload", "original_source_type": "val serialize32_varint_payload (x: U62.t) : Tot B32.bytes", "source_type": "val serialize32_varint_payload (x: U62.t) : Tot B32.bytes", "source_definition": "let serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 111, "start_col": 2, "end_line": 122, "end_col": 186 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: QUIC.UInt62.t -> FStar.Bytes.bytes", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.UInt62.t", "FStar.UInt64.lt", "FStar.UInt64.__uint_to_t", "FStar.Bytes.empty_bytes", "Prims.bool", "LowParse.SLow.Int.serialize32_u8", "FStar.Int.Cast.uint64_to_uint8", "LowParse.SLow.BoundedInt.serialize32_bounded_integer", "FStar.Int.Cast.uint64_to_uint32", "FStar.UInt64.rem", "LowParse.SLow.Combinators.serialize32_nondep_then", "LowParse.Spec.Int.parse_u32_kind", "FStar.UInt32.t", "LowParse.Spec.Int.parse_u32", "LowParse.Spec.Int.serialize_u32", "LowParse.SLow.Int.serialize32_u32", "LowParse.Spec.BoundedInt.parse_bounded_integer_kind", "LowParse.Spec.BoundedInt.bounded_integer", "LowParse.Spec.BoundedInt.parse_bounded_integer", "LowParse.Spec.BoundedInt.serialize_bounded_integer", "FStar.Pervasives.Native.Mktuple2", "FStar.UInt64.div", "FStar.Bytes.bytes", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.eq2", "Prims.int", "Prims.pow2", "Prims._assert", "Prims.l_or", "Prims.b2t", "Prims.op_GreaterThan", "FStar.UInt.size", "FStar.UInt64.n", "FStar.UInt64.v", "QUIC.UInt62.bound" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val serialize32_varint_payload (x: U62.t) : Tot B32.bytes\nlet serialize32_varint_payload (x: U62.t) : Tot B32.bytes =", "completed_definiton": "assert_norm (pow2 8 == 256);\nassert_norm (pow2 6 == 64);\nassert (pow2 62 == U64.v U62.bound);\nassert_norm (pow2 24 == 16777216);\nassert_norm (pow2 32 == 4294967296);\nif x `U64.lt` 64uL\nthen B32.empty_bytes\nelse\n if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else\n if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else\n (LP.serialize32_u32 `LP.serialize32_nondep_then` (LP.serialize32_bounded_integer 3)) (Cast.uint64_to_uint32\n (x `U64.div` 16777216uL),\n Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.synth_packet_number_recip'", "original_source_type": "val synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n : Tot\n (npn: LP.bounded_integer (Secret.v pn_len) {npn == PN.synth_packet_number_recip last pn_len pn})", "source_type": "val synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n : Tot\n (npn: LP.bounded_integer (Secret.v pn_len) {npn == PN.synth_packet_number_recip last pn_len pn})", "source_definition": "let synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 192, "start_col": 2, "end_line": 192, "end_col": 95 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t' last pn_len\n -> npn:\n LowParse.Spec.BoundedInt.bounded_integer (QUIC.Secret.Int.Base.v pn_len)\n {npn == QUIC.Spec.PacketNumber.synth_packet_number_recip last pn_len pn}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "FStar.UInt32.uint_to_t", "QUIC.Spec.PacketNumber.reduce_pn'", "Prims.op_Subtraction", "Lib.RawIntTypes.uint_to_nat", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "Lib.IntTypes.U64", "LowParse.Spec.BoundedInt.bounded_integer", "QUIC.Secret.Int.Base.v", "Prims.eq2", "QUIC.Spec.PacketNumber.synth_packet_number_recip" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n : Tot\n (npn: LP.bounded_integer (Secret.v pn_len) {npn == PN.synth_packet_number_recip last pn_len pn})\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n : Tot\n (npn: LP.bounded_integer (Secret.v pn_len) {npn == PN.synth_packet_number_recip last pn_len pn}) =", "completed_definiton": "U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.mk_short_protected_bits", "original_source_type": "val mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n : Tot (y: bitfield 5 {y == Parse.mk_short_protected_bits reserved_bits key_phase pnl})", "source_type": "val mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n : Tot (y: bitfield 5 {y == Parse.mk_short_protected_bits reserved_bits key_phase pnl})", "source_definition": "let mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 5 { y == Parse.mk_short_protected_bits reserved_bits key_phase pnl })\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 359, "start_col": 2, "end_line": 362, "end_col": 234 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )\n\nlet serialize32_long_retry_body : LP.serializer32 Public.serialize_long_retry_body =\n serialize32_common_long `LP.serialize32_nondep_then` LP.serialize32_bounded_vlbytes 0 20 \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.serialize32_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize32_flbytes (U32.v short_dcid_len))\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n serialize32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n serialize32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n serialize32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n serialize32_long_retry_body\n\n#pop-options\n\nlet serialize32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer32 (Public.serialize_header short_dcid_len))\n= LPB.serialize32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.serialize32_u8\n #(Public.parse_header_body short_dcid_len)\n (Public.serialize_header_body short_dcid_len)\n (serialize32_header_body short_dcid_len)\n ()\n\n#push-options \"--z3rlimit 64\"\n\nlet lp_parse32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser32 (Parse.lp_parse_header short_dcid_len last))\n= fun x ->\n Parse.lp_parse_header_eq short_dcid_len last (B32.reveal x); ((\n match parse32_public_header short_dcid_len x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (Parse.synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n LP.parser32_consumes (parse32_public_header short_dcid_len) x;\n assert (U32.v consumed <= B32.length x);\n match parse32_packet_number last (Parse.get_pn_length ph) (B32.slice x consumed (B32.len x)) with\n | None -> None\n | Some (pn, consumed') ->\n Some (Parse.synth_header short_dcid_len last (| ph, pn |), consumed `U32.add` consumed')\n end\n ) <: (y: _ { LP.parser32_correct (Parse.lp_parse_header short_dcid_len last) x y } ))\n\n#pop-options\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n reserved_bits: QUIC.Spec.Base.bitfield 2 ->\n key_phase: Prims.bool ->\n pnl: QUIC.Spec.PacketNumber.Base.packet_number_length_t\n -> y:\n QUIC.Spec.Base.bitfield 5\n {y == QUIC.Spec.Header.Parse.mk_short_protected_bits reserved_bits key_phase pnl}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bitfield", "Prims.bool", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "LowParse.BitFields.__proj__Mkuint_t__item__set_bitfield", "FStar.UInt8.t", "LowParse.BitFields.uint8", "FStar.UInt8.__uint_to_t", "Lib.RawIntTypes.u8_to_UInt8", "QUIC.Secret.Int.cast_down", "Lib.IntTypes.U32", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "Lib.IntTypes.sub", "Lib.IntTypes.to_u32", "Lib.IntTypes.PUB", "FStar.UInt32.__uint_to_t", "Prims.b2t", "Prims.op_LessThan", "LowParse.BitFields.__proj__Mkuint_t__item__v", "Prims.pow2", "Prims.op_Subtraction", "Prims.unit", "LowParse.BitFields.set_bitfield_bound", "LowParse.BitFields.set_bitfield", "QUIC.Secret.Int.Base.v", "LowParse.BitFields.ubitfield", "FStar.UInt8.v", "Prims.eq2", "QUIC.Spec.Header.Parse.mk_short_protected_bits" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n : Tot (y: bitfield 5 {y == Parse.mk_short_protected_bits reserved_bits key_phase pnl})\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n : Tot (y: bitfield 5 {y == Parse.mk_short_protected_bits reserved_bits key_phase pnl}) =", "completed_definiton": "BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\nBF.set_bitfield_bound #8\n (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1))\n 5\n 2\n 3\n (if key_phase then 1 else 0);\nBF.set_bitfield_bound #8\n (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)\n )\n 5\n 3\n 5\n (U8.v reserved_bits);\nBF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy\n 0\n 2\n (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` (Secret.to_u32 1ul))\n )))\n 2\n 3\n (if key_phase then 1uy else 0uy))\n 3\n 5\n reserved_bits", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.parse32_long_initial_body", "original_source_type": "val parse32_long_initial_body:LP.parser32 Public.parse_long_initial_body", "source_type": "val parse32_long_initial_body:LP.parser32 Public.parse_long_initial_body", "source_definition": "let parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 229, "start_col": 4, "end_line": 232, "end_col": 5 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.parser32 QUIC.Spec.Header.Public.parse_long_initial_body", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.parse32_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.TotSpec.parse32_common_long", "LowParse.Spec.VLGen.parse_bounded_vlgen_kind", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.Base.token_max_len", "LowParse.Spec.Combinators.parse_filter_kind", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Bytes.parse_bounded_vlgenbytes", "QUIC.Spec.VarInt.parse_bounded_varint", "FStar.UInt32.v", "FStar.UInt32.__uint_to_t", "FStar.UInt32.uint_to_t", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "LowParse.SLow.Bytes.parse32_bounded_vlgenbytes", "QUIC.TotSpec.parse32_bounded_varint", "QUIC.TotSpec.parse32_payload_and_pn_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse32_long_initial_body:LP.parser32 Public.parse_long_initial_body\nlet parse32_long_initial_body:LP.parser32 Public.parse_long_initial_body =", "completed_definiton": "parse32_common_long\n`LP.parse32_nondep_then`\n((LP.parse32_bounded_vlgenbytes 0\n 0ul\n token_max_len\n (U32.uint_to_t token_max_len)\n (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)))\n `LP.parse32_nondep_then`\n parse32_payload_and_pn_length)", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.serialize32_long_initial_body", "original_source_type": "val serialize32_long_initial_body:LP.serializer32 Public.serialize_long_initial_body", "source_type": "val serialize32_long_initial_body:LP.serializer32 Public.serialize_long_initial_body", "source_definition": "let serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 287, "start_col": 4, "end_line": 290, "end_col": 5 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 QUIC.Spec.Header.Public.serialize_long_initial_body", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.SLow.Combinators.serialize32_nondep_then", "LowParse.Spec.Combinators.and_then_kind", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.VLData.parse_bounded_vldata_strong_kind", "LowParse.Spec.BoundedInt.log256'", "LowParse.Spec.Bytes.parse_all_bytes_kind", "QUIC.Spec.Header.Public.common_long_t", "QUIC.Spec.Header.Public.parse_common_long", "QUIC.Spec.Header.Public.serialize_common_long", "QUIC.TotSpec.serialize32_common_long", "LowParse.Spec.VLGen.parse_bounded_vlgen_kind", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.Base.token_max_len", "LowParse.Spec.Combinators.parse_filter_kind", "FStar.Pervasives.Native.tuple2", "LowParse.Spec.Bytes.parse_bounded_vlbytes_t", "QUIC.Spec.Header.Public.payload_and_pn_length_t'", "LowParse.Spec.Combinators.nondep_then", "LowParse.Spec.Bytes.parse_bounded_vlgenbytes", "QUIC.Spec.VarInt.parse_bounded_varint", "QUIC.Spec.Header.Public.parse_payload_and_pn_length", "LowParse.Spec.Combinators.serialize_nondep_then", "LowParse.Spec.Bytes.serialize_bounded_vlgenbytes", "QUIC.Spec.VarInt.serialize_bounded_varint", "QUIC.Spec.Header.Public.serialize_payload_and_pn_length", "LowParse.SLow.Bytes.serialize32_bounded_vlgenbytes", "QUIC.TotSpec.serialize32_bounded_varint", "QUIC.TotSpec.serialize32_payload_and_pn_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize32_long_initial_body:LP.serializer32 Public.serialize_long_initial_body\nlet serialize32_long_initial_body:LP.serializer32 Public.serialize_long_initial_body =", "completed_definiton": "serialize32_common_long\n`LP.serialize32_nondep_then`\n((LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)))\n `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length)", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.parse32_bounded_varint", "original_source_type": "val parse32_bounded_varint (min: U32.t) (max: U32.t{U32.v min <= U32.v max})\n : Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))", "source_type": "val parse32_bounded_varint (min: U32.t) (max: U32.t{U32.v min <= U32.v max})\n : Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))", "source_definition": "let parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 97, "start_col": 2, "end_line": 105, "end_col": 5 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "min: FStar.UInt32.t -> max: FStar.UInt32.t{FStar.UInt32.v min <= FStar.UInt32.v max}\n -> LowParse.SLow.Base.parser32 (QUIC.Spec.VarInt.parse_bounded_varint (FStar.UInt32.v min)\n (FStar.UInt32.v max))", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "LowParse.SLow.Combinators.parse32_synth'", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.UInt62.t", "QUIC.Spec.VarInt.varint_in_bounds", "LowParse.Spec.BoundedInt.bounded_int32", "LowParse.Spec.Combinators.parse_filter", "QUIC.Spec.VarInt.parse_varint", "QUIC.Spec.VarInt.synth_bounded_varint", "LowParse.SLow.Combinators.parse32_filter", "QUIC.TotSpec.parse32_varint", "Prims.op_AmpAmp", "FStar.UInt64.lte", "FStar.Int.Cast.uint32_to_uint64", "Prims.bool", "Prims.eq2", "LowParse.SLow.Base.parser32", "QUIC.Spec.VarInt.parse_bounded_varint" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse32_bounded_varint (min: U32.t) (max: U32.t{U32.v min <= U32.v max})\n : Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\nlet parse32_bounded_varint (min: U32.t) (max: U32.t{U32.v min <= U32.v max})\n : Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max))) =", "completed_definiton": "LP.parse32_synth' (VI.parse_varint `LP.parse_filter` (VI.varint_in_bounds (U32.v min) (U32.v max)))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> (Cast.uint32_to_uint64 min) `U64.lte` x && x `U64.lte` (Cast.uint32_to_uint64 max)))\n ()", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.decrypt", "original_source_type": "val decrypt:\n a: ea ->\n k: AEAD.kv a ->\n static_iv: Spec.iv_t a ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n last: nat{last+1 < pow2 62} ->\n cid_len: nat { cid_len <= 20 } ->\n packet: packet ->\n Tot (r: Spec.result {\n r == Spec.decrypt a k static_iv hpk last cid_len packet\n })", "source_type": "val decrypt:\n a: ea ->\n k: AEAD.kv a ->\n static_iv: Spec.iv_t a ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n last: nat{last+1 < pow2 62} ->\n cid_len: nat { cid_len <= 20 } ->\n packet: packet ->\n Tot (r: Spec.result {\n r == Spec.decrypt a k static_iv hpk last cid_len packet\n })", "source_definition": "let decrypt\n a k siv hpk last cid_len packet\n=\n let open FStar.Math.Lemmas in\n let open FStar.Endianness in\n match header_decrypt a hpk cid_len last packet with\n | Header.H_Failure -> Spec.Failure\n | Header.H_Success h c rem ->\n if is_retry h\n then Spec.Success h c rem\n else\n match payload_decrypt a k siv h (Seq.seq_hide c) with\n | None -> Spec.Failure\n | Some plain -> Spec.Success h (seq_reveal plain) rem", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 692, "start_col": 2, "end_line": 702, "end_col": 59 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )\n\nlet serialize32_long_retry_body : LP.serializer32 Public.serialize_long_retry_body =\n serialize32_common_long `LP.serialize32_nondep_then` LP.serialize32_bounded_vlbytes 0 20 \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.serialize32_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize32_flbytes (U32.v short_dcid_len))\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n serialize32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n serialize32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n serialize32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n serialize32_long_retry_body\n\n#pop-options\n\nlet serialize32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer32 (Public.serialize_header short_dcid_len))\n= LPB.serialize32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.serialize32_u8\n #(Public.parse_header_body short_dcid_len)\n (Public.serialize_header_body short_dcid_len)\n (serialize32_header_body short_dcid_len)\n ()\n\n#push-options \"--z3rlimit 64\"\n\nlet lp_parse32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser32 (Parse.lp_parse_header short_dcid_len last))\n= fun x ->\n Parse.lp_parse_header_eq short_dcid_len last (B32.reveal x); ((\n match parse32_public_header short_dcid_len x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (Parse.synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n LP.parser32_consumes (parse32_public_header short_dcid_len) x;\n assert (U32.v consumed <= B32.length x);\n match parse32_packet_number last (Parse.get_pn_length ph) (B32.slice x consumed (B32.len x)) with\n | None -> None\n | Some (pn, consumed') ->\n Some (Parse.synth_header short_dcid_len last (| ph, pn |), consumed `U32.add` consumed')\n end\n ) <: (y: _ { LP.parser32_correct (Parse.lp_parse_header short_dcid_len last) x y } ))\n\n#pop-options\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 5 { y == Parse.mk_short_protected_bits reserved_bits key_phase pnl })\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 4 { y == Parse.mk_long_protected_bits reserved_bits pnl })\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2\n (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))\n ) 2 4 reserved_bits\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: Parse.header' short_dcid_len last)\n: Tot (y: dtuple2 (Public.header' short_dcid_len) (Parse.packet_number_opt short_dcid_len last) { y == Parse.synth_header_recip short_dcid_len last x })\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n Parse.mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\n#push-options \"--z3rlimit 128\"\n\n#restart-solver\n\nlet serialize32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer32 (Parse.serialize_header short_dcid_len last))\n= fun h ->\n Parse.serialize_header_eq short_dcid_len last h;\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n serialize32_public_header short_dcid_len ph `B32.append`\n (if is_retry h\n then B32.empty_bytes\n else serialize32_packet_number last (pn_length h) pn)\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet parse_header\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (b:bytes)\n: Tot (r: Parse.h_result { r == Parse.parse_header cid_len last b })\n= match LP.parse_tot_seq_of_parser32 (lp_parse32_header (U32.uint_to_t cid_len) (Secret.to_u64 (U64.uint_to_t last))) b with\n | None -> Parse.H_Failure\n | Some (h, consumed) -> Parse.H_Success h (Seq.slice b consumed (Seq.length b))\n\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet last_packet_number\n (h: header)\n: Tot (y: PN.last_packet_number_t { y == Parse.last_packet_number h })\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in\n if Declassify.uint_to_nat pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\n[@\"opaque_to_smt\"]\nlet format_header\n (h: header)\n: Tot (y: bytes { y == Parse.format_header h })\n=\n Parse.in_window_last_packet_number h;\n LP.serialize_tot_seq_of_serializer32 (serialize32_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\n(* header protection *)\n\n[@\"opaque_to_smt\"]\nirreducible\nlet rec seq_reveal'\n (x: Seq.seq Secret.uint8)\n (accu: Seq.seq byte)\n: Tot (y: Seq.seq byte { y `Seq.equal` (accu `Seq.append` Seq.seq_reveal x) })\n (decreases (Seq.length x))\n= if Seq.length x = 0\n then accu\n else (seq_reveal' (Seq.slice x 1 (Seq.length x)) (Seq.append accu (Seq.create 1 (Declassify.u8_to_UInt8 (Seq.index x 0)))) <: Seq.seq byte)\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet seq_reveal\n (x: Seq.seq Secret.uint8)\n: Tot (y: Seq.seq byte { y `Seq.equal` Seq.seq_reveal x })\n= seq_reveal' x Seq.empty\n\n[@\"opaque_to_smt\"]\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: Tot (y: Seq.lseq Secret.uint8 16 { y == Header.block_of_sample a k sample })\n=\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet pn_offset\n (h: header { ~ (is_retry h) })\n: Tot (y: nat { y == Parse.pn_offset h })\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Seq.length (LP.serialize_tot_seq_of_serializer32 (serialize32_public_header cid_len) ph)\n\n#push-options \"--z3rlimit 32\"\nlet header_encrypt\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n: Tot (b: bytes { b == Header.header_encrypt a hpk h c })\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = format_header h `Seq.append` c in\n if is_retry h\n then\n r\n else\n let pn_offset = pn_offset h in\n let pn_len = Declassify.uint_to_nat (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Header.pn_sizemask pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet putative_pn_offset\n (cid_len: nat)\n (x: bytes)\n: Tot (y: option nat { y == Parse.putative_pn_offset cid_len x })\n= if cid_len > 20\n then None\n else\n match LP.parse_tot_seq_of_parser32 (parse32_public_header (U32.uint_to_t cid_len)) x with\n | None -> None\n | Some (_, consumed) ->\n LP.parser_kind_prop_equiv (Public.parse_header_kind (U32.uint_to_t cid_len)) (Public.parse_header (U32.uint_to_t cid_len));\n Some (consumed <: nat)\n\n[@\"opaque_to_smt\"]\nlet header_decrypt_aux\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Tot (y: option Header.header_decrypt_aux_t { y == Header.header_decrypt_aux a hpk cid_len packet })\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n Header.is_short = is_short;\n Header.is_retry = is_retry;\n Header.packet = packet;\n Header.pn_offset = ();\n Header.pn_len = ();\n })\n else\n match putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset+16)) in\n let mask = seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Header.pn_sizemask pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n Header.is_short = is_short;\n Header.is_retry = is_retry;\n Header.packet = packet'';\n Header.pn_offset = pn_offset;\n Header.pn_len = pn_len;\n })\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet header_decrypt\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (packet: packet)\n: Tot (r: Header.h_result { r == Header.header_decrypt a hpk cid_len last packet })\n=\n let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then Header.H_Failure\n else\n match header_decrypt_aux a hpk cid_len packet with\n | None -> Header.H_Failure\n | Some r ->\n let packet'' = r.Header.packet in\n begin match parse_header cid_len last packet'' with\n | Parse.H_Failure -> Header.H_Failure\n | Parse.H_Success h rem' ->\n Header.header_decrypt_aux_post_parse a hpk cid_len last packet;\n if is_retry h\n then\n Header.H_Success h Seq.empty rem'\n else\n let clen = if has_payload_length h then Declassify.uint_to_nat (payload_length h) else Seq.length rem' in\n assert_norm (16 < max_cipher_length - 1);\n (* payload_length is secret, so, to stay constant-time, we\n must not check for failure. Instead, we compute some length\n that might be garbage if bounds on payload_length do not hold. *)\n let clen = Header.max (Header.min (Header.min clen (Seq.length rem')) (max_cipher_length - 1)) 16 in\n assert (clen < max_cipher_length);\n assert (clen <= Seq.length rem');\n assert (16 <= clen);\n let c = Seq.slice rem' 0 clen in\n let rem = Seq.slice rem' clen (Seq.length rem') in\n Header.H_Success h c rem\n end\n\n#pop-options\n\n(* header and packet protection *)\n\n[@\"opaque_to_smt\"]\nlet iv_for_encrypt_decrypt\n (a: ea)\n (siv: Spec.iv_t a)\n (h: header { ~ (is_retry h) })\n: Tot (y: Spec.iv_t a { y == Spec.iv_for_encrypt_decrypt a siv h })\n=\n let pn_len = Declassify.uint_to_nat (pn_length h) - 1 in\n let seqn = packet_number h in\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pnb = FStar.Endianness.n_to_be 12 (Declassify.uint_to_nat seqn) in\n Seq.seq_hide #Secret.U8 (Lemmas.xor_inplace pnb (seq_reveal siv) 0)\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet payload_encrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: Spec.iv_t a)\n (h: header { ~ (is_retry h) })\n (plain: pbytes)\n: Tot (y: bytes { y == Spec.payload_encrypt a k siv h plain })\n=\n let aad = format_header h in\n let iv = iv_for_encrypt_decrypt a siv h in\n seq_reveal (AEAD.encrypt #a k iv (Seq.seq_hide aad) (Seq.seq_hide plain))\n\nlet encrypt\n a k siv hpk h plain\n=\n let cipher =\n if is_retry h\n then plain\n else payload_encrypt a k siv h plain\n in\n header_encrypt a hpk h cipher\n\n[@\"opaque_to_smt\"]\nlet payload_decrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: Spec.iv_t a)\n (h: header { ~ (is_retry h) })\n (c: Seq.seq Secret.uint8 { 16 <= Seq.length c /\\ Seq.length c < max_cipher_length })\n: Tot (y: option (AEAD.decrypted c) { y == Spec.payload_decrypt a k siv h c })\n= \n let iv = iv_for_encrypt_decrypt a siv h in\n let aad = format_header h in\n AEAD.decrypt #a k iv (Seq.seq_hide aad) c\n\nlet decrypt\n a k siv hpk last cid_len packet", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n k: Spec.Agile.AEAD.kv a ->\n static_iv: QUIC.Spec.iv_t a ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n last: Prims.nat{last + 1 < Prims.pow2 62} ->\n cid_len: Prims.nat{cid_len <= 20} ->\n packet: QUIC.Spec.Crypto.packet\n -> r: QUIC.Spec.result{r == QUIC.Spec.decrypt a k static_iv hpk last cid_len packet}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.AEAD.kv", "QUIC.Spec.iv_t", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Prims.op_Addition", "Prims.pow2", "Prims.op_LessThanOrEqual", "QUIC.Spec.Crypto.packet", "QUIC.TotSpec.header_decrypt", "QUIC.Spec.Failure", "QUIC.Spec.Header.Base.header", "QUIC.Spec.Base.bytes", "QUIC.Spec.Header.Base.is_retry", "Prims.eq2", "Prims.int", "Prims.bool", "Prims.l_and", "QUIC.Spec.Crypto.max_cipher_length", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "QUIC.Spec.Success", "QUIC.TotSpec.payload_decrypt", "QUIC.Secret.Seq.seq_hide", "Lib.IntTypes.U8", "Spec.Agile.AEAD.decrypted", "QUIC.TotSpec.seq_reveal", "QUIC.Spec.result", "QUIC.Spec.decrypt" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val decrypt:\n a: ea ->\n k: AEAD.kv a ->\n static_iv: Spec.iv_t a ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n last: nat{last+1 < pow2 62} ->\n cid_len: nat { cid_len <= 20 } ->\n packet: packet ->\n Tot (r: Spec.result {\n r == Spec.decrypt a k static_iv hpk last cid_len packet\n })\nlet decrypt a k siv hpk last cid_len packet =", "completed_definiton": "let open FStar.Math.Lemmas in\nlet open FStar.Endianness in\nmatch header_decrypt a hpk cid_len last packet with\n| Header.H_Failure -> Spec.Failure\n| Header.H_Success h c rem ->\n if is_retry h\n then Spec.Success h c rem\n else\n match payload_decrypt a k siv h (Seq.seq_hide c) with\n | None -> Spec.Failure\n | Some plain -> Spec.Success h (seq_reveal plain) rem", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.serialize32_bounded_varint", "original_source_type": "val serialize32_bounded_varint (min: nat) (max: nat{min <= max /\\ max < 4294967296})\n : Tot (LP.serializer32 (VI.serialize_bounded_varint min max))", "source_type": "val serialize32_bounded_varint (min: nat) (max: nat{min <= max /\\ max < 4294967296})\n : Tot (LP.serializer32 (VI.serialize_bounded_varint min max))", "source_definition": "let serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 135, "start_col": 2, "end_line": 142, "end_col": 5 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "min: Prims.nat -> max: Prims.nat{min <= max /\\ max < 4294967296}\n -> LowParse.SLow.Base.serializer32 (QUIC.Spec.VarInt.serialize_bounded_varint min max)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "LowParse.SLow.Combinators.serialize32_synth", "LowParse.Spec.Combinators.parse_filter_kind", "QUIC.Spec.VarInt.parse_varint_kind", "LowParse.Spec.Combinators.parse_filter_refine", "QUIC.UInt62.t", "QUIC.Spec.VarInt.varint_in_bounds", "LowParse.Spec.BoundedInt.bounded_int32", "LowParse.Spec.Combinators.parse_filter", "QUIC.Spec.VarInt.parse_varint", "QUIC.Spec.VarInt.synth_bounded_varint", "LowParse.Spec.Combinators.serialize_filter", "QUIC.Spec.VarInt.serialize_varint", "LowParse.SLow.Combinators.serialize32_filter", "QUIC.TotSpec.serialize32_varint", "QUIC.Spec.VarInt.synth_bounded_varint_recip", "Prims.eq2", "LowParse.SLow.Base.serializer32", "QUIC.Spec.VarInt.parse_bounded_varint", "QUIC.Spec.VarInt.serialize_bounded_varint" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize32_bounded_varint (min: nat) (max: nat{min <= max /\\ max < 4294967296})\n : Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\nlet serialize32_bounded_varint (min: nat) (max: nat{min <= max /\\ max < 4294967296})\n : Tot (LP.serializer32 (VI.serialize_bounded_varint min max)) =", "completed_definiton": "LP.serialize32_synth (VI.parse_varint `LP.parse_filter` (VI.varint_in_bounds (min) (max)))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` (VI.varint_in_bounds min max))\n (serialize32_varint `LP.serialize32_filter` (VI.varint_in_bounds min max))\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.parse32_header_body", "original_source_type": "val parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n : Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))", "source_type": "val parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n : Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))", "source_definition": "let parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 243, "start_col": 2, "end_line": 253, "end_col": 27 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n x: LowParse.Spec.BitSum.bitsum'_key_type QUIC.Spec.Header.Public.first_byte\n -> LowParse.SLow.Base.parser32 (FStar.Pervasives.dsnd (QUIC.Spec.Header.Public.parse_header_body short_dcid_len\n x))", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "LowParse.Spec.BitSum.bitsum'_key_type", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "LowParse.SLow.Combinators.parse32_weaken", "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some", "LowParse.Spec.Base.total_constant_size_parser_kind", "FStar.UInt32.v", "FStar.Bytes.lbytes", "LowParse.Spec.Bytes.parse_flbytes", "LowParse.SLow.Bytes.parse32_flbytes", "QUIC.TotSpec.parse32_long_initial_body", "QUIC.TotSpec.parse32_long_zero_rtt_body", "QUIC.TotSpec.parse32_long_handshake_body", "QUIC.TotSpec.parse32_long_retry_body", "LowParse.SLow.Base.parser32", "Prims.__proj__Mkdtuple2__item___1", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.parser", "QUIC.Spec.Header.Public.header_body_type", "QUIC.Spec.Header.Public.parse_header_body", "FStar.Pervasives.dsnd" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n : Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n : Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x))) =", "completed_definiton": "match x with\n| (| Public.Short , (| () , () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None)\n (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n| (| Public.Long , (| () , (| Public.Initial , () |) |) |) -> parse32_long_initial_body\n| (| Public.Long , (| () , (| Public.ZeroRTT , () |) |) |) -> parse32_long_zero_rtt_body\n| (| Public.Long , (| () , (| Public.Handshake , () |) |) |) -> parse32_long_handshake_body\n| (| Public.Long , (| () , (| Public.Retry , () |) |) |) -> parse32_long_retry_body", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.encrypt", "original_source_type": "val encrypt:\n a: ea ->\n k: AEAD.kv a ->\n static_iv: Spec.iv_t a ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n h: header ->\n plain: pbytes' (is_retry h) ->\n Tot (p: packet { p == Spec.encrypt a k static_iv hpk h plain })", "source_type": "val encrypt:\n a: ea ->\n k: AEAD.kv a ->\n static_iv: Spec.iv_t a ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n h: header ->\n plain: pbytes' (is_retry h) ->\n Tot (p: packet { p == Spec.encrypt a k static_iv hpk h plain })", "source_definition": "let encrypt\n a k siv hpk h plain\n=\n let cipher =\n if is_retry h\n then plain\n else payload_encrypt a k siv h plain\n in\n header_encrypt a hpk h cipher", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 668, "start_col": 1, "end_line": 674, "end_col": 31 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )\n\nlet serialize32_long_retry_body : LP.serializer32 Public.serialize_long_retry_body =\n serialize32_common_long `LP.serialize32_nondep_then` LP.serialize32_bounded_vlbytes 0 20 \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.serialize32_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize32_flbytes (U32.v short_dcid_len))\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n serialize32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n serialize32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n serialize32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n serialize32_long_retry_body\n\n#pop-options\n\nlet serialize32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer32 (Public.serialize_header short_dcid_len))\n= LPB.serialize32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.serialize32_u8\n #(Public.parse_header_body short_dcid_len)\n (Public.serialize_header_body short_dcid_len)\n (serialize32_header_body short_dcid_len)\n ()\n\n#push-options \"--z3rlimit 64\"\n\nlet lp_parse32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser32 (Parse.lp_parse_header short_dcid_len last))\n= fun x ->\n Parse.lp_parse_header_eq short_dcid_len last (B32.reveal x); ((\n match parse32_public_header short_dcid_len x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (Parse.synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n LP.parser32_consumes (parse32_public_header short_dcid_len) x;\n assert (U32.v consumed <= B32.length x);\n match parse32_packet_number last (Parse.get_pn_length ph) (B32.slice x consumed (B32.len x)) with\n | None -> None\n | Some (pn, consumed') ->\n Some (Parse.synth_header short_dcid_len last (| ph, pn |), consumed `U32.add` consumed')\n end\n ) <: (y: _ { LP.parser32_correct (Parse.lp_parse_header short_dcid_len last) x y } ))\n\n#pop-options\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 5 { y == Parse.mk_short_protected_bits reserved_bits key_phase pnl })\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 4 { y == Parse.mk_long_protected_bits reserved_bits pnl })\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2\n (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))\n ) 2 4 reserved_bits\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: Parse.header' short_dcid_len last)\n: Tot (y: dtuple2 (Public.header' short_dcid_len) (Parse.packet_number_opt short_dcid_len last) { y == Parse.synth_header_recip short_dcid_len last x })\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n Parse.mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\n#push-options \"--z3rlimit 128\"\n\n#restart-solver\n\nlet serialize32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer32 (Parse.serialize_header short_dcid_len last))\n= fun h ->\n Parse.serialize_header_eq short_dcid_len last h;\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n serialize32_public_header short_dcid_len ph `B32.append`\n (if is_retry h\n then B32.empty_bytes\n else serialize32_packet_number last (pn_length h) pn)\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet parse_header\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (b:bytes)\n: Tot (r: Parse.h_result { r == Parse.parse_header cid_len last b })\n= match LP.parse_tot_seq_of_parser32 (lp_parse32_header (U32.uint_to_t cid_len) (Secret.to_u64 (U64.uint_to_t last))) b with\n | None -> Parse.H_Failure\n | Some (h, consumed) -> Parse.H_Success h (Seq.slice b consumed (Seq.length b))\n\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet last_packet_number\n (h: header)\n: Tot (y: PN.last_packet_number_t { y == Parse.last_packet_number h })\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in\n if Declassify.uint_to_nat pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\n[@\"opaque_to_smt\"]\nlet format_header\n (h: header)\n: Tot (y: bytes { y == Parse.format_header h })\n=\n Parse.in_window_last_packet_number h;\n LP.serialize_tot_seq_of_serializer32 (serialize32_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\n(* header protection *)\n\n[@\"opaque_to_smt\"]\nirreducible\nlet rec seq_reveal'\n (x: Seq.seq Secret.uint8)\n (accu: Seq.seq byte)\n: Tot (y: Seq.seq byte { y `Seq.equal` (accu `Seq.append` Seq.seq_reveal x) })\n (decreases (Seq.length x))\n= if Seq.length x = 0\n then accu\n else (seq_reveal' (Seq.slice x 1 (Seq.length x)) (Seq.append accu (Seq.create 1 (Declassify.u8_to_UInt8 (Seq.index x 0)))) <: Seq.seq byte)\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet seq_reveal\n (x: Seq.seq Secret.uint8)\n: Tot (y: Seq.seq byte { y `Seq.equal` Seq.seq_reveal x })\n= seq_reveal' x Seq.empty\n\n[@\"opaque_to_smt\"]\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: Tot (y: Seq.lseq Secret.uint8 16 { y == Header.block_of_sample a k sample })\n=\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet pn_offset\n (h: header { ~ (is_retry h) })\n: Tot (y: nat { y == Parse.pn_offset h })\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Seq.length (LP.serialize_tot_seq_of_serializer32 (serialize32_public_header cid_len) ph)\n\n#push-options \"--z3rlimit 32\"\nlet header_encrypt\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n: Tot (b: bytes { b == Header.header_encrypt a hpk h c })\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = format_header h `Seq.append` c in\n if is_retry h\n then\n r\n else\n let pn_offset = pn_offset h in\n let pn_len = Declassify.uint_to_nat (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Header.pn_sizemask pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet putative_pn_offset\n (cid_len: nat)\n (x: bytes)\n: Tot (y: option nat { y == Parse.putative_pn_offset cid_len x })\n= if cid_len > 20\n then None\n else\n match LP.parse_tot_seq_of_parser32 (parse32_public_header (U32.uint_to_t cid_len)) x with\n | None -> None\n | Some (_, consumed) ->\n LP.parser_kind_prop_equiv (Public.parse_header_kind (U32.uint_to_t cid_len)) (Public.parse_header (U32.uint_to_t cid_len));\n Some (consumed <: nat)\n\n[@\"opaque_to_smt\"]\nlet header_decrypt_aux\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Tot (y: option Header.header_decrypt_aux_t { y == Header.header_decrypt_aux a hpk cid_len packet })\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n Header.is_short = is_short;\n Header.is_retry = is_retry;\n Header.packet = packet;\n Header.pn_offset = ();\n Header.pn_len = ();\n })\n else\n match putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset+16)) in\n let mask = seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Header.pn_sizemask pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n Header.is_short = is_short;\n Header.is_retry = is_retry;\n Header.packet = packet'';\n Header.pn_offset = pn_offset;\n Header.pn_len = pn_len;\n })\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet header_decrypt\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (packet: packet)\n: Tot (r: Header.h_result { r == Header.header_decrypt a hpk cid_len last packet })\n=\n let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then Header.H_Failure\n else\n match header_decrypt_aux a hpk cid_len packet with\n | None -> Header.H_Failure\n | Some r ->\n let packet'' = r.Header.packet in\n begin match parse_header cid_len last packet'' with\n | Parse.H_Failure -> Header.H_Failure\n | Parse.H_Success h rem' ->\n Header.header_decrypt_aux_post_parse a hpk cid_len last packet;\n if is_retry h\n then\n Header.H_Success h Seq.empty rem'\n else\n let clen = if has_payload_length h then Declassify.uint_to_nat (payload_length h) else Seq.length rem' in\n assert_norm (16 < max_cipher_length - 1);\n (* payload_length is secret, so, to stay constant-time, we\n must not check for failure. Instead, we compute some length\n that might be garbage if bounds on payload_length do not hold. *)\n let clen = Header.max (Header.min (Header.min clen (Seq.length rem')) (max_cipher_length - 1)) 16 in\n assert (clen < max_cipher_length);\n assert (clen <= Seq.length rem');\n assert (16 <= clen);\n let c = Seq.slice rem' 0 clen in\n let rem = Seq.slice rem' clen (Seq.length rem') in\n Header.H_Success h c rem\n end\n\n#pop-options\n\n(* header and packet protection *)\n\n[@\"opaque_to_smt\"]\nlet iv_for_encrypt_decrypt\n (a: ea)\n (siv: Spec.iv_t a)\n (h: header { ~ (is_retry h) })\n: Tot (y: Spec.iv_t a { y == Spec.iv_for_encrypt_decrypt a siv h })\n=\n let pn_len = Declassify.uint_to_nat (pn_length h) - 1 in\n let seqn = packet_number h in\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pnb = FStar.Endianness.n_to_be 12 (Declassify.uint_to_nat seqn) in\n Seq.seq_hide #Secret.U8 (Lemmas.xor_inplace pnb (seq_reveal siv) 0)\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet payload_encrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: Spec.iv_t a)\n (h: header { ~ (is_retry h) })\n (plain: pbytes)\n: Tot (y: bytes { y == Spec.payload_encrypt a k siv h plain })\n=\n let aad = format_header h in\n let iv = iv_for_encrypt_decrypt a siv h in\n seq_reveal (AEAD.encrypt #a k iv (Seq.seq_hide aad) (Seq.seq_hide plain))\n\nlet encrypt", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n k: Spec.Agile.AEAD.kv a ->\n static_iv: QUIC.Spec.iv_t a ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n h: QUIC.Spec.Header.Base.header ->\n plain: QUIC.Spec.Crypto.pbytes' (QUIC.Spec.Header.Base.is_retry h)\n -> p: QUIC.Spec.Crypto.packet{p == QUIC.Spec.encrypt a k static_iv hpk h plain}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.AEAD.kv", "QUIC.Spec.iv_t", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "QUIC.Spec.Header.Base.header", "QUIC.Spec.Crypto.pbytes'", "QUIC.Spec.Header.Base.is_retry", "QUIC.TotSpec.header_encrypt", "QUIC.Spec.Crypto.cbytes'", "Prims.bool", "QUIC.TotSpec.payload_encrypt", "QUIC.Spec.Crypto.packet", "Prims.eq2", "QUIC.Spec.encrypt" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val encrypt:\n a: ea ->\n k: AEAD.kv a ->\n static_iv: Spec.iv_t a ->\n hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a) ->\n h: header ->\n plain: pbytes' (is_retry h) ->\n Tot (p: packet { p == Spec.encrypt a k static_iv hpk h plain })\nlet encrypt a k siv hpk h plain =", "completed_definiton": "let cipher = if is_retry h then plain else payload_encrypt a k siv h plain in\nheader_encrypt a hpk h cipher", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.payload_encrypt", "original_source_type": "val payload_encrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: Spec.iv_t a)\n (h: header{~(is_retry h)})\n (plain: pbytes)\n : Tot (y: bytes{y == Spec.payload_encrypt a k siv h plain})", "source_type": "val payload_encrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: Spec.iv_t a)\n (h: header{~(is_retry h)})\n (plain: pbytes)\n : Tot (y: bytes{y == Spec.payload_encrypt a k siv h plain})", "source_definition": "let payload_encrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: Spec.iv_t a)\n (h: header { ~ (is_retry h) })\n (plain: pbytes)\n: Tot (y: bytes { y == Spec.payload_encrypt a k siv h plain })\n=\n let aad = format_header h in\n let iv = iv_for_encrypt_decrypt a siv h in\n seq_reveal (AEAD.encrypt #a k iv (Seq.seq_hide aad) (Seq.seq_hide plain))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 661, "start_col": 1, "end_line": 664, "end_col": 75 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )\n\nlet serialize32_long_retry_body : LP.serializer32 Public.serialize_long_retry_body =\n serialize32_common_long `LP.serialize32_nondep_then` LP.serialize32_bounded_vlbytes 0 20 \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.serialize32_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize32_flbytes (U32.v short_dcid_len))\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n serialize32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n serialize32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n serialize32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n serialize32_long_retry_body\n\n#pop-options\n\nlet serialize32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer32 (Public.serialize_header short_dcid_len))\n= LPB.serialize32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.serialize32_u8\n #(Public.parse_header_body short_dcid_len)\n (Public.serialize_header_body short_dcid_len)\n (serialize32_header_body short_dcid_len)\n ()\n\n#push-options \"--z3rlimit 64\"\n\nlet lp_parse32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser32 (Parse.lp_parse_header short_dcid_len last))\n= fun x ->\n Parse.lp_parse_header_eq short_dcid_len last (B32.reveal x); ((\n match parse32_public_header short_dcid_len x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (Parse.synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n LP.parser32_consumes (parse32_public_header short_dcid_len) x;\n assert (U32.v consumed <= B32.length x);\n match parse32_packet_number last (Parse.get_pn_length ph) (B32.slice x consumed (B32.len x)) with\n | None -> None\n | Some (pn, consumed') ->\n Some (Parse.synth_header short_dcid_len last (| ph, pn |), consumed `U32.add` consumed')\n end\n ) <: (y: _ { LP.parser32_correct (Parse.lp_parse_header short_dcid_len last) x y } ))\n\n#pop-options\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 5 { y == Parse.mk_short_protected_bits reserved_bits key_phase pnl })\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 4 { y == Parse.mk_long_protected_bits reserved_bits pnl })\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2\n (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))\n ) 2 4 reserved_bits\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: Parse.header' short_dcid_len last)\n: Tot (y: dtuple2 (Public.header' short_dcid_len) (Parse.packet_number_opt short_dcid_len last) { y == Parse.synth_header_recip short_dcid_len last x })\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n Parse.mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\n#push-options \"--z3rlimit 128\"\n\n#restart-solver\n\nlet serialize32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer32 (Parse.serialize_header short_dcid_len last))\n= fun h ->\n Parse.serialize_header_eq short_dcid_len last h;\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n serialize32_public_header short_dcid_len ph `B32.append`\n (if is_retry h\n then B32.empty_bytes\n else serialize32_packet_number last (pn_length h) pn)\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet parse_header\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (b:bytes)\n: Tot (r: Parse.h_result { r == Parse.parse_header cid_len last b })\n= match LP.parse_tot_seq_of_parser32 (lp_parse32_header (U32.uint_to_t cid_len) (Secret.to_u64 (U64.uint_to_t last))) b with\n | None -> Parse.H_Failure\n | Some (h, consumed) -> Parse.H_Success h (Seq.slice b consumed (Seq.length b))\n\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet last_packet_number\n (h: header)\n: Tot (y: PN.last_packet_number_t { y == Parse.last_packet_number h })\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in\n if Declassify.uint_to_nat pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\n[@\"opaque_to_smt\"]\nlet format_header\n (h: header)\n: Tot (y: bytes { y == Parse.format_header h })\n=\n Parse.in_window_last_packet_number h;\n LP.serialize_tot_seq_of_serializer32 (serialize32_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\n(* header protection *)\n\n[@\"opaque_to_smt\"]\nirreducible\nlet rec seq_reveal'\n (x: Seq.seq Secret.uint8)\n (accu: Seq.seq byte)\n: Tot (y: Seq.seq byte { y `Seq.equal` (accu `Seq.append` Seq.seq_reveal x) })\n (decreases (Seq.length x))\n= if Seq.length x = 0\n then accu\n else (seq_reveal' (Seq.slice x 1 (Seq.length x)) (Seq.append accu (Seq.create 1 (Declassify.u8_to_UInt8 (Seq.index x 0)))) <: Seq.seq byte)\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet seq_reveal\n (x: Seq.seq Secret.uint8)\n: Tot (y: Seq.seq byte { y `Seq.equal` Seq.seq_reveal x })\n= seq_reveal' x Seq.empty\n\n[@\"opaque_to_smt\"]\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: Tot (y: Seq.lseq Secret.uint8 16 { y == Header.block_of_sample a k sample })\n=\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet pn_offset\n (h: header { ~ (is_retry h) })\n: Tot (y: nat { y == Parse.pn_offset h })\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Seq.length (LP.serialize_tot_seq_of_serializer32 (serialize32_public_header cid_len) ph)\n\n#push-options \"--z3rlimit 32\"\nlet header_encrypt\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n: Tot (b: bytes { b == Header.header_encrypt a hpk h c })\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = format_header h `Seq.append` c in\n if is_retry h\n then\n r\n else\n let pn_offset = pn_offset h in\n let pn_len = Declassify.uint_to_nat (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Header.pn_sizemask pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet putative_pn_offset\n (cid_len: nat)\n (x: bytes)\n: Tot (y: option nat { y == Parse.putative_pn_offset cid_len x })\n= if cid_len > 20\n then None\n else\n match LP.parse_tot_seq_of_parser32 (parse32_public_header (U32.uint_to_t cid_len)) x with\n | None -> None\n | Some (_, consumed) ->\n LP.parser_kind_prop_equiv (Public.parse_header_kind (U32.uint_to_t cid_len)) (Public.parse_header (U32.uint_to_t cid_len));\n Some (consumed <: nat)\n\n[@\"opaque_to_smt\"]\nlet header_decrypt_aux\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Tot (y: option Header.header_decrypt_aux_t { y == Header.header_decrypt_aux a hpk cid_len packet })\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n Header.is_short = is_short;\n Header.is_retry = is_retry;\n Header.packet = packet;\n Header.pn_offset = ();\n Header.pn_len = ();\n })\n else\n match putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset+16)) in\n let mask = seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Header.pn_sizemask pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n Header.is_short = is_short;\n Header.is_retry = is_retry;\n Header.packet = packet'';\n Header.pn_offset = pn_offset;\n Header.pn_len = pn_len;\n })\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet header_decrypt\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (packet: packet)\n: Tot (r: Header.h_result { r == Header.header_decrypt a hpk cid_len last packet })\n=\n let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then Header.H_Failure\n else\n match header_decrypt_aux a hpk cid_len packet with\n | None -> Header.H_Failure\n | Some r ->\n let packet'' = r.Header.packet in\n begin match parse_header cid_len last packet'' with\n | Parse.H_Failure -> Header.H_Failure\n | Parse.H_Success h rem' ->\n Header.header_decrypt_aux_post_parse a hpk cid_len last packet;\n if is_retry h\n then\n Header.H_Success h Seq.empty rem'\n else\n let clen = if has_payload_length h then Declassify.uint_to_nat (payload_length h) else Seq.length rem' in\n assert_norm (16 < max_cipher_length - 1);\n (* payload_length is secret, so, to stay constant-time, we\n must not check for failure. Instead, we compute some length\n that might be garbage if bounds on payload_length do not hold. *)\n let clen = Header.max (Header.min (Header.min clen (Seq.length rem')) (max_cipher_length - 1)) 16 in\n assert (clen < max_cipher_length);\n assert (clen <= Seq.length rem');\n assert (16 <= clen);\n let c = Seq.slice rem' 0 clen in\n let rem = Seq.slice rem' clen (Seq.length rem') in\n Header.H_Success h c rem\n end\n\n#pop-options\n\n(* header and packet protection *)\n\n[@\"opaque_to_smt\"]\nlet iv_for_encrypt_decrypt\n (a: ea)\n (siv: Spec.iv_t a)\n (h: header { ~ (is_retry h) })\n: Tot (y: Spec.iv_t a { y == Spec.iv_for_encrypt_decrypt a siv h })\n=\n let pn_len = Declassify.uint_to_nat (pn_length h) - 1 in\n let seqn = packet_number h in\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pnb = FStar.Endianness.n_to_be 12 (Declassify.uint_to_nat seqn) in\n Seq.seq_hide #Secret.U8 (Lemmas.xor_inplace pnb (seq_reveal siv) 0)\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet payload_encrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: Spec.iv_t a)\n (h: header { ~ (is_retry h) })\n (plain: pbytes)", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n k: Spec.Agile.AEAD.kv a ->\n siv: QUIC.Spec.iv_t a ->\n h: QUIC.Spec.Header.Base.header{~(QUIC.Spec.Header.Base.is_retry h)} ->\n plain: QUIC.Spec.Crypto.pbytes\n -> y: QUIC.Spec.Base.bytes{y == QUIC.Spec.payload_encrypt a k siv h plain}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.AEAD.kv", "QUIC.Spec.iv_t", "QUIC.Spec.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Spec.Header.Base.is_retry", "QUIC.Spec.Crypto.pbytes", "QUIC.TotSpec.seq_reveal", "Spec.Agile.AEAD.encrypt", "QUIC.Secret.Seq.seq_hide", "Lib.IntTypes.U8", "Prims.eq2", "QUIC.Spec.iv_for_encrypt_decrypt", "QUIC.TotSpec.iv_for_encrypt_decrypt", "QUIC.Spec.Base.bytes", "QUIC.Spec.Header.Parse.format_header", "QUIC.TotSpec.format_header", "QUIC.Spec.payload_encrypt" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val payload_encrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: Spec.iv_t a)\n (h: header{~(is_retry h)})\n (plain: pbytes)\n : Tot (y: bytes{y == Spec.payload_encrypt a k siv h plain})\nlet payload_encrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: Spec.iv_t a)\n (h: header{~(is_retry h)})\n (plain: pbytes)\n : Tot (y: bytes{y == Spec.payload_encrypt a k siv h plain}) =", "completed_definiton": "let aad = format_header h in\nlet iv = iv_for_encrypt_decrypt a siv h in\nseq_reveal (AEAD.encrypt #a k iv (Seq.seq_hide aad) (Seq.seq_hide plain))", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.payload_decrypt", "original_source_type": "val payload_decrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: Spec.iv_t a)\n (h: header{~(is_retry h)})\n (c: Seq.seq Secret.uint8 {16 <= Seq.length c /\\ Seq.length c < max_cipher_length})\n : Tot (y: option (AEAD.decrypted c) {y == Spec.payload_decrypt a k siv h c})", "source_type": "val payload_decrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: Spec.iv_t a)\n (h: header{~(is_retry h)})\n (c: Seq.seq Secret.uint8 {16 <= Seq.length c /\\ Seq.length c < max_cipher_length})\n : Tot (y: option (AEAD.decrypted c) {y == Spec.payload_decrypt a k siv h c})", "source_definition": "let payload_decrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: Spec.iv_t a)\n (h: header { ~ (is_retry h) })\n (c: Seq.seq Secret.uint8 { 16 <= Seq.length c /\\ Seq.length c < max_cipher_length })\n: Tot (y: option (AEAD.decrypted c) { y == Spec.payload_decrypt a k siv h c })\n= \n let iv = iv_for_encrypt_decrypt a siv h in\n let aad = format_header h in\n AEAD.decrypt #a k iv (Seq.seq_hide aad) c", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 684, "start_col": 1, "end_line": 687, "end_col": 43 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )\n\nlet serialize32_long_retry_body : LP.serializer32 Public.serialize_long_retry_body =\n serialize32_common_long `LP.serialize32_nondep_then` LP.serialize32_bounded_vlbytes 0 20 \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.serialize32_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize32_flbytes (U32.v short_dcid_len))\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n serialize32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n serialize32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n serialize32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n serialize32_long_retry_body\n\n#pop-options\n\nlet serialize32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer32 (Public.serialize_header short_dcid_len))\n= LPB.serialize32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.serialize32_u8\n #(Public.parse_header_body short_dcid_len)\n (Public.serialize_header_body short_dcid_len)\n (serialize32_header_body short_dcid_len)\n ()\n\n#push-options \"--z3rlimit 64\"\n\nlet lp_parse32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser32 (Parse.lp_parse_header short_dcid_len last))\n= fun x ->\n Parse.lp_parse_header_eq short_dcid_len last (B32.reveal x); ((\n match parse32_public_header short_dcid_len x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (Parse.synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n LP.parser32_consumes (parse32_public_header short_dcid_len) x;\n assert (U32.v consumed <= B32.length x);\n match parse32_packet_number last (Parse.get_pn_length ph) (B32.slice x consumed (B32.len x)) with\n | None -> None\n | Some (pn, consumed') ->\n Some (Parse.synth_header short_dcid_len last (| ph, pn |), consumed `U32.add` consumed')\n end\n ) <: (y: _ { LP.parser32_correct (Parse.lp_parse_header short_dcid_len last) x y } ))\n\n#pop-options\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 5 { y == Parse.mk_short_protected_bits reserved_bits key_phase pnl })\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 4 { y == Parse.mk_long_protected_bits reserved_bits pnl })\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2\n (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))\n ) 2 4 reserved_bits\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: Parse.header' short_dcid_len last)\n: Tot (y: dtuple2 (Public.header' short_dcid_len) (Parse.packet_number_opt short_dcid_len last) { y == Parse.synth_header_recip short_dcid_len last x })\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n Parse.mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\n#push-options \"--z3rlimit 128\"\n\n#restart-solver\n\nlet serialize32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer32 (Parse.serialize_header short_dcid_len last))\n= fun h ->\n Parse.serialize_header_eq short_dcid_len last h;\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n serialize32_public_header short_dcid_len ph `B32.append`\n (if is_retry h\n then B32.empty_bytes\n else serialize32_packet_number last (pn_length h) pn)\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet parse_header\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (b:bytes)\n: Tot (r: Parse.h_result { r == Parse.parse_header cid_len last b })\n= match LP.parse_tot_seq_of_parser32 (lp_parse32_header (U32.uint_to_t cid_len) (Secret.to_u64 (U64.uint_to_t last))) b with\n | None -> Parse.H_Failure\n | Some (h, consumed) -> Parse.H_Success h (Seq.slice b consumed (Seq.length b))\n\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet last_packet_number\n (h: header)\n: Tot (y: PN.last_packet_number_t { y == Parse.last_packet_number h })\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in\n if Declassify.uint_to_nat pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\n[@\"opaque_to_smt\"]\nlet format_header\n (h: header)\n: Tot (y: bytes { y == Parse.format_header h })\n=\n Parse.in_window_last_packet_number h;\n LP.serialize_tot_seq_of_serializer32 (serialize32_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\n(* header protection *)\n\n[@\"opaque_to_smt\"]\nirreducible\nlet rec seq_reveal'\n (x: Seq.seq Secret.uint8)\n (accu: Seq.seq byte)\n: Tot (y: Seq.seq byte { y `Seq.equal` (accu `Seq.append` Seq.seq_reveal x) })\n (decreases (Seq.length x))\n= if Seq.length x = 0\n then accu\n else (seq_reveal' (Seq.slice x 1 (Seq.length x)) (Seq.append accu (Seq.create 1 (Declassify.u8_to_UInt8 (Seq.index x 0)))) <: Seq.seq byte)\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet seq_reveal\n (x: Seq.seq Secret.uint8)\n: Tot (y: Seq.seq byte { y `Seq.equal` Seq.seq_reveal x })\n= seq_reveal' x Seq.empty\n\n[@\"opaque_to_smt\"]\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: Tot (y: Seq.lseq Secret.uint8 16 { y == Header.block_of_sample a k sample })\n=\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet pn_offset\n (h: header { ~ (is_retry h) })\n: Tot (y: nat { y == Parse.pn_offset h })\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Seq.length (LP.serialize_tot_seq_of_serializer32 (serialize32_public_header cid_len) ph)\n\n#push-options \"--z3rlimit 32\"\nlet header_encrypt\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n: Tot (b: bytes { b == Header.header_encrypt a hpk h c })\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = format_header h `Seq.append` c in\n if is_retry h\n then\n r\n else\n let pn_offset = pn_offset h in\n let pn_len = Declassify.uint_to_nat (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Header.pn_sizemask pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet putative_pn_offset\n (cid_len: nat)\n (x: bytes)\n: Tot (y: option nat { y == Parse.putative_pn_offset cid_len x })\n= if cid_len > 20\n then None\n else\n match LP.parse_tot_seq_of_parser32 (parse32_public_header (U32.uint_to_t cid_len)) x with\n | None -> None\n | Some (_, consumed) ->\n LP.parser_kind_prop_equiv (Public.parse_header_kind (U32.uint_to_t cid_len)) (Public.parse_header (U32.uint_to_t cid_len));\n Some (consumed <: nat)\n\n[@\"opaque_to_smt\"]\nlet header_decrypt_aux\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Tot (y: option Header.header_decrypt_aux_t { y == Header.header_decrypt_aux a hpk cid_len packet })\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n Header.is_short = is_short;\n Header.is_retry = is_retry;\n Header.packet = packet;\n Header.pn_offset = ();\n Header.pn_len = ();\n })\n else\n match putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset+16)) in\n let mask = seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Header.pn_sizemask pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n Header.is_short = is_short;\n Header.is_retry = is_retry;\n Header.packet = packet'';\n Header.pn_offset = pn_offset;\n Header.pn_len = pn_len;\n })\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet header_decrypt\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (packet: packet)\n: Tot (r: Header.h_result { r == Header.header_decrypt a hpk cid_len last packet })\n=\n let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then Header.H_Failure\n else\n match header_decrypt_aux a hpk cid_len packet with\n | None -> Header.H_Failure\n | Some r ->\n let packet'' = r.Header.packet in\n begin match parse_header cid_len last packet'' with\n | Parse.H_Failure -> Header.H_Failure\n | Parse.H_Success h rem' ->\n Header.header_decrypt_aux_post_parse a hpk cid_len last packet;\n if is_retry h\n then\n Header.H_Success h Seq.empty rem'\n else\n let clen = if has_payload_length h then Declassify.uint_to_nat (payload_length h) else Seq.length rem' in\n assert_norm (16 < max_cipher_length - 1);\n (* payload_length is secret, so, to stay constant-time, we\n must not check for failure. Instead, we compute some length\n that might be garbage if bounds on payload_length do not hold. *)\n let clen = Header.max (Header.min (Header.min clen (Seq.length rem')) (max_cipher_length - 1)) 16 in\n assert (clen < max_cipher_length);\n assert (clen <= Seq.length rem');\n assert (16 <= clen);\n let c = Seq.slice rem' 0 clen in\n let rem = Seq.slice rem' clen (Seq.length rem') in\n Header.H_Success h c rem\n end\n\n#pop-options\n\n(* header and packet protection *)\n\n[@\"opaque_to_smt\"]\nlet iv_for_encrypt_decrypt\n (a: ea)\n (siv: Spec.iv_t a)\n (h: header { ~ (is_retry h) })\n: Tot (y: Spec.iv_t a { y == Spec.iv_for_encrypt_decrypt a siv h })\n=\n let pn_len = Declassify.uint_to_nat (pn_length h) - 1 in\n let seqn = packet_number h in\n let _ = assert_norm(pow2 62 < pow2 (8 `op_Multiply` 12)) in\n let pnb = FStar.Endianness.n_to_be 12 (Declassify.uint_to_nat seqn) in\n Seq.seq_hide #Secret.U8 (Lemmas.xor_inplace pnb (seq_reveal siv) 0)\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet payload_encrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: Spec.iv_t a)\n (h: header { ~ (is_retry h) })\n (plain: pbytes)\n: Tot (y: bytes { y == Spec.payload_encrypt a k siv h plain })\n=\n let aad = format_header h in\n let iv = iv_for_encrypt_decrypt a siv h in\n seq_reveal (AEAD.encrypt #a k iv (Seq.seq_hide aad) (Seq.seq_hide plain))\n\nlet encrypt\n a k siv hpk h plain\n=\n let cipher =\n if is_retry h\n then plain\n else payload_encrypt a k siv h plain\n in\n header_encrypt a hpk h cipher\n\n[@\"opaque_to_smt\"]\nlet payload_decrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: Spec.iv_t a)\n (h: header { ~ (is_retry h) })\n (c: Seq.seq Secret.uint8 { 16 <= Seq.length c /\\ Seq.length c < max_cipher_length })", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n k: Spec.Agile.AEAD.kv a ->\n siv: QUIC.Spec.iv_t a ->\n h: QUIC.Spec.Header.Base.header{~(QUIC.Spec.Header.Base.is_retry h)} ->\n c:\n FStar.Seq.Base.seq Lib.IntTypes.uint8\n { 16 <= FStar.Seq.Base.length c /\\\n FStar.Seq.Base.length c < QUIC.Spec.Crypto.max_cipher_length }\n -> y:\n FStar.Pervasives.Native.option (Spec.Agile.AEAD.decrypted c)\n {y == QUIC.Spec.payload_decrypt a k siv h c}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.AEAD.kv", "QUIC.Spec.iv_t", "QUIC.Spec.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Spec.Header.Base.is_retry", "FStar.Seq.Base.seq", "Lib.IntTypes.uint8", "Prims.l_and", "Prims.op_LessThanOrEqual", "FStar.Seq.Base.length", "Prims.op_LessThan", "QUIC.Spec.Crypto.max_cipher_length", "Spec.Agile.AEAD.decrypt", "QUIC.Secret.Seq.seq_hide", "Lib.IntTypes.U8", "QUIC.Spec.Base.bytes", "Prims.eq2", "QUIC.Spec.Header.Parse.format_header", "QUIC.TotSpec.format_header", "QUIC.Spec.iv_for_encrypt_decrypt", "QUIC.TotSpec.iv_for_encrypt_decrypt", "FStar.Pervasives.Native.option", "Spec.Agile.AEAD.decrypted", "QUIC.Spec.payload_decrypt" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val payload_decrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: Spec.iv_t a)\n (h: header{~(is_retry h)})\n (c: Seq.seq Secret.uint8 {16 <= Seq.length c /\\ Seq.length c < max_cipher_length})\n : Tot (y: option (AEAD.decrypted c) {y == Spec.payload_decrypt a k siv h c})\nlet payload_decrypt\n (a: ea)\n (k: AEAD.kv a)\n (siv: Spec.iv_t a)\n (h: header{~(is_retry h)})\n (c: Seq.seq Secret.uint8 {16 <= Seq.length c /\\ Seq.length c < max_cipher_length})\n : Tot (y: option (AEAD.decrypted c) {y == Spec.payload_decrypt a k siv h c}) =", "completed_definiton": "let iv = iv_for_encrypt_decrypt a siv h in\nlet aad = format_header h in\nAEAD.decrypt #a k iv (Seq.seq_hide aad) c", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.header_decrypt_aux", "original_source_type": "val header_decrypt_aux\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet: packet)\n : Tot\n (y: option Header.header_decrypt_aux_t {y == Header.header_decrypt_aux a hpk cid_len packet})", "source_type": "val header_decrypt_aux\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet: packet)\n : Tot\n (y: option Header.header_decrypt_aux_t {y == Header.header_decrypt_aux a hpk cid_len packet})", "source_definition": "let header_decrypt_aux\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Tot (y: option Header.header_decrypt_aux_t { y == Header.header_decrypt_aux a hpk cid_len packet })\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n Header.is_short = is_short;\n Header.is_retry = is_retry;\n Header.packet = packet;\n Header.pn_offset = ();\n Header.pn_len = ();\n })\n else\n match putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset+16)) in\n let mask = seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Header.pn_sizemask pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n Header.is_short = is_short;\n Header.is_retry = is_retry;\n Header.packet = packet'';\n Header.pn_offset = pn_offset;\n Header.pn_len = pn_len;\n })\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 546, "start_col": 2, "end_line": 587, "end_col": 11 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )\n\nlet serialize32_long_retry_body : LP.serializer32 Public.serialize_long_retry_body =\n serialize32_common_long `LP.serialize32_nondep_then` LP.serialize32_bounded_vlbytes 0 20 \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.serialize32_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize32_flbytes (U32.v short_dcid_len))\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n serialize32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n serialize32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n serialize32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n serialize32_long_retry_body\n\n#pop-options\n\nlet serialize32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer32 (Public.serialize_header short_dcid_len))\n= LPB.serialize32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.serialize32_u8\n #(Public.parse_header_body short_dcid_len)\n (Public.serialize_header_body short_dcid_len)\n (serialize32_header_body short_dcid_len)\n ()\n\n#push-options \"--z3rlimit 64\"\n\nlet lp_parse32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser32 (Parse.lp_parse_header short_dcid_len last))\n= fun x ->\n Parse.lp_parse_header_eq short_dcid_len last (B32.reveal x); ((\n match parse32_public_header short_dcid_len x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (Parse.synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n LP.parser32_consumes (parse32_public_header short_dcid_len) x;\n assert (U32.v consumed <= B32.length x);\n match parse32_packet_number last (Parse.get_pn_length ph) (B32.slice x consumed (B32.len x)) with\n | None -> None\n | Some (pn, consumed') ->\n Some (Parse.synth_header short_dcid_len last (| ph, pn |), consumed `U32.add` consumed')\n end\n ) <: (y: _ { LP.parser32_correct (Parse.lp_parse_header short_dcid_len last) x y } ))\n\n#pop-options\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 5 { y == Parse.mk_short_protected_bits reserved_bits key_phase pnl })\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 4 { y == Parse.mk_long_protected_bits reserved_bits pnl })\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2\n (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))\n ) 2 4 reserved_bits\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: Parse.header' short_dcid_len last)\n: Tot (y: dtuple2 (Public.header' short_dcid_len) (Parse.packet_number_opt short_dcid_len last) { y == Parse.synth_header_recip short_dcid_len last x })\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n Parse.mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\n#push-options \"--z3rlimit 128\"\n\n#restart-solver\n\nlet serialize32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer32 (Parse.serialize_header short_dcid_len last))\n= fun h ->\n Parse.serialize_header_eq short_dcid_len last h;\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n serialize32_public_header short_dcid_len ph `B32.append`\n (if is_retry h\n then B32.empty_bytes\n else serialize32_packet_number last (pn_length h) pn)\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet parse_header\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (b:bytes)\n: Tot (r: Parse.h_result { r == Parse.parse_header cid_len last b })\n= match LP.parse_tot_seq_of_parser32 (lp_parse32_header (U32.uint_to_t cid_len) (Secret.to_u64 (U64.uint_to_t last))) b with\n | None -> Parse.H_Failure\n | Some (h, consumed) -> Parse.H_Success h (Seq.slice b consumed (Seq.length b))\n\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet last_packet_number\n (h: header)\n: Tot (y: PN.last_packet_number_t { y == Parse.last_packet_number h })\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in\n if Declassify.uint_to_nat pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\n[@\"opaque_to_smt\"]\nlet format_header\n (h: header)\n: Tot (y: bytes { y == Parse.format_header h })\n=\n Parse.in_window_last_packet_number h;\n LP.serialize_tot_seq_of_serializer32 (serialize32_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\n(* header protection *)\n\n[@\"opaque_to_smt\"]\nirreducible\nlet rec seq_reveal'\n (x: Seq.seq Secret.uint8)\n (accu: Seq.seq byte)\n: Tot (y: Seq.seq byte { y `Seq.equal` (accu `Seq.append` Seq.seq_reveal x) })\n (decreases (Seq.length x))\n= if Seq.length x = 0\n then accu\n else (seq_reveal' (Seq.slice x 1 (Seq.length x)) (Seq.append accu (Seq.create 1 (Declassify.u8_to_UInt8 (Seq.index x 0)))) <: Seq.seq byte)\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet seq_reveal\n (x: Seq.seq Secret.uint8)\n: Tot (y: Seq.seq byte { y `Seq.equal` Seq.seq_reveal x })\n= seq_reveal' x Seq.empty\n\n[@\"opaque_to_smt\"]\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: Tot (y: Seq.lseq Secret.uint8 16 { y == Header.block_of_sample a k sample })\n=\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet pn_offset\n (h: header { ~ (is_retry h) })\n: Tot (y: nat { y == Parse.pn_offset h })\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Seq.length (LP.serialize_tot_seq_of_serializer32 (serialize32_public_header cid_len) ph)\n\n#push-options \"--z3rlimit 32\"\nlet header_encrypt\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n: Tot (b: bytes { b == Header.header_encrypt a hpk h c })\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = format_header h `Seq.append` c in\n if is_retry h\n then\n r\n else\n let pn_offset = pn_offset h in\n let pn_len = Declassify.uint_to_nat (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Header.pn_sizemask pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet putative_pn_offset\n (cid_len: nat)\n (x: bytes)\n: Tot (y: option nat { y == Parse.putative_pn_offset cid_len x })\n= if cid_len > 20\n then None\n else\n match LP.parse_tot_seq_of_parser32 (parse32_public_header (U32.uint_to_t cid_len)) x with\n | None -> None\n | Some (_, consumed) ->\n LP.parser_kind_prop_equiv (Public.parse_header_kind (U32.uint_to_t cid_len)) (Public.parse_header (U32.uint_to_t cid_len));\n Some (consumed <: nat)\n\n[@\"opaque_to_smt\"]\nlet header_decrypt_aux\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n cid_len: Prims.nat{cid_len <= 20} ->\n packet: QUIC.Spec.Crypto.packet\n -> y:\n FStar.Pervasives.Native.option QUIC.Spec.Header.header_decrypt_aux_t\n {y == QUIC.Spec.Header.header_decrypt_aux a hpk cid_len packet}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "QUIC.Spec.Crypto.packet", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "FStar.Pervasives.Native.None", "QUIC.Spec.Header.header_decrypt_aux_t", "Prims.bool", "FStar.Pervasives.Native.Some", "QUIC.Spec.Header.Mkheader_decrypt_aux_t", "QUIC.TotSpec.putative_pn_offset", "Prims.op_GreaterThan", "Prims.op_Addition", "QUIC.Spec.Base.bytes", "QUIC.Spec.Lemmas.xor_inplace", "QUIC.Spec.Lemmas.and_inplace", "FStar.Seq.Base.slice", "QUIC.Spec.Header.pn_sizemask", "LowParse.BitFields.ubitfield", "Prims.op_Subtraction", "LowParse.BitFields.get_bitfield", "FStar.UInt8.n", "FStar.Seq.Base.seq", "FStar.Seq.Properties.cons", "FStar.UInt8.uint_to_t", "FStar.UInt.uint_t", "LowParse.BitFields.set_bitfield", "FStar.UInt8.v", "FStar.UInt.logxor", "FStar.Seq.Base.index", "Prims.l_and", "FStar.Seq.Base.equal", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "QUIC.TotSpec.block_of_sample", "QUIC.TotSpec.seq_reveal", "Lib.IntTypes.int_t", "QUIC.Secret.Seq.seq_hide", "FStar.Pervasives.Native.option", "Prims.eq2", "QUIC.Spec.Header.header_decrypt_aux", "Prims.op_AmpAmp", "Prims.op_Negation" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_decrypt_aux\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet: packet)\n : Tot\n (y: option Header.header_decrypt_aux_t {y == Header.header_decrypt_aux a hpk cid_len packet})\nlet header_decrypt_aux\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (packet: packet)\n : Tot\n (y: option Header.header_decrypt_aux_t {y == Header.header_decrypt_aux a hpk cid_len packet}) =", "completed_definiton": "let open FStar.Math.Lemmas in\nif Seq.length packet = 0\nthen None\nelse\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some\n ({\n Header.is_short = is_short;\n Header.is_retry = is_retry;\n Header.packet = packet;\n Header.pn_offset = ();\n Header.pn_len = ()\n })\n else\n match putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset + 16)) in\n let mask = seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let protected_bits = if is_short then 5 else 4 in\n let f' =\n BF.set_bitfield (U8.v f)\n 0\n protected_bits\n (BF.get_bitfield ((U8.v f) `FStar.UInt.logxor` (U8.v (Seq.index mask 0)))\n 0\n protected_bits)\n in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask =\n Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Header.pn_sizemask pn_len) 0\n in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some\n ({\n Header.is_short = is_short;\n Header.is_retry = is_retry;\n Header.packet = packet'';\n Header.pn_offset = pn_offset;\n Header.pn_len = pn_len\n })", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.serialize32_header_body", "original_source_type": "val serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n : Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))", "source_type": "val serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n : Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))", "source_definition": "let serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.serialize32_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize32_flbytes (U32.v short_dcid_len))\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n serialize32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n serialize32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n serialize32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n serialize32_long_retry_body", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 301, "start_col": 2, "end_line": 311, "end_col": 31 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )\n\nlet serialize32_long_retry_body : LP.serializer32 Public.serialize_long_retry_body =\n serialize32_common_long `LP.serialize32_nondep_then` LP.serialize32_bounded_vlbytes 0 20 \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 8, "max_fuel": 8, "initial_ifuel": 8, "max_ifuel": 8, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n x: LowParse.Spec.BitSum.bitsum'_key_type QUIC.Spec.Header.Public.first_byte\n -> LowParse.SLow.Base.serializer32 (QUIC.Spec.Header.Public.serialize_header_body short_dcid_len x\n )", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "LowParse.Spec.BitSum.bitsum'_key_type", "FStar.UInt8.t", "LowParse.BitFields.uint8", "QUIC.Spec.Header.Public.first_byte", "LowParse.SLow.Combinators.serialize32_weaken", "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some", "LowParse.Spec.Base.total_constant_size_parser_kind", "FStar.UInt32.v", "FStar.Bytes.lbytes", "LowParse.Spec.Bytes.parse_flbytes", "LowParse.Spec.Bytes.serialize_flbytes", "LowParse.SLow.Bytes.serialize32_flbytes", "QUIC.TotSpec.serialize32_long_initial_body", "QUIC.TotSpec.serialize32_long_zero_rtt_body", "QUIC.TotSpec.serialize32_long_handshake_body", "QUIC.TotSpec.serialize32_long_retry_body", "LowParse.SLow.Base.serializer32", "Prims.__proj__Mkdtuple2__item___1", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.parser", "QUIC.Spec.Header.Public.header_body_type", "QUIC.Spec.Header.Public.parse_header_body", "FStar.Pervasives.dsnd", "QUIC.Spec.Header.Public.serialize_header_body" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n : Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))\nlet serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n : Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x)) =", "completed_definiton": "match x with\n| (| Public.Short , (| () , () |) |) ->\n LP.serialize32_weaken (LP.strong_parser_kind 0 20 None)\n (LP.serialize32_flbytes (U32.v short_dcid_len))\n| (| Public.Long , (| () , (| Public.Initial , () |) |) |) -> serialize32_long_initial_body\n| (| Public.Long , (| () , (| Public.ZeroRTT , () |) |) |) -> serialize32_long_zero_rtt_body\n| (| Public.Long , (| () , (| Public.Handshake , () |) |) |) -> serialize32_long_handshake_body\n| (| Public.Long , (| () , (| Public.Retry , () |) |) |) -> serialize32_long_retry_body", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.serialize32_varint", "original_source_type": "val serialize32_varint:LP.serializer32 VI.serialize_varint", "source_type": "val serialize32_varint:LP.serializer32 VI.serialize_varint", "source_definition": "let serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 128, "start_col": 2, "end_line": 129, "end_col": 83 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.SLow.Base.serializer32 QUIC.Spec.VarInt.serialize_varint", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.UInt62.t", "FStar.Bytes.append", "LowParse.SLow.Int.serialize32_u8", "QUIC.Spec.VarInt.get_first_byte", "QUIC.TotSpec.serialize32_varint_payload", "LowParse.SLow.Base.bytes32", "LowParse.SLow.Base.serializer32_correct", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.Spec.VarInt.parse_varint", "QUIC.Spec.VarInt.serialize_varint" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val serialize32_varint:LP.serializer32 VI.serialize_varint\nlet serialize32_varint:LP.serializer32 VI.serialize_varint =", "completed_definiton": "fun x -> (LP.serialize32_u8 (VI.get_first_byte x)) `B32.append` (serialize32_varint_payload x)", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.pn_offset", "original_source_type": "val pn_offset (h: header{~(is_retry h)}) : Tot (y: nat{y == Parse.pn_offset h})", "source_type": "val pn_offset (h: header{~(is_retry h)}) : Tot (y: nat{y == Parse.pn_offset h})", "source_definition": "let pn_offset\n (h: header { ~ (is_retry h) })\n: Tot (y: nat { y == Parse.pn_offset h })\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Seq.length (LP.serialize_tot_seq_of_serializer32 (serialize32_public_header cid_len) ph)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 493, "start_col": 1, "end_line": 496, "end_col": 90 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )\n\nlet serialize32_long_retry_body : LP.serializer32 Public.serialize_long_retry_body =\n serialize32_common_long `LP.serialize32_nondep_then` LP.serialize32_bounded_vlbytes 0 20 \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.serialize32_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize32_flbytes (U32.v short_dcid_len))\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n serialize32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n serialize32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n serialize32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n serialize32_long_retry_body\n\n#pop-options\n\nlet serialize32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer32 (Public.serialize_header short_dcid_len))\n= LPB.serialize32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.serialize32_u8\n #(Public.parse_header_body short_dcid_len)\n (Public.serialize_header_body short_dcid_len)\n (serialize32_header_body short_dcid_len)\n ()\n\n#push-options \"--z3rlimit 64\"\n\nlet lp_parse32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser32 (Parse.lp_parse_header short_dcid_len last))\n= fun x ->\n Parse.lp_parse_header_eq short_dcid_len last (B32.reveal x); ((\n match parse32_public_header short_dcid_len x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (Parse.synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n LP.parser32_consumes (parse32_public_header short_dcid_len) x;\n assert (U32.v consumed <= B32.length x);\n match parse32_packet_number last (Parse.get_pn_length ph) (B32.slice x consumed (B32.len x)) with\n | None -> None\n | Some (pn, consumed') ->\n Some (Parse.synth_header short_dcid_len last (| ph, pn |), consumed `U32.add` consumed')\n end\n ) <: (y: _ { LP.parser32_correct (Parse.lp_parse_header short_dcid_len last) x y } ))\n\n#pop-options\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 5 { y == Parse.mk_short_protected_bits reserved_bits key_phase pnl })\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 4 { y == Parse.mk_long_protected_bits reserved_bits pnl })\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2\n (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))\n ) 2 4 reserved_bits\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: Parse.header' short_dcid_len last)\n: Tot (y: dtuple2 (Public.header' short_dcid_len) (Parse.packet_number_opt short_dcid_len last) { y == Parse.synth_header_recip short_dcid_len last x })\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n Parse.mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\n#push-options \"--z3rlimit 128\"\n\n#restart-solver\n\nlet serialize32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer32 (Parse.serialize_header short_dcid_len last))\n= fun h ->\n Parse.serialize_header_eq short_dcid_len last h;\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n serialize32_public_header short_dcid_len ph `B32.append`\n (if is_retry h\n then B32.empty_bytes\n else serialize32_packet_number last (pn_length h) pn)\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet parse_header\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (b:bytes)\n: Tot (r: Parse.h_result { r == Parse.parse_header cid_len last b })\n= match LP.parse_tot_seq_of_parser32 (lp_parse32_header (U32.uint_to_t cid_len) (Secret.to_u64 (U64.uint_to_t last))) b with\n | None -> Parse.H_Failure\n | Some (h, consumed) -> Parse.H_Success h (Seq.slice b consumed (Seq.length b))\n\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet last_packet_number\n (h: header)\n: Tot (y: PN.last_packet_number_t { y == Parse.last_packet_number h })\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in\n if Declassify.uint_to_nat pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\n[@\"opaque_to_smt\"]\nlet format_header\n (h: header)\n: Tot (y: bytes { y == Parse.format_header h })\n=\n Parse.in_window_last_packet_number h;\n LP.serialize_tot_seq_of_serializer32 (serialize32_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\n(* header protection *)\n\n[@\"opaque_to_smt\"]\nirreducible\nlet rec seq_reveal'\n (x: Seq.seq Secret.uint8)\n (accu: Seq.seq byte)\n: Tot (y: Seq.seq byte { y `Seq.equal` (accu `Seq.append` Seq.seq_reveal x) })\n (decreases (Seq.length x))\n= if Seq.length x = 0\n then accu\n else (seq_reveal' (Seq.slice x 1 (Seq.length x)) (Seq.append accu (Seq.create 1 (Declassify.u8_to_UInt8 (Seq.index x 0)))) <: Seq.seq byte)\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet seq_reveal\n (x: Seq.seq Secret.uint8)\n: Tot (y: Seq.seq byte { y `Seq.equal` Seq.seq_reveal x })\n= seq_reveal' x Seq.empty\n\n[@\"opaque_to_smt\"]\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: Tot (y: Seq.lseq Secret.uint8 16 { y == Header.block_of_sample a k sample })\n=\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet pn_offset\n (h: header { ~ (is_retry h) })", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Spec.Header.Base.header{~(QUIC.Spec.Header.Base.is_retry h)}\n -> y: Prims.nat{y == QUIC.Spec.Header.Parse.pn_offset h}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Spec.Header.Base.is_retry", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "FStar.Seq.Base.length", "LowParse.Bytes.byte", "LowParse.SLow.Base.serialize_tot_seq_of_serializer32", "QUIC.Spec.Header.Public.parse_header_kind", "QUIC.Spec.Header.Public.parse_header", "QUIC.Spec.Header.Public.serialize_header", "QUIC.TotSpec.serialize32_public_header", "Prims.nat", "Prims.eq2", "QUIC.Spec.Header.Parse.pn_offset", "Prims.dtuple2", "QUIC.Spec.Header.Parse.synth_header_recip", "QUIC.TotSpec.synth_header_recip", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Parse.last_packet_number", "QUIC.TotSpec.last_packet_number", "FStar.UInt32.t", "FStar.UInt32.uint_to_t", "QUIC.Spec.Header.Base.dcid_len" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val pn_offset (h: header{~(is_retry h)}) : Tot (y: nat{y == Parse.pn_offset h})\nlet pn_offset (h: header{~(is_retry h)}) : Tot (y: nat{y == Parse.pn_offset h}) =", "completed_definiton": "let cid_len = U32.uint_to_t (dcid_len h) in\nlet last = last_packet_number h in\nlet (| ph , _ |) = synth_header_recip cid_len last h in\nSeq.length (LP.serialize_tot_seq_of_serializer32 (serialize32_public_header cid_len) ph)", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.parse32_varint'", "original_source_type": "val parse32_varint' (b: B32.bytes) : Tot (option (U62.t & U32.t))", "source_type": "val parse32_varint' (b: B32.bytes) : Tot (option (U62.t & U32.t))", "source_definition": "let parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 35, "start_col": 2, "end_line": 77, "end_col": 7 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: FStar.Bytes.bytes -> FStar.Pervasives.Native.option (QUIC.UInt62.t * FStar.UInt32.t)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Bytes.bytes", "LowParse.SLow.Int.parse32_u8", "FStar.Pervasives.Native.None", "FStar.Pervasives.Native.tuple2", "QUIC.UInt62.t", "FStar.UInt32.t", "FStar.UInt8.t", "Prims.op_Equality", "FStar.UInt8.__uint_to_t", "FStar.Pervasives.Native.Some", "FStar.Pervasives.Native.Mktuple2", "Prims.bool", "FStar.UInt64.lte", "FStar.UInt64.__uint_to_t", "FStar.UInt32.add", "FStar.Pervasives.Native.option", "FStar.UInt64.add", "FStar.UInt64.mul", "FStar.Int.Cast.uint8_to_uint64", "LowParse.SLow.BoundedInt.parse32_bounded_integer", "LowParse.Spec.BoundedInt.bounded_integer", "FStar.Int.Cast.uint32_to_uint64", "LowParse.SLow.Combinators.parse32_nondep_then", "LowParse.Spec.Int.parse_u32_kind", "LowParse.Spec.Int.parse_u32", "LowParse.SLow.Int.parse32_u32", "LowParse.Spec.BoundedInt.parse_bounded_integer_kind", "LowParse.Spec.BoundedInt.parse_bounded_integer", "Prims.eq2", "FStar.Seq.Base.seq", "FStar.Bytes.reveal", "FStar.Seq.Base.slice", "FStar.UInt32.v", "FStar.Bytes.len", "FStar.Bytes.slice", "FStar.UInt64.t", "Prims.b2t", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt64.v", "FStar.UInt8.v", "LowParse.BitFields.__proj__Mkuint_t__item__get_bitfield", "LowParse.BitFields.uint8", "FStar.UInt.uint_t", "LowParse.BitFields.__proj__Mkuint_t__item__v", "LowParse.BitFields.get_bitfield", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.pow2", "Prims._assert", "Prims.op_GreaterThan", "FStar.UInt64.n", "QUIC.UInt62.bound" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val parse32_varint' (b: B32.bytes) : Tot (option (U62.t & U32.t))\nlet parse32_varint' (b: B32.bytes) : Tot (option (U62.t & U32.t)) =", "completed_definiton": "assert_norm (pow2 8 == 256);\nassert_norm (pow2 6 == 64);\nassert (pow2 62 == U64.v U62.bound);\nassert_norm (pow2 24 == 16777216);\nassert_norm (pow2 32 == 4294967296);\nmatch LP.parse32_u8 b with\n| None -> None\n| Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then Some ((msb <: U62.t), consumed)\n else\n if tag = 1uy\n then\n match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v:U62.t = (msb `U64.mul` 256uL) `U64.add` (Cast.uint8_to_uint64 lsb) in\n if 64uL `U64.lte` v then Some (v, consumed `U32.add` consumed') else None\n else\n if tag = 2uy\n then\n match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v:U62.t = (msb `U64.mul` 16777216uL) `U64.add` (Cast.uint32_to_uint64 lsb) in\n if 16384uL `U64.lte` v then Some (v, consumed `U32.add` consumed') else None\n else\n match (LP.parse32_u32 `LP.parse32_nondep_then` (LP.parse32_bounded_integer 3)) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v:U62.t =\n (Cast.uint32_to_uint64 lo)\n `U64.add`\n (16777216uL\n `U64.mul`\n ((Cast.uint32_to_uint64 hi) `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v then Some (v, consumed `U32.add` consumed') else None", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.synth_packet_number'", "original_source_type": "val synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n : Tot (pn: PN.packet_number_t' last pn_len {pn == PN.synth_packet_number last pn_len npn})", "source_type": "val synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n : Tot (pn: PN.packet_number_t' last pn_len {pn == PN.synth_packet_number last pn_len npn})", "source_definition": "let synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 157, "start_col": 2, "end_line": 157, "end_col": 125 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n npn: LowParse.Spec.BoundedInt.bounded_integer (QUIC.Secret.Int.Base.v pn_len)\n -> pn:\n QUIC.Spec.PacketNumber.Base.packet_number_t' last pn_len\n {pn == QUIC.Spec.PacketNumber.synth_packet_number last pn_len npn}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "LowParse.Spec.BoundedInt.bounded_integer", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "Lib.IntTypes.to_u64", "Lib.IntTypes.U64", "Lib.IntTypes.PUB", "FStar.UInt64.uint_to_t", "QUIC.Spec.PacketNumber.expand_pn'", "Prims.op_Subtraction", "Lib.RawIntTypes.uint_to_nat", "FStar.UInt32.v", "QUIC.Spec.PacketNumber.Base.packet_number_t'", "Prims.eq2", "QUIC.Spec.PacketNumber.synth_packet_number" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n : Tot (pn: PN.packet_number_t' last pn_len {pn == PN.synth_packet_number last pn_len npn})\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n : Tot (pn: PN.packet_number_t' last pn_len {pn == PN.synth_packet_number last pn_len npn}) =", "completed_definiton": "Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1)\n (Declassify.uint_to_nat last)\n (U32.v npn)))", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.synth_header_recip", "original_source_type": "val synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: Parse.header' short_dcid_len last)\n : Tot\n (y:\n dtuple2 (Public.header' short_dcid_len) (Parse.packet_number_opt short_dcid_len last)\n {y == Parse.synth_header_recip short_dcid_len last x})", "source_type": "val synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: Parse.header' short_dcid_len last)\n : Tot\n (y:\n dtuple2 (Public.header' short_dcid_len) (Parse.packet_number_opt short_dcid_len last)\n {y == Parse.synth_header_recip short_dcid_len last x})", "source_definition": "let synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: Parse.header' short_dcid_len last)\n: Tot (y: dtuple2 (Public.header' short_dcid_len) (Parse.packet_number_opt short_dcid_len last) { y == Parse.synth_header_recip short_dcid_len last x })\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n Parse.mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 379, "start_col": 2, "end_line": 396, "end_col": 7 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )\n\nlet serialize32_long_retry_body : LP.serializer32 Public.serialize_long_retry_body =\n serialize32_common_long `LP.serialize32_nondep_then` LP.serialize32_bounded_vlbytes 0 20 \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.serialize32_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize32_flbytes (U32.v short_dcid_len))\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n serialize32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n serialize32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n serialize32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n serialize32_long_retry_body\n\n#pop-options\n\nlet serialize32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer32 (Public.serialize_header short_dcid_len))\n= LPB.serialize32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.serialize32_u8\n #(Public.parse_header_body short_dcid_len)\n (Public.serialize_header_body short_dcid_len)\n (serialize32_header_body short_dcid_len)\n ()\n\n#push-options \"--z3rlimit 64\"\n\nlet lp_parse32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser32 (Parse.lp_parse_header short_dcid_len last))\n= fun x ->\n Parse.lp_parse_header_eq short_dcid_len last (B32.reveal x); ((\n match parse32_public_header short_dcid_len x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (Parse.synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n LP.parser32_consumes (parse32_public_header short_dcid_len) x;\n assert (U32.v consumed <= B32.length x);\n match parse32_packet_number last (Parse.get_pn_length ph) (B32.slice x consumed (B32.len x)) with\n | None -> None\n | Some (pn, consumed') ->\n Some (Parse.synth_header short_dcid_len last (| ph, pn |), consumed `U32.add` consumed')\n end\n ) <: (y: _ { LP.parser32_correct (Parse.lp_parse_header short_dcid_len last) x y } ))\n\n#pop-options\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 5 { y == Parse.mk_short_protected_bits reserved_bits key_phase pnl })\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 4 { y == Parse.mk_long_protected_bits reserved_bits pnl })\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2\n (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))\n ) 2 4 reserved_bits\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: Parse.header' short_dcid_len last)", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n x: QUIC.Spec.Header.Parse.header' short_dcid_len last\n -> y:\n Prims.dtuple2 (QUIC.Spec.Header.Public.header' short_dcid_len)\n (QUIC.Spec.Header.Parse.packet_number_opt short_dcid_len last)\n {y == QUIC.Spec.Header.Parse.synth_header_recip short_dcid_len last x}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Parse.header'", "QUIC.Spec.Base.bitfield", "Prims.bool", "QUIC.Spec.Base.vlbytes", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Prims.Mkdtuple2", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "QUIC.Spec.Header.Public.PShort", "QUIC.TotSpec.mk_short_protected_bits", "Prims.unit", "QUIC.Spec.Header.Parse.mk_short_protected_bits_correct", "FStar.UInt32.t", "QUIC.Spec.Header.Base.long_header_specifics", "QUIC.Spec.Header.Public.PLong", "QUIC.Spec.Header.Public.PRetry", "QUIC.Spec.Base.token_max_len", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.TotSpec.mk_long_protected_bits", "QUIC.Spec.Header.Public.PInitial", "QUIC.Spec.Header.Parse.mk_long_protected_bits_correct", "QUIC.Spec.Header.Public.PHandshake", "QUIC.Spec.Header.Public.PZeroRTT", "Prims.dtuple2", "Prims.eq2", "QUIC.Spec.Header.Parse.synth_header_recip" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: Parse.header' short_dcid_len last)\n : Tot\n (y:\n dtuple2 (Public.header' short_dcid_len) (Parse.packet_number_opt short_dcid_len last)\n {y == Parse.synth_header_recip short_dcid_len last x})\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: Parse.header' short_dcid_len last)\n : Tot\n (y:\n dtuple2 (Public.header' short_dcid_len) (Parse.packet_number_opt short_dcid_len last)\n {y == Parse.synth_header_recip short_dcid_len last x}) =", "completed_definiton": "match x with\n| MShort rb spin key_phase dcid pnl pn ->\n Parse.mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n| MLong version dcid scid spec ->\n match spec with\n | MRetry unused odcid -> (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (|\n Public.PLong (mk_long_protected_bits rb pnl)\n version\n dcid\n scid\n (Public.PInitial token payload_and_pn_length),\n pn\n |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (|\n Public.PLong (mk_long_protected_bits rb pnl)\n version\n dcid\n scid\n (Public.PHandshake payload_and_pn_length),\n pn\n |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (|\n Public.PLong (mk_long_protected_bits rb pnl)\n version\n dcid\n scid\n (Public.PZeroRTT payload_and_pn_length),\n pn\n |)", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.header_encrypt", "original_source_type": "val header_encrypt\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n : Tot (b: bytes{b == Header.header_encrypt a hpk h c})", "source_type": "val header_encrypt\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n : Tot (b: bytes{b == Header.header_encrypt a hpk h c})", "source_definition": "let header_encrypt\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n: Tot (b: bytes { b == Header.header_encrypt a hpk h c })\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = format_header h `Seq.append` c in\n if is_retry h\n then\n r\n else\n let pn_offset = pn_offset h in\n let pn_len = Declassify.uint_to_nat (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Header.pn_sizemask pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 506, "start_col": 2, "end_line": 522, "end_col": 5 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )\n\nlet serialize32_long_retry_body : LP.serializer32 Public.serialize_long_retry_body =\n serialize32_common_long `LP.serialize32_nondep_then` LP.serialize32_bounded_vlbytes 0 20 \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.serialize32_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize32_flbytes (U32.v short_dcid_len))\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n serialize32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n serialize32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n serialize32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n serialize32_long_retry_body\n\n#pop-options\n\nlet serialize32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer32 (Public.serialize_header short_dcid_len))\n= LPB.serialize32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.serialize32_u8\n #(Public.parse_header_body short_dcid_len)\n (Public.serialize_header_body short_dcid_len)\n (serialize32_header_body short_dcid_len)\n ()\n\n#push-options \"--z3rlimit 64\"\n\nlet lp_parse32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser32 (Parse.lp_parse_header short_dcid_len last))\n= fun x ->\n Parse.lp_parse_header_eq short_dcid_len last (B32.reveal x); ((\n match parse32_public_header short_dcid_len x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (Parse.synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n LP.parser32_consumes (parse32_public_header short_dcid_len) x;\n assert (U32.v consumed <= B32.length x);\n match parse32_packet_number last (Parse.get_pn_length ph) (B32.slice x consumed (B32.len x)) with\n | None -> None\n | Some (pn, consumed') ->\n Some (Parse.synth_header short_dcid_len last (| ph, pn |), consumed `U32.add` consumed')\n end\n ) <: (y: _ { LP.parser32_correct (Parse.lp_parse_header short_dcid_len last) x y } ))\n\n#pop-options\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 5 { y == Parse.mk_short_protected_bits reserved_bits key_phase pnl })\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 4 { y == Parse.mk_long_protected_bits reserved_bits pnl })\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2\n (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))\n ) 2 4 reserved_bits\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: Parse.header' short_dcid_len last)\n: Tot (y: dtuple2 (Public.header' short_dcid_len) (Parse.packet_number_opt short_dcid_len last) { y == Parse.synth_header_recip short_dcid_len last x })\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n Parse.mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\n#push-options \"--z3rlimit 128\"\n\n#restart-solver\n\nlet serialize32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer32 (Parse.serialize_header short_dcid_len last))\n= fun h ->\n Parse.serialize_header_eq short_dcid_len last h;\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n serialize32_public_header short_dcid_len ph `B32.append`\n (if is_retry h\n then B32.empty_bytes\n else serialize32_packet_number last (pn_length h) pn)\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet parse_header\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (b:bytes)\n: Tot (r: Parse.h_result { r == Parse.parse_header cid_len last b })\n= match LP.parse_tot_seq_of_parser32 (lp_parse32_header (U32.uint_to_t cid_len) (Secret.to_u64 (U64.uint_to_t last))) b with\n | None -> Parse.H_Failure\n | Some (h, consumed) -> Parse.H_Success h (Seq.slice b consumed (Seq.length b))\n\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet last_packet_number\n (h: header)\n: Tot (y: PN.last_packet_number_t { y == Parse.last_packet_number h })\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in\n if Declassify.uint_to_nat pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\n[@\"opaque_to_smt\"]\nlet format_header\n (h: header)\n: Tot (y: bytes { y == Parse.format_header h })\n=\n Parse.in_window_last_packet_number h;\n LP.serialize_tot_seq_of_serializer32 (serialize32_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\n(* header protection *)\n\n[@\"opaque_to_smt\"]\nirreducible\nlet rec seq_reveal'\n (x: Seq.seq Secret.uint8)\n (accu: Seq.seq byte)\n: Tot (y: Seq.seq byte { y `Seq.equal` (accu `Seq.append` Seq.seq_reveal x) })\n (decreases (Seq.length x))\n= if Seq.length x = 0\n then accu\n else (seq_reveal' (Seq.slice x 1 (Seq.length x)) (Seq.append accu (Seq.create 1 (Declassify.u8_to_UInt8 (Seq.index x 0)))) <: Seq.seq byte)\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet seq_reveal\n (x: Seq.seq Secret.uint8)\n: Tot (y: Seq.seq byte { y `Seq.equal` Seq.seq_reveal x })\n= seq_reveal' x Seq.empty\n\n[@\"opaque_to_smt\"]\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: Tot (y: Seq.lseq Secret.uint8 16 { y == Header.block_of_sample a k sample })\n=\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet pn_offset\n (h: header { ~ (is_retry h) })\n: Tot (y: nat { y == Parse.pn_offset h })\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Seq.length (LP.serialize_tot_seq_of_serializer32 (serialize32_public_header cid_len) ph)\n\n#push-options \"--z3rlimit 32\"\nlet header_encrypt\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n: Tot (b: bytes { b == Header.header_encrypt a hpk h c })", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n h: QUIC.Spec.Header.Base.header ->\n c: QUIC.Spec.Crypto.cbytes' (QUIC.Spec.Header.Base.is_retry h)\n -> b: QUIC.Spec.Base.bytes{b == QUIC.Spec.Header.header_encrypt a hpk h c}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "QUIC.Spec.Header.Base.header", "QUIC.Spec.Crypto.cbytes'", "QUIC.Spec.Header.Base.is_retry", "Prims.bool", "FStar.Seq.Base.seq", "QUIC.Spec.Base.byte", "FStar.Seq.Properties.cons", "FStar.UInt8.uint_to_t", "FStar.Seq.Base.slice", "FStar.Seq.Base.length", "QUIC.Spec.Base.bytes", "QUIC.Spec.Lemmas.xor_inplace", "FStar.UInt.uint_t", "LowParse.BitFields.set_bitfield", "FStar.UInt8.n", "FStar.UInt8.v", "LowParse.BitFields.get_bitfield", "FStar.UInt.logxor", "FStar.Seq.Base.index", "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "QUIC.Spec.Header.Base.uu___is_MShort", "QUIC.Spec.Lemmas.and_inplace", "Prims.op_Addition", "QUIC.Spec.Header.pn_sizemask", "FStar.Seq.Base.equal", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "QUIC.TotSpec.block_of_sample", "QUIC.TotSpec.seq_reveal", "Lib.IntTypes.int_t", "QUIC.Secret.Seq.seq_hide", "Prims.op_Subtraction", "Prims.int", "Lib.RawIntTypes.uint_to_nat", "Lib.IntTypes.U32", "QUIC.Spec.Header.Base.pn_length", "Prims.eq2", "QUIC.Spec.Header.Parse.pn_offset", "QUIC.TotSpec.pn_offset", "QUIC.Spec.Header.header_encrypt", "FStar.Seq.Base.append", "QUIC.TotSpec.format_header", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.op_LessThan", "QUIC.Spec.Crypto.max_cipher_length", "Prims.pow2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_encrypt\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n : Tot (b: bytes{b == Header.header_encrypt a hpk h c})\nlet header_encrypt\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n : Tot (b: bytes{b == Header.header_encrypt a hpk h c}) =", "completed_definiton": "assert_norm (max_cipher_length < pow2 62);\nlet r = (format_header h) `Seq.append` c in\nif is_retry h\nthen r\nelse\n let pn_offset = pn_offset h in\n let pn_len = Declassify.uint_to_nat (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3 - pn_len) (19 - pn_len)) in\n let mask = seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Header.pn_sizemask pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let f' =\n BF.set_bitfield (U8.v f)\n 0\n protected_bits\n (BF.get_bitfield ((U8.v f) `FStar.UInt.logxor` (U8.v (Seq.index mask 0))) 0 protected_bits)\n in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.parse32_varint'_correct", "original_source_type": "val parse32_varint'_correct (input: B32.bytes)\n : Lemma (LP.parser32_correct VI.parse_varint input (parse32_varint' input))", "source_type": "val parse32_varint'_correct (input: B32.bytes)\n : Lemma (LP.parser32_correct VI.parse_varint input (parse32_varint' input))", "source_definition": "let parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 83, "start_col": 2, "end_line": 83, "end_col": 39 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "input: FStar.Bytes.bytes\n -> FStar.Pervasives.Lemma\n (ensures\n LowParse.SLow.Base.parser32_correct QUIC.Spec.VarInt.parse_varint\n input\n (QUIC.TotSpec.parse32_varint' input))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Bytes.bytes", "QUIC.Spec.VarInt.parse_varint_eq", "FStar.Bytes.reveal", "Prims.unit", "Prims.l_True", "Prims.squash", "LowParse.SLow.Base.parser32_correct", "QUIC.Spec.VarInt.parse_varint_kind", "QUIC.UInt62.t", "QUIC.Spec.VarInt.parse_varint", "QUIC.TotSpec.parse32_varint'", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse32_varint'_correct (input: B32.bytes)\n : Lemma (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\nlet parse32_varint'_correct (input: B32.bytes)\n : Lemma (LP.parser32_correct VI.parse_varint input (parse32_varint' input)) =", "completed_definiton": "VI.parse_varint_eq (B32.reveal input)", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.serialize32_header", "original_source_type": "val serialize32_header (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Tot (LP.serializer32 (Parse.serialize_header short_dcid_len last))", "source_type": "val serialize32_header (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Tot (LP.serializer32 (Parse.serialize_header short_dcid_len last))", "source_definition": "let serialize32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer32 (Parse.serialize_header short_dcid_len last))\n= fun h ->\n Parse.serialize_header_eq short_dcid_len last h;\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n serialize32_public_header short_dcid_len ph `B32.append`\n (if is_retry h\n then B32.empty_bytes\n else serialize32_packet_number last (pn_length h) pn)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 406, "start_col": 2, "end_line": 412, "end_col": 58 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )\n\nlet serialize32_long_retry_body : LP.serializer32 Public.serialize_long_retry_body =\n serialize32_common_long `LP.serialize32_nondep_then` LP.serialize32_bounded_vlbytes 0 20 \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.serialize32_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize32_flbytes (U32.v short_dcid_len))\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n serialize32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n serialize32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n serialize32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n serialize32_long_retry_body\n\n#pop-options\n\nlet serialize32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer32 (Public.serialize_header short_dcid_len))\n= LPB.serialize32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.serialize32_u8\n #(Public.parse_header_body short_dcid_len)\n (Public.serialize_header_body short_dcid_len)\n (serialize32_header_body short_dcid_len)\n ()\n\n#push-options \"--z3rlimit 64\"\n\nlet lp_parse32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser32 (Parse.lp_parse_header short_dcid_len last))\n= fun x ->\n Parse.lp_parse_header_eq short_dcid_len last (B32.reveal x); ((\n match parse32_public_header short_dcid_len x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (Parse.synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n LP.parser32_consumes (parse32_public_header short_dcid_len) x;\n assert (U32.v consumed <= B32.length x);\n match parse32_packet_number last (Parse.get_pn_length ph) (B32.slice x consumed (B32.len x)) with\n | None -> None\n | Some (pn, consumed') ->\n Some (Parse.synth_header short_dcid_len last (| ph, pn |), consumed `U32.add` consumed')\n end\n ) <: (y: _ { LP.parser32_correct (Parse.lp_parse_header short_dcid_len last) x y } ))\n\n#pop-options\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 5 { y == Parse.mk_short_protected_bits reserved_bits key_phase pnl })\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 4 { y == Parse.mk_long_protected_bits reserved_bits pnl })\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2\n (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))\n ) 2 4 reserved_bits\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: Parse.header' short_dcid_len last)\n: Tot (y: dtuple2 (Public.header' short_dcid_len) (Parse.packet_number_opt short_dcid_len last) { y == Parse.synth_header_recip short_dcid_len last x })\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n Parse.mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\n#push-options \"--z3rlimit 128\"\n\n#restart-solver\n\nlet serialize32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n short_dcid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t\n -> LowParse.SLow.Base.serializer32 (QUIC.Spec.Header.Parse.serialize_header short_dcid_len last)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Header.Parse.header'", "QUIC.Spec.Header.Public.header'", "QUIC.Spec.Header.Parse.packet_number_opt", "FStar.Bytes.append", "QUIC.TotSpec.serialize32_public_header", "QUIC.Spec.Header.Base.is_retry", "FStar.Bytes.empty_bytes", "Prims.bool", "QUIC.TotSpec.serialize32_packet_number", "QUIC.Spec.Header.Base.pn_length", "FStar.Bytes.bytes", "LowParse.SLow.Base.bytes32", "LowParse.SLow.Base.serializer32_correct", "QUIC.Spec.Header.Parse.parse_header_kind", "QUIC.Spec.Header.Parse.lp_parse_header", "QUIC.Spec.Header.Parse.serialize_header", "Prims.dtuple2", "Prims.eq2", "QUIC.Spec.Header.Parse.synth_header_recip", "QUIC.TotSpec.synth_header_recip", "Prims.unit", "QUIC.Spec.Header.Parse.serialize_header_eq", "LowParse.SLow.Base.serializer32" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val serialize32_header (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Tot (LP.serializer32 (Parse.serialize_header short_dcid_len last))\nlet serialize32_header (short_dcid_len: short_dcid_len_t) (last: PN.last_packet_number_t)\n : Tot (LP.serializer32 (Parse.serialize_header short_dcid_len last)) =", "completed_definiton": "fun h ->\n Parse.serialize_header_eq short_dcid_len last h;\n let (| ph , pn |) = synth_header_recip short_dcid_len last h in\n (serialize32_public_header short_dcid_len ph)\n `B32.append`\n (if is_retry h then B32.empty_bytes else serialize32_packet_number last (pn_length h) pn)", "isa_cross_project_example": true }, { "file_name": "QUIC.TotSpec.fst", "name": "QUIC.TotSpec.header_decrypt", "original_source_type": "val header_decrypt\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (last: nat{last + 1 < pow2 62})\n (packet: packet)\n : Tot (r: Header.h_result{r == Header.header_decrypt a hpk cid_len last packet})", "source_type": "val header_decrypt\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (last: nat{last + 1 < pow2 62})\n (packet: packet)\n : Tot (r: Header.h_result{r == Header.header_decrypt a hpk cid_len last packet})", "source_definition": "let header_decrypt\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (packet: packet)\n: Tot (r: Header.h_result { r == Header.header_decrypt a hpk cid_len last packet })\n=\n let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then Header.H_Failure\n else\n match header_decrypt_aux a hpk cid_len packet with\n | None -> Header.H_Failure\n | Some r ->\n let packet'' = r.Header.packet in\n begin match parse_header cid_len last packet'' with\n | Parse.H_Failure -> Header.H_Failure\n | Parse.H_Success h rem' ->\n Header.header_decrypt_aux_post_parse a hpk cid_len last packet;\n if is_retry h\n then\n Header.H_Success h Seq.empty rem'\n else\n let clen = if has_payload_length h then Declassify.uint_to_nat (payload_length h) else Seq.length rem' in\n assert_norm (16 < max_cipher_length - 1);\n (* payload_length is secret, so, to stay constant-time, we\n must not check for failure. Instead, we compute some length\n that might be garbage if bounds on payload_length do not hold. *)\n let clen = Header.max (Header.min (Header.min clen (Seq.length rem')) (max_cipher_length - 1)) 16 in\n assert (clen < max_cipher_length);\n assert (clen <= Seq.length rem');\n assert (16 <= clen);\n let c = Seq.slice rem' 0 clen in\n let rem = Seq.slice rem' clen (Seq.length rem') in\n Header.H_Success h c rem\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.TotSpec.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 604, "start_col": 2, "end_line": 632, "end_col": 9 }, "file_context": "module QUIC.TotSpec\n\nfriend QUIC.Spec\nfriend QUIC.Spec.Header\nfriend QUIC.Spec.Header.Parse\nfriend QUIC.Spec.Header.Public\nfriend QUIC.Spec.PacketNumber\nfriend QUIC.Spec.VarInt\n\nmodule PN = QUIC.Spec.PacketNumber\nmodule VI = QUIC.Spec.VarInt\nmodule Public = QUIC.Spec.Header.Public\nmodule Parse = QUIC.Spec.Header.Parse\nmodule Header = QUIC.Spec.Header\nmodule Lemmas = QUIC.Spec.Lemmas\nmodule Spec = QUIC.Spec\n\nmodule LP = LowParse.SLow\nmodule LPB = LowParse.SLow.BitSum\n\nmodule U8 = FStar.UInt8\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule BF = LowParse.BitFields\nmodule B32 = LowParse.Bytes32\nmodule Cast = FStar.Int.Cast\nmodule U32 = FStar.UInt32\nmodule Seq = QUIC.Secret.Seq\n\n#push-options \"--z3rlimit 128\"\n\nlet parse32_varint'\n (b: B32.bytes)\n: Tot (option (U62.t & U32.t))\n= assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match LP.parse32_u8 b with\n | None -> None\n | Some (hd, consumed) ->\n let tag = BF.uint8.BF.get_bitfield hd 6 8 in\n let msb = Cast.uint8_to_uint64 (BF.uint8.BF.get_bitfield hd 0 6) in\n let b' = B32.slice b consumed (B32.len b) in\n if tag = 0uy\n then\n Some ((msb <: U62.t), consumed)\n else if tag = 1uy\n then begin match LP.parse32_u8 b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t = (msb `U64.mul` 256uL) `U64.add` Cast.uint8_to_uint64 lsb in\n if 64uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n else if tag = 2uy\n then begin match (LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some (lsb, consumed') ->\n let v : U62.t =\n (msb `U64.mul` 16777216uL) `U64.add` Cast.uint32_to_uint64 lsb\n in\n if 16384uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end else begin match (LP.parse32_u32 `LP.parse32_nondep_then` LP.parse32_bounded_integer 3) b' with\n | None -> None\n | Some ((hi, lo), consumed') ->\n let v : U62.t =\n Cast.uint32_to_uint64 lo `U64.add` (16777216uL `U64.mul` (Cast.uint32_to_uint64 hi `U64.add` (4294967296uL `U64.mul` msb)))\n in\n if 1073741824uL `U64.lte` v\n then Some (v, consumed `U32.add` consumed')\n else None\n end\n\nlet parse32_varint'_correct\n (input: B32.bytes)\n: Lemma\n (LP.parser32_correct VI.parse_varint input (parse32_varint' input))\n= VI.parse_varint_eq (B32.reveal input)\n\n#pop-options\n\nlet parse32_varint\n: LP.parser32 VI.parse_varint\n= fun input ->\n parse32_varint'_correct input; \n parse32_varint' input\n\nlet parse32_bounded_varint\n (min: U32.t)\n (max: U32.t { U32.v min <= U32.v max })\n: Tot (LP.parser32 (VI.parse_bounded_varint (U32.v min) (U32.v max)))\n= LP.parse32_synth'\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (U32.v min) (U32.v max))\n (VI.synth_bounded_varint (U32.v min) (U32.v max))\n (LP.parse32_filter\n parse32_varint\n (VI.varint_in_bounds (U32.v min) (U32.v max))\n (fun x -> Cast.uint32_to_uint64 min `U64.lte` x && x `U64.lte` Cast.uint32_to_uint64 max)\n )\n ()\n\nlet serialize32_varint_payload\n (x: U62.t)\n: Tot B32.bytes\n=\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 6 == 64);\n assert (pow2 62 == U64.v U62.bound);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n if x `U64.lt` 64uL\n then B32.empty_bytes\n else if x `U64.lt` 16384uL\n then LP.serialize32_u8 (Cast.uint64_to_uint8 x)\n else if x `U64.lt` 1073741824uL\n then (LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n else (LP.serialize32_u32 `LP.serialize32_nondep_then` LP.serialize32_bounded_integer 3) (Cast.uint64_to_uint32 (x `U64.div` 16777216uL), Cast.uint64_to_uint32 (x `U64.rem` 16777216uL))\n\n#push-options \"--z3rlimit 16\"\n\nlet serialize32_varint\n : LP.serializer32 VI.serialize_varint\n= fun x ->\n LP.serialize32_u8 (VI.get_first_byte x) `B32.append` serialize32_varint_payload x\n\nlet serialize32_bounded_varint\n (min: nat)\n (max: nat { min <= max /\\ max < 4294967296 })\n: Tot (LP.serializer32 (VI.serialize_bounded_varint min max))\n= LP.serialize32_synth\n (VI.parse_varint `LP.parse_filter` VI.varint_in_bounds (min) (max))\n (VI.synth_bounded_varint (min) (max))\n (VI.serialize_varint `LP.serialize_filter` VI.varint_in_bounds min max)\n (serialize32_varint `LP.serialize32_filter` VI.varint_in_bounds min max)\n (VI.synth_bounded_varint_recip min max)\n (fun x -> VI.synth_bounded_varint_recip min max x)\n ()\n\n#pop-options\n \n(* Packet number. *)\n\nmodule Declassify = Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)\n\n#push-options \"--z3rlimit 16\"\n\nlet synth_packet_number'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (npn: LP.bounded_integer (Secret.v pn_len))\n: Tot (pn: PN.packet_number_t' last pn_len { pn == PN.synth_packet_number last pn_len npn })\n= Secret.to_u64 (U64.uint_to_t (PN.expand_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat last) (U32.v npn)))\n\n#pop-options\n\nlet parse32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_reduced_pn pn_len ()))\n= LP.parse32_weaken\n PN.parse_packet_number_kind\n (LP.parse32_bounded_integer (Declassify.uint_to_nat pn_len))\n\nlet parse32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.parser32 (PN.parse_packet_number last pn_len))\n= LP.parse32_synth\n _\n (PN.synth_packet_number last pn_len)\n (synth_packet_number' last pn_len)\n (LP.lift_parser32 (PN.parse_reduced_pn pn_len) (parse32_reduced_pn pn_len))\n ()\n\nlet serialize32_reduced_pn\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_reduced_pn pn_len ()))\n= LP.serialize32_weaken\n PN.parse_packet_number_kind\n (LP.serialize32_bounded_integer (Declassify.uint_to_nat pn_len))\n\n#push-options \"--z3rlimit 16\"\nlet synth_packet_number_recip'\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t' last pn_len)\n: Tot (npn: LP.bounded_integer (Secret.v pn_len) { npn == PN.synth_packet_number_recip last pn_len pn })\n= U32.uint_to_t (PN.reduce_pn' (Declassify.uint_to_nat pn_len - 1) (Declassify.uint_to_nat pn))\n#pop-options\n\nlet serialize32_packet_number\n (last: PN.last_packet_number_t)\n (pn_len: PN.packet_number_length_t)\n: Tot (LP.serializer32 (PN.serialize_packet_number last pn_len))\n= LP.serialize32_synth\n (LP.lift_parser (PN.parse_reduced_pn pn_len))\n (PN.synth_packet_number last pn_len)\n (LP.lift_serializer #_ #_ #(PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len))\n (LP.lift_serializer32 #PN.parse_packet_number_kind #(LP.bounded_integer (Declassify.uint_to_nat pn_len)) (PN.parse_reduced_pn pn_len) (PN.serialize_reduced_pn pn_len) (serialize32_reduced_pn pn_len))\n (PN.synth_packet_number_recip last pn_len)\n (synth_packet_number_recip' last pn_len)\n ()\n\n(* Parsing the public header *)\n\nlet parse32_common_long : LP.parser32 Public.parse_common_long =\n LP.parse32_u32 `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul `LP.parse32_nondep_then`\n LP.parse32_bounded_vlbytes 0 0ul 20 20ul\n )\n\nlet parse32_payload_and_pn_length : LP.parser32 Public.parse_payload_and_pn_length =\n LP.parse32_filter\n parse32_varint\n Public.payload_and_pn_length_prop\n (fun x -> Public.payload_and_pn_length_prop x)\n\nlet parse32_long_zero_rtt_body : LP.parser32 Public.parse_long_zero_rtt_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_handshake_body : LP.parser32 Public.parse_long_handshake_body =\n parse32_common_long `LP.parse32_nondep_then` parse32_payload_and_pn_length\n\nlet parse32_long_initial_body : LP.parser32 Public.parse_long_initial_body =\n parse32_common_long `LP.parse32_nondep_then` (\n LP.parse32_bounded_vlgenbytes 0 0ul token_max_len (U32.uint_to_t token_max_len) (parse32_bounded_varint 0ul (U32.uint_to_t token_max_len)) `LP.parse32_nondep_then`\n parse32_payload_and_pn_length\n )\n\nlet parse32_long_retry_body : LP.parser32 Public.parse_long_retry_body =\n parse32_common_long `LP.parse32_nondep_then` LP.parse32_bounded_vlbytes 0 0ul 20 20ul \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet parse32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.parser32 (dsnd (Public.parse_header_body short_dcid_len x)))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.parse32_weaken (LP.strong_parser_kind 0 20 None) (LP.parse32_flbytes (U32.v short_dcid_len) short_dcid_len)\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n parse32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n parse32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n parse32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n parse32_long_retry_body\n\n#pop-options\n\nlet parse32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.parser32 (Public.parse_header short_dcid_len))\n= LPB.parse32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.parse32_u8\n (Public.parse_header_body short_dcid_len)\n (parse32_header_body short_dcid_len)\n\nlet serialize32_common_long : LP.serializer32 Public.serialize_common_long =\n LP.serialize32_u32 `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlbytes 0 20 `LP.serialize32_nondep_then`\n LP.serialize32_bounded_vlbytes 0 20\n )\n\nlet serialize32_payload_and_pn_length : LP.serializer32 Public.serialize_payload_and_pn_length =\n LP.serialize32_filter\n serialize32_varint\n Public.payload_and_pn_length_prop\n\nlet serialize32_long_zero_rtt_body : LP.serializer32 Public.serialize_long_zero_rtt_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_handshake_body : LP.serializer32 Public.serialize_long_handshake_body =\n serialize32_common_long `LP.serialize32_nondep_then` serialize32_payload_and_pn_length\n\nlet serialize32_long_initial_body : LP.serializer32 Public.serialize_long_initial_body =\n serialize32_common_long `LP.serialize32_nondep_then` (\n LP.serialize32_bounded_vlgenbytes 0 token_max_len (serialize32_bounded_varint 0 (token_max_len)) `LP.serialize32_nondep_then`\n serialize32_payload_and_pn_length\n )\n\nlet serialize32_long_retry_body : LP.serializer32 Public.serialize_long_retry_body =\n serialize32_common_long `LP.serialize32_nondep_then` LP.serialize32_bounded_vlbytes 0 20 \n\n#push-options \"--z3rlimit 32 --max_fuel 8 --max_ifuel 8 --initial_fuel 8 --initial_ifuel 8\"\n\nlet serialize32_header_body\n (short_dcid_len: short_dcid_len_t)\n (x: LPB.bitsum'_key_type Public.first_byte)\n: Tot (LP.serializer32 (Public.serialize_header_body short_dcid_len x))\n= match x with\n | (| Public.Short, (| (), () |) |) ->\n LP.serialize32_weaken (LP.strong_parser_kind 0 20 None) (LP.serialize32_flbytes (U32.v short_dcid_len))\n | (| Public.Long, (| (), (| Public.Initial, () |) |) |) ->\n serialize32_long_initial_body\n | (| Public.Long, (| (), (| Public.ZeroRTT, () |) |) |) ->\n serialize32_long_zero_rtt_body\n | (| Public.Long, (| (), (| Public.Handshake, () |) |) |) ->\n serialize32_long_handshake_body\n | (| Public.Long, (| (), (| Public.Retry, () |) |) |) ->\n serialize32_long_retry_body\n\n#pop-options\n\nlet serialize32_public_header\n (short_dcid_len: short_dcid_len_t)\n: Tot (LP.serializer32 (Public.serialize_header short_dcid_len))\n= LPB.serialize32_bitsum\n Public.first_byte\n (Public.first_byte_of_header short_dcid_len)\n (Public.header_body_type short_dcid_len)\n (Public.header_synth short_dcid_len)\n LP.serialize32_u8\n #(Public.parse_header_body short_dcid_len)\n (Public.serialize_header_body short_dcid_len)\n (serialize32_header_body short_dcid_len)\n ()\n\n#push-options \"--z3rlimit 64\"\n\nlet lp_parse32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.parser32 (Parse.lp_parse_header short_dcid_len last))\n= fun x ->\n Parse.lp_parse_header_eq short_dcid_len last (B32.reveal x); ((\n match parse32_public_header short_dcid_len x with\n | None -> None\n | Some (ph, consumed) ->\n if Public.is_retry ph\n then Some (Parse.synth_header short_dcid_len last (| ph, () |), consumed)\n else begin\n LP.parser32_consumes (parse32_public_header short_dcid_len) x;\n assert (U32.v consumed <= B32.length x);\n match parse32_packet_number last (Parse.get_pn_length ph) (B32.slice x consumed (B32.len x)) with\n | None -> None\n | Some (pn, consumed') ->\n Some (Parse.synth_header short_dcid_len last (| ph, pn |), consumed `U32.add` consumed')\n end\n ) <: (y: _ { LP.parser32_correct (Parse.lp_parse_header short_dcid_len last) x y } ))\n\n#pop-options\n\nlet mk_short_protected_bits\n (reserved_bits: bitfield 2)\n (key_phase: bool)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 5 { y == Parse.mk_short_protected_bits reserved_bits key_phase pnl })\n= BF.set_bitfield_bound #8 0 5 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 5 2 3 (if key_phase then 1 else 0);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 2 3 (if key_phase then 1 else 0)) 5 3 5 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2 (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))) 2 3 (if key_phase then 1uy else 0uy)) 3 5 reserved_bits\n\nlet mk_long_protected_bits\n (reserved_bits: bitfield 2)\n (pnl: PN.packet_number_length_t)\n: Tot (y: bitfield 4 { y == Parse.mk_long_protected_bits reserved_bits pnl })\n= BF.set_bitfield_bound #8 0 4 0 2 (Secret.v pnl - 1);\n BF.set_bitfield_bound #8 (BF.set_bitfield #8 0 0 2 (Secret.v pnl - 1)) 4 2 4 (U8.v reserved_bits);\n BF.uint8.BF.set_bitfield (BF.uint8.BF.set_bitfield 0uy 0 2\n (Declassify.u8_to_UInt8 (Secret.cast_down Secret.U8 (pnl `Secret.sub` Secret.to_u32 1ul)))\n ) 2 4 reserved_bits\n\nlet synth_header_recip\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (x: Parse.header' short_dcid_len last)\n: Tot (y: dtuple2 (Public.header' short_dcid_len) (Parse.packet_number_opt short_dcid_len last) { y == Parse.synth_header_recip short_dcid_len last x })\n= match x with\n | MShort rb spin key_phase dcid pnl pn ->\n Parse.mk_short_protected_bits_correct rb key_phase pnl;\n (| Public.PShort (mk_short_protected_bits rb key_phase pnl) spin dcid, pn |)\n | MLong version dcid scid spec ->\n begin match spec with\n | MRetry unused odcid ->\n (| Public.PLong unused version dcid scid (Public.PRetry odcid), () |)\n | MInitial rb token payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PInitial token payload_and_pn_length), pn |)\n | MHandshake rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PHandshake payload_and_pn_length), pn |)\n | MZeroRTT rb payload_and_pn_length pnl pn ->\n Parse.mk_long_protected_bits_correct rb pnl;\n (| Public.PLong (mk_long_protected_bits rb pnl) version dcid scid (Public.PZeroRTT payload_and_pn_length), pn |)\n end\n\n#push-options \"--z3rlimit 128\"\n\n#restart-solver\n\nlet serialize32_header\n (short_dcid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n: Tot (LP.serializer32 (Parse.serialize_header short_dcid_len last))\n= fun h ->\n Parse.serialize_header_eq short_dcid_len last h;\n let (| ph, pn |) = synth_header_recip short_dcid_len last h in\n serialize32_public_header short_dcid_len ph `B32.append`\n (if is_retry h\n then B32.empty_bytes\n else serialize32_packet_number last (pn_length h) pn)\n\n#pop-options\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet parse_header\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (b:bytes)\n: Tot (r: Parse.h_result { r == Parse.parse_header cid_len last b })\n= match LP.parse_tot_seq_of_parser32 (lp_parse32_header (U32.uint_to_t cid_len) (Secret.to_u64 (U64.uint_to_t last))) b with\n | None -> Parse.H_Failure\n | Some (h, consumed) -> Parse.H_Success h (Seq.slice b consumed (Seq.length b))\n\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet last_packet_number\n (h: header)\n: Tot (y: PN.last_packet_number_t { y == Parse.last_packet_number h })\n= if is_retry h then Secret.to_u64 0uL else let pn = packet_number h in\n if Declassify.uint_to_nat pn = 0 then Secret.to_u64 0uL else pn `Secret.sub` Secret.to_u64 1uL\n\n[@\"opaque_to_smt\"]\nlet format_header\n (h: header)\n: Tot (y: bytes { y == Parse.format_header h })\n=\n Parse.in_window_last_packet_number h;\n LP.serialize_tot_seq_of_serializer32 (serialize32_header (U32.uint_to_t (dcid_len h)) (last_packet_number h)) h\n\n(* header protection *)\n\n[@\"opaque_to_smt\"]\nirreducible\nlet rec seq_reveal'\n (x: Seq.seq Secret.uint8)\n (accu: Seq.seq byte)\n: Tot (y: Seq.seq byte { y `Seq.equal` (accu `Seq.append` Seq.seq_reveal x) })\n (decreases (Seq.length x))\n= if Seq.length x = 0\n then accu\n else (seq_reveal' (Seq.slice x 1 (Seq.length x)) (Seq.append accu (Seq.create 1 (Declassify.u8_to_UInt8 (Seq.index x 0)))) <: Seq.seq byte)\n\n[@\"opaque_to_smt\"]\ninline_for_extraction\nlet seq_reveal\n (x: Seq.seq Secret.uint8)\n: Tot (y: Seq.seq byte { y `Seq.equal` Seq.seq_reveal x })\n= seq_reveal' x Seq.empty\n\n[@\"opaque_to_smt\"]\nlet block_of_sample\n (a: Cipher.cipher_alg)\n (k: Cipher.key a)\n (sample: Seq.lseq Secret.uint8 16)\n: Tot (y: Seq.lseq Secret.uint8 16 { y == Header.block_of_sample a k sample })\n=\n let open FStar.Mul in\n let ctr, iv = match a with\n | Cipher.CHACHA20 ->\n let ctr_bytes, iv = Seq.split sample 4 in\n FStar.Endianness.lemma_le_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.le_to_n (seq_reveal ctr_bytes), iv\n | _ ->\n let iv, ctr_bytes = Seq.split sample 12 in\n FStar.Endianness.lemma_be_to_n_is_bounded (Seq.seq_reveal ctr_bytes);\n assert_norm (pow2 (8 * 4) = pow2 32);\n FStar.Endianness.be_to_n (seq_reveal ctr_bytes), iv\n in\n (Seq.slice (Cipher.ctr_block a k iv ctr) 0 16)\n\n#push-options \"--z3rlimit 16\"\n\n[@\"opaque_to_smt\"]\nlet pn_offset\n (h: header { ~ (is_retry h) })\n: Tot (y: nat { y == Parse.pn_offset h })\n= let cid_len = U32.uint_to_t (dcid_len h) in\n let last = last_packet_number h in\n let (| ph, _ |) = synth_header_recip cid_len last h in\n Seq.length (LP.serialize_tot_seq_of_serializer32 (serialize32_public_header cid_len) ph)\n\n#push-options \"--z3rlimit 32\"\nlet header_encrypt\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (h: header)\n (c: cbytes' (is_retry h))\n: Tot (b: bytes { b == Header.header_encrypt a hpk h c })\n=\n assert_norm(max_cipher_length < pow2 62);\n let r = format_header h `Seq.append` c in\n if is_retry h\n then\n r\n else\n let pn_offset = pn_offset h in\n let pn_len = Declassify.uint_to_nat (pn_length h) - 1 in\n let sample = Seq.seq_hide (Seq.slice c (3-pn_len) (19-pn_len)) in\n let mask = seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Header.pn_sizemask pn_len) 0 in\n let f = Seq.index r 0 in\n let protected_bits = if MShort? h then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let r = Lemmas.xor_inplace r pnmask pn_offset in\n let r = Seq.cons (U8.uint_to_t f') (Seq.slice r 1 (Seq.length r)) in\n r\n#pop-options\n\n[@\"opaque_to_smt\"]\nlet putative_pn_offset\n (cid_len: nat)\n (x: bytes)\n: Tot (y: option nat { y == Parse.putative_pn_offset cid_len x })\n= if cid_len > 20\n then None\n else\n match LP.parse_tot_seq_of_parser32 (parse32_public_header (U32.uint_to_t cid_len)) x with\n | None -> None\n | Some (_, consumed) ->\n LP.parser_kind_prop_equiv (Public.parse_header_kind (U32.uint_to_t cid_len)) (Public.parse_header (U32.uint_to_t cid_len));\n Some (consumed <: nat)\n\n[@\"opaque_to_smt\"]\nlet header_decrypt_aux\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (packet: packet)\n: Tot (y: option Header.header_decrypt_aux_t { y == Header.header_decrypt_aux a hpk cid_len packet })\n= let open FStar.Math.Lemmas in\n if Seq.length packet = 0\n then None\n else\n let f = Seq.index packet 0 in\n let is_short = (BF.get_bitfield (U8.v f) 7 8 = 0) in\n let is_retry = not is_short && BF.get_bitfield (U8.v f) 4 6 = 3 in\n if is_retry\n then\n Some ({\n Header.is_short = is_short;\n Header.is_retry = is_retry;\n Header.packet = packet;\n Header.pn_offset = ();\n Header.pn_len = ();\n })\n else\n match putative_pn_offset cid_len packet with\n | None -> None\n | Some pn_offset ->\n let sample_offset = pn_offset + 4 in\n if sample_offset + 16 > Seq.length packet\n then None\n else begin\n let sample = Seq.seq_hide (Seq.slice packet sample_offset (sample_offset+16)) in\n let mask = seq_reveal (block_of_sample (AEAD.cipher_alg_of_supported_alg a) hpk sample) in\n (* mask the least significant bits of the first byte *)\n let protected_bits = if is_short then 5 else 4 in\n let f' = BF.set_bitfield (U8.v f) 0 protected_bits (BF.get_bitfield (U8.v f `FStar.UInt.logxor` U8.v (Seq.index mask 0)) 0 protected_bits) in\n let packet' = Seq.cons (U8.uint_to_t f') (Seq.slice packet 1 (Seq.length packet)) in\n (* now the packet number length is available, so mask the packet number *)\n let pn_len = BF.get_bitfield f' 0 2 in\n let pnmask = Lemmas.and_inplace (Seq.slice mask 1 (pn_len + 2)) (Header.pn_sizemask pn_len) 0 in\n let packet'' = Lemmas.xor_inplace packet' pnmask pn_offset in\n Some ({\n Header.is_short = is_short;\n Header.is_retry = is_retry;\n Header.packet = packet'';\n Header.pn_offset = pn_offset;\n Header.pn_len = pn_len;\n })\n end\n\n#pop-options\n\n#push-options \"--z3rlimit 32\"\n\n#restart-solver\n\n[@\"opaque_to_smt\"]\nlet header_decrypt\n (a:ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (packet: packet)\n: Tot (r: Header.h_result { r == Header.header_decrypt a hpk cid_len last packet })", "dependencies": { "source_file": "QUIC.TotSpec.fst", "checked_file": "QUIC.TotSpec.fst.checked", "interface_file": true, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.VarInt.fst.checked", "QUIC.Spec.PacketNumber.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Header.Public.fst.checked", "QUIC.Spec.Header.Parse.fst.checked", "QUIC.Spec.Header.fst.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "prims.fst.checked", "LowParse.SLow.BitSum.fst.checked", "LowParse.SLow.fst.checked", "LowParse.Bytes32.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.Endianness.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes (* this spec is only for proof purposes, so we do not care about preserving secrets/constant-time execution *)" }, { "abbrev": true, "short_module": "Declassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "B32", "full_module": "LowParse.Bytes32" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "LPB", "full_module": "LowParse.SLow.BitSum" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.SLow" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "Header", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "VI", "full_module": "QUIC.Spec.VarInt" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n hpk: Spec.Agile.Cipher.key (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n cid_len: Prims.nat{cid_len <= 20} ->\n last: Prims.nat{last + 1 < Prims.pow2 62} ->\n packet: QUIC.Spec.Crypto.packet\n -> r: QUIC.Spec.Header.h_result{r == QUIC.Spec.Header.header_decrypt a hpk cid_len last packet}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.Cipher.key", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "Prims.op_Addition", "Prims.pow2", "QUIC.Spec.Crypto.packet", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "QUIC.Spec.Header.H_Failure", "Prims.bool", "QUIC.TotSpec.header_decrypt_aux", "QUIC.Spec.Header.header_decrypt_aux_t", "QUIC.TotSpec.parse_header", "QUIC.Spec.Header.Base.header", "QUIC.Spec.Base.bytes", "QUIC.Spec.Header.Base.is_retry", "QUIC.Spec.Header.H_Success", "FStar.Seq.Base.empty", "FStar.Seq.Base.seq", "FStar.Seq.Base.slice", "Prims.unit", "Prims._assert", "QUIC.Spec.Crypto.max_cipher_length", "Prims.l_and", "Prims.op_GreaterThanOrEqual", "QUIC.Spec.Header.min", "Prims.op_Subtraction", "Prims.l_or", "QUIC.Spec.Header.max", "FStar.Pervasives.assert_norm", "QUIC.Spec.Header.Base.has_payload_length", "Lib.RawIntTypes.uint_to_nat", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "QUIC.Spec.Header.Base.payload_length", "QUIC.Spec.Header.h_result", "Prims.eq2", "QUIC.Spec.Header.header_decrypt", "QUIC.Spec.Header.header_decrypt_aux_post_parse", "QUIC.Spec.Header.__proj__Mkheader_decrypt_aux_t__item__packet" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_decrypt\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (last: nat{last + 1 < pow2 62})\n (packet: packet)\n : Tot (r: Header.h_result{r == Header.header_decrypt a hpk cid_len last packet})\nlet header_decrypt\n (a: ea)\n (hpk: Cipher.key (AEAD.cipher_alg_of_supported_alg a))\n (cid_len: nat{cid_len <= 20})\n (last: nat{last + 1 < pow2 62})\n (packet: packet)\n : Tot (r: Header.h_result{r == Header.header_decrypt a hpk cid_len last packet}) =", "completed_definiton": "let open FStar.Math.Lemmas in\nif Seq.length packet = 0\nthen Header.H_Failure\nelse\n match header_decrypt_aux a hpk cid_len packet with\n | None -> Header.H_Failure\n | Some r ->\n let packet'' = r.Header.packet in\n match parse_header cid_len last packet'' with\n | Parse.H_Failure -> Header.H_Failure\n | Parse.H_Success h rem' ->\n Header.header_decrypt_aux_post_parse a hpk cid_len last packet;\n if is_retry h\n then Header.H_Success h Seq.empty rem'\n else\n let clen =\n if has_payload_length h\n then Declassify.uint_to_nat (payload_length h)\n else Seq.length rem'\n in\n assert_norm (16 < max_cipher_length - 1);\n let clen =\n Header.max (Header.min (Header.min clen (Seq.length rem')) (max_cipher_length - 1)) 16\n in\n assert (clen < max_cipher_length);\n assert (clen <= Seq.length rem');\n assert (16 <= clen);\n let c = Seq.slice rem' 0 clen in\n let rem = Seq.slice rem' clen (Seq.length rem') in\n Header.H_Success h c rem", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fsti", "name": "Model.QUIC.safe", "original_source_type": "", "source_type": "val safe : i: Model.QUIC.id -> Prims.bool", "source_definition": "let safe (i:id) = AEAD.is_safe (dfst i)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 25, "start_col": 18, "end_line": 25, "end_col": 39 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nmodule Spec = QUIC.Spec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\nopen FStar.UInt32\nopen Mem\n\ntype id = i:AE.id & j:PNE.id{PNE.is_safe j <==> AEAD.is_safe i}", "dependencies": { "source_file": "Model.QUIC.fsti", "checked_file": "Model.QUIC.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: Model.QUIC.id -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.AEAD.is_safe", "FStar.Pervasives.dfst", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Prims.b2t", "Model.PNE.is_safe", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let safe (i: id) =", "completed_definiton": "AEAD.is_safe (dfst i)", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fsti", "name": "Model.QUIC.unsafe", "original_source_type": "", "source_type": "val unsafe : i: Model.QUIC.id -> Prims.bool", "source_definition": "let unsafe (i:id) = not (safe i)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 27, "start_col": 20, "end_line": 27, "end_col": 32 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nmodule Spec = QUIC.Spec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\nopen FStar.UInt32\nopen Mem\n\ntype id = i:AE.id & j:PNE.id{PNE.is_safe j <==> AEAD.is_safe i}\n\nlet safe (i:id) = AEAD.is_safe (dfst i)", "dependencies": { "source_file": "Model.QUIC.fsti", "checked_file": "Model.QUIC.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: Model.QUIC.id -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Prims.op_Negation", "Model.QUIC.safe", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let unsafe (i: id) =", "completed_definiton": "not (safe i)", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fsti", "name": "Model.QUIC.unsafe_id", "original_source_type": "", "source_type": "val unsafe_id : Type0", "source_definition": "let unsafe_id = i:id{unsafe i}", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 28, "start_col": 16, "end_line": 28, "end_col": 30 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nmodule Spec = QUIC.Spec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\nopen FStar.UInt32\nopen Mem\n\ntype id = i:AE.id & j:PNE.id{PNE.is_safe j <==> AEAD.is_safe i}\n\nlet safe (i:id) = AEAD.is_safe (dfst i)\nlet safe_id = i:id{safe i}", "dependencies": { "source_file": "Model.QUIC.fsti", "checked_file": "Model.QUIC.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Prims.b2t", "Model.QUIC.unsafe" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let unsafe_id =", "completed_definiton": "i: id{unsafe i}", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fsti", "name": "Model.QUIC.safe_id", "original_source_type": "", "source_type": "val safe_id : Type0", "source_definition": "let safe_id = i:id{safe i}", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 26, "start_col": 14, "end_line": 26, "end_col": 26 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nmodule Spec = QUIC.Spec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\nopen FStar.UInt32\nopen Mem\n\ntype id = i:AE.id & j:PNE.id{PNE.is_safe j <==> AEAD.is_safe i}", "dependencies": { "source_file": "Model.QUIC.fsti", "checked_file": "Model.QUIC.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Prims.b2t", "Model.QUIC.safe" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let safe_id =", "completed_definiton": "i: id{safe i}", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fsti", "name": "Model.QUIC.max_ctr", "original_source_type": "", "source_type": "val max_ctr : Prims.int", "source_definition": "let max_ctr = pow2 62 - 1", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 44, "start_col": 14, "end_line": 44, "end_col": 25 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nmodule Spec = QUIC.Spec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\nopen FStar.UInt32\nopen Mem\n\ntype id = i:AE.id & j:PNE.id{PNE.is_safe j <==> AEAD.is_safe i}\n\nlet safe (i:id) = AEAD.is_safe (dfst i)\nlet safe_id = i:id{safe i}\nlet unsafe (i:id) = not (safe i)\nlet unsafe_id = i:id{unsafe i}\n\n/// Package for QUIC plaintexts\n/// (i.e. the payload of QUIC packets)\n/// This would be implemented as a serializable list of frames\n/// (using EverParse refined lists)\n\ntype qplain_len = n:AEAD.plain_length_at_least 3{n < Spec.max_plain_length}\nlet pnl = PNE.pne_plain_length\n\nval pne_pkg: PNE.pne_plain_pkg\n\nnoeq type info = {\n region: r:subq{r `HS.disjoint` q_ae_region};\n}", "dependencies": { "source_file": "Model.QUIC.fsti", "checked_file": "Model.QUIC.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.int", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.op_Subtraction", "Prims.pow2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let max_ctr =", "completed_definiton": "pow2 62 - 1", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fsti", "name": "Model.QUIC.wincrementable", "original_source_type": "", "source_type": "val wincrementable : w: Model.QUIC.stream_writer k -> h: FStar.Monotonic.HyperStack.mem{Model.QUIC.invariant w h}\n -> Prims.GTot Prims.bool", "source_definition": "let wincrementable (#k:id) (w:stream_writer k) (h:mem{invariant w h}) =\n wctrT w h < max_ctr", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 107, "start_col": 2, "end_line": 107, "end_col": 21 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nmodule Spec = QUIC.Spec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\nopen FStar.UInt32\nopen Mem\n\ntype id = i:AE.id & j:PNE.id{PNE.is_safe j <==> AEAD.is_safe i}\n\nlet safe (i:id) = AEAD.is_safe (dfst i)\nlet safe_id = i:id{safe i}\nlet unsafe (i:id) = not (safe i)\nlet unsafe_id = i:id{unsafe i}\n\n/// Package for QUIC plaintexts\n/// (i.e. the payload of QUIC packets)\n/// This would be implemented as a serializable list of frames\n/// (using EverParse refined lists)\n\ntype qplain_len = n:AEAD.plain_length_at_least 3{n < Spec.max_plain_length}\nlet pnl = PNE.pne_plain_length\n\nval pne_pkg: PNE.pne_plain_pkg\n\nnoeq type info = {\n region: r:subq{r `HS.disjoint` q_ae_region};\n}\n\nlet max_ctr = pow2 62 - 1\ntype epn (nl:pnl) = Spec.lbytes nl\ntype pn = n:nat{n <= max_ctr}\ntype rpn = n:U64.t{U64.v n < max_ctr}\nlet rpn_of_nat (j:nat{j < max_ctr}) : rpn = U64.uint_to_t j\n\nval stream_writer: (k:id) -> Type u#1\nval stream_reader: #k:id -> w:stream_writer k -> Type u#1\nval writer_info: #k:id -> w:stream_writer k -> info\nval reader_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> i:info{i == writer_info w}\n\nval writer_ae_info: #k:id -> w:stream_writer k -> a:AEAD.info (dfst k){a.AEAD.min_len == 3}\nval reader_ae_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> a:AEAD.info (dfst k){a.AEAD.min_len == 3}\nval writer_pne_info: #k:id -> w:stream_writer k -> a:PNE.info (dsnd k){a.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (writer_ae_info w).AEAD.alg /\\ a.PNE.halg == (writer_ae_info w).AEAD.halg}\nval reader_pne_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> a:PNE.info (dsnd k){a.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (reader_ae_info r).AEAD.alg /\\ a.PNE.halg == (reader_ae_info r).AEAD.halg}\n\nval writer_aead_state : (#k:id) -> (w:stream_writer k) ->\n aw:AEAD.aead_writer (dfst k)\nval reader_aead_state : #k:id -> #w:stream_writer k -> r:stream_reader w ->\n ar:AEAD.aead_reader (writer_aead_state w)\nval writer_pne_state : #k:id -> w:stream_writer k -> PNE.pne_state (writer_pne_info w)\nval reader_pne_state : #k:id -> #w:stream_writer k -> r:stream_reader w -> PNE.pne_state (reader_pne_info r)\n\ntype key_t #i (w:stream_writer i) =\n Spec.lbytes (SAE.key_length (writer_ae_info w).AEAD.alg) &\n Spec.lbytes (PNE.key_len (writer_pne_info w))\n\nlet writer_leak (#k:unsafe_id) (w:stream_writer k) : key_t w =\n Model.Helpers.reveal #(SAE.key_length (writer_ae_info w).AEAD.alg) (AEAD.wkey (writer_aead_state w)),\n Model.Helpers.reveal #(PNE.key_len (writer_pne_info w)) (PNE.key (writer_pne_state w))\n\nlet reader_leak (#k:unsafe_id) (#w:stream_writer k) (r:stream_reader w) : key_t w = writer_leak w\n\nval invariant: #k:id -> w:stream_writer k -> h:mem ->\n t:Type0{t ==> AEAD.winvariant (writer_aead_state w) h}\nval rinvariant: #k:id -> #w:stream_writer k -> r:stream_reader w -> h:mem ->\n t:Type0{t ==> invariant w h}\n\nval writer_offset: #k:id -> w:stream_writer k -> pn\nval reader_offset: #k:id -> #w:stream_writer k -> stream_reader w -> pn\n\nval wctrT: #k:id -> w:stream_writer k -> h:mem{invariant w h} -> \n GTot (n:nat{n >= writer_offset w /\\ n <= max_ctr})\n \nval wctr: #k:id -> w:stream_writer k -> ST (n:nat{n >= writer_offset w /\\ n <= max_ctr})\n (requires fun h0 -> invariant w h0)\n (ensures fun h0 c h1 -> h0 == h1 /\\ c = wctrT w h1)\n\ntype qiv (k:id) = Spec.lbytes 12 // SAE.iv (I.ae_id_ginfo (fst k))\nval writer_static_iv: #k:id -> w:stream_writer k -> qiv k\nval reader_static_iv: #k:id -> #w:stream_writer k -> r:stream_reader w ->\n iv:qiv k{iv == writer_static_iv w}\n\nval expected_pnT: #k:id -> #w:stream_writer k -> r:stream_reader w -> h:mem{rinvariant r h} ->\n GTot (n:nat{n >= writer_offset w /\\ n < max_ctr})\n \nval expected_pn: #k:id -> #w:stream_writer k -> r:stream_reader w ->\n ST (n:nat{n >= writer_offset w /\\ n <= max_ctr})\n (requires fun h0 -> rinvariant r h0)\n (ensures fun h0 c h1 -> h0 == h1 /\\\n (c == expected_pnT #k #w r h0))", "dependencies": { "source_file": "Model.QUIC.fsti", "checked_file": "Model.QUIC.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.QUIC.stream_writer k -> h: FStar.Monotonic.HyperStack.mem{Model.QUIC.invariant w h}\n -> Prims.GTot Prims.bool", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "FStar.Monotonic.HyperStack.mem", "Model.QUIC.invariant", "Prims.op_LessThan", "Model.QUIC.wctrT", "Model.QUIC.max_ctr", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let wincrementable (#k: id) (w: stream_writer k) (h: mem{invariant w h}) =", "completed_definiton": "wctrT w h < max_ctr", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fsti", "name": "Model.QUIC.reader_leak", "original_source_type": "val reader_leak (#k: unsafe_id) (#w: stream_writer k) (r: stream_reader w) : key_t w", "source_type": "val reader_leak (#k: unsafe_id) (#w: stream_writer k) (r: stream_reader w) : key_t w", "source_definition": "let reader_leak (#k:unsafe_id) (#w:stream_writer k) (r:stream_reader w) : key_t w = writer_leak w", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 75, "start_col": 84, "end_line": 75, "end_col": 97 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nmodule Spec = QUIC.Spec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\nopen FStar.UInt32\nopen Mem\n\ntype id = i:AE.id & j:PNE.id{PNE.is_safe j <==> AEAD.is_safe i}\n\nlet safe (i:id) = AEAD.is_safe (dfst i)\nlet safe_id = i:id{safe i}\nlet unsafe (i:id) = not (safe i)\nlet unsafe_id = i:id{unsafe i}\n\n/// Package for QUIC plaintexts\n/// (i.e. the payload of QUIC packets)\n/// This would be implemented as a serializable list of frames\n/// (using EverParse refined lists)\n\ntype qplain_len = n:AEAD.plain_length_at_least 3{n < Spec.max_plain_length}\nlet pnl = PNE.pne_plain_length\n\nval pne_pkg: PNE.pne_plain_pkg\n\nnoeq type info = {\n region: r:subq{r `HS.disjoint` q_ae_region};\n}\n\nlet max_ctr = pow2 62 - 1\ntype epn (nl:pnl) = Spec.lbytes nl\ntype pn = n:nat{n <= max_ctr}\ntype rpn = n:U64.t{U64.v n < max_ctr}\nlet rpn_of_nat (j:nat{j < max_ctr}) : rpn = U64.uint_to_t j\n\nval stream_writer: (k:id) -> Type u#1\nval stream_reader: #k:id -> w:stream_writer k -> Type u#1\nval writer_info: #k:id -> w:stream_writer k -> info\nval reader_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> i:info{i == writer_info w}\n\nval writer_ae_info: #k:id -> w:stream_writer k -> a:AEAD.info (dfst k){a.AEAD.min_len == 3}\nval reader_ae_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> a:AEAD.info (dfst k){a.AEAD.min_len == 3}\nval writer_pne_info: #k:id -> w:stream_writer k -> a:PNE.info (dsnd k){a.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (writer_ae_info w).AEAD.alg /\\ a.PNE.halg == (writer_ae_info w).AEAD.halg}\nval reader_pne_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> a:PNE.info (dsnd k){a.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (reader_ae_info r).AEAD.alg /\\ a.PNE.halg == (reader_ae_info r).AEAD.halg}\n\nval writer_aead_state : (#k:id) -> (w:stream_writer k) ->\n aw:AEAD.aead_writer (dfst k)\nval reader_aead_state : #k:id -> #w:stream_writer k -> r:stream_reader w ->\n ar:AEAD.aead_reader (writer_aead_state w)\nval writer_pne_state : #k:id -> w:stream_writer k -> PNE.pne_state (writer_pne_info w)\nval reader_pne_state : #k:id -> #w:stream_writer k -> r:stream_reader w -> PNE.pne_state (reader_pne_info r)\n\ntype key_t #i (w:stream_writer i) =\n Spec.lbytes (SAE.key_length (writer_ae_info w).AEAD.alg) &\n Spec.lbytes (PNE.key_len (writer_pne_info w))\n\nlet writer_leak (#k:unsafe_id) (w:stream_writer k) : key_t w =\n Model.Helpers.reveal #(SAE.key_length (writer_ae_info w).AEAD.alg) (AEAD.wkey (writer_aead_state w)),\n Model.Helpers.reveal #(PNE.key_len (writer_pne_info w)) (PNE.key (writer_pne_state w))", "dependencies": { "source_file": "Model.QUIC.fsti", "checked_file": "Model.QUIC.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "r: Model.QUIC.stream_reader w -> Model.QUIC.key_t w", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.unsafe_id", "Model.QUIC.stream_writer", "Model.QUIC.stream_reader", "Model.QUIC.writer_leak", "Model.QUIC.key_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val reader_leak (#k: unsafe_id) (#w: stream_writer k) (r: stream_reader w) : key_t w\nlet reader_leak (#k: unsafe_id) (#w: stream_writer k) (r: stream_reader w) : key_t w =", "completed_definiton": "writer_leak w", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fsti", "name": "Model.QUIC.pnl", "original_source_type": "", "source_type": "val pnl : Type0", "source_definition": "let pnl = PNE.pne_plain_length", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 36, "start_col": 10, "end_line": 36, "end_col": 30 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nmodule Spec = QUIC.Spec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\nopen FStar.UInt32\nopen Mem\n\ntype id = i:AE.id & j:PNE.id{PNE.is_safe j <==> AEAD.is_safe i}\n\nlet safe (i:id) = AEAD.is_safe (dfst i)\nlet safe_id = i:id{safe i}\nlet unsafe (i:id) = not (safe i)\nlet unsafe_id = i:id{unsafe i}\n\n/// Package for QUIC plaintexts\n/// (i.e. the payload of QUIC packets)\n/// This would be implemented as a serializable list of frames\n/// (using EverParse refined lists)", "dependencies": { "source_file": "Model.QUIC.fsti", "checked_file": "Model.QUIC.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.pne_plain_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let pnl =", "completed_definiton": "PNE.pne_plain_length", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fsti", "name": "Model.QUIC.max", "original_source_type": "", "source_type": "val max : a: Prims.nat -> b: Prims.nat -> Prims.nat", "source_definition": "let max (a b:nat) =\n// let open FStar.UInt64 in\n if a > b then a else b", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 330, "start_col": 2, "end_line": 330, "end_col": 24 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nmodule Spec = QUIC.Spec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\nopen FStar.UInt32\nopen Mem\n\ntype id = i:AE.id & j:PNE.id{PNE.is_safe j <==> AEAD.is_safe i}\n\nlet safe (i:id) = AEAD.is_safe (dfst i)\nlet safe_id = i:id{safe i}\nlet unsafe (i:id) = not (safe i)\nlet unsafe_id = i:id{unsafe i}\n\n/// Package for QUIC plaintexts\n/// (i.e. the payload of QUIC packets)\n/// This would be implemented as a serializable list of frames\n/// (using EverParse refined lists)\n\ntype qplain_len = n:AEAD.plain_length_at_least 3{n < Spec.max_plain_length}\nlet pnl = PNE.pne_plain_length\n\nval pne_pkg: PNE.pne_plain_pkg\n\nnoeq type info = {\n region: r:subq{r `HS.disjoint` q_ae_region};\n}\n\nlet max_ctr = pow2 62 - 1\ntype epn (nl:pnl) = Spec.lbytes nl\ntype pn = n:nat{n <= max_ctr}\ntype rpn = n:U64.t{U64.v n < max_ctr}\nlet rpn_of_nat (j:nat{j < max_ctr}) : rpn = U64.uint_to_t j\n\nval stream_writer: (k:id) -> Type u#1\nval stream_reader: #k:id -> w:stream_writer k -> Type u#1\nval writer_info: #k:id -> w:stream_writer k -> info\nval reader_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> i:info{i == writer_info w}\n\nval writer_ae_info: #k:id -> w:stream_writer k -> a:AEAD.info (dfst k){a.AEAD.min_len == 3}\nval reader_ae_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> a:AEAD.info (dfst k){a.AEAD.min_len == 3}\nval writer_pne_info: #k:id -> w:stream_writer k -> a:PNE.info (dsnd k){a.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (writer_ae_info w).AEAD.alg /\\ a.PNE.halg == (writer_ae_info w).AEAD.halg}\nval reader_pne_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> a:PNE.info (dsnd k){a.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (reader_ae_info r).AEAD.alg /\\ a.PNE.halg == (reader_ae_info r).AEAD.halg}\n\nval writer_aead_state : (#k:id) -> (w:stream_writer k) ->\n aw:AEAD.aead_writer (dfst k)\nval reader_aead_state : #k:id -> #w:stream_writer k -> r:stream_reader w ->\n ar:AEAD.aead_reader (writer_aead_state w)\nval writer_pne_state : #k:id -> w:stream_writer k -> PNE.pne_state (writer_pne_info w)\nval reader_pne_state : #k:id -> #w:stream_writer k -> r:stream_reader w -> PNE.pne_state (reader_pne_info r)\n\ntype key_t #i (w:stream_writer i) =\n Spec.lbytes (SAE.key_length (writer_ae_info w).AEAD.alg) &\n Spec.lbytes (PNE.key_len (writer_pne_info w))\n\nlet writer_leak (#k:unsafe_id) (w:stream_writer k) : key_t w =\n Model.Helpers.reveal #(SAE.key_length (writer_ae_info w).AEAD.alg) (AEAD.wkey (writer_aead_state w)),\n Model.Helpers.reveal #(PNE.key_len (writer_pne_info w)) (PNE.key (writer_pne_state w))\n\nlet reader_leak (#k:unsafe_id) (#w:stream_writer k) (r:stream_reader w) : key_t w = writer_leak w\n\nval invariant: #k:id -> w:stream_writer k -> h:mem ->\n t:Type0{t ==> AEAD.winvariant (writer_aead_state w) h}\nval rinvariant: #k:id -> #w:stream_writer k -> r:stream_reader w -> h:mem ->\n t:Type0{t ==> invariant w h}\n\nval writer_offset: #k:id -> w:stream_writer k -> pn\nval reader_offset: #k:id -> #w:stream_writer k -> stream_reader w -> pn\n\nval wctrT: #k:id -> w:stream_writer k -> h:mem{invariant w h} -> \n GTot (n:nat{n >= writer_offset w /\\ n <= max_ctr})\n \nval wctr: #k:id -> w:stream_writer k -> ST (n:nat{n >= writer_offset w /\\ n <= max_ctr})\n (requires fun h0 -> invariant w h0)\n (ensures fun h0 c h1 -> h0 == h1 /\\ c = wctrT w h1)\n\ntype qiv (k:id) = Spec.lbytes 12 // SAE.iv (I.ae_id_ginfo (fst k))\nval writer_static_iv: #k:id -> w:stream_writer k -> qiv k\nval reader_static_iv: #k:id -> #w:stream_writer k -> r:stream_reader w ->\n iv:qiv k{iv == writer_static_iv w}\n\nval expected_pnT: #k:id -> #w:stream_writer k -> r:stream_reader w -> h:mem{rinvariant r h} ->\n GTot (n:nat{n >= writer_offset w /\\ n < max_ctr})\n \nval expected_pn: #k:id -> #w:stream_writer k -> r:stream_reader w ->\n ST (n:nat{n >= writer_offset w /\\ n <= max_ctr})\n (requires fun h0 -> rinvariant r h0)\n (ensures fun h0 c h1 -> h0 == h1 /\\\n (c == expected_pnT #k #w r h0))\n\nlet wincrementable (#k:id) (w:stream_writer k) (h:mem{invariant w h}) =\n wctrT w h < max_ctr\n\nval footprint: #k:id -> w:stream_writer k -> GTot M.loc\nval rfootprint: #k:id -> #w:stream_writer k -> r:stream_reader w -> GTot M.loc\n\nval frame_invariant: #k:id -> w:stream_writer k -> h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n (invariant w h0 /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (footprint w)))\n (ensures invariant w h1 /\\\n wctrT w h0 == wctrT w h1)\n //AEAD.wlog (writer_aead_state w) h1 == AEAD.wlog (writer_aead_state w) h0 /\\\n //PNE.table (writer_pne_state w) h1 == PNE.table (writer_pne_state w) h0)\n [ SMTPat (M.modifies ri h0 h1); SMTPat (invariant w h1) ]\n (*[ SMTPatOr [\n [ SMTPat (M.modifies ri h0 h1); SMTPat (invariant w h1) ];\n [ SMTPat (M.modifies ri h0 h1); SMTPat (AEAD.wlog (writer_aead_state w) h1) ];\n [ SMTPat (M.modifies ri h0 h1); SMTPat (PNE.table (writer_pne_state w) h1) ]\n ]]*)\n\nval rframe_invariant: #k:id -> #w:stream_writer k -> r:stream_reader w ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n (rinvariant r h0 /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (rfootprint r)))\n (ensures rinvariant r h1 /\\\n expected_pnT r h0 == expected_pnT r h1)\n [ SMTPat (M.modifies ri h0 h1); SMTPat (rinvariant r h1) ]\n\nval wframe_log: #k:id{AEAD.is_safe (dfst k)} -> w:stream_writer k -> l:Seq.seq (AEAD.entry (dfst k) (AEAD.wgetinfo (writer_aead_state w))) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n invariant w h0 /\\\n AEAD.wlog (writer_aead_state w) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (footprint w))\n (ensures invariant w h1 ==> AEAD.wlog (writer_aead_state w) h1 == l)\n\nval rframe_log: #k:id{AEAD.is_safe (dfst k)} -> #w:stream_writer k -> r:stream_reader w -> l:Seq.seq (AEAD.entry (dfst k) (AEAD.rgetinfo (reader_aead_state r))) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n invariant w h0 /\\\n AEAD.rlog (reader_aead_state r) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (rfootprint r))\n (ensures invariant w h1 ==> AEAD.rlog (reader_aead_state r) h1 == l)\n\nval wframe_pnlog: #k:id{PNE.is_safe (dsnd k)} -> w:stream_writer k -> l:Seq.seq (PNE.entry (writer_pne_info w)) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n invariant w h0 /\\\n PNE.table (writer_pne_state w) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (footprint w))\n (ensures PNE.table (writer_pne_state w) h1 == l)\n\nval rframe_pnlog: #k:id{PNE.is_safe (dsnd k)} -> #w:stream_writer k -> r:stream_reader w -> l:Seq.seq (PNE.entry (reader_pne_info r)) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n rinvariant r h0 /\\\n PNE.table (reader_pne_state r) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (rfootprint r))\n (ensures PNE.table (reader_pne_state r) h1 == l)\n\nval create: k:id -> u:info ->\n u1:AEAD.info (dfst k) -> u2:PNE.info (dsnd k) -> init: pn ->\n ST (stream_writer k)\n (requires fun h0 -> u2.PNE.calg ==\n Spec.Agile.AEAD.cipher_alg_of_supported_alg u1.AEAD.alg /\\\n u2.PNE.halg == u1.AEAD.halg /\\\n u2.PNE.plain == pne_pkg /\\\n u1.AEAD.min_len == 3)\n (ensures fun h0 w h1 ->\n invariant w h1 /\\\n M.modifies (footprint w) h0 h1 /\\\n writer_offset w == init /\\\n writer_ae_info w == u1 /\\\n writer_pne_info w == u2 /\\\n writer_info w == u /\\\n wctrT w h1 == writer_offset w /\\\n (safe k ==>\n (AEAD.wlog (writer_aead_state w) h1 == Seq.empty /\\\n PNE.table (writer_pne_state w) h1 == Seq.empty\n ))\n )\n\n#push-options \"--z3rlimit 15\"\n\nval coerce: k:unsafe_id -> u:info ->\n u1:AEAD.info (dfst k) -> u2:PNE.info (dsnd k) -> \n init: pn -> ts:AEAD.traffic_secret u1.AEAD.halg ->\n ST (stream_writer k)\n (requires fun h0 -> u2.PNE.calg ==\n Spec.Agile.AEAD.cipher_alg_of_supported_alg u1.AEAD.alg /\\\n u2.PNE.halg == u1.AEAD.halg /\\\n u2.PNE.plain == pne_pkg /\\\n u1.AEAD.min_len == 3)\n (ensures fun h0 w h1 ->\n let (k1, k2) = writer_leak w in\n invariant w h1 /\\\n M.modifies (footprint w) h0 h1 /\\\n writer_offset w == init /\\\n wctrT w h1 == writer_offset w /\\\n writer_ae_info w == u1 /\\\n writer_pne_info w == u2 /\\\n writer_info w == u /\\\n Model.Helpers.hide (writer_static_iv w) ==\n Spec.derive_secret u1.AEAD.halg ts\n Spec.label_iv 12 /\\\n Model.Helpers.hide k1 == Spec.derive_secret u1.AEAD.halg ts\n Spec.label_key (SAE.key_length u1.AEAD.alg) /\\\n Model.Helpers.hide k2 == QUIC.Spec.derive_secret u2.PNE.halg ts\n QUIC.Spec.label_hp (PNE.key_len u2)\n )\n#pop-options\n\nval createReader: parent:rgn -> #k:id -> w:stream_writer k ->\n ST (stream_reader w)\n (requires fun h0 -> invariant w h0 /\\\n writer_offset w < max_ctr)\n (ensures fun h0 r h1 ->\n invariant w h1 /\\ rinvariant r h1 /\\\n M.modifies (rfootprint r) h0 h1 /\\\n expected_pnT r h1 == writer_offset w)\n\n#reset-options \"--z3rlimit 50 --fuel 1\"\n\nlet _ = assert_norm(Spec.max_plain_length < pow2 32)\nlet _ = assert_norm(pow2 32 < pow2 64)\n\n(*\n let (ne,c) = split #k #(nl+l) nec nl in\n let rpn = rpn_of_nat (wctrT w h0) in\n let npn = npn_encode j rpn nl in\n let alg = ((AEAD.wgetinfo aw).AEAD.alg) in\n let nce:AEAD.nonce (AEAD.wgetinfo aw) = create_nonce #k #alg (writer_iv w) rpn in\n let ad:AEAD.adata = Bytes.append (bytes_of_quic_header hd) npn in\n let s:PNE.sample = sample_quic_protect nec in\n let nn = pne_plain_of_header_pn hd npn in\n let cc = pne_cipher_of_pheader_epn ph ne in\n AEAD.wlog aw h1 ==\n Seq.snoc\n (AEAD.wlog aw h0)\n (AEAD.Entry #i #(AEAD.wgetinfo aw) nce ad #l p c) /\\\n PNE.table ps h1 ==\n Seq.snoc\n (PNE.table ps h0)\n (PNE.Entry #j #pne_plain_pkg s #(nl+1) nn cc))\n*)\n\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\nlet set_pn_long (l:Spec.long_header_specifics{not (Spec.MRetry? l)}) (pn:PN.packet_number_t) =\n let open Spec in\n match l with\n | MInitial r t p pnl _ -> MInitial r t p pnl pn\n | MZeroRTT r p pnl _ -> MZeroRTT r p pnl pn\n | MHandshake r p pnl _ -> MHandshake r p pnl pn\n\n#push-options \"--z3rlimit 200\"\nlet set_pn (h:Spec.header{not (Spec.is_retry h)}) (pn:nat{pn <= max_ctr}) =\n let pn : PN.packet_number_t = Secret.hide (U62.uint_to_t pn) in\n match h with \n | Spec.MLong b d s l -> Spec.MLong b d s (set_pn_long l pn)\n | Spec.MShort r s k d pnl _ -> Spec.MShort r s k d pnl pn\n#pop-options\n\nval encrypt\n (#k:id)\n (w:stream_writer k)\n (h:Spec.header)\n (#l:qplain_len)\n (p:(writer_ae_info w).AEAD.plain_pkg.AEAD.plain (dfst k) l)\n : ST Spec.packet\n (requires fun h0 ->\n invariant w h0 /\\\n wincrementable w h0 /\\\n (if Spec.is_retry h then l = 0\n else (\n (Lib.RawIntTypes.u64_from_UInt64 (UInt64.uint_to_t (wctrT w h0 + 1))) == QUIC.Spec.Header.Base.packet_number h /\\ (\n Spec.has_payload_length h ==>\n Secret.v (Spec.payload_length h) == l\n\t + Spec.Agile.AEAD.tag_length (writer_ae_info w).AEAD.alg))\n ))\n (ensures fun h0 c h1 ->\n let (|i,j|) = k in\n let aw = writer_aead_state w in\n let ps = writer_pne_state w in\n M.modifies (footprint w) h0 h1 /\\\n invariant w h1 /\\\n wctrT w h1 == wctrT w h0 + 1 /\\\n (safe k ==> True) /\\\n (unsafe k ==>\n (let ea = (writer_ae_info w).AE.alg in\n let k1, k2 = writer_leak w in\n let plain_pkg = (writer_ae_info w).AEAD.plain_pkg in\n let plain = plain_pkg.AEAD.repr i l p in\n c == Spec.encrypt ea (Helpers.hide k1) (Helpers.hide (writer_static_iv w)) (Helpers.hide k2) h (Helpers.reveal #l plain))\n ))\n\n#push-options \"--fuel 1 --z3rlimit 30\"\nnoeq type model_result (#k:id) (#w:stream_writer k) (r:stream_reader w) =\n| M_Success:\n h: Spec.header{not (Spec.is_retry h)} ->\n l: qplain_len ->\n p: (reader_ae_info r).AEAD.plain_pkg.AEAD.plain (dfst k) l ->\n remainder: Spec.bytes ->\n model_result r\n| M_Failure\n\nlet max (a b:nat) =", "dependencies": { "source_file": "Model.QUIC.fsti", "checked_file": "Model.QUIC.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 30, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Prims.nat -> b: Prims.nat -> Prims.nat", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.op_GreaterThan", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let max (a b: nat) =", "completed_definiton": "if a > b then a else b", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fsti", "name": "Model.QUIC.writer_leak", "original_source_type": "val writer_leak (#k: unsafe_id) (w: stream_writer k) : key_t w", "source_type": "val writer_leak (#k: unsafe_id) (w: stream_writer k) : key_t w", "source_definition": "let writer_leak (#k:unsafe_id) (w:stream_writer k) : key_t w =\n Model.Helpers.reveal #(SAE.key_length (writer_ae_info w).AEAD.alg) (AEAD.wkey (writer_aead_state w)),\n Model.Helpers.reveal #(PNE.key_len (writer_pne_info w)) (PNE.key (writer_pne_state w))", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 72, "start_col": 2, "end_line": 73, "end_col": 88 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nmodule Spec = QUIC.Spec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\nopen FStar.UInt32\nopen Mem\n\ntype id = i:AE.id & j:PNE.id{PNE.is_safe j <==> AEAD.is_safe i}\n\nlet safe (i:id) = AEAD.is_safe (dfst i)\nlet safe_id = i:id{safe i}\nlet unsafe (i:id) = not (safe i)\nlet unsafe_id = i:id{unsafe i}\n\n/// Package for QUIC plaintexts\n/// (i.e. the payload of QUIC packets)\n/// This would be implemented as a serializable list of frames\n/// (using EverParse refined lists)\n\ntype qplain_len = n:AEAD.plain_length_at_least 3{n < Spec.max_plain_length}\nlet pnl = PNE.pne_plain_length\n\nval pne_pkg: PNE.pne_plain_pkg\n\nnoeq type info = {\n region: r:subq{r `HS.disjoint` q_ae_region};\n}\n\nlet max_ctr = pow2 62 - 1\ntype epn (nl:pnl) = Spec.lbytes nl\ntype pn = n:nat{n <= max_ctr}\ntype rpn = n:U64.t{U64.v n < max_ctr}\nlet rpn_of_nat (j:nat{j < max_ctr}) : rpn = U64.uint_to_t j\n\nval stream_writer: (k:id) -> Type u#1\nval stream_reader: #k:id -> w:stream_writer k -> Type u#1\nval writer_info: #k:id -> w:stream_writer k -> info\nval reader_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> i:info{i == writer_info w}\n\nval writer_ae_info: #k:id -> w:stream_writer k -> a:AEAD.info (dfst k){a.AEAD.min_len == 3}\nval reader_ae_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> a:AEAD.info (dfst k){a.AEAD.min_len == 3}\nval writer_pne_info: #k:id -> w:stream_writer k -> a:PNE.info (dsnd k){a.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (writer_ae_info w).AEAD.alg /\\ a.PNE.halg == (writer_ae_info w).AEAD.halg}\nval reader_pne_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> a:PNE.info (dsnd k){a.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (reader_ae_info r).AEAD.alg /\\ a.PNE.halg == (reader_ae_info r).AEAD.halg}\n\nval writer_aead_state : (#k:id) -> (w:stream_writer k) ->\n aw:AEAD.aead_writer (dfst k)\nval reader_aead_state : #k:id -> #w:stream_writer k -> r:stream_reader w ->\n ar:AEAD.aead_reader (writer_aead_state w)\nval writer_pne_state : #k:id -> w:stream_writer k -> PNE.pne_state (writer_pne_info w)\nval reader_pne_state : #k:id -> #w:stream_writer k -> r:stream_reader w -> PNE.pne_state (reader_pne_info r)\n\ntype key_t #i (w:stream_writer i) =\n Spec.lbytes (SAE.key_length (writer_ae_info w).AEAD.alg) &\n Spec.lbytes (PNE.key_len (writer_pne_info w))", "dependencies": { "source_file": "Model.QUIC.fsti", "checked_file": "Model.QUIC.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.QUIC.stream_writer k -> Model.QUIC.key_t w", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.unsafe_id", "Model.QUIC.stream_writer", "FStar.Pervasives.Native.Mktuple2", "QUIC.Spec.Base.lbytes", "Spec.Agile.AEAD.key_length", "Model.AEAD.__proj__Mkinfo'__item__alg", "Model.QUIC.writer_ae_info", "Model.PNE.key_len", "FStar.Pervasives.dsnd", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Prims.b2t", "Model.PNE.is_safe", "Model.AEAD.is_safe", "Model.QUIC.writer_pne_info", "Model.Helpers.reveal", "Model.AEAD.wkey", "FStar.Pervasives.dfst", "Model.QUIC.writer_aead_state", "Model.PNE.key", "Model.QUIC.writer_pne_state", "Model.QUIC.key_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val writer_leak (#k: unsafe_id) (w: stream_writer k) : key_t w\nlet writer_leak (#k: unsafe_id) (w: stream_writer k) : key_t w =", "completed_definiton": "Model.Helpers.reveal #(SAE.key_length (writer_ae_info w).AEAD.alg) (AEAD.wkey (writer_aead_state w)),\nModel.Helpers.reveal #(PNE.key_len (writer_pne_info w)) (PNE.key (writer_pne_state w))", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fsti", "name": "Model.QUIC.set_pn_long", "original_source_type": "", "source_type": "val set_pn_long : l: QUIC.Spec.Header.Base.long_header_specifics{Prims.op_Negation (MRetry? l)} ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t\n -> QUIC.Spec.Header.Base.long_header_specifics", "source_definition": "let set_pn_long (l:Spec.long_header_specifics{not (Spec.MRetry? l)}) (pn:PN.packet_number_t) =\n let open Spec in\n match l with\n | MInitial r t p pnl _ -> MInitial r t p pnl pn\n | MZeroRTT r p pnl _ -> MZeroRTT r p pnl pn\n | MHandshake r p pnl _ -> MHandshake r p pnl pn", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 271, "start_col": 2, "end_line": 275, "end_col": 49 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nmodule Spec = QUIC.Spec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\nopen FStar.UInt32\nopen Mem\n\ntype id = i:AE.id & j:PNE.id{PNE.is_safe j <==> AEAD.is_safe i}\n\nlet safe (i:id) = AEAD.is_safe (dfst i)\nlet safe_id = i:id{safe i}\nlet unsafe (i:id) = not (safe i)\nlet unsafe_id = i:id{unsafe i}\n\n/// Package for QUIC plaintexts\n/// (i.e. the payload of QUIC packets)\n/// This would be implemented as a serializable list of frames\n/// (using EverParse refined lists)\n\ntype qplain_len = n:AEAD.plain_length_at_least 3{n < Spec.max_plain_length}\nlet pnl = PNE.pne_plain_length\n\nval pne_pkg: PNE.pne_plain_pkg\n\nnoeq type info = {\n region: r:subq{r `HS.disjoint` q_ae_region};\n}\n\nlet max_ctr = pow2 62 - 1\ntype epn (nl:pnl) = Spec.lbytes nl\ntype pn = n:nat{n <= max_ctr}\ntype rpn = n:U64.t{U64.v n < max_ctr}\nlet rpn_of_nat (j:nat{j < max_ctr}) : rpn = U64.uint_to_t j\n\nval stream_writer: (k:id) -> Type u#1\nval stream_reader: #k:id -> w:stream_writer k -> Type u#1\nval writer_info: #k:id -> w:stream_writer k -> info\nval reader_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> i:info{i == writer_info w}\n\nval writer_ae_info: #k:id -> w:stream_writer k -> a:AEAD.info (dfst k){a.AEAD.min_len == 3}\nval reader_ae_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> a:AEAD.info (dfst k){a.AEAD.min_len == 3}\nval writer_pne_info: #k:id -> w:stream_writer k -> a:PNE.info (dsnd k){a.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (writer_ae_info w).AEAD.alg /\\ a.PNE.halg == (writer_ae_info w).AEAD.halg}\nval reader_pne_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> a:PNE.info (dsnd k){a.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (reader_ae_info r).AEAD.alg /\\ a.PNE.halg == (reader_ae_info r).AEAD.halg}\n\nval writer_aead_state : (#k:id) -> (w:stream_writer k) ->\n aw:AEAD.aead_writer (dfst k)\nval reader_aead_state : #k:id -> #w:stream_writer k -> r:stream_reader w ->\n ar:AEAD.aead_reader (writer_aead_state w)\nval writer_pne_state : #k:id -> w:stream_writer k -> PNE.pne_state (writer_pne_info w)\nval reader_pne_state : #k:id -> #w:stream_writer k -> r:stream_reader w -> PNE.pne_state (reader_pne_info r)\n\ntype key_t #i (w:stream_writer i) =\n Spec.lbytes (SAE.key_length (writer_ae_info w).AEAD.alg) &\n Spec.lbytes (PNE.key_len (writer_pne_info w))\n\nlet writer_leak (#k:unsafe_id) (w:stream_writer k) : key_t w =\n Model.Helpers.reveal #(SAE.key_length (writer_ae_info w).AEAD.alg) (AEAD.wkey (writer_aead_state w)),\n Model.Helpers.reveal #(PNE.key_len (writer_pne_info w)) (PNE.key (writer_pne_state w))\n\nlet reader_leak (#k:unsafe_id) (#w:stream_writer k) (r:stream_reader w) : key_t w = writer_leak w\n\nval invariant: #k:id -> w:stream_writer k -> h:mem ->\n t:Type0{t ==> AEAD.winvariant (writer_aead_state w) h}\nval rinvariant: #k:id -> #w:stream_writer k -> r:stream_reader w -> h:mem ->\n t:Type0{t ==> invariant w h}\n\nval writer_offset: #k:id -> w:stream_writer k -> pn\nval reader_offset: #k:id -> #w:stream_writer k -> stream_reader w -> pn\n\nval wctrT: #k:id -> w:stream_writer k -> h:mem{invariant w h} -> \n GTot (n:nat{n >= writer_offset w /\\ n <= max_ctr})\n \nval wctr: #k:id -> w:stream_writer k -> ST (n:nat{n >= writer_offset w /\\ n <= max_ctr})\n (requires fun h0 -> invariant w h0)\n (ensures fun h0 c h1 -> h0 == h1 /\\ c = wctrT w h1)\n\ntype qiv (k:id) = Spec.lbytes 12 // SAE.iv (I.ae_id_ginfo (fst k))\nval writer_static_iv: #k:id -> w:stream_writer k -> qiv k\nval reader_static_iv: #k:id -> #w:stream_writer k -> r:stream_reader w ->\n iv:qiv k{iv == writer_static_iv w}\n\nval expected_pnT: #k:id -> #w:stream_writer k -> r:stream_reader w -> h:mem{rinvariant r h} ->\n GTot (n:nat{n >= writer_offset w /\\ n < max_ctr})\n \nval expected_pn: #k:id -> #w:stream_writer k -> r:stream_reader w ->\n ST (n:nat{n >= writer_offset w /\\ n <= max_ctr})\n (requires fun h0 -> rinvariant r h0)\n (ensures fun h0 c h1 -> h0 == h1 /\\\n (c == expected_pnT #k #w r h0))\n\nlet wincrementable (#k:id) (w:stream_writer k) (h:mem{invariant w h}) =\n wctrT w h < max_ctr\n\nval footprint: #k:id -> w:stream_writer k -> GTot M.loc\nval rfootprint: #k:id -> #w:stream_writer k -> r:stream_reader w -> GTot M.loc\n\nval frame_invariant: #k:id -> w:stream_writer k -> h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n (invariant w h0 /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (footprint w)))\n (ensures invariant w h1 /\\\n wctrT w h0 == wctrT w h1)\n //AEAD.wlog (writer_aead_state w) h1 == AEAD.wlog (writer_aead_state w) h0 /\\\n //PNE.table (writer_pne_state w) h1 == PNE.table (writer_pne_state w) h0)\n [ SMTPat (M.modifies ri h0 h1); SMTPat (invariant w h1) ]\n (*[ SMTPatOr [\n [ SMTPat (M.modifies ri h0 h1); SMTPat (invariant w h1) ];\n [ SMTPat (M.modifies ri h0 h1); SMTPat (AEAD.wlog (writer_aead_state w) h1) ];\n [ SMTPat (M.modifies ri h0 h1); SMTPat (PNE.table (writer_pne_state w) h1) ]\n ]]*)\n\nval rframe_invariant: #k:id -> #w:stream_writer k -> r:stream_reader w ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n (rinvariant r h0 /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (rfootprint r)))\n (ensures rinvariant r h1 /\\\n expected_pnT r h0 == expected_pnT r h1)\n [ SMTPat (M.modifies ri h0 h1); SMTPat (rinvariant r h1) ]\n\nval wframe_log: #k:id{AEAD.is_safe (dfst k)} -> w:stream_writer k -> l:Seq.seq (AEAD.entry (dfst k) (AEAD.wgetinfo (writer_aead_state w))) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n invariant w h0 /\\\n AEAD.wlog (writer_aead_state w) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (footprint w))\n (ensures invariant w h1 ==> AEAD.wlog (writer_aead_state w) h1 == l)\n\nval rframe_log: #k:id{AEAD.is_safe (dfst k)} -> #w:stream_writer k -> r:stream_reader w -> l:Seq.seq (AEAD.entry (dfst k) (AEAD.rgetinfo (reader_aead_state r))) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n invariant w h0 /\\\n AEAD.rlog (reader_aead_state r) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (rfootprint r))\n (ensures invariant w h1 ==> AEAD.rlog (reader_aead_state r) h1 == l)\n\nval wframe_pnlog: #k:id{PNE.is_safe (dsnd k)} -> w:stream_writer k -> l:Seq.seq (PNE.entry (writer_pne_info w)) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n invariant w h0 /\\\n PNE.table (writer_pne_state w) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (footprint w))\n (ensures PNE.table (writer_pne_state w) h1 == l)\n\nval rframe_pnlog: #k:id{PNE.is_safe (dsnd k)} -> #w:stream_writer k -> r:stream_reader w -> l:Seq.seq (PNE.entry (reader_pne_info r)) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n rinvariant r h0 /\\\n PNE.table (reader_pne_state r) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (rfootprint r))\n (ensures PNE.table (reader_pne_state r) h1 == l)\n\nval create: k:id -> u:info ->\n u1:AEAD.info (dfst k) -> u2:PNE.info (dsnd k) -> init: pn ->\n ST (stream_writer k)\n (requires fun h0 -> u2.PNE.calg ==\n Spec.Agile.AEAD.cipher_alg_of_supported_alg u1.AEAD.alg /\\\n u2.PNE.halg == u1.AEAD.halg /\\\n u2.PNE.plain == pne_pkg /\\\n u1.AEAD.min_len == 3)\n (ensures fun h0 w h1 ->\n invariant w h1 /\\\n M.modifies (footprint w) h0 h1 /\\\n writer_offset w == init /\\\n writer_ae_info w == u1 /\\\n writer_pne_info w == u2 /\\\n writer_info w == u /\\\n wctrT w h1 == writer_offset w /\\\n (safe k ==>\n (AEAD.wlog (writer_aead_state w) h1 == Seq.empty /\\\n PNE.table (writer_pne_state w) h1 == Seq.empty\n ))\n )\n\n#push-options \"--z3rlimit 15\"\n\nval coerce: k:unsafe_id -> u:info ->\n u1:AEAD.info (dfst k) -> u2:PNE.info (dsnd k) -> \n init: pn -> ts:AEAD.traffic_secret u1.AEAD.halg ->\n ST (stream_writer k)\n (requires fun h0 -> u2.PNE.calg ==\n Spec.Agile.AEAD.cipher_alg_of_supported_alg u1.AEAD.alg /\\\n u2.PNE.halg == u1.AEAD.halg /\\\n u2.PNE.plain == pne_pkg /\\\n u1.AEAD.min_len == 3)\n (ensures fun h0 w h1 ->\n let (k1, k2) = writer_leak w in\n invariant w h1 /\\\n M.modifies (footprint w) h0 h1 /\\\n writer_offset w == init /\\\n wctrT w h1 == writer_offset w /\\\n writer_ae_info w == u1 /\\\n writer_pne_info w == u2 /\\\n writer_info w == u /\\\n Model.Helpers.hide (writer_static_iv w) ==\n Spec.derive_secret u1.AEAD.halg ts\n Spec.label_iv 12 /\\\n Model.Helpers.hide k1 == Spec.derive_secret u1.AEAD.halg ts\n Spec.label_key (SAE.key_length u1.AEAD.alg) /\\\n Model.Helpers.hide k2 == QUIC.Spec.derive_secret u2.PNE.halg ts\n QUIC.Spec.label_hp (PNE.key_len u2)\n )\n#pop-options\n\nval createReader: parent:rgn -> #k:id -> w:stream_writer k ->\n ST (stream_reader w)\n (requires fun h0 -> invariant w h0 /\\\n writer_offset w < max_ctr)\n (ensures fun h0 r h1 ->\n invariant w h1 /\\ rinvariant r h1 /\\\n M.modifies (rfootprint r) h0 h1 /\\\n expected_pnT r h1 == writer_offset w)\n\n#reset-options \"--z3rlimit 50 --fuel 1\"\n\nlet _ = assert_norm(Spec.max_plain_length < pow2 32)\nlet _ = assert_norm(pow2 32 < pow2 64)\n\n(*\n let (ne,c) = split #k #(nl+l) nec nl in\n let rpn = rpn_of_nat (wctrT w h0) in\n let npn = npn_encode j rpn nl in\n let alg = ((AEAD.wgetinfo aw).AEAD.alg) in\n let nce:AEAD.nonce (AEAD.wgetinfo aw) = create_nonce #k #alg (writer_iv w) rpn in\n let ad:AEAD.adata = Bytes.append (bytes_of_quic_header hd) npn in\n let s:PNE.sample = sample_quic_protect nec in\n let nn = pne_plain_of_header_pn hd npn in\n let cc = pne_cipher_of_pheader_epn ph ne in\n AEAD.wlog aw h1 ==\n Seq.snoc\n (AEAD.wlog aw h0)\n (AEAD.Entry #i #(AEAD.wgetinfo aw) nce ad #l p c) /\\\n PNE.table ps h1 ==\n Seq.snoc\n (PNE.table ps h0)\n (PNE.Entry #j #pne_plain_pkg s #(nl+1) nn cc))\n*)\n\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int", "dependencies": { "source_file": "Model.QUIC.fsti", "checked_file": "Model.QUIC.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 50, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n l: QUIC.Spec.Header.Base.long_header_specifics{Prims.op_Negation (MRetry? l)} ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t\n -> QUIC.Spec.Header.Base.long_header_specifics", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.long_header_specifics", "Prims.b2t", "Prims.op_Negation", "QUIC.Spec.Header.Base.uu___is_MRetry", "QUIC.Spec.PacketNumber.Base.packet_number_t", "QUIC.Spec.Base.bitfield", "QUIC.Spec.Base.vlbytes", "QUIC.Spec.Base.token_max_len", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.Header.Base.MInitial", "QUIC.Spec.Header.Base.MZeroRTT", "QUIC.Spec.Header.Base.MHandshake" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let set_pn_long (l: Spec.long_header_specifics{not (Spec.MRetry? l)}) (pn: PN.packet_number_t) =", "completed_definiton": "let open Spec in\nmatch l with\n| MInitial r t p pnl _ -> MInitial r t p pnl pn\n| MZeroRTT r p pnl _ -> MZeroRTT r p pnl pn\n| MHandshake r p pnl _ -> MHandshake r p pnl pn", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fsti", "name": "Model.QUIC.rpn_of_nat", "original_source_type": "val rpn_of_nat (j: nat{j < max_ctr}) : rpn", "source_type": "val rpn_of_nat (j: nat{j < max_ctr}) : rpn", "source_definition": "let rpn_of_nat (j:nat{j < max_ctr}) : rpn = U64.uint_to_t j", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 48, "start_col": 44, "end_line": 48, "end_col": 59 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nmodule Spec = QUIC.Spec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\nopen FStar.UInt32\nopen Mem\n\ntype id = i:AE.id & j:PNE.id{PNE.is_safe j <==> AEAD.is_safe i}\n\nlet safe (i:id) = AEAD.is_safe (dfst i)\nlet safe_id = i:id{safe i}\nlet unsafe (i:id) = not (safe i)\nlet unsafe_id = i:id{unsafe i}\n\n/// Package for QUIC plaintexts\n/// (i.e. the payload of QUIC packets)\n/// This would be implemented as a serializable list of frames\n/// (using EverParse refined lists)\n\ntype qplain_len = n:AEAD.plain_length_at_least 3{n < Spec.max_plain_length}\nlet pnl = PNE.pne_plain_length\n\nval pne_pkg: PNE.pne_plain_pkg\n\nnoeq type info = {\n region: r:subq{r `HS.disjoint` q_ae_region};\n}\n\nlet max_ctr = pow2 62 - 1\ntype epn (nl:pnl) = Spec.lbytes nl\ntype pn = n:nat{n <= max_ctr}", "dependencies": { "source_file": "Model.QUIC.fsti", "checked_file": "Model.QUIC.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "j: Prims.nat{j < Model.QUIC.max_ctr} -> Model.QUIC.rpn", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Model.QUIC.max_ctr", "FStar.UInt64.uint_to_t", "Model.QUIC.rpn" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val rpn_of_nat (j: nat{j < max_ctr}) : rpn\nlet rpn_of_nat (j: nat{j < max_ctr}) : rpn =", "completed_definiton": "U64.uint_to_t j", "isa_cross_project_example": true }, { "file_name": "Model.QUIC.fsti", "name": "Model.QUIC.set_pn", "original_source_type": "", "source_type": "val set_pn : h: QUIC.Spec.Header.Base.header{Prims.op_Negation (QUIC.Spec.Header.Base.is_retry h)} ->\n pn: Prims.nat{pn <= Model.QUIC.max_ctr}\n -> QUIC.Spec.Header.Base.header", "source_definition": "let set_pn (h:Spec.header{not (Spec.is_retry h)}) (pn:nat{pn <= max_ctr}) =\n let pn : PN.packet_number_t = Secret.hide (U62.uint_to_t pn) in\n match h with \n | Spec.MLong b d s l -> Spec.MLong b d s (set_pn_long l pn)\n | Spec.MShort r s k d pnl _ -> Spec.MShort r s k d pnl pn", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.QUIC.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 278, "start_col": 75, "end_line": 282, "end_col": 59 }, "file_context": "module Model.QUIC\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U64 = FStar.UInt64\nmodule U128 = FStar.UInt128\nmodule M = LowStar.Modifies\n\nmodule Spec = QUIC.Spec\nmodule QH = QUIC.Spec.Header\nmodule AE = Model.AEAD\nmodule SAE = Spec.Agile.AEAD\nmodule PNE = Model.PNE\nmodule SPNE = Spec.Agile.Cipher\nmodule BF = LowParse.BitFields\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\nopen FStar.UInt32\nopen Mem\n\ntype id = i:AE.id & j:PNE.id{PNE.is_safe j <==> AEAD.is_safe i}\n\nlet safe (i:id) = AEAD.is_safe (dfst i)\nlet safe_id = i:id{safe i}\nlet unsafe (i:id) = not (safe i)\nlet unsafe_id = i:id{unsafe i}\n\n/// Package for QUIC plaintexts\n/// (i.e. the payload of QUIC packets)\n/// This would be implemented as a serializable list of frames\n/// (using EverParse refined lists)\n\ntype qplain_len = n:AEAD.plain_length_at_least 3{n < Spec.max_plain_length}\nlet pnl = PNE.pne_plain_length\n\nval pne_pkg: PNE.pne_plain_pkg\n\nnoeq type info = {\n region: r:subq{r `HS.disjoint` q_ae_region};\n}\n\nlet max_ctr = pow2 62 - 1\ntype epn (nl:pnl) = Spec.lbytes nl\ntype pn = n:nat{n <= max_ctr}\ntype rpn = n:U64.t{U64.v n < max_ctr}\nlet rpn_of_nat (j:nat{j < max_ctr}) : rpn = U64.uint_to_t j\n\nval stream_writer: (k:id) -> Type u#1\nval stream_reader: #k:id -> w:stream_writer k -> Type u#1\nval writer_info: #k:id -> w:stream_writer k -> info\nval reader_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> i:info{i == writer_info w}\n\nval writer_ae_info: #k:id -> w:stream_writer k -> a:AEAD.info (dfst k){a.AEAD.min_len == 3}\nval reader_ae_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> a:AEAD.info (dfst k){a.AEAD.min_len == 3}\nval writer_pne_info: #k:id -> w:stream_writer k -> a:PNE.info (dsnd k){a.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (writer_ae_info w).AEAD.alg /\\ a.PNE.halg == (writer_ae_info w).AEAD.halg}\nval reader_pne_info: #k:id -> #w:stream_writer k -> r:stream_reader w -> a:PNE.info (dsnd k){a.PNE.calg == Spec.Agile.AEAD.cipher_alg_of_supported_alg (reader_ae_info r).AEAD.alg /\\ a.PNE.halg == (reader_ae_info r).AEAD.halg}\n\nval writer_aead_state : (#k:id) -> (w:stream_writer k) ->\n aw:AEAD.aead_writer (dfst k)\nval reader_aead_state : #k:id -> #w:stream_writer k -> r:stream_reader w ->\n ar:AEAD.aead_reader (writer_aead_state w)\nval writer_pne_state : #k:id -> w:stream_writer k -> PNE.pne_state (writer_pne_info w)\nval reader_pne_state : #k:id -> #w:stream_writer k -> r:stream_reader w -> PNE.pne_state (reader_pne_info r)\n\ntype key_t #i (w:stream_writer i) =\n Spec.lbytes (SAE.key_length (writer_ae_info w).AEAD.alg) &\n Spec.lbytes (PNE.key_len (writer_pne_info w))\n\nlet writer_leak (#k:unsafe_id) (w:stream_writer k) : key_t w =\n Model.Helpers.reveal #(SAE.key_length (writer_ae_info w).AEAD.alg) (AEAD.wkey (writer_aead_state w)),\n Model.Helpers.reveal #(PNE.key_len (writer_pne_info w)) (PNE.key (writer_pne_state w))\n\nlet reader_leak (#k:unsafe_id) (#w:stream_writer k) (r:stream_reader w) : key_t w = writer_leak w\n\nval invariant: #k:id -> w:stream_writer k -> h:mem ->\n t:Type0{t ==> AEAD.winvariant (writer_aead_state w) h}\nval rinvariant: #k:id -> #w:stream_writer k -> r:stream_reader w -> h:mem ->\n t:Type0{t ==> invariant w h}\n\nval writer_offset: #k:id -> w:stream_writer k -> pn\nval reader_offset: #k:id -> #w:stream_writer k -> stream_reader w -> pn\n\nval wctrT: #k:id -> w:stream_writer k -> h:mem{invariant w h} -> \n GTot (n:nat{n >= writer_offset w /\\ n <= max_ctr})\n \nval wctr: #k:id -> w:stream_writer k -> ST (n:nat{n >= writer_offset w /\\ n <= max_ctr})\n (requires fun h0 -> invariant w h0)\n (ensures fun h0 c h1 -> h0 == h1 /\\ c = wctrT w h1)\n\ntype qiv (k:id) = Spec.lbytes 12 // SAE.iv (I.ae_id_ginfo (fst k))\nval writer_static_iv: #k:id -> w:stream_writer k -> qiv k\nval reader_static_iv: #k:id -> #w:stream_writer k -> r:stream_reader w ->\n iv:qiv k{iv == writer_static_iv w}\n\nval expected_pnT: #k:id -> #w:stream_writer k -> r:stream_reader w -> h:mem{rinvariant r h} ->\n GTot (n:nat{n >= writer_offset w /\\ n < max_ctr})\n \nval expected_pn: #k:id -> #w:stream_writer k -> r:stream_reader w ->\n ST (n:nat{n >= writer_offset w /\\ n <= max_ctr})\n (requires fun h0 -> rinvariant r h0)\n (ensures fun h0 c h1 -> h0 == h1 /\\\n (c == expected_pnT #k #w r h0))\n\nlet wincrementable (#k:id) (w:stream_writer k) (h:mem{invariant w h}) =\n wctrT w h < max_ctr\n\nval footprint: #k:id -> w:stream_writer k -> GTot M.loc\nval rfootprint: #k:id -> #w:stream_writer k -> r:stream_reader w -> GTot M.loc\n\nval frame_invariant: #k:id -> w:stream_writer k -> h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n (invariant w h0 /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (footprint w)))\n (ensures invariant w h1 /\\\n wctrT w h0 == wctrT w h1)\n //AEAD.wlog (writer_aead_state w) h1 == AEAD.wlog (writer_aead_state w) h0 /\\\n //PNE.table (writer_pne_state w) h1 == PNE.table (writer_pne_state w) h0)\n [ SMTPat (M.modifies ri h0 h1); SMTPat (invariant w h1) ]\n (*[ SMTPatOr [\n [ SMTPat (M.modifies ri h0 h1); SMTPat (invariant w h1) ];\n [ SMTPat (M.modifies ri h0 h1); SMTPat (AEAD.wlog (writer_aead_state w) h1) ];\n [ SMTPat (M.modifies ri h0 h1); SMTPat (PNE.table (writer_pne_state w) h1) ]\n ]]*)\n\nval rframe_invariant: #k:id -> #w:stream_writer k -> r:stream_reader w ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n (rinvariant r h0 /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (rfootprint r)))\n (ensures rinvariant r h1 /\\\n expected_pnT r h0 == expected_pnT r h1)\n [ SMTPat (M.modifies ri h0 h1); SMTPat (rinvariant r h1) ]\n\nval wframe_log: #k:id{AEAD.is_safe (dfst k)} -> w:stream_writer k -> l:Seq.seq (AEAD.entry (dfst k) (AEAD.wgetinfo (writer_aead_state w))) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n invariant w h0 /\\\n AEAD.wlog (writer_aead_state w) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (footprint w))\n (ensures invariant w h1 ==> AEAD.wlog (writer_aead_state w) h1 == l)\n\nval rframe_log: #k:id{AEAD.is_safe (dfst k)} -> #w:stream_writer k -> r:stream_reader w -> l:Seq.seq (AEAD.entry (dfst k) (AEAD.rgetinfo (reader_aead_state r))) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n invariant w h0 /\\\n AEAD.rlog (reader_aead_state r) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (rfootprint r))\n (ensures invariant w h1 ==> AEAD.rlog (reader_aead_state r) h1 == l)\n\nval wframe_pnlog: #k:id{PNE.is_safe (dsnd k)} -> w:stream_writer k -> l:Seq.seq (PNE.entry (writer_pne_info w)) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n invariant w h0 /\\\n PNE.table (writer_pne_state w) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (footprint w))\n (ensures PNE.table (writer_pne_state w) h1 == l)\n\nval rframe_pnlog: #k:id{PNE.is_safe (dsnd k)} -> #w:stream_writer k -> r:stream_reader w -> l:Seq.seq (PNE.entry (reader_pne_info r)) ->\n h0:mem -> ri:M.loc -> h1:mem ->\n Lemma\n (requires\n rinvariant r h0 /\\\n PNE.table (reader_pne_state r) h0 == l /\\\n M.modifies ri h0 h1 /\\\n M.loc_disjoint ri (rfootprint r))\n (ensures PNE.table (reader_pne_state r) h1 == l)\n\nval create: k:id -> u:info ->\n u1:AEAD.info (dfst k) -> u2:PNE.info (dsnd k) -> init: pn ->\n ST (stream_writer k)\n (requires fun h0 -> u2.PNE.calg ==\n Spec.Agile.AEAD.cipher_alg_of_supported_alg u1.AEAD.alg /\\\n u2.PNE.halg == u1.AEAD.halg /\\\n u2.PNE.plain == pne_pkg /\\\n u1.AEAD.min_len == 3)\n (ensures fun h0 w h1 ->\n invariant w h1 /\\\n M.modifies (footprint w) h0 h1 /\\\n writer_offset w == init /\\\n writer_ae_info w == u1 /\\\n writer_pne_info w == u2 /\\\n writer_info w == u /\\\n wctrT w h1 == writer_offset w /\\\n (safe k ==>\n (AEAD.wlog (writer_aead_state w) h1 == Seq.empty /\\\n PNE.table (writer_pne_state w) h1 == Seq.empty\n ))\n )\n\n#push-options \"--z3rlimit 15\"\n\nval coerce: k:unsafe_id -> u:info ->\n u1:AEAD.info (dfst k) -> u2:PNE.info (dsnd k) -> \n init: pn -> ts:AEAD.traffic_secret u1.AEAD.halg ->\n ST (stream_writer k)\n (requires fun h0 -> u2.PNE.calg ==\n Spec.Agile.AEAD.cipher_alg_of_supported_alg u1.AEAD.alg /\\\n u2.PNE.halg == u1.AEAD.halg /\\\n u2.PNE.plain == pne_pkg /\\\n u1.AEAD.min_len == 3)\n (ensures fun h0 w h1 ->\n let (k1, k2) = writer_leak w in\n invariant w h1 /\\\n M.modifies (footprint w) h0 h1 /\\\n writer_offset w == init /\\\n wctrT w h1 == writer_offset w /\\\n writer_ae_info w == u1 /\\\n writer_pne_info w == u2 /\\\n writer_info w == u /\\\n Model.Helpers.hide (writer_static_iv w) ==\n Spec.derive_secret u1.AEAD.halg ts\n Spec.label_iv 12 /\\\n Model.Helpers.hide k1 == Spec.derive_secret u1.AEAD.halg ts\n Spec.label_key (SAE.key_length u1.AEAD.alg) /\\\n Model.Helpers.hide k2 == QUIC.Spec.derive_secret u2.PNE.halg ts\n QUIC.Spec.label_hp (PNE.key_len u2)\n )\n#pop-options\n\nval createReader: parent:rgn -> #k:id -> w:stream_writer k ->\n ST (stream_reader w)\n (requires fun h0 -> invariant w h0 /\\\n writer_offset w < max_ctr)\n (ensures fun h0 r h1 ->\n invariant w h1 /\\ rinvariant r h1 /\\\n M.modifies (rfootprint r) h0 h1 /\\\n expected_pnT r h1 == writer_offset w)\n\n#reset-options \"--z3rlimit 50 --fuel 1\"\n\nlet _ = assert_norm(Spec.max_plain_length < pow2 32)\nlet _ = assert_norm(pow2 32 < pow2 64)\n\n(*\n let (ne,c) = split #k #(nl+l) nec nl in\n let rpn = rpn_of_nat (wctrT w h0) in\n let npn = npn_encode j rpn nl in\n let alg = ((AEAD.wgetinfo aw).AEAD.alg) in\n let nce:AEAD.nonce (AEAD.wgetinfo aw) = create_nonce #k #alg (writer_iv w) rpn in\n let ad:AEAD.adata = Bytes.append (bytes_of_quic_header hd) npn in\n let s:PNE.sample = sample_quic_protect nec in\n let nn = pne_plain_of_header_pn hd npn in\n let cc = pne_cipher_of_pheader_epn ph ne in\n AEAD.wlog aw h1 ==\n Seq.snoc\n (AEAD.wlog aw h0)\n (AEAD.Entry #i #(AEAD.wgetinfo aw) nce ad #l p c) /\\\n PNE.table ps h1 ==\n Seq.snoc\n (PNE.table ps h0)\n (PNE.Entry #j #pne_plain_pkg s #(nl+1) nn cc))\n*)\n\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\nlet set_pn_long (l:Spec.long_header_specifics{not (Spec.MRetry? l)}) (pn:PN.packet_number_t) =\n let open Spec in\n match l with\n | MInitial r t p pnl _ -> MInitial r t p pnl pn\n | MZeroRTT r p pnl _ -> MZeroRTT r p pnl pn\n | MHandshake r p pnl _ -> MHandshake r p pnl pn", "dependencies": { "source_file": "Model.QUIC.fsti", "checked_file": "Model.QUIC.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "Model.PNE.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "Mem.fst.checked", "LowStar.Modifies.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "TSpec", "full_module": "QUIC.TotSpec" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "SPNE", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "PNE", "full_module": "Model.PNE" }, { "abbrev": true, "short_module": "SAE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "AE", "full_module": "Model.AEAD" }, { "abbrev": true, "short_module": "QH", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "M", "full_module": "LowStar.Modifies" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 200, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n h: QUIC.Spec.Header.Base.header{Prims.op_Negation (QUIC.Spec.Header.Base.is_retry h)} ->\n pn: Prims.nat{pn <= Model.QUIC.max_ctr}\n -> QUIC.Spec.Header.Base.header", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Header.Base.header", "Prims.b2t", "Prims.op_Negation", "QUIC.Spec.Header.Base.is_retry", "Prims.nat", "Prims.op_LessThanOrEqual", "Model.QUIC.max_ctr", "FStar.UInt32.t", "QUIC.Spec.Base.vlbytes", "QUIC.Spec.Header.Base.long_header_specifics", "QUIC.Spec.Header.Base.MLong", "Model.QUIC.set_pn_long", "QUIC.Spec.Base.bitfield", "Prims.bool", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "QUIC.Spec.Header.Base.MShort", "QUIC.Secret.Int.hide", "Lib.IntTypes.U64", "Lib.IntTypes.PUB", "FStar.UInt64.uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let set_pn (h: Spec.header{not (Spec.is_retry h)}) (pn: nat{pn <= max_ctr}) =", "completed_definiton": "let pn:PN.packet_number_t = Secret.hide (U62.uint_to_t pn) in\nmatch h with\n| Spec.MLong b d s l -> Spec.MLong b d s (set_pn_long l pn)\n| Spec.MShort r s k d pnl _ -> Spec.MShort r s k d pnl pn", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.Lemmas.fst", "name": "QUIC.Spec.PacketNumber.Lemmas.replace_modulo'", "original_source_type": "val replace_modulo' (a b new_mod: nat)\n : Pure nat\n (requires b > 0 /\\ new_mod < b)\n (ensures fun res -> res % b = new_mod /\\ res / b = a / b)", "source_type": "val replace_modulo' (a b new_mod: nat)\n : Pure nat\n (requires b > 0 /\\ new_mod < b)\n (ensures fun res -> res % b = new_mod /\\ res / b = a / b)", "source_definition": "let replace_modulo' (a b new_mod:nat) : Pure nat\n (requires b > 0 /\\ new_mod < b)\n (ensures fun res -> res % b = new_mod /\\ res / b = a / b) =\n let open FStar.Math.Lemmas in\n let res = a - a%b + new_mod in\n lemma_mod_plus new_mod (a/b) b;\n small_mod new_mod b;\n res", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 6, "start_col": 2, "end_line": 10, "end_col": 5 }, "file_context": "module QUIC.Spec.PacketNumber.Lemmas\n\nlet replace_modulo' (a b new_mod:nat) : Pure nat\n (requires b > 0 /\\ new_mod < b)", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.Lemmas.fst", "checked_file": "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Prims.nat -> b: Prims.nat -> new_mod: Prims.nat -> Prims.Pure Prims.nat", "effect": "Prims.Pure", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.unit", "FStar.Math.Lemmas.small_mod", "FStar.Math.Lemmas.lemma_mod_plus", "Prims.op_Division", "Prims.int", "Prims.op_Addition", "Prims.op_Subtraction", "Prims.op_Modulus", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThan", "Prims.op_LessThan", "Prims.op_Equality" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val replace_modulo' (a b new_mod: nat)\n : Pure nat\n (requires b > 0 /\\ new_mod < b)\n (ensures fun res -> res % b = new_mod /\\ res / b = a / b)\nlet replace_modulo' (a b new_mod: nat)\n : Pure nat\n (requires b > 0 /\\ new_mod < b)\n (ensures fun res -> res % b = new_mod /\\ res / b = a / b) =", "completed_definiton": "let open FStar.Math.Lemmas in\nlet res = a - a % b + new_mod in\nlemma_mod_plus new_mod (a / b) b;\nsmall_mod new_mod b;\nres", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.Lemmas.fst", "name": "QUIC.Spec.PacketNumber.Lemmas.lemma_replace_modulo_bound", "original_source_type": "val lemma_replace_modulo_bound (a mod_pow new_mod up_pow: nat)\n : Lemma (requires mod_pow < up_pow /\\ new_mod < pow2 mod_pow /\\ a < pow2 up_pow)\n (ensures replace_modulo' a (pow2 mod_pow) new_mod < pow2 up_pow)", "source_type": "val lemma_replace_modulo_bound (a mod_pow new_mod up_pow: nat)\n : Lemma (requires mod_pow < up_pow /\\ new_mod < pow2 mod_pow /\\ a < pow2 up_pow)\n (ensures replace_modulo' a (pow2 mod_pow) new_mod < pow2 up_pow)", "source_definition": "let lemma_replace_modulo_bound (a mod_pow new_mod up_pow:nat) : Lemma\n (requires\n mod_pow < up_pow /\\\n new_mod < pow2 mod_pow /\\\n a < pow2 up_pow)\n (ensures replace_modulo' a (pow2 mod_pow) new_mod < pow2 up_pow) =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n let (pmod,umod) = (pow2 mod_pow, pow2 up_pow) in\n lemma_div_mod a pmod;\n multiple_modulo_lemma (a / pmod) pmod;\n lemma_replace_modulo_bound_aux up_pow (a-a%pow2 mod_pow) new_mod mod_pow", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 38, "start_col": 2, "end_line": 43, "end_col": 74 }, "file_context": "module QUIC.Spec.PacketNumber.Lemmas\n\nlet replace_modulo' (a b new_mod:nat) : Pure nat\n (requires b > 0 /\\ new_mod < b)\n (ensures fun res -> res % b = new_mod /\\ res / b = a / b) =\n let open FStar.Math.Lemmas in\n let res = a - a%b + new_mod in\n lemma_mod_plus new_mod (a/b) b;\n small_mod new_mod b;\n res\n\n#push-options \"--z3rlimit 256\"\nlet lemma_replace_modulo_bound_aux (k:nat) (a:nat) (b:nat) (u:nat)\n : Lemma (requires a < pow2 k /\\ a % pow2 u == 0 /\\ b < pow2 u /\\ u < k)\n (ensures a + b < pow2 k) =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_div_mod a (pow2 u);\n assert(a + b == pow2 u * (a / pow2 u) + b);\n lemma_div_plus b (a / pow2 u) (pow2 u);\n small_div b (pow2 u);\n lemma_div_lt_nat a k u;\n assert((a / pow2 u) < pow2 (k-u));\n assert(((a + b) / pow2 u) / pow2 (k-u) < 1);\n division_multiplication_lemma (a+b) (pow2 u) (pow2 (k-u));\n pow2_plus u (k-u)\n#pop-options\n\n#push-options \"--z3rlimit 1024\"\n\n#restart-solver\nlet lemma_replace_modulo_bound (a mod_pow new_mod up_pow:nat) : Lemma\n (requires\n mod_pow < up_pow /\\\n new_mod < pow2 mod_pow /\\\n a < pow2 up_pow)", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.Lemmas.fst", "checked_file": "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 1024, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Prims.nat -> mod_pow: Prims.nat -> new_mod: Prims.nat -> up_pow: Prims.nat\n -> FStar.Pervasives.Lemma\n (requires mod_pow < up_pow /\\ new_mod < Prims.pow2 mod_pow /\\ a < Prims.pow2 up_pow)\n (ensures\n QUIC.Spec.PacketNumber.Lemmas.replace_modulo' a (Prims.pow2 mod_pow) new_mod <\n Prims.pow2 up_pow)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.int", "Prims.l_and", "Prims.b2t", "Prims.op_disEquality", "Prims.op_GreaterThan", "Prims.pos", "QUIC.Spec.PacketNumber.Lemmas.lemma_replace_modulo_bound_aux", "Prims.op_Subtraction", "Prims.op_Modulus", "Prims.pow2", "Prims.unit", "FStar.Math.Lemmas.multiple_modulo_lemma", "Prims.op_Division", "FStar.Math.Lemmas.lemma_div_mod", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.Mktuple2", "Prims.op_LessThan", "Prims.squash", "QUIC.Spec.PacketNumber.Lemmas.replace_modulo'", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_replace_modulo_bound (a mod_pow new_mod up_pow: nat)\n : Lemma (requires mod_pow < up_pow /\\ new_mod < pow2 mod_pow /\\ a < pow2 up_pow)\n (ensures replace_modulo' a (pow2 mod_pow) new_mod < pow2 up_pow)\nlet lemma_replace_modulo_bound (a mod_pow new_mod up_pow: nat)\n : Lemma (requires mod_pow < up_pow /\\ new_mod < pow2 mod_pow /\\ a < pow2 up_pow)\n (ensures replace_modulo' a (pow2 mod_pow) new_mod < pow2 up_pow) =", "completed_definiton": "let open FStar.Math.Lemmas in\nlet open FStar.Mul in\nlet pmod, umod = (pow2 mod_pow, pow2 up_pow) in\nlemma_div_mod a pmod;\nmultiple_modulo_lemma (a / pmod) pmod;\nlemma_replace_modulo_bound_aux up_pow (a - a % pow2 mod_pow) new_mod mod_pow", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.Lemmas.fst", "name": "QUIC.Spec.PacketNumber.Lemmas.lemma_replace_modulo_bound_aux", "original_source_type": "val lemma_replace_modulo_bound_aux (k a b u: nat)\n : Lemma (requires a < pow2 k /\\ a % pow2 u == 0 /\\ b < pow2 u /\\ u < k) (ensures a + b < pow2 k)", "source_type": "val lemma_replace_modulo_bound_aux (k a b u: nat)\n : Lemma (requires a < pow2 k /\\ a % pow2 u == 0 /\\ b < pow2 u /\\ u < k) (ensures a + b < pow2 k)", "source_definition": "let lemma_replace_modulo_bound_aux (k:nat) (a:nat) (b:nat) (u:nat)\n : Lemma (requires a < pow2 k /\\ a % pow2 u == 0 /\\ b < pow2 u /\\ u < k)\n (ensures a + b < pow2 k) =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_div_mod a (pow2 u);\n assert(a + b == pow2 u * (a / pow2 u) + b);\n lemma_div_plus b (a / pow2 u) (pow2 u);\n small_div b (pow2 u);\n lemma_div_lt_nat a k u;\n assert((a / pow2 u) < pow2 (k-u));\n assert(((a + b) / pow2 u) / pow2 (k-u) < 1);\n division_multiplication_lemma (a+b) (pow2 u) (pow2 (k-u));\n pow2_plus u (k-u)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 16, "start_col": 2, "end_line": 26, "end_col": 19 }, "file_context": "module QUIC.Spec.PacketNumber.Lemmas\n\nlet replace_modulo' (a b new_mod:nat) : Pure nat\n (requires b > 0 /\\ new_mod < b)\n (ensures fun res -> res % b = new_mod /\\ res / b = a / b) =\n let open FStar.Math.Lemmas in\n let res = a - a%b + new_mod in\n lemma_mod_plus new_mod (a/b) b;\n small_mod new_mod b;\n res\n\n#push-options \"--z3rlimit 256\"\nlet lemma_replace_modulo_bound_aux (k:nat) (a:nat) (b:nat) (u:nat)\n : Lemma (requires a < pow2 k /\\ a % pow2 u == 0 /\\ b < pow2 u /\\ u < k)", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.Lemmas.fst", "checked_file": "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 256, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "k: Prims.nat -> a: Prims.nat -> b: Prims.nat -> u10: Prims.nat\n -> FStar.Pervasives.Lemma\n (requires a < Prims.pow2 k /\\ a % Prims.pow2 u10 == 0 /\\ b < Prims.pow2 u10 /\\ u10 < k)\n (ensures a + b < Prims.pow2 k)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "FStar.Math.Lemmas.pow2_plus", "Prims.op_Subtraction", "Prims.unit", "FStar.Math.Lemmas.division_multiplication_lemma", "Prims.op_Addition", "Prims.pow2", "Prims._assert", "Prims.b2t", "Prims.op_LessThan", "Prims.op_Division", "FStar.Math.Lemmas.lemma_div_lt_nat", "FStar.Math.Lemmas.small_div", "FStar.Math.Lemmas.lemma_div_plus", "Prims.eq2", "Prims.int", "FStar.Mul.op_Star", "FStar.Math.Lemmas.lemma_div_mod", "Prims.l_and", "Prims.op_Modulus", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_replace_modulo_bound_aux (k a b u: nat)\n : Lemma (requires a < pow2 k /\\ a % pow2 u == 0 /\\ b < pow2 u /\\ u < k) (ensures a + b < pow2 k)\nlet lemma_replace_modulo_bound_aux (k a b u: nat)\n : Lemma (requires a < pow2 k /\\ a % pow2 u == 0 /\\ b < pow2 u /\\ u < k) (ensures a + b < pow2 k) =", "completed_definiton": "let open FStar.Math.Lemmas in\nlet open FStar.Mul in\nlemma_div_mod a (pow2 u);\nassert (a + b == pow2 u * (a / pow2 u) + b);\nlemma_div_plus b (a / pow2 u) (pow2 u);\nsmall_div b (pow2 u);\nlemma_div_lt_nat a k u;\nassert ((a / pow2 u) < pow2 (k - u));\nassert (((a + b) / pow2 u) / pow2 (k - u) < 1);\ndivision_multiplication_lemma (a + b) (pow2 u) (pow2 (k - u));\npow2_plus u (k - u)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.Lemmas.fst", "name": "QUIC.Spec.PacketNumber.Lemmas.logand_mask", "original_source_type": "val logand_mask (#n: pos) (a: U.uint_t n) (m: nat{m <= n})\n : Lemma (pow2 m <= pow2 n /\\ U.logand #n a (pow2 m - 1) == a % pow2 m)", "source_type": "val logand_mask (#n: pos) (a: U.uint_t n) (m: nat{m <= n})\n : Lemma (pow2 m <= pow2 n /\\ U.logand #n a (pow2 m - 1) == a % pow2 m)", "source_definition": "let logand_mask (#n:pos) (a:U.uint_t n) (m:nat{m <= n})\n: Lemma (pow2 m <= pow2 n /\\ U.logand #n a (pow2 m - 1) == a % pow2 m)\n= if m = 0\n then U.logand_lemma_1 a\n else if m = n\n then begin\n FStar.Math.Lemmas.small_mod a (pow2 n);\n U.logand_lemma_2 a\n end\n else U.logand_mask a m", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 54, "start_col": 2, "end_line": 61, "end_col": 24 }, "file_context": "module QUIC.Spec.PacketNumber.Lemmas\n\nlet replace_modulo' (a b new_mod:nat) : Pure nat\n (requires b > 0 /\\ new_mod < b)\n (ensures fun res -> res % b = new_mod /\\ res / b = a / b) =\n let open FStar.Math.Lemmas in\n let res = a - a%b + new_mod in\n lemma_mod_plus new_mod (a/b) b;\n small_mod new_mod b;\n res\n\n#push-options \"--z3rlimit 256\"\nlet lemma_replace_modulo_bound_aux (k:nat) (a:nat) (b:nat) (u:nat)\n : Lemma (requires a < pow2 k /\\ a % pow2 u == 0 /\\ b < pow2 u /\\ u < k)\n (ensures a + b < pow2 k) =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_div_mod a (pow2 u);\n assert(a + b == pow2 u * (a / pow2 u) + b);\n lemma_div_plus b (a / pow2 u) (pow2 u);\n small_div b (pow2 u);\n lemma_div_lt_nat a k u;\n assert((a / pow2 u) < pow2 (k-u));\n assert(((a + b) / pow2 u) / pow2 (k-u) < 1);\n division_multiplication_lemma (a+b) (pow2 u) (pow2 (k-u));\n pow2_plus u (k-u)\n#pop-options\n\n#push-options \"--z3rlimit 1024\"\n\n#restart-solver\nlet lemma_replace_modulo_bound (a mod_pow new_mod up_pow:nat) : Lemma\n (requires\n mod_pow < up_pow /\\\n new_mod < pow2 mod_pow /\\\n a < pow2 up_pow)\n (ensures replace_modulo' a (pow2 mod_pow) new_mod < pow2 up_pow) =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n let (pmod,umod) = (pow2 mod_pow, pow2 up_pow) in\n lemma_div_mod a pmod;\n multiple_modulo_lemma (a / pmod) pmod;\n lemma_replace_modulo_bound_aux up_pow (a-a%pow2 mod_pow) new_mod mod_pow\n\nmodule U64 = FStar.UInt64\n\n#restart-solver\n\nmodule Secret = QUIC.Secret.Int\nmodule U = FStar.UInt\n \nlet logand_mask (#n:pos) (a:U.uint_t n) (m:nat{m <= n})", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.Lemmas.fst", "checked_file": "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 1024, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: FStar.UInt.uint_t n -> m: Prims.nat{m <= n}\n -> FStar.Pervasives.Lemma\n (ensures\n Prims.pow2 m <= Prims.pow2 n /\\ FStar.UInt.logand a (Prims.pow2 m - 1) == a % Prims.pow2 m)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.pos", "FStar.UInt.uint_t", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_Equality", "Prims.int", "FStar.UInt.logand_lemma_1", "Prims.bool", "Prims.l_or", "Prims.op_GreaterThan", "Prims.l_and", "Prims.op_GreaterThanOrEqual", "FStar.UInt.logand_lemma_2", "Prims.unit", "FStar.Math.Lemmas.small_mod", "Prims.pow2", "FStar.UInt.logand_mask", "Prims.l_True", "Prims.squash", "Prims.eq2", "FStar.UInt.logand", "Prims.op_Subtraction", "Prims.op_Modulus", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val logand_mask (#n: pos) (a: U.uint_t n) (m: nat{m <= n})\n : Lemma (pow2 m <= pow2 n /\\ U.logand #n a (pow2 m - 1) == a % pow2 m)\nlet logand_mask (#n: pos) (a: U.uint_t n) (m: nat{m <= n})\n : Lemma (pow2 m <= pow2 n /\\ U.logand #n a (pow2 m - 1) == a % pow2 m) =", "completed_definiton": "if m = 0\nthen U.logand_lemma_1 a\nelse\n if m = n\n then\n (FStar.Math.Lemmas.small_mod a (pow2 n);\n U.logand_lemma_2 a)\n else U.logand_mask a m", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.Lemmas.fst", "name": "QUIC.Spec.PacketNumber.Lemmas.replace_modulo", "original_source_type": "val replace_modulo\n (a: Secret.uint64{Secret.v a < pow2 62})\n (b_size: FStar.Ghost.erased nat {b_size <= 64})\n (b_mask: Secret.uint64{Secret.v b_mask == pow2 b_size - 1})\n (new_mod: Secret.uint64)\n : Pure Secret.uint64\n (requires Secret.v new_mod < pow2 (b_size))\n (ensures\n fun res -> Secret.v res == replace_modulo' (Secret.v a) (pow2 (b_size)) (Secret.v new_mod))", "source_type": "val replace_modulo\n (a: Secret.uint64{Secret.v a < pow2 62})\n (b_size: FStar.Ghost.erased nat {b_size <= 64})\n (b_mask: Secret.uint64{Secret.v b_mask == pow2 b_size - 1})\n (new_mod: Secret.uint64)\n : Pure Secret.uint64\n (requires Secret.v new_mod < pow2 (b_size))\n (ensures\n fun res -> Secret.v res == replace_modulo' (Secret.v a) (pow2 (b_size)) (Secret.v new_mod))", "source_definition": "let replace_modulo\n (a: Secret.uint64 { Secret.v a < pow2 62 })\n (b_size: FStar.Ghost.erased nat { b_size <= 64 })\n (b_mask: Secret.uint64 { Secret.v b_mask == pow2 b_size - 1 })\n (new_mod: Secret.uint64)\n: Pure Secret.uint64\n (requires Secret.v new_mod < pow2 (b_size))\n (ensures fun res -> Secret.v res == replace_modulo' (Secret.v a) (pow2 (b_size)) (Secret.v new_mod))\n=\n let open FStar.Math.Lemmas in\n [@inline_let] let _ =\n lemma_mod_plus (Secret.v new_mod) (Secret.v a / pow2 b_size) (pow2 b_size);\n Secret.logand_spec a b_mask;\n logand_mask #64 (Secret.v a) b_size;\n small_mod (Secret.v new_mod) (pow2 b_size);\n lemma_mod_lt (Secret.v a) (pow2 b_size)\n in\n (a `Secret.sub` (a `Secret.logand` b_mask)) `Secret.add` new_mod", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 79, "start_col": 2, "end_line": 87, "end_col": 66 }, "file_context": "module QUIC.Spec.PacketNumber.Lemmas\n\nlet replace_modulo' (a b new_mod:nat) : Pure nat\n (requires b > 0 /\\ new_mod < b)\n (ensures fun res -> res % b = new_mod /\\ res / b = a / b) =\n let open FStar.Math.Lemmas in\n let res = a - a%b + new_mod in\n lemma_mod_plus new_mod (a/b) b;\n small_mod new_mod b;\n res\n\n#push-options \"--z3rlimit 256\"\nlet lemma_replace_modulo_bound_aux (k:nat) (a:nat) (b:nat) (u:nat)\n : Lemma (requires a < pow2 k /\\ a % pow2 u == 0 /\\ b < pow2 u /\\ u < k)\n (ensures a + b < pow2 k) =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n lemma_div_mod a (pow2 u);\n assert(a + b == pow2 u * (a / pow2 u) + b);\n lemma_div_plus b (a / pow2 u) (pow2 u);\n small_div b (pow2 u);\n lemma_div_lt_nat a k u;\n assert((a / pow2 u) < pow2 (k-u));\n assert(((a + b) / pow2 u) / pow2 (k-u) < 1);\n division_multiplication_lemma (a+b) (pow2 u) (pow2 (k-u));\n pow2_plus u (k-u)\n#pop-options\n\n#push-options \"--z3rlimit 1024\"\n\n#restart-solver\nlet lemma_replace_modulo_bound (a mod_pow new_mod up_pow:nat) : Lemma\n (requires\n mod_pow < up_pow /\\\n new_mod < pow2 mod_pow /\\\n a < pow2 up_pow)\n (ensures replace_modulo' a (pow2 mod_pow) new_mod < pow2 up_pow) =\n let open FStar.Math.Lemmas in\n let open FStar.Mul in\n let (pmod,umod) = (pow2 mod_pow, pow2 up_pow) in\n lemma_div_mod a pmod;\n multiple_modulo_lemma (a / pmod) pmod;\n lemma_replace_modulo_bound_aux up_pow (a-a%pow2 mod_pow) new_mod mod_pow\n\nmodule U64 = FStar.UInt64\n\n#restart-solver\n\nmodule Secret = QUIC.Secret.Int\nmodule U = FStar.UInt\n \nlet logand_mask (#n:pos) (a:U.uint_t n) (m:nat{m <= n})\n: Lemma (pow2 m <= pow2 n /\\ U.logand #n a (pow2 m - 1) == a % pow2 m)\n= if m = 0\n then U.logand_lemma_1 a\n else if m = n\n then begin\n FStar.Math.Lemmas.small_mod a (pow2 n);\n U.logand_lemma_2 a\n end\n else U.logand_mask a m\n\n#pop-options\n\n#push-options \"--z3rlimit 2048\"\n\n#restart-solver\n\ninline_for_extraction\nlet replace_modulo\n (a: Secret.uint64 { Secret.v a < pow2 62 })\n (b_size: FStar.Ghost.erased nat { b_size <= 64 })\n (b_mask: Secret.uint64 { Secret.v b_mask == pow2 b_size - 1 })\n (new_mod: Secret.uint64)\n: Pure Secret.uint64\n (requires Secret.v new_mod < pow2 (b_size))\n (ensures fun res -> Secret.v res == replace_modulo' (Secret.v a) (pow2 (b_size)) (Secret.v new_mod))", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.Lemmas.fst", "checked_file": "QUIC.Spec.PacketNumber.Lemmas.fst.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 2048, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: Lib.IntTypes.uint64{QUIC.Secret.Int.Base.v a < Prims.pow2 62} ->\n b_size: FStar.Ghost.erased Prims.nat {FStar.Ghost.reveal b_size <= 64} ->\n b_mask:\n Lib.IntTypes.uint64\n {QUIC.Secret.Int.Base.v b_mask == Prims.pow2 (FStar.Ghost.reveal b_size) - 1} ->\n new_mod: Lib.IntTypes.uint64\n -> Prims.Pure Lib.IntTypes.uint64", "effect": "Prims.Pure", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.uint64", "Prims.b2t", "Prims.op_LessThan", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "Prims.pow2", "FStar.Ghost.erased", "Prims.nat", "Prims.op_LessThanOrEqual", "FStar.Ghost.reveal", "Prims.eq2", "Prims.int", "Prims.op_Subtraction", "Lib.IntTypes.add", "Lib.IntTypes.sub", "Lib.IntTypes.logand", "Prims.unit", "FStar.Math.Lemmas.lemma_mod_lt", "FStar.Math.Lemmas.small_mod", "QUIC.Spec.PacketNumber.Lemmas.logand_mask", "Lib.IntTypes.logand_spec", "FStar.Math.Lemmas.lemma_mod_plus", "Prims.op_Division", "Prims.l_or", "Lib.IntTypes.range", "Prims.op_GreaterThanOrEqual", "QUIC.Spec.PacketNumber.Lemmas.replace_modulo'" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val replace_modulo\n (a: Secret.uint64{Secret.v a < pow2 62})\n (b_size: FStar.Ghost.erased nat {b_size <= 64})\n (b_mask: Secret.uint64{Secret.v b_mask == pow2 b_size - 1})\n (new_mod: Secret.uint64)\n : Pure Secret.uint64\n (requires Secret.v new_mod < pow2 (b_size))\n (ensures\n fun res -> Secret.v res == replace_modulo' (Secret.v a) (pow2 (b_size)) (Secret.v new_mod))\nlet replace_modulo\n (a: Secret.uint64{Secret.v a < pow2 62})\n (b_size: FStar.Ghost.erased nat {b_size <= 64})\n (b_mask: Secret.uint64{Secret.v b_mask == pow2 b_size - 1})\n (new_mod: Secret.uint64)\n : Pure Secret.uint64\n (requires Secret.v new_mod < pow2 (b_size))\n (ensures\n fun res -> Secret.v res == replace_modulo' (Secret.v a) (pow2 (b_size)) (Secret.v new_mod)) =", "completed_definiton": "let open FStar.Math.Lemmas in\n[@@ inline_let ]let _ =\n lemma_mod_plus (Secret.v new_mod) (Secret.v a / pow2 b_size) (pow2 b_size);\n Secret.logand_spec a b_mask;\n logand_mask #64 (Secret.v a) b_size;\n small_mod (Secret.v new_mod) (pow2 b_size);\n lemma_mod_lt (Secret.v a) (pow2 b_size)\nin\n(a `Secret.sub` (a `Secret.logand` b_mask)) `Secret.add` new_mod", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Base.fst", "name": "QUIC.Impl.Header.Base.is_retry", "original_source_type": "val is_retry (h: header) : Tot bool", "source_type": "val is_retry (h: header) : Tot bool", "source_definition": "let is_retry\n (h: header)\n: Tot bool\n= BLong? h && BRetry? (BLong?.spec h)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 85, "start_col": 2, "end_line": 85, "end_col": 37 }, "file_context": "module QUIC.Impl.Header.Base\nopen QUIC.Spec.Header.Base\ninclude QUIC.Impl.Base\n\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule Spec = QUIC.Spec.Header.Base\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\n/// Information stored in a QUIC header. This is a Low* type passed by value --\n/// it's a little expensive. Consider passing it by reference in ``encrypt``?\n///\n/// Note that we try to follow the convention of buffer arguments followed by\n/// their lengths.\n\n(* NOTE: in the following header type, payload_and_pn_length contains the\nlength of the actual payload AND of the packet number. *)\n\n(* NOTE: the header no longer contains the packet number, which is\npart of the state, so that the client no longer needs to take care of\nit *)\n\nnoeq type long_header_specifics =\n | BInitial:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n token: B.buffer U8.t -> (* I reordered those so that the extracted code for this type is a tagged union with common prefixes *)\n token_length: U32.t { let v = U32.v token_length in v == B.length token /\\ 0 <= v /\\ v <= token_max_len } ->\n long_header_specifics\n | BZeroRTT:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n long_header_specifics\n | BHandshake:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n long_header_specifics\n | BRetry:\n unused: secret_bitfield 4 ->\n odcid: B.buffer U8.t ->\n odcil: U32.t { let v = U32.v odcil in v = B.length odcid /\\ 0 <= v /\\ v <= 20 } ->\n long_header_specifics\n\nnoeq type header =\n | BLong:\n version: U32.t ->\n dcid: B.buffer U8.t ->\n dcil: U32.t { let v = U32.v dcil in v == B.length dcid /\\ 0 <= v /\\ v <= 20 } ->\n scid: B.buffer U8.t ->\n scil: U32.t { let v = U32.v scil in v == B.length scid /\\ 0 <= v /\\ v <= 20 } ->\n spec: long_header_specifics ->\n header\n | BShort:\n reserved_bits: secret_bitfield 2 ->\n spin: bool ->\n phase: secret_bitfield 1 -> // no secret bools in HACL*\n cid: B.buffer U8.t ->\n cid_len: U32.t{\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n } ->\n packet_number_length: PN.packet_number_length_t ->\n header\n\nlet dcid_len\n (h: header)\n: Tot U32.t\n= match h with\n | BShort rb spin phase cid cid_len packet_number_length ->\n cid_len\n | BLong version dcid dcil scid scil spec -> dcil\n\n// inline_for_extraction\nlet is_retry\n (h: header)", "dependencies": { "source_file": "QUIC.Impl.Header.Base.fst", "checked_file": "QUIC.Impl.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Impl.Header.Base.header -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Base.header", "Prims.op_AmpAmp", "QUIC.Impl.Header.Base.uu___is_BLong", "QUIC.Impl.Header.Base.uu___is_BRetry", "QUIC.Impl.Header.Base.__proj__BLong__item__spec", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val is_retry (h: header) : Tot bool\nlet is_retry (h: header) : Tot bool =", "completed_definiton": "BLong? h && BRetry? (BLong?.spec h)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Base.fst", "name": "QUIC.Impl.Header.Base.has_payload_length", "original_source_type": "val has_payload_length (h: header) : Tot bool", "source_type": "val has_payload_length (h: header) : Tot bool", "source_definition": "let has_payload_length\n (h: header)\n: Tot bool\n= BLong? h && not (BRetry? (BLong?.spec h))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 108, "start_col": 2, "end_line": 108, "end_col": 43 }, "file_context": "module QUIC.Impl.Header.Base\nopen QUIC.Spec.Header.Base\ninclude QUIC.Impl.Base\n\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule Spec = QUIC.Spec.Header.Base\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\n/// Information stored in a QUIC header. This is a Low* type passed by value --\n/// it's a little expensive. Consider passing it by reference in ``encrypt``?\n///\n/// Note that we try to follow the convention of buffer arguments followed by\n/// their lengths.\n\n(* NOTE: in the following header type, payload_and_pn_length contains the\nlength of the actual payload AND of the packet number. *)\n\n(* NOTE: the header no longer contains the packet number, which is\npart of the state, so that the client no longer needs to take care of\nit *)\n\nnoeq type long_header_specifics =\n | BInitial:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n token: B.buffer U8.t -> (* I reordered those so that the extracted code for this type is a tagged union with common prefixes *)\n token_length: U32.t { let v = U32.v token_length in v == B.length token /\\ 0 <= v /\\ v <= token_max_len } ->\n long_header_specifics\n | BZeroRTT:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n long_header_specifics\n | BHandshake:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n long_header_specifics\n | BRetry:\n unused: secret_bitfield 4 ->\n odcid: B.buffer U8.t ->\n odcil: U32.t { let v = U32.v odcil in v = B.length odcid /\\ 0 <= v /\\ v <= 20 } ->\n long_header_specifics\n\nnoeq type header =\n | BLong:\n version: U32.t ->\n dcid: B.buffer U8.t ->\n dcil: U32.t { let v = U32.v dcil in v == B.length dcid /\\ 0 <= v /\\ v <= 20 } ->\n scid: B.buffer U8.t ->\n scil: U32.t { let v = U32.v scil in v == B.length scid /\\ 0 <= v /\\ v <= 20 } ->\n spec: long_header_specifics ->\n header\n | BShort:\n reserved_bits: secret_bitfield 2 ->\n spin: bool ->\n phase: secret_bitfield 1 -> // no secret bools in HACL*\n cid: B.buffer U8.t ->\n cid_len: U32.t{\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n } ->\n packet_number_length: PN.packet_number_length_t ->\n header\n\nlet dcid_len\n (h: header)\n: Tot U32.t\n= match h with\n | BShort rb spin phase cid cid_len packet_number_length ->\n cid_len\n | BLong version dcid dcil scid scil spec -> dcil\n\n// inline_for_extraction\nlet is_retry\n (h: header)\n: Tot bool\n= BLong? h && BRetry? (BLong?.spec h)\n\n// inline_for_extraction\nlet pn_length\n (h: header {~ (is_retry h)})\n: Tot PN.packet_number_length_t\n= match h with\n | BShort _ spin phase cid cid_len packet_number_length ->\n packet_number_length\n | BLong version dcid dcil scid scil spec ->\n begin match spec with\n | BInitial _ payload_and_pn_length packet_number_length token token_length ->\n packet_number_length\n | BZeroRTT _ payload_length packet_number_length ->\n packet_number_length\n | BHandshake _ payload_length packet_number_length ->\n packet_number_length\n end\n\n// inline_for_extraction\nlet has_payload_length\n (h: header)", "dependencies": { "source_file": "QUIC.Impl.Header.Base.fst", "checked_file": "QUIC.Impl.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Impl.Header.Base.header -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Base.header", "Prims.op_AmpAmp", "QUIC.Impl.Header.Base.uu___is_BLong", "Prims.op_Negation", "QUIC.Impl.Header.Base.uu___is_BRetry", "QUIC.Impl.Header.Base.__proj__BLong__item__spec", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val has_payload_length (h: header) : Tot bool\nlet has_payload_length (h: header) : Tot bool =", "completed_definiton": "BLong? h && not (BRetry? (BLong?.spec h))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Base.fst", "name": "QUIC.Impl.Header.Base.dcid_len", "original_source_type": "val dcid_len (h: header) : Tot U32.t", "source_type": "val dcid_len (h: header) : Tot U32.t", "source_definition": "let dcid_len\n (h: header)\n: Tot U32.t\n= match h with\n | BShort rb spin phase cid cid_len packet_number_length ->\n cid_len\n | BLong version dcid dcil scid scil spec -> dcil", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 76, "start_col": 2, "end_line": 79, "end_col": 50 }, "file_context": "module QUIC.Impl.Header.Base\nopen QUIC.Spec.Header.Base\ninclude QUIC.Impl.Base\n\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule Spec = QUIC.Spec.Header.Base\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\n/// Information stored in a QUIC header. This is a Low* type passed by value --\n/// it's a little expensive. Consider passing it by reference in ``encrypt``?\n///\n/// Note that we try to follow the convention of buffer arguments followed by\n/// their lengths.\n\n(* NOTE: in the following header type, payload_and_pn_length contains the\nlength of the actual payload AND of the packet number. *)\n\n(* NOTE: the header no longer contains the packet number, which is\npart of the state, so that the client no longer needs to take care of\nit *)\n\nnoeq type long_header_specifics =\n | BInitial:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n token: B.buffer U8.t -> (* I reordered those so that the extracted code for this type is a tagged union with common prefixes *)\n token_length: U32.t { let v = U32.v token_length in v == B.length token /\\ 0 <= v /\\ v <= token_max_len } ->\n long_header_specifics\n | BZeroRTT:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n long_header_specifics\n | BHandshake:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n long_header_specifics\n | BRetry:\n unused: secret_bitfield 4 ->\n odcid: B.buffer U8.t ->\n odcil: U32.t { let v = U32.v odcil in v = B.length odcid /\\ 0 <= v /\\ v <= 20 } ->\n long_header_specifics\n\nnoeq type header =\n | BLong:\n version: U32.t ->\n dcid: B.buffer U8.t ->\n dcil: U32.t { let v = U32.v dcil in v == B.length dcid /\\ 0 <= v /\\ v <= 20 } ->\n scid: B.buffer U8.t ->\n scil: U32.t { let v = U32.v scil in v == B.length scid /\\ 0 <= v /\\ v <= 20 } ->\n spec: long_header_specifics ->\n header\n | BShort:\n reserved_bits: secret_bitfield 2 ->\n spin: bool ->\n phase: secret_bitfield 1 -> // no secret bools in HACL*\n cid: B.buffer U8.t ->\n cid_len: U32.t{\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n } ->\n packet_number_length: PN.packet_number_length_t ->\n header\n\nlet dcid_len\n (h: header)", "dependencies": { "source_file": "QUIC.Impl.Header.Base.fst", "checked_file": "QUIC.Impl.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Impl.Header.Base.header -> FStar.UInt32.t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Base.header", "QUIC.Spec.Base.secret_bitfield", "Prims.bool", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.op_LessThanOrEqual", "FStar.UInt.uint_t", "FStar.UInt32.v", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Impl.Header.Base.long_header_specifics" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val dcid_len (h: header) : Tot U32.t\nlet dcid_len (h: header) : Tot U32.t =", "completed_definiton": "match h with\n| BShort rb spin phase cid cid_len packet_number_length -> cid_len\n| BLong version dcid dcil scid scil spec -> dcil", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Base.fst", "name": "QUIC.Impl.Header.Base.payload_and_pn_length", "original_source_type": "val payload_and_pn_length (h: header{has_payload_length h}) : Tot payload_and_pn_length_t", "source_type": "val payload_and_pn_length (h: header{has_payload_length h}) : Tot payload_and_pn_length_t", "source_definition": "let payload_and_pn_length\n (h: header { has_payload_length h })\n: Tot payload_and_pn_length_t\n= match BLong?.spec h with\n | BInitial _ pl _ _ _ -> pl\n | BZeroRTT _ pl _ -> pl\n | BHandshake _ pl _ -> pl", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 114, "start_col": 2, "end_line": 117, "end_col": 27 }, "file_context": "module QUIC.Impl.Header.Base\nopen QUIC.Spec.Header.Base\ninclude QUIC.Impl.Base\n\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule Spec = QUIC.Spec.Header.Base\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\n/// Information stored in a QUIC header. This is a Low* type passed by value --\n/// it's a little expensive. Consider passing it by reference in ``encrypt``?\n///\n/// Note that we try to follow the convention of buffer arguments followed by\n/// their lengths.\n\n(* NOTE: in the following header type, payload_and_pn_length contains the\nlength of the actual payload AND of the packet number. *)\n\n(* NOTE: the header no longer contains the packet number, which is\npart of the state, so that the client no longer needs to take care of\nit *)\n\nnoeq type long_header_specifics =\n | BInitial:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n token: B.buffer U8.t -> (* I reordered those so that the extracted code for this type is a tagged union with common prefixes *)\n token_length: U32.t { let v = U32.v token_length in v == B.length token /\\ 0 <= v /\\ v <= token_max_len } ->\n long_header_specifics\n | BZeroRTT:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n long_header_specifics\n | BHandshake:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n long_header_specifics\n | BRetry:\n unused: secret_bitfield 4 ->\n odcid: B.buffer U8.t ->\n odcil: U32.t { let v = U32.v odcil in v = B.length odcid /\\ 0 <= v /\\ v <= 20 } ->\n long_header_specifics\n\nnoeq type header =\n | BLong:\n version: U32.t ->\n dcid: B.buffer U8.t ->\n dcil: U32.t { let v = U32.v dcil in v == B.length dcid /\\ 0 <= v /\\ v <= 20 } ->\n scid: B.buffer U8.t ->\n scil: U32.t { let v = U32.v scil in v == B.length scid /\\ 0 <= v /\\ v <= 20 } ->\n spec: long_header_specifics ->\n header\n | BShort:\n reserved_bits: secret_bitfield 2 ->\n spin: bool ->\n phase: secret_bitfield 1 -> // no secret bools in HACL*\n cid: B.buffer U8.t ->\n cid_len: U32.t{\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n } ->\n packet_number_length: PN.packet_number_length_t ->\n header\n\nlet dcid_len\n (h: header)\n: Tot U32.t\n= match h with\n | BShort rb spin phase cid cid_len packet_number_length ->\n cid_len\n | BLong version dcid dcil scid scil spec -> dcil\n\n// inline_for_extraction\nlet is_retry\n (h: header)\n: Tot bool\n= BLong? h && BRetry? (BLong?.spec h)\n\n// inline_for_extraction\nlet pn_length\n (h: header {~ (is_retry h)})\n: Tot PN.packet_number_length_t\n= match h with\n | BShort _ spin phase cid cid_len packet_number_length ->\n packet_number_length\n | BLong version dcid dcil scid scil spec ->\n begin match spec with\n | BInitial _ payload_and_pn_length packet_number_length token token_length ->\n packet_number_length\n | BZeroRTT _ payload_length packet_number_length ->\n packet_number_length\n | BHandshake _ payload_length packet_number_length ->\n packet_number_length\n end\n\n// inline_for_extraction\nlet has_payload_length\n (h: header)\n: Tot bool\n= BLong? h && not (BRetry? (BLong?.spec h))\n\n// inline_for_extraction\nlet payload_and_pn_length\n (h: header { has_payload_length h })", "dependencies": { "source_file": "QUIC.Impl.Header.Base.fst", "checked_file": "QUIC.Impl.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Impl.Header.Base.header{QUIC.Impl.Header.Base.has_payload_length h}\n -> QUIC.Spec.Base.payload_and_pn_length_t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Base.header", "Prims.b2t", "QUIC.Impl.Header.Base.has_payload_length", "QUIC.Impl.Header.Base.__proj__BLong__item__spec", "QUIC.Spec.Base.secret_bitfield", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.op_LessThanOrEqual", "QUIC.Spec.Base.token_max_len", "FStar.UInt.uint_t", "FStar.UInt32.v" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val payload_and_pn_length (h: header{has_payload_length h}) : Tot payload_and_pn_length_t\nlet payload_and_pn_length (h: header{has_payload_length h}) : Tot payload_and_pn_length_t =", "completed_definiton": "match BLong?.spec h with\n| BInitial _ pl _ _ _ -> pl\n| BZeroRTT _ pl _ -> pl\n| BHandshake _ pl _ -> pl", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Base.fst", "name": "QUIC.Impl.Header.Base.pn_length", "original_source_type": "val pn_length (h: header{~(is_retry h)}) : Tot PN.packet_number_length_t", "source_type": "val pn_length (h: header{~(is_retry h)}) : Tot PN.packet_number_length_t", "source_definition": "let pn_length\n (h: header {~ (is_retry h)})\n: Tot PN.packet_number_length_t\n= match h with\n | BShort _ spin phase cid cid_len packet_number_length ->\n packet_number_length\n | BLong version dcid dcil scid scil spec ->\n begin match spec with\n | BInitial _ payload_and_pn_length packet_number_length token token_length ->\n packet_number_length\n | BZeroRTT _ payload_length packet_number_length ->\n packet_number_length\n | BHandshake _ payload_length packet_number_length ->\n packet_number_length\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 91, "start_col": 2, "end_line": 102, "end_col": 7 }, "file_context": "module QUIC.Impl.Header.Base\nopen QUIC.Spec.Header.Base\ninclude QUIC.Impl.Base\n\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule Spec = QUIC.Spec.Header.Base\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\n/// Information stored in a QUIC header. This is a Low* type passed by value --\n/// it's a little expensive. Consider passing it by reference in ``encrypt``?\n///\n/// Note that we try to follow the convention of buffer arguments followed by\n/// their lengths.\n\n(* NOTE: in the following header type, payload_and_pn_length contains the\nlength of the actual payload AND of the packet number. *)\n\n(* NOTE: the header no longer contains the packet number, which is\npart of the state, so that the client no longer needs to take care of\nit *)\n\nnoeq type long_header_specifics =\n | BInitial:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n token: B.buffer U8.t -> (* I reordered those so that the extracted code for this type is a tagged union with common prefixes *)\n token_length: U32.t { let v = U32.v token_length in v == B.length token /\\ 0 <= v /\\ v <= token_max_len } ->\n long_header_specifics\n | BZeroRTT:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n long_header_specifics\n | BHandshake:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n long_header_specifics\n | BRetry:\n unused: secret_bitfield 4 ->\n odcid: B.buffer U8.t ->\n odcil: U32.t { let v = U32.v odcil in v = B.length odcid /\\ 0 <= v /\\ v <= 20 } ->\n long_header_specifics\n\nnoeq type header =\n | BLong:\n version: U32.t ->\n dcid: B.buffer U8.t ->\n dcil: U32.t { let v = U32.v dcil in v == B.length dcid /\\ 0 <= v /\\ v <= 20 } ->\n scid: B.buffer U8.t ->\n scil: U32.t { let v = U32.v scil in v == B.length scid /\\ 0 <= v /\\ v <= 20 } ->\n spec: long_header_specifics ->\n header\n | BShort:\n reserved_bits: secret_bitfield 2 ->\n spin: bool ->\n phase: secret_bitfield 1 -> // no secret bools in HACL*\n cid: B.buffer U8.t ->\n cid_len: U32.t{\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n } ->\n packet_number_length: PN.packet_number_length_t ->\n header\n\nlet dcid_len\n (h: header)\n: Tot U32.t\n= match h with\n | BShort rb spin phase cid cid_len packet_number_length ->\n cid_len\n | BLong version dcid dcil scid scil spec -> dcil\n\n// inline_for_extraction\nlet is_retry\n (h: header)\n: Tot bool\n= BLong? h && BRetry? (BLong?.spec h)\n\n// inline_for_extraction\nlet pn_length\n (h: header {~ (is_retry h)})", "dependencies": { "source_file": "QUIC.Impl.Header.Base.fst", "checked_file": "QUIC.Impl.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Impl.Header.Base.header{~(QUIC.Impl.Header.Base.is_retry h)}\n -> QUIC.Spec.PacketNumber.Base.packet_number_length_t", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Impl.Header.Base.is_retry", "QUIC.Spec.Base.secret_bitfield", "Prims.bool", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.op_LessThanOrEqual", "FStar.UInt.uint_t", "FStar.UInt32.v", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Impl.Header.Base.long_header_specifics", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Base.token_max_len" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val pn_length (h: header{~(is_retry h)}) : Tot PN.packet_number_length_t\nlet pn_length (h: header{~(is_retry h)}) : Tot PN.packet_number_length_t =", "completed_definiton": "match h with\n| BShort _ spin phase cid cid_len packet_number_length -> packet_number_length\n| BLong version dcid dcil scid scil spec ->\n match spec with\n | BInitial _ payload_and_pn_length packet_number_length token token_length -> packet_number_length\n | BZeroRTT _ payload_length packet_number_length -> packet_number_length\n | BHandshake _ payload_length packet_number_length -> packet_number_length", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Base.fst", "name": "QUIC.Impl.Header.Base.header_live", "original_source_type": "val header_live (h: header) (m: HS.mem) : GTot Type0", "source_type": "val header_live (h: header) (m: HS.mem) : GTot Type0", "source_definition": "let header_live (h: header) (m: HS.mem) : GTot Type0 =\n match h with\n | BShort _ spin phase cid cid_len packet_number_length ->\n B.live m cid\n | BLong version dcid dcil scid scil spec ->\n B.live m dcid /\\ B.live m scid /\\\n begin match spec with\n | BInitial _ payload_length packet_number_length token token_length ->\n B.live m token\n | BRetry unused odcid odcil ->\n B.live m odcid\n | _ -> True\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 128, "start_col": 2, "end_line": 139, "end_col": 7 }, "file_context": "module QUIC.Impl.Header.Base\nopen QUIC.Spec.Header.Base\ninclude QUIC.Impl.Base\n\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule Spec = QUIC.Spec.Header.Base\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\n/// Information stored in a QUIC header. This is a Low* type passed by value --\n/// it's a little expensive. Consider passing it by reference in ``encrypt``?\n///\n/// Note that we try to follow the convention of buffer arguments followed by\n/// their lengths.\n\n(* NOTE: in the following header type, payload_and_pn_length contains the\nlength of the actual payload AND of the packet number. *)\n\n(* NOTE: the header no longer contains the packet number, which is\npart of the state, so that the client no longer needs to take care of\nit *)\n\nnoeq type long_header_specifics =\n | BInitial:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n token: B.buffer U8.t -> (* I reordered those so that the extracted code for this type is a tagged union with common prefixes *)\n token_length: U32.t { let v = U32.v token_length in v == B.length token /\\ 0 <= v /\\ v <= token_max_len } ->\n long_header_specifics\n | BZeroRTT:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n long_header_specifics\n | BHandshake:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n long_header_specifics\n | BRetry:\n unused: secret_bitfield 4 ->\n odcid: B.buffer U8.t ->\n odcil: U32.t { let v = U32.v odcil in v = B.length odcid /\\ 0 <= v /\\ v <= 20 } ->\n long_header_specifics\n\nnoeq type header =\n | BLong:\n version: U32.t ->\n dcid: B.buffer U8.t ->\n dcil: U32.t { let v = U32.v dcil in v == B.length dcid /\\ 0 <= v /\\ v <= 20 } ->\n scid: B.buffer U8.t ->\n scil: U32.t { let v = U32.v scil in v == B.length scid /\\ 0 <= v /\\ v <= 20 } ->\n spec: long_header_specifics ->\n header\n | BShort:\n reserved_bits: secret_bitfield 2 ->\n spin: bool ->\n phase: secret_bitfield 1 -> // no secret bools in HACL*\n cid: B.buffer U8.t ->\n cid_len: U32.t{\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n } ->\n packet_number_length: PN.packet_number_length_t ->\n header\n\nlet dcid_len\n (h: header)\n: Tot U32.t\n= match h with\n | BShort rb spin phase cid cid_len packet_number_length ->\n cid_len\n | BLong version dcid dcil scid scil spec -> dcil\n\n// inline_for_extraction\nlet is_retry\n (h: header)\n: Tot bool\n= BLong? h && BRetry? (BLong?.spec h)\n\n// inline_for_extraction\nlet pn_length\n (h: header {~ (is_retry h)})\n: Tot PN.packet_number_length_t\n= match h with\n | BShort _ spin phase cid cid_len packet_number_length ->\n packet_number_length\n | BLong version dcid dcil scid scil spec ->\n begin match spec with\n | BInitial _ payload_and_pn_length packet_number_length token token_length ->\n packet_number_length\n | BZeroRTT _ payload_length packet_number_length ->\n packet_number_length\n | BHandshake _ payload_length packet_number_length ->\n packet_number_length\n end\n\n// inline_for_extraction\nlet has_payload_length\n (h: header)\n: Tot bool\n= BLong? h && not (BRetry? (BLong?.spec h))\n\n// inline_for_extraction\nlet payload_and_pn_length\n (h: header { has_payload_length h })\n: Tot payload_and_pn_length_t\n= match BLong?.spec h with\n | BInitial _ pl _ _ _ -> pl\n | BZeroRTT _ pl _ -> pl\n | BHandshake _ pl _ -> pl\n\n// inline_for_extraction\nlet payload_length\n (h: header { has_payload_length h })\n: Tot U62.secret\n= Secret.to_u64 (payload_and_pn_length h) `Secret.sub` Secret.to_u64 (pn_length h)\n\nmodule HS = FStar.HyperStack", "dependencies": { "source_file": "QUIC.Impl.Header.Base.fst", "checked_file": "QUIC.Impl.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Impl.Header.Base.header -> m: FStar.Monotonic.HyperStack.mem -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Base.header", "FStar.Monotonic.HyperStack.mem", "QUIC.Spec.Base.secret_bitfield", "Prims.bool", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.op_LessThanOrEqual", "FStar.UInt.uint_t", "FStar.UInt32.v", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "LowStar.Monotonic.Buffer.live", "QUIC.Impl.Header.Base.long_header_specifics", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Base.token_max_len", "Prims.op_Equality", "Prims.l_True", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_live (h: header) (m: HS.mem) : GTot Type0\nlet header_live (h: header) (m: HS.mem) : GTot Type0 =", "completed_definiton": "match h with\n| BShort _ spin phase cid cid_len packet_number_length -> B.live m cid\n| BLong version dcid dcil scid scil spec ->\n B.live m dcid /\\ B.live m scid /\\\n (match spec with\n | BInitial _ payload_length packet_number_length token token_length -> B.live m token\n | BRetry unused odcid odcil -> B.live m odcid\n | _ -> True)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Base.fst", "name": "QUIC.Impl.Header.Base.header_footprint", "original_source_type": "val header_footprint (h: header) : GTot B.loc", "source_type": "val header_footprint (h: header) : GTot B.loc", "source_definition": "let header_footprint (h: header) : GTot B.loc =\n match h with\n | BShort _ spin phase cid cid_len packet_number_length ->\n B.loc_buffer cid\n | BLong version dcid dcil scid scil spec ->\n (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) `B.loc_union`\n begin match spec with\n | BInitial _ payload_length packet_number_length token token_length ->\n B.loc_buffer token\n | BRetry unused odcid odcil ->\n B.loc_buffer odcid\n | _ -> B.loc_none\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 142, "start_col": 2, "end_line": 153, "end_col": 7 }, "file_context": "module QUIC.Impl.Header.Base\nopen QUIC.Spec.Header.Base\ninclude QUIC.Impl.Base\n\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule Spec = QUIC.Spec.Header.Base\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\n/// Information stored in a QUIC header. This is a Low* type passed by value --\n/// it's a little expensive. Consider passing it by reference in ``encrypt``?\n///\n/// Note that we try to follow the convention of buffer arguments followed by\n/// their lengths.\n\n(* NOTE: in the following header type, payload_and_pn_length contains the\nlength of the actual payload AND of the packet number. *)\n\n(* NOTE: the header no longer contains the packet number, which is\npart of the state, so that the client no longer needs to take care of\nit *)\n\nnoeq type long_header_specifics =\n | BInitial:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n token: B.buffer U8.t -> (* I reordered those so that the extracted code for this type is a tagged union with common prefixes *)\n token_length: U32.t { let v = U32.v token_length in v == B.length token /\\ 0 <= v /\\ v <= token_max_len } ->\n long_header_specifics\n | BZeroRTT:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n long_header_specifics\n | BHandshake:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n long_header_specifics\n | BRetry:\n unused: secret_bitfield 4 ->\n odcid: B.buffer U8.t ->\n odcil: U32.t { let v = U32.v odcil in v = B.length odcid /\\ 0 <= v /\\ v <= 20 } ->\n long_header_specifics\n\nnoeq type header =\n | BLong:\n version: U32.t ->\n dcid: B.buffer U8.t ->\n dcil: U32.t { let v = U32.v dcil in v == B.length dcid /\\ 0 <= v /\\ v <= 20 } ->\n scid: B.buffer U8.t ->\n scil: U32.t { let v = U32.v scil in v == B.length scid /\\ 0 <= v /\\ v <= 20 } ->\n spec: long_header_specifics ->\n header\n | BShort:\n reserved_bits: secret_bitfield 2 ->\n spin: bool ->\n phase: secret_bitfield 1 -> // no secret bools in HACL*\n cid: B.buffer U8.t ->\n cid_len: U32.t{\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n } ->\n packet_number_length: PN.packet_number_length_t ->\n header\n\nlet dcid_len\n (h: header)\n: Tot U32.t\n= match h with\n | BShort rb spin phase cid cid_len packet_number_length ->\n cid_len\n | BLong version dcid dcil scid scil spec -> dcil\n\n// inline_for_extraction\nlet is_retry\n (h: header)\n: Tot bool\n= BLong? h && BRetry? (BLong?.spec h)\n\n// inline_for_extraction\nlet pn_length\n (h: header {~ (is_retry h)})\n: Tot PN.packet_number_length_t\n= match h with\n | BShort _ spin phase cid cid_len packet_number_length ->\n packet_number_length\n | BLong version dcid dcil scid scil spec ->\n begin match spec with\n | BInitial _ payload_and_pn_length packet_number_length token token_length ->\n packet_number_length\n | BZeroRTT _ payload_length packet_number_length ->\n packet_number_length\n | BHandshake _ payload_length packet_number_length ->\n packet_number_length\n end\n\n// inline_for_extraction\nlet has_payload_length\n (h: header)\n: Tot bool\n= BLong? h && not (BRetry? (BLong?.spec h))\n\n// inline_for_extraction\nlet payload_and_pn_length\n (h: header { has_payload_length h })\n: Tot payload_and_pn_length_t\n= match BLong?.spec h with\n | BInitial _ pl _ _ _ -> pl\n | BZeroRTT _ pl _ -> pl\n | BHandshake _ pl _ -> pl\n\n// inline_for_extraction\nlet payload_length\n (h: header { has_payload_length h })\n: Tot U62.secret\n= Secret.to_u64 (payload_and_pn_length h) `Secret.sub` Secret.to_u64 (pn_length h)\n\nmodule HS = FStar.HyperStack\n\nlet header_live (h: header) (m: HS.mem) : GTot Type0 =\n match h with\n | BShort _ spin phase cid cid_len packet_number_length ->\n B.live m cid\n | BLong version dcid dcil scid scil spec ->\n B.live m dcid /\\ B.live m scid /\\\n begin match spec with\n | BInitial _ payload_length packet_number_length token token_length ->\n B.live m token\n | BRetry unused odcid odcil ->\n B.live m odcid\n | _ -> True\n end", "dependencies": { "source_file": "QUIC.Impl.Header.Base.fst", "checked_file": "QUIC.Impl.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Impl.Header.Base.header -> Prims.GTot LowStar.Monotonic.Buffer.loc", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Base.header", "QUIC.Spec.Base.secret_bitfield", "Prims.bool", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.op_LessThanOrEqual", "FStar.UInt.uint_t", "FStar.UInt32.v", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "LowStar.Monotonic.Buffer.loc_buffer", "QUIC.Impl.Header.Base.long_header_specifics", "LowStar.Monotonic.Buffer.loc_union", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Base.token_max_len", "Prims.op_Equality", "LowStar.Monotonic.Buffer.loc_none", "LowStar.Monotonic.Buffer.loc" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_footprint (h: header) : GTot B.loc\nlet header_footprint (h: header) : GTot B.loc =", "completed_definiton": "match h with\n| BShort _ spin phase cid cid_len packet_number_length -> B.loc_buffer cid\n| BLong version dcid dcil scid scil spec ->\n ((B.loc_buffer dcid) `B.loc_union` (B.loc_buffer scid))\n `B.loc_union`\n (match spec with\n | BInitial _ payload_length packet_number_length token token_length -> B.loc_buffer token\n | BRetry unused odcid odcil -> B.loc_buffer odcid\n | _ -> B.loc_none)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Base.fst", "name": "QUIC.Impl.Header.Base.payload_length", "original_source_type": "val payload_length (h: header{has_payload_length h}) : Tot U62.secret", "source_type": "val payload_length (h: header{has_payload_length h}) : Tot U62.secret", "source_definition": "let payload_length\n (h: header { has_payload_length h })\n: Tot U62.secret\n= Secret.to_u64 (payload_and_pn_length h) `Secret.sub` Secret.to_u64 (pn_length h)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 123, "start_col": 2, "end_line": 123, "end_col": 82 }, "file_context": "module QUIC.Impl.Header.Base\nopen QUIC.Spec.Header.Base\ninclude QUIC.Impl.Base\n\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule Spec = QUIC.Spec.Header.Base\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\n/// Information stored in a QUIC header. This is a Low* type passed by value --\n/// it's a little expensive. Consider passing it by reference in ``encrypt``?\n///\n/// Note that we try to follow the convention of buffer arguments followed by\n/// their lengths.\n\n(* NOTE: in the following header type, payload_and_pn_length contains the\nlength of the actual payload AND of the packet number. *)\n\n(* NOTE: the header no longer contains the packet number, which is\npart of the state, so that the client no longer needs to take care of\nit *)\n\nnoeq type long_header_specifics =\n | BInitial:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n token: B.buffer U8.t -> (* I reordered those so that the extracted code for this type is a tagged union with common prefixes *)\n token_length: U32.t { let v = U32.v token_length in v == B.length token /\\ 0 <= v /\\ v <= token_max_len } ->\n long_header_specifics\n | BZeroRTT:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n long_header_specifics\n | BHandshake:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n long_header_specifics\n | BRetry:\n unused: secret_bitfield 4 ->\n odcid: B.buffer U8.t ->\n odcil: U32.t { let v = U32.v odcil in v = B.length odcid /\\ 0 <= v /\\ v <= 20 } ->\n long_header_specifics\n\nnoeq type header =\n | BLong:\n version: U32.t ->\n dcid: B.buffer U8.t ->\n dcil: U32.t { let v = U32.v dcil in v == B.length dcid /\\ 0 <= v /\\ v <= 20 } ->\n scid: B.buffer U8.t ->\n scil: U32.t { let v = U32.v scil in v == B.length scid /\\ 0 <= v /\\ v <= 20 } ->\n spec: long_header_specifics ->\n header\n | BShort:\n reserved_bits: secret_bitfield 2 ->\n spin: bool ->\n phase: secret_bitfield 1 -> // no secret bools in HACL*\n cid: B.buffer U8.t ->\n cid_len: U32.t{\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n } ->\n packet_number_length: PN.packet_number_length_t ->\n header\n\nlet dcid_len\n (h: header)\n: Tot U32.t\n= match h with\n | BShort rb spin phase cid cid_len packet_number_length ->\n cid_len\n | BLong version dcid dcil scid scil spec -> dcil\n\n// inline_for_extraction\nlet is_retry\n (h: header)\n: Tot bool\n= BLong? h && BRetry? (BLong?.spec h)\n\n// inline_for_extraction\nlet pn_length\n (h: header {~ (is_retry h)})\n: Tot PN.packet_number_length_t\n= match h with\n | BShort _ spin phase cid cid_len packet_number_length ->\n packet_number_length\n | BLong version dcid dcil scid scil spec ->\n begin match spec with\n | BInitial _ payload_and_pn_length packet_number_length token token_length ->\n packet_number_length\n | BZeroRTT _ payload_length packet_number_length ->\n packet_number_length\n | BHandshake _ payload_length packet_number_length ->\n packet_number_length\n end\n\n// inline_for_extraction\nlet has_payload_length\n (h: header)\n: Tot bool\n= BLong? h && not (BRetry? (BLong?.spec h))\n\n// inline_for_extraction\nlet payload_and_pn_length\n (h: header { has_payload_length h })\n: Tot payload_and_pn_length_t\n= match BLong?.spec h with\n | BInitial _ pl _ _ _ -> pl\n | BZeroRTT _ pl _ -> pl\n | BHandshake _ pl _ -> pl\n\n// inline_for_extraction\nlet payload_length\n (h: header { has_payload_length h })", "dependencies": { "source_file": "QUIC.Impl.Header.Base.fst", "checked_file": "QUIC.Impl.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Impl.Header.Base.header{QUIC.Impl.Header.Base.has_payload_length h} -> QUIC.UInt62.secret", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Base.header", "Prims.b2t", "QUIC.Impl.Header.Base.has_payload_length", "Lib.IntTypes.sub", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "Lib.IntTypes.to_u64", "Lib.IntTypes.PUB", "QUIC.Impl.Header.Base.payload_and_pn_length", "Lib.IntTypes.U32", "QUIC.Impl.Header.Base.pn_length", "QUIC.UInt62.secret" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val payload_length (h: header{has_payload_length h}) : Tot U62.secret\nlet payload_length (h: header{has_payload_length h}) : Tot U62.secret =", "completed_definiton": "(Secret.to_u64 (payload_and_pn_length h)) `Secret.sub` (Secret.to_u64 (pn_length h))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Base.fst", "name": "QUIC.Impl.Header.Base.g_header", "original_source_type": "val g_header (h: header) (m: HS.mem) (packet_number: PN.packet_number_t) : GTot Spec.header", "source_type": "val g_header (h: header) (m: HS.mem) (packet_number: PN.packet_number_t) : GTot Spec.header", "source_definition": "let g_header (h: header) (m: HS.mem) (packet_number: PN.packet_number_t) : GTot Spec.header =\n match h with\n | BShort rb spin phase cid cid_len packet_number_length ->\n MShort (Secret.reveal rb) spin (Secret.v phase = 1) (FB.hide (B.as_seq m cid)) packet_number_length packet_number\n | BLong version dcid dcil scid scil spec ->\n MLong version (FB.hide (B.as_seq m dcid)) (FB.hide (B.as_seq m scid))\n begin match spec with\n | BInitial rb payload_length packet_number_length token token_length ->\n MInitial (Secret.reveal rb) (FB.hide (B.as_seq m token)) payload_length packet_number_length packet_number\n | BZeroRTT rb payload_length packet_number_length ->\n MZeroRTT (Secret.reveal rb) payload_length packet_number_length packet_number\n | BHandshake rb payload_length packet_number_length ->\n MHandshake (Secret.reveal rb) payload_length packet_number_length packet_number\n | BRetry unused odcid odcil ->\n MRetry (Secret.reveal unused) (FB.hide (B.as_seq m odcid))\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 163, "start_col": 2, "end_line": 177, "end_col": 9 }, "file_context": "module QUIC.Impl.Header.Base\nopen QUIC.Spec.Header.Base\ninclude QUIC.Impl.Base\n\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule Spec = QUIC.Spec.Header.Base\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\n/// Information stored in a QUIC header. This is a Low* type passed by value --\n/// it's a little expensive. Consider passing it by reference in ``encrypt``?\n///\n/// Note that we try to follow the convention of buffer arguments followed by\n/// their lengths.\n\n(* NOTE: in the following header type, payload_and_pn_length contains the\nlength of the actual payload AND of the packet number. *)\n\n(* NOTE: the header no longer contains the packet number, which is\npart of the state, so that the client no longer needs to take care of\nit *)\n\nnoeq type long_header_specifics =\n | BInitial:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n token: B.buffer U8.t -> (* I reordered those so that the extracted code for this type is a tagged union with common prefixes *)\n token_length: U32.t { let v = U32.v token_length in v == B.length token /\\ 0 <= v /\\ v <= token_max_len } ->\n long_header_specifics\n | BZeroRTT:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n long_header_specifics\n | BHandshake:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n long_header_specifics\n | BRetry:\n unused: secret_bitfield 4 ->\n odcid: B.buffer U8.t ->\n odcil: U32.t { let v = U32.v odcil in v = B.length odcid /\\ 0 <= v /\\ v <= 20 } ->\n long_header_specifics\n\nnoeq type header =\n | BLong:\n version: U32.t ->\n dcid: B.buffer U8.t ->\n dcil: U32.t { let v = U32.v dcil in v == B.length dcid /\\ 0 <= v /\\ v <= 20 } ->\n scid: B.buffer U8.t ->\n scil: U32.t { let v = U32.v scil in v == B.length scid /\\ 0 <= v /\\ v <= 20 } ->\n spec: long_header_specifics ->\n header\n | BShort:\n reserved_bits: secret_bitfield 2 ->\n spin: bool ->\n phase: secret_bitfield 1 -> // no secret bools in HACL*\n cid: B.buffer U8.t ->\n cid_len: U32.t{\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n } ->\n packet_number_length: PN.packet_number_length_t ->\n header\n\nlet dcid_len\n (h: header)\n: Tot U32.t\n= match h with\n | BShort rb spin phase cid cid_len packet_number_length ->\n cid_len\n | BLong version dcid dcil scid scil spec -> dcil\n\n// inline_for_extraction\nlet is_retry\n (h: header)\n: Tot bool\n= BLong? h && BRetry? (BLong?.spec h)\n\n// inline_for_extraction\nlet pn_length\n (h: header {~ (is_retry h)})\n: Tot PN.packet_number_length_t\n= match h with\n | BShort _ spin phase cid cid_len packet_number_length ->\n packet_number_length\n | BLong version dcid dcil scid scil spec ->\n begin match spec with\n | BInitial _ payload_and_pn_length packet_number_length token token_length ->\n packet_number_length\n | BZeroRTT _ payload_length packet_number_length ->\n packet_number_length\n | BHandshake _ payload_length packet_number_length ->\n packet_number_length\n end\n\n// inline_for_extraction\nlet has_payload_length\n (h: header)\n: Tot bool\n= BLong? h && not (BRetry? (BLong?.spec h))\n\n// inline_for_extraction\nlet payload_and_pn_length\n (h: header { has_payload_length h })\n: Tot payload_and_pn_length_t\n= match BLong?.spec h with\n | BInitial _ pl _ _ _ -> pl\n | BZeroRTT _ pl _ -> pl\n | BHandshake _ pl _ -> pl\n\n// inline_for_extraction\nlet payload_length\n (h: header { has_payload_length h })\n: Tot U62.secret\n= Secret.to_u64 (payload_and_pn_length h) `Secret.sub` Secret.to_u64 (pn_length h)\n\nmodule HS = FStar.HyperStack\n\nlet header_live (h: header) (m: HS.mem) : GTot Type0 =\n match h with\n | BShort _ spin phase cid cid_len packet_number_length ->\n B.live m cid\n | BLong version dcid dcil scid scil spec ->\n B.live m dcid /\\ B.live m scid /\\\n begin match spec with\n | BInitial _ payload_length packet_number_length token token_length ->\n B.live m token\n | BRetry unused odcid odcil ->\n B.live m odcid\n | _ -> True\n end\n\nlet header_footprint (h: header) : GTot B.loc =\n match h with\n | BShort _ spin phase cid cid_len packet_number_length ->\n B.loc_buffer cid\n | BLong version dcid dcil scid scil spec ->\n (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) `B.loc_union`\n begin match spec with\n | BInitial _ payload_length packet_number_length token token_length ->\n B.loc_buffer token\n | BRetry unused odcid odcil ->\n B.loc_buffer odcid\n | _ -> B.loc_none\n end\n\nlet header_live_loc_not_unused_in_footprint (h: header) (m: HS.mem) : Lemma\n (requires (header_live h m))\n (ensures (B.loc_not_unused_in m `B.loc_includes` header_footprint h))\n= ()\n\nmodule FB = FStar.Bytes", "dependencies": { "source_file": "QUIC.Impl.Header.Base.fst", "checked_file": "QUIC.Impl.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n h: QUIC.Impl.Header.Base.header ->\n m: FStar.Monotonic.HyperStack.mem ->\n packet_number: QUIC.Spec.PacketNumber.Base.packet_number_t\n -> Prims.GTot QUIC.Spec.Header.Base.header", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Base.header", "FStar.Monotonic.HyperStack.mem", "QUIC.Spec.PacketNumber.Base.packet_number_t", "QUIC.Spec.Base.secret_bitfield", "Prims.bool", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.op_LessThanOrEqual", "FStar.UInt.uint_t", "FStar.UInt32.v", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.Header.Base.MShort", "QUIC.Secret.Int.reveal", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "Prims.op_Equality", "QUIC.Secret.Int.Base.v", "FStar.Bytes.hide", "LowStar.Monotonic.Buffer.as_seq", "QUIC.Impl.Header.Base.long_header_specifics", "QUIC.Spec.Header.Base.MLong", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Base.token_max_len", "QUIC.Spec.Header.Base.MInitial", "QUIC.Spec.Header.Base.MZeroRTT", "QUIC.Spec.Header.Base.MHandshake", "QUIC.Spec.Header.Base.MRetry", "QUIC.Spec.Header.Base.long_header_specifics", "QUIC.Spec.Header.Base.header" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val g_header (h: header) (m: HS.mem) (packet_number: PN.packet_number_t) : GTot Spec.header\nlet g_header (h: header) (m: HS.mem) (packet_number: PN.packet_number_t) : GTot Spec.header =", "completed_definiton": "match h with\n| BShort rb spin phase cid cid_len packet_number_length ->\n MShort (Secret.reveal rb)\n spin\n (Secret.v phase = 1)\n (FB.hide (B.as_seq m cid))\n packet_number_length\n packet_number\n| BLong version dcid dcil scid scil spec ->\n MLong version\n (FB.hide (B.as_seq m dcid))\n (FB.hide (B.as_seq m scid))\n (match spec with\n | BInitial rb payload_length packet_number_length token token_length ->\n MInitial (Secret.reveal rb)\n (FB.hide (B.as_seq m token))\n payload_length\n packet_number_length\n packet_number\n | BZeroRTT rb payload_length packet_number_length ->\n MZeroRTT (Secret.reveal rb) payload_length packet_number_length packet_number\n | BHandshake rb payload_length packet_number_length ->\n MHandshake (Secret.reveal rb) payload_length packet_number_length packet_number\n | BRetry unused odcid odcil -> MRetry (Secret.reveal unused) (FB.hide (B.as_seq m odcid)))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Base.fst", "name": "QUIC.Impl.Header.Base.public_header_len", "original_source_type": "val public_header_len (h: header)\n : Pure U32.t (requires True) (ensures (fun y -> U32.v y <= header_len_bound))", "source_type": "val public_header_len (h: header)\n : Pure U32.t (requires True) (ensures (fun y -> U32.v y <= header_len_bound))", "source_definition": "let public_header_len\n (h: header)\n: Pure U32.t\n (requires True)\n (ensures (fun y -> U32.v y <= header_len_bound))\n= match h with\n | BShort _ spin phase cid cid_len packet_number_length ->\n 1ul `U32.add` cid_len\n | BLong version dcid dcil scid scil spec ->\n 7ul `U32.add` dcil `U32.add` scil `U32.add`\n begin match spec with\n | BInitial _ payload_and_pn_length packet_number_length token token_length ->\n varint_len (Cast.uint32_to_uint64 token_length) `U32.add` token_length `U32.add` varint_len (payload_and_pn_length)\n | BZeroRTT _ payload_and_pn_length packet_number_length ->\n varint_len (payload_and_pn_length)\n | BHandshake _ payload_and_pn_length packet_number_length ->\n varint_len (payload_and_pn_length)\n | BRetry unused odcid odcil ->\n 1ul `U32.add` odcil\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 221, "start_col": 2, "end_line": 235, "end_col": 7 }, "file_context": "module QUIC.Impl.Header.Base\nopen QUIC.Spec.Header.Base\ninclude QUIC.Impl.Base\n\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule Spec = QUIC.Spec.Header.Base\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\n/// Information stored in a QUIC header. This is a Low* type passed by value --\n/// it's a little expensive. Consider passing it by reference in ``encrypt``?\n///\n/// Note that we try to follow the convention of buffer arguments followed by\n/// their lengths.\n\n(* NOTE: in the following header type, payload_and_pn_length contains the\nlength of the actual payload AND of the packet number. *)\n\n(* NOTE: the header no longer contains the packet number, which is\npart of the state, so that the client no longer needs to take care of\nit *)\n\nnoeq type long_header_specifics =\n | BInitial:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n token: B.buffer U8.t -> (* I reordered those so that the extracted code for this type is a tagged union with common prefixes *)\n token_length: U32.t { let v = U32.v token_length in v == B.length token /\\ 0 <= v /\\ v <= token_max_len } ->\n long_header_specifics\n | BZeroRTT:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n long_header_specifics\n | BHandshake:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n long_header_specifics\n | BRetry:\n unused: secret_bitfield 4 ->\n odcid: B.buffer U8.t ->\n odcil: U32.t { let v = U32.v odcil in v = B.length odcid /\\ 0 <= v /\\ v <= 20 } ->\n long_header_specifics\n\nnoeq type header =\n | BLong:\n version: U32.t ->\n dcid: B.buffer U8.t ->\n dcil: U32.t { let v = U32.v dcil in v == B.length dcid /\\ 0 <= v /\\ v <= 20 } ->\n scid: B.buffer U8.t ->\n scil: U32.t { let v = U32.v scil in v == B.length scid /\\ 0 <= v /\\ v <= 20 } ->\n spec: long_header_specifics ->\n header\n | BShort:\n reserved_bits: secret_bitfield 2 ->\n spin: bool ->\n phase: secret_bitfield 1 -> // no secret bools in HACL*\n cid: B.buffer U8.t ->\n cid_len: U32.t{\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n } ->\n packet_number_length: PN.packet_number_length_t ->\n header\n\nlet dcid_len\n (h: header)\n: Tot U32.t\n= match h with\n | BShort rb spin phase cid cid_len packet_number_length ->\n cid_len\n | BLong version dcid dcil scid scil spec -> dcil\n\n// inline_for_extraction\nlet is_retry\n (h: header)\n: Tot bool\n= BLong? h && BRetry? (BLong?.spec h)\n\n// inline_for_extraction\nlet pn_length\n (h: header {~ (is_retry h)})\n: Tot PN.packet_number_length_t\n= match h with\n | BShort _ spin phase cid cid_len packet_number_length ->\n packet_number_length\n | BLong version dcid dcil scid scil spec ->\n begin match spec with\n | BInitial _ payload_and_pn_length packet_number_length token token_length ->\n packet_number_length\n | BZeroRTT _ payload_length packet_number_length ->\n packet_number_length\n | BHandshake _ payload_length packet_number_length ->\n packet_number_length\n end\n\n// inline_for_extraction\nlet has_payload_length\n (h: header)\n: Tot bool\n= BLong? h && not (BRetry? (BLong?.spec h))\n\n// inline_for_extraction\nlet payload_and_pn_length\n (h: header { has_payload_length h })\n: Tot payload_and_pn_length_t\n= match BLong?.spec h with\n | BInitial _ pl _ _ _ -> pl\n | BZeroRTT _ pl _ -> pl\n | BHandshake _ pl _ -> pl\n\n// inline_for_extraction\nlet payload_length\n (h: header { has_payload_length h })\n: Tot U62.secret\n= Secret.to_u64 (payload_and_pn_length h) `Secret.sub` Secret.to_u64 (pn_length h)\n\nmodule HS = FStar.HyperStack\n\nlet header_live (h: header) (m: HS.mem) : GTot Type0 =\n match h with\n | BShort _ spin phase cid cid_len packet_number_length ->\n B.live m cid\n | BLong version dcid dcil scid scil spec ->\n B.live m dcid /\\ B.live m scid /\\\n begin match spec with\n | BInitial _ payload_length packet_number_length token token_length ->\n B.live m token\n | BRetry unused odcid odcil ->\n B.live m odcid\n | _ -> True\n end\n\nlet header_footprint (h: header) : GTot B.loc =\n match h with\n | BShort _ spin phase cid cid_len packet_number_length ->\n B.loc_buffer cid\n | BLong version dcid dcil scid scil spec ->\n (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) `B.loc_union`\n begin match spec with\n | BInitial _ payload_length packet_number_length token token_length ->\n B.loc_buffer token\n | BRetry unused odcid odcil ->\n B.loc_buffer odcid\n | _ -> B.loc_none\n end\n\nlet header_live_loc_not_unused_in_footprint (h: header) (m: HS.mem) : Lemma\n (requires (header_live h m))\n (ensures (B.loc_not_unused_in m `B.loc_includes` header_footprint h))\n= ()\n\nmodule FB = FStar.Bytes\n\nlet g_header (h: header) (m: HS.mem) (packet_number: PN.packet_number_t) : GTot Spec.header =\n match h with\n | BShort rb spin phase cid cid_len packet_number_length ->\n MShort (Secret.reveal rb) spin (Secret.v phase = 1) (FB.hide (B.as_seq m cid)) packet_number_length packet_number\n | BLong version dcid dcil scid scil spec ->\n MLong version (FB.hide (B.as_seq m dcid)) (FB.hide (B.as_seq m scid))\n begin match spec with\n | BInitial rb payload_length packet_number_length token token_length ->\n MInitial (Secret.reveal rb) (FB.hide (B.as_seq m token)) payload_length packet_number_length packet_number\n | BZeroRTT rb payload_length packet_number_length ->\n MZeroRTT (Secret.reveal rb) payload_length packet_number_length packet_number\n | BHandshake rb payload_length packet_number_length ->\n MHandshake (Secret.reveal rb) payload_length packet_number_length packet_number\n | BRetry unused odcid odcil ->\n MRetry (Secret.reveal unused) (FB.hide (B.as_seq m odcid))\n end\n\nlet frame_header_live\n (h: header)\n (l: B.loc)\n (m1 m2: HS.mem)\n: Lemma\n (requires (\n header_live h m1 /\\\n B.modifies l m1 m2 /\\\n B.loc_disjoint l (header_footprint h)\n ))\n (ensures (header_live h m2))\n= ()\n\nlet frame_header\n (h: header)\n (packet_number: PN.packet_number_t)\n (l: B.loc)\n (m1 m2: HS.mem)\n: Lemma\n (requires (\n header_live h m1 /\\\n B.modifies l m1 m2 /\\\n B.loc_disjoint l (header_footprint h)\n ))\n (ensures (header_live h m2 /\\ g_header h m2 packet_number == g_header h m1 packet_number))\n= ()\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\n(* Length of the header without the packet number. It is enough to\ncheck that an output buffer needs at least (public_header_len h + 4)\nbytes to serialize a header. *)\n\nmodule Cast = FStar.Int.Cast\n\nlet public_header_len\n (h: header)\n: Pure U32.t\n (requires True)", "dependencies": { "source_file": "QUIC.Impl.Header.Base.fst", "checked_file": "QUIC.Impl.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Impl.Header.Base.header -> Prims.Pure FStar.UInt32.t", "effect": "Prims.Pure", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Base.header", "QUIC.Spec.Base.secret_bitfield", "Prims.bool", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.op_LessThanOrEqual", "FStar.UInt.uint_t", "FStar.UInt32.v", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "FStar.UInt32.add", "FStar.UInt32.__uint_to_t", "QUIC.Impl.Header.Base.long_header_specifics", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Base.token_max_len", "QUIC.Impl.Base.varint_len", "FStar.Int.Cast.uint32_to_uint64", "Prims.op_Equality", "Prims.l_True", "QUIC.Spec.Base.header_len_bound" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val public_header_len (h: header)\n : Pure U32.t (requires True) (ensures (fun y -> U32.v y <= header_len_bound))\nlet public_header_len (h: header)\n : Pure U32.t (requires True) (ensures (fun y -> U32.v y <= header_len_bound)) =", "completed_definiton": "match h with\n| BShort _ spin phase cid cid_len packet_number_length -> 1ul `U32.add` cid_len\n| BLong version dcid dcil scid scil spec ->\n ((7ul `U32.add` dcil) `U32.add` scil)\n `U32.add`\n (match spec with\n | BInitial _ payload_and_pn_length packet_number_length token token_length ->\n ((varint_len (Cast.uint32_to_uint64 token_length)) `U32.add` token_length)\n `U32.add`\n (varint_len (payload_and_pn_length))\n | BZeroRTT _ payload_and_pn_length packet_number_length -> varint_len (payload_and_pn_length)\n | BHandshake _ payload_and_pn_length packet_number_length -> varint_len (payload_and_pn_length)\n | BRetry unused odcid odcil -> 1ul `U32.add` odcil)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.Base.fst", "name": "QUIC.Impl.Header.Base.header_len", "original_source_type": "val header_len (h: header)\n : Tot\n (x:\n Secret.uint32\n { Secret.v x ==\n U32.v (public_header_len h) + (if is_retry h then 0 else Secret.v (pn_length h)) })", "source_type": "val header_len (h: header)\n : Tot\n (x:\n Secret.uint32\n { Secret.v x ==\n U32.v (public_header_len h) + (if is_retry h then 0 else Secret.v (pn_length h)) })", "source_definition": "let header_len\n (h: header)\n: Tot (x: Secret.uint32 { Secret.v x == U32.v (public_header_len h) + (if is_retry h then 0 else Secret.v (pn_length h)) })\n= Secret.to_u32 (public_header_len h) `Secret.add` (if is_retry h then Secret.to_u32 0ul else pn_length h)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 244, "start_col": 2, "end_line": 244, "end_col": 106 }, "file_context": "module QUIC.Impl.Header.Base\nopen QUIC.Spec.Header.Base\ninclude QUIC.Impl.Base\n\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule Spec = QUIC.Spec.Header.Base\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule U62 = QUIC.UInt62\nmodule Secret = QUIC.Secret.Int\n\n/// Information stored in a QUIC header. This is a Low* type passed by value --\n/// it's a little expensive. Consider passing it by reference in ``encrypt``?\n///\n/// Note that we try to follow the convention of buffer arguments followed by\n/// their lengths.\n\n(* NOTE: in the following header type, payload_and_pn_length contains the\nlength of the actual payload AND of the packet number. *)\n\n(* NOTE: the header no longer contains the packet number, which is\npart of the state, so that the client no longer needs to take care of\nit *)\n\nnoeq type long_header_specifics =\n | BInitial:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n token: B.buffer U8.t -> (* I reordered those so that the extracted code for this type is a tagged union with common prefixes *)\n token_length: U32.t { let v = U32.v token_length in v == B.length token /\\ 0 <= v /\\ v <= token_max_len } ->\n long_header_specifics\n | BZeroRTT:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n long_header_specifics\n | BHandshake:\n reserved_bits: secret_bitfield 2 ->\n payload_and_pn_length: payload_and_pn_length_t ->\n packet_number_length: PN.packet_number_length_t ->\n long_header_specifics\n | BRetry:\n unused: secret_bitfield 4 ->\n odcid: B.buffer U8.t ->\n odcil: U32.t { let v = U32.v odcil in v = B.length odcid /\\ 0 <= v /\\ v <= 20 } ->\n long_header_specifics\n\nnoeq type header =\n | BLong:\n version: U32.t ->\n dcid: B.buffer U8.t ->\n dcil: U32.t { let v = U32.v dcil in v == B.length dcid /\\ 0 <= v /\\ v <= 20 } ->\n scid: B.buffer U8.t ->\n scil: U32.t { let v = U32.v scil in v == B.length scid /\\ 0 <= v /\\ v <= 20 } ->\n spec: long_header_specifics ->\n header\n | BShort:\n reserved_bits: secret_bitfield 2 ->\n spin: bool ->\n phase: secret_bitfield 1 -> // no secret bools in HACL*\n cid: B.buffer U8.t ->\n cid_len: U32.t{\n let l = U32.v cid_len in\n l == B.length cid /\\\n 0 <= l /\\ l <= 20\n } ->\n packet_number_length: PN.packet_number_length_t ->\n header\n\nlet dcid_len\n (h: header)\n: Tot U32.t\n= match h with\n | BShort rb spin phase cid cid_len packet_number_length ->\n cid_len\n | BLong version dcid dcil scid scil spec -> dcil\n\n// inline_for_extraction\nlet is_retry\n (h: header)\n: Tot bool\n= BLong? h && BRetry? (BLong?.spec h)\n\n// inline_for_extraction\nlet pn_length\n (h: header {~ (is_retry h)})\n: Tot PN.packet_number_length_t\n= match h with\n | BShort _ spin phase cid cid_len packet_number_length ->\n packet_number_length\n | BLong version dcid dcil scid scil spec ->\n begin match spec with\n | BInitial _ payload_and_pn_length packet_number_length token token_length ->\n packet_number_length\n | BZeroRTT _ payload_length packet_number_length ->\n packet_number_length\n | BHandshake _ payload_length packet_number_length ->\n packet_number_length\n end\n\n// inline_for_extraction\nlet has_payload_length\n (h: header)\n: Tot bool\n= BLong? h && not (BRetry? (BLong?.spec h))\n\n// inline_for_extraction\nlet payload_and_pn_length\n (h: header { has_payload_length h })\n: Tot payload_and_pn_length_t\n= match BLong?.spec h with\n | BInitial _ pl _ _ _ -> pl\n | BZeroRTT _ pl _ -> pl\n | BHandshake _ pl _ -> pl\n\n// inline_for_extraction\nlet payload_length\n (h: header { has_payload_length h })\n: Tot U62.secret\n= Secret.to_u64 (payload_and_pn_length h) `Secret.sub` Secret.to_u64 (pn_length h)\n\nmodule HS = FStar.HyperStack\n\nlet header_live (h: header) (m: HS.mem) : GTot Type0 =\n match h with\n | BShort _ spin phase cid cid_len packet_number_length ->\n B.live m cid\n | BLong version dcid dcil scid scil spec ->\n B.live m dcid /\\ B.live m scid /\\\n begin match spec with\n | BInitial _ payload_length packet_number_length token token_length ->\n B.live m token\n | BRetry unused odcid odcil ->\n B.live m odcid\n | _ -> True\n end\n\nlet header_footprint (h: header) : GTot B.loc =\n match h with\n | BShort _ spin phase cid cid_len packet_number_length ->\n B.loc_buffer cid\n | BLong version dcid dcil scid scil spec ->\n (B.loc_buffer dcid `B.loc_union` B.loc_buffer scid) `B.loc_union`\n begin match spec with\n | BInitial _ payload_length packet_number_length token token_length ->\n B.loc_buffer token\n | BRetry unused odcid odcil ->\n B.loc_buffer odcid\n | _ -> B.loc_none\n end\n\nlet header_live_loc_not_unused_in_footprint (h: header) (m: HS.mem) : Lemma\n (requires (header_live h m))\n (ensures (B.loc_not_unused_in m `B.loc_includes` header_footprint h))\n= ()\n\nmodule FB = FStar.Bytes\n\nlet g_header (h: header) (m: HS.mem) (packet_number: PN.packet_number_t) : GTot Spec.header =\n match h with\n | BShort rb spin phase cid cid_len packet_number_length ->\n MShort (Secret.reveal rb) spin (Secret.v phase = 1) (FB.hide (B.as_seq m cid)) packet_number_length packet_number\n | BLong version dcid dcil scid scil spec ->\n MLong version (FB.hide (B.as_seq m dcid)) (FB.hide (B.as_seq m scid))\n begin match spec with\n | BInitial rb payload_length packet_number_length token token_length ->\n MInitial (Secret.reveal rb) (FB.hide (B.as_seq m token)) payload_length packet_number_length packet_number\n | BZeroRTT rb payload_length packet_number_length ->\n MZeroRTT (Secret.reveal rb) payload_length packet_number_length packet_number\n | BHandshake rb payload_length packet_number_length ->\n MHandshake (Secret.reveal rb) payload_length packet_number_length packet_number\n | BRetry unused odcid odcil ->\n MRetry (Secret.reveal unused) (FB.hide (B.as_seq m odcid))\n end\n\nlet frame_header_live\n (h: header)\n (l: B.loc)\n (m1 m2: HS.mem)\n: Lemma\n (requires (\n header_live h m1 /\\\n B.modifies l m1 m2 /\\\n B.loc_disjoint l (header_footprint h)\n ))\n (ensures (header_live h m2))\n= ()\n\nlet frame_header\n (h: header)\n (packet_number: PN.packet_number_t)\n (l: B.loc)\n (m1 m2: HS.mem)\n: Lemma\n (requires (\n header_live h m1 /\\\n B.modifies l m1 m2 /\\\n B.loc_disjoint l (header_footprint h)\n ))\n (ensures (header_live h m2 /\\ g_header h m2 packet_number == g_header h m1 packet_number))\n= ()\n\n(* Length computations need to be transparent because the precondition\nto QUIC.Impl.encrypt requires the user to provide a destination buffer\nlarge enough to contain the byte representation of the header *)\n\n(* Length of the header without the packet number. It is enough to\ncheck that an output buffer needs at least (public_header_len h + 4)\nbytes to serialize a header. *)\n\nmodule Cast = FStar.Int.Cast\n\nlet public_header_len\n (h: header)\n: Pure U32.t\n (requires True)\n (ensures (fun y -> U32.v y <= header_len_bound))\n= match h with\n | BShort _ spin phase cid cid_len packet_number_length ->\n 1ul `U32.add` cid_len\n | BLong version dcid dcil scid scil spec ->\n 7ul `U32.add` dcil `U32.add` scil `U32.add`\n begin match spec with\n | BInitial _ payload_and_pn_length packet_number_length token token_length ->\n varint_len (Cast.uint32_to_uint64 token_length) `U32.add` token_length `U32.add` varint_len (payload_and_pn_length)\n | BZeroRTT _ payload_and_pn_length packet_number_length ->\n varint_len (payload_and_pn_length)\n | BHandshake _ payload_and_pn_length packet_number_length ->\n varint_len (payload_and_pn_length)\n | BRetry unused odcid odcil ->\n 1ul `U32.add` odcil\n end\n\n(* The actual header length, which is secret because of pn_length *)\n\n#push-options \"--z3rlimit 16\"\n\nlet header_len\n (h: header)", "dependencies": { "source_file": "QUIC.Impl.Header.Base.fst", "checked_file": "QUIC.Impl.Header.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.fst.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Impl.Header.Base.header\n -> x:\n Lib.IntTypes.uint32\n { QUIC.Secret.Int.Base.v x ==\n FStar.UInt32.v (QUIC.Impl.Header.Base.public_header_len h) +\n (match QUIC.Impl.Header.Base.is_retry h with\n | true -> 0\n | _ -> QUIC.Secret.Int.Base.v (QUIC.Impl.Header.Base.pn_length h)) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Base.header", "Lib.IntTypes.add", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "Lib.IntTypes.to_u32", "Lib.IntTypes.PUB", "QUIC.Impl.Header.Base.public_header_len", "QUIC.Impl.Header.Base.is_retry", "FStar.UInt32.__uint_to_t", "Prims.bool", "QUIC.Impl.Header.Base.pn_length", "Lib.IntTypes.int_t", "Lib.IntTypes.range", "Prims.op_Addition", "Lib.IntTypes.v", "Lib.IntTypes.uint32", "Prims.eq2", "Prims.int", "QUIC.Secret.Int.Base.v", "FStar.UInt32.v" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_len (h: header)\n : Tot\n (x:\n Secret.uint32\n { Secret.v x ==\n U32.v (public_header_len h) + (if is_retry h then 0 else Secret.v (pn_length h)) })\nlet header_len (h: header)\n : Tot\n (x:\n Secret.uint32\n { Secret.v x ==\n U32.v (public_header_len h) + (if is_retry h then 0 else Secret.v (pn_length h)) }) =", "completed_definiton": "(Secret.to_u32 (public_header_len h))\n`Secret.add`\n(if is_retry h then Secret.to_u32 0ul else pn_length h)", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fsti", "name": "Model.AEAD.alg", "original_source_type": "", "source_type": "val alg : Type0", "source_definition": "let alg = I.ea", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 21, "start_col": 10, "end_line": 21, "end_col": 14 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\n\n/// Abbreviations for idealization\n/// ------------------------------\n\n// In this module, id is an AEAD id.\nlet id = I.ae_id", "dependencies": { "source_file": "Model.AEAD.fsti", "checked_file": "Model.AEAD.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.Indexing.ea" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let alg =", "completed_definiton": "I.ea", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fsti", "name": "Model.AEAD.unsafe_id", "original_source_type": "", "source_type": "val unsafe_id : Type0", "source_definition": "let unsafe_id =\n i:id{~ (is_safe i)}", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 30, "start_col": 2, "end_line": 30, "end_col": 21 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\n\n/// Abbreviations for idealization\n/// ------------------------------\n\n// In this module, id is an AEAD id.\nlet id = I.ae_id\n\n// ea = encryption alg\nlet alg = I.ea\n\nlet is_safe i =\n I.ideal_AEAD && I.is_ae_honest i\n\nlet safe_id =\n i:id{is_safe i}", "dependencies": { "source_file": "Model.AEAD.fsti", "checked_file": "Model.AEAD.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.id", "Prims.l_not", "Prims.b2t", "Model.AEAD.is_safe" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let unsafe_id =", "completed_definiton": "i: id{~(is_safe i)}", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fsti", "name": "Model.AEAD.is_safe", "original_source_type": "", "source_type": "val is_safe : i: Model.Indexing.ae_id -> Prims.bool", "source_definition": "let is_safe i =\n I.ideal_AEAD && I.is_ae_honest i", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 24, "start_col": 2, "end_line": 24, "end_col": 34 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\n\n/// Abbreviations for idealization\n/// ------------------------------\n\n// In this module, id is an AEAD id.\nlet id = I.ae_id\n\n// ea = encryption alg\nlet alg = I.ea", "dependencies": { "source_file": "Model.AEAD.fsti", "checked_file": "Model.AEAD.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: Model.Indexing.ae_id -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.Indexing.ae_id", "Prims.op_AmpAmp", "Model.Flags.ideal_AEAD", "Model.Indexing.is_ae_honest", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let is_safe i =", "completed_definiton": "I.ideal_AEAD && I.is_ae_honest i", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fsti", "name": "Model.AEAD.id", "original_source_type": "", "source_type": "val id : Prims.eqtype", "source_definition": "let id = I.ae_id", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 18, "start_col": 9, "end_line": 18, "end_col": 16 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\n\n/// Abbreviations for idealization\n/// ------------------------------", "dependencies": { "source_file": "Model.AEAD.fsti", "checked_file": "Model.AEAD.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.eqtype", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.Indexing.ae_id" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let id =", "completed_definiton": "I.ae_id", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fsti", "name": "Model.AEAD.at_least", "original_source_type": "", "source_type": "val at_least : u52: Model.AEAD.info i -> Type0", "source_definition": "let at_least (#i:id) (u:info i) =\n plain_length_at_least u.min_len", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 80, "start_col": 2, "end_line": 80, "end_col": 33 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\n\n/// Abbreviations for idealization\n/// ------------------------------\n\n// In this module, id is an AEAD id.\nlet id = I.ae_id\n\n// ea = encryption alg\nlet alg = I.ea\n\nlet is_safe i =\n I.ideal_AEAD && I.is_ae_honest i\n\nlet safe_id =\n i:id{is_safe i}\n\nlet unsafe_id =\n i:id{~ (is_safe i)}\n\n/// Some redefinitions, using Spec\n/// ------------------------------\n\n// Trying to follow the conventions: _len for machine lengths,\n// _length for spec (nat) lengths.\nlet tag_len: x:U32.t { forall (a: alg). {:pattern Spec.tag_length a} U32.v x == Spec.tag_length a } =\n 16ul\n\n// This duplicates a fair amount of definitions from Spec.Agile.AEAD, but here\n// the bounds are tighter and force plain texts to not overflow 32 bits once\n// encrypted and tagged.\n//\n// Introducing a minimum length allows making sure that there are enough bytes\n// to sample out of the ciphertext, as the tag can be too small for that purpose\n// for some AEAD ciphersuites.\ntype plain_length = l:nat{l + U32.v tag_len < pow2 32}\ntype plain_length_at_least (lmin: plain_length) = l:plain_length{lmin <= l}\n\n/// Packages, info (?)\n/// ------------------\n\nnoeq\ntype plain_pkg (min_len:plain_length) (idt: eqtype) (safe: idt -> bool) =\n | PlainPkg:\n plain: (i:idt -> plain_length_at_least min_len -> eqtype) ->\n as_bytes: (i:idt -> l:plain_length_at_least min_len -> plain i l -> GTot (Spec.lbytes l)) ->\n repr: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:plain i l -> Tot (b:Spec.lbytes l{b == as_bytes i l p})) ->\n mk: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:Spec.lbytes l -> p':plain i l { as_bytes i l p' == p }) ->\n plain_pkg min_len idt safe\n\nnoeq type info' = {\n alg: alg;\n halg: I.ha;\n min_len: plain_length;\n plain_pkg: plain_pkg min_len id is_safe;\n}\n\nlet info (i:id) =\n info:info'{\n I.ae_id_ginfo i == info.alg /\\\n I.ae_id_ghash i == info.halg\n }\n\n/// Accessors for info\n/// ------------------\n\n// Accessor for the info type.", "dependencies": { "source_file": "Model.AEAD.fsti", "checked_file": "Model.AEAD.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "u52: Model.AEAD.info i -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.id", "Model.AEAD.info", "Model.AEAD.plain_length_at_least", "Model.AEAD.__proj__Mkinfo'__item__min_len" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let at_least (#i: id) (u: info i) =", "completed_definiton": "plain_length_at_least u.min_len", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fsti", "name": "Model.AEAD.info", "original_source_type": "", "source_type": "val info : i: Model.AEAD.id -> Type", "source_definition": "let info (i:id) =\n info:info'{\n I.ae_id_ginfo i == info.alg /\\\n I.ae_id_ghash i == info.halg\n }", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 70, "start_col": 2, "end_line": 73, "end_col": 3 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\n\n/// Abbreviations for idealization\n/// ------------------------------\n\n// In this module, id is an AEAD id.\nlet id = I.ae_id\n\n// ea = encryption alg\nlet alg = I.ea\n\nlet is_safe i =\n I.ideal_AEAD && I.is_ae_honest i\n\nlet safe_id =\n i:id{is_safe i}\n\nlet unsafe_id =\n i:id{~ (is_safe i)}\n\n/// Some redefinitions, using Spec\n/// ------------------------------\n\n// Trying to follow the conventions: _len for machine lengths,\n// _length for spec (nat) lengths.\nlet tag_len: x:U32.t { forall (a: alg). {:pattern Spec.tag_length a} U32.v x == Spec.tag_length a } =\n 16ul\n\n// This duplicates a fair amount of definitions from Spec.Agile.AEAD, but here\n// the bounds are tighter and force plain texts to not overflow 32 bits once\n// encrypted and tagged.\n//\n// Introducing a minimum length allows making sure that there are enough bytes\n// to sample out of the ciphertext, as the tag can be too small for that purpose\n// for some AEAD ciphersuites.\ntype plain_length = l:nat{l + U32.v tag_len < pow2 32}\ntype plain_length_at_least (lmin: plain_length) = l:plain_length{lmin <= l}\n\n/// Packages, info (?)\n/// ------------------\n\nnoeq\ntype plain_pkg (min_len:plain_length) (idt: eqtype) (safe: idt -> bool) =\n | PlainPkg:\n plain: (i:idt -> plain_length_at_least min_len -> eqtype) ->\n as_bytes: (i:idt -> l:plain_length_at_least min_len -> plain i l -> GTot (Spec.lbytes l)) ->\n repr: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:plain i l -> Tot (b:Spec.lbytes l{b == as_bytes i l p})) ->\n mk: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:Spec.lbytes l -> p':plain i l { as_bytes i l p' == p }) ->\n plain_pkg min_len idt safe\n\nnoeq type info' = {\n alg: alg;\n halg: I.ha;\n min_len: plain_length;\n plain_pkg: plain_pkg min_len id is_safe;\n}", "dependencies": { "source_file": "Model.AEAD.fsti", "checked_file": "Model.AEAD.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: Model.AEAD.id -> Type", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.id", "Model.AEAD.info'", "Prims.l_and", "Prims.eq2", "Model.Indexing.ea", "Model.Indexing.ae_id_ginfo", "Model.AEAD.__proj__Mkinfo'__item__alg", "Model.Indexing.ha", "Model.Indexing.ae_id_ghash", "Model.AEAD.__proj__Mkinfo'__item__halg" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let info (i: id) =", "completed_definiton": "info: info'{I.ae_id_ginfo i == info.alg /\\ I.ae_id_ghash i == info.halg}", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fsti", "name": "Model.AEAD.safe_id", "original_source_type": "", "source_type": "val safe_id : Type0", "source_definition": "let safe_id =\n i:id{is_safe i}", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 27, "start_col": 2, "end_line": 27, "end_col": 17 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\n\n/// Abbreviations for idealization\n/// ------------------------------\n\n// In this module, id is an AEAD id.\nlet id = I.ae_id\n\n// ea = encryption alg\nlet alg = I.ea\n\nlet is_safe i =\n I.ideal_AEAD && I.is_ae_honest i", "dependencies": { "source_file": "Model.AEAD.fsti", "checked_file": "Model.AEAD.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.id", "Prims.b2t", "Model.AEAD.is_safe" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let safe_id =", "completed_definiton": "i: id{is_safe i}", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fsti", "name": "Model.AEAD.plain", "original_source_type": "", "source_type": "val plain : u55: Model.AEAD.info i -> l: Model.AEAD.at_least u55 -> Prims.eqtype", "source_definition": "let plain (#i:id) (u:info i) (l: at_least u) =\n u.plain_pkg.plain i l", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 83, "start_col": 2, "end_line": 83, "end_col": 23 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\n\n/// Abbreviations for idealization\n/// ------------------------------\n\n// In this module, id is an AEAD id.\nlet id = I.ae_id\n\n// ea = encryption alg\nlet alg = I.ea\n\nlet is_safe i =\n I.ideal_AEAD && I.is_ae_honest i\n\nlet safe_id =\n i:id{is_safe i}\n\nlet unsafe_id =\n i:id{~ (is_safe i)}\n\n/// Some redefinitions, using Spec\n/// ------------------------------\n\n// Trying to follow the conventions: _len for machine lengths,\n// _length for spec (nat) lengths.\nlet tag_len: x:U32.t { forall (a: alg). {:pattern Spec.tag_length a} U32.v x == Spec.tag_length a } =\n 16ul\n\n// This duplicates a fair amount of definitions from Spec.Agile.AEAD, but here\n// the bounds are tighter and force plain texts to not overflow 32 bits once\n// encrypted and tagged.\n//\n// Introducing a minimum length allows making sure that there are enough bytes\n// to sample out of the ciphertext, as the tag can be too small for that purpose\n// for some AEAD ciphersuites.\ntype plain_length = l:nat{l + U32.v tag_len < pow2 32}\ntype plain_length_at_least (lmin: plain_length) = l:plain_length{lmin <= l}\n\n/// Packages, info (?)\n/// ------------------\n\nnoeq\ntype plain_pkg (min_len:plain_length) (idt: eqtype) (safe: idt -> bool) =\n | PlainPkg:\n plain: (i:idt -> plain_length_at_least min_len -> eqtype) ->\n as_bytes: (i:idt -> l:plain_length_at_least min_len -> plain i l -> GTot (Spec.lbytes l)) ->\n repr: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:plain i l -> Tot (b:Spec.lbytes l{b == as_bytes i l p})) ->\n mk: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:Spec.lbytes l -> p':plain i l { as_bytes i l p' == p }) ->\n plain_pkg min_len idt safe\n\nnoeq type info' = {\n alg: alg;\n halg: I.ha;\n min_len: plain_length;\n plain_pkg: plain_pkg min_len id is_safe;\n}\n\nlet info (i:id) =\n info:info'{\n I.ae_id_ginfo i == info.alg /\\\n I.ae_id_ghash i == info.halg\n }\n\n/// Accessors for info\n/// ------------------\n\n// Accessor for the info type.\nlet at_least (#i:id) (u:info i) =\n plain_length_at_least u.min_len", "dependencies": { "source_file": "Model.AEAD.fsti", "checked_file": "Model.AEAD.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "u55: Model.AEAD.info i -> l: Model.AEAD.at_least u55 -> Prims.eqtype", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.id", "Model.AEAD.info", "Model.AEAD.at_least", "Model.AEAD.__proj__PlainPkg__item__plain", "Model.AEAD.__proj__Mkinfo'__item__min_len", "Model.AEAD.is_safe", "Model.AEAD.__proj__Mkinfo'__item__plain_pkg", "Prims.eqtype" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let plain (#i: id) (u: info i) (l: at_least u) =", "completed_definiton": "u.plain_pkg.plain i l", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fsti", "name": "Model.AEAD.rlog", "original_source_type": "", "source_type": "val rlog : r: Model.AEAD.aead_reader w -> h: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot (FStar.Seq.Base.seq (Model.AEAD.entry i (Model.AEAD.wgetinfo w)))", "source_definition": "let rlog (#i:safe_id) (#w: aead_writer i) (r:aead_reader w) (h:mem) = wlog w h", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 122, "start_col": 70, "end_line": 122, "end_col": 78 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\n\n/// Abbreviations for idealization\n/// ------------------------------\n\n// In this module, id is an AEAD id.\nlet id = I.ae_id\n\n// ea = encryption alg\nlet alg = I.ea\n\nlet is_safe i =\n I.ideal_AEAD && I.is_ae_honest i\n\nlet safe_id =\n i:id{is_safe i}\n\nlet unsafe_id =\n i:id{~ (is_safe i)}\n\n/// Some redefinitions, using Spec\n/// ------------------------------\n\n// Trying to follow the conventions: _len for machine lengths,\n// _length for spec (nat) lengths.\nlet tag_len: x:U32.t { forall (a: alg). {:pattern Spec.tag_length a} U32.v x == Spec.tag_length a } =\n 16ul\n\n// This duplicates a fair amount of definitions from Spec.Agile.AEAD, but here\n// the bounds are tighter and force plain texts to not overflow 32 bits once\n// encrypted and tagged.\n//\n// Introducing a minimum length allows making sure that there are enough bytes\n// to sample out of the ciphertext, as the tag can be too small for that purpose\n// for some AEAD ciphersuites.\ntype plain_length = l:nat{l + U32.v tag_len < pow2 32}\ntype plain_length_at_least (lmin: plain_length) = l:plain_length{lmin <= l}\n\n/// Packages, info (?)\n/// ------------------\n\nnoeq\ntype plain_pkg (min_len:plain_length) (idt: eqtype) (safe: idt -> bool) =\n | PlainPkg:\n plain: (i:idt -> plain_length_at_least min_len -> eqtype) ->\n as_bytes: (i:idt -> l:plain_length_at_least min_len -> plain i l -> GTot (Spec.lbytes l)) ->\n repr: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:plain i l -> Tot (b:Spec.lbytes l{b == as_bytes i l p})) ->\n mk: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:Spec.lbytes l -> p':plain i l { as_bytes i l p' == p }) ->\n plain_pkg min_len idt safe\n\nnoeq type info' = {\n alg: alg;\n halg: I.ha;\n min_len: plain_length;\n plain_pkg: plain_pkg min_len id is_safe;\n}\n\nlet info (i:id) =\n info:info'{\n I.ae_id_ginfo i == info.alg /\\\n I.ae_id_ghash i == info.halg\n }\n\n/// Accessors for info\n/// ------------------\n\n// Accessor for the info type.\nlet at_least (#i:id) (u:info i) =\n plain_length_at_least u.min_len\n\nlet plain (#i:id) (u:info i) (l: at_least u) =\n u.plain_pkg.plain i l\n\nlet plain_as_bytes (#i:id) (#u:info i) (#l:at_least u) (p:plain u l) : GTot (Spec.lbytes l) =\n u.plain_pkg.as_bytes i l p\n\nlet plain_repr (#i: unsafe_id) (#u:info i) (#l:at_least u) (p:plain u l) : Tot (r:Spec.lbytes l{r == plain_as_bytes p}) =\n u.plain_pkg.repr i l p\n\n/// Plains, ciphers and entries in the log\n/// --------------------------------------\n\nlet cipher (#i:id) (u:info i) (l:at_least u) =\n Spec.lbytes (l + UInt32.v tag_len)\n\nlet ad #i (u: info i) =\n Spec.ad u.alg\n\nlet nonce : eqtype = b:Seq.seq UInt8.t{Seq.length b == 12}\n\nnoeq\ntype entry (i:id) (u:info i) =\n | Entry:\n n: nonce ->\n ad: ad u ->\n #l: at_least u ->\n p: plain u l ->\n c: cipher u l ->\n entry i u\n\n/// Readers & writers\n/// -----------------\n\nval aead_writer: i:id -> Type u#1\nval aead_reader: #i:id -> w:aead_writer i -> Type u#1\n\nval wgetinfo: #i:id -> aead_writer i -> Tot (info i)\nval rgetinfo: #i:id -> #w:aead_writer i -> aead_reader w -> Tot (u:info i{u == wgetinfo w})", "dependencies": { "source_file": "Model.AEAD.fsti", "checked_file": "Model.AEAD.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "r: Model.AEAD.aead_reader w -> h: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot (FStar.Seq.Base.seq (Model.AEAD.entry i (Model.AEAD.wgetinfo w)))", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.safe_id", "Model.AEAD.aead_writer", "Model.AEAD.aead_reader", "FStar.Monotonic.HyperStack.mem", "Model.AEAD.wlog", "FStar.Seq.Base.seq", "Model.AEAD.entry", "Model.AEAD.wgetinfo" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let rlog (#i: safe_id) (#w: aead_writer i) (r: aead_reader w) (h: mem) =", "completed_definiton": "wlog w h", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fsti", "name": "Model.AEAD.nonce_filter", "original_source_type": "val nonce_filter (#i: id) (w: aead_writer i) (n: nonce) (e: entry i (wgetinfo w)) : bool", "source_type": "val nonce_filter (#i: id) (w: aead_writer i) (n: nonce) (e: entry i (wgetinfo w)) : bool", "source_definition": "let nonce_filter (#i:id) (w:aead_writer i) (n:nonce) (e:entry i (wgetinfo w)) : bool =\n Entry?.n e = n", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 218, "start_col": 2, "end_line": 218, "end_col": 16 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\n\n/// Abbreviations for idealization\n/// ------------------------------\n\n// In this module, id is an AEAD id.\nlet id = I.ae_id\n\n// ea = encryption alg\nlet alg = I.ea\n\nlet is_safe i =\n I.ideal_AEAD && I.is_ae_honest i\n\nlet safe_id =\n i:id{is_safe i}\n\nlet unsafe_id =\n i:id{~ (is_safe i)}\n\n/// Some redefinitions, using Spec\n/// ------------------------------\n\n// Trying to follow the conventions: _len for machine lengths,\n// _length for spec (nat) lengths.\nlet tag_len: x:U32.t { forall (a: alg). {:pattern Spec.tag_length a} U32.v x == Spec.tag_length a } =\n 16ul\n\n// This duplicates a fair amount of definitions from Spec.Agile.AEAD, but here\n// the bounds are tighter and force plain texts to not overflow 32 bits once\n// encrypted and tagged.\n//\n// Introducing a minimum length allows making sure that there are enough bytes\n// to sample out of the ciphertext, as the tag can be too small for that purpose\n// for some AEAD ciphersuites.\ntype plain_length = l:nat{l + U32.v tag_len < pow2 32}\ntype plain_length_at_least (lmin: plain_length) = l:plain_length{lmin <= l}\n\n/// Packages, info (?)\n/// ------------------\n\nnoeq\ntype plain_pkg (min_len:plain_length) (idt: eqtype) (safe: idt -> bool) =\n | PlainPkg:\n plain: (i:idt -> plain_length_at_least min_len -> eqtype) ->\n as_bytes: (i:idt -> l:plain_length_at_least min_len -> plain i l -> GTot (Spec.lbytes l)) ->\n repr: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:plain i l -> Tot (b:Spec.lbytes l{b == as_bytes i l p})) ->\n mk: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:Spec.lbytes l -> p':plain i l { as_bytes i l p' == p }) ->\n plain_pkg min_len idt safe\n\nnoeq type info' = {\n alg: alg;\n halg: I.ha;\n min_len: plain_length;\n plain_pkg: plain_pkg min_len id is_safe;\n}\n\nlet info (i:id) =\n info:info'{\n I.ae_id_ginfo i == info.alg /\\\n I.ae_id_ghash i == info.halg\n }\n\n/// Accessors for info\n/// ------------------\n\n// Accessor for the info type.\nlet at_least (#i:id) (u:info i) =\n plain_length_at_least u.min_len\n\nlet plain (#i:id) (u:info i) (l: at_least u) =\n u.plain_pkg.plain i l\n\nlet plain_as_bytes (#i:id) (#u:info i) (#l:at_least u) (p:plain u l) : GTot (Spec.lbytes l) =\n u.plain_pkg.as_bytes i l p\n\nlet plain_repr (#i: unsafe_id) (#u:info i) (#l:at_least u) (p:plain u l) : Tot (r:Spec.lbytes l{r == plain_as_bytes p}) =\n u.plain_pkg.repr i l p\n\n/// Plains, ciphers and entries in the log\n/// --------------------------------------\n\nlet cipher (#i:id) (u:info i) (l:at_least u) =\n Spec.lbytes (l + UInt32.v tag_len)\n\nlet ad #i (u: info i) =\n Spec.ad u.alg\n\nlet nonce : eqtype = b:Seq.seq UInt8.t{Seq.length b == 12}\n\nnoeq\ntype entry (i:id) (u:info i) =\n | Entry:\n n: nonce ->\n ad: ad u ->\n #l: at_least u ->\n p: plain u l ->\n c: cipher u l ->\n entry i u\n\n/// Readers & writers\n/// -----------------\n\nval aead_writer: i:id -> Type u#1\nval aead_reader: #i:id -> w:aead_writer i -> Type u#1\n\nval wgetinfo: #i:id -> aead_writer i -> Tot (info i)\nval rgetinfo: #i:id -> #w:aead_writer i -> aead_reader w -> Tot (u:info i{u == wgetinfo w})\n\nval wlog: #i:safe_id -> w:aead_writer i -> mem -> GTot (Seq.seq (entry i (wgetinfo w)))\nlet rlog (#i:safe_id) (#w: aead_writer i) (r:aead_reader w) (h:mem) = wlog w h\n\nval wkey: #i:unsafe_id -> w:aead_writer i -> Tot (Spec.kv (wgetinfo w).alg)\n\nval wfootprint: #i:id -> aead_writer i -> GTot B.loc\n\nval winvariant : #i:id -> aead_writer i -> mem -> Type0\n//let rinvariant (#i:I.id) (#w:aead_writer i) (r:aead_reader w) (h:mem) =\n// winvariant w h\n\nval wframe_invariant: #i:id -> l:B.loc -> w:aead_writer i -> h0:mem -> h1:mem ->\n Lemma\n (requires (\n winvariant w h0 /\\\n B.modifies l h0 h1 /\\\n B.loc_disjoint l (wfootprint w)))\n (ensures\n winvariant w h1)\n\nval frame_log: #i:safe_id -> l:B.loc -> w:aead_writer i -> h0:mem -> h1:mem ->\n Lemma\n (requires\n winvariant w h0 /\\\n B.modifies l h0 h1 /\\\n B.loc_disjoint l (wfootprint w))\n (ensures wlog w h1 == wlog w h0)\n\n/// Derivation (QUIC-specific)\n\nlet lemma_max_hash_len ha\n : Lemma (Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (if Some? (Spec.Hash.Definitions.max_input_length ha) then\n Some?.v (Spec.Hash.Definitions.max_input_length ha) >= pow2 61 - 1\n else\n True) /\\\n pow2 61 - 1 > 64)\n [SMTPat (Spec.Hash.Definitions.hash_length ha)]\n =\n assert_norm (pow2 61 < pow2 125);\n assert_norm (pow2 61 - 1 > 64);\n assert_norm (pow2 64 > pow2 61);\n assert_norm (pow2 128 > pow2 64)\n\nlet traffic_secret ha =\n Spec.lbytes (Spec.Hash.Definitions.hash_length ha)\n\n/// Main stateful API\n/// -----------------\n\n(** Allocating a writer **)\nval gen (i:id) (u:info i) : ST (aead_writer i)\n (requires (fun h -> True))\n (ensures (fun h0 w h1 ->\n winvariant w h1 /\\\n\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (wfootprint w) h0 h1 /\\\n B.(loc_includes (loc_ae_region ()) (wfootprint w)) /\\\n\n wgetinfo w == u /\\\n (I.ideal_AEAD && I.is_ae_honest i ==> wlog w h1 == Seq.empty)))\n\n(** Building a reader from a writer **)\nval gen_reader (#i: id) (w: aead_writer i) : ST (aead_reader w)\n (requires (fun h -> winvariant w h))\n (ensures (fun h0 r h1 -> h0 == h1))\n\nval coerce (#i:unsafe_id) (u:info i)\n (kv:Spec.kv u.alg)\n : ST (aead_writer i)\n (requires fun h0 -> True)\n (ensures fun h0 w h1 ->\n winvariant w h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (wfootprint w) h0 h1 /\\\n B.(loc_includes (loc_ae_region ()) (wfootprint w)) /\\\n wgetinfo w == u /\\\n wkey w == kv\n )\n\nval quic_coerce (#i:unsafe_id) (u:info i)\n (ts:traffic_secret u.halg)\n : ST (aead_writer i)\n (requires fun h0 -> True)\n (ensures fun h0 w h1 ->\n winvariant w h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (wfootprint w) h0 h1 /\\\n B.(loc_includes (loc_ae_region ()) (wfootprint w)) /\\\n wgetinfo w == u /\\\n wkey w ==\n QUIC.Spec.derive_secret u.halg ts\n QUIC.Spec.label_key (Spec.key_length u.alg)\n )", "dependencies": { "source_file": "Model.AEAD.fsti", "checked_file": "Model.AEAD.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.AEAD.aead_writer i -> n: Model.AEAD.nonce -> e: Model.AEAD.entry i (Model.AEAD.wgetinfo w)\n -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.id", "Model.AEAD.aead_writer", "Model.AEAD.nonce", "Model.AEAD.entry", "Model.AEAD.wgetinfo", "Prims.op_Equality", "Model.AEAD.__proj__Entry__item__n", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val nonce_filter (#i: id) (w: aead_writer i) (n: nonce) (e: entry i (wgetinfo w)) : bool\nlet nonce_filter (#i: id) (w: aead_writer i) (n: nonce) (e: entry i (wgetinfo w)) : bool =", "completed_definiton": "Entry?.n e = n", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fsti", "name": "Model.AEAD.fresh_nonce", "original_source_type": "val fresh_nonce (#i: safe_id) (w: aead_writer i) (n: nonce) (h: mem) : GTot bool", "source_type": "val fresh_nonce (#i: safe_id) (w: aead_writer i) (n: nonce) (h: mem) : GTot bool", "source_definition": "let fresh_nonce (#i:safe_id) (w:aead_writer i) (n:nonce) (h:mem)\n : GTot bool =\n None? (wentry_for_nonce w n h)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 226, "start_col": 2, "end_line": 226, "end_col": 32 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\n\n/// Abbreviations for idealization\n/// ------------------------------\n\n// In this module, id is an AEAD id.\nlet id = I.ae_id\n\n// ea = encryption alg\nlet alg = I.ea\n\nlet is_safe i =\n I.ideal_AEAD && I.is_ae_honest i\n\nlet safe_id =\n i:id{is_safe i}\n\nlet unsafe_id =\n i:id{~ (is_safe i)}\n\n/// Some redefinitions, using Spec\n/// ------------------------------\n\n// Trying to follow the conventions: _len for machine lengths,\n// _length for spec (nat) lengths.\nlet tag_len: x:U32.t { forall (a: alg). {:pattern Spec.tag_length a} U32.v x == Spec.tag_length a } =\n 16ul\n\n// This duplicates a fair amount of definitions from Spec.Agile.AEAD, but here\n// the bounds are tighter and force plain texts to not overflow 32 bits once\n// encrypted and tagged.\n//\n// Introducing a minimum length allows making sure that there are enough bytes\n// to sample out of the ciphertext, as the tag can be too small for that purpose\n// for some AEAD ciphersuites.\ntype plain_length = l:nat{l + U32.v tag_len < pow2 32}\ntype plain_length_at_least (lmin: plain_length) = l:plain_length{lmin <= l}\n\n/// Packages, info (?)\n/// ------------------\n\nnoeq\ntype plain_pkg (min_len:plain_length) (idt: eqtype) (safe: idt -> bool) =\n | PlainPkg:\n plain: (i:idt -> plain_length_at_least min_len -> eqtype) ->\n as_bytes: (i:idt -> l:plain_length_at_least min_len -> plain i l -> GTot (Spec.lbytes l)) ->\n repr: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:plain i l -> Tot (b:Spec.lbytes l{b == as_bytes i l p})) ->\n mk: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:Spec.lbytes l -> p':plain i l { as_bytes i l p' == p }) ->\n plain_pkg min_len idt safe\n\nnoeq type info' = {\n alg: alg;\n halg: I.ha;\n min_len: plain_length;\n plain_pkg: plain_pkg min_len id is_safe;\n}\n\nlet info (i:id) =\n info:info'{\n I.ae_id_ginfo i == info.alg /\\\n I.ae_id_ghash i == info.halg\n }\n\n/// Accessors for info\n/// ------------------\n\n// Accessor for the info type.\nlet at_least (#i:id) (u:info i) =\n plain_length_at_least u.min_len\n\nlet plain (#i:id) (u:info i) (l: at_least u) =\n u.plain_pkg.plain i l\n\nlet plain_as_bytes (#i:id) (#u:info i) (#l:at_least u) (p:plain u l) : GTot (Spec.lbytes l) =\n u.plain_pkg.as_bytes i l p\n\nlet plain_repr (#i: unsafe_id) (#u:info i) (#l:at_least u) (p:plain u l) : Tot (r:Spec.lbytes l{r == plain_as_bytes p}) =\n u.plain_pkg.repr i l p\n\n/// Plains, ciphers and entries in the log\n/// --------------------------------------\n\nlet cipher (#i:id) (u:info i) (l:at_least u) =\n Spec.lbytes (l + UInt32.v tag_len)\n\nlet ad #i (u: info i) =\n Spec.ad u.alg\n\nlet nonce : eqtype = b:Seq.seq UInt8.t{Seq.length b == 12}\n\nnoeq\ntype entry (i:id) (u:info i) =\n | Entry:\n n: nonce ->\n ad: ad u ->\n #l: at_least u ->\n p: plain u l ->\n c: cipher u l ->\n entry i u\n\n/// Readers & writers\n/// -----------------\n\nval aead_writer: i:id -> Type u#1\nval aead_reader: #i:id -> w:aead_writer i -> Type u#1\n\nval wgetinfo: #i:id -> aead_writer i -> Tot (info i)\nval rgetinfo: #i:id -> #w:aead_writer i -> aead_reader w -> Tot (u:info i{u == wgetinfo w})\n\nval wlog: #i:safe_id -> w:aead_writer i -> mem -> GTot (Seq.seq (entry i (wgetinfo w)))\nlet rlog (#i:safe_id) (#w: aead_writer i) (r:aead_reader w) (h:mem) = wlog w h\n\nval wkey: #i:unsafe_id -> w:aead_writer i -> Tot (Spec.kv (wgetinfo w).alg)\n\nval wfootprint: #i:id -> aead_writer i -> GTot B.loc\n\nval winvariant : #i:id -> aead_writer i -> mem -> Type0\n//let rinvariant (#i:I.id) (#w:aead_writer i) (r:aead_reader w) (h:mem) =\n// winvariant w h\n\nval wframe_invariant: #i:id -> l:B.loc -> w:aead_writer i -> h0:mem -> h1:mem ->\n Lemma\n (requires (\n winvariant w h0 /\\\n B.modifies l h0 h1 /\\\n B.loc_disjoint l (wfootprint w)))\n (ensures\n winvariant w h1)\n\nval frame_log: #i:safe_id -> l:B.loc -> w:aead_writer i -> h0:mem -> h1:mem ->\n Lemma\n (requires\n winvariant w h0 /\\\n B.modifies l h0 h1 /\\\n B.loc_disjoint l (wfootprint w))\n (ensures wlog w h1 == wlog w h0)\n\n/// Derivation (QUIC-specific)\n\nlet lemma_max_hash_len ha\n : Lemma (Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (if Some? (Spec.Hash.Definitions.max_input_length ha) then\n Some?.v (Spec.Hash.Definitions.max_input_length ha) >= pow2 61 - 1\n else\n True) /\\\n pow2 61 - 1 > 64)\n [SMTPat (Spec.Hash.Definitions.hash_length ha)]\n =\n assert_norm (pow2 61 < pow2 125);\n assert_norm (pow2 61 - 1 > 64);\n assert_norm (pow2 64 > pow2 61);\n assert_norm (pow2 128 > pow2 64)\n\nlet traffic_secret ha =\n Spec.lbytes (Spec.Hash.Definitions.hash_length ha)\n\n/// Main stateful API\n/// -----------------\n\n(** Allocating a writer **)\nval gen (i:id) (u:info i) : ST (aead_writer i)\n (requires (fun h -> True))\n (ensures (fun h0 w h1 ->\n winvariant w h1 /\\\n\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (wfootprint w) h0 h1 /\\\n B.(loc_includes (loc_ae_region ()) (wfootprint w)) /\\\n\n wgetinfo w == u /\\\n (I.ideal_AEAD && I.is_ae_honest i ==> wlog w h1 == Seq.empty)))\n\n(** Building a reader from a writer **)\nval gen_reader (#i: id) (w: aead_writer i) : ST (aead_reader w)\n (requires (fun h -> winvariant w h))\n (ensures (fun h0 r h1 -> h0 == h1))\n\nval coerce (#i:unsafe_id) (u:info i)\n (kv:Spec.kv u.alg)\n : ST (aead_writer i)\n (requires fun h0 -> True)\n (ensures fun h0 w h1 ->\n winvariant w h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (wfootprint w) h0 h1 /\\\n B.(loc_includes (loc_ae_region ()) (wfootprint w)) /\\\n wgetinfo w == u /\\\n wkey w == kv\n )\n\nval quic_coerce (#i:unsafe_id) (u:info i)\n (ts:traffic_secret u.halg)\n : ST (aead_writer i)\n (requires fun h0 -> True)\n (ensures fun h0 w h1 ->\n winvariant w h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (wfootprint w) h0 h1 /\\\n B.(loc_includes (loc_ae_region ()) (wfootprint w)) /\\\n wgetinfo w == u /\\\n wkey w ==\n QUIC.Spec.derive_secret u.halg ts\n QUIC.Spec.label_key (Spec.key_length u.alg)\n )\n\nlet nonce_filter (#i:id) (w:aead_writer i) (n:nonce) (e:entry i (wgetinfo w)) : bool =\n Entry?.n e = n\n\nlet wentry_for_nonce (#i:safe_id) (w:aead_writer i) (n:nonce) (h:mem)\n : GTot (option (entry i (wgetinfo w))) =\n Seq.find_l (nonce_filter #i w n) (wlog w h)\n\nlet fresh_nonce (#i:safe_id) (w:aead_writer i) (n:nonce) (h:mem)", "dependencies": { "source_file": "Model.AEAD.fsti", "checked_file": "Model.AEAD.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.AEAD.aead_writer i -> n: Model.AEAD.nonce -> h: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Prims.bool", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.safe_id", "Model.AEAD.aead_writer", "Model.AEAD.nonce", "FStar.Monotonic.HyperStack.mem", "FStar.Pervasives.Native.uu___is_None", "Model.AEAD.entry", "Model.AEAD.wgetinfo", "Model.AEAD.wentry_for_nonce", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val fresh_nonce (#i: safe_id) (w: aead_writer i) (n: nonce) (h: mem) : GTot bool\nlet fresh_nonce (#i: safe_id) (w: aead_writer i) (n: nonce) (h: mem) : GTot bool =", "completed_definiton": "None? (wentry_for_nonce w n h)", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fsti", "name": "Model.AEAD.wentry_for_nonce", "original_source_type": "val wentry_for_nonce (#i: safe_id) (w: aead_writer i) (n: nonce) (h: mem)\n : GTot (option (entry i (wgetinfo w)))", "source_type": "val wentry_for_nonce (#i: safe_id) (w: aead_writer i) (n: nonce) (h: mem)\n : GTot (option (entry i (wgetinfo w)))", "source_definition": "let wentry_for_nonce (#i:safe_id) (w:aead_writer i) (n:nonce) (h:mem)\n : GTot (option (entry i (wgetinfo w))) =\n Seq.find_l (nonce_filter #i w n) (wlog w h)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 222, "start_col": 2, "end_line": 222, "end_col": 45 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\n\n/// Abbreviations for idealization\n/// ------------------------------\n\n// In this module, id is an AEAD id.\nlet id = I.ae_id\n\n// ea = encryption alg\nlet alg = I.ea\n\nlet is_safe i =\n I.ideal_AEAD && I.is_ae_honest i\n\nlet safe_id =\n i:id{is_safe i}\n\nlet unsafe_id =\n i:id{~ (is_safe i)}\n\n/// Some redefinitions, using Spec\n/// ------------------------------\n\n// Trying to follow the conventions: _len for machine lengths,\n// _length for spec (nat) lengths.\nlet tag_len: x:U32.t { forall (a: alg). {:pattern Spec.tag_length a} U32.v x == Spec.tag_length a } =\n 16ul\n\n// This duplicates a fair amount of definitions from Spec.Agile.AEAD, but here\n// the bounds are tighter and force plain texts to not overflow 32 bits once\n// encrypted and tagged.\n//\n// Introducing a minimum length allows making sure that there are enough bytes\n// to sample out of the ciphertext, as the tag can be too small for that purpose\n// for some AEAD ciphersuites.\ntype plain_length = l:nat{l + U32.v tag_len < pow2 32}\ntype plain_length_at_least (lmin: plain_length) = l:plain_length{lmin <= l}\n\n/// Packages, info (?)\n/// ------------------\n\nnoeq\ntype plain_pkg (min_len:plain_length) (idt: eqtype) (safe: idt -> bool) =\n | PlainPkg:\n plain: (i:idt -> plain_length_at_least min_len -> eqtype) ->\n as_bytes: (i:idt -> l:plain_length_at_least min_len -> plain i l -> GTot (Spec.lbytes l)) ->\n repr: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:plain i l -> Tot (b:Spec.lbytes l{b == as_bytes i l p})) ->\n mk: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:Spec.lbytes l -> p':plain i l { as_bytes i l p' == p }) ->\n plain_pkg min_len idt safe\n\nnoeq type info' = {\n alg: alg;\n halg: I.ha;\n min_len: plain_length;\n plain_pkg: plain_pkg min_len id is_safe;\n}\n\nlet info (i:id) =\n info:info'{\n I.ae_id_ginfo i == info.alg /\\\n I.ae_id_ghash i == info.halg\n }\n\n/// Accessors for info\n/// ------------------\n\n// Accessor for the info type.\nlet at_least (#i:id) (u:info i) =\n plain_length_at_least u.min_len\n\nlet plain (#i:id) (u:info i) (l: at_least u) =\n u.plain_pkg.plain i l\n\nlet plain_as_bytes (#i:id) (#u:info i) (#l:at_least u) (p:plain u l) : GTot (Spec.lbytes l) =\n u.plain_pkg.as_bytes i l p\n\nlet plain_repr (#i: unsafe_id) (#u:info i) (#l:at_least u) (p:plain u l) : Tot (r:Spec.lbytes l{r == plain_as_bytes p}) =\n u.plain_pkg.repr i l p\n\n/// Plains, ciphers and entries in the log\n/// --------------------------------------\n\nlet cipher (#i:id) (u:info i) (l:at_least u) =\n Spec.lbytes (l + UInt32.v tag_len)\n\nlet ad #i (u: info i) =\n Spec.ad u.alg\n\nlet nonce : eqtype = b:Seq.seq UInt8.t{Seq.length b == 12}\n\nnoeq\ntype entry (i:id) (u:info i) =\n | Entry:\n n: nonce ->\n ad: ad u ->\n #l: at_least u ->\n p: plain u l ->\n c: cipher u l ->\n entry i u\n\n/// Readers & writers\n/// -----------------\n\nval aead_writer: i:id -> Type u#1\nval aead_reader: #i:id -> w:aead_writer i -> Type u#1\n\nval wgetinfo: #i:id -> aead_writer i -> Tot (info i)\nval rgetinfo: #i:id -> #w:aead_writer i -> aead_reader w -> Tot (u:info i{u == wgetinfo w})\n\nval wlog: #i:safe_id -> w:aead_writer i -> mem -> GTot (Seq.seq (entry i (wgetinfo w)))\nlet rlog (#i:safe_id) (#w: aead_writer i) (r:aead_reader w) (h:mem) = wlog w h\n\nval wkey: #i:unsafe_id -> w:aead_writer i -> Tot (Spec.kv (wgetinfo w).alg)\n\nval wfootprint: #i:id -> aead_writer i -> GTot B.loc\n\nval winvariant : #i:id -> aead_writer i -> mem -> Type0\n//let rinvariant (#i:I.id) (#w:aead_writer i) (r:aead_reader w) (h:mem) =\n// winvariant w h\n\nval wframe_invariant: #i:id -> l:B.loc -> w:aead_writer i -> h0:mem -> h1:mem ->\n Lemma\n (requires (\n winvariant w h0 /\\\n B.modifies l h0 h1 /\\\n B.loc_disjoint l (wfootprint w)))\n (ensures\n winvariant w h1)\n\nval frame_log: #i:safe_id -> l:B.loc -> w:aead_writer i -> h0:mem -> h1:mem ->\n Lemma\n (requires\n winvariant w h0 /\\\n B.modifies l h0 h1 /\\\n B.loc_disjoint l (wfootprint w))\n (ensures wlog w h1 == wlog w h0)\n\n/// Derivation (QUIC-specific)\n\nlet lemma_max_hash_len ha\n : Lemma (Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (if Some? (Spec.Hash.Definitions.max_input_length ha) then\n Some?.v (Spec.Hash.Definitions.max_input_length ha) >= pow2 61 - 1\n else\n True) /\\\n pow2 61 - 1 > 64)\n [SMTPat (Spec.Hash.Definitions.hash_length ha)]\n =\n assert_norm (pow2 61 < pow2 125);\n assert_norm (pow2 61 - 1 > 64);\n assert_norm (pow2 64 > pow2 61);\n assert_norm (pow2 128 > pow2 64)\n\nlet traffic_secret ha =\n Spec.lbytes (Spec.Hash.Definitions.hash_length ha)\n\n/// Main stateful API\n/// -----------------\n\n(** Allocating a writer **)\nval gen (i:id) (u:info i) : ST (aead_writer i)\n (requires (fun h -> True))\n (ensures (fun h0 w h1 ->\n winvariant w h1 /\\\n\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (wfootprint w) h0 h1 /\\\n B.(loc_includes (loc_ae_region ()) (wfootprint w)) /\\\n\n wgetinfo w == u /\\\n (I.ideal_AEAD && I.is_ae_honest i ==> wlog w h1 == Seq.empty)))\n\n(** Building a reader from a writer **)\nval gen_reader (#i: id) (w: aead_writer i) : ST (aead_reader w)\n (requires (fun h -> winvariant w h))\n (ensures (fun h0 r h1 -> h0 == h1))\n\nval coerce (#i:unsafe_id) (u:info i)\n (kv:Spec.kv u.alg)\n : ST (aead_writer i)\n (requires fun h0 -> True)\n (ensures fun h0 w h1 ->\n winvariant w h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (wfootprint w) h0 h1 /\\\n B.(loc_includes (loc_ae_region ()) (wfootprint w)) /\\\n wgetinfo w == u /\\\n wkey w == kv\n )\n\nval quic_coerce (#i:unsafe_id) (u:info i)\n (ts:traffic_secret u.halg)\n : ST (aead_writer i)\n (requires fun h0 -> True)\n (ensures fun h0 w h1 ->\n winvariant w h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (wfootprint w) h0 h1 /\\\n B.(loc_includes (loc_ae_region ()) (wfootprint w)) /\\\n wgetinfo w == u /\\\n wkey w ==\n QUIC.Spec.derive_secret u.halg ts\n QUIC.Spec.label_key (Spec.key_length u.alg)\n )\n\nlet nonce_filter (#i:id) (w:aead_writer i) (n:nonce) (e:entry i (wgetinfo w)) : bool =\n Entry?.n e = n\n\nlet wentry_for_nonce (#i:safe_id) (w:aead_writer i) (n:nonce) (h:mem)", "dependencies": { "source_file": "Model.AEAD.fsti", "checked_file": "Model.AEAD.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "w: Model.AEAD.aead_writer i -> n: Model.AEAD.nonce -> h: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot (FStar.Pervasives.Native.option (Model.AEAD.entry i (Model.AEAD.wgetinfo w)))", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.safe_id", "Model.AEAD.aead_writer", "Model.AEAD.nonce", "FStar.Monotonic.HyperStack.mem", "FStar.Seq.Properties.find_l", "Model.AEAD.entry", "Model.AEAD.wgetinfo", "Model.AEAD.nonce_filter", "Model.AEAD.wlog", "FStar.Pervasives.Native.option" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val wentry_for_nonce (#i: safe_id) (w: aead_writer i) (n: nonce) (h: mem)\n : GTot (option (entry i (wgetinfo w)))\nlet wentry_for_nonce (#i: safe_id) (w: aead_writer i) (n: nonce) (h: mem)\n : GTot (option (entry i (wgetinfo w))) =", "completed_definiton": "Seq.find_l (nonce_filter #i w n) (wlog w h)", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fsti", "name": "Model.AEAD.plain_as_bytes", "original_source_type": "val plain_as_bytes (#i: id) (#u: info i) (#l: at_least u) (p: plain u l) : GTot (Spec.lbytes l)", "source_type": "val plain_as_bytes (#i: id) (#u: info i) (#l: at_least u) (p: plain u l) : GTot (Spec.lbytes l)", "source_definition": "let plain_as_bytes (#i:id) (#u:info i) (#l:at_least u) (p:plain u l) : GTot (Spec.lbytes l) =\n u.plain_pkg.as_bytes i l p", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 86, "start_col": 2, "end_line": 86, "end_col": 28 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\n\n/// Abbreviations for idealization\n/// ------------------------------\n\n// In this module, id is an AEAD id.\nlet id = I.ae_id\n\n// ea = encryption alg\nlet alg = I.ea\n\nlet is_safe i =\n I.ideal_AEAD && I.is_ae_honest i\n\nlet safe_id =\n i:id{is_safe i}\n\nlet unsafe_id =\n i:id{~ (is_safe i)}\n\n/// Some redefinitions, using Spec\n/// ------------------------------\n\n// Trying to follow the conventions: _len for machine lengths,\n// _length for spec (nat) lengths.\nlet tag_len: x:U32.t { forall (a: alg). {:pattern Spec.tag_length a} U32.v x == Spec.tag_length a } =\n 16ul\n\n// This duplicates a fair amount of definitions from Spec.Agile.AEAD, but here\n// the bounds are tighter and force plain texts to not overflow 32 bits once\n// encrypted and tagged.\n//\n// Introducing a minimum length allows making sure that there are enough bytes\n// to sample out of the ciphertext, as the tag can be too small for that purpose\n// for some AEAD ciphersuites.\ntype plain_length = l:nat{l + U32.v tag_len < pow2 32}\ntype plain_length_at_least (lmin: plain_length) = l:plain_length{lmin <= l}\n\n/// Packages, info (?)\n/// ------------------\n\nnoeq\ntype plain_pkg (min_len:plain_length) (idt: eqtype) (safe: idt -> bool) =\n | PlainPkg:\n plain: (i:idt -> plain_length_at_least min_len -> eqtype) ->\n as_bytes: (i:idt -> l:plain_length_at_least min_len -> plain i l -> GTot (Spec.lbytes l)) ->\n repr: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:plain i l -> Tot (b:Spec.lbytes l{b == as_bytes i l p})) ->\n mk: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:Spec.lbytes l -> p':plain i l { as_bytes i l p' == p }) ->\n plain_pkg min_len idt safe\n\nnoeq type info' = {\n alg: alg;\n halg: I.ha;\n min_len: plain_length;\n plain_pkg: plain_pkg min_len id is_safe;\n}\n\nlet info (i:id) =\n info:info'{\n I.ae_id_ginfo i == info.alg /\\\n I.ae_id_ghash i == info.halg\n }\n\n/// Accessors for info\n/// ------------------\n\n// Accessor for the info type.\nlet at_least (#i:id) (u:info i) =\n plain_length_at_least u.min_len\n\nlet plain (#i:id) (u:info i) (l: at_least u) =\n u.plain_pkg.plain i l", "dependencies": { "source_file": "Model.AEAD.fsti", "checked_file": "Model.AEAD.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "p: Model.AEAD.plain u59 l -> Prims.GTot (Spec.Agile.AEAD.lbytes l)", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.id", "Model.AEAD.info", "Model.AEAD.at_least", "Model.AEAD.plain", "Model.AEAD.__proj__PlainPkg__item__as_bytes", "Model.AEAD.__proj__Mkinfo'__item__min_len", "Model.AEAD.is_safe", "Model.AEAD.__proj__Mkinfo'__item__plain_pkg", "Spec.Agile.AEAD.lbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val plain_as_bytes (#i: id) (#u: info i) (#l: at_least u) (p: plain u l) : GTot (Spec.lbytes l)\nlet plain_as_bytes (#i: id) (#u: info i) (#l: at_least u) (p: plain u l) : GTot (Spec.lbytes l) =", "completed_definiton": "u.plain_pkg.as_bytes i l p", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fsti", "name": "Model.AEAD.traffic_secret", "original_source_type": "", "source_type": "val traffic_secret : ha: a: Spec.Hash.Definitions.hash_alg{Prims.op_Negation (Spec.Hash.Definitions.is_shake a)} -> Type0", "source_definition": "let traffic_secret ha =\n Spec.lbytes (Spec.Hash.Definitions.hash_length ha)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 166, "start_col": 2, "end_line": 166, "end_col": 52 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\n\n/// Abbreviations for idealization\n/// ------------------------------\n\n// In this module, id is an AEAD id.\nlet id = I.ae_id\n\n// ea = encryption alg\nlet alg = I.ea\n\nlet is_safe i =\n I.ideal_AEAD && I.is_ae_honest i\n\nlet safe_id =\n i:id{is_safe i}\n\nlet unsafe_id =\n i:id{~ (is_safe i)}\n\n/// Some redefinitions, using Spec\n/// ------------------------------\n\n// Trying to follow the conventions: _len for machine lengths,\n// _length for spec (nat) lengths.\nlet tag_len: x:U32.t { forall (a: alg). {:pattern Spec.tag_length a} U32.v x == Spec.tag_length a } =\n 16ul\n\n// This duplicates a fair amount of definitions from Spec.Agile.AEAD, but here\n// the bounds are tighter and force plain texts to not overflow 32 bits once\n// encrypted and tagged.\n//\n// Introducing a minimum length allows making sure that there are enough bytes\n// to sample out of the ciphertext, as the tag can be too small for that purpose\n// for some AEAD ciphersuites.\ntype plain_length = l:nat{l + U32.v tag_len < pow2 32}\ntype plain_length_at_least (lmin: plain_length) = l:plain_length{lmin <= l}\n\n/// Packages, info (?)\n/// ------------------\n\nnoeq\ntype plain_pkg (min_len:plain_length) (idt: eqtype) (safe: idt -> bool) =\n | PlainPkg:\n plain: (i:idt -> plain_length_at_least min_len -> eqtype) ->\n as_bytes: (i:idt -> l:plain_length_at_least min_len -> plain i l -> GTot (Spec.lbytes l)) ->\n repr: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:plain i l -> Tot (b:Spec.lbytes l{b == as_bytes i l p})) ->\n mk: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:Spec.lbytes l -> p':plain i l { as_bytes i l p' == p }) ->\n plain_pkg min_len idt safe\n\nnoeq type info' = {\n alg: alg;\n halg: I.ha;\n min_len: plain_length;\n plain_pkg: plain_pkg min_len id is_safe;\n}\n\nlet info (i:id) =\n info:info'{\n I.ae_id_ginfo i == info.alg /\\\n I.ae_id_ghash i == info.halg\n }\n\n/// Accessors for info\n/// ------------------\n\n// Accessor for the info type.\nlet at_least (#i:id) (u:info i) =\n plain_length_at_least u.min_len\n\nlet plain (#i:id) (u:info i) (l: at_least u) =\n u.plain_pkg.plain i l\n\nlet plain_as_bytes (#i:id) (#u:info i) (#l:at_least u) (p:plain u l) : GTot (Spec.lbytes l) =\n u.plain_pkg.as_bytes i l p\n\nlet plain_repr (#i: unsafe_id) (#u:info i) (#l:at_least u) (p:plain u l) : Tot (r:Spec.lbytes l{r == plain_as_bytes p}) =\n u.plain_pkg.repr i l p\n\n/// Plains, ciphers and entries in the log\n/// --------------------------------------\n\nlet cipher (#i:id) (u:info i) (l:at_least u) =\n Spec.lbytes (l + UInt32.v tag_len)\n\nlet ad #i (u: info i) =\n Spec.ad u.alg\n\nlet nonce : eqtype = b:Seq.seq UInt8.t{Seq.length b == 12}\n\nnoeq\ntype entry (i:id) (u:info i) =\n | Entry:\n n: nonce ->\n ad: ad u ->\n #l: at_least u ->\n p: plain u l ->\n c: cipher u l ->\n entry i u\n\n/// Readers & writers\n/// -----------------\n\nval aead_writer: i:id -> Type u#1\nval aead_reader: #i:id -> w:aead_writer i -> Type u#1\n\nval wgetinfo: #i:id -> aead_writer i -> Tot (info i)\nval rgetinfo: #i:id -> #w:aead_writer i -> aead_reader w -> Tot (u:info i{u == wgetinfo w})\n\nval wlog: #i:safe_id -> w:aead_writer i -> mem -> GTot (Seq.seq (entry i (wgetinfo w)))\nlet rlog (#i:safe_id) (#w: aead_writer i) (r:aead_reader w) (h:mem) = wlog w h\n\nval wkey: #i:unsafe_id -> w:aead_writer i -> Tot (Spec.kv (wgetinfo w).alg)\n\nval wfootprint: #i:id -> aead_writer i -> GTot B.loc\n\nval winvariant : #i:id -> aead_writer i -> mem -> Type0\n//let rinvariant (#i:I.id) (#w:aead_writer i) (r:aead_reader w) (h:mem) =\n// winvariant w h\n\nval wframe_invariant: #i:id -> l:B.loc -> w:aead_writer i -> h0:mem -> h1:mem ->\n Lemma\n (requires (\n winvariant w h0 /\\\n B.modifies l h0 h1 /\\\n B.loc_disjoint l (wfootprint w)))\n (ensures\n winvariant w h1)\n\nval frame_log: #i:safe_id -> l:B.loc -> w:aead_writer i -> h0:mem -> h1:mem ->\n Lemma\n (requires\n winvariant w h0 /\\\n B.modifies l h0 h1 /\\\n B.loc_disjoint l (wfootprint w))\n (ensures wlog w h1 == wlog w h0)\n\n/// Derivation (QUIC-specific)\n\nlet lemma_max_hash_len ha\n : Lemma (Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (if Some? (Spec.Hash.Definitions.max_input_length ha) then\n Some?.v (Spec.Hash.Definitions.max_input_length ha) >= pow2 61 - 1\n else\n True) /\\\n pow2 61 - 1 > 64)\n [SMTPat (Spec.Hash.Definitions.hash_length ha)]\n =\n assert_norm (pow2 61 < pow2 125);\n assert_norm (pow2 61 - 1 > 64);\n assert_norm (pow2 64 > pow2 61);\n assert_norm (pow2 128 > pow2 64)", "dependencies": { "source_file": "Model.AEAD.fsti", "checked_file": "Model.AEAD.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "ha: a: Spec.Hash.Definitions.hash_alg{Prims.op_Negation (Spec.Hash.Definitions.is_shake a)} -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Spec.Hash.Definitions.hash_alg", "Prims.b2t", "Prims.op_Negation", "Spec.Hash.Definitions.is_shake", "Spec.Agile.AEAD.lbytes", "Spec.Hash.Definitions.hash_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let traffic_secret ha =", "completed_definiton": "Spec.lbytes (Spec.Hash.Definitions.hash_length ha)", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fsti", "name": "Model.AEAD.cipher", "original_source_type": "", "source_type": "val cipher : u66: Model.AEAD.info i -> l: Model.AEAD.at_least u66 -> Type0", "source_definition": "let cipher (#i:id) (u:info i) (l:at_least u) =\n Spec.lbytes (l + UInt32.v tag_len)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 95, "start_col": 2, "end_line": 95, "end_col": 36 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\n\n/// Abbreviations for idealization\n/// ------------------------------\n\n// In this module, id is an AEAD id.\nlet id = I.ae_id\n\n// ea = encryption alg\nlet alg = I.ea\n\nlet is_safe i =\n I.ideal_AEAD && I.is_ae_honest i\n\nlet safe_id =\n i:id{is_safe i}\n\nlet unsafe_id =\n i:id{~ (is_safe i)}\n\n/// Some redefinitions, using Spec\n/// ------------------------------\n\n// Trying to follow the conventions: _len for machine lengths,\n// _length for spec (nat) lengths.\nlet tag_len: x:U32.t { forall (a: alg). {:pattern Spec.tag_length a} U32.v x == Spec.tag_length a } =\n 16ul\n\n// This duplicates a fair amount of definitions from Spec.Agile.AEAD, but here\n// the bounds are tighter and force plain texts to not overflow 32 bits once\n// encrypted and tagged.\n//\n// Introducing a minimum length allows making sure that there are enough bytes\n// to sample out of the ciphertext, as the tag can be too small for that purpose\n// for some AEAD ciphersuites.\ntype plain_length = l:nat{l + U32.v tag_len < pow2 32}\ntype plain_length_at_least (lmin: plain_length) = l:plain_length{lmin <= l}\n\n/// Packages, info (?)\n/// ------------------\n\nnoeq\ntype plain_pkg (min_len:plain_length) (idt: eqtype) (safe: idt -> bool) =\n | PlainPkg:\n plain: (i:idt -> plain_length_at_least min_len -> eqtype) ->\n as_bytes: (i:idt -> l:plain_length_at_least min_len -> plain i l -> GTot (Spec.lbytes l)) ->\n repr: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:plain i l -> Tot (b:Spec.lbytes l{b == as_bytes i l p})) ->\n mk: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:Spec.lbytes l -> p':plain i l { as_bytes i l p' == p }) ->\n plain_pkg min_len idt safe\n\nnoeq type info' = {\n alg: alg;\n halg: I.ha;\n min_len: plain_length;\n plain_pkg: plain_pkg min_len id is_safe;\n}\n\nlet info (i:id) =\n info:info'{\n I.ae_id_ginfo i == info.alg /\\\n I.ae_id_ghash i == info.halg\n }\n\n/// Accessors for info\n/// ------------------\n\n// Accessor for the info type.\nlet at_least (#i:id) (u:info i) =\n plain_length_at_least u.min_len\n\nlet plain (#i:id) (u:info i) (l: at_least u) =\n u.plain_pkg.plain i l\n\nlet plain_as_bytes (#i:id) (#u:info i) (#l:at_least u) (p:plain u l) : GTot (Spec.lbytes l) =\n u.plain_pkg.as_bytes i l p\n\nlet plain_repr (#i: unsafe_id) (#u:info i) (#l:at_least u) (p:plain u l) : Tot (r:Spec.lbytes l{r == plain_as_bytes p}) =\n u.plain_pkg.repr i l p\n\n/// Plains, ciphers and entries in the log\n/// --------------------------------------", "dependencies": { "source_file": "Model.AEAD.fsti", "checked_file": "Model.AEAD.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "u66: Model.AEAD.info i -> l: Model.AEAD.at_least u66 -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.id", "Model.AEAD.info", "Model.AEAD.at_least", "Spec.Agile.AEAD.lbytes", "Prims.op_Addition", "FStar.UInt32.v", "Model.AEAD.tag_len" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let cipher (#i: id) (u: info i) (l: at_least u) =", "completed_definiton": "Spec.lbytes (l + UInt32.v tag_len)", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fsti", "name": "Model.AEAD.nonce", "original_source_type": "val nonce:eqtype", "source_type": "val nonce:eqtype", "source_definition": "let nonce : eqtype = b:Seq.seq UInt8.t{Seq.length b == 12}", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 100, "start_col": 21, "end_line": 100, "end_col": 58 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\n\n/// Abbreviations for idealization\n/// ------------------------------\n\n// In this module, id is an AEAD id.\nlet id = I.ae_id\n\n// ea = encryption alg\nlet alg = I.ea\n\nlet is_safe i =\n I.ideal_AEAD && I.is_ae_honest i\n\nlet safe_id =\n i:id{is_safe i}\n\nlet unsafe_id =\n i:id{~ (is_safe i)}\n\n/// Some redefinitions, using Spec\n/// ------------------------------\n\n// Trying to follow the conventions: _len for machine lengths,\n// _length for spec (nat) lengths.\nlet tag_len: x:U32.t { forall (a: alg). {:pattern Spec.tag_length a} U32.v x == Spec.tag_length a } =\n 16ul\n\n// This duplicates a fair amount of definitions from Spec.Agile.AEAD, but here\n// the bounds are tighter and force plain texts to not overflow 32 bits once\n// encrypted and tagged.\n//\n// Introducing a minimum length allows making sure that there are enough bytes\n// to sample out of the ciphertext, as the tag can be too small for that purpose\n// for some AEAD ciphersuites.\ntype plain_length = l:nat{l + U32.v tag_len < pow2 32}\ntype plain_length_at_least (lmin: plain_length) = l:plain_length{lmin <= l}\n\n/// Packages, info (?)\n/// ------------------\n\nnoeq\ntype plain_pkg (min_len:plain_length) (idt: eqtype) (safe: idt -> bool) =\n | PlainPkg:\n plain: (i:idt -> plain_length_at_least min_len -> eqtype) ->\n as_bytes: (i:idt -> l:plain_length_at_least min_len -> plain i l -> GTot (Spec.lbytes l)) ->\n repr: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:plain i l -> Tot (b:Spec.lbytes l{b == as_bytes i l p})) ->\n mk: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:Spec.lbytes l -> p':plain i l { as_bytes i l p' == p }) ->\n plain_pkg min_len idt safe\n\nnoeq type info' = {\n alg: alg;\n halg: I.ha;\n min_len: plain_length;\n plain_pkg: plain_pkg min_len id is_safe;\n}\n\nlet info (i:id) =\n info:info'{\n I.ae_id_ginfo i == info.alg /\\\n I.ae_id_ghash i == info.halg\n }\n\n/// Accessors for info\n/// ------------------\n\n// Accessor for the info type.\nlet at_least (#i:id) (u:info i) =\n plain_length_at_least u.min_len\n\nlet plain (#i:id) (u:info i) (l: at_least u) =\n u.plain_pkg.plain i l\n\nlet plain_as_bytes (#i:id) (#u:info i) (#l:at_least u) (p:plain u l) : GTot (Spec.lbytes l) =\n u.plain_pkg.as_bytes i l p\n\nlet plain_repr (#i: unsafe_id) (#u:info i) (#l:at_least u) (p:plain u l) : Tot (r:Spec.lbytes l{r == plain_as_bytes p}) =\n u.plain_pkg.repr i l p\n\n/// Plains, ciphers and entries in the log\n/// --------------------------------------\n\nlet cipher (#i:id) (u:info i) (l:at_least u) =\n Spec.lbytes (l + UInt32.v tag_len)\n\nlet ad #i (u: info i) =\n Spec.ad u.alg", "dependencies": { "source_file": "Model.AEAD.fsti", "checked_file": "Model.AEAD.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.eqtype", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "FStar.UInt8.t", "Prims.eq2", "Prims.int", "FStar.Seq.Base.length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val nonce:eqtype\nlet nonce:eqtype =", "completed_definiton": "b: Seq.seq UInt8.t {Seq.length b == 12}", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fsti", "name": "Model.AEAD.ad", "original_source_type": "", "source_type": "val ad : u68: Model.AEAD.info i -> Type0", "source_definition": "let ad #i (u: info i) =\n Spec.ad u.alg", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 98, "start_col": 2, "end_line": 98, "end_col": 15 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\n\n/// Abbreviations for idealization\n/// ------------------------------\n\n// In this module, id is an AEAD id.\nlet id = I.ae_id\n\n// ea = encryption alg\nlet alg = I.ea\n\nlet is_safe i =\n I.ideal_AEAD && I.is_ae_honest i\n\nlet safe_id =\n i:id{is_safe i}\n\nlet unsafe_id =\n i:id{~ (is_safe i)}\n\n/// Some redefinitions, using Spec\n/// ------------------------------\n\n// Trying to follow the conventions: _len for machine lengths,\n// _length for spec (nat) lengths.\nlet tag_len: x:U32.t { forall (a: alg). {:pattern Spec.tag_length a} U32.v x == Spec.tag_length a } =\n 16ul\n\n// This duplicates a fair amount of definitions from Spec.Agile.AEAD, but here\n// the bounds are tighter and force plain texts to not overflow 32 bits once\n// encrypted and tagged.\n//\n// Introducing a minimum length allows making sure that there are enough bytes\n// to sample out of the ciphertext, as the tag can be too small for that purpose\n// for some AEAD ciphersuites.\ntype plain_length = l:nat{l + U32.v tag_len < pow2 32}\ntype plain_length_at_least (lmin: plain_length) = l:plain_length{lmin <= l}\n\n/// Packages, info (?)\n/// ------------------\n\nnoeq\ntype plain_pkg (min_len:plain_length) (idt: eqtype) (safe: idt -> bool) =\n | PlainPkg:\n plain: (i:idt -> plain_length_at_least min_len -> eqtype) ->\n as_bytes: (i:idt -> l:plain_length_at_least min_len -> plain i l -> GTot (Spec.lbytes l)) ->\n repr: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:plain i l -> Tot (b:Spec.lbytes l{b == as_bytes i l p})) ->\n mk: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:Spec.lbytes l -> p':plain i l { as_bytes i l p' == p }) ->\n plain_pkg min_len idt safe\n\nnoeq type info' = {\n alg: alg;\n halg: I.ha;\n min_len: plain_length;\n plain_pkg: plain_pkg min_len id is_safe;\n}\n\nlet info (i:id) =\n info:info'{\n I.ae_id_ginfo i == info.alg /\\\n I.ae_id_ghash i == info.halg\n }\n\n/// Accessors for info\n/// ------------------\n\n// Accessor for the info type.\nlet at_least (#i:id) (u:info i) =\n plain_length_at_least u.min_len\n\nlet plain (#i:id) (u:info i) (l: at_least u) =\n u.plain_pkg.plain i l\n\nlet plain_as_bytes (#i:id) (#u:info i) (#l:at_least u) (p:plain u l) : GTot (Spec.lbytes l) =\n u.plain_pkg.as_bytes i l p\n\nlet plain_repr (#i: unsafe_id) (#u:info i) (#l:at_least u) (p:plain u l) : Tot (r:Spec.lbytes l{r == plain_as_bytes p}) =\n u.plain_pkg.repr i l p\n\n/// Plains, ciphers and entries in the log\n/// --------------------------------------\n\nlet cipher (#i:id) (u:info i) (l:at_least u) =\n Spec.lbytes (l + UInt32.v tag_len)", "dependencies": { "source_file": "Model.AEAD.fsti", "checked_file": "Model.AEAD.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "u68: Model.AEAD.info i -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.id", "Model.AEAD.info", "Spec.Agile.AEAD.ad", "Model.AEAD.__proj__Mkinfo'__item__alg" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let ad #i (u: info i) =", "completed_definiton": "Spec.ad u.alg", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fsti", "name": "Model.AEAD.plain_repr", "original_source_type": "val plain_repr (#i: unsafe_id) (#u: info i) (#l: at_least u) (p: plain u l)\n : Tot (r: Spec.lbytes l {r == plain_as_bytes p})", "source_type": "val plain_repr (#i: unsafe_id) (#u: info i) (#l: at_least u) (p: plain u l)\n : Tot (r: Spec.lbytes l {r == plain_as_bytes p})", "source_definition": "let plain_repr (#i: unsafe_id) (#u:info i) (#l:at_least u) (p:plain u l) : Tot (r:Spec.lbytes l{r == plain_as_bytes p}) =\n u.plain_pkg.repr i l p", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 89, "start_col": 2, "end_line": 89, "end_col": 24 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\n\n/// Abbreviations for idealization\n/// ------------------------------\n\n// In this module, id is an AEAD id.\nlet id = I.ae_id\n\n// ea = encryption alg\nlet alg = I.ea\n\nlet is_safe i =\n I.ideal_AEAD && I.is_ae_honest i\n\nlet safe_id =\n i:id{is_safe i}\n\nlet unsafe_id =\n i:id{~ (is_safe i)}\n\n/// Some redefinitions, using Spec\n/// ------------------------------\n\n// Trying to follow the conventions: _len for machine lengths,\n// _length for spec (nat) lengths.\nlet tag_len: x:U32.t { forall (a: alg). {:pattern Spec.tag_length a} U32.v x == Spec.tag_length a } =\n 16ul\n\n// This duplicates a fair amount of definitions from Spec.Agile.AEAD, but here\n// the bounds are tighter and force plain texts to not overflow 32 bits once\n// encrypted and tagged.\n//\n// Introducing a minimum length allows making sure that there are enough bytes\n// to sample out of the ciphertext, as the tag can be too small for that purpose\n// for some AEAD ciphersuites.\ntype plain_length = l:nat{l + U32.v tag_len < pow2 32}\ntype plain_length_at_least (lmin: plain_length) = l:plain_length{lmin <= l}\n\n/// Packages, info (?)\n/// ------------------\n\nnoeq\ntype plain_pkg (min_len:plain_length) (idt: eqtype) (safe: idt -> bool) =\n | PlainPkg:\n plain: (i:idt -> plain_length_at_least min_len -> eqtype) ->\n as_bytes: (i:idt -> l:plain_length_at_least min_len -> plain i l -> GTot (Spec.lbytes l)) ->\n repr: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:plain i l -> Tot (b:Spec.lbytes l{b == as_bytes i l p})) ->\n mk: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:Spec.lbytes l -> p':plain i l { as_bytes i l p' == p }) ->\n plain_pkg min_len idt safe\n\nnoeq type info' = {\n alg: alg;\n halg: I.ha;\n min_len: plain_length;\n plain_pkg: plain_pkg min_len id is_safe;\n}\n\nlet info (i:id) =\n info:info'{\n I.ae_id_ginfo i == info.alg /\\\n I.ae_id_ghash i == info.halg\n }\n\n/// Accessors for info\n/// ------------------\n\n// Accessor for the info type.\nlet at_least (#i:id) (u:info i) =\n plain_length_at_least u.min_len\n\nlet plain (#i:id) (u:info i) (l: at_least u) =\n u.plain_pkg.plain i l\n\nlet plain_as_bytes (#i:id) (#u:info i) (#l:at_least u) (p:plain u l) : GTot (Spec.lbytes l) =\n u.plain_pkg.as_bytes i l p", "dependencies": { "source_file": "Model.AEAD.fsti", "checked_file": "Model.AEAD.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "p: Model.AEAD.plain u63 l -> r: Spec.Agile.AEAD.lbytes l {r == Model.AEAD.plain_as_bytes p}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.unsafe_id", "Model.AEAD.info", "Model.AEAD.at_least", "Model.AEAD.plain", "Model.AEAD.__proj__PlainPkg__item__repr", "Model.AEAD.__proj__Mkinfo'__item__min_len", "Model.AEAD.id", "Model.AEAD.is_safe", "Model.AEAD.__proj__Mkinfo'__item__plain_pkg", "Spec.Agile.AEAD.lbytes", "Prims.eq2", "Model.AEAD.plain_as_bytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val plain_repr (#i: unsafe_id) (#u: info i) (#l: at_least u) (p: plain u l)\n : Tot (r: Spec.lbytes l {r == plain_as_bytes p})\nlet plain_repr (#i: unsafe_id) (#u: info i) (#l: at_least u) (p: plain u l)\n : Tot (r: Spec.lbytes l {r == plain_as_bytes p}) =", "completed_definiton": "u.plain_pkg.repr i l p", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fsti", "name": "Model.AEAD.tag_len", "original_source_type": "val tag_len:x: U32.t{forall (a: alg). {:pattern Spec.tag_length a} U32.v x == Spec.tag_length a}", "source_type": "val tag_len:x: U32.t{forall (a: alg). {:pattern Spec.tag_length a} U32.v x == Spec.tag_length a}", "source_definition": "let tag_len: x:U32.t { forall (a: alg). {:pattern Spec.tag_length a} U32.v x == Spec.tag_length a } =\n 16ul", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 38, "start_col": 2, "end_line": 38, "end_col": 6 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\n\n/// Abbreviations for idealization\n/// ------------------------------\n\n// In this module, id is an AEAD id.\nlet id = I.ae_id\n\n// ea = encryption alg\nlet alg = I.ea\n\nlet is_safe i =\n I.ideal_AEAD && I.is_ae_honest i\n\nlet safe_id =\n i:id{is_safe i}\n\nlet unsafe_id =\n i:id{~ (is_safe i)}\n\n/// Some redefinitions, using Spec\n/// ------------------------------\n\n// Trying to follow the conventions: _len for machine lengths,\n// _length for spec (nat) lengths.", "dependencies": { "source_file": "Model.AEAD.fsti", "checked_file": "Model.AEAD.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x:\nFStar.UInt32.t\n { forall (a: Model.AEAD.alg). {:pattern Spec.Agile.AEAD.tag_length a}\n FStar.UInt32.v x == Spec.Agile.AEAD.tag_length a }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.__uint_to_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val tag_len:x: U32.t{forall (a: alg). {:pattern Spec.tag_length a} U32.v x == Spec.tag_length a}\nlet tag_len:x: U32.t{forall (a: alg). {:pattern Spec.tag_length a} U32.v x == Spec.tag_length a} =", "completed_definiton": "16ul", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fsti", "name": "Model.AEAD.fresh_nonce_snoc", "original_source_type": "val fresh_nonce_snoc\n (#i: safe_id)\n (w: aead_writer i)\n (h h': mem)\n (n1: nonce)\n (aad: ad (wgetinfo w))\n (l: at_least (wgetinfo w))\n (p: plain (wgetinfo w) l)\n (c: cipher (wgetinfo w) l)\n (n: nonce)\n : Lemma\n ((fresh_nonce w n h /\\ n1 <> n /\\ wlog w h' == Seq.snoc (wlog w h) (Entry n1 aad p c)) ==>\n fresh_nonce w n h')", "source_type": "val fresh_nonce_snoc\n (#i: safe_id)\n (w: aead_writer i)\n (h h': mem)\n (n1: nonce)\n (aad: ad (wgetinfo w))\n (l: at_least (wgetinfo w))\n (p: plain (wgetinfo w) l)\n (c: cipher (wgetinfo w) l)\n (n: nonce)\n : Lemma\n ((fresh_nonce w n h /\\ n1 <> n /\\ wlog w h' == Seq.snoc (wlog w h) (Entry n1 aad p c)) ==>\n fresh_nonce w n h')", "source_definition": "let fresh_nonce_snoc\n (#i:safe_id) (w:aead_writer i) (h h' :mem)\n (n1: nonce)\n (aad: ad (wgetinfo w))\n (l: at_least (wgetinfo w))\n (p: plain (wgetinfo w) l)\n (c: cipher (wgetinfo w) l)\n (n:nonce)\n: Lemma\n ((fresh_nonce w n h /\\ n1 <> n /\\ wlog w h' == Seq.snoc (wlog w h) (Entry n1 aad p c)) ==> fresh_nonce w n h')\n= Seq.find_snoc (wlog w h) (Entry n1 aad p c) (nonce_filter #i w n)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 238, "start_col": 2, "end_line": 238, "end_col": 67 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\n\n/// Abbreviations for idealization\n/// ------------------------------\n\n// In this module, id is an AEAD id.\nlet id = I.ae_id\n\n// ea = encryption alg\nlet alg = I.ea\n\nlet is_safe i =\n I.ideal_AEAD && I.is_ae_honest i\n\nlet safe_id =\n i:id{is_safe i}\n\nlet unsafe_id =\n i:id{~ (is_safe i)}\n\n/// Some redefinitions, using Spec\n/// ------------------------------\n\n// Trying to follow the conventions: _len for machine lengths,\n// _length for spec (nat) lengths.\nlet tag_len: x:U32.t { forall (a: alg). {:pattern Spec.tag_length a} U32.v x == Spec.tag_length a } =\n 16ul\n\n// This duplicates a fair amount of definitions from Spec.Agile.AEAD, but here\n// the bounds are tighter and force plain texts to not overflow 32 bits once\n// encrypted and tagged.\n//\n// Introducing a minimum length allows making sure that there are enough bytes\n// to sample out of the ciphertext, as the tag can be too small for that purpose\n// for some AEAD ciphersuites.\ntype plain_length = l:nat{l + U32.v tag_len < pow2 32}\ntype plain_length_at_least (lmin: plain_length) = l:plain_length{lmin <= l}\n\n/// Packages, info (?)\n/// ------------------\n\nnoeq\ntype plain_pkg (min_len:plain_length) (idt: eqtype) (safe: idt -> bool) =\n | PlainPkg:\n plain: (i:idt -> plain_length_at_least min_len -> eqtype) ->\n as_bytes: (i:idt -> l:plain_length_at_least min_len -> plain i l -> GTot (Spec.lbytes l)) ->\n repr: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:plain i l -> Tot (b:Spec.lbytes l{b == as_bytes i l p})) ->\n mk: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:Spec.lbytes l -> p':plain i l { as_bytes i l p' == p }) ->\n plain_pkg min_len idt safe\n\nnoeq type info' = {\n alg: alg;\n halg: I.ha;\n min_len: plain_length;\n plain_pkg: plain_pkg min_len id is_safe;\n}\n\nlet info (i:id) =\n info:info'{\n I.ae_id_ginfo i == info.alg /\\\n I.ae_id_ghash i == info.halg\n }\n\n/// Accessors for info\n/// ------------------\n\n// Accessor for the info type.\nlet at_least (#i:id) (u:info i) =\n plain_length_at_least u.min_len\n\nlet plain (#i:id) (u:info i) (l: at_least u) =\n u.plain_pkg.plain i l\n\nlet plain_as_bytes (#i:id) (#u:info i) (#l:at_least u) (p:plain u l) : GTot (Spec.lbytes l) =\n u.plain_pkg.as_bytes i l p\n\nlet plain_repr (#i: unsafe_id) (#u:info i) (#l:at_least u) (p:plain u l) : Tot (r:Spec.lbytes l{r == plain_as_bytes p}) =\n u.plain_pkg.repr i l p\n\n/// Plains, ciphers and entries in the log\n/// --------------------------------------\n\nlet cipher (#i:id) (u:info i) (l:at_least u) =\n Spec.lbytes (l + UInt32.v tag_len)\n\nlet ad #i (u: info i) =\n Spec.ad u.alg\n\nlet nonce : eqtype = b:Seq.seq UInt8.t{Seq.length b == 12}\n\nnoeq\ntype entry (i:id) (u:info i) =\n | Entry:\n n: nonce ->\n ad: ad u ->\n #l: at_least u ->\n p: plain u l ->\n c: cipher u l ->\n entry i u\n\n/// Readers & writers\n/// -----------------\n\nval aead_writer: i:id -> Type u#1\nval aead_reader: #i:id -> w:aead_writer i -> Type u#1\n\nval wgetinfo: #i:id -> aead_writer i -> Tot (info i)\nval rgetinfo: #i:id -> #w:aead_writer i -> aead_reader w -> Tot (u:info i{u == wgetinfo w})\n\nval wlog: #i:safe_id -> w:aead_writer i -> mem -> GTot (Seq.seq (entry i (wgetinfo w)))\nlet rlog (#i:safe_id) (#w: aead_writer i) (r:aead_reader w) (h:mem) = wlog w h\n\nval wkey: #i:unsafe_id -> w:aead_writer i -> Tot (Spec.kv (wgetinfo w).alg)\n\nval wfootprint: #i:id -> aead_writer i -> GTot B.loc\n\nval winvariant : #i:id -> aead_writer i -> mem -> Type0\n//let rinvariant (#i:I.id) (#w:aead_writer i) (r:aead_reader w) (h:mem) =\n// winvariant w h\n\nval wframe_invariant: #i:id -> l:B.loc -> w:aead_writer i -> h0:mem -> h1:mem ->\n Lemma\n (requires (\n winvariant w h0 /\\\n B.modifies l h0 h1 /\\\n B.loc_disjoint l (wfootprint w)))\n (ensures\n winvariant w h1)\n\nval frame_log: #i:safe_id -> l:B.loc -> w:aead_writer i -> h0:mem -> h1:mem ->\n Lemma\n (requires\n winvariant w h0 /\\\n B.modifies l h0 h1 /\\\n B.loc_disjoint l (wfootprint w))\n (ensures wlog w h1 == wlog w h0)\n\n/// Derivation (QUIC-specific)\n\nlet lemma_max_hash_len ha\n : Lemma (Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (if Some? (Spec.Hash.Definitions.max_input_length ha) then\n Some?.v (Spec.Hash.Definitions.max_input_length ha) >= pow2 61 - 1\n else\n True) /\\\n pow2 61 - 1 > 64)\n [SMTPat (Spec.Hash.Definitions.hash_length ha)]\n =\n assert_norm (pow2 61 < pow2 125);\n assert_norm (pow2 61 - 1 > 64);\n assert_norm (pow2 64 > pow2 61);\n assert_norm (pow2 128 > pow2 64)\n\nlet traffic_secret ha =\n Spec.lbytes (Spec.Hash.Definitions.hash_length ha)\n\n/// Main stateful API\n/// -----------------\n\n(** Allocating a writer **)\nval gen (i:id) (u:info i) : ST (aead_writer i)\n (requires (fun h -> True))\n (ensures (fun h0 w h1 ->\n winvariant w h1 /\\\n\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (wfootprint w) h0 h1 /\\\n B.(loc_includes (loc_ae_region ()) (wfootprint w)) /\\\n\n wgetinfo w == u /\\\n (I.ideal_AEAD && I.is_ae_honest i ==> wlog w h1 == Seq.empty)))\n\n(** Building a reader from a writer **)\nval gen_reader (#i: id) (w: aead_writer i) : ST (aead_reader w)\n (requires (fun h -> winvariant w h))\n (ensures (fun h0 r h1 -> h0 == h1))\n\nval coerce (#i:unsafe_id) (u:info i)\n (kv:Spec.kv u.alg)\n : ST (aead_writer i)\n (requires fun h0 -> True)\n (ensures fun h0 w h1 ->\n winvariant w h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (wfootprint w) h0 h1 /\\\n B.(loc_includes (loc_ae_region ()) (wfootprint w)) /\\\n wgetinfo w == u /\\\n wkey w == kv\n )\n\nval quic_coerce (#i:unsafe_id) (u:info i)\n (ts:traffic_secret u.halg)\n : ST (aead_writer i)\n (requires fun h0 -> True)\n (ensures fun h0 w h1 ->\n winvariant w h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (wfootprint w) h0 h1 /\\\n B.(loc_includes (loc_ae_region ()) (wfootprint w)) /\\\n wgetinfo w == u /\\\n wkey w ==\n QUIC.Spec.derive_secret u.halg ts\n QUIC.Spec.label_key (Spec.key_length u.alg)\n )\n\nlet nonce_filter (#i:id) (w:aead_writer i) (n:nonce) (e:entry i (wgetinfo w)) : bool =\n Entry?.n e = n\n\nlet wentry_for_nonce (#i:safe_id) (w:aead_writer i) (n:nonce) (h:mem)\n : GTot (option (entry i (wgetinfo w))) =\n Seq.find_l (nonce_filter #i w n) (wlog w h)\n\nlet fresh_nonce (#i:safe_id) (w:aead_writer i) (n:nonce) (h:mem)\n : GTot bool =\n None? (wentry_for_nonce w n h)\n\nlet fresh_nonce_snoc\n (#i:safe_id) (w:aead_writer i) (h h' :mem)\n (n1: nonce)\n (aad: ad (wgetinfo w))\n (l: at_least (wgetinfo w))\n (p: plain (wgetinfo w) l)\n (c: cipher (wgetinfo w) l)\n (n:nonce)\n: Lemma", "dependencies": { "source_file": "Model.AEAD.fsti", "checked_file": "Model.AEAD.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n w: Model.AEAD.aead_writer i ->\n h: FStar.Monotonic.HyperStack.mem ->\n h': FStar.Monotonic.HyperStack.mem ->\n n1: Model.AEAD.nonce ->\n aad: Model.AEAD.ad (Model.AEAD.wgetinfo w) ->\n l: Model.AEAD.at_least (Model.AEAD.wgetinfo w) ->\n p: Model.AEAD.plain (Model.AEAD.wgetinfo w) l ->\n c: Model.AEAD.cipher (Model.AEAD.wgetinfo w) l ->\n n: Model.AEAD.nonce\n -> FStar.Pervasives.Lemma\n (ensures\n Model.AEAD.fresh_nonce w n h /\\ n1 <> n /\\\n Model.AEAD.wlog w h' ==\n FStar.Seq.Properties.snoc (Model.AEAD.wlog w h) (Model.AEAD.Entry n1 aad p c) ==>\n Model.AEAD.fresh_nonce w n h')", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Model.AEAD.safe_id", "Model.AEAD.aead_writer", "FStar.Monotonic.HyperStack.mem", "Model.AEAD.nonce", "Model.AEAD.ad", "Model.AEAD.wgetinfo", "Model.AEAD.at_least", "Model.AEAD.plain", "Model.AEAD.cipher", "FStar.Seq.Properties.find_snoc", "Model.AEAD.entry", "Model.AEAD.wlog", "Model.AEAD.Entry", "Model.AEAD.nonce_filter", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.l_imp", "Prims.l_and", "Prims.b2t", "Model.AEAD.fresh_nonce", "Prims.op_disEquality", "Prims.eq2", "FStar.Seq.Base.seq", "FStar.Seq.Properties.snoc", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val fresh_nonce_snoc\n (#i: safe_id)\n (w: aead_writer i)\n (h h': mem)\n (n1: nonce)\n (aad: ad (wgetinfo w))\n (l: at_least (wgetinfo w))\n (p: plain (wgetinfo w) l)\n (c: cipher (wgetinfo w) l)\n (n: nonce)\n : Lemma\n ((fresh_nonce w n h /\\ n1 <> n /\\ wlog w h' == Seq.snoc (wlog w h) (Entry n1 aad p c)) ==>\n fresh_nonce w n h')\nlet fresh_nonce_snoc\n (#i: safe_id)\n (w: aead_writer i)\n (h h': mem)\n (n1: nonce)\n (aad: ad (wgetinfo w))\n (l: at_least (wgetinfo w))\n (p: plain (wgetinfo w) l)\n (c: cipher (wgetinfo w) l)\n (n: nonce)\n : Lemma\n ((fresh_nonce w n h /\\ n1 <> n /\\ wlog w h' == Seq.snoc (wlog w h) (Entry n1 aad p c)) ==>\n fresh_nonce w n h') =", "completed_definiton": "Seq.find_snoc (wlog w h) (Entry n1 aad p c) (nonce_filter #i w n)", "isa_cross_project_example": true }, { "file_name": "Model.AEAD.fsti", "name": "Model.AEAD.lemma_max_hash_len", "original_source_type": "val lemma_max_hash_len (ha: _)\n : Lemma\n (Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (if Some? (Spec.Hash.Definitions.max_input_length ha)\n then Some?.v (Spec.Hash.Definitions.max_input_length ha) >= pow2 61 - 1\n else True) /\\ pow2 61 - 1 > 64) [SMTPat (Spec.Hash.Definitions.hash_length ha)]", "source_type": "val lemma_max_hash_len (ha: _)\n : Lemma\n (Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (if Some? (Spec.Hash.Definitions.max_input_length ha)\n then Some?.v (Spec.Hash.Definitions.max_input_length ha) >= pow2 61 - 1\n else True) /\\ pow2 61 - 1 > 64) [SMTPat (Spec.Hash.Definitions.hash_length ha)]", "source_definition": "let lemma_max_hash_len ha\n : Lemma (Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (if Some? (Spec.Hash.Definitions.max_input_length ha) then\n Some?.v (Spec.Hash.Definitions.max_input_length ha) >= pow2 61 - 1\n else\n True) /\\\n pow2 61 - 1 > 64)\n [SMTPat (Spec.Hash.Definitions.hash_length ha)]\n =\n assert_norm (pow2 61 < pow2 125);\n assert_norm (pow2 61 - 1 > 64);\n assert_norm (pow2 64 > pow2 61);\n assert_norm (pow2 128 > pow2 64)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.AEAD.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 160, "start_col": 2, "end_line": 163, "end_col": 34 }, "file_context": "module Model.AEAD\n\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule B = LowStar.Buffer\nmodule Spec = Spec.Agile.AEAD\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen Mem\n\n/// Abbreviations for idealization\n/// ------------------------------\n\n// In this module, id is an AEAD id.\nlet id = I.ae_id\n\n// ea = encryption alg\nlet alg = I.ea\n\nlet is_safe i =\n I.ideal_AEAD && I.is_ae_honest i\n\nlet safe_id =\n i:id{is_safe i}\n\nlet unsafe_id =\n i:id{~ (is_safe i)}\n\n/// Some redefinitions, using Spec\n/// ------------------------------\n\n// Trying to follow the conventions: _len for machine lengths,\n// _length for spec (nat) lengths.\nlet tag_len: x:U32.t { forall (a: alg). {:pattern Spec.tag_length a} U32.v x == Spec.tag_length a } =\n 16ul\n\n// This duplicates a fair amount of definitions from Spec.Agile.AEAD, but here\n// the bounds are tighter and force plain texts to not overflow 32 bits once\n// encrypted and tagged.\n//\n// Introducing a minimum length allows making sure that there are enough bytes\n// to sample out of the ciphertext, as the tag can be too small for that purpose\n// for some AEAD ciphersuites.\ntype plain_length = l:nat{l + U32.v tag_len < pow2 32}\ntype plain_length_at_least (lmin: plain_length) = l:plain_length{lmin <= l}\n\n/// Packages, info (?)\n/// ------------------\n\nnoeq\ntype plain_pkg (min_len:plain_length) (idt: eqtype) (safe: idt -> bool) =\n | PlainPkg:\n plain: (i:idt -> plain_length_at_least min_len -> eqtype) ->\n as_bytes: (i:idt -> l:plain_length_at_least min_len -> plain i l -> GTot (Spec.lbytes l)) ->\n repr: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:plain i l -> Tot (b:Spec.lbytes l{b == as_bytes i l p})) ->\n mk: (i:idt{not (safe i)} -> l:plain_length_at_least min_len -> p:Spec.lbytes l -> p':plain i l { as_bytes i l p' == p }) ->\n plain_pkg min_len idt safe\n\nnoeq type info' = {\n alg: alg;\n halg: I.ha;\n min_len: plain_length;\n plain_pkg: plain_pkg min_len id is_safe;\n}\n\nlet info (i:id) =\n info:info'{\n I.ae_id_ginfo i == info.alg /\\\n I.ae_id_ghash i == info.halg\n }\n\n/// Accessors for info\n/// ------------------\n\n// Accessor for the info type.\nlet at_least (#i:id) (u:info i) =\n plain_length_at_least u.min_len\n\nlet plain (#i:id) (u:info i) (l: at_least u) =\n u.plain_pkg.plain i l\n\nlet plain_as_bytes (#i:id) (#u:info i) (#l:at_least u) (p:plain u l) : GTot (Spec.lbytes l) =\n u.plain_pkg.as_bytes i l p\n\nlet plain_repr (#i: unsafe_id) (#u:info i) (#l:at_least u) (p:plain u l) : Tot (r:Spec.lbytes l{r == plain_as_bytes p}) =\n u.plain_pkg.repr i l p\n\n/// Plains, ciphers and entries in the log\n/// --------------------------------------\n\nlet cipher (#i:id) (u:info i) (l:at_least u) =\n Spec.lbytes (l + UInt32.v tag_len)\n\nlet ad #i (u: info i) =\n Spec.ad u.alg\n\nlet nonce : eqtype = b:Seq.seq UInt8.t{Seq.length b == 12}\n\nnoeq\ntype entry (i:id) (u:info i) =\n | Entry:\n n: nonce ->\n ad: ad u ->\n #l: at_least u ->\n p: plain u l ->\n c: cipher u l ->\n entry i u\n\n/// Readers & writers\n/// -----------------\n\nval aead_writer: i:id -> Type u#1\nval aead_reader: #i:id -> w:aead_writer i -> Type u#1\n\nval wgetinfo: #i:id -> aead_writer i -> Tot (info i)\nval rgetinfo: #i:id -> #w:aead_writer i -> aead_reader w -> Tot (u:info i{u == wgetinfo w})\n\nval wlog: #i:safe_id -> w:aead_writer i -> mem -> GTot (Seq.seq (entry i (wgetinfo w)))\nlet rlog (#i:safe_id) (#w: aead_writer i) (r:aead_reader w) (h:mem) = wlog w h\n\nval wkey: #i:unsafe_id -> w:aead_writer i -> Tot (Spec.kv (wgetinfo w).alg)\n\nval wfootprint: #i:id -> aead_writer i -> GTot B.loc\n\nval winvariant : #i:id -> aead_writer i -> mem -> Type0\n//let rinvariant (#i:I.id) (#w:aead_writer i) (r:aead_reader w) (h:mem) =\n// winvariant w h\n\nval wframe_invariant: #i:id -> l:B.loc -> w:aead_writer i -> h0:mem -> h1:mem ->\n Lemma\n (requires (\n winvariant w h0 /\\\n B.modifies l h0 h1 /\\\n B.loc_disjoint l (wfootprint w)))\n (ensures\n winvariant w h1)\n\nval frame_log: #i:safe_id -> l:B.loc -> w:aead_writer i -> h0:mem -> h1:mem ->\n Lemma\n (requires\n winvariant w h0 /\\\n B.modifies l h0 h1 /\\\n B.loc_disjoint l (wfootprint w))\n (ensures wlog w h1 == wlog w h0)\n\n/// Derivation (QUIC-specific)\n\nlet lemma_max_hash_len ha\n : Lemma (Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (if Some? (Spec.Hash.Definitions.max_input_length ha) then\n Some?.v (Spec.Hash.Definitions.max_input_length ha) >= pow2 61 - 1\n else\n True) /\\\n pow2 61 - 1 > 64)\n [SMTPat (Spec.Hash.Definitions.hash_length ha)]", "dependencies": { "source_file": "Model.AEAD.fsti", "checked_file": "Model.AEAD.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "ha: a: Spec.Hash.Definitions.hash_alg{Prims.op_Negation (Spec.Hash.Definitions.is_shake a)}\n -> FStar.Pervasives.Lemma\n (ensures\n Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (match Some? (Spec.Hash.Definitions.max_input_length ha) with\n | true -> Some?.v (Spec.Hash.Definitions.max_input_length ha) >= Prims.pow2 61 - 1\n | _ -> Prims.l_True) /\\ Prims.pow2 61 - 1 > 64)\n [SMTPat (Spec.Hash.Definitions.hash_length ha)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Spec.Hash.Definitions.hash_alg", "Prims.b2t", "Prims.op_Negation", "Spec.Hash.Definitions.is_shake", "FStar.Pervasives.assert_norm", "Prims.op_GreaterThan", "Prims.pow2", "Prims.unit", "Prims.op_Subtraction", "Prims.op_LessThan", "Prims.l_True", "Prims.squash", "Prims.l_and", "Prims.op_LessThanOrEqual", "Spec.Hash.Definitions.hash_length", "FStar.Pervasives.Native.uu___is_Some", "Prims.pos", "Spec.Hash.Definitions.max_input_length", "Prims.op_GreaterThanOrEqual", "FStar.Pervasives.Native.__proj__Some__item__v", "Prims.bool", "Prims.logical", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Lib.IntTypes.size_nat", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_max_hash_len (ha: _)\n : Lemma\n (Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (if Some? (Spec.Hash.Definitions.max_input_length ha)\n then Some?.v (Spec.Hash.Definitions.max_input_length ha) >= pow2 61 - 1\n else True) /\\ pow2 61 - 1 > 64) [SMTPat (Spec.Hash.Definitions.hash_length ha)]\nlet lemma_max_hash_len ha\n : Lemma\n (Spec.Hash.Definitions.hash_length ha <= 64 /\\\n (if Some? (Spec.Hash.Definitions.max_input_length ha)\n then Some?.v (Spec.Hash.Definitions.max_input_length ha) >= pow2 61 - 1\n else True) /\\ pow2 61 - 1 > 64) [SMTPat (Spec.Hash.Definitions.hash_length ha)] =", "completed_definiton": "assert_norm (pow2 61 < pow2 125);\nassert_norm (pow2 61 - 1 > 64);\nassert_norm (pow2 64 > pow2 61);\nassert_norm (pow2 128 > pow2 64)", "isa_cross_project_example": true }, { "file_name": "Model.Flags.fst", "name": "Model.Flags.ideal_AEAD", "original_source_type": "val ideal_AEAD : f:ideal_flag{b2t f ==> b2t ideal_TS}", "source_type": "val ideal_AEAD : f:ideal_flag{b2t f ==> b2t ideal_TS}", "source_definition": "let ideal_AEAD = false", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.Flags.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 5, "start_col": 39, "end_line": 5, "end_col": 44 }, "file_context": "module Model.Flags\n\ninline_for_extraction let model = false", "dependencies": { "source_file": "Model.Flags.fst", "checked_file": "Model.Flags.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "f: Model.Flags.ideal_flag{f ==> Model.Flags.ideal_TS}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ideal_AEAD : f:ideal_flag{b2t f ==> b2t ideal_TS}\nlet ideal_AEAD =", "completed_definiton": "false", "isa_cross_project_example": true }, { "file_name": "Model.Flags.fst", "name": "Model.Flags.model", "original_source_type": "val model : bool", "source_type": "val model : bool", "source_definition": "let model = false", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.Flags.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 3, "start_col": 34, "end_line": 3, "end_col": 39 }, "file_context": "module Model.Flags", "dependencies": { "source_file": "Model.Flags.fst", "checked_file": "Model.Flags.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val model : bool\nlet model =", "completed_definiton": "false", "isa_cross_project_example": true }, { "file_name": "Model.Flags.fst", "name": "Model.Flags.ideal_TS", "original_source_type": "val ideal_TS: ideal_flag", "source_type": "val ideal_TS: ideal_flag", "source_definition": "let ideal_TS = false", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.Flags.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 4, "start_col": 37, "end_line": 4, "end_col": 42 }, "file_context": "module Model.Flags", "dependencies": { "source_file": "Model.Flags.fst", "checked_file": "Model.Flags.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Model.Flags.ideal_flag", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val ideal_TS: ideal_flag\nlet ideal_TS =", "completed_definiton": "false", "isa_cross_project_example": true }, { "file_name": "Model.Flags.fst", "name": "Model.Flags.ideal_PNE", "original_source_type": "val ideal_PNE : f:ideal_flag{b2t f <==> b2t ideal_AEAD}", "source_type": "val ideal_PNE : f:ideal_flag{b2t f <==> b2t ideal_AEAD}", "source_definition": "let ideal_PNE = false", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.Flags.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 6, "start_col": 38, "end_line": 6, "end_col": 43 }, "file_context": "module Model.Flags\n\ninline_for_extraction let model = false\ninline_for_extraction let ideal_TS = false", "dependencies": { "source_file": "Model.Flags.fst", "checked_file": "Model.Flags.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "f: Model.Flags.ideal_flag{f <==> Model.Flags.ideal_AEAD}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val ideal_PNE : f:ideal_flag{b2t f <==> b2t ideal_AEAD}\nlet ideal_PNE =", "completed_definiton": "false", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Seq.fst", "name": "QUIC.Secret.Seq.seq_reveal", "original_source_type": "val seq_reveal\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n: GTot (seq (Secret.uint_t t Secret.PUB))", "source_type": "val seq_reveal\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n: GTot (seq (Secret.uint_t t Secret.PUB))", "source_definition": "let seq_reveal\n #t #sec x\n= seq_gmap (uint_reveal t sec Secret.PUB) x", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Seq.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 83, "start_col": 2, "end_line": 83, "end_col": 43 }, "file_context": "module QUIC.Secret.Seq\nopen FStar.Seq\n\nmodule Secret = QUIC.Secret.Int\nmodule U8 = FStar.UInt8\nmodule Ghost = FStar.Ghost\n\n(* NOTE: abstraction is NOT broken here *)\n\nnoextract\nlet rec seq_map\n (#t1 #t2: Type)\n (f: (t1 -> Tot t2))\n (x: seq t1)\n: Tot (lseq t2 (length x))\n (decreases (length x))\n= if length x = 0\n then empty\n else cons (f (head x)) (seq_map f (tail x))\n\nlet rec seq_map_index\n (#t1 #t2: Type)\n (f: (t1 -> Tot t2))\n (x: seq t1)\n (i: nat { i < length x })\n: Lemma\n (ensures (index (seq_map f x) i == f (index x i)))\n (decreases (length x))\n [SMTPat (index (seq_map f x) i)]\n= if i = 0\n then ()\n else seq_map_index f (tail x) (i - 1)\n\nlet seq_hide\n #t x\n= seq_map (Secret.cast t Secret.SEC) x\n\nlet seq_hide_length\n #t x\n= ()\n\n#push-options \"--z3rlimit 32\"\n\nlet seq_hide_index\n #t x i\n= ()\n\n#pop-options\n\nnoextract\nlet rec seq_gmap\n (#t1 #t2: Type)\n (f: (t1 -> GTot t2))\n (x: seq t1)\n: GTot (lseq t2 (length x))\n (decreases (length x))\n= if length x = 0\n then empty\n else cons (f (head x)) (seq_gmap f (tail x))\n\nlet rec seq_gmap_index\n (#t1 #t2: Type)\n (f: (t1 -> GTot t2))\n (x: seq t1)\n (i: nat { i < length x })\n: Lemma\n (ensures (index (seq_gmap f x) i == f (index x i)))\n (decreases (length x))\n [SMTPat (index (seq_gmap f x) i)]\n= if i = 0\n then ()\n else seq_gmap_index f (tail x) (i - 1)\n\nlet uint_reveal\n (t: Secret.inttype { Secret.unsigned t })\n (sec_from sec_to: Secret.secrecy_level)\n (x: Secret.uint_t t sec_from)\n: GTot (Secret.uint_t t sec_to)\n= Secret.mk_int #t (Secret.v x)\n\nlet seq_reveal", "dependencies": { "source_file": "QUIC.Secret.Seq.fst", "checked_file": "QUIC.Secret.Seq.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: FStar.Seq.Base.seq (Lib.IntTypes.uint_t t sec)\n -> Prims.GTot (FStar.Seq.Base.seq (Lib.IntTypes.uint_t t Lib.IntTypes.PUB))", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "Lib.IntTypes.unsigned", "Lib.IntTypes.secrecy_level", "FStar.Seq.Base.seq", "Lib.IntTypes.uint_t", "QUIC.Secret.Seq.seq_gmap", "Lib.IntTypes.PUB", "QUIC.Secret.Seq.uint_reveal" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val seq_reveal\n (#t: Secret.inttype { Secret.unsigned t })\n (#sec: Secret.secrecy_level)\n (x: seq (Secret.uint_t t sec))\n: GTot (seq (Secret.uint_t t Secret.PUB))\nlet seq_reveal #t #sec x =", "completed_definiton": "seq_gmap (uint_reveal t sec Secret.PUB) x", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Seq.fst", "name": "QUIC.Secret.Seq.uint_reveal", "original_source_type": "val uint_reveal\n (t: Secret.inttype{Secret.unsigned t})\n (sec_from sec_to: Secret.secrecy_level)\n (x: Secret.uint_t t sec_from)\n : GTot (Secret.uint_t t sec_to)", "source_type": "val uint_reveal\n (t: Secret.inttype{Secret.unsigned t})\n (sec_from sec_to: Secret.secrecy_level)\n (x: Secret.uint_t t sec_from)\n : GTot (Secret.uint_t t sec_to)", "source_definition": "let uint_reveal\n (t: Secret.inttype { Secret.unsigned t })\n (sec_from sec_to: Secret.secrecy_level)\n (x: Secret.uint_t t sec_from)\n: GTot (Secret.uint_t t sec_to)\n= Secret.mk_int #t (Secret.v x)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Seq.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 79, "start_col": 2, "end_line": 79, "end_col": 31 }, "file_context": "module QUIC.Secret.Seq\nopen FStar.Seq\n\nmodule Secret = QUIC.Secret.Int\nmodule U8 = FStar.UInt8\nmodule Ghost = FStar.Ghost\n\n(* NOTE: abstraction is NOT broken here *)\n\nnoextract\nlet rec seq_map\n (#t1 #t2: Type)\n (f: (t1 -> Tot t2))\n (x: seq t1)\n: Tot (lseq t2 (length x))\n (decreases (length x))\n= if length x = 0\n then empty\n else cons (f (head x)) (seq_map f (tail x))\n\nlet rec seq_map_index\n (#t1 #t2: Type)\n (f: (t1 -> Tot t2))\n (x: seq t1)\n (i: nat { i < length x })\n: Lemma\n (ensures (index (seq_map f x) i == f (index x i)))\n (decreases (length x))\n [SMTPat (index (seq_map f x) i)]\n= if i = 0\n then ()\n else seq_map_index f (tail x) (i - 1)\n\nlet seq_hide\n #t x\n= seq_map (Secret.cast t Secret.SEC) x\n\nlet seq_hide_length\n #t x\n= ()\n\n#push-options \"--z3rlimit 32\"\n\nlet seq_hide_index\n #t x i\n= ()\n\n#pop-options\n\nnoextract\nlet rec seq_gmap\n (#t1 #t2: Type)\n (f: (t1 -> GTot t2))\n (x: seq t1)\n: GTot (lseq t2 (length x))\n (decreases (length x))\n= if length x = 0\n then empty\n else cons (f (head x)) (seq_gmap f (tail x))\n\nlet rec seq_gmap_index\n (#t1 #t2: Type)\n (f: (t1 -> GTot t2))\n (x: seq t1)\n (i: nat { i < length x })\n: Lemma\n (ensures (index (seq_gmap f x) i == f (index x i)))\n (decreases (length x))\n [SMTPat (index (seq_gmap f x) i)]\n= if i = 0\n then ()\n else seq_gmap_index f (tail x) (i - 1)\n\nlet uint_reveal\n (t: Secret.inttype { Secret.unsigned t })\n (sec_from sec_to: Secret.secrecy_level)\n (x: Secret.uint_t t sec_from)", "dependencies": { "source_file": "QUIC.Secret.Seq.fst", "checked_file": "QUIC.Secret.Seq.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n t: Lib.IntTypes.inttype{Lib.IntTypes.unsigned t} ->\n sec_from: Lib.IntTypes.secrecy_level ->\n sec_to: Lib.IntTypes.secrecy_level ->\n x: Lib.IntTypes.uint_t t sec_from\n -> Prims.GTot (Lib.IntTypes.uint_t t sec_to)", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "Lib.IntTypes.unsigned", "Lib.IntTypes.secrecy_level", "Lib.IntTypes.uint_t", "Lib.IntTypes.mk_int", "QUIC.Secret.Int.Base.v" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val uint_reveal\n (t: Secret.inttype{Secret.unsigned t})\n (sec_from sec_to: Secret.secrecy_level)\n (x: Secret.uint_t t sec_from)\n : GTot (Secret.uint_t t sec_to)\nlet uint_reveal\n (t: Secret.inttype{Secret.unsigned t})\n (sec_from sec_to: Secret.secrecy_level)\n (x: Secret.uint_t t sec_from)\n : GTot (Secret.uint_t t sec_to) =", "completed_definiton": "Secret.mk_int #t (Secret.v x)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Seq.fst", "name": "QUIC.Secret.Seq.seq_hide", "original_source_type": "val seq_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Tot (seq (Secret.uint_t t Secret.SEC))", "source_type": "val seq_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Tot (seq (Secret.uint_t t Secret.SEC))", "source_definition": "let seq_hide\n #t x\n= seq_map (Secret.cast t Secret.SEC) x", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Seq.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 36, "start_col": 2, "end_line": 36, "end_col": 38 }, "file_context": "module QUIC.Secret.Seq\nopen FStar.Seq\n\nmodule Secret = QUIC.Secret.Int\nmodule U8 = FStar.UInt8\nmodule Ghost = FStar.Ghost\n\n(* NOTE: abstraction is NOT broken here *)\n\nnoextract\nlet rec seq_map\n (#t1 #t2: Type)\n (f: (t1 -> Tot t2))\n (x: seq t1)\n: Tot (lseq t2 (length x))\n (decreases (length x))\n= if length x = 0\n then empty\n else cons (f (head x)) (seq_map f (tail x))\n\nlet rec seq_map_index\n (#t1 #t2: Type)\n (f: (t1 -> Tot t2))\n (x: seq t1)\n (i: nat { i < length x })\n: Lemma\n (ensures (index (seq_map f x) i == f (index x i)))\n (decreases (length x))\n [SMTPat (index (seq_map f x) i)]\n= if i = 0\n then ()\n else seq_map_index f (tail x) (i - 1)\n\nlet seq_hide", "dependencies": { "source_file": "QUIC.Secret.Seq.fst", "checked_file": "QUIC.Secret.Seq.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: FStar.Seq.Base.seq (Lib.IntTypes.uint_t t Lib.IntTypes.PUB)\n -> FStar.Seq.Base.seq (Lib.IntTypes.uint_t t Lib.IntTypes.SEC)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "Lib.IntTypes.unsigned", "FStar.Seq.Base.seq", "Lib.IntTypes.uint_t", "Lib.IntTypes.PUB", "QUIC.Secret.Seq.seq_map", "Lib.IntTypes.SEC", "Lib.IntTypes.cast" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val seq_hide\n (#t: Secret.inttype { Secret.unsigned t })\n (x: seq (Secret.uint_t t Secret.PUB))\n: Tot (seq (Secret.uint_t t Secret.SEC))\nlet seq_hide #t x =", "completed_definiton": "seq_map (Secret.cast t Secret.SEC) x", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Seq.fst", "name": "QUIC.Secret.Seq.seq_gmap", "original_source_type": "val seq_gmap (#t1 #t2: Type) (f: (t1 -> GTot t2)) (x: seq t1)\n : GTot (lseq t2 (length x)) (decreases (length x))", "source_type": "val seq_gmap (#t1 #t2: Type) (f: (t1 -> GTot t2)) (x: seq t1)\n : GTot (lseq t2 (length x)) (decreases (length x))", "source_definition": "let rec seq_gmap\n (#t1 #t2: Type)\n (f: (t1 -> GTot t2))\n (x: seq t1)\n: GTot (lseq t2 (length x))\n (decreases (length x))\n= if length x = 0\n then empty\n else cons (f (head x)) (seq_gmap f (tail x))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Seq.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 57, "start_col": 2, "end_line": 59, "end_col": 46 }, "file_context": "module QUIC.Secret.Seq\nopen FStar.Seq\n\nmodule Secret = QUIC.Secret.Int\nmodule U8 = FStar.UInt8\nmodule Ghost = FStar.Ghost\n\n(* NOTE: abstraction is NOT broken here *)\n\nnoextract\nlet rec seq_map\n (#t1 #t2: Type)\n (f: (t1 -> Tot t2))\n (x: seq t1)\n: Tot (lseq t2 (length x))\n (decreases (length x))\n= if length x = 0\n then empty\n else cons (f (head x)) (seq_map f (tail x))\n\nlet rec seq_map_index\n (#t1 #t2: Type)\n (f: (t1 -> Tot t2))\n (x: seq t1)\n (i: nat { i < length x })\n: Lemma\n (ensures (index (seq_map f x) i == f (index x i)))\n (decreases (length x))\n [SMTPat (index (seq_map f x) i)]\n= if i = 0\n then ()\n else seq_map_index f (tail x) (i - 1)\n\nlet seq_hide\n #t x\n= seq_map (Secret.cast t Secret.SEC) x\n\nlet seq_hide_length\n #t x\n= ()\n\n#push-options \"--z3rlimit 32\"\n\nlet seq_hide_index\n #t x i\n= ()\n\n#pop-options\n\nnoextract\nlet rec seq_gmap\n (#t1 #t2: Type)\n (f: (t1 -> GTot t2))\n (x: seq t1)\n: GTot (lseq t2 (length x))", "dependencies": { "source_file": "QUIC.Secret.Seq.fst", "checked_file": "QUIC.Secret.Seq.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "f: (_: t1 -> Prims.GTot t2) -> x: FStar.Seq.Base.seq t1\n -> Prims.GTot (FStar.Seq.Properties.lseq t2 (FStar.Seq.Base.length x))", "effect": "Prims.GTot", "effect_flags": [ "sometrivial", "" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "FStar.Seq.Base.empty", "Prims.bool", "FStar.Seq.Properties.cons", "FStar.Seq.Properties.head", "QUIC.Secret.Seq.seq_gmap", "FStar.Seq.Properties.tail", "FStar.Seq.Properties.lseq" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val seq_gmap (#t1 #t2: Type) (f: (t1 -> GTot t2)) (x: seq t1)\n : GTot (lseq t2 (length x)) (decreases (length x))\nlet rec seq_gmap (#t1 #t2: Type) (f: (t1 -> GTot t2)) (x: seq t1)\n : GTot (lseq t2 (length x)) (decreases (length x)) =", "completed_definiton": "if length x = 0 then empty else cons (f (head x)) (seq_gmap f (tail x))", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Seq.fst", "name": "QUIC.Secret.Seq.seq_map", "original_source_type": "val seq_map (#t1 #t2: Type) (f: (t1 -> Tot t2)) (x: seq t1)\n : Tot (lseq t2 (length x)) (decreases (length x))", "source_type": "val seq_map (#t1 #t2: Type) (f: (t1 -> Tot t2)) (x: seq t1)\n : Tot (lseq t2 (length x)) (decreases (length x))", "source_definition": "let rec seq_map\n (#t1 #t2: Type)\n (f: (t1 -> Tot t2))\n (x: seq t1)\n: Tot (lseq t2 (length x))\n (decreases (length x))\n= if length x = 0\n then empty\n else cons (f (head x)) (seq_map f (tail x))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Seq.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 17, "start_col": 2, "end_line": 19, "end_col": 45 }, "file_context": "module QUIC.Secret.Seq\nopen FStar.Seq\n\nmodule Secret = QUIC.Secret.Int\nmodule U8 = FStar.UInt8\nmodule Ghost = FStar.Ghost\n\n(* NOTE: abstraction is NOT broken here *)\n\nnoextract\nlet rec seq_map\n (#t1 #t2: Type)\n (f: (t1 -> Tot t2))\n (x: seq t1)\n: Tot (lseq t2 (length x))", "dependencies": { "source_file": "QUIC.Secret.Seq.fst", "checked_file": "QUIC.Secret.Seq.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "f: (_: t1 -> t2) -> x: FStar.Seq.Base.seq t1\n -> Prims.Tot (FStar.Seq.Properties.lseq t2 (FStar.Seq.Base.length x))", "effect": "Prims.Tot", "effect_flags": [ "total", "" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "FStar.Seq.Base.empty", "Prims.bool", "FStar.Seq.Properties.cons", "FStar.Seq.Properties.head", "QUIC.Secret.Seq.seq_map", "FStar.Seq.Properties.tail", "FStar.Seq.Properties.lseq" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val seq_map (#t1 #t2: Type) (f: (t1 -> Tot t2)) (x: seq t1)\n : Tot (lseq t2 (length x)) (decreases (length x))\nlet rec seq_map (#t1 #t2: Type) (f: (t1 -> Tot t2)) (x: seq t1)\n : Tot (lseq t2 (length x)) (decreases (length x)) =", "completed_definiton": "if length x = 0 then empty else cons (f (head x)) (seq_map f (tail x))", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Seq.fst", "name": "QUIC.Secret.Seq.seq_map_index", "original_source_type": "val seq_map_index (#t1 #t2: Type) (f: (t1 -> Tot t2)) (x: seq t1) (i: nat{i < length x})\n : Lemma (ensures (index (seq_map f x) i == f (index x i)))\n (decreases (length x))\n [SMTPat (index (seq_map f x) i)]", "source_type": "val seq_map_index (#t1 #t2: Type) (f: (t1 -> Tot t2)) (x: seq t1) (i: nat{i < length x})\n : Lemma (ensures (index (seq_map f x) i == f (index x i)))\n (decreases (length x))\n [SMTPat (index (seq_map f x) i)]", "source_definition": "let rec seq_map_index\n (#t1 #t2: Type)\n (f: (t1 -> Tot t2))\n (x: seq t1)\n (i: nat { i < length x })\n: Lemma\n (ensures (index (seq_map f x) i == f (index x i)))\n (decreases (length x))\n [SMTPat (index (seq_map f x) i)]\n= if i = 0\n then ()\n else seq_map_index f (tail x) (i - 1)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Seq.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 30, "start_col": 2, "end_line": 32, "end_col": 39 }, "file_context": "module QUIC.Secret.Seq\nopen FStar.Seq\n\nmodule Secret = QUIC.Secret.Int\nmodule U8 = FStar.UInt8\nmodule Ghost = FStar.Ghost\n\n(* NOTE: abstraction is NOT broken here *)\n\nnoextract\nlet rec seq_map\n (#t1 #t2: Type)\n (f: (t1 -> Tot t2))\n (x: seq t1)\n: Tot (lseq t2 (length x))\n (decreases (length x))\n= if length x = 0\n then empty\n else cons (f (head x)) (seq_map f (tail x))\n\nlet rec seq_map_index\n (#t1 #t2: Type)\n (f: (t1 -> Tot t2))\n (x: seq t1)\n (i: nat { i < length x })\n: Lemma\n (ensures (index (seq_map f x) i == f (index x i)))\n (decreases (length x))", "dependencies": { "source_file": "QUIC.Secret.Seq.fst", "checked_file": "QUIC.Secret.Seq.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "f: (_: t1 -> t2) -> x: FStar.Seq.Base.seq t1 -> i: Prims.nat{i < FStar.Seq.Base.length x}\n -> FStar.Pervasives.Lemma\n (ensures FStar.Seq.Base.index (QUIC.Secret.Seq.seq_map f x) i == f (FStar.Seq.Base.index x i))\n (decreases FStar.Seq.Base.length x)\n [SMTPat (FStar.Seq.Base.index (QUIC.Secret.Seq.seq_map f x) i)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma", "" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "FStar.Seq.Base.length", "Prims.op_Equality", "Prims.int", "Prims.bool", "QUIC.Secret.Seq.seq_map_index", "FStar.Seq.Properties.tail", "Prims.op_Subtraction", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "FStar.Seq.Base.index", "QUIC.Secret.Seq.seq_map", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Prims.Nil" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val seq_map_index (#t1 #t2: Type) (f: (t1 -> Tot t2)) (x: seq t1) (i: nat{i < length x})\n : Lemma (ensures (index (seq_map f x) i == f (index x i)))\n (decreases (length x))\n [SMTPat (index (seq_map f x) i)]\nlet rec seq_map_index (#t1 #t2: Type) (f: (t1 -> Tot t2)) (x: seq t1) (i: nat{i < length x})\n : Lemma (ensures (index (seq_map f x) i == f (index x i)))\n (decreases (length x))\n [SMTPat (index (seq_map f x) i)] =", "completed_definiton": "if i = 0 then () else seq_map_index f (tail x) (i - 1)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Seq.fst", "name": "QUIC.Secret.Seq.seq_gmap_index", "original_source_type": "val seq_gmap_index (#t1 #t2: Type) (f: (t1 -> GTot t2)) (x: seq t1) (i: nat{i < length x})\n : Lemma (ensures (index (seq_gmap f x) i == f (index x i)))\n (decreases (length x))\n [SMTPat (index (seq_gmap f x) i)]", "source_type": "val seq_gmap_index (#t1 #t2: Type) (f: (t1 -> GTot t2)) (x: seq t1) (i: nat{i < length x})\n : Lemma (ensures (index (seq_gmap f x) i == f (index x i)))\n (decreases (length x))\n [SMTPat (index (seq_gmap f x) i)]", "source_definition": "let rec seq_gmap_index\n (#t1 #t2: Type)\n (f: (t1 -> GTot t2))\n (x: seq t1)\n (i: nat { i < length x })\n: Lemma\n (ensures (index (seq_gmap f x) i == f (index x i)))\n (decreases (length x))\n [SMTPat (index (seq_gmap f x) i)]\n= if i = 0\n then ()\n else seq_gmap_index f (tail x) (i - 1)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Seq.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 70, "start_col": 2, "end_line": 72, "end_col": 40 }, "file_context": "module QUIC.Secret.Seq\nopen FStar.Seq\n\nmodule Secret = QUIC.Secret.Int\nmodule U8 = FStar.UInt8\nmodule Ghost = FStar.Ghost\n\n(* NOTE: abstraction is NOT broken here *)\n\nnoextract\nlet rec seq_map\n (#t1 #t2: Type)\n (f: (t1 -> Tot t2))\n (x: seq t1)\n: Tot (lseq t2 (length x))\n (decreases (length x))\n= if length x = 0\n then empty\n else cons (f (head x)) (seq_map f (tail x))\n\nlet rec seq_map_index\n (#t1 #t2: Type)\n (f: (t1 -> Tot t2))\n (x: seq t1)\n (i: nat { i < length x })\n: Lemma\n (ensures (index (seq_map f x) i == f (index x i)))\n (decreases (length x))\n [SMTPat (index (seq_map f x) i)]\n= if i = 0\n then ()\n else seq_map_index f (tail x) (i - 1)\n\nlet seq_hide\n #t x\n= seq_map (Secret.cast t Secret.SEC) x\n\nlet seq_hide_length\n #t x\n= ()\n\n#push-options \"--z3rlimit 32\"\n\nlet seq_hide_index\n #t x i\n= ()\n\n#pop-options\n\nnoextract\nlet rec seq_gmap\n (#t1 #t2: Type)\n (f: (t1 -> GTot t2))\n (x: seq t1)\n: GTot (lseq t2 (length x))\n (decreases (length x))\n= if length x = 0\n then empty\n else cons (f (head x)) (seq_gmap f (tail x))\n\nlet rec seq_gmap_index\n (#t1 #t2: Type)\n (f: (t1 -> GTot t2))\n (x: seq t1)\n (i: nat { i < length x })\n: Lemma\n (ensures (index (seq_gmap f x) i == f (index x i)))\n (decreases (length x))", "dependencies": { "source_file": "QUIC.Secret.Seq.fst", "checked_file": "QUIC.Secret.Seq.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "f: (_: t1 -> Prims.GTot t2) -> x: FStar.Seq.Base.seq t1 -> i: Prims.nat{i < FStar.Seq.Base.length x}\n -> FStar.Pervasives.Lemma\n (ensures FStar.Seq.Base.index (QUIC.Secret.Seq.seq_gmap f x) i == f (FStar.Seq.Base.index x i)\n )\n (decreases FStar.Seq.Base.length x)\n [SMTPat (FStar.Seq.Base.index (QUIC.Secret.Seq.seq_gmap f x) i)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma", "" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "FStar.Seq.Base.length", "Prims.op_Equality", "Prims.int", "Prims.bool", "QUIC.Secret.Seq.seq_gmap_index", "FStar.Seq.Properties.tail", "Prims.op_Subtraction", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "FStar.Seq.Base.index", "QUIC.Secret.Seq.seq_gmap", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "Prims.Nil" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val seq_gmap_index (#t1 #t2: Type) (f: (t1 -> GTot t2)) (x: seq t1) (i: nat{i < length x})\n : Lemma (ensures (index (seq_gmap f x) i == f (index x i)))\n (decreases (length x))\n [SMTPat (index (seq_gmap f x) i)]\nlet rec seq_gmap_index (#t1 #t2: Type) (f: (t1 -> GTot t2)) (x: seq t1) (i: nat{i < length x})\n : Lemma (ensures (index (seq_gmap f x) i == f (index x i)))\n (decreases (length x))\n [SMTPat (index (seq_gmap f x) i)] =", "completed_definiton": "if i = 0 then () else seq_gmap_index f (tail x) (i - 1)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Lemmas.fsti", "name": "QUIC.Impl.Lemmas.secret_and_inplace", "original_source_type": "val secret_and_inplace (b1 b2: S.seq Secret.uint8) (pos: nat)\n : Pure (S.seq Secret.uint8)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)", "source_type": "val secret_and_inplace (b1 b2: S.seq Secret.uint8) (pos: nat)\n : Pure (S.seq Secret.uint8)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)", "source_definition": "let secret_and_inplace (b1 b2:S.seq Secret.uint8) (pos:nat)\n : Pure (S.seq Secret.uint8)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n=\n pointwise_op (Secret.logand #Secret.U8 #Secret.SEC) b1 b2 pos", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Lemmas.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 165, "start_col": 2, "end_line": 165, "end_col": 63 }, "file_context": "module QUIC.Impl.Lemmas\ninclude QUIC.Spec.Lemmas\n\nmodule G = FStar.Ghost\nmodule S = QUIC.Secret.Seq\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nmodule QS = QUIC.Spec.Crypto\nmodule QSL = QUIC.Spec.Lemmas\n\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\nmodule HST = FStar.HyperStack.ST\n\nval lemma_five_cuts (#t: Type) (s: S.seq t) (i1 i2 i3 i4 i5: nat) (s0 s1 s2 s3 s4 s5: S.seq t): Lemma\n (requires (\n i1 <= S.length s /\\\n i2 <= S.length s /\\\n i3 <= S.length s /\\\n i4 <= S.length s /\\\n i5 <= S.length s /\\\n i1 <= i2 /\\\n i2 <= i3 /\\\n i3 <= i4 /\\\n i4 <= i5 /\\\n s0 `S.equal` S.slice s 0 i1 /\\\n s1 `S.equal` S.slice s i1 i2 /\\\n s2 `S.equal` S.slice s i2 i3 /\\\n s3 `S.equal` S.slice s i3 i4 /\\\n s4 `S.equal` S.slice s i4 i5 /\\\n s5 `S.equal` S.slice s i5 (S.length s)))\n (ensures (\n let open S in\n s `equal` (s0 @| s1 @| s2 @| s3 @| s4 @| s5)))\n\nval hash_is_keysized_ (a: QS.ha): Lemma\n (ensures (QS.keysized a (Spec.Hash.Definitions.hash_length a)))\n\nval lemma_slice (#t: Type) (s: S.seq t) (i: nat { i <= S.length s }): Lemma\n (ensures (s `S.equal` S.append (S.slice s 0 i) (S.slice s i (S.length s))))\n\nval lemma_slice3 (#a: Type) (s: S.seq a) (i j: nat): Lemma\n (requires (i <= j /\\ j <= S.length s))\n (ensures (s `S.equal`\n (S.slice s 0 i `S.append` S.slice s i j `S.append` S.slice s j (S.length s))))\n\nval lemma_slice0 (#a: Type) (s: S.seq a): Lemma (S.slice s 0 (S.length s) `S.equal` s)\n\nval lemma_slice1 (#a: Type) (s: S.seq a) (i j: nat): Lemma\n (requires (i <= j /\\ j <= S.length s))\n (ensures (S.slice s 0 j `S.equal`\n (S.slice s 0 i `S.append` S.slice s i j)))\n\nopen FStar.Mul\n\n/// Lemmas about pointwise_op\n/// -------------------------------------------\n\nval pointwise_upd (#a: Type) (f: a -> a -> Tot a) (b1 b2: S.seq a) (i: nat) (pos: nat) (x: a): Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.upd (QSL.pointwise_op f b1 b2 pos) i x `S.equal`\n QSL.pointwise_op f (S.upd b1 i x) b2 pos))\n\nval pointwise_seq_map2 (#a: Type) (f: a -> a -> a) (s1 s2: S.seq a) (i: nat): Lemma\n (requires (\n let l = S.length s1 in\n S.length s2 = l - i /\\ i <= S.length s1))\n (ensures (\n let l = S.length s1 in\n Spec.Loops.seq_map2 f (S.slice s1 i l) s2 `S.equal`\n S.slice (QSL.pointwise_op f s1 s2 i) i l))\n (decreases (S.length s2))\n\nval and_inplace_commutative (s1 s2: S.seq U8.t): Lemma\n (requires S.length s1 = S.length s2)\n (ensures Spec.Loops.seq_map2 U8.logand s1 s2 `S.equal`\n Spec.Loops.seq_map2 U8.logand s2 s1)\n (decreases (S.length s1))\n\nval seq_map2_xor0 (s1 s2: S.seq Secret.uint8): Lemma\n (requires\n S.length s1 = S.length s2 /\\\n s1 `S.equal` S.create (S.length s2) (Secret.to_u8 0uy))\n (ensures\n Spec.Loops.seq_map2 EverCrypt.CTR.xor8 s1 s2 `S.equal` s2)\n (decreases (S.length s1))\n\nval upd_op_inplace (#a:Type) (op: a -> a -> Tot a) (s: S.seq a) (x: a): Lemma\n (requires S.length s > 0)\n (ensures (S.upd s 0 (S.index s 0 `op` x) `S.equal`\n QSL.pointwise_op op s (S.create 1 x) 0))\n\nval be_to_n_slice (s: S.seq U8.t) (i: nat): Lemma\n (requires i <= S.length s)\n (ensures FStar.Endianness.be_to_n (S.slice s i (S.length s)) =\n FStar.Endianness.be_to_n s % pow2 (8 `op_Multiply` (S.length s - i)))\n (decreases (S.length s))\n\nval n_to_be_lower\n (len: nat)\n (len' : nat)\n (n: nat)\n: Lemma\n (requires (\n len <= len' /\\\n n < pow2 (8 * len)\n ))\n (ensures (\n let open FStar.Endianness in\n n < pow2 (8 * len') /\\\n n_to_be len n `S.equal` S.slice (n_to_be len' n) (len' - len) len'\n ))\n\nval n_to_be_lower'\n (len: nat)\n (len' : nat)\n (n: nat)\n: Lemma\n (requires (\n len <= len' /\\\n n < pow2 (8 * len)\n ))\n (ensures (\n let open FStar.Endianness in\n n < pow2 (8 * len') /\\\n n_to_be len' n `S.equal` (S.create (len' - len) 0uy `S.append` n_to_be len n)\n ))\n\n(* Inplace implementation of pointwise_op *)\n\ninline_for_extraction noextract\nval op_inplace\n (#t: Type)\n (dst: B.buffer t)\n (src: B.buffer t)\n (src_len: U32.t)\n (ofs: U32.t)\n (op: t -> t -> t)\n:\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf src ]) /\\\n B.disjoint dst src /\\\n B.length src == U32.v src_len /\\\n B.length dst >= U32.v ofs + B.length src)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst) h0 h1) /\\\n B.as_seq h1 dst `S.equal`\n pointwise_op op (B.as_seq h0 dst) (B.as_seq h0 src) (U32.v ofs) /\\\n S.slice (B.as_seq h0 dst) 0 (U32.v ofs) `S.equal`\n S.slice (B.as_seq h1 dst) 0 (U32.v ofs) /\\\n S.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst) `S.equal`\n S.slice (B.as_seq h1 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst))\n\n(* Secret operation specs *)\n\nlet secret_and_inplace (b1 b2:S.seq Secret.uint8) (pos:nat)\n : Pure (S.seq Secret.uint8)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)", "dependencies": { "source_file": "QUIC.Impl.Lemmas.fsti", "checked_file": "QUIC.Impl.Lemmas.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Loops.fst.checked", "Spec.Hash.Definitions.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Crypto.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "EverCrypt.CTR.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "QSL", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b1: FStar.Seq.Base.seq Lib.IntTypes.uint8 ->\n b2: FStar.Seq.Base.seq Lib.IntTypes.uint8 ->\n pos: Prims.nat\n -> Prims.Pure (FStar.Seq.Base.seq Lib.IntTypes.uint8)", "effect": "Prims.Pure", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Lib.IntTypes.uint8", "Prims.nat", "QUIC.Spec.Lemmas.pointwise_op", "Lib.IntTypes.logand", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_Addition", "FStar.Seq.Base.length", "Prims.eq2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val secret_and_inplace (b1 b2: S.seq Secret.uint8) (pos: nat)\n : Pure (S.seq Secret.uint8)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\nlet secret_and_inplace (b1 b2: S.seq Secret.uint8) (pos: nat)\n : Pure (S.seq Secret.uint8)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1) =", "completed_definiton": "pointwise_op (Secret.logand #Secret.U8 #Secret.SEC) b1 b2 pos", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Lemmas.fsti", "name": "QUIC.Impl.Lemmas.secret_xor_inplace", "original_source_type": "val secret_xor_inplace (b1 b2: Seq.seq Secret.uint8) (pos: nat)\n : Pure (Seq.seq Secret.uint8)\n (requires Seq.length b2 + pos <= Seq.length b1)\n (ensures fun b -> Seq.length b == Seq.length b1)", "source_type": "val secret_xor_inplace (b1 b2: Seq.seq Secret.uint8) (pos: nat)\n : Pure (Seq.seq Secret.uint8)\n (requires Seq.length b2 + pos <= Seq.length b1)\n (ensures fun b -> Seq.length b == Seq.length b1)", "source_definition": "let secret_xor_inplace (b1 b2:Seq.seq Secret.uint8) (pos:nat)\n : Pure (Seq.seq Secret.uint8)\n (requires Seq.length b2 + pos <= Seq.length b1)\n (ensures fun b -> Seq.length b == Seq.length b1)\n=\n pointwise_op (Secret.logxor #Secret.U8 #Secret.SEC) b1 b2 pos", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Lemmas.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 183, "start_col": 2, "end_line": 183, "end_col": 63 }, "file_context": "module QUIC.Impl.Lemmas\ninclude QUIC.Spec.Lemmas\n\nmodule G = FStar.Ghost\nmodule S = QUIC.Secret.Seq\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nmodule QS = QUIC.Spec.Crypto\nmodule QSL = QUIC.Spec.Lemmas\n\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\nmodule HST = FStar.HyperStack.ST\n\nval lemma_five_cuts (#t: Type) (s: S.seq t) (i1 i2 i3 i4 i5: nat) (s0 s1 s2 s3 s4 s5: S.seq t): Lemma\n (requires (\n i1 <= S.length s /\\\n i2 <= S.length s /\\\n i3 <= S.length s /\\\n i4 <= S.length s /\\\n i5 <= S.length s /\\\n i1 <= i2 /\\\n i2 <= i3 /\\\n i3 <= i4 /\\\n i4 <= i5 /\\\n s0 `S.equal` S.slice s 0 i1 /\\\n s1 `S.equal` S.slice s i1 i2 /\\\n s2 `S.equal` S.slice s i2 i3 /\\\n s3 `S.equal` S.slice s i3 i4 /\\\n s4 `S.equal` S.slice s i4 i5 /\\\n s5 `S.equal` S.slice s i5 (S.length s)))\n (ensures (\n let open S in\n s `equal` (s0 @| s1 @| s2 @| s3 @| s4 @| s5)))\n\nval hash_is_keysized_ (a: QS.ha): Lemma\n (ensures (QS.keysized a (Spec.Hash.Definitions.hash_length a)))\n\nval lemma_slice (#t: Type) (s: S.seq t) (i: nat { i <= S.length s }): Lemma\n (ensures (s `S.equal` S.append (S.slice s 0 i) (S.slice s i (S.length s))))\n\nval lemma_slice3 (#a: Type) (s: S.seq a) (i j: nat): Lemma\n (requires (i <= j /\\ j <= S.length s))\n (ensures (s `S.equal`\n (S.slice s 0 i `S.append` S.slice s i j `S.append` S.slice s j (S.length s))))\n\nval lemma_slice0 (#a: Type) (s: S.seq a): Lemma (S.slice s 0 (S.length s) `S.equal` s)\n\nval lemma_slice1 (#a: Type) (s: S.seq a) (i j: nat): Lemma\n (requires (i <= j /\\ j <= S.length s))\n (ensures (S.slice s 0 j `S.equal`\n (S.slice s 0 i `S.append` S.slice s i j)))\n\nopen FStar.Mul\n\n/// Lemmas about pointwise_op\n/// -------------------------------------------\n\nval pointwise_upd (#a: Type) (f: a -> a -> Tot a) (b1 b2: S.seq a) (i: nat) (pos: nat) (x: a): Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.upd (QSL.pointwise_op f b1 b2 pos) i x `S.equal`\n QSL.pointwise_op f (S.upd b1 i x) b2 pos))\n\nval pointwise_seq_map2 (#a: Type) (f: a -> a -> a) (s1 s2: S.seq a) (i: nat): Lemma\n (requires (\n let l = S.length s1 in\n S.length s2 = l - i /\\ i <= S.length s1))\n (ensures (\n let l = S.length s1 in\n Spec.Loops.seq_map2 f (S.slice s1 i l) s2 `S.equal`\n S.slice (QSL.pointwise_op f s1 s2 i) i l))\n (decreases (S.length s2))\n\nval and_inplace_commutative (s1 s2: S.seq U8.t): Lemma\n (requires S.length s1 = S.length s2)\n (ensures Spec.Loops.seq_map2 U8.logand s1 s2 `S.equal`\n Spec.Loops.seq_map2 U8.logand s2 s1)\n (decreases (S.length s1))\n\nval seq_map2_xor0 (s1 s2: S.seq Secret.uint8): Lemma\n (requires\n S.length s1 = S.length s2 /\\\n s1 `S.equal` S.create (S.length s2) (Secret.to_u8 0uy))\n (ensures\n Spec.Loops.seq_map2 EverCrypt.CTR.xor8 s1 s2 `S.equal` s2)\n (decreases (S.length s1))\n\nval upd_op_inplace (#a:Type) (op: a -> a -> Tot a) (s: S.seq a) (x: a): Lemma\n (requires S.length s > 0)\n (ensures (S.upd s 0 (S.index s 0 `op` x) `S.equal`\n QSL.pointwise_op op s (S.create 1 x) 0))\n\nval be_to_n_slice (s: S.seq U8.t) (i: nat): Lemma\n (requires i <= S.length s)\n (ensures FStar.Endianness.be_to_n (S.slice s i (S.length s)) =\n FStar.Endianness.be_to_n s % pow2 (8 `op_Multiply` (S.length s - i)))\n (decreases (S.length s))\n\nval n_to_be_lower\n (len: nat)\n (len' : nat)\n (n: nat)\n: Lemma\n (requires (\n len <= len' /\\\n n < pow2 (8 * len)\n ))\n (ensures (\n let open FStar.Endianness in\n n < pow2 (8 * len') /\\\n n_to_be len n `S.equal` S.slice (n_to_be len' n) (len' - len) len'\n ))\n\nval n_to_be_lower'\n (len: nat)\n (len' : nat)\n (n: nat)\n: Lemma\n (requires (\n len <= len' /\\\n n < pow2 (8 * len)\n ))\n (ensures (\n let open FStar.Endianness in\n n < pow2 (8 * len') /\\\n n_to_be len' n `S.equal` (S.create (len' - len) 0uy `S.append` n_to_be len n)\n ))\n\n(* Inplace implementation of pointwise_op *)\n\ninline_for_extraction noextract\nval op_inplace\n (#t: Type)\n (dst: B.buffer t)\n (src: B.buffer t)\n (src_len: U32.t)\n (ofs: U32.t)\n (op: t -> t -> t)\n:\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf src ]) /\\\n B.disjoint dst src /\\\n B.length src == U32.v src_len /\\\n B.length dst >= U32.v ofs + B.length src)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst) h0 h1) /\\\n B.as_seq h1 dst `S.equal`\n pointwise_op op (B.as_seq h0 dst) (B.as_seq h0 src) (U32.v ofs) /\\\n S.slice (B.as_seq h0 dst) 0 (U32.v ofs) `S.equal`\n S.slice (B.as_seq h1 dst) 0 (U32.v ofs) /\\\n S.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst) `S.equal`\n S.slice (B.as_seq h1 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst))\n\n(* Secret operation specs *)\n\nlet secret_and_inplace (b1 b2:S.seq Secret.uint8) (pos:nat)\n : Pure (S.seq Secret.uint8)\n (requires S.length b2 + pos <= S.length b1)\n (ensures fun b -> S.length b == S.length b1)\n=\n pointwise_op (Secret.logand #Secret.U8 #Secret.SEC) b1 b2 pos\n\nval secret_and_inplace_eq\n (b1 b2: S.seq Secret.uint8)\n (pos: nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1/\\\n S.seq_reveal (secret_and_inplace b1 b2 pos) `S.equal` and_inplace (S.seq_reveal b1) (S.seq_reveal b2) pos\n ))\n [SMTPat (secret_and_inplace b1 b2 pos)]\n\nlet secret_xor_inplace (b1 b2:Seq.seq Secret.uint8) (pos:nat)\n : Pure (Seq.seq Secret.uint8)\n (requires Seq.length b2 + pos <= Seq.length b1)\n (ensures fun b -> Seq.length b == Seq.length b1)", "dependencies": { "source_file": "QUIC.Impl.Lemmas.fsti", "checked_file": "QUIC.Impl.Lemmas.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Loops.fst.checked", "Spec.Hash.Definitions.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.Crypto.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "EverCrypt.CTR.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "QSL", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b1: FStar.Seq.Base.seq Lib.IntTypes.uint8 ->\n b2: FStar.Seq.Base.seq Lib.IntTypes.uint8 ->\n pos: Prims.nat\n -> Prims.Pure (FStar.Seq.Base.seq Lib.IntTypes.uint8)", "effect": "Prims.Pure", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Lib.IntTypes.uint8", "Prims.nat", "QUIC.Spec.Lemmas.pointwise_op", "Lib.IntTypes.logxor", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_Addition", "FStar.Seq.Base.length", "Prims.eq2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val secret_xor_inplace (b1 b2: Seq.seq Secret.uint8) (pos: nat)\n : Pure (Seq.seq Secret.uint8)\n (requires Seq.length b2 + pos <= Seq.length b1)\n (ensures fun b -> Seq.length b == Seq.length b1)\nlet secret_xor_inplace (b1 b2: Seq.seq Secret.uint8) (pos: nat)\n : Pure (Seq.seq Secret.uint8)\n (requires Seq.length b2 + pos <= Seq.length b1)\n (ensures fun b -> Seq.length b == Seq.length b1) =", "completed_definiton": "pointwise_op (Secret.logxor #Secret.U8 #Secret.SEC) b1 b2 pos", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fsti", "name": "QUIC.Spec.Header.Parse.packet_is_retry", "original_source_type": "val packet_is_retry (x: bytes) : GTot bool", "source_type": "val packet_is_retry (x: bytes) : GTot bool", "source_definition": "let packet_is_retry\n (x: bytes)\n: GTot bool\n= if Seq.length x > 0\n then\n let f = S.index x 0 in\n BF.get_bitfield (U8.v f) 7 8 = 1 &&\n BF.get_bitfield (U8.v f) 4 6 = 3\n else false", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 127, "start_col": 2, "end_line": 132, "end_col": 12 }, "file_context": "module QUIC.Spec.Header.Parse\ninclude QUIC.Spec.Header.Base\n\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule S = FStar.Seq\nmodule U64 = FStar.UInt64\nmodule Secret = QUIC.Secret.Int\n\nval format_header: h:header -> GTot (lbytes (header_len h))\n\nmodule BF = LowParse.BitFields\n\nval format_header_is_short: h: header -> Lemma\n (MShort? h <==> BF.get_bitfield (U8.v (S.index (format_header h) 0)) 7 8 == 0)\n\nval format_header_is_retry: h: header -> Lemma\n (is_retry h <==> (\n BF.get_bitfield (U8.v (S.index (format_header h) 0)) 7 8 == 1 /\\\n BF.get_bitfield (U8.v (S.index (format_header h) 0)) 4 6 == 3\n ))\n\nval format_header_pn_length: h: header -> Lemma\n (requires (~ (is_retry h)))\n (ensures (BF.get_bitfield (U8.v (S.index (format_header h) 0)) 0 2 == Secret.v (pn_length h) - 1))\n\nval pn_offset: (h: header { ~ (is_retry h) }) -> GTot (n: nat { 0 < n /\\ n + Secret.v (pn_length h) == header_len h }) // need to know that packet number is the last field of the format\n\nval putative_pn_offset: (cid_len: nat) -> (x: bytes) -> GTot (y: option nat {\n match y with\n | None -> True\n | Some y -> 0 < y /\\ y <= Seq.length x /\\ y <= header_len_bound\n})\n\nval putative_pn_offset_frame\n (cid_len: nat)\n (x1 x2: bytes)\n: Lemma\n (requires (match putative_pn_offset cid_len x1 with\n | None -> False\n | Some off ->\n off <= Seq.length x2 /\\\n Seq.slice x1 1 off `Seq.equal` Seq.slice x2 1 off /\\ (\n let f1 = Seq.index x1 0 in\n let f2 = Seq.index x2 0 in\n let is_short = BF.get_bitfield (U8.v f1) 7 8 = 0 in\n let number_of_protected_bits = if is_short then 5 else 4 in\n BF.get_bitfield (U8.v f1) number_of_protected_bits 8 == BF.get_bitfield (U8.v f2) number_of_protected_bits 8\n )))\n (ensures (match putative_pn_offset cid_len x1 with\n | None -> False\n | Some off -> putative_pn_offset cid_len x2 == Some (off <: nat)\n ))\n\nval putative_pn_offset_correct\n (h: header {~ (is_retry h)})\n (cid_len: nat { cid_len <= 20 })\n: Lemma\n (requires (MShort? h ==> cid_len == dcid_len h))\n (ensures (putative_pn_offset cid_len (format_header h) == Some (pn_offset h <: nat)))\n\nnoeq\ntype h_result =\n| H_Success:\n h: header ->\n c: bytes ->\n h_result\n| H_Failure\n\nval parse_header: cid_len: nat { cid_len <= 20 } -> last: nat { last + 1 < pow2 62 } -> b:bytes -> GTot (r: h_result {\n match r with\n | H_Failure -> True\n | H_Success h c ->\n is_valid_header h cid_len last /\\\n Seq.length c <= Seq.length b /\\\n c `Seq.equal` Seq.slice b (Seq.length b - Seq.length c) (Seq.length b)\n})\n\nval lemma_header_parsing_correct:\n h: header ->\n c: bytes ->\n cid_len: nat { cid_len <= 20 } ->\n last: nat { last + 1 < pow2 62 } ->\n Lemma\n (requires (\n is_valid_header h cid_len last\n ))\n (ensures (\n parse_header cid_len last S.(format_header h @| c)\n == H_Success h c))\n\n// N.B. this is only true for a given DCID len\nval lemma_header_parsing_safe: cid_len: nat -> last: nat -> b1:bytes -> b2:bytes -> Lemma\n (requires (\n cid_len <= 20 /\\\n last + 1 < pow2 62 /\\\n parse_header cid_len last b1 == parse_header cid_len last b2\n ))\n (ensures parse_header cid_len last b1 == H_Failure \\/ b1 = b2)\n\nlet lemma_header_parsing_post\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (b: bytes)\n: Lemma\n (match parse_header cid_len last b with\n | H_Failure -> True\n | H_Success h c ->\n is_valid_header h cid_len last /\\\n header_len h + Seq.length c == Seq.length b /\\\n b == format_header h `Seq.append` c /\\\n Seq.slice b 0 (header_len h) == format_header h /\\\n c == Seq.slice b (header_len h) (Seq.length b)\n )\n= match parse_header cid_len last b with\n | H_Failure -> ()\n | H_Success h c ->\n lemma_header_parsing_correct h c cid_len last ;\n lemma_header_parsing_safe cid_len last b (format_header h `S.append` c);\n assert (b `Seq.equal` (format_header h `Seq.append` c));\n assert (Seq.slice b 0 (header_len h) `Seq.equal` format_header h);\n assert (c `Seq.equal` Seq.slice b (header_len h) (Seq.length b))\n\nlet packet_is_retry\n (x: bytes)", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fsti", "checked_file": "QUIC.Spec.Header.Parse.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Header.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: QUIC.Spec.Base.bytes -> Prims.GTot Prims.bool", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Base.bytes", "Prims.op_GreaterThan", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "Prims.op_AmpAmp", "Prims.op_Equality", "Prims.int", "LowParse.BitFields.get_bitfield", "FStar.UInt8.n", "FStar.UInt8.v", "FStar.Seq.Base.index", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val packet_is_retry (x: bytes) : GTot bool\nlet packet_is_retry (x: bytes) : GTot bool =", "completed_definiton": "if Seq.length x > 0\nthen\n let f = S.index x 0 in\n BF.get_bitfield (U8.v f) 7 8 = 1 && BF.get_bitfield (U8.v f) 4 6 = 3\nelse false", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Header.Parse.fsti", "name": "QUIC.Spec.Header.Parse.lemma_header_parsing_post", "original_source_type": "val lemma_header_parsing_post\n (cid_len: nat{cid_len <= 20})\n (last: nat{last + 1 < pow2 62})\n (b: bytes)\n : Lemma\n (match parse_header cid_len last b with\n | H_Failure -> True\n | H_Success h c ->\n is_valid_header h cid_len last /\\ header_len h + Seq.length c == Seq.length b /\\\n b == (format_header h) `Seq.append` c /\\ Seq.slice b 0 (header_len h) == format_header h /\\\n c == Seq.slice b (header_len h) (Seq.length b))", "source_type": "val lemma_header_parsing_post\n (cid_len: nat{cid_len <= 20})\n (last: nat{last + 1 < pow2 62})\n (b: bytes)\n : Lemma\n (match parse_header cid_len last b with\n | H_Failure -> True\n | H_Success h c ->\n is_valid_header h cid_len last /\\ header_len h + Seq.length c == Seq.length b /\\\n b == (format_header h) `Seq.append` c /\\ Seq.slice b 0 (header_len h) == format_header h /\\\n c == Seq.slice b (header_len h) (Seq.length b))", "source_definition": "let lemma_header_parsing_post\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (b: bytes)\n: Lemma\n (match parse_header cid_len last b with\n | H_Failure -> True\n | H_Success h c ->\n is_valid_header h cid_len last /\\\n header_len h + Seq.length c == Seq.length b /\\\n b == format_header h `Seq.append` c /\\\n Seq.slice b 0 (header_len h) == format_header h /\\\n c == Seq.slice b (header_len h) (Seq.length b)\n )\n= match parse_header cid_len last b with\n | H_Failure -> ()\n | H_Success h c ->\n lemma_header_parsing_correct h c cid_len last ;\n lemma_header_parsing_safe cid_len last b (format_header h `S.append` c);\n assert (b `Seq.equal` (format_header h `Seq.append` c));\n assert (Seq.slice b 0 (header_len h) `Seq.equal` format_header h);\n assert (c `Seq.equal` Seq.slice b (header_len h) (Seq.length b))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Header.Parse.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 115, "start_col": 2, "end_line": 122, "end_col": 68 }, "file_context": "module QUIC.Spec.Header.Parse\ninclude QUIC.Spec.Header.Base\n\nmodule U8 = FStar.UInt8\nmodule U32 = FStar.UInt32\nmodule S = FStar.Seq\nmodule U64 = FStar.UInt64\nmodule Secret = QUIC.Secret.Int\n\nval format_header: h:header -> GTot (lbytes (header_len h))\n\nmodule BF = LowParse.BitFields\n\nval format_header_is_short: h: header -> Lemma\n (MShort? h <==> BF.get_bitfield (U8.v (S.index (format_header h) 0)) 7 8 == 0)\n\nval format_header_is_retry: h: header -> Lemma\n (is_retry h <==> (\n BF.get_bitfield (U8.v (S.index (format_header h) 0)) 7 8 == 1 /\\\n BF.get_bitfield (U8.v (S.index (format_header h) 0)) 4 6 == 3\n ))\n\nval format_header_pn_length: h: header -> Lemma\n (requires (~ (is_retry h)))\n (ensures (BF.get_bitfield (U8.v (S.index (format_header h) 0)) 0 2 == Secret.v (pn_length h) - 1))\n\nval pn_offset: (h: header { ~ (is_retry h) }) -> GTot (n: nat { 0 < n /\\ n + Secret.v (pn_length h) == header_len h }) // need to know that packet number is the last field of the format\n\nval putative_pn_offset: (cid_len: nat) -> (x: bytes) -> GTot (y: option nat {\n match y with\n | None -> True\n | Some y -> 0 < y /\\ y <= Seq.length x /\\ y <= header_len_bound\n})\n\nval putative_pn_offset_frame\n (cid_len: nat)\n (x1 x2: bytes)\n: Lemma\n (requires (match putative_pn_offset cid_len x1 with\n | None -> False\n | Some off ->\n off <= Seq.length x2 /\\\n Seq.slice x1 1 off `Seq.equal` Seq.slice x2 1 off /\\ (\n let f1 = Seq.index x1 0 in\n let f2 = Seq.index x2 0 in\n let is_short = BF.get_bitfield (U8.v f1) 7 8 = 0 in\n let number_of_protected_bits = if is_short then 5 else 4 in\n BF.get_bitfield (U8.v f1) number_of_protected_bits 8 == BF.get_bitfield (U8.v f2) number_of_protected_bits 8\n )))\n (ensures (match putative_pn_offset cid_len x1 with\n | None -> False\n | Some off -> putative_pn_offset cid_len x2 == Some (off <: nat)\n ))\n\nval putative_pn_offset_correct\n (h: header {~ (is_retry h)})\n (cid_len: nat { cid_len <= 20 })\n: Lemma\n (requires (MShort? h ==> cid_len == dcid_len h))\n (ensures (putative_pn_offset cid_len (format_header h) == Some (pn_offset h <: nat)))\n\nnoeq\ntype h_result =\n| H_Success:\n h: header ->\n c: bytes ->\n h_result\n| H_Failure\n\nval parse_header: cid_len: nat { cid_len <= 20 } -> last: nat { last + 1 < pow2 62 } -> b:bytes -> GTot (r: h_result {\n match r with\n | H_Failure -> True\n | H_Success h c ->\n is_valid_header h cid_len last /\\\n Seq.length c <= Seq.length b /\\\n c `Seq.equal` Seq.slice b (Seq.length b - Seq.length c) (Seq.length b)\n})\n\nval lemma_header_parsing_correct:\n h: header ->\n c: bytes ->\n cid_len: nat { cid_len <= 20 } ->\n last: nat { last + 1 < pow2 62 } ->\n Lemma\n (requires (\n is_valid_header h cid_len last\n ))\n (ensures (\n parse_header cid_len last S.(format_header h @| c)\n == H_Success h c))\n\n// N.B. this is only true for a given DCID len\nval lemma_header_parsing_safe: cid_len: nat -> last: nat -> b1:bytes -> b2:bytes -> Lemma\n (requires (\n cid_len <= 20 /\\\n last + 1 < pow2 62 /\\\n parse_header cid_len last b1 == parse_header cid_len last b2\n ))\n (ensures parse_header cid_len last b1 == H_Failure \\/ b1 = b2)\n\nlet lemma_header_parsing_post\n (cid_len: nat { cid_len <= 20 })\n (last: nat { last + 1 < pow2 62 })\n (b: bytes)\n: Lemma\n (match parse_header cid_len last b with\n | H_Failure -> True\n | H_Success h c ->\n is_valid_header h cid_len last /\\\n header_len h + Seq.length c == Seq.length b /\\\n b == format_header h `Seq.append` c /\\\n Seq.slice b 0 (header_len h) == format_header h /\\\n c == Seq.slice b (header_len h) (Seq.length b)", "dependencies": { "source_file": "QUIC.Spec.Header.Parse.fsti", "checked_file": "QUIC.Spec.Header.Parse.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Spec.Header.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.BitFields.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.Combinators" }, { "abbrev": true, "short_module": "Public", "full_module": "QUIC.Spec.Header.Public" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Header" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n cid_len: Prims.nat{cid_len <= 20} ->\n last: Prims.nat{last + 1 < Prims.pow2 62} ->\n b: QUIC.Spec.Base.bytes\n -> FStar.Pervasives.Lemma\n (ensures\n ((match QUIC.Spec.Header.Parse.parse_header cid_len last b with\n | QUIC.Spec.Header.Parse.H_Failure -> Prims.l_True\n | QUIC.Spec.Header.Parse.H_Success h c ->\n QUIC.Spec.Header.Base.is_valid_header h cid_len last /\\\n QUIC.Spec.Header.Base.header_len h + FStar.Seq.Base.length c == FStar.Seq.Base.length b /\\\n b == FStar.Seq.Base.append (QUIC.Spec.Header.Parse.format_header h) c /\\\n FStar.Seq.Base.slice b 0 (QUIC.Spec.Header.Base.header_len h) ==\n QUIC.Spec.Header.Parse.format_header h /\\\n c ==\n FStar.Seq.Base.slice b (QUIC.Spec.Header.Base.header_len h) (FStar.Seq.Base.length b))\n <:\n Type0))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "Prims.op_Addition", "Prims.pow2", "QUIC.Spec.Base.bytes", "QUIC.Spec.Header.Parse.parse_header", "QUIC.Spec.Header.Base.header", "Prims._assert", "FStar.Seq.Base.equal", "QUIC.Spec.Base.byte", "FStar.Seq.Base.slice", "QUIC.Spec.Header.Base.header_len", "FStar.Seq.Base.length", "Prims.unit", "QUIC.Spec.Header.Parse.format_header", "FStar.Seq.Base.append", "QUIC.Spec.Header.Parse.lemma_header_parsing_safe", "QUIC.Spec.Header.Parse.lemma_header_parsing_correct", "Prims.l_True", "Prims.squash", "Prims.l_and", "QUIC.Spec.Header.Base.is_valid_header", "Prims.eq2", "Prims.int", "FStar.Seq.Base.seq", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_header_parsing_post\n (cid_len: nat{cid_len <= 20})\n (last: nat{last + 1 < pow2 62})\n (b: bytes)\n : Lemma\n (match parse_header cid_len last b with\n | H_Failure -> True\n | H_Success h c ->\n is_valid_header h cid_len last /\\ header_len h + Seq.length c == Seq.length b /\\\n b == (format_header h) `Seq.append` c /\\ Seq.slice b 0 (header_len h) == format_header h /\\\n c == Seq.slice b (header_len h) (Seq.length b))\nlet lemma_header_parsing_post\n (cid_len: nat{cid_len <= 20})\n (last: nat{last + 1 < pow2 62})\n (b: bytes)\n : Lemma\n (match parse_header cid_len last b with\n | H_Failure -> True\n | H_Success h c ->\n is_valid_header h cid_len last /\\ header_len h + Seq.length c == Seq.length b /\\\n b == (format_header h) `Seq.append` c /\\ Seq.slice b 0 (header_len h) == format_header h /\\\n c == Seq.slice b (header_len h) (Seq.length b)) =", "completed_definiton": "match parse_header cid_len last b with\n| H_Failure -> ()\n| H_Success h c ->\n lemma_header_parsing_correct h c cid_len last;\n lemma_header_parsing_safe cid_len last b ((format_header h) `S.append` c);\n assert (b `Seq.equal` ((format_header h) `Seq.append` c));\n assert ((Seq.slice b 0 (header_len h)) `Seq.equal` (format_header h));\n assert (c `Seq.equal` (Seq.slice b (header_len h) (Seq.length b)))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fsti", "name": "QUIC.Impl.Header.header_decrypt_pre", "original_source_type": "val header_decrypt_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n : GTot Type0", "source_type": "val header_decrypt_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n : GTot Type0", "source_definition": "let header_decrypt_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst:B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n B.all_disjoint [\n CTR.footprint m s;\n B.loc_buffer k;\n B.loc_buffer dst;\n ] /\\\n CTR.invariant m s /\\\n B.live m k /\\ B.length k == SCipher.key_length a' /\\\n B.live m dst /\\ B.length dst == U32.v dst_len", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 130, "start_col": 1, "end_line": 139, "end_col": 47 }, "file_context": "module QUIC.Impl.Header\ninclude QUIC.Impl.Header.Base\n\nopen QUIC.Spec.Crypto\n\nmodule G = FStar.Ghost\nmodule U8 = FStar.UInt8\nmodule B = LowStar.Buffer\nmodule U32 = FStar.UInt32\nmodule Secret = QUIC.Secret.Int\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule HST = FStar.HyperStack.ST\nmodule Seq = FStar.Seq\nmodule HS = FStar.HyperStack\n\nmodule Spec = QUIC.Spec.Header\nmodule Parse = QUIC.Spec.Header.Parse\nmodule SAEAD = Spec.Agile.AEAD\nmodule SCipher = Spec.Agile.Cipher\n\nmodule CTR = EverCrypt.CTR\n\nunfold\nlet header_encrypt_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (dst:B.buffer U8.t)\n (h: G.erased Spec.header)\n (is_short: bool)\n (is_retry: bool)\n (public_len: U32.t)\n (pn_len: PN.packet_number_length_t)\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n let fmt = Parse.format_header h in\n let header_len = Seq.length fmt in\n\n B.all_disjoint [\n CTR.footprint m s;\n B.loc_buffer k;\n B.loc_buffer dst;\n ] /\\\n\n CTR.invariant m s /\\\n B.live m k /\\ B.length k == SCipher.key_length a' /\\\n B.live m dst /\\\n\n is_short == Spec.MShort? h /\\\n is_retry == Spec.is_retry h /\\\n begin if is_retry\n then\n U32.v public_len == header_len /\\\n B.length dst == header_len\n else\n let cipher_len = B.length dst - header_len in\n U32.v public_len == Parse.pn_offset h /\\\n pn_len == Spec.pn_length h /\\\n 19 <= cipher_len /\\ cipher_len < max_cipher_length\n end /\\\n Seq.slice (B.as_seq m dst) 0 header_len `Seq.equal` fmt\n\nunfold\nlet header_encrypt_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (dst:B.buffer U8.t)\n (h: G.erased Spec.header)\n (is_short: bool)\n (is_retry: bool)\n (public_len: U32.t)\n (pn_len: PN.packet_number_length_t)\n (m: HS.mem)\n (m' : HS.mem)\n: GTot Type0\n= \n header_encrypt_pre a s k dst h is_short is_retry public_len pn_len m /\\\n begin\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n let fmt = Parse.format_header h in\n let header_len = Seq.length fmt in\n let cipher = Seq.slice (B.as_seq m dst) header_len (B.length dst) in\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n B.as_seq m' dst `Seq.equal`\n Spec.header_encrypt a (B.as_seq m k) h cipher /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s\n end\n\nval header_encrypt: a: ea ->\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a)) ->\n (k: B.buffer Secret.uint8) ->\n dst:B.buffer U8.t ->\n h: G.erased Spec.header ->\n is_short: bool ->\n is_retry: bool ->\n public_len: U32.t ->\n pn_len: PN.packet_number_length_t ->\n HST.Stack unit\n (requires (fun h0 ->\n header_encrypt_pre a s k dst h is_short is_retry public_len pn_len h0\n ))\n (ensures fun h0 _ h1 ->\n header_encrypt_post a s k dst h is_short is_retry public_len pn_len h0 h1\n )\n\nnoeq\ntype h_result =\n| H_Failure\n| H_Success:\n (h: header) ->\n (pn: PN.packet_number_t) ->\n (cipher_length: Secret.uint32) ->\n h_result\n\nunfold\nlet header_decrypt_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst:B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)", "dependencies": { "source_file": "QUIC.Impl.Header.fsti", "checked_file": "QUIC.Impl.Header.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.Crypto.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.CTR.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n s: NotEverCrypt.CTR.state (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n k: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n cid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n dst: LowStar.Buffer.buffer FStar.UInt8.t ->\n dst_len: FStar.UInt32.t ->\n m: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "NotEverCrypt.CTR.state", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "FStar.UInt8.t", "FStar.UInt32.t", "FStar.Monotonic.HyperStack.mem", "Prims.l_and", "LowStar.Monotonic.Buffer.all_disjoint", "Prims.Cons", "LowStar.Monotonic.Buffer.loc", "NotEverCrypt.CTR.footprint", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Buffer.trivial_preorder", "Prims.Nil", "NotEverCrypt.CTR.invariant", "LowStar.Monotonic.Buffer.live", "Prims.eq2", "Prims.nat", "LowStar.Monotonic.Buffer.length", "Spec.Agile.Cipher.key_length", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "FStar.UInt32.v", "Spec.Agile.Cipher.cipher_alg" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_decrypt_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n : GTot Type0\nlet header_decrypt_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n : GTot Type0 =", "completed_definiton": "let a' = SAEAD.cipher_alg_of_supported_alg a in\nB.all_disjoint [CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\ CTR.invariant m s /\\\nB.live m k /\\ B.length k == SCipher.key_length a' /\\ B.live m dst /\\ B.length dst == U32.v dst_len", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fsti", "name": "QUIC.Impl.Header.header_encrypt_pre", "original_source_type": "val header_encrypt_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: G.erased Spec.header)\n (is_short is_retry: bool)\n (public_len: U32.t)\n (pn_len: PN.packet_number_length_t)\n (m: HS.mem)\n : GTot Type0", "source_type": "val header_encrypt_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: G.erased Spec.header)\n (is_short is_retry: bool)\n (public_len: U32.t)\n (pn_len: PN.packet_number_length_t)\n (m: HS.mem)\n : GTot Type0", "source_definition": "let header_encrypt_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (dst:B.buffer U8.t)\n (h: G.erased Spec.header)\n (is_short: bool)\n (is_retry: bool)\n (public_len: U32.t)\n (pn_len: PN.packet_number_length_t)\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n let fmt = Parse.format_header h in\n let header_len = Seq.length fmt in\n\n B.all_disjoint [\n CTR.footprint m s;\n B.loc_buffer k;\n B.loc_buffer dst;\n ] /\\\n\n CTR.invariant m s /\\\n B.live m k /\\ B.length k == SCipher.key_length a' /\\\n B.live m dst /\\\n\n is_short == Spec.MShort? h /\\\n is_retry == Spec.is_retry h /\\\n begin if is_retry\n then\n U32.v public_len == header_len /\\\n B.length dst == header_len\n else\n let cipher_len = B.length dst - header_len in\n U32.v public_len == Parse.pn_offset h /\\\n pn_len == Spec.pn_length h /\\\n 19 <= cipher_len /\\ cipher_len < max_cipher_length\n end /\\\n Seq.slice (B.as_seq m dst) 0 header_len `Seq.equal` fmt", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 36, "start_col": 1, "end_line": 63, "end_col": 57 }, "file_context": "module QUIC.Impl.Header\ninclude QUIC.Impl.Header.Base\n\nopen QUIC.Spec.Crypto\n\nmodule G = FStar.Ghost\nmodule U8 = FStar.UInt8\nmodule B = LowStar.Buffer\nmodule U32 = FStar.UInt32\nmodule Secret = QUIC.Secret.Int\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule HST = FStar.HyperStack.ST\nmodule Seq = FStar.Seq\nmodule HS = FStar.HyperStack\n\nmodule Spec = QUIC.Spec.Header\nmodule Parse = QUIC.Spec.Header.Parse\nmodule SAEAD = Spec.Agile.AEAD\nmodule SCipher = Spec.Agile.Cipher\n\nmodule CTR = EverCrypt.CTR\n\nunfold\nlet header_encrypt_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (dst:B.buffer U8.t)\n (h: G.erased Spec.header)\n (is_short: bool)\n (is_retry: bool)\n (public_len: U32.t)\n (pn_len: PN.packet_number_length_t)\n (m: HS.mem)", "dependencies": { "source_file": "QUIC.Impl.Header.fsti", "checked_file": "QUIC.Impl.Header.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.Crypto.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.CTR.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n s: NotEverCrypt.CTR.state (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n k: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n dst: LowStar.Buffer.buffer FStar.UInt8.t ->\n h: FStar.Ghost.erased QUIC.Spec.Header.Base.header ->\n is_short: Prims.bool ->\n is_retry: Prims.bool ->\n public_len: FStar.UInt32.t ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n m: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "NotEverCrypt.CTR.state", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "FStar.UInt8.t", "FStar.Ghost.erased", "QUIC.Spec.Header.Base.header", "Prims.bool", "FStar.UInt32.t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "FStar.Monotonic.HyperStack.mem", "Prims.l_and", "LowStar.Monotonic.Buffer.all_disjoint", "Prims.Cons", "LowStar.Monotonic.Buffer.loc", "NotEverCrypt.CTR.footprint", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Buffer.trivial_preorder", "Prims.Nil", "NotEverCrypt.CTR.invariant", "LowStar.Monotonic.Buffer.live", "Prims.eq2", "Prims.nat", "LowStar.Monotonic.Buffer.length", "Spec.Agile.Cipher.key_length", "QUIC.Spec.Header.Base.uu___is_MShort", "FStar.Ghost.reveal", "QUIC.Spec.Header.Base.is_retry", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "FStar.UInt32.v", "Prims.op_LessThan", "Prims.op_Addition", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "QUIC.Spec.Header.Base.pn_length", "QUIC.Spec.Header.Base.header_len", "QUIC.Spec.Header.Parse.pn_offset", "Prims.op_LessThanOrEqual", "QUIC.Spec.Crypto.max_cipher_length", "Prims.op_Subtraction", "Prims.logical", "FStar.Seq.Base.equal", "FStar.Seq.Base.slice", "LowStar.Monotonic.Buffer.as_seq", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "QUIC.Spec.Base.lbytes", "QUIC.Spec.Header.Parse.format_header", "Spec.Agile.Cipher.cipher_alg" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_encrypt_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: G.erased Spec.header)\n (is_short is_retry: bool)\n (public_len: U32.t)\n (pn_len: PN.packet_number_length_t)\n (m: HS.mem)\n : GTot Type0\nlet header_encrypt_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: G.erased Spec.header)\n (is_short is_retry: bool)\n (public_len: U32.t)\n (pn_len: PN.packet_number_length_t)\n (m: HS.mem)\n : GTot Type0 =", "completed_definiton": "let a' = SAEAD.cipher_alg_of_supported_alg a in\nlet fmt = Parse.format_header h in\nlet header_len = Seq.length fmt in\nB.all_disjoint [CTR.footprint m s; B.loc_buffer k; B.loc_buffer dst] /\\ CTR.invariant m s /\\\nB.live m k /\\ B.length k == SCipher.key_length a' /\\ B.live m dst /\\ is_short == Spec.MShort? h /\\\nis_retry == Spec.is_retry h /\\\n(if is_retry\n then U32.v public_len == header_len /\\ B.length dst == header_len\n else\n let cipher_len = B.length dst - header_len in\n U32.v public_len == Parse.pn_offset h /\\ pn_len == Spec.pn_length h /\\ 19 <= cipher_len /\\\n cipher_len < max_cipher_length) /\\ (Seq.slice (B.as_seq m dst) 0 header_len) `Seq.equal` fmt", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fsti", "name": "QUIC.Impl.Header.header_encrypt_post", "original_source_type": "val header_encrypt_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: G.erased Spec.header)\n (is_short is_retry: bool)\n (public_len: U32.t)\n (pn_len: PN.packet_number_length_t)\n (m m': HS.mem)\n : GTot Type0", "source_type": "val header_encrypt_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: G.erased Spec.header)\n (is_short is_retry: bool)\n (public_len: U32.t)\n (pn_len: PN.packet_number_length_t)\n (m m': HS.mem)\n : GTot Type0", "source_definition": "let header_encrypt_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (dst:B.buffer U8.t)\n (h: G.erased Spec.header)\n (is_short: bool)\n (is_retry: bool)\n (public_len: U32.t)\n (pn_len: PN.packet_number_length_t)\n (m: HS.mem)\n (m' : HS.mem)\n: GTot Type0\n= \n header_encrypt_pre a s k dst h is_short is_retry public_len pn_len m /\\\n begin\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n let fmt = Parse.format_header h in\n let header_len = Seq.length fmt in\n let cipher = Seq.slice (B.as_seq m dst) header_len (B.length dst) in\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n B.as_seq m' dst `Seq.equal`\n Spec.header_encrypt a (B.as_seq m k) h cipher /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 80, "start_col": 2, "end_line": 91, "end_col": 5 }, "file_context": "module QUIC.Impl.Header\ninclude QUIC.Impl.Header.Base\n\nopen QUIC.Spec.Crypto\n\nmodule G = FStar.Ghost\nmodule U8 = FStar.UInt8\nmodule B = LowStar.Buffer\nmodule U32 = FStar.UInt32\nmodule Secret = QUIC.Secret.Int\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule HST = FStar.HyperStack.ST\nmodule Seq = FStar.Seq\nmodule HS = FStar.HyperStack\n\nmodule Spec = QUIC.Spec.Header\nmodule Parse = QUIC.Spec.Header.Parse\nmodule SAEAD = Spec.Agile.AEAD\nmodule SCipher = Spec.Agile.Cipher\n\nmodule CTR = EverCrypt.CTR\n\nunfold\nlet header_encrypt_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (dst:B.buffer U8.t)\n (h: G.erased Spec.header)\n (is_short: bool)\n (is_retry: bool)\n (public_len: U32.t)\n (pn_len: PN.packet_number_length_t)\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n let fmt = Parse.format_header h in\n let header_len = Seq.length fmt in\n\n B.all_disjoint [\n CTR.footprint m s;\n B.loc_buffer k;\n B.loc_buffer dst;\n ] /\\\n\n CTR.invariant m s /\\\n B.live m k /\\ B.length k == SCipher.key_length a' /\\\n B.live m dst /\\\n\n is_short == Spec.MShort? h /\\\n is_retry == Spec.is_retry h /\\\n begin if is_retry\n then\n U32.v public_len == header_len /\\\n B.length dst == header_len\n else\n let cipher_len = B.length dst - header_len in\n U32.v public_len == Parse.pn_offset h /\\\n pn_len == Spec.pn_length h /\\\n 19 <= cipher_len /\\ cipher_len < max_cipher_length\n end /\\\n Seq.slice (B.as_seq m dst) 0 header_len `Seq.equal` fmt\n\nunfold\nlet header_encrypt_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (dst:B.buffer U8.t)\n (h: G.erased Spec.header)\n (is_short: bool)\n (is_retry: bool)\n (public_len: U32.t)\n (pn_len: PN.packet_number_length_t)\n (m: HS.mem)\n (m' : HS.mem)\n: GTot Type0", "dependencies": { "source_file": "QUIC.Impl.Header.fsti", "checked_file": "QUIC.Impl.Header.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.Crypto.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.CTR.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n s: NotEverCrypt.CTR.state (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n k: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n dst: LowStar.Buffer.buffer FStar.UInt8.t ->\n h: FStar.Ghost.erased QUIC.Spec.Header.Base.header ->\n is_short: Prims.bool ->\n is_retry: Prims.bool ->\n public_len: FStar.UInt32.t ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n m: FStar.Monotonic.HyperStack.mem ->\n m': FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "NotEverCrypt.CTR.state", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "FStar.UInt8.t", "FStar.Ghost.erased", "QUIC.Spec.Header.Base.header", "Prims.bool", "FStar.UInt32.t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "FStar.Monotonic.HyperStack.mem", "Prims.l_and", "QUIC.Impl.Header.header_encrypt_pre", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Buffer.trivial_preorder", "NotEverCrypt.CTR.footprint", "FStar.Seq.Base.equal", "LowStar.Monotonic.Buffer.as_seq", "QUIC.Spec.Header.header_encrypt", "FStar.Ghost.reveal", "NotEverCrypt.CTR.invariant", "Prims.eq2", "LowStar.Monotonic.Buffer.loc", "FStar.Seq.Base.seq", "FStar.Seq.Base.slice", "LowStar.Monotonic.Buffer.length", "Prims.nat", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "QUIC.Spec.Base.lbytes", "QUIC.Spec.Header.Base.header_len", "QUIC.Spec.Header.Parse.format_header", "Spec.Agile.Cipher.cipher_alg" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_encrypt_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: G.erased Spec.header)\n (is_short is_retry: bool)\n (public_len: U32.t)\n (pn_len: PN.packet_number_length_t)\n (m m': HS.mem)\n : GTot Type0\nlet header_encrypt_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: G.erased Spec.header)\n (is_short is_retry: bool)\n (public_len: U32.t)\n (pn_len: PN.packet_number_length_t)\n (m m': HS.mem)\n : GTot Type0 =", "completed_definiton": "header_encrypt_pre a s k dst h is_short is_retry public_len pn_len m /\\\n(let a' = SAEAD.cipher_alg_of_supported_alg a in\n let fmt = Parse.format_header h in\n let header_len = Seq.length fmt in\n let cipher = Seq.slice (B.as_seq m dst) header_len (B.length dst) in\n B.modifies ((B.loc_buffer dst) `B.loc_union` (CTR.footprint m s)) m m' /\\\n (B.as_seq m' dst) `Seq.equal` (Spec.header_encrypt a (B.as_seq m k) h cipher) /\\\n CTR.invariant m' s /\\ CTR.footprint m s == CTR.footprint m' s)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Header.fsti", "name": "QUIC.Impl.Header.header_decrypt_post", "original_source_type": "val header_decrypt_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n (res: h_result)\n (m': HS.mem)\n : GTot Type0", "source_type": "val header_decrypt_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n (res: h_result)\n (m': HS.mem)\n : GTot Type0", "source_definition": "let header_decrypt_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst:B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n (res: h_result)\n (m' : HS.mem)\n: GTot Type0\n= \n header_decrypt_pre a s k cid_len last dst dst_len m /\\\n CTR.footprint m' s == CTR.footprint m s /\\\n CTR.invariant m' s /\\\n begin match res, Spec.header_decrypt a (B.as_seq m k) (U32.v cid_len) (Secret.v last) (B.as_seq m dst) with\n | H_Failure, Spec.H_Failure ->\n B.modifies B.loc_none m m'\n | H_Success h pn cipher_len, Spec.H_Success gh gcipher grem ->\n header_live h m' /\\\n gh == g_header h m' pn /\\\n Secret.v (header_len h) + Secret.v cipher_len <= B.length dst /\\\n B.loc_buffer (B.gsub dst 0ul (public_header_len h)) `B.loc_includes` header_footprint h /\\\n B.modifies (B.loc_buffer (B.gsub dst 0ul (Secret.reveal (header_len h))) `B.loc_union` CTR.footprint m s) m m' /\\\n Seq.length gcipher == Secret.v cipher_len /\\\n B.as_seq m' dst `Seq.equal` (Parse.format_header gh `Seq.append` gcipher `Seq.append` grem) /\\\n B.as_seq m' (B.gsub dst 0ul (Secret.reveal (header_len h))) == Parse.format_header gh /\\\n B.as_seq m' (B.gsub dst (Secret.reveal (header_len h)) (Secret.reveal cipher_len)) == gcipher /\\\n B.as_seq m' (B.gsub dst (Secret.reveal (header_len h) `U32.add` Secret.reveal cipher_len) (B.len dst `U32.sub` (Secret.reveal (header_len h) `U32.add` Secret.reveal cipher_len))) == grem\n | _ -> False\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Header.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 155, "start_col": 2, "end_line": 173, "end_col": 5 }, "file_context": "module QUIC.Impl.Header\ninclude QUIC.Impl.Header.Base\n\nopen QUIC.Spec.Crypto\n\nmodule G = FStar.Ghost\nmodule U8 = FStar.UInt8\nmodule B = LowStar.Buffer\nmodule U32 = FStar.UInt32\nmodule Secret = QUIC.Secret.Int\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule HST = FStar.HyperStack.ST\nmodule Seq = FStar.Seq\nmodule HS = FStar.HyperStack\n\nmodule Spec = QUIC.Spec.Header\nmodule Parse = QUIC.Spec.Header.Parse\nmodule SAEAD = Spec.Agile.AEAD\nmodule SCipher = Spec.Agile.Cipher\n\nmodule CTR = EverCrypt.CTR\n\nunfold\nlet header_encrypt_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (dst:B.buffer U8.t)\n (h: G.erased Spec.header)\n (is_short: bool)\n (is_retry: bool)\n (public_len: U32.t)\n (pn_len: PN.packet_number_length_t)\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n let fmt = Parse.format_header h in\n let header_len = Seq.length fmt in\n\n B.all_disjoint [\n CTR.footprint m s;\n B.loc_buffer k;\n B.loc_buffer dst;\n ] /\\\n\n CTR.invariant m s /\\\n B.live m k /\\ B.length k == SCipher.key_length a' /\\\n B.live m dst /\\\n\n is_short == Spec.MShort? h /\\\n is_retry == Spec.is_retry h /\\\n begin if is_retry\n then\n U32.v public_len == header_len /\\\n B.length dst == header_len\n else\n let cipher_len = B.length dst - header_len in\n U32.v public_len == Parse.pn_offset h /\\\n pn_len == Spec.pn_length h /\\\n 19 <= cipher_len /\\ cipher_len < max_cipher_length\n end /\\\n Seq.slice (B.as_seq m dst) 0 header_len `Seq.equal` fmt\n\nunfold\nlet header_encrypt_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (dst:B.buffer U8.t)\n (h: G.erased Spec.header)\n (is_short: bool)\n (is_retry: bool)\n (public_len: U32.t)\n (pn_len: PN.packet_number_length_t)\n (m: HS.mem)\n (m' : HS.mem)\n: GTot Type0\n= \n header_encrypt_pre a s k dst h is_short is_retry public_len pn_len m /\\\n begin\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n let fmt = Parse.format_header h in\n let header_len = Seq.length fmt in\n let cipher = Seq.slice (B.as_seq m dst) header_len (B.length dst) in\n B.modifies (B.loc_buffer dst `B.loc_union` CTR.footprint m s) m m' /\\\n B.as_seq m' dst `Seq.equal`\n Spec.header_encrypt a (B.as_seq m k) h cipher /\\\n CTR.invariant m' s /\\\n CTR.footprint m s == CTR.footprint m' s\n end\n\nval header_encrypt: a: ea ->\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a)) ->\n (k: B.buffer Secret.uint8) ->\n dst:B.buffer U8.t ->\n h: G.erased Spec.header ->\n is_short: bool ->\n is_retry: bool ->\n public_len: U32.t ->\n pn_len: PN.packet_number_length_t ->\n HST.Stack unit\n (requires (fun h0 ->\n header_encrypt_pre a s k dst h is_short is_retry public_len pn_len h0\n ))\n (ensures fun h0 _ h1 ->\n header_encrypt_post a s k dst h is_short is_retry public_len pn_len h0 h1\n )\n\nnoeq\ntype h_result =\n| H_Failure\n| H_Success:\n (h: header) ->\n (pn: PN.packet_number_t) ->\n (cipher_length: Secret.uint32) ->\n h_result\n\nunfold\nlet header_decrypt_pre\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst:B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n B.all_disjoint [\n CTR.footprint m s;\n B.loc_buffer k;\n B.loc_buffer dst;\n ] /\\\n CTR.invariant m s /\\\n B.live m k /\\ B.length k == SCipher.key_length a' /\\\n B.live m dst /\\ B.length dst == U32.v dst_len\n\nunfold\nlet header_decrypt_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst:B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n (res: h_result)\n (m' : HS.mem)\n: GTot Type0", "dependencies": { "source_file": "QUIC.Impl.Header.fsti", "checked_file": "QUIC.Impl.Header.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.Crypto.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.CTR.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec.Header" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n s: NotEverCrypt.CTR.state (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n k: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n cid_len: QUIC.Spec.Base.short_dcid_len_t ->\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n dst: LowStar.Buffer.buffer FStar.UInt8.t ->\n dst_len: FStar.UInt32.t ->\n m: FStar.Monotonic.HyperStack.mem ->\n res: QUIC.Impl.Header.h_result ->\n m': FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "NotEverCrypt.CTR.state", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "QUIC.Spec.Base.short_dcid_len_t", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "FStar.UInt8.t", "FStar.UInt32.t", "FStar.Monotonic.HyperStack.mem", "QUIC.Impl.Header.h_result", "Prims.l_and", "QUIC.Impl.Header.header_decrypt_pre", "Prims.eq2", "LowStar.Monotonic.Buffer.loc", "NotEverCrypt.CTR.footprint", "NotEverCrypt.CTR.invariant", "FStar.Pervasives.Native.Mktuple2", "QUIC.Spec.Header.h_result", "QUIC.Spec.Header.header_decrypt", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Buffer.trivial_preorder", "FStar.UInt32.v", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_none", "QUIC.Impl.Header.Base.header", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Lib.IntTypes.uint32", "QUIC.Spec.Header.Base.header", "QUIC.Spec.Base.bytes", "QUIC.Spec.Header.Base.is_retry", "Prims.int", "Prims.bool", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "QUIC.Spec.Crypto.max_cipher_length", "Prims.nat", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "QUIC.Impl.Header.Base.header_live", "QUIC.Impl.Header.Base.g_header", "Prims.op_Addition", "Lib.IntTypes.U32", "QUIC.Impl.Header.Base.header_len", "LowStar.Monotonic.Buffer.length", "LowStar.Monotonic.Buffer.loc_includes", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Buffer.gsub", "FStar.UInt32.__uint_to_t", "QUIC.Impl.Header.Base.public_header_len", "QUIC.Impl.Header.Base.header_footprint", "LowStar.Monotonic.Buffer.loc_union", "QUIC.Secret.Int.reveal", "Prims.l_or", "Prims.op_GreaterThanOrEqual", "Lib.IntTypes.range", "FStar.Seq.Base.equal", "FStar.Seq.Base.append", "QUIC.Spec.Header.Parse.format_header", "FStar.Seq.Base.seq", "FStar.UInt32.add", "FStar.UInt32.sub", "LowStar.Monotonic.Buffer.len", "FStar.Pervasives.Native.tuple2", "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val header_decrypt_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n (res: h_result)\n (m': HS.mem)\n : GTot Type0\nlet header_decrypt_post\n (a: ea)\n (s: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (k: B.buffer Secret.uint8)\n (cid_len: short_dcid_len_t)\n (last: PN.last_packet_number_t)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (m: HS.mem)\n (res: h_result)\n (m': HS.mem)\n : GTot Type0 =", "completed_definiton": "header_decrypt_pre a s k cid_len last dst dst_len m /\\ CTR.footprint m' s == CTR.footprint m s /\\\nCTR.invariant m' s /\\\n(match\n res, Spec.header_decrypt a (B.as_seq m k) (U32.v cid_len) (Secret.v last) (B.as_seq m dst)\n with\n | H_Failure, Spec.H_Failure -> B.modifies B.loc_none m m'\n | H_Success h pn cipher_len, Spec.H_Success gh gcipher grem ->\n header_live h m' /\\ gh == g_header h m' pn /\\\n Secret.v (header_len h) + Secret.v cipher_len <= B.length dst /\\\n (B.loc_buffer (B.gsub dst 0ul (public_header_len h))) `B.loc_includes` (header_footprint h) /\\\n B.modifies ((B.loc_buffer (B.gsub dst 0ul (Secret.reveal (header_len h))))\n `B.loc_union`\n (CTR.footprint m s))\n m\n m' /\\ Seq.length gcipher == Secret.v cipher_len /\\\n (B.as_seq m' dst)\n `Seq.equal`\n (((Parse.format_header gh) `Seq.append` gcipher) `Seq.append` grem) /\\\n B.as_seq m' (B.gsub dst 0ul (Secret.reveal (header_len h))) == Parse.format_header gh /\\\n B.as_seq m' (B.gsub dst (Secret.reveal (header_len h)) (Secret.reveal cipher_len)) == gcipher /\\\n B.as_seq m'\n (B.gsub dst\n ((Secret.reveal (header_len h)) `U32.add` (Secret.reveal cipher_len))\n ((B.len dst)\n `U32.sub`\n ((Secret.reveal (header_len h)) `U32.add` (Secret.reveal cipher_len)))) ==\n grem\n | _ -> False)", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fst", "name": "QUIC.State.key_len32", "original_source_type": "", "source_type": "val key_len32 : a: QUIC.Spec.Crypto.ea -> b: FStar.UInt32.t{FStar.UInt32.v b = FStar.UInt8.v (QUIC.State.key_len a)}", "source_definition": "let key_len32 a = FStar.Int.Cast.uint8_to_uint32 (key_len a)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 33, "start_col": 18, "end_line": 33, "end_col": 60 }, "file_context": "module QUIC.State\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nopen LowStar.BufferOps (* for the !* notation *)\n\nmodule Spec = QUIC.Spec\nmodule Impl = QUIC.Impl\nmodule Lemmas = QUIC.Impl.Lemmas\n\n\n/// Helpers\n/// -------\n\nlet key_len (a: ea): x:U8.t { U8.v x = Spec.Agile.AEAD.key_length a } =\n let open Spec.Agile.AEAD in\n match a with\n | AES128_GCM -> 16uy\n | AES256_GCM -> 32uy\n | CHACHA20_POLY1305 -> 32uy", "dependencies": { "source_file": "QUIC.State.fst", "checked_file": "QUIC.State.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "Impl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: QUIC.Spec.Crypto.ea -> b: FStar.UInt32.t{FStar.UInt32.v b = FStar.UInt8.v (QUIC.State.key_len a)}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "FStar.Int.Cast.uint8_to_uint32", "QUIC.State.key_len", "FStar.UInt32.t", "Prims.b2t", "Prims.op_Equality", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.v", "FStar.UInt8.v" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let key_len32 a =", "completed_definiton": "FStar.Int.Cast.uint8_to_uint32 (key_len a)", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fst", "name": "QUIC.State.footprint_s", "original_source_type": "val footprint_s: #i:index -> HS.mem -> state_s i -> GTot B.loc", "source_type": "val footprint_s: #i:index -> HS.mem -> state_s i -> GTot B.loc", "source_definition": "let footprint_s #i h s =\n let open LowStar.Buffer in\n AEAD.footprint h (State?.aead_state s) `loc_union`\n CTR.footprint h (State?.ctr_state s) `loc_union`\n loc_buffer (State?.iv s) `loc_union`\n loc_buffer (State?.hp_key s) `loc_union`\n loc_buffer (State?.pn s)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 60, "start_col": 2, "end_line": 65, "end_col": 26 }, "file_context": "module QUIC.State\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nopen LowStar.BufferOps (* for the !* notation *)\n\nmodule Spec = QUIC.Spec\nmodule Impl = QUIC.Impl\nmodule Lemmas = QUIC.Impl.Lemmas\n\n\n/// Helpers\n/// -------\n\nlet key_len (a: ea): x:U8.t { U8.v x = Spec.Agile.AEAD.key_length a } =\n let open Spec.Agile.AEAD in\n match a with\n | AES128_GCM -> 16uy\n | AES256_GCM -> 32uy\n | CHACHA20_POLY1305 -> 32uy\n\nlet key_len32 a = FStar.Int.Cast.uint8_to_uint32 (key_len a)\n\n\n/// https://tools.ietf.org/html/draft-ietf-quic-tls-23#section-5\n///\n/// We perform the three key derivations (AEAD key; AEAD iv; header protection\n/// key) when ``create`` is called. We thus store the original traffic secret\n/// only ghostly.\n///\n/// We retain the AEAD state, in order to perform the packet payload encryption.\n///\n/// We retain the Cipher state, in order to compute the mask for header protection.\nnoeq\ntype state_s (i: index) =\n | State:\n the_hash_alg:ha { the_hash_alg == i.hash_alg } ->\n the_aead_alg:ea { the_aead_alg == i.aead_alg } ->\n traffic_secret:G.erased (Spec.Hash.Definitions.bytes_hash the_hash_alg) ->\n initial_pn:G.erased PN.packet_number_t ->\n aead_state:EverCrypt.AEAD.state the_aead_alg ->\n iv:EverCrypt.AEAD.iv_p the_aead_alg { B.length iv == 12 } ->\n hp_key:B.buffer Secret.uint8 { B.length hp_key = QUIC.Spec.cipher_keysize the_aead_alg } ->\n pn:B.pointer PN.packet_number_t ->\n ctr_state:CTR.state (as_cipher_alg the_aead_alg) ->\n state_s i", "dependencies": { "source_file": "QUIC.State.fst", "checked_file": "QUIC.State.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "Impl", "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: FStar.Monotonic.HyperStack.mem -> s: QUIC.State.state_s i\n -> Prims.GTot LowStar.Monotonic.Buffer.loc", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.State.index", "FStar.Monotonic.HyperStack.mem", "QUIC.State.state_s", "LowStar.Monotonic.Buffer.loc_union", "EverCrypt.AEAD.footprint", "QUIC.State.__proj__State__item__the_aead_alg", "QUIC.State.__proj__State__item__aead_state", "NotEverCrypt.CTR.footprint", "QUIC.Spec.Crypto.as_cipher_alg", "QUIC.State.__proj__State__item__ctr_state", "LowStar.Monotonic.Buffer.loc_buffer", "Spec.Agile.AEAD.uint8", "LowStar.Buffer.trivial_preorder", "QUIC.State.__proj__State__item__iv", "Lib.IntTypes.uint8", "QUIC.State.__proj__State__item__hp_key", "QUIC.Spec.PacketNumber.Base.packet_number_t", "QUIC.State.__proj__State__item__pn", "LowStar.Monotonic.Buffer.loc" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val footprint_s: #i:index -> HS.mem -> state_s i -> GTot B.loc\nlet footprint_s #i h s =", "completed_definiton": "let open LowStar.Buffer in\n((((AEAD.footprint h (State?.aead_state s)) `loc_union` (CTR.footprint h (State?.ctr_state s)))\n `loc_union`\n (loc_buffer (State?.iv s)))\n `loc_union`\n (loc_buffer (State?.hp_key s)))\n`loc_union`\n(loc_buffer (State?.pn s))", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fst", "name": "QUIC.State.g_initial_packet_number", "original_source_type": "val g_initial_packet_number: #i:index -> (s: state_s i) -> GTot PN.packet_number_t", "source_type": "val g_initial_packet_number: #i:index -> (s: state_s i) -> GTot PN.packet_number_t", "source_definition": "let g_initial_packet_number #i s =\n // New style: automatic insertion of reveal\n State?.initial_pn s", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 73, "start_col": 2, "end_line": 73, "end_col": 21 }, "file_context": "module QUIC.State\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nopen LowStar.BufferOps (* for the !* notation *)\n\nmodule Spec = QUIC.Spec\nmodule Impl = QUIC.Impl\nmodule Lemmas = QUIC.Impl.Lemmas\n\n\n/// Helpers\n/// -------\n\nlet key_len (a: ea): x:U8.t { U8.v x = Spec.Agile.AEAD.key_length a } =\n let open Spec.Agile.AEAD in\n match a with\n | AES128_GCM -> 16uy\n | AES256_GCM -> 32uy\n | CHACHA20_POLY1305 -> 32uy\n\nlet key_len32 a = FStar.Int.Cast.uint8_to_uint32 (key_len a)\n\n\n/// https://tools.ietf.org/html/draft-ietf-quic-tls-23#section-5\n///\n/// We perform the three key derivations (AEAD key; AEAD iv; header protection\n/// key) when ``create`` is called. We thus store the original traffic secret\n/// only ghostly.\n///\n/// We retain the AEAD state, in order to perform the packet payload encryption.\n///\n/// We retain the Cipher state, in order to compute the mask for header protection.\nnoeq\ntype state_s (i: index) =\n | State:\n the_hash_alg:ha { the_hash_alg == i.hash_alg } ->\n the_aead_alg:ea { the_aead_alg == i.aead_alg } ->\n traffic_secret:G.erased (Spec.Hash.Definitions.bytes_hash the_hash_alg) ->\n initial_pn:G.erased PN.packet_number_t ->\n aead_state:EverCrypt.AEAD.state the_aead_alg ->\n iv:EverCrypt.AEAD.iv_p the_aead_alg { B.length iv == 12 } ->\n hp_key:B.buffer Secret.uint8 { B.length hp_key = QUIC.Spec.cipher_keysize the_aead_alg } ->\n pn:B.pointer PN.packet_number_t ->\n ctr_state:CTR.state (as_cipher_alg the_aead_alg) ->\n state_s i\n\nlet footprint_s #i h s =\n let open LowStar.Buffer in\n AEAD.footprint h (State?.aead_state s) `loc_union`\n CTR.footprint h (State?.ctr_state s) `loc_union`\n loc_buffer (State?.iv s) `loc_union`\n loc_buffer (State?.hp_key s) `loc_union`\n loc_buffer (State?.pn s)\n\nlet g_traffic_secret #i s =\n // Automatic reveal insertion doesn't work here\n G.reveal (State?.traffic_secret s)\n\nlet g_initial_packet_number #i s =", "dependencies": { "source_file": "QUIC.State.fst", "checked_file": "QUIC.State.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "Impl", "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: QUIC.State.state_s i -> Prims.GTot QUIC.Spec.PacketNumber.Base.packet_number_t", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.State.index", "QUIC.State.state_s", "FStar.Ghost.reveal", "QUIC.Spec.PacketNumber.Base.packet_number_t", "QUIC.State.__proj__State__item__initial_pn" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val g_initial_packet_number: #i:index -> (s: state_s i) -> GTot PN.packet_number_t\nlet g_initial_packet_number #i s =", "completed_definiton": "State?.initial_pn s", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fst", "name": "QUIC.State.g_last_packet_number", "original_source_type": "val g_last_packet_number: #i:index -> (s: state_s i) -> (h: HS.mem { invariant_s h s }) ->\n GTot (pn: PN.packet_number_t {\n Secret.v pn >= Secret.v (g_initial_packet_number s)\n })", "source_type": "val g_last_packet_number: #i:index -> (s: state_s i) -> (h: HS.mem { invariant_s h s }) ->\n GTot (pn: PN.packet_number_t {\n Secret.v pn >= Secret.v (g_initial_packet_number s)\n })", "source_definition": "let g_last_packet_number #i s h =\n B.deref h (State?.pn s)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 100, "start_col": 2, "end_line": 100, "end_col": 25 }, "file_context": "module QUIC.State\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nopen LowStar.BufferOps (* for the !* notation *)\n\nmodule Spec = QUIC.Spec\nmodule Impl = QUIC.Impl\nmodule Lemmas = QUIC.Impl.Lemmas\n\n\n/// Helpers\n/// -------\n\nlet key_len (a: ea): x:U8.t { U8.v x = Spec.Agile.AEAD.key_length a } =\n let open Spec.Agile.AEAD in\n match a with\n | AES128_GCM -> 16uy\n | AES256_GCM -> 32uy\n | CHACHA20_POLY1305 -> 32uy\n\nlet key_len32 a = FStar.Int.Cast.uint8_to_uint32 (key_len a)\n\n\n/// https://tools.ietf.org/html/draft-ietf-quic-tls-23#section-5\n///\n/// We perform the three key derivations (AEAD key; AEAD iv; header protection\n/// key) when ``create`` is called. We thus store the original traffic secret\n/// only ghostly.\n///\n/// We retain the AEAD state, in order to perform the packet payload encryption.\n///\n/// We retain the Cipher state, in order to compute the mask for header protection.\nnoeq\ntype state_s (i: index) =\n | State:\n the_hash_alg:ha { the_hash_alg == i.hash_alg } ->\n the_aead_alg:ea { the_aead_alg == i.aead_alg } ->\n traffic_secret:G.erased (Spec.Hash.Definitions.bytes_hash the_hash_alg) ->\n initial_pn:G.erased PN.packet_number_t ->\n aead_state:EverCrypt.AEAD.state the_aead_alg ->\n iv:EverCrypt.AEAD.iv_p the_aead_alg { B.length iv == 12 } ->\n hp_key:B.buffer Secret.uint8 { B.length hp_key = QUIC.Spec.cipher_keysize the_aead_alg } ->\n pn:B.pointer PN.packet_number_t ->\n ctr_state:CTR.state (as_cipher_alg the_aead_alg) ->\n state_s i\n\nlet footprint_s #i h s =\n let open LowStar.Buffer in\n AEAD.footprint h (State?.aead_state s) `loc_union`\n CTR.footprint h (State?.ctr_state s) `loc_union`\n loc_buffer (State?.iv s) `loc_union`\n loc_buffer (State?.hp_key s) `loc_union`\n loc_buffer (State?.pn s)\n\nlet g_traffic_secret #i s =\n // Automatic reveal insertion doesn't work here\n G.reveal (State?.traffic_secret s)\n\nlet g_initial_packet_number #i s =\n // New style: automatic insertion of reveal\n State?.initial_pn s\n\nlet invariant_s #i h s =\n let open QUIC.Spec in\n let State hash_alg aead_alg traffic_secret initial_pn aead_state iv hp_key pn ctr_state =\n s in\n hash_is_keysized s; (\n AEAD.invariant h aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n B.(all_live h [ buf iv; buf hp_key; buf pn ]) /\\\n B.(all_disjoint [ CTR.footprint h ctr_state;\n AEAD.footprint h aead_state; loc_buffer iv; loc_buffer hp_key; loc_buffer pn ]) /\\\n // : automatic insertion of reveal does not work here\n Secret.v initial_pn <= Secret.v (B.deref h pn) /\\\n AEAD.as_kv (B.deref h aead_state) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_key (Spec.Agile.AEAD.key_length aead_alg) /\\\n (B.as_seq h iv) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_iv 12 /\\\n B.as_seq h hp_key ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_hp (QUIC.Spec.cipher_keysize aead_alg)\n )\n\nlet invariant_loc_in_footprint #_ _ _ = ()", "dependencies": { "source_file": "QUIC.State.fst", "checked_file": "QUIC.State.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "Impl", "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: QUIC.State.state_s i -> h: FStar.Monotonic.HyperStack.mem{QUIC.State.invariant_s h s}\n -> Prims.GTot\n (pn:\n QUIC.Spec.PacketNumber.Base.packet_number_t\n {QUIC.Secret.Int.Base.v pn >= QUIC.Secret.Int.Base.v (QUIC.State.g_initial_packet_number s)}\n )", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.State.index", "QUIC.State.state_s", "FStar.Monotonic.HyperStack.mem", "QUIC.State.invariant_s", "LowStar.Monotonic.Buffer.deref", "QUIC.Spec.PacketNumber.Base.packet_number_t", "LowStar.Buffer.trivial_preorder", "QUIC.State.__proj__State__item__pn", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "QUIC.State.g_initial_packet_number" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val g_last_packet_number: #i:index -> (s: state_s i) -> (h: HS.mem { invariant_s h s }) ->\n GTot (pn: PN.packet_number_t {\n Secret.v pn >= Secret.v (g_initial_packet_number s)\n })\nlet g_last_packet_number #i s h =", "completed_definiton": "B.deref h (State?.pn s)", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fst", "name": "QUIC.State.hash_alg_of_state", "original_source_type": "val hash_alg_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack ha\n (requires (fun h0 -> invariant #(G.reveal i) h0 s))\n (ensures (fun h0 a h1 ->\n a == (G.reveal i).hash_alg /\\\n h0 == h1))", "source_type": "val hash_alg_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack ha\n (requires (fun h0 -> invariant #(G.reveal i) h0 s))\n (ensures (fun h0 a h1 ->\n a == (G.reveal i).hash_alg /\\\n h0 == h1))", "source_definition": "let hash_alg_of_state #i s =\n let open FStar.HyperStack.ST in (* for the !* notation *)\n let State the_hash_alg _ _ _ _ _ _ _ _ = !*s in\n the_hash_alg", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 111, "start_col": 2, "end_line": 113, "end_col": 14 }, "file_context": "module QUIC.State\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nopen LowStar.BufferOps (* for the !* notation *)\n\nmodule Spec = QUIC.Spec\nmodule Impl = QUIC.Impl\nmodule Lemmas = QUIC.Impl.Lemmas\n\n\n/// Helpers\n/// -------\n\nlet key_len (a: ea): x:U8.t { U8.v x = Spec.Agile.AEAD.key_length a } =\n let open Spec.Agile.AEAD in\n match a with\n | AES128_GCM -> 16uy\n | AES256_GCM -> 32uy\n | CHACHA20_POLY1305 -> 32uy\n\nlet key_len32 a = FStar.Int.Cast.uint8_to_uint32 (key_len a)\n\n\n/// https://tools.ietf.org/html/draft-ietf-quic-tls-23#section-5\n///\n/// We perform the three key derivations (AEAD key; AEAD iv; header protection\n/// key) when ``create`` is called. We thus store the original traffic secret\n/// only ghostly.\n///\n/// We retain the AEAD state, in order to perform the packet payload encryption.\n///\n/// We retain the Cipher state, in order to compute the mask for header protection.\nnoeq\ntype state_s (i: index) =\n | State:\n the_hash_alg:ha { the_hash_alg == i.hash_alg } ->\n the_aead_alg:ea { the_aead_alg == i.aead_alg } ->\n traffic_secret:G.erased (Spec.Hash.Definitions.bytes_hash the_hash_alg) ->\n initial_pn:G.erased PN.packet_number_t ->\n aead_state:EverCrypt.AEAD.state the_aead_alg ->\n iv:EverCrypt.AEAD.iv_p the_aead_alg { B.length iv == 12 } ->\n hp_key:B.buffer Secret.uint8 { B.length hp_key = QUIC.Spec.cipher_keysize the_aead_alg } ->\n pn:B.pointer PN.packet_number_t ->\n ctr_state:CTR.state (as_cipher_alg the_aead_alg) ->\n state_s i\n\nlet footprint_s #i h s =\n let open LowStar.Buffer in\n AEAD.footprint h (State?.aead_state s) `loc_union`\n CTR.footprint h (State?.ctr_state s) `loc_union`\n loc_buffer (State?.iv s) `loc_union`\n loc_buffer (State?.hp_key s) `loc_union`\n loc_buffer (State?.pn s)\n\nlet g_traffic_secret #i s =\n // Automatic reveal insertion doesn't work here\n G.reveal (State?.traffic_secret s)\n\nlet g_initial_packet_number #i s =\n // New style: automatic insertion of reveal\n State?.initial_pn s\n\nlet invariant_s #i h s =\n let open QUIC.Spec in\n let State hash_alg aead_alg traffic_secret initial_pn aead_state iv hp_key pn ctr_state =\n s in\n hash_is_keysized s; (\n AEAD.invariant h aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n B.(all_live h [ buf iv; buf hp_key; buf pn ]) /\\\n B.(all_disjoint [ CTR.footprint h ctr_state;\n AEAD.footprint h aead_state; loc_buffer iv; loc_buffer hp_key; loc_buffer pn ]) /\\\n // : automatic insertion of reveal does not work here\n Secret.v initial_pn <= Secret.v (B.deref h pn) /\\\n AEAD.as_kv (B.deref h aead_state) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_key (Spec.Agile.AEAD.key_length aead_alg) /\\\n (B.as_seq h iv) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_iv 12 /\\\n B.as_seq h hp_key ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_hp (QUIC.Spec.cipher_keysize aead_alg)\n )\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet g_last_packet_number #i s h =\n B.deref h (State?.pn s)\n\nlet frame_invariant #i l s h0 h1 =\n AEAD.frame_invariant l (State?.aead_state (B.deref h0 s)) h0 h1;\n CTR.frame_invariant l (State?.ctr_state (B.deref h0 s)) h0 h1\n\nlet aead_alg_of_state #i s =\n let State _ the_aead_alg _ _ _ _ _ _ _ = !*s in\n the_aead_alg", "dependencies": { "source_file": "QUIC.State.fst", "checked_file": "QUIC.State.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "Impl", "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: QUIC.State.state (FStar.Ghost.reveal i) -> FStar.HyperStack.ST.Stack QUIC.Spec.Crypto.ha", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "FStar.Ghost.erased", "QUIC.State.index", "QUIC.State.state", "FStar.Ghost.reveal", "QUIC.Spec.Crypto.ha", "Prims.eq2", "QUIC.State.__proj__Mkindex__item__hash_alg", "QUIC.Spec.Crypto.ea", "QUIC.State.__proj__Mkindex__item__aead_alg", "Spec.Hash.Definitions.bytes_hash", "QUIC.Spec.PacketNumber.Base.packet_number_t", "EverCrypt.AEAD.state", "EverCrypt.AEAD.iv_p", "Prims.int", "LowStar.Monotonic.Buffer.length", "Spec.Agile.AEAD.uint8", "LowStar.Buffer.trivial_preorder", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "Prims.b2t", "Prims.op_Equality", "Prims.nat", "QUIC.Spec.Crypto.cipher_keysize", "LowStar.Buffer.pointer", "NotEverCrypt.CTR.state", "QUIC.Spec.Crypto.as_cipher_alg", "QUIC.State.state_s", "LowStar.BufferOps.op_Bang_Star" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hash_alg_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack ha\n (requires (fun h0 -> invariant #(G.reveal i) h0 s))\n (ensures (fun h0 a h1 ->\n a == (G.reveal i).hash_alg /\\\n h0 == h1))\nlet hash_alg_of_state #i s =", "completed_definiton": "let open FStar.HyperStack.ST in\nlet State the_hash_alg _ _ _ _ _ _ _ _ = !*s in\nthe_hash_alg", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fst", "name": "QUIC.State.aead_alg_of_state", "original_source_type": "val aead_alg_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack ea\n (requires (fun h0 -> invariant #(G.reveal i) h0 s))\n (ensures (fun h0 a h1 ->\n a == (G.reveal i).aead_alg /\\\n h0 == h1))", "source_type": "val aead_alg_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack ea\n (requires (fun h0 -> invariant #(G.reveal i) h0 s))\n (ensures (fun h0 a h1 ->\n a == (G.reveal i).aead_alg /\\\n h0 == h1))", "source_definition": "let aead_alg_of_state #i s =\n let State _ the_aead_alg _ _ _ _ _ _ _ = !*s in\n the_aead_alg", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 106, "start_col": 28, "end_line": 108, "end_col": 14 }, "file_context": "module QUIC.State\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nopen LowStar.BufferOps (* for the !* notation *)\n\nmodule Spec = QUIC.Spec\nmodule Impl = QUIC.Impl\nmodule Lemmas = QUIC.Impl.Lemmas\n\n\n/// Helpers\n/// -------\n\nlet key_len (a: ea): x:U8.t { U8.v x = Spec.Agile.AEAD.key_length a } =\n let open Spec.Agile.AEAD in\n match a with\n | AES128_GCM -> 16uy\n | AES256_GCM -> 32uy\n | CHACHA20_POLY1305 -> 32uy\n\nlet key_len32 a = FStar.Int.Cast.uint8_to_uint32 (key_len a)\n\n\n/// https://tools.ietf.org/html/draft-ietf-quic-tls-23#section-5\n///\n/// We perform the three key derivations (AEAD key; AEAD iv; header protection\n/// key) when ``create`` is called. We thus store the original traffic secret\n/// only ghostly.\n///\n/// We retain the AEAD state, in order to perform the packet payload encryption.\n///\n/// We retain the Cipher state, in order to compute the mask for header protection.\nnoeq\ntype state_s (i: index) =\n | State:\n the_hash_alg:ha { the_hash_alg == i.hash_alg } ->\n the_aead_alg:ea { the_aead_alg == i.aead_alg } ->\n traffic_secret:G.erased (Spec.Hash.Definitions.bytes_hash the_hash_alg) ->\n initial_pn:G.erased PN.packet_number_t ->\n aead_state:EverCrypt.AEAD.state the_aead_alg ->\n iv:EverCrypt.AEAD.iv_p the_aead_alg { B.length iv == 12 } ->\n hp_key:B.buffer Secret.uint8 { B.length hp_key = QUIC.Spec.cipher_keysize the_aead_alg } ->\n pn:B.pointer PN.packet_number_t ->\n ctr_state:CTR.state (as_cipher_alg the_aead_alg) ->\n state_s i\n\nlet footprint_s #i h s =\n let open LowStar.Buffer in\n AEAD.footprint h (State?.aead_state s) `loc_union`\n CTR.footprint h (State?.ctr_state s) `loc_union`\n loc_buffer (State?.iv s) `loc_union`\n loc_buffer (State?.hp_key s) `loc_union`\n loc_buffer (State?.pn s)\n\nlet g_traffic_secret #i s =\n // Automatic reveal insertion doesn't work here\n G.reveal (State?.traffic_secret s)\n\nlet g_initial_packet_number #i s =\n // New style: automatic insertion of reveal\n State?.initial_pn s\n\nlet invariant_s #i h s =\n let open QUIC.Spec in\n let State hash_alg aead_alg traffic_secret initial_pn aead_state iv hp_key pn ctr_state =\n s in\n hash_is_keysized s; (\n AEAD.invariant h aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n B.(all_live h [ buf iv; buf hp_key; buf pn ]) /\\\n B.(all_disjoint [ CTR.footprint h ctr_state;\n AEAD.footprint h aead_state; loc_buffer iv; loc_buffer hp_key; loc_buffer pn ]) /\\\n // : automatic insertion of reveal does not work here\n Secret.v initial_pn <= Secret.v (B.deref h pn) /\\\n AEAD.as_kv (B.deref h aead_state) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_key (Spec.Agile.AEAD.key_length aead_alg) /\\\n (B.as_seq h iv) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_iv 12 /\\\n B.as_seq h hp_key ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_hp (QUIC.Spec.cipher_keysize aead_alg)\n )\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet g_last_packet_number #i s h =\n B.deref h (State?.pn s)\n\nlet frame_invariant #i l s h0 h1 =\n AEAD.frame_invariant l (State?.aead_state (B.deref h0 s)) h0 h1;\n CTR.frame_invariant l (State?.ctr_state (B.deref h0 s)) h0 h1", "dependencies": { "source_file": "QUIC.State.fst", "checked_file": "QUIC.State.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "Impl", "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: QUIC.State.state (FStar.Ghost.reveal i) -> FStar.HyperStack.ST.Stack QUIC.Spec.Crypto.ea", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "FStar.Ghost.erased", "QUIC.State.index", "QUIC.State.state", "FStar.Ghost.reveal", "QUIC.Spec.Crypto.ha", "Prims.eq2", "QUIC.State.__proj__Mkindex__item__hash_alg", "QUIC.Spec.Crypto.ea", "QUIC.State.__proj__Mkindex__item__aead_alg", "Spec.Hash.Definitions.bytes_hash", "QUIC.Spec.PacketNumber.Base.packet_number_t", "EverCrypt.AEAD.state", "EverCrypt.AEAD.iv_p", "Prims.int", "LowStar.Monotonic.Buffer.length", "Spec.Agile.AEAD.uint8", "LowStar.Buffer.trivial_preorder", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "Prims.b2t", "Prims.op_Equality", "Prims.nat", "QUIC.Spec.Crypto.cipher_keysize", "LowStar.Buffer.pointer", "NotEverCrypt.CTR.state", "QUIC.Spec.Crypto.as_cipher_alg", "QUIC.State.state_s", "LowStar.BufferOps.op_Bang_Star" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val aead_alg_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack ea\n (requires (fun h0 -> invariant #(G.reveal i) h0 s))\n (ensures (fun h0 a h1 ->\n a == (G.reveal i).aead_alg /\\\n h0 == h1))\nlet aead_alg_of_state #i s =", "completed_definiton": "let State _ the_aead_alg _ _ _ _ _ _ _ = !*s in\nthe_aead_alg", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fst", "name": "QUIC.State.key_len", "original_source_type": "val key_len (a: ea) : x: U8.t{U8.v x = Spec.Agile.AEAD.key_length a}", "source_type": "val key_len (a: ea) : x: U8.t{U8.v x = Spec.Agile.AEAD.key_length a}", "source_definition": "let key_len (a: ea): x:U8.t { U8.v x = Spec.Agile.AEAD.key_length a } =\n let open Spec.Agile.AEAD in\n match a with\n | AES128_GCM -> 16uy\n | AES256_GCM -> 32uy\n | CHACHA20_POLY1305 -> 32uy", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 27, "start_col": 2, "end_line": 31, "end_col": 29 }, "file_context": "module QUIC.State\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nopen LowStar.BufferOps (* for the !* notation *)\n\nmodule Spec = QUIC.Spec\nmodule Impl = QUIC.Impl\nmodule Lemmas = QUIC.Impl.Lemmas\n\n\n/// Helpers\n/// -------", "dependencies": { "source_file": "QUIC.State.fst", "checked_file": "QUIC.State.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "Impl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: QUIC.Spec.Crypto.ea -> x: FStar.UInt8.t{FStar.UInt8.v x = Spec.Agile.AEAD.key_length a}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "FStar.UInt8.__uint_to_t", "FStar.UInt8.t", "Prims.b2t", "Prims.op_Equality", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt8.n", "FStar.Integers.op_Greater_Equals", "FStar.Integers.Signed", "FStar.Integers.Winfinite", "FStar.UInt8.v", "Spec.Agile.AEAD.key_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val key_len (a: ea) : x: U8.t{U8.v x = Spec.Agile.AEAD.key_length a}\nlet key_len (a: ea) : x: U8.t{U8.v x = Spec.Agile.AEAD.key_length a} =", "completed_definiton": "let open Spec.Agile.AEAD in\nmatch a with\n| AES128_GCM -> 16uy\n| AES256_GCM -> 32uy\n| CHACHA20_POLY1305 -> 32uy", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fst", "name": "QUIC.State.server_in", "original_source_type": "val server_in:server_in: B.buffer U8.t {B.length server_in = 9 /\\ B.recallable server_in}", "source_type": "val server_in:server_in: B.buffer U8.t {B.length server_in = 9 /\\ B.recallable server_in}", "source_definition": "let server_in: server_in:B.buffer U8.t {\n B.length server_in = 9 /\\\n B.recallable server_in\n} =\n [@inline_let]\n let l = [\n 0x73uy; 0x65uy; 0x72uy; 0x76uy; 0x65uy; 0x72uy; 0x20uy; 0x69uy; 0x6euy\n ] in\n assert_norm (List.Tot.length l = 9);\n B.gcmalloc_of_list HS.root l", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 359, "start_col": 2, "end_line": 364, "end_col": 30 }, "file_context": "module QUIC.State\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nopen LowStar.BufferOps (* for the !* notation *)\n\nmodule Spec = QUIC.Spec\nmodule Impl = QUIC.Impl\nmodule Lemmas = QUIC.Impl.Lemmas\n\n\n/// Helpers\n/// -------\n\nlet key_len (a: ea): x:U8.t { U8.v x = Spec.Agile.AEAD.key_length a } =\n let open Spec.Agile.AEAD in\n match a with\n | AES128_GCM -> 16uy\n | AES256_GCM -> 32uy\n | CHACHA20_POLY1305 -> 32uy\n\nlet key_len32 a = FStar.Int.Cast.uint8_to_uint32 (key_len a)\n\n\n/// https://tools.ietf.org/html/draft-ietf-quic-tls-23#section-5\n///\n/// We perform the three key derivations (AEAD key; AEAD iv; header protection\n/// key) when ``create`` is called. We thus store the original traffic secret\n/// only ghostly.\n///\n/// We retain the AEAD state, in order to perform the packet payload encryption.\n///\n/// We retain the Cipher state, in order to compute the mask for header protection.\nnoeq\ntype state_s (i: index) =\n | State:\n the_hash_alg:ha { the_hash_alg == i.hash_alg } ->\n the_aead_alg:ea { the_aead_alg == i.aead_alg } ->\n traffic_secret:G.erased (Spec.Hash.Definitions.bytes_hash the_hash_alg) ->\n initial_pn:G.erased PN.packet_number_t ->\n aead_state:EverCrypt.AEAD.state the_aead_alg ->\n iv:EverCrypt.AEAD.iv_p the_aead_alg { B.length iv == 12 } ->\n hp_key:B.buffer Secret.uint8 { B.length hp_key = QUIC.Spec.cipher_keysize the_aead_alg } ->\n pn:B.pointer PN.packet_number_t ->\n ctr_state:CTR.state (as_cipher_alg the_aead_alg) ->\n state_s i\n\nlet footprint_s #i h s =\n let open LowStar.Buffer in\n AEAD.footprint h (State?.aead_state s) `loc_union`\n CTR.footprint h (State?.ctr_state s) `loc_union`\n loc_buffer (State?.iv s) `loc_union`\n loc_buffer (State?.hp_key s) `loc_union`\n loc_buffer (State?.pn s)\n\nlet g_traffic_secret #i s =\n // Automatic reveal insertion doesn't work here\n G.reveal (State?.traffic_secret s)\n\nlet g_initial_packet_number #i s =\n // New style: automatic insertion of reveal\n State?.initial_pn s\n\nlet invariant_s #i h s =\n let open QUIC.Spec in\n let State hash_alg aead_alg traffic_secret initial_pn aead_state iv hp_key pn ctr_state =\n s in\n hash_is_keysized s; (\n AEAD.invariant h aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n B.(all_live h [ buf iv; buf hp_key; buf pn ]) /\\\n B.(all_disjoint [ CTR.footprint h ctr_state;\n AEAD.footprint h aead_state; loc_buffer iv; loc_buffer hp_key; loc_buffer pn ]) /\\\n // : automatic insertion of reveal does not work here\n Secret.v initial_pn <= Secret.v (B.deref h pn) /\\\n AEAD.as_kv (B.deref h aead_state) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_key (Spec.Agile.AEAD.key_length aead_alg) /\\\n (B.as_seq h iv) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_iv 12 /\\\n B.as_seq h hp_key ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_hp (QUIC.Spec.cipher_keysize aead_alg)\n )\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet g_last_packet_number #i s h =\n B.deref h (State?.pn s)\n\nlet frame_invariant #i l s h0 h1 =\n AEAD.frame_invariant l (State?.aead_state (B.deref h0 s)) h0 h1;\n CTR.frame_invariant l (State?.ctr_state (B.deref h0 s)) h0 h1\n\nlet aead_alg_of_state #i s =\n let State _ the_aead_alg _ _ _ _ _ _ _ = !*s in\n the_aead_alg\n\nlet hash_alg_of_state #i s =\n let open FStar.HyperStack.ST in (* for the !* notation *)\n let State the_hash_alg _ _ _ _ _ _ _ _ = !*s in\n the_hash_alg\n\nlet last_packet_number_of_state #i s =\n let State _ _ _ _ _ _ _ pn _ = !*s in\n !*pn\n\n\n/// For functions that perform allocations, or even functions that need\n/// temporary state, a style we adopt here is to write the core (i.e. what would\n/// normally go in-between push and pop frame) as a separate function. If\n/// needed, the core of the function takes its temporary allocations as\n/// parameters, and reasons abstractly against a region where the temporary\n/// allocations live. This gives significantly better proof performance.\n///\n/// Another bit of style: after every stateful operation, we restore manually:\n/// the modifies clause (going directly for the one we want); the invariant; the\n/// footprint preservation; then the functional correctness propertise we are\n/// seeking.\n\nval create_in_core:\n i:index ->\n r:HS.rid ->\n dst: B.pointer (B.pointer_or_null (state_s i)) ->\n initial_pn:PN.packet_number_t ->\n traffic_secret:B.buffer Secret.uint8 {\n B.length traffic_secret = Spec.Hash.Definitions.hash_length i.hash_alg\n } ->\n aead_state:AEAD.state i.aead_alg ->\n ctr_state:CTR.state (as_cipher_alg i.aead_alg) ->\n HST.ST unit\n (requires fun h0 ->\n Lemmas.hash_is_keysized_ i.hash_alg; (\n HST.is_eternal_region r /\\\n B.live h0 dst /\\ B.live h0 traffic_secret /\\\n B.(all_disjoint [ AEAD.footprint h0 aead_state; CTR.footprint h0 ctr_state;\n loc_buffer dst; loc_buffer traffic_secret ]) /\\\n B.(loc_includes (loc_region_only true r) (AEAD.footprint h0 aead_state)) /\\\n B.(loc_includes (loc_region_only true r) (CTR.footprint h0 ctr_state)) /\\\n\n // Whatever from the invariant ought to be established already.\n AEAD.invariant h0 aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h0 ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n AEAD.as_kv (B.deref h0 aead_state) ==\n QUIC.Spec.(derive_secret i.hash_alg (B.as_seq h0 traffic_secret) label_key\n (Spec.Agile.AEAD.key_length i.aead_alg))))\n (ensures (fun h0 _ h1 ->\n let s = B.deref h1 dst in\n not (B.g_is_null s) /\\\n invariant h1 s /\\\n\n B.(modifies (loc_buffer dst) h0 h1) /\\ (\n let State _ _ _ initial_pn' aead_state' iv' hp_key' pn' ctr_state' = B.deref h1 s in\n aead_state' == aead_state /\\\n ctr_state' == ctr_state /\\\n B.(fresh_loc (loc_buffer iv') h0 h1) /\\\n B.(fresh_loc (loc_buffer hp_key') h0 h1) /\\\n B.(fresh_loc (loc_buffer pn') h0 h1) /\\\n B.(fresh_loc (loc_addr_of_buffer s) h0 h1) /\\\n\n g_traffic_secret (B.deref h1 s) == B.as_seq h0 traffic_secret /\\ \n g_last_packet_number (B.deref h1 s) h1 == initial_pn /\\\n\n G.reveal initial_pn' == initial_pn)))\n\n#push-options \"--z3rlimit 50\"\nlet create_in_core i r dst initial_pn traffic_secret aead_state ctr_state =\n LowStar.ImmutableBuffer.recall Impl.label_key;\n LowStar.ImmutableBuffer.recall_contents Impl.label_key Spec.label_key;\n LowStar.ImmutableBuffer.recall Impl.label_iv;\n LowStar.ImmutableBuffer.recall_contents Impl.label_iv Spec.label_iv;\n LowStar.ImmutableBuffer.recall Impl.label_hp;\n LowStar.ImmutableBuffer.recall_contents Impl.label_hp Spec.label_hp;\n\n (**) let h0 = HST.get () in\n (**) assert_norm FStar.Mul.(8 * 12 <= pow2 64 - 1);\n\n // The modifies clauses that we will transitively carry across this function body.\n let mloc = G.hide (B.(loc_buffer dst `loc_union` loc_unused_in h0)) in\n let e_traffic_secret: G.erased (Spec.Hash.Definitions.bytes_hash i.hash_alg) =\n G.hide (B.as_seq h0 traffic_secret) in\n let e_initial_pn: G.erased PN.packet_number_t = G.hide (initial_pn) in\n\n let iv = B.malloc r (Secret.to_u8 0uy) 12ul in\n let hp_key = B.malloc r (Secret.to_u8 0uy) (key_len32 i.aead_alg) in\n let pn = B.malloc r initial_pn 1ul in\n (**) let h1 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h0 h1 loc_none);\n (**) assert (B.length hp_key = QUIC.Spec.cipher_keysize i.aead_alg);\n\n let s: state_s i = State #i\n i.hash_alg i.aead_alg e_traffic_secret e_initial_pn\n aead_state iv hp_key pn ctr_state\n in\n\n let s:B.pointer_or_null (state_s i) = B.malloc r s 1ul in\n (**) let h2 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h1 h2 loc_none);\n (**) B.(modifies_trans (G.reveal mloc) h0 h1 (G.reveal mloc) h2);\n\n Impl.derive_secret i.hash_alg iv 12uy traffic_secret Impl.label_iv 2uy;\n (**) let h3 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h2 h3 (loc_buffer iv));\n (**) B.(modifies_trans (G.reveal mloc) h0 h2 (G.reveal mloc) h3);\n\n Impl.derive_secret i.hash_alg hp_key (key_len i.aead_alg) traffic_secret Impl.label_hp 2uy;\n (**) let h4 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h3 h4 (loc_buffer hp_key));\n (**) B.(modifies_trans (G.reveal mloc) h0 h3 (G.reveal mloc) h4);\n\n dst *= s;\n (**) let h5 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h4 h5 (loc_buffer dst));\n (**) B.(modifies_trans (G.reveal mloc) h0 h4 (G.reveal mloc) h5);\n (**) B.(modifies_only_not_unused_in (loc_buffer dst) h0 h5)\n#pop-options\n\n#restart-solver\n\n#push-options \"--z3rlimit 512\"\nlet create_in i r dst initial_pn traffic_secret =\n LowStar.ImmutableBuffer.recall Impl.label_key;\n LowStar.ImmutableBuffer.recall_contents Impl.label_key Spec.label_key;\n\n (**) let h0 = HST.get () in\n\n HST.push_frame ();\n (**) let h1 = HST.get () in\n let mloc = G.hide (B.(loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst\n `loc_union` loc_unused_in h0)) in\n\n let aead_key = B.alloca (Secret.to_u8 0uy) (key_len32 i.aead_alg) in\n let aead_state: B.pointer (B.pointer_or_null (AEAD.state_s i.aead_alg)) =\n B.alloca B.null 1ul in\n let ctr_state: B.pointer (B.pointer_or_null (CTR.state_s (as_cipher_alg i.aead_alg))) =\n B.alloca (B.null #(CTR.state_s (as_cipher_alg i.aead_alg))) 1ul in\n let dummy_iv = B.alloca (Secret.to_u8 0uy) 12ul in\n\n (**) let h2 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h1 h2 (loc_none));\n\n Impl.derive_secret i.hash_alg aead_key (key_len i.aead_alg) traffic_secret Impl.label_key 3uy;\n (**) let h3 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h2 h3 (loc_buffer aead_key));\n (**) B.(modifies_trans (G.reveal mloc) h1 h2 (G.reveal mloc) h3);\n\n let ret = AEAD.create_in #i.aead_alg r aead_state aead_key in\n (**) let h4 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h3 h4 (loc_buffer aead_state));\n (**) B.(modifies_trans (G.reveal mloc) h1 h3 (G.reveal mloc) h4);\n\n let ret' = CTR.create_in (as_cipher_alg i.aead_alg) r ctr_state aead_key dummy_iv 12ul 0ul in\n (**) let h5 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h4 h5 (loc_buffer ctr_state));\n (**) B.(modifies_trans (G.reveal mloc) h1 h4 (G.reveal mloc) h5);\n (**) B.(modifies_only_not_unused_in B.(loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst) h1 h5);\n\n match ret with\n | UnsupportedAlgorithm ->\n HST.pop_frame ();\n (**) let h6 = HST.get () in\n (**) B.(modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h5 h6);\n UnsupportedAlgorithm\n\n | Success ->\n\n match ret' with\n | UnsupportedAlgorithm ->\n HST.pop_frame ();\n (**) let h6 = HST.get () in\n (**) B.(modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h5 h6);\n UnsupportedAlgorithm\n\n | Success ->\n\n let aead_state: AEAD.state i.aead_alg = !*aead_state in\n (**) assert (AEAD.invariant h5 aead_state);\n\n let ctr_state: CTR.state (as_cipher_alg i.aead_alg) = !*ctr_state in\n (**) assert (CTR.invariant h5 ctr_state);\n\n create_in_core i r dst initial_pn traffic_secret aead_state ctr_state;\n (**) let h6 = HST.get () in\n\n (**) B.(modifies_loc_includes\n (loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst) h5 h6\n (loc_buffer dst));\n (**) B.(modifies_trans\n (loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst)\n h1 h5\n (loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst)\n h6);\n\n HST.pop_frame ();\n (**) let h7 = HST.get () in\n (**) B.(modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h6 h7);\n (**) frame_invariant (B.loc_region_only false (HS.get_tip h6)) (B.deref h7 dst) h6 h7;\n\n Success\n#pop-options\n\n#push-options \"--z3rlimit 64\"\n\nlet encrypt\n #i s dst dst_pn h plain plain_len\n=\n let m0 = HST.get () in\n let State hash_alg aead_alg e_traffic_secret e_initial_pn\n aead_state iv hp_key bpn ctr_state = !*s\n in\n let last_pn = !* bpn in\n let pn = last_pn `Secret.add` Secret.to_u64 1uL in\n B.upd bpn 0ul pn;\n B.upd dst_pn 0ul pn;\n let m1 = HST.get () in\n assert (B.modifies (footprint m0 s `B.loc_union` B.loc_buffer dst_pn) m0 m1);\n frame_header h pn (footprint m0 s `B.loc_union` B.loc_buffer dst_pn) m0 m1;\n Impl.encrypt aead_alg aead_state iv ctr_state hp_key dst h pn plain (Secret.to_u32 plain_len)\n\n#pop-options\n\n\n/// Initial secrets\n/// ---------------\n\n// TODO: these three should be immutable buffers but we don't have const\n// pointers yet for HKDF.\n#push-options \"--warn_error -272\"\nlet initial_salt: initial_salt:B.buffer U8.t {\n B.length initial_salt = 20 /\\\n B.recallable initial_salt\n} =\n [@inline_let]\n let l = [\n 0xc3uy; 0xeeuy; 0xf7uy; 0x12uy; 0xc7uy; 0x2euy; 0xbbuy; 0x5auy;\n 0x11uy; 0xa7uy; 0xd2uy; 0x43uy; 0x2buy; 0xb4uy; 0x63uy; 0x65uy;\n 0xbeuy; 0xf9uy; 0xf5uy; 0x02uy\n ] in\n assert_norm (List.Tot.length l = 20);\n B.gcmalloc_of_list HS.root l\n\nlet server_in: server_in:B.buffer U8.t {\n B.length server_in = 9 /\\\n B.recallable server_in", "dependencies": { "source_file": "QUIC.State.fst", "checked_file": "QUIC.State.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "Impl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "server_in:\nLowStar.Buffer.buffer FStar.UInt8.t\n {LowStar.Monotonic.Buffer.length server_in = 9 /\\ LowStar.Monotonic.Buffer.recallable server_in}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.gcmalloc_of_list", "FStar.UInt8.t", "FStar.Monotonic.HyperHeap.root", "LowStar.Monotonic.Buffer.mbuffer", "LowStar.Buffer.trivial_preorder", "Prims.l_and", "Prims.eq2", "Prims.nat", "LowStar.Monotonic.Buffer.length", "FStar.Pervasives.normalize_term", "FStar.List.Tot.Base.length", "Prims.b2t", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "FStar.Monotonic.HyperHeap.rid", "LowStar.Monotonic.Buffer.frameOf", "LowStar.Monotonic.Buffer.recallable", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.op_Equality", "Prims.int", "LowStar.Buffer.buffer", "Prims.list", "Prims.Cons", "FStar.UInt8.__uint_to_t", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val server_in:server_in: B.buffer U8.t {B.length server_in = 9 /\\ B.recallable server_in}\nlet server_in:server_in: B.buffer U8.t {B.length server_in = 9 /\\ B.recallable server_in} =", "completed_definiton": "[@@ inline_let ]let l = [0x73uy; 0x65uy; 0x72uy; 0x76uy; 0x65uy; 0x72uy; 0x20uy; 0x69uy; 0x6euy] in\nassert_norm (List.Tot.length l = 9);\nB.gcmalloc_of_list HS.root l", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fst", "name": "QUIC.State.initial_salt", "original_source_type": "val initial_salt:initial_salt:\nB.buffer U8.t {B.length initial_salt = 20 /\\ B.recallable initial_salt}", "source_type": "val initial_salt:initial_salt:\nB.buffer U8.t {B.length initial_salt = 20 /\\ B.recallable initial_salt}", "source_definition": "let initial_salt: initial_salt:B.buffer U8.t {\n B.length initial_salt = 20 /\\\n B.recallable initial_salt\n} =\n [@inline_let]\n let l = [\n 0xc3uy; 0xeeuy; 0xf7uy; 0x12uy; 0xc7uy; 0x2euy; 0xbbuy; 0x5auy;\n 0x11uy; 0xa7uy; 0xd2uy; 0x43uy; 0x2buy; 0xb4uy; 0x63uy; 0x65uy;\n 0xbeuy; 0xf9uy; 0xf5uy; 0x02uy\n ] in\n assert_norm (List.Tot.length l = 20);\n B.gcmalloc_of_list HS.root l", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 346, "start_col": 2, "end_line": 353, "end_col": 30 }, "file_context": "module QUIC.State\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nopen LowStar.BufferOps (* for the !* notation *)\n\nmodule Spec = QUIC.Spec\nmodule Impl = QUIC.Impl\nmodule Lemmas = QUIC.Impl.Lemmas\n\n\n/// Helpers\n/// -------\n\nlet key_len (a: ea): x:U8.t { U8.v x = Spec.Agile.AEAD.key_length a } =\n let open Spec.Agile.AEAD in\n match a with\n | AES128_GCM -> 16uy\n | AES256_GCM -> 32uy\n | CHACHA20_POLY1305 -> 32uy\n\nlet key_len32 a = FStar.Int.Cast.uint8_to_uint32 (key_len a)\n\n\n/// https://tools.ietf.org/html/draft-ietf-quic-tls-23#section-5\n///\n/// We perform the three key derivations (AEAD key; AEAD iv; header protection\n/// key) when ``create`` is called. We thus store the original traffic secret\n/// only ghostly.\n///\n/// We retain the AEAD state, in order to perform the packet payload encryption.\n///\n/// We retain the Cipher state, in order to compute the mask for header protection.\nnoeq\ntype state_s (i: index) =\n | State:\n the_hash_alg:ha { the_hash_alg == i.hash_alg } ->\n the_aead_alg:ea { the_aead_alg == i.aead_alg } ->\n traffic_secret:G.erased (Spec.Hash.Definitions.bytes_hash the_hash_alg) ->\n initial_pn:G.erased PN.packet_number_t ->\n aead_state:EverCrypt.AEAD.state the_aead_alg ->\n iv:EverCrypt.AEAD.iv_p the_aead_alg { B.length iv == 12 } ->\n hp_key:B.buffer Secret.uint8 { B.length hp_key = QUIC.Spec.cipher_keysize the_aead_alg } ->\n pn:B.pointer PN.packet_number_t ->\n ctr_state:CTR.state (as_cipher_alg the_aead_alg) ->\n state_s i\n\nlet footprint_s #i h s =\n let open LowStar.Buffer in\n AEAD.footprint h (State?.aead_state s) `loc_union`\n CTR.footprint h (State?.ctr_state s) `loc_union`\n loc_buffer (State?.iv s) `loc_union`\n loc_buffer (State?.hp_key s) `loc_union`\n loc_buffer (State?.pn s)\n\nlet g_traffic_secret #i s =\n // Automatic reveal insertion doesn't work here\n G.reveal (State?.traffic_secret s)\n\nlet g_initial_packet_number #i s =\n // New style: automatic insertion of reveal\n State?.initial_pn s\n\nlet invariant_s #i h s =\n let open QUIC.Spec in\n let State hash_alg aead_alg traffic_secret initial_pn aead_state iv hp_key pn ctr_state =\n s in\n hash_is_keysized s; (\n AEAD.invariant h aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n B.(all_live h [ buf iv; buf hp_key; buf pn ]) /\\\n B.(all_disjoint [ CTR.footprint h ctr_state;\n AEAD.footprint h aead_state; loc_buffer iv; loc_buffer hp_key; loc_buffer pn ]) /\\\n // : automatic insertion of reveal does not work here\n Secret.v initial_pn <= Secret.v (B.deref h pn) /\\\n AEAD.as_kv (B.deref h aead_state) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_key (Spec.Agile.AEAD.key_length aead_alg) /\\\n (B.as_seq h iv) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_iv 12 /\\\n B.as_seq h hp_key ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_hp (QUIC.Spec.cipher_keysize aead_alg)\n )\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet g_last_packet_number #i s h =\n B.deref h (State?.pn s)\n\nlet frame_invariant #i l s h0 h1 =\n AEAD.frame_invariant l (State?.aead_state (B.deref h0 s)) h0 h1;\n CTR.frame_invariant l (State?.ctr_state (B.deref h0 s)) h0 h1\n\nlet aead_alg_of_state #i s =\n let State _ the_aead_alg _ _ _ _ _ _ _ = !*s in\n the_aead_alg\n\nlet hash_alg_of_state #i s =\n let open FStar.HyperStack.ST in (* for the !* notation *)\n let State the_hash_alg _ _ _ _ _ _ _ _ = !*s in\n the_hash_alg\n\nlet last_packet_number_of_state #i s =\n let State _ _ _ _ _ _ _ pn _ = !*s in\n !*pn\n\n\n/// For functions that perform allocations, or even functions that need\n/// temporary state, a style we adopt here is to write the core (i.e. what would\n/// normally go in-between push and pop frame) as a separate function. If\n/// needed, the core of the function takes its temporary allocations as\n/// parameters, and reasons abstractly against a region where the temporary\n/// allocations live. This gives significantly better proof performance.\n///\n/// Another bit of style: after every stateful operation, we restore manually:\n/// the modifies clause (going directly for the one we want); the invariant; the\n/// footprint preservation; then the functional correctness propertise we are\n/// seeking.\n\nval create_in_core:\n i:index ->\n r:HS.rid ->\n dst: B.pointer (B.pointer_or_null (state_s i)) ->\n initial_pn:PN.packet_number_t ->\n traffic_secret:B.buffer Secret.uint8 {\n B.length traffic_secret = Spec.Hash.Definitions.hash_length i.hash_alg\n } ->\n aead_state:AEAD.state i.aead_alg ->\n ctr_state:CTR.state (as_cipher_alg i.aead_alg) ->\n HST.ST unit\n (requires fun h0 ->\n Lemmas.hash_is_keysized_ i.hash_alg; (\n HST.is_eternal_region r /\\\n B.live h0 dst /\\ B.live h0 traffic_secret /\\\n B.(all_disjoint [ AEAD.footprint h0 aead_state; CTR.footprint h0 ctr_state;\n loc_buffer dst; loc_buffer traffic_secret ]) /\\\n B.(loc_includes (loc_region_only true r) (AEAD.footprint h0 aead_state)) /\\\n B.(loc_includes (loc_region_only true r) (CTR.footprint h0 ctr_state)) /\\\n\n // Whatever from the invariant ought to be established already.\n AEAD.invariant h0 aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h0 ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n AEAD.as_kv (B.deref h0 aead_state) ==\n QUIC.Spec.(derive_secret i.hash_alg (B.as_seq h0 traffic_secret) label_key\n (Spec.Agile.AEAD.key_length i.aead_alg))))\n (ensures (fun h0 _ h1 ->\n let s = B.deref h1 dst in\n not (B.g_is_null s) /\\\n invariant h1 s /\\\n\n B.(modifies (loc_buffer dst) h0 h1) /\\ (\n let State _ _ _ initial_pn' aead_state' iv' hp_key' pn' ctr_state' = B.deref h1 s in\n aead_state' == aead_state /\\\n ctr_state' == ctr_state /\\\n B.(fresh_loc (loc_buffer iv') h0 h1) /\\\n B.(fresh_loc (loc_buffer hp_key') h0 h1) /\\\n B.(fresh_loc (loc_buffer pn') h0 h1) /\\\n B.(fresh_loc (loc_addr_of_buffer s) h0 h1) /\\\n\n g_traffic_secret (B.deref h1 s) == B.as_seq h0 traffic_secret /\\ \n g_last_packet_number (B.deref h1 s) h1 == initial_pn /\\\n\n G.reveal initial_pn' == initial_pn)))\n\n#push-options \"--z3rlimit 50\"\nlet create_in_core i r dst initial_pn traffic_secret aead_state ctr_state =\n LowStar.ImmutableBuffer.recall Impl.label_key;\n LowStar.ImmutableBuffer.recall_contents Impl.label_key Spec.label_key;\n LowStar.ImmutableBuffer.recall Impl.label_iv;\n LowStar.ImmutableBuffer.recall_contents Impl.label_iv Spec.label_iv;\n LowStar.ImmutableBuffer.recall Impl.label_hp;\n LowStar.ImmutableBuffer.recall_contents Impl.label_hp Spec.label_hp;\n\n (**) let h0 = HST.get () in\n (**) assert_norm FStar.Mul.(8 * 12 <= pow2 64 - 1);\n\n // The modifies clauses that we will transitively carry across this function body.\n let mloc = G.hide (B.(loc_buffer dst `loc_union` loc_unused_in h0)) in\n let e_traffic_secret: G.erased (Spec.Hash.Definitions.bytes_hash i.hash_alg) =\n G.hide (B.as_seq h0 traffic_secret) in\n let e_initial_pn: G.erased PN.packet_number_t = G.hide (initial_pn) in\n\n let iv = B.malloc r (Secret.to_u8 0uy) 12ul in\n let hp_key = B.malloc r (Secret.to_u8 0uy) (key_len32 i.aead_alg) in\n let pn = B.malloc r initial_pn 1ul in\n (**) let h1 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h0 h1 loc_none);\n (**) assert (B.length hp_key = QUIC.Spec.cipher_keysize i.aead_alg);\n\n let s: state_s i = State #i\n i.hash_alg i.aead_alg e_traffic_secret e_initial_pn\n aead_state iv hp_key pn ctr_state\n in\n\n let s:B.pointer_or_null (state_s i) = B.malloc r s 1ul in\n (**) let h2 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h1 h2 loc_none);\n (**) B.(modifies_trans (G.reveal mloc) h0 h1 (G.reveal mloc) h2);\n\n Impl.derive_secret i.hash_alg iv 12uy traffic_secret Impl.label_iv 2uy;\n (**) let h3 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h2 h3 (loc_buffer iv));\n (**) B.(modifies_trans (G.reveal mloc) h0 h2 (G.reveal mloc) h3);\n\n Impl.derive_secret i.hash_alg hp_key (key_len i.aead_alg) traffic_secret Impl.label_hp 2uy;\n (**) let h4 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h3 h4 (loc_buffer hp_key));\n (**) B.(modifies_trans (G.reveal mloc) h0 h3 (G.reveal mloc) h4);\n\n dst *= s;\n (**) let h5 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h4 h5 (loc_buffer dst));\n (**) B.(modifies_trans (G.reveal mloc) h0 h4 (G.reveal mloc) h5);\n (**) B.(modifies_only_not_unused_in (loc_buffer dst) h0 h5)\n#pop-options\n\n#restart-solver\n\n#push-options \"--z3rlimit 512\"\nlet create_in i r dst initial_pn traffic_secret =\n LowStar.ImmutableBuffer.recall Impl.label_key;\n LowStar.ImmutableBuffer.recall_contents Impl.label_key Spec.label_key;\n\n (**) let h0 = HST.get () in\n\n HST.push_frame ();\n (**) let h1 = HST.get () in\n let mloc = G.hide (B.(loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst\n `loc_union` loc_unused_in h0)) in\n\n let aead_key = B.alloca (Secret.to_u8 0uy) (key_len32 i.aead_alg) in\n let aead_state: B.pointer (B.pointer_or_null (AEAD.state_s i.aead_alg)) =\n B.alloca B.null 1ul in\n let ctr_state: B.pointer (B.pointer_or_null (CTR.state_s (as_cipher_alg i.aead_alg))) =\n B.alloca (B.null #(CTR.state_s (as_cipher_alg i.aead_alg))) 1ul in\n let dummy_iv = B.alloca (Secret.to_u8 0uy) 12ul in\n\n (**) let h2 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h1 h2 (loc_none));\n\n Impl.derive_secret i.hash_alg aead_key (key_len i.aead_alg) traffic_secret Impl.label_key 3uy;\n (**) let h3 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h2 h3 (loc_buffer aead_key));\n (**) B.(modifies_trans (G.reveal mloc) h1 h2 (G.reveal mloc) h3);\n\n let ret = AEAD.create_in #i.aead_alg r aead_state aead_key in\n (**) let h4 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h3 h4 (loc_buffer aead_state));\n (**) B.(modifies_trans (G.reveal mloc) h1 h3 (G.reveal mloc) h4);\n\n let ret' = CTR.create_in (as_cipher_alg i.aead_alg) r ctr_state aead_key dummy_iv 12ul 0ul in\n (**) let h5 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h4 h5 (loc_buffer ctr_state));\n (**) B.(modifies_trans (G.reveal mloc) h1 h4 (G.reveal mloc) h5);\n (**) B.(modifies_only_not_unused_in B.(loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst) h1 h5);\n\n match ret with\n | UnsupportedAlgorithm ->\n HST.pop_frame ();\n (**) let h6 = HST.get () in\n (**) B.(modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h5 h6);\n UnsupportedAlgorithm\n\n | Success ->\n\n match ret' with\n | UnsupportedAlgorithm ->\n HST.pop_frame ();\n (**) let h6 = HST.get () in\n (**) B.(modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h5 h6);\n UnsupportedAlgorithm\n\n | Success ->\n\n let aead_state: AEAD.state i.aead_alg = !*aead_state in\n (**) assert (AEAD.invariant h5 aead_state);\n\n let ctr_state: CTR.state (as_cipher_alg i.aead_alg) = !*ctr_state in\n (**) assert (CTR.invariant h5 ctr_state);\n\n create_in_core i r dst initial_pn traffic_secret aead_state ctr_state;\n (**) let h6 = HST.get () in\n\n (**) B.(modifies_loc_includes\n (loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst) h5 h6\n (loc_buffer dst));\n (**) B.(modifies_trans\n (loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst)\n h1 h5\n (loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst)\n h6);\n\n HST.pop_frame ();\n (**) let h7 = HST.get () in\n (**) B.(modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h6 h7);\n (**) frame_invariant (B.loc_region_only false (HS.get_tip h6)) (B.deref h7 dst) h6 h7;\n\n Success\n#pop-options\n\n#push-options \"--z3rlimit 64\"\n\nlet encrypt\n #i s dst dst_pn h plain plain_len\n=\n let m0 = HST.get () in\n let State hash_alg aead_alg e_traffic_secret e_initial_pn\n aead_state iv hp_key bpn ctr_state = !*s\n in\n let last_pn = !* bpn in\n let pn = last_pn `Secret.add` Secret.to_u64 1uL in\n B.upd bpn 0ul pn;\n B.upd dst_pn 0ul pn;\n let m1 = HST.get () in\n assert (B.modifies (footprint m0 s `B.loc_union` B.loc_buffer dst_pn) m0 m1);\n frame_header h pn (footprint m0 s `B.loc_union` B.loc_buffer dst_pn) m0 m1;\n Impl.encrypt aead_alg aead_state iv ctr_state hp_key dst h pn plain (Secret.to_u32 plain_len)\n\n#pop-options\n\n\n/// Initial secrets\n/// ---------------\n\n// TODO: these three should be immutable buffers but we don't have const\n// pointers yet for HKDF.\n#push-options \"--warn_error -272\"\nlet initial_salt: initial_salt:B.buffer U8.t {\n B.length initial_salt = 20 /\\\n B.recallable initial_salt", "dependencies": { "source_file": "QUIC.State.fst", "checked_file": "QUIC.State.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "Impl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "initial_salt:\nLowStar.Buffer.buffer FStar.UInt8.t\n { LowStar.Monotonic.Buffer.length initial_salt = 20 /\\\n LowStar.Monotonic.Buffer.recallable initial_salt }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.gcmalloc_of_list", "FStar.UInt8.t", "FStar.Monotonic.HyperHeap.root", "LowStar.Monotonic.Buffer.mbuffer", "LowStar.Buffer.trivial_preorder", "Prims.l_and", "Prims.eq2", "Prims.nat", "LowStar.Monotonic.Buffer.length", "FStar.Pervasives.normalize_term", "FStar.List.Tot.Base.length", "Prims.b2t", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "FStar.Monotonic.HyperHeap.rid", "LowStar.Monotonic.Buffer.frameOf", "LowStar.Monotonic.Buffer.recallable", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.op_Equality", "Prims.int", "LowStar.Buffer.buffer", "Prims.list", "Prims.Cons", "FStar.UInt8.__uint_to_t", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val initial_salt:initial_salt:\nB.buffer U8.t {B.length initial_salt = 20 /\\ B.recallable initial_salt}\nlet initial_salt:initial_salt:\nB.buffer U8.t {B.length initial_salt = 20 /\\ B.recallable initial_salt} =", "completed_definiton": "[@@ inline_let ]let l =\n [\n 0xc3uy; 0xeeuy; 0xf7uy; 0x12uy; 0xc7uy; 0x2euy; 0xbbuy; 0x5auy; 0x11uy; 0xa7uy; 0xd2uy; 0x43uy;\n 0x2buy; 0xb4uy; 0x63uy; 0x65uy; 0xbeuy; 0xf9uy; 0xf5uy; 0x02uy\n ]\nin\nassert_norm (List.Tot.length l = 20);\nB.gcmalloc_of_list HS.root l", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fst", "name": "QUIC.State.client_in", "original_source_type": "val client_in:client_in: B.buffer U8.t {B.length client_in = 9 /\\ B.recallable client_in}", "source_type": "val client_in:client_in: B.buffer U8.t {B.length client_in = 9 /\\ B.recallable client_in}", "source_definition": "let client_in: client_in:B.buffer U8.t {\n B.length client_in = 9 /\\\n B.recallable client_in\n} =\n [@inline_let]\n let l = [\n 0x63uy; 0x6cuy; 0x69uy; 0x65uy; 0x6euy; 0x74uy; 0x20uy; 0x69uy; 0x6euy\n ] in\n assert_norm (List.Tot.length l = 9);\n B.gcmalloc_of_list HS.root l", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 370, "start_col": 2, "end_line": 375, "end_col": 30 }, "file_context": "module QUIC.State\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nopen LowStar.BufferOps (* for the !* notation *)\n\nmodule Spec = QUIC.Spec\nmodule Impl = QUIC.Impl\nmodule Lemmas = QUIC.Impl.Lemmas\n\n\n/// Helpers\n/// -------\n\nlet key_len (a: ea): x:U8.t { U8.v x = Spec.Agile.AEAD.key_length a } =\n let open Spec.Agile.AEAD in\n match a with\n | AES128_GCM -> 16uy\n | AES256_GCM -> 32uy\n | CHACHA20_POLY1305 -> 32uy\n\nlet key_len32 a = FStar.Int.Cast.uint8_to_uint32 (key_len a)\n\n\n/// https://tools.ietf.org/html/draft-ietf-quic-tls-23#section-5\n///\n/// We perform the three key derivations (AEAD key; AEAD iv; header protection\n/// key) when ``create`` is called. We thus store the original traffic secret\n/// only ghostly.\n///\n/// We retain the AEAD state, in order to perform the packet payload encryption.\n///\n/// We retain the Cipher state, in order to compute the mask for header protection.\nnoeq\ntype state_s (i: index) =\n | State:\n the_hash_alg:ha { the_hash_alg == i.hash_alg } ->\n the_aead_alg:ea { the_aead_alg == i.aead_alg } ->\n traffic_secret:G.erased (Spec.Hash.Definitions.bytes_hash the_hash_alg) ->\n initial_pn:G.erased PN.packet_number_t ->\n aead_state:EverCrypt.AEAD.state the_aead_alg ->\n iv:EverCrypt.AEAD.iv_p the_aead_alg { B.length iv == 12 } ->\n hp_key:B.buffer Secret.uint8 { B.length hp_key = QUIC.Spec.cipher_keysize the_aead_alg } ->\n pn:B.pointer PN.packet_number_t ->\n ctr_state:CTR.state (as_cipher_alg the_aead_alg) ->\n state_s i\n\nlet footprint_s #i h s =\n let open LowStar.Buffer in\n AEAD.footprint h (State?.aead_state s) `loc_union`\n CTR.footprint h (State?.ctr_state s) `loc_union`\n loc_buffer (State?.iv s) `loc_union`\n loc_buffer (State?.hp_key s) `loc_union`\n loc_buffer (State?.pn s)\n\nlet g_traffic_secret #i s =\n // Automatic reveal insertion doesn't work here\n G.reveal (State?.traffic_secret s)\n\nlet g_initial_packet_number #i s =\n // New style: automatic insertion of reveal\n State?.initial_pn s\n\nlet invariant_s #i h s =\n let open QUIC.Spec in\n let State hash_alg aead_alg traffic_secret initial_pn aead_state iv hp_key pn ctr_state =\n s in\n hash_is_keysized s; (\n AEAD.invariant h aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n B.(all_live h [ buf iv; buf hp_key; buf pn ]) /\\\n B.(all_disjoint [ CTR.footprint h ctr_state;\n AEAD.footprint h aead_state; loc_buffer iv; loc_buffer hp_key; loc_buffer pn ]) /\\\n // : automatic insertion of reveal does not work here\n Secret.v initial_pn <= Secret.v (B.deref h pn) /\\\n AEAD.as_kv (B.deref h aead_state) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_key (Spec.Agile.AEAD.key_length aead_alg) /\\\n (B.as_seq h iv) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_iv 12 /\\\n B.as_seq h hp_key ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_hp (QUIC.Spec.cipher_keysize aead_alg)\n )\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet g_last_packet_number #i s h =\n B.deref h (State?.pn s)\n\nlet frame_invariant #i l s h0 h1 =\n AEAD.frame_invariant l (State?.aead_state (B.deref h0 s)) h0 h1;\n CTR.frame_invariant l (State?.ctr_state (B.deref h0 s)) h0 h1\n\nlet aead_alg_of_state #i s =\n let State _ the_aead_alg _ _ _ _ _ _ _ = !*s in\n the_aead_alg\n\nlet hash_alg_of_state #i s =\n let open FStar.HyperStack.ST in (* for the !* notation *)\n let State the_hash_alg _ _ _ _ _ _ _ _ = !*s in\n the_hash_alg\n\nlet last_packet_number_of_state #i s =\n let State _ _ _ _ _ _ _ pn _ = !*s in\n !*pn\n\n\n/// For functions that perform allocations, or even functions that need\n/// temporary state, a style we adopt here is to write the core (i.e. what would\n/// normally go in-between push and pop frame) as a separate function. If\n/// needed, the core of the function takes its temporary allocations as\n/// parameters, and reasons abstractly against a region where the temporary\n/// allocations live. This gives significantly better proof performance.\n///\n/// Another bit of style: after every stateful operation, we restore manually:\n/// the modifies clause (going directly for the one we want); the invariant; the\n/// footprint preservation; then the functional correctness propertise we are\n/// seeking.\n\nval create_in_core:\n i:index ->\n r:HS.rid ->\n dst: B.pointer (B.pointer_or_null (state_s i)) ->\n initial_pn:PN.packet_number_t ->\n traffic_secret:B.buffer Secret.uint8 {\n B.length traffic_secret = Spec.Hash.Definitions.hash_length i.hash_alg\n } ->\n aead_state:AEAD.state i.aead_alg ->\n ctr_state:CTR.state (as_cipher_alg i.aead_alg) ->\n HST.ST unit\n (requires fun h0 ->\n Lemmas.hash_is_keysized_ i.hash_alg; (\n HST.is_eternal_region r /\\\n B.live h0 dst /\\ B.live h0 traffic_secret /\\\n B.(all_disjoint [ AEAD.footprint h0 aead_state; CTR.footprint h0 ctr_state;\n loc_buffer dst; loc_buffer traffic_secret ]) /\\\n B.(loc_includes (loc_region_only true r) (AEAD.footprint h0 aead_state)) /\\\n B.(loc_includes (loc_region_only true r) (CTR.footprint h0 ctr_state)) /\\\n\n // Whatever from the invariant ought to be established already.\n AEAD.invariant h0 aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h0 ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n AEAD.as_kv (B.deref h0 aead_state) ==\n QUIC.Spec.(derive_secret i.hash_alg (B.as_seq h0 traffic_secret) label_key\n (Spec.Agile.AEAD.key_length i.aead_alg))))\n (ensures (fun h0 _ h1 ->\n let s = B.deref h1 dst in\n not (B.g_is_null s) /\\\n invariant h1 s /\\\n\n B.(modifies (loc_buffer dst) h0 h1) /\\ (\n let State _ _ _ initial_pn' aead_state' iv' hp_key' pn' ctr_state' = B.deref h1 s in\n aead_state' == aead_state /\\\n ctr_state' == ctr_state /\\\n B.(fresh_loc (loc_buffer iv') h0 h1) /\\\n B.(fresh_loc (loc_buffer hp_key') h0 h1) /\\\n B.(fresh_loc (loc_buffer pn') h0 h1) /\\\n B.(fresh_loc (loc_addr_of_buffer s) h0 h1) /\\\n\n g_traffic_secret (B.deref h1 s) == B.as_seq h0 traffic_secret /\\ \n g_last_packet_number (B.deref h1 s) h1 == initial_pn /\\\n\n G.reveal initial_pn' == initial_pn)))\n\n#push-options \"--z3rlimit 50\"\nlet create_in_core i r dst initial_pn traffic_secret aead_state ctr_state =\n LowStar.ImmutableBuffer.recall Impl.label_key;\n LowStar.ImmutableBuffer.recall_contents Impl.label_key Spec.label_key;\n LowStar.ImmutableBuffer.recall Impl.label_iv;\n LowStar.ImmutableBuffer.recall_contents Impl.label_iv Spec.label_iv;\n LowStar.ImmutableBuffer.recall Impl.label_hp;\n LowStar.ImmutableBuffer.recall_contents Impl.label_hp Spec.label_hp;\n\n (**) let h0 = HST.get () in\n (**) assert_norm FStar.Mul.(8 * 12 <= pow2 64 - 1);\n\n // The modifies clauses that we will transitively carry across this function body.\n let mloc = G.hide (B.(loc_buffer dst `loc_union` loc_unused_in h0)) in\n let e_traffic_secret: G.erased (Spec.Hash.Definitions.bytes_hash i.hash_alg) =\n G.hide (B.as_seq h0 traffic_secret) in\n let e_initial_pn: G.erased PN.packet_number_t = G.hide (initial_pn) in\n\n let iv = B.malloc r (Secret.to_u8 0uy) 12ul in\n let hp_key = B.malloc r (Secret.to_u8 0uy) (key_len32 i.aead_alg) in\n let pn = B.malloc r initial_pn 1ul in\n (**) let h1 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h0 h1 loc_none);\n (**) assert (B.length hp_key = QUIC.Spec.cipher_keysize i.aead_alg);\n\n let s: state_s i = State #i\n i.hash_alg i.aead_alg e_traffic_secret e_initial_pn\n aead_state iv hp_key pn ctr_state\n in\n\n let s:B.pointer_or_null (state_s i) = B.malloc r s 1ul in\n (**) let h2 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h1 h2 loc_none);\n (**) B.(modifies_trans (G.reveal mloc) h0 h1 (G.reveal mloc) h2);\n\n Impl.derive_secret i.hash_alg iv 12uy traffic_secret Impl.label_iv 2uy;\n (**) let h3 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h2 h3 (loc_buffer iv));\n (**) B.(modifies_trans (G.reveal mloc) h0 h2 (G.reveal mloc) h3);\n\n Impl.derive_secret i.hash_alg hp_key (key_len i.aead_alg) traffic_secret Impl.label_hp 2uy;\n (**) let h4 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h3 h4 (loc_buffer hp_key));\n (**) B.(modifies_trans (G.reveal mloc) h0 h3 (G.reveal mloc) h4);\n\n dst *= s;\n (**) let h5 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h4 h5 (loc_buffer dst));\n (**) B.(modifies_trans (G.reveal mloc) h0 h4 (G.reveal mloc) h5);\n (**) B.(modifies_only_not_unused_in (loc_buffer dst) h0 h5)\n#pop-options\n\n#restart-solver\n\n#push-options \"--z3rlimit 512\"\nlet create_in i r dst initial_pn traffic_secret =\n LowStar.ImmutableBuffer.recall Impl.label_key;\n LowStar.ImmutableBuffer.recall_contents Impl.label_key Spec.label_key;\n\n (**) let h0 = HST.get () in\n\n HST.push_frame ();\n (**) let h1 = HST.get () in\n let mloc = G.hide (B.(loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst\n `loc_union` loc_unused_in h0)) in\n\n let aead_key = B.alloca (Secret.to_u8 0uy) (key_len32 i.aead_alg) in\n let aead_state: B.pointer (B.pointer_or_null (AEAD.state_s i.aead_alg)) =\n B.alloca B.null 1ul in\n let ctr_state: B.pointer (B.pointer_or_null (CTR.state_s (as_cipher_alg i.aead_alg))) =\n B.alloca (B.null #(CTR.state_s (as_cipher_alg i.aead_alg))) 1ul in\n let dummy_iv = B.alloca (Secret.to_u8 0uy) 12ul in\n\n (**) let h2 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h1 h2 (loc_none));\n\n Impl.derive_secret i.hash_alg aead_key (key_len i.aead_alg) traffic_secret Impl.label_key 3uy;\n (**) let h3 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h2 h3 (loc_buffer aead_key));\n (**) B.(modifies_trans (G.reveal mloc) h1 h2 (G.reveal mloc) h3);\n\n let ret = AEAD.create_in #i.aead_alg r aead_state aead_key in\n (**) let h4 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h3 h4 (loc_buffer aead_state));\n (**) B.(modifies_trans (G.reveal mloc) h1 h3 (G.reveal mloc) h4);\n\n let ret' = CTR.create_in (as_cipher_alg i.aead_alg) r ctr_state aead_key dummy_iv 12ul 0ul in\n (**) let h5 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h4 h5 (loc_buffer ctr_state));\n (**) B.(modifies_trans (G.reveal mloc) h1 h4 (G.reveal mloc) h5);\n (**) B.(modifies_only_not_unused_in B.(loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst) h1 h5);\n\n match ret with\n | UnsupportedAlgorithm ->\n HST.pop_frame ();\n (**) let h6 = HST.get () in\n (**) B.(modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h5 h6);\n UnsupportedAlgorithm\n\n | Success ->\n\n match ret' with\n | UnsupportedAlgorithm ->\n HST.pop_frame ();\n (**) let h6 = HST.get () in\n (**) B.(modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h5 h6);\n UnsupportedAlgorithm\n\n | Success ->\n\n let aead_state: AEAD.state i.aead_alg = !*aead_state in\n (**) assert (AEAD.invariant h5 aead_state);\n\n let ctr_state: CTR.state (as_cipher_alg i.aead_alg) = !*ctr_state in\n (**) assert (CTR.invariant h5 ctr_state);\n\n create_in_core i r dst initial_pn traffic_secret aead_state ctr_state;\n (**) let h6 = HST.get () in\n\n (**) B.(modifies_loc_includes\n (loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst) h5 h6\n (loc_buffer dst));\n (**) B.(modifies_trans\n (loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst)\n h1 h5\n (loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst)\n h6);\n\n HST.pop_frame ();\n (**) let h7 = HST.get () in\n (**) B.(modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h6 h7);\n (**) frame_invariant (B.loc_region_only false (HS.get_tip h6)) (B.deref h7 dst) h6 h7;\n\n Success\n#pop-options\n\n#push-options \"--z3rlimit 64\"\n\nlet encrypt\n #i s dst dst_pn h plain plain_len\n=\n let m0 = HST.get () in\n let State hash_alg aead_alg e_traffic_secret e_initial_pn\n aead_state iv hp_key bpn ctr_state = !*s\n in\n let last_pn = !* bpn in\n let pn = last_pn `Secret.add` Secret.to_u64 1uL in\n B.upd bpn 0ul pn;\n B.upd dst_pn 0ul pn;\n let m1 = HST.get () in\n assert (B.modifies (footprint m0 s `B.loc_union` B.loc_buffer dst_pn) m0 m1);\n frame_header h pn (footprint m0 s `B.loc_union` B.loc_buffer dst_pn) m0 m1;\n Impl.encrypt aead_alg aead_state iv ctr_state hp_key dst h pn plain (Secret.to_u32 plain_len)\n\n#pop-options\n\n\n/// Initial secrets\n/// ---------------\n\n// TODO: these three should be immutable buffers but we don't have const\n// pointers yet for HKDF.\n#push-options \"--warn_error -272\"\nlet initial_salt: initial_salt:B.buffer U8.t {\n B.length initial_salt = 20 /\\\n B.recallable initial_salt\n} =\n [@inline_let]\n let l = [\n 0xc3uy; 0xeeuy; 0xf7uy; 0x12uy; 0xc7uy; 0x2euy; 0xbbuy; 0x5auy;\n 0x11uy; 0xa7uy; 0xd2uy; 0x43uy; 0x2buy; 0xb4uy; 0x63uy; 0x65uy;\n 0xbeuy; 0xf9uy; 0xf5uy; 0x02uy\n ] in\n assert_norm (List.Tot.length l = 20);\n B.gcmalloc_of_list HS.root l\n\nlet server_in: server_in:B.buffer U8.t {\n B.length server_in = 9 /\\\n B.recallable server_in\n} =\n [@inline_let]\n let l = [\n 0x73uy; 0x65uy; 0x72uy; 0x76uy; 0x65uy; 0x72uy; 0x20uy; 0x69uy; 0x6euy\n ] in\n assert_norm (List.Tot.length l = 9);\n B.gcmalloc_of_list HS.root l\n\nlet client_in: client_in:B.buffer U8.t {\n B.length client_in = 9 /\\\n B.recallable client_in", "dependencies": { "source_file": "QUIC.State.fst", "checked_file": "QUIC.State.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "Impl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "client_in:\nLowStar.Buffer.buffer FStar.UInt8.t\n {LowStar.Monotonic.Buffer.length client_in = 9 /\\ LowStar.Monotonic.Buffer.recallable client_in}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.gcmalloc_of_list", "FStar.UInt8.t", "FStar.Monotonic.HyperHeap.root", "LowStar.Monotonic.Buffer.mbuffer", "LowStar.Buffer.trivial_preorder", "Prims.l_and", "Prims.eq2", "Prims.nat", "LowStar.Monotonic.Buffer.length", "FStar.Pervasives.normalize_term", "FStar.List.Tot.Base.length", "Prims.b2t", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "FStar.Monotonic.HyperHeap.rid", "LowStar.Monotonic.Buffer.frameOf", "LowStar.Monotonic.Buffer.recallable", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.op_Equality", "Prims.int", "LowStar.Buffer.buffer", "Prims.list", "Prims.Cons", "FStar.UInt8.__uint_to_t", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val client_in:client_in: B.buffer U8.t {B.length client_in = 9 /\\ B.recallable client_in}\nlet client_in:client_in: B.buffer U8.t {B.length client_in = 9 /\\ B.recallable client_in} =", "completed_definiton": "[@@ inline_let ]let l = [0x63uy; 0x6cuy; 0x69uy; 0x65uy; 0x6euy; 0x74uy; 0x20uy; 0x69uy; 0x6euy] in\nassert_norm (List.Tot.length l = 9);\nB.gcmalloc_of_list HS.root l", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fst", "name": "QUIC.State.last_packet_number_of_state", "original_source_type": "val last_packet_number_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack PN.packet_number_t\n (requires fun h0 -> invariant h0 s)\n (ensures fun h0 ctr h1 ->\n ctr == g_last_packet_number (B.deref h0 s) h0 /\\\n h0 == h1)", "source_type": "val last_packet_number_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack PN.packet_number_t\n (requires fun h0 -> invariant h0 s)\n (ensures fun h0 ctr h1 ->\n ctr == g_last_packet_number (B.deref h0 s) h0 /\\\n h0 == h1)", "source_definition": "let last_packet_number_of_state #i s =\n let State _ _ _ _ _ _ _ pn _ = !*s in\n !*pn", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 115, "start_col": 38, "end_line": 117, "end_col": 6 }, "file_context": "module QUIC.State\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nopen LowStar.BufferOps (* for the !* notation *)\n\nmodule Spec = QUIC.Spec\nmodule Impl = QUIC.Impl\nmodule Lemmas = QUIC.Impl.Lemmas\n\n\n/// Helpers\n/// -------\n\nlet key_len (a: ea): x:U8.t { U8.v x = Spec.Agile.AEAD.key_length a } =\n let open Spec.Agile.AEAD in\n match a with\n | AES128_GCM -> 16uy\n | AES256_GCM -> 32uy\n | CHACHA20_POLY1305 -> 32uy\n\nlet key_len32 a = FStar.Int.Cast.uint8_to_uint32 (key_len a)\n\n\n/// https://tools.ietf.org/html/draft-ietf-quic-tls-23#section-5\n///\n/// We perform the three key derivations (AEAD key; AEAD iv; header protection\n/// key) when ``create`` is called. We thus store the original traffic secret\n/// only ghostly.\n///\n/// We retain the AEAD state, in order to perform the packet payload encryption.\n///\n/// We retain the Cipher state, in order to compute the mask for header protection.\nnoeq\ntype state_s (i: index) =\n | State:\n the_hash_alg:ha { the_hash_alg == i.hash_alg } ->\n the_aead_alg:ea { the_aead_alg == i.aead_alg } ->\n traffic_secret:G.erased (Spec.Hash.Definitions.bytes_hash the_hash_alg) ->\n initial_pn:G.erased PN.packet_number_t ->\n aead_state:EverCrypt.AEAD.state the_aead_alg ->\n iv:EverCrypt.AEAD.iv_p the_aead_alg { B.length iv == 12 } ->\n hp_key:B.buffer Secret.uint8 { B.length hp_key = QUIC.Spec.cipher_keysize the_aead_alg } ->\n pn:B.pointer PN.packet_number_t ->\n ctr_state:CTR.state (as_cipher_alg the_aead_alg) ->\n state_s i\n\nlet footprint_s #i h s =\n let open LowStar.Buffer in\n AEAD.footprint h (State?.aead_state s) `loc_union`\n CTR.footprint h (State?.ctr_state s) `loc_union`\n loc_buffer (State?.iv s) `loc_union`\n loc_buffer (State?.hp_key s) `loc_union`\n loc_buffer (State?.pn s)\n\nlet g_traffic_secret #i s =\n // Automatic reveal insertion doesn't work here\n G.reveal (State?.traffic_secret s)\n\nlet g_initial_packet_number #i s =\n // New style: automatic insertion of reveal\n State?.initial_pn s\n\nlet invariant_s #i h s =\n let open QUIC.Spec in\n let State hash_alg aead_alg traffic_secret initial_pn aead_state iv hp_key pn ctr_state =\n s in\n hash_is_keysized s; (\n AEAD.invariant h aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n B.(all_live h [ buf iv; buf hp_key; buf pn ]) /\\\n B.(all_disjoint [ CTR.footprint h ctr_state;\n AEAD.footprint h aead_state; loc_buffer iv; loc_buffer hp_key; loc_buffer pn ]) /\\\n // : automatic insertion of reveal does not work here\n Secret.v initial_pn <= Secret.v (B.deref h pn) /\\\n AEAD.as_kv (B.deref h aead_state) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_key (Spec.Agile.AEAD.key_length aead_alg) /\\\n (B.as_seq h iv) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_iv 12 /\\\n B.as_seq h hp_key ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_hp (QUIC.Spec.cipher_keysize aead_alg)\n )\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet g_last_packet_number #i s h =\n B.deref h (State?.pn s)\n\nlet frame_invariant #i l s h0 h1 =\n AEAD.frame_invariant l (State?.aead_state (B.deref h0 s)) h0 h1;\n CTR.frame_invariant l (State?.ctr_state (B.deref h0 s)) h0 h1\n\nlet aead_alg_of_state #i s =\n let State _ the_aead_alg _ _ _ _ _ _ _ = !*s in\n the_aead_alg\n\nlet hash_alg_of_state #i s =\n let open FStar.HyperStack.ST in (* for the !* notation *)\n let State the_hash_alg _ _ _ _ _ _ _ _ = !*s in\n the_hash_alg", "dependencies": { "source_file": "QUIC.State.fst", "checked_file": "QUIC.State.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "Impl", "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: QUIC.State.state (FStar.Ghost.reveal i)\n -> FStar.HyperStack.ST.Stack QUIC.Spec.PacketNumber.Base.packet_number_t", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "FStar.Ghost.erased", "QUIC.State.index", "QUIC.State.state", "FStar.Ghost.reveal", "QUIC.Spec.Crypto.ha", "Prims.eq2", "QUIC.State.__proj__Mkindex__item__hash_alg", "QUIC.Spec.Crypto.ea", "QUIC.State.__proj__Mkindex__item__aead_alg", "Spec.Hash.Definitions.bytes_hash", "QUIC.Spec.PacketNumber.Base.packet_number_t", "EverCrypt.AEAD.state", "EverCrypt.AEAD.iv_p", "Prims.int", "LowStar.Monotonic.Buffer.length", "Spec.Agile.AEAD.uint8", "LowStar.Buffer.trivial_preorder", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "Prims.b2t", "Prims.op_Equality", "Prims.nat", "QUIC.Spec.Crypto.cipher_keysize", "LowStar.Buffer.pointer", "NotEverCrypt.CTR.state", "QUIC.Spec.Crypto.as_cipher_alg", "LowStar.BufferOps.op_Bang_Star", "QUIC.State.state_s" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val last_packet_number_of_state (#i: G.erased index) (s: state (G.reveal i)): HST.Stack PN.packet_number_t\n (requires fun h0 -> invariant h0 s)\n (ensures fun h0 ctr h1 ->\n ctr == g_last_packet_number (B.deref h0 s) h0 /\\\n h0 == h1)\nlet last_packet_number_of_state #i s =", "completed_definiton": "let State _ _ _ _ _ _ _ pn _ = !*s in\n!*pn", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fst", "name": "QUIC.State.g_traffic_secret", "original_source_type": "val g_traffic_secret: #i:index -> (s: state_s i) ->\n GTot (Spec.Hash.Definitions.bytes_hash i.hash_alg)", "source_type": "val g_traffic_secret: #i:index -> (s: state_s i) ->\n GTot (Spec.Hash.Definitions.bytes_hash i.hash_alg)", "source_definition": "let g_traffic_secret #i s =\n // Automatic reveal insertion doesn't work here\n G.reveal (State?.traffic_secret s)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 69, "start_col": 2, "end_line": 69, "end_col": 36 }, "file_context": "module QUIC.State\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nopen LowStar.BufferOps (* for the !* notation *)\n\nmodule Spec = QUIC.Spec\nmodule Impl = QUIC.Impl\nmodule Lemmas = QUIC.Impl.Lemmas\n\n\n/// Helpers\n/// -------\n\nlet key_len (a: ea): x:U8.t { U8.v x = Spec.Agile.AEAD.key_length a } =\n let open Spec.Agile.AEAD in\n match a with\n | AES128_GCM -> 16uy\n | AES256_GCM -> 32uy\n | CHACHA20_POLY1305 -> 32uy\n\nlet key_len32 a = FStar.Int.Cast.uint8_to_uint32 (key_len a)\n\n\n/// https://tools.ietf.org/html/draft-ietf-quic-tls-23#section-5\n///\n/// We perform the three key derivations (AEAD key; AEAD iv; header protection\n/// key) when ``create`` is called. We thus store the original traffic secret\n/// only ghostly.\n///\n/// We retain the AEAD state, in order to perform the packet payload encryption.\n///\n/// We retain the Cipher state, in order to compute the mask for header protection.\nnoeq\ntype state_s (i: index) =\n | State:\n the_hash_alg:ha { the_hash_alg == i.hash_alg } ->\n the_aead_alg:ea { the_aead_alg == i.aead_alg } ->\n traffic_secret:G.erased (Spec.Hash.Definitions.bytes_hash the_hash_alg) ->\n initial_pn:G.erased PN.packet_number_t ->\n aead_state:EverCrypt.AEAD.state the_aead_alg ->\n iv:EverCrypt.AEAD.iv_p the_aead_alg { B.length iv == 12 } ->\n hp_key:B.buffer Secret.uint8 { B.length hp_key = QUIC.Spec.cipher_keysize the_aead_alg } ->\n pn:B.pointer PN.packet_number_t ->\n ctr_state:CTR.state (as_cipher_alg the_aead_alg) ->\n state_s i\n\nlet footprint_s #i h s =\n let open LowStar.Buffer in\n AEAD.footprint h (State?.aead_state s) `loc_union`\n CTR.footprint h (State?.ctr_state s) `loc_union`\n loc_buffer (State?.iv s) `loc_union`\n loc_buffer (State?.hp_key s) `loc_union`\n loc_buffer (State?.pn s)\n\nlet g_traffic_secret #i s =", "dependencies": { "source_file": "QUIC.State.fst", "checked_file": "QUIC.State.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "Impl", "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: QUIC.State.state_s i -> Prims.GTot (Spec.Hash.Definitions.bytes_hash (Mkindex?.hash_alg i))", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.State.index", "QUIC.State.state_s", "FStar.Ghost.reveal", "Spec.Hash.Definitions.bytes_hash", "QUIC.State.__proj__State__item__the_hash_alg", "QUIC.State.__proj__State__item__traffic_secret", "QUIC.State.__proj__Mkindex__item__hash_alg" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val g_traffic_secret: #i:index -> (s: state_s i) ->\n GTot (Spec.Hash.Definitions.bytes_hash i.hash_alg)\nlet g_traffic_secret #i s =", "completed_definiton": "G.reveal (State?.traffic_secret s)", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fst", "name": "QUIC.State.invariant_s", "original_source_type": "val invariant_s: (#i:index) -> HS.mem -> state_s i -> Type0", "source_type": "val invariant_s: (#i:index) -> HS.mem -> state_s i -> Type0", "source_definition": "let invariant_s #i h s =\n let open QUIC.Spec in\n let State hash_alg aead_alg traffic_secret initial_pn aead_state iv hp_key pn ctr_state =\n s in\n hash_is_keysized s; (\n AEAD.invariant h aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n B.(all_live h [ buf iv; buf hp_key; buf pn ]) /\\\n B.(all_disjoint [ CTR.footprint h ctr_state;\n AEAD.footprint h aead_state; loc_buffer iv; loc_buffer hp_key; loc_buffer pn ]) /\\\n // : automatic insertion of reveal does not work here\n Secret.v initial_pn <= Secret.v (B.deref h pn) /\\\n AEAD.as_kv (B.deref h aead_state) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_key (Spec.Agile.AEAD.key_length aead_alg) /\\\n (B.as_seq h iv) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_iv 12 /\\\n B.as_seq h hp_key ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_hp (QUIC.Spec.cipher_keysize aead_alg)\n )", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 76, "start_col": 2, "end_line": 95, "end_col": 3 }, "file_context": "module QUIC.State\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nopen LowStar.BufferOps (* for the !* notation *)\n\nmodule Spec = QUIC.Spec\nmodule Impl = QUIC.Impl\nmodule Lemmas = QUIC.Impl.Lemmas\n\n\n/// Helpers\n/// -------\n\nlet key_len (a: ea): x:U8.t { U8.v x = Spec.Agile.AEAD.key_length a } =\n let open Spec.Agile.AEAD in\n match a with\n | AES128_GCM -> 16uy\n | AES256_GCM -> 32uy\n | CHACHA20_POLY1305 -> 32uy\n\nlet key_len32 a = FStar.Int.Cast.uint8_to_uint32 (key_len a)\n\n\n/// https://tools.ietf.org/html/draft-ietf-quic-tls-23#section-5\n///\n/// We perform the three key derivations (AEAD key; AEAD iv; header protection\n/// key) when ``create`` is called. We thus store the original traffic secret\n/// only ghostly.\n///\n/// We retain the AEAD state, in order to perform the packet payload encryption.\n///\n/// We retain the Cipher state, in order to compute the mask for header protection.\nnoeq\ntype state_s (i: index) =\n | State:\n the_hash_alg:ha { the_hash_alg == i.hash_alg } ->\n the_aead_alg:ea { the_aead_alg == i.aead_alg } ->\n traffic_secret:G.erased (Spec.Hash.Definitions.bytes_hash the_hash_alg) ->\n initial_pn:G.erased PN.packet_number_t ->\n aead_state:EverCrypt.AEAD.state the_aead_alg ->\n iv:EverCrypt.AEAD.iv_p the_aead_alg { B.length iv == 12 } ->\n hp_key:B.buffer Secret.uint8 { B.length hp_key = QUIC.Spec.cipher_keysize the_aead_alg } ->\n pn:B.pointer PN.packet_number_t ->\n ctr_state:CTR.state (as_cipher_alg the_aead_alg) ->\n state_s i\n\nlet footprint_s #i h s =\n let open LowStar.Buffer in\n AEAD.footprint h (State?.aead_state s) `loc_union`\n CTR.footprint h (State?.ctr_state s) `loc_union`\n loc_buffer (State?.iv s) `loc_union`\n loc_buffer (State?.hp_key s) `loc_union`\n loc_buffer (State?.pn s)\n\nlet g_traffic_secret #i s =\n // Automatic reveal insertion doesn't work here\n G.reveal (State?.traffic_secret s)\n\nlet g_initial_packet_number #i s =\n // New style: automatic insertion of reveal\n State?.initial_pn s", "dependencies": { "source_file": "QUIC.State.fst", "checked_file": "QUIC.State.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "Impl", "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: FStar.Monotonic.HyperStack.mem -> s: QUIC.State.state_s i -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.State.index", "FStar.Monotonic.HyperStack.mem", "QUIC.State.state_s", "QUIC.Spec.Crypto.ha", "Prims.eq2", "QUIC.State.__proj__Mkindex__item__hash_alg", "QUIC.Spec.Crypto.ea", "QUIC.State.__proj__Mkindex__item__aead_alg", "FStar.Ghost.erased", "Spec.Hash.Definitions.bytes_hash", "QUIC.Spec.PacketNumber.Base.packet_number_t", "EverCrypt.AEAD.state", "EverCrypt.AEAD.iv_p", "Prims.int", "LowStar.Monotonic.Buffer.length", "Spec.Agile.AEAD.uint8", "LowStar.Buffer.trivial_preorder", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "Prims.b2t", "Prims.op_Equality", "Prims.nat", "QUIC.Spec.Crypto.cipher_keysize", "LowStar.Buffer.pointer", "NotEverCrypt.CTR.state", "QUIC.Spec.Crypto.as_cipher_alg", "Prims.l_and", "EverCrypt.AEAD.invariant", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "EverCrypt.AEAD.state_s", "NotEverCrypt.CTR.invariant", "NotEverCrypt.CTR.state_s", "LowStar.Monotonic.Buffer.all_live", "Prims.Cons", "LowStar.Monotonic.Buffer.buf_t", "LowStar.Monotonic.Buffer.buf", "Prims.Nil", "LowStar.Monotonic.Buffer.all_disjoint", "LowStar.Monotonic.Buffer.loc", "NotEverCrypt.CTR.footprint", "EverCrypt.AEAD.footprint", "LowStar.Monotonic.Buffer.loc_buffer", "Prims.op_LessThanOrEqual", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "FStar.Ghost.reveal", "LowStar.Monotonic.Buffer.deref", "FStar.Seq.Base.seq", "EverCrypt.AEAD.as_kv", "QUIC.Spec.Crypto.derive_secret", "QUIC.Spec.Crypto.label_key", "Spec.Agile.AEAD.key_length", "LowStar.Monotonic.Buffer.as_seq", "QUIC.Spec.Crypto.label_iv", "QUIC.Spec.Crypto.label_hp", "Prims.unit", "QUIC.State.hash_is_keysized" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val invariant_s: (#i:index) -> HS.mem -> state_s i -> Type0\nlet invariant_s #i h s =", "completed_definiton": "let open QUIC.Spec in\nlet State hash_alg aead_alg traffic_secret initial_pn aead_state iv hp_key pn ctr_state = s in\nhash_is_keysized s;\n(AEAD.invariant h aead_state /\\ not (B.g_is_null aead_state) /\\ CTR.invariant h ctr_state /\\\n not (B.g_is_null ctr_state) /\\ B.(all_live h [buf iv; buf hp_key; buf pn]) /\\\n B.(all_disjoint [\n CTR.footprint h ctr_state;\n AEAD.footprint h aead_state;\n loc_buffer iv;\n loc_buffer hp_key;\n loc_buffer pn\n ]) /\\ Secret.v initial_pn <= Secret.v (B.deref h pn) /\\\n AEAD.as_kv (B.deref h aead_state) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_key (Spec.Agile.AEAD.key_length aead_alg) /\\\n (B.as_seq h iv) == derive_secret i.hash_alg (G.reveal traffic_secret) label_iv 12 /\\\n B.as_seq h hp_key ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_hp (QUIC.Spec.cipher_keysize aead_alg))", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fst", "name": "QUIC.State.frame_invariant", "original_source_type": "val frame_invariant: #i:index -> l:B.loc -> s:state i -> h0:HS.mem -> h1:HS.mem -> Lemma\n (requires (\n invariant h0 s /\\\n B.loc_disjoint l (footprint h0 s) /\\\n B.modifies l h0 h1))\n (ensures (\n invariant h1 s /\\\n footprint h0 s == footprint h1 s /\\\n g_last_packet_number (B.deref h0 s) h0 == g_last_packet_number (B.deref h1 s) h0 /\\\n g_traffic_secret (B.deref h0 s) == g_traffic_secret (B.deref h1 s)\n ))\n // Assertion failure: unexpected pattern term\n [ SMTPatOr [\n [ SMTPat (B.modifies l h0 h1); SMTPat (invariant h1 s) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (footprint h1 s) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (g_last_packet_number (B.deref h1 s)) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (g_traffic_secret (B.deref h1 s)) ]\n ] ]", "source_type": "val frame_invariant: #i:index -> l:B.loc -> s:state i -> h0:HS.mem -> h1:HS.mem -> Lemma\n (requires (\n invariant h0 s /\\\n B.loc_disjoint l (footprint h0 s) /\\\n B.modifies l h0 h1))\n (ensures (\n invariant h1 s /\\\n footprint h0 s == footprint h1 s /\\\n g_last_packet_number (B.deref h0 s) h0 == g_last_packet_number (B.deref h1 s) h0 /\\\n g_traffic_secret (B.deref h0 s) == g_traffic_secret (B.deref h1 s)\n ))\n // Assertion failure: unexpected pattern term\n [ SMTPatOr [\n [ SMTPat (B.modifies l h0 h1); SMTPat (invariant h1 s) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (footprint h1 s) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (g_last_packet_number (B.deref h1 s)) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (g_traffic_secret (B.deref h1 s)) ]\n ] ]", "source_definition": "let frame_invariant #i l s h0 h1 =\n AEAD.frame_invariant l (State?.aead_state (B.deref h0 s)) h0 h1;\n CTR.frame_invariant l (State?.ctr_state (B.deref h0 s)) h0 h1", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 103, "start_col": 2, "end_line": 104, "end_col": 63 }, "file_context": "module QUIC.State\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nopen LowStar.BufferOps (* for the !* notation *)\n\nmodule Spec = QUIC.Spec\nmodule Impl = QUIC.Impl\nmodule Lemmas = QUIC.Impl.Lemmas\n\n\n/// Helpers\n/// -------\n\nlet key_len (a: ea): x:U8.t { U8.v x = Spec.Agile.AEAD.key_length a } =\n let open Spec.Agile.AEAD in\n match a with\n | AES128_GCM -> 16uy\n | AES256_GCM -> 32uy\n | CHACHA20_POLY1305 -> 32uy\n\nlet key_len32 a = FStar.Int.Cast.uint8_to_uint32 (key_len a)\n\n\n/// https://tools.ietf.org/html/draft-ietf-quic-tls-23#section-5\n///\n/// We perform the three key derivations (AEAD key; AEAD iv; header protection\n/// key) when ``create`` is called. We thus store the original traffic secret\n/// only ghostly.\n///\n/// We retain the AEAD state, in order to perform the packet payload encryption.\n///\n/// We retain the Cipher state, in order to compute the mask for header protection.\nnoeq\ntype state_s (i: index) =\n | State:\n the_hash_alg:ha { the_hash_alg == i.hash_alg } ->\n the_aead_alg:ea { the_aead_alg == i.aead_alg } ->\n traffic_secret:G.erased (Spec.Hash.Definitions.bytes_hash the_hash_alg) ->\n initial_pn:G.erased PN.packet_number_t ->\n aead_state:EverCrypt.AEAD.state the_aead_alg ->\n iv:EverCrypt.AEAD.iv_p the_aead_alg { B.length iv == 12 } ->\n hp_key:B.buffer Secret.uint8 { B.length hp_key = QUIC.Spec.cipher_keysize the_aead_alg } ->\n pn:B.pointer PN.packet_number_t ->\n ctr_state:CTR.state (as_cipher_alg the_aead_alg) ->\n state_s i\n\nlet footprint_s #i h s =\n let open LowStar.Buffer in\n AEAD.footprint h (State?.aead_state s) `loc_union`\n CTR.footprint h (State?.ctr_state s) `loc_union`\n loc_buffer (State?.iv s) `loc_union`\n loc_buffer (State?.hp_key s) `loc_union`\n loc_buffer (State?.pn s)\n\nlet g_traffic_secret #i s =\n // Automatic reveal insertion doesn't work here\n G.reveal (State?.traffic_secret s)\n\nlet g_initial_packet_number #i s =\n // New style: automatic insertion of reveal\n State?.initial_pn s\n\nlet invariant_s #i h s =\n let open QUIC.Spec in\n let State hash_alg aead_alg traffic_secret initial_pn aead_state iv hp_key pn ctr_state =\n s in\n hash_is_keysized s; (\n AEAD.invariant h aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n B.(all_live h [ buf iv; buf hp_key; buf pn ]) /\\\n B.(all_disjoint [ CTR.footprint h ctr_state;\n AEAD.footprint h aead_state; loc_buffer iv; loc_buffer hp_key; loc_buffer pn ]) /\\\n // : automatic insertion of reveal does not work here\n Secret.v initial_pn <= Secret.v (B.deref h pn) /\\\n AEAD.as_kv (B.deref h aead_state) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_key (Spec.Agile.AEAD.key_length aead_alg) /\\\n (B.as_seq h iv) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_iv 12 /\\\n B.as_seq h hp_key ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_hp (QUIC.Spec.cipher_keysize aead_alg)\n )\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet g_last_packet_number #i s h =\n B.deref h (State?.pn s)", "dependencies": { "source_file": "QUIC.State.fst", "checked_file": "QUIC.State.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "Impl", "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n l: LowStar.Monotonic.Buffer.loc ->\n s: QUIC.State.state i ->\n h0: FStar.Monotonic.HyperStack.mem ->\n h1: FStar.Monotonic.HyperStack.mem\n -> FStar.Pervasives.Lemma\n (requires\n QUIC.State.invariant h0 s /\\\n LowStar.Monotonic.Buffer.loc_disjoint l (QUIC.State.footprint h0 s) /\\\n LowStar.Monotonic.Buffer.modifies l h0 h1)\n (ensures\n QUIC.State.invariant h1 s /\\ QUIC.State.footprint h0 s == QUIC.State.footprint h1 s /\\\n QUIC.State.g_last_packet_number (LowStar.Monotonic.Buffer.deref h0 s) h0 ==\n QUIC.State.g_last_packet_number (LowStar.Monotonic.Buffer.deref h1 s) h0 /\\\n QUIC.State.g_traffic_secret (LowStar.Monotonic.Buffer.deref h0 s) ==\n QUIC.State.g_traffic_secret (LowStar.Monotonic.Buffer.deref h1 s))\n [\n SMTPatOr [\n [SMTPat (LowStar.Monotonic.Buffer.modifies l h0 h1); SMTPat (QUIC.State.invariant h1 s)];\n [SMTPat (LowStar.Monotonic.Buffer.modifies l h0 h1); SMTPat (QUIC.State.footprint h1 s)];\n [\n SMTPat (LowStar.Monotonic.Buffer.modifies l h0 h1);\n SMTPat (QUIC.State.g_last_packet_number (LowStar.Monotonic.Buffer.deref h1 s))\n ];\n [\n SMTPat (LowStar.Monotonic.Buffer.modifies l h0 h1);\n SMTPat (QUIC.State.g_traffic_secret (LowStar.Monotonic.Buffer.deref h1 s))\n ]\n ]\n ]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.State.index", "LowStar.Monotonic.Buffer.loc", "QUIC.State.state", "FStar.Monotonic.HyperStack.mem", "NotEverCrypt.CTR.frame_invariant", "QUIC.Spec.Crypto.as_cipher_alg", "QUIC.State.__proj__State__item__the_aead_alg", "LowStar.Monotonic.Buffer.deref", "QUIC.State.state_s", "LowStar.Buffer.trivial_preorder", "QUIC.State.__proj__State__item__ctr_state", "Prims.unit", "EverCrypt.AEAD.frame_invariant", "QUIC.State.__proj__State__item__aead_state" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val frame_invariant: #i:index -> l:B.loc -> s:state i -> h0:HS.mem -> h1:HS.mem -> Lemma\n (requires (\n invariant h0 s /\\\n B.loc_disjoint l (footprint h0 s) /\\\n B.modifies l h0 h1))\n (ensures (\n invariant h1 s /\\\n footprint h0 s == footprint h1 s /\\\n g_last_packet_number (B.deref h0 s) h0 == g_last_packet_number (B.deref h1 s) h0 /\\\n g_traffic_secret (B.deref h0 s) == g_traffic_secret (B.deref h1 s)\n ))\n // Assertion failure: unexpected pattern term\n [ SMTPatOr [\n [ SMTPat (B.modifies l h0 h1); SMTPat (invariant h1 s) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (footprint h1 s) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (g_last_packet_number (B.deref h1 s)) ];\n [ SMTPat (B.modifies l h0 h1); SMTPat (g_traffic_secret (B.deref h1 s)) ]\n ] ]\nlet frame_invariant #i l s h0 h1 =", "completed_definiton": "AEAD.frame_invariant l (State?.aead_state (B.deref h0 s)) h0 h1;\nCTR.frame_invariant l (State?.ctr_state (B.deref h0 s)) h0 h1", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fst", "name": "QUIC.State.initial_secrets", "original_source_type": "val initial_secrets (dst_client: B.buffer Secret.uint8)\n (dst_server: B.buffer Secret.uint8)\n (cid: B.buffer Secret.uint8)\n (cid_len: U32.t):\n HST.Stack unit\n (requires (fun h0 ->\n B.(all_live h0 [ buf dst_client; buf dst_server; buf cid ]) /\\\n B.length dst_client = Spec.Agile.Hash.(hash_length SHA2_256) /\\\n B.length dst_server = Spec.Agile.Hash.(hash_length SHA2_256) /\\\n B.length cid = U32.v cid_len /\\\n U32.v cid_len <= 20 /\\\n B.(all_disjoint [ loc_buffer dst_client; loc_buffer dst_server; loc_buffer cid ])))\n (ensures (fun h0 _ h1 ->\n B.(modifies (loc_buffer dst_client `loc_union` loc_buffer dst_server) h0 h1)))", "source_type": "val initial_secrets (dst_client: B.buffer Secret.uint8)\n (dst_server: B.buffer Secret.uint8)\n (cid: B.buffer Secret.uint8)\n (cid_len: U32.t):\n HST.Stack unit\n (requires (fun h0 ->\n B.(all_live h0 [ buf dst_client; buf dst_server; buf cid ]) /\\\n B.length dst_client = Spec.Agile.Hash.(hash_length SHA2_256) /\\\n B.length dst_server = Spec.Agile.Hash.(hash_length SHA2_256) /\\\n B.length cid = U32.v cid_len /\\\n U32.v cid_len <= 20 /\\\n B.(all_disjoint [ loc_buffer dst_client; loc_buffer dst_server; loc_buffer cid ])))\n (ensures (fun h0 _ h1 ->\n B.(modifies (loc_buffer dst_client `loc_union` loc_buffer dst_server) h0 h1)))", "source_definition": "let initial_secrets dst_client dst_server cid cid_len =\n (**) let h0 = HST.get () in\n (**) B.recall initial_salt;\n (**) B.recall server_in;\n (**) B.recall client_in;\n assert_norm (Spec.Agile.Hash.(hash_length SHA2_256) = 32);\n\n HST.push_frame ();\n (**) let h1 = HST.get () in\n (**) let mloc = G.hide (B.(loc_buffer dst_client `loc_union`\n loc_buffer dst_server `loc_union` loc_region_only true (HS.get_tip h1))) in\n\n B.loc_unused_in_not_unused_in_disjoint h1;\n let secret = B.alloca (Secret.to_u8 0uy) 32ul in\n \n (* we allocate a temporary buffer to copy the initial_salt,\n server_in and client_in and then to hide it through\n SecretBuffer.with_whole_buffer_hide_weak_modifies, because if we\n directly hide those global buffers, then we won't be able to\n prove that the livenesses of function arguments are preserved,\n because they are not disjoint from the global buffers. *)\n\n let h15 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint h15;\n let tmp = B.alloca 0uy 20ul in\n B.blit initial_salt 0ul tmp 0ul 20ul;\n \n (**) let h2 = HST.get () in\n\n (**) Lemmas.hash_is_keysized_ Spec.Agile.Hash.SHA2_256;\n let h25 = HST.get () in\n SecretBuffer.with_whole_buffer_hide_weak_modifies\n tmp\n h25\n (B.loc_buffer secret `B.loc_union` B.loc_buffer cid)\n (B.loc_buffer secret)\n false\n (fun _ _ m -> True)\n (fun _ bs ->\n EverCrypt.HKDF.extract Spec.Agile.Hash.SHA2_256 secret bs 20ul\n cid cid_len\n );\n (**) let h3 = HST.get () in\n (**) B.(modifies_trans (G.reveal mloc) h1 h2 (G.reveal mloc) h3);\n\n let tmp_client_in = B.sub tmp 0ul 9ul in\n B.blit client_in 0ul tmp_client_in 0ul 9ul;\n let h35 = HST.get () in\n SecretBuffer.with_whole_buffer_hide_weak_modifies\n tmp_client_in\n h35\n (B.loc_buffer secret `B.loc_union` B.loc_buffer dst_client)\n (B.loc_buffer dst_client)\n false\n (fun _ _ m -> True)\n (fun _ bs ->\n EverCrypt.HKDF.expand Spec.Agile.Hash.SHA2_256 dst_client secret 32ul bs 9ul 32ul\n );\n (**) let h4 = HST.get () in\n (**) B.(modifies_trans (G.reveal mloc) h1 h3 (G.reveal mloc) h4);\n\n let tmp_server_in = B.sub tmp 0ul 9ul in\n B.blit server_in 0ul tmp_server_in 0ul 9ul;\n let h45 = HST.get () in\n SecretBuffer.with_whole_buffer_hide_weak_modifies\n tmp_server_in\n h45\n (B.loc_buffer secret `B.loc_union` B.loc_buffer dst_server)\n (B.loc_buffer dst_server)\n false\n (fun _ _ m -> True)\n (fun _ bs ->\n EverCrypt.HKDF.expand Spec.Agile.Hash.SHA2_256 dst_server secret 32ul bs 9ul 32ul\n );\n (**) let h5 = HST.get () in\n (**) B.(modifies_trans (G.reveal mloc) h1 h4 (G.reveal mloc) h5);\n\n HST.pop_frame ();\n (**) let h6 = HST.get () in\n (**) B.modifies_fresh_frame_popped h0 h1\n (**) B.(loc_buffer dst_client `loc_union` loc_buffer dst_server) h5 h6", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 380, "start_col": 55, "end_line": 460, "end_col": 74 }, "file_context": "module QUIC.State\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nopen LowStar.BufferOps (* for the !* notation *)\n\nmodule Spec = QUIC.Spec\nmodule Impl = QUIC.Impl\nmodule Lemmas = QUIC.Impl.Lemmas\n\n\n/// Helpers\n/// -------\n\nlet key_len (a: ea): x:U8.t { U8.v x = Spec.Agile.AEAD.key_length a } =\n let open Spec.Agile.AEAD in\n match a with\n | AES128_GCM -> 16uy\n | AES256_GCM -> 32uy\n | CHACHA20_POLY1305 -> 32uy\n\nlet key_len32 a = FStar.Int.Cast.uint8_to_uint32 (key_len a)\n\n\n/// https://tools.ietf.org/html/draft-ietf-quic-tls-23#section-5\n///\n/// We perform the three key derivations (AEAD key; AEAD iv; header protection\n/// key) when ``create`` is called. We thus store the original traffic secret\n/// only ghostly.\n///\n/// We retain the AEAD state, in order to perform the packet payload encryption.\n///\n/// We retain the Cipher state, in order to compute the mask for header protection.\nnoeq\ntype state_s (i: index) =\n | State:\n the_hash_alg:ha { the_hash_alg == i.hash_alg } ->\n the_aead_alg:ea { the_aead_alg == i.aead_alg } ->\n traffic_secret:G.erased (Spec.Hash.Definitions.bytes_hash the_hash_alg) ->\n initial_pn:G.erased PN.packet_number_t ->\n aead_state:EverCrypt.AEAD.state the_aead_alg ->\n iv:EverCrypt.AEAD.iv_p the_aead_alg { B.length iv == 12 } ->\n hp_key:B.buffer Secret.uint8 { B.length hp_key = QUIC.Spec.cipher_keysize the_aead_alg } ->\n pn:B.pointer PN.packet_number_t ->\n ctr_state:CTR.state (as_cipher_alg the_aead_alg) ->\n state_s i\n\nlet footprint_s #i h s =\n let open LowStar.Buffer in\n AEAD.footprint h (State?.aead_state s) `loc_union`\n CTR.footprint h (State?.ctr_state s) `loc_union`\n loc_buffer (State?.iv s) `loc_union`\n loc_buffer (State?.hp_key s) `loc_union`\n loc_buffer (State?.pn s)\n\nlet g_traffic_secret #i s =\n // Automatic reveal insertion doesn't work here\n G.reveal (State?.traffic_secret s)\n\nlet g_initial_packet_number #i s =\n // New style: automatic insertion of reveal\n State?.initial_pn s\n\nlet invariant_s #i h s =\n let open QUIC.Spec in\n let State hash_alg aead_alg traffic_secret initial_pn aead_state iv hp_key pn ctr_state =\n s in\n hash_is_keysized s; (\n AEAD.invariant h aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n B.(all_live h [ buf iv; buf hp_key; buf pn ]) /\\\n B.(all_disjoint [ CTR.footprint h ctr_state;\n AEAD.footprint h aead_state; loc_buffer iv; loc_buffer hp_key; loc_buffer pn ]) /\\\n // : automatic insertion of reveal does not work here\n Secret.v initial_pn <= Secret.v (B.deref h pn) /\\\n AEAD.as_kv (B.deref h aead_state) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_key (Spec.Agile.AEAD.key_length aead_alg) /\\\n (B.as_seq h iv) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_iv 12 /\\\n B.as_seq h hp_key ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_hp (QUIC.Spec.cipher_keysize aead_alg)\n )\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet g_last_packet_number #i s h =\n B.deref h (State?.pn s)\n\nlet frame_invariant #i l s h0 h1 =\n AEAD.frame_invariant l (State?.aead_state (B.deref h0 s)) h0 h1;\n CTR.frame_invariant l (State?.ctr_state (B.deref h0 s)) h0 h1\n\nlet aead_alg_of_state #i s =\n let State _ the_aead_alg _ _ _ _ _ _ _ = !*s in\n the_aead_alg\n\nlet hash_alg_of_state #i s =\n let open FStar.HyperStack.ST in (* for the !* notation *)\n let State the_hash_alg _ _ _ _ _ _ _ _ = !*s in\n the_hash_alg\n\nlet last_packet_number_of_state #i s =\n let State _ _ _ _ _ _ _ pn _ = !*s in\n !*pn\n\n\n/// For functions that perform allocations, or even functions that need\n/// temporary state, a style we adopt here is to write the core (i.e. what would\n/// normally go in-between push and pop frame) as a separate function. If\n/// needed, the core of the function takes its temporary allocations as\n/// parameters, and reasons abstractly against a region where the temporary\n/// allocations live. This gives significantly better proof performance.\n///\n/// Another bit of style: after every stateful operation, we restore manually:\n/// the modifies clause (going directly for the one we want); the invariant; the\n/// footprint preservation; then the functional correctness propertise we are\n/// seeking.\n\nval create_in_core:\n i:index ->\n r:HS.rid ->\n dst: B.pointer (B.pointer_or_null (state_s i)) ->\n initial_pn:PN.packet_number_t ->\n traffic_secret:B.buffer Secret.uint8 {\n B.length traffic_secret = Spec.Hash.Definitions.hash_length i.hash_alg\n } ->\n aead_state:AEAD.state i.aead_alg ->\n ctr_state:CTR.state (as_cipher_alg i.aead_alg) ->\n HST.ST unit\n (requires fun h0 ->\n Lemmas.hash_is_keysized_ i.hash_alg; (\n HST.is_eternal_region r /\\\n B.live h0 dst /\\ B.live h0 traffic_secret /\\\n B.(all_disjoint [ AEAD.footprint h0 aead_state; CTR.footprint h0 ctr_state;\n loc_buffer dst; loc_buffer traffic_secret ]) /\\\n B.(loc_includes (loc_region_only true r) (AEAD.footprint h0 aead_state)) /\\\n B.(loc_includes (loc_region_only true r) (CTR.footprint h0 ctr_state)) /\\\n\n // Whatever from the invariant ought to be established already.\n AEAD.invariant h0 aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h0 ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n AEAD.as_kv (B.deref h0 aead_state) ==\n QUIC.Spec.(derive_secret i.hash_alg (B.as_seq h0 traffic_secret) label_key\n (Spec.Agile.AEAD.key_length i.aead_alg))))\n (ensures (fun h0 _ h1 ->\n let s = B.deref h1 dst in\n not (B.g_is_null s) /\\\n invariant h1 s /\\\n\n B.(modifies (loc_buffer dst) h0 h1) /\\ (\n let State _ _ _ initial_pn' aead_state' iv' hp_key' pn' ctr_state' = B.deref h1 s in\n aead_state' == aead_state /\\\n ctr_state' == ctr_state /\\\n B.(fresh_loc (loc_buffer iv') h0 h1) /\\\n B.(fresh_loc (loc_buffer hp_key') h0 h1) /\\\n B.(fresh_loc (loc_buffer pn') h0 h1) /\\\n B.(fresh_loc (loc_addr_of_buffer s) h0 h1) /\\\n\n g_traffic_secret (B.deref h1 s) == B.as_seq h0 traffic_secret /\\ \n g_last_packet_number (B.deref h1 s) h1 == initial_pn /\\\n\n G.reveal initial_pn' == initial_pn)))\n\n#push-options \"--z3rlimit 50\"\nlet create_in_core i r dst initial_pn traffic_secret aead_state ctr_state =\n LowStar.ImmutableBuffer.recall Impl.label_key;\n LowStar.ImmutableBuffer.recall_contents Impl.label_key Spec.label_key;\n LowStar.ImmutableBuffer.recall Impl.label_iv;\n LowStar.ImmutableBuffer.recall_contents Impl.label_iv Spec.label_iv;\n LowStar.ImmutableBuffer.recall Impl.label_hp;\n LowStar.ImmutableBuffer.recall_contents Impl.label_hp Spec.label_hp;\n\n (**) let h0 = HST.get () in\n (**) assert_norm FStar.Mul.(8 * 12 <= pow2 64 - 1);\n\n // The modifies clauses that we will transitively carry across this function body.\n let mloc = G.hide (B.(loc_buffer dst `loc_union` loc_unused_in h0)) in\n let e_traffic_secret: G.erased (Spec.Hash.Definitions.bytes_hash i.hash_alg) =\n G.hide (B.as_seq h0 traffic_secret) in\n let e_initial_pn: G.erased PN.packet_number_t = G.hide (initial_pn) in\n\n let iv = B.malloc r (Secret.to_u8 0uy) 12ul in\n let hp_key = B.malloc r (Secret.to_u8 0uy) (key_len32 i.aead_alg) in\n let pn = B.malloc r initial_pn 1ul in\n (**) let h1 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h0 h1 loc_none);\n (**) assert (B.length hp_key = QUIC.Spec.cipher_keysize i.aead_alg);\n\n let s: state_s i = State #i\n i.hash_alg i.aead_alg e_traffic_secret e_initial_pn\n aead_state iv hp_key pn ctr_state\n in\n\n let s:B.pointer_or_null (state_s i) = B.malloc r s 1ul in\n (**) let h2 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h1 h2 loc_none);\n (**) B.(modifies_trans (G.reveal mloc) h0 h1 (G.reveal mloc) h2);\n\n Impl.derive_secret i.hash_alg iv 12uy traffic_secret Impl.label_iv 2uy;\n (**) let h3 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h2 h3 (loc_buffer iv));\n (**) B.(modifies_trans (G.reveal mloc) h0 h2 (G.reveal mloc) h3);\n\n Impl.derive_secret i.hash_alg hp_key (key_len i.aead_alg) traffic_secret Impl.label_hp 2uy;\n (**) let h4 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h3 h4 (loc_buffer hp_key));\n (**) B.(modifies_trans (G.reveal mloc) h0 h3 (G.reveal mloc) h4);\n\n dst *= s;\n (**) let h5 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h4 h5 (loc_buffer dst));\n (**) B.(modifies_trans (G.reveal mloc) h0 h4 (G.reveal mloc) h5);\n (**) B.(modifies_only_not_unused_in (loc_buffer dst) h0 h5)\n#pop-options\n\n#restart-solver\n\n#push-options \"--z3rlimit 512\"\nlet create_in i r dst initial_pn traffic_secret =\n LowStar.ImmutableBuffer.recall Impl.label_key;\n LowStar.ImmutableBuffer.recall_contents Impl.label_key Spec.label_key;\n\n (**) let h0 = HST.get () in\n\n HST.push_frame ();\n (**) let h1 = HST.get () in\n let mloc = G.hide (B.(loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst\n `loc_union` loc_unused_in h0)) in\n\n let aead_key = B.alloca (Secret.to_u8 0uy) (key_len32 i.aead_alg) in\n let aead_state: B.pointer (B.pointer_or_null (AEAD.state_s i.aead_alg)) =\n B.alloca B.null 1ul in\n let ctr_state: B.pointer (B.pointer_or_null (CTR.state_s (as_cipher_alg i.aead_alg))) =\n B.alloca (B.null #(CTR.state_s (as_cipher_alg i.aead_alg))) 1ul in\n let dummy_iv = B.alloca (Secret.to_u8 0uy) 12ul in\n\n (**) let h2 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h1 h2 (loc_none));\n\n Impl.derive_secret i.hash_alg aead_key (key_len i.aead_alg) traffic_secret Impl.label_key 3uy;\n (**) let h3 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h2 h3 (loc_buffer aead_key));\n (**) B.(modifies_trans (G.reveal mloc) h1 h2 (G.reveal mloc) h3);\n\n let ret = AEAD.create_in #i.aead_alg r aead_state aead_key in\n (**) let h4 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h3 h4 (loc_buffer aead_state));\n (**) B.(modifies_trans (G.reveal mloc) h1 h3 (G.reveal mloc) h4);\n\n let ret' = CTR.create_in (as_cipher_alg i.aead_alg) r ctr_state aead_key dummy_iv 12ul 0ul in\n (**) let h5 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h4 h5 (loc_buffer ctr_state));\n (**) B.(modifies_trans (G.reveal mloc) h1 h4 (G.reveal mloc) h5);\n (**) B.(modifies_only_not_unused_in B.(loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst) h1 h5);\n\n match ret with\n | UnsupportedAlgorithm ->\n HST.pop_frame ();\n (**) let h6 = HST.get () in\n (**) B.(modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h5 h6);\n UnsupportedAlgorithm\n\n | Success ->\n\n match ret' with\n | UnsupportedAlgorithm ->\n HST.pop_frame ();\n (**) let h6 = HST.get () in\n (**) B.(modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h5 h6);\n UnsupportedAlgorithm\n\n | Success ->\n\n let aead_state: AEAD.state i.aead_alg = !*aead_state in\n (**) assert (AEAD.invariant h5 aead_state);\n\n let ctr_state: CTR.state (as_cipher_alg i.aead_alg) = !*ctr_state in\n (**) assert (CTR.invariant h5 ctr_state);\n\n create_in_core i r dst initial_pn traffic_secret aead_state ctr_state;\n (**) let h6 = HST.get () in\n\n (**) B.(modifies_loc_includes\n (loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst) h5 h6\n (loc_buffer dst));\n (**) B.(modifies_trans\n (loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst)\n h1 h5\n (loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst)\n h6);\n\n HST.pop_frame ();\n (**) let h7 = HST.get () in\n (**) B.(modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h6 h7);\n (**) frame_invariant (B.loc_region_only false (HS.get_tip h6)) (B.deref h7 dst) h6 h7;\n\n Success\n#pop-options\n\n#push-options \"--z3rlimit 64\"\n\nlet encrypt\n #i s dst dst_pn h plain plain_len\n=\n let m0 = HST.get () in\n let State hash_alg aead_alg e_traffic_secret e_initial_pn\n aead_state iv hp_key bpn ctr_state = !*s\n in\n let last_pn = !* bpn in\n let pn = last_pn `Secret.add` Secret.to_u64 1uL in\n B.upd bpn 0ul pn;\n B.upd dst_pn 0ul pn;\n let m1 = HST.get () in\n assert (B.modifies (footprint m0 s `B.loc_union` B.loc_buffer dst_pn) m0 m1);\n frame_header h pn (footprint m0 s `B.loc_union` B.loc_buffer dst_pn) m0 m1;\n Impl.encrypt aead_alg aead_state iv ctr_state hp_key dst h pn plain (Secret.to_u32 plain_len)\n\n#pop-options\n\n\n/// Initial secrets\n/// ---------------\n\n// TODO: these three should be immutable buffers but we don't have const\n// pointers yet for HKDF.\n#push-options \"--warn_error -272\"\nlet initial_salt: initial_salt:B.buffer U8.t {\n B.length initial_salt = 20 /\\\n B.recallable initial_salt\n} =\n [@inline_let]\n let l = [\n 0xc3uy; 0xeeuy; 0xf7uy; 0x12uy; 0xc7uy; 0x2euy; 0xbbuy; 0x5auy;\n 0x11uy; 0xa7uy; 0xd2uy; 0x43uy; 0x2buy; 0xb4uy; 0x63uy; 0x65uy;\n 0xbeuy; 0xf9uy; 0xf5uy; 0x02uy\n ] in\n assert_norm (List.Tot.length l = 20);\n B.gcmalloc_of_list HS.root l\n\nlet server_in: server_in:B.buffer U8.t {\n B.length server_in = 9 /\\\n B.recallable server_in\n} =\n [@inline_let]\n let l = [\n 0x73uy; 0x65uy; 0x72uy; 0x76uy; 0x65uy; 0x72uy; 0x20uy; 0x69uy; 0x6euy\n ] in\n assert_norm (List.Tot.length l = 9);\n B.gcmalloc_of_list HS.root l\n\nlet client_in: client_in:B.buffer U8.t {\n B.length client_in = 9 /\\\n B.recallable client_in\n} =\n [@inline_let]\n let l = [\n 0x63uy; 0x6cuy; 0x69uy; 0x65uy; 0x6euy; 0x74uy; 0x20uy; 0x69uy; 0x6euy\n ] in\n assert_norm (List.Tot.length l = 9);\n B.gcmalloc_of_list HS.root l\n#pop-options\n\n#push-options \"--z3rlimit 64\"", "dependencies": { "source_file": "QUIC.State.fst", "checked_file": "QUIC.State.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "Impl", "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n dst_client: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n dst_server: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n cid: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n cid_len: FStar.UInt32.t\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "FStar.UInt32.t", "LowStar.Monotonic.Buffer.modifies_fresh_frame_popped", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Buffer.trivial_preorder", "Prims.unit", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "FStar.HyperStack.ST.pop_frame", "LowStar.Monotonic.Buffer.modifies_trans", "FStar.Ghost.reveal", "LowStar.Monotonic.Buffer.loc", "QUIC.Secret.Buffer.with_whole_buffer_hide_weak_modifies", "FStar.Ghost.hide", "Prims.bool", "FStar.Seq.Properties.lseq", "FStar.UInt8.t", "LowStar.Monotonic.Buffer.length", "Prims.l_True", "FStar.Ghost.erased", "Prims.eq2", "Prims.nat", "EverCrypt.HKDF.expand", "Spec.Hash.Definitions.SHA2_256", "FStar.UInt32.__uint_to_t", "LowStar.Monotonic.Buffer.blit", "QUIC.State.server_in", "LowStar.Monotonic.Buffer.mbuffer", "LowStar.Buffer.sub", "QUIC.State.client_in", "EverCrypt.HKDF.extract", "QUIC.Impl.Lemmas.hash_is_keysized_", "QUIC.State.initial_salt", "Prims.l_and", "FStar.UInt32.v", "FStar.UInt32.uint_to_t", "Prims.b2t", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "LowStar.Buffer.alloca", "FStar.UInt8.__uint_to_t", "LowStar.Monotonic.Buffer.loc_unused_in_not_unused_in_disjoint", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "Lib.IntTypes.to_u8", "Lib.IntTypes.U1", "Lib.IntTypes.PUB", "LowStar.Monotonic.Buffer.loc_region_only", "FStar.Monotonic.HyperStack.get_tip", "FStar.HyperStack.ST.push_frame", "FStar.Pervasives.assert_norm", "Prims.op_Equality", "Prims.int", "Spec.Hash.Definitions.hash_length", "LowStar.Monotonic.Buffer.recall" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val initial_secrets (dst_client: B.buffer Secret.uint8)\n (dst_server: B.buffer Secret.uint8)\n (cid: B.buffer Secret.uint8)\n (cid_len: U32.t):\n HST.Stack unit\n (requires (fun h0 ->\n B.(all_live h0 [ buf dst_client; buf dst_server; buf cid ]) /\\\n B.length dst_client = Spec.Agile.Hash.(hash_length SHA2_256) /\\\n B.length dst_server = Spec.Agile.Hash.(hash_length SHA2_256) /\\\n B.length cid = U32.v cid_len /\\\n U32.v cid_len <= 20 /\\\n B.(all_disjoint [ loc_buffer dst_client; loc_buffer dst_server; loc_buffer cid ])))\n (ensures (fun h0 _ h1 ->\n B.(modifies (loc_buffer dst_client `loc_union` loc_buffer dst_server) h0 h1)))\nlet initial_secrets dst_client dst_server cid cid_len =", "completed_definiton": "let h0 = HST.get () in\nB.recall initial_salt;\nB.recall server_in;\nB.recall client_in;\nassert_norm (Spec.Agile.Hash.(hash_length SHA2_256) = 32);\nHST.push_frame ();\nlet h1 = HST.get () in\nlet mloc =\n G.hide (let open B in\n ((loc_buffer dst_client) `loc_union` (loc_buffer dst_server))\n `loc_union`\n (loc_region_only true (HS.get_tip h1)))\nin\nB.loc_unused_in_not_unused_in_disjoint h1;\nlet secret = B.alloca (Secret.to_u8 0uy) 32ul in\nlet h15 = HST.get () in\nB.loc_unused_in_not_unused_in_disjoint h15;\nlet tmp = B.alloca 0uy 20ul in\nB.blit initial_salt 0ul tmp 0ul 20ul;\nlet h2 = HST.get () in\nLemmas.hash_is_keysized_ Spec.Agile.Hash.SHA2_256;\nlet h25 = HST.get () in\nSecretBuffer.with_whole_buffer_hide_weak_modifies tmp\n h25\n ((B.loc_buffer secret) `B.loc_union` (B.loc_buffer cid))\n (B.loc_buffer secret)\n false\n (fun _ _ m -> True)\n (fun _ bs -> EverCrypt.HKDF.extract Spec.Agile.Hash.SHA2_256 secret bs 20ul cid cid_len);\nlet h3 = HST.get () in\n(let open B in modifies_trans (G.reveal mloc) h1 h2 (G.reveal mloc) h3);\nlet tmp_client_in = B.sub tmp 0ul 9ul in\nB.blit client_in 0ul tmp_client_in 0ul 9ul;\nlet h35 = HST.get () in\nSecretBuffer.with_whole_buffer_hide_weak_modifies tmp_client_in\n h35\n ((B.loc_buffer secret) `B.loc_union` (B.loc_buffer dst_client))\n (B.loc_buffer dst_client)\n false\n (fun _ _ m -> True)\n (fun _ bs -> EverCrypt.HKDF.expand Spec.Agile.Hash.SHA2_256 dst_client secret 32ul bs 9ul 32ul);\nlet h4 = HST.get () in\n(let open B in modifies_trans (G.reveal mloc) h1 h3 (G.reveal mloc) h4);\nlet tmp_server_in = B.sub tmp 0ul 9ul in\nB.blit server_in 0ul tmp_server_in 0ul 9ul;\nlet h45 = HST.get () in\nSecretBuffer.with_whole_buffer_hide_weak_modifies tmp_server_in\n h45\n ((B.loc_buffer secret) `B.loc_union` (B.loc_buffer dst_server))\n (B.loc_buffer dst_server)\n false\n (fun _ _ m -> True)\n (fun _ bs -> EverCrypt.HKDF.expand Spec.Agile.Hash.SHA2_256 dst_server secret 32ul bs 9ul 32ul);\nlet h5 = HST.get () in\n(let open B in modifies_trans (G.reveal mloc) h1 h4 (G.reveal mloc) h5);\nHST.pop_frame ();\nlet h6 = HST.get () in\nB.modifies_fresh_frame_popped h0\n h1\n B.((loc_buffer dst_client) `loc_union` (loc_buffer dst_server))\n h5\n h6", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fst", "name": "QUIC.State.decrypt", "original_source_type": "val decrypt: #i:G.erased index -> (\n let i = G.reveal i in\n s:state i ->\n dst: B.pointer result ->\n packet: B.buffer U8.t ->\n len: U32.t{\n B.length packet == U32.v len\n } ->\n cid_len: U8.t { U8.v cid_len <= 20 } ->\n HST.Stack error_code\n (requires fun h0 ->\n // We require clients to allocate space for a result, e.g.\n // result r = { 0 };\n // decrypt(s, &r, ...);\n // This means that we don't require that the pointers inside ``r`` be live\n // (i.e. NO ``header_live header`` precondition).\n // After a successful call to decrypt, ``packet`` contains the decrypted\n // data; ``header`` is modified to point within the header area of\n // ``packet``; and the plaintext is within ``packet`` in range\n // ``[header_len, header_len + plain_len)``.\n B.live h0 packet /\\ B.live h0 dst /\\\n B.(all_disjoint [ loc_buffer dst; loc_buffer packet; footprint h0 s ]) /\\\n invariant h0 s /\\\n incrementable s h0)\n (ensures fun h0 res h1 ->\n let r = B.deref h1 dst in\n decrypt_post i s dst packet len cid_len h0 res h1 /\\\n begin match res with\n | Success ->\n B.(modifies (footprint_s h0 (deref h0 s) `loc_union`\n loc_buffer (gsub packet 0ul (Secret.reveal r.total_len)) `loc_union` loc_buffer dst) h0 h1)\n | DecodeError ->\n B.modifies B.loc_none h0 h1\n | AuthenticationFailure ->\n B.(modifies (footprint_s h0 (deref h0 s) `loc_union`\n loc_buffer (gsub packet 0ul (Secret.reveal r.total_len)) `loc_union` loc_buffer dst) h0 h1)\n | _ -> False\n end\n )\n )", "source_type": "val decrypt: #i:G.erased index -> (\n let i = G.reveal i in\n s:state i ->\n dst: B.pointer result ->\n packet: B.buffer U8.t ->\n len: U32.t{\n B.length packet == U32.v len\n } ->\n cid_len: U8.t { U8.v cid_len <= 20 } ->\n HST.Stack error_code\n (requires fun h0 ->\n // We require clients to allocate space for a result, e.g.\n // result r = { 0 };\n // decrypt(s, &r, ...);\n // This means that we don't require that the pointers inside ``r`` be live\n // (i.e. NO ``header_live header`` precondition).\n // After a successful call to decrypt, ``packet`` contains the decrypted\n // data; ``header`` is modified to point within the header area of\n // ``packet``; and the plaintext is within ``packet`` in range\n // ``[header_len, header_len + plain_len)``.\n B.live h0 packet /\\ B.live h0 dst /\\\n B.(all_disjoint [ loc_buffer dst; loc_buffer packet; footprint h0 s ]) /\\\n invariant h0 s /\\\n incrementable s h0)\n (ensures fun h0 res h1 ->\n let r = B.deref h1 dst in\n decrypt_post i s dst packet len cid_len h0 res h1 /\\\n begin match res with\n | Success ->\n B.(modifies (footprint_s h0 (deref h0 s) `loc_union`\n loc_buffer (gsub packet 0ul (Secret.reveal r.total_len)) `loc_union` loc_buffer dst) h0 h1)\n | DecodeError ->\n B.modifies B.loc_none h0 h1\n | AuthenticationFailure ->\n B.(modifies (footprint_s h0 (deref h0 s) `loc_union`\n loc_buffer (gsub packet 0ul (Secret.reveal r.total_len)) `loc_union` loc_buffer dst) h0 h1)\n | _ -> False\n end\n )\n )", "source_definition": "let decrypt\n #i s dst packet len cid_len\n=\n let m0 = HST.get () in\n let State hash_alg aead_alg e_traffic_secret e_initial_pn\n aead_state iv hp_key bpn ctr_state = !*s\n in\n let last_pn = !* bpn in\n let res = Impl.decrypt aead_alg aead_state iv ctr_state hp_key packet len dst last_pn (FStar.Int.Cast.uint8_to_uint32 cid_len) in\n let m1 = HST.get () in\n if res = Success\n then begin\n let r = B.index dst 0ul in\n let pn = r.Base.pn in\n let pn' = Secret.max64 last_pn pn in\n B.upd bpn 0ul pn';\n let m2 = HST.get () in\n assert (B.modifies (footprint m0 s) m1 m2);\n frame_header r.header pn (footprint m0 s) m1 m2;\n assert (\n let k = derive_k i s m0 in\n let iv = derive_iv i s m0 in\n let pne = derive_pne i s m0 in\n match Spec.decrypt i.aead_alg k iv pne (Secret.v last_pn) (U8.v cid_len) (B.as_seq m0 packet) with\n | Spec.Success gh plain rem ->\n B.as_seq m1 (B.gsub packet (Secret.reveal r.header_len) (Secret.reveal r.plain_len)) == plain\n | _ -> False\n )\n end;\n res", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 469, "start_col": 1, "end_line": 496, "end_col": 5 }, "file_context": "module QUIC.State\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nopen LowStar.BufferOps (* for the !* notation *)\n\nmodule Spec = QUIC.Spec\nmodule Impl = QUIC.Impl\nmodule Lemmas = QUIC.Impl.Lemmas\n\n\n/// Helpers\n/// -------\n\nlet key_len (a: ea): x:U8.t { U8.v x = Spec.Agile.AEAD.key_length a } =\n let open Spec.Agile.AEAD in\n match a with\n | AES128_GCM -> 16uy\n | AES256_GCM -> 32uy\n | CHACHA20_POLY1305 -> 32uy\n\nlet key_len32 a = FStar.Int.Cast.uint8_to_uint32 (key_len a)\n\n\n/// https://tools.ietf.org/html/draft-ietf-quic-tls-23#section-5\n///\n/// We perform the three key derivations (AEAD key; AEAD iv; header protection\n/// key) when ``create`` is called. We thus store the original traffic secret\n/// only ghostly.\n///\n/// We retain the AEAD state, in order to perform the packet payload encryption.\n///\n/// We retain the Cipher state, in order to compute the mask for header protection.\nnoeq\ntype state_s (i: index) =\n | State:\n the_hash_alg:ha { the_hash_alg == i.hash_alg } ->\n the_aead_alg:ea { the_aead_alg == i.aead_alg } ->\n traffic_secret:G.erased (Spec.Hash.Definitions.bytes_hash the_hash_alg) ->\n initial_pn:G.erased PN.packet_number_t ->\n aead_state:EverCrypt.AEAD.state the_aead_alg ->\n iv:EverCrypt.AEAD.iv_p the_aead_alg { B.length iv == 12 } ->\n hp_key:B.buffer Secret.uint8 { B.length hp_key = QUIC.Spec.cipher_keysize the_aead_alg } ->\n pn:B.pointer PN.packet_number_t ->\n ctr_state:CTR.state (as_cipher_alg the_aead_alg) ->\n state_s i\n\nlet footprint_s #i h s =\n let open LowStar.Buffer in\n AEAD.footprint h (State?.aead_state s) `loc_union`\n CTR.footprint h (State?.ctr_state s) `loc_union`\n loc_buffer (State?.iv s) `loc_union`\n loc_buffer (State?.hp_key s) `loc_union`\n loc_buffer (State?.pn s)\n\nlet g_traffic_secret #i s =\n // Automatic reveal insertion doesn't work here\n G.reveal (State?.traffic_secret s)\n\nlet g_initial_packet_number #i s =\n // New style: automatic insertion of reveal\n State?.initial_pn s\n\nlet invariant_s #i h s =\n let open QUIC.Spec in\n let State hash_alg aead_alg traffic_secret initial_pn aead_state iv hp_key pn ctr_state =\n s in\n hash_is_keysized s; (\n AEAD.invariant h aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n B.(all_live h [ buf iv; buf hp_key; buf pn ]) /\\\n B.(all_disjoint [ CTR.footprint h ctr_state;\n AEAD.footprint h aead_state; loc_buffer iv; loc_buffer hp_key; loc_buffer pn ]) /\\\n // : automatic insertion of reveal does not work here\n Secret.v initial_pn <= Secret.v (B.deref h pn) /\\\n AEAD.as_kv (B.deref h aead_state) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_key (Spec.Agile.AEAD.key_length aead_alg) /\\\n (B.as_seq h iv) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_iv 12 /\\\n B.as_seq h hp_key ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_hp (QUIC.Spec.cipher_keysize aead_alg)\n )\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet g_last_packet_number #i s h =\n B.deref h (State?.pn s)\n\nlet frame_invariant #i l s h0 h1 =\n AEAD.frame_invariant l (State?.aead_state (B.deref h0 s)) h0 h1;\n CTR.frame_invariant l (State?.ctr_state (B.deref h0 s)) h0 h1\n\nlet aead_alg_of_state #i s =\n let State _ the_aead_alg _ _ _ _ _ _ _ = !*s in\n the_aead_alg\n\nlet hash_alg_of_state #i s =\n let open FStar.HyperStack.ST in (* for the !* notation *)\n let State the_hash_alg _ _ _ _ _ _ _ _ = !*s in\n the_hash_alg\n\nlet last_packet_number_of_state #i s =\n let State _ _ _ _ _ _ _ pn _ = !*s in\n !*pn\n\n\n/// For functions that perform allocations, or even functions that need\n/// temporary state, a style we adopt here is to write the core (i.e. what would\n/// normally go in-between push and pop frame) as a separate function. If\n/// needed, the core of the function takes its temporary allocations as\n/// parameters, and reasons abstractly against a region where the temporary\n/// allocations live. This gives significantly better proof performance.\n///\n/// Another bit of style: after every stateful operation, we restore manually:\n/// the modifies clause (going directly for the one we want); the invariant; the\n/// footprint preservation; then the functional correctness propertise we are\n/// seeking.\n\nval create_in_core:\n i:index ->\n r:HS.rid ->\n dst: B.pointer (B.pointer_or_null (state_s i)) ->\n initial_pn:PN.packet_number_t ->\n traffic_secret:B.buffer Secret.uint8 {\n B.length traffic_secret = Spec.Hash.Definitions.hash_length i.hash_alg\n } ->\n aead_state:AEAD.state i.aead_alg ->\n ctr_state:CTR.state (as_cipher_alg i.aead_alg) ->\n HST.ST unit\n (requires fun h0 ->\n Lemmas.hash_is_keysized_ i.hash_alg; (\n HST.is_eternal_region r /\\\n B.live h0 dst /\\ B.live h0 traffic_secret /\\\n B.(all_disjoint [ AEAD.footprint h0 aead_state; CTR.footprint h0 ctr_state;\n loc_buffer dst; loc_buffer traffic_secret ]) /\\\n B.(loc_includes (loc_region_only true r) (AEAD.footprint h0 aead_state)) /\\\n B.(loc_includes (loc_region_only true r) (CTR.footprint h0 ctr_state)) /\\\n\n // Whatever from the invariant ought to be established already.\n AEAD.invariant h0 aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h0 ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n AEAD.as_kv (B.deref h0 aead_state) ==\n QUIC.Spec.(derive_secret i.hash_alg (B.as_seq h0 traffic_secret) label_key\n (Spec.Agile.AEAD.key_length i.aead_alg))))\n (ensures (fun h0 _ h1 ->\n let s = B.deref h1 dst in\n not (B.g_is_null s) /\\\n invariant h1 s /\\\n\n B.(modifies (loc_buffer dst) h0 h1) /\\ (\n let State _ _ _ initial_pn' aead_state' iv' hp_key' pn' ctr_state' = B.deref h1 s in\n aead_state' == aead_state /\\\n ctr_state' == ctr_state /\\\n B.(fresh_loc (loc_buffer iv') h0 h1) /\\\n B.(fresh_loc (loc_buffer hp_key') h0 h1) /\\\n B.(fresh_loc (loc_buffer pn') h0 h1) /\\\n B.(fresh_loc (loc_addr_of_buffer s) h0 h1) /\\\n\n g_traffic_secret (B.deref h1 s) == B.as_seq h0 traffic_secret /\\ \n g_last_packet_number (B.deref h1 s) h1 == initial_pn /\\\n\n G.reveal initial_pn' == initial_pn)))\n\n#push-options \"--z3rlimit 50\"\nlet create_in_core i r dst initial_pn traffic_secret aead_state ctr_state =\n LowStar.ImmutableBuffer.recall Impl.label_key;\n LowStar.ImmutableBuffer.recall_contents Impl.label_key Spec.label_key;\n LowStar.ImmutableBuffer.recall Impl.label_iv;\n LowStar.ImmutableBuffer.recall_contents Impl.label_iv Spec.label_iv;\n LowStar.ImmutableBuffer.recall Impl.label_hp;\n LowStar.ImmutableBuffer.recall_contents Impl.label_hp Spec.label_hp;\n\n (**) let h0 = HST.get () in\n (**) assert_norm FStar.Mul.(8 * 12 <= pow2 64 - 1);\n\n // The modifies clauses that we will transitively carry across this function body.\n let mloc = G.hide (B.(loc_buffer dst `loc_union` loc_unused_in h0)) in\n let e_traffic_secret: G.erased (Spec.Hash.Definitions.bytes_hash i.hash_alg) =\n G.hide (B.as_seq h0 traffic_secret) in\n let e_initial_pn: G.erased PN.packet_number_t = G.hide (initial_pn) in\n\n let iv = B.malloc r (Secret.to_u8 0uy) 12ul in\n let hp_key = B.malloc r (Secret.to_u8 0uy) (key_len32 i.aead_alg) in\n let pn = B.malloc r initial_pn 1ul in\n (**) let h1 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h0 h1 loc_none);\n (**) assert (B.length hp_key = QUIC.Spec.cipher_keysize i.aead_alg);\n\n let s: state_s i = State #i\n i.hash_alg i.aead_alg e_traffic_secret e_initial_pn\n aead_state iv hp_key pn ctr_state\n in\n\n let s:B.pointer_or_null (state_s i) = B.malloc r s 1ul in\n (**) let h2 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h1 h2 loc_none);\n (**) B.(modifies_trans (G.reveal mloc) h0 h1 (G.reveal mloc) h2);\n\n Impl.derive_secret i.hash_alg iv 12uy traffic_secret Impl.label_iv 2uy;\n (**) let h3 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h2 h3 (loc_buffer iv));\n (**) B.(modifies_trans (G.reveal mloc) h0 h2 (G.reveal mloc) h3);\n\n Impl.derive_secret i.hash_alg hp_key (key_len i.aead_alg) traffic_secret Impl.label_hp 2uy;\n (**) let h4 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h3 h4 (loc_buffer hp_key));\n (**) B.(modifies_trans (G.reveal mloc) h0 h3 (G.reveal mloc) h4);\n\n dst *= s;\n (**) let h5 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h4 h5 (loc_buffer dst));\n (**) B.(modifies_trans (G.reveal mloc) h0 h4 (G.reveal mloc) h5);\n (**) B.(modifies_only_not_unused_in (loc_buffer dst) h0 h5)\n#pop-options\n\n#restart-solver\n\n#push-options \"--z3rlimit 512\"\nlet create_in i r dst initial_pn traffic_secret =\n LowStar.ImmutableBuffer.recall Impl.label_key;\n LowStar.ImmutableBuffer.recall_contents Impl.label_key Spec.label_key;\n\n (**) let h0 = HST.get () in\n\n HST.push_frame ();\n (**) let h1 = HST.get () in\n let mloc = G.hide (B.(loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst\n `loc_union` loc_unused_in h0)) in\n\n let aead_key = B.alloca (Secret.to_u8 0uy) (key_len32 i.aead_alg) in\n let aead_state: B.pointer (B.pointer_or_null (AEAD.state_s i.aead_alg)) =\n B.alloca B.null 1ul in\n let ctr_state: B.pointer (B.pointer_or_null (CTR.state_s (as_cipher_alg i.aead_alg))) =\n B.alloca (B.null #(CTR.state_s (as_cipher_alg i.aead_alg))) 1ul in\n let dummy_iv = B.alloca (Secret.to_u8 0uy) 12ul in\n\n (**) let h2 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h1 h2 (loc_none));\n\n Impl.derive_secret i.hash_alg aead_key (key_len i.aead_alg) traffic_secret Impl.label_key 3uy;\n (**) let h3 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h2 h3 (loc_buffer aead_key));\n (**) B.(modifies_trans (G.reveal mloc) h1 h2 (G.reveal mloc) h3);\n\n let ret = AEAD.create_in #i.aead_alg r aead_state aead_key in\n (**) let h4 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h3 h4 (loc_buffer aead_state));\n (**) B.(modifies_trans (G.reveal mloc) h1 h3 (G.reveal mloc) h4);\n\n let ret' = CTR.create_in (as_cipher_alg i.aead_alg) r ctr_state aead_key dummy_iv 12ul 0ul in\n (**) let h5 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h4 h5 (loc_buffer ctr_state));\n (**) B.(modifies_trans (G.reveal mloc) h1 h4 (G.reveal mloc) h5);\n (**) B.(modifies_only_not_unused_in B.(loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst) h1 h5);\n\n match ret with\n | UnsupportedAlgorithm ->\n HST.pop_frame ();\n (**) let h6 = HST.get () in\n (**) B.(modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h5 h6);\n UnsupportedAlgorithm\n\n | Success ->\n\n match ret' with\n | UnsupportedAlgorithm ->\n HST.pop_frame ();\n (**) let h6 = HST.get () in\n (**) B.(modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h5 h6);\n UnsupportedAlgorithm\n\n | Success ->\n\n let aead_state: AEAD.state i.aead_alg = !*aead_state in\n (**) assert (AEAD.invariant h5 aead_state);\n\n let ctr_state: CTR.state (as_cipher_alg i.aead_alg) = !*ctr_state in\n (**) assert (CTR.invariant h5 ctr_state);\n\n create_in_core i r dst initial_pn traffic_secret aead_state ctr_state;\n (**) let h6 = HST.get () in\n\n (**) B.(modifies_loc_includes\n (loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst) h5 h6\n (loc_buffer dst));\n (**) B.(modifies_trans\n (loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst)\n h1 h5\n (loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst)\n h6);\n\n HST.pop_frame ();\n (**) let h7 = HST.get () in\n (**) B.(modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h6 h7);\n (**) frame_invariant (B.loc_region_only false (HS.get_tip h6)) (B.deref h7 dst) h6 h7;\n\n Success\n#pop-options\n\n#push-options \"--z3rlimit 64\"\n\nlet encrypt\n #i s dst dst_pn h plain plain_len\n=\n let m0 = HST.get () in\n let State hash_alg aead_alg e_traffic_secret e_initial_pn\n aead_state iv hp_key bpn ctr_state = !*s\n in\n let last_pn = !* bpn in\n let pn = last_pn `Secret.add` Secret.to_u64 1uL in\n B.upd bpn 0ul pn;\n B.upd dst_pn 0ul pn;\n let m1 = HST.get () in\n assert (B.modifies (footprint m0 s `B.loc_union` B.loc_buffer dst_pn) m0 m1);\n frame_header h pn (footprint m0 s `B.loc_union` B.loc_buffer dst_pn) m0 m1;\n Impl.encrypt aead_alg aead_state iv ctr_state hp_key dst h pn plain (Secret.to_u32 plain_len)\n\n#pop-options\n\n\n/// Initial secrets\n/// ---------------\n\n// TODO: these three should be immutable buffers but we don't have const\n// pointers yet for HKDF.\n#push-options \"--warn_error -272\"\nlet initial_salt: initial_salt:B.buffer U8.t {\n B.length initial_salt = 20 /\\\n B.recallable initial_salt\n} =\n [@inline_let]\n let l = [\n 0xc3uy; 0xeeuy; 0xf7uy; 0x12uy; 0xc7uy; 0x2euy; 0xbbuy; 0x5auy;\n 0x11uy; 0xa7uy; 0xd2uy; 0x43uy; 0x2buy; 0xb4uy; 0x63uy; 0x65uy;\n 0xbeuy; 0xf9uy; 0xf5uy; 0x02uy\n ] in\n assert_norm (List.Tot.length l = 20);\n B.gcmalloc_of_list HS.root l\n\nlet server_in: server_in:B.buffer U8.t {\n B.length server_in = 9 /\\\n B.recallable server_in\n} =\n [@inline_let]\n let l = [\n 0x73uy; 0x65uy; 0x72uy; 0x76uy; 0x65uy; 0x72uy; 0x20uy; 0x69uy; 0x6euy\n ] in\n assert_norm (List.Tot.length l = 9);\n B.gcmalloc_of_list HS.root l\n\nlet client_in: client_in:B.buffer U8.t {\n B.length client_in = 9 /\\\n B.recallable client_in\n} =\n [@inline_let]\n let l = [\n 0x63uy; 0x6cuy; 0x69uy; 0x65uy; 0x6euy; 0x74uy; 0x20uy; 0x69uy; 0x6euy\n ] in\n assert_norm (List.Tot.length l = 9);\n B.gcmalloc_of_list HS.root l\n#pop-options\n\n#push-options \"--z3rlimit 64\"\n\nlet initial_secrets dst_client dst_server cid cid_len =\n (**) let h0 = HST.get () in\n (**) B.recall initial_salt;\n (**) B.recall server_in;\n (**) B.recall client_in;\n assert_norm (Spec.Agile.Hash.(hash_length SHA2_256) = 32);\n\n HST.push_frame ();\n (**) let h1 = HST.get () in\n (**) let mloc = G.hide (B.(loc_buffer dst_client `loc_union`\n loc_buffer dst_server `loc_union` loc_region_only true (HS.get_tip h1))) in\n\n B.loc_unused_in_not_unused_in_disjoint h1;\n let secret = B.alloca (Secret.to_u8 0uy) 32ul in\n \n (* we allocate a temporary buffer to copy the initial_salt,\n server_in and client_in and then to hide it through\n SecretBuffer.with_whole_buffer_hide_weak_modifies, because if we\n directly hide those global buffers, then we won't be able to\n prove that the livenesses of function arguments are preserved,\n because they are not disjoint from the global buffers. *)\n\n let h15 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint h15;\n let tmp = B.alloca 0uy 20ul in\n B.blit initial_salt 0ul tmp 0ul 20ul;\n \n (**) let h2 = HST.get () in\n\n (**) Lemmas.hash_is_keysized_ Spec.Agile.Hash.SHA2_256;\n let h25 = HST.get () in\n SecretBuffer.with_whole_buffer_hide_weak_modifies\n tmp\n h25\n (B.loc_buffer secret `B.loc_union` B.loc_buffer cid)\n (B.loc_buffer secret)\n false\n (fun _ _ m -> True)\n (fun _ bs ->\n EverCrypt.HKDF.extract Spec.Agile.Hash.SHA2_256 secret bs 20ul\n cid cid_len\n );\n (**) let h3 = HST.get () in\n (**) B.(modifies_trans (G.reveal mloc) h1 h2 (G.reveal mloc) h3);\n\n let tmp_client_in = B.sub tmp 0ul 9ul in\n B.blit client_in 0ul tmp_client_in 0ul 9ul;\n let h35 = HST.get () in\n SecretBuffer.with_whole_buffer_hide_weak_modifies\n tmp_client_in\n h35\n (B.loc_buffer secret `B.loc_union` B.loc_buffer dst_client)\n (B.loc_buffer dst_client)\n false\n (fun _ _ m -> True)\n (fun _ bs ->\n EverCrypt.HKDF.expand Spec.Agile.Hash.SHA2_256 dst_client secret 32ul bs 9ul 32ul\n );\n (**) let h4 = HST.get () in\n (**) B.(modifies_trans (G.reveal mloc) h1 h3 (G.reveal mloc) h4);\n\n let tmp_server_in = B.sub tmp 0ul 9ul in\n B.blit server_in 0ul tmp_server_in 0ul 9ul;\n let h45 = HST.get () in\n SecretBuffer.with_whole_buffer_hide_weak_modifies\n tmp_server_in\n h45\n (B.loc_buffer secret `B.loc_union` B.loc_buffer dst_server)\n (B.loc_buffer dst_server)\n false\n (fun _ _ m -> True)\n (fun _ bs ->\n EverCrypt.HKDF.expand Spec.Agile.Hash.SHA2_256 dst_server secret 32ul bs 9ul 32ul\n );\n (**) let h5 = HST.get () in\n (**) B.(modifies_trans (G.reveal mloc) h1 h4 (G.reveal mloc) h5);\n\n HST.pop_frame ();\n (**) let h6 = HST.get () in\n (**) B.modifies_fresh_frame_popped h0 h1\n (**) B.(loc_buffer dst_client `loc_union` loc_buffer dst_server) h5 h6\n\n#restart-solver\n\n\n#push-options \"--z3rlimit 128\"\n\nlet decrypt", "dependencies": { "source_file": "QUIC.State.fst", "checked_file": "QUIC.State.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "Impl", "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "let i = FStar.Ghost.reveal i in\n\n s: QUIC.State.state i ->\n dst: LowStar.Buffer.pointer QUIC.Impl.Header.Base.result ->\n packet: LowStar.Buffer.buffer FStar.UInt8.t ->\n len: FStar.UInt32.t{LowStar.Monotonic.Buffer.length packet == FStar.UInt32.v len} ->\n cid_len: FStar.UInt8.t{FStar.UInt8.v cid_len <= 20}\n -> FStar.HyperStack.ST.Stack EverCrypt.Error.error_code", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Ghost.erased", "QUIC.State.index", "QUIC.State.state", "FStar.Ghost.reveal", "LowStar.Buffer.pointer", "QUIC.Impl.Header.Base.result", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.eq2", "Prims.int", "Prims.l_or", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "FStar.UInt.size", "FStar.UInt32.n", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "FStar.UInt32.v", "Prims.op_LessThanOrEqual", "FStar.UInt8.v", "QUIC.Spec.Crypto.ha", "QUIC.State.__proj__Mkindex__item__hash_alg", "QUIC.Spec.Crypto.ea", "QUIC.State.__proj__Mkindex__item__aead_alg", "Spec.Hash.Definitions.bytes_hash", "QUIC.Spec.PacketNumber.Base.packet_number_t", "EverCrypt.AEAD.state", "EverCrypt.AEAD.iv_p", "Spec.Agile.AEAD.uint8", "Lib.IntTypes.uint8", "Prims.op_Equality", "Prims.nat", "QUIC.Spec.Crypto.cipher_keysize", "NotEverCrypt.CTR.state", "QUIC.Spec.Crypto.as_cipher_alg", "EverCrypt.Error.error_code", "Prims.unit", "EverCrypt.Error.Success", "Prims._assert", "QUIC.Spec.decrypt", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "LowStar.Monotonic.Buffer.as_seq", "QUIC.Spec.Header.Base.header", "QUIC.Spec.Base.bytes", "FStar.Seq.Base.seq", "QUIC.Spec.Base.byte", "LowStar.Buffer.gsub", "QUIC.Secret.Int.reveal", "Lib.IntTypes.U32", "QUIC.Impl.Header.Base.__proj__Mkresult__item__header_len", "QUIC.Impl.Header.Base.__proj__Mkresult__item__plain_len", "QUIC.Spec.result", "Prims.l_False", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "QUIC.State.derive_pne", "QUIC.State.derive_iv", "QUIC.State.derive_k", "QUIC.Impl.Header.Base.frame_header", "QUIC.Impl.Header.Base.__proj__Mkresult__item__header", "QUIC.State.footprint", "LowStar.Monotonic.Buffer.modifies", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "LowStar.Monotonic.Buffer.upd", "FStar.UInt32.__uint_to_t", "Lib.IntTypes.range", "Lib.IntTypes.v", "Prims.bool", "QUIC.Secret.Int.max64", "QUIC.Impl.Header.Base.__proj__Mkresult__item__pn", "LowStar.Monotonic.Buffer.index", "QUIC.Impl.decrypt", "FStar.Int.Cast.uint8_to_uint32", "LowStar.BufferOps.op_Bang_Star", "QUIC.State.state_s" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val decrypt: #i:G.erased index -> (\n let i = G.reveal i in\n s:state i ->\n dst: B.pointer result ->\n packet: B.buffer U8.t ->\n len: U32.t{\n B.length packet == U32.v len\n } ->\n cid_len: U8.t { U8.v cid_len <= 20 } ->\n HST.Stack error_code\n (requires fun h0 ->\n // We require clients to allocate space for a result, e.g.\n // result r = { 0 };\n // decrypt(s, &r, ...);\n // This means that we don't require that the pointers inside ``r`` be live\n // (i.e. NO ``header_live header`` precondition).\n // After a successful call to decrypt, ``packet`` contains the decrypted\n // data; ``header`` is modified to point within the header area of\n // ``packet``; and the plaintext is within ``packet`` in range\n // ``[header_len, header_len + plain_len)``.\n B.live h0 packet /\\ B.live h0 dst /\\\n B.(all_disjoint [ loc_buffer dst; loc_buffer packet; footprint h0 s ]) /\\\n invariant h0 s /\\\n incrementable s h0)\n (ensures fun h0 res h1 ->\n let r = B.deref h1 dst in\n decrypt_post i s dst packet len cid_len h0 res h1 /\\\n begin match res with\n | Success ->\n B.(modifies (footprint_s h0 (deref h0 s) `loc_union`\n loc_buffer (gsub packet 0ul (Secret.reveal r.total_len)) `loc_union` loc_buffer dst) h0 h1)\n | DecodeError ->\n B.modifies B.loc_none h0 h1\n | AuthenticationFailure ->\n B.(modifies (footprint_s h0 (deref h0 s) `loc_union`\n loc_buffer (gsub packet 0ul (Secret.reveal r.total_len)) `loc_union` loc_buffer dst) h0 h1)\n | _ -> False\n end\n )\n )\nlet decrypt #i s dst packet len cid_len =", "completed_definiton": "let m0 = HST.get () in\nlet State hash_alg aead_alg e_traffic_secret e_initial_pn aead_state iv hp_key bpn ctr_state =\n !*s\nin\nlet last_pn = !*bpn in\nlet res =\n Impl.decrypt aead_alg aead_state iv ctr_state hp_key packet len dst last_pn\n (FStar.Int.Cast.uint8_to_uint32 cid_len)\nin\nlet m1 = HST.get () in\nif res = Success\nthen\n (let r = B.index dst 0ul in\n let pn = r.Base.pn in\n let pn' = Secret.max64 last_pn pn in\n B.upd bpn 0ul pn';\n let m2 = HST.get () in\n assert (B.modifies (footprint m0 s) m1 m2);\n frame_header r.header pn (footprint m0 s) m1 m2;\n assert (let k = derive_k i s m0 in\n let iv = derive_iv i s m0 in\n let pne = derive_pne i s m0 in\n match\n Spec.decrypt i.aead_alg k iv pne (Secret.v last_pn) (U8.v cid_len) (B.as_seq m0 packet)\n with\n | Spec.Success gh plain rem ->\n B.as_seq m1 (B.gsub packet (Secret.reveal r.header_len) (Secret.reveal r.plain_len)) ==\n plain\n | _ -> False));\nres", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fst", "name": "QUIC.State.encrypt", "original_source_type": "val encrypt: #i:G.erased index -> (\n let i = G.reveal i in\n s: state i ->\n dst: B.buffer U8.t ->\n dst_pn: B.pointer PN.packet_number_t ->\n h: header ->\n plain: B.buffer Secret.uint8 ->\n plain_len: U32.t ->\n HST.Stack error_code\n (requires fun h0 ->\n // Memory & preservation\n B.live h0 plain /\\ B.live h0 dst /\\ B.live h0 dst_pn /\\\n header_live h h0 /\\\n B.(all_disjoint [ footprint h0 s; loc_buffer dst; loc_buffer dst_pn; header_footprint h; loc_buffer plain ]) /\\\n invariant h0 s /\\\n incrementable s h0 /\\\n B.length plain == U32.v plain_len /\\ (\n let clen = if is_retry h then 0 else U32.v plain_len + Spec.Agile.AEAD.tag_length i.aead_alg in\n (if is_retry h then U32.v plain_len == 0 else 3 <= U32.v plain_len /\\ U32.v plain_len < Spec.max_plain_length) /\\\n (has_payload_length h ==> Secret.v (payload_length h) == clen) /\\\n B.length dst == Secret.v (header_len h) + clen\n ))\n (ensures fun h0 r h1 ->\n match r with\n | Success ->\n // Memory & preservation\n B.(modifies (footprint_s h0 (deref h0 s) `loc_union` loc_buffer dst `loc_union` loc_buffer dst_pn)) h0 h1 /\\\n invariant h1 s /\\\n footprint_s h1 (B.deref h1 s) == footprint_s h0 (B.deref h0 s) /\\ (\n // Functional correctness\n let k = derive_k i s h0 in\n let iv = derive_iv i s h0 in\n let pne = derive_pne i s h0 in\n let plain = B.as_seq h0 plain in\n let packet: packet = B.as_seq h1 dst in\n let pn = g_last_packet_number (B.deref h0 s) h0 `Secret.add` Secret.to_u64 1uL in\n B.deref h1 dst_pn == pn /\\\n packet == Spec.encrypt i.aead_alg k iv pne (g_header h h0 pn) (Seq.seq_reveal plain) /\\\n g_last_packet_number (B.deref h1 s) h1 == pn)\n | _ ->\n False))", "source_type": "val encrypt: #i:G.erased index -> (\n let i = G.reveal i in\n s: state i ->\n dst: B.buffer U8.t ->\n dst_pn: B.pointer PN.packet_number_t ->\n h: header ->\n plain: B.buffer Secret.uint8 ->\n plain_len: U32.t ->\n HST.Stack error_code\n (requires fun h0 ->\n // Memory & preservation\n B.live h0 plain /\\ B.live h0 dst /\\ B.live h0 dst_pn /\\\n header_live h h0 /\\\n B.(all_disjoint [ footprint h0 s; loc_buffer dst; loc_buffer dst_pn; header_footprint h; loc_buffer plain ]) /\\\n invariant h0 s /\\\n incrementable s h0 /\\\n B.length plain == U32.v plain_len /\\ (\n let clen = if is_retry h then 0 else U32.v plain_len + Spec.Agile.AEAD.tag_length i.aead_alg in\n (if is_retry h then U32.v plain_len == 0 else 3 <= U32.v plain_len /\\ U32.v plain_len < Spec.max_plain_length) /\\\n (has_payload_length h ==> Secret.v (payload_length h) == clen) /\\\n B.length dst == Secret.v (header_len h) + clen\n ))\n (ensures fun h0 r h1 ->\n match r with\n | Success ->\n // Memory & preservation\n B.(modifies (footprint_s h0 (deref h0 s) `loc_union` loc_buffer dst `loc_union` loc_buffer dst_pn)) h0 h1 /\\\n invariant h1 s /\\\n footprint_s h1 (B.deref h1 s) == footprint_s h0 (B.deref h0 s) /\\ (\n // Functional correctness\n let k = derive_k i s h0 in\n let iv = derive_iv i s h0 in\n let pne = derive_pne i s h0 in\n let plain = B.as_seq h0 plain in\n let packet: packet = B.as_seq h1 dst in\n let pn = g_last_packet_number (B.deref h0 s) h0 `Secret.add` Secret.to_u64 1uL in\n B.deref h1 dst_pn == pn /\\\n packet == Spec.encrypt i.aead_alg k iv pne (g_header h h0 pn) (Seq.seq_reveal plain) /\\\n g_last_packet_number (B.deref h1 s) h1 == pn)\n | _ ->\n False))", "source_definition": "let encrypt\n #i s dst dst_pn h plain plain_len\n=\n let m0 = HST.get () in\n let State hash_alg aead_alg e_traffic_secret e_initial_pn\n aead_state iv hp_key bpn ctr_state = !*s\n in\n let last_pn = !* bpn in\n let pn = last_pn `Secret.add` Secret.to_u64 1uL in\n B.upd bpn 0ul pn;\n B.upd dst_pn 0ul pn;\n let m1 = HST.get () in\n assert (B.modifies (footprint m0 s `B.loc_union` B.loc_buffer dst_pn) m0 m1);\n frame_header h pn (footprint m0 s `B.loc_union` B.loc_buffer dst_pn) m0 m1;\n Impl.encrypt aead_alg aead_state iv ctr_state hp_key dst h pn plain (Secret.to_u32 plain_len)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 319, "start_col": 1, "end_line": 331, "end_col": 95 }, "file_context": "module QUIC.State\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nopen LowStar.BufferOps (* for the !* notation *)\n\nmodule Spec = QUIC.Spec\nmodule Impl = QUIC.Impl\nmodule Lemmas = QUIC.Impl.Lemmas\n\n\n/// Helpers\n/// -------\n\nlet key_len (a: ea): x:U8.t { U8.v x = Spec.Agile.AEAD.key_length a } =\n let open Spec.Agile.AEAD in\n match a with\n | AES128_GCM -> 16uy\n | AES256_GCM -> 32uy\n | CHACHA20_POLY1305 -> 32uy\n\nlet key_len32 a = FStar.Int.Cast.uint8_to_uint32 (key_len a)\n\n\n/// https://tools.ietf.org/html/draft-ietf-quic-tls-23#section-5\n///\n/// We perform the three key derivations (AEAD key; AEAD iv; header protection\n/// key) when ``create`` is called. We thus store the original traffic secret\n/// only ghostly.\n///\n/// We retain the AEAD state, in order to perform the packet payload encryption.\n///\n/// We retain the Cipher state, in order to compute the mask for header protection.\nnoeq\ntype state_s (i: index) =\n | State:\n the_hash_alg:ha { the_hash_alg == i.hash_alg } ->\n the_aead_alg:ea { the_aead_alg == i.aead_alg } ->\n traffic_secret:G.erased (Spec.Hash.Definitions.bytes_hash the_hash_alg) ->\n initial_pn:G.erased PN.packet_number_t ->\n aead_state:EverCrypt.AEAD.state the_aead_alg ->\n iv:EverCrypt.AEAD.iv_p the_aead_alg { B.length iv == 12 } ->\n hp_key:B.buffer Secret.uint8 { B.length hp_key = QUIC.Spec.cipher_keysize the_aead_alg } ->\n pn:B.pointer PN.packet_number_t ->\n ctr_state:CTR.state (as_cipher_alg the_aead_alg) ->\n state_s i\n\nlet footprint_s #i h s =\n let open LowStar.Buffer in\n AEAD.footprint h (State?.aead_state s) `loc_union`\n CTR.footprint h (State?.ctr_state s) `loc_union`\n loc_buffer (State?.iv s) `loc_union`\n loc_buffer (State?.hp_key s) `loc_union`\n loc_buffer (State?.pn s)\n\nlet g_traffic_secret #i s =\n // Automatic reveal insertion doesn't work here\n G.reveal (State?.traffic_secret s)\n\nlet g_initial_packet_number #i s =\n // New style: automatic insertion of reveal\n State?.initial_pn s\n\nlet invariant_s #i h s =\n let open QUIC.Spec in\n let State hash_alg aead_alg traffic_secret initial_pn aead_state iv hp_key pn ctr_state =\n s in\n hash_is_keysized s; (\n AEAD.invariant h aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n B.(all_live h [ buf iv; buf hp_key; buf pn ]) /\\\n B.(all_disjoint [ CTR.footprint h ctr_state;\n AEAD.footprint h aead_state; loc_buffer iv; loc_buffer hp_key; loc_buffer pn ]) /\\\n // : automatic insertion of reveal does not work here\n Secret.v initial_pn <= Secret.v (B.deref h pn) /\\\n AEAD.as_kv (B.deref h aead_state) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_key (Spec.Agile.AEAD.key_length aead_alg) /\\\n (B.as_seq h iv) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_iv 12 /\\\n B.as_seq h hp_key ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_hp (QUIC.Spec.cipher_keysize aead_alg)\n )\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet g_last_packet_number #i s h =\n B.deref h (State?.pn s)\n\nlet frame_invariant #i l s h0 h1 =\n AEAD.frame_invariant l (State?.aead_state (B.deref h0 s)) h0 h1;\n CTR.frame_invariant l (State?.ctr_state (B.deref h0 s)) h0 h1\n\nlet aead_alg_of_state #i s =\n let State _ the_aead_alg _ _ _ _ _ _ _ = !*s in\n the_aead_alg\n\nlet hash_alg_of_state #i s =\n let open FStar.HyperStack.ST in (* for the !* notation *)\n let State the_hash_alg _ _ _ _ _ _ _ _ = !*s in\n the_hash_alg\n\nlet last_packet_number_of_state #i s =\n let State _ _ _ _ _ _ _ pn _ = !*s in\n !*pn\n\n\n/// For functions that perform allocations, or even functions that need\n/// temporary state, a style we adopt here is to write the core (i.e. what would\n/// normally go in-between push and pop frame) as a separate function. If\n/// needed, the core of the function takes its temporary allocations as\n/// parameters, and reasons abstractly against a region where the temporary\n/// allocations live. This gives significantly better proof performance.\n///\n/// Another bit of style: after every stateful operation, we restore manually:\n/// the modifies clause (going directly for the one we want); the invariant; the\n/// footprint preservation; then the functional correctness propertise we are\n/// seeking.\n\nval create_in_core:\n i:index ->\n r:HS.rid ->\n dst: B.pointer (B.pointer_or_null (state_s i)) ->\n initial_pn:PN.packet_number_t ->\n traffic_secret:B.buffer Secret.uint8 {\n B.length traffic_secret = Spec.Hash.Definitions.hash_length i.hash_alg\n } ->\n aead_state:AEAD.state i.aead_alg ->\n ctr_state:CTR.state (as_cipher_alg i.aead_alg) ->\n HST.ST unit\n (requires fun h0 ->\n Lemmas.hash_is_keysized_ i.hash_alg; (\n HST.is_eternal_region r /\\\n B.live h0 dst /\\ B.live h0 traffic_secret /\\\n B.(all_disjoint [ AEAD.footprint h0 aead_state; CTR.footprint h0 ctr_state;\n loc_buffer dst; loc_buffer traffic_secret ]) /\\\n B.(loc_includes (loc_region_only true r) (AEAD.footprint h0 aead_state)) /\\\n B.(loc_includes (loc_region_only true r) (CTR.footprint h0 ctr_state)) /\\\n\n // Whatever from the invariant ought to be established already.\n AEAD.invariant h0 aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h0 ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n AEAD.as_kv (B.deref h0 aead_state) ==\n QUIC.Spec.(derive_secret i.hash_alg (B.as_seq h0 traffic_secret) label_key\n (Spec.Agile.AEAD.key_length i.aead_alg))))\n (ensures (fun h0 _ h1 ->\n let s = B.deref h1 dst in\n not (B.g_is_null s) /\\\n invariant h1 s /\\\n\n B.(modifies (loc_buffer dst) h0 h1) /\\ (\n let State _ _ _ initial_pn' aead_state' iv' hp_key' pn' ctr_state' = B.deref h1 s in\n aead_state' == aead_state /\\\n ctr_state' == ctr_state /\\\n B.(fresh_loc (loc_buffer iv') h0 h1) /\\\n B.(fresh_loc (loc_buffer hp_key') h0 h1) /\\\n B.(fresh_loc (loc_buffer pn') h0 h1) /\\\n B.(fresh_loc (loc_addr_of_buffer s) h0 h1) /\\\n\n g_traffic_secret (B.deref h1 s) == B.as_seq h0 traffic_secret /\\ \n g_last_packet_number (B.deref h1 s) h1 == initial_pn /\\\n\n G.reveal initial_pn' == initial_pn)))\n\n#push-options \"--z3rlimit 50\"\nlet create_in_core i r dst initial_pn traffic_secret aead_state ctr_state =\n LowStar.ImmutableBuffer.recall Impl.label_key;\n LowStar.ImmutableBuffer.recall_contents Impl.label_key Spec.label_key;\n LowStar.ImmutableBuffer.recall Impl.label_iv;\n LowStar.ImmutableBuffer.recall_contents Impl.label_iv Spec.label_iv;\n LowStar.ImmutableBuffer.recall Impl.label_hp;\n LowStar.ImmutableBuffer.recall_contents Impl.label_hp Spec.label_hp;\n\n (**) let h0 = HST.get () in\n (**) assert_norm FStar.Mul.(8 * 12 <= pow2 64 - 1);\n\n // The modifies clauses that we will transitively carry across this function body.\n let mloc = G.hide (B.(loc_buffer dst `loc_union` loc_unused_in h0)) in\n let e_traffic_secret: G.erased (Spec.Hash.Definitions.bytes_hash i.hash_alg) =\n G.hide (B.as_seq h0 traffic_secret) in\n let e_initial_pn: G.erased PN.packet_number_t = G.hide (initial_pn) in\n\n let iv = B.malloc r (Secret.to_u8 0uy) 12ul in\n let hp_key = B.malloc r (Secret.to_u8 0uy) (key_len32 i.aead_alg) in\n let pn = B.malloc r initial_pn 1ul in\n (**) let h1 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h0 h1 loc_none);\n (**) assert (B.length hp_key = QUIC.Spec.cipher_keysize i.aead_alg);\n\n let s: state_s i = State #i\n i.hash_alg i.aead_alg e_traffic_secret e_initial_pn\n aead_state iv hp_key pn ctr_state\n in\n\n let s:B.pointer_or_null (state_s i) = B.malloc r s 1ul in\n (**) let h2 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h1 h2 loc_none);\n (**) B.(modifies_trans (G.reveal mloc) h0 h1 (G.reveal mloc) h2);\n\n Impl.derive_secret i.hash_alg iv 12uy traffic_secret Impl.label_iv 2uy;\n (**) let h3 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h2 h3 (loc_buffer iv));\n (**) B.(modifies_trans (G.reveal mloc) h0 h2 (G.reveal mloc) h3);\n\n Impl.derive_secret i.hash_alg hp_key (key_len i.aead_alg) traffic_secret Impl.label_hp 2uy;\n (**) let h4 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h3 h4 (loc_buffer hp_key));\n (**) B.(modifies_trans (G.reveal mloc) h0 h3 (G.reveal mloc) h4);\n\n dst *= s;\n (**) let h5 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h4 h5 (loc_buffer dst));\n (**) B.(modifies_trans (G.reveal mloc) h0 h4 (G.reveal mloc) h5);\n (**) B.(modifies_only_not_unused_in (loc_buffer dst) h0 h5)\n#pop-options\n\n#restart-solver\n\n#push-options \"--z3rlimit 512\"\nlet create_in i r dst initial_pn traffic_secret =\n LowStar.ImmutableBuffer.recall Impl.label_key;\n LowStar.ImmutableBuffer.recall_contents Impl.label_key Spec.label_key;\n\n (**) let h0 = HST.get () in\n\n HST.push_frame ();\n (**) let h1 = HST.get () in\n let mloc = G.hide (B.(loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst\n `loc_union` loc_unused_in h0)) in\n\n let aead_key = B.alloca (Secret.to_u8 0uy) (key_len32 i.aead_alg) in\n let aead_state: B.pointer (B.pointer_or_null (AEAD.state_s i.aead_alg)) =\n B.alloca B.null 1ul in\n let ctr_state: B.pointer (B.pointer_or_null (CTR.state_s (as_cipher_alg i.aead_alg))) =\n B.alloca (B.null #(CTR.state_s (as_cipher_alg i.aead_alg))) 1ul in\n let dummy_iv = B.alloca (Secret.to_u8 0uy) 12ul in\n\n (**) let h2 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h1 h2 (loc_none));\n\n Impl.derive_secret i.hash_alg aead_key (key_len i.aead_alg) traffic_secret Impl.label_key 3uy;\n (**) let h3 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h2 h3 (loc_buffer aead_key));\n (**) B.(modifies_trans (G.reveal mloc) h1 h2 (G.reveal mloc) h3);\n\n let ret = AEAD.create_in #i.aead_alg r aead_state aead_key in\n (**) let h4 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h3 h4 (loc_buffer aead_state));\n (**) B.(modifies_trans (G.reveal mloc) h1 h3 (G.reveal mloc) h4);\n\n let ret' = CTR.create_in (as_cipher_alg i.aead_alg) r ctr_state aead_key dummy_iv 12ul 0ul in\n (**) let h5 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h4 h5 (loc_buffer ctr_state));\n (**) B.(modifies_trans (G.reveal mloc) h1 h4 (G.reveal mloc) h5);\n (**) B.(modifies_only_not_unused_in B.(loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst) h1 h5);\n\n match ret with\n | UnsupportedAlgorithm ->\n HST.pop_frame ();\n (**) let h6 = HST.get () in\n (**) B.(modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h5 h6);\n UnsupportedAlgorithm\n\n | Success ->\n\n match ret' with\n | UnsupportedAlgorithm ->\n HST.pop_frame ();\n (**) let h6 = HST.get () in\n (**) B.(modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h5 h6);\n UnsupportedAlgorithm\n\n | Success ->\n\n let aead_state: AEAD.state i.aead_alg = !*aead_state in\n (**) assert (AEAD.invariant h5 aead_state);\n\n let ctr_state: CTR.state (as_cipher_alg i.aead_alg) = !*ctr_state in\n (**) assert (CTR.invariant h5 ctr_state);\n\n create_in_core i r dst initial_pn traffic_secret aead_state ctr_state;\n (**) let h6 = HST.get () in\n\n (**) B.(modifies_loc_includes\n (loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst) h5 h6\n (loc_buffer dst));\n (**) B.(modifies_trans\n (loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst)\n h1 h5\n (loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst)\n h6);\n\n HST.pop_frame ();\n (**) let h7 = HST.get () in\n (**) B.(modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h6 h7);\n (**) frame_invariant (B.loc_region_only false (HS.get_tip h6)) (B.deref h7 dst) h6 h7;\n\n Success\n#pop-options\n\n#push-options \"--z3rlimit 64\"\n\nlet encrypt", "dependencies": { "source_file": "QUIC.State.fst", "checked_file": "QUIC.State.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "Impl", "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "let i = FStar.Ghost.reveal i in\n\n s: QUIC.State.state i ->\n dst: LowStar.Buffer.buffer FStar.UInt8.t ->\n dst_pn: LowStar.Buffer.pointer QUIC.Spec.PacketNumber.Base.packet_number_t ->\n h: QUIC.Impl.Header.Base.header ->\n plain: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n plain_len: FStar.UInt32.t\n -> FStar.HyperStack.ST.Stack EverCrypt.Error.error_code", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.Ghost.erased", "QUIC.State.index", "QUIC.State.state", "FStar.Ghost.reveal", "LowStar.Buffer.buffer", "FStar.UInt8.t", "LowStar.Buffer.pointer", "QUIC.Spec.PacketNumber.Base.packet_number_t", "QUIC.Impl.Header.Base.header", "Lib.IntTypes.uint8", "FStar.UInt32.t", "QUIC.Spec.Crypto.ha", "Prims.eq2", "QUIC.State.__proj__Mkindex__item__hash_alg", "QUIC.Spec.Crypto.ea", "QUIC.State.__proj__Mkindex__item__aead_alg", "Spec.Hash.Definitions.bytes_hash", "EverCrypt.AEAD.state", "EverCrypt.AEAD.iv_p", "Prims.int", "LowStar.Monotonic.Buffer.length", "Spec.Agile.AEAD.uint8", "LowStar.Buffer.trivial_preorder", "Prims.b2t", "Prims.op_Equality", "Prims.nat", "QUIC.Spec.Crypto.cipher_keysize", "NotEverCrypt.CTR.state", "QUIC.Spec.Crypto.as_cipher_alg", "QUIC.Impl.encrypt", "Lib.IntTypes.to_u32", "Lib.IntTypes.U32", "Lib.IntTypes.PUB", "EverCrypt.Error.error_code", "Prims.unit", "QUIC.Impl.Header.Base.frame_header", "LowStar.Monotonic.Buffer.loc_union", "QUIC.State.footprint", "LowStar.Monotonic.Buffer.loc_buffer", "Prims._assert", "LowStar.Monotonic.Buffer.modifies", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "LowStar.Monotonic.Buffer.upd", "FStar.UInt32.__uint_to_t", "Lib.IntTypes.int_t", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "Lib.IntTypes.add", "Lib.IntTypes.to_u64", "FStar.UInt64.__uint_to_t", "LowStar.BufferOps.op_Bang_Star", "QUIC.State.state_s" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val encrypt: #i:G.erased index -> (\n let i = G.reveal i in\n s: state i ->\n dst: B.buffer U8.t ->\n dst_pn: B.pointer PN.packet_number_t ->\n h: header ->\n plain: B.buffer Secret.uint8 ->\n plain_len: U32.t ->\n HST.Stack error_code\n (requires fun h0 ->\n // Memory & preservation\n B.live h0 plain /\\ B.live h0 dst /\\ B.live h0 dst_pn /\\\n header_live h h0 /\\\n B.(all_disjoint [ footprint h0 s; loc_buffer dst; loc_buffer dst_pn; header_footprint h; loc_buffer plain ]) /\\\n invariant h0 s /\\\n incrementable s h0 /\\\n B.length plain == U32.v plain_len /\\ (\n let clen = if is_retry h then 0 else U32.v plain_len + Spec.Agile.AEAD.tag_length i.aead_alg in\n (if is_retry h then U32.v plain_len == 0 else 3 <= U32.v plain_len /\\ U32.v plain_len < Spec.max_plain_length) /\\\n (has_payload_length h ==> Secret.v (payload_length h) == clen) /\\\n B.length dst == Secret.v (header_len h) + clen\n ))\n (ensures fun h0 r h1 ->\n match r with\n | Success ->\n // Memory & preservation\n B.(modifies (footprint_s h0 (deref h0 s) `loc_union` loc_buffer dst `loc_union` loc_buffer dst_pn)) h0 h1 /\\\n invariant h1 s /\\\n footprint_s h1 (B.deref h1 s) == footprint_s h0 (B.deref h0 s) /\\ (\n // Functional correctness\n let k = derive_k i s h0 in\n let iv = derive_iv i s h0 in\n let pne = derive_pne i s h0 in\n let plain = B.as_seq h0 plain in\n let packet: packet = B.as_seq h1 dst in\n let pn = g_last_packet_number (B.deref h0 s) h0 `Secret.add` Secret.to_u64 1uL in\n B.deref h1 dst_pn == pn /\\\n packet == Spec.encrypt i.aead_alg k iv pne (g_header h h0 pn) (Seq.seq_reveal plain) /\\\n g_last_packet_number (B.deref h1 s) h1 == pn)\n | _ ->\n False))\nlet encrypt #i s dst dst_pn h plain plain_len =", "completed_definiton": "let m0 = HST.get () in\nlet State hash_alg aead_alg e_traffic_secret e_initial_pn aead_state iv hp_key bpn ctr_state =\n !*s\nin\nlet last_pn = !*bpn in\nlet pn = last_pn `Secret.add` (Secret.to_u64 1uL) in\nB.upd bpn 0ul pn;\nB.upd dst_pn 0ul pn;\nlet m1 = HST.get () in\nassert (B.modifies ((footprint m0 s) `B.loc_union` (B.loc_buffer dst_pn)) m0 m1);\nframe_header h pn ((footprint m0 s) `B.loc_union` (B.loc_buffer dst_pn)) m0 m1;\nImpl.encrypt aead_alg aead_state iv ctr_state hp_key dst h pn plain (Secret.to_u32 plain_len)", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fst", "name": "QUIC.State.create_in_core", "original_source_type": "val create_in_core:\n i:index ->\n r:HS.rid ->\n dst: B.pointer (B.pointer_or_null (state_s i)) ->\n initial_pn:PN.packet_number_t ->\n traffic_secret:B.buffer Secret.uint8 {\n B.length traffic_secret = Spec.Hash.Definitions.hash_length i.hash_alg\n } ->\n aead_state:AEAD.state i.aead_alg ->\n ctr_state:CTR.state (as_cipher_alg i.aead_alg) ->\n HST.ST unit\n (requires fun h0 ->\n Lemmas.hash_is_keysized_ i.hash_alg; (\n HST.is_eternal_region r /\\\n B.live h0 dst /\\ B.live h0 traffic_secret /\\\n B.(all_disjoint [ AEAD.footprint h0 aead_state; CTR.footprint h0 ctr_state;\n loc_buffer dst; loc_buffer traffic_secret ]) /\\\n B.(loc_includes (loc_region_only true r) (AEAD.footprint h0 aead_state)) /\\\n B.(loc_includes (loc_region_only true r) (CTR.footprint h0 ctr_state)) /\\\n\n // Whatever from the invariant ought to be established already.\n AEAD.invariant h0 aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h0 ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n AEAD.as_kv (B.deref h0 aead_state) ==\n QUIC.Spec.(derive_secret i.hash_alg (B.as_seq h0 traffic_secret) label_key\n (Spec.Agile.AEAD.key_length i.aead_alg))))\n (ensures (fun h0 _ h1 ->\n let s = B.deref h1 dst in\n not (B.g_is_null s) /\\\n invariant h1 s /\\\n\n B.(modifies (loc_buffer dst) h0 h1) /\\ (\n let State _ _ _ initial_pn' aead_state' iv' hp_key' pn' ctr_state' = B.deref h1 s in\n aead_state' == aead_state /\\\n ctr_state' == ctr_state /\\\n B.(fresh_loc (loc_buffer iv') h0 h1) /\\\n B.(fresh_loc (loc_buffer hp_key') h0 h1) /\\\n B.(fresh_loc (loc_buffer pn') h0 h1) /\\\n B.(fresh_loc (loc_addr_of_buffer s) h0 h1) /\\\n\n g_traffic_secret (B.deref h1 s) == B.as_seq h0 traffic_secret /\\ \n g_last_packet_number (B.deref h1 s) h1 == initial_pn /\\\n\n G.reveal initial_pn' == initial_pn)))", "source_type": "val create_in_core:\n i:index ->\n r:HS.rid ->\n dst: B.pointer (B.pointer_or_null (state_s i)) ->\n initial_pn:PN.packet_number_t ->\n traffic_secret:B.buffer Secret.uint8 {\n B.length traffic_secret = Spec.Hash.Definitions.hash_length i.hash_alg\n } ->\n aead_state:AEAD.state i.aead_alg ->\n ctr_state:CTR.state (as_cipher_alg i.aead_alg) ->\n HST.ST unit\n (requires fun h0 ->\n Lemmas.hash_is_keysized_ i.hash_alg; (\n HST.is_eternal_region r /\\\n B.live h0 dst /\\ B.live h0 traffic_secret /\\\n B.(all_disjoint [ AEAD.footprint h0 aead_state; CTR.footprint h0 ctr_state;\n loc_buffer dst; loc_buffer traffic_secret ]) /\\\n B.(loc_includes (loc_region_only true r) (AEAD.footprint h0 aead_state)) /\\\n B.(loc_includes (loc_region_only true r) (CTR.footprint h0 ctr_state)) /\\\n\n // Whatever from the invariant ought to be established already.\n AEAD.invariant h0 aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h0 ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n AEAD.as_kv (B.deref h0 aead_state) ==\n QUIC.Spec.(derive_secret i.hash_alg (B.as_seq h0 traffic_secret) label_key\n (Spec.Agile.AEAD.key_length i.aead_alg))))\n (ensures (fun h0 _ h1 ->\n let s = B.deref h1 dst in\n not (B.g_is_null s) /\\\n invariant h1 s /\\\n\n B.(modifies (loc_buffer dst) h0 h1) /\\ (\n let State _ _ _ initial_pn' aead_state' iv' hp_key' pn' ctr_state' = B.deref h1 s in\n aead_state' == aead_state /\\\n ctr_state' == ctr_state /\\\n B.(fresh_loc (loc_buffer iv') h0 h1) /\\\n B.(fresh_loc (loc_buffer hp_key') h0 h1) /\\\n B.(fresh_loc (loc_buffer pn') h0 h1) /\\\n B.(fresh_loc (loc_addr_of_buffer s) h0 h1) /\\\n\n g_traffic_secret (B.deref h1 s) == B.as_seq h0 traffic_secret /\\ \n g_last_packet_number (B.deref h1 s) h1 == initial_pn /\\\n\n G.reveal initial_pn' == initial_pn)))", "source_definition": "let create_in_core i r dst initial_pn traffic_secret aead_state ctr_state =\n LowStar.ImmutableBuffer.recall Impl.label_key;\n LowStar.ImmutableBuffer.recall_contents Impl.label_key Spec.label_key;\n LowStar.ImmutableBuffer.recall Impl.label_iv;\n LowStar.ImmutableBuffer.recall_contents Impl.label_iv Spec.label_iv;\n LowStar.ImmutableBuffer.recall Impl.label_hp;\n LowStar.ImmutableBuffer.recall_contents Impl.label_hp Spec.label_hp;\n\n (**) let h0 = HST.get () in\n (**) assert_norm FStar.Mul.(8 * 12 <= pow2 64 - 1);\n\n // The modifies clauses that we will transitively carry across this function body.\n let mloc = G.hide (B.(loc_buffer dst `loc_union` loc_unused_in h0)) in\n let e_traffic_secret: G.erased (Spec.Hash.Definitions.bytes_hash i.hash_alg) =\n G.hide (B.as_seq h0 traffic_secret) in\n let e_initial_pn: G.erased PN.packet_number_t = G.hide (initial_pn) in\n\n let iv = B.malloc r (Secret.to_u8 0uy) 12ul in\n let hp_key = B.malloc r (Secret.to_u8 0uy) (key_len32 i.aead_alg) in\n let pn = B.malloc r initial_pn 1ul in\n (**) let h1 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h0 h1 loc_none);\n (**) assert (B.length hp_key = QUIC.Spec.cipher_keysize i.aead_alg);\n\n let s: state_s i = State #i\n i.hash_alg i.aead_alg e_traffic_secret e_initial_pn\n aead_state iv hp_key pn ctr_state\n in\n\n let s:B.pointer_or_null (state_s i) = B.malloc r s 1ul in\n (**) let h2 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h1 h2 loc_none);\n (**) B.(modifies_trans (G.reveal mloc) h0 h1 (G.reveal mloc) h2);\n\n Impl.derive_secret i.hash_alg iv 12uy traffic_secret Impl.label_iv 2uy;\n (**) let h3 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h2 h3 (loc_buffer iv));\n (**) B.(modifies_trans (G.reveal mloc) h0 h2 (G.reveal mloc) h3);\n\n Impl.derive_secret i.hash_alg hp_key (key_len i.aead_alg) traffic_secret Impl.label_hp 2uy;\n (**) let h4 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h3 h4 (loc_buffer hp_key));\n (**) B.(modifies_trans (G.reveal mloc) h0 h3 (G.reveal mloc) h4);\n\n dst *= s;\n (**) let h5 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h4 h5 (loc_buffer dst));\n (**) B.(modifies_trans (G.reveal mloc) h0 h4 (G.reveal mloc) h5);\n (**) B.(modifies_only_not_unused_in (loc_buffer dst) h0 h5)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 181, "start_col": 2, "end_line": 228, "end_col": 61 }, "file_context": "module QUIC.State\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nopen LowStar.BufferOps (* for the !* notation *)\n\nmodule Spec = QUIC.Spec\nmodule Impl = QUIC.Impl\nmodule Lemmas = QUIC.Impl.Lemmas\n\n\n/// Helpers\n/// -------\n\nlet key_len (a: ea): x:U8.t { U8.v x = Spec.Agile.AEAD.key_length a } =\n let open Spec.Agile.AEAD in\n match a with\n | AES128_GCM -> 16uy\n | AES256_GCM -> 32uy\n | CHACHA20_POLY1305 -> 32uy\n\nlet key_len32 a = FStar.Int.Cast.uint8_to_uint32 (key_len a)\n\n\n/// https://tools.ietf.org/html/draft-ietf-quic-tls-23#section-5\n///\n/// We perform the three key derivations (AEAD key; AEAD iv; header protection\n/// key) when ``create`` is called. We thus store the original traffic secret\n/// only ghostly.\n///\n/// We retain the AEAD state, in order to perform the packet payload encryption.\n///\n/// We retain the Cipher state, in order to compute the mask for header protection.\nnoeq\ntype state_s (i: index) =\n | State:\n the_hash_alg:ha { the_hash_alg == i.hash_alg } ->\n the_aead_alg:ea { the_aead_alg == i.aead_alg } ->\n traffic_secret:G.erased (Spec.Hash.Definitions.bytes_hash the_hash_alg) ->\n initial_pn:G.erased PN.packet_number_t ->\n aead_state:EverCrypt.AEAD.state the_aead_alg ->\n iv:EverCrypt.AEAD.iv_p the_aead_alg { B.length iv == 12 } ->\n hp_key:B.buffer Secret.uint8 { B.length hp_key = QUIC.Spec.cipher_keysize the_aead_alg } ->\n pn:B.pointer PN.packet_number_t ->\n ctr_state:CTR.state (as_cipher_alg the_aead_alg) ->\n state_s i\n\nlet footprint_s #i h s =\n let open LowStar.Buffer in\n AEAD.footprint h (State?.aead_state s) `loc_union`\n CTR.footprint h (State?.ctr_state s) `loc_union`\n loc_buffer (State?.iv s) `loc_union`\n loc_buffer (State?.hp_key s) `loc_union`\n loc_buffer (State?.pn s)\n\nlet g_traffic_secret #i s =\n // Automatic reveal insertion doesn't work here\n G.reveal (State?.traffic_secret s)\n\nlet g_initial_packet_number #i s =\n // New style: automatic insertion of reveal\n State?.initial_pn s\n\nlet invariant_s #i h s =\n let open QUIC.Spec in\n let State hash_alg aead_alg traffic_secret initial_pn aead_state iv hp_key pn ctr_state =\n s in\n hash_is_keysized s; (\n AEAD.invariant h aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n B.(all_live h [ buf iv; buf hp_key; buf pn ]) /\\\n B.(all_disjoint [ CTR.footprint h ctr_state;\n AEAD.footprint h aead_state; loc_buffer iv; loc_buffer hp_key; loc_buffer pn ]) /\\\n // : automatic insertion of reveal does not work here\n Secret.v initial_pn <= Secret.v (B.deref h pn) /\\\n AEAD.as_kv (B.deref h aead_state) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_key (Spec.Agile.AEAD.key_length aead_alg) /\\\n (B.as_seq h iv) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_iv 12 /\\\n B.as_seq h hp_key ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_hp (QUIC.Spec.cipher_keysize aead_alg)\n )\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet g_last_packet_number #i s h =\n B.deref h (State?.pn s)\n\nlet frame_invariant #i l s h0 h1 =\n AEAD.frame_invariant l (State?.aead_state (B.deref h0 s)) h0 h1;\n CTR.frame_invariant l (State?.ctr_state (B.deref h0 s)) h0 h1\n\nlet aead_alg_of_state #i s =\n let State _ the_aead_alg _ _ _ _ _ _ _ = !*s in\n the_aead_alg\n\nlet hash_alg_of_state #i s =\n let open FStar.HyperStack.ST in (* for the !* notation *)\n let State the_hash_alg _ _ _ _ _ _ _ _ = !*s in\n the_hash_alg\n\nlet last_packet_number_of_state #i s =\n let State _ _ _ _ _ _ _ pn _ = !*s in\n !*pn\n\n\n/// For functions that perform allocations, or even functions that need\n/// temporary state, a style we adopt here is to write the core (i.e. what would\n/// normally go in-between push and pop frame) as a separate function. If\n/// needed, the core of the function takes its temporary allocations as\n/// parameters, and reasons abstractly against a region where the temporary\n/// allocations live. This gives significantly better proof performance.\n///\n/// Another bit of style: after every stateful operation, we restore manually:\n/// the modifies clause (going directly for the one we want); the invariant; the\n/// footprint preservation; then the functional correctness propertise we are\n/// seeking.\n\nval create_in_core:\n i:index ->\n r:HS.rid ->\n dst: B.pointer (B.pointer_or_null (state_s i)) ->\n initial_pn:PN.packet_number_t ->\n traffic_secret:B.buffer Secret.uint8 {\n B.length traffic_secret = Spec.Hash.Definitions.hash_length i.hash_alg\n } ->\n aead_state:AEAD.state i.aead_alg ->\n ctr_state:CTR.state (as_cipher_alg i.aead_alg) ->\n HST.ST unit\n (requires fun h0 ->\n Lemmas.hash_is_keysized_ i.hash_alg; (\n HST.is_eternal_region r /\\\n B.live h0 dst /\\ B.live h0 traffic_secret /\\\n B.(all_disjoint [ AEAD.footprint h0 aead_state; CTR.footprint h0 ctr_state;\n loc_buffer dst; loc_buffer traffic_secret ]) /\\\n B.(loc_includes (loc_region_only true r) (AEAD.footprint h0 aead_state)) /\\\n B.(loc_includes (loc_region_only true r) (CTR.footprint h0 ctr_state)) /\\\n\n // Whatever from the invariant ought to be established already.\n AEAD.invariant h0 aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h0 ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n AEAD.as_kv (B.deref h0 aead_state) ==\n QUIC.Spec.(derive_secret i.hash_alg (B.as_seq h0 traffic_secret) label_key\n (Spec.Agile.AEAD.key_length i.aead_alg))))\n (ensures (fun h0 _ h1 ->\n let s = B.deref h1 dst in\n not (B.g_is_null s) /\\\n invariant h1 s /\\\n\n B.(modifies (loc_buffer dst) h0 h1) /\\ (\n let State _ _ _ initial_pn' aead_state' iv' hp_key' pn' ctr_state' = B.deref h1 s in\n aead_state' == aead_state /\\\n ctr_state' == ctr_state /\\\n B.(fresh_loc (loc_buffer iv') h0 h1) /\\\n B.(fresh_loc (loc_buffer hp_key') h0 h1) /\\\n B.(fresh_loc (loc_buffer pn') h0 h1) /\\\n B.(fresh_loc (loc_addr_of_buffer s) h0 h1) /\\\n\n g_traffic_secret (B.deref h1 s) == B.as_seq h0 traffic_secret /\\ \n g_last_packet_number (B.deref h1 s) h1 == initial_pn /\\\n\n G.reveal initial_pn' == initial_pn)))\n\n#push-options \"--z3rlimit 50\"", "dependencies": { "source_file": "QUIC.State.fst", "checked_file": "QUIC.State.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "Impl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 50, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n i: QUIC.State.index ->\n r: FStar.Monotonic.HyperHeap.rid ->\n dst: LowStar.Buffer.pointer (LowStar.Buffer.pointer_or_null (QUIC.State.state_s i)) ->\n initial_pn: QUIC.Spec.PacketNumber.Base.packet_number_t ->\n traffic_secret:\n LowStar.Buffer.buffer Lib.IntTypes.uint8\n { LowStar.Monotonic.Buffer.length traffic_secret =\n Spec.Hash.Definitions.hash_length (Mkindex?.hash_alg i) } ->\n aead_state: EverCrypt.AEAD.state (Mkindex?.aead_alg i) ->\n ctr_state: NotEverCrypt.CTR.state (QUIC.Spec.Crypto.as_cipher_alg (Mkindex?.aead_alg i))\n -> FStar.HyperStack.ST.ST Prims.unit", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.State.index", "FStar.Monotonic.HyperHeap.rid", "LowStar.Buffer.pointer", "LowStar.Buffer.pointer_or_null", "QUIC.State.state_s", "QUIC.Spec.PacketNumber.Base.packet_number_t", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "Prims.b2t", "Prims.op_Equality", "Prims.nat", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Spec.Hash.Definitions.hash_length", "QUIC.State.__proj__Mkindex__item__hash_alg", "EverCrypt.AEAD.state", "QUIC.State.__proj__Mkindex__item__aead_alg", "NotEverCrypt.CTR.state", "QUIC.Spec.Crypto.as_cipher_alg", "LowStar.Monotonic.Buffer.modifies_only_not_unused_in", "LowStar.Monotonic.Buffer.loc_buffer", "Prims.unit", "LowStar.Monotonic.Buffer.modifies_trans", "FStar.Ghost.reveal", "LowStar.Monotonic.Buffer.loc", "LowStar.Monotonic.Buffer.modifies_loc_includes", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "LowStar.BufferOps.op_Star_Equals", "QUIC.Impl.Crypto.derive_secret", "QUIC.State.key_len", "QUIC.Impl.Crypto.label_hp", "FStar.UInt8.__uint_to_t", "Spec.Agile.AEAD.uint8", "QUIC.Impl.Crypto.label_iv", "LowStar.Monotonic.Buffer.loc_none", "LowStar.Buffer.malloc", "FStar.UInt32.__uint_to_t", "LowStar.Monotonic.Buffer.mbuffer", "Prims.l_and", "Prims.eq2", "FStar.UInt32.v", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "LowStar.Monotonic.Buffer.frameOf", "LowStar.Monotonic.Buffer.freeable", "QUIC.State.State", "Prims._assert", "QUIC.Spec.Crypto.cipher_keysize", "FStar.UInt32.uint_to_t", "FStar.UInt32.t", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "QUIC.State.key_len32", "Lib.IntTypes.to_u8", "Lib.IntTypes.U1", "Lib.IntTypes.PUB", "FStar.Ghost.erased", "FStar.Ghost.hide", "Spec.Hash.Definitions.bytes_hash", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.loc_unused_in", "FStar.Pervasives.assert_norm", "Prims.op_LessThanOrEqual", "FStar.Mul.op_Star", "Prims.op_Subtraction", "Prims.pow2", "LowStar.ImmutableBuffer.recall_contents", "FStar.UInt8.t", "QUIC.Spec.Crypto.label_hp", "LowStar.Monotonic.Buffer.recall", "LowStar.ImmutableBuffer.immutable_preorder", "QUIC.Spec.Crypto.label_iv", "QUIC.Impl.Crypto.label_key", "QUIC.Spec.Crypto.label_key" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val create_in_core:\n i:index ->\n r:HS.rid ->\n dst: B.pointer (B.pointer_or_null (state_s i)) ->\n initial_pn:PN.packet_number_t ->\n traffic_secret:B.buffer Secret.uint8 {\n B.length traffic_secret = Spec.Hash.Definitions.hash_length i.hash_alg\n } ->\n aead_state:AEAD.state i.aead_alg ->\n ctr_state:CTR.state (as_cipher_alg i.aead_alg) ->\n HST.ST unit\n (requires fun h0 ->\n Lemmas.hash_is_keysized_ i.hash_alg; (\n HST.is_eternal_region r /\\\n B.live h0 dst /\\ B.live h0 traffic_secret /\\\n B.(all_disjoint [ AEAD.footprint h0 aead_state; CTR.footprint h0 ctr_state;\n loc_buffer dst; loc_buffer traffic_secret ]) /\\\n B.(loc_includes (loc_region_only true r) (AEAD.footprint h0 aead_state)) /\\\n B.(loc_includes (loc_region_only true r) (CTR.footprint h0 ctr_state)) /\\\n\n // Whatever from the invariant ought to be established already.\n AEAD.invariant h0 aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h0 ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n AEAD.as_kv (B.deref h0 aead_state) ==\n QUIC.Spec.(derive_secret i.hash_alg (B.as_seq h0 traffic_secret) label_key\n (Spec.Agile.AEAD.key_length i.aead_alg))))\n (ensures (fun h0 _ h1 ->\n let s = B.deref h1 dst in\n not (B.g_is_null s) /\\\n invariant h1 s /\\\n\n B.(modifies (loc_buffer dst) h0 h1) /\\ (\n let State _ _ _ initial_pn' aead_state' iv' hp_key' pn' ctr_state' = B.deref h1 s in\n aead_state' == aead_state /\\\n ctr_state' == ctr_state /\\\n B.(fresh_loc (loc_buffer iv') h0 h1) /\\\n B.(fresh_loc (loc_buffer hp_key') h0 h1) /\\\n B.(fresh_loc (loc_buffer pn') h0 h1) /\\\n B.(fresh_loc (loc_addr_of_buffer s) h0 h1) /\\\n\n g_traffic_secret (B.deref h1 s) == B.as_seq h0 traffic_secret /\\ \n g_last_packet_number (B.deref h1 s) h1 == initial_pn /\\\n\n G.reveal initial_pn' == initial_pn)))\nlet create_in_core i r dst initial_pn traffic_secret aead_state ctr_state =", "completed_definiton": "LowStar.ImmutableBuffer.recall Impl.label_key;\nLowStar.ImmutableBuffer.recall_contents Impl.label_key Spec.label_key;\nLowStar.ImmutableBuffer.recall Impl.label_iv;\nLowStar.ImmutableBuffer.recall_contents Impl.label_iv Spec.label_iv;\nLowStar.ImmutableBuffer.recall Impl.label_hp;\nLowStar.ImmutableBuffer.recall_contents Impl.label_hp Spec.label_hp;\nlet h0 = HST.get () in\nassert_norm FStar.Mul.(8 * 12 <= pow2 64 - 1);\nlet mloc = G.hide (let open B in (loc_buffer dst) `loc_union` (loc_unused_in h0)) in\nlet e_traffic_secret:G.erased (Spec.Hash.Definitions.bytes_hash i.hash_alg) =\n G.hide (B.as_seq h0 traffic_secret)\nin\nlet e_initial_pn:G.erased PN.packet_number_t = G.hide (initial_pn) in\nlet iv = B.malloc r (Secret.to_u8 0uy) 12ul in\nlet hp_key = B.malloc r (Secret.to_u8 0uy) (key_len32 i.aead_alg) in\nlet pn = B.malloc r initial_pn 1ul in\nlet h1 = HST.get () in\n(let open B in modifies_loc_includes (G.reveal mloc) h0 h1 loc_none);\nassert (B.length hp_key = QUIC.Spec.cipher_keysize i.aead_alg);\nlet s:state_s i =\n State #i i.hash_alg i.aead_alg e_traffic_secret e_initial_pn aead_state iv hp_key pn ctr_state\nin\nlet s:B.pointer_or_null (state_s i) = B.malloc r s 1ul in\nlet h2 = HST.get () in\n(let open B in modifies_loc_includes (G.reveal mloc) h1 h2 loc_none);\n(let open B in modifies_trans (G.reveal mloc) h0 h1 (G.reveal mloc) h2);\nImpl.derive_secret i.hash_alg iv 12uy traffic_secret Impl.label_iv 2uy;\nlet h3 = HST.get () in\n(let open B in modifies_loc_includes (G.reveal mloc) h2 h3 (loc_buffer iv));\n(let open B in modifies_trans (G.reveal mloc) h0 h2 (G.reveal mloc) h3);\nImpl.derive_secret i.hash_alg hp_key (key_len i.aead_alg) traffic_secret Impl.label_hp 2uy;\nlet h4 = HST.get () in\n(let open B in modifies_loc_includes (G.reveal mloc) h3 h4 (loc_buffer hp_key));\n(let open B in modifies_trans (G.reveal mloc) h0 h3 (G.reveal mloc) h4);\ndst *= s;\nlet h5 = HST.get () in\n(let open B in modifies_loc_includes (G.reveal mloc) h4 h5 (loc_buffer dst));\n(let open B in modifies_trans (G.reveal mloc) h0 h4 (G.reveal mloc) h5);\nlet open B in modifies_only_not_unused_in (loc_buffer dst) h0 h5", "isa_cross_project_example": true }, { "file_name": "QUIC.State.fst", "name": "QUIC.State.create_in", "original_source_type": "val create_in: i:index -> create_in_st i", "source_type": "val create_in: i:index -> create_in_st i", "source_definition": "let create_in i r dst initial_pn traffic_secret =\n LowStar.ImmutableBuffer.recall Impl.label_key;\n LowStar.ImmutableBuffer.recall_contents Impl.label_key Spec.label_key;\n\n (**) let h0 = HST.get () in\n\n HST.push_frame ();\n (**) let h1 = HST.get () in\n let mloc = G.hide (B.(loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst\n `loc_union` loc_unused_in h0)) in\n\n let aead_key = B.alloca (Secret.to_u8 0uy) (key_len32 i.aead_alg) in\n let aead_state: B.pointer (B.pointer_or_null (AEAD.state_s i.aead_alg)) =\n B.alloca B.null 1ul in\n let ctr_state: B.pointer (B.pointer_or_null (CTR.state_s (as_cipher_alg i.aead_alg))) =\n B.alloca (B.null #(CTR.state_s (as_cipher_alg i.aead_alg))) 1ul in\n let dummy_iv = B.alloca (Secret.to_u8 0uy) 12ul in\n\n (**) let h2 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h1 h2 (loc_none));\n\n Impl.derive_secret i.hash_alg aead_key (key_len i.aead_alg) traffic_secret Impl.label_key 3uy;\n (**) let h3 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h2 h3 (loc_buffer aead_key));\n (**) B.(modifies_trans (G.reveal mloc) h1 h2 (G.reveal mloc) h3);\n\n let ret = AEAD.create_in #i.aead_alg r aead_state aead_key in\n (**) let h4 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h3 h4 (loc_buffer aead_state));\n (**) B.(modifies_trans (G.reveal mloc) h1 h3 (G.reveal mloc) h4);\n\n let ret' = CTR.create_in (as_cipher_alg i.aead_alg) r ctr_state aead_key dummy_iv 12ul 0ul in\n (**) let h5 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h4 h5 (loc_buffer ctr_state));\n (**) B.(modifies_trans (G.reveal mloc) h1 h4 (G.reveal mloc) h5);\n (**) B.(modifies_only_not_unused_in B.(loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst) h1 h5);\n\n match ret with\n | UnsupportedAlgorithm ->\n HST.pop_frame ();\n (**) let h6 = HST.get () in\n (**) B.(modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h5 h6);\n UnsupportedAlgorithm\n\n | Success ->\n\n match ret' with\n | UnsupportedAlgorithm ->\n HST.pop_frame ();\n (**) let h6 = HST.get () in\n (**) B.(modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h5 h6);\n UnsupportedAlgorithm\n\n | Success ->\n\n let aead_state: AEAD.state i.aead_alg = !*aead_state in\n (**) assert (AEAD.invariant h5 aead_state);\n\n let ctr_state: CTR.state (as_cipher_alg i.aead_alg) = !*ctr_state in\n (**) assert (CTR.invariant h5 ctr_state);\n\n create_in_core i r dst initial_pn traffic_secret aead_state ctr_state;\n (**) let h6 = HST.get () in\n\n (**) B.(modifies_loc_includes\n (loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst) h5 h6\n (loc_buffer dst));\n (**) B.(modifies_trans\n (loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst)\n h1 h5\n (loc_region_only true (HS.get_tip h1) `loc_union` loc_buffer dst)\n h6);\n\n HST.pop_frame ();\n (**) let h7 = HST.get () in\n (**) B.(modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h6 h7);\n (**) frame_invariant (B.loc_region_only false (HS.get_tip h6)) (B.deref h7 dst) h6 h7;\n\n Success", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.State.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 235, "start_col": 2, "end_line": 312, "end_col": 13 }, "file_context": "module QUIC.State\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\nmodule IB = LowStar.ImmutableBuffer\nmodule U32 = FStar.UInt32\n\nmodule Seq = QUIC.Secret.Seq\nmodule SecretBuffer = QUIC.Secret.Buffer\n\nmodule SHKDF = Spec.Agile.HKDF\nmodule SHD = Spec.Hash.Definitions\n\nopen LowStar.BufferOps (* for the !* notation *)\n\nmodule Spec = QUIC.Spec\nmodule Impl = QUIC.Impl\nmodule Lemmas = QUIC.Impl.Lemmas\n\n\n/// Helpers\n/// -------\n\nlet key_len (a: ea): x:U8.t { U8.v x = Spec.Agile.AEAD.key_length a } =\n let open Spec.Agile.AEAD in\n match a with\n | AES128_GCM -> 16uy\n | AES256_GCM -> 32uy\n | CHACHA20_POLY1305 -> 32uy\n\nlet key_len32 a = FStar.Int.Cast.uint8_to_uint32 (key_len a)\n\n\n/// https://tools.ietf.org/html/draft-ietf-quic-tls-23#section-5\n///\n/// We perform the three key derivations (AEAD key; AEAD iv; header protection\n/// key) when ``create`` is called. We thus store the original traffic secret\n/// only ghostly.\n///\n/// We retain the AEAD state, in order to perform the packet payload encryption.\n///\n/// We retain the Cipher state, in order to compute the mask for header protection.\nnoeq\ntype state_s (i: index) =\n | State:\n the_hash_alg:ha { the_hash_alg == i.hash_alg } ->\n the_aead_alg:ea { the_aead_alg == i.aead_alg } ->\n traffic_secret:G.erased (Spec.Hash.Definitions.bytes_hash the_hash_alg) ->\n initial_pn:G.erased PN.packet_number_t ->\n aead_state:EverCrypt.AEAD.state the_aead_alg ->\n iv:EverCrypt.AEAD.iv_p the_aead_alg { B.length iv == 12 } ->\n hp_key:B.buffer Secret.uint8 { B.length hp_key = QUIC.Spec.cipher_keysize the_aead_alg } ->\n pn:B.pointer PN.packet_number_t ->\n ctr_state:CTR.state (as_cipher_alg the_aead_alg) ->\n state_s i\n\nlet footprint_s #i h s =\n let open LowStar.Buffer in\n AEAD.footprint h (State?.aead_state s) `loc_union`\n CTR.footprint h (State?.ctr_state s) `loc_union`\n loc_buffer (State?.iv s) `loc_union`\n loc_buffer (State?.hp_key s) `loc_union`\n loc_buffer (State?.pn s)\n\nlet g_traffic_secret #i s =\n // Automatic reveal insertion doesn't work here\n G.reveal (State?.traffic_secret s)\n\nlet g_initial_packet_number #i s =\n // New style: automatic insertion of reveal\n State?.initial_pn s\n\nlet invariant_s #i h s =\n let open QUIC.Spec in\n let State hash_alg aead_alg traffic_secret initial_pn aead_state iv hp_key pn ctr_state =\n s in\n hash_is_keysized s; (\n AEAD.invariant h aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n B.(all_live h [ buf iv; buf hp_key; buf pn ]) /\\\n B.(all_disjoint [ CTR.footprint h ctr_state;\n AEAD.footprint h aead_state; loc_buffer iv; loc_buffer hp_key; loc_buffer pn ]) /\\\n // : automatic insertion of reveal does not work here\n Secret.v initial_pn <= Secret.v (B.deref h pn) /\\\n AEAD.as_kv (B.deref h aead_state) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_key (Spec.Agile.AEAD.key_length aead_alg) /\\\n (B.as_seq h iv) ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_iv 12 /\\\n B.as_seq h hp_key ==\n derive_secret i.hash_alg (G.reveal traffic_secret) label_hp (QUIC.Spec.cipher_keysize aead_alg)\n )\n\nlet invariant_loc_in_footprint #_ _ _ = ()\n\nlet g_last_packet_number #i s h =\n B.deref h (State?.pn s)\n\nlet frame_invariant #i l s h0 h1 =\n AEAD.frame_invariant l (State?.aead_state (B.deref h0 s)) h0 h1;\n CTR.frame_invariant l (State?.ctr_state (B.deref h0 s)) h0 h1\n\nlet aead_alg_of_state #i s =\n let State _ the_aead_alg _ _ _ _ _ _ _ = !*s in\n the_aead_alg\n\nlet hash_alg_of_state #i s =\n let open FStar.HyperStack.ST in (* for the !* notation *)\n let State the_hash_alg _ _ _ _ _ _ _ _ = !*s in\n the_hash_alg\n\nlet last_packet_number_of_state #i s =\n let State _ _ _ _ _ _ _ pn _ = !*s in\n !*pn\n\n\n/// For functions that perform allocations, or even functions that need\n/// temporary state, a style we adopt here is to write the core (i.e. what would\n/// normally go in-between push and pop frame) as a separate function. If\n/// needed, the core of the function takes its temporary allocations as\n/// parameters, and reasons abstractly against a region where the temporary\n/// allocations live. This gives significantly better proof performance.\n///\n/// Another bit of style: after every stateful operation, we restore manually:\n/// the modifies clause (going directly for the one we want); the invariant; the\n/// footprint preservation; then the functional correctness propertise we are\n/// seeking.\n\nval create_in_core:\n i:index ->\n r:HS.rid ->\n dst: B.pointer (B.pointer_or_null (state_s i)) ->\n initial_pn:PN.packet_number_t ->\n traffic_secret:B.buffer Secret.uint8 {\n B.length traffic_secret = Spec.Hash.Definitions.hash_length i.hash_alg\n } ->\n aead_state:AEAD.state i.aead_alg ->\n ctr_state:CTR.state (as_cipher_alg i.aead_alg) ->\n HST.ST unit\n (requires fun h0 ->\n Lemmas.hash_is_keysized_ i.hash_alg; (\n HST.is_eternal_region r /\\\n B.live h0 dst /\\ B.live h0 traffic_secret /\\\n B.(all_disjoint [ AEAD.footprint h0 aead_state; CTR.footprint h0 ctr_state;\n loc_buffer dst; loc_buffer traffic_secret ]) /\\\n B.(loc_includes (loc_region_only true r) (AEAD.footprint h0 aead_state)) /\\\n B.(loc_includes (loc_region_only true r) (CTR.footprint h0 ctr_state)) /\\\n\n // Whatever from the invariant ought to be established already.\n AEAD.invariant h0 aead_state /\\\n not (B.g_is_null aead_state) /\\\n CTR.invariant h0 ctr_state /\\\n not (B.g_is_null ctr_state) /\\\n AEAD.as_kv (B.deref h0 aead_state) ==\n QUIC.Spec.(derive_secret i.hash_alg (B.as_seq h0 traffic_secret) label_key\n (Spec.Agile.AEAD.key_length i.aead_alg))))\n (ensures (fun h0 _ h1 ->\n let s = B.deref h1 dst in\n not (B.g_is_null s) /\\\n invariant h1 s /\\\n\n B.(modifies (loc_buffer dst) h0 h1) /\\ (\n let State _ _ _ initial_pn' aead_state' iv' hp_key' pn' ctr_state' = B.deref h1 s in\n aead_state' == aead_state /\\\n ctr_state' == ctr_state /\\\n B.(fresh_loc (loc_buffer iv') h0 h1) /\\\n B.(fresh_loc (loc_buffer hp_key') h0 h1) /\\\n B.(fresh_loc (loc_buffer pn') h0 h1) /\\\n B.(fresh_loc (loc_addr_of_buffer s) h0 h1) /\\\n\n g_traffic_secret (B.deref h1 s) == B.as_seq h0 traffic_secret /\\ \n g_last_packet_number (B.deref h1 s) h1 == initial_pn /\\\n\n G.reveal initial_pn' == initial_pn)))\n\n#push-options \"--z3rlimit 50\"\nlet create_in_core i r dst initial_pn traffic_secret aead_state ctr_state =\n LowStar.ImmutableBuffer.recall Impl.label_key;\n LowStar.ImmutableBuffer.recall_contents Impl.label_key Spec.label_key;\n LowStar.ImmutableBuffer.recall Impl.label_iv;\n LowStar.ImmutableBuffer.recall_contents Impl.label_iv Spec.label_iv;\n LowStar.ImmutableBuffer.recall Impl.label_hp;\n LowStar.ImmutableBuffer.recall_contents Impl.label_hp Spec.label_hp;\n\n (**) let h0 = HST.get () in\n (**) assert_norm FStar.Mul.(8 * 12 <= pow2 64 - 1);\n\n // The modifies clauses that we will transitively carry across this function body.\n let mloc = G.hide (B.(loc_buffer dst `loc_union` loc_unused_in h0)) in\n let e_traffic_secret: G.erased (Spec.Hash.Definitions.bytes_hash i.hash_alg) =\n G.hide (B.as_seq h0 traffic_secret) in\n let e_initial_pn: G.erased PN.packet_number_t = G.hide (initial_pn) in\n\n let iv = B.malloc r (Secret.to_u8 0uy) 12ul in\n let hp_key = B.malloc r (Secret.to_u8 0uy) (key_len32 i.aead_alg) in\n let pn = B.malloc r initial_pn 1ul in\n (**) let h1 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h0 h1 loc_none);\n (**) assert (B.length hp_key = QUIC.Spec.cipher_keysize i.aead_alg);\n\n let s: state_s i = State #i\n i.hash_alg i.aead_alg e_traffic_secret e_initial_pn\n aead_state iv hp_key pn ctr_state\n in\n\n let s:B.pointer_or_null (state_s i) = B.malloc r s 1ul in\n (**) let h2 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h1 h2 loc_none);\n (**) B.(modifies_trans (G.reveal mloc) h0 h1 (G.reveal mloc) h2);\n\n Impl.derive_secret i.hash_alg iv 12uy traffic_secret Impl.label_iv 2uy;\n (**) let h3 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h2 h3 (loc_buffer iv));\n (**) B.(modifies_trans (G.reveal mloc) h0 h2 (G.reveal mloc) h3);\n\n Impl.derive_secret i.hash_alg hp_key (key_len i.aead_alg) traffic_secret Impl.label_hp 2uy;\n (**) let h4 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h3 h4 (loc_buffer hp_key));\n (**) B.(modifies_trans (G.reveal mloc) h0 h3 (G.reveal mloc) h4);\n\n dst *= s;\n (**) let h5 = HST.get () in\n (**) B.(modifies_loc_includes (G.reveal mloc) h4 h5 (loc_buffer dst));\n (**) B.(modifies_trans (G.reveal mloc) h0 h4 (G.reveal mloc) h5);\n (**) B.(modifies_only_not_unused_in (loc_buffer dst) h0 h5)\n#pop-options\n\n#restart-solver\n\n#push-options \"--z3rlimit 512\"", "dependencies": { "source_file": "QUIC.State.fst", "checked_file": "QUIC.State.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.List.Tot.fst.checked", "FStar.Int.Cast.fst.checked", "FStar.HyperStack.ST.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Lemmas", "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "Impl", "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps (* for the !* notation *)" }, { "abbrev": true, "short_module": "SHD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": true, "short_module": "Base", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 512, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: QUIC.State.index -> QUIC.State.create_in_st i", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.State.index", "FStar.Monotonic.HyperHeap.rid", "LowStar.Buffer.pointer", "LowStar.Buffer.pointer_or_null", "QUIC.State.state_s", "QUIC.Spec.PacketNumber.Base.packet_number_t", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "Prims.b2t", "Prims.op_Equality", "Prims.nat", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Spec.Hash.Definitions.hash_length", "QUIC.State.__proj__Mkindex__item__hash_alg", "EverCrypt.Error.UnsupportedAlgorithm", "Prims.unit", "LowStar.Monotonic.Buffer.modifies_fresh_frame_popped", "LowStar.Monotonic.Buffer.loc_buffer", "EverCrypt.Error.error_code", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "FStar.HyperStack.ST.pop_frame", "EverCrypt.Error.Success", "QUIC.State.frame_invariant", "LowStar.Monotonic.Buffer.loc_region_only", "FStar.Monotonic.HyperStack.get_tip", "LowStar.Monotonic.Buffer.deref", "LowStar.Monotonic.Buffer.modifies_trans", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.modifies_loc_includes", "QUIC.State.create_in_core", "Prims._assert", "NotEverCrypt.CTR.invariant", "QUIC.Spec.Crypto.as_cipher_alg", "QUIC.State.__proj__Mkindex__item__aead_alg", "NotEverCrypt.CTR.state", "LowStar.BufferOps.op_Bang_Star", "NotEverCrypt.CTR.state_s", "EverCrypt.AEAD.invariant", "EverCrypt.AEAD.state", "EverCrypt.AEAD.state_s", "LowStar.Monotonic.Buffer.modifies_only_not_unused_in", "FStar.Ghost.reveal", "LowStar.Monotonic.Buffer.loc", "NotEverCrypt.CTR.create_in", "FStar.UInt32.__uint_to_t", "EverCrypt.AEAD.create_in", "QUIC.Impl.Crypto.derive_secret", "QUIC.State.key_len", "QUIC.Impl.Crypto.label_key", "FStar.UInt8.__uint_to_t", "LowStar.Monotonic.Buffer.loc_none", "LowStar.Monotonic.Buffer.mbuffer", "NotEverCrypt.CTR.uint8", "Prims.l_and", "Prims.eq2", "FStar.UInt32.v", "FStar.UInt32.uint_to_t", "FStar.UInt32.t", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "LowStar.Buffer.alloca", "Lib.IntTypes.to_u8", "Lib.IntTypes.U1", "Lib.IntTypes.PUB", "LowStar.Buffer.null", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "QUIC.State.key_len32", "FStar.Ghost.erased", "FStar.Ghost.hide", "LowStar.Monotonic.Buffer.loc_unused_in", "FStar.HyperStack.ST.push_frame", "LowStar.ImmutableBuffer.recall_contents", "FStar.UInt8.t", "QUIC.Spec.Crypto.label_key", "LowStar.Monotonic.Buffer.recall", "LowStar.ImmutableBuffer.immutable_preorder" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val create_in: i:index -> create_in_st i\nlet create_in i r dst initial_pn traffic_secret =", "completed_definiton": "LowStar.ImmutableBuffer.recall Impl.label_key;\nLowStar.ImmutableBuffer.recall_contents Impl.label_key Spec.label_key;\nlet h0 = HST.get () in\nHST.push_frame ();\nlet h1 = HST.get () in\nlet mloc =\n G.hide (let open B in\n ((loc_region_only true (HS.get_tip h1)) `loc_union` (loc_buffer dst))\n `loc_union`\n (loc_unused_in h0))\nin\nlet aead_key = B.alloca (Secret.to_u8 0uy) (key_len32 i.aead_alg) in\nlet aead_state:B.pointer (B.pointer_or_null (AEAD.state_s i.aead_alg)) = B.alloca B.null 1ul in\nlet ctr_state:B.pointer (B.pointer_or_null (CTR.state_s (as_cipher_alg i.aead_alg))) =\n B.alloca (B.null #(CTR.state_s (as_cipher_alg i.aead_alg))) 1ul\nin\nlet dummy_iv = B.alloca (Secret.to_u8 0uy) 12ul in\nlet h2 = HST.get () in\n(let open B in modifies_loc_includes (G.reveal mloc) h1 h2 (loc_none));\nImpl.derive_secret i.hash_alg aead_key (key_len i.aead_alg) traffic_secret Impl.label_key 3uy;\nlet h3 = HST.get () in\n(let open B in modifies_loc_includes (G.reveal mloc) h2 h3 (loc_buffer aead_key));\n(let open B in modifies_trans (G.reveal mloc) h1 h2 (G.reveal mloc) h3);\nlet ret = AEAD.create_in #i.aead_alg r aead_state aead_key in\nlet h4 = HST.get () in\n(let open B in modifies_loc_includes (G.reveal mloc) h3 h4 (loc_buffer aead_state));\n(let open B in modifies_trans (G.reveal mloc) h1 h3 (G.reveal mloc) h4);\nlet ret' = CTR.create_in (as_cipher_alg i.aead_alg) r ctr_state aead_key dummy_iv 12ul 0ul in\nlet h5 = HST.get () in\n(let open B in modifies_loc_includes (G.reveal mloc) h4 h5 (loc_buffer ctr_state));\n(let open B in modifies_trans (G.reveal mloc) h1 h4 (G.reveal mloc) h5);\n(let open B in\n modifies_only_not_unused_in B.((loc_region_only true (HS.get_tip h1)) `loc_union` (loc_buffer dst)\n )\n h1\n h5);\nmatch ret with\n| UnsupportedAlgorithm ->\n HST.pop_frame ();\n let h6 = HST.get () in\n (let open B in modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h5 h6);\n UnsupportedAlgorithm\n| Success ->\n match ret' with\n | UnsupportedAlgorithm ->\n HST.pop_frame ();\n let h6 = HST.get () in\n (let open B in modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h5 h6);\n UnsupportedAlgorithm\n | Success ->\n let aead_state:AEAD.state i.aead_alg = !*aead_state in\n assert (AEAD.invariant h5 aead_state);\n let ctr_state:CTR.state (as_cipher_alg i.aead_alg) = !*ctr_state in\n assert (CTR.invariant h5 ctr_state);\n create_in_core i r dst initial_pn traffic_secret aead_state ctr_state;\n let h6 = HST.get () in\n (let open B in\n modifies_loc_includes ((loc_region_only true (HS.get_tip h1)) `loc_union` (loc_buffer dst))\n h5\n h6\n (loc_buffer dst));\n (let open B in\n modifies_trans ((loc_region_only true (HS.get_tip h1)) `loc_union` (loc_buffer dst))\n h1\n h5\n ((loc_region_only true (HS.get_tip h1)) `loc_union` (loc_buffer dst))\n h6);\n HST.pop_frame ();\n let h7 = HST.get () in\n (let open B in modifies_fresh_frame_popped h0 h1 (loc_buffer dst) h6 h7);\n frame_invariant (B.loc_region_only false (HS.get_tip h6)) (B.deref h7 dst) h6 h7;\n Success", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.Base.fst", "name": "QUIC.Spec.PacketNumber.Base.packet_number_t", "original_source_type": "", "source_type": "val packet_number_t : Type0", "source_definition": "let packet_number_t = U62.secret", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 36, "start_col": 22, "end_line": 36, "end_col": 32 }, "file_context": "module QUIC.Spec.PacketNumber.Base\n\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule Secret = QUIC.Secret.Int\n\ninline_for_extraction\nnoextract\ntype packet_number_length_t = (x: Secret.uint32 { 1 <= Secret.v x /\\ Secret.v x <= 4 })\n\ninline_for_extraction\nlet last_packet_number_t = (last: U62.secret { Secret.v last + 1 < U62.v U62.bound})\n\n\n(* Packet number *)\n\nlet bound_npn' (pn_len:nat { pn_len < 4 }) : Tot (y: nat {y == pow2 (8 `op_Multiply` (pn_len + 1)) }) =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 16 == 65536);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match pn_len with\n | 0 -> 256\n | 1 -> 65536\n | 2 -> 16777216\n | 3 -> 4294967296\n\nlet in_window (pn_len: nat { pn_len < 4 }) (last pn:nat) : Tot bool =\n let h = bound_npn' pn_len in\n (last+1 < h/2 && pn < h) ||\n (last+1 >= U62.v U62.bound - h/2 && pn >= U62.v U62.bound - h) ||\n (last+1 - h/2 < pn && pn <= last+1 + h/2)", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.Base.fst", "checked_file": "QUIC.Spec.PacketNumber.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.UInt62.secret" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let packet_number_t =", "completed_definiton": "U62.secret", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.Base.fst", "name": "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "original_source_type": "", "source_type": "val last_packet_number_t : Type0", "source_definition": "let last_packet_number_t = (last: U62.secret { Secret.v last + 1 < U62.v U62.bound})", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 13, "start_col": 27, "end_line": 13, "end_col": 84 }, "file_context": "module QUIC.Spec.PacketNumber.Base\n\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule Secret = QUIC.Secret.Int\n\ninline_for_extraction\nnoextract\ntype packet_number_length_t = (x: Secret.uint32 { 1 <= Secret.v x /\\ Secret.v x <= 4 })", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.Base.fst", "checked_file": "QUIC.Spec.PacketNumber.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.UInt62.secret", "Prims.b2t", "Prims.op_LessThan", "Prims.op_Addition", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "FStar.UInt64.v", "QUIC.UInt62.bound" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let last_packet_number_t =", "completed_definiton": "(last: U62.secret{Secret.v last + 1 < U62.v U62.bound})", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.Base.fst", "name": "QUIC.Spec.PacketNumber.Base.packet_number_t'", "original_source_type": "val packet_number_t' (last: last_packet_number_t) (pn_len: packet_number_length_t) : Tot Type0", "source_type": "val packet_number_t' (last: last_packet_number_t) (pn_len: packet_number_length_t) : Tot Type0", "source_definition": "let packet_number_t'\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Tot Type0\n= (pn: packet_number_t { in_window (Secret.v pn_len - 1) (Secret.v last) (Secret.v pn) })", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 43, "start_col": 2, "end_line": 43, "end_col": 89 }, "file_context": "module QUIC.Spec.PacketNumber.Base\n\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule Secret = QUIC.Secret.Int\n\ninline_for_extraction\nnoextract\ntype packet_number_length_t = (x: Secret.uint32 { 1 <= Secret.v x /\\ Secret.v x <= 4 })\n\ninline_for_extraction\nlet last_packet_number_t = (last: U62.secret { Secret.v last + 1 < U62.v U62.bound})\n\n\n(* Packet number *)\n\nlet bound_npn' (pn_len:nat { pn_len < 4 }) : Tot (y: nat {y == pow2 (8 `op_Multiply` (pn_len + 1)) }) =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 16 == 65536);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match pn_len with\n | 0 -> 256\n | 1 -> 65536\n | 2 -> 16777216\n | 3 -> 4294967296\n\nlet in_window (pn_len: nat { pn_len < 4 }) (last pn:nat) : Tot bool =\n let h = bound_npn' pn_len in\n (last+1 < h/2 && pn < h) ||\n (last+1 >= U62.v U62.bound - h/2 && pn >= U62.v U62.bound - h) ||\n (last+1 - h/2 < pn && pn <= last+1 + h/2)\n\ninline_for_extraction\nlet packet_number_t = U62.secret\n\ninline_for_extraction\nlet packet_number_t'\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.Base.fst", "checked_file": "QUIC.Spec.PacketNumber.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n last: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t\n -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Prims.b2t", "QUIC.Spec.PacketNumber.Base.in_window", "Prims.op_Subtraction", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "Lib.IntTypes.U64" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val packet_number_t' (last: last_packet_number_t) (pn_len: packet_number_length_t) : Tot Type0\nlet packet_number_t' (last: last_packet_number_t) (pn_len: packet_number_length_t) : Tot Type0 =", "completed_definiton": "(pn: packet_number_t{in_window (Secret.v pn_len - 1) (Secret.v last) (Secret.v pn)})", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.Base.fst", "name": "QUIC.Spec.PacketNumber.Base.in_window", "original_source_type": "val in_window (pn_len: nat{pn_len < 4}) (last pn: nat) : Tot bool", "source_type": "val in_window (pn_len: nat{pn_len < 4}) (last pn: nat) : Tot bool", "source_definition": "let in_window (pn_len: nat { pn_len < 4 }) (last pn:nat) : Tot bool =\n let h = bound_npn' pn_len in\n (last+1 < h/2 && pn < h) ||\n (last+1 >= U62.v U62.bound - h/2 && pn >= U62.v U62.bound - h) ||\n (last+1 - h/2 < pn && pn <= last+1 + h/2)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 29, "start_col": 69, "end_line": 33, "end_col": 43 }, "file_context": "module QUIC.Spec.PacketNumber.Base\n\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule Secret = QUIC.Secret.Int\n\ninline_for_extraction\nnoextract\ntype packet_number_length_t = (x: Secret.uint32 { 1 <= Secret.v x /\\ Secret.v x <= 4 })\n\ninline_for_extraction\nlet last_packet_number_t = (last: U62.secret { Secret.v last + 1 < U62.v U62.bound})\n\n\n(* Packet number *)\n\nlet bound_npn' (pn_len:nat { pn_len < 4 }) : Tot (y: nat {y == pow2 (8 `op_Multiply` (pn_len + 1)) }) =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 16 == 65536);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match pn_len with\n | 0 -> 256\n | 1 -> 65536\n | 2 -> 16777216\n | 3 -> 4294967296", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.Base.fst", "checked_file": "QUIC.Spec.PacketNumber.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "pn_len: Prims.nat{pn_len < 4} -> last: Prims.nat -> pn: Prims.nat -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Prims.op_BarBar", "Prims.op_AmpAmp", "Prims.op_Addition", "Prims.op_Division", "Prims.op_GreaterThanOrEqual", "Prims.op_Subtraction", "FStar.UInt64.v", "QUIC.UInt62.bound", "Prims.op_LessThanOrEqual", "Prims.eq2", "Prims.int", "Prims.l_or", "Prims.op_GreaterThan", "Prims.pow2", "Prims.op_Multiply", "QUIC.Spec.PacketNumber.Base.bound_npn'", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val in_window (pn_len: nat{pn_len < 4}) (last pn: nat) : Tot bool\nlet in_window (pn_len: nat{pn_len < 4}) (last pn: nat) : Tot bool =", "completed_definiton": "let h = bound_npn' pn_len in\n(last + 1 < h / 2 && pn < h) || (last + 1 >= U62.v U62.bound - h / 2 && pn >= U62.v U62.bound - h) ||\n(last + 1 - h / 2 < pn && pn <= last + 1 + h / 2)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.Base.fst", "name": "QUIC.Spec.PacketNumber.Base.bound_npn'", "original_source_type": "val bound_npn' (pn_len: nat{pn_len < 4}) : Tot (y: nat{y == pow2 (8 `op_Multiply` (pn_len + 1))})", "source_type": "val bound_npn' (pn_len: nat{pn_len < 4}) : Tot (y: nat{y == pow2 (8 `op_Multiply` (pn_len + 1))})", "source_definition": "let bound_npn' (pn_len:nat { pn_len < 4 }) : Tot (y: nat {y == pow2 (8 `op_Multiply` (pn_len + 1)) }) =\n assert_norm (pow2 8 == 256);\n assert_norm (pow2 16 == 65536);\n assert_norm (pow2 24 == 16777216);\n assert_norm (pow2 32 == 4294967296);\n match pn_len with\n | 0 -> 256\n | 1 -> 65536\n | 2 -> 16777216\n | 3 -> 4294967296", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 19, "start_col": 2, "end_line": 27, "end_col": 19 }, "file_context": "module QUIC.Spec.PacketNumber.Base\n\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule Secret = QUIC.Secret.Int\n\ninline_for_extraction\nnoextract\ntype packet_number_length_t = (x: Secret.uint32 { 1 <= Secret.v x /\\ Secret.v x <= 4 })\n\ninline_for_extraction\nlet last_packet_number_t = (last: U62.secret { Secret.v last + 1 < U62.v U62.bound})\n\n\n(* Packet number *)", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.Base.fst", "checked_file": "QUIC.Spec.PacketNumber.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "pn_len: Prims.nat{pn_len < 4} -> y: Prims.nat{y == Prims.pow2 (8 * (pn_len + 1))}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Prims.eq2", "Prims.int", "Prims.l_or", "Prims.op_GreaterThanOrEqual", "Prims.op_GreaterThan", "Prims.pow2", "Prims.op_Multiply", "Prims.op_Addition", "Prims.unit", "FStar.Pervasives.assert_norm" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val bound_npn' (pn_len: nat{pn_len < 4}) : Tot (y: nat{y == pow2 (8 `op_Multiply` (pn_len + 1))})\nlet bound_npn' (pn_len: nat{pn_len < 4}) : Tot (y: nat{y == pow2 (8 `op_Multiply` (pn_len + 1))}) =", "completed_definiton": "assert_norm (pow2 8 == 256);\nassert_norm (pow2 16 == 65536);\nassert_norm (pow2 24 == 16777216);\nassert_norm (pow2 32 == 4294967296);\nmatch pn_len with\n| 0 -> 256\n| 1 -> 65536\n| 2 -> 16777216\n| 3 -> 4294967296", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Base.fst", "name": "QUIC.Spec.Base.secret_bitfield", "original_source_type": "val secret_bitfield (sz: nat{sz <= 8}) : Tot Type0", "source_type": "val secret_bitfield (sz: nat{sz <= 8}) : Tot Type0", "source_definition": "let secret_bitfield\n (sz: nat { sz <= 8 })\n: Tot Type0\n= (x: Secret.uint8 { Secret.v x < pow2 sz })", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 27, "start_col": 2, "end_line": 27, "end_col": 44 }, "file_context": "module QUIC.Spec.Base\n\nmodule FB = FStar.Bytes\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule S = FStar.Seq\nmodule Secret = QUIC.Secret.Int\n\ntype byte = FStar.UInt8.t\ntype bytes = S.seq byte\ntype lbytes (n:nat) = b:bytes{S.length b = n}\n\ninline_for_extraction\nnoextract\nlet bitfield\n (sz: nat { sz <= 8 })\n: Tot eqtype\n= (x: U8.t { U8.v x < pow2 sz })\n\ninline_for_extraction\nnoextract\nlet secret_bitfield\n (sz: nat { sz <= 8 })", "dependencies": { "source_file": "QUIC.Spec.Base.fst", "checked_file": "QUIC.Spec.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "sz: Prims.nat{sz <= 8} -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "Lib.IntTypes.uint8", "Prims.op_LessThan", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "Prims.pow2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val secret_bitfield (sz: nat{sz <= 8}) : Tot Type0\nlet secret_bitfield (sz: nat{sz <= 8}) : Tot Type0 =", "completed_definiton": "(x: Secret.uint8{Secret.v x < pow2 sz})", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Base.fst", "name": "QUIC.Spec.Base.header_len_bound", "original_source_type": "", "source_type": "val header_len_bound : Prims.int", "source_definition": "let header_len_bound = 16500", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 31, "start_col": 23, "end_line": 31, "end_col": 28 }, "file_context": "module QUIC.Spec.Base\n\nmodule FB = FStar.Bytes\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule S = FStar.Seq\nmodule Secret = QUIC.Secret.Int\n\ntype byte = FStar.UInt8.t\ntype bytes = S.seq byte\ntype lbytes (n:nat) = b:bytes{S.length b = n}\n\ninline_for_extraction\nnoextract\nlet bitfield\n (sz: nat { sz <= 8 })\n: Tot eqtype\n= (x: U8.t { U8.v x < pow2 sz })\n\ninline_for_extraction\nnoextract\nlet secret_bitfield\n (sz: nat { sz <= 8 })\n: Tot Type0\n= (x: Secret.uint8 { Secret.v x < pow2 sz })\n\ntype payload_and_pn_length_t = (payload_and_pn_length: U62.t { U64.v payload_and_pn_length >= 20 })", "dependencies": { "source_file": "QUIC.Spec.Base.fst", "checked_file": "QUIC.Spec.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.int", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let header_len_bound =", "completed_definiton": "16500", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Base.fst", "name": "QUIC.Spec.Base.token_max_len", "original_source_type": "", "source_type": "val token_max_len : Prims.int", "source_definition": "let token_max_len = 16383", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 38, "start_col": 20, "end_line": 38, "end_col": 25 }, "file_context": "module QUIC.Spec.Base\n\nmodule FB = FStar.Bytes\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule S = FStar.Seq\nmodule Secret = QUIC.Secret.Int\n\ntype byte = FStar.UInt8.t\ntype bytes = S.seq byte\ntype lbytes (n:nat) = b:bytes{S.length b = n}\n\ninline_for_extraction\nnoextract\nlet bitfield\n (sz: nat { sz <= 8 })\n: Tot eqtype\n= (x: U8.t { U8.v x < pow2 sz })\n\ninline_for_extraction\nnoextract\nlet secret_bitfield\n (sz: nat { sz <= 8 })\n: Tot Type0\n= (x: Secret.uint8 { Secret.v x < pow2 sz })\n\ntype payload_and_pn_length_t = (payload_and_pn_length: U62.t { U64.v payload_and_pn_length >= 20 })\n\nlet header_len_bound = 16500 // FIXME: this should be in line with the parser kind\n\ninline_for_extraction\nlet short_dcid_len_t = (short_dcid_len: U32.t { U32.v short_dcid_len <= 20 })\n\ninline_for_extraction", "dependencies": { "source_file": "QUIC.Spec.Base.fst", "checked_file": "QUIC.Spec.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.int", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let token_max_len =", "completed_definiton": "16383", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Base.fst", "name": "QUIC.Spec.Base.short_dcid_len_t", "original_source_type": "", "source_type": "val short_dcid_len_t : Type0", "source_definition": "let short_dcid_len_t = (short_dcid_len: U32.t { U32.v short_dcid_len <= 20 })", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 34, "start_col": 23, "end_line": 34, "end_col": 77 }, "file_context": "module QUIC.Spec.Base\n\nmodule FB = FStar.Bytes\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule S = FStar.Seq\nmodule Secret = QUIC.Secret.Int\n\ntype byte = FStar.UInt8.t\ntype bytes = S.seq byte\ntype lbytes (n:nat) = b:bytes{S.length b = n}\n\ninline_for_extraction\nnoextract\nlet bitfield\n (sz: nat { sz <= 8 })\n: Tot eqtype\n= (x: U8.t { U8.v x < pow2 sz })\n\ninline_for_extraction\nnoextract\nlet secret_bitfield\n (sz: nat { sz <= 8 })\n: Tot Type0\n= (x: Secret.uint8 { Secret.v x < pow2 sz })\n\ntype payload_and_pn_length_t = (payload_and_pn_length: U62.t { U64.v payload_and_pn_length >= 20 })\n\nlet header_len_bound = 16500 // FIXME: this should be in line with the parser kind", "dependencies": { "source_file": "QUIC.Spec.Base.fst", "checked_file": "QUIC.Spec.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let short_dcid_len_t =", "completed_definiton": "(short_dcid_len: U32.t{U32.v short_dcid_len <= 20})", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Base.fst", "name": "QUIC.Spec.Base.vlbytes", "original_source_type": "", "source_type": "val vlbytes : min: Prims.nat -> max: Prims.nat -> Type0", "source_definition": "let vlbytes (min: nat) (max: nat) =\n (x: FB.bytes { min <= FB.length x /\\ FB.length x <= max })", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 42, "start_col": 2, "end_line": 42, "end_col": 60 }, "file_context": "module QUIC.Spec.Base\n\nmodule FB = FStar.Bytes\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule S = FStar.Seq\nmodule Secret = QUIC.Secret.Int\n\ntype byte = FStar.UInt8.t\ntype bytes = S.seq byte\ntype lbytes (n:nat) = b:bytes{S.length b = n}\n\ninline_for_extraction\nnoextract\nlet bitfield\n (sz: nat { sz <= 8 })\n: Tot eqtype\n= (x: U8.t { U8.v x < pow2 sz })\n\ninline_for_extraction\nnoextract\nlet secret_bitfield\n (sz: nat { sz <= 8 })\n: Tot Type0\n= (x: Secret.uint8 { Secret.v x < pow2 sz })\n\ntype payload_and_pn_length_t = (payload_and_pn_length: U62.t { U64.v payload_and_pn_length >= 20 })\n\nlet header_len_bound = 16500 // FIXME: this should be in line with the parser kind\n\ninline_for_extraction\nlet short_dcid_len_t = (short_dcid_len: U32.t { U32.v short_dcid_len <= 20 })\n\ninline_for_extraction\nnoextract\nlet token_max_len = 16383 // arbitrary bound\n\ninline_for_extraction", "dependencies": { "source_file": "QUIC.Spec.Base.fst", "checked_file": "QUIC.Spec.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "min: Prims.nat -> max: Prims.nat -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "FStar.Bytes.bytes", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Bytes.length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let vlbytes (min max: nat) =", "completed_definiton": "(x: FB.bytes{min <= FB.length x /\\ FB.length x <= max})", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Base.fst", "name": "QUIC.Spec.Base.varint_len", "original_source_type": "val varint_len (x: U62.t) : GTot (y: nat{y <= 8})", "source_type": "val varint_len (x: U62.t) : GTot (y: nat{y <= 8})", "source_definition": "let varint_len\n (x: U62.t)\n: GTot (y: nat {y <= 8})\n= if x `U62.lt` 64uL\n then 1\n else if x `U62.lt` 16384uL\n then 2\n else if x `U62.lt` 1073741824uL\n then 4\n else 8", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 49, "start_col": 2, "end_line": 55, "end_col": 8 }, "file_context": "module QUIC.Spec.Base\n\nmodule FB = FStar.Bytes\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule S = FStar.Seq\nmodule Secret = QUIC.Secret.Int\n\ntype byte = FStar.UInt8.t\ntype bytes = S.seq byte\ntype lbytes (n:nat) = b:bytes{S.length b = n}\n\ninline_for_extraction\nnoextract\nlet bitfield\n (sz: nat { sz <= 8 })\n: Tot eqtype\n= (x: U8.t { U8.v x < pow2 sz })\n\ninline_for_extraction\nnoextract\nlet secret_bitfield\n (sz: nat { sz <= 8 })\n: Tot Type0\n= (x: Secret.uint8 { Secret.v x < pow2 sz })\n\ntype payload_and_pn_length_t = (payload_and_pn_length: U62.t { U64.v payload_and_pn_length >= 20 })\n\nlet header_len_bound = 16500 // FIXME: this should be in line with the parser kind\n\ninline_for_extraction\nlet short_dcid_len_t = (short_dcid_len: U32.t { U32.v short_dcid_len <= 20 })\n\ninline_for_extraction\nnoextract\nlet token_max_len = 16383 // arbitrary bound\n\ninline_for_extraction\nlet vlbytes (min: nat) (max: nat) =\n (x: FB.bytes { min <= FB.length x /\\ FB.length x <= max })\n\n(* Length computations need to be transparent because of the switch. *)\n\nlet varint_len\n (x: U62.t)", "dependencies": { "source_file": "QUIC.Spec.Base.fst", "checked_file": "QUIC.Spec.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: QUIC.UInt62.t -> Prims.GTot (y: Prims.nat{y <= 8})", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.UInt62.t", "FStar.UInt64.lt", "FStar.UInt64.__uint_to_t", "Prims.bool", "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val varint_len (x: U62.t) : GTot (y: nat{y <= 8})\nlet varint_len (x: U62.t) : GTot (y: nat{y <= 8}) =", "completed_definiton": "if x `U62.lt` 64uL\nthen 1\nelse if x `U62.lt` 16384uL then 2 else if x `U62.lt` 1073741824uL then 4 else 8", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Base.fst", "name": "QUIC.Spec.Base.bitfield", "original_source_type": "val bitfield (sz: nat{sz <= 8}) : Tot eqtype", "source_type": "val bitfield (sz: nat{sz <= 8}) : Tot eqtype", "source_definition": "let bitfield\n (sz: nat { sz <= 8 })\n: Tot eqtype\n= (x: U8.t { U8.v x < pow2 sz })", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Base.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 20, "start_col": 2, "end_line": 20, "end_col": 32 }, "file_context": "module QUIC.Spec.Base\n\nmodule FB = FStar.Bytes\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\nmodule S = FStar.Seq\nmodule Secret = QUIC.Secret.Int\n\ntype byte = FStar.UInt8.t\ntype bytes = S.seq byte\ntype lbytes (n:nat) = b:bytes{S.length b = n}\n\ninline_for_extraction\nnoextract\nlet bitfield\n (sz: nat { sz <= 8 })", "dependencies": { "source_file": "QUIC.Spec.Base.fst", "checked_file": "QUIC.Spec.Base.fst.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Bytes.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": true, "short_module": "FB", "full_module": "FStar.Bytes" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "sz: Prims.nat{sz <= 8} -> Prims.eqtype", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt8.t", "Prims.op_LessThan", "FStar.UInt8.v", "Prims.pow2", "Prims.eqtype" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val bitfield (sz: nat{sz <= 8}) : Tot eqtype\nlet bitfield (sz: nat{sz <= 8}) : Tot eqtype =", "completed_definiton": "(x: U8.t{U8.v x < pow2 sz})", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fst", "name": "Model.PNE.model_state", "original_source_type": "", "source_type": "val model_state : j: Model.PNE.id -> Type", "source_definition": "let model_state j =\n u:info j & B.pointer (log #j u)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 27, "start_col": 2, "end_line": 27, "end_col": 33 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\nopen LowStar.BufferOps\n\nlet clip_cipherpad cp l =\n let cipher, bits = cp in\n Seq.slice cipher 0 l, bits\n\nlet log (#i: id) (u: info i): Type0 =\n Seq.seq (entry #i u)", "dependencies": { "source_file": "Model.PNE.fst", "checked_file": "Model.PNE.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "j: Model.PNE.id -> Type", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.id", "Prims.dtuple2", "Model.PNE.info", "LowStar.Buffer.pointer", "Model.PNE.log" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let model_state j =", "completed_definiton": "u: info j & B.pointer (log #j u)", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fst", "name": "Model.PNE.pne_state", "original_source_type": "val pne_state : (#j:id) -> (u:info j) -> Type u#1", "source_type": "val pne_state : (#j:id) -> (u:info j) -> Type u#1", "source_definition": "let pne_state #j u =\n if is_safe j then\n s:model_state j { dfst s == u }\n else\n s:unsafe_state j { fst s == u }", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 36, "start_col": 2, "end_line": 39, "end_col": 35 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\nopen LowStar.BufferOps\n\nlet clip_cipherpad cp l =\n let cipher, bits = cp in\n Seq.slice cipher 0 l, bits\n\nlet log (#i: id) (u: info i): Type0 =\n Seq.seq (entry #i u)\n\nlet model_state j =\n u:info j & B.pointer (log #j u)\n\nlet unsafe_state j =\n // I don't understand why we have to go through model.indexing here when\n // the algorithm is readily available in the info\n info j & Spec.key (I.pne_id_ginfo j)\n\n// why is this type parameterized over the info?", "dependencies": { "source_file": "Model.PNE.fst", "checked_file": "Model.PNE.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "u76: Model.PNE.info j -> Type", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.id", "Model.PNE.info", "Model.PNE.is_safe", "Model.PNE.model_state", "Prims.eq2", "FStar.Pervasives.dfst", "LowStar.Buffer.pointer", "Model.PNE.log", "Prims.bool", "Model.PNE.unsafe_state", "FStar.Pervasives.Native.fst", "Spec.Agile.Cipher.key", "Model.Indexing.pne_id_ginfo" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val pne_state : (#j:id) -> (u:info j) -> Type u#1\nlet pne_state #j u =", "completed_definiton": "if is_safe j then s: model_state j {dfst s == u} else s: unsafe_state j {fst s == u}", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fst", "name": "Model.PNE.log", "original_source_type": "val log (#i: id) (u: info i) : Type0", "source_type": "val log (#i: id) (u: info i) : Type0", "source_definition": "let log (#i: id) (u: info i): Type0 =\n Seq.seq (entry #i u)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 24, "start_col": 2, "end_line": 24, "end_col": 22 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\nopen LowStar.BufferOps\n\nlet clip_cipherpad cp l =\n let cipher, bits = cp in\n Seq.slice cipher 0 l, bits", "dependencies": { "source_file": "Model.PNE.fst", "checked_file": "Model.PNE.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "u72: Model.PNE.info i -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.id", "Model.PNE.info", "FStar.Seq.Base.seq", "Model.PNE.entry" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val log (#i: id) (u: info i) : Type0\nlet log (#i: id) (u: info i) : Type0 =", "completed_definiton": "Seq.seq (entry #i u)", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fst", "name": "Model.PNE.unsafe_state", "original_source_type": "", "source_type": "val unsafe_state : j: Model.Indexing.pne_id -> Type", "source_definition": "let unsafe_state j =\n // I don't understand why we have to go through model.indexing here when\n // the algorithm is readily available in the info\n info j & Spec.key (I.pne_id_ginfo j)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 32, "start_col": 2, "end_line": 32, "end_col": 38 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\nopen LowStar.BufferOps\n\nlet clip_cipherpad cp l =\n let cipher, bits = cp in\n Seq.slice cipher 0 l, bits\n\nlet log (#i: id) (u: info i): Type0 =\n Seq.seq (entry #i u)\n\nlet model_state j =\n u:info j & B.pointer (log #j u)\n\nlet unsafe_state j =\n // I don't understand why we have to go through model.indexing here when", "dependencies": { "source_file": "Model.PNE.fst", "checked_file": "Model.PNE.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "j: Model.Indexing.pne_id -> Type", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.Indexing.pne_id", "FStar.Pervasives.Native.tuple2", "Model.PNE.info", "Spec.Agile.Cipher.key", "Model.Indexing.pne_id_ginfo" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let unsafe_state j =", "completed_definiton": "info j & Spec.key (I.pne_id_ginfo j)", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fst", "name": "Model.PNE.table", "original_source_type": "val table : (#j:safe_id) -> (#u:info j) -> (st:pne_state u) -> (h:mem) -> GTot (Seq.seq (entry u))", "source_type": "val table : (#j:safe_id) -> (#u:info j) -> (st:pne_state u) -> (h:mem) -> GTot (Seq.seq (entry u))", "source_definition": "let table #j #u st h =\n let (| u, p |) = st <: model_state j in\n B.deref h p", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 41, "start_col": 22, "end_line": 43, "end_col": 13 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\nopen LowStar.BufferOps\n\nlet clip_cipherpad cp l =\n let cipher, bits = cp in\n Seq.slice cipher 0 l, bits\n\nlet log (#i: id) (u: info i): Type0 =\n Seq.seq (entry #i u)\n\nlet model_state j =\n u:info j & B.pointer (log #j u)\n\nlet unsafe_state j =\n // I don't understand why we have to go through model.indexing here when\n // the algorithm is readily available in the info\n info j & Spec.key (I.pne_id_ginfo j)\n\n// why is this type parameterized over the info?\nlet pne_state #j u =\n if is_safe j then\n s:model_state j { dfst s == u }\n else\n s:unsafe_state j { fst s == u }", "dependencies": { "source_file": "Model.PNE.fst", "checked_file": "Model.PNE.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "st: Model.PNE.pne_state u80 -> h: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot (FStar.Seq.Base.seq (Model.PNE.entry u80))", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.safe_id", "Model.PNE.info", "Model.PNE.pne_state", "FStar.Monotonic.HyperStack.mem", "LowStar.Buffer.pointer", "Model.PNE.log", "LowStar.Monotonic.Buffer.deref", "LowStar.Buffer.trivial_preorder", "FStar.Seq.Base.seq", "Model.PNE.entry", "Model.PNE.model_state" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val table : (#j:safe_id) -> (#u:info j) -> (st:pne_state u) -> (h:mem) -> GTot (Seq.seq (entry u))\nlet table #j #u st h =", "completed_definiton": "let (| u , p |) = st <: model_state j in\nB.deref h p", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fst", "name": "Model.PNE.footprint", "original_source_type": "val footprint : #j:id -> #u:info j -> st:pne_state u -> GTot B.loc", "source_type": "val footprint : #j:id -> #u:info j -> st:pne_state u -> GTot B.loc", "source_definition": "let footprint #i #u w =\n if is_safe i then\n B.loc_addr_of_buffer (dsnd (w <: model_state i))\n else\n B.loc_none", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 49, "start_col": 2, "end_line": 52, "end_col": 14 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\nopen LowStar.BufferOps\n\nlet clip_cipherpad cp l =\n let cipher, bits = cp in\n Seq.slice cipher 0 l, bits\n\nlet log (#i: id) (u: info i): Type0 =\n Seq.seq (entry #i u)\n\nlet model_state j =\n u:info j & B.pointer (log #j u)\n\nlet unsafe_state j =\n // I don't understand why we have to go through model.indexing here when\n // the algorithm is readily available in the info\n info j & Spec.key (I.pne_id_ginfo j)\n\n// why is this type parameterized over the info?\nlet pne_state #j u =\n if is_safe j then\n s:model_state j { dfst s == u }\n else\n s:unsafe_state j { fst s == u }\n\nlet table #j #u st h =\n let (| u, p |) = st <: model_state j in\n B.deref h p\n\nlet key #j #u st =\n snd (st <: unsafe_state j)", "dependencies": { "source_file": "Model.PNE.fst", "checked_file": "Model.PNE.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "st: Model.PNE.pne_state u88 -> Prims.GTot LowStar.Monotonic.Buffer.loc", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.id", "Model.PNE.info", "Model.PNE.pne_state", "Model.PNE.is_safe", "LowStar.Monotonic.Buffer.loc_addr_of_buffer", "Model.PNE.log", "Prims.__proj__Mkdtuple2__item___1", "LowStar.Buffer.pointer", "LowStar.Buffer.trivial_preorder", "FStar.Pervasives.dsnd", "Model.PNE.model_state", "Prims.bool", "LowStar.Monotonic.Buffer.loc_none", "LowStar.Monotonic.Buffer.loc" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val footprint : #j:id -> #u:info j -> st:pne_state u -> GTot B.loc\nlet footprint #i #u w =", "completed_definiton": "if is_safe i then B.loc_addr_of_buffer (dsnd (w <: model_state i)) else B.loc_none", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fst", "name": "Model.PNE.clip_cipherpad", "original_source_type": "val clip_cipherpad : (cp:pne_cipherpad) -> (l:pne_plain_length) -> pne_cipher l", "source_type": "val clip_cipherpad : (cp:pne_cipherpad) -> (l:pne_plain_length) -> pne_cipher l", "source_definition": "let clip_cipherpad cp l =\n let cipher, bits = cp in\n Seq.slice cipher 0 l, bits", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 19, "start_col": 25, "end_line": 21, "end_col": 28 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\nopen LowStar.BufferOps", "dependencies": { "source_file": "Model.PNE.fst", "checked_file": "Model.PNE.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "cp: Model.PNE.pne_cipherpad -> l: Model.PNE.pne_plain_length -> Model.PNE.pne_cipher l", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.pne_cipherpad", "Model.PNE.pne_plain_length", "Model.Helpers.lbytes", "Model.PNE.bits", "FStar.Pervasives.Native.Mktuple2", "FStar.Seq.Base.slice", "Lib.IntTypes.uint8", "Model.PNE.pne_cipher" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val clip_cipherpad : (cp:pne_cipherpad) -> (l:pne_plain_length) -> pne_cipher l\nlet clip_cipherpad cp l =", "completed_definiton": "let cipher, bits = cp in\nSeq.slice cipher 0 l, bits", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fst", "name": "Model.PNE.invariant", "original_source_type": "val invariant: #j:id -> #u:info j -> st:pne_state u -> mem -> Type0", "source_type": "val invariant: #j:id -> #u:info j -> st:pne_state u -> mem -> Type0", "source_definition": "let invariant #i #u st h =\n if is_safe i then\n B.live h (dsnd (st <: model_state i))\n else\n True", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 55, "start_col": 2, "end_line": 58, "end_col": 8 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\nopen LowStar.BufferOps\n\nlet clip_cipherpad cp l =\n let cipher, bits = cp in\n Seq.slice cipher 0 l, bits\n\nlet log (#i: id) (u: info i): Type0 =\n Seq.seq (entry #i u)\n\nlet model_state j =\n u:info j & B.pointer (log #j u)\n\nlet unsafe_state j =\n // I don't understand why we have to go through model.indexing here when\n // the algorithm is readily available in the info\n info j & Spec.key (I.pne_id_ginfo j)\n\n// why is this type parameterized over the info?\nlet pne_state #j u =\n if is_safe j then\n s:model_state j { dfst s == u }\n else\n s:unsafe_state j { fst s == u }\n\nlet table #j #u st h =\n let (| u, p |) = st <: model_state j in\n B.deref h p\n\nlet key #j #u st =\n snd (st <: unsafe_state j)\n\nlet footprint #i #u w =\n if is_safe i then\n B.loc_addr_of_buffer (dsnd (w <: model_state i))\n else\n B.loc_none", "dependencies": { "source_file": "Model.PNE.fst", "checked_file": "Model.PNE.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "st: Model.PNE.pne_state u92 -> h: FStar.Monotonic.HyperStack.mem -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.id", "Model.PNE.info", "Model.PNE.pne_state", "FStar.Monotonic.HyperStack.mem", "Model.PNE.is_safe", "LowStar.Monotonic.Buffer.live", "Model.PNE.log", "Prims.__proj__Mkdtuple2__item___1", "LowStar.Buffer.pointer", "LowStar.Buffer.trivial_preorder", "FStar.Pervasives.dsnd", "Model.PNE.model_state", "Prims.bool", "Prims.l_True" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val invariant: #j:id -> #u:info j -> st:pne_state u -> mem -> Type0\nlet invariant #i #u st h =", "completed_definiton": "if is_safe i then B.live h (dsnd (st <: model_state i)) else True", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fst", "name": "Model.PNE.key", "original_source_type": "val key: #j:unsafe_id -> #u:info j -> st:pne_state u -> lbytes (key_len u)", "source_type": "val key: #j:unsafe_id -> #u:info j -> st:pne_state u -> lbytes (key_len u)", "source_definition": "let key #j #u st =\n snd (st <: unsafe_state j)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 46, "start_col": 2, "end_line": 46, "end_col": 28 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\nopen LowStar.BufferOps\n\nlet clip_cipherpad cp l =\n let cipher, bits = cp in\n Seq.slice cipher 0 l, bits\n\nlet log (#i: id) (u: info i): Type0 =\n Seq.seq (entry #i u)\n\nlet model_state j =\n u:info j & B.pointer (log #j u)\n\nlet unsafe_state j =\n // I don't understand why we have to go through model.indexing here when\n // the algorithm is readily available in the info\n info j & Spec.key (I.pne_id_ginfo j)\n\n// why is this type parameterized over the info?\nlet pne_state #j u =\n if is_safe j then\n s:model_state j { dfst s == u }\n else\n s:unsafe_state j { fst s == u }\n\nlet table #j #u st h =\n let (| u, p |) = st <: model_state j in\n B.deref h p", "dependencies": { "source_file": "Model.PNE.fst", "checked_file": "Model.PNE.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "st: Model.PNE.pne_state u85 -> Model.Helpers.lbytes (Model.PNE.key_len u85)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.PNE.unsafe_id", "Model.PNE.info", "Model.PNE.pne_state", "FStar.Pervasives.Native.snd", "Spec.Agile.Cipher.key", "Model.Indexing.pne_id_ginfo", "Model.PNE.unsafe_state", "Model.Helpers.lbytes", "Model.PNE.key_len" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val key: #j:unsafe_id -> #u:info j -> st:pne_state u -> lbytes (key_len u)\nlet key #j #u st =", "completed_definiton": "snd (st <: unsafe_state j)", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fst", "name": "Model.PNE.random_bits", "original_source_type": "val random_bits: Prims.unit\n -> HyperStack.ST.ST bits (requires fun h0 -> True) (ensures fun h0 _ h1 -> h0 == h1)", "source_type": "val random_bits: Prims.unit\n -> HyperStack.ST.ST bits (requires fun h0 -> True) (ensures fun h0 _ h1 -> h0 == h1)", "source_definition": "let random_bits ():\n HyperStack.ST.ST bits\n (requires fun h0 -> True)\n (ensures fun h0 _ h1 -> h0 == h1)\n=\n let r = random 1 in\n LowParse.BitFields.get_bitfield #8 (UInt8.v (Lib.RawIntTypes.u8_to_UInt8 (Seq.index r 0))) 0 5", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 86, "start_col": 1, "end_line": 88, "end_col": 96 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\nopen LowStar.BufferOps\n\nlet clip_cipherpad cp l =\n let cipher, bits = cp in\n Seq.slice cipher 0 l, bits\n\nlet log (#i: id) (u: info i): Type0 =\n Seq.seq (entry #i u)\n\nlet model_state j =\n u:info j & B.pointer (log #j u)\n\nlet unsafe_state j =\n // I don't understand why we have to go through model.indexing here when\n // the algorithm is readily available in the info\n info j & Spec.key (I.pne_id_ginfo j)\n\n// why is this type parameterized over the info?\nlet pne_state #j u =\n if is_safe j then\n s:model_state j { dfst s == u }\n else\n s:unsafe_state j { fst s == u }\n\nlet table #j #u st h =\n let (| u, p |) = st <: model_state j in\n B.deref h p\n\nlet key #j #u st =\n snd (st <: unsafe_state j)\n\nlet footprint #i #u w =\n if is_safe i then\n B.loc_addr_of_buffer (dsnd (w <: model_state i))\n else\n B.loc_none\n\nlet invariant #i #u st h =\n if is_safe i then\n B.live h (dsnd (st <: model_state i))\n else\n True\n\nlet frame_invariant #_ #_ _ _ _ _ =\n ()\n\nlet frame_table #_ #_ _ _ _ _ =\n ()\n\nlet create j u =\n if is_safe j then\n let l: log #j u = Seq.empty #(entry #j u) in\n ((| u, B.malloc q_pne_region l 1ul |) <: model_state j)\n else\n (u, random (Spec.key_length u.calg)) <: unsafe_state j\n\nlet coerce j u k =\n (u, k) <: unsafe_state j\n\nlet quic_coerce j u ts =\n let k =\n (QUIC.Spec.derive_secret u.halg ts\n QUIC.Spec.label_hp (key_len u)) in\n coerce j u k\n\nlet random_bits ():\n HyperStack.ST.ST bits\n (requires fun h0 -> True)", "dependencies": { "source_file": "Model.PNE.fst", "checked_file": "Model.PNE.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Prims.unit -> FStar.HyperStack.ST.ST Model.PNE.bits", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Prims.unit", "LowParse.BitFields.get_bitfield", "FStar.UInt8.v", "Lib.RawIntTypes.u8_to_UInt8", "FStar.Seq.Base.index", "Lib.IntTypes.uint8", "Model.PNE.bits", "Model.Helpers.lbytes", "Model.Helpers.random", "FStar.Monotonic.HyperStack.mem", "Prims.l_True", "Prims.eq2" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val random_bits: Prims.unit\n -> HyperStack.ST.ST bits (requires fun h0 -> True) (ensures fun h0 _ h1 -> h0 == h1)\nlet random_bits ()\n : HyperStack.ST.ST bits (requires fun h0 -> True) (ensures fun h0 _ h1 -> h0 == h1) =", "completed_definiton": "let r = random 1 in\nLowParse.BitFields.get_bitfield #8 (UInt8.v (Lib.RawIntTypes.u8_to_UInt8 (Seq.index r 0))) 0 5", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fst", "name": "Model.PNE.coerce", "original_source_type": "val coerce (j:unsafe_id) (u:info j)\n (k:lbytes (key_len u))\n : ST (pne_state #j u)\n (requires fun _ -> True)\n (ensures fun h0 st h1 ->\n invariant st h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (footprint st) h0 h1 /\\\n B.(loc_includes (loc_pne_region ()) (footprint st)) /\\\n key st == k)", "source_type": "val coerce (j:unsafe_id) (u:info j)\n (k:lbytes (key_len u))\n : ST (pne_state #j u)\n (requires fun _ -> True)\n (ensures fun h0 st h1 ->\n invariant st h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (footprint st) h0 h1 /\\\n B.(loc_includes (loc_pne_region ()) (footprint st)) /\\\n key st == k)", "source_definition": "let coerce j u k =\n (u, k) <: unsafe_state j", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 74, "start_col": 2, "end_line": 74, "end_col": 26 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\nopen LowStar.BufferOps\n\nlet clip_cipherpad cp l =\n let cipher, bits = cp in\n Seq.slice cipher 0 l, bits\n\nlet log (#i: id) (u: info i): Type0 =\n Seq.seq (entry #i u)\n\nlet model_state j =\n u:info j & B.pointer (log #j u)\n\nlet unsafe_state j =\n // I don't understand why we have to go through model.indexing here when\n // the algorithm is readily available in the info\n info j & Spec.key (I.pne_id_ginfo j)\n\n// why is this type parameterized over the info?\nlet pne_state #j u =\n if is_safe j then\n s:model_state j { dfst s == u }\n else\n s:unsafe_state j { fst s == u }\n\nlet table #j #u st h =\n let (| u, p |) = st <: model_state j in\n B.deref h p\n\nlet key #j #u st =\n snd (st <: unsafe_state j)\n\nlet footprint #i #u w =\n if is_safe i then\n B.loc_addr_of_buffer (dsnd (w <: model_state i))\n else\n B.loc_none\n\nlet invariant #i #u st h =\n if is_safe i then\n B.live h (dsnd (st <: model_state i))\n else\n True\n\nlet frame_invariant #_ #_ _ _ _ _ =\n ()\n\nlet frame_table #_ #_ _ _ _ _ =\n ()\n\nlet create j u =\n if is_safe j then\n let l: log #j u = Seq.empty #(entry #j u) in\n ((| u, B.malloc q_pne_region l 1ul |) <: model_state j)\n else\n (u, random (Spec.key_length u.calg)) <: unsafe_state j", "dependencies": { "source_file": "Model.PNE.fst", "checked_file": "Model.PNE.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "j: Model.PNE.unsafe_id -> u133: Model.PNE.info j -> k: Model.Helpers.lbytes (Model.PNE.key_len u133)\n -> FStar.HyperStack.ST.ST (Model.PNE.pne_state u133)", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Model.PNE.unsafe_id", "Model.PNE.info", "Model.Helpers.lbytes", "Model.PNE.key_len", "FStar.Pervasives.Native.Mktuple2", "Spec.Agile.Cipher.key", "Model.Indexing.pne_id_ginfo", "Model.PNE.unsafe_state", "Model.PNE.pne_state" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val coerce (j:unsafe_id) (u:info j)\n (k:lbytes (key_len u))\n : ST (pne_state #j u)\n (requires fun _ -> True)\n (ensures fun h0 st h1 ->\n invariant st h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (footprint st) h0 h1 /\\\n B.(loc_includes (loc_pne_region ()) (footprint st)) /\\\n key st == k)\nlet coerce j u k =", "completed_definiton": "(u, k) <: unsafe_state j", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fst", "name": "Model.PNE.snoc_find", "original_source_type": "val snoc_find (#a: _) (s: Seq.seq a) (f: (a -> bool)) (x: a)\n : Lemma (requires f x /\\ None? FStar.Seq.(find_l f s))\n (ensures FStar.Seq.(find_l f (snoc s x)) == Some x)", "source_type": "val snoc_find (#a: _) (s: Seq.seq a) (f: (a -> bool)) (x: a)\n : Lemma (requires f x /\\ None? FStar.Seq.(find_l f s))\n (ensures FStar.Seq.(find_l f (snoc s x)) == Some x)", "source_definition": "let snoc_find #a (s: Seq.seq a) (f: a -> bool) (x: a): Lemma\n (requires f x /\\ None? FStar.Seq.(find_l f s))\n (ensures FStar.Seq.(find_l f (snoc s x)) == Some x)\n=\n assert (Seq.snoc s x `Seq.equal` Seq.append s (Seq.create 1 x));\n Seq.find_append_none s (Seq.create 1 x) f;\n ()", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 111, "start_col": 2, "end_line": 113, "end_col": 4 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\nopen LowStar.BufferOps\n\nlet clip_cipherpad cp l =\n let cipher, bits = cp in\n Seq.slice cipher 0 l, bits\n\nlet log (#i: id) (u: info i): Type0 =\n Seq.seq (entry #i u)\n\nlet model_state j =\n u:info j & B.pointer (log #j u)\n\nlet unsafe_state j =\n // I don't understand why we have to go through model.indexing here when\n // the algorithm is readily available in the info\n info j & Spec.key (I.pne_id_ginfo j)\n\n// why is this type parameterized over the info?\nlet pne_state #j u =\n if is_safe j then\n s:model_state j { dfst s == u }\n else\n s:unsafe_state j { fst s == u }\n\nlet table #j #u st h =\n let (| u, p |) = st <: model_state j in\n B.deref h p\n\nlet key #j #u st =\n snd (st <: unsafe_state j)\n\nlet footprint #i #u w =\n if is_safe i then\n B.loc_addr_of_buffer (dsnd (w <: model_state i))\n else\n B.loc_none\n\nlet invariant #i #u st h =\n if is_safe i then\n B.live h (dsnd (st <: model_state i))\n else\n True\n\nlet frame_invariant #_ #_ _ _ _ _ =\n ()\n\nlet frame_table #_ #_ _ _ _ _ =\n ()\n\nlet create j u =\n if is_safe j then\n let l: log #j u = Seq.empty #(entry #j u) in\n ((| u, B.malloc q_pne_region l 1ul |) <: model_state j)\n else\n (u, random (Spec.key_length u.calg)) <: unsafe_state j\n\nlet coerce j u k =\n (u, k) <: unsafe_state j\n\nlet quic_coerce j u ts =\n let k =\n (QUIC.Spec.derive_secret u.halg ts\n QUIC.Spec.label_hp (key_len u)) in\n coerce j u k\n\nlet random_bits ():\n HyperStack.ST.ST bits\n (requires fun h0 -> True)\n (ensures fun h0 _ h1 -> h0 == h1)\n=\n let r = random 1 in\n LowParse.BitFields.get_bitfield #8 (UInt8.v (Lib.RawIntTypes.u8_to_UInt8 (Seq.index r 0))) 0 5\n\nlet encrypt #j #u st #l n s =\n let h0 = ST.get () in\n if is_safe j then\n let (| u, p |) = st <: model_state j in\n let log = !*p in\n assert (log == table st h0);\n let cipher: pne_cipherpad = random 4, random_bits () in\n p *= Seq.snoc log (Entry s #l n cipher);\n clip_cipherpad cipher l\n else\n let open QUIC.Spec.Lemmas in\n let pn, bits = PNEPlainPkg?.repr u.plain j l n in\n let k = snd (st <: unsafe_state j) in\n let alg = (fst (st <: unsafe_state j)).calg in\n encrypt_spec alg l pn bits s k\n\n#push-options \"--fuel 1\"\nlet snoc_find #a (s: Seq.seq a) (f: a -> bool) (x: a): Lemma\n (requires f x /\\ None? FStar.Seq.(find_l f s))\n (ensures FStar.Seq.(find_l f (snoc s x)) == Some x)", "dependencies": { "source_file": "Model.PNE.fst", "checked_file": "Model.PNE.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 1, "max_fuel": 1, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: FStar.Seq.Base.seq a -> f: (_: a -> Prims.bool) -> x: a\n -> FStar.Pervasives.Lemma (requires f x /\\ None? (FStar.Seq.Properties.find_l f s))\n (ensures\n FStar.Seq.Properties.find_l f (FStar.Seq.Properties.snoc s x) ==\n FStar.Pervasives.Native.Some x)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.bool", "Prims.unit", "FStar.Seq.Properties.find_append_none", "FStar.Seq.Base.create", "Prims._assert", "FStar.Seq.Base.equal", "FStar.Seq.Properties.snoc", "FStar.Seq.Base.append", "Prims.l_and", "Prims.b2t", "FStar.Pervasives.Native.uu___is_None", "FStar.Seq.Properties.find_l", "Prims.squash", "Prims.eq2", "FStar.Pervasives.Native.option", "FStar.Pervasives.Native.Some", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val snoc_find (#a: _) (s: Seq.seq a) (f: (a -> bool)) (x: a)\n : Lemma (requires f x /\\ None? FStar.Seq.(find_l f s))\n (ensures FStar.Seq.(find_l f (snoc s x)) == Some x)\nlet snoc_find #a (s: Seq.seq a) (f: (a -> bool)) (x: a)\n : Lemma (requires f x /\\ None? FStar.Seq.(find_l f s))\n (ensures FStar.Seq.(find_l f (snoc s x)) == Some x) =", "completed_definiton": "assert ((Seq.snoc s x) `Seq.equal` (Seq.append s (Seq.create 1 x)));\nSeq.find_append_none s (Seq.create 1 x) f;\n()", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fst", "name": "Model.PNE.create", "original_source_type": "val create (j:id) (u:info j) : ST (pne_state u)\n (requires fun _ -> True)\n (ensures fun h0 st h1 ->\n invariant st h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (footprint st) h0 h1 /\\\n B.(loc_includes (loc_pne_region ()) (footprint st)) /\\\n\n (is_safe j ==> table st h1 == Seq.empty))", "source_type": "val create (j:id) (u:info j) : ST (pne_state u)\n (requires fun _ -> True)\n (ensures fun h0 st h1 ->\n invariant st h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (footprint st) h0 h1 /\\\n B.(loc_includes (loc_pne_region ()) (footprint st)) /\\\n\n (is_safe j ==> table st h1 == Seq.empty))", "source_definition": "let create j u =\n if is_safe j then\n let l: log #j u = Seq.empty #(entry #j u) in\n ((| u, B.malloc q_pne_region l 1ul |) <: model_state j)\n else\n (u, random (Spec.key_length u.calg)) <: unsafe_state j", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 67, "start_col": 2, "end_line": 71, "end_col": 58 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\nopen LowStar.BufferOps\n\nlet clip_cipherpad cp l =\n let cipher, bits = cp in\n Seq.slice cipher 0 l, bits\n\nlet log (#i: id) (u: info i): Type0 =\n Seq.seq (entry #i u)\n\nlet model_state j =\n u:info j & B.pointer (log #j u)\n\nlet unsafe_state j =\n // I don't understand why we have to go through model.indexing here when\n // the algorithm is readily available in the info\n info j & Spec.key (I.pne_id_ginfo j)\n\n// why is this type parameterized over the info?\nlet pne_state #j u =\n if is_safe j then\n s:model_state j { dfst s == u }\n else\n s:unsafe_state j { fst s == u }\n\nlet table #j #u st h =\n let (| u, p |) = st <: model_state j in\n B.deref h p\n\nlet key #j #u st =\n snd (st <: unsafe_state j)\n\nlet footprint #i #u w =\n if is_safe i then\n B.loc_addr_of_buffer (dsnd (w <: model_state i))\n else\n B.loc_none\n\nlet invariant #i #u st h =\n if is_safe i then\n B.live h (dsnd (st <: model_state i))\n else\n True\n\nlet frame_invariant #_ #_ _ _ _ _ =\n ()\n\nlet frame_table #_ #_ _ _ _ _ =\n ()", "dependencies": { "source_file": "Model.PNE.fst", "checked_file": "Model.PNE.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "j: Model.PNE.id -> u128: Model.PNE.info j -> FStar.HyperStack.ST.ST (Model.PNE.pne_state u128)", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Model.PNE.id", "Model.PNE.info", "Model.PNE.is_safe", "Prims.Mkdtuple2", "LowStar.Buffer.pointer", "Model.PNE.log", "Model.PNE.model_state", "LowStar.Buffer.malloc", "Mem.q_pne_region", "FStar.UInt32.__uint_to_t", "LowStar.Monotonic.Buffer.mbuffer", "LowStar.Buffer.trivial_preorder", "Prims.l_and", "Prims.eq2", "Prims.nat", "LowStar.Monotonic.Buffer.length", "FStar.UInt32.v", "Prims.b2t", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "FStar.Monotonic.HyperHeap.rid", "LowStar.Monotonic.Buffer.frameOf", "LowStar.Monotonic.Buffer.freeable", "FStar.Seq.Base.empty", "Model.PNE.entry", "Model.PNE.pne_state", "Prims.bool", "FStar.Pervasives.Native.Mktuple2", "Spec.Agile.Cipher.key", "Model.Indexing.pne_id_ginfo", "Model.PNE.unsafe_state", "Model.Helpers.random", "Spec.Agile.Cipher.key_length", "Model.PNE.__proj__Mkinfo'__item__calg", "Model.Helpers.lbytes" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val create (j:id) (u:info j) : ST (pne_state u)\n (requires fun _ -> True)\n (ensures fun h0 st h1 ->\n invariant st h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (footprint st) h0 h1 /\\\n B.(loc_includes (loc_pne_region ()) (footprint st)) /\\\n\n (is_safe j ==> table st h1 == Seq.empty))\nlet create j u =", "completed_definiton": "if is_safe j\nthen\n let l:log #j u = Seq.empty #(entry #j u) in\n ((| u, B.malloc q_pne_region l 1ul |) <: model_state j)\nelse (u, random (Spec.key_length u.calg)) <: unsafe_state j", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fst", "name": "Model.PNE.encrypt", "original_source_type": "val encrypt :\n (#j:id) ->\n (#u:info j) ->\n (st:pne_state u) ->\n (#l:pne_plain_length) ->\n (n:pne_plain u l) ->\n // For confidentiality modeling, this function takes as inputs only the public\n // parts of the header.\n (s:sample) ->\n ST (pne_cipher l)\n (requires fun h0 ->\n invariant st h0 /\\\n // cannot talk about freshness because it requires talking about the\n // table which is only available for safe id's\n (is_safe j ==> fresh_sample s st h0))\n (ensures fun h0 c h1 ->\n invariant st h1 /\\\n B.modifies (footprint st) h0 h1 /\\ (\n if is_safe j then\n exists (c': pne_cipherpad).\n table st h1 == Seq.snoc (table st h0) (Entry s #l n c') /\\\n clip_cipherpad c' l == c\n else\n // Our input is: plain packet number, plain bits to be protected\n let pn, bits = PNEPlainPkg?.as_bytes u.plain j l n in\n let k = key st in\n // We output an encrypted packet number and protected bits\n c == encrypt_spec u.calg l pn bits s k))", "source_type": "val encrypt :\n (#j:id) ->\n (#u:info j) ->\n (st:pne_state u) ->\n (#l:pne_plain_length) ->\n (n:pne_plain u l) ->\n // For confidentiality modeling, this function takes as inputs only the public\n // parts of the header.\n (s:sample) ->\n ST (pne_cipher l)\n (requires fun h0 ->\n invariant st h0 /\\\n // cannot talk about freshness because it requires talking about the\n // table which is only available for safe id's\n (is_safe j ==> fresh_sample s st h0))\n (ensures fun h0 c h1 ->\n invariant st h1 /\\\n B.modifies (footprint st) h0 h1 /\\ (\n if is_safe j then\n exists (c': pne_cipherpad).\n table st h1 == Seq.snoc (table st h0) (Entry s #l n c') /\\\n clip_cipherpad c' l == c\n else\n // Our input is: plain packet number, plain bits to be protected\n let pn, bits = PNEPlainPkg?.as_bytes u.plain j l n in\n let k = key st in\n // We output an encrypted packet number and protected bits\n c == encrypt_spec u.calg l pn bits s k))", "source_definition": "let encrypt #j #u st #l n s =\n let h0 = ST.get () in\n if is_safe j then\n let (| u, p |) = st <: model_state j in\n let log = !*p in\n assert (log == table st h0);\n let cipher: pne_cipherpad = random 4, random_bits () in\n p *= Seq.snoc log (Entry s #l n cipher);\n clip_cipherpad cipher l\n else\n let open QUIC.Spec.Lemmas in\n let pn, bits = PNEPlainPkg?.repr u.plain j l n in\n let k = snd (st <: unsafe_state j) in\n let alg = (fst (st <: unsafe_state j)).calg in\n encrypt_spec alg l pn bits s k", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 90, "start_col": 29, "end_line": 104, "end_col": 34 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\nopen LowStar.BufferOps\n\nlet clip_cipherpad cp l =\n let cipher, bits = cp in\n Seq.slice cipher 0 l, bits\n\nlet log (#i: id) (u: info i): Type0 =\n Seq.seq (entry #i u)\n\nlet model_state j =\n u:info j & B.pointer (log #j u)\n\nlet unsafe_state j =\n // I don't understand why we have to go through model.indexing here when\n // the algorithm is readily available in the info\n info j & Spec.key (I.pne_id_ginfo j)\n\n// why is this type parameterized over the info?\nlet pne_state #j u =\n if is_safe j then\n s:model_state j { dfst s == u }\n else\n s:unsafe_state j { fst s == u }\n\nlet table #j #u st h =\n let (| u, p |) = st <: model_state j in\n B.deref h p\n\nlet key #j #u st =\n snd (st <: unsafe_state j)\n\nlet footprint #i #u w =\n if is_safe i then\n B.loc_addr_of_buffer (dsnd (w <: model_state i))\n else\n B.loc_none\n\nlet invariant #i #u st h =\n if is_safe i then\n B.live h (dsnd (st <: model_state i))\n else\n True\n\nlet frame_invariant #_ #_ _ _ _ _ =\n ()\n\nlet frame_table #_ #_ _ _ _ _ =\n ()\n\nlet create j u =\n if is_safe j then\n let l: log #j u = Seq.empty #(entry #j u) in\n ((| u, B.malloc q_pne_region l 1ul |) <: model_state j)\n else\n (u, random (Spec.key_length u.calg)) <: unsafe_state j\n\nlet coerce j u k =\n (u, k) <: unsafe_state j\n\nlet quic_coerce j u ts =\n let k =\n (QUIC.Spec.derive_secret u.halg ts\n QUIC.Spec.label_hp (key_len u)) in\n coerce j u k\n\nlet random_bits ():\n HyperStack.ST.ST bits\n (requires fun h0 -> True)\n (ensures fun h0 _ h1 -> h0 == h1)\n=\n let r = random 1 in\n LowParse.BitFields.get_bitfield #8 (UInt8.v (Lib.RawIntTypes.u8_to_UInt8 (Seq.index r 0))) 0 5", "dependencies": { "source_file": "Model.PNE.fst", "checked_file": "Model.PNE.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "st: Model.PNE.pne_state u149 -> n: Model.PNE.pne_plain u149 l -> s: Model.PNE.sample\n -> FStar.HyperStack.ST.ST (Model.PNE.pne_cipher l)", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Model.PNE.id", "Model.PNE.info", "Model.PNE.pne_state", "Model.PNE.pne_plain_length", "Model.PNE.pne_plain", "Model.PNE.sample", "Model.PNE.is_safe", "LowStar.Buffer.pointer", "Model.PNE.log", "Model.PNE.clip_cipherpad", "Model.PNE.pne_cipher", "Prims.unit", "LowStar.BufferOps.op_Star_Equals", "LowStar.Buffer.trivial_preorder", "FStar.Seq.Properties.snoc", "Model.PNE.entry", "Model.PNE.Entry", "Model.PNE.pne_cipherpad", "FStar.Pervasives.Native.Mktuple2", "Model.Helpers.lbytes", "Model.PNE.bits", "Model.PNE.random_bits", "Model.Helpers.random", "Prims._assert", "Prims.eq2", "FStar.Seq.Base.seq", "Model.PNE.table", "LowStar.BufferOps.op_Bang_Star", "Model.PNE.model_state", "Prims.bool", "Model.PNE.length_bits", "Model.PNE.encrypt_spec", "Model.PNE.alg", "Model.PNE.__proj__Mkinfo'__item__calg", "FStar.Pervasives.Native.fst", "Spec.Agile.Cipher.key", "Model.Indexing.pne_id_ginfo", "Model.PNE.unsafe_state", "FStar.Pervasives.Native.snd", "FStar.Pervasives.Native.tuple2", "Model.PNE.__proj__PNEPlainPkg__item__as_bytes", "Model.PNE.__proj__Mkinfo'__item__plain", "Model.PNE.__proj__PNEPlainPkg__item__repr", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val encrypt :\n (#j:id) ->\n (#u:info j) ->\n (st:pne_state u) ->\n (#l:pne_plain_length) ->\n (n:pne_plain u l) ->\n // For confidentiality modeling, this function takes as inputs only the public\n // parts of the header.\n (s:sample) ->\n ST (pne_cipher l)\n (requires fun h0 ->\n invariant st h0 /\\\n // cannot talk about freshness because it requires talking about the\n // table which is only available for safe id's\n (is_safe j ==> fresh_sample s st h0))\n (ensures fun h0 c h1 ->\n invariant st h1 /\\\n B.modifies (footprint st) h0 h1 /\\ (\n if is_safe j then\n exists (c': pne_cipherpad).\n table st h1 == Seq.snoc (table st h0) (Entry s #l n c') /\\\n clip_cipherpad c' l == c\n else\n // Our input is: plain packet number, plain bits to be protected\n let pn, bits = PNEPlainPkg?.as_bytes u.plain j l n in\n let k = key st in\n // We output an encrypted packet number and protected bits\n c == encrypt_spec u.calg l pn bits s k))\nlet encrypt #j #u st #l n s =", "completed_definiton": "let h0 = ST.get () in\nif is_safe j\nthen\n let (| u , p |) = st <: model_state j in\n let log = !*p in\n assert (log == table st h0);\n let cipher:pne_cipherpad = random 4, random_bits () in\n p *= Seq.snoc log (Entry s #l n cipher);\n clip_cipherpad cipher l\nelse\n let open QUIC.Spec.Lemmas in\n let pn, bits = PNEPlainPkg?.repr u.plain j l n in\n let k = snd (st <: unsafe_state j) in\n let alg = (fst (st <: unsafe_state j)).calg in\n encrypt_spec alg l pn bits s k", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fst", "name": "Model.PNE.quic_coerce", "original_source_type": "val quic_coerce (j:unsafe_id) (u:info j)\n (ts:traffic_secret u.halg)\n : ST (pne_state #j u)\n (requires fun _ -> True)\n (ensures fun h0 st h1 ->\n invariant st h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (footprint st) h0 h1 /\\\n B.(loc_includes (loc_pne_region ()) (footprint st)) /\\\n key st ==\n QUIC.Spec.derive_secret u.halg ts\n QUIC.Spec.label_hp (key_len u))", "source_type": "val quic_coerce (j:unsafe_id) (u:info j)\n (ts:traffic_secret u.halg)\n : ST (pne_state #j u)\n (requires fun _ -> True)\n (ensures fun h0 st h1 ->\n invariant st h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (footprint st) h0 h1 /\\\n B.(loc_includes (loc_pne_region ()) (footprint st)) /\\\n key st ==\n QUIC.Spec.derive_secret u.halg ts\n QUIC.Spec.label_hp (key_len u))", "source_definition": "let quic_coerce j u ts =\n let k =\n (QUIC.Spec.derive_secret u.halg ts\n QUIC.Spec.label_hp (key_len u)) in\n coerce j u k", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 76, "start_col": 24, "end_line": 80, "end_col": 14 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\nopen LowStar.BufferOps\n\nlet clip_cipherpad cp l =\n let cipher, bits = cp in\n Seq.slice cipher 0 l, bits\n\nlet log (#i: id) (u: info i): Type0 =\n Seq.seq (entry #i u)\n\nlet model_state j =\n u:info j & B.pointer (log #j u)\n\nlet unsafe_state j =\n // I don't understand why we have to go through model.indexing here when\n // the algorithm is readily available in the info\n info j & Spec.key (I.pne_id_ginfo j)\n\n// why is this type parameterized over the info?\nlet pne_state #j u =\n if is_safe j then\n s:model_state j { dfst s == u }\n else\n s:unsafe_state j { fst s == u }\n\nlet table #j #u st h =\n let (| u, p |) = st <: model_state j in\n B.deref h p\n\nlet key #j #u st =\n snd (st <: unsafe_state j)\n\nlet footprint #i #u w =\n if is_safe i then\n B.loc_addr_of_buffer (dsnd (w <: model_state i))\n else\n B.loc_none\n\nlet invariant #i #u st h =\n if is_safe i then\n B.live h (dsnd (st <: model_state i))\n else\n True\n\nlet frame_invariant #_ #_ _ _ _ _ =\n ()\n\nlet frame_table #_ #_ _ _ _ _ =\n ()\n\nlet create j u =\n if is_safe j then\n let l: log #j u = Seq.empty #(entry #j u) in\n ((| u, B.malloc q_pne_region l 1ul |) <: model_state j)\n else\n (u, random (Spec.key_length u.calg)) <: unsafe_state j\n\nlet coerce j u k =\n (u, k) <: unsafe_state j", "dependencies": { "source_file": "Model.PNE.fst", "checked_file": "Model.PNE.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n j: Model.PNE.unsafe_id ->\n u136: Model.PNE.info j ->\n ts: Model.PNE.traffic_secret (Mkinfo'?.halg u136)\n -> FStar.HyperStack.ST.ST (Model.PNE.pne_state u136)", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Model.PNE.unsafe_id", "Model.PNE.info", "Model.PNE.traffic_secret", "Model.PNE.__proj__Mkinfo'__item__halg", "Model.PNE.coerce", "Model.PNE.pne_state", "FStar.Seq.Base.seq", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "QUIC.Spec.Crypto.derive_secret", "QUIC.Spec.Crypto.label_hp", "Model.PNE.key_len" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val quic_coerce (j:unsafe_id) (u:info j)\n (ts:traffic_secret u.halg)\n : ST (pne_state #j u)\n (requires fun _ -> True)\n (ensures fun h0 st h1 ->\n invariant st h1 /\\\n B.modifies B.loc_none h0 h1 /\\\n B.fresh_loc (footprint st) h0 h1 /\\\n B.(loc_includes (loc_pne_region ()) (footprint st)) /\\\n key st ==\n QUIC.Spec.derive_secret u.halg ts\n QUIC.Spec.label_hp (key_len u))\nlet quic_coerce j u ts =", "completed_definiton": "let k = (QUIC.Spec.derive_secret u.halg ts QUIC.Spec.label_hp (key_len u)) in\ncoerce j u k", "isa_cross_project_example": true }, { "file_name": "Model.PNE.fst", "name": "Model.PNE.decrypt", "original_source_type": "val decrypt:\n (#j:id) ->\n (#u:info j) ->\n (st:pne_state u) ->\n (cp:pne_cipherpad) ->\n (s:sample) ->\n ST (l:pne_plain_length & pne_plain u l)\n (requires fun h0 ->\n invariant st h0)\n (ensures fun h0 r h1 ->\n invariant st h1 /\\\n B.modifies (footprint st) h0 h1 /\\ (\n if is_safe j then\n let entry = entry_for_sample s st h1 in\n Some? entry /\\ (\n let Some (Entry _ #l' n' c') = entry in\n r == PNEPlainPkg?.xor u.plain j l' n' (c' `xor_cipherpad` cp)) /\\\n (Some? (entry_for_sample s st h0) ==> modifies_none h0 h1)\n else\n let cipher, encrypted_bits = cp in\n r == decrypt_spec u.calg cipher encrypted_bits (key st) s)\n )", "source_type": "val decrypt:\n (#j:id) ->\n (#u:info j) ->\n (st:pne_state u) ->\n (cp:pne_cipherpad) ->\n (s:sample) ->\n ST (l:pne_plain_length & pne_plain u l)\n (requires fun h0 ->\n invariant st h0)\n (ensures fun h0 r h1 ->\n invariant st h1 /\\\n B.modifies (footprint st) h0 h1 /\\ (\n if is_safe j then\n let entry = entry_for_sample s st h1 in\n Some? entry /\\ (\n let Some (Entry _ #l' n' c') = entry in\n r == PNEPlainPkg?.xor u.plain j l' n' (c' `xor_cipherpad` cp)) /\\\n (Some? (entry_for_sample s st h0) ==> modifies_none h0 h1)\n else\n let cipher, encrypted_bits = cp in\n r == decrypt_spec u.calg cipher encrypted_bits (key st) s)\n )", "source_definition": "let decrypt #j #u st cp s =\n if is_safe j then\n let (| info, p |) = st <: model_state j in\n let log = !*p in\n match Seq.find_l (sample_filter u s) log with\n | Some (Entry _ #l' n' c') ->\n // The sample is present in the table, cipher may or may not match, it's\n // up to the caller to prove that when there's a match (i.e. c' == cp)\n // then c'' == zeroes which then entails that the returns value is the\n // plaintext that was in the table\n let c'' = c' `xor_cipherpad` cp in\n PNEPlainPkg?.xor u.plain j l' n' c''\n | None ->\n // Need to add into the table:\n let bits = random_bits () in\n let l = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n let c' = random 4, bits in\n // let n' = clip_cipherpad (c' `xor_cipherpad` cp) l in\n let r = random l in\n let n = PNEPlainPkg?.mk u.plain j l r bits in\n let new_log = Seq.snoc log (Entry s #l n c') in\n p *= new_log;\n snoc_find log (sample_filter u s) (Entry s #l n c');\n let h1 = ST.get () in\n let r = PNEPlainPkg?.xor u.plain j l n (c' `xor_cipherpad` cp) in\n assert (\n let entry = entry_for_sample s st h1 in\n Some? entry /\\ (\n let Some (Entry _ #l' n' c') = entry in\n r == PNEPlainPkg?.xor u.plain j l' n' (c' `xor_cipherpad` cp)));\n r\n else\n let info, k = st <: unsafe_state j in\n decrypt_spec info.calg (fst cp) (snd cp) k s", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.PNE.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 117, "start_col": 2, "end_line": 149, "end_col": 48 }, "file_context": "module Model.PNE\n\nmodule B = LowStar.Buffer\nmodule HS = FStar.HyperStack\nmodule I = Model.Indexing\nmodule U32 = FStar.UInt32\nmodule U128 = FStar.UInt128\nmodule Spec = Spec.Agile.Cipher\n\nmodule ST = FStar.HyperStack.ST\n\n#set-options \"--fuel 0 --ifuel 0\"\n\nopen FStar.HyperStack\nopen Mem\nopen Model.Helpers\nopen LowStar.BufferOps\n\nlet clip_cipherpad cp l =\n let cipher, bits = cp in\n Seq.slice cipher 0 l, bits\n\nlet log (#i: id) (u: info i): Type0 =\n Seq.seq (entry #i u)\n\nlet model_state j =\n u:info j & B.pointer (log #j u)\n\nlet unsafe_state j =\n // I don't understand why we have to go through model.indexing here when\n // the algorithm is readily available in the info\n info j & Spec.key (I.pne_id_ginfo j)\n\n// why is this type parameterized over the info?\nlet pne_state #j u =\n if is_safe j then\n s:model_state j { dfst s == u }\n else\n s:unsafe_state j { fst s == u }\n\nlet table #j #u st h =\n let (| u, p |) = st <: model_state j in\n B.deref h p\n\nlet key #j #u st =\n snd (st <: unsafe_state j)\n\nlet footprint #i #u w =\n if is_safe i then\n B.loc_addr_of_buffer (dsnd (w <: model_state i))\n else\n B.loc_none\n\nlet invariant #i #u st h =\n if is_safe i then\n B.live h (dsnd (st <: model_state i))\n else\n True\n\nlet frame_invariant #_ #_ _ _ _ _ =\n ()\n\nlet frame_table #_ #_ _ _ _ _ =\n ()\n\nlet create j u =\n if is_safe j then\n let l: log #j u = Seq.empty #(entry #j u) in\n ((| u, B.malloc q_pne_region l 1ul |) <: model_state j)\n else\n (u, random (Spec.key_length u.calg)) <: unsafe_state j\n\nlet coerce j u k =\n (u, k) <: unsafe_state j\n\nlet quic_coerce j u ts =\n let k =\n (QUIC.Spec.derive_secret u.halg ts\n QUIC.Spec.label_hp (key_len u)) in\n coerce j u k\n\nlet random_bits ():\n HyperStack.ST.ST bits\n (requires fun h0 -> True)\n (ensures fun h0 _ h1 -> h0 == h1)\n=\n let r = random 1 in\n LowParse.BitFields.get_bitfield #8 (UInt8.v (Lib.RawIntTypes.u8_to_UInt8 (Seq.index r 0))) 0 5\n\nlet encrypt #j #u st #l n s =\n let h0 = ST.get () in\n if is_safe j then\n let (| u, p |) = st <: model_state j in\n let log = !*p in\n assert (log == table st h0);\n let cipher: pne_cipherpad = random 4, random_bits () in\n p *= Seq.snoc log (Entry s #l n cipher);\n clip_cipherpad cipher l\n else\n let open QUIC.Spec.Lemmas in\n let pn, bits = PNEPlainPkg?.repr u.plain j l n in\n let k = snd (st <: unsafe_state j) in\n let alg = (fst (st <: unsafe_state j)).calg in\n encrypt_spec alg l pn bits s k\n\n#push-options \"--fuel 1\"\nlet snoc_find #a (s: Seq.seq a) (f: a -> bool) (x: a): Lemma\n (requires f x /\\ None? FStar.Seq.(find_l f s))\n (ensures FStar.Seq.(find_l f (snoc s x)) == Some x)\n=\n assert (Seq.snoc s x `Seq.equal` Seq.append s (Seq.create 1 x));\n Seq.find_append_none s (Seq.create 1 x) f;\n ()\n#pop-options", "dependencies": { "source_file": "Model.PNE.fst", "checked_file": "Model.PNE.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.Cipher.fsti.checked", "QUIC.Spec.Lemmas.fst.checked", "QUIC.Spec.fsti.checked", "prims.fst.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Mem.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.BitFields.fsti.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt128.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Spec", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "U128", "full_module": "FStar.UInt128" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "st: Model.PNE.pne_state u167 -> cp: Model.PNE.pne_cipherpad -> s: Model.PNE.sample\n -> FStar.HyperStack.ST.ST\n (Prims.dtuple2 Model.PNE.pne_plain_length (fun l -> Model.PNE.pne_plain u167 l))", "effect": "FStar.HyperStack.ST.ST", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "Model.PNE.id", "Model.PNE.info", "Model.PNE.pne_state", "Model.PNE.pne_cipherpad", "Model.PNE.sample", "Model.PNE.is_safe", "LowStar.Buffer.pointer", "Model.PNE.log", "FStar.Seq.Properties.find_l", "Model.PNE.entry", "Model.PNE.sample_filter", "Model.PNE.pne_plain_length", "Model.PNE.pne_plain", "Model.PNE.__proj__PNEPlainPkg__item__xor", "Model.PNE.__proj__Mkinfo'__item__plain", "Model.PNE.xor_cipherpad", "Prims.dtuple2", "Prims.unit", "Prims._assert", "Prims.l_and", "Prims.b2t", "FStar.Pervasives.Native.uu___is_Some", "Prims.eq2", "Model.PNE.__proj__PNEPlainPkg__item__pne_plain", "Prims.logical", "FStar.Pervasives.Native.option", "Model.PNE.entry_for_sample", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "Model.PNE.snoc_find", "Model.PNE.Entry", "LowStar.BufferOps.op_Star_Equals", "LowStar.Buffer.trivial_preorder", "FStar.Seq.Base.seq", "FStar.Seq.Properties.snoc", "FStar.Pervasives.Native.tuple2", "Model.Helpers.lbytes", "Model.PNE.length_bits", "Model.PNE.__proj__PNEPlainPkg__item__as_bytes", "FStar.Pervasives.Native.Mktuple2", "Model.PNE.__proj__PNEPlainPkg__item__mk", "Model.Helpers.random", "Model.PNE.bits", "Prims.int", "Prims.op_Addition", "LowParse.BitFields.get_bitfield", "Model.PNE.random_bits", "LowStar.BufferOps.op_Bang_Star", "Model.PNE.model_state", "Prims.bool", "Spec.Agile.Cipher.key", "Model.Indexing.pne_id_ginfo", "Model.PNE.decrypt_spec", "Model.PNE.__proj__Mkinfo'__item__calg", "FStar.Pervasives.Native.fst", "FStar.Pervasives.Native.snd", "Model.PNE.unsafe_state" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val decrypt:\n (#j:id) ->\n (#u:info j) ->\n (st:pne_state u) ->\n (cp:pne_cipherpad) ->\n (s:sample) ->\n ST (l:pne_plain_length & pne_plain u l)\n (requires fun h0 ->\n invariant st h0)\n (ensures fun h0 r h1 ->\n invariant st h1 /\\\n B.modifies (footprint st) h0 h1 /\\ (\n if is_safe j then\n let entry = entry_for_sample s st h1 in\n Some? entry /\\ (\n let Some (Entry _ #l' n' c') = entry in\n r == PNEPlainPkg?.xor u.plain j l' n' (c' `xor_cipherpad` cp)) /\\\n (Some? (entry_for_sample s st h0) ==> modifies_none h0 h1)\n else\n let cipher, encrypted_bits = cp in\n r == decrypt_spec u.calg cipher encrypted_bits (key st) s)\n )\nlet decrypt #j #u st cp s =", "completed_definiton": "if is_safe j\nthen\n let (| info , p |) = st <: model_state j in\n let log = !*p in\n match Seq.find_l (sample_filter u s) log with\n | Some (Entry _ #l' n' c') ->\n let c'' = c' `xor_cipherpad` cp in\n PNEPlainPkg?.xor u.plain j l' n' c''\n | None ->\n let bits = random_bits () in\n let l = LowParse.BitFields.get_bitfield bits 0 2 + 1 in\n let c' = random 4, bits in\n let r = random l in\n let n = PNEPlainPkg?.mk u.plain j l r bits in\n let new_log = Seq.snoc log (Entry s #l n c') in\n p *= new_log;\n snoc_find log (sample_filter u s) (Entry s #l n c');\n let h1 = ST.get () in\n let r = PNEPlainPkg?.xor u.plain j l n (c' `xor_cipherpad` cp) in\n assert (let entry = entry_for_sample s st h1 in\n Some? entry /\\\n (let Some (Entry _ #l' n' c') = entry in\n r == PNEPlainPkg?.xor u.plain j l' n' (c' `xor_cipherpad` cp)));\n r\nelse\n let info, k = st <: unsafe_state j in\n decrypt_spec info.calg (fst cp) (snd cp) k s", "isa_cross_project_example": true }, { "file_name": "Model.Helpers.fst", "name": "Model.Helpers.correct2", "original_source_type": "val correct2 (#l: nat) (b:lbytes l)\n : Lemma (hide (reveal #l b) == b)\n [SMTPat (hide (reveal #l b))]", "source_type": "val correct2 (#l: nat) (b:lbytes l)\n : Lemma (hide (reveal #l b) == b)\n [SMTPat (hide (reveal #l b))]", "source_definition": "let correct2 #l b =\n assert (hide (reveal #l b) `Seq.equal` b)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.Helpers.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 12, "start_col": 2, "end_line": 12, "end_col": 43 }, "file_context": "module Model.Helpers\n\nfriend Lib.RawIntTypes\n\nlet correct #l (b:Seq.seq UInt8.t{Seq.length b = l})\n : Lemma (reveal #l (hide b) == b)\n [SMTPat (reveal #l (hide b))]\n=\n assert (reveal #l (hide b) `Seq.equal` b)", "dependencies": { "source_file": "Model.Helpers.fst", "checked_file": "Model.Helpers.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Lib.RawIntTypes.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: Model.Helpers.lbytes l\n -> FStar.Pervasives.Lemma (ensures Model.Helpers.hide (Model.Helpers.reveal b) == b)\n [SMTPat (Model.Helpers.hide (Model.Helpers.reveal b))]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Model.Helpers.lbytes", "Prims._assert", "FStar.Seq.Base.equal", "Lib.IntTypes.uint8", "Model.Helpers.hide", "Model.Helpers.reveal", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val correct2 (#l: nat) (b:lbytes l)\n : Lemma (hide (reveal #l b) == b)\n [SMTPat (hide (reveal #l b))]\nlet correct2 #l b =", "completed_definiton": "assert ((hide (reveal #l b)) `Seq.equal` b)", "isa_cross_project_example": true }, { "file_name": "Model.Helpers.fst", "name": "Model.Helpers.correct", "original_source_type": "val correct (#l: nat) (b:Seq.seq UInt8.t{Seq.length b = l})\n : Lemma (reveal #l (hide b) == b)\n [SMTPat (reveal #l (hide b))]", "source_type": "val correct (#l: nat) (b:Seq.seq UInt8.t{Seq.length b = l})\n : Lemma (reveal #l (hide b) == b)\n [SMTPat (reveal #l (hide b))]", "source_definition": "let correct #l (b:Seq.seq UInt8.t{Seq.length b = l})\n : Lemma (reveal #l (hide b) == b)\n [SMTPat (reveal #l (hide b))]\n=\n assert (reveal #l (hide b) `Seq.equal` b)", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.Helpers.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 9, "start_col": 2, "end_line": 9, "end_col": 43 }, "file_context": "module Model.Helpers\n\nfriend Lib.RawIntTypes\n\nlet correct #l (b:Seq.seq UInt8.t{Seq.length b = l})\n : Lemma (reveal #l (hide b) == b)\n [SMTPat (reveal #l (hide b))]", "dependencies": { "source_file": "Model.Helpers.fst", "checked_file": "Model.Helpers.fst.checked", "interface_file": true, "dependencies": [ "prims.fst.checked", "Lib.RawIntTypes.fst.checked", "FStar.UInt8.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: FStar.Seq.Base.seq FStar.UInt8.t {FStar.Seq.Base.length b = l}\n -> FStar.Pervasives.Lemma (ensures Model.Helpers.reveal (Model.Helpers.hide b) == b)\n [SMTPat (Model.Helpers.reveal (Model.Helpers.hide b))]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "FStar.Seq.Base.seq", "FStar.UInt8.t", "Prims.b2t", "Prims.op_Equality", "FStar.Seq.Base.length", "Prims._assert", "FStar.Seq.Base.equal", "QUIC.Spec.Base.byte", "Model.Helpers.reveal", "Model.Helpers.hide", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "Prims.l_or", "Prims.Cons", "FStar.Pervasives.pattern", "FStar.Pervasives.smt_pat", "QUIC.Spec.Base.lbytes", "Prims.Nil" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val correct (#l: nat) (b:Seq.seq UInt8.t{Seq.length b = l})\n : Lemma (reveal #l (hide b) == b)\n [SMTPat (reveal #l (hide b))]\nlet correct #l (b: Seq.seq UInt8.t {Seq.length b = l})\n : Lemma (reveal #l (hide b) == b) [SMTPat (reveal #l (hide b))] =", "completed_definiton": "assert ((reveal #l (hide b)) `Seq.equal` b)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.fsti", "name": "QUIC.Spec.PacketNumber.parse_packet_number_kind", "original_source_type": "", "source_type": "val parse_packet_number_kind : LowParse.Spec.Base.parser_kind", "source_definition": "let parse_packet_number_kind = strong_parser_kind 1 4 None", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 11, "start_col": 31, "end_line": 11, "end_col": 58 }, "file_context": "module QUIC.Spec.PacketNumber\ninclude QUIC.Spec.PacketNumber.Base\nopen LowParse.Spec.Base\n\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule Secret = QUIC.Secret.Int", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.fsti", "checked_file": "QUIC.Spec.PacketNumber.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Base.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.strong_parser_kind", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let parse_packet_number_kind =", "completed_definiton": "strong_parser_kind 1 4 None", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.PacketNumber.fsti", "name": "QUIC.Spec.PacketNumber.parse_packet_number_kind'", "original_source_type": "val parse_packet_number_kind' (sz: packet_number_length_t) : GTot parser_kind", "source_type": "val parse_packet_number_kind' (sz: packet_number_length_t) : GTot parser_kind", "source_definition": "let parse_packet_number_kind'\n (sz: packet_number_length_t)\n: GTot parser_kind\n= total_constant_size_parser_kind (Secret.v sz)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.PacketNumber.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 22, "start_col": 2, "end_line": 22, "end_col": 47 }, "file_context": "module QUIC.Spec.PacketNumber\ninclude QUIC.Spec.PacketNumber.Base\nopen LowParse.Spec.Base\n\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule Secret = QUIC.Secret.Int\n\ninline_for_extraction\nlet parse_packet_number_kind = strong_parser_kind 1 4 None\n\nval parse_packet_number\n (last: last_packet_number_t)\n (pn_len: packet_number_length_t)\n: Tot (parser parse_packet_number_kind (packet_number_t' last pn_len))\n\ninline_for_extraction\nlet parse_packet_number_kind'\n (sz: packet_number_length_t)", "dependencies": { "source_file": "QUIC.Spec.PacketNumber.fsti", "checked_file": "QUIC.Spec.PacketNumber.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowParse.Spec.Base.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Combinators" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Lemmas" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "LowParse.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "sz: QUIC.Spec.PacketNumber.Base.packet_number_length_t -> Prims.GTot LowParse.Spec.Base.parser_kind", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "LowParse.Spec.Base.total_constant_size_parser_kind", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "LowParse.Spec.Base.parser_kind" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val parse_packet_number_kind' (sz: packet_number_length_t) : GTot parser_kind\nlet parse_packet_number_kind' (sz: packet_number_length_t) : GTot parser_kind =", "completed_definiton": "total_constant_size_parser_kind (Secret.v sz)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.fst", "name": "QUIC.Impl.iv_for_encrypt_decrypt_pre", "original_source_type": "val iv_for_encrypt_decrypt_pre\n (a: ea)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n : GTot Type0", "source_type": "val iv_for_encrypt_decrypt_pre\n (a: ea)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n : GTot Type0", "source_definition": "let iv_for_encrypt_decrypt_pre\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n B.all_disjoint [\n B.loc_buffer siv;\n B.loc_buffer dst;\n ] /\\\n B.live m siv /\\ B.length siv == 12 /\\\n B.live m dst /\\ B.length dst == 12 /\\\n pn_len == Spec.pn_length h /\\\n pn == Spec.packet_number h", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 64, "start_col": 1, "end_line": 73, "end_col": 28 }, "file_context": "module QUIC.Impl\n\n// This MUST be kept in sync with QUIC.Impl.fsti...\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule IB = LowStar.ImmutableBuffer\nmodule Seq = QUIC.Secret.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\nmodule HST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\n\nfriend QUIC.Spec\n\nopen QUIC.Impl.Lemmas\n\nopen LowStar.BufferOps\n\n//module HeaderS = QUIC.Spec.Header\n//module HeaderI = QUIC.Impl.Header\n\n#set-options \"--z3rlimit 64 --query_stats\"\n\n#restart-solver\n\nmodule SAEAD = Spec.Agile.AEAD\nmodule SCipher = Spec.Agile.Cipher\nmodule SHKDF = Spec.Agile.HKDF\n\nmodule SecretBuffer = QUIC.Secret.Buffer\n\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nunfold\nlet iv_for_encrypt_decrypt_pre\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)", "dependencies": { "source_file": "QUIC.Impl.fst", "checked_file": "QUIC.Impl.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.Header.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n siv: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n dst: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n h:\n FStar.Ghost.erased QUIC.Spec.Header.Base.header\n {~(QUIC.Spec.Header.Base.is_retry (FStar.Ghost.reveal h))} ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t ->\n m: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "FStar.Ghost.erased", "QUIC.Spec.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Spec.Header.Base.is_retry", "FStar.Ghost.reveal", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "FStar.Monotonic.HyperStack.mem", "Prims.l_and", "LowStar.Monotonic.Buffer.all_disjoint", "Prims.Cons", "LowStar.Monotonic.Buffer.loc", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Buffer.trivial_preorder", "Prims.Nil", "LowStar.Monotonic.Buffer.live", "Prims.eq2", "Prims.int", "LowStar.Monotonic.Buffer.length", "QUIC.Spec.Header.Base.pn_length", "QUIC.Spec.Header.Base.packet_number", "Spec.Agile.Cipher.cipher_alg", "Spec.Agile.AEAD.cipher_alg_of_supported_alg" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val iv_for_encrypt_decrypt_pre\n (a: ea)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n : GTot Type0\nlet iv_for_encrypt_decrypt_pre\n (a: ea)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n : GTot Type0 =", "completed_definiton": "let a' = SAEAD.cipher_alg_of_supported_alg a in\nB.all_disjoint [B.loc_buffer siv; B.loc_buffer dst] /\\ B.live m siv /\\ B.length siv == 12 /\\\nB.live m dst /\\ B.length dst == 12 /\\ pn_len == Spec.pn_length h /\\ pn == Spec.packet_number h", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.fst", "name": "QUIC.Impl.payload_encrypt_pre", "original_source_type": "val payload_encrypt_pre\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n : GTot Type0", "source_type": "val payload_encrypt_pre\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n : GTot Type0", "source_definition": "let payload_encrypt_pre\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32) // should be secret, because otherwise one can compute the packet number length\n (m: HS.mem)\n: GTot Type0\n=\n let fmt = SParse.format_header h in\n\n B.all_disjoint [\n AEAD.footprint m s;\n B.loc_buffer siv;\n B.loc_buffer dst;\n B.loc_buffer plain;\n ] /\\\n\n AEAD.invariant m s /\\\n B.live m siv /\\ B.length siv == 12 /\\\n Secret.v header_len == Seq.length fmt /\\\n B.live m dst /\\ B.length dst == Secret.v header_len + Secret.v plain_len + SAEAD.tag_length a /\\\n pn_len == Spec.pn_length h /\\\n pn == Spec.packet_number h /\\\n B.live m plain /\\ B.length plain == Secret.v plain_len /\\ 3 <= Secret.v plain_len /\\ Secret.v plain_len < max_plain_length /\\\n B.as_seq m (B.gsub dst 0ul (Secret.reveal header_len)) `Seq.equal` Seq.seq_hide fmt", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 136, "start_col": 1, "end_line": 153, "end_col": 85 }, "file_context": "module QUIC.Impl\n\n// This MUST be kept in sync with QUIC.Impl.fsti...\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule IB = LowStar.ImmutableBuffer\nmodule Seq = QUIC.Secret.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\nmodule HST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\n\nfriend QUIC.Spec\n\nopen QUIC.Impl.Lemmas\n\nopen LowStar.BufferOps\n\n//module HeaderS = QUIC.Spec.Header\n//module HeaderI = QUIC.Impl.Header\n\n#set-options \"--z3rlimit 64 --query_stats\"\n\n#restart-solver\n\nmodule SAEAD = Spec.Agile.AEAD\nmodule SCipher = Spec.Agile.Cipher\nmodule SHKDF = Spec.Agile.HKDF\n\nmodule SecretBuffer = QUIC.Secret.Buffer\n\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nunfold\nlet iv_for_encrypt_decrypt_pre\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n B.all_disjoint [\n B.loc_buffer siv;\n B.loc_buffer dst;\n ] /\\\n B.live m siv /\\ B.length siv == 12 /\\\n B.live m dst /\\ B.length dst == 12 /\\\n pn_len == Spec.pn_length h /\\\n pn == Spec.packet_number h\n\nunfold\nlet iv_for_encrypt_decrypt_post\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n (m' : HS.mem)\n: GTot Type0\n=\n iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m /\\\n begin\n B.modifies (B.loc_buffer dst) m m' /\\\n B.as_seq m' dst `Seq.equal`\n Spec.iv_for_encrypt_decrypt a (B.as_seq m siv) h\n end\n\nlet iv_for_encrypt_decrypt\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n: HST.Stack unit\n (requires (fun m ->\n iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m\n ))\n (ensures (fun m _ m' ->\n iv_for_encrypt_decrypt_post a siv dst h pn_len pn m m'\n ))\n= let m0 = HST.get () in\n B.fill dst (Secret.to_u8 0uy) 12ul;\n let pnb_store = B.sub dst 4ul 8ul in\n SecretBuffer.store64_be pnb_store pn;\n let m2 = HST.get () in\n assert (Seq.seq_reveal (B.as_seq m2 (B.gsub dst 0ul 4ul)) `Seq.equal` Seq.create 4 0uy);\n assert (Seq.seq_reveal (B.as_seq m2 dst) `Seq.equal` (Seq.create 4 0uy `Seq.append` FStar.Endianness.n_to_be 8 (Secret.v pn)));\n QUIC.Impl.Lemmas.n_to_be_lower' 8 12 (Secret.v pn);\n assert (Seq.seq_reveal (B.as_seq m2 dst) == FStar.Endianness.n_to_be 12 (Secret.v pn));\n QUIC.Impl.Lemmas.op_inplace dst siv 12ul 0ul (Secret.logxor #Secret.U8 #Secret.SEC);\n QUIC.Impl.Lemmas.secret_xor_inplace_eq (B.as_seq m2 dst) (B.as_seq m2 siv) 0\n\nmodule SParse = QUIC.Spec.Header.Parse\n\nunfold\nlet payload_encrypt_pre\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32) // should be secret, because otherwise one can compute the packet number length\n (m: HS.mem)", "dependencies": { "source_file": "QUIC.Impl.fst", "checked_file": "QUIC.Impl.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.Header.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "SParse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n s: EverCrypt.AEAD.state a ->\n siv: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n dst: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n h:\n FStar.Ghost.erased QUIC.Spec.Header.Base.header\n {~(QUIC.Spec.Header.Base.is_retry (FStar.Ghost.reveal h))} ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t ->\n header_len: Lib.IntTypes.uint32 ->\n plain: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n plain_len: Lib.IntTypes.uint32 ->\n m: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "EverCrypt.AEAD.state", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "FStar.Ghost.erased", "QUIC.Spec.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Spec.Header.Base.is_retry", "FStar.Ghost.reveal", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Lib.IntTypes.uint32", "FStar.Monotonic.HyperStack.mem", "Prims.l_and", "LowStar.Monotonic.Buffer.all_disjoint", "Prims.Cons", "LowStar.Monotonic.Buffer.loc", "EverCrypt.AEAD.footprint", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Buffer.trivial_preorder", "Prims.Nil", "EverCrypt.AEAD.invariant", "LowStar.Monotonic.Buffer.live", "Prims.eq2", "Prims.int", "LowStar.Monotonic.Buffer.length", "Prims.l_or", "Lib.IntTypes.range", "Lib.IntTypes.U32", "Prims.op_GreaterThanOrEqual", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.SEC", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "Prims.op_Addition", "Spec.Agile.AEAD.tag_length", "QUIC.Spec.Header.Base.pn_length", "QUIC.Spec.Header.Base.packet_number", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "QUIC.Spec.Crypto.max_plain_length", "FStar.Seq.Base.equal", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Buffer.gsub", "FStar.UInt32.__uint_to_t", "QUIC.Secret.Int.reveal", "QUIC.Secret.Seq.seq_hide", "Lib.IntTypes.U8", "QUIC.Spec.Base.lbytes", "QUIC.Spec.Header.Base.header_len", "QUIC.Spec.Header.Parse.format_header" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val payload_encrypt_pre\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n : GTot Type0\nlet payload_encrypt_pre\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n : GTot Type0 =", "completed_definiton": "let fmt = SParse.format_header h in\nB.all_disjoint [AEAD.footprint m s; B.loc_buffer siv; B.loc_buffer dst; B.loc_buffer plain] /\\\nAEAD.invariant m s /\\ B.live m siv /\\ B.length siv == 12 /\\ Secret.v header_len == Seq.length fmt /\\\nB.live m dst /\\ B.length dst == Secret.v header_len + Secret.v plain_len + SAEAD.tag_length a /\\\npn_len == Spec.pn_length h /\\ pn == Spec.packet_number h /\\ B.live m plain /\\\nB.length plain == Secret.v plain_len /\\ 3 <= Secret.v plain_len /\\\nSecret.v plain_len < max_plain_length /\\\n(B.as_seq m (B.gsub dst 0ul (Secret.reveal header_len))) `Seq.equal` (Seq.seq_hide fmt)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.fst", "name": "QUIC.Impl.payload_decrypt_pre", "original_source_type": "val payload_decrypt_pre\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header {~(Spec.is_retry gh)})\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n (m: HS.mem)\n : GTot Type0", "source_type": "val payload_decrypt_pre\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header {~(Spec.is_retry gh)})\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n (m: HS.mem)\n : GTot Type0", "source_definition": "let payload_decrypt_pre\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header { ~ (Spec.is_retry gh) })\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n (m: HS.mem)\n: GTot Type0\n=\n let fmt = SParse.format_header gh in\n\n B.all_disjoint [\n AEAD.footprint m s;\n B.loc_buffer siv;\n B.loc_buffer dst;\n ] /\\\n\n AEAD.invariant m s /\\\n B.live m siv /\\ B.length siv == 12 /\\\n Secret.v cipher_and_tag_len >= SAEAD.tag_length a /\\\n Secret.v hlen == Seq.length fmt /\\\n Secret.v hlen + Secret.v cipher_and_tag_len <= B.length dst /\\\n Secret.v cipher_and_tag_len < max_cipher_length /\\\n B.live m dst /\\\n pn_len == Spec.pn_length gh /\\\n pn == Spec.packet_number gh /\\\n B.as_seq m (B.gsub dst 0ul (Secret.reveal hlen)) `Seq.equal` Seq.seq_hide fmt", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 317, "start_col": 1, "end_line": 335, "end_col": 79 }, "file_context": "module QUIC.Impl\n\n// This MUST be kept in sync with QUIC.Impl.fsti...\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule IB = LowStar.ImmutableBuffer\nmodule Seq = QUIC.Secret.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\nmodule HST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\n\nfriend QUIC.Spec\n\nopen QUIC.Impl.Lemmas\n\nopen LowStar.BufferOps\n\n//module HeaderS = QUIC.Spec.Header\n//module HeaderI = QUIC.Impl.Header\n\n#set-options \"--z3rlimit 64 --query_stats\"\n\n#restart-solver\n\nmodule SAEAD = Spec.Agile.AEAD\nmodule SCipher = Spec.Agile.Cipher\nmodule SHKDF = Spec.Agile.HKDF\n\nmodule SecretBuffer = QUIC.Secret.Buffer\n\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nunfold\nlet iv_for_encrypt_decrypt_pre\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n B.all_disjoint [\n B.loc_buffer siv;\n B.loc_buffer dst;\n ] /\\\n B.live m siv /\\ B.length siv == 12 /\\\n B.live m dst /\\ B.length dst == 12 /\\\n pn_len == Spec.pn_length h /\\\n pn == Spec.packet_number h\n\nunfold\nlet iv_for_encrypt_decrypt_post\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n (m' : HS.mem)\n: GTot Type0\n=\n iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m /\\\n begin\n B.modifies (B.loc_buffer dst) m m' /\\\n B.as_seq m' dst `Seq.equal`\n Spec.iv_for_encrypt_decrypt a (B.as_seq m siv) h\n end\n\nlet iv_for_encrypt_decrypt\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n: HST.Stack unit\n (requires (fun m ->\n iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m\n ))\n (ensures (fun m _ m' ->\n iv_for_encrypt_decrypt_post a siv dst h pn_len pn m m'\n ))\n= let m0 = HST.get () in\n B.fill dst (Secret.to_u8 0uy) 12ul;\n let pnb_store = B.sub dst 4ul 8ul in\n SecretBuffer.store64_be pnb_store pn;\n let m2 = HST.get () in\n assert (Seq.seq_reveal (B.as_seq m2 (B.gsub dst 0ul 4ul)) `Seq.equal` Seq.create 4 0uy);\n assert (Seq.seq_reveal (B.as_seq m2 dst) `Seq.equal` (Seq.create 4 0uy `Seq.append` FStar.Endianness.n_to_be 8 (Secret.v pn)));\n QUIC.Impl.Lemmas.n_to_be_lower' 8 12 (Secret.v pn);\n assert (Seq.seq_reveal (B.as_seq m2 dst) == FStar.Endianness.n_to_be 12 (Secret.v pn));\n QUIC.Impl.Lemmas.op_inplace dst siv 12ul 0ul (Secret.logxor #Secret.U8 #Secret.SEC);\n QUIC.Impl.Lemmas.secret_xor_inplace_eq (B.as_seq m2 dst) (B.as_seq m2 siv) 0\n\nmodule SParse = QUIC.Spec.Header.Parse\n\nunfold\nlet payload_encrypt_pre\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32) // should be secret, because otherwise one can compute the packet number length\n (m: HS.mem)\n: GTot Type0\n=\n let fmt = SParse.format_header h in\n\n B.all_disjoint [\n AEAD.footprint m s;\n B.loc_buffer siv;\n B.loc_buffer dst;\n B.loc_buffer plain;\n ] /\\\n\n AEAD.invariant m s /\\\n B.live m siv /\\ B.length siv == 12 /\\\n Secret.v header_len == Seq.length fmt /\\\n B.live m dst /\\ B.length dst == Secret.v header_len + Secret.v plain_len + SAEAD.tag_length a /\\\n pn_len == Spec.pn_length h /\\\n pn == Spec.packet_number h /\\\n B.live m plain /\\ B.length plain == Secret.v plain_len /\\ 3 <= Secret.v plain_len /\\ Secret.v plain_len < max_plain_length /\\\n B.as_seq m (B.gsub dst 0ul (Secret.reveal header_len)) `Seq.equal` Seq.seq_hide fmt\n\nunfold\nlet payload_encrypt_post\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m' : HS.mem)\n: GTot Type0\n=\n let fmt = SParse.format_header h in\n payload_encrypt_pre a s siv dst h pn_len pn header_len plain plain_len m /\\\n B.modifies (B.loc_buffer (B.gsub dst (Secret.reveal header_len) (B.len dst ` U32.sub` Secret.reveal header_len)) `B.loc_union` AEAD.footprint m s) m m' /\\\n AEAD.invariant m' s /\\ AEAD.footprint m' s == AEAD.footprint m s /\\\n AEAD.preserves_freeable s m m' /\\\n AEAD.as_kv (B.deref m' s) == AEAD.as_kv (B.deref m s) /\\\n B.as_seq m' (B.gsub dst (Secret.reveal header_len) (B.len dst `U32.sub` Secret.reveal header_len)) `Seq.equal` Seq.seq_hide (Spec.payload_encrypt a (AEAD.as_kv (B.deref m s)) (B.as_seq m siv) h (Seq.seq_reveal (B.as_seq m plain))) /\\\n res == Success\n\nlet payload_encrypt\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n: HST.Stack error_code\n (requires (fun m ->\n payload_encrypt_pre a s siv dst h pn_len pn header_len plain plain_len m\n ))\n (ensures (fun m res m' ->\n payload_encrypt_post a s siv dst h pn_len pn header_len plain plain_len m res m'\n ))\n= \n let m0 = HST.get () in\n HST.push_frame ();\n let m1 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m1;\n let iv = B.alloca (Secret.to_u8 0uy) 12ul in\n\n (* EverCrypt currently does not support secret length encryption, so\n whenever we need to define the arguments to EverCrypt.AEAD.encrypt,\n we need to (locally there and only there) declassify the lengths of\n the aad, plain, cipher and tag buffers. *)\n let aad = B.sub dst 0ul (ADMITDeclassify.u32_to_UInt32 header_len) in\n let cipher = B.sub dst (ADMITDeclassify.u32_to_UInt32 header_len) (ADMITDeclassify.u32_to_UInt32 plain_len) in\n let tag = B.sub dst (ADMITDeclassify.u32_to_UInt32 (header_len `Secret.add` plain_len)) 16ul in\n\n iv_for_encrypt_decrypt a siv iv h pn_len pn;\n let res = AEAD.encrypt #a s iv 12ul aad (ADMITDeclassify.u32_to_UInt32 header_len) plain (ADMITDeclassify.u32_to_UInt32 plain_len) cipher tag in\n HST.pop_frame ();\n res\n\n#push-options \"--z3rlimit 128\"\n\nlet dummy = ()\n\nlet encrypt\n a aead siv ctr hpk dst h pn plain plain_len\n= let m0 = HST.get () in\n let gh = Ghost.hide (g_header h m0 pn) in\n let fmt = Ghost.hide (QUIC.Spec.Header.Parse.format_header gh) in\n let header_len = header_len h in\n QUIC.Impl.Header.Parse.header_len_correct h m0 pn;\n QUIC.Impl.Header.Base.header_len_v h;\n let isretry = is_retry h in\n\n (* Currently, EverParse needs the size of the destination buffer for\n writing, as a public integer, even though this is not strictly\n necessary. Since the serializers have no knowledge of the payload,\n and do not perform any declassification of the header sizes, we can\n pass the whole size of the destination buffer. *)\n QUIC.Impl.Header.Parse.write_header h pn dst\n (ADMITDeclassify.u32_to_UInt32 (header_len `Secret.add` (if isretry then Secret.to_u32 0ul else plain_len `Secret.add` Secret.to_u32 16ul)));\n\n if isretry\n then begin\n let dummy_pn_len = Secret.to_u32 1ul in\n let m3 = HST.get () in\n assert (\n Seq.slice (B.as_seq m3 dst) (Secret.v header_len) (B.length dst) `Seq.equal` Seq.seq_reveal (B.as_seq m0 plain)\n );\n QUIC.Impl.Header.header_encrypt a ctr hpk dst gh false true (public_header_len h) dummy_pn_len;\n let m4 = HST.get () in\n assert (B.as_seq m4 dst `Seq.equal` QUIC.Spec.Header.header_encrypt a (B.as_seq m0 hpk) gh (Seq.seq_reveal (B.as_seq m0 plain)));\n Success\n end\n else begin\n let m1 = HST.get () in\n let pn_len = pn_length h in\n let res = SecretBuffer.with_whole_buffer_hide_weak_modifies\n #error_code\n dst\n m1\n (AEAD.footprint m0 aead `B.loc_union`\n B.loc_buffer siv `B.loc_union`\n CTR.footprint m0 ctr `B.loc_union`\n B.loc_buffer hpk `B.loc_union`\n B.loc_buffer plain)\n (AEAD.footprint m0 aead)\n true\n (fun res cont m_ ->\n res == Success /\\\n cont `Seq.equal` (\n fmt `Seq.append`\n Spec.payload_encrypt a (AEAD.as_kv (B.deref m0 aead)) (B.as_seq m0 siv) (g_header h m0 pn) (Seq.seq_reveal (B.as_seq m0 plain))) /\\\n AEAD.invariant m_ aead /\\ AEAD.footprint m_ aead == AEAD.footprint m0 aead /\\\n AEAD.preserves_freeable aead m1 m_ /\\\n AEAD.as_kv (B.deref m_ aead) == AEAD.as_kv (B.deref m0 aead)\n )\n (fun _ bs -> \n let res = payload_encrypt a aead siv bs gh pn_len pn header_len plain plain_len in\n let m_ = HST.get () in\n assert (\n let cont = B.as_seq m_ bs in\n Seq.length fmt == Secret.v header_len /\\\n cont `Seq.equal` (Seq.slice cont 0 (Secret.v header_len) `Seq.append` Seq.slice cont (Secret.v header_len) (Seq.length cont))\n );\n res\n )\n in\n match res with\n | Success ->\n let m3 = HST.get () in\n assert (\n Seq.slice (B.as_seq m3 dst) (Secret.v header_len) (B.length dst) `Seq.equal` Spec.payload_encrypt a (AEAD.as_kv (B.deref m0 aead)) (B.as_seq m0 siv) gh (Seq.seq_reveal (B.as_seq m0 plain))\n );\n QUIC.Impl.Header.header_encrypt a ctr hpk dst gh (BShort? h) isretry (public_header_len h) pn_len;\n let m4 = HST.get () in\n assert (B.as_seq m4 dst `Seq.equal` QUIC.Spec.Header.header_encrypt a (B.as_seq m0 hpk) gh (Spec.payload_encrypt a (AEAD.as_kv (B.deref m0 aead)) (B.as_seq m0 siv) gh (Seq.seq_reveal (B.as_seq m0 plain))));\n res\n | _ ->\n assert False;\n res\n end\n\n#pop-options\n\nunfold\nlet payload_decrypt_pre\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header { ~ (Spec.is_retry gh) })\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n (m: HS.mem)", "dependencies": { "source_file": "QUIC.Impl.fst", "checked_file": "QUIC.Impl.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.Header.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "SParse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n s: EverCrypt.AEAD.state a ->\n siv: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n dst: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n gh:\n FStar.Ghost.erased QUIC.Spec.Header.Base.header\n {~(QUIC.Spec.Header.Base.is_retry (FStar.Ghost.reveal gh))} ->\n hlen: Lib.IntTypes.uint32 ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t ->\n cipher_and_tag_len: Lib.IntTypes.uint32 ->\n m: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "EverCrypt.AEAD.state", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "FStar.Ghost.erased", "QUIC.Spec.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Spec.Header.Base.is_retry", "FStar.Ghost.reveal", "Lib.IntTypes.uint32", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "FStar.Monotonic.HyperStack.mem", "Prims.l_and", "LowStar.Monotonic.Buffer.all_disjoint", "Prims.Cons", "LowStar.Monotonic.Buffer.loc", "EverCrypt.AEAD.footprint", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Buffer.trivial_preorder", "Prims.Nil", "EverCrypt.AEAD.invariant", "LowStar.Monotonic.Buffer.live", "Prims.eq2", "Prims.int", "LowStar.Monotonic.Buffer.length", "Prims.op_GreaterThanOrEqual", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "Spec.Agile.AEAD.tag_length", "Prims.l_or", "Lib.IntTypes.range", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "Prims.op_LessThanOrEqual", "Prims.op_Addition", "Prims.op_LessThan", "QUIC.Spec.Crypto.max_cipher_length", "QUIC.Spec.Header.Base.pn_length", "QUIC.Spec.Header.Base.packet_number", "FStar.Seq.Base.equal", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Buffer.gsub", "FStar.UInt32.__uint_to_t", "QUIC.Secret.Int.reveal", "QUIC.Secret.Seq.seq_hide", "Lib.IntTypes.U8", "QUIC.Spec.Base.lbytes", "QUIC.Spec.Header.Base.header_len", "QUIC.Spec.Header.Parse.format_header" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val payload_decrypt_pre\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header {~(Spec.is_retry gh)})\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n (m: HS.mem)\n : GTot Type0\nlet payload_decrypt_pre\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header {~(Spec.is_retry gh)})\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n (m: HS.mem)\n : GTot Type0 =", "completed_definiton": "let fmt = SParse.format_header gh in\nB.all_disjoint [AEAD.footprint m s; B.loc_buffer siv; B.loc_buffer dst] /\\ AEAD.invariant m s /\\\nB.live m siv /\\ B.length siv == 12 /\\ Secret.v cipher_and_tag_len >= SAEAD.tag_length a /\\\nSecret.v hlen == Seq.length fmt /\\ Secret.v hlen + Secret.v cipher_and_tag_len <= B.length dst /\\\nSecret.v cipher_and_tag_len < max_cipher_length /\\ B.live m dst /\\ pn_len == Spec.pn_length gh /\\\npn == Spec.packet_number gh /\\\n(B.as_seq m (B.gsub dst 0ul (Secret.reveal hlen))) `Seq.equal` (Seq.seq_hide fmt)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.fst", "name": "QUIC.Impl.iv_for_encrypt_decrypt_post", "original_source_type": "val iv_for_encrypt_decrypt_post\n (a: ea)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m m': HS.mem)\n : GTot Type0", "source_type": "val iv_for_encrypt_decrypt_post\n (a: ea)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m m': HS.mem)\n : GTot Type0", "source_definition": "let iv_for_encrypt_decrypt_post\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n (m' : HS.mem)\n: GTot Type0\n=\n iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m /\\\n begin\n B.modifies (B.loc_buffer dst) m m' /\\\n B.as_seq m' dst `Seq.equal`\n Spec.iv_for_encrypt_decrypt a (B.as_seq m siv) h\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 87, "start_col": 2, "end_line": 92, "end_col": 5 }, "file_context": "module QUIC.Impl\n\n// This MUST be kept in sync with QUIC.Impl.fsti...\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule IB = LowStar.ImmutableBuffer\nmodule Seq = QUIC.Secret.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\nmodule HST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\n\nfriend QUIC.Spec\n\nopen QUIC.Impl.Lemmas\n\nopen LowStar.BufferOps\n\n//module HeaderS = QUIC.Spec.Header\n//module HeaderI = QUIC.Impl.Header\n\n#set-options \"--z3rlimit 64 --query_stats\"\n\n#restart-solver\n\nmodule SAEAD = Spec.Agile.AEAD\nmodule SCipher = Spec.Agile.Cipher\nmodule SHKDF = Spec.Agile.HKDF\n\nmodule SecretBuffer = QUIC.Secret.Buffer\n\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nunfold\nlet iv_for_encrypt_decrypt_pre\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n B.all_disjoint [\n B.loc_buffer siv;\n B.loc_buffer dst;\n ] /\\\n B.live m siv /\\ B.length siv == 12 /\\\n B.live m dst /\\ B.length dst == 12 /\\\n pn_len == Spec.pn_length h /\\\n pn == Spec.packet_number h\n\nunfold\nlet iv_for_encrypt_decrypt_post\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n (m' : HS.mem)\n: GTot Type0", "dependencies": { "source_file": "QUIC.Impl.fst", "checked_file": "QUIC.Impl.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.Header.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n siv: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n dst: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n h:\n FStar.Ghost.erased QUIC.Spec.Header.Base.header\n {~(QUIC.Spec.Header.Base.is_retry (FStar.Ghost.reveal h))} ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t ->\n m: FStar.Monotonic.HyperStack.mem ->\n m': FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "FStar.Ghost.erased", "QUIC.Spec.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Spec.Header.Base.is_retry", "FStar.Ghost.reveal", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "FStar.Monotonic.HyperStack.mem", "Prims.l_and", "QUIC.Impl.iv_for_encrypt_decrypt_pre", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Buffer.trivial_preorder", "FStar.Seq.Base.equal", "LowStar.Monotonic.Buffer.as_seq", "QUIC.Spec.iv_for_encrypt_decrypt" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val iv_for_encrypt_decrypt_post\n (a: ea)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m m': HS.mem)\n : GTot Type0\nlet iv_for_encrypt_decrypt_post\n (a: ea)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m m': HS.mem)\n : GTot Type0 =", "completed_definiton": "iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m /\\\nB.modifies (B.loc_buffer dst) m m' /\\\n(B.as_seq m' dst)\n`Seq.equal`\n(Spec.iv_for_encrypt_decrypt a (B.as_seq m siv) h)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.fst", "name": "QUIC.Impl.payload_encrypt_post", "original_source_type": "val payload_encrypt_post\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m': HS.mem)\n : GTot Type0", "source_type": "val payload_encrypt_post\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m': HS.mem)\n : GTot Type0", "source_definition": "let payload_encrypt_post\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m' : HS.mem)\n: GTot Type0\n=\n let fmt = SParse.format_header h in\n payload_encrypt_pre a s siv dst h pn_len pn header_len plain plain_len m /\\\n B.modifies (B.loc_buffer (B.gsub dst (Secret.reveal header_len) (B.len dst ` U32.sub` Secret.reveal header_len)) `B.loc_union` AEAD.footprint m s) m m' /\\\n AEAD.invariant m' s /\\ AEAD.footprint m' s == AEAD.footprint m s /\\\n AEAD.preserves_freeable s m m' /\\\n AEAD.as_kv (B.deref m' s) == AEAD.as_kv (B.deref m s) /\\\n B.as_seq m' (B.gsub dst (Secret.reveal header_len) (B.len dst `U32.sub` Secret.reveal header_len)) `Seq.equal` Seq.seq_hide (Spec.payload_encrypt a (AEAD.as_kv (B.deref m s)) (B.as_seq m siv) h (Seq.seq_reveal (B.as_seq m plain))) /\\\n res == Success", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 171, "start_col": 1, "end_line": 179, "end_col": 16 }, "file_context": "module QUIC.Impl\n\n// This MUST be kept in sync with QUIC.Impl.fsti...\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule IB = LowStar.ImmutableBuffer\nmodule Seq = QUIC.Secret.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\nmodule HST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\n\nfriend QUIC.Spec\n\nopen QUIC.Impl.Lemmas\n\nopen LowStar.BufferOps\n\n//module HeaderS = QUIC.Spec.Header\n//module HeaderI = QUIC.Impl.Header\n\n#set-options \"--z3rlimit 64 --query_stats\"\n\n#restart-solver\n\nmodule SAEAD = Spec.Agile.AEAD\nmodule SCipher = Spec.Agile.Cipher\nmodule SHKDF = Spec.Agile.HKDF\n\nmodule SecretBuffer = QUIC.Secret.Buffer\n\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nunfold\nlet iv_for_encrypt_decrypt_pre\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n B.all_disjoint [\n B.loc_buffer siv;\n B.loc_buffer dst;\n ] /\\\n B.live m siv /\\ B.length siv == 12 /\\\n B.live m dst /\\ B.length dst == 12 /\\\n pn_len == Spec.pn_length h /\\\n pn == Spec.packet_number h\n\nunfold\nlet iv_for_encrypt_decrypt_post\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n (m' : HS.mem)\n: GTot Type0\n=\n iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m /\\\n begin\n B.modifies (B.loc_buffer dst) m m' /\\\n B.as_seq m' dst `Seq.equal`\n Spec.iv_for_encrypt_decrypt a (B.as_seq m siv) h\n end\n\nlet iv_for_encrypt_decrypt\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n: HST.Stack unit\n (requires (fun m ->\n iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m\n ))\n (ensures (fun m _ m' ->\n iv_for_encrypt_decrypt_post a siv dst h pn_len pn m m'\n ))\n= let m0 = HST.get () in\n B.fill dst (Secret.to_u8 0uy) 12ul;\n let pnb_store = B.sub dst 4ul 8ul in\n SecretBuffer.store64_be pnb_store pn;\n let m2 = HST.get () in\n assert (Seq.seq_reveal (B.as_seq m2 (B.gsub dst 0ul 4ul)) `Seq.equal` Seq.create 4 0uy);\n assert (Seq.seq_reveal (B.as_seq m2 dst) `Seq.equal` (Seq.create 4 0uy `Seq.append` FStar.Endianness.n_to_be 8 (Secret.v pn)));\n QUIC.Impl.Lemmas.n_to_be_lower' 8 12 (Secret.v pn);\n assert (Seq.seq_reveal (B.as_seq m2 dst) == FStar.Endianness.n_to_be 12 (Secret.v pn));\n QUIC.Impl.Lemmas.op_inplace dst siv 12ul 0ul (Secret.logxor #Secret.U8 #Secret.SEC);\n QUIC.Impl.Lemmas.secret_xor_inplace_eq (B.as_seq m2 dst) (B.as_seq m2 siv) 0\n\nmodule SParse = QUIC.Spec.Header.Parse\n\nunfold\nlet payload_encrypt_pre\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32) // should be secret, because otherwise one can compute the packet number length\n (m: HS.mem)\n: GTot Type0\n=\n let fmt = SParse.format_header h in\n\n B.all_disjoint [\n AEAD.footprint m s;\n B.loc_buffer siv;\n B.loc_buffer dst;\n B.loc_buffer plain;\n ] /\\\n\n AEAD.invariant m s /\\\n B.live m siv /\\ B.length siv == 12 /\\\n Secret.v header_len == Seq.length fmt /\\\n B.live m dst /\\ B.length dst == Secret.v header_len + Secret.v plain_len + SAEAD.tag_length a /\\\n pn_len == Spec.pn_length h /\\\n pn == Spec.packet_number h /\\\n B.live m plain /\\ B.length plain == Secret.v plain_len /\\ 3 <= Secret.v plain_len /\\ Secret.v plain_len < max_plain_length /\\\n B.as_seq m (B.gsub dst 0ul (Secret.reveal header_len)) `Seq.equal` Seq.seq_hide fmt\n\nunfold\nlet payload_encrypt_post\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m' : HS.mem)", "dependencies": { "source_file": "QUIC.Impl.fst", "checked_file": "QUIC.Impl.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.Header.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "SParse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n s: EverCrypt.AEAD.state a ->\n siv: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n dst: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n h:\n FStar.Ghost.erased QUIC.Spec.Header.Base.header\n {~(QUIC.Spec.Header.Base.is_retry (FStar.Ghost.reveal h))} ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t ->\n header_len: Lib.IntTypes.uint32 ->\n plain: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n plain_len: Lib.IntTypes.uint32 ->\n m: FStar.Monotonic.HyperStack.mem ->\n res: EverCrypt.Error.error_code ->\n m': FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "EverCrypt.AEAD.state", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "FStar.Ghost.erased", "QUIC.Spec.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Spec.Header.Base.is_retry", "FStar.Ghost.reveal", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Lib.IntTypes.uint32", "FStar.Monotonic.HyperStack.mem", "EverCrypt.Error.error_code", "Prims.l_and", "QUIC.Impl.payload_encrypt_pre", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Buffer.trivial_preorder", "LowStar.Buffer.gsub", "QUIC.Secret.Int.reveal", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "FStar.UInt32.sub", "LowStar.Monotonic.Buffer.len", "EverCrypt.AEAD.footprint", "EverCrypt.AEAD.invariant", "Prims.eq2", "LowStar.Monotonic.Buffer.loc", "EverCrypt.AEAD.preserves_freeable", "Spec.Agile.AEAD.kv", "EverCrypt.AEAD.as_kv", "LowStar.Monotonic.Buffer.deref", "EverCrypt.AEAD.state_s", "FStar.Seq.Base.equal", "LowStar.Monotonic.Buffer.as_seq", "QUIC.Secret.Seq.seq_hide", "Lib.IntTypes.U8", "QUIC.Spec.payload_encrypt", "QUIC.Secret.Seq.seq_reveal", "EverCrypt.Error.Success", "QUIC.Spec.Base.lbytes", "QUIC.Spec.Header.Base.header_len", "QUIC.Spec.Header.Parse.format_header" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val payload_encrypt_post\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m': HS.mem)\n : GTot Type0\nlet payload_encrypt_post\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m': HS.mem)\n : GTot Type0 =", "completed_definiton": "let fmt = SParse.format_header h in\npayload_encrypt_pre a s siv dst h pn_len pn header_len plain plain_len m /\\\nB.modifies ((B.loc_buffer (B.gsub dst\n (Secret.reveal header_len)\n ((B.len dst) `U32.sub` (Secret.reveal header_len))))\n `B.loc_union`\n (AEAD.footprint m s))\n m\n m' /\\ AEAD.invariant m' s /\\ AEAD.footprint m' s == AEAD.footprint m s /\\\nAEAD.preserves_freeable s m m' /\\ AEAD.as_kv (B.deref m' s) == AEAD.as_kv (B.deref m s) /\\\n(B.as_seq m'\n (B.gsub dst (Secret.reveal header_len) ((B.len dst) `U32.sub` (Secret.reveal header_len))))\n`Seq.equal`\n(Seq.seq_hide (Spec.payload_encrypt a\n (AEAD.as_kv (B.deref m s))\n (B.as_seq m siv)\n h\n (Seq.seq_reveal (B.as_seq m plain)))) /\\ res == Success", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.fst", "name": "QUIC.Impl.payload_decrypt_post", "original_source_type": "val payload_decrypt_post\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header {~(Spec.is_retry gh)})\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m': HS.mem)\n : GTot Type0", "source_type": "val payload_decrypt_post\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header {~(Spec.is_retry gh)})\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m': HS.mem)\n : GTot Type0", "source_definition": "let payload_decrypt_post\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header { ~ (Spec.is_retry gh) })\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m' : HS.mem)\n: GTot Type0\n=\n payload_decrypt_pre a s siv dst gh hlen pn_len pn cipher_and_tag_len m /\\\n begin\n let bplain = B.gsub dst (Secret.reveal hlen) (Secret.reveal cipher_and_tag_len `U32.sub` U32.uint_to_t (SAEAD.tag_length a)) in\n B.modifies (B.loc_buffer bplain `B.loc_union` AEAD.footprint m s) m m' /\\\n AEAD.invariant m' s /\\ AEAD.footprint m' s == AEAD.footprint m s /\\\n AEAD.preserves_freeable s m m' /\\\n AEAD.as_kv (B.deref m' s) == AEAD.as_kv (B.deref m s) /\\\n begin match res, Spec.payload_decrypt a (AEAD.as_kv (B.deref m s)) (B.as_seq m siv) gh (B.as_seq m (B.gsub dst (Secret.reveal hlen) (Secret.reveal cipher_and_tag_len))) with\n | Success, Some plain ->\n B.as_seq m' bplain `Seq.equal` plain\n | AuthenticationFailure, None -> True\n | _ -> False\n end\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 353, "start_col": 2, "end_line": 366, "end_col": 5 }, "file_context": "module QUIC.Impl\n\n// This MUST be kept in sync with QUIC.Impl.fsti...\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule IB = LowStar.ImmutableBuffer\nmodule Seq = QUIC.Secret.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\nmodule HST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\n\nfriend QUIC.Spec\n\nopen QUIC.Impl.Lemmas\n\nopen LowStar.BufferOps\n\n//module HeaderS = QUIC.Spec.Header\n//module HeaderI = QUIC.Impl.Header\n\n#set-options \"--z3rlimit 64 --query_stats\"\n\n#restart-solver\n\nmodule SAEAD = Spec.Agile.AEAD\nmodule SCipher = Spec.Agile.Cipher\nmodule SHKDF = Spec.Agile.HKDF\n\nmodule SecretBuffer = QUIC.Secret.Buffer\n\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nunfold\nlet iv_for_encrypt_decrypt_pre\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n B.all_disjoint [\n B.loc_buffer siv;\n B.loc_buffer dst;\n ] /\\\n B.live m siv /\\ B.length siv == 12 /\\\n B.live m dst /\\ B.length dst == 12 /\\\n pn_len == Spec.pn_length h /\\\n pn == Spec.packet_number h\n\nunfold\nlet iv_for_encrypt_decrypt_post\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n (m' : HS.mem)\n: GTot Type0\n=\n iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m /\\\n begin\n B.modifies (B.loc_buffer dst) m m' /\\\n B.as_seq m' dst `Seq.equal`\n Spec.iv_for_encrypt_decrypt a (B.as_seq m siv) h\n end\n\nlet iv_for_encrypt_decrypt\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n: HST.Stack unit\n (requires (fun m ->\n iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m\n ))\n (ensures (fun m _ m' ->\n iv_for_encrypt_decrypt_post a siv dst h pn_len pn m m'\n ))\n= let m0 = HST.get () in\n B.fill dst (Secret.to_u8 0uy) 12ul;\n let pnb_store = B.sub dst 4ul 8ul in\n SecretBuffer.store64_be pnb_store pn;\n let m2 = HST.get () in\n assert (Seq.seq_reveal (B.as_seq m2 (B.gsub dst 0ul 4ul)) `Seq.equal` Seq.create 4 0uy);\n assert (Seq.seq_reveal (B.as_seq m2 dst) `Seq.equal` (Seq.create 4 0uy `Seq.append` FStar.Endianness.n_to_be 8 (Secret.v pn)));\n QUIC.Impl.Lemmas.n_to_be_lower' 8 12 (Secret.v pn);\n assert (Seq.seq_reveal (B.as_seq m2 dst) == FStar.Endianness.n_to_be 12 (Secret.v pn));\n QUIC.Impl.Lemmas.op_inplace dst siv 12ul 0ul (Secret.logxor #Secret.U8 #Secret.SEC);\n QUIC.Impl.Lemmas.secret_xor_inplace_eq (B.as_seq m2 dst) (B.as_seq m2 siv) 0\n\nmodule SParse = QUIC.Spec.Header.Parse\n\nunfold\nlet payload_encrypt_pre\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32) // should be secret, because otherwise one can compute the packet number length\n (m: HS.mem)\n: GTot Type0\n=\n let fmt = SParse.format_header h in\n\n B.all_disjoint [\n AEAD.footprint m s;\n B.loc_buffer siv;\n B.loc_buffer dst;\n B.loc_buffer plain;\n ] /\\\n\n AEAD.invariant m s /\\\n B.live m siv /\\ B.length siv == 12 /\\\n Secret.v header_len == Seq.length fmt /\\\n B.live m dst /\\ B.length dst == Secret.v header_len + Secret.v plain_len + SAEAD.tag_length a /\\\n pn_len == Spec.pn_length h /\\\n pn == Spec.packet_number h /\\\n B.live m plain /\\ B.length plain == Secret.v plain_len /\\ 3 <= Secret.v plain_len /\\ Secret.v plain_len < max_plain_length /\\\n B.as_seq m (B.gsub dst 0ul (Secret.reveal header_len)) `Seq.equal` Seq.seq_hide fmt\n\nunfold\nlet payload_encrypt_post\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m' : HS.mem)\n: GTot Type0\n=\n let fmt = SParse.format_header h in\n payload_encrypt_pre a s siv dst h pn_len pn header_len plain plain_len m /\\\n B.modifies (B.loc_buffer (B.gsub dst (Secret.reveal header_len) (B.len dst ` U32.sub` Secret.reveal header_len)) `B.loc_union` AEAD.footprint m s) m m' /\\\n AEAD.invariant m' s /\\ AEAD.footprint m' s == AEAD.footprint m s /\\\n AEAD.preserves_freeable s m m' /\\\n AEAD.as_kv (B.deref m' s) == AEAD.as_kv (B.deref m s) /\\\n B.as_seq m' (B.gsub dst (Secret.reveal header_len) (B.len dst `U32.sub` Secret.reveal header_len)) `Seq.equal` Seq.seq_hide (Spec.payload_encrypt a (AEAD.as_kv (B.deref m s)) (B.as_seq m siv) h (Seq.seq_reveal (B.as_seq m plain))) /\\\n res == Success\n\nlet payload_encrypt\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n: HST.Stack error_code\n (requires (fun m ->\n payload_encrypt_pre a s siv dst h pn_len pn header_len plain plain_len m\n ))\n (ensures (fun m res m' ->\n payload_encrypt_post a s siv dst h pn_len pn header_len plain plain_len m res m'\n ))\n= \n let m0 = HST.get () in\n HST.push_frame ();\n let m1 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m1;\n let iv = B.alloca (Secret.to_u8 0uy) 12ul in\n\n (* EverCrypt currently does not support secret length encryption, so\n whenever we need to define the arguments to EverCrypt.AEAD.encrypt,\n we need to (locally there and only there) declassify the lengths of\n the aad, plain, cipher and tag buffers. *)\n let aad = B.sub dst 0ul (ADMITDeclassify.u32_to_UInt32 header_len) in\n let cipher = B.sub dst (ADMITDeclassify.u32_to_UInt32 header_len) (ADMITDeclassify.u32_to_UInt32 plain_len) in\n let tag = B.sub dst (ADMITDeclassify.u32_to_UInt32 (header_len `Secret.add` plain_len)) 16ul in\n\n iv_for_encrypt_decrypt a siv iv h pn_len pn;\n let res = AEAD.encrypt #a s iv 12ul aad (ADMITDeclassify.u32_to_UInt32 header_len) plain (ADMITDeclassify.u32_to_UInt32 plain_len) cipher tag in\n HST.pop_frame ();\n res\n\n#push-options \"--z3rlimit 128\"\n\nlet dummy = ()\n\nlet encrypt\n a aead siv ctr hpk dst h pn plain plain_len\n= let m0 = HST.get () in\n let gh = Ghost.hide (g_header h m0 pn) in\n let fmt = Ghost.hide (QUIC.Spec.Header.Parse.format_header gh) in\n let header_len = header_len h in\n QUIC.Impl.Header.Parse.header_len_correct h m0 pn;\n QUIC.Impl.Header.Base.header_len_v h;\n let isretry = is_retry h in\n\n (* Currently, EverParse needs the size of the destination buffer for\n writing, as a public integer, even though this is not strictly\n necessary. Since the serializers have no knowledge of the payload,\n and do not perform any declassification of the header sizes, we can\n pass the whole size of the destination buffer. *)\n QUIC.Impl.Header.Parse.write_header h pn dst\n (ADMITDeclassify.u32_to_UInt32 (header_len `Secret.add` (if isretry then Secret.to_u32 0ul else plain_len `Secret.add` Secret.to_u32 16ul)));\n\n if isretry\n then begin\n let dummy_pn_len = Secret.to_u32 1ul in\n let m3 = HST.get () in\n assert (\n Seq.slice (B.as_seq m3 dst) (Secret.v header_len) (B.length dst) `Seq.equal` Seq.seq_reveal (B.as_seq m0 plain)\n );\n QUIC.Impl.Header.header_encrypt a ctr hpk dst gh false true (public_header_len h) dummy_pn_len;\n let m4 = HST.get () in\n assert (B.as_seq m4 dst `Seq.equal` QUIC.Spec.Header.header_encrypt a (B.as_seq m0 hpk) gh (Seq.seq_reveal (B.as_seq m0 plain)));\n Success\n end\n else begin\n let m1 = HST.get () in\n let pn_len = pn_length h in\n let res = SecretBuffer.with_whole_buffer_hide_weak_modifies\n #error_code\n dst\n m1\n (AEAD.footprint m0 aead `B.loc_union`\n B.loc_buffer siv `B.loc_union`\n CTR.footprint m0 ctr `B.loc_union`\n B.loc_buffer hpk `B.loc_union`\n B.loc_buffer plain)\n (AEAD.footprint m0 aead)\n true\n (fun res cont m_ ->\n res == Success /\\\n cont `Seq.equal` (\n fmt `Seq.append`\n Spec.payload_encrypt a (AEAD.as_kv (B.deref m0 aead)) (B.as_seq m0 siv) (g_header h m0 pn) (Seq.seq_reveal (B.as_seq m0 plain))) /\\\n AEAD.invariant m_ aead /\\ AEAD.footprint m_ aead == AEAD.footprint m0 aead /\\\n AEAD.preserves_freeable aead m1 m_ /\\\n AEAD.as_kv (B.deref m_ aead) == AEAD.as_kv (B.deref m0 aead)\n )\n (fun _ bs -> \n let res = payload_encrypt a aead siv bs gh pn_len pn header_len plain plain_len in\n let m_ = HST.get () in\n assert (\n let cont = B.as_seq m_ bs in\n Seq.length fmt == Secret.v header_len /\\\n cont `Seq.equal` (Seq.slice cont 0 (Secret.v header_len) `Seq.append` Seq.slice cont (Secret.v header_len) (Seq.length cont))\n );\n res\n )\n in\n match res with\n | Success ->\n let m3 = HST.get () in\n assert (\n Seq.slice (B.as_seq m3 dst) (Secret.v header_len) (B.length dst) `Seq.equal` Spec.payload_encrypt a (AEAD.as_kv (B.deref m0 aead)) (B.as_seq m0 siv) gh (Seq.seq_reveal (B.as_seq m0 plain))\n );\n QUIC.Impl.Header.header_encrypt a ctr hpk dst gh (BShort? h) isretry (public_header_len h) pn_len;\n let m4 = HST.get () in\n assert (B.as_seq m4 dst `Seq.equal` QUIC.Spec.Header.header_encrypt a (B.as_seq m0 hpk) gh (Spec.payload_encrypt a (AEAD.as_kv (B.deref m0 aead)) (B.as_seq m0 siv) gh (Seq.seq_reveal (B.as_seq m0 plain))));\n res\n | _ ->\n assert False;\n res\n end\n\n#pop-options\n\nunfold\nlet payload_decrypt_pre\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header { ~ (Spec.is_retry gh) })\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n (m: HS.mem)\n: GTot Type0\n=\n let fmt = SParse.format_header gh in\n\n B.all_disjoint [\n AEAD.footprint m s;\n B.loc_buffer siv;\n B.loc_buffer dst;\n ] /\\\n\n AEAD.invariant m s /\\\n B.live m siv /\\ B.length siv == 12 /\\\n Secret.v cipher_and_tag_len >= SAEAD.tag_length a /\\\n Secret.v hlen == Seq.length fmt /\\\n Secret.v hlen + Secret.v cipher_and_tag_len <= B.length dst /\\\n Secret.v cipher_and_tag_len < max_cipher_length /\\\n B.live m dst /\\\n pn_len == Spec.pn_length gh /\\\n pn == Spec.packet_number gh /\\\n B.as_seq m (B.gsub dst 0ul (Secret.reveal hlen)) `Seq.equal` Seq.seq_hide fmt\n\nunfold\nlet payload_decrypt_post\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header { ~ (Spec.is_retry gh) })\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m' : HS.mem)\n: GTot Type0", "dependencies": { "source_file": "QUIC.Impl.fst", "checked_file": "QUIC.Impl.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.Header.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "SParse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n s: EverCrypt.AEAD.state a ->\n siv: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n dst: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n gh:\n FStar.Ghost.erased QUIC.Spec.Header.Base.header\n {~(QUIC.Spec.Header.Base.is_retry (FStar.Ghost.reveal gh))} ->\n hlen: Lib.IntTypes.uint32 ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t ->\n cipher_and_tag_len: Lib.IntTypes.uint32 ->\n m: FStar.Monotonic.HyperStack.mem ->\n res: EverCrypt.Error.error_code ->\n m': FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "EverCrypt.AEAD.state", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "FStar.Ghost.erased", "QUIC.Spec.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Spec.Header.Base.is_retry", "FStar.Ghost.reveal", "Lib.IntTypes.uint32", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "FStar.Monotonic.HyperStack.mem", "EverCrypt.Error.error_code", "Prims.l_and", "QUIC.Impl.payload_decrypt_pre", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Buffer.trivial_preorder", "EverCrypt.AEAD.footprint", "EverCrypt.AEAD.invariant", "Prims.eq2", "LowStar.Monotonic.Buffer.loc", "EverCrypt.AEAD.preserves_freeable", "Spec.Agile.AEAD.kv", "EverCrypt.AEAD.as_kv", "LowStar.Monotonic.Buffer.deref", "EverCrypt.AEAD.state_s", "FStar.Pervasives.Native.Mktuple2", "FStar.Pervasives.Native.option", "Spec.Agile.AEAD.decrypted", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Buffer.gsub", "QUIC.Secret.Int.reveal", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "QUIC.Spec.payload_decrypt", "FStar.Seq.Base.equal", "Prims.l_True", "FStar.Pervasives.Native.tuple2", "Prims.l_False", "Prims.logical", "LowStar.Monotonic.Buffer.mbuffer", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "FStar.UInt32.sub", "FStar.UInt32.uint_to_t", "Spec.Agile.AEAD.tag_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val payload_decrypt_post\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header {~(Spec.is_retry gh)})\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m': HS.mem)\n : GTot Type0\nlet payload_decrypt_post\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header {~(Spec.is_retry gh)})\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m': HS.mem)\n : GTot Type0 =", "completed_definiton": "payload_decrypt_pre a s siv dst gh hlen pn_len pn cipher_and_tag_len m /\\\n(let bplain =\n B.gsub dst\n (Secret.reveal hlen)\n ((Secret.reveal cipher_and_tag_len) `U32.sub` (U32.uint_to_t (SAEAD.tag_length a)))\n in\n B.modifies ((B.loc_buffer bplain) `B.loc_union` (AEAD.footprint m s)) m m' /\\ AEAD.invariant m' s /\\\n AEAD.footprint m' s == AEAD.footprint m s /\\ AEAD.preserves_freeable s m m' /\\\n AEAD.as_kv (B.deref m' s) == AEAD.as_kv (B.deref m s) /\\\n (match\n res,\n Spec.payload_decrypt a\n (AEAD.as_kv (B.deref m s))\n (B.as_seq m siv)\n gh\n (B.as_seq m (B.gsub dst (Secret.reveal hlen) (Secret.reveal cipher_and_tag_len)))\n with\n | Success, Some plain -> (B.as_seq m' bplain) `Seq.equal` plain\n | AuthenticationFailure, None -> True\n | _ -> False))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.fst", "name": "QUIC.Impl.iv_for_encrypt_decrypt", "original_source_type": "val iv_for_encrypt_decrypt\n (a: ea)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n : HST.Stack unit\n (requires (fun m -> iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m))\n (ensures (fun m _ m' -> iv_for_encrypt_decrypt_post a siv dst h pn_len pn m m'))", "source_type": "val iv_for_encrypt_decrypt\n (a: ea)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n : HST.Stack unit\n (requires (fun m -> iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m))\n (ensures (fun m _ m' -> iv_for_encrypt_decrypt_post a siv dst h pn_len pn m m'))", "source_definition": "let iv_for_encrypt_decrypt\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n: HST.Stack unit\n (requires (fun m ->\n iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m\n ))\n (ensures (fun m _ m' ->\n iv_for_encrypt_decrypt_post a siv dst h pn_len pn m m'\n ))\n= let m0 = HST.get () in\n B.fill dst (Secret.to_u8 0uy) 12ul;\n let pnb_store = B.sub dst 4ul 8ul in\n SecretBuffer.store64_be pnb_store pn;\n let m2 = HST.get () in\n assert (Seq.seq_reveal (B.as_seq m2 (B.gsub dst 0ul 4ul)) `Seq.equal` Seq.create 4 0uy);\n assert (Seq.seq_reveal (B.as_seq m2 dst) `Seq.equal` (Seq.create 4 0uy `Seq.append` FStar.Endianness.n_to_be 8 (Secret.v pn)));\n QUIC.Impl.Lemmas.n_to_be_lower' 8 12 (Secret.v pn);\n assert (Seq.seq_reveal (B.as_seq m2 dst) == FStar.Endianness.n_to_be 12 (Secret.v pn));\n QUIC.Impl.Lemmas.op_inplace dst siv 12ul 0ul (Secret.logxor #Secret.U8 #Secret.SEC);\n QUIC.Impl.Lemmas.secret_xor_inplace_eq (B.as_seq m2 dst) (B.as_seq m2 siv) 0", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 108, "start_col": 1, "end_line": 118, "end_col": 78 }, "file_context": "module QUIC.Impl\n\n// This MUST be kept in sync with QUIC.Impl.fsti...\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule IB = LowStar.ImmutableBuffer\nmodule Seq = QUIC.Secret.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\nmodule HST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\n\nfriend QUIC.Spec\n\nopen QUIC.Impl.Lemmas\n\nopen LowStar.BufferOps\n\n//module HeaderS = QUIC.Spec.Header\n//module HeaderI = QUIC.Impl.Header\n\n#set-options \"--z3rlimit 64 --query_stats\"\n\n#restart-solver\n\nmodule SAEAD = Spec.Agile.AEAD\nmodule SCipher = Spec.Agile.Cipher\nmodule SHKDF = Spec.Agile.HKDF\n\nmodule SecretBuffer = QUIC.Secret.Buffer\n\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nunfold\nlet iv_for_encrypt_decrypt_pre\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n B.all_disjoint [\n B.loc_buffer siv;\n B.loc_buffer dst;\n ] /\\\n B.live m siv /\\ B.length siv == 12 /\\\n B.live m dst /\\ B.length dst == 12 /\\\n pn_len == Spec.pn_length h /\\\n pn == Spec.packet_number h\n\nunfold\nlet iv_for_encrypt_decrypt_post\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n (m' : HS.mem)\n: GTot Type0\n=\n iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m /\\\n begin\n B.modifies (B.loc_buffer dst) m m' /\\\n B.as_seq m' dst `Seq.equal`\n Spec.iv_for_encrypt_decrypt a (B.as_seq m siv) h\n end\n\nlet iv_for_encrypt_decrypt\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n: HST.Stack unit\n (requires (fun m ->\n iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m\n ))\n (ensures (fun m _ m' ->\n iv_for_encrypt_decrypt_post a siv dst h pn_len pn m m'", "dependencies": { "source_file": "QUIC.Impl.fst", "checked_file": "QUIC.Impl.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.Header.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n siv: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n dst: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n h:\n FStar.Ghost.erased QUIC.Spec.Header.Base.header\n {~(QUIC.Spec.Header.Base.is_retry (FStar.Ghost.reveal h))} ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "FStar.Ghost.erased", "QUIC.Spec.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Spec.Header.Base.is_retry", "FStar.Ghost.reveal", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "QUIC.Impl.Lemmas.secret_xor_inplace_eq", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Buffer.trivial_preorder", "Prims.unit", "QUIC.Impl.Lemmas.op_inplace", "FStar.UInt32.__uint_to_t", "Lib.IntTypes.logxor", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "Prims._assert", "Prims.eq2", "FStar.Seq.Base.seq", "FStar.UInt8.t", "QUIC.Secret.Seq.seq_reveal", "FStar.Endianness.n_to_be", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U64", "QUIC.Impl.Lemmas.n_to_be_lower'", "FStar.Seq.Base.equal", "Lib.IntTypes.uint_t", "Lib.IntTypes.PUB", "FStar.Seq.Base.append", "FStar.Seq.Base.create", "FStar.UInt8.__uint_to_t", "LowStar.Buffer.gsub", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "QUIC.Secret.Buffer.store64_be", "LowStar.Monotonic.Buffer.mbuffer", "Lib.IntTypes.int_t", "LowStar.Buffer.sub", "FStar.Ghost.hide", "FStar.UInt32.t", "LowStar.Monotonic.Buffer.fill", "Lib.IntTypes.to_u8", "Lib.IntTypes.U1", "QUIC.Impl.iv_for_encrypt_decrypt_pre", "QUIC.Impl.iv_for_encrypt_decrypt_post" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val iv_for_encrypt_decrypt\n (a: ea)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n : HST.Stack unit\n (requires (fun m -> iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m))\n (ensures (fun m _ m' -> iv_for_encrypt_decrypt_post a siv dst h pn_len pn m m'))\nlet iv_for_encrypt_decrypt\n (a: ea)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n : HST.Stack unit\n (requires (fun m -> iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m))\n (ensures (fun m _ m' -> iv_for_encrypt_decrypt_post a siv dst h pn_len pn m m')) =", "completed_definiton": "let m0 = HST.get () in\nB.fill dst (Secret.to_u8 0uy) 12ul;\nlet pnb_store = B.sub dst 4ul 8ul in\nSecretBuffer.store64_be pnb_store pn;\nlet m2 = HST.get () in\nassert ((Seq.seq_reveal (B.as_seq m2 (B.gsub dst 0ul 4ul))) `Seq.equal` (Seq.create 4 0uy));\nassert ((Seq.seq_reveal (B.as_seq m2 dst))\n `Seq.equal`\n ((Seq.create 4 0uy) `Seq.append` (FStar.Endianness.n_to_be 8 (Secret.v pn))));\nQUIC.Impl.Lemmas.n_to_be_lower' 8 12 (Secret.v pn);\nassert (Seq.seq_reveal (B.as_seq m2 dst) == FStar.Endianness.n_to_be 12 (Secret.v pn));\nQUIC.Impl.Lemmas.op_inplace dst siv 12ul 0ul (Secret.logxor #Secret.U8 #Secret.SEC);\nQUIC.Impl.Lemmas.secret_xor_inplace_eq (B.as_seq m2 dst) (B.as_seq m2 siv) 0", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.fst", "name": "QUIC.Impl.payload_decrypt", "original_source_type": "val payload_decrypt\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header {~(Spec.is_retry gh)})\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n : HST.Stack error_code\n (requires (fun m -> payload_decrypt_pre a s siv dst gh hlen pn_len pn cipher_and_tag_len m))\n (ensures\n (fun m res m' ->\n payload_decrypt_post a s siv dst gh hlen pn_len pn cipher_and_tag_len m res m'))", "source_type": "val payload_decrypt\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header {~(Spec.is_retry gh)})\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n : HST.Stack error_code\n (requires (fun m -> payload_decrypt_pre a s siv dst gh hlen pn_len pn cipher_and_tag_len m))\n (ensures\n (fun m res m' ->\n payload_decrypt_post a s siv dst gh hlen pn_len pn cipher_and_tag_len m res m'))", "source_definition": "let payload_decrypt\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header { ~ (Spec.is_retry gh) })\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n: HST.Stack error_code\n (requires (fun m ->\n payload_decrypt_pre a s siv dst gh hlen pn_len pn cipher_and_tag_len m\n ))\n (ensures (fun m res m' ->\n payload_decrypt_post a s siv dst gh hlen pn_len pn cipher_and_tag_len m res m'\n ))\n= \n let m0 = HST.get () in\n HST.push_frame ();\n let m1 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m1;\n let iv = B.alloca (Secret.to_u8 0uy) 12ul in\n let cipher_len = cipher_and_tag_len `Secret.usub` Secret.hide 16ul in\n\n (* EverCrypt currently does not support secret length encryption, so\n whenever we need to define the arguments to EverCrypt.AEAD.encrypt,\n we need to (locally there and only there) declassify the lengths of\n the aad, plain, cipher and tag buffers. *)\n let aad = B.sub dst 0ul (ADMITDeclassify.u32_to_UInt32 hlen) in\n let cipher = B.sub dst (ADMITDeclassify.u32_to_UInt32 hlen) (ADMITDeclassify.u32_to_UInt32 cipher_len) in\n let tag = B.sub dst (ADMITDeclassify.u32_to_UInt32 (hlen `Secret.add` cipher_len)) 16ul in\n\n iv_for_encrypt_decrypt a siv iv gh pn_len pn;\n let res = AEAD.decrypt #a s iv 12ul aad (ADMITDeclassify.u32_to_UInt32 hlen) cipher (ADMITDeclassify.u32_to_UInt32 cipher_len) tag cipher in\n assert (B.as_seq m0 (B.gsub dst (Secret.reveal hlen) (Secret.reveal cipher_and_tag_len)) `Seq.equal` (B.as_seq m0 cipher `Seq.append` B.as_seq m0 tag));\n HST.pop_frame ();\n res", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 385, "start_col": 1, "end_line": 405, "end_col": 5 }, "file_context": "module QUIC.Impl\n\n// This MUST be kept in sync with QUIC.Impl.fsti...\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule IB = LowStar.ImmutableBuffer\nmodule Seq = QUIC.Secret.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\nmodule HST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\n\nfriend QUIC.Spec\n\nopen QUIC.Impl.Lemmas\n\nopen LowStar.BufferOps\n\n//module HeaderS = QUIC.Spec.Header\n//module HeaderI = QUIC.Impl.Header\n\n#set-options \"--z3rlimit 64 --query_stats\"\n\n#restart-solver\n\nmodule SAEAD = Spec.Agile.AEAD\nmodule SCipher = Spec.Agile.Cipher\nmodule SHKDF = Spec.Agile.HKDF\n\nmodule SecretBuffer = QUIC.Secret.Buffer\n\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nunfold\nlet iv_for_encrypt_decrypt_pre\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n B.all_disjoint [\n B.loc_buffer siv;\n B.loc_buffer dst;\n ] /\\\n B.live m siv /\\ B.length siv == 12 /\\\n B.live m dst /\\ B.length dst == 12 /\\\n pn_len == Spec.pn_length h /\\\n pn == Spec.packet_number h\n\nunfold\nlet iv_for_encrypt_decrypt_post\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n (m' : HS.mem)\n: GTot Type0\n=\n iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m /\\\n begin\n B.modifies (B.loc_buffer dst) m m' /\\\n B.as_seq m' dst `Seq.equal`\n Spec.iv_for_encrypt_decrypt a (B.as_seq m siv) h\n end\n\nlet iv_for_encrypt_decrypt\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n: HST.Stack unit\n (requires (fun m ->\n iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m\n ))\n (ensures (fun m _ m' ->\n iv_for_encrypt_decrypt_post a siv dst h pn_len pn m m'\n ))\n= let m0 = HST.get () in\n B.fill dst (Secret.to_u8 0uy) 12ul;\n let pnb_store = B.sub dst 4ul 8ul in\n SecretBuffer.store64_be pnb_store pn;\n let m2 = HST.get () in\n assert (Seq.seq_reveal (B.as_seq m2 (B.gsub dst 0ul 4ul)) `Seq.equal` Seq.create 4 0uy);\n assert (Seq.seq_reveal (B.as_seq m2 dst) `Seq.equal` (Seq.create 4 0uy `Seq.append` FStar.Endianness.n_to_be 8 (Secret.v pn)));\n QUIC.Impl.Lemmas.n_to_be_lower' 8 12 (Secret.v pn);\n assert (Seq.seq_reveal (B.as_seq m2 dst) == FStar.Endianness.n_to_be 12 (Secret.v pn));\n QUIC.Impl.Lemmas.op_inplace dst siv 12ul 0ul (Secret.logxor #Secret.U8 #Secret.SEC);\n QUIC.Impl.Lemmas.secret_xor_inplace_eq (B.as_seq m2 dst) (B.as_seq m2 siv) 0\n\nmodule SParse = QUIC.Spec.Header.Parse\n\nunfold\nlet payload_encrypt_pre\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32) // should be secret, because otherwise one can compute the packet number length\n (m: HS.mem)\n: GTot Type0\n=\n let fmt = SParse.format_header h in\n\n B.all_disjoint [\n AEAD.footprint m s;\n B.loc_buffer siv;\n B.loc_buffer dst;\n B.loc_buffer plain;\n ] /\\\n\n AEAD.invariant m s /\\\n B.live m siv /\\ B.length siv == 12 /\\\n Secret.v header_len == Seq.length fmt /\\\n B.live m dst /\\ B.length dst == Secret.v header_len + Secret.v plain_len + SAEAD.tag_length a /\\\n pn_len == Spec.pn_length h /\\\n pn == Spec.packet_number h /\\\n B.live m plain /\\ B.length plain == Secret.v plain_len /\\ 3 <= Secret.v plain_len /\\ Secret.v plain_len < max_plain_length /\\\n B.as_seq m (B.gsub dst 0ul (Secret.reveal header_len)) `Seq.equal` Seq.seq_hide fmt\n\nunfold\nlet payload_encrypt_post\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m' : HS.mem)\n: GTot Type0\n=\n let fmt = SParse.format_header h in\n payload_encrypt_pre a s siv dst h pn_len pn header_len plain plain_len m /\\\n B.modifies (B.loc_buffer (B.gsub dst (Secret.reveal header_len) (B.len dst ` U32.sub` Secret.reveal header_len)) `B.loc_union` AEAD.footprint m s) m m' /\\\n AEAD.invariant m' s /\\ AEAD.footprint m' s == AEAD.footprint m s /\\\n AEAD.preserves_freeable s m m' /\\\n AEAD.as_kv (B.deref m' s) == AEAD.as_kv (B.deref m s) /\\\n B.as_seq m' (B.gsub dst (Secret.reveal header_len) (B.len dst `U32.sub` Secret.reveal header_len)) `Seq.equal` Seq.seq_hide (Spec.payload_encrypt a (AEAD.as_kv (B.deref m s)) (B.as_seq m siv) h (Seq.seq_reveal (B.as_seq m plain))) /\\\n res == Success\n\nlet payload_encrypt\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n: HST.Stack error_code\n (requires (fun m ->\n payload_encrypt_pre a s siv dst h pn_len pn header_len plain plain_len m\n ))\n (ensures (fun m res m' ->\n payload_encrypt_post a s siv dst h pn_len pn header_len plain plain_len m res m'\n ))\n= \n let m0 = HST.get () in\n HST.push_frame ();\n let m1 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m1;\n let iv = B.alloca (Secret.to_u8 0uy) 12ul in\n\n (* EverCrypt currently does not support secret length encryption, so\n whenever we need to define the arguments to EverCrypt.AEAD.encrypt,\n we need to (locally there and only there) declassify the lengths of\n the aad, plain, cipher and tag buffers. *)\n let aad = B.sub dst 0ul (ADMITDeclassify.u32_to_UInt32 header_len) in\n let cipher = B.sub dst (ADMITDeclassify.u32_to_UInt32 header_len) (ADMITDeclassify.u32_to_UInt32 plain_len) in\n let tag = B.sub dst (ADMITDeclassify.u32_to_UInt32 (header_len `Secret.add` plain_len)) 16ul in\n\n iv_for_encrypt_decrypt a siv iv h pn_len pn;\n let res = AEAD.encrypt #a s iv 12ul aad (ADMITDeclassify.u32_to_UInt32 header_len) plain (ADMITDeclassify.u32_to_UInt32 plain_len) cipher tag in\n HST.pop_frame ();\n res\n\n#push-options \"--z3rlimit 128\"\n\nlet dummy = ()\n\nlet encrypt\n a aead siv ctr hpk dst h pn plain plain_len\n= let m0 = HST.get () in\n let gh = Ghost.hide (g_header h m0 pn) in\n let fmt = Ghost.hide (QUIC.Spec.Header.Parse.format_header gh) in\n let header_len = header_len h in\n QUIC.Impl.Header.Parse.header_len_correct h m0 pn;\n QUIC.Impl.Header.Base.header_len_v h;\n let isretry = is_retry h in\n\n (* Currently, EverParse needs the size of the destination buffer for\n writing, as a public integer, even though this is not strictly\n necessary. Since the serializers have no knowledge of the payload,\n and do not perform any declassification of the header sizes, we can\n pass the whole size of the destination buffer. *)\n QUIC.Impl.Header.Parse.write_header h pn dst\n (ADMITDeclassify.u32_to_UInt32 (header_len `Secret.add` (if isretry then Secret.to_u32 0ul else plain_len `Secret.add` Secret.to_u32 16ul)));\n\n if isretry\n then begin\n let dummy_pn_len = Secret.to_u32 1ul in\n let m3 = HST.get () in\n assert (\n Seq.slice (B.as_seq m3 dst) (Secret.v header_len) (B.length dst) `Seq.equal` Seq.seq_reveal (B.as_seq m0 plain)\n );\n QUIC.Impl.Header.header_encrypt a ctr hpk dst gh false true (public_header_len h) dummy_pn_len;\n let m4 = HST.get () in\n assert (B.as_seq m4 dst `Seq.equal` QUIC.Spec.Header.header_encrypt a (B.as_seq m0 hpk) gh (Seq.seq_reveal (B.as_seq m0 plain)));\n Success\n end\n else begin\n let m1 = HST.get () in\n let pn_len = pn_length h in\n let res = SecretBuffer.with_whole_buffer_hide_weak_modifies\n #error_code\n dst\n m1\n (AEAD.footprint m0 aead `B.loc_union`\n B.loc_buffer siv `B.loc_union`\n CTR.footprint m0 ctr `B.loc_union`\n B.loc_buffer hpk `B.loc_union`\n B.loc_buffer plain)\n (AEAD.footprint m0 aead)\n true\n (fun res cont m_ ->\n res == Success /\\\n cont `Seq.equal` (\n fmt `Seq.append`\n Spec.payload_encrypt a (AEAD.as_kv (B.deref m0 aead)) (B.as_seq m0 siv) (g_header h m0 pn) (Seq.seq_reveal (B.as_seq m0 plain))) /\\\n AEAD.invariant m_ aead /\\ AEAD.footprint m_ aead == AEAD.footprint m0 aead /\\\n AEAD.preserves_freeable aead m1 m_ /\\\n AEAD.as_kv (B.deref m_ aead) == AEAD.as_kv (B.deref m0 aead)\n )\n (fun _ bs -> \n let res = payload_encrypt a aead siv bs gh pn_len pn header_len plain plain_len in\n let m_ = HST.get () in\n assert (\n let cont = B.as_seq m_ bs in\n Seq.length fmt == Secret.v header_len /\\\n cont `Seq.equal` (Seq.slice cont 0 (Secret.v header_len) `Seq.append` Seq.slice cont (Secret.v header_len) (Seq.length cont))\n );\n res\n )\n in\n match res with\n | Success ->\n let m3 = HST.get () in\n assert (\n Seq.slice (B.as_seq m3 dst) (Secret.v header_len) (B.length dst) `Seq.equal` Spec.payload_encrypt a (AEAD.as_kv (B.deref m0 aead)) (B.as_seq m0 siv) gh (Seq.seq_reveal (B.as_seq m0 plain))\n );\n QUIC.Impl.Header.header_encrypt a ctr hpk dst gh (BShort? h) isretry (public_header_len h) pn_len;\n let m4 = HST.get () in\n assert (B.as_seq m4 dst `Seq.equal` QUIC.Spec.Header.header_encrypt a (B.as_seq m0 hpk) gh (Spec.payload_encrypt a (AEAD.as_kv (B.deref m0 aead)) (B.as_seq m0 siv) gh (Seq.seq_reveal (B.as_seq m0 plain))));\n res\n | _ ->\n assert False;\n res\n end\n\n#pop-options\n\nunfold\nlet payload_decrypt_pre\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header { ~ (Spec.is_retry gh) })\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n (m: HS.mem)\n: GTot Type0\n=\n let fmt = SParse.format_header gh in\n\n B.all_disjoint [\n AEAD.footprint m s;\n B.loc_buffer siv;\n B.loc_buffer dst;\n ] /\\\n\n AEAD.invariant m s /\\\n B.live m siv /\\ B.length siv == 12 /\\\n Secret.v cipher_and_tag_len >= SAEAD.tag_length a /\\\n Secret.v hlen == Seq.length fmt /\\\n Secret.v hlen + Secret.v cipher_and_tag_len <= B.length dst /\\\n Secret.v cipher_and_tag_len < max_cipher_length /\\\n B.live m dst /\\\n pn_len == Spec.pn_length gh /\\\n pn == Spec.packet_number gh /\\\n B.as_seq m (B.gsub dst 0ul (Secret.reveal hlen)) `Seq.equal` Seq.seq_hide fmt\n\nunfold\nlet payload_decrypt_post\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header { ~ (Spec.is_retry gh) })\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m' : HS.mem)\n: GTot Type0\n=\n payload_decrypt_pre a s siv dst gh hlen pn_len pn cipher_and_tag_len m /\\\n begin\n let bplain = B.gsub dst (Secret.reveal hlen) (Secret.reveal cipher_and_tag_len `U32.sub` U32.uint_to_t (SAEAD.tag_length a)) in\n B.modifies (B.loc_buffer bplain `B.loc_union` AEAD.footprint m s) m m' /\\\n AEAD.invariant m' s /\\ AEAD.footprint m' s == AEAD.footprint m s /\\\n AEAD.preserves_freeable s m m' /\\\n AEAD.as_kv (B.deref m' s) == AEAD.as_kv (B.deref m s) /\\\n begin match res, Spec.payload_decrypt a (AEAD.as_kv (B.deref m s)) (B.as_seq m siv) gh (B.as_seq m (B.gsub dst (Secret.reveal hlen) (Secret.reveal cipher_and_tag_len))) with\n | Success, Some plain ->\n B.as_seq m' bplain `Seq.equal` plain\n | AuthenticationFailure, None -> True\n | _ -> False\n end\n end\n\nlet payload_decrypt\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header { ~ (Spec.is_retry gh) })\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n: HST.Stack error_code\n (requires (fun m ->\n payload_decrypt_pre a s siv dst gh hlen pn_len pn cipher_and_tag_len m\n ))\n (ensures (fun m res m' ->\n payload_decrypt_post a s siv dst gh hlen pn_len pn cipher_and_tag_len m res m'", "dependencies": { "source_file": "QUIC.Impl.fst", "checked_file": "QUIC.Impl.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.Header.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "SParse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n s: EverCrypt.AEAD.state a ->\n siv: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n dst: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n gh:\n FStar.Ghost.erased QUIC.Spec.Header.Base.header\n {~(QUIC.Spec.Header.Base.is_retry (FStar.Ghost.reveal gh))} ->\n hlen: Lib.IntTypes.uint32 ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t ->\n cipher_and_tag_len: Lib.IntTypes.uint32\n -> FStar.HyperStack.ST.Stack EverCrypt.Error.error_code", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "EverCrypt.AEAD.state", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "FStar.Ghost.erased", "QUIC.Spec.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Spec.Header.Base.is_retry", "FStar.Ghost.reveal", "Lib.IntTypes.uint32", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "EverCrypt.Error.error_code", "Prims.unit", "FStar.HyperStack.ST.pop_frame", "Prims._assert", "FStar.Seq.Base.equal", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Buffer.trivial_preorder", "LowStar.Buffer.gsub", "QUIC.Secret.Int.reveal", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "FStar.Seq.Base.append", "EverCrypt.AEAD.decrypt", "FStar.Ghost.hide", "Spec.Agile.AEAD.supported_alg", "FStar.UInt32.__uint_to_t", "Lib.RawIntTypes.u32_to_UInt32", "QUIC.Impl.iv_for_encrypt_decrypt", "LowStar.Monotonic.Buffer.mbuffer", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "LowStar.Buffer.sub", "Lib.IntTypes.add", "FStar.UInt32.t", "Prims.eq2", "Prims.int", "Lib.IntTypes.v", "Prims.op_Subtraction", "QUIC.Secret.Int.hide", "Lib.IntTypes.PUB", "FStar.UInt32.uint_to_t", "QUIC.Secret.Int.usub", "Prims.l_and", "Prims.nat", "LowStar.Monotonic.Buffer.length", "FStar.UInt32.v", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "LowStar.Buffer.alloca", "Lib.IntTypes.to_u8", "Lib.IntTypes.U1", "FStar.UInt8.__uint_to_t", "LowStar.Monotonic.Buffer.loc_unused_in_not_unused_in_disjoint", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "FStar.HyperStack.ST.push_frame", "QUIC.Impl.payload_decrypt_pre", "QUIC.Impl.payload_decrypt_post" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val payload_decrypt\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header {~(Spec.is_retry gh)})\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n : HST.Stack error_code\n (requires (fun m -> payload_decrypt_pre a s siv dst gh hlen pn_len pn cipher_and_tag_len m))\n (ensures\n (fun m res m' ->\n payload_decrypt_post a s siv dst gh hlen pn_len pn cipher_and_tag_len m res m'))\nlet payload_decrypt\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header {~(Spec.is_retry gh)})\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n : HST.Stack error_code\n (requires (fun m -> payload_decrypt_pre a s siv dst gh hlen pn_len pn cipher_and_tag_len m))\n (ensures\n (fun m res m' ->\n payload_decrypt_post a s siv dst gh hlen pn_len pn cipher_and_tag_len m res m')) =", "completed_definiton": "let m0 = HST.get () in\nHST.push_frame ();\nlet m1 = HST.get () in\nB.loc_unused_in_not_unused_in_disjoint m1;\nlet iv = B.alloca (Secret.to_u8 0uy) 12ul in\nlet cipher_len = cipher_and_tag_len `Secret.usub` (Secret.hide 16ul) in\nlet aad = B.sub dst 0ul (ADMITDeclassify.u32_to_UInt32 hlen) in\nlet cipher =\n B.sub dst (ADMITDeclassify.u32_to_UInt32 hlen) (ADMITDeclassify.u32_to_UInt32 cipher_len)\nin\nlet tag = B.sub dst (ADMITDeclassify.u32_to_UInt32 (hlen `Secret.add` cipher_len)) 16ul in\niv_for_encrypt_decrypt a siv iv gh pn_len pn;\nlet res =\n AEAD.decrypt #a s iv 12ul aad (ADMITDeclassify.u32_to_UInt32 hlen) cipher\n (ADMITDeclassify.u32_to_UInt32 cipher_len) tag cipher\nin\nassert ((B.as_seq m0 (B.gsub dst (Secret.reveal hlen) (Secret.reveal cipher_and_tag_len)))\n `Seq.equal`\n ((B.as_seq m0 cipher) `Seq.append` (B.as_seq m0 tag)));\nHST.pop_frame ();\nres", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.fst", "name": "QUIC.Impl.payload_encrypt", "original_source_type": "val payload_encrypt\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n : HST.Stack error_code\n (requires (fun m -> payload_encrypt_pre a s siv dst h pn_len pn header_len plain plain_len m))\n (ensures\n (fun m res m' ->\n payload_encrypt_post a s siv dst h pn_len pn header_len plain plain_len m res m'))", "source_type": "val payload_encrypt\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n : HST.Stack error_code\n (requires (fun m -> payload_encrypt_pre a s siv dst h pn_len pn header_len plain plain_len m))\n (ensures\n (fun m res m' ->\n payload_encrypt_post a s siv dst h pn_len pn header_len plain plain_len m res m'))", "source_definition": "let payload_encrypt\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n: HST.Stack error_code\n (requires (fun m ->\n payload_encrypt_pre a s siv dst h pn_len pn header_len plain plain_len m\n ))\n (ensures (fun m res m' ->\n payload_encrypt_post a s siv dst h pn_len pn header_len plain plain_len m res m'\n ))\n= \n let m0 = HST.get () in\n HST.push_frame ();\n let m1 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m1;\n let iv = B.alloca (Secret.to_u8 0uy) 12ul in\n\n (* EverCrypt currently does not support secret length encryption, so\n whenever we need to define the arguments to EverCrypt.AEAD.encrypt,\n we need to (locally there and only there) declassify the lengths of\n the aad, plain, cipher and tag buffers. *)\n let aad = B.sub dst 0ul (ADMITDeclassify.u32_to_UInt32 header_len) in\n let cipher = B.sub dst (ADMITDeclassify.u32_to_UInt32 header_len) (ADMITDeclassify.u32_to_UInt32 plain_len) in\n let tag = B.sub dst (ADMITDeclassify.u32_to_UInt32 (header_len `Secret.add` plain_len)) 16ul in\n\n iv_for_encrypt_decrypt a siv iv h pn_len pn;\n let res = AEAD.encrypt #a s iv 12ul aad (ADMITDeclassify.u32_to_UInt32 header_len) plain (ADMITDeclassify.u32_to_UInt32 plain_len) cipher tag in\n HST.pop_frame ();\n res", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 199, "start_col": 1, "end_line": 217, "end_col": 5 }, "file_context": "module QUIC.Impl\n\n// This MUST be kept in sync with QUIC.Impl.fsti...\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule IB = LowStar.ImmutableBuffer\nmodule Seq = QUIC.Secret.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\nmodule HST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\n\nfriend QUIC.Spec\n\nopen QUIC.Impl.Lemmas\n\nopen LowStar.BufferOps\n\n//module HeaderS = QUIC.Spec.Header\n//module HeaderI = QUIC.Impl.Header\n\n#set-options \"--z3rlimit 64 --query_stats\"\n\n#restart-solver\n\nmodule SAEAD = Spec.Agile.AEAD\nmodule SCipher = Spec.Agile.Cipher\nmodule SHKDF = Spec.Agile.HKDF\n\nmodule SecretBuffer = QUIC.Secret.Buffer\n\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nunfold\nlet iv_for_encrypt_decrypt_pre\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n B.all_disjoint [\n B.loc_buffer siv;\n B.loc_buffer dst;\n ] /\\\n B.live m siv /\\ B.length siv == 12 /\\\n B.live m dst /\\ B.length dst == 12 /\\\n pn_len == Spec.pn_length h /\\\n pn == Spec.packet_number h\n\nunfold\nlet iv_for_encrypt_decrypt_post\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n (m' : HS.mem)\n: GTot Type0\n=\n iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m /\\\n begin\n B.modifies (B.loc_buffer dst) m m' /\\\n B.as_seq m' dst `Seq.equal`\n Spec.iv_for_encrypt_decrypt a (B.as_seq m siv) h\n end\n\nlet iv_for_encrypt_decrypt\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n: HST.Stack unit\n (requires (fun m ->\n iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m\n ))\n (ensures (fun m _ m' ->\n iv_for_encrypt_decrypt_post a siv dst h pn_len pn m m'\n ))\n= let m0 = HST.get () in\n B.fill dst (Secret.to_u8 0uy) 12ul;\n let pnb_store = B.sub dst 4ul 8ul in\n SecretBuffer.store64_be pnb_store pn;\n let m2 = HST.get () in\n assert (Seq.seq_reveal (B.as_seq m2 (B.gsub dst 0ul 4ul)) `Seq.equal` Seq.create 4 0uy);\n assert (Seq.seq_reveal (B.as_seq m2 dst) `Seq.equal` (Seq.create 4 0uy `Seq.append` FStar.Endianness.n_to_be 8 (Secret.v pn)));\n QUIC.Impl.Lemmas.n_to_be_lower' 8 12 (Secret.v pn);\n assert (Seq.seq_reveal (B.as_seq m2 dst) == FStar.Endianness.n_to_be 12 (Secret.v pn));\n QUIC.Impl.Lemmas.op_inplace dst siv 12ul 0ul (Secret.logxor #Secret.U8 #Secret.SEC);\n QUIC.Impl.Lemmas.secret_xor_inplace_eq (B.as_seq m2 dst) (B.as_seq m2 siv) 0\n\nmodule SParse = QUIC.Spec.Header.Parse\n\nunfold\nlet payload_encrypt_pre\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32) // should be secret, because otherwise one can compute the packet number length\n (m: HS.mem)\n: GTot Type0\n=\n let fmt = SParse.format_header h in\n\n B.all_disjoint [\n AEAD.footprint m s;\n B.loc_buffer siv;\n B.loc_buffer dst;\n B.loc_buffer plain;\n ] /\\\n\n AEAD.invariant m s /\\\n B.live m siv /\\ B.length siv == 12 /\\\n Secret.v header_len == Seq.length fmt /\\\n B.live m dst /\\ B.length dst == Secret.v header_len + Secret.v plain_len + SAEAD.tag_length a /\\\n pn_len == Spec.pn_length h /\\\n pn == Spec.packet_number h /\\\n B.live m plain /\\ B.length plain == Secret.v plain_len /\\ 3 <= Secret.v plain_len /\\ Secret.v plain_len < max_plain_length /\\\n B.as_seq m (B.gsub dst 0ul (Secret.reveal header_len)) `Seq.equal` Seq.seq_hide fmt\n\nunfold\nlet payload_encrypt_post\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m' : HS.mem)\n: GTot Type0\n=\n let fmt = SParse.format_header h in\n payload_encrypt_pre a s siv dst h pn_len pn header_len plain plain_len m /\\\n B.modifies (B.loc_buffer (B.gsub dst (Secret.reveal header_len) (B.len dst ` U32.sub` Secret.reveal header_len)) `B.loc_union` AEAD.footprint m s) m m' /\\\n AEAD.invariant m' s /\\ AEAD.footprint m' s == AEAD.footprint m s /\\\n AEAD.preserves_freeable s m m' /\\\n AEAD.as_kv (B.deref m' s) == AEAD.as_kv (B.deref m s) /\\\n B.as_seq m' (B.gsub dst (Secret.reveal header_len) (B.len dst `U32.sub` Secret.reveal header_len)) `Seq.equal` Seq.seq_hide (Spec.payload_encrypt a (AEAD.as_kv (B.deref m s)) (B.as_seq m siv) h (Seq.seq_reveal (B.as_seq m plain))) /\\\n res == Success\n\nlet payload_encrypt\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n: HST.Stack error_code\n (requires (fun m ->\n payload_encrypt_pre a s siv dst h pn_len pn header_len plain plain_len m\n ))\n (ensures (fun m res m' ->\n payload_encrypt_post a s siv dst h pn_len pn header_len plain plain_len m res m'", "dependencies": { "source_file": "QUIC.Impl.fst", "checked_file": "QUIC.Impl.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.Header.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "SParse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n s: EverCrypt.AEAD.state a ->\n siv: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n dst: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n h:\n FStar.Ghost.erased QUIC.Spec.Header.Base.header\n {~(QUIC.Spec.Header.Base.is_retry (FStar.Ghost.reveal h))} ->\n pn_len: QUIC.Spec.PacketNumber.Base.packet_number_length_t ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t ->\n header_len: Lib.IntTypes.uint32 ->\n plain: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n plain_len: Lib.IntTypes.uint32\n -> FStar.HyperStack.ST.Stack EverCrypt.Error.error_code", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "EverCrypt.AEAD.state", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "FStar.Ghost.erased", "QUIC.Spec.Header.Base.header", "Prims.l_not", "Prims.b2t", "QUIC.Spec.Header.Base.is_retry", "FStar.Ghost.reveal", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Lib.IntTypes.uint32", "EverCrypt.Error.error_code", "Prims.unit", "FStar.HyperStack.ST.pop_frame", "EverCrypt.AEAD.encrypt", "FStar.Ghost.hide", "Spec.Agile.AEAD.supported_alg", "FStar.UInt32.__uint_to_t", "Lib.RawIntTypes.u32_to_UInt32", "QUIC.Impl.iv_for_encrypt_decrypt", "LowStar.Monotonic.Buffer.mbuffer", "Lib.IntTypes.int_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "LowStar.Buffer.trivial_preorder", "LowStar.Buffer.sub", "Lib.IntTypes.add", "Lib.IntTypes.U32", "FStar.UInt32.t", "Prims.l_and", "Prims.eq2", "Prims.nat", "LowStar.Monotonic.Buffer.length", "FStar.UInt32.v", "FStar.UInt32.uint_to_t", "Prims.op_Negation", "LowStar.Monotonic.Buffer.g_is_null", "LowStar.Buffer.alloca", "Lib.IntTypes.to_u8", "Lib.IntTypes.U1", "Lib.IntTypes.PUB", "FStar.UInt8.__uint_to_t", "LowStar.Monotonic.Buffer.loc_unused_in_not_unused_in_disjoint", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "FStar.HyperStack.ST.push_frame", "QUIC.Impl.payload_encrypt_pre", "QUIC.Impl.payload_encrypt_post" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val payload_encrypt\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n : HST.Stack error_code\n (requires (fun m -> payload_encrypt_pre a s siv dst h pn_len pn header_len plain plain_len m))\n (ensures\n (fun m res m' ->\n payload_encrypt_post a s siv dst h pn_len pn header_len plain plain_len m res m'))\nlet payload_encrypt\n (a: ea)\n (s: AEAD.state a)\n (siv dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header {~(Spec.is_retry h)})\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n : HST.Stack error_code\n (requires (fun m -> payload_encrypt_pre a s siv dst h pn_len pn header_len plain plain_len m))\n (ensures\n (fun m res m' ->\n payload_encrypt_post a s siv dst h pn_len pn header_len plain plain_len m res m')) =", "completed_definiton": "let m0 = HST.get () in\nHST.push_frame ();\nlet m1 = HST.get () in\nB.loc_unused_in_not_unused_in_disjoint m1;\nlet iv = B.alloca (Secret.to_u8 0uy) 12ul in\nlet aad = B.sub dst 0ul (ADMITDeclassify.u32_to_UInt32 header_len) in\nlet cipher =\n B.sub dst (ADMITDeclassify.u32_to_UInt32 header_len) (ADMITDeclassify.u32_to_UInt32 plain_len)\nin\nlet tag = B.sub dst (ADMITDeclassify.u32_to_UInt32 (header_len `Secret.add` plain_len)) 16ul in\niv_for_encrypt_decrypt a siv iv h pn_len pn;\nlet res =\n AEAD.encrypt #a s iv 12ul aad (ADMITDeclassify.u32_to_UInt32 header_len) plain\n (ADMITDeclassify.u32_to_UInt32 plain_len) cipher tag\nin\nHST.pop_frame ();\nres", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.fst", "name": "QUIC.Impl.encrypt", "original_source_type": "val encrypt\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: header)\n (pn: PN.packet_number_t)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n: HST.Stack error_code\n (requires (fun m ->\n encrypt_pre a aead siv ctr hpk dst h pn plain plain_len m\n ))\n (ensures (fun m res m' ->\n encrypt_post a aead siv ctr hpk dst h pn plain plain_len m res m'\n ))", "source_type": "val encrypt\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: header)\n (pn: PN.packet_number_t)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n: HST.Stack error_code\n (requires (fun m ->\n encrypt_pre a aead siv ctr hpk dst h pn plain plain_len m\n ))\n (ensures (fun m res m' ->\n encrypt_post a aead siv ctr hpk dst h pn plain plain_len m res m'\n ))", "source_definition": "let encrypt\n a aead siv ctr hpk dst h pn plain plain_len\n= let m0 = HST.get () in\n let gh = Ghost.hide (g_header h m0 pn) in\n let fmt = Ghost.hide (QUIC.Spec.Header.Parse.format_header gh) in\n let header_len = header_len h in\n QUIC.Impl.Header.Parse.header_len_correct h m0 pn;\n QUIC.Impl.Header.Base.header_len_v h;\n let isretry = is_retry h in\n\n (* Currently, EverParse needs the size of the destination buffer for\n writing, as a public integer, even though this is not strictly\n necessary. Since the serializers have no knowledge of the payload,\n and do not perform any declassification of the header sizes, we can\n pass the whole size of the destination buffer. *)\n QUIC.Impl.Header.Parse.write_header h pn dst\n (ADMITDeclassify.u32_to_UInt32 (header_len `Secret.add` (if isretry then Secret.to_u32 0ul else plain_len `Secret.add` Secret.to_u32 16ul)));\n\n if isretry\n then begin\n let dummy_pn_len = Secret.to_u32 1ul in\n let m3 = HST.get () in\n assert (\n Seq.slice (B.as_seq m3 dst) (Secret.v header_len) (B.length dst) `Seq.equal` Seq.seq_reveal (B.as_seq m0 plain)\n );\n QUIC.Impl.Header.header_encrypt a ctr hpk dst gh false true (public_header_len h) dummy_pn_len;\n let m4 = HST.get () in\n assert (B.as_seq m4 dst `Seq.equal` QUIC.Spec.Header.header_encrypt a (B.as_seq m0 hpk) gh (Seq.seq_reveal (B.as_seq m0 plain)));\n Success\n end\n else begin\n let m1 = HST.get () in\n let pn_len = pn_length h in\n let res = SecretBuffer.with_whole_buffer_hide_weak_modifies\n #error_code\n dst\n m1\n (AEAD.footprint m0 aead `B.loc_union`\n B.loc_buffer siv `B.loc_union`\n CTR.footprint m0 ctr `B.loc_union`\n B.loc_buffer hpk `B.loc_union`\n B.loc_buffer plain)\n (AEAD.footprint m0 aead)\n true\n (fun res cont m_ ->\n res == Success /\\\n cont `Seq.equal` (\n fmt `Seq.append`\n Spec.payload_encrypt a (AEAD.as_kv (B.deref m0 aead)) (B.as_seq m0 siv) (g_header h m0 pn) (Seq.seq_reveal (B.as_seq m0 plain))) /\\\n AEAD.invariant m_ aead /\\ AEAD.footprint m_ aead == AEAD.footprint m0 aead /\\\n AEAD.preserves_freeable aead m1 m_ /\\\n AEAD.as_kv (B.deref m_ aead) == AEAD.as_kv (B.deref m0 aead)\n )\n (fun _ bs -> \n let res = payload_encrypt a aead siv bs gh pn_len pn header_len plain plain_len in\n let m_ = HST.get () in\n assert (\n let cont = B.as_seq m_ bs in\n Seq.length fmt == Secret.v header_len /\\\n cont `Seq.equal` (Seq.slice cont 0 (Secret.v header_len) `Seq.append` Seq.slice cont (Secret.v header_len) (Seq.length cont))\n );\n res\n )\n in\n match res with\n | Success ->\n let m3 = HST.get () in\n assert (\n Seq.slice (B.as_seq m3 dst) (Secret.v header_len) (B.length dst) `Seq.equal` Spec.payload_encrypt a (AEAD.as_kv (B.deref m0 aead)) (B.as_seq m0 siv) gh (Seq.seq_reveal (B.as_seq m0 plain))\n );\n QUIC.Impl.Header.header_encrypt a ctr hpk dst gh (BShort? h) isretry (public_header_len h) pn_len;\n let m4 = HST.get () in\n assert (B.as_seq m4 dst `Seq.equal` QUIC.Spec.Header.header_encrypt a (B.as_seq m0 hpk) gh (Spec.payload_encrypt a (AEAD.as_kv (B.deref m0 aead)) (B.as_seq m0 siv) gh (Seq.seq_reveal (B.as_seq m0 plain))));\n res\n | _ ->\n assert False;\n res\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 225, "start_col": 1, "end_line": 300, "end_col": 5 }, "file_context": "module QUIC.Impl\n\n// This MUST be kept in sync with QUIC.Impl.fsti...\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule IB = LowStar.ImmutableBuffer\nmodule Seq = QUIC.Secret.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\nmodule HST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\n\nfriend QUIC.Spec\n\nopen QUIC.Impl.Lemmas\n\nopen LowStar.BufferOps\n\n//module HeaderS = QUIC.Spec.Header\n//module HeaderI = QUIC.Impl.Header\n\n#set-options \"--z3rlimit 64 --query_stats\"\n\n#restart-solver\n\nmodule SAEAD = Spec.Agile.AEAD\nmodule SCipher = Spec.Agile.Cipher\nmodule SHKDF = Spec.Agile.HKDF\n\nmodule SecretBuffer = QUIC.Secret.Buffer\n\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nunfold\nlet iv_for_encrypt_decrypt_pre\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n B.all_disjoint [\n B.loc_buffer siv;\n B.loc_buffer dst;\n ] /\\\n B.live m siv /\\ B.length siv == 12 /\\\n B.live m dst /\\ B.length dst == 12 /\\\n pn_len == Spec.pn_length h /\\\n pn == Spec.packet_number h\n\nunfold\nlet iv_for_encrypt_decrypt_post\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n (m' : HS.mem)\n: GTot Type0\n=\n iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m /\\\n begin\n B.modifies (B.loc_buffer dst) m m' /\\\n B.as_seq m' dst `Seq.equal`\n Spec.iv_for_encrypt_decrypt a (B.as_seq m siv) h\n end\n\nlet iv_for_encrypt_decrypt\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n: HST.Stack unit\n (requires (fun m ->\n iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m\n ))\n (ensures (fun m _ m' ->\n iv_for_encrypt_decrypt_post a siv dst h pn_len pn m m'\n ))\n= let m0 = HST.get () in\n B.fill dst (Secret.to_u8 0uy) 12ul;\n let pnb_store = B.sub dst 4ul 8ul in\n SecretBuffer.store64_be pnb_store pn;\n let m2 = HST.get () in\n assert (Seq.seq_reveal (B.as_seq m2 (B.gsub dst 0ul 4ul)) `Seq.equal` Seq.create 4 0uy);\n assert (Seq.seq_reveal (B.as_seq m2 dst) `Seq.equal` (Seq.create 4 0uy `Seq.append` FStar.Endianness.n_to_be 8 (Secret.v pn)));\n QUIC.Impl.Lemmas.n_to_be_lower' 8 12 (Secret.v pn);\n assert (Seq.seq_reveal (B.as_seq m2 dst) == FStar.Endianness.n_to_be 12 (Secret.v pn));\n QUIC.Impl.Lemmas.op_inplace dst siv 12ul 0ul (Secret.logxor #Secret.U8 #Secret.SEC);\n QUIC.Impl.Lemmas.secret_xor_inplace_eq (B.as_seq m2 dst) (B.as_seq m2 siv) 0\n\nmodule SParse = QUIC.Spec.Header.Parse\n\nunfold\nlet payload_encrypt_pre\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32) // should be secret, because otherwise one can compute the packet number length\n (m: HS.mem)\n: GTot Type0\n=\n let fmt = SParse.format_header h in\n\n B.all_disjoint [\n AEAD.footprint m s;\n B.loc_buffer siv;\n B.loc_buffer dst;\n B.loc_buffer plain;\n ] /\\\n\n AEAD.invariant m s /\\\n B.live m siv /\\ B.length siv == 12 /\\\n Secret.v header_len == Seq.length fmt /\\\n B.live m dst /\\ B.length dst == Secret.v header_len + Secret.v plain_len + SAEAD.tag_length a /\\\n pn_len == Spec.pn_length h /\\\n pn == Spec.packet_number h /\\\n B.live m plain /\\ B.length plain == Secret.v plain_len /\\ 3 <= Secret.v plain_len /\\ Secret.v plain_len < max_plain_length /\\\n B.as_seq m (B.gsub dst 0ul (Secret.reveal header_len)) `Seq.equal` Seq.seq_hide fmt\n\nunfold\nlet payload_encrypt_post\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m' : HS.mem)\n: GTot Type0\n=\n let fmt = SParse.format_header h in\n payload_encrypt_pre a s siv dst h pn_len pn header_len plain plain_len m /\\\n B.modifies (B.loc_buffer (B.gsub dst (Secret.reveal header_len) (B.len dst ` U32.sub` Secret.reveal header_len)) `B.loc_union` AEAD.footprint m s) m m' /\\\n AEAD.invariant m' s /\\ AEAD.footprint m' s == AEAD.footprint m s /\\\n AEAD.preserves_freeable s m m' /\\\n AEAD.as_kv (B.deref m' s) == AEAD.as_kv (B.deref m s) /\\\n B.as_seq m' (B.gsub dst (Secret.reveal header_len) (B.len dst `U32.sub` Secret.reveal header_len)) `Seq.equal` Seq.seq_hide (Spec.payload_encrypt a (AEAD.as_kv (B.deref m s)) (B.as_seq m siv) h (Seq.seq_reveal (B.as_seq m plain))) /\\\n res == Success\n\nlet payload_encrypt\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n: HST.Stack error_code\n (requires (fun m ->\n payload_encrypt_pre a s siv dst h pn_len pn header_len plain plain_len m\n ))\n (ensures (fun m res m' ->\n payload_encrypt_post a s siv dst h pn_len pn header_len plain plain_len m res m'\n ))\n= \n let m0 = HST.get () in\n HST.push_frame ();\n let m1 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m1;\n let iv = B.alloca (Secret.to_u8 0uy) 12ul in\n\n (* EverCrypt currently does not support secret length encryption, so\n whenever we need to define the arguments to EverCrypt.AEAD.encrypt,\n we need to (locally there and only there) declassify the lengths of\n the aad, plain, cipher and tag buffers. *)\n let aad = B.sub dst 0ul (ADMITDeclassify.u32_to_UInt32 header_len) in\n let cipher = B.sub dst (ADMITDeclassify.u32_to_UInt32 header_len) (ADMITDeclassify.u32_to_UInt32 plain_len) in\n let tag = B.sub dst (ADMITDeclassify.u32_to_UInt32 (header_len `Secret.add` plain_len)) 16ul in\n\n iv_for_encrypt_decrypt a siv iv h pn_len pn;\n let res = AEAD.encrypt #a s iv 12ul aad (ADMITDeclassify.u32_to_UInt32 header_len) plain (ADMITDeclassify.u32_to_UInt32 plain_len) cipher tag in\n HST.pop_frame ();\n res\n\n#push-options \"--z3rlimit 128\"\n\nlet dummy = ()\n\nlet encrypt", "dependencies": { "source_file": "QUIC.Impl.fst", "checked_file": "QUIC.Impl.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.Header.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "SParse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 128, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n aead: EverCrypt.AEAD.state a ->\n siv: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n ctr: NotEverCrypt.CTR.state (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n hpk: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n dst: LowStar.Buffer.buffer FStar.UInt8.t ->\n h: QUIC.Impl.Header.Base.header ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t ->\n plain: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n plain_len: Lib.IntTypes.uint32\n -> FStar.HyperStack.ST.Stack EverCrypt.Error.error_code", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "EverCrypt.AEAD.state", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "NotEverCrypt.CTR.state", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "FStar.UInt8.t", "QUIC.Impl.Header.Base.header", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Lib.IntTypes.uint32", "EverCrypt.Error.Success", "Prims.unit", "Prims._assert", "FStar.Seq.Base.equal", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Buffer.trivial_preorder", "QUIC.Spec.Header.header_encrypt", "FStar.Ghost.reveal", "QUIC.Spec.Header.Base.header", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "EverCrypt.Error.error_code", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "QUIC.Impl.Header.header_encrypt", "QUIC.Impl.Header.Base.public_header_len", "FStar.Seq.Base.slice", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "LowStar.Monotonic.Buffer.length", "Lib.IntTypes.int_t", "Lib.IntTypes.to_u32", "Lib.IntTypes.PUB", "FStar.UInt32.__uint_to_t", "Prims.bool", "QUIC.Spec.payload_encrypt", "EverCrypt.AEAD.as_kv", "LowStar.Monotonic.Buffer.deref", "EverCrypt.AEAD.state_s", "QUIC.Impl.Header.Base.uu___is_BShort", "Prims.l_False", "QUIC.Secret.Buffer.with_whole_buffer_hide_weak_modifies", "FStar.Ghost.hide", "LowStar.Monotonic.Buffer.loc", "LowStar.Monotonic.Buffer.loc_union", "EverCrypt.AEAD.footprint", "LowStar.Monotonic.Buffer.loc_buffer", "NotEverCrypt.CTR.footprint", "FStar.Seq.Properties.lseq", "Prims.l_and", "Prims.eq2", "FStar.Seq.Base.append", "QUIC.Spec.Base.byte", "FStar.Seq.Base.seq", "QUIC.Impl.Header.Base.g_header", "EverCrypt.AEAD.invariant", "EverCrypt.AEAD.preserves_freeable", "Spec.Agile.AEAD.kv", "FStar.Ghost.erased", "Prims.nat", "Prims.int", "Prims.l_or", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "Lib.IntTypes.range", "FStar.Seq.Base.length", "QUIC.Impl.payload_encrypt", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Impl.Header.Base.pn_length", "QUIC.Impl.Header.Parse.write_header", "Lib.RawIntTypes.u32_to_UInt32", "Lib.IntTypes.add", "Prims.op_Addition", "Lib.IntTypes.v", "QUIC.Impl.Header.Base.is_retry", "QUIC.Impl.Header.Base.header_len_v", "QUIC.Impl.Header.Parse.header_len_correct", "FStar.UInt32.v", "QUIC.Impl.Header.Base.header_len", "QUIC.Spec.Header.Parse.format_header" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val encrypt\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: header)\n (pn: PN.packet_number_t)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n: HST.Stack error_code\n (requires (fun m ->\n encrypt_pre a aead siv ctr hpk dst h pn plain plain_len m\n ))\n (ensures (fun m res m' ->\n encrypt_post a aead siv ctr hpk dst h pn plain plain_len m res m'\n ))\nlet encrypt a aead siv ctr hpk dst h pn plain plain_len =", "completed_definiton": "let m0 = HST.get () in\nlet gh = Ghost.hide (g_header h m0 pn) in\nlet fmt = Ghost.hide (QUIC.Spec.Header.Parse.format_header gh) in\nlet header_len = header_len h in\nQUIC.Impl.Header.Parse.header_len_correct h m0 pn;\nQUIC.Impl.Header.Base.header_len_v h;\nlet isretry = is_retry h in\nQUIC.Impl.Header.Parse.write_header h\n pn\n dst\n (ADMITDeclassify.u32_to_UInt32 (header_len\n `Secret.add`\n (if isretry then Secret.to_u32 0ul else plain_len `Secret.add` (Secret.to_u32 16ul))));\nif isretry\nthen\n let dummy_pn_len = Secret.to_u32 1ul in\n let m3 = HST.get () in\n assert ((Seq.slice (B.as_seq m3 dst) (Secret.v header_len) (B.length dst))\n `Seq.equal`\n (Seq.seq_reveal (B.as_seq m0 plain)));\n QUIC.Impl.Header.header_encrypt a ctr hpk dst gh false true (public_header_len h) dummy_pn_len;\n let m4 = HST.get () in\n assert ((B.as_seq m4 dst)\n `Seq.equal`\n (QUIC.Spec.Header.header_encrypt a (B.as_seq m0 hpk) gh (Seq.seq_reveal (B.as_seq m0 plain))));\n Success\nelse\n let m1 = HST.get () in\n let pn_len = pn_length h in\n let res =\n SecretBuffer.with_whole_buffer_hide_weak_modifies #error_code\n dst\n m1\n (((((AEAD.footprint m0 aead) `B.loc_union` (B.loc_buffer siv))\n `B.loc_union`\n (CTR.footprint m0 ctr))\n `B.loc_union`\n (B.loc_buffer hpk))\n `B.loc_union`\n (B.loc_buffer plain))\n (AEAD.footprint m0 aead)\n true\n (fun res cont m_ ->\n res == Success /\\\n cont\n `Seq.equal`\n (fmt\n `Seq.append`\n (Spec.payload_encrypt a\n (AEAD.as_kv (B.deref m0 aead))\n (B.as_seq m0 siv)\n (g_header h m0 pn)\n (Seq.seq_reveal (B.as_seq m0 plain)))) /\\ AEAD.invariant m_ aead /\\\n AEAD.footprint m_ aead == AEAD.footprint m0 aead /\\ AEAD.preserves_freeable aead m1 m_ /\\\n AEAD.as_kv (B.deref m_ aead) == AEAD.as_kv (B.deref m0 aead))\n (fun _ bs ->\n let res = payload_encrypt a aead siv bs gh pn_len pn header_len plain plain_len in\n let m_ = HST.get () in\n assert (let cont = B.as_seq m_ bs in\n Seq.length fmt == Secret.v header_len /\\\n cont\n `Seq.equal`\n ((Seq.slice cont 0 (Secret.v header_len))\n `Seq.append`\n (Seq.slice cont (Secret.v header_len) (Seq.length cont))));\n res)\n in\n match res with\n | Success ->\n let m3 = HST.get () in\n assert ((Seq.slice (B.as_seq m3 dst) (Secret.v header_len) (B.length dst))\n `Seq.equal`\n (Spec.payload_encrypt a\n (AEAD.as_kv (B.deref m0 aead))\n (B.as_seq m0 siv)\n gh\n (Seq.seq_reveal (B.as_seq m0 plain))));\n QUIC.Impl.Header.header_encrypt a\n ctr\n hpk\n dst\n gh\n (BShort? h)\n isretry\n (public_header_len h)\n pn_len;\n let m4 = HST.get () in\n assert ((B.as_seq m4 dst)\n `Seq.equal`\n (QUIC.Spec.Header.header_encrypt a\n (B.as_seq m0 hpk)\n gh\n (Spec.payload_encrypt a\n (AEAD.as_kv (B.deref m0 aead))\n (B.as_seq m0 siv)\n gh\n (Seq.seq_reveal (B.as_seq m0 plain)))));\n res\n | _ ->\n assert False;\n res", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.fst", "name": "QUIC.Impl.decrypt", "original_source_type": "val decrypt\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (dst_hdr: B.pointer result)\n (last_pn: PN.last_packet_number_t)\n (cid_len: short_dcid_len_t)\n: HST.Stack error_code\n (requires (fun m ->\n decrypt_pre a aead siv ctr hpk dst dst_len dst_hdr last_pn cid_len m\n ))\n (ensures (fun m res m' ->\n decrypt_post a aead siv ctr hpk dst dst_len dst_hdr last_pn cid_len m res m'\n ))", "source_type": "val decrypt\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (dst_hdr: B.pointer result)\n (last_pn: PN.last_packet_number_t)\n (cid_len: short_dcid_len_t)\n: HST.Stack error_code\n (requires (fun m ->\n decrypt_pre a aead siv ctr hpk dst dst_len dst_hdr last_pn cid_len m\n ))\n (ensures (fun m res m' ->\n decrypt_post a aead siv ctr hpk dst dst_len dst_hdr last_pn cid_len m res m'\n ))", "source_definition": "let decrypt\n a aead siv ctr hpk dst dst_len dst_hdr last_pn cid_len\n= let m0 = HST.get () in\n match QUIC.Impl.Header.header_decrypt a ctr hpk cid_len last_pn dst dst_len with\n | QUIC.Impl.Header.H_Failure -> DecodeError\n | QUIC.Impl.Header.H_Success h pn cipher_and_tag_len ->\n assert (\n match QUIC.Spec.Header.header_decrypt a (B.as_seq m0 hpk) (U32.v cid_len) (Secret.v last_pn) (B.as_seq m0 dst) with\n | QUIC.Spec.Header.H_Success _ ct _ ->\n Seq.length ct == Secret.v cipher_and_tag_len\n | _ -> False\n );\n let m1 = HST.get () in\n let hlen = header_len h in\n QUIC.Impl.Header.Parse.header_len_correct h m1 pn;\n if is_retry h\n then begin\n let r = {\n pn = pn;\n header = h;\n header_len = hlen;\n plain_len = Secret.hide 0ul;\n total_len = hlen;\n } in\n B.upd dst_hdr 0ul r;\n let m2 = HST.get () in\n QUIC.Impl.Header.Base.frame_header h pn (B.loc_buffer dst_hdr) m1 m2;\n Success\n end else begin\n let gh : Ghost.erased Spec.header = Ghost.hide (g_header h m1 pn) in\n let pn_len = pn_length h in\n B.gsub_zero_length dst;\n assert (Secret.v cipher_and_tag_len >= 16);\n assert (SAEAD.tag_length a == 16);\n let plain_len = cipher_and_tag_len `Secret.sub` Secret.hide 16ul in\n let res = SecretBuffer.with_buffer_hide_from\n #error_code\n dst\n 0ul\n m1\n (AEAD.footprint m1 aead `B.loc_union`\n B.loc_buffer siv `B.loc_union`\n CTR.footprint m1 ctr `B.loc_union`\n B.loc_buffer hpk)\n (AEAD.footprint m1 aead)\n 1ul 0ul (Secret.reveal hlen) (Secret.reveal hlen `U32.add` (Secret.reveal cipher_and_tag_len `U32.sub` U32.uint_to_t (SAEAD.tag_length a)))\n (fun res _ cont m_ ->\n begin match res, Spec.payload_decrypt a (AEAD.as_kv (B.deref m1 aead)) (B.as_seq m1 siv) gh (Seq.seq_hide (B.as_seq m1 (B.gsub dst (Secret.reveal hlen) (Secret.reveal cipher_and_tag_len)))) with\n | Success, Some plain ->\n Seq.slice cont (Secret.v hlen) (Secret.v hlen + (Secret.v cipher_and_tag_len - SAEAD.tag_length a)) == Seq.seq_reveal plain\n | AuthenticationFailure, None -> True\n | _ -> False\n end /\\\n AEAD.invariant m_ aead /\\ AEAD.footprint m_ aead == AEAD.footprint m0 aead /\\\n AEAD.preserves_freeable aead m1 m_ /\\\n AEAD.as_kv (B.deref m_ aead) == AEAD.as_kv (B.deref m0 aead)\n )\n (fun _ _ bs ->\n let res = payload_decrypt a aead siv bs gh hlen pn_len pn cipher_and_tag_len in\n let m_ = HST.get () in\n assert (\n let cont = Seq.seq_reveal (B.as_seq m_ bs) in\n match res, Spec.payload_decrypt a (AEAD.as_kv (B.deref m1 aead)) (B.as_seq m1 siv) gh (Seq.seq_hide (B.as_seq m1 (B.gsub dst (Secret.reveal hlen) (Secret.reveal cipher_and_tag_len)))) with\n | Success, Some plain ->\n Seq.slice cont (Secret.v hlen) (Secret.v hlen + (Secret.v cipher_and_tag_len - SAEAD.tag_length a)) `Seq.equal` Seq.seq_reveal plain\n | AuthenticationFailure, None -> True\n | _ -> False\n );\n res\n )\n in\n let r = {\n pn = pn;\n header = h;\n header_len = hlen;\n plain_len = plain_len;\n total_len = hlen `Secret.add` cipher_and_tag_len;\n } in\n B.upd dst_hdr 0ul r;\n let m3 = HST.get () in\n QUIC.Impl.Header.Base.frame_header h pn\n (AEAD.footprint m1 aead `B.loc_union` CTR.footprint m1 ctr `B.loc_union` B.loc_buffer dst_hdr `B.loc_union` B.loc_buffer (B.gsub dst (Secret.reveal hlen) (B.len dst `U32.sub` Secret.reveal hlen))) m1 m3;\n res\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 413, "start_col": 1, "end_line": 494, "end_col": 7 }, "file_context": "module QUIC.Impl\n\n// This MUST be kept in sync with QUIC.Impl.fsti...\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule IB = LowStar.ImmutableBuffer\nmodule Seq = QUIC.Secret.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\nmodule HST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\n\nfriend QUIC.Spec\n\nopen QUIC.Impl.Lemmas\n\nopen LowStar.BufferOps\n\n//module HeaderS = QUIC.Spec.Header\n//module HeaderI = QUIC.Impl.Header\n\n#set-options \"--z3rlimit 64 --query_stats\"\n\n#restart-solver\n\nmodule SAEAD = Spec.Agile.AEAD\nmodule SCipher = Spec.Agile.Cipher\nmodule SHKDF = Spec.Agile.HKDF\n\nmodule SecretBuffer = QUIC.Secret.Buffer\n\n\n(* There are a few places where EverCrypt needs public data whereas it\ncould/should be secret. Thus, we may need some declassification\nlocally using Lib.RawIntTypes, but we definitely don't want to make\nsecret integers globally transparent using friend *)\n\nmodule ADMITDeclassify = Lib.RawIntTypes\n\nunfold\nlet iv_for_encrypt_decrypt_pre\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n B.all_disjoint [\n B.loc_buffer siv;\n B.loc_buffer dst;\n ] /\\\n B.live m siv /\\ B.length siv == 12 /\\\n B.live m dst /\\ B.length dst == 12 /\\\n pn_len == Spec.pn_length h /\\\n pn == Spec.packet_number h\n\nunfold\nlet iv_for_encrypt_decrypt_post\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (m: HS.mem)\n (m' : HS.mem)\n: GTot Type0\n=\n iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m /\\\n begin\n B.modifies (B.loc_buffer dst) m m' /\\\n B.as_seq m' dst `Seq.equal`\n Spec.iv_for_encrypt_decrypt a (B.as_seq m siv) h\n end\n\nlet iv_for_encrypt_decrypt\n (a: ea)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n: HST.Stack unit\n (requires (fun m ->\n iv_for_encrypt_decrypt_pre a siv dst h pn_len pn m\n ))\n (ensures (fun m _ m' ->\n iv_for_encrypt_decrypt_post a siv dst h pn_len pn m m'\n ))\n= let m0 = HST.get () in\n B.fill dst (Secret.to_u8 0uy) 12ul;\n let pnb_store = B.sub dst 4ul 8ul in\n SecretBuffer.store64_be pnb_store pn;\n let m2 = HST.get () in\n assert (Seq.seq_reveal (B.as_seq m2 (B.gsub dst 0ul 4ul)) `Seq.equal` Seq.create 4 0uy);\n assert (Seq.seq_reveal (B.as_seq m2 dst) `Seq.equal` (Seq.create 4 0uy `Seq.append` FStar.Endianness.n_to_be 8 (Secret.v pn)));\n QUIC.Impl.Lemmas.n_to_be_lower' 8 12 (Secret.v pn);\n assert (Seq.seq_reveal (B.as_seq m2 dst) == FStar.Endianness.n_to_be 12 (Secret.v pn));\n QUIC.Impl.Lemmas.op_inplace dst siv 12ul 0ul (Secret.logxor #Secret.U8 #Secret.SEC);\n QUIC.Impl.Lemmas.secret_xor_inplace_eq (B.as_seq m2 dst) (B.as_seq m2 siv) 0\n\nmodule SParse = QUIC.Spec.Header.Parse\n\nunfold\nlet payload_encrypt_pre\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32) // should be secret, because otherwise one can compute the packet number length\n (m: HS.mem)\n: GTot Type0\n=\n let fmt = SParse.format_header h in\n\n B.all_disjoint [\n AEAD.footprint m s;\n B.loc_buffer siv;\n B.loc_buffer dst;\n B.loc_buffer plain;\n ] /\\\n\n AEAD.invariant m s /\\\n B.live m siv /\\ B.length siv == 12 /\\\n Secret.v header_len == Seq.length fmt /\\\n B.live m dst /\\ B.length dst == Secret.v header_len + Secret.v plain_len + SAEAD.tag_length a /\\\n pn_len == Spec.pn_length h /\\\n pn == Spec.packet_number h /\\\n B.live m plain /\\ B.length plain == Secret.v plain_len /\\ 3 <= Secret.v plain_len /\\ Secret.v plain_len < max_plain_length /\\\n B.as_seq m (B.gsub dst 0ul (Secret.reveal header_len)) `Seq.equal` Seq.seq_hide fmt\n\nunfold\nlet payload_encrypt_post\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m' : HS.mem)\n: GTot Type0\n=\n let fmt = SParse.format_header h in\n payload_encrypt_pre a s siv dst h pn_len pn header_len plain plain_len m /\\\n B.modifies (B.loc_buffer (B.gsub dst (Secret.reveal header_len) (B.len dst ` U32.sub` Secret.reveal header_len)) `B.loc_union` AEAD.footprint m s) m m' /\\\n AEAD.invariant m' s /\\ AEAD.footprint m' s == AEAD.footprint m s /\\\n AEAD.preserves_freeable s m m' /\\\n AEAD.as_kv (B.deref m' s) == AEAD.as_kv (B.deref m s) /\\\n B.as_seq m' (B.gsub dst (Secret.reveal header_len) (B.len dst `U32.sub` Secret.reveal header_len)) `Seq.equal` Seq.seq_hide (Spec.payload_encrypt a (AEAD.as_kv (B.deref m s)) (B.as_seq m siv) h (Seq.seq_reveal (B.as_seq m plain))) /\\\n res == Success\n\nlet payload_encrypt\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (h: G.erased Spec.header { ~ (Spec.is_retry h) })\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (header_len: Secret.uint32)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n: HST.Stack error_code\n (requires (fun m ->\n payload_encrypt_pre a s siv dst h pn_len pn header_len plain plain_len m\n ))\n (ensures (fun m res m' ->\n payload_encrypt_post a s siv dst h pn_len pn header_len plain plain_len m res m'\n ))\n= \n let m0 = HST.get () in\n HST.push_frame ();\n let m1 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m1;\n let iv = B.alloca (Secret.to_u8 0uy) 12ul in\n\n (* EverCrypt currently does not support secret length encryption, so\n whenever we need to define the arguments to EverCrypt.AEAD.encrypt,\n we need to (locally there and only there) declassify the lengths of\n the aad, plain, cipher and tag buffers. *)\n let aad = B.sub dst 0ul (ADMITDeclassify.u32_to_UInt32 header_len) in\n let cipher = B.sub dst (ADMITDeclassify.u32_to_UInt32 header_len) (ADMITDeclassify.u32_to_UInt32 plain_len) in\n let tag = B.sub dst (ADMITDeclassify.u32_to_UInt32 (header_len `Secret.add` plain_len)) 16ul in\n\n iv_for_encrypt_decrypt a siv iv h pn_len pn;\n let res = AEAD.encrypt #a s iv 12ul aad (ADMITDeclassify.u32_to_UInt32 header_len) plain (ADMITDeclassify.u32_to_UInt32 plain_len) cipher tag in\n HST.pop_frame ();\n res\n\n#push-options \"--z3rlimit 128\"\n\nlet dummy = ()\n\nlet encrypt\n a aead siv ctr hpk dst h pn plain plain_len\n= let m0 = HST.get () in\n let gh = Ghost.hide (g_header h m0 pn) in\n let fmt = Ghost.hide (QUIC.Spec.Header.Parse.format_header gh) in\n let header_len = header_len h in\n QUIC.Impl.Header.Parse.header_len_correct h m0 pn;\n QUIC.Impl.Header.Base.header_len_v h;\n let isretry = is_retry h in\n\n (* Currently, EverParse needs the size of the destination buffer for\n writing, as a public integer, even though this is not strictly\n necessary. Since the serializers have no knowledge of the payload,\n and do not perform any declassification of the header sizes, we can\n pass the whole size of the destination buffer. *)\n QUIC.Impl.Header.Parse.write_header h pn dst\n (ADMITDeclassify.u32_to_UInt32 (header_len `Secret.add` (if isretry then Secret.to_u32 0ul else plain_len `Secret.add` Secret.to_u32 16ul)));\n\n if isretry\n then begin\n let dummy_pn_len = Secret.to_u32 1ul in\n let m3 = HST.get () in\n assert (\n Seq.slice (B.as_seq m3 dst) (Secret.v header_len) (B.length dst) `Seq.equal` Seq.seq_reveal (B.as_seq m0 plain)\n );\n QUIC.Impl.Header.header_encrypt a ctr hpk dst gh false true (public_header_len h) dummy_pn_len;\n let m4 = HST.get () in\n assert (B.as_seq m4 dst `Seq.equal` QUIC.Spec.Header.header_encrypt a (B.as_seq m0 hpk) gh (Seq.seq_reveal (B.as_seq m0 plain)));\n Success\n end\n else begin\n let m1 = HST.get () in\n let pn_len = pn_length h in\n let res = SecretBuffer.with_whole_buffer_hide_weak_modifies\n #error_code\n dst\n m1\n (AEAD.footprint m0 aead `B.loc_union`\n B.loc_buffer siv `B.loc_union`\n CTR.footprint m0 ctr `B.loc_union`\n B.loc_buffer hpk `B.loc_union`\n B.loc_buffer plain)\n (AEAD.footprint m0 aead)\n true\n (fun res cont m_ ->\n res == Success /\\\n cont `Seq.equal` (\n fmt `Seq.append`\n Spec.payload_encrypt a (AEAD.as_kv (B.deref m0 aead)) (B.as_seq m0 siv) (g_header h m0 pn) (Seq.seq_reveal (B.as_seq m0 plain))) /\\\n AEAD.invariant m_ aead /\\ AEAD.footprint m_ aead == AEAD.footprint m0 aead /\\\n AEAD.preserves_freeable aead m1 m_ /\\\n AEAD.as_kv (B.deref m_ aead) == AEAD.as_kv (B.deref m0 aead)\n )\n (fun _ bs -> \n let res = payload_encrypt a aead siv bs gh pn_len pn header_len plain plain_len in\n let m_ = HST.get () in\n assert (\n let cont = B.as_seq m_ bs in\n Seq.length fmt == Secret.v header_len /\\\n cont `Seq.equal` (Seq.slice cont 0 (Secret.v header_len) `Seq.append` Seq.slice cont (Secret.v header_len) (Seq.length cont))\n );\n res\n )\n in\n match res with\n | Success ->\n let m3 = HST.get () in\n assert (\n Seq.slice (B.as_seq m3 dst) (Secret.v header_len) (B.length dst) `Seq.equal` Spec.payload_encrypt a (AEAD.as_kv (B.deref m0 aead)) (B.as_seq m0 siv) gh (Seq.seq_reveal (B.as_seq m0 plain))\n );\n QUIC.Impl.Header.header_encrypt a ctr hpk dst gh (BShort? h) isretry (public_header_len h) pn_len;\n let m4 = HST.get () in\n assert (B.as_seq m4 dst `Seq.equal` QUIC.Spec.Header.header_encrypt a (B.as_seq m0 hpk) gh (Spec.payload_encrypt a (AEAD.as_kv (B.deref m0 aead)) (B.as_seq m0 siv) gh (Seq.seq_reveal (B.as_seq m0 plain))));\n res\n | _ ->\n assert False;\n res\n end\n\n#pop-options\n\nunfold\nlet payload_decrypt_pre\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header { ~ (Spec.is_retry gh) })\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n (m: HS.mem)\n: GTot Type0\n=\n let fmt = SParse.format_header gh in\n\n B.all_disjoint [\n AEAD.footprint m s;\n B.loc_buffer siv;\n B.loc_buffer dst;\n ] /\\\n\n AEAD.invariant m s /\\\n B.live m siv /\\ B.length siv == 12 /\\\n Secret.v cipher_and_tag_len >= SAEAD.tag_length a /\\\n Secret.v hlen == Seq.length fmt /\\\n Secret.v hlen + Secret.v cipher_and_tag_len <= B.length dst /\\\n Secret.v cipher_and_tag_len < max_cipher_length /\\\n B.live m dst /\\\n pn_len == Spec.pn_length gh /\\\n pn == Spec.packet_number gh /\\\n B.as_seq m (B.gsub dst 0ul (Secret.reveal hlen)) `Seq.equal` Seq.seq_hide fmt\n\nunfold\nlet payload_decrypt_post\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header { ~ (Spec.is_retry gh) })\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m' : HS.mem)\n: GTot Type0\n=\n payload_decrypt_pre a s siv dst gh hlen pn_len pn cipher_and_tag_len m /\\\n begin\n let bplain = B.gsub dst (Secret.reveal hlen) (Secret.reveal cipher_and_tag_len `U32.sub` U32.uint_to_t (SAEAD.tag_length a)) in\n B.modifies (B.loc_buffer bplain `B.loc_union` AEAD.footprint m s) m m' /\\\n AEAD.invariant m' s /\\ AEAD.footprint m' s == AEAD.footprint m s /\\\n AEAD.preserves_freeable s m m' /\\\n AEAD.as_kv (B.deref m' s) == AEAD.as_kv (B.deref m s) /\\\n begin match res, Spec.payload_decrypt a (AEAD.as_kv (B.deref m s)) (B.as_seq m siv) gh (B.as_seq m (B.gsub dst (Secret.reveal hlen) (Secret.reveal cipher_and_tag_len))) with\n | Success, Some plain ->\n B.as_seq m' bplain `Seq.equal` plain\n | AuthenticationFailure, None -> True\n | _ -> False\n end\n end\n\nlet payload_decrypt\n (a: ea)\n (s: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (dst: B.buffer Secret.uint8)\n (gh: Ghost.erased Spec.header { ~ (Spec.is_retry gh) })\n (hlen: Secret.uint32)\n (pn_len: PN.packet_number_length_t)\n (pn: PN.packet_number_t)\n (cipher_and_tag_len: Secret.uint32)\n: HST.Stack error_code\n (requires (fun m ->\n payload_decrypt_pre a s siv dst gh hlen pn_len pn cipher_and_tag_len m\n ))\n (ensures (fun m res m' ->\n payload_decrypt_post a s siv dst gh hlen pn_len pn cipher_and_tag_len m res m'\n ))\n= \n let m0 = HST.get () in\n HST.push_frame ();\n let m1 = HST.get () in\n B.loc_unused_in_not_unused_in_disjoint m1;\n let iv = B.alloca (Secret.to_u8 0uy) 12ul in\n let cipher_len = cipher_and_tag_len `Secret.usub` Secret.hide 16ul in\n\n (* EverCrypt currently does not support secret length encryption, so\n whenever we need to define the arguments to EverCrypt.AEAD.encrypt,\n we need to (locally there and only there) declassify the lengths of\n the aad, plain, cipher and tag buffers. *)\n let aad = B.sub dst 0ul (ADMITDeclassify.u32_to_UInt32 hlen) in\n let cipher = B.sub dst (ADMITDeclassify.u32_to_UInt32 hlen) (ADMITDeclassify.u32_to_UInt32 cipher_len) in\n let tag = B.sub dst (ADMITDeclassify.u32_to_UInt32 (hlen `Secret.add` cipher_len)) 16ul in\n\n iv_for_encrypt_decrypt a siv iv gh pn_len pn;\n let res = AEAD.decrypt #a s iv 12ul aad (ADMITDeclassify.u32_to_UInt32 hlen) cipher (ADMITDeclassify.u32_to_UInt32 cipher_len) tag cipher in\n assert (B.as_seq m0 (B.gsub dst (Secret.reveal hlen) (Secret.reveal cipher_and_tag_len)) `Seq.equal` (B.as_seq m0 cipher `Seq.append` B.as_seq m0 tag));\n HST.pop_frame ();\n res\n\n#push-options \"--z3rlimit 256\"\n\n#restart-solver\n\nlet decrypt", "dependencies": { "source_file": "QUIC.Impl.fst", "checked_file": "QUIC.Impl.fst.checked", "interface_file": true, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.Header.fsti.checked", "QUIC.Spec.fst.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Buffer.fsti.checked", "QUIC.Impl.Lemmas.fsti.checked", "QUIC.Impl.Header.Parse.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.Header.fsti.checked", "prims.fst.checked", "LowStar.ImmutableBuffer.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "Lib.RawIntTypes.fsti.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "SParse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 256, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n aead: EverCrypt.AEAD.state a ->\n siv: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n ctr: NotEverCrypt.CTR.state (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n hpk: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n dst: LowStar.Buffer.buffer FStar.UInt8.t ->\n dst_len: FStar.UInt32.t ->\n dst_hdr: LowStar.Buffer.pointer QUIC.Impl.Header.Base.result ->\n last_pn: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n cid_len: QUIC.Spec.Base.short_dcid_len_t\n -> FStar.HyperStack.ST.Stack EverCrypt.Error.error_code", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "EverCrypt.AEAD.state", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "NotEverCrypt.CTR.state", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "FStar.UInt8.t", "FStar.UInt32.t", "LowStar.Buffer.pointer", "QUIC.Impl.Header.Base.result", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Base.short_dcid_len_t", "EverCrypt.Error.DecodeError", "EverCrypt.Error.error_code", "QUIC.Impl.Header.Base.header", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Lib.IntTypes.uint32", "QUIC.Impl.Header.Base.is_retry", "EverCrypt.Error.Success", "Prims.unit", "QUIC.Impl.Header.Base.frame_header", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Buffer.trivial_preorder", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "LowStar.Monotonic.Buffer.upd", "FStar.UInt32.__uint_to_t", "QUIC.Impl.Header.Base.Mkresult", "QUIC.Secret.Int.hide", "Lib.IntTypes.U32", "Lib.IntTypes.PUB", "Prims.bool", "LowStar.Monotonic.Buffer.loc_union", "EverCrypt.AEAD.footprint", "NotEverCrypt.CTR.footprint", "LowStar.Buffer.gsub", "QUIC.Secret.Int.reveal", "Lib.IntTypes.SEC", "FStar.UInt32.sub", "LowStar.Monotonic.Buffer.len", "Lib.IntTypes.add", "QUIC.Secret.Buffer.with_buffer_hide_from", "FStar.Ghost.hide", "LowStar.Monotonic.Buffer.loc", "FStar.UInt32.add", "FStar.UInt32.uint_to_t", "Spec.Agile.AEAD.tag_length", "FStar.Seq.Properties.lseq", "FStar.UInt32.v", "Prims.op_Subtraction", "LowStar.Monotonic.Buffer.length", "Prims.l_and", "FStar.Pervasives.Native.Mktuple2", "FStar.Pervasives.Native.option", "Spec.Agile.AEAD.decrypted", "QUIC.Secret.Seq.seq_hide", "Lib.IntTypes.U8", "LowStar.Monotonic.Buffer.as_seq", "QUIC.Spec.payload_decrypt", "EverCrypt.AEAD.as_kv", "LowStar.Monotonic.Buffer.deref", "EverCrypt.AEAD.state_s", "FStar.Ghost.reveal", "QUIC.Spec.Header.Base.header", "Prims.eq2", "FStar.Seq.Base.seq", "FStar.Seq.Base.slice", "QUIC.Secret.Int.Base.v", "Prims.op_Addition", "QUIC.Secret.Seq.seq_reveal", "Prims.l_True", "FStar.Pervasives.Native.tuple2", "Prims.l_False", "Prims.logical", "EverCrypt.AEAD.invariant", "EverCrypt.AEAD.preserves_freeable", "Spec.Agile.AEAD.kv", "FStar.Ghost.erased", "Prims.int", "Prims.l_or", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "FStar.UInt.size", "FStar.UInt32.n", "Prims._assert", "FStar.Seq.Base.equal", "Lib.IntTypes.uint_t", "Lib.IntTypes.int_t", "QUIC.Impl.payload_decrypt", "Lib.IntTypes.sub", "LowStar.Monotonic.Buffer.gsub_zero_length", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Impl.Header.Base.pn_length", "QUIC.Impl.Header.Base.g_header", "QUIC.Impl.Header.Parse.header_len_correct", "Lib.IntTypes.v", "QUIC.Impl.Header.Base.public_header_len", "Lib.IntTypes.range", "QUIC.Impl.Header.Base.header_len", "QUIC.Spec.Header.header_decrypt", "Lib.IntTypes.U64", "QUIC.Spec.Base.bytes", "QUIC.Spec.Header.Base.is_retry", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "QUIC.Spec.Crypto.max_cipher_length", "Prims.nat", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "QUIC.Spec.Header.h_result", "QUIC.Impl.Header.h_result", "QUIC.Impl.Header.header_decrypt" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val decrypt\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (dst_hdr: B.pointer result)\n (last_pn: PN.last_packet_number_t)\n (cid_len: short_dcid_len_t)\n: HST.Stack error_code\n (requires (fun m ->\n decrypt_pre a aead siv ctr hpk dst dst_len dst_hdr last_pn cid_len m\n ))\n (ensures (fun m res m' ->\n decrypt_post a aead siv ctr hpk dst dst_len dst_hdr last_pn cid_len m res m'\n ))\nlet decrypt a aead siv ctr hpk dst dst_len dst_hdr last_pn cid_len =", "completed_definiton": "let m0 = HST.get () in\nmatch QUIC.Impl.Header.header_decrypt a ctr hpk cid_len last_pn dst dst_len with\n| QUIC.Impl.Header.H_Failure -> DecodeError\n| QUIC.Impl.Header.H_Success h pn cipher_and_tag_len ->\n assert (match\n QUIC.Spec.Header.header_decrypt a\n (B.as_seq m0 hpk)\n (U32.v cid_len)\n (Secret.v last_pn)\n (B.as_seq m0 dst)\n with\n | QUIC.Spec.Header.H_Success _ ct _ -> Seq.length ct == Secret.v cipher_and_tag_len\n | _ -> False);\n let m1 = HST.get () in\n let hlen = header_len h in\n QUIC.Impl.Header.Parse.header_len_correct h m1 pn;\n if is_retry h\n then\n let r =\n { pn = pn; header = h; header_len = hlen; plain_len = Secret.hide 0ul; total_len = hlen }\n in\n B.upd dst_hdr 0ul r;\n let m2 = HST.get () in\n QUIC.Impl.Header.Base.frame_header h pn (B.loc_buffer dst_hdr) m1 m2;\n Success\n else\n let gh:Ghost.erased Spec.header = Ghost.hide (g_header h m1 pn) in\n let pn_len = pn_length h in\n B.gsub_zero_length dst;\n assert (Secret.v cipher_and_tag_len >= 16);\n assert (SAEAD.tag_length a == 16);\n let plain_len = cipher_and_tag_len `Secret.sub` (Secret.hide 16ul) in\n let res =\n SecretBuffer.with_buffer_hide_from #error_code dst 0ul m1\n ((((AEAD.footprint m1 aead) `B.loc_union` (B.loc_buffer siv))\n `B.loc_union`\n (CTR.footprint m1 ctr))\n `B.loc_union`\n (B.loc_buffer hpk)) (AEAD.footprint m1 aead) 1ul 0ul (Secret.reveal hlen)\n ((Secret.reveal hlen)\n `U32.add`\n ((Secret.reveal cipher_and_tag_len) `U32.sub` (U32.uint_to_t (SAEAD.tag_length a))))\n (fun res _ cont m_ ->\n (match\n res,\n Spec.payload_decrypt a\n (AEAD.as_kv (B.deref m1 aead))\n (B.as_seq m1 siv)\n gh\n (Seq.seq_hide (B.as_seq m1\n (B.gsub dst (Secret.reveal hlen) (Secret.reveal cipher_and_tag_len))))\n with\n | Success, Some plain ->\n Seq.slice cont\n (Secret.v hlen)\n (Secret.v hlen + (Secret.v cipher_and_tag_len - SAEAD.tag_length a)) ==\n Seq.seq_reveal plain\n | AuthenticationFailure, None -> True\n | _ -> False) /\\ AEAD.invariant m_ aead /\\\n AEAD.footprint m_ aead == AEAD.footprint m0 aead /\\ AEAD.preserves_freeable aead m1 m_ /\\\n AEAD.as_kv (B.deref m_ aead) == AEAD.as_kv (B.deref m0 aead))\n (fun _ _ bs ->\n let res = payload_decrypt a aead siv bs gh hlen pn_len pn cipher_and_tag_len in\n let m_ = HST.get () in\n assert (let cont = Seq.seq_reveal (B.as_seq m_ bs) in\n match\n res,\n Spec.payload_decrypt a\n (AEAD.as_kv (B.deref m1 aead))\n (B.as_seq m1 siv)\n gh\n (Seq.seq_hide (B.as_seq m1\n (B.gsub dst (Secret.reveal hlen) (Secret.reveal cipher_and_tag_len))))\n with\n | Success, Some plain ->\n (Seq.slice cont\n (Secret.v hlen)\n (Secret.v hlen + (Secret.v cipher_and_tag_len - SAEAD.tag_length a)))\n `Seq.equal`\n (Seq.seq_reveal plain)\n | AuthenticationFailure, None -> True\n | _ -> False);\n res)\n in\n let r =\n {\n pn = pn;\n header = h;\n header_len = hlen;\n plain_len = plain_len;\n total_len = hlen `Secret.add` cipher_and_tag_len\n }\n in\n B.upd dst_hdr 0ul r;\n let m3 = HST.get () in\n QUIC.Impl.Header.Base.frame_header h\n pn\n ((((AEAD.footprint m1 aead) `B.loc_union` (CTR.footprint m1 ctr))\n `B.loc_union`\n (B.loc_buffer dst_hdr))\n `B.loc_union`\n (B.loc_buffer (B.gsub dst (Secret.reveal hlen) ((B.len dst) `U32.sub` (Secret.reveal hlen)))\n ))\n m1\n m3;\n res", "isa_cross_project_example": true }, { "file_name": "Model.Indexing.fsti", "name": "Model.Indexing.is_supported_hash", "original_source_type": "", "source_type": "val is_supported_hash : _: Spec.Hash.Definitions.hash_alg -> Prims.bool", "source_definition": "let is_supported_hash = function\n | HD.SHA1 | HD.SHA2_256 | HD.SHA2_384 | HD.SHA2_512 -> true\n | _ -> false", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.Indexing.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 20, "start_col": 24, "end_line": 22, "end_col": 14 }, "file_context": "module Model.Indexing\n\n(*\nThis module provides the functions that the QUIC\nrecord layer security model expect to be provided\nby the TLS handshake security model. In particular,\nit assumes that the indexes contain the history of\nthe derivation of each key, including the implicit\nauthentication of algorithms to use.\n*)\n\nopen Mem\ninclude Model.Flags\n\nmodule C = Spec.Agile.Cipher\nmodule AE = Spec.Agile.AEAD\nmodule HD = Spec.Hash.Definitions\nmodule G = FStar.Ghost", "dependencies": { "source_file": "Model.Indexing.fsti", "checked_file": "Model.Indexing.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "prims.fst.checked", "Model.Flags.fsti.checked", "Mem.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "AE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "C", "full_module": "Spec.Agile.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "Model.Flags" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Spec.Hash.Definitions.hash_alg -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Spec.Hash.Definitions.hash_alg", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let is_supported_hash =", "completed_definiton": "function\n| HD.SHA1 | HD.SHA2_256 | HD.SHA2_384 | HD.SHA2_512 -> true\n| _ -> false", "isa_cross_project_example": true }, { "file_name": "Model.Indexing.fsti", "name": "Model.Indexing.is_supported_aead", "original_source_type": "", "source_type": "val is_supported_aead : _: Spec.Agile.AEAD.alg -> Prims.bool", "source_definition": "let is_supported_aead = function\n | AE.AES128_GCM | AE.AES256_GCM | AE.CHACHA20_POLY1305 -> true\n | _ -> false", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.Indexing.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 24, "start_col": 24, "end_line": 26, "end_col": 14 }, "file_context": "module Model.Indexing\n\n(*\nThis module provides the functions that the QUIC\nrecord layer security model expect to be provided\nby the TLS handshake security model. In particular,\nit assumes that the indexes contain the history of\nthe derivation of each key, including the implicit\nauthentication of algorithms to use.\n*)\n\nopen Mem\ninclude Model.Flags\n\nmodule C = Spec.Agile.Cipher\nmodule AE = Spec.Agile.AEAD\nmodule HD = Spec.Hash.Definitions\nmodule G = FStar.Ghost\n\nlet is_supported_hash = function\n | HD.SHA1 | HD.SHA2_256 | HD.SHA2_384 | HD.SHA2_512 -> true\n | _ -> false", "dependencies": { "source_file": "Model.Indexing.fsti", "checked_file": "Model.Indexing.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "prims.fst.checked", "Model.Flags.fsti.checked", "Mem.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "AE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "C", "full_module": "Spec.Agile.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "Model.Flags" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Spec.Agile.AEAD.alg -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Spec.Agile.AEAD.alg", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let is_supported_aead =", "completed_definiton": "function\n| AE.AES128_GCM | AE.AES256_GCM | AE.CHACHA20_POLY1305 -> true\n| _ -> false", "isa_cross_project_example": true }, { "file_name": "Model.Indexing.fsti", "name": "Model.Indexing.is_supported_cipher", "original_source_type": "", "source_type": "val is_supported_cipher : _: Spec.Agile.Cipher.cipher_alg -> Prims.bool", "source_definition": "let is_supported_cipher = function\n | C.AES128 | C.AES256 | C.CHACHA20 -> true\n | _ -> false", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.Indexing.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 28, "start_col": 26, "end_line": 30, "end_col": 14 }, "file_context": "module Model.Indexing\n\n(*\nThis module provides the functions that the QUIC\nrecord layer security model expect to be provided\nby the TLS handshake security model. In particular,\nit assumes that the indexes contain the history of\nthe derivation of each key, including the implicit\nauthentication of algorithms to use.\n*)\n\nopen Mem\ninclude Model.Flags\n\nmodule C = Spec.Agile.Cipher\nmodule AE = Spec.Agile.AEAD\nmodule HD = Spec.Hash.Definitions\nmodule G = FStar.Ghost\n\nlet is_supported_hash = function\n | HD.SHA1 | HD.SHA2_256 | HD.SHA2_384 | HD.SHA2_512 -> true\n | _ -> false\n\nlet is_supported_aead = function\n | AE.AES128_GCM | AE.AES256_GCM | AE.CHACHA20_POLY1305 -> true\n | _ -> false", "dependencies": { "source_file": "Model.Indexing.fsti", "checked_file": "Model.Indexing.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "prims.fst.checked", "Model.Flags.fsti.checked", "Mem.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "AE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "C", "full_module": "Spec.Agile.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "Model.Flags" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Spec.Agile.Cipher.cipher_alg -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Spec.Agile.Cipher.cipher_alg", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let is_supported_cipher =", "completed_definiton": "function\n| C.AES128 | C.AES256 | C.CHACHA20 -> true\n| _ -> false", "isa_cross_project_example": true }, { "file_name": "Model.Indexing.fsti", "name": "Model.Indexing.cipher_of_aead", "original_source_type": "", "source_type": "val cipher_of_aead : a: Model.Indexing.ea -> Spec.Agile.Cipher.cipher_alg", "source_definition": "let cipher_of_aead (a:ea) =\n match a with\n | AE.AES128_GCM -> C.AES128\n | AE.AES256_GCM -> C.AES256\n | AE.CHACHA20_POLY1305 -> C.CHACHA20", "source": { "project_name": "everquic-crypto", "file_name": "src/Model.Indexing.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 37, "start_col": 2, "end_line": 40, "end_col": 38 }, "file_context": "module Model.Indexing\n\n(*\nThis module provides the functions that the QUIC\nrecord layer security model expect to be provided\nby the TLS handshake security model. In particular,\nit assumes that the indexes contain the history of\nthe derivation of each key, including the implicit\nauthentication of algorithms to use.\n*)\n\nopen Mem\ninclude Model.Flags\n\nmodule C = Spec.Agile.Cipher\nmodule AE = Spec.Agile.AEAD\nmodule HD = Spec.Hash.Definitions\nmodule G = FStar.Ghost\n\nlet is_supported_hash = function\n | HD.SHA1 | HD.SHA2_256 | HD.SHA2_384 | HD.SHA2_512 -> true\n | _ -> false\n\nlet is_supported_aead = function\n | AE.AES128_GCM | AE.AES256_GCM | AE.CHACHA20_POLY1305 -> true\n | _ -> false\n\nlet is_supported_cipher = function\n | C.AES128 | C.AES256 | C.CHACHA20 -> true\n | _ -> false\n\ntype ha = a:HD.hash_alg{is_supported_hash a}\ntype ea = a:AE.alg{is_supported_aead a}\ntype ca = a:C.cipher_alg{is_supported_cipher a}", "dependencies": { "source_file": "Model.Indexing.fsti", "checked_file": "Model.Indexing.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "prims.fst.checked", "Model.Flags.fsti.checked", "Mem.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "AE", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "C", "full_module": "Spec.Agile.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "Model.Flags" }, { "abbrev": false, "short_module": null, "full_module": "Mem" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "Model" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: Model.Indexing.ea -> Spec.Agile.Cipher.cipher_alg", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.Indexing.ea", "Spec.Agile.Cipher.AES128", "Spec.Agile.Cipher.AES256", "Spec.Agile.Cipher.CHACHA20", "Spec.Agile.Cipher.cipher_alg" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let cipher_of_aead (a: ea) =", "completed_definiton": "match a with\n| AE.AES128_GCM -> C.AES128\n| AE.AES256_GCM -> C.AES256\n| AE.CHACHA20_POLY1305 -> C.CHACHA20", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.istate_t", "original_source_type": "", "source_type": "val istate_t : i: QUIC.State.index -> Type0", "source_definition": "let istate_t i = QImpl.state i", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 66, "start_col": 17, "end_line": 66, "end_col": 30 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index\n\nlet mid (i:index{I.model}) = i <: QModel.id\nlet iid (i:index{not I.model}) = i <: QImpl.index\n\nlet alg (i:index) =\n if I.model then I.ae_id_ginfo (dfst (mid i))\n else (iid i).QImpl.aead_alg\n\nlet halg (i:index) =\n if I.model then I.ae_id_ghash (dfst (mid i))\n else (iid i).QImpl.hash_alg\n\nlet itraffic_secret (i:QModel.id) =\n Spec.Hash.Definitions.bytes_hash (I.ae_id_ghash (dfst i))\n\nmodule MH = Model.Helpers\n\nlet derived (#i:QModel.id) (#w:QModel.stream_writer i) (r:QModel.stream_reader w) (ts:itraffic_secret i) =\n if I.model && QModel.unsafe i then\n let ha = I.ae_id_hash (dfst i) in\n let ea = I.ae_id_info (dfst i) in\n let (k1, k2) = QModel.reader_leak r in\n MH.hide (QModel.writer_static_iv w) ==\n QSpec.derive_secret ha ts QSpec.label_iv 12 /\\\n MH.hide k1 == QSpec.derive_secret ha ts\n QSpec.label_key (QSpec.cipher_keysize ea) /\\\n MH.hide k2 == QUIC.Spec.derive_secret ha ts\n QUIC.Spec.label_hp (QSpec.cipher_keysize ea)\n else True\n\nnoeq type mstate_t i =\n| Ideal:\n writer: QModel.stream_writer i ->\n reader: QModel.stream_reader writer ->\n ts: itraffic_secret i{derived reader ts} -> // FIXME erased\n mstate_t i", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "MH", "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: QUIC.State.index -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.State.index", "QUIC.State.state" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let istate_t i =", "completed_definiton": "QImpl.state i", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.nat_of_u8", "original_source_type": "", "source_type": "val nat_of_u8 : x: Lib.IntTypes.uint8 -> FStar.UInt.uint_t 8", "source_definition": "let nat_of_u8 (x: Lib.IntTypes.uint8) =\n UInt8.v (Lib.RawIntTypes.u8_to_UInt8 x)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 178, "start_col": 2, "end_line": 178, "end_col": 41 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index\n\nlet mid (i:index{I.model}) = i <: QModel.id\nlet iid (i:index{not I.model}) = i <: QImpl.index\n\nlet alg (i:index) =\n if I.model then I.ae_id_ginfo (dfst (mid i))\n else (iid i).QImpl.aead_alg\n\nlet halg (i:index) =\n if I.model then I.ae_id_ghash (dfst (mid i))\n else (iid i).QImpl.hash_alg\n\nlet itraffic_secret (i:QModel.id) =\n Spec.Hash.Definitions.bytes_hash (I.ae_id_ghash (dfst i))\n\nmodule MH = Model.Helpers\n\nlet derived (#i:QModel.id) (#w:QModel.stream_writer i) (r:QModel.stream_reader w) (ts:itraffic_secret i) =\n if I.model && QModel.unsafe i then\n let ha = I.ae_id_hash (dfst i) in\n let ea = I.ae_id_info (dfst i) in\n let (k1, k2) = QModel.reader_leak r in\n MH.hide (QModel.writer_static_iv w) ==\n QSpec.derive_secret ha ts QSpec.label_iv 12 /\\\n MH.hide k1 == QSpec.derive_secret ha ts\n QSpec.label_key (QSpec.cipher_keysize ea) /\\\n MH.hide k2 == QUIC.Spec.derive_secret ha ts\n QUIC.Spec.label_hp (QSpec.cipher_keysize ea)\n else True\n\nnoeq type mstate_t i =\n| Ideal:\n writer: QModel.stream_writer i ->\n reader: QModel.stream_reader writer ->\n ts: itraffic_secret i{derived reader ts} -> // FIXME erased\n mstate_t i\n\nlet istate_t i = QImpl.state i\n\nnoeq\ntype raise (i: index { not I.model }): Type u#1 = | Raise: s:istate_t i -> raise i\n\nlet state i =\n if I.model then mstate_t (mid i)\n else raise (iid i)\n\nlet mstate (#i:index{I.model}) (s:state i) = s <: mstate_t (mid i)\nlet istate (#i:index{not I.model}) (s:state i) = (s <: raise (iid i)).s\n\nlet footprint #i h s =\n if I.model then\n QModel.rfootprint (mstate s).reader `B.loc_union` QModel.footprint (mstate s).writer\n else QImpl.footprint h (istate s)\n\nlet invariant #i h s =\n if I.model then\n let Ideal writer reader _ = mstate s in\n QModel.invariant writer h /\\ QModel.rinvariant reader h /\\\n B.loc_disjoint (QModel.rfootprint (mstate s).reader) (QModel.footprint (mstate s).writer)\n else QImpl.invariant h (istate s)\n\nlet g_traffic_secret #i s h =\n if I.model then (mstate s).ts\n else\n QImpl.g_traffic_secret (B.deref h (istate s))\n\nlet g_initial_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.writer_offset #(mid i) (mstate s).writer)\n else\n QImpl.g_initial_packet_number (B.deref h (istate s))\n\nlet g_last_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.expected_pnT #(mid i) (mstate s).reader h)\n else\n QImpl.g_last_packet_number (B.deref h (istate s)) h\n\nlet g_next_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.wctrT #(mid i) (mstate s).writer h)\n else\n QImpl.g_last_packet_number (B.deref h (istate s)) h\n\n// TODO: reveal in the interface (just for good measure)\nlet frame_invariant #i l s h0 h1 =\n if I.model then\n let Ideal w r _ = mstate #(mid i) s in\n QModel.frame_invariant w h0 l h1;\n QModel.rframe_invariant r h0 l h1\n else\n QImpl.frame_invariant #(iid i) l s h0 h1\n\n/// Ingredients we need for the mythical switch\n\n/// First, a stateful equivalent of as_seq. Implementation doesn't need to be\n/// efficient.\n\nlet rec as_seq #a (b: B.buffer a) (l: UInt32.t { l == B.len b }): Stack (S.seq a)\n (requires fun h0 ->\n B.live h0 b)\n (ensures fun h0 r h1 ->\n h0 == h1 /\\\n B.as_seq h0 b `S.equal` r)\n=\n let h0 = ST.get () in\n if l = 0ul then\n S.empty\n else\n let hd = B.index b 0ul in\n let l = l `U32.sub` 1ul in\n let b = B.sub b 1ul l in\n S.cons hd (as_seq b l)\n\nlet rec from_seq #a (dst: B.buffer a) (s: S.seq a): Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\\n B.length dst == S.length s)\n (ensures fun h0 _ h1 ->\n B.modifies (B.loc_buffer dst) h0 h1 /\\\n B.as_seq h1 dst `S.equal` s)\n=\n if S.length s = 0 then\n ()\n else begin\n let hd = B.sub dst 0ul 1ul in\n let tl = B.sub dst 1ul (UInt32.uint_to_t (S.length s - 1)) in\n B.upd hd 0ul (S.index s 0);\n from_seq tl (S.slice s 1 (S.length s));\n let h1 = ST.get () in\n calc (S.equal) {\n B.as_seq h1 dst;\n (S.equal) { }\n S.append (S.slice (B.as_seq h1 hd) 0 1) (S.slice (B.as_seq h1 dst) 1 (S.length s));\n (S.equal) { }\n S.append (S.create 1 (S.index s 0)) (S.slice (B.as_seq h1 dst) 1 (S.length s));\n (S.equal) { }\n S.append (S.create 1 (S.index s 0)) (S.slice s 1 (S.length s));\n (S.equal) { }\n s;\n }\n end\n\n#set-options \"--fuel 0 --ifuel 0 --z3rlimit 200 --using_facts_from '*,-LowStar.Monotonic.Buffer.unused_in_not_unused_in_disjoint_2'\"", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "MH", "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 200, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Lib.IntTypes.uint8 -> FStar.UInt.uint_t 8", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.uint8", "FStar.UInt8.v", "Lib.RawIntTypes.u8_to_UInt8", "FStar.UInt.uint_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let nat_of_u8 (x: Lib.IntTypes.uint8) =", "completed_definiton": "UInt8.v (Lib.RawIntTypes.u8_to_UInt8 x)", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.footprint", "original_source_type": "val footprint: #i:index -> HS.mem -> state i -> GTot B.loc", "source_type": "val footprint: #i:index -> HS.mem -> state i -> GTot B.loc", "source_definition": "let footprint #i h s =\n if I.model then\n QModel.rfootprint (mstate s).reader `B.loc_union` QModel.footprint (mstate s).writer\n else QImpl.footprint h (istate s)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 79, "start_col": 2, "end_line": 81, "end_col": 35 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index\n\nlet mid (i:index{I.model}) = i <: QModel.id\nlet iid (i:index{not I.model}) = i <: QImpl.index\n\nlet alg (i:index) =\n if I.model then I.ae_id_ginfo (dfst (mid i))\n else (iid i).QImpl.aead_alg\n\nlet halg (i:index) =\n if I.model then I.ae_id_ghash (dfst (mid i))\n else (iid i).QImpl.hash_alg\n\nlet itraffic_secret (i:QModel.id) =\n Spec.Hash.Definitions.bytes_hash (I.ae_id_ghash (dfst i))\n\nmodule MH = Model.Helpers\n\nlet derived (#i:QModel.id) (#w:QModel.stream_writer i) (r:QModel.stream_reader w) (ts:itraffic_secret i) =\n if I.model && QModel.unsafe i then\n let ha = I.ae_id_hash (dfst i) in\n let ea = I.ae_id_info (dfst i) in\n let (k1, k2) = QModel.reader_leak r in\n MH.hide (QModel.writer_static_iv w) ==\n QSpec.derive_secret ha ts QSpec.label_iv 12 /\\\n MH.hide k1 == QSpec.derive_secret ha ts\n QSpec.label_key (QSpec.cipher_keysize ea) /\\\n MH.hide k2 == QUIC.Spec.derive_secret ha ts\n QUIC.Spec.label_hp (QSpec.cipher_keysize ea)\n else True\n\nnoeq type mstate_t i =\n| Ideal:\n writer: QModel.stream_writer i ->\n reader: QModel.stream_reader writer ->\n ts: itraffic_secret i{derived reader ts} -> // FIXME erased\n mstate_t i\n\nlet istate_t i = QImpl.state i\n\nnoeq\ntype raise (i: index { not I.model }): Type u#1 = | Raise: s:istate_t i -> raise i\n\nlet state i =\n if I.model then mstate_t (mid i)\n else raise (iid i)\n\nlet mstate (#i:index{I.model}) (s:state i) = s <: mstate_t (mid i)\nlet istate (#i:index{not I.model}) (s:state i) = (s <: raise (iid i)).s", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "MH", "full_module": "Model.Helpers" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: FStar.Monotonic.HyperStack.mem -> s: QUIC.state i -> Prims.GTot LowStar.Monotonic.Buffer.loc", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.index", "FStar.Monotonic.HyperStack.mem", "QUIC.state", "Model.Flags.model", "LowStar.Monotonic.Buffer.loc_union", "Model.QUIC.rfootprint", "QUIC.mid", "QUIC.__proj__Ideal__item__writer", "QUIC.mstate", "QUIC.__proj__Ideal__item__reader", "Model.QUIC.footprint", "Prims.bool", "QUIC.State.footprint", "QUIC.iid", "QUIC.istate", "LowStar.Monotonic.Buffer.loc" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val footprint: #i:index -> HS.mem -> state i -> GTot B.loc\nlet footprint #i h s =", "completed_definiton": "if I.model\nthen (QModel.rfootprint (mstate s).reader) `B.loc_union` (QModel.footprint (mstate s).writer)\nelse QImpl.footprint h (istate s)", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.iid", "original_source_type": "", "source_type": "val iid : i: QUIC.index{Prims.op_Negation Model.Flags.model} -> QUIC.State.index", "source_definition": "let iid (i:index{not I.model}) = i <: QImpl.index", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 31, "start_col": 33, "end_line": 31, "end_col": 49 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: QUIC.index{Prims.op_Negation Model.Flags.model} -> QUIC.State.index", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.index", "Prims.b2t", "Prims.op_Negation", "Model.Flags.model", "QUIC.State.index" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let iid (i: index{not I.model}) =", "completed_definiton": "i <: QImpl.index", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.mid", "original_source_type": "", "source_type": "val mid : i: QUIC.index{Model.Flags.model} -> Model.QUIC.id", "source_definition": "let mid (i:index{I.model}) = i <: QModel.id", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 30, "start_col": 29, "end_line": 30, "end_col": 43 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: QUIC.index{Model.Flags.model} -> Model.QUIC.id", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.index", "Prims.b2t", "Model.Flags.model", "Model.QUIC.id" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let mid (i: index{I.model}) =", "completed_definiton": "i <: QModel.id", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.g_traffic_secret", "original_source_type": "val g_traffic_secret: #i:index -> state i -> HS.mem -> GTot (traffic_secret i)", "source_type": "val g_traffic_secret: #i:index -> state i -> HS.mem -> GTot (traffic_secret i)", "source_definition": "let g_traffic_secret #i s h =\n if I.model then (mstate s).ts\n else\n QImpl.g_traffic_secret (B.deref h (istate s))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 91, "start_col": 2, "end_line": 93, "end_col": 49 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index\n\nlet mid (i:index{I.model}) = i <: QModel.id\nlet iid (i:index{not I.model}) = i <: QImpl.index\n\nlet alg (i:index) =\n if I.model then I.ae_id_ginfo (dfst (mid i))\n else (iid i).QImpl.aead_alg\n\nlet halg (i:index) =\n if I.model then I.ae_id_ghash (dfst (mid i))\n else (iid i).QImpl.hash_alg\n\nlet itraffic_secret (i:QModel.id) =\n Spec.Hash.Definitions.bytes_hash (I.ae_id_ghash (dfst i))\n\nmodule MH = Model.Helpers\n\nlet derived (#i:QModel.id) (#w:QModel.stream_writer i) (r:QModel.stream_reader w) (ts:itraffic_secret i) =\n if I.model && QModel.unsafe i then\n let ha = I.ae_id_hash (dfst i) in\n let ea = I.ae_id_info (dfst i) in\n let (k1, k2) = QModel.reader_leak r in\n MH.hide (QModel.writer_static_iv w) ==\n QSpec.derive_secret ha ts QSpec.label_iv 12 /\\\n MH.hide k1 == QSpec.derive_secret ha ts\n QSpec.label_key (QSpec.cipher_keysize ea) /\\\n MH.hide k2 == QUIC.Spec.derive_secret ha ts\n QUIC.Spec.label_hp (QSpec.cipher_keysize ea)\n else True\n\nnoeq type mstate_t i =\n| Ideal:\n writer: QModel.stream_writer i ->\n reader: QModel.stream_reader writer ->\n ts: itraffic_secret i{derived reader ts} -> // FIXME erased\n mstate_t i\n\nlet istate_t i = QImpl.state i\n\nnoeq\ntype raise (i: index { not I.model }): Type u#1 = | Raise: s:istate_t i -> raise i\n\nlet state i =\n if I.model then mstate_t (mid i)\n else raise (iid i)\n\nlet mstate (#i:index{I.model}) (s:state i) = s <: mstate_t (mid i)\nlet istate (#i:index{not I.model}) (s:state i) = (s <: raise (iid i)).s\n\nlet footprint #i h s =\n if I.model then\n QModel.rfootprint (mstate s).reader `B.loc_union` QModel.footprint (mstate s).writer\n else QImpl.footprint h (istate s)\n\nlet invariant #i h s =\n if I.model then\n let Ideal writer reader _ = mstate s in\n QModel.invariant writer h /\\ QModel.rinvariant reader h /\\\n B.loc_disjoint (QModel.rfootprint (mstate s).reader) (QModel.footprint (mstate s).writer)\n else QImpl.invariant h (istate s)", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "MH", "full_module": "Model.Helpers" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: QUIC.state i -> h: FStar.Monotonic.HyperStack.mem -> Prims.GTot (QUIC.traffic_secret i)", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.index", "QUIC.state", "FStar.Monotonic.HyperStack.mem", "Model.Flags.model", "QUIC.__proj__Ideal__item__ts", "QUIC.mid", "QUIC.mstate", "Prims.bool", "QUIC.State.g_traffic_secret", "QUIC.iid", "LowStar.Monotonic.Buffer.deref", "QUIC.State.state_s", "LowStar.Buffer.trivial_preorder", "QUIC.istate", "QUIC.traffic_secret" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val g_traffic_secret: #i:index -> state i -> HS.mem -> GTot (traffic_secret i)\nlet g_traffic_secret #i s h =", "completed_definiton": "if I.model then (mstate s).ts else QImpl.g_traffic_secret (B.deref h (istate s))", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.mstate", "original_source_type": "", "source_type": "val mstate : s: QUIC.state i -> QUIC.mstate_t (QUIC.mid i)", "source_definition": "let mstate (#i:index{I.model}) (s:state i) = s <: mstate_t (mid i)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 75, "start_col": 45, "end_line": 75, "end_col": 66 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index\n\nlet mid (i:index{I.model}) = i <: QModel.id\nlet iid (i:index{not I.model}) = i <: QImpl.index\n\nlet alg (i:index) =\n if I.model then I.ae_id_ginfo (dfst (mid i))\n else (iid i).QImpl.aead_alg\n\nlet halg (i:index) =\n if I.model then I.ae_id_ghash (dfst (mid i))\n else (iid i).QImpl.hash_alg\n\nlet itraffic_secret (i:QModel.id) =\n Spec.Hash.Definitions.bytes_hash (I.ae_id_ghash (dfst i))\n\nmodule MH = Model.Helpers\n\nlet derived (#i:QModel.id) (#w:QModel.stream_writer i) (r:QModel.stream_reader w) (ts:itraffic_secret i) =\n if I.model && QModel.unsafe i then\n let ha = I.ae_id_hash (dfst i) in\n let ea = I.ae_id_info (dfst i) in\n let (k1, k2) = QModel.reader_leak r in\n MH.hide (QModel.writer_static_iv w) ==\n QSpec.derive_secret ha ts QSpec.label_iv 12 /\\\n MH.hide k1 == QSpec.derive_secret ha ts\n QSpec.label_key (QSpec.cipher_keysize ea) /\\\n MH.hide k2 == QUIC.Spec.derive_secret ha ts\n QUIC.Spec.label_hp (QSpec.cipher_keysize ea)\n else True\n\nnoeq type mstate_t i =\n| Ideal:\n writer: QModel.stream_writer i ->\n reader: QModel.stream_reader writer ->\n ts: itraffic_secret i{derived reader ts} -> // FIXME erased\n mstate_t i\n\nlet istate_t i = QImpl.state i\n\nnoeq\ntype raise (i: index { not I.model }): Type u#1 = | Raise: s:istate_t i -> raise i\n\nlet state i =\n if I.model then mstate_t (mid i)\n else raise (iid i)", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "MH", "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: QUIC.state i -> QUIC.mstate_t (QUIC.mid i)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.index", "Prims.b2t", "Model.Flags.model", "QUIC.state", "QUIC.mstate_t", "QUIC.mid" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let mstate (#i: index{I.model}) (s: state i) =", "completed_definiton": "s <: mstate_t (mid i)", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.alg", "original_source_type": "val alg: index -> GTot QSpec.ea", "source_type": "val alg: index -> GTot QSpec.ea", "source_definition": "let alg (i:index) =\n if I.model then I.ae_id_ginfo (dfst (mid i))\n else (iid i).QImpl.aead_alg", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 34, "start_col": 2, "end_line": 35, "end_col": 29 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index\n\nlet mid (i:index{I.model}) = i <: QModel.id\nlet iid (i:index{not I.model}) = i <: QImpl.index", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: QUIC.index -> Prims.GTot QUIC.Spec.Crypto.ea", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.index", "Model.Flags.model", "Model.Indexing.ae_id_ginfo", "FStar.Pervasives.dfst", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Prims.b2t", "Model.PNE.is_safe", "Model.AEAD.is_safe", "QUIC.mid", "Prims.bool", "QUIC.State.__proj__Mkindex__item__aead_alg", "QUIC.iid", "QUIC.Spec.Crypto.ea" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val alg: index -> GTot QSpec.ea\nlet alg (i: index) =", "completed_definiton": "if I.model then I.ae_id_ginfo (dfst (mid i)) else (iid i).QImpl.aead_alg", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.halg", "original_source_type": "val halg: index -> GTot QSpec.ha", "source_type": "val halg: index -> GTot QSpec.ha", "source_definition": "let halg (i:index) =\n if I.model then I.ae_id_ghash (dfst (mid i))\n else (iid i).QImpl.hash_alg", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 38, "start_col": 2, "end_line": 39, "end_col": 29 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index\n\nlet mid (i:index{I.model}) = i <: QModel.id\nlet iid (i:index{not I.model}) = i <: QImpl.index\n\nlet alg (i:index) =\n if I.model then I.ae_id_ginfo (dfst (mid i))\n else (iid i).QImpl.aead_alg", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: QUIC.index -> Prims.GTot QUIC.Spec.Crypto.ha", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.index", "Model.Flags.model", "Model.Indexing.ae_id_ghash", "FStar.Pervasives.dfst", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Prims.b2t", "Model.PNE.is_safe", "Model.AEAD.is_safe", "QUIC.mid", "Prims.bool", "QUIC.State.__proj__Mkindex__item__hash_alg", "QUIC.iid", "QUIC.Spec.Crypto.ha" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val halg: index -> GTot QSpec.ha\nlet halg (i: index) =", "completed_definiton": "if I.model then I.ae_id_ghash (dfst (mid i)) else (iid i).QImpl.hash_alg", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.state", "original_source_type": "val state: index -> Type u#1", "source_type": "val state: index -> Type u#1", "source_definition": "let state i =\n if I.model then mstate_t (mid i)\n else raise (iid i)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 72, "start_col": 2, "end_line": 73, "end_col": 20 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index\n\nlet mid (i:index{I.model}) = i <: QModel.id\nlet iid (i:index{not I.model}) = i <: QImpl.index\n\nlet alg (i:index) =\n if I.model then I.ae_id_ginfo (dfst (mid i))\n else (iid i).QImpl.aead_alg\n\nlet halg (i:index) =\n if I.model then I.ae_id_ghash (dfst (mid i))\n else (iid i).QImpl.hash_alg\n\nlet itraffic_secret (i:QModel.id) =\n Spec.Hash.Definitions.bytes_hash (I.ae_id_ghash (dfst i))\n\nmodule MH = Model.Helpers\n\nlet derived (#i:QModel.id) (#w:QModel.stream_writer i) (r:QModel.stream_reader w) (ts:itraffic_secret i) =\n if I.model && QModel.unsafe i then\n let ha = I.ae_id_hash (dfst i) in\n let ea = I.ae_id_info (dfst i) in\n let (k1, k2) = QModel.reader_leak r in\n MH.hide (QModel.writer_static_iv w) ==\n QSpec.derive_secret ha ts QSpec.label_iv 12 /\\\n MH.hide k1 == QSpec.derive_secret ha ts\n QSpec.label_key (QSpec.cipher_keysize ea) /\\\n MH.hide k2 == QUIC.Spec.derive_secret ha ts\n QUIC.Spec.label_hp (QSpec.cipher_keysize ea)\n else True\n\nnoeq type mstate_t i =\n| Ideal:\n writer: QModel.stream_writer i ->\n reader: QModel.stream_reader writer ->\n ts: itraffic_secret i{derived reader ts} -> // FIXME erased\n mstate_t i\n\nlet istate_t i = QImpl.state i\n\nnoeq\ntype raise (i: index { not I.model }): Type u#1 = | Raise: s:istate_t i -> raise i", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "MH", "full_module": "Model.Helpers" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: QUIC.index -> Type", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.index", "Model.Flags.model", "QUIC.mstate_t", "QUIC.mid", "Prims.bool", "QUIC.raise", "QUIC.iid" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val state: index -> Type u#1\nlet state i =", "completed_definiton": "if I.model then mstate_t (mid i) else raise (iid i)", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.index", "original_source_type": "val index:eqtype", "source_type": "val index:eqtype", "source_definition": "let index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 28, "start_col": 2, "end_line": 28, "end_col": 66 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "Prims.eqtype", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.Flags.model", "Model.QUIC.id", "Prims.b2t", "Model.QUIC.unsafe", "Prims.bool", "QUIC.State.index", "Prims.eqtype" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "val index:eqtype\nlet index =", "completed_definiton": "if I.model then i: QModel.id{QModel.unsafe i} else QImpl.index", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.fstar_bytes_of_seq", "original_source_type": "val fstar_bytes_of_seq (s: S.seq UInt8.t)\n : Pure FStar.Bytes.bytes\n (requires S.length s < pow2 32)\n (ensures fun b -> (FStar.Bytes.reveal b) `S.equal` s)", "source_type": "val fstar_bytes_of_seq (s: S.seq UInt8.t)\n : Pure FStar.Bytes.bytes\n (requires S.length s < pow2 32)\n (ensures fun b -> (FStar.Bytes.reveal b) `S.equal` s)", "source_definition": "let fstar_bytes_of_seq (s: S.seq UInt8.t):\n Pure FStar.Bytes.bytes\n (requires S.length s < pow2 32)\n (ensures fun b -> FStar.Bytes.reveal b `S.equal` s)\n=\n assert_norm (pow2 32 = 4294967296);\n LowParse.SLow.Base.bytes_of_seq s", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 188, "start_col": 2, "end_line": 189, "end_col": 35 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index\n\nlet mid (i:index{I.model}) = i <: QModel.id\nlet iid (i:index{not I.model}) = i <: QImpl.index\n\nlet alg (i:index) =\n if I.model then I.ae_id_ginfo (dfst (mid i))\n else (iid i).QImpl.aead_alg\n\nlet halg (i:index) =\n if I.model then I.ae_id_ghash (dfst (mid i))\n else (iid i).QImpl.hash_alg\n\nlet itraffic_secret (i:QModel.id) =\n Spec.Hash.Definitions.bytes_hash (I.ae_id_ghash (dfst i))\n\nmodule MH = Model.Helpers\n\nlet derived (#i:QModel.id) (#w:QModel.stream_writer i) (r:QModel.stream_reader w) (ts:itraffic_secret i) =\n if I.model && QModel.unsafe i then\n let ha = I.ae_id_hash (dfst i) in\n let ea = I.ae_id_info (dfst i) in\n let (k1, k2) = QModel.reader_leak r in\n MH.hide (QModel.writer_static_iv w) ==\n QSpec.derive_secret ha ts QSpec.label_iv 12 /\\\n MH.hide k1 == QSpec.derive_secret ha ts\n QSpec.label_key (QSpec.cipher_keysize ea) /\\\n MH.hide k2 == QUIC.Spec.derive_secret ha ts\n QUIC.Spec.label_hp (QSpec.cipher_keysize ea)\n else True\n\nnoeq type mstate_t i =\n| Ideal:\n writer: QModel.stream_writer i ->\n reader: QModel.stream_reader writer ->\n ts: itraffic_secret i{derived reader ts} -> // FIXME erased\n mstate_t i\n\nlet istate_t i = QImpl.state i\n\nnoeq\ntype raise (i: index { not I.model }): Type u#1 = | Raise: s:istate_t i -> raise i\n\nlet state i =\n if I.model then mstate_t (mid i)\n else raise (iid i)\n\nlet mstate (#i:index{I.model}) (s:state i) = s <: mstate_t (mid i)\nlet istate (#i:index{not I.model}) (s:state i) = (s <: raise (iid i)).s\n\nlet footprint #i h s =\n if I.model then\n QModel.rfootprint (mstate s).reader `B.loc_union` QModel.footprint (mstate s).writer\n else QImpl.footprint h (istate s)\n\nlet invariant #i h s =\n if I.model then\n let Ideal writer reader _ = mstate s in\n QModel.invariant writer h /\\ QModel.rinvariant reader h /\\\n B.loc_disjoint (QModel.rfootprint (mstate s).reader) (QModel.footprint (mstate s).writer)\n else QImpl.invariant h (istate s)\n\nlet g_traffic_secret #i s h =\n if I.model then (mstate s).ts\n else\n QImpl.g_traffic_secret (B.deref h (istate s))\n\nlet g_initial_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.writer_offset #(mid i) (mstate s).writer)\n else\n QImpl.g_initial_packet_number (B.deref h (istate s))\n\nlet g_last_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.expected_pnT #(mid i) (mstate s).reader h)\n else\n QImpl.g_last_packet_number (B.deref h (istate s)) h\n\nlet g_next_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.wctrT #(mid i) (mstate s).writer h)\n else\n QImpl.g_last_packet_number (B.deref h (istate s)) h\n\n// TODO: reveal in the interface (just for good measure)\nlet frame_invariant #i l s h0 h1 =\n if I.model then\n let Ideal w r _ = mstate #(mid i) s in\n QModel.frame_invariant w h0 l h1;\n QModel.rframe_invariant r h0 l h1\n else\n QImpl.frame_invariant #(iid i) l s h0 h1\n\n/// Ingredients we need for the mythical switch\n\n/// First, a stateful equivalent of as_seq. Implementation doesn't need to be\n/// efficient.\n\nlet rec as_seq #a (b: B.buffer a) (l: UInt32.t { l == B.len b }): Stack (S.seq a)\n (requires fun h0 ->\n B.live h0 b)\n (ensures fun h0 r h1 ->\n h0 == h1 /\\\n B.as_seq h0 b `S.equal` r)\n=\n let h0 = ST.get () in\n if l = 0ul then\n S.empty\n else\n let hd = B.index b 0ul in\n let l = l `U32.sub` 1ul in\n let b = B.sub b 1ul l in\n S.cons hd (as_seq b l)\n\nlet rec from_seq #a (dst: B.buffer a) (s: S.seq a): Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\\n B.length dst == S.length s)\n (ensures fun h0 _ h1 ->\n B.modifies (B.loc_buffer dst) h0 h1 /\\\n B.as_seq h1 dst `S.equal` s)\n=\n if S.length s = 0 then\n ()\n else begin\n let hd = B.sub dst 0ul 1ul in\n let tl = B.sub dst 1ul (UInt32.uint_to_t (S.length s - 1)) in\n B.upd hd 0ul (S.index s 0);\n from_seq tl (S.slice s 1 (S.length s));\n let h1 = ST.get () in\n calc (S.equal) {\n B.as_seq h1 dst;\n (S.equal) { }\n S.append (S.slice (B.as_seq h1 hd) 0 1) (S.slice (B.as_seq h1 dst) 1 (S.length s));\n (S.equal) { }\n S.append (S.create 1 (S.index s 0)) (S.slice (B.as_seq h1 dst) 1 (S.length s));\n (S.equal) { }\n S.append (S.create 1 (S.index s 0)) (S.slice s 1 (S.length s));\n (S.equal) { }\n s;\n }\n end\n\n#set-options \"--fuel 0 --ifuel 0 --z3rlimit 200 --using_facts_from '*,-LowStar.Monotonic.Buffer.unused_in_not_unused_in_disjoint_2'\"\n\nlet nat_of_u8 (x: Lib.IntTypes.uint8) =\n UInt8.v (Lib.RawIntTypes.u8_to_UInt8 x)\n\nlet reveal_bitfield #n (x: QUIC.Spec.secret_bitfield n): QUIC.Spec.bitfield n =\n Lib.RawIntTypes.u8_to_UInt8 x\n\nlet fstar_bytes_of_seq (s: S.seq UInt8.t):\n Pure FStar.Bytes.bytes\n (requires S.length s < pow2 32)\n (ensures fun b -> FStar.Bytes.reveal b `S.equal` s)", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "MH", "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 200, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: FStar.Seq.Base.seq FStar.UInt8.t -> Prims.Pure FStar.Bytes.bytes", "effect": "Prims.Pure", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "FStar.UInt8.t", "LowParse.SLow.Base.bytes_of_seq", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.b2t", "Prims.op_Equality", "Prims.int", "Prims.pow2", "FStar.Bytes.bytes", "Prims.op_LessThan", "FStar.Seq.Base.length", "FStar.Seq.Base.equal", "FStar.Bytes.byte", "FStar.Bytes.reveal" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val fstar_bytes_of_seq (s: S.seq UInt8.t)\n : Pure FStar.Bytes.bytes\n (requires S.length s < pow2 32)\n (ensures fun b -> (FStar.Bytes.reveal b) `S.equal` s)\nlet fstar_bytes_of_seq (s: S.seq UInt8.t)\n : Pure FStar.Bytes.bytes\n (requires S.length s < pow2 32)\n (ensures fun b -> (FStar.Bytes.reveal b) `S.equal` s) =", "completed_definiton": "assert_norm (pow2 32 = 4294967296);\nLowParse.SLow.Base.bytes_of_seq s", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.reveal_bitfield", "original_source_type": "val reveal_bitfield (#n: _) (x: QUIC.Spec.secret_bitfield n) : QUIC.Spec.bitfield n", "source_type": "val reveal_bitfield (#n: _) (x: QUIC.Spec.secret_bitfield n) : QUIC.Spec.bitfield n", "source_definition": "let reveal_bitfield #n (x: QUIC.Spec.secret_bitfield n): QUIC.Spec.bitfield n =\n Lib.RawIntTypes.u8_to_UInt8 x", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 181, "start_col": 2, "end_line": 181, "end_col": 31 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index\n\nlet mid (i:index{I.model}) = i <: QModel.id\nlet iid (i:index{not I.model}) = i <: QImpl.index\n\nlet alg (i:index) =\n if I.model then I.ae_id_ginfo (dfst (mid i))\n else (iid i).QImpl.aead_alg\n\nlet halg (i:index) =\n if I.model then I.ae_id_ghash (dfst (mid i))\n else (iid i).QImpl.hash_alg\n\nlet itraffic_secret (i:QModel.id) =\n Spec.Hash.Definitions.bytes_hash (I.ae_id_ghash (dfst i))\n\nmodule MH = Model.Helpers\n\nlet derived (#i:QModel.id) (#w:QModel.stream_writer i) (r:QModel.stream_reader w) (ts:itraffic_secret i) =\n if I.model && QModel.unsafe i then\n let ha = I.ae_id_hash (dfst i) in\n let ea = I.ae_id_info (dfst i) in\n let (k1, k2) = QModel.reader_leak r in\n MH.hide (QModel.writer_static_iv w) ==\n QSpec.derive_secret ha ts QSpec.label_iv 12 /\\\n MH.hide k1 == QSpec.derive_secret ha ts\n QSpec.label_key (QSpec.cipher_keysize ea) /\\\n MH.hide k2 == QUIC.Spec.derive_secret ha ts\n QUIC.Spec.label_hp (QSpec.cipher_keysize ea)\n else True\n\nnoeq type mstate_t i =\n| Ideal:\n writer: QModel.stream_writer i ->\n reader: QModel.stream_reader writer ->\n ts: itraffic_secret i{derived reader ts} -> // FIXME erased\n mstate_t i\n\nlet istate_t i = QImpl.state i\n\nnoeq\ntype raise (i: index { not I.model }): Type u#1 = | Raise: s:istate_t i -> raise i\n\nlet state i =\n if I.model then mstate_t (mid i)\n else raise (iid i)\n\nlet mstate (#i:index{I.model}) (s:state i) = s <: mstate_t (mid i)\nlet istate (#i:index{not I.model}) (s:state i) = (s <: raise (iid i)).s\n\nlet footprint #i h s =\n if I.model then\n QModel.rfootprint (mstate s).reader `B.loc_union` QModel.footprint (mstate s).writer\n else QImpl.footprint h (istate s)\n\nlet invariant #i h s =\n if I.model then\n let Ideal writer reader _ = mstate s in\n QModel.invariant writer h /\\ QModel.rinvariant reader h /\\\n B.loc_disjoint (QModel.rfootprint (mstate s).reader) (QModel.footprint (mstate s).writer)\n else QImpl.invariant h (istate s)\n\nlet g_traffic_secret #i s h =\n if I.model then (mstate s).ts\n else\n QImpl.g_traffic_secret (B.deref h (istate s))\n\nlet g_initial_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.writer_offset #(mid i) (mstate s).writer)\n else\n QImpl.g_initial_packet_number (B.deref h (istate s))\n\nlet g_last_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.expected_pnT #(mid i) (mstate s).reader h)\n else\n QImpl.g_last_packet_number (B.deref h (istate s)) h\n\nlet g_next_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.wctrT #(mid i) (mstate s).writer h)\n else\n QImpl.g_last_packet_number (B.deref h (istate s)) h\n\n// TODO: reveal in the interface (just for good measure)\nlet frame_invariant #i l s h0 h1 =\n if I.model then\n let Ideal w r _ = mstate #(mid i) s in\n QModel.frame_invariant w h0 l h1;\n QModel.rframe_invariant r h0 l h1\n else\n QImpl.frame_invariant #(iid i) l s h0 h1\n\n/// Ingredients we need for the mythical switch\n\n/// First, a stateful equivalent of as_seq. Implementation doesn't need to be\n/// efficient.\n\nlet rec as_seq #a (b: B.buffer a) (l: UInt32.t { l == B.len b }): Stack (S.seq a)\n (requires fun h0 ->\n B.live h0 b)\n (ensures fun h0 r h1 ->\n h0 == h1 /\\\n B.as_seq h0 b `S.equal` r)\n=\n let h0 = ST.get () in\n if l = 0ul then\n S.empty\n else\n let hd = B.index b 0ul in\n let l = l `U32.sub` 1ul in\n let b = B.sub b 1ul l in\n S.cons hd (as_seq b l)\n\nlet rec from_seq #a (dst: B.buffer a) (s: S.seq a): Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\\n B.length dst == S.length s)\n (ensures fun h0 _ h1 ->\n B.modifies (B.loc_buffer dst) h0 h1 /\\\n B.as_seq h1 dst `S.equal` s)\n=\n if S.length s = 0 then\n ()\n else begin\n let hd = B.sub dst 0ul 1ul in\n let tl = B.sub dst 1ul (UInt32.uint_to_t (S.length s - 1)) in\n B.upd hd 0ul (S.index s 0);\n from_seq tl (S.slice s 1 (S.length s));\n let h1 = ST.get () in\n calc (S.equal) {\n B.as_seq h1 dst;\n (S.equal) { }\n S.append (S.slice (B.as_seq h1 hd) 0 1) (S.slice (B.as_seq h1 dst) 1 (S.length s));\n (S.equal) { }\n S.append (S.create 1 (S.index s 0)) (S.slice (B.as_seq h1 dst) 1 (S.length s));\n (S.equal) { }\n S.append (S.create 1 (S.index s 0)) (S.slice s 1 (S.length s));\n (S.equal) { }\n s;\n }\n end\n\n#set-options \"--fuel 0 --ifuel 0 --z3rlimit 200 --using_facts_from '*,-LowStar.Monotonic.Buffer.unused_in_not_unused_in_disjoint_2'\"\n\nlet nat_of_u8 (x: Lib.IntTypes.uint8) =\n UInt8.v (Lib.RawIntTypes.u8_to_UInt8 x)", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "MH", "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 200, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: QUIC.Spec.Base.secret_bitfield n -> QUIC.Spec.Base.bitfield n", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "QUIC.Spec.Base.secret_bitfield", "Lib.RawIntTypes.u8_to_UInt8", "QUIC.Spec.Base.bitfield" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val reveal_bitfield (#n: _) (x: QUIC.Spec.secret_bitfield n) : QUIC.Spec.bitfield n\nlet reveal_bitfield #n (x: QUIC.Spec.secret_bitfield n) : QUIC.Spec.bitfield n =", "completed_definiton": "Lib.RawIntTypes.u8_to_UInt8 x", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.invariant", "original_source_type": "val invariant: #i:index -> HS.mem -> state i -> Type0", "source_type": "val invariant: #i:index -> HS.mem -> state i -> Type0", "source_definition": "let invariant #i h s =\n if I.model then\n let Ideal writer reader _ = mstate s in\n QModel.invariant writer h /\\ QModel.rinvariant reader h /\\\n B.loc_disjoint (QModel.rfootprint (mstate s).reader) (QModel.footprint (mstate s).writer)\n else QImpl.invariant h (istate s)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 84, "start_col": 2, "end_line": 88, "end_col": 35 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index\n\nlet mid (i:index{I.model}) = i <: QModel.id\nlet iid (i:index{not I.model}) = i <: QImpl.index\n\nlet alg (i:index) =\n if I.model then I.ae_id_ginfo (dfst (mid i))\n else (iid i).QImpl.aead_alg\n\nlet halg (i:index) =\n if I.model then I.ae_id_ghash (dfst (mid i))\n else (iid i).QImpl.hash_alg\n\nlet itraffic_secret (i:QModel.id) =\n Spec.Hash.Definitions.bytes_hash (I.ae_id_ghash (dfst i))\n\nmodule MH = Model.Helpers\n\nlet derived (#i:QModel.id) (#w:QModel.stream_writer i) (r:QModel.stream_reader w) (ts:itraffic_secret i) =\n if I.model && QModel.unsafe i then\n let ha = I.ae_id_hash (dfst i) in\n let ea = I.ae_id_info (dfst i) in\n let (k1, k2) = QModel.reader_leak r in\n MH.hide (QModel.writer_static_iv w) ==\n QSpec.derive_secret ha ts QSpec.label_iv 12 /\\\n MH.hide k1 == QSpec.derive_secret ha ts\n QSpec.label_key (QSpec.cipher_keysize ea) /\\\n MH.hide k2 == QUIC.Spec.derive_secret ha ts\n QUIC.Spec.label_hp (QSpec.cipher_keysize ea)\n else True\n\nnoeq type mstate_t i =\n| Ideal:\n writer: QModel.stream_writer i ->\n reader: QModel.stream_reader writer ->\n ts: itraffic_secret i{derived reader ts} -> // FIXME erased\n mstate_t i\n\nlet istate_t i = QImpl.state i\n\nnoeq\ntype raise (i: index { not I.model }): Type u#1 = | Raise: s:istate_t i -> raise i\n\nlet state i =\n if I.model then mstate_t (mid i)\n else raise (iid i)\n\nlet mstate (#i:index{I.model}) (s:state i) = s <: mstate_t (mid i)\nlet istate (#i:index{not I.model}) (s:state i) = (s <: raise (iid i)).s\n\nlet footprint #i h s =\n if I.model then\n QModel.rfootprint (mstate s).reader `B.loc_union` QModel.footprint (mstate s).writer\n else QImpl.footprint h (istate s)", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "MH", "full_module": "Model.Helpers" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: FStar.Monotonic.HyperStack.mem -> s: QUIC.state i -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.index", "FStar.Monotonic.HyperStack.mem", "QUIC.state", "Model.Flags.model", "Model.QUIC.stream_writer", "QUIC.mid", "Model.QUIC.stream_reader", "QUIC.itraffic_secret", "QUIC.derived", "Prims.l_and", "Model.QUIC.invariant", "Model.QUIC.rinvariant", "LowStar.Monotonic.Buffer.loc_disjoint", "Model.QUIC.rfootprint", "QUIC.__proj__Ideal__item__writer", "QUIC.mstate", "QUIC.__proj__Ideal__item__reader", "Model.QUIC.footprint", "QUIC.mstate_t", "Prims.bool", "QUIC.State.invariant", "QUIC.iid", "QUIC.istate" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val invariant: #i:index -> HS.mem -> state i -> Type0\nlet invariant #i h s =", "completed_definiton": "if I.model\nthen\n let Ideal writer reader _ = mstate s in\n QModel.invariant writer h /\\ QModel.rinvariant reader h /\\\n B.loc_disjoint (QModel.rfootprint (mstate s).reader) (QModel.footprint (mstate s).writer)\nelse QImpl.invariant h (istate s)", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.istate", "original_source_type": "", "source_type": "val istate : s: QUIC.state i -> QUIC.istate_t (QUIC.iid i)", "source_definition": "let istate (#i:index{not I.model}) (s:state i) = (s <: raise (iid i)).s", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 76, "start_col": 49, "end_line": 76, "end_col": 71 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index\n\nlet mid (i:index{I.model}) = i <: QModel.id\nlet iid (i:index{not I.model}) = i <: QImpl.index\n\nlet alg (i:index) =\n if I.model then I.ae_id_ginfo (dfst (mid i))\n else (iid i).QImpl.aead_alg\n\nlet halg (i:index) =\n if I.model then I.ae_id_ghash (dfst (mid i))\n else (iid i).QImpl.hash_alg\n\nlet itraffic_secret (i:QModel.id) =\n Spec.Hash.Definitions.bytes_hash (I.ae_id_ghash (dfst i))\n\nmodule MH = Model.Helpers\n\nlet derived (#i:QModel.id) (#w:QModel.stream_writer i) (r:QModel.stream_reader w) (ts:itraffic_secret i) =\n if I.model && QModel.unsafe i then\n let ha = I.ae_id_hash (dfst i) in\n let ea = I.ae_id_info (dfst i) in\n let (k1, k2) = QModel.reader_leak r in\n MH.hide (QModel.writer_static_iv w) ==\n QSpec.derive_secret ha ts QSpec.label_iv 12 /\\\n MH.hide k1 == QSpec.derive_secret ha ts\n QSpec.label_key (QSpec.cipher_keysize ea) /\\\n MH.hide k2 == QUIC.Spec.derive_secret ha ts\n QUIC.Spec.label_hp (QSpec.cipher_keysize ea)\n else True\n\nnoeq type mstate_t i =\n| Ideal:\n writer: QModel.stream_writer i ->\n reader: QModel.stream_reader writer ->\n ts: itraffic_secret i{derived reader ts} -> // FIXME erased\n mstate_t i\n\nlet istate_t i = QImpl.state i\n\nnoeq\ntype raise (i: index { not I.model }): Type u#1 = | Raise: s:istate_t i -> raise i\n\nlet state i =\n if I.model then mstate_t (mid i)\n else raise (iid i)", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "MH", "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: QUIC.state i -> QUIC.istate_t (QUIC.iid i)", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.index", "Prims.b2t", "Prims.op_Negation", "Model.Flags.model", "QUIC.state", "QUIC.__proj__Raise__item__s", "QUIC.iid", "QUIC.raise", "QUIC.istate_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let istate (#i: index{not I.model}) (s: state i) =", "completed_definiton": "(s <: raise (iid i)).s", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.frame_invariant", "original_source_type": "", "source_type": "val frame_invariant : l: LowStar.Monotonic.Buffer.loc ->\n s: QUIC.state (QUIC.mid i) ->\n h0: FStar.Monotonic.HyperStack.mem ->\n h1: FStar.Monotonic.HyperStack.mem\n -> Prims.unit", "source_definition": "let frame_invariant #i l s h0 h1 =\n if I.model then\n let Ideal w r _ = mstate #(mid i) s in\n QModel.frame_invariant w h0 l h1;\n QModel.rframe_invariant r h0 l h1\n else\n QImpl.frame_invariant #(iid i) l s h0 h1", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 118, "start_col": 2, "end_line": 123, "end_col": 44 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index\n\nlet mid (i:index{I.model}) = i <: QModel.id\nlet iid (i:index{not I.model}) = i <: QImpl.index\n\nlet alg (i:index) =\n if I.model then I.ae_id_ginfo (dfst (mid i))\n else (iid i).QImpl.aead_alg\n\nlet halg (i:index) =\n if I.model then I.ae_id_ghash (dfst (mid i))\n else (iid i).QImpl.hash_alg\n\nlet itraffic_secret (i:QModel.id) =\n Spec.Hash.Definitions.bytes_hash (I.ae_id_ghash (dfst i))\n\nmodule MH = Model.Helpers\n\nlet derived (#i:QModel.id) (#w:QModel.stream_writer i) (r:QModel.stream_reader w) (ts:itraffic_secret i) =\n if I.model && QModel.unsafe i then\n let ha = I.ae_id_hash (dfst i) in\n let ea = I.ae_id_info (dfst i) in\n let (k1, k2) = QModel.reader_leak r in\n MH.hide (QModel.writer_static_iv w) ==\n QSpec.derive_secret ha ts QSpec.label_iv 12 /\\\n MH.hide k1 == QSpec.derive_secret ha ts\n QSpec.label_key (QSpec.cipher_keysize ea) /\\\n MH.hide k2 == QUIC.Spec.derive_secret ha ts\n QUIC.Spec.label_hp (QSpec.cipher_keysize ea)\n else True\n\nnoeq type mstate_t i =\n| Ideal:\n writer: QModel.stream_writer i ->\n reader: QModel.stream_reader writer ->\n ts: itraffic_secret i{derived reader ts} -> // FIXME erased\n mstate_t i\n\nlet istate_t i = QImpl.state i\n\nnoeq\ntype raise (i: index { not I.model }): Type u#1 = | Raise: s:istate_t i -> raise i\n\nlet state i =\n if I.model then mstate_t (mid i)\n else raise (iid i)\n\nlet mstate (#i:index{I.model}) (s:state i) = s <: mstate_t (mid i)\nlet istate (#i:index{not I.model}) (s:state i) = (s <: raise (iid i)).s\n\nlet footprint #i h s =\n if I.model then\n QModel.rfootprint (mstate s).reader `B.loc_union` QModel.footprint (mstate s).writer\n else QImpl.footprint h (istate s)\n\nlet invariant #i h s =\n if I.model then\n let Ideal writer reader _ = mstate s in\n QModel.invariant writer h /\\ QModel.rinvariant reader h /\\\n B.loc_disjoint (QModel.rfootprint (mstate s).reader) (QModel.footprint (mstate s).writer)\n else QImpl.invariant h (istate s)\n\nlet g_traffic_secret #i s h =\n if I.model then (mstate s).ts\n else\n QImpl.g_traffic_secret (B.deref h (istate s))\n\nlet g_initial_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.writer_offset #(mid i) (mstate s).writer)\n else\n QImpl.g_initial_packet_number (B.deref h (istate s))\n\nlet g_last_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.expected_pnT #(mid i) (mstate s).reader h)\n else\n QImpl.g_last_packet_number (B.deref h (istate s)) h\n\nlet g_next_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.wctrT #(mid i) (mstate s).writer h)\n else\n QImpl.g_last_packet_number (B.deref h (istate s)) h\n\n// TODO: reveal in the interface (just for good measure)", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "MH", "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n l: LowStar.Monotonic.Buffer.loc ->\n s: QUIC.state (QUIC.mid i) ->\n h0: FStar.Monotonic.HyperStack.mem ->\n h1: FStar.Monotonic.HyperStack.mem\n -> Prims.unit", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.index", "Prims.l_and", "Prims.b2t", "Model.Flags.model", "Prims.op_Negation", "LowStar.Monotonic.Buffer.loc", "QUIC.state", "QUIC.mid", "FStar.Monotonic.HyperStack.mem", "Model.QUIC.stream_writer", "Model.QUIC.stream_reader", "QUIC.itraffic_secret", "QUIC.derived", "Model.QUIC.rframe_invariant", "Prims.unit", "Model.QUIC.frame_invariant", "QUIC.mstate_t", "QUIC.mstate", "Prims.bool", "QUIC.State.frame_invariant", "QUIC.iid" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let frame_invariant #i l s h0 h1 =", "completed_definiton": "if I.model\nthen\n let Ideal w r _ = mstate #(mid i) s in\n QModel.frame_invariant w h0 l h1;\n QModel.rframe_invariant r h0 l h1\nelse QImpl.frame_invariant #(iid i) l s h0 h1", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.itraffic_secret", "original_source_type": "", "source_type": "val itraffic_secret : i: Model.QUIC.id -> Type0", "source_definition": "let itraffic_secret (i:QModel.id) =\n Spec.Hash.Definitions.bytes_hash (I.ae_id_ghash (dfst i))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 42, "start_col": 2, "end_line": 42, "end_col": 59 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index\n\nlet mid (i:index{I.model}) = i <: QModel.id\nlet iid (i:index{not I.model}) = i <: QImpl.index\n\nlet alg (i:index) =\n if I.model then I.ae_id_ginfo (dfst (mid i))\n else (iid i).QImpl.aead_alg\n\nlet halg (i:index) =\n if I.model then I.ae_id_ghash (dfst (mid i))\n else (iid i).QImpl.hash_alg", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "i: Model.QUIC.id -> Type0", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Spec.Hash.Definitions.bytes_hash", "Model.Indexing.ae_id_ghash", "FStar.Pervasives.dfst", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Prims.b2t", "Model.PNE.is_safe", "Model.AEAD.is_safe" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let itraffic_secret (i: QModel.id) =", "completed_definiton": "Spec.Hash.Definitions.bytes_hash (I.ae_id_ghash (dfst i))", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.g_initial_packet_number", "original_source_type": "val g_initial_packet_number: #i:index -> (s: state i) -> (h: HS.mem) -> GTot PN.packet_number_t", "source_type": "val g_initial_packet_number: #i:index -> (s: state i) -> (h: HS.mem) -> GTot PN.packet_number_t", "source_definition": "let g_initial_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.writer_offset #(mid i) (mstate s).writer)\n else\n QImpl.g_initial_packet_number (B.deref h (istate s))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 96, "start_col": 2, "end_line": 100, "end_col": 56 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index\n\nlet mid (i:index{I.model}) = i <: QModel.id\nlet iid (i:index{not I.model}) = i <: QImpl.index\n\nlet alg (i:index) =\n if I.model then I.ae_id_ginfo (dfst (mid i))\n else (iid i).QImpl.aead_alg\n\nlet halg (i:index) =\n if I.model then I.ae_id_ghash (dfst (mid i))\n else (iid i).QImpl.hash_alg\n\nlet itraffic_secret (i:QModel.id) =\n Spec.Hash.Definitions.bytes_hash (I.ae_id_ghash (dfst i))\n\nmodule MH = Model.Helpers\n\nlet derived (#i:QModel.id) (#w:QModel.stream_writer i) (r:QModel.stream_reader w) (ts:itraffic_secret i) =\n if I.model && QModel.unsafe i then\n let ha = I.ae_id_hash (dfst i) in\n let ea = I.ae_id_info (dfst i) in\n let (k1, k2) = QModel.reader_leak r in\n MH.hide (QModel.writer_static_iv w) ==\n QSpec.derive_secret ha ts QSpec.label_iv 12 /\\\n MH.hide k1 == QSpec.derive_secret ha ts\n QSpec.label_key (QSpec.cipher_keysize ea) /\\\n MH.hide k2 == QUIC.Spec.derive_secret ha ts\n QUIC.Spec.label_hp (QSpec.cipher_keysize ea)\n else True\n\nnoeq type mstate_t i =\n| Ideal:\n writer: QModel.stream_writer i ->\n reader: QModel.stream_reader writer ->\n ts: itraffic_secret i{derived reader ts} -> // FIXME erased\n mstate_t i\n\nlet istate_t i = QImpl.state i\n\nnoeq\ntype raise (i: index { not I.model }): Type u#1 = | Raise: s:istate_t i -> raise i\n\nlet state i =\n if I.model then mstate_t (mid i)\n else raise (iid i)\n\nlet mstate (#i:index{I.model}) (s:state i) = s <: mstate_t (mid i)\nlet istate (#i:index{not I.model}) (s:state i) = (s <: raise (iid i)).s\n\nlet footprint #i h s =\n if I.model then\n QModel.rfootprint (mstate s).reader `B.loc_union` QModel.footprint (mstate s).writer\n else QImpl.footprint h (istate s)\n\nlet invariant #i h s =\n if I.model then\n let Ideal writer reader _ = mstate s in\n QModel.invariant writer h /\\ QModel.rinvariant reader h /\\\n B.loc_disjoint (QModel.rfootprint (mstate s).reader) (QModel.footprint (mstate s).writer)\n else QImpl.invariant h (istate s)\n\nlet g_traffic_secret #i s h =\n if I.model then (mstate s).ts\n else\n QImpl.g_traffic_secret (B.deref h (istate s))", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "MH", "full_module": "Model.Helpers" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: QUIC.state i -> h: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot QUIC.Spec.PacketNumber.Base.packet_number_t", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.index", "QUIC.state", "FStar.Monotonic.HyperStack.mem", "Model.Flags.model", "Lib.IntTypes.u64", "Model.QUIC.writer_offset", "QUIC.mid", "QUIC.__proj__Ideal__item__writer", "QUIC.mstate", "Prims.bool", "QUIC.State.g_initial_packet_number", "QUIC.iid", "LowStar.Monotonic.Buffer.deref", "QUIC.State.state_s", "LowStar.Buffer.trivial_preorder", "QUIC.istate", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.b2t", "Prims.op_LessThan", "Prims.op_Subtraction", "Prims.pow2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val g_initial_packet_number: #i:index -> (s: state i) -> (h: HS.mem) -> GTot PN.packet_number_t\nlet g_initial_packet_number #i s h =", "completed_definiton": "assert_norm (pow2 62 - 1 < pow2 64);\nif I.model\nthen Lib.IntTypes.u64 (QModel.writer_offset #(mid i) (mstate s).writer)\nelse QImpl.g_initial_packet_number (B.deref h (istate s))", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.g_last_packet_number", "original_source_type": "val g_last_packet_number: #i:index -> (s:state i) -> (h: HS.mem { invariant h s }) ->\n GTot (pn: PN.packet_number_t {\n let open Lib.IntTypes in\n Secret.v pn >= Secret.v #U64 #SEC (g_initial_packet_number s h)\n })", "source_type": "val g_last_packet_number: #i:index -> (s:state i) -> (h: HS.mem { invariant h s }) ->\n GTot (pn: PN.packet_number_t {\n let open Lib.IntTypes in\n Secret.v pn >= Secret.v #U64 #SEC (g_initial_packet_number s h)\n })", "source_definition": "let g_last_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.expected_pnT #(mid i) (mstate s).reader h)\n else\n QImpl.g_last_packet_number (B.deref h (istate s)) h", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 103, "start_col": 2, "end_line": 107, "end_col": 55 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index\n\nlet mid (i:index{I.model}) = i <: QModel.id\nlet iid (i:index{not I.model}) = i <: QImpl.index\n\nlet alg (i:index) =\n if I.model then I.ae_id_ginfo (dfst (mid i))\n else (iid i).QImpl.aead_alg\n\nlet halg (i:index) =\n if I.model then I.ae_id_ghash (dfst (mid i))\n else (iid i).QImpl.hash_alg\n\nlet itraffic_secret (i:QModel.id) =\n Spec.Hash.Definitions.bytes_hash (I.ae_id_ghash (dfst i))\n\nmodule MH = Model.Helpers\n\nlet derived (#i:QModel.id) (#w:QModel.stream_writer i) (r:QModel.stream_reader w) (ts:itraffic_secret i) =\n if I.model && QModel.unsafe i then\n let ha = I.ae_id_hash (dfst i) in\n let ea = I.ae_id_info (dfst i) in\n let (k1, k2) = QModel.reader_leak r in\n MH.hide (QModel.writer_static_iv w) ==\n QSpec.derive_secret ha ts QSpec.label_iv 12 /\\\n MH.hide k1 == QSpec.derive_secret ha ts\n QSpec.label_key (QSpec.cipher_keysize ea) /\\\n MH.hide k2 == QUIC.Spec.derive_secret ha ts\n QUIC.Spec.label_hp (QSpec.cipher_keysize ea)\n else True\n\nnoeq type mstate_t i =\n| Ideal:\n writer: QModel.stream_writer i ->\n reader: QModel.stream_reader writer ->\n ts: itraffic_secret i{derived reader ts} -> // FIXME erased\n mstate_t i\n\nlet istate_t i = QImpl.state i\n\nnoeq\ntype raise (i: index { not I.model }): Type u#1 = | Raise: s:istate_t i -> raise i\n\nlet state i =\n if I.model then mstate_t (mid i)\n else raise (iid i)\n\nlet mstate (#i:index{I.model}) (s:state i) = s <: mstate_t (mid i)\nlet istate (#i:index{not I.model}) (s:state i) = (s <: raise (iid i)).s\n\nlet footprint #i h s =\n if I.model then\n QModel.rfootprint (mstate s).reader `B.loc_union` QModel.footprint (mstate s).writer\n else QImpl.footprint h (istate s)\n\nlet invariant #i h s =\n if I.model then\n let Ideal writer reader _ = mstate s in\n QModel.invariant writer h /\\ QModel.rinvariant reader h /\\\n B.loc_disjoint (QModel.rfootprint (mstate s).reader) (QModel.footprint (mstate s).writer)\n else QImpl.invariant h (istate s)\n\nlet g_traffic_secret #i s h =\n if I.model then (mstate s).ts\n else\n QImpl.g_traffic_secret (B.deref h (istate s))\n\nlet g_initial_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.writer_offset #(mid i) (mstate s).writer)\n else\n QImpl.g_initial_packet_number (B.deref h (istate s))", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "MH", "full_module": "Model.Helpers" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: QUIC.state i -> h: FStar.Monotonic.HyperStack.mem{QUIC.invariant h s}\n -> Prims.GTot\n (pn:\n QUIC.Spec.PacketNumber.Base.packet_number_t\n {QUIC.Secret.Int.Base.v pn >= QUIC.Secret.Int.Base.v (QUIC.g_initial_packet_number s h)})", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.index", "QUIC.state", "FStar.Monotonic.HyperStack.mem", "QUIC.invariant", "Model.Flags.model", "Lib.IntTypes.u64", "Model.QUIC.expected_pnT", "QUIC.mid", "QUIC.__proj__Ideal__item__writer", "QUIC.mstate", "QUIC.__proj__Ideal__item__reader", "Prims.bool", "QUIC.State.g_last_packet_number", "QUIC.iid", "LowStar.Monotonic.Buffer.deref", "QUIC.State.state_s", "LowStar.Buffer.trivial_preorder", "QUIC.istate", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "QUIC.g_initial_packet_number", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.op_LessThan", "Prims.op_Subtraction", "Prims.pow2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val g_last_packet_number: #i:index -> (s:state i) -> (h: HS.mem { invariant h s }) ->\n GTot (pn: PN.packet_number_t {\n let open Lib.IntTypes in\n Secret.v pn >= Secret.v #U64 #SEC (g_initial_packet_number s h)\n })\nlet g_last_packet_number #i s h =", "completed_definiton": "assert_norm (pow2 62 - 1 < pow2 64);\nif I.model\nthen Lib.IntTypes.u64 (QModel.expected_pnT #(mid i) (mstate s).reader h)\nelse QImpl.g_last_packet_number (B.deref h (istate s)) h", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.g_next_packet_number", "original_source_type": "val g_next_packet_number: #i:index -> (s:state i) -> (h: HS.mem { invariant h s }) ->\n GTot (pn: PN.packet_number_t {\n let open Lib.IntTypes in\n Secret.v pn >= Secret.v #U64 #SEC (g_initial_packet_number s h)\n })", "source_type": "val g_next_packet_number: #i:index -> (s:state i) -> (h: HS.mem { invariant h s }) ->\n GTot (pn: PN.packet_number_t {\n let open Lib.IntTypes in\n Secret.v pn >= Secret.v #U64 #SEC (g_initial_packet_number s h)\n })", "source_definition": "let g_next_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.wctrT #(mid i) (mstate s).writer h)\n else\n QImpl.g_last_packet_number (B.deref h (istate s)) h", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 110, "start_col": 2, "end_line": 114, "end_col": 55 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index\n\nlet mid (i:index{I.model}) = i <: QModel.id\nlet iid (i:index{not I.model}) = i <: QImpl.index\n\nlet alg (i:index) =\n if I.model then I.ae_id_ginfo (dfst (mid i))\n else (iid i).QImpl.aead_alg\n\nlet halg (i:index) =\n if I.model then I.ae_id_ghash (dfst (mid i))\n else (iid i).QImpl.hash_alg\n\nlet itraffic_secret (i:QModel.id) =\n Spec.Hash.Definitions.bytes_hash (I.ae_id_ghash (dfst i))\n\nmodule MH = Model.Helpers\n\nlet derived (#i:QModel.id) (#w:QModel.stream_writer i) (r:QModel.stream_reader w) (ts:itraffic_secret i) =\n if I.model && QModel.unsafe i then\n let ha = I.ae_id_hash (dfst i) in\n let ea = I.ae_id_info (dfst i) in\n let (k1, k2) = QModel.reader_leak r in\n MH.hide (QModel.writer_static_iv w) ==\n QSpec.derive_secret ha ts QSpec.label_iv 12 /\\\n MH.hide k1 == QSpec.derive_secret ha ts\n QSpec.label_key (QSpec.cipher_keysize ea) /\\\n MH.hide k2 == QUIC.Spec.derive_secret ha ts\n QUIC.Spec.label_hp (QSpec.cipher_keysize ea)\n else True\n\nnoeq type mstate_t i =\n| Ideal:\n writer: QModel.stream_writer i ->\n reader: QModel.stream_reader writer ->\n ts: itraffic_secret i{derived reader ts} -> // FIXME erased\n mstate_t i\n\nlet istate_t i = QImpl.state i\n\nnoeq\ntype raise (i: index { not I.model }): Type u#1 = | Raise: s:istate_t i -> raise i\n\nlet state i =\n if I.model then mstate_t (mid i)\n else raise (iid i)\n\nlet mstate (#i:index{I.model}) (s:state i) = s <: mstate_t (mid i)\nlet istate (#i:index{not I.model}) (s:state i) = (s <: raise (iid i)).s\n\nlet footprint #i h s =\n if I.model then\n QModel.rfootprint (mstate s).reader `B.loc_union` QModel.footprint (mstate s).writer\n else QImpl.footprint h (istate s)\n\nlet invariant #i h s =\n if I.model then\n let Ideal writer reader _ = mstate s in\n QModel.invariant writer h /\\ QModel.rinvariant reader h /\\\n B.loc_disjoint (QModel.rfootprint (mstate s).reader) (QModel.footprint (mstate s).writer)\n else QImpl.invariant h (istate s)\n\nlet g_traffic_secret #i s h =\n if I.model then (mstate s).ts\n else\n QImpl.g_traffic_secret (B.deref h (istate s))\n\nlet g_initial_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.writer_offset #(mid i) (mstate s).writer)\n else\n QImpl.g_initial_packet_number (B.deref h (istate s))\n\nlet g_last_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.expected_pnT #(mid i) (mstate s).reader h)\n else\n QImpl.g_last_packet_number (B.deref h (istate s)) h", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "MH", "full_module": "Model.Helpers" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: QUIC.state i -> h: FStar.Monotonic.HyperStack.mem{QUIC.invariant h s}\n -> Prims.GTot\n (pn:\n QUIC.Spec.PacketNumber.Base.packet_number_t\n {QUIC.Secret.Int.Base.v pn >= QUIC.Secret.Int.Base.v (QUIC.g_initial_packet_number s h)})", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.index", "QUIC.state", "FStar.Monotonic.HyperStack.mem", "QUIC.invariant", "Model.Flags.model", "Lib.IntTypes.u64", "Model.QUIC.wctrT", "QUIC.mid", "QUIC.__proj__Ideal__item__writer", "QUIC.mstate", "Prims.bool", "QUIC.State.g_last_packet_number", "QUIC.iid", "LowStar.Monotonic.Buffer.deref", "QUIC.State.state_s", "LowStar.Buffer.trivial_preorder", "QUIC.istate", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "QUIC.g_initial_packet_number", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.op_LessThan", "Prims.op_Subtraction", "Prims.pow2" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val g_next_packet_number: #i:index -> (s:state i) -> (h: HS.mem { invariant h s }) ->\n GTot (pn: PN.packet_number_t {\n let open Lib.IntTypes in\n Secret.v pn >= Secret.v #U64 #SEC (g_initial_packet_number s h)\n })\nlet g_next_packet_number #i s h =", "completed_definiton": "assert_norm (pow2 62 - 1 < pow2 64);\nif I.model\nthen Lib.IntTypes.u64 (QModel.wctrT #(mid i) (mstate s).writer h)\nelse QImpl.g_last_packet_number (B.deref h (istate s)) h", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.as_seq", "original_source_type": "val as_seq (#a: _) (b: B.buffer a) (l: UInt32.t{l == B.len b})\n : Stack (S.seq a)\n (requires fun h0 -> B.live h0 b)\n (ensures fun h0 r h1 -> h0 == h1 /\\ (B.as_seq h0 b) `S.equal` r)", "source_type": "val as_seq (#a: _) (b: B.buffer a) (l: UInt32.t{l == B.len b})\n : Stack (S.seq a)\n (requires fun h0 -> B.live h0 b)\n (ensures fun h0 r h1 -> h0 == h1 /\\ (B.as_seq h0 b) `S.equal` r)", "source_definition": "let rec as_seq #a (b: B.buffer a) (l: UInt32.t { l == B.len b }): Stack (S.seq a)\n (requires fun h0 ->\n B.live h0 b)\n (ensures fun h0 r h1 ->\n h0 == h1 /\\\n B.as_seq h0 b `S.equal` r)\n=\n let h0 = ST.get () in\n if l = 0ul then\n S.empty\n else\n let hd = B.index b 0ul in\n let l = l `U32.sub` 1ul in\n let b = B.sub b 1ul l in\n S.cons hd (as_seq b l)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 136, "start_col": 1, "end_line": 144, "end_col": 26 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index\n\nlet mid (i:index{I.model}) = i <: QModel.id\nlet iid (i:index{not I.model}) = i <: QImpl.index\n\nlet alg (i:index) =\n if I.model then I.ae_id_ginfo (dfst (mid i))\n else (iid i).QImpl.aead_alg\n\nlet halg (i:index) =\n if I.model then I.ae_id_ghash (dfst (mid i))\n else (iid i).QImpl.hash_alg\n\nlet itraffic_secret (i:QModel.id) =\n Spec.Hash.Definitions.bytes_hash (I.ae_id_ghash (dfst i))\n\nmodule MH = Model.Helpers\n\nlet derived (#i:QModel.id) (#w:QModel.stream_writer i) (r:QModel.stream_reader w) (ts:itraffic_secret i) =\n if I.model && QModel.unsafe i then\n let ha = I.ae_id_hash (dfst i) in\n let ea = I.ae_id_info (dfst i) in\n let (k1, k2) = QModel.reader_leak r in\n MH.hide (QModel.writer_static_iv w) ==\n QSpec.derive_secret ha ts QSpec.label_iv 12 /\\\n MH.hide k1 == QSpec.derive_secret ha ts\n QSpec.label_key (QSpec.cipher_keysize ea) /\\\n MH.hide k2 == QUIC.Spec.derive_secret ha ts\n QUIC.Spec.label_hp (QSpec.cipher_keysize ea)\n else True\n\nnoeq type mstate_t i =\n| Ideal:\n writer: QModel.stream_writer i ->\n reader: QModel.stream_reader writer ->\n ts: itraffic_secret i{derived reader ts} -> // FIXME erased\n mstate_t i\n\nlet istate_t i = QImpl.state i\n\nnoeq\ntype raise (i: index { not I.model }): Type u#1 = | Raise: s:istate_t i -> raise i\n\nlet state i =\n if I.model then mstate_t (mid i)\n else raise (iid i)\n\nlet mstate (#i:index{I.model}) (s:state i) = s <: mstate_t (mid i)\nlet istate (#i:index{not I.model}) (s:state i) = (s <: raise (iid i)).s\n\nlet footprint #i h s =\n if I.model then\n QModel.rfootprint (mstate s).reader `B.loc_union` QModel.footprint (mstate s).writer\n else QImpl.footprint h (istate s)\n\nlet invariant #i h s =\n if I.model then\n let Ideal writer reader _ = mstate s in\n QModel.invariant writer h /\\ QModel.rinvariant reader h /\\\n B.loc_disjoint (QModel.rfootprint (mstate s).reader) (QModel.footprint (mstate s).writer)\n else QImpl.invariant h (istate s)\n\nlet g_traffic_secret #i s h =\n if I.model then (mstate s).ts\n else\n QImpl.g_traffic_secret (B.deref h (istate s))\n\nlet g_initial_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.writer_offset #(mid i) (mstate s).writer)\n else\n QImpl.g_initial_packet_number (B.deref h (istate s))\n\nlet g_last_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.expected_pnT #(mid i) (mstate s).reader h)\n else\n QImpl.g_last_packet_number (B.deref h (istate s)) h\n\nlet g_next_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.wctrT #(mid i) (mstate s).writer h)\n else\n QImpl.g_last_packet_number (B.deref h (istate s)) h\n\n// TODO: reveal in the interface (just for good measure)\nlet frame_invariant #i l s h0 h1 =\n if I.model then\n let Ideal w r _ = mstate #(mid i) s in\n QModel.frame_invariant w h0 l h1;\n QModel.rframe_invariant r h0 l h1\n else\n QImpl.frame_invariant #(iid i) l s h0 h1\n\n/// Ingredients we need for the mythical switch\n\n/// First, a stateful equivalent of as_seq. Implementation doesn't need to be\n/// efficient.\n\nlet rec as_seq #a (b: B.buffer a) (l: UInt32.t { l == B.len b }): Stack (S.seq a)\n (requires fun h0 ->\n B.live h0 b)\n (ensures fun h0 r h1 ->\n h0 == h1 /\\", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "MH", "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: LowStar.Buffer.buffer a -> l: FStar.UInt32.t{l == LowStar.Monotonic.Buffer.len b}\n -> FStar.HyperStack.ST.Stack (FStar.Seq.Base.seq a)", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "FStar.UInt32.t", "Prims.eq2", "LowStar.Monotonic.Buffer.len", "LowStar.Buffer.trivial_preorder", "Prims.op_Equality", "FStar.UInt32.__uint_to_t", "FStar.Seq.Base.empty", "FStar.Seq.Base.seq", "Prims.bool", "FStar.Seq.Properties.cons", "QUIC.as_seq", "LowStar.Monotonic.Buffer.mbuffer", "LowStar.Buffer.sub", "FStar.Ghost.hide", "FStar.UInt32.sub", "LowStar.Monotonic.Buffer.index", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "LowStar.Monotonic.Buffer.live", "Prims.l_and", "FStar.Seq.Base.equal", "LowStar.Monotonic.Buffer.as_seq" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val as_seq (#a: _) (b: B.buffer a) (l: UInt32.t{l == B.len b})\n : Stack (S.seq a)\n (requires fun h0 -> B.live h0 b)\n (ensures fun h0 r h1 -> h0 == h1 /\\ (B.as_seq h0 b) `S.equal` r)\nlet rec as_seq #a (b: B.buffer a) (l: UInt32.t{l == B.len b})\n : Stack (S.seq a)\n (requires fun h0 -> B.live h0 b)\n (ensures fun h0 r h1 -> h0 == h1 /\\ (B.as_seq h0 b) `S.equal` r) =", "completed_definiton": "let h0 = ST.get () in\nif l = 0ul\nthen S.empty\nelse\n let hd = B.index b 0ul in\n let l = l `U32.sub` 1ul in\n let b = B.sub b 1ul l in\n S.cons hd (as_seq b l)", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.derived", "original_source_type": "", "source_type": "val derived : r: Model.QUIC.stream_reader w -> ts: QUIC.itraffic_secret i -> Prims.logical", "source_definition": "let derived (#i:QModel.id) (#w:QModel.stream_writer i) (r:QModel.stream_reader w) (ts:itraffic_secret i) =\n if I.model && QModel.unsafe i then\n let ha = I.ae_id_hash (dfst i) in\n let ea = I.ae_id_info (dfst i) in\n let (k1, k2) = QModel.reader_leak r in\n MH.hide (QModel.writer_static_iv w) ==\n QSpec.derive_secret ha ts QSpec.label_iv 12 /\\\n MH.hide k1 == QSpec.derive_secret ha ts\n QSpec.label_key (QSpec.cipher_keysize ea) /\\\n MH.hide k2 == QUIC.Spec.derive_secret ha ts\n QUIC.Spec.label_hp (QSpec.cipher_keysize ea)\n else True", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 47, "start_col": 2, "end_line": 57, "end_col": 11 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index\n\nlet mid (i:index{I.model}) = i <: QModel.id\nlet iid (i:index{not I.model}) = i <: QImpl.index\n\nlet alg (i:index) =\n if I.model then I.ae_id_ginfo (dfst (mid i))\n else (iid i).QImpl.aead_alg\n\nlet halg (i:index) =\n if I.model then I.ae_id_ghash (dfst (mid i))\n else (iid i).QImpl.hash_alg\n\nlet itraffic_secret (i:QModel.id) =\n Spec.Hash.Definitions.bytes_hash (I.ae_id_ghash (dfst i))\n\nmodule MH = Model.Helpers", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "MH", "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "r: Model.QUIC.stream_reader w -> ts: QUIC.itraffic_secret i -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Model.QUIC.id", "Model.QUIC.stream_writer", "Model.QUIC.stream_reader", "QUIC.itraffic_secret", "Prims.op_AmpAmp", "Model.Flags.model", "Model.QUIC.unsafe", "QUIC.Spec.Base.lbytes", "Spec.Agile.AEAD.key_length", "Model.AEAD.__proj__Mkinfo'__item__alg", "Model.QUIC.writer_ae_info", "Model.PNE.key_len", "FStar.Pervasives.dsnd", "Model.AEAD.id", "Model.PNE.id", "Prims.l_iff", "Prims.b2t", "Model.PNE.is_safe", "Model.AEAD.is_safe", "Model.QUIC.writer_pne_info", "Prims.l_and", "Prims.eq2", "FStar.Seq.Base.seq", "Lib.IntTypes.uint8", "Model.Helpers.hide", "Model.QUIC.writer_static_iv", "QUIC.Spec.Crypto.derive_secret", "QUIC.Spec.Crypto.label_iv", "QUIC.Spec.Crypto.label_key", "QUIC.Spec.Crypto.cipher_keysize", "QUIC.Spec.Crypto.label_hp", "Prims.logical", "Model.QUIC.key_t", "Model.QUIC.reader_leak", "Model.Indexing.ea", "Model.Indexing.ae_id_ginfo", "FStar.Pervasives.dfst", "Model.Indexing.ae_id_info", "Model.Indexing.ha", "Model.Indexing.ae_id_ghash", "Model.Indexing.ae_id_hash", "Prims.bool", "Prims.l_True" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "let derived\n (#i: QModel.id)\n (#w: QModel.stream_writer i)\n (r: QModel.stream_reader w)\n (ts: itraffic_secret i)\n =", "completed_definiton": "if I.model && QModel.unsafe i\nthen\n let ha = I.ae_id_hash (dfst i) in\n let ea = I.ae_id_info (dfst i) in\n let k1, k2 = QModel.reader_leak r in\n MH.hide (QModel.writer_static_iv w) == QSpec.derive_secret ha ts QSpec.label_iv 12 /\\\n MH.hide k1 == QSpec.derive_secret ha ts QSpec.label_key (QSpec.cipher_keysize ea) /\\\n MH.hide k2 == QUIC.Spec.derive_secret ha ts QUIC.Spec.label_hp (QSpec.cipher_keysize ea)\nelse True", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.as_header", "original_source_type": "val as_header (h: QUIC.Impl.header) (packet_number: PN.packet_number_t)\n : Stack QUIC.Spec.header\n (requires fun h0 -> QUIC.Impl.header_live h h0)\n (ensures fun h0 r h1 -> h0 == h1 /\\ r == QUIC.Impl.g_header h h0 packet_number)", "source_type": "val as_header (h: QUIC.Impl.header) (packet_number: PN.packet_number_t)\n : Stack QUIC.Spec.header\n (requires fun h0 -> QUIC.Impl.header_live h h0)\n (ensures fun h0 r h1 -> h0 == h1 /\\ r == QUIC.Impl.g_header h h0 packet_number)", "source_definition": "let as_header (h: QUIC.Impl.header) (packet_number: PN.packet_number_t) : Stack QUIC.Spec.header\n (requires fun h0 ->\n QUIC.Impl.header_live h h0)\n (ensures fun h0 r h1 ->\n h0 == h1 /\\\n r == QUIC.Impl.g_header h h0 packet_number)\n=\n let _ = allow_inversion QImplBase.header in\n let _ = allow_inversion QImplBase.long_header_specifics in\n\n let x = packet_number in\n let open QUIC.Impl in\n let open QUIC.Spec.Header.Base in\n let packet_number = x in\n match h with\n | BShort rb spin phase cid cid_len packet_number_length ->\n // Insane type errors if I don't put everything in A-normal form.\n let bar: S.seq UInt8.t = as_seq cid cid_len in\n let foo: vlbytes 0 20 = fstar_bytes_of_seq bar in\n MShort\n (reveal_bitfield rb)\n spin\n (nat_of_u8 phase = 1)\n foo\n packet_number_length packet_number\n | BLong version dcid dcil scid scil spec ->\n let dcid' = as_seq dcid dcil in\n let scid' = as_seq scid scil in\n [@inline_let]\n let f = MLong version (LowParse.SLow.Base.bytes_of_seq dcid') (LowParse.SLow.Base.bytes_of_seq scid') in\n begin match spec with\n | BInitial rb payload_length packet_number_length token token_length ->\n let token' = as_seq token token_length in\n f (MInitial (reveal_bitfield rb) (LowParse.SLow.Base.bytes_of_seq token') payload_length packet_number_length packet_number)\n | BZeroRTT rb payload_length packet_number_length ->\n f (MZeroRTT (reveal_bitfield rb) payload_length packet_number_length packet_number)\n | BHandshake rb payload_length packet_number_length ->\n f (MHandshake (reveal_bitfield rb) payload_length packet_number_length packet_number)\n | BRetry unused odcid odcil ->\n let odcid' = as_seq odcid odcil in\n f (MRetry (reveal_bitfield unused) (LowParse.SLow.Base.bytes_of_seq odcid'))\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 197, "start_col": 1, "end_line": 232, "end_col": 7 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index\n\nlet mid (i:index{I.model}) = i <: QModel.id\nlet iid (i:index{not I.model}) = i <: QImpl.index\n\nlet alg (i:index) =\n if I.model then I.ae_id_ginfo (dfst (mid i))\n else (iid i).QImpl.aead_alg\n\nlet halg (i:index) =\n if I.model then I.ae_id_ghash (dfst (mid i))\n else (iid i).QImpl.hash_alg\n\nlet itraffic_secret (i:QModel.id) =\n Spec.Hash.Definitions.bytes_hash (I.ae_id_ghash (dfst i))\n\nmodule MH = Model.Helpers\n\nlet derived (#i:QModel.id) (#w:QModel.stream_writer i) (r:QModel.stream_reader w) (ts:itraffic_secret i) =\n if I.model && QModel.unsafe i then\n let ha = I.ae_id_hash (dfst i) in\n let ea = I.ae_id_info (dfst i) in\n let (k1, k2) = QModel.reader_leak r in\n MH.hide (QModel.writer_static_iv w) ==\n QSpec.derive_secret ha ts QSpec.label_iv 12 /\\\n MH.hide k1 == QSpec.derive_secret ha ts\n QSpec.label_key (QSpec.cipher_keysize ea) /\\\n MH.hide k2 == QUIC.Spec.derive_secret ha ts\n QUIC.Spec.label_hp (QSpec.cipher_keysize ea)\n else True\n\nnoeq type mstate_t i =\n| Ideal:\n writer: QModel.stream_writer i ->\n reader: QModel.stream_reader writer ->\n ts: itraffic_secret i{derived reader ts} -> // FIXME erased\n mstate_t i\n\nlet istate_t i = QImpl.state i\n\nnoeq\ntype raise (i: index { not I.model }): Type u#1 = | Raise: s:istate_t i -> raise i\n\nlet state i =\n if I.model then mstate_t (mid i)\n else raise (iid i)\n\nlet mstate (#i:index{I.model}) (s:state i) = s <: mstate_t (mid i)\nlet istate (#i:index{not I.model}) (s:state i) = (s <: raise (iid i)).s\n\nlet footprint #i h s =\n if I.model then\n QModel.rfootprint (mstate s).reader `B.loc_union` QModel.footprint (mstate s).writer\n else QImpl.footprint h (istate s)\n\nlet invariant #i h s =\n if I.model then\n let Ideal writer reader _ = mstate s in\n QModel.invariant writer h /\\ QModel.rinvariant reader h /\\\n B.loc_disjoint (QModel.rfootprint (mstate s).reader) (QModel.footprint (mstate s).writer)\n else QImpl.invariant h (istate s)\n\nlet g_traffic_secret #i s h =\n if I.model then (mstate s).ts\n else\n QImpl.g_traffic_secret (B.deref h (istate s))\n\nlet g_initial_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.writer_offset #(mid i) (mstate s).writer)\n else\n QImpl.g_initial_packet_number (B.deref h (istate s))\n\nlet g_last_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.expected_pnT #(mid i) (mstate s).reader h)\n else\n QImpl.g_last_packet_number (B.deref h (istate s)) h\n\nlet g_next_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.wctrT #(mid i) (mstate s).writer h)\n else\n QImpl.g_last_packet_number (B.deref h (istate s)) h\n\n// TODO: reveal in the interface (just for good measure)\nlet frame_invariant #i l s h0 h1 =\n if I.model then\n let Ideal w r _ = mstate #(mid i) s in\n QModel.frame_invariant w h0 l h1;\n QModel.rframe_invariant r h0 l h1\n else\n QImpl.frame_invariant #(iid i) l s h0 h1\n\n/// Ingredients we need for the mythical switch\n\n/// First, a stateful equivalent of as_seq. Implementation doesn't need to be\n/// efficient.\n\nlet rec as_seq #a (b: B.buffer a) (l: UInt32.t { l == B.len b }): Stack (S.seq a)\n (requires fun h0 ->\n B.live h0 b)\n (ensures fun h0 r h1 ->\n h0 == h1 /\\\n B.as_seq h0 b `S.equal` r)\n=\n let h0 = ST.get () in\n if l = 0ul then\n S.empty\n else\n let hd = B.index b 0ul in\n let l = l `U32.sub` 1ul in\n let b = B.sub b 1ul l in\n S.cons hd (as_seq b l)\n\nlet rec from_seq #a (dst: B.buffer a) (s: S.seq a): Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\\n B.length dst == S.length s)\n (ensures fun h0 _ h1 ->\n B.modifies (B.loc_buffer dst) h0 h1 /\\\n B.as_seq h1 dst `S.equal` s)\n=\n if S.length s = 0 then\n ()\n else begin\n let hd = B.sub dst 0ul 1ul in\n let tl = B.sub dst 1ul (UInt32.uint_to_t (S.length s - 1)) in\n B.upd hd 0ul (S.index s 0);\n from_seq tl (S.slice s 1 (S.length s));\n let h1 = ST.get () in\n calc (S.equal) {\n B.as_seq h1 dst;\n (S.equal) { }\n S.append (S.slice (B.as_seq h1 hd) 0 1) (S.slice (B.as_seq h1 dst) 1 (S.length s));\n (S.equal) { }\n S.append (S.create 1 (S.index s 0)) (S.slice (B.as_seq h1 dst) 1 (S.length s));\n (S.equal) { }\n S.append (S.create 1 (S.index s 0)) (S.slice s 1 (S.length s));\n (S.equal) { }\n s;\n }\n end\n\n#set-options \"--fuel 0 --ifuel 0 --z3rlimit 200 --using_facts_from '*,-LowStar.Monotonic.Buffer.unused_in_not_unused_in_disjoint_2'\"\n\nlet nat_of_u8 (x: Lib.IntTypes.uint8) =\n UInt8.v (Lib.RawIntTypes.u8_to_UInt8 x)\n\nlet reveal_bitfield #n (x: QUIC.Spec.secret_bitfield n): QUIC.Spec.bitfield n =\n Lib.RawIntTypes.u8_to_UInt8 x\n\nlet fstar_bytes_of_seq (s: S.seq UInt8.t):\n Pure FStar.Bytes.bytes\n (requires S.length s < pow2 32)\n (ensures fun b -> FStar.Bytes.reveal b `S.equal` s)\n=\n assert_norm (pow2 32 = 4294967296);\n LowParse.SLow.Base.bytes_of_seq s\n\nlet as_header (h: QUIC.Impl.header) (packet_number: PN.packet_number_t) : Stack QUIC.Spec.header\n (requires fun h0 ->\n QUIC.Impl.header_live h h0)\n (ensures fun h0 r h1 ->\n h0 == h1 /\\", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "MH", "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 200, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "h: QUIC.Impl.Header.Base.header -> packet_number: QUIC.Spec.PacketNumber.Base.packet_number_t\n -> FStar.HyperStack.ST.Stack QUIC.Spec.Header.Base.header", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "QUIC.Impl.Header.Base.header", "QUIC.Spec.PacketNumber.Base.packet_number_t", "QUIC.Spec.Base.secret_bitfield", "Prims.bool", "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.l_and", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "Prims.op_LessThanOrEqual", "FStar.UInt.uint_t", "FStar.UInt32.v", "QUIC.Spec.PacketNumber.Base.packet_number_length_t", "QUIC.Spec.Header.Base.MShort", "QUIC.reveal_bitfield", "Prims.op_Equality", "QUIC.nat_of_u8", "QUIC.Spec.Base.vlbytes", "QUIC.fstar_bytes_of_seq", "QUIC.Spec.Header.Base.header", "FStar.Seq.Base.seq", "QUIC.as_seq", "QUIC.Impl.Header.Base.long_header_specifics", "QUIC.Spec.Base.payload_and_pn_length_t", "QUIC.Spec.Base.token_max_len", "QUIC.Spec.Header.Base.MInitial", "LowParse.SLow.Base.bytes_of_seq", "QUIC.Spec.Header.Base.MZeroRTT", "QUIC.Spec.Header.Base.MHandshake", "QUIC.Spec.Header.Base.MRetry", "QUIC.Spec.Header.Base.long_header_specifics", "QUIC.Spec.Header.Base.MLong", "Prims.unit", "FStar.Pervasives.allow_inversion", "FStar.Monotonic.HyperStack.mem", "QUIC.Impl.Header.Base.header_live", "QUIC.Impl.Header.Base.g_header" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val as_header (h: QUIC.Impl.header) (packet_number: PN.packet_number_t)\n : Stack QUIC.Spec.header\n (requires fun h0 -> QUIC.Impl.header_live h h0)\n (ensures fun h0 r h1 -> h0 == h1 /\\ r == QUIC.Impl.g_header h h0 packet_number)\nlet as_header (h: QUIC.Impl.header) (packet_number: PN.packet_number_t)\n : Stack QUIC.Spec.header\n (requires fun h0 -> QUIC.Impl.header_live h h0)\n (ensures fun h0 r h1 -> h0 == h1 /\\ r == QUIC.Impl.g_header h h0 packet_number) =", "completed_definiton": "let _ = allow_inversion QImplBase.header in\nlet _ = allow_inversion QImplBase.long_header_specifics in\nlet x = packet_number in\nlet open QUIC.Impl in\nlet open QUIC.Spec.Header.Base in\nlet packet_number = x in\nmatch h with\n| BShort rb spin phase cid cid_len packet_number_length ->\n let bar:S.seq UInt8.t = as_seq cid cid_len in\n let foo:vlbytes 0 20 = fstar_bytes_of_seq bar in\n MShort (reveal_bitfield rb) spin (nat_of_u8 phase = 1) foo packet_number_length packet_number\n| BLong version dcid dcil scid scil spec ->\n let dcid' = as_seq dcid dcil in\n let scid' = as_seq scid scil in\n [@@ inline_let ]let f =\n MLong version (LowParse.SLow.Base.bytes_of_seq dcid') (LowParse.SLow.Base.bytes_of_seq scid')\n in\n match spec with\n | BInitial rb payload_length packet_number_length token token_length ->\n let token' = as_seq token token_length in\n f (MInitial (reveal_bitfield rb)\n (LowParse.SLow.Base.bytes_of_seq token')\n payload_length\n packet_number_length\n packet_number)\n | BZeroRTT rb payload_length packet_number_length ->\n f (MZeroRTT (reveal_bitfield rb) payload_length packet_number_length packet_number)\n | BHandshake rb payload_length packet_number_length ->\n f (MHandshake (reveal_bitfield rb) payload_length packet_number_length packet_number)\n | BRetry unused odcid odcil ->\n let odcid' = as_seq odcid odcil in\n f (MRetry (reveal_bitfield unused) (LowParse.SLow.Base.bytes_of_seq odcid'))", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.lemma_inc_pn", "original_source_type": "val lemma_inc_pn (next_pn: nat{next_pn < Model.QUIC.max_ctr})\n : Lemma\n (pow2 62 < pow2 64 /\\\n Secret.to_u64 (UInt64.uint_to_t (next_pn + 1)) ==\n (Secret.to_u64 (UInt64.uint_to_t next_pn))\n `Secret.add`\n (Secret.to_u64 1uL))", "source_type": "val lemma_inc_pn (next_pn: nat{next_pn < Model.QUIC.max_ctr})\n : Lemma\n (pow2 62 < pow2 64 /\\\n Secret.to_u64 (UInt64.uint_to_t (next_pn + 1)) ==\n (Secret.to_u64 (UInt64.uint_to_t next_pn))\n `Secret.add`\n (Secret.to_u64 1uL))", "source_definition": "let lemma_inc_pn\n (next_pn: nat { next_pn < Model.QUIC.max_ctr })\n: Lemma\n (pow2 62 < pow2 64 /\\\n Secret.to_u64 (UInt64.uint_to_t (next_pn + 1)) ==\n Secret.to_u64 (UInt64.uint_to_t next_pn) `Secret.add` Secret.to_u64 1UL)\n= assert_norm (pow2 62 < pow2 64);\n assert (\n Secret.v (Secret.to_u64 (UInt64.uint_to_t (next_pn + 1))) ==\n Secret.v (Secret.to_u64 (UInt64.uint_to_t next_pn) `Secret.add` Secret.to_u64 1UL)\n )", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 240, "start_col": 2, "end_line": 244, "end_col": 3 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index\n\nlet mid (i:index{I.model}) = i <: QModel.id\nlet iid (i:index{not I.model}) = i <: QImpl.index\n\nlet alg (i:index) =\n if I.model then I.ae_id_ginfo (dfst (mid i))\n else (iid i).QImpl.aead_alg\n\nlet halg (i:index) =\n if I.model then I.ae_id_ghash (dfst (mid i))\n else (iid i).QImpl.hash_alg\n\nlet itraffic_secret (i:QModel.id) =\n Spec.Hash.Definitions.bytes_hash (I.ae_id_ghash (dfst i))\n\nmodule MH = Model.Helpers\n\nlet derived (#i:QModel.id) (#w:QModel.stream_writer i) (r:QModel.stream_reader w) (ts:itraffic_secret i) =\n if I.model && QModel.unsafe i then\n let ha = I.ae_id_hash (dfst i) in\n let ea = I.ae_id_info (dfst i) in\n let (k1, k2) = QModel.reader_leak r in\n MH.hide (QModel.writer_static_iv w) ==\n QSpec.derive_secret ha ts QSpec.label_iv 12 /\\\n MH.hide k1 == QSpec.derive_secret ha ts\n QSpec.label_key (QSpec.cipher_keysize ea) /\\\n MH.hide k2 == QUIC.Spec.derive_secret ha ts\n QUIC.Spec.label_hp (QSpec.cipher_keysize ea)\n else True\n\nnoeq type mstate_t i =\n| Ideal:\n writer: QModel.stream_writer i ->\n reader: QModel.stream_reader writer ->\n ts: itraffic_secret i{derived reader ts} -> // FIXME erased\n mstate_t i\n\nlet istate_t i = QImpl.state i\n\nnoeq\ntype raise (i: index { not I.model }): Type u#1 = | Raise: s:istate_t i -> raise i\n\nlet state i =\n if I.model then mstate_t (mid i)\n else raise (iid i)\n\nlet mstate (#i:index{I.model}) (s:state i) = s <: mstate_t (mid i)\nlet istate (#i:index{not I.model}) (s:state i) = (s <: raise (iid i)).s\n\nlet footprint #i h s =\n if I.model then\n QModel.rfootprint (mstate s).reader `B.loc_union` QModel.footprint (mstate s).writer\n else QImpl.footprint h (istate s)\n\nlet invariant #i h s =\n if I.model then\n let Ideal writer reader _ = mstate s in\n QModel.invariant writer h /\\ QModel.rinvariant reader h /\\\n B.loc_disjoint (QModel.rfootprint (mstate s).reader) (QModel.footprint (mstate s).writer)\n else QImpl.invariant h (istate s)\n\nlet g_traffic_secret #i s h =\n if I.model then (mstate s).ts\n else\n QImpl.g_traffic_secret (B.deref h (istate s))\n\nlet g_initial_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.writer_offset #(mid i) (mstate s).writer)\n else\n QImpl.g_initial_packet_number (B.deref h (istate s))\n\nlet g_last_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.expected_pnT #(mid i) (mstate s).reader h)\n else\n QImpl.g_last_packet_number (B.deref h (istate s)) h\n\nlet g_next_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.wctrT #(mid i) (mstate s).writer h)\n else\n QImpl.g_last_packet_number (B.deref h (istate s)) h\n\n// TODO: reveal in the interface (just for good measure)\nlet frame_invariant #i l s h0 h1 =\n if I.model then\n let Ideal w r _ = mstate #(mid i) s in\n QModel.frame_invariant w h0 l h1;\n QModel.rframe_invariant r h0 l h1\n else\n QImpl.frame_invariant #(iid i) l s h0 h1\n\n/// Ingredients we need for the mythical switch\n\n/// First, a stateful equivalent of as_seq. Implementation doesn't need to be\n/// efficient.\n\nlet rec as_seq #a (b: B.buffer a) (l: UInt32.t { l == B.len b }): Stack (S.seq a)\n (requires fun h0 ->\n B.live h0 b)\n (ensures fun h0 r h1 ->\n h0 == h1 /\\\n B.as_seq h0 b `S.equal` r)\n=\n let h0 = ST.get () in\n if l = 0ul then\n S.empty\n else\n let hd = B.index b 0ul in\n let l = l `U32.sub` 1ul in\n let b = B.sub b 1ul l in\n S.cons hd (as_seq b l)\n\nlet rec from_seq #a (dst: B.buffer a) (s: S.seq a): Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\\n B.length dst == S.length s)\n (ensures fun h0 _ h1 ->\n B.modifies (B.loc_buffer dst) h0 h1 /\\\n B.as_seq h1 dst `S.equal` s)\n=\n if S.length s = 0 then\n ()\n else begin\n let hd = B.sub dst 0ul 1ul in\n let tl = B.sub dst 1ul (UInt32.uint_to_t (S.length s - 1)) in\n B.upd hd 0ul (S.index s 0);\n from_seq tl (S.slice s 1 (S.length s));\n let h1 = ST.get () in\n calc (S.equal) {\n B.as_seq h1 dst;\n (S.equal) { }\n S.append (S.slice (B.as_seq h1 hd) 0 1) (S.slice (B.as_seq h1 dst) 1 (S.length s));\n (S.equal) { }\n S.append (S.create 1 (S.index s 0)) (S.slice (B.as_seq h1 dst) 1 (S.length s));\n (S.equal) { }\n S.append (S.create 1 (S.index s 0)) (S.slice s 1 (S.length s));\n (S.equal) { }\n s;\n }\n end\n\n#set-options \"--fuel 0 --ifuel 0 --z3rlimit 200 --using_facts_from '*,-LowStar.Monotonic.Buffer.unused_in_not_unused_in_disjoint_2'\"\n\nlet nat_of_u8 (x: Lib.IntTypes.uint8) =\n UInt8.v (Lib.RawIntTypes.u8_to_UInt8 x)\n\nlet reveal_bitfield #n (x: QUIC.Spec.secret_bitfield n): QUIC.Spec.bitfield n =\n Lib.RawIntTypes.u8_to_UInt8 x\n\nlet fstar_bytes_of_seq (s: S.seq UInt8.t):\n Pure FStar.Bytes.bytes\n (requires S.length s < pow2 32)\n (ensures fun b -> FStar.Bytes.reveal b `S.equal` s)\n=\n assert_norm (pow2 32 = 4294967296);\n LowParse.SLow.Base.bytes_of_seq s\n\nlet as_header (h: QUIC.Impl.header) (packet_number: PN.packet_number_t) : Stack QUIC.Spec.header\n (requires fun h0 ->\n QUIC.Impl.header_live h h0)\n (ensures fun h0 r h1 ->\n h0 == h1 /\\\n r == QUIC.Impl.g_header h h0 packet_number)\n=\n let _ = allow_inversion QImplBase.header in\n let _ = allow_inversion QImplBase.long_header_specifics in\n\n let x = packet_number in\n let open QUIC.Impl in\n let open QUIC.Spec.Header.Base in\n let packet_number = x in\n match h with\n | BShort rb spin phase cid cid_len packet_number_length ->\n // Insane type errors if I don't put everything in A-normal form.\n let bar: S.seq UInt8.t = as_seq cid cid_len in\n let foo: vlbytes 0 20 = fstar_bytes_of_seq bar in\n MShort\n (reveal_bitfield rb)\n spin\n (nat_of_u8 phase = 1)\n foo\n packet_number_length packet_number\n | BLong version dcid dcil scid scil spec ->\n let dcid' = as_seq dcid dcil in\n let scid' = as_seq scid scil in\n [@inline_let]\n let f = MLong version (LowParse.SLow.Base.bytes_of_seq dcid') (LowParse.SLow.Base.bytes_of_seq scid') in\n begin match spec with\n | BInitial rb payload_length packet_number_length token token_length ->\n let token' = as_seq token token_length in\n f (MInitial (reveal_bitfield rb) (LowParse.SLow.Base.bytes_of_seq token') payload_length packet_number_length packet_number)\n | BZeroRTT rb payload_length packet_number_length ->\n f (MZeroRTT (reveal_bitfield rb) payload_length packet_number_length packet_number)\n | BHandshake rb payload_length packet_number_length ->\n f (MHandshake (reveal_bitfield rb) payload_length packet_number_length packet_number)\n | BRetry unused odcid odcil ->\n let odcid' = as_seq odcid odcil in\n f (MRetry (reveal_bitfield unused) (LowParse.SLow.Base.bytes_of_seq odcid'))\n end\n\nlet lemma_inc_pn\n (next_pn: nat { next_pn < Model.QUIC.max_ctr })\n: Lemma\n (pow2 62 < pow2 64 /\\\n Secret.to_u64 (UInt64.uint_to_t (next_pn + 1)) ==", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "MH", "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 0, "max_fuel": 0, "initial_ifuel": 0, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 200, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "next_pn: Prims.nat{next_pn < Model.QUIC.max_ctr}\n -> FStar.Pervasives.Lemma\n (ensures\n Prims.pow2 62 < Prims.pow2 64 /\\\n Lib.IntTypes.to_u64 (FStar.UInt64.uint_to_t (next_pn + 1)) ==\n Lib.IntTypes.add (Lib.IntTypes.to_u64 (FStar.UInt64.uint_to_t next_pn))\n (Lib.IntTypes.to_u64 1uL))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Model.QUIC.max_ctr", "Prims._assert", "Prims.eq2", "Lib.IntTypes.range_t", "Lib.IntTypes.U64", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.SEC", "Lib.IntTypes.to_u64", "Lib.IntTypes.PUB", "FStar.UInt64.uint_to_t", "Prims.op_Addition", "Lib.IntTypes.add", "FStar.UInt64.__uint_to_t", "Prims.unit", "FStar.Pervasives.assert_norm", "Prims.pow2", "Prims.l_True", "Prims.squash", "Prims.l_and", "Lib.IntTypes.int_t", "Prims.Nil", "FStar.Pervasives.pattern" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val lemma_inc_pn (next_pn: nat{next_pn < Model.QUIC.max_ctr})\n : Lemma\n (pow2 62 < pow2 64 /\\\n Secret.to_u64 (UInt64.uint_to_t (next_pn + 1)) ==\n (Secret.to_u64 (UInt64.uint_to_t next_pn))\n `Secret.add`\n (Secret.to_u64 1uL))\nlet lemma_inc_pn (next_pn: nat{next_pn < Model.QUIC.max_ctr})\n : Lemma\n (pow2 62 < pow2 64 /\\\n Secret.to_u64 (UInt64.uint_to_t (next_pn + 1)) ==\n (Secret.to_u64 (UInt64.uint_to_t next_pn))\n `Secret.add`\n (Secret.to_u64 1uL)) =", "completed_definiton": "assert_norm (pow2 62 < pow2 64);\nassert (Secret.v (Secret.to_u64 (UInt64.uint_to_t (next_pn + 1))) ==\n Secret.v ((Secret.to_u64 (UInt64.uint_to_t next_pn)) `Secret.add` (Secret.to_u64 1uL)))", "isa_cross_project_example": true }, { "file_name": "QUIC.fst", "name": "QUIC.from_seq", "original_source_type": "val from_seq (#a: _) (dst: B.buffer a) (s: S.seq a)\n : Stack unit\n (requires fun h0 -> B.live h0 dst /\\ B.length dst == S.length s)\n (ensures fun h0 _ h1 -> B.modifies (B.loc_buffer dst) h0 h1 /\\ (B.as_seq h1 dst) `S.equal` s)", "source_type": "val from_seq (#a: _) (dst: B.buffer a) (s: S.seq a)\n : Stack unit\n (requires fun h0 -> B.live h0 dst /\\ B.length dst == S.length s)\n (ensures fun h0 _ h1 -> B.modifies (B.loc_buffer dst) h0 h1 /\\ (B.as_seq h1 dst) `S.equal` s)", "source_definition": "let rec from_seq #a (dst: B.buffer a) (s: S.seq a): Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\\n B.length dst == S.length s)\n (ensures fun h0 _ h1 ->\n B.modifies (B.loc_buffer dst) h0 h1 /\\\n B.as_seq h1 dst `S.equal` s)\n=\n if S.length s = 0 then\n ()\n else begin\n let hd = B.sub dst 0ul 1ul in\n let tl = B.sub dst 1ul (UInt32.uint_to_t (S.length s - 1)) in\n B.upd hd 0ul (S.index s 0);\n from_seq tl (S.slice s 1 (S.length s));\n let h1 = ST.get () in\n calc (S.equal) {\n B.as_seq h1 dst;\n (S.equal) { }\n S.append (S.slice (B.as_seq h1 hd) 0 1) (S.slice (B.as_seq h1 dst) 1 (S.length s));\n (S.equal) { }\n S.append (S.create 1 (S.index s 0)) (S.slice (B.as_seq h1 dst) 1 (S.length s));\n (S.equal) { }\n S.append (S.create 1 (S.index s 0)) (S.slice s 1 (S.length s));\n (S.equal) { }\n s;\n }\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 154, "start_col": 2, "end_line": 173, "end_col": 5 }, "file_context": "module QUIC\n\nmodule QSpec = QUIC.Spec\nmodule QImpl = QUIC.State\nmodule QImplBase = QUIC.Impl.Header.Base\nmodule QModel = Model.QUIC\n\nmodule I = Model.Indexing\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule ST = FStar.HyperStack.ST\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n// The switch only makes sense in the non-ideal case. (Unsurprisingly: if we\n// replace data by random values, functional correctness no longer holds!)\nlet index =\n if I.model then i:QModel.id { QModel.unsafe i } else QImpl.index\n\nlet mid (i:index{I.model}) = i <: QModel.id\nlet iid (i:index{not I.model}) = i <: QImpl.index\n\nlet alg (i:index) =\n if I.model then I.ae_id_ginfo (dfst (mid i))\n else (iid i).QImpl.aead_alg\n\nlet halg (i:index) =\n if I.model then I.ae_id_ghash (dfst (mid i))\n else (iid i).QImpl.hash_alg\n\nlet itraffic_secret (i:QModel.id) =\n Spec.Hash.Definitions.bytes_hash (I.ae_id_ghash (dfst i))\n\nmodule MH = Model.Helpers\n\nlet derived (#i:QModel.id) (#w:QModel.stream_writer i) (r:QModel.stream_reader w) (ts:itraffic_secret i) =\n if I.model && QModel.unsafe i then\n let ha = I.ae_id_hash (dfst i) in\n let ea = I.ae_id_info (dfst i) in\n let (k1, k2) = QModel.reader_leak r in\n MH.hide (QModel.writer_static_iv w) ==\n QSpec.derive_secret ha ts QSpec.label_iv 12 /\\\n MH.hide k1 == QSpec.derive_secret ha ts\n QSpec.label_key (QSpec.cipher_keysize ea) /\\\n MH.hide k2 == QUIC.Spec.derive_secret ha ts\n QUIC.Spec.label_hp (QSpec.cipher_keysize ea)\n else True\n\nnoeq type mstate_t i =\n| Ideal:\n writer: QModel.stream_writer i ->\n reader: QModel.stream_reader writer ->\n ts: itraffic_secret i{derived reader ts} -> // FIXME erased\n mstate_t i\n\nlet istate_t i = QImpl.state i\n\nnoeq\ntype raise (i: index { not I.model }): Type u#1 = | Raise: s:istate_t i -> raise i\n\nlet state i =\n if I.model then mstate_t (mid i)\n else raise (iid i)\n\nlet mstate (#i:index{I.model}) (s:state i) = s <: mstate_t (mid i)\nlet istate (#i:index{not I.model}) (s:state i) = (s <: raise (iid i)).s\n\nlet footprint #i h s =\n if I.model then\n QModel.rfootprint (mstate s).reader `B.loc_union` QModel.footprint (mstate s).writer\n else QImpl.footprint h (istate s)\n\nlet invariant #i h s =\n if I.model then\n let Ideal writer reader _ = mstate s in\n QModel.invariant writer h /\\ QModel.rinvariant reader h /\\\n B.loc_disjoint (QModel.rfootprint (mstate s).reader) (QModel.footprint (mstate s).writer)\n else QImpl.invariant h (istate s)\n\nlet g_traffic_secret #i s h =\n if I.model then (mstate s).ts\n else\n QImpl.g_traffic_secret (B.deref h (istate s))\n\nlet g_initial_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.writer_offset #(mid i) (mstate s).writer)\n else\n QImpl.g_initial_packet_number (B.deref h (istate s))\n\nlet g_last_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.expected_pnT #(mid i) (mstate s).reader h)\n else\n QImpl.g_last_packet_number (B.deref h (istate s)) h\n\nlet g_next_packet_number #i s h =\n assert_norm (pow2 62 - 1 < pow2 64);\n if I.model then\n Lib.IntTypes.u64 (QModel.wctrT #(mid i) (mstate s).writer h)\n else\n QImpl.g_last_packet_number (B.deref h (istate s)) h\n\n// TODO: reveal in the interface (just for good measure)\nlet frame_invariant #i l s h0 h1 =\n if I.model then\n let Ideal w r _ = mstate #(mid i) s in\n QModel.frame_invariant w h0 l h1;\n QModel.rframe_invariant r h0 l h1\n else\n QImpl.frame_invariant #(iid i) l s h0 h1\n\n/// Ingredients we need for the mythical switch\n\n/// First, a stateful equivalent of as_seq. Implementation doesn't need to be\n/// efficient.\n\nlet rec as_seq #a (b: B.buffer a) (l: UInt32.t { l == B.len b }): Stack (S.seq a)\n (requires fun h0 ->\n B.live h0 b)\n (ensures fun h0 r h1 ->\n h0 == h1 /\\\n B.as_seq h0 b `S.equal` r)\n=\n let h0 = ST.get () in\n if l = 0ul then\n S.empty\n else\n let hd = B.index b 0ul in\n let l = l `U32.sub` 1ul in\n let b = B.sub b 1ul l in\n S.cons hd (as_seq b l)\n\nlet rec from_seq #a (dst: B.buffer a) (s: S.seq a): Stack unit\n (requires fun h0 ->\n B.live h0 dst /\\\n B.length dst == S.length s)\n (ensures fun h0 _ h1 ->\n B.modifies (B.loc_buffer dst) h0 h1 /\\\n B.as_seq h1 dst `S.equal` s)", "dependencies": { "source_file": "QUIC.fst", "checked_file": "QUIC.fst.checked", "interface_file": true, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.State.fsti.checked", "QUIC.Spec.Header.Base.fst.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.fsti.checked", "prims.fst.checked", "Model.QUIC.fsti.checked", "Model.Indexing.fsti.checked", "Model.Helpers.fsti.checked", "Model.AEAD.fsti.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.fst.checked", "LowParse.SLow.Base.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Calc.fsti.checked", "FStar.Bytes.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "MH", "full_module": "Model.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.State" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "I", "full_module": "Model.Indexing" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "QModel", "full_module": "Model.QUIC" }, { "abbrev": true, "short_module": "QImplBase", "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": true, "short_module": "QImpl", "full_module": "QUIC.Impl" }, { "abbrev": true, "short_module": "QSpec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "dst: LowStar.Buffer.buffer a -> s: FStar.Seq.Base.seq a -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "FStar.Seq.Base.seq", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "Prims.unit", "Prims.bool", "FStar.Calc.calc_finish", "FStar.Seq.Base.equal", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Buffer.trivial_preorder", "Prims.Cons", "FStar.Preorder.relation", "Prims.Nil", "FStar.Calc.calc_step", "FStar.Seq.Base.append", "FStar.Seq.Base.create", "FStar.Seq.Base.index", "FStar.Seq.Base.slice", "FStar.Calc.calc_init", "FStar.Calc.calc_pack", "Prims.squash", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "QUIC.from_seq", "LowStar.Monotonic.Buffer.upd", "FStar.UInt32.__uint_to_t", "LowStar.Monotonic.Buffer.mbuffer", "LowStar.Buffer.sub", "FStar.Ghost.hide", "FStar.UInt32.t", "FStar.UInt32.uint_to_t", "Prims.op_Subtraction", "Prims.l_and", "LowStar.Monotonic.Buffer.live", "Prims.eq2", "Prims.nat", "LowStar.Monotonic.Buffer.length", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_buffer" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val from_seq (#a: _) (dst: B.buffer a) (s: S.seq a)\n : Stack unit\n (requires fun h0 -> B.live h0 dst /\\ B.length dst == S.length s)\n (ensures fun h0 _ h1 -> B.modifies (B.loc_buffer dst) h0 h1 /\\ (B.as_seq h1 dst) `S.equal` s)\nlet rec from_seq #a (dst: B.buffer a) (s: S.seq a)\n : Stack unit\n (requires fun h0 -> B.live h0 dst /\\ B.length dst == S.length s)\n (ensures fun h0 _ h1 -> B.modifies (B.loc_buffer dst) h0 h1 /\\ (B.as_seq h1 dst) `S.equal` s) =", "completed_definiton": "if S.length s = 0\nthen ()\nelse\n let hd = B.sub dst 0ul 1ul in\n let tl = B.sub dst 1ul (UInt32.uint_to_t (S.length s - 1)) in\n B.upd hd 0ul (S.index s 0);\n from_seq tl (S.slice s 1 (S.length s));\n let h1 = ST.get () in\n calc (S.equal) {\n B.as_seq h1 dst;\n (S.equal) { () }\n S.append (S.slice (B.as_seq h1 hd) 0 1) (S.slice (B.as_seq h1 dst) 1 (S.length s));\n (S.equal) { () }\n S.append (S.create 1 (S.index s 0)) (S.slice (B.as_seq h1 dst) 1 (S.length s));\n (S.equal) { () }\n S.append (S.create 1 (S.index s 0)) (S.slice s 1 (S.length s));\n (S.equal) { () }\n s;\n }", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Crypto.fsti", "name": "QUIC.Spec.Crypto.supported_aead", "original_source_type": "", "source_type": "val supported_aead : _: Spec.Agile.AEAD.alg -> Prims.bool", "source_definition": "let supported_aead = function\n | AEAD.AES128_GCM | AEAD.AES256_GCM | AEAD.CHACHA20_POLY1305 -> true\n | _ -> false", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Crypto.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 14, "start_col": 21, "end_line": 16, "end_col": 14 }, "file_context": "module QUIC.Spec.Crypto\ninclude QUIC.Spec.Base\n\nmodule Seq = FStar.Seq\nmodule HD = Spec.Hash.Definitions\nmodule AEAD = Spec.Agile.AEAD\nmodule Secret = QUIC.Secret.Int\nmodule Cipher = Spec.Agile.Cipher\n\nlet supported_hash = function\n | HD.SHA1 | HD.SHA2_256 | HD.SHA2_384 | HD.SHA2_512 -> true\n | _ -> false", "dependencies": { "source_file": "QUIC.Spec.Crypto.fsti", "checked_file": "QUIC.Spec.Crypto.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Spec.Agile.AEAD.alg -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Spec.Agile.AEAD.alg", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let supported_aead =", "completed_definiton": "function\n| AEAD.AES128_GCM | AEAD.AES256_GCM | AEAD.CHACHA20_POLY1305 -> true\n| _ -> false", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Crypto.fsti", "name": "QUIC.Spec.Crypto.supported_hash", "original_source_type": "", "source_type": "val supported_hash : _: Spec.Hash.Definitions.hash_alg -> Prims.bool", "source_definition": "let supported_hash = function\n | HD.SHA1 | HD.SHA2_256 | HD.SHA2_384 | HD.SHA2_512 -> true\n | _ -> false", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Crypto.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 10, "start_col": 21, "end_line": 12, "end_col": 14 }, "file_context": "module QUIC.Spec.Crypto\ninclude QUIC.Spec.Base\n\nmodule Seq = FStar.Seq\nmodule HD = Spec.Hash.Definitions\nmodule AEAD = Spec.Agile.AEAD\nmodule Secret = QUIC.Secret.Int\nmodule Cipher = Spec.Agile.Cipher", "dependencies": { "source_file": "QUIC.Spec.Crypto.fsti", "checked_file": "QUIC.Spec.Crypto.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "_: Spec.Hash.Definitions.hash_alg -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Spec.Hash.Definitions.hash_alg", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let supported_hash =", "completed_definiton": "function\n| HD.SHA1 | HD.SHA2_256 | HD.SHA2_384 | HD.SHA2_512 -> true\n| _ -> false", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Crypto.fsti", "name": "QUIC.Spec.Crypto.keysized", "original_source_type": "", "source_type": "val keysized : a: QUIC.Spec.Crypto.ha -> l: Prims.nat -> Prims.logical", "source_definition": "let keysized (a:ha) (l:nat) =\n l `HD.less_than_max_input_length` a /\\ l + HD.block_length a < pow2 32", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Crypto.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 33, "start_col": 2, "end_line": 33, "end_col": 72 }, "file_context": "module QUIC.Spec.Crypto\ninclude QUIC.Spec.Base\n\nmodule Seq = FStar.Seq\nmodule HD = Spec.Hash.Definitions\nmodule AEAD = Spec.Agile.AEAD\nmodule Secret = QUIC.Secret.Int\nmodule Cipher = Spec.Agile.Cipher\n\nlet supported_hash = function\n | HD.SHA1 | HD.SHA2_256 | HD.SHA2_384 | HD.SHA2_512 -> true\n | _ -> false\n\nlet supported_aead = function\n | AEAD.AES128_GCM | AEAD.AES256_GCM | AEAD.CHACHA20_POLY1305 -> true\n | _ -> false\n\ntype ha = a:HD.hash_alg{supported_hash a}\ntype ea = a:AEAD.alg{supported_aead a}\n\n\ninline_for_extraction noextract\nlet as_cipher_alg (a: ea): a:Cipher.cipher_alg {\n Cipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20)\n} =\n AEAD.cipher_alg_of_supported_alg a\n\nlet cipher_keysize (a:ea) =\n Spec.Agile.Cipher.key_length (Spec.Agile.AEAD.cipher_alg_of_supported_alg a)\n\n// Move from Hashing.Spec to Spec.Hash?", "dependencies": { "source_file": "QUIC.Spec.Crypto.fsti", "checked_file": "QUIC.Spec.Crypto.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: QUIC.Spec.Crypto.ha -> l: Prims.nat -> Prims.logical", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ha", "Prims.nat", "Prims.l_and", "Prims.b2t", "Spec.Hash.Definitions.less_than_max_input_length", "Prims.op_LessThan", "Prims.op_Addition", "Spec.Hash.Definitions.block_length", "Prims.pow2", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let keysized (a: ha) (l: nat) =", "completed_definiton": "l `HD.less_than_max_input_length` a /\\ l + HD.block_length a < pow2 32", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Crypto.fsti", "name": "QUIC.Spec.Crypto.hashable", "original_source_type": "", "source_type": "val hashable : a: QUIC.Spec.Crypto.ha -> l: Prims.nat -> Prims.bool", "source_definition": "let hashable (a:ha) (l:nat) = l `HD.less_than_max_input_length` a", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Crypto.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 34, "start_col": 30, "end_line": 34, "end_col": 65 }, "file_context": "module QUIC.Spec.Crypto\ninclude QUIC.Spec.Base\n\nmodule Seq = FStar.Seq\nmodule HD = Spec.Hash.Definitions\nmodule AEAD = Spec.Agile.AEAD\nmodule Secret = QUIC.Secret.Int\nmodule Cipher = Spec.Agile.Cipher\n\nlet supported_hash = function\n | HD.SHA1 | HD.SHA2_256 | HD.SHA2_384 | HD.SHA2_512 -> true\n | _ -> false\n\nlet supported_aead = function\n | AEAD.AES128_GCM | AEAD.AES256_GCM | AEAD.CHACHA20_POLY1305 -> true\n | _ -> false\n\ntype ha = a:HD.hash_alg{supported_hash a}\ntype ea = a:AEAD.alg{supported_aead a}\n\n\ninline_for_extraction noextract\nlet as_cipher_alg (a: ea): a:Cipher.cipher_alg {\n Cipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20)\n} =\n AEAD.cipher_alg_of_supported_alg a\n\nlet cipher_keysize (a:ea) =\n Spec.Agile.Cipher.key_length (Spec.Agile.AEAD.cipher_alg_of_supported_alg a)\n\n// Move from Hashing.Spec to Spec.Hash?\nlet keysized (a:ha) (l:nat) =", "dependencies": { "source_file": "QUIC.Spec.Crypto.fsti", "checked_file": "QUIC.Spec.Crypto.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: QUIC.Spec.Crypto.ha -> l: Prims.nat -> Prims.bool", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ha", "Prims.nat", "Spec.Hash.Definitions.less_than_max_input_length", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let hashable (a: ha) (l: nat) =", "completed_definiton": "l `HD.less_than_max_input_length` a", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Crypto.fsti", "name": "QUIC.Spec.Crypto.cipher_keysize", "original_source_type": "", "source_type": "val cipher_keysize : a: QUIC.Spec.Crypto.ea -> Lib.IntTypes.size_nat", "source_definition": "let cipher_keysize (a:ea) =\n Spec.Agile.Cipher.key_length (Spec.Agile.AEAD.cipher_alg_of_supported_alg a)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Crypto.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 29, "start_col": 2, "end_line": 29, "end_col": 78 }, "file_context": "module QUIC.Spec.Crypto\ninclude QUIC.Spec.Base\n\nmodule Seq = FStar.Seq\nmodule HD = Spec.Hash.Definitions\nmodule AEAD = Spec.Agile.AEAD\nmodule Secret = QUIC.Secret.Int\nmodule Cipher = Spec.Agile.Cipher\n\nlet supported_hash = function\n | HD.SHA1 | HD.SHA2_256 | HD.SHA2_384 | HD.SHA2_512 -> true\n | _ -> false\n\nlet supported_aead = function\n | AEAD.AES128_GCM | AEAD.AES256_GCM | AEAD.CHACHA20_POLY1305 -> true\n | _ -> false\n\ntype ha = a:HD.hash_alg{supported_hash a}\ntype ea = a:AEAD.alg{supported_aead a}\n\n\ninline_for_extraction noextract\nlet as_cipher_alg (a: ea): a:Cipher.cipher_alg {\n Cipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20)\n} =\n AEAD.cipher_alg_of_supported_alg a", "dependencies": { "source_file": "QUIC.Spec.Crypto.fsti", "checked_file": "QUIC.Spec.Crypto.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: QUIC.Spec.Crypto.ea -> Lib.IntTypes.size_nat", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.Cipher.key_length", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "Lib.IntTypes.size_nat" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let cipher_keysize (a: ea) =", "completed_definiton": "Spec.Agile.Cipher.key_length (Spec.Agile.AEAD.cipher_alg_of_supported_alg a)", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Crypto.fsti", "name": "QUIC.Spec.Crypto.as_cipher_alg", "original_source_type": "val as_cipher_alg (a: ea)\n : a: Cipher.cipher_alg{let open Cipher in a == AES128 \\/ a == AES256 \\/ a == CHACHA20}", "source_type": "val as_cipher_alg (a: ea)\n : a: Cipher.cipher_alg{let open Cipher in a == AES128 \\/ a == AES256 \\/ a == CHACHA20}", "source_definition": "let as_cipher_alg (a: ea): a:Cipher.cipher_alg {\n Cipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20)\n} =\n AEAD.cipher_alg_of_supported_alg a", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Crypto.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 26, "start_col": 2, "end_line": 26, "end_col": 36 }, "file_context": "module QUIC.Spec.Crypto\ninclude QUIC.Spec.Base\n\nmodule Seq = FStar.Seq\nmodule HD = Spec.Hash.Definitions\nmodule AEAD = Spec.Agile.AEAD\nmodule Secret = QUIC.Secret.Int\nmodule Cipher = Spec.Agile.Cipher\n\nlet supported_hash = function\n | HD.SHA1 | HD.SHA2_256 | HD.SHA2_384 | HD.SHA2_512 -> true\n | _ -> false\n\nlet supported_aead = function\n | AEAD.AES128_GCM | AEAD.AES256_GCM | AEAD.CHACHA20_POLY1305 -> true\n | _ -> false\n\ntype ha = a:HD.hash_alg{supported_hash a}\ntype ea = a:AEAD.alg{supported_aead a}\n\n\ninline_for_extraction noextract\nlet as_cipher_alg (a: ea): a:Cipher.cipher_alg {\n Cipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20)", "dependencies": { "source_file": "QUIC.Spec.Crypto.fsti", "checked_file": "QUIC.Spec.Crypto.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: QUIC.Spec.Crypto.ea\n -> a:\n Spec.Agile.Cipher.cipher_alg\n { a == Spec.Agile.Cipher.AES128 \\/ a == Spec.Agile.Cipher.AES256 \\/\n a == Spec.Agile.Cipher.CHACHA20 }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "Spec.Agile.Cipher.cipher_alg", "Prims.l_or", "Prims.eq2", "Spec.Agile.Cipher.AES128", "Spec.Agile.Cipher.AES256", "Spec.Agile.Cipher.CHACHA20" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val as_cipher_alg (a: ea)\n : a: Cipher.cipher_alg{let open Cipher in a == AES128 \\/ a == AES256 \\/ a == CHACHA20}\nlet as_cipher_alg (a: ea)\n : a: Cipher.cipher_alg{let open Cipher in a == AES128 \\/ a == AES256 \\/ a == CHACHA20} =", "completed_definiton": "AEAD.cipher_alg_of_supported_alg a", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Crypto.fsti", "name": "QUIC.Spec.Crypto.max_cipher_length", "original_source_type": "val max_cipher_length:n:\nnat\n { forall a. {:pattern AEAD.max_length a\\/AEAD.tag_length a}\n n <= AEAD.max_length a + AEAD.tag_length a }", "source_type": "val max_cipher_length:n:\nnat\n { forall a. {:pattern AEAD.max_length a\\/AEAD.tag_length a}\n n <= AEAD.max_length a + AEAD.tag_length a }", "source_definition": "let max_cipher_length : n:nat {\n forall a. {:pattern AEAD.max_length a \\/ AEAD.tag_length a }\n n <= AEAD.max_length a + AEAD.tag_length a\n} =\n pow2 32 - header_len_bound", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Crypto.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 48, "start_col": 2, "end_line": 48, "end_col": 28 }, "file_context": "module QUIC.Spec.Crypto\ninclude QUIC.Spec.Base\n\nmodule Seq = FStar.Seq\nmodule HD = Spec.Hash.Definitions\nmodule AEAD = Spec.Agile.AEAD\nmodule Secret = QUIC.Secret.Int\nmodule Cipher = Spec.Agile.Cipher\n\nlet supported_hash = function\n | HD.SHA1 | HD.SHA2_256 | HD.SHA2_384 | HD.SHA2_512 -> true\n | _ -> false\n\nlet supported_aead = function\n | AEAD.AES128_GCM | AEAD.AES256_GCM | AEAD.CHACHA20_POLY1305 -> true\n | _ -> false\n\ntype ha = a:HD.hash_alg{supported_hash a}\ntype ea = a:AEAD.alg{supported_aead a}\n\n\ninline_for_extraction noextract\nlet as_cipher_alg (a: ea): a:Cipher.cipher_alg {\n Cipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20)\n} =\n AEAD.cipher_alg_of_supported_alg a\n\nlet cipher_keysize (a:ea) =\n Spec.Agile.Cipher.key_length (Spec.Agile.AEAD.cipher_alg_of_supported_alg a)\n\n// Move from Hashing.Spec to Spec.Hash?\nlet keysized (a:ha) (l:nat) =\n l `HD.less_than_max_input_length` a /\\ l + HD.block_length a < pow2 32\nlet hashable (a:ha) (l:nat) = l `HD.less_than_max_input_length` a\n\n// AEAD plain and ciphertext. We want to guarantee that regardless\n// of the header size (max is 54), the neader + ciphertext + tag fits in a buffer\n// : perhaps cleaner with a separate lemma; any reason for putting this in a refinement?\nlet max_plain_length: n:nat {\n forall a. {:pattern AEAD.max_length a} n <= AEAD.max_length a\n} =\n pow2 32 - header_len_bound - 16\n\nlet max_cipher_length : n:nat {\n forall a. {:pattern AEAD.max_length a \\/ AEAD.tag_length a }\n n <= AEAD.max_length a + AEAD.tag_length a", "dependencies": { "source_file": "QUIC.Spec.Crypto.fsti", "checked_file": "QUIC.Spec.Crypto.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "n:\nPrims.nat\n { forall (a: Spec.Agile.AEAD.alg{Spec.Agile.AEAD.is_supported_alg a}).\n {:pattern Spec.Agile.AEAD.max_length a\\/Spec.Agile.AEAD.tag_length a}\n n <= Spec.Agile.AEAD.max_length a + Spec.Agile.AEAD.tag_length a }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.op_Subtraction", "Prims.pow2", "QUIC.Spec.Base.header_len_bound" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val max_cipher_length:n:\nnat\n { forall a. {:pattern AEAD.max_length a\\/AEAD.tag_length a}\n n <= AEAD.max_length a + AEAD.tag_length a }\nlet max_cipher_length:n:\nnat\n { forall a. {:pattern AEAD.max_length a\\/AEAD.tag_length a}\n n <= AEAD.max_length a + AEAD.tag_length a } =", "completed_definiton": "pow2 32 - header_len_bound", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.Crypto.fsti", "name": "QUIC.Spec.Crypto.max_plain_length", "original_source_type": "val max_plain_length:n: nat{forall a. {:pattern AEAD.max_length a} n <= AEAD.max_length a}", "source_type": "val max_plain_length:n: nat{forall a. {:pattern AEAD.max_length a} n <= AEAD.max_length a}", "source_definition": "let max_plain_length: n:nat {\n forall a. {:pattern AEAD.max_length a} n <= AEAD.max_length a\n} =\n pow2 32 - header_len_bound - 16", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.Crypto.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 42, "start_col": 2, "end_line": 42, "end_col": 33 }, "file_context": "module QUIC.Spec.Crypto\ninclude QUIC.Spec.Base\n\nmodule Seq = FStar.Seq\nmodule HD = Spec.Hash.Definitions\nmodule AEAD = Spec.Agile.AEAD\nmodule Secret = QUIC.Secret.Int\nmodule Cipher = Spec.Agile.Cipher\n\nlet supported_hash = function\n | HD.SHA1 | HD.SHA2_256 | HD.SHA2_384 | HD.SHA2_512 -> true\n | _ -> false\n\nlet supported_aead = function\n | AEAD.AES128_GCM | AEAD.AES256_GCM | AEAD.CHACHA20_POLY1305 -> true\n | _ -> false\n\ntype ha = a:HD.hash_alg{supported_hash a}\ntype ea = a:AEAD.alg{supported_aead a}\n\n\ninline_for_extraction noextract\nlet as_cipher_alg (a: ea): a:Cipher.cipher_alg {\n Cipher.(a == AES128 \\/ a == AES256 \\/ a == CHACHA20)\n} =\n AEAD.cipher_alg_of_supported_alg a\n\nlet cipher_keysize (a:ea) =\n Spec.Agile.Cipher.key_length (Spec.Agile.AEAD.cipher_alg_of_supported_alg a)\n\n// Move from Hashing.Spec to Spec.Hash?\nlet keysized (a:ha) (l:nat) =\n l `HD.less_than_max_input_length` a /\\ l + HD.block_length a < pow2 32\nlet hashable (a:ha) (l:nat) = l `HD.less_than_max_input_length` a\n\n// AEAD plain and ciphertext. We want to guarantee that regardless\n// of the header size (max is 54), the neader + ciphertext + tag fits in a buffer\n// : perhaps cleaner with a separate lemma; any reason for putting this in a refinement?\nlet max_plain_length: n:nat {\n forall a. {:pattern AEAD.max_length a} n <= AEAD.max_length a", "dependencies": { "source_file": "QUIC.Spec.Crypto.fsti", "checked_file": "QUIC.Spec.Crypto.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.Base.fst.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Cipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "AEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "HD", "full_module": "Spec.Hash.Definitions" }, { "abbrev": true, "short_module": "Seq", "full_module": "FStar.Seq" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "n:\nPrims.nat\n { forall (a: Spec.Agile.AEAD.supported_alg). {:pattern Spec.Agile.AEAD.max_length a}\n n <= Spec.Agile.AEAD.max_length a }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Prims.op_Subtraction", "Prims.pow2", "QUIC.Spec.Base.header_len_bound" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val max_plain_length:n: nat{forall a. {:pattern AEAD.max_length a} n <= AEAD.max_length a}\nlet max_plain_length:n: nat{forall a. {:pattern AEAD.max_length a} n <= AEAD.max_length a} =", "completed_definiton": "pow2 32 - header_len_bound - 16", "isa_cross_project_example": true }, { "file_name": "QUIC.Spec.VarInt.fsti", "name": "QUIC.Spec.VarInt.parse_varint_kind", "original_source_type": "", "source_type": "val parse_varint_kind : LowParse.Spec.Base.parser_kind'", "source_definition": "let parse_varint_kind = {\n LP.parser_kind_low = 1;\n LP.parser_kind_high = Some 8;\n LP.parser_kind_subkind = Some LP.ParserStrong;\n LP.parser_kind_metadata = None;\n}", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Spec.VarInt.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 10, "start_col": 2, "end_line": 13, "end_col": 33 }, "file_context": "module QUIC.Spec.VarInt\n\nmodule U62 = QUIC.UInt62\nmodule U64 = FStar.UInt64\nmodule LP = LowParse.Spec.BoundedInt // for bounded_int32\nmodule Cast = FStar.Int.Cast\n\ninline_for_extraction", "dependencies": { "source_file": "QUIC.Spec.VarInt.fsti", "checked_file": "QUIC.Spec.VarInt.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.UInt62.fst.checked", "QUIC.Spec.Base.fst.checked", "prims.fst.checked", "LowParse.Spec.BoundedInt.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Int.Cast.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt // for bounded_int32" }, { "abbrev": true, "short_module": "Cast", "full_module": "FStar.Int.Cast" }, { "abbrev": true, "short_module": "LP", "full_module": "LowParse.Spec.BoundedInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U62", "full_module": "QUIC.UInt62" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "LowParse.Spec.Base.parser_kind'", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "LowParse.Spec.Base.Mkparser_kind'", "FStar.Pervasives.Native.Some", "Prims.nat", "LowParse.Spec.Base.parser_subkind", "LowParse.Spec.Base.ParserStrong", "FStar.Pervasives.Native.None", "LowParse.Spec.Base.parser_kind_metadata_some" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": true, "is_type": null, "partial_definition": "let parse_varint_kind =", "completed_definiton": "{\n LP.parser_kind_low = 1;\n LP.parser_kind_high = Some 8;\n LP.parser_kind_subkind = Some LP.ParserStrong;\n LP.parser_kind_metadata = None\n}", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Buffer.fsti", "name": "QUIC.Secret.Buffer.loc_buffer_from_to_if", "original_source_type": "val loc_buffer_from_to_if (#t: Type) (b: B.buffer t) (from to: U32.t) : GTot B.loc", "source_type": "val loc_buffer_from_to_if (#t: Type) (b: B.buffer t) (from to: U32.t) : GTot B.loc", "source_definition": "let loc_buffer_from_to_if\n (#t: Type)\n (b: B.buffer t)\n (from to: U32.t)\n: GTot B.loc\n= if U32.v to < U32.v from || U32.v to > B.length b\n then B.loc_none\n else B.loc_buffer (B.gsub b from (to `U32.sub` from))", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Buffer.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 20, "start_col": 2, "end_line": 22, "end_col": 55 }, "file_context": "module QUIC.Secret.Buffer\n\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\nmodule Seq = QUIC.Secret.Seq\nmodule Ghost = FStar.Ghost\n\nmodule U32 = FStar.UInt32\n\n#set-options \"--z3rlimit 32\"\n\nlet loc_buffer_from_to_if\n (#t: Type)\n (b: B.buffer t)\n (from to: U32.t)", "dependencies": { "source_file": "QUIC.Secret.Buffer.fsti", "checked_file": "QUIC.Secret.Buffer.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "b: LowStar.Buffer.buffer t -> from: FStar.UInt32.t -> to: FStar.UInt32.t\n -> Prims.GTot LowStar.Monotonic.Buffer.loc", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "FStar.UInt32.t", "Prims.op_BarBar", "Prims.op_LessThan", "FStar.UInt32.v", "Prims.op_GreaterThan", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "LowStar.Monotonic.Buffer.loc_none", "Prims.bool", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Buffer.gsub", "FStar.UInt32.sub", "LowStar.Monotonic.Buffer.loc" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val loc_buffer_from_to_if (#t: Type) (b: B.buffer t) (from to: U32.t) : GTot B.loc\nlet loc_buffer_from_to_if (#t: Type) (b: B.buffer t) (from to: U32.t) : GTot B.loc =", "completed_definiton": "if U32.v to < U32.v from || U32.v to > B.length b\nthen B.loc_none\nelse B.loc_buffer (B.gsub b from (to `U32.sub` from))", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Buffer.fsti", "name": "QUIC.Secret.Buffer.with_whole_buffer_hide_weak_modifies'", "original_source_type": "val with_whole_buffer_hide_weak_modifies'\n (#t: Type)\n (b: B.buffer U8.t)\n (h0: HS.mem)\n (lin: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b)})\n (lout: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b)})\n (modifies_b: Ghost.erased bool)\n (post: (res: t -> cont: Seq.lseq Secret.uint8 (B.length b) -> h: HS.mem -> GTot Type0))\n (f:\n (l: Ghost.erased B.loc -> bs: B.buffer Secret.uint8 {B.length bs == B.length b}\n -> HST.Stack t\n (requires\n (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint ((Ghost.reveal lin) `B.loc_union` (Ghost.reveal lout))\n ((Ghost.reveal l) `B.loc_union` (B.loc_buffer bs)) /\\ B.live h bs /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 b)))\n (ensures\n (fun h res h' ->\n B.modifies ((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_b then B.loc_buffer bs else B.loc_none))\n h\n h' /\\ post res (B.as_seq h' bs) h'))))\n : HST.Stack t\n (requires (fun h -> B.live h b /\\ h0 == h))\n (ensures\n (fun h res h' ->\n B.modifies ((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_b then B.loc_buffer b else B.loc_none))\n h\n h' /\\ post res (Seq.seq_hide (B.as_seq h' b)) h'))", "source_type": "val with_whole_buffer_hide_weak_modifies'\n (#t: Type)\n (b: B.buffer U8.t)\n (h0: HS.mem)\n (lin: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b)})\n (lout: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b)})\n (modifies_b: Ghost.erased bool)\n (post: (res: t -> cont: Seq.lseq Secret.uint8 (B.length b) -> h: HS.mem -> GTot Type0))\n (f:\n (l: Ghost.erased B.loc -> bs: B.buffer Secret.uint8 {B.length bs == B.length b}\n -> HST.Stack t\n (requires\n (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint ((Ghost.reveal lin) `B.loc_union` (Ghost.reveal lout))\n ((Ghost.reveal l) `B.loc_union` (B.loc_buffer bs)) /\\ B.live h bs /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 b)))\n (ensures\n (fun h res h' ->\n B.modifies ((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_b then B.loc_buffer bs else B.loc_none))\n h\n h' /\\ post res (B.as_seq h' bs) h'))))\n : HST.Stack t\n (requires (fun h -> B.live h b /\\ h0 == h))\n (ensures\n (fun h res h' ->\n B.modifies ((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_b then B.loc_buffer b else B.loc_none))\n h\n h' /\\ post res (Seq.seq_hide (B.as_seq h' b)) h'))", "source_definition": "let with_whole_buffer_hide_weak_modifies'\n (#t: Type)\n (b: B.buffer U8.t)\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (modifies_b: Ghost.erased bool)\n (post: (res: t) -> (cont: Seq.lseq Secret.uint8 (B.length b)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bs: B.buffer Secret.uint8 { B.length bs == B.length b }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bs) /\\\n B.live h bs /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 b)\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_b then B.loc_buffer bs else B.loc_none)) h h' /\\\n post res (B.as_seq h' bs) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_b then B.loc_buffer b else B.loc_none)) h h' /\\\n post res (Seq.seq_hide (B.as_seq h' b)) h'\n ))\n= let h0 = HST.get () in\n with_whole_buffer_hide_weak_modifies\n b\n h0\n lin\n lout\n modifies_b\n (fun res cont h -> post res (Seq.seq_hide #Secret.U8 cont) h)\n (fun l bs ->\n f l bs\n )", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Buffer.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 307, "start_col": 1, "end_line": 317, "end_col": 5 }, "file_context": "module QUIC.Secret.Buffer\n\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\nmodule Seq = QUIC.Secret.Seq\nmodule Ghost = FStar.Ghost\n\nmodule U32 = FStar.UInt32\n\n#set-options \"--z3rlimit 32\"\n\nlet loc_buffer_from_to_if\n (#t: Type)\n (b: B.buffer t)\n (from to: U32.t)\n: GTot B.loc\n= if U32.v to < U32.v from || U32.v to > B.length b\n then B.loc_none\n else B.loc_buffer (B.gsub b from (to `U32.sub` from))\n\ninline_for_extraction\nnoextract\nval with_buffer_hide\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t)\n (to: U32.t { U32.v from <= U32.v to /\\ U32.v to <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (x1 x2 x3 x4 x5 x6: Ghost.erased U32.t)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (U32.v to - U32.v from)) -> (contr: Seq.lseq U8.t (B.length b - U32.v to)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (U32.v to - U32.v from) }) ->\n (br: B.buffer U8.t { B.length br == (B.length b - U32.v to) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl `B.loc_union` B.loc_buffer bs) (B.loc_buffer br) /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs `B.loc_union` B.loc_buffer br) /\\\n B.live h bl /\\ B.live h bs /\\ B.live h br /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (to `U32.sub` from))) /\\\n B.as_seq h br == B.as_seq h0 (B.gsub b to (B.len b `U32.sub` to))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if bl x1 x2 `B.loc_union` loc_buffer_from_to_if bs x3 x4 `B.loc_union` loc_buffer_from_to_if br x5 x6) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) (B.as_seq h' br) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if (B.gsub b 0ul from) x1 x2 `B.loc_union` loc_buffer_from_to_if (B.gsub b from (to `U32.sub` from)) x3 x4 `B.loc_union` loc_buffer_from_to_if (B.gsub b to (B.len b `U32.sub` to)) x5 x6) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (to `U32.sub` from))) (B.as_seq h' (B.gsub b to (B.len b `U32.sub` to))) h'\n ))\n\ninline_for_extraction\nnoextract\nlet with_buffer_hide_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t)\n (to: U32.t { U32.v from <= U32.v to /\\ U32.v to <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (modifies_left modifies_secret modifies_right: Ghost.erased bool)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (U32.v to - U32.v from)) -> (contr: Seq.lseq U8.t (B.length b - U32.v to)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (U32.v to - U32.v from) }) ->\n (br: B.buffer U8.t { B.length br == (B.length b - U32.v to) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl `B.loc_union` B.loc_buffer bs) (B.loc_buffer br) /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs `B.loc_union` B.loc_buffer br) /\\\n B.live h bl /\\ B.live h bs /\\ B.live h br /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (to `U32.sub` from))) /\\\n B.as_seq h br == B.as_seq h0 (B.gsub b to (B.len b `U32.sub` to))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_left then B.loc_buffer bl else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_secret then B.loc_buffer bs else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_right then B.loc_buffer br else B.loc_none)) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) (B.as_seq h' br) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_left then B.loc_buffer (B.gsub b 0ul from) else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_secret then B.loc_buffer (B.gsub b from (to `U32.sub` from)) else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_right then B.loc_buffer (B.gsub b to (B.len b `U32.sub` to)) else B.loc_none)) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (to `U32.sub` from))) (B.as_seq h' (B.gsub b to (B.len b `U32.sub` to))) h'\n ))\n=\n with_buffer_hide\n b\n from\n to\n h0\n lin\n lout\n (if Ghost.reveal modifies_left then 0ul else 1ul) (if Ghost.reveal modifies_left then from else 0ul)\n (if Ghost.reveal modifies_secret then 0ul else 1ul) (if Ghost.reveal modifies_secret then (to `U32.sub` from) else 0ul)\n (if Ghost.reveal modifies_right then 0ul else 1ul) (if Ghost.reveal modifies_right then (B.len b `U32.sub` to) else 0ul)\n post\n (fun l bl bs br ->\n B.gsub_zero_length bl;\n B.gsub_zero_length bs;\n B.gsub_zero_length br;\n f l bl bs br\n )\n\n(* NOTE: this CANNOT be derived from with_buffer_hide, because `to` should be the length, which is ghost *)\n\ninline_for_extraction\nnoextract\nval with_buffer_hide_from\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t { U32.v from <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (x1 x2 x3 x4: Ghost.erased U32.t)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (B.length b - U32.v from)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (B.length b - U32.v from) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs) /\\\n B.live h bl /\\ B.live h bs /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (B.len b `U32.sub` from)))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if bl x1 x2 `B.loc_union` loc_buffer_from_to_if bs x3 x4) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if (B.gsub b 0ul from) x1 x2 `B.loc_union` loc_buffer_from_to_if (B.gsub b from (B.len b `U32.sub` from)) x3 x4) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (B.len b `U32.sub` from))) h'\n ))\n\ninline_for_extraction\nnoextract\nlet with_buffer_hide_from_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t { U32.v from <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (modifies_left modifies_secret: Ghost.erased bool)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (B.length b - U32.v from)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (B.length b - U32.v from) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs) /\\\n B.live h bl /\\ B.live h bs /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (B.len b `U32.sub` from)))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_left then B.loc_buffer bl else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_secret then B.loc_buffer bs else B.loc_none)) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_left then B.loc_buffer (B.gsub b 0ul from) else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_secret then B.loc_buffer (B.gsub b from (B.len b `U32.sub` from)) else B.loc_none)) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (B.len b `U32.sub` from))) h'\n ))\n=\n with_buffer_hide_from\n b\n from\n h0\n lin\n lout\n (if Ghost.reveal modifies_left then 0ul else 1ul) (if Ghost.reveal modifies_left then from else 0ul)\n (if Ghost.reveal modifies_secret then 0ul else 1ul) (if Ghost.reveal modifies_secret then B.len b `U32.sub` from else 0ul)\n post\n (fun l bl bs ->\n B.gsub_zero_length bl;\n B.gsub_zero_length bs;\n f l bl bs\n )\n\ninline_for_extraction\nnoextract\nlet with_whole_buffer_hide_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (modifies_b: Ghost.erased bool)\n (post: (res: t) -> (cont: Seq.lseq U8.t (B.length b)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bs: B.buffer Secret.uint8 { B.length bs == B.length b }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bs) /\\\n B.live h bs /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 b)\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_b then B.loc_buffer bs else B.loc_none)) h h' /\\\n post res (Seq.seq_reveal (B.as_seq h' bs)) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_b then B.loc_buffer b else B.loc_none)) h h' /\\\n post res (B.as_seq h' b) h'\n ))\n= let sq : squash (B.gsub b 0ul (B.len b) == b) =\n B.gsub_zero_length b\n in\n let h0 = HST.get () in\n with_buffer_hide_from_weak_modifies\n b\n 0ul\n h0\n lin\n lout\n (Ghost.hide false) modifies_b\n (fun res _ cont h -> post res cont h)\n (fun l bl bs ->\n f l bs\n )\n\ninline_for_extraction\nnoextract\nlet with_whole_buffer_hide_weak_modifies'\n (#t: Type)\n (b: B.buffer U8.t)\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (modifies_b: Ghost.erased bool)\n (post: (res: t) -> (cont: Seq.lseq Secret.uint8 (B.length b)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bs: B.buffer Secret.uint8 { B.length bs == B.length b }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bs) /\\\n B.live h bs /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 b)\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_b then B.loc_buffer bs else B.loc_none)) h h' /\\\n post res (B.as_seq h' bs) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_b then B.loc_buffer b else B.loc_none)) h h' /\\\n post res (Seq.seq_hide (B.as_seq h' b)) h'", "dependencies": { "source_file": "QUIC.Secret.Buffer.fsti", "checked_file": "QUIC.Secret.Buffer.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b: LowStar.Buffer.buffer FStar.UInt8.t ->\n h0: FStar.Monotonic.HyperStack.mem ->\n lin:\n FStar.Ghost.erased LowStar.Monotonic.Buffer.loc\n { LowStar.Monotonic.Buffer.loc_disjoint (FStar.Ghost.reveal lin)\n (LowStar.Monotonic.Buffer.loc_buffer b) } ->\n lout:\n FStar.Ghost.erased LowStar.Monotonic.Buffer.loc\n { LowStar.Monotonic.Buffer.loc_disjoint (FStar.Ghost.reveal lout)\n (LowStar.Monotonic.Buffer.loc_buffer b) } ->\n modifies_b: FStar.Ghost.erased Prims.bool ->\n post:\n (\n res: t ->\n cont: FStar.Seq.Properties.lseq Lib.IntTypes.uint8 (LowStar.Monotonic.Buffer.length b) ->\n h: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0) ->\n f:\n (\n l: FStar.Ghost.erased LowStar.Monotonic.Buffer.loc ->\n bs:\n LowStar.Buffer.buffer Lib.IntTypes.uint8\n {LowStar.Monotonic.Buffer.length bs == LowStar.Monotonic.Buffer.length b}\n -> FStar.HyperStack.ST.Stack t)\n -> FStar.HyperStack.ST.Stack t", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.Monotonic.HyperStack.mem", "FStar.Ghost.erased", "LowStar.Monotonic.Buffer.loc", "LowStar.Monotonic.Buffer.loc_disjoint", "FStar.Ghost.reveal", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Buffer.trivial_preorder", "Prims.bool", "FStar.Seq.Properties.lseq", "Lib.IntTypes.uint8", "LowStar.Monotonic.Buffer.length", "Prims.eq2", "Prims.nat", "Prims.l_and", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.live", "FStar.Seq.Base.seq", "LowStar.Monotonic.Buffer.as_seq", "QUIC.Secret.Seq.seq_hide", "Lib.IntTypes.U8", "LowStar.Monotonic.Buffer.loc_none", "QUIC.Secret.Buffer.with_whole_buffer_hide_weak_modifies", "FStar.HyperStack.ST.get" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val with_whole_buffer_hide_weak_modifies'\n (#t: Type)\n (b: B.buffer U8.t)\n (h0: HS.mem)\n (lin: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b)})\n (lout: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b)})\n (modifies_b: Ghost.erased bool)\n (post: (res: t -> cont: Seq.lseq Secret.uint8 (B.length b) -> h: HS.mem -> GTot Type0))\n (f:\n (l: Ghost.erased B.loc -> bs: B.buffer Secret.uint8 {B.length bs == B.length b}\n -> HST.Stack t\n (requires\n (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint ((Ghost.reveal lin) `B.loc_union` (Ghost.reveal lout))\n ((Ghost.reveal l) `B.loc_union` (B.loc_buffer bs)) /\\ B.live h bs /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 b)))\n (ensures\n (fun h res h' ->\n B.modifies ((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_b then B.loc_buffer bs else B.loc_none))\n h\n h' /\\ post res (B.as_seq h' bs) h'))))\n : HST.Stack t\n (requires (fun h -> B.live h b /\\ h0 == h))\n (ensures\n (fun h res h' ->\n B.modifies ((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_b then B.loc_buffer b else B.loc_none))\n h\n h' /\\ post res (Seq.seq_hide (B.as_seq h' b)) h'))\nlet with_whole_buffer_hide_weak_modifies'\n (#t: Type)\n (b: B.buffer U8.t)\n (h0: HS.mem)\n (lin: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b)})\n (lout: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b)})\n (modifies_b: Ghost.erased bool)\n (post: (res: t -> cont: Seq.lseq Secret.uint8 (B.length b) -> h: HS.mem -> GTot Type0))\n (f:\n (l: Ghost.erased B.loc -> bs: B.buffer Secret.uint8 {B.length bs == B.length b}\n -> HST.Stack t\n (requires\n (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint ((Ghost.reveal lin) `B.loc_union` (Ghost.reveal lout))\n ((Ghost.reveal l) `B.loc_union` (B.loc_buffer bs)) /\\ B.live h bs /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 b)))\n (ensures\n (fun h res h' ->\n B.modifies ((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_b then B.loc_buffer bs else B.loc_none))\n h\n h' /\\ post res (B.as_seq h' bs) h'))))\n : HST.Stack t\n (requires (fun h -> B.live h b /\\ h0 == h))\n (ensures\n (fun h res h' ->\n B.modifies ((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_b then B.loc_buffer b else B.loc_none))\n h\n h' /\\ post res (Seq.seq_hide (B.as_seq h' b)) h')) =", "completed_definiton": "let h0 = HST.get () in\nwith_whole_buffer_hide_weak_modifies b\n h0\n lin\n lout\n modifies_b\n (fun res cont h -> post res (Seq.seq_hide #Secret.U8 cont) h)\n (fun l bs -> f l bs)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Buffer.fsti", "name": "QUIC.Secret.Buffer.buffer_update_strong", "original_source_type": "val buffer_update_strong (#t: Type0) (b: B.buffer t) (i: U32.t{U32.v i < B.length b}) (v: t)\n : HST.Stack unit\n (requires (fun h -> B.live h b))\n (ensures\n (fun h _ h' ->\n B.modifies (B.loc_buffer (B.gsub b i 1ul)) h h' /\\\n (B.as_seq h' b) `Seq.equal` (Seq.upd (B.as_seq h b) (U32.v i) v)))", "source_type": "val buffer_update_strong (#t: Type0) (b: B.buffer t) (i: U32.t{U32.v i < B.length b}) (v: t)\n : HST.Stack unit\n (requires (fun h -> B.live h b))\n (ensures\n (fun h _ h' ->\n B.modifies (B.loc_buffer (B.gsub b i 1ul)) h h' /\\\n (B.as_seq h' b) `Seq.equal` (Seq.upd (B.as_seq h b) (U32.v i) v)))", "source_definition": "let buffer_update_strong\n (#t: Type0)\n (b: B.buffer t)\n (i: U32.t { U32.v i < B.length b })\n (v: t)\n: HST.Stack unit\n (requires (fun h -> B.live h b))\n (ensures (fun h _ h' ->\n B.modifies (B.loc_buffer (B.gsub b i 1ul)) h h' /\\\n B.as_seq h' b `Seq.equal` Seq.upd (B.as_seq h b) (U32.v i) v\n ))\n= let b' = B.sub b i 1ul in\n let h = HST.get () in\n B.upd b' 0ul v;\n let h' = HST.get () in\n let f\n (j: nat { j < B.length b })\n : Lemma\n (Seq.index (B.as_seq h' b) j == Seq.index (Seq.upd (B.as_seq h b) (U32.v i) v) j)\n = let (b_, j_) =\n if j < U32.v i\n then B.gsub b 0ul i, j\n else if j = U32.v i\n then B.gsub b i 1ul, 0\n else B.gsub b (i `U32.add` 1ul) (B.len b `U32.sub` (i `U32.add` 1ul)), j - (U32.v i + 1)\n in\n assert (Seq.index (B.as_seq h b) j == Seq.index (B.as_seq h b_) j_);\n assert (Seq.index (B.as_seq h' b) j == Seq.index (B.as_seq h' b_) j_)\n in\n Classical.forall_intro f", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Buffer.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 386, "start_col": 1, "end_line": 404, "end_col": 26 }, "file_context": "module QUIC.Secret.Buffer\n\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\nmodule Seq = QUIC.Secret.Seq\nmodule Ghost = FStar.Ghost\n\nmodule U32 = FStar.UInt32\n\n#set-options \"--z3rlimit 32\"\n\nlet loc_buffer_from_to_if\n (#t: Type)\n (b: B.buffer t)\n (from to: U32.t)\n: GTot B.loc\n= if U32.v to < U32.v from || U32.v to > B.length b\n then B.loc_none\n else B.loc_buffer (B.gsub b from (to `U32.sub` from))\n\ninline_for_extraction\nnoextract\nval with_buffer_hide\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t)\n (to: U32.t { U32.v from <= U32.v to /\\ U32.v to <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (x1 x2 x3 x4 x5 x6: Ghost.erased U32.t)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (U32.v to - U32.v from)) -> (contr: Seq.lseq U8.t (B.length b - U32.v to)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (U32.v to - U32.v from) }) ->\n (br: B.buffer U8.t { B.length br == (B.length b - U32.v to) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl `B.loc_union` B.loc_buffer bs) (B.loc_buffer br) /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs `B.loc_union` B.loc_buffer br) /\\\n B.live h bl /\\ B.live h bs /\\ B.live h br /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (to `U32.sub` from))) /\\\n B.as_seq h br == B.as_seq h0 (B.gsub b to (B.len b `U32.sub` to))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if bl x1 x2 `B.loc_union` loc_buffer_from_to_if bs x3 x4 `B.loc_union` loc_buffer_from_to_if br x5 x6) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) (B.as_seq h' br) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if (B.gsub b 0ul from) x1 x2 `B.loc_union` loc_buffer_from_to_if (B.gsub b from (to `U32.sub` from)) x3 x4 `B.loc_union` loc_buffer_from_to_if (B.gsub b to (B.len b `U32.sub` to)) x5 x6) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (to `U32.sub` from))) (B.as_seq h' (B.gsub b to (B.len b `U32.sub` to))) h'\n ))\n\ninline_for_extraction\nnoextract\nlet with_buffer_hide_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t)\n (to: U32.t { U32.v from <= U32.v to /\\ U32.v to <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (modifies_left modifies_secret modifies_right: Ghost.erased bool)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (U32.v to - U32.v from)) -> (contr: Seq.lseq U8.t (B.length b - U32.v to)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (U32.v to - U32.v from) }) ->\n (br: B.buffer U8.t { B.length br == (B.length b - U32.v to) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl `B.loc_union` B.loc_buffer bs) (B.loc_buffer br) /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs `B.loc_union` B.loc_buffer br) /\\\n B.live h bl /\\ B.live h bs /\\ B.live h br /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (to `U32.sub` from))) /\\\n B.as_seq h br == B.as_seq h0 (B.gsub b to (B.len b `U32.sub` to))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_left then B.loc_buffer bl else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_secret then B.loc_buffer bs else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_right then B.loc_buffer br else B.loc_none)) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) (B.as_seq h' br) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_left then B.loc_buffer (B.gsub b 0ul from) else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_secret then B.loc_buffer (B.gsub b from (to `U32.sub` from)) else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_right then B.loc_buffer (B.gsub b to (B.len b `U32.sub` to)) else B.loc_none)) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (to `U32.sub` from))) (B.as_seq h' (B.gsub b to (B.len b `U32.sub` to))) h'\n ))\n=\n with_buffer_hide\n b\n from\n to\n h0\n lin\n lout\n (if Ghost.reveal modifies_left then 0ul else 1ul) (if Ghost.reveal modifies_left then from else 0ul)\n (if Ghost.reveal modifies_secret then 0ul else 1ul) (if Ghost.reveal modifies_secret then (to `U32.sub` from) else 0ul)\n (if Ghost.reveal modifies_right then 0ul else 1ul) (if Ghost.reveal modifies_right then (B.len b `U32.sub` to) else 0ul)\n post\n (fun l bl bs br ->\n B.gsub_zero_length bl;\n B.gsub_zero_length bs;\n B.gsub_zero_length br;\n f l bl bs br\n )\n\n(* NOTE: this CANNOT be derived from with_buffer_hide, because `to` should be the length, which is ghost *)\n\ninline_for_extraction\nnoextract\nval with_buffer_hide_from\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t { U32.v from <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (x1 x2 x3 x4: Ghost.erased U32.t)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (B.length b - U32.v from)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (B.length b - U32.v from) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs) /\\\n B.live h bl /\\ B.live h bs /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (B.len b `U32.sub` from)))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if bl x1 x2 `B.loc_union` loc_buffer_from_to_if bs x3 x4) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if (B.gsub b 0ul from) x1 x2 `B.loc_union` loc_buffer_from_to_if (B.gsub b from (B.len b `U32.sub` from)) x3 x4) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (B.len b `U32.sub` from))) h'\n ))\n\ninline_for_extraction\nnoextract\nlet with_buffer_hide_from_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t { U32.v from <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (modifies_left modifies_secret: Ghost.erased bool)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (B.length b - U32.v from)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (B.length b - U32.v from) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs) /\\\n B.live h bl /\\ B.live h bs /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (B.len b `U32.sub` from)))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_left then B.loc_buffer bl else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_secret then B.loc_buffer bs else B.loc_none)) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_left then B.loc_buffer (B.gsub b 0ul from) else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_secret then B.loc_buffer (B.gsub b from (B.len b `U32.sub` from)) else B.loc_none)) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (B.len b `U32.sub` from))) h'\n ))\n=\n with_buffer_hide_from\n b\n from\n h0\n lin\n lout\n (if Ghost.reveal modifies_left then 0ul else 1ul) (if Ghost.reveal modifies_left then from else 0ul)\n (if Ghost.reveal modifies_secret then 0ul else 1ul) (if Ghost.reveal modifies_secret then B.len b `U32.sub` from else 0ul)\n post\n (fun l bl bs ->\n B.gsub_zero_length bl;\n B.gsub_zero_length bs;\n f l bl bs\n )\n\ninline_for_extraction\nnoextract\nlet with_whole_buffer_hide_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (modifies_b: Ghost.erased bool)\n (post: (res: t) -> (cont: Seq.lseq U8.t (B.length b)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bs: B.buffer Secret.uint8 { B.length bs == B.length b }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bs) /\\\n B.live h bs /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 b)\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_b then B.loc_buffer bs else B.loc_none)) h h' /\\\n post res (Seq.seq_reveal (B.as_seq h' bs)) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_b then B.loc_buffer b else B.loc_none)) h h' /\\\n post res (B.as_seq h' b) h'\n ))\n= let sq : squash (B.gsub b 0ul (B.len b) == b) =\n B.gsub_zero_length b\n in\n let h0 = HST.get () in\n with_buffer_hide_from_weak_modifies\n b\n 0ul\n h0\n lin\n lout\n (Ghost.hide false) modifies_b\n (fun res _ cont h -> post res cont h)\n (fun l bl bs ->\n f l bs\n )\n\ninline_for_extraction\nnoextract\nlet with_whole_buffer_hide_weak_modifies'\n (#t: Type)\n (b: B.buffer U8.t)\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (modifies_b: Ghost.erased bool)\n (post: (res: t) -> (cont: Seq.lseq Secret.uint8 (B.length b)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bs: B.buffer Secret.uint8 { B.length bs == B.length b }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bs) /\\\n B.live h bs /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 b)\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_b then B.loc_buffer bs else B.loc_none)) h h' /\\\n post res (B.as_seq h' bs) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_b then B.loc_buffer b else B.loc_none)) h h' /\\\n post res (Seq.seq_hide (B.as_seq h' b)) h'\n ))\n= let h0 = HST.get () in\n with_whole_buffer_hide_weak_modifies\n b\n h0\n lin\n lout\n modifies_b\n (fun res cont h -> post res (Seq.seq_hide #Secret.U8 cont) h)\n (fun l bs ->\n f l bs\n )\n\nmodule E = FStar.Endianness\n\ninline_for_extraction noextract\nval load64_be\n (b:B.buffer Secret.uint8{B.length b == 8}):\n HST.Stack Secret.uint64\n (requires (fun h -> B.live h b))\n (ensures (fun h0 z h1 -> h0 == h1 /\\ B.live h1 b /\\\n E.be_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))\n\ninline_for_extraction noextract\nval load32_be\n (b:B.buffer Secret.uint8{B.length b == 4}):\n HST.Stack Secret.uint32\n (requires (fun h -> B.live h b))\n (ensures (fun h0 z h1 -> h0 == h1 /\\ B.live h1 b /\\\n E.be_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))\n\ninline_for_extraction noextract\nval load32_le\n (b:B.buffer Secret.uint8 {B.length b == 4}):\n HST.Stack Secret.uint32\n (requires (fun h -> B.live h b))\n (ensures (fun h0 z h1 -> h0 == h1 /\\ B.live h1 b /\\\n E.le_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))\n\ninline_for_extraction noextract\nval store64_be\n (b:B.buffer Secret.uint8 {B.length b == 8})\n (z:Secret.uint64)\n: HST.Stack unit\n (requires (fun h -> B.live h b))\n (ensures (fun h0 _ h1 -> B.(modifies (loc_buffer b) h0 h1) /\\ B.live h1 b /\\\n E.be_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))\n\ninline_for_extraction noextract\nval store32_be\n (b:B.buffer Secret.uint8 {B.length b == 4})\n (z:Secret.uint32)\n: HST.Stack unit\n (requires (fun h -> B.live h b))\n (ensures (fun h0 _ h1 -> B.(modifies (loc_buffer b) h0 h1) /\\ B.live h1 b /\\\n E.be_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))\n\ninline_for_extraction noextract\nval store32_le\n (b:B.buffer Secret.uint8 {B.length b == 4})\n (z:Secret.uint32)\n: HST.Stack unit\n (requires (fun h -> B.live h b))\n (ensures (fun h0 _ h1 -> B.(modifies (loc_buffer b) h0 h1) /\\ B.live h1 b /\\\n E.le_to_n (Seq.seq_reveal (B.as_seq h1 b)) == Secret.v z))\n\n(* Not secret-related, but very useful for footprints *)\n\ninline_for_extraction\nlet buffer_update_strong\n (#t: Type0)\n (b: B.buffer t)\n (i: U32.t { U32.v i < B.length b })\n (v: t)\n: HST.Stack unit\n (requires (fun h -> B.live h b))\n (ensures (fun h _ h' ->\n B.modifies (B.loc_buffer (B.gsub b i 1ul)) h h' /\\\n B.as_seq h' b `Seq.equal` Seq.upd (B.as_seq h b) (U32.v i) v", "dependencies": { "source_file": "QUIC.Secret.Buffer.fsti", "checked_file": "QUIC.Secret.Buffer.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "E", "full_module": "FStar.Endianness" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b: LowStar.Buffer.buffer t ->\n i: FStar.UInt32.t{FStar.UInt32.v i < LowStar.Monotonic.Buffer.length b} ->\n v: t\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThan", "FStar.UInt32.v", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "FStar.Classical.forall_intro", "Prims.nat", "Prims.eq2", "FStar.Seq.Base.index", "LowStar.Monotonic.Buffer.as_seq", "FStar.Seq.Base.upd", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern", "LowStar.Monotonic.Buffer.mbuffer", "Prims._assert", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.Mktuple2", "LowStar.Buffer.gsub", "FStar.UInt32.__uint_to_t", "Prims.bool", "Prims.op_Equality", "Prims.int", "Prims.l_or", "Prims.l_and", "Prims.op_GreaterThanOrEqual", "FStar.UInt.size", "FStar.UInt32.n", "FStar.UInt32.add", "FStar.UInt32.sub", "LowStar.Monotonic.Buffer.len", "Prims.op_Subtraction", "Prims.op_Addition", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "LowStar.Monotonic.Buffer.upd", "LowStar.Buffer.sub", "FStar.Ghost.hide", "LowStar.Monotonic.Buffer.live", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_buffer", "FStar.Seq.Base.equal" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val buffer_update_strong (#t: Type0) (b: B.buffer t) (i: U32.t{U32.v i < B.length b}) (v: t)\n : HST.Stack unit\n (requires (fun h -> B.live h b))\n (ensures\n (fun h _ h' ->\n B.modifies (B.loc_buffer (B.gsub b i 1ul)) h h' /\\\n (B.as_seq h' b) `Seq.equal` (Seq.upd (B.as_seq h b) (U32.v i) v)))\nlet buffer_update_strong (#t: Type0) (b: B.buffer t) (i: U32.t{U32.v i < B.length b}) (v: t)\n : HST.Stack unit\n (requires (fun h -> B.live h b))\n (ensures\n (fun h _ h' ->\n B.modifies (B.loc_buffer (B.gsub b i 1ul)) h h' /\\\n (B.as_seq h' b) `Seq.equal` (Seq.upd (B.as_seq h b) (U32.v i) v))) =", "completed_definiton": "let b' = B.sub b i 1ul in\nlet h = HST.get () in\nB.upd b' 0ul v;\nlet h' = HST.get () in\nlet f (j: nat{j < B.length b})\n : Lemma (Seq.index (B.as_seq h' b) j == Seq.index (Seq.upd (B.as_seq h b) (U32.v i) v) j) =\n let b_, j_ =\n if j < U32.v i\n then B.gsub b 0ul i, j\n else\n if j = U32.v i\n then B.gsub b i 1ul, 0\n else B.gsub b (i `U32.add` 1ul) ((B.len b) `U32.sub` (i `U32.add` 1ul)), j - (U32.v i + 1)\n in\n assert (Seq.index (B.as_seq h b) j == Seq.index (B.as_seq h b_) j_);\n assert (Seq.index (B.as_seq h' b) j == Seq.index (B.as_seq h' b_) j_)\nin\nClassical.forall_intro f", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Buffer.fsti", "name": "QUIC.Secret.Buffer.with_whole_buffer_hide_weak_modifies", "original_source_type": "val with_whole_buffer_hide_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (h0: HS.mem)\n (lin: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b)})\n (lout: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b)})\n (modifies_b: Ghost.erased bool)\n (post: (res: t -> cont: Seq.lseq U8.t (B.length b) -> h: HS.mem -> GTot Type0))\n (f:\n (l: Ghost.erased B.loc -> bs: B.buffer Secret.uint8 {B.length bs == B.length b}\n -> HST.Stack t\n (requires\n (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint ((Ghost.reveal lin) `B.loc_union` (Ghost.reveal lout))\n ((Ghost.reveal l) `B.loc_union` (B.loc_buffer bs)) /\\ B.live h bs /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 b)))\n (ensures\n (fun h res h' ->\n B.modifies ((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_b then B.loc_buffer bs else B.loc_none))\n h\n h' /\\ post res (Seq.seq_reveal (B.as_seq h' bs)) h'))))\n : HST.Stack t\n (requires (fun h -> B.live h b /\\ h0 == h))\n (ensures\n (fun h res h' ->\n B.modifies ((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_b then B.loc_buffer b else B.loc_none))\n h\n h' /\\ post res (B.as_seq h' b) h'))", "source_type": "val with_whole_buffer_hide_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (h0: HS.mem)\n (lin: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b)})\n (lout: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b)})\n (modifies_b: Ghost.erased bool)\n (post: (res: t -> cont: Seq.lseq U8.t (B.length b) -> h: HS.mem -> GTot Type0))\n (f:\n (l: Ghost.erased B.loc -> bs: B.buffer Secret.uint8 {B.length bs == B.length b}\n -> HST.Stack t\n (requires\n (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint ((Ghost.reveal lin) `B.loc_union` (Ghost.reveal lout))\n ((Ghost.reveal l) `B.loc_union` (B.loc_buffer bs)) /\\ B.live h bs /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 b)))\n (ensures\n (fun h res h' ->\n B.modifies ((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_b then B.loc_buffer bs else B.loc_none))\n h\n h' /\\ post res (Seq.seq_reveal (B.as_seq h' bs)) h'))))\n : HST.Stack t\n (requires (fun h -> B.live h b /\\ h0 == h))\n (ensures\n (fun h res h' ->\n B.modifies ((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_b then B.loc_buffer b else B.loc_none))\n h\n h' /\\ post res (B.as_seq h' b) h'))", "source_definition": "let with_whole_buffer_hide_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (modifies_b: Ghost.erased bool)\n (post: (res: t) -> (cont: Seq.lseq U8.t (B.length b)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bs: B.buffer Secret.uint8 { B.length bs == B.length b }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bs) /\\\n B.live h bs /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 b)\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_b then B.loc_buffer bs else B.loc_none)) h h' /\\\n post res (Seq.seq_reveal (B.as_seq h' bs)) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_b then B.loc_buffer b else B.loc_none)) h h' /\\\n post res (B.as_seq h' b) h'\n ))\n= let sq : squash (B.gsub b 0ul (B.len b) == b) =\n B.gsub_zero_length b\n in\n let h0 = HST.get () in\n with_buffer_hide_from_weak_modifies\n b\n 0ul\n h0\n lin\n lout\n (Ghost.hide false) modifies_b\n (fun res _ cont h -> post res cont h)\n (fun l bl bs ->\n f l bs\n )", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Buffer.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 257, "start_col": 1, "end_line": 271, "end_col": 5 }, "file_context": "module QUIC.Secret.Buffer\n\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\nmodule Seq = QUIC.Secret.Seq\nmodule Ghost = FStar.Ghost\n\nmodule U32 = FStar.UInt32\n\n#set-options \"--z3rlimit 32\"\n\nlet loc_buffer_from_to_if\n (#t: Type)\n (b: B.buffer t)\n (from to: U32.t)\n: GTot B.loc\n= if U32.v to < U32.v from || U32.v to > B.length b\n then B.loc_none\n else B.loc_buffer (B.gsub b from (to `U32.sub` from))\n\ninline_for_extraction\nnoextract\nval with_buffer_hide\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t)\n (to: U32.t { U32.v from <= U32.v to /\\ U32.v to <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (x1 x2 x3 x4 x5 x6: Ghost.erased U32.t)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (U32.v to - U32.v from)) -> (contr: Seq.lseq U8.t (B.length b - U32.v to)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (U32.v to - U32.v from) }) ->\n (br: B.buffer U8.t { B.length br == (B.length b - U32.v to) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl `B.loc_union` B.loc_buffer bs) (B.loc_buffer br) /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs `B.loc_union` B.loc_buffer br) /\\\n B.live h bl /\\ B.live h bs /\\ B.live h br /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (to `U32.sub` from))) /\\\n B.as_seq h br == B.as_seq h0 (B.gsub b to (B.len b `U32.sub` to))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if bl x1 x2 `B.loc_union` loc_buffer_from_to_if bs x3 x4 `B.loc_union` loc_buffer_from_to_if br x5 x6) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) (B.as_seq h' br) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if (B.gsub b 0ul from) x1 x2 `B.loc_union` loc_buffer_from_to_if (B.gsub b from (to `U32.sub` from)) x3 x4 `B.loc_union` loc_buffer_from_to_if (B.gsub b to (B.len b `U32.sub` to)) x5 x6) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (to `U32.sub` from))) (B.as_seq h' (B.gsub b to (B.len b `U32.sub` to))) h'\n ))\n\ninline_for_extraction\nnoextract\nlet with_buffer_hide_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t)\n (to: U32.t { U32.v from <= U32.v to /\\ U32.v to <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (modifies_left modifies_secret modifies_right: Ghost.erased bool)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (U32.v to - U32.v from)) -> (contr: Seq.lseq U8.t (B.length b - U32.v to)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (U32.v to - U32.v from) }) ->\n (br: B.buffer U8.t { B.length br == (B.length b - U32.v to) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl `B.loc_union` B.loc_buffer bs) (B.loc_buffer br) /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs `B.loc_union` B.loc_buffer br) /\\\n B.live h bl /\\ B.live h bs /\\ B.live h br /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (to `U32.sub` from))) /\\\n B.as_seq h br == B.as_seq h0 (B.gsub b to (B.len b `U32.sub` to))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_left then B.loc_buffer bl else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_secret then B.loc_buffer bs else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_right then B.loc_buffer br else B.loc_none)) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) (B.as_seq h' br) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_left then B.loc_buffer (B.gsub b 0ul from) else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_secret then B.loc_buffer (B.gsub b from (to `U32.sub` from)) else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_right then B.loc_buffer (B.gsub b to (B.len b `U32.sub` to)) else B.loc_none)) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (to `U32.sub` from))) (B.as_seq h' (B.gsub b to (B.len b `U32.sub` to))) h'\n ))\n=\n with_buffer_hide\n b\n from\n to\n h0\n lin\n lout\n (if Ghost.reveal modifies_left then 0ul else 1ul) (if Ghost.reveal modifies_left then from else 0ul)\n (if Ghost.reveal modifies_secret then 0ul else 1ul) (if Ghost.reveal modifies_secret then (to `U32.sub` from) else 0ul)\n (if Ghost.reveal modifies_right then 0ul else 1ul) (if Ghost.reveal modifies_right then (B.len b `U32.sub` to) else 0ul)\n post\n (fun l bl bs br ->\n B.gsub_zero_length bl;\n B.gsub_zero_length bs;\n B.gsub_zero_length br;\n f l bl bs br\n )\n\n(* NOTE: this CANNOT be derived from with_buffer_hide, because `to` should be the length, which is ghost *)\n\ninline_for_extraction\nnoextract\nval with_buffer_hide_from\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t { U32.v from <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (x1 x2 x3 x4: Ghost.erased U32.t)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (B.length b - U32.v from)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (B.length b - U32.v from) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs) /\\\n B.live h bl /\\ B.live h bs /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (B.len b `U32.sub` from)))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if bl x1 x2 `B.loc_union` loc_buffer_from_to_if bs x3 x4) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if (B.gsub b 0ul from) x1 x2 `B.loc_union` loc_buffer_from_to_if (B.gsub b from (B.len b `U32.sub` from)) x3 x4) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (B.len b `U32.sub` from))) h'\n ))\n\ninline_for_extraction\nnoextract\nlet with_buffer_hide_from_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t { U32.v from <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (modifies_left modifies_secret: Ghost.erased bool)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (B.length b - U32.v from)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (B.length b - U32.v from) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs) /\\\n B.live h bl /\\ B.live h bs /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (B.len b `U32.sub` from)))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_left then B.loc_buffer bl else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_secret then B.loc_buffer bs else B.loc_none)) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_left then B.loc_buffer (B.gsub b 0ul from) else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_secret then B.loc_buffer (B.gsub b from (B.len b `U32.sub` from)) else B.loc_none)) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (B.len b `U32.sub` from))) h'\n ))\n=\n with_buffer_hide_from\n b\n from\n h0\n lin\n lout\n (if Ghost.reveal modifies_left then 0ul else 1ul) (if Ghost.reveal modifies_left then from else 0ul)\n (if Ghost.reveal modifies_secret then 0ul else 1ul) (if Ghost.reveal modifies_secret then B.len b `U32.sub` from else 0ul)\n post\n (fun l bl bs ->\n B.gsub_zero_length bl;\n B.gsub_zero_length bs;\n f l bl bs\n )\n\ninline_for_extraction\nnoextract\nlet with_whole_buffer_hide_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (modifies_b: Ghost.erased bool)\n (post: (res: t) -> (cont: Seq.lseq U8.t (B.length b)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bs: B.buffer Secret.uint8 { B.length bs == B.length b }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bs) /\\\n B.live h bs /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 b)\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_b then B.loc_buffer bs else B.loc_none)) h h' /\\\n post res (Seq.seq_reveal (B.as_seq h' bs)) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_b then B.loc_buffer b else B.loc_none)) h h' /\\\n post res (B.as_seq h' b) h'", "dependencies": { "source_file": "QUIC.Secret.Buffer.fsti", "checked_file": "QUIC.Secret.Buffer.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b: LowStar.Buffer.buffer FStar.UInt8.t ->\n h0: FStar.Monotonic.HyperStack.mem ->\n lin:\n FStar.Ghost.erased LowStar.Monotonic.Buffer.loc\n { LowStar.Monotonic.Buffer.loc_disjoint (FStar.Ghost.reveal lin)\n (LowStar.Monotonic.Buffer.loc_buffer b) } ->\n lout:\n FStar.Ghost.erased LowStar.Monotonic.Buffer.loc\n { LowStar.Monotonic.Buffer.loc_disjoint (FStar.Ghost.reveal lout)\n (LowStar.Monotonic.Buffer.loc_buffer b) } ->\n modifies_b: FStar.Ghost.erased Prims.bool ->\n post:\n (\n res: t ->\n cont: FStar.Seq.Properties.lseq FStar.UInt8.t (LowStar.Monotonic.Buffer.length b) ->\n h: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0) ->\n f:\n (\n l: FStar.Ghost.erased LowStar.Monotonic.Buffer.loc ->\n bs:\n LowStar.Buffer.buffer Lib.IntTypes.uint8\n {LowStar.Monotonic.Buffer.length bs == LowStar.Monotonic.Buffer.length b}\n -> FStar.HyperStack.ST.Stack t)\n -> FStar.HyperStack.ST.Stack t", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.Monotonic.HyperStack.mem", "FStar.Ghost.erased", "LowStar.Monotonic.Buffer.loc", "LowStar.Monotonic.Buffer.loc_disjoint", "FStar.Ghost.reveal", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Buffer.trivial_preorder", "Prims.bool", "FStar.Seq.Properties.lseq", "LowStar.Monotonic.Buffer.length", "Lib.IntTypes.uint8", "Prims.eq2", "Prims.nat", "Prims.l_and", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.live", "FStar.Seq.Base.seq", "LowStar.Monotonic.Buffer.as_seq", "QUIC.Secret.Seq.seq_hide", "Lib.IntTypes.U8", "LowStar.Monotonic.Buffer.loc_none", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.SEC", "QUIC.Secret.Buffer.with_buffer_hide_from_weak_modifies", "FStar.UInt32.__uint_to_t", "FStar.Ghost.hide", "FStar.UInt32.v", "Prims.op_Subtraction", "Prims.int", "Prims.l_or", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "FStar.UInt.size", "FStar.UInt32.n", "FStar.HyperStack.ST.get", "Prims.squash", "LowStar.Monotonic.Buffer.mbuffer", "LowStar.Monotonic.Buffer.mgsub", "FStar.UInt32.uint_to_t", "FStar.UInt32.t", "LowStar.Monotonic.Buffer.len", "LowStar.Monotonic.Buffer.gsub_zero_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val with_whole_buffer_hide_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (h0: HS.mem)\n (lin: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b)})\n (lout: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b)})\n (modifies_b: Ghost.erased bool)\n (post: (res: t -> cont: Seq.lseq U8.t (B.length b) -> h: HS.mem -> GTot Type0))\n (f:\n (l: Ghost.erased B.loc -> bs: B.buffer Secret.uint8 {B.length bs == B.length b}\n -> HST.Stack t\n (requires\n (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint ((Ghost.reveal lin) `B.loc_union` (Ghost.reveal lout))\n ((Ghost.reveal l) `B.loc_union` (B.loc_buffer bs)) /\\ B.live h bs /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 b)))\n (ensures\n (fun h res h' ->\n B.modifies ((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_b then B.loc_buffer bs else B.loc_none))\n h\n h' /\\ post res (Seq.seq_reveal (B.as_seq h' bs)) h'))))\n : HST.Stack t\n (requires (fun h -> B.live h b /\\ h0 == h))\n (ensures\n (fun h res h' ->\n B.modifies ((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_b then B.loc_buffer b else B.loc_none))\n h\n h' /\\ post res (B.as_seq h' b) h'))\nlet with_whole_buffer_hide_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (h0: HS.mem)\n (lin: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b)})\n (lout: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b)})\n (modifies_b: Ghost.erased bool)\n (post: (res: t -> cont: Seq.lseq U8.t (B.length b) -> h: HS.mem -> GTot Type0))\n (f:\n (l: Ghost.erased B.loc -> bs: B.buffer Secret.uint8 {B.length bs == B.length b}\n -> HST.Stack t\n (requires\n (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint ((Ghost.reveal lin) `B.loc_union` (Ghost.reveal lout))\n ((Ghost.reveal l) `B.loc_union` (B.loc_buffer bs)) /\\ B.live h bs /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 b)))\n (ensures\n (fun h res h' ->\n B.modifies ((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_b then B.loc_buffer bs else B.loc_none))\n h\n h' /\\ post res (Seq.seq_reveal (B.as_seq h' bs)) h'))))\n : HST.Stack t\n (requires (fun h -> B.live h b /\\ h0 == h))\n (ensures\n (fun h res h' ->\n B.modifies ((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_b then B.loc_buffer b else B.loc_none))\n h\n h' /\\ post res (B.as_seq h' b) h')) =", "completed_definiton": "let sq:squash (B.gsub b 0ul (B.len b) == b) = B.gsub_zero_length b in\nlet h0 = HST.get () in\nwith_buffer_hide_from_weak_modifies b\n 0ul\n h0\n lin\n lout\n (Ghost.hide false)\n modifies_b\n (fun res _ cont h -> post res cont h)\n (fun l bl bs -> f l bs)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Buffer.fsti", "name": "QUIC.Secret.Buffer.with_buffer_hide_from_weak_modifies", "original_source_type": "val with_buffer_hide_from_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t{U32.v from <= B.length b})\n (h0: HS.mem)\n (lin: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b)})\n (lout: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b)})\n (modifies_left modifies_secret: Ghost.erased bool)\n (post:\n (\n res: t ->\n contl: Seq.lseq U8.t (U32.v from) ->\n cont: Seq.lseq U8.t (B.length b - U32.v from) ->\n h: HS.mem\n -> GTot Type0))\n (f:\n (\n l: Ghost.erased B.loc ->\n bl: B.buffer U8.t {B.length bl == (U32.v from)} ->\n bs: B.buffer Secret.uint8 {B.length bs == (B.length b - U32.v from)}\n -> HST.Stack t\n (requires\n (fun h ->\n B.modifies l h0 h /\\ B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint ((Ghost.reveal lin) `B.loc_union` (Ghost.reveal lout))\n (((Ghost.reveal l) `B.loc_union` (B.loc_buffer bl))\n `B.loc_union`\n (B.loc_buffer bs)) /\\ B.live h bl /\\ B.live h bs /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs ==\n Seq.seq_hide #Secret.U8\n (B.as_seq h0 (B.gsub b from ((B.len b) `U32.sub` from)))))\n (ensures\n (fun h res h' ->\n B.modifies (((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_left then B.loc_buffer bl else B.loc_none))\n `B.loc_union`\n (if Ghost.reveal modifies_secret then B.loc_buffer bs else B.loc_none))\n h\n h' /\\ post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) h'))))\n : HST.Stack t\n (requires (fun h -> B.live h b /\\ h0 == h))\n (ensures\n (fun h res h' ->\n B.modifies (((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_left\n then B.loc_buffer (B.gsub b 0ul from)\n else B.loc_none))\n `B.loc_union`\n (if Ghost.reveal modifies_secret\n then B.loc_buffer (B.gsub b from ((B.len b) `U32.sub` from))\n else B.loc_none))\n h\n h' /\\\n post res\n (B.as_seq h' (B.gsub b 0ul from))\n (B.as_seq h' (B.gsub b from ((B.len b) `U32.sub` from)))\n h'))", "source_type": "val with_buffer_hide_from_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t{U32.v from <= B.length b})\n (h0: HS.mem)\n (lin: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b)})\n (lout: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b)})\n (modifies_left modifies_secret: Ghost.erased bool)\n (post:\n (\n res: t ->\n contl: Seq.lseq U8.t (U32.v from) ->\n cont: Seq.lseq U8.t (B.length b - U32.v from) ->\n h: HS.mem\n -> GTot Type0))\n (f:\n (\n l: Ghost.erased B.loc ->\n bl: B.buffer U8.t {B.length bl == (U32.v from)} ->\n bs: B.buffer Secret.uint8 {B.length bs == (B.length b - U32.v from)}\n -> HST.Stack t\n (requires\n (fun h ->\n B.modifies l h0 h /\\ B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint ((Ghost.reveal lin) `B.loc_union` (Ghost.reveal lout))\n (((Ghost.reveal l) `B.loc_union` (B.loc_buffer bl))\n `B.loc_union`\n (B.loc_buffer bs)) /\\ B.live h bl /\\ B.live h bs /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs ==\n Seq.seq_hide #Secret.U8\n (B.as_seq h0 (B.gsub b from ((B.len b) `U32.sub` from)))))\n (ensures\n (fun h res h' ->\n B.modifies (((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_left then B.loc_buffer bl else B.loc_none))\n `B.loc_union`\n (if Ghost.reveal modifies_secret then B.loc_buffer bs else B.loc_none))\n h\n h' /\\ post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) h'))))\n : HST.Stack t\n (requires (fun h -> B.live h b /\\ h0 == h))\n (ensures\n (fun h res h' ->\n B.modifies (((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_left\n then B.loc_buffer (B.gsub b 0ul from)\n else B.loc_none))\n `B.loc_union`\n (if Ghost.reveal modifies_secret\n then B.loc_buffer (B.gsub b from ((B.len b) `U32.sub` from))\n else B.loc_none))\n h\n h' /\\\n post res\n (B.as_seq h' (B.gsub b 0ul from))\n (B.as_seq h' (B.gsub b from ((B.len b) `U32.sub` from)))\n h'))", "source_definition": "let with_buffer_hide_from_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t { U32.v from <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (modifies_left modifies_secret: Ghost.erased bool)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (B.length b - U32.v from)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (B.length b - U32.v from) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs) /\\\n B.live h bl /\\ B.live h bs /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (B.len b `U32.sub` from)))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_left then B.loc_buffer bl else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_secret then B.loc_buffer bs else B.loc_none)) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_left then B.loc_buffer (B.gsub b 0ul from) else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_secret then B.loc_buffer (B.gsub b from (B.len b `U32.sub` from)) else B.loc_none)) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (B.len b `U32.sub` from))) h'\n ))\n=\n with_buffer_hide_from\n b\n from\n h0\n lin\n lout\n (if Ghost.reveal modifies_left then 0ul else 1ul) (if Ghost.reveal modifies_left then from else 0ul)\n (if Ghost.reveal modifies_secret then 0ul else 1ul) (if Ghost.reveal modifies_secret then B.len b `U32.sub` from else 0ul)\n post\n (fun l bl bs ->\n B.gsub_zero_length bl;\n B.gsub_zero_length bs;\n f l bl bs\n )", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Buffer.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 208, "start_col": 2, "end_line": 221, "end_col": 5 }, "file_context": "module QUIC.Secret.Buffer\n\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\nmodule Seq = QUIC.Secret.Seq\nmodule Ghost = FStar.Ghost\n\nmodule U32 = FStar.UInt32\n\n#set-options \"--z3rlimit 32\"\n\nlet loc_buffer_from_to_if\n (#t: Type)\n (b: B.buffer t)\n (from to: U32.t)\n: GTot B.loc\n= if U32.v to < U32.v from || U32.v to > B.length b\n then B.loc_none\n else B.loc_buffer (B.gsub b from (to `U32.sub` from))\n\ninline_for_extraction\nnoextract\nval with_buffer_hide\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t)\n (to: U32.t { U32.v from <= U32.v to /\\ U32.v to <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (x1 x2 x3 x4 x5 x6: Ghost.erased U32.t)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (U32.v to - U32.v from)) -> (contr: Seq.lseq U8.t (B.length b - U32.v to)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (U32.v to - U32.v from) }) ->\n (br: B.buffer U8.t { B.length br == (B.length b - U32.v to) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl `B.loc_union` B.loc_buffer bs) (B.loc_buffer br) /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs `B.loc_union` B.loc_buffer br) /\\\n B.live h bl /\\ B.live h bs /\\ B.live h br /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (to `U32.sub` from))) /\\\n B.as_seq h br == B.as_seq h0 (B.gsub b to (B.len b `U32.sub` to))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if bl x1 x2 `B.loc_union` loc_buffer_from_to_if bs x3 x4 `B.loc_union` loc_buffer_from_to_if br x5 x6) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) (B.as_seq h' br) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if (B.gsub b 0ul from) x1 x2 `B.loc_union` loc_buffer_from_to_if (B.gsub b from (to `U32.sub` from)) x3 x4 `B.loc_union` loc_buffer_from_to_if (B.gsub b to (B.len b `U32.sub` to)) x5 x6) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (to `U32.sub` from))) (B.as_seq h' (B.gsub b to (B.len b `U32.sub` to))) h'\n ))\n\ninline_for_extraction\nnoextract\nlet with_buffer_hide_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t)\n (to: U32.t { U32.v from <= U32.v to /\\ U32.v to <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (modifies_left modifies_secret modifies_right: Ghost.erased bool)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (U32.v to - U32.v from)) -> (contr: Seq.lseq U8.t (B.length b - U32.v to)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (U32.v to - U32.v from) }) ->\n (br: B.buffer U8.t { B.length br == (B.length b - U32.v to) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl `B.loc_union` B.loc_buffer bs) (B.loc_buffer br) /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs `B.loc_union` B.loc_buffer br) /\\\n B.live h bl /\\ B.live h bs /\\ B.live h br /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (to `U32.sub` from))) /\\\n B.as_seq h br == B.as_seq h0 (B.gsub b to (B.len b `U32.sub` to))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_left then B.loc_buffer bl else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_secret then B.loc_buffer bs else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_right then B.loc_buffer br else B.loc_none)) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) (B.as_seq h' br) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_left then B.loc_buffer (B.gsub b 0ul from) else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_secret then B.loc_buffer (B.gsub b from (to `U32.sub` from)) else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_right then B.loc_buffer (B.gsub b to (B.len b `U32.sub` to)) else B.loc_none)) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (to `U32.sub` from))) (B.as_seq h' (B.gsub b to (B.len b `U32.sub` to))) h'\n ))\n=\n with_buffer_hide\n b\n from\n to\n h0\n lin\n lout\n (if Ghost.reveal modifies_left then 0ul else 1ul) (if Ghost.reveal modifies_left then from else 0ul)\n (if Ghost.reveal modifies_secret then 0ul else 1ul) (if Ghost.reveal modifies_secret then (to `U32.sub` from) else 0ul)\n (if Ghost.reveal modifies_right then 0ul else 1ul) (if Ghost.reveal modifies_right then (B.len b `U32.sub` to) else 0ul)\n post\n (fun l bl bs br ->\n B.gsub_zero_length bl;\n B.gsub_zero_length bs;\n B.gsub_zero_length br;\n f l bl bs br\n )\n\n(* NOTE: this CANNOT be derived from with_buffer_hide, because `to` should be the length, which is ghost *)\n\ninline_for_extraction\nnoextract\nval with_buffer_hide_from\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t { U32.v from <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (x1 x2 x3 x4: Ghost.erased U32.t)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (B.length b - U32.v from)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (B.length b - U32.v from) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs) /\\\n B.live h bl /\\ B.live h bs /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (B.len b `U32.sub` from)))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if bl x1 x2 `B.loc_union` loc_buffer_from_to_if bs x3 x4) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if (B.gsub b 0ul from) x1 x2 `B.loc_union` loc_buffer_from_to_if (B.gsub b from (B.len b `U32.sub` from)) x3 x4) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (B.len b `U32.sub` from))) h'\n ))\n\ninline_for_extraction\nnoextract\nlet with_buffer_hide_from_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t { U32.v from <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (modifies_left modifies_secret: Ghost.erased bool)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (B.length b - U32.v from)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (B.length b - U32.v from) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs) /\\\n B.live h bl /\\ B.live h bs /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (B.len b `U32.sub` from)))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_left then B.loc_buffer bl else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_secret then B.loc_buffer bs else B.loc_none)) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_left then B.loc_buffer (B.gsub b 0ul from) else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_secret then B.loc_buffer (B.gsub b from (B.len b `U32.sub` from)) else B.loc_none)) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (B.len b `U32.sub` from))) h'\n ))", "dependencies": { "source_file": "QUIC.Secret.Buffer.fsti", "checked_file": "QUIC.Secret.Buffer.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b: LowStar.Buffer.buffer FStar.UInt8.t ->\n from: FStar.UInt32.t{FStar.UInt32.v from <= LowStar.Monotonic.Buffer.length b} ->\n h0: FStar.Monotonic.HyperStack.mem ->\n lin:\n FStar.Ghost.erased LowStar.Monotonic.Buffer.loc\n { LowStar.Monotonic.Buffer.loc_disjoint (FStar.Ghost.reveal lin)\n (LowStar.Monotonic.Buffer.loc_buffer b) } ->\n lout:\n FStar.Ghost.erased LowStar.Monotonic.Buffer.loc\n { LowStar.Monotonic.Buffer.loc_disjoint (FStar.Ghost.reveal lout)\n (LowStar.Monotonic.Buffer.loc_buffer b) } ->\n modifies_left: FStar.Ghost.erased Prims.bool ->\n modifies_secret: FStar.Ghost.erased Prims.bool ->\n post:\n (\n res: t ->\n contl: FStar.Seq.Properties.lseq FStar.UInt8.t (FStar.UInt32.v from) ->\n cont:\n FStar.Seq.Properties.lseq FStar.UInt8.t\n (LowStar.Monotonic.Buffer.length b - FStar.UInt32.v from) ->\n h: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0) ->\n f:\n (\n l: FStar.Ghost.erased LowStar.Monotonic.Buffer.loc ->\n bl:\n LowStar.Buffer.buffer FStar.UInt8.t\n {LowStar.Monotonic.Buffer.length bl == FStar.UInt32.v from} ->\n bs:\n LowStar.Buffer.buffer Lib.IntTypes.uint8\n { LowStar.Monotonic.Buffer.length bs ==\n LowStar.Monotonic.Buffer.length b - FStar.UInt32.v from }\n -> FStar.HyperStack.ST.Stack t)\n -> FStar.HyperStack.ST.Stack t", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "FStar.Monotonic.HyperStack.mem", "FStar.Ghost.erased", "LowStar.Monotonic.Buffer.loc", "LowStar.Monotonic.Buffer.loc_disjoint", "FStar.Ghost.reveal", "LowStar.Monotonic.Buffer.loc_buffer", "Prims.bool", "FStar.Seq.Properties.lseq", "Prims.op_Subtraction", "Prims.eq2", "Prims.int", "Prims.l_or", "Prims.op_GreaterThanOrEqual", "FStar.UInt.size", "FStar.UInt32.n", "Lib.IntTypes.uint8", "Prims.l_and", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.live", "FStar.Seq.Base.seq", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Buffer.gsub", "FStar.UInt32.__uint_to_t", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "QUIC.Secret.Seq.seq_hide", "FStar.UInt32.sub", "LowStar.Monotonic.Buffer.len", "LowStar.Monotonic.Buffer.loc_none", "QUIC.Secret.Seq.seq_reveal", "QUIC.Secret.Buffer.with_buffer_hide_from", "FStar.Ghost.hide", "Prims.unit", "LowStar.Monotonic.Buffer.gsub_zero_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val with_buffer_hide_from_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t{U32.v from <= B.length b})\n (h0: HS.mem)\n (lin: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b)})\n (lout: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b)})\n (modifies_left modifies_secret: Ghost.erased bool)\n (post:\n (\n res: t ->\n contl: Seq.lseq U8.t (U32.v from) ->\n cont: Seq.lseq U8.t (B.length b - U32.v from) ->\n h: HS.mem\n -> GTot Type0))\n (f:\n (\n l: Ghost.erased B.loc ->\n bl: B.buffer U8.t {B.length bl == (U32.v from)} ->\n bs: B.buffer Secret.uint8 {B.length bs == (B.length b - U32.v from)}\n -> HST.Stack t\n (requires\n (fun h ->\n B.modifies l h0 h /\\ B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint ((Ghost.reveal lin) `B.loc_union` (Ghost.reveal lout))\n (((Ghost.reveal l) `B.loc_union` (B.loc_buffer bl))\n `B.loc_union`\n (B.loc_buffer bs)) /\\ B.live h bl /\\ B.live h bs /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs ==\n Seq.seq_hide #Secret.U8\n (B.as_seq h0 (B.gsub b from ((B.len b) `U32.sub` from)))))\n (ensures\n (fun h res h' ->\n B.modifies (((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_left then B.loc_buffer bl else B.loc_none))\n `B.loc_union`\n (if Ghost.reveal modifies_secret then B.loc_buffer bs else B.loc_none))\n h\n h' /\\ post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) h'))))\n : HST.Stack t\n (requires (fun h -> B.live h b /\\ h0 == h))\n (ensures\n (fun h res h' ->\n B.modifies (((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_left\n then B.loc_buffer (B.gsub b 0ul from)\n else B.loc_none))\n `B.loc_union`\n (if Ghost.reveal modifies_secret\n then B.loc_buffer (B.gsub b from ((B.len b) `U32.sub` from))\n else B.loc_none))\n h\n h' /\\\n post res\n (B.as_seq h' (B.gsub b 0ul from))\n (B.as_seq h' (B.gsub b from ((B.len b) `U32.sub` from)))\n h'))\nlet with_buffer_hide_from_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t{U32.v from <= B.length b})\n (h0: HS.mem)\n (lin: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b)})\n (lout: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b)})\n (modifies_left modifies_secret: Ghost.erased bool)\n (post:\n (\n res: t ->\n contl: Seq.lseq U8.t (U32.v from) ->\n cont: Seq.lseq U8.t (B.length b - U32.v from) ->\n h: HS.mem\n -> GTot Type0))\n (f:\n (\n l: Ghost.erased B.loc ->\n bl: B.buffer U8.t {B.length bl == (U32.v from)} ->\n bs: B.buffer Secret.uint8 {B.length bs == (B.length b - U32.v from)}\n -> HST.Stack t\n (requires\n (fun h ->\n B.modifies l h0 h /\\ B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint ((Ghost.reveal lin) `B.loc_union` (Ghost.reveal lout))\n (((Ghost.reveal l) `B.loc_union` (B.loc_buffer bl))\n `B.loc_union`\n (B.loc_buffer bs)) /\\ B.live h bl /\\ B.live h bs /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs ==\n Seq.seq_hide #Secret.U8\n (B.as_seq h0 (B.gsub b from ((B.len b) `U32.sub` from)))))\n (ensures\n (fun h res h' ->\n B.modifies (((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_left then B.loc_buffer bl else B.loc_none))\n `B.loc_union`\n (if Ghost.reveal modifies_secret then B.loc_buffer bs else B.loc_none))\n h\n h' /\\ post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) h'))))\n : HST.Stack t\n (requires (fun h -> B.live h b /\\ h0 == h))\n (ensures\n (fun h res h' ->\n B.modifies (((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_left\n then B.loc_buffer (B.gsub b 0ul from)\n else B.loc_none))\n `B.loc_union`\n (if Ghost.reveal modifies_secret\n then B.loc_buffer (B.gsub b from ((B.len b) `U32.sub` from))\n else B.loc_none))\n h\n h' /\\\n post res\n (B.as_seq h' (B.gsub b 0ul from))\n (B.as_seq h' (B.gsub b from ((B.len b) `U32.sub` from)))\n h')) =", "completed_definiton": "with_buffer_hide_from b from h0 lin lout (if Ghost.reveal modifies_left then 0ul else 1ul)\n (if Ghost.reveal modifies_left then from else 0ul)\n (if Ghost.reveal modifies_secret then 0ul else 1ul)\n (if Ghost.reveal modifies_secret then (B.len b) `U32.sub` from else 0ul) post\n (fun l bl bs ->\n B.gsub_zero_length bl;\n B.gsub_zero_length bs;\n f l bl bs)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Buffer.fsti", "name": "QUIC.Secret.Buffer.with_buffer_hide_weak_modifies", "original_source_type": "val with_buffer_hide_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t)\n (to: U32.t{U32.v from <= U32.v to /\\ U32.v to <= B.length b})\n (h0: HS.mem)\n (lin: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b)})\n (lout: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b)})\n (modifies_left modifies_secret modifies_right: Ghost.erased bool)\n (post:\n (\n res: t ->\n contl: Seq.lseq U8.t (U32.v from) ->\n cont: Seq.lseq U8.t (U32.v to - U32.v from) ->\n contr: Seq.lseq U8.t (B.length b - U32.v to) ->\n h: HS.mem\n -> GTot Type0))\n (f:\n (\n l: Ghost.erased B.loc ->\n bl: B.buffer U8.t {B.length bl == (U32.v from)} ->\n bs: B.buffer Secret.uint8 {B.length bs == (U32.v to - U32.v from)} ->\n br: B.buffer U8.t {B.length br == (B.length b - U32.v to)}\n -> HST.Stack t\n (requires\n (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint ((B.loc_buffer bl) `B.loc_union` (B.loc_buffer bs))\n (B.loc_buffer br) /\\ B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint ((Ghost.reveal lin) `B.loc_union` (Ghost.reveal lout))\n ((((Ghost.reveal l) `B.loc_union` (B.loc_buffer bl))\n `B.loc_union`\n (B.loc_buffer bs))\n `B.loc_union`\n (B.loc_buffer br)) /\\ B.live h bl /\\ B.live h bs /\\ B.live h br /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs ==\n Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (to `U32.sub` from))) /\\\n B.as_seq h br == B.as_seq h0 (B.gsub b to ((B.len b) `U32.sub` to))))\n (ensures\n (fun h res h' ->\n B.modifies ((((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_left then B.loc_buffer bl else B.loc_none)\n )\n `B.loc_union`\n (if Ghost.reveal modifies_secret then B.loc_buffer bs else B.loc_none)\n )\n `B.loc_union`\n (if Ghost.reveal modifies_right then B.loc_buffer br else B.loc_none))\n h\n h' /\\\n post res\n (B.as_seq h' bl)\n (Seq.seq_reveal (B.as_seq h' bs))\n (B.as_seq h' br)\n h'))))\n : HST.Stack t\n (requires (fun h -> B.live h b /\\ h0 == h))\n (ensures\n (fun h res h' ->\n B.modifies ((((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_left\n then B.loc_buffer (B.gsub b 0ul from)\n else B.loc_none))\n `B.loc_union`\n (if Ghost.reveal modifies_secret\n then B.loc_buffer (B.gsub b from (to `U32.sub` from))\n else B.loc_none))\n `B.loc_union`\n (if Ghost.reveal modifies_right\n then B.loc_buffer (B.gsub b to ((B.len b) `U32.sub` to))\n else B.loc_none))\n h\n h' /\\\n post res\n (B.as_seq h' (B.gsub b 0ul from))\n (B.as_seq h' (B.gsub b from (to `U32.sub` from)))\n (B.as_seq h' (B.gsub b to ((B.len b) `U32.sub` to)))\n h'))", "source_type": "val with_buffer_hide_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t)\n (to: U32.t{U32.v from <= U32.v to /\\ U32.v to <= B.length b})\n (h0: HS.mem)\n (lin: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b)})\n (lout: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b)})\n (modifies_left modifies_secret modifies_right: Ghost.erased bool)\n (post:\n (\n res: t ->\n contl: Seq.lseq U8.t (U32.v from) ->\n cont: Seq.lseq U8.t (U32.v to - U32.v from) ->\n contr: Seq.lseq U8.t (B.length b - U32.v to) ->\n h: HS.mem\n -> GTot Type0))\n (f:\n (\n l: Ghost.erased B.loc ->\n bl: B.buffer U8.t {B.length bl == (U32.v from)} ->\n bs: B.buffer Secret.uint8 {B.length bs == (U32.v to - U32.v from)} ->\n br: B.buffer U8.t {B.length br == (B.length b - U32.v to)}\n -> HST.Stack t\n (requires\n (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint ((B.loc_buffer bl) `B.loc_union` (B.loc_buffer bs))\n (B.loc_buffer br) /\\ B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint ((Ghost.reveal lin) `B.loc_union` (Ghost.reveal lout))\n ((((Ghost.reveal l) `B.loc_union` (B.loc_buffer bl))\n `B.loc_union`\n (B.loc_buffer bs))\n `B.loc_union`\n (B.loc_buffer br)) /\\ B.live h bl /\\ B.live h bs /\\ B.live h br /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs ==\n Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (to `U32.sub` from))) /\\\n B.as_seq h br == B.as_seq h0 (B.gsub b to ((B.len b) `U32.sub` to))))\n (ensures\n (fun h res h' ->\n B.modifies ((((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_left then B.loc_buffer bl else B.loc_none)\n )\n `B.loc_union`\n (if Ghost.reveal modifies_secret then B.loc_buffer bs else B.loc_none)\n )\n `B.loc_union`\n (if Ghost.reveal modifies_right then B.loc_buffer br else B.loc_none))\n h\n h' /\\\n post res\n (B.as_seq h' bl)\n (Seq.seq_reveal (B.as_seq h' bs))\n (B.as_seq h' br)\n h'))))\n : HST.Stack t\n (requires (fun h -> B.live h b /\\ h0 == h))\n (ensures\n (fun h res h' ->\n B.modifies ((((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_left\n then B.loc_buffer (B.gsub b 0ul from)\n else B.loc_none))\n `B.loc_union`\n (if Ghost.reveal modifies_secret\n then B.loc_buffer (B.gsub b from (to `U32.sub` from))\n else B.loc_none))\n `B.loc_union`\n (if Ghost.reveal modifies_right\n then B.loc_buffer (B.gsub b to ((B.len b) `U32.sub` to))\n else B.loc_none))\n h\n h' /\\\n post res\n (B.as_seq h' (B.gsub b 0ul from))\n (B.as_seq h' (B.gsub b from (to `U32.sub` from)))\n (B.as_seq h' (B.gsub b to ((B.len b) `U32.sub` to)))\n h'))", "source_definition": "let with_buffer_hide_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t)\n (to: U32.t { U32.v from <= U32.v to /\\ U32.v to <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (modifies_left modifies_secret modifies_right: Ghost.erased bool)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (U32.v to - U32.v from)) -> (contr: Seq.lseq U8.t (B.length b - U32.v to)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (U32.v to - U32.v from) }) ->\n (br: B.buffer U8.t { B.length br == (B.length b - U32.v to) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl `B.loc_union` B.loc_buffer bs) (B.loc_buffer br) /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs `B.loc_union` B.loc_buffer br) /\\\n B.live h bl /\\ B.live h bs /\\ B.live h br /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (to `U32.sub` from))) /\\\n B.as_seq h br == B.as_seq h0 (B.gsub b to (B.len b `U32.sub` to))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_left then B.loc_buffer bl else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_secret then B.loc_buffer bs else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_right then B.loc_buffer br else B.loc_none)) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) (B.as_seq h' br) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_left then B.loc_buffer (B.gsub b 0ul from) else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_secret then B.loc_buffer (B.gsub b from (to `U32.sub` from)) else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_right then B.loc_buffer (B.gsub b to (B.len b `U32.sub` to)) else B.loc_none)) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (to `U32.sub` from))) (B.as_seq h' (B.gsub b to (B.len b `U32.sub` to))) h'\n ))\n=\n with_buffer_hide\n b\n from\n to\n h0\n lin\n lout\n (if Ghost.reveal modifies_left then 0ul else 1ul) (if Ghost.reveal modifies_left then from else 0ul)\n (if Ghost.reveal modifies_secret then 0ul else 1ul) (if Ghost.reveal modifies_secret then (to `U32.sub` from) else 0ul)\n (if Ghost.reveal modifies_right then 0ul else 1ul) (if Ghost.reveal modifies_right then (B.len b `U32.sub` to) else 0ul)\n post\n (fun l bl bs br ->\n B.gsub_zero_length bl;\n B.gsub_zero_length bs;\n B.gsub_zero_length br;\n f l bl bs br\n )", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Buffer.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 110, "start_col": 2, "end_line": 126, "end_col": 5 }, "file_context": "module QUIC.Secret.Buffer\n\nmodule Secret = QUIC.Secret.Int\nmodule B = LowStar.Buffer\nmodule U8 = FStar.UInt8\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\nmodule Seq = QUIC.Secret.Seq\nmodule Ghost = FStar.Ghost\n\nmodule U32 = FStar.UInt32\n\n#set-options \"--z3rlimit 32\"\n\nlet loc_buffer_from_to_if\n (#t: Type)\n (b: B.buffer t)\n (from to: U32.t)\n: GTot B.loc\n= if U32.v to < U32.v from || U32.v to > B.length b\n then B.loc_none\n else B.loc_buffer (B.gsub b from (to `U32.sub` from))\n\ninline_for_extraction\nnoextract\nval with_buffer_hide\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t)\n (to: U32.t { U32.v from <= U32.v to /\\ U32.v to <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (x1 x2 x3 x4 x5 x6: Ghost.erased U32.t)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (U32.v to - U32.v from)) -> (contr: Seq.lseq U8.t (B.length b - U32.v to)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (U32.v to - U32.v from) }) ->\n (br: B.buffer U8.t { B.length br == (B.length b - U32.v to) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl `B.loc_union` B.loc_buffer bs) (B.loc_buffer br) /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs `B.loc_union` B.loc_buffer br) /\\\n B.live h bl /\\ B.live h bs /\\ B.live h br /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (to `U32.sub` from))) /\\\n B.as_seq h br == B.as_seq h0 (B.gsub b to (B.len b `U32.sub` to))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if bl x1 x2 `B.loc_union` loc_buffer_from_to_if bs x3 x4 `B.loc_union` loc_buffer_from_to_if br x5 x6) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) (B.as_seq h' br) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` loc_buffer_from_to_if (B.gsub b 0ul from) x1 x2 `B.loc_union` loc_buffer_from_to_if (B.gsub b from (to `U32.sub` from)) x3 x4 `B.loc_union` loc_buffer_from_to_if (B.gsub b to (B.len b `U32.sub` to)) x5 x6) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (to `U32.sub` from))) (B.as_seq h' (B.gsub b to (B.len b `U32.sub` to))) h'\n ))\n\ninline_for_extraction\nnoextract\nlet with_buffer_hide_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t)\n (to: U32.t { U32.v from <= U32.v to /\\ U32.v to <= B.length b })\n (h0: HS.mem)\n (lin: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b) })\n (lout: Ghost.erased B.loc { B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b) })\n (modifies_left modifies_secret modifies_right: Ghost.erased bool)\n (post: (res: t) -> (contl: Seq.lseq U8.t (U32.v from)) -> (cont: Seq.lseq U8.t (U32.v to - U32.v from)) -> (contr: Seq.lseq U8.t (B.length b - U32.v to)) -> (h: HS.mem) -> GTot Type0)\n (f: (\n (l: Ghost.erased B.loc) ->\n (bl: B.buffer U8.t { B.length bl == (U32.v from) }) ->\n (bs: B.buffer Secret.uint8 { B.length bs == (U32.v to - U32.v from) }) ->\n (br: B.buffer U8.t { B.length br == (B.length b - U32.v to) }) ->\n HST.Stack t\n (requires (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint (B.loc_buffer bl `B.loc_union` B.loc_buffer bs) (B.loc_buffer br) /\\\n B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint (Ghost.reveal lin `B.loc_union` Ghost.reveal lout) (Ghost.reveal l `B.loc_union` B.loc_buffer bl `B.loc_union` B.loc_buffer bs `B.loc_union` B.loc_buffer br) /\\\n B.live h bl /\\ B.live h bs /\\ B.live h br /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs == Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (to `U32.sub` from))) /\\\n B.as_seq h br == B.as_seq h0 (B.gsub b to (B.len b `U32.sub` to))\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_left then B.loc_buffer bl else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_secret then B.loc_buffer bs else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_right then B.loc_buffer br else B.loc_none)) h h' /\\\n post res (B.as_seq h' bl) (Seq.seq_reveal (B.as_seq h' bs)) (B.as_seq h' br) h'\n ))\n ))\n: HST.Stack t\n (requires (fun h ->\n B.live h b /\\\n h0 == h\n ))\n (ensures (fun h res h' ->\n B.modifies (Ghost.reveal lout `B.loc_union` (if Ghost.reveal modifies_left then B.loc_buffer (B.gsub b 0ul from) else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_secret then B.loc_buffer (B.gsub b from (to `U32.sub` from)) else B.loc_none) `B.loc_union` (if Ghost.reveal modifies_right then B.loc_buffer (B.gsub b to (B.len b `U32.sub` to)) else B.loc_none)) h h' /\\\n post res (B.as_seq h' (B.gsub b 0ul from)) (B.as_seq h' (B.gsub b from (to `U32.sub` from))) (B.as_seq h' (B.gsub b to (B.len b `U32.sub` to))) h'\n ))", "dependencies": { "source_file": "QUIC.Secret.Buffer.fsti", "checked_file": "QUIC.Secret.Buffer.fsti.checked", "interface_file": false, "dependencies": [ "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "Ghost", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 32, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b: LowStar.Buffer.buffer FStar.UInt8.t ->\n from: FStar.UInt32.t ->\n to:\n FStar.UInt32.t\n { FStar.UInt32.v from <= FStar.UInt32.v to /\\\n FStar.UInt32.v to <= LowStar.Monotonic.Buffer.length b } ->\n h0: FStar.Monotonic.HyperStack.mem ->\n lin:\n FStar.Ghost.erased LowStar.Monotonic.Buffer.loc\n { LowStar.Monotonic.Buffer.loc_disjoint (FStar.Ghost.reveal lin)\n (LowStar.Monotonic.Buffer.loc_buffer b) } ->\n lout:\n FStar.Ghost.erased LowStar.Monotonic.Buffer.loc\n { LowStar.Monotonic.Buffer.loc_disjoint (FStar.Ghost.reveal lout)\n (LowStar.Monotonic.Buffer.loc_buffer b) } ->\n modifies_left: FStar.Ghost.erased Prims.bool ->\n modifies_secret: FStar.Ghost.erased Prims.bool ->\n modifies_right: FStar.Ghost.erased Prims.bool ->\n post:\n (\n res: t ->\n contl: FStar.Seq.Properties.lseq FStar.UInt8.t (FStar.UInt32.v from) ->\n cont: FStar.Seq.Properties.lseq FStar.UInt8.t (FStar.UInt32.v to - FStar.UInt32.v from) ->\n contr:\n FStar.Seq.Properties.lseq FStar.UInt8.t\n (LowStar.Monotonic.Buffer.length b - FStar.UInt32.v to) ->\n h: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0) ->\n f:\n (\n l: FStar.Ghost.erased LowStar.Monotonic.Buffer.loc ->\n bl:\n LowStar.Buffer.buffer FStar.UInt8.t\n {LowStar.Monotonic.Buffer.length bl == FStar.UInt32.v from} ->\n bs:\n LowStar.Buffer.buffer Lib.IntTypes.uint8\n {LowStar.Monotonic.Buffer.length bs == FStar.UInt32.v to - FStar.UInt32.v from} ->\n br:\n LowStar.Buffer.buffer FStar.UInt8.t\n { LowStar.Monotonic.Buffer.length br ==\n LowStar.Monotonic.Buffer.length b - FStar.UInt32.v to }\n -> FStar.HyperStack.ST.Stack t)\n -> FStar.HyperStack.ST.Stack t", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "FStar.UInt8.t", "FStar.UInt32.t", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "FStar.Monotonic.HyperStack.mem", "FStar.Ghost.erased", "LowStar.Monotonic.Buffer.loc", "LowStar.Monotonic.Buffer.loc_disjoint", "FStar.Ghost.reveal", "LowStar.Monotonic.Buffer.loc_buffer", "Prims.bool", "FStar.Seq.Properties.lseq", "Prims.op_Subtraction", "Prims.eq2", "Prims.int", "Prims.l_or", "Prims.op_GreaterThanOrEqual", "FStar.UInt.size", "FStar.UInt32.n", "Lib.IntTypes.uint8", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.live", "FStar.Seq.Base.seq", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Buffer.gsub", "FStar.UInt32.__uint_to_t", "QUIC.Secret.Seq.seq_hide", "Lib.IntTypes.U8", "FStar.UInt32.sub", "LowStar.Monotonic.Buffer.len", "LowStar.Monotonic.Buffer.loc_none", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.SEC", "QUIC.Secret.Buffer.with_buffer_hide", "FStar.Ghost.hide", "Prims.unit", "LowStar.Monotonic.Buffer.gsub_zero_length" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val with_buffer_hide_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t)\n (to: U32.t{U32.v from <= U32.v to /\\ U32.v to <= B.length b})\n (h0: HS.mem)\n (lin: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b)})\n (lout: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b)})\n (modifies_left modifies_secret modifies_right: Ghost.erased bool)\n (post:\n (\n res: t ->\n contl: Seq.lseq U8.t (U32.v from) ->\n cont: Seq.lseq U8.t (U32.v to - U32.v from) ->\n contr: Seq.lseq U8.t (B.length b - U32.v to) ->\n h: HS.mem\n -> GTot Type0))\n (f:\n (\n l: Ghost.erased B.loc ->\n bl: B.buffer U8.t {B.length bl == (U32.v from)} ->\n bs: B.buffer Secret.uint8 {B.length bs == (U32.v to - U32.v from)} ->\n br: B.buffer U8.t {B.length br == (B.length b - U32.v to)}\n -> HST.Stack t\n (requires\n (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint ((B.loc_buffer bl) `B.loc_union` (B.loc_buffer bs))\n (B.loc_buffer br) /\\ B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint ((Ghost.reveal lin) `B.loc_union` (Ghost.reveal lout))\n ((((Ghost.reveal l) `B.loc_union` (B.loc_buffer bl))\n `B.loc_union`\n (B.loc_buffer bs))\n `B.loc_union`\n (B.loc_buffer br)) /\\ B.live h bl /\\ B.live h bs /\\ B.live h br /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs ==\n Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (to `U32.sub` from))) /\\\n B.as_seq h br == B.as_seq h0 (B.gsub b to ((B.len b) `U32.sub` to))))\n (ensures\n (fun h res h' ->\n B.modifies ((((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_left then B.loc_buffer bl else B.loc_none)\n )\n `B.loc_union`\n (if Ghost.reveal modifies_secret then B.loc_buffer bs else B.loc_none)\n )\n `B.loc_union`\n (if Ghost.reveal modifies_right then B.loc_buffer br else B.loc_none))\n h\n h' /\\\n post res\n (B.as_seq h' bl)\n (Seq.seq_reveal (B.as_seq h' bs))\n (B.as_seq h' br)\n h'))))\n : HST.Stack t\n (requires (fun h -> B.live h b /\\ h0 == h))\n (ensures\n (fun h res h' ->\n B.modifies ((((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_left\n then B.loc_buffer (B.gsub b 0ul from)\n else B.loc_none))\n `B.loc_union`\n (if Ghost.reveal modifies_secret\n then B.loc_buffer (B.gsub b from (to `U32.sub` from))\n else B.loc_none))\n `B.loc_union`\n (if Ghost.reveal modifies_right\n then B.loc_buffer (B.gsub b to ((B.len b) `U32.sub` to))\n else B.loc_none))\n h\n h' /\\\n post res\n (B.as_seq h' (B.gsub b 0ul from))\n (B.as_seq h' (B.gsub b from (to `U32.sub` from)))\n (B.as_seq h' (B.gsub b to ((B.len b) `U32.sub` to)))\n h'))\nlet with_buffer_hide_weak_modifies\n (#t: Type)\n (b: B.buffer U8.t)\n (from: U32.t)\n (to: U32.t{U32.v from <= U32.v to /\\ U32.v to <= B.length b})\n (h0: HS.mem)\n (lin: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lin) (B.loc_buffer b)})\n (lout: Ghost.erased B.loc {B.loc_disjoint (Ghost.reveal lout) (B.loc_buffer b)})\n (modifies_left modifies_secret modifies_right: Ghost.erased bool)\n (post:\n (\n res: t ->\n contl: Seq.lseq U8.t (U32.v from) ->\n cont: Seq.lseq U8.t (U32.v to - U32.v from) ->\n contr: Seq.lseq U8.t (B.length b - U32.v to) ->\n h: HS.mem\n -> GTot Type0))\n (f:\n (\n l: Ghost.erased B.loc ->\n bl: B.buffer U8.t {B.length bl == (U32.v from)} ->\n bs: B.buffer Secret.uint8 {B.length bs == (U32.v to - U32.v from)} ->\n br: B.buffer U8.t {B.length br == (B.length b - U32.v to)}\n -> HST.Stack t\n (requires\n (fun h ->\n B.modifies l h0 h /\\\n B.loc_disjoint ((B.loc_buffer bl) `B.loc_union` (B.loc_buffer bs))\n (B.loc_buffer br) /\\ B.loc_disjoint (B.loc_buffer bl) (B.loc_buffer bs) /\\\n B.loc_disjoint ((Ghost.reveal lin) `B.loc_union` (Ghost.reveal lout))\n ((((Ghost.reveal l) `B.loc_union` (B.loc_buffer bl))\n `B.loc_union`\n (B.loc_buffer bs))\n `B.loc_union`\n (B.loc_buffer br)) /\\ B.live h bl /\\ B.live h bs /\\ B.live h br /\\\n B.as_seq h bl == B.as_seq h0 (B.gsub b 0ul from) /\\\n B.as_seq h bs ==\n Seq.seq_hide #Secret.U8 (B.as_seq h0 (B.gsub b from (to `U32.sub` from))) /\\\n B.as_seq h br == B.as_seq h0 (B.gsub b to ((B.len b) `U32.sub` to))))\n (ensures\n (fun h res h' ->\n B.modifies ((((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_left then B.loc_buffer bl else B.loc_none)\n )\n `B.loc_union`\n (if Ghost.reveal modifies_secret then B.loc_buffer bs else B.loc_none)\n )\n `B.loc_union`\n (if Ghost.reveal modifies_right then B.loc_buffer br else B.loc_none))\n h\n h' /\\\n post res\n (B.as_seq h' bl)\n (Seq.seq_reveal (B.as_seq h' bs))\n (B.as_seq h' br)\n h'))))\n : HST.Stack t\n (requires (fun h -> B.live h b /\\ h0 == h))\n (ensures\n (fun h res h' ->\n B.modifies ((((Ghost.reveal lout)\n `B.loc_union`\n (if Ghost.reveal modifies_left\n then B.loc_buffer (B.gsub b 0ul from)\n else B.loc_none))\n `B.loc_union`\n (if Ghost.reveal modifies_secret\n then B.loc_buffer (B.gsub b from (to `U32.sub` from))\n else B.loc_none))\n `B.loc_union`\n (if Ghost.reveal modifies_right\n then B.loc_buffer (B.gsub b to ((B.len b) `U32.sub` to))\n else B.loc_none))\n h\n h' /\\\n post res\n (B.as_seq h' (B.gsub b 0ul from))\n (B.as_seq h' (B.gsub b from (to `U32.sub` from)))\n (B.as_seq h' (B.gsub b to ((B.len b) `U32.sub` to)))\n h')) =", "completed_definiton": "with_buffer_hide b from to h0 lin lout (if Ghost.reveal modifies_left then 0ul else 1ul)\n (if Ghost.reveal modifies_left then from else 0ul)\n (if Ghost.reveal modifies_secret then 0ul else 1ul)\n (if Ghost.reveal modifies_secret then (to `U32.sub` from) else 0ul)\n (if Ghost.reveal modifies_right then 0ul else 1ul)\n (if Ghost.reveal modifies_right then ((B.len b) `U32.sub` to) else 0ul) post\n (fun l bl bs br ->\n B.gsub_zero_length bl;\n B.gsub_zero_length bs;\n B.gsub_zero_length br;\n f l bl bs br)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.fsti", "name": "QUIC.Impl.encrypt_pre", "original_source_type": "val encrypt_pre\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: header)\n (pn: PN.packet_number_t)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n : GTot Type0", "source_type": "val encrypt_pre\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: header)\n (pn: PN.packet_number_t)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n : GTot Type0", "source_definition": "let encrypt_pre\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: header)\n (pn: PN.packet_number_t)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32) // should be secret, because otherwise one can compute the packet number length\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n B.all_disjoint [\n AEAD.footprint m aead;\n B.loc_buffer siv;\n CTR.footprint m ctr;\n B.loc_buffer hpk;\n B.loc_buffer dst;\n header_footprint h;\n B.loc_buffer plain;\n ] /\\\n AEAD.invariant m aead /\\\n B.live m siv /\\ B.length siv == 12 /\\\n CTR.invariant m ctr /\\\n B.live m hpk /\\ B.length hpk == SCipher.key_length a' /\\\n B.live m dst /\\\n header_live h m /\\\n B.live m plain /\\ B.length plain == Secret.v plain_len /\\\n begin\n if is_retry h\n then\n B.length plain == 0 /\\\n B.length dst == Secret.v (header_len h)\n else\n B.length dst == Secret.v (header_len h) + Secret.v plain_len + SAEAD.tag_length a /\\\n 3 <= Secret.v plain_len /\\ Secret.v plain_len < max_plain_length\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 65, "start_col": 1, "end_line": 91, "end_col": 5 }, "file_context": "/// An implementation of QUIC.Spec.fst that is concerned only with functional\n/// correctness and side-channel resistance (no notion of model for now).\nmodule QUIC.Impl\ninclude QUIC.Impl.Crypto\ninclude QUIC.Impl.Header.Base\n\nmodule Spec = QUIC.Spec\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Secret = QUIC.Secret.Int\nmodule Seq = QUIC.Secret.Seq\nmodule Parse = QUIC.Spec.Header.Parse\n\n// This MUST be kept in sync with QUIC.Impl.fst...\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\n\nmodule SAEAD = Spec.Agile.AEAD\nmodule SCipher = Spec.Agile.Cipher\nmodule SHKDF = Spec.Agile.HKDF\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n#set-options \"--z3rlimit 16\"\n\n/// Low-level types used in this API\n/// --------------------------------\n\ntype u2 = n:U8.t{U8.v n < 4}\ntype u4 = n:U8.t{U8.v n < 16}\ntype u62 = n:UInt64.t{UInt64.v n < pow2 62}\n\nval dummy: unit\n\nunfold\nlet encrypt_pre\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: header)\n (pn: PN.packet_number_t)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32) // should be secret, because otherwise one can compute the packet number length\n (m: HS.mem)", "dependencies": { "source_file": "QUIC.Impl.fsti", "checked_file": "QUIC.Impl.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.Crypto.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "SParse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n aead: EverCrypt.AEAD.state a ->\n siv: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n ctr: NotEverCrypt.CTR.state (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n hpk: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n dst: LowStar.Buffer.buffer FStar.UInt8.t ->\n h: QUIC.Impl.Header.Base.header ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t ->\n plain: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n plain_len: Lib.IntTypes.uint32 ->\n m: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "EverCrypt.AEAD.state", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "NotEverCrypt.CTR.state", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "FStar.UInt8.t", "QUIC.Impl.Header.Base.header", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Lib.IntTypes.uint32", "FStar.Monotonic.HyperStack.mem", "Prims.l_and", "LowStar.Monotonic.Buffer.all_disjoint", "Prims.Cons", "LowStar.Monotonic.Buffer.loc", "EverCrypt.AEAD.footprint", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Buffer.trivial_preorder", "NotEverCrypt.CTR.footprint", "QUIC.Impl.Header.Base.header_footprint", "Prims.Nil", "EverCrypt.AEAD.invariant", "LowStar.Monotonic.Buffer.live", "Prims.eq2", "Prims.int", "LowStar.Monotonic.Buffer.length", "NotEverCrypt.CTR.invariant", "Prims.nat", "Spec.Agile.Cipher.key_length", "QUIC.Impl.Header.Base.header_live", "Prims.l_or", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "Lib.IntTypes.range", "Lib.IntTypes.U32", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.SEC", "QUIC.Impl.Header.Base.is_retry", "QUIC.Impl.Header.Base.header_len", "Prims.bool", "Prims.op_Addition", "Spec.Agile.AEAD.tag_length", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "QUIC.Spec.Crypto.max_plain_length", "Prims.logical", "Spec.Agile.Cipher.cipher_alg" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val encrypt_pre\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: header)\n (pn: PN.packet_number_t)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n : GTot Type0\nlet encrypt_pre\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: header)\n (pn: PN.packet_number_t)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n : GTot Type0 =", "completed_definiton": "let a' = SAEAD.cipher_alg_of_supported_alg a in\nB.all_disjoint [\n AEAD.footprint m aead;\n B.loc_buffer siv;\n CTR.footprint m ctr;\n B.loc_buffer hpk;\n B.loc_buffer dst;\n header_footprint h;\n B.loc_buffer plain\n ] /\\ AEAD.invariant m aead /\\ B.live m siv /\\ B.length siv == 12 /\\ CTR.invariant m ctr /\\\nB.live m hpk /\\ B.length hpk == SCipher.key_length a' /\\ B.live m dst /\\ header_live h m /\\\nB.live m plain /\\ B.length plain == Secret.v plain_len /\\\n(if is_retry h\n then B.length plain == 0 /\\ B.length dst == Secret.v (header_len h)\n else\n B.length dst == Secret.v (header_len h) + Secret.v plain_len + SAEAD.tag_length a /\\\n 3 <= Secret.v plain_len /\\ Secret.v plain_len < max_plain_length)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.fsti", "name": "QUIC.Impl.decrypt_pre", "original_source_type": "val decrypt_pre\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (dst_hdr: B.pointer result)\n (last_pn: PN.last_packet_number_t)\n (cid_len: short_dcid_len_t)\n (m: HS.mem)\n : GTot Type0", "source_type": "val decrypt_pre\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (dst_hdr: B.pointer result)\n (last_pn: PN.last_packet_number_t)\n (cid_len: short_dcid_len_t)\n (m: HS.mem)\n : GTot Type0", "source_definition": "let decrypt_pre\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (dst_hdr: B.pointer result)\n (last_pn: PN.last_packet_number_t)\n (cid_len: short_dcid_len_t)\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n B.all_disjoint [\n AEAD.footprint m aead;\n B.loc_buffer siv;\n CTR.footprint m ctr;\n B.loc_buffer hpk;\n B.loc_buffer dst;\n B.loc_buffer dst_hdr;\n ] /\\\n AEAD.invariant m aead /\\\n B.live m siv /\\ B.length siv == 12 /\\\n CTR.invariant m ctr /\\\n B.live m hpk /\\ B.length hpk == SCipher.key_length a' /\\\n B.live m dst /\\ B.length dst == U32.v dst_len /\\\n B.live m dst_hdr", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 152, "start_col": 1, "end_line": 167, "end_col": 18 }, "file_context": "/// An implementation of QUIC.Spec.fst that is concerned only with functional\n/// correctness and side-channel resistance (no notion of model for now).\nmodule QUIC.Impl\ninclude QUIC.Impl.Crypto\ninclude QUIC.Impl.Header.Base\n\nmodule Spec = QUIC.Spec\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Secret = QUIC.Secret.Int\nmodule Seq = QUIC.Secret.Seq\nmodule Parse = QUIC.Spec.Header.Parse\n\n// This MUST be kept in sync with QUIC.Impl.fst...\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\n\nmodule SAEAD = Spec.Agile.AEAD\nmodule SCipher = Spec.Agile.Cipher\nmodule SHKDF = Spec.Agile.HKDF\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n#set-options \"--z3rlimit 16\"\n\n/// Low-level types used in this API\n/// --------------------------------\n\ntype u2 = n:U8.t{U8.v n < 4}\ntype u4 = n:U8.t{U8.v n < 16}\ntype u62 = n:UInt64.t{UInt64.v n < pow2 62}\n\nval dummy: unit\n\nunfold\nlet encrypt_pre\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: header)\n (pn: PN.packet_number_t)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32) // should be secret, because otherwise one can compute the packet number length\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n B.all_disjoint [\n AEAD.footprint m aead;\n B.loc_buffer siv;\n CTR.footprint m ctr;\n B.loc_buffer hpk;\n B.loc_buffer dst;\n header_footprint h;\n B.loc_buffer plain;\n ] /\\\n AEAD.invariant m aead /\\\n B.live m siv /\\ B.length siv == 12 /\\\n CTR.invariant m ctr /\\\n B.live m hpk /\\ B.length hpk == SCipher.key_length a' /\\\n B.live m dst /\\\n header_live h m /\\\n B.live m plain /\\ B.length plain == Secret.v plain_len /\\\n begin\n if is_retry h\n then\n B.length plain == 0 /\\\n B.length dst == Secret.v (header_len h)\n else\n B.length dst == Secret.v (header_len h) + Secret.v plain_len + SAEAD.tag_length a /\\\n 3 <= Secret.v plain_len /\\ Secret.v plain_len < max_plain_length\n end\n\nunfold\nlet encrypt_post\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: header)\n (pn: PN.packet_number_t)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m' : HS.mem)\n: GTot Type0\n=\n encrypt_pre a aead siv ctr hpk dst h pn plain plain_len m /\\\n B.modifies (B.loc_buffer dst `B.loc_union` AEAD.footprint m aead `B.loc_union` CTR.footprint m ctr) m m' /\\\n AEAD.invariant m' aead /\\ AEAD.footprint m' aead == AEAD.footprint m aead /\\\n AEAD.preserves_freeable aead m m' /\\\n AEAD.as_kv (B.deref m' aead) == AEAD.as_kv (B.deref m aead) /\\\n CTR.invariant m' ctr /\\ CTR.footprint m' ctr == CTR.footprint m ctr /\\\n B.as_seq m' dst `Seq.equal` Spec.encrypt a (AEAD.as_kv (B.deref m aead)) (B.as_seq m siv) (B.as_seq m hpk) (g_header h m pn) (Seq.seq_reveal (B.as_seq m plain)) /\\\n res == Success\n\nval encrypt\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: header)\n (pn: PN.packet_number_t)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n: HST.Stack error_code\n (requires (fun m ->\n encrypt_pre a aead siv ctr hpk dst h pn plain plain_len m\n ))\n (ensures (fun m res m' ->\n encrypt_post a aead siv ctr hpk dst h pn plain plain_len m res m'\n ))\n\nunfold\nlet decrypt_pre\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (dst_hdr: B.pointer result)\n (last_pn: PN.last_packet_number_t)\n (cid_len: short_dcid_len_t)\n (m: HS.mem)", "dependencies": { "source_file": "QUIC.Impl.fsti", "checked_file": "QUIC.Impl.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.Crypto.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "SParse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n aead: EverCrypt.AEAD.state a ->\n siv: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n ctr: NotEverCrypt.CTR.state (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n hpk: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n dst: LowStar.Buffer.buffer FStar.UInt8.t ->\n dst_len: FStar.UInt32.t ->\n dst_hdr: LowStar.Buffer.pointer QUIC.Impl.Header.Base.result ->\n last_pn: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n cid_len: QUIC.Spec.Base.short_dcid_len_t ->\n m: FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "EverCrypt.AEAD.state", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "NotEverCrypt.CTR.state", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "FStar.UInt8.t", "FStar.UInt32.t", "LowStar.Buffer.pointer", "QUIC.Impl.Header.Base.result", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Base.short_dcid_len_t", "FStar.Monotonic.HyperStack.mem", "Prims.l_and", "LowStar.Monotonic.Buffer.all_disjoint", "Prims.Cons", "LowStar.Monotonic.Buffer.loc", "EverCrypt.AEAD.footprint", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Buffer.trivial_preorder", "NotEverCrypt.CTR.footprint", "Prims.Nil", "EverCrypt.AEAD.invariant", "LowStar.Monotonic.Buffer.live", "Prims.eq2", "Prims.int", "LowStar.Monotonic.Buffer.length", "NotEverCrypt.CTR.invariant", "Prims.nat", "Spec.Agile.Cipher.key_length", "Prims.l_or", "FStar.UInt.size", "FStar.UInt32.n", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "FStar.UInt32.v", "Spec.Agile.Cipher.cipher_alg" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val decrypt_pre\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (dst_hdr: B.pointer result)\n (last_pn: PN.last_packet_number_t)\n (cid_len: short_dcid_len_t)\n (m: HS.mem)\n : GTot Type0\nlet decrypt_pre\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (dst_hdr: B.pointer result)\n (last_pn: PN.last_packet_number_t)\n (cid_len: short_dcid_len_t)\n (m: HS.mem)\n : GTot Type0 =", "completed_definiton": "let a' = SAEAD.cipher_alg_of_supported_alg a in\nB.all_disjoint [\n AEAD.footprint m aead;\n B.loc_buffer siv;\n CTR.footprint m ctr;\n B.loc_buffer hpk;\n B.loc_buffer dst;\n B.loc_buffer dst_hdr\n ] /\\ AEAD.invariant m aead /\\ B.live m siv /\\ B.length siv == 12 /\\ CTR.invariant m ctr /\\\nB.live m hpk /\\ B.length hpk == SCipher.key_length a' /\\ B.live m dst /\\\nB.length dst == U32.v dst_len /\\ B.live m dst_hdr", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.fsti", "name": "QUIC.Impl.decrypt_post", "original_source_type": "val decrypt_post\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (dst_hdr: B.pointer result)\n (last_pn: PN.last_packet_number_t)\n (cid_len: short_dcid_len_t)\n (m: HS.mem)\n (res: error_code)\n (m': HS.mem)\n : GTot Type0", "source_type": "val decrypt_post\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (dst_hdr: B.pointer result)\n (last_pn: PN.last_packet_number_t)\n (cid_len: short_dcid_len_t)\n (m: HS.mem)\n (res: error_code)\n (m': HS.mem)\n : GTot Type0", "source_definition": "let decrypt_post\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (dst_hdr: B.pointer result)\n (last_pn: PN.last_packet_number_t)\n (cid_len: short_dcid_len_t)\n (m: HS.mem)\n (res: error_code)\n (m' : HS.mem)\n: GTot Type0\n=\n decrypt_pre a aead siv ctr hpk dst dst_len dst_hdr last_pn cid_len m /\\\n AEAD.invariant m' aead /\\ AEAD.footprint m' aead == AEAD.footprint m aead /\\\n AEAD.preserves_freeable aead m m' /\\\n AEAD.as_kv (B.deref m' aead) == AEAD.as_kv (B.deref m aead) /\\\n CTR.invariant m' ctr /\\ CTR.footprint m' ctr == CTR.footprint m ctr /\\\n begin match res, Spec.decrypt a (AEAD.as_kv (B.deref m aead)) (B.as_seq m siv) (B.as_seq m hpk) (Secret.v last_pn) (U32.v cid_len) (B.as_seq m dst) with\n | AuthenticationFailure, Spec.Failure ->\n let r = B.deref m' dst_hdr in\n Secret.v r.total_len <= B.length dst /\\\n B.modifies (AEAD.footprint m aead `B.loc_union` CTR.footprint m ctr `B.loc_union` B.loc_buffer dst_hdr `B.loc_union` B.loc_buffer (B.gsub dst 0ul (Secret.reveal r.total_len))) m m'\n | DecodeError, Spec.Failure ->\n B.modifies B.loc_none m m'\n | Success, Spec.Success gh plain rem ->\n let r = B.deref m' dst_hdr in\n let h = r.header in\n header_live h m' /\\\n gh == g_header h m' r.pn /\\\n r.header_len == header_len h /\\\n Secret.v r.plain_len == Seq.length plain /\\\n Secret.v r.header_len + Secret.v r.plain_len <= Secret.v r.total_len /\\\n Secret.v r.total_len <= B.length dst /\\\n B.loc_buffer (B.gsub dst 0ul (public_header_len h)) `B.loc_includes` header_footprint h /\\\n (\n B.modifies (AEAD.footprint m aead `B.loc_union` CTR.footprint m ctr `B.loc_union` B.loc_buffer dst_hdr `B.loc_union` B.loc_buffer (B.gsub dst 0ul (Secret.reveal r.total_len))) m m' /\\\n B.as_seq m' (B.gsub dst 0ul (Secret.reveal r.header_len)) `Seq.equal` Parse.format_header (g_header h m' r.pn) /\\\n B.as_seq m' (B.gsub dst (Secret.reveal r.header_len) (Secret.reveal r.plain_len)) `Seq.equal` plain /\\\n B.as_seq m' (B.gsub dst (Secret.reveal r.total_len) (B.len dst `U32.sub` Secret.reveal r.total_len)) `Seq.equal` rem\n )\n | _ -> False\n end", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 186, "start_col": 2, "end_line": 215, "end_col": 5 }, "file_context": "/// An implementation of QUIC.Spec.fst that is concerned only with functional\n/// correctness and side-channel resistance (no notion of model for now).\nmodule QUIC.Impl\ninclude QUIC.Impl.Crypto\ninclude QUIC.Impl.Header.Base\n\nmodule Spec = QUIC.Spec\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Secret = QUIC.Secret.Int\nmodule Seq = QUIC.Secret.Seq\nmodule Parse = QUIC.Spec.Header.Parse\n\n// This MUST be kept in sync with QUIC.Impl.fst...\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\n\nmodule SAEAD = Spec.Agile.AEAD\nmodule SCipher = Spec.Agile.Cipher\nmodule SHKDF = Spec.Agile.HKDF\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n#set-options \"--z3rlimit 16\"\n\n/// Low-level types used in this API\n/// --------------------------------\n\ntype u2 = n:U8.t{U8.v n < 4}\ntype u4 = n:U8.t{U8.v n < 16}\ntype u62 = n:UInt64.t{UInt64.v n < pow2 62}\n\nval dummy: unit\n\nunfold\nlet encrypt_pre\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: header)\n (pn: PN.packet_number_t)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32) // should be secret, because otherwise one can compute the packet number length\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n B.all_disjoint [\n AEAD.footprint m aead;\n B.loc_buffer siv;\n CTR.footprint m ctr;\n B.loc_buffer hpk;\n B.loc_buffer dst;\n header_footprint h;\n B.loc_buffer plain;\n ] /\\\n AEAD.invariant m aead /\\\n B.live m siv /\\ B.length siv == 12 /\\\n CTR.invariant m ctr /\\\n B.live m hpk /\\ B.length hpk == SCipher.key_length a' /\\\n B.live m dst /\\\n header_live h m /\\\n B.live m plain /\\ B.length plain == Secret.v plain_len /\\\n begin\n if is_retry h\n then\n B.length plain == 0 /\\\n B.length dst == Secret.v (header_len h)\n else\n B.length dst == Secret.v (header_len h) + Secret.v plain_len + SAEAD.tag_length a /\\\n 3 <= Secret.v plain_len /\\ Secret.v plain_len < max_plain_length\n end\n\nunfold\nlet encrypt_post\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: header)\n (pn: PN.packet_number_t)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m' : HS.mem)\n: GTot Type0\n=\n encrypt_pre a aead siv ctr hpk dst h pn plain plain_len m /\\\n B.modifies (B.loc_buffer dst `B.loc_union` AEAD.footprint m aead `B.loc_union` CTR.footprint m ctr) m m' /\\\n AEAD.invariant m' aead /\\ AEAD.footprint m' aead == AEAD.footprint m aead /\\\n AEAD.preserves_freeable aead m m' /\\\n AEAD.as_kv (B.deref m' aead) == AEAD.as_kv (B.deref m aead) /\\\n CTR.invariant m' ctr /\\ CTR.footprint m' ctr == CTR.footprint m ctr /\\\n B.as_seq m' dst `Seq.equal` Spec.encrypt a (AEAD.as_kv (B.deref m aead)) (B.as_seq m siv) (B.as_seq m hpk) (g_header h m pn) (Seq.seq_reveal (B.as_seq m plain)) /\\\n res == Success\n\nval encrypt\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: header)\n (pn: PN.packet_number_t)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n: HST.Stack error_code\n (requires (fun m ->\n encrypt_pre a aead siv ctr hpk dst h pn plain plain_len m\n ))\n (ensures (fun m res m' ->\n encrypt_post a aead siv ctr hpk dst h pn plain plain_len m res m'\n ))\n\nunfold\nlet decrypt_pre\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (dst_hdr: B.pointer result)\n (last_pn: PN.last_packet_number_t)\n (cid_len: short_dcid_len_t)\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n B.all_disjoint [\n AEAD.footprint m aead;\n B.loc_buffer siv;\n CTR.footprint m ctr;\n B.loc_buffer hpk;\n B.loc_buffer dst;\n B.loc_buffer dst_hdr;\n ] /\\\n AEAD.invariant m aead /\\\n B.live m siv /\\ B.length siv == 12 /\\\n CTR.invariant m ctr /\\\n B.live m hpk /\\ B.length hpk == SCipher.key_length a' /\\\n B.live m dst /\\ B.length dst == U32.v dst_len /\\\n B.live m dst_hdr\n\nunfold\nlet decrypt_post\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (dst_hdr: B.pointer result)\n (last_pn: PN.last_packet_number_t)\n (cid_len: short_dcid_len_t)\n (m: HS.mem)\n (res: error_code)\n (m' : HS.mem)\n: GTot Type0", "dependencies": { "source_file": "QUIC.Impl.fsti", "checked_file": "QUIC.Impl.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.Crypto.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "SParse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n aead: EverCrypt.AEAD.state a ->\n siv: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n ctr: NotEverCrypt.CTR.state (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n hpk: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n dst: LowStar.Buffer.buffer FStar.UInt8.t ->\n dst_len: FStar.UInt32.t ->\n dst_hdr: LowStar.Buffer.pointer QUIC.Impl.Header.Base.result ->\n last_pn: QUIC.Spec.PacketNumber.Base.last_packet_number_t ->\n cid_len: QUIC.Spec.Base.short_dcid_len_t ->\n m: FStar.Monotonic.HyperStack.mem ->\n res: EverCrypt.Error.error_code ->\n m': FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "EverCrypt.AEAD.state", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "NotEverCrypt.CTR.state", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "FStar.UInt8.t", "FStar.UInt32.t", "LowStar.Buffer.pointer", "QUIC.Impl.Header.Base.result", "QUIC.Spec.PacketNumber.Base.last_packet_number_t", "QUIC.Spec.Base.short_dcid_len_t", "FStar.Monotonic.HyperStack.mem", "EverCrypt.Error.error_code", "Prims.l_and", "QUIC.Impl.decrypt_pre", "EverCrypt.AEAD.invariant", "Prims.eq2", "LowStar.Monotonic.Buffer.loc", "EverCrypt.AEAD.footprint", "EverCrypt.AEAD.preserves_freeable", "Spec.Agile.AEAD.kv", "EverCrypt.AEAD.as_kv", "LowStar.Monotonic.Buffer.deref", "EverCrypt.AEAD.state_s", "LowStar.Buffer.trivial_preorder", "NotEverCrypt.CTR.invariant", "NotEverCrypt.CTR.footprint", "FStar.Pervasives.Native.Mktuple2", "QUIC.Spec.result", "QUIC.Spec.decrypt", "LowStar.Monotonic.Buffer.as_seq", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "FStar.UInt32.v", "Prims.b2t", "Prims.op_LessThanOrEqual", "Lib.IntTypes.U32", "QUIC.Impl.Header.Base.__proj__Mkresult__item__total_len", "LowStar.Monotonic.Buffer.length", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Buffer.gsub", "FStar.UInt32.__uint_to_t", "QUIC.Secret.Int.reveal", "LowStar.Monotonic.Buffer.loc_none", "QUIC.Spec.Header.Base.header", "QUIC.Spec.Base.bytes", "QUIC.Impl.Header.Base.header_live", "QUIC.Impl.Header.Base.g_header", "QUIC.Impl.Header.Base.__proj__Mkresult__item__pn", "Lib.IntTypes.uint32", "QUIC.Impl.Header.Base.__proj__Mkresult__item__header_len", "QUIC.Impl.Header.Base.header_len", "Prims.int", "Prims.l_or", "Prims.op_GreaterThanOrEqual", "Lib.IntTypes.range", "QUIC.Impl.Header.Base.__proj__Mkresult__item__plain_len", "FStar.Seq.Base.length", "QUIC.Spec.Base.byte", "Prims.op_Addition", "LowStar.Monotonic.Buffer.loc_includes", "QUIC.Impl.Header.Base.public_header_len", "QUIC.Impl.Header.Base.header_footprint", "FStar.Seq.Base.equal", "QUIC.Spec.Header.Parse.format_header", "FStar.UInt32.sub", "LowStar.Monotonic.Buffer.len", "QUIC.Impl.Header.Base.header", "QUIC.Impl.Header.Base.__proj__Mkresult__item__header", "FStar.Pervasives.Native.tuple2", "Prims.l_False", "Prims.logical" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val decrypt_post\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (dst_hdr: B.pointer result)\n (last_pn: PN.last_packet_number_t)\n (cid_len: short_dcid_len_t)\n (m: HS.mem)\n (res: error_code)\n (m': HS.mem)\n : GTot Type0\nlet decrypt_post\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (dst_len: U32.t)\n (dst_hdr: B.pointer result)\n (last_pn: PN.last_packet_number_t)\n (cid_len: short_dcid_len_t)\n (m: HS.mem)\n (res: error_code)\n (m': HS.mem)\n : GTot Type0 =", "completed_definiton": "decrypt_pre a aead siv ctr hpk dst dst_len dst_hdr last_pn cid_len m /\\ AEAD.invariant m' aead /\\\nAEAD.footprint m' aead == AEAD.footprint m aead /\\ AEAD.preserves_freeable aead m m' /\\\nAEAD.as_kv (B.deref m' aead) == AEAD.as_kv (B.deref m aead) /\\ CTR.invariant m' ctr /\\\nCTR.footprint m' ctr == CTR.footprint m ctr /\\\n(match\n res,\n Spec.decrypt a\n (AEAD.as_kv (B.deref m aead))\n (B.as_seq m siv)\n (B.as_seq m hpk)\n (Secret.v last_pn)\n (U32.v cid_len)\n (B.as_seq m dst)\n with\n | AuthenticationFailure, Spec.Failure ->\n let r = B.deref m' dst_hdr in\n Secret.v r.total_len <= B.length dst /\\\n B.modifies ((((AEAD.footprint m aead) `B.loc_union` (CTR.footprint m ctr))\n `B.loc_union`\n (B.loc_buffer dst_hdr))\n `B.loc_union`\n (B.loc_buffer (B.gsub dst 0ul (Secret.reveal r.total_len))))\n m\n m'\n | DecodeError, Spec.Failure -> B.modifies B.loc_none m m'\n | Success, Spec.Success gh plain rem ->\n let r = B.deref m' dst_hdr in\n let h = r.header in\n header_live h m' /\\ gh == g_header h m' r.pn /\\ r.header_len == header_len h /\\\n Secret.v r.plain_len == Seq.length plain /\\\n Secret.v r.header_len + Secret.v r.plain_len <= Secret.v r.total_len /\\\n Secret.v r.total_len <= B.length dst /\\\n (B.loc_buffer (B.gsub dst 0ul (public_header_len h))) `B.loc_includes` (header_footprint h) /\\\n (B.modifies ((((AEAD.footprint m aead) `B.loc_union` (CTR.footprint m ctr))\n `B.loc_union`\n (B.loc_buffer dst_hdr))\n `B.loc_union`\n (B.loc_buffer (B.gsub dst 0ul (Secret.reveal r.total_len))))\n m\n m' /\\\n (B.as_seq m' (B.gsub dst 0ul (Secret.reveal r.header_len)))\n `Seq.equal`\n (Parse.format_header (g_header h m' r.pn)) /\\\n (B.as_seq m' (B.gsub dst (Secret.reveal r.header_len) (Secret.reveal r.plain_len)))\n `Seq.equal`\n plain /\\\n (B.as_seq m'\n (B.gsub dst\n (Secret.reveal r.total_len)\n ((B.len dst) `U32.sub` (Secret.reveal r.total_len))))\n `Seq.equal`\n rem)\n | _ -> False)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.fsti", "name": "QUIC.Impl.encrypt_post", "original_source_type": "val encrypt_post\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: header)\n (pn: PN.packet_number_t)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m': HS.mem)\n : GTot Type0", "source_type": "val encrypt_post\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: header)\n (pn: PN.packet_number_t)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m': HS.mem)\n : GTot Type0", "source_definition": "let encrypt_post\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: header)\n (pn: PN.packet_number_t)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m' : HS.mem)\n: GTot Type0\n=\n encrypt_pre a aead siv ctr hpk dst h pn plain plain_len m /\\\n B.modifies (B.loc_buffer dst `B.loc_union` AEAD.footprint m aead `B.loc_union` CTR.footprint m ctr) m m' /\\\n AEAD.invariant m' aead /\\ AEAD.footprint m' aead == AEAD.footprint m aead /\\\n AEAD.preserves_freeable aead m m' /\\\n AEAD.as_kv (B.deref m' aead) == AEAD.as_kv (B.deref m aead) /\\\n CTR.invariant m' ctr /\\ CTR.footprint m' ctr == CTR.footprint m ctr /\\\n B.as_seq m' dst `Seq.equal` Spec.encrypt a (AEAD.as_kv (B.deref m aead)) (B.as_seq m siv) (B.as_seq m hpk) (g_header h m pn) (Seq.seq_reveal (B.as_seq m plain)) /\\\n res == Success", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.fsti", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 110, "start_col": 2, "end_line": 117, "end_col": 16 }, "file_context": "/// An implementation of QUIC.Spec.fst that is concerned only with functional\n/// correctness and side-channel resistance (no notion of model for now).\nmodule QUIC.Impl\ninclude QUIC.Impl.Crypto\ninclude QUIC.Impl.Header.Base\n\nmodule Spec = QUIC.Spec\nmodule PN = QUIC.Spec.PacketNumber.Base\nmodule Secret = QUIC.Secret.Int\nmodule Seq = QUIC.Secret.Seq\nmodule Parse = QUIC.Spec.Header.Parse\n\n// This MUST be kept in sync with QUIC.Impl.fst...\nmodule G = FStar.Ghost\nmodule B = LowStar.Buffer\nmodule S = FStar.Seq\nmodule HS = FStar.HyperStack\nmodule HST = FStar.HyperStack.ST\n\n\nmodule Cipher = EverCrypt.Cipher\nmodule AEAD = EverCrypt.AEAD\nmodule HKDF = EverCrypt.HKDF\nmodule CTR = EverCrypt.CTR\n\nmodule SAEAD = Spec.Agile.AEAD\nmodule SCipher = Spec.Agile.Cipher\nmodule SHKDF = Spec.Agile.HKDF\n\nmodule U64 = FStar.UInt64\nmodule U32 = FStar.UInt32\nmodule U8 = FStar.UInt8\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\n\nopen EverCrypt.Helpers\nopen EverCrypt.Error\n\n#set-options \"--z3rlimit 16\"\n\n/// Low-level types used in this API\n/// --------------------------------\n\ntype u2 = n:U8.t{U8.v n < 4}\ntype u4 = n:U8.t{U8.v n < 16}\ntype u62 = n:UInt64.t{UInt64.v n < pow2 62}\n\nval dummy: unit\n\nunfold\nlet encrypt_pre\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: header)\n (pn: PN.packet_number_t)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32) // should be secret, because otherwise one can compute the packet number length\n (m: HS.mem)\n: GTot Type0\n=\n let a' = SAEAD.cipher_alg_of_supported_alg a in\n B.all_disjoint [\n AEAD.footprint m aead;\n B.loc_buffer siv;\n CTR.footprint m ctr;\n B.loc_buffer hpk;\n B.loc_buffer dst;\n header_footprint h;\n B.loc_buffer plain;\n ] /\\\n AEAD.invariant m aead /\\\n B.live m siv /\\ B.length siv == 12 /\\\n CTR.invariant m ctr /\\\n B.live m hpk /\\ B.length hpk == SCipher.key_length a' /\\\n B.live m dst /\\\n header_live h m /\\\n B.live m plain /\\ B.length plain == Secret.v plain_len /\\\n begin\n if is_retry h\n then\n B.length plain == 0 /\\\n B.length dst == Secret.v (header_len h)\n else\n B.length dst == Secret.v (header_len h) + Secret.v plain_len + SAEAD.tag_length a /\\\n 3 <= Secret.v plain_len /\\ Secret.v plain_len < max_plain_length\n end\n\nunfold\nlet encrypt_post\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: header)\n (pn: PN.packet_number_t)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m' : HS.mem)\n: GTot Type0", "dependencies": { "source_file": "QUIC.Impl.fsti", "checked_file": "QUIC.Impl.fsti.checked", "interface_file": false, "dependencies": [ "Spec.Agile.HKDF.fsti.checked", "Spec.Agile.Cipher.fsti.checked", "Spec.Agile.AEAD.fsti.checked", "QUIC.Spec.PacketNumber.Base.fst.checked", "QUIC.Spec.Header.Parse.fsti.checked", "QUIC.Spec.fsti.checked", "QUIC.Secret.Seq.fsti.checked", "QUIC.Secret.Int.fsti.checked", "QUIC.Impl.Header.Base.fst.checked", "QUIC.Impl.Crypto.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "FStar.HyperStack.fst.checked", "FStar.Ghost.fsti.checked", "EverCrypt.HKDF.fsti.checked", "EverCrypt.Helpers.fsti.checked", "EverCrypt.Error.fsti.checked", "EverCrypt.CTR.fsti.checked", "EverCrypt.Cipher.fsti.checked", "EverCrypt.AEAD.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "SParse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "ADMITDeclassify", "full_module": "Lib.RawIntTypes" }, { "abbrev": true, "short_module": "SecretBuffer", "full_module": "QUIC.Secret.Buffer" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": false, "short_module": null, "full_module": "LowStar.BufferOps" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Lemmas" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "ST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "IB", "full_module": "LowStar.ImmutableBuffer" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Error" }, { "abbrev": false, "short_module": null, "full_module": "EverCrypt.Helpers" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack.ST" }, { "abbrev": false, "short_module": null, "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "SHKDF", "full_module": "Spec.Agile.HKDF" }, { "abbrev": true, "short_module": "SCipher", "full_module": "Spec.Agile.Cipher" }, { "abbrev": true, "short_module": "SAEAD", "full_module": "Spec.Agile.AEAD" }, { "abbrev": true, "short_module": "CTR", "full_module": "EverCrypt.CTR" }, { "abbrev": true, "short_module": "HKDF", "full_module": "EverCrypt.HKDF" }, { "abbrev": true, "short_module": "AEAD", "full_module": "EverCrypt.AEAD" }, { "abbrev": true, "short_module": "Cipher", "full_module": "EverCrypt.Cipher" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "HS", "full_module": "FStar.HyperStack" }, { "abbrev": true, "short_module": "S", "full_module": "FStar.Seq" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": true, "short_module": "Parse", "full_module": "QUIC.Spec.Header.Parse" }, { "abbrev": true, "short_module": "Seq", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "PN", "full_module": "QUIC.Spec.PacketNumber.Base" }, { "abbrev": true, "short_module": "Spec", "full_module": "QUIC.Spec" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Header.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl.Crypto" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "QUIC" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n a: QUIC.Spec.Crypto.ea ->\n aead: EverCrypt.AEAD.state a ->\n siv: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n ctr: NotEverCrypt.CTR.state (Spec.Agile.AEAD.cipher_alg_of_supported_alg a) ->\n hpk: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n dst: LowStar.Buffer.buffer FStar.UInt8.t ->\n h: QUIC.Impl.Header.Base.header ->\n pn: QUIC.Spec.PacketNumber.Base.packet_number_t ->\n plain: LowStar.Buffer.buffer Lib.IntTypes.uint8 ->\n plain_len: Lib.IntTypes.uint32 ->\n m: FStar.Monotonic.HyperStack.mem ->\n res: EverCrypt.Error.error_code ->\n m': FStar.Monotonic.HyperStack.mem\n -> Prims.GTot Type0", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ea", "EverCrypt.AEAD.state", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "NotEverCrypt.CTR.state", "Spec.Agile.AEAD.cipher_alg_of_supported_alg", "FStar.UInt8.t", "QUIC.Impl.Header.Base.header", "QUIC.Spec.PacketNumber.Base.packet_number_t", "Lib.IntTypes.uint32", "FStar.Monotonic.HyperStack.mem", "EverCrypt.Error.error_code", "Prims.l_and", "QUIC.Impl.encrypt_pre", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_union", "LowStar.Monotonic.Buffer.loc_buffer", "LowStar.Buffer.trivial_preorder", "EverCrypt.AEAD.footprint", "NotEverCrypt.CTR.footprint", "EverCrypt.AEAD.invariant", "Prims.eq2", "LowStar.Monotonic.Buffer.loc", "EverCrypt.AEAD.preserves_freeable", "Spec.Agile.AEAD.kv", "EverCrypt.AEAD.as_kv", "LowStar.Monotonic.Buffer.deref", "EverCrypt.AEAD.state_s", "NotEverCrypt.CTR.invariant", "FStar.Seq.Base.equal", "LowStar.Monotonic.Buffer.as_seq", "QUIC.Spec.encrypt", "QUIC.Impl.Header.Base.g_header", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.U8", "Lib.IntTypes.SEC", "EverCrypt.Error.Success" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val encrypt_post\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: header)\n (pn: PN.packet_number_t)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m': HS.mem)\n : GTot Type0\nlet encrypt_post\n (a: ea)\n (aead: AEAD.state a)\n (siv: B.buffer Secret.uint8)\n (ctr: CTR.state (SAEAD.cipher_alg_of_supported_alg a))\n (hpk: B.buffer Secret.uint8)\n (dst: B.buffer U8.t)\n (h: header)\n (pn: PN.packet_number_t)\n (plain: B.buffer Secret.uint8)\n (plain_len: Secret.uint32)\n (m: HS.mem)\n (res: error_code)\n (m': HS.mem)\n : GTot Type0 =", "completed_definiton": "encrypt_pre a aead siv ctr hpk dst h pn plain plain_len m /\\\nB.modifies (((B.loc_buffer dst) `B.loc_union` (AEAD.footprint m aead))\n `B.loc_union`\n (CTR.footprint m ctr))\n m\n m' /\\ AEAD.invariant m' aead /\\ AEAD.footprint m' aead == AEAD.footprint m aead /\\\nAEAD.preserves_freeable aead m m' /\\ AEAD.as_kv (B.deref m' aead) == AEAD.as_kv (B.deref m aead) /\\\nCTR.invariant m' ctr /\\ CTR.footprint m' ctr == CTR.footprint m ctr /\\\n(B.as_seq m' dst)\n`Seq.equal`\n(Spec.encrypt a\n (AEAD.as_kv (B.deref m aead))\n (B.as_seq m siv)\n (B.as_seq m hpk)\n (g_header h m pn)\n (Seq.seq_reveal (B.as_seq m plain))) /\\ res == Success", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fst", "name": "QUIC.Secret.Int.reveal", "original_source_type": "val reveal\n (#t: inttype { unsigned t })\n (#sec: secrecy_level)\n (x: uint_t t sec)\n: GTot (y: uint_t t PUB { v y == v x })", "source_type": "val reveal\n (#t: inttype { unsigned t })\n (#sec: secrecy_level)\n (x: uint_t t sec)\n: GTot (y: uint_t t PUB { v y == v x })", "source_definition": "let reveal\n #t #sec x\n= mk_int #t (v x)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 22, "start_col": 2, "end_line": 22, "end_col": 17 }, "file_context": "module QUIC.Secret.Int\nmodule Aux = QUIC.Secret.Int.Aux\n\nlet usub\n #t #sec x y\n= x `sub` y\n\nlet cast_up\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet cast_down\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet hide\n #t #sec x\n= cast t SEC x\n\nlet reveal", "dependencies": { "source_file": "QUIC.Secret.Int.fst", "checked_file": "QUIC.Secret.Int.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.Aux.fst.checked", "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Lib.IntTypes.uint_t t sec\n -> Prims.GTot\n (y:\n Lib.IntTypes.uint_t t Lib.IntTypes.PUB {QUIC.Secret.Int.Base.v y == QUIC.Secret.Int.Base.v x})", "effect": "Prims.GTot", "effect_flags": [ "sometrivial" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "Lib.IntTypes.unsigned", "Lib.IntTypes.secrecy_level", "Lib.IntTypes.uint_t", "Lib.IntTypes.mk_int", "Lib.IntTypes.PUB", "QUIC.Secret.Int.Base.v", "Prims.eq2", "Lib.IntTypes.range_t" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val reveal\n (#t: inttype { unsigned t })\n (#sec: secrecy_level)\n (x: uint_t t sec)\n: GTot (y: uint_t t PUB { v y == v x })\nlet reveal #t #sec x =", "completed_definiton": "mk_int #t (v x)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fst", "name": "QUIC.Secret.Int.secret_bool", "original_source_type": "val secret_bool\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: bool)\n: Tot (z: int_t t sec { v z == (if x then 1 else 0) })", "source_type": "val secret_bool\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: bool)\n: Tot (z: int_t t sec { v z == (if x then 1 else 0) })", "source_definition": "let secret_bool = Aux.secret_bool", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 36, "start_col": 18, "end_line": 36, "end_col": 33 }, "file_context": "module QUIC.Secret.Int\nmodule Aux = QUIC.Secret.Int.Aux\n\nlet usub\n #t #sec x y\n= x `sub` y\n\nlet cast_up\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet cast_down\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet hide\n #t #sec x\n= cast t SEC x\n\nlet reveal\n #t #sec x\n= mk_int #t (v x)\n\n\nlet lognot'\n #t #l x\n= U.nth_lemma #(bits t) (U.lognot (v x)) (v x `U.logxor` v (ones t l));\n x `logxor` ones t l\n\nlet logand_one_bit = Aux.logand_one_bit\n\nlet logor_one_bit = Aux.logor_one_bit\n\nlet logxor_one_bit = Aux.logxor_one_bit", "dependencies": { "source_file": "QUIC.Secret.Int.fst", "checked_file": "QUIC.Secret.Int.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.Aux.fst.checked", "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Prims.bool\n -> z:\n Lib.IntTypes.int_t t sec\n { QUIC.Secret.Int.Base.v z ==\n (match x with\n | true -> 1\n | _ -> 0) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Secret.Int.Aux.secret_bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val secret_bool\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: bool)\n: Tot (z: int_t t sec { v z == (if x then 1 else 0) })\nlet secret_bool =", "completed_definiton": "Aux.secret_bool", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fst", "name": "QUIC.Secret.Int.lognot_one_bit", "original_source_type": "val lognot_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 then 0 else 1) })", "source_type": "val lognot_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 then 0 else 1) })", "source_definition": "let lognot_one_bit = Aux.lognot_one_bit", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 38, "start_col": 21, "end_line": 38, "end_col": 39 }, "file_context": "module QUIC.Secret.Int\nmodule Aux = QUIC.Secret.Int.Aux\n\nlet usub\n #t #sec x y\n= x `sub` y\n\nlet cast_up\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet cast_down\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet hide\n #t #sec x\n= cast t SEC x\n\nlet reveal\n #t #sec x\n= mk_int #t (v x)\n\n\nlet lognot'\n #t #l x\n= U.nth_lemma #(bits t) (U.lognot (v x)) (v x `U.logxor` v (ones t l));\n x `logxor` ones t l\n\nlet logand_one_bit = Aux.logand_one_bit\n\nlet logor_one_bit = Aux.logor_one_bit\n\nlet logxor_one_bit = Aux.logxor_one_bit\n\nlet secret_bool = Aux.secret_bool", "dependencies": { "source_file": "QUIC.Secret.Int.fst", "checked_file": "QUIC.Secret.Int.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.Aux.fst.checked", "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Lib.IntTypes.int_t t sec {QUIC.Secret.Int.Base.v x == 0 \\/ QUIC.Secret.Int.Base.v x == 1}\n -> z:\n Lib.IntTypes.int_t t sec\n { QUIC.Secret.Int.Base.v z ==\n (match QUIC.Secret.Int.Base.v x = 1 with\n | true -> 0\n | _ -> 1) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Secret.Int.Aux.lognot_one_bit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lognot_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 then 0 else 1) })\nlet lognot_one_bit =", "completed_definiton": "Aux.lognot_one_bit", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fst", "name": "QUIC.Secret.Int.logxor_one_bit", "original_source_type": "val logxor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = v y then 0 else 1) })", "source_type": "val logxor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = v y then 0 else 1) })", "source_definition": "let logxor_one_bit = Aux.logxor_one_bit", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 34, "start_col": 21, "end_line": 34, "end_col": 39 }, "file_context": "module QUIC.Secret.Int\nmodule Aux = QUIC.Secret.Int.Aux\n\nlet usub\n #t #sec x y\n= x `sub` y\n\nlet cast_up\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet cast_down\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet hide\n #t #sec x\n= cast t SEC x\n\nlet reveal\n #t #sec x\n= mk_int #t (v x)\n\n\nlet lognot'\n #t #l x\n= U.nth_lemma #(bits t) (U.lognot (v x)) (v x `U.logxor` v (ones t l));\n x `logxor` ones t l\n\nlet logand_one_bit = Aux.logand_one_bit\n\nlet logor_one_bit = Aux.logor_one_bit", "dependencies": { "source_file": "QUIC.Secret.Int.fst", "checked_file": "QUIC.Secret.Int.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.Aux.fst.checked", "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x: Lib.IntTypes.int_t t sec {QUIC.Secret.Int.Base.v x == 0 \\/ QUIC.Secret.Int.Base.v x == 1} ->\n y: Lib.IntTypes.int_t t sec {QUIC.Secret.Int.Base.v y == 0 \\/ QUIC.Secret.Int.Base.v y == 1}\n -> z:\n Lib.IntTypes.int_t t sec\n { QUIC.Secret.Int.Base.v z ==\n (match QUIC.Secret.Int.Base.v x = QUIC.Secret.Int.Base.v y with\n | true -> 0\n | _ -> 1) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Secret.Int.Aux.logxor_one_bit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val logxor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = v y then 0 else 1) })\nlet logxor_one_bit =", "completed_definiton": "Aux.logxor_one_bit", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fst", "name": "QUIC.Secret.Int.max64", "original_source_type": "val max64\n (x y: uint64)\n: Tot (z: uint64 { v z == (if v y <= v x then v x else v y) })", "source_type": "val max64\n (x y: uint64)\n: Tot (z: uint64 { v z == (if v y <= v x then v x else v y) })", "source_definition": "let max64 x y = Aux.max64 x y", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 109, "start_col": 16, "end_line": 109, "end_col": 29 }, "file_context": "module QUIC.Secret.Int\nmodule Aux = QUIC.Secret.Int.Aux\n\nlet usub\n #t #sec x y\n= x `sub` y\n\nlet cast_up\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet cast_down\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet hide\n #t #sec x\n= cast t SEC x\n\nlet reveal\n #t #sec x\n= mk_int #t (v x)\n\n\nlet lognot'\n #t #l x\n= U.nth_lemma #(bits t) (U.lognot (v x)) (v x `U.logxor` v (ones t l));\n x `logxor` ones t l\n\nlet logand_one_bit = Aux.logand_one_bit\n\nlet logor_one_bit = Aux.logor_one_bit\n\nlet logxor_one_bit = Aux.logxor_one_bit\n\nlet secret_bool = Aux.secret_bool\n\nlet lognot_one_bit = Aux.lognot_one_bit\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet get_bitfield\n #t #l x lo hi\n= BF.get_bitfield_eq_2 #(bits t) (v x) (U32.v lo) (U32.v hi);\n // due to https://github.com/FStarLang/karamel/issues/102 we need explicit intermediate operations here\n let op1 = x `shift_left` (U32.uint_to_t (bits t) `U32.sub` hi) in\n let op2 = op1 `shift_right` (U32.uint_to_t (bits t) `U32.sub` hi `U32.add` lo) in\n op2\n\n#restart-solver\n\nlet set_bitfield\n #t #l x lo hi w\n= BF.set_bitfield_eq #(bits t) (v x) (U32.v lo) (U32.v hi) (v w);\n U.lognot_lemma_1 #(bits t);\n // same as before\n let op0 = ones t l in\n let op1 = op0 `shift_right` (U32.uint_to_t (bits t) `U32.sub` (hi `U32.sub` lo)) in\n let op2 = op1 `shift_left` lo in\n let op3 = lognot' op2 in\n let op4 = x `logand` op3 in\n let op5 = w `shift_left` lo in\n let op6 = op4 `logor` op5 in\n op6\n#pop-options\n\n(* Instances *)\n\nlet secrets_are_equal_32_2\n (x: uint32 { v x < pow2 2 })\n (y: uint32 { v y < pow2 2 })\n: Tot (z: uint32 {\n v z == (if v x = v y then 1 else 0)\n })\n= Aux.secrets_are_equal x y\n\nlet secret_is_le_64\n (x: uint64)\n (y: uint64)\n: Tot (z: uint64 { v z == (if v x <= v y then 1 else 0) })\n= lognot_one_bit (Aux.secret_is_lt y x)\n\nlet secret_is_lt_64\n (x: uint64)\n (y: uint64)\n: Tot (z: uint64 { v z == (if v x < v y then 1 else 0) })\n= Aux.secret_is_lt x y\n\nlet secrets_are_equal_64_2\n (x: uint64 { v x < pow2 2 })\n (y: uint64 { v y < pow2 2 })\n: Tot (z: uint64 {\n v z == (if v x = v y then 1 else 0)\n })\n= Aux.secrets_are_equal x y\n\nlet secrets_are_equal_62\n (x: uint64 { v x < pow2 62 })\n (y: uint64 { v y < pow2 62 })\n: Tot (z: uint64 {\n v z == (if v x = v y then 1 else 0)\n })\n= Aux.secrets_are_equal x y\n\nlet min64 x y = Aux.min64 x y", "dependencies": { "source_file": "QUIC.Secret.Int.fst", "checked_file": "QUIC.Secret.Int.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.Aux.fst.checked", "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Lib.IntTypes.uint64 -> y: Lib.IntTypes.uint64\n -> z:\n Lib.IntTypes.uint64\n { QUIC.Secret.Int.Base.v z ==\n (match QUIC.Secret.Int.Base.v y <= QUIC.Secret.Int.Base.v x with\n | true -> QUIC.Secret.Int.Base.v x\n | _ -> QUIC.Secret.Int.Base.v y) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.uint64", "QUIC.Secret.Int.Aux.max64", "Prims.eq2", "Lib.IntTypes.range_t", "Lib.IntTypes.U64", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.SEC", "Prims.op_LessThanOrEqual", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val max64\n (x y: uint64)\n: Tot (z: uint64 { v z == (if v y <= v x then v x else v y) })\nlet max64 x y =", "completed_definiton": "Aux.max64 x y", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fst", "name": "QUIC.Secret.Int.logand_one_bit", "original_source_type": "val logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })", "source_type": "val logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })", "source_definition": "let logand_one_bit = Aux.logand_one_bit", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 30, "start_col": 21, "end_line": 30, "end_col": 39 }, "file_context": "module QUIC.Secret.Int\nmodule Aux = QUIC.Secret.Int.Aux\n\nlet usub\n #t #sec x y\n= x `sub` y\n\nlet cast_up\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet cast_down\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet hide\n #t #sec x\n= cast t SEC x\n\nlet reveal\n #t #sec x\n= mk_int #t (v x)\n\n\nlet lognot'\n #t #l x\n= U.nth_lemma #(bits t) (U.lognot (v x)) (v x `U.logxor` v (ones t l));\n x `logxor` ones t l", "dependencies": { "source_file": "QUIC.Secret.Int.fst", "checked_file": "QUIC.Secret.Int.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.Aux.fst.checked", "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x: Lib.IntTypes.int_t t sec {QUIC.Secret.Int.Base.v x == 0 \\/ QUIC.Secret.Int.Base.v x == 1} ->\n y: Lib.IntTypes.int_t t sec {QUIC.Secret.Int.Base.v y == 0 \\/ QUIC.Secret.Int.Base.v y == 1}\n -> z:\n Lib.IntTypes.int_t t sec\n { QUIC.Secret.Int.Base.v z ==\n (match QUIC.Secret.Int.Base.v x = 1 && QUIC.Secret.Int.Base.v y = 1 with\n | true -> 1\n | _ -> 0) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Secret.Int.Aux.logand_one_bit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val logand_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 && v y = 1 then 1 else 0) })\nlet logand_one_bit =", "completed_definiton": "Aux.logand_one_bit", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fst", "name": "QUIC.Secret.Int.logor_one_bit", "original_source_type": "val logor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 || v y = 1 then 1 else 0) })", "source_type": "val logor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 || v y = 1 then 1 else 0) })", "source_definition": "let logor_one_bit = Aux.logor_one_bit", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 32, "start_col": 20, "end_line": 32, "end_col": 37 }, "file_context": "module QUIC.Secret.Int\nmodule Aux = QUIC.Secret.Int.Aux\n\nlet usub\n #t #sec x y\n= x `sub` y\n\nlet cast_up\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet cast_down\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet hide\n #t #sec x\n= cast t SEC x\n\nlet reveal\n #t #sec x\n= mk_int #t (v x)\n\n\nlet lognot'\n #t #l x\n= U.nth_lemma #(bits t) (U.lognot (v x)) (v x `U.logxor` v (ones t l));\n x `logxor` ones t l\n\nlet logand_one_bit = Aux.logand_one_bit", "dependencies": { "source_file": "QUIC.Secret.Int.fst", "checked_file": "QUIC.Secret.Int.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.Aux.fst.checked", "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x: Lib.IntTypes.int_t t sec {QUIC.Secret.Int.Base.v x == 0 \\/ QUIC.Secret.Int.Base.v x == 1} ->\n y: Lib.IntTypes.int_t t sec {QUIC.Secret.Int.Base.v y == 0 \\/ QUIC.Secret.Int.Base.v y == 1}\n -> z:\n Lib.IntTypes.int_t t sec\n { QUIC.Secret.Int.Base.v z ==\n (match QUIC.Secret.Int.Base.v x = 1 || QUIC.Secret.Int.Base.v y = 1 with\n | true -> 1\n | _ -> 0) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "QUIC.Secret.Int.Aux.logor_one_bit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val logor_one_bit\n (#t: inttype { supported_type t })\n (#sec: secrecy_level)\n (x: int_t t sec { v x == 0 \\/ v x == 1 })\n (y: int_t t sec { v y == 0 \\/ v y == 1 })\n: Tot (z: int_t t sec { v z == (if v x = 1 || v y = 1 then 1 else 0) })\nlet logor_one_bit =", "completed_definiton": "Aux.logor_one_bit", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fst", "name": "QUIC.Secret.Int.min64", "original_source_type": "val min64\n (x y: uint64)\n: Tot (z: uint64 { v z == (if v x <= v y then v x else v y) })", "source_type": "val min64\n (x y: uint64)\n: Tot (z: uint64 { v z == (if v x <= v y then v x else v y) })", "source_definition": "let min64 x y = Aux.min64 x y", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 107, "start_col": 16, "end_line": 107, "end_col": 29 }, "file_context": "module QUIC.Secret.Int\nmodule Aux = QUIC.Secret.Int.Aux\n\nlet usub\n #t #sec x y\n= x `sub` y\n\nlet cast_up\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet cast_down\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet hide\n #t #sec x\n= cast t SEC x\n\nlet reveal\n #t #sec x\n= mk_int #t (v x)\n\n\nlet lognot'\n #t #l x\n= U.nth_lemma #(bits t) (U.lognot (v x)) (v x `U.logxor` v (ones t l));\n x `logxor` ones t l\n\nlet logand_one_bit = Aux.logand_one_bit\n\nlet logor_one_bit = Aux.logor_one_bit\n\nlet logxor_one_bit = Aux.logxor_one_bit\n\nlet secret_bool = Aux.secret_bool\n\nlet lognot_one_bit = Aux.lognot_one_bit\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet get_bitfield\n #t #l x lo hi\n= BF.get_bitfield_eq_2 #(bits t) (v x) (U32.v lo) (U32.v hi);\n // due to https://github.com/FStarLang/karamel/issues/102 we need explicit intermediate operations here\n let op1 = x `shift_left` (U32.uint_to_t (bits t) `U32.sub` hi) in\n let op2 = op1 `shift_right` (U32.uint_to_t (bits t) `U32.sub` hi `U32.add` lo) in\n op2\n\n#restart-solver\n\nlet set_bitfield\n #t #l x lo hi w\n= BF.set_bitfield_eq #(bits t) (v x) (U32.v lo) (U32.v hi) (v w);\n U.lognot_lemma_1 #(bits t);\n // same as before\n let op0 = ones t l in\n let op1 = op0 `shift_right` (U32.uint_to_t (bits t) `U32.sub` (hi `U32.sub` lo)) in\n let op2 = op1 `shift_left` lo in\n let op3 = lognot' op2 in\n let op4 = x `logand` op3 in\n let op5 = w `shift_left` lo in\n let op6 = op4 `logor` op5 in\n op6\n#pop-options\n\n(* Instances *)\n\nlet secrets_are_equal_32_2\n (x: uint32 { v x < pow2 2 })\n (y: uint32 { v y < pow2 2 })\n: Tot (z: uint32 {\n v z == (if v x = v y then 1 else 0)\n })\n= Aux.secrets_are_equal x y\n\nlet secret_is_le_64\n (x: uint64)\n (y: uint64)\n: Tot (z: uint64 { v z == (if v x <= v y then 1 else 0) })\n= lognot_one_bit (Aux.secret_is_lt y x)\n\nlet secret_is_lt_64\n (x: uint64)\n (y: uint64)\n: Tot (z: uint64 { v z == (if v x < v y then 1 else 0) })\n= Aux.secret_is_lt x y\n\nlet secrets_are_equal_64_2\n (x: uint64 { v x < pow2 2 })\n (y: uint64 { v y < pow2 2 })\n: Tot (z: uint64 {\n v z == (if v x = v y then 1 else 0)\n })\n= Aux.secrets_are_equal x y\n\nlet secrets_are_equal_62\n (x: uint64 { v x < pow2 62 })\n (y: uint64 { v y < pow2 62 })\n: Tot (z: uint64 {\n v z == (if v x = v y then 1 else 0)\n })\n= Aux.secrets_are_equal x y", "dependencies": { "source_file": "QUIC.Secret.Int.fst", "checked_file": "QUIC.Secret.Int.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.Aux.fst.checked", "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Lib.IntTypes.uint64 -> y: Lib.IntTypes.uint64\n -> z:\n Lib.IntTypes.uint64\n { QUIC.Secret.Int.Base.v z ==\n (match QUIC.Secret.Int.Base.v x <= QUIC.Secret.Int.Base.v y with\n | true -> QUIC.Secret.Int.Base.v x\n | _ -> QUIC.Secret.Int.Base.v y) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.uint64", "QUIC.Secret.Int.Aux.min64", "Prims.eq2", "Lib.IntTypes.range_t", "Lib.IntTypes.U64", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.SEC", "Prims.op_LessThanOrEqual", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val min64\n (x y: uint64)\n: Tot (z: uint64 { v z == (if v x <= v y then v x else v y) })\nlet min64 x y =", "completed_definiton": "Aux.min64 x y", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fst", "name": "QUIC.Secret.Int.usub", "original_source_type": "val usub\n (#t: inttype { unsigned t })\n (#sec: secrecy_level)\n (x: uint_t t sec)\n (y: uint_t t sec { v y <= v x })\n: Tot (z: uint_t t sec { v z == v x - v y })", "source_type": "val usub\n (#t: inttype { unsigned t })\n (#sec: secrecy_level)\n (x: uint_t t sec)\n (y: uint_t t sec { v y <= v x })\n: Tot (z: uint_t t sec { v z == v x - v y })", "source_definition": "let usub\n #t #sec x y\n= x `sub` y", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 6, "start_col": 2, "end_line": 6, "end_col": 11 }, "file_context": "module QUIC.Secret.Int\nmodule Aux = QUIC.Secret.Int.Aux\n\nlet usub", "dependencies": { "source_file": "QUIC.Secret.Int.fst", "checked_file": "QUIC.Secret.Int.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.Aux.fst.checked", "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x: Lib.IntTypes.uint_t t sec ->\n y: Lib.IntTypes.uint_t t sec {QUIC.Secret.Int.Base.v y <= QUIC.Secret.Int.Base.v x}\n -> z:\n Lib.IntTypes.uint_t t sec\n {QUIC.Secret.Int.Base.v z == QUIC.Secret.Int.Base.v x - QUIC.Secret.Int.Base.v y}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "Lib.IntTypes.unsigned", "Lib.IntTypes.secrecy_level", "Lib.IntTypes.uint_t", "Prims.op_LessThanOrEqual", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.sub", "Prims.eq2", "Prims.int", "Prims.op_Subtraction" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val usub\n (#t: inttype { unsigned t })\n (#sec: secrecy_level)\n (x: uint_t t sec)\n (y: uint_t t sec { v y <= v x })\n: Tot (z: uint_t t sec { v z == v x - v y })\nlet usub #t #sec x y =", "completed_definiton": "x `sub` y", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fst", "name": "QUIC.Secret.Int.secret_is_lt_64", "original_source_type": "val secret_is_lt_64\n (x: uint64)\n (y: uint64)\n: Tot (z: uint64 { v z == (if v x < v y then 1 else 0) })", "source_type": "val secret_is_lt_64\n (x: uint64)\n (y: uint64)\n: Tot (z: uint64 { v z == (if v x < v y then 1 else 0) })", "source_definition": "let secret_is_lt_64\n (x: uint64)\n (y: uint64)\n: Tot (z: uint64 { v z == (if v x < v y then 1 else 0) })\n= Aux.secret_is_lt x y", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 89, "start_col": 2, "end_line": 89, "end_col": 22 }, "file_context": "module QUIC.Secret.Int\nmodule Aux = QUIC.Secret.Int.Aux\n\nlet usub\n #t #sec x y\n= x `sub` y\n\nlet cast_up\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet cast_down\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet hide\n #t #sec x\n= cast t SEC x\n\nlet reveal\n #t #sec x\n= mk_int #t (v x)\n\n\nlet lognot'\n #t #l x\n= U.nth_lemma #(bits t) (U.lognot (v x)) (v x `U.logxor` v (ones t l));\n x `logxor` ones t l\n\nlet logand_one_bit = Aux.logand_one_bit\n\nlet logor_one_bit = Aux.logor_one_bit\n\nlet logxor_one_bit = Aux.logxor_one_bit\n\nlet secret_bool = Aux.secret_bool\n\nlet lognot_one_bit = Aux.lognot_one_bit\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet get_bitfield\n #t #l x lo hi\n= BF.get_bitfield_eq_2 #(bits t) (v x) (U32.v lo) (U32.v hi);\n // due to https://github.com/FStarLang/karamel/issues/102 we need explicit intermediate operations here\n let op1 = x `shift_left` (U32.uint_to_t (bits t) `U32.sub` hi) in\n let op2 = op1 `shift_right` (U32.uint_to_t (bits t) `U32.sub` hi `U32.add` lo) in\n op2\n\n#restart-solver\n\nlet set_bitfield\n #t #l x lo hi w\n= BF.set_bitfield_eq #(bits t) (v x) (U32.v lo) (U32.v hi) (v w);\n U.lognot_lemma_1 #(bits t);\n // same as before\n let op0 = ones t l in\n let op1 = op0 `shift_right` (U32.uint_to_t (bits t) `U32.sub` (hi `U32.sub` lo)) in\n let op2 = op1 `shift_left` lo in\n let op3 = lognot' op2 in\n let op4 = x `logand` op3 in\n let op5 = w `shift_left` lo in\n let op6 = op4 `logor` op5 in\n op6\n#pop-options\n\n(* Instances *)\n\nlet secrets_are_equal_32_2\n (x: uint32 { v x < pow2 2 })\n (y: uint32 { v y < pow2 2 })\n: Tot (z: uint32 {\n v z == (if v x = v y then 1 else 0)\n })\n= Aux.secrets_are_equal x y\n\nlet secret_is_le_64\n (x: uint64)\n (y: uint64)\n: Tot (z: uint64 { v z == (if v x <= v y then 1 else 0) })\n= lognot_one_bit (Aux.secret_is_lt y x)\n\nlet secret_is_lt_64\n (x: uint64)\n (y: uint64)", "dependencies": { "source_file": "QUIC.Secret.Int.fst", "checked_file": "QUIC.Secret.Int.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.Aux.fst.checked", "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Lib.IntTypes.uint64 -> y: Lib.IntTypes.uint64\n -> z:\n Lib.IntTypes.uint64\n { QUIC.Secret.Int.Base.v z ==\n (match QUIC.Secret.Int.Base.v x < QUIC.Secret.Int.Base.v y with\n | true -> 1\n | _ -> 0) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.uint64", "QUIC.Secret.Int.Aux.secret_is_lt", "Lib.IntTypes.U64", "Prims.eq2", "Prims.int", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.SEC", "Prims.op_LessThan", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val secret_is_lt_64\n (x: uint64)\n (y: uint64)\n: Tot (z: uint64 { v z == (if v x < v y then 1 else 0) })\nlet secret_is_lt_64 (x y: uint64) : Tot (z: uint64{v z == (if v x < v y then 1 else 0)}) =", "completed_definiton": "Aux.secret_is_lt x y", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fst", "name": "QUIC.Secret.Int.secrets_are_equal_32_2", "original_source_type": "val secrets_are_equal_32_2\n (x: uint32 { v x < pow2 2 })\n (y: uint32 { v y < pow2 2 })\n: Tot (z: uint32 {\n v z == (if v x = v y then 1 else 0)\n })", "source_type": "val secrets_are_equal_32_2\n (x: uint32 { v x < pow2 2 })\n (y: uint32 { v y < pow2 2 })\n: Tot (z: uint32 {\n v z == (if v x = v y then 1 else 0)\n })", "source_definition": "let secrets_are_equal_32_2\n (x: uint32 { v x < pow2 2 })\n (y: uint32 { v y < pow2 2 })\n: Tot (z: uint32 {\n v z == (if v x = v y then 1 else 0)\n })\n= Aux.secrets_are_equal x y", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 77, "start_col": 2, "end_line": 77, "end_col": 27 }, "file_context": "module QUIC.Secret.Int\nmodule Aux = QUIC.Secret.Int.Aux\n\nlet usub\n #t #sec x y\n= x `sub` y\n\nlet cast_up\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet cast_down\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet hide\n #t #sec x\n= cast t SEC x\n\nlet reveal\n #t #sec x\n= mk_int #t (v x)\n\n\nlet lognot'\n #t #l x\n= U.nth_lemma #(bits t) (U.lognot (v x)) (v x `U.logxor` v (ones t l));\n x `logxor` ones t l\n\nlet logand_one_bit = Aux.logand_one_bit\n\nlet logor_one_bit = Aux.logor_one_bit\n\nlet logxor_one_bit = Aux.logxor_one_bit\n\nlet secret_bool = Aux.secret_bool\n\nlet lognot_one_bit = Aux.lognot_one_bit\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet get_bitfield\n #t #l x lo hi\n= BF.get_bitfield_eq_2 #(bits t) (v x) (U32.v lo) (U32.v hi);\n // due to https://github.com/FStarLang/karamel/issues/102 we need explicit intermediate operations here\n let op1 = x `shift_left` (U32.uint_to_t (bits t) `U32.sub` hi) in\n let op2 = op1 `shift_right` (U32.uint_to_t (bits t) `U32.sub` hi `U32.add` lo) in\n op2\n\n#restart-solver\n\nlet set_bitfield\n #t #l x lo hi w\n= BF.set_bitfield_eq #(bits t) (v x) (U32.v lo) (U32.v hi) (v w);\n U.lognot_lemma_1 #(bits t);\n // same as before\n let op0 = ones t l in\n let op1 = op0 `shift_right` (U32.uint_to_t (bits t) `U32.sub` (hi `U32.sub` lo)) in\n let op2 = op1 `shift_left` lo in\n let op3 = lognot' op2 in\n let op4 = x `logand` op3 in\n let op5 = w `shift_left` lo in\n let op6 = op4 `logor` op5 in\n op6\n#pop-options\n\n(* Instances *)\n\nlet secrets_are_equal_32_2\n (x: uint32 { v x < pow2 2 })\n (y: uint32 { v y < pow2 2 })\n: Tot (z: uint32 {\n v z == (if v x = v y then 1 else 0)", "dependencies": { "source_file": "QUIC.Secret.Int.fst", "checked_file": "QUIC.Secret.Int.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.Aux.fst.checked", "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x: Lib.IntTypes.uint32{QUIC.Secret.Int.Base.v x < Prims.pow2 2} ->\n y: Lib.IntTypes.uint32{QUIC.Secret.Int.Base.v y < Prims.pow2 2}\n -> z:\n Lib.IntTypes.uint32\n { QUIC.Secret.Int.Base.v z ==\n (match QUIC.Secret.Int.Base.v x = QUIC.Secret.Int.Base.v y with\n | true -> 1\n | _ -> 0) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.uint32", "Prims.b2t", "Prims.op_LessThan", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U32", "Lib.IntTypes.SEC", "Prims.pow2", "QUIC.Secret.Int.Aux.secrets_are_equal", "Prims.eq2", "Prims.int", "Prims.op_Equality", "Lib.IntTypes.range_t", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val secrets_are_equal_32_2\n (x: uint32 { v x < pow2 2 })\n (y: uint32 { v y < pow2 2 })\n: Tot (z: uint32 {\n v z == (if v x = v y then 1 else 0)\n })\nlet secrets_are_equal_32_2 (x: uint32{v x < pow2 2}) (y: uint32{v y < pow2 2})\n : Tot (z: uint32{v z == (if v x = v y then 1 else 0)}) =", "completed_definiton": "Aux.secrets_are_equal x y", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fst", "name": "QUIC.Secret.Int.secrets_are_equal_64_2", "original_source_type": "val secrets_are_equal_64_2\n (x: uint64 { v x < pow2 2 })\n (y: uint64 { v y < pow2 2 })\n: Tot (z: uint64 {\n v z == (if v x = v y then 1 else 0)\n })", "source_type": "val secrets_are_equal_64_2\n (x: uint64 { v x < pow2 2 })\n (y: uint64 { v y < pow2 2 })\n: Tot (z: uint64 {\n v z == (if v x = v y then 1 else 0)\n })", "source_definition": "let secrets_are_equal_64_2\n (x: uint64 { v x < pow2 2 })\n (y: uint64 { v y < pow2 2 })\n: Tot (z: uint64 {\n v z == (if v x = v y then 1 else 0)\n })\n= Aux.secrets_are_equal x y", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 97, "start_col": 2, "end_line": 97, "end_col": 27 }, "file_context": "module QUIC.Secret.Int\nmodule Aux = QUIC.Secret.Int.Aux\n\nlet usub\n #t #sec x y\n= x `sub` y\n\nlet cast_up\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet cast_down\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet hide\n #t #sec x\n= cast t SEC x\n\nlet reveal\n #t #sec x\n= mk_int #t (v x)\n\n\nlet lognot'\n #t #l x\n= U.nth_lemma #(bits t) (U.lognot (v x)) (v x `U.logxor` v (ones t l));\n x `logxor` ones t l\n\nlet logand_one_bit = Aux.logand_one_bit\n\nlet logor_one_bit = Aux.logor_one_bit\n\nlet logxor_one_bit = Aux.logxor_one_bit\n\nlet secret_bool = Aux.secret_bool\n\nlet lognot_one_bit = Aux.lognot_one_bit\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet get_bitfield\n #t #l x lo hi\n= BF.get_bitfield_eq_2 #(bits t) (v x) (U32.v lo) (U32.v hi);\n // due to https://github.com/FStarLang/karamel/issues/102 we need explicit intermediate operations here\n let op1 = x `shift_left` (U32.uint_to_t (bits t) `U32.sub` hi) in\n let op2 = op1 `shift_right` (U32.uint_to_t (bits t) `U32.sub` hi `U32.add` lo) in\n op2\n\n#restart-solver\n\nlet set_bitfield\n #t #l x lo hi w\n= BF.set_bitfield_eq #(bits t) (v x) (U32.v lo) (U32.v hi) (v w);\n U.lognot_lemma_1 #(bits t);\n // same as before\n let op0 = ones t l in\n let op1 = op0 `shift_right` (U32.uint_to_t (bits t) `U32.sub` (hi `U32.sub` lo)) in\n let op2 = op1 `shift_left` lo in\n let op3 = lognot' op2 in\n let op4 = x `logand` op3 in\n let op5 = w `shift_left` lo in\n let op6 = op4 `logor` op5 in\n op6\n#pop-options\n\n(* Instances *)\n\nlet secrets_are_equal_32_2\n (x: uint32 { v x < pow2 2 })\n (y: uint32 { v y < pow2 2 })\n: Tot (z: uint32 {\n v z == (if v x = v y then 1 else 0)\n })\n= Aux.secrets_are_equal x y\n\nlet secret_is_le_64\n (x: uint64)\n (y: uint64)\n: Tot (z: uint64 { v z == (if v x <= v y then 1 else 0) })\n= lognot_one_bit (Aux.secret_is_lt y x)\n\nlet secret_is_lt_64\n (x: uint64)\n (y: uint64)\n: Tot (z: uint64 { v z == (if v x < v y then 1 else 0) })\n= Aux.secret_is_lt x y\n\nlet secrets_are_equal_64_2\n (x: uint64 { v x < pow2 2 })\n (y: uint64 { v y < pow2 2 })\n: Tot (z: uint64 {\n v z == (if v x = v y then 1 else 0)", "dependencies": { "source_file": "QUIC.Secret.Int.fst", "checked_file": "QUIC.Secret.Int.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.Aux.fst.checked", "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x: Lib.IntTypes.uint64{QUIC.Secret.Int.Base.v x < Prims.pow2 2} ->\n y: Lib.IntTypes.uint64{QUIC.Secret.Int.Base.v y < Prims.pow2 2}\n -> z:\n Lib.IntTypes.uint64\n { QUIC.Secret.Int.Base.v z ==\n (match QUIC.Secret.Int.Base.v x = QUIC.Secret.Int.Base.v y with\n | true -> 1\n | _ -> 0) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.uint64", "Prims.b2t", "Prims.op_LessThan", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "Prims.pow2", "QUIC.Secret.Int.Aux.secrets_are_equal", "Prims.eq2", "Prims.int", "Prims.op_Equality", "Lib.IntTypes.range_t", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val secrets_are_equal_64_2\n (x: uint64 { v x < pow2 2 })\n (y: uint64 { v y < pow2 2 })\n: Tot (z: uint64 {\n v z == (if v x = v y then 1 else 0)\n })\nlet secrets_are_equal_64_2 (x: uint64{v x < pow2 2}) (y: uint64{v y < pow2 2})\n : Tot (z: uint64{v z == (if v x = v y then 1 else 0)}) =", "completed_definiton": "Aux.secrets_are_equal x y", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fst", "name": "QUIC.Secret.Int.secret_is_le_64", "original_source_type": "val secret_is_le_64\n (x: uint64)\n (y: uint64)\n: Tot (z: uint64 { v z == (if v x <= v y then 1 else 0) })", "source_type": "val secret_is_le_64\n (x: uint64)\n (y: uint64)\n: Tot (z: uint64 { v z == (if v x <= v y then 1 else 0) })", "source_definition": "let secret_is_le_64\n (x: uint64)\n (y: uint64)\n: Tot (z: uint64 { v z == (if v x <= v y then 1 else 0) })\n= lognot_one_bit (Aux.secret_is_lt y x)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 83, "start_col": 2, "end_line": 83, "end_col": 39 }, "file_context": "module QUIC.Secret.Int\nmodule Aux = QUIC.Secret.Int.Aux\n\nlet usub\n #t #sec x y\n= x `sub` y\n\nlet cast_up\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet cast_down\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet hide\n #t #sec x\n= cast t SEC x\n\nlet reveal\n #t #sec x\n= mk_int #t (v x)\n\n\nlet lognot'\n #t #l x\n= U.nth_lemma #(bits t) (U.lognot (v x)) (v x `U.logxor` v (ones t l));\n x `logxor` ones t l\n\nlet logand_one_bit = Aux.logand_one_bit\n\nlet logor_one_bit = Aux.logor_one_bit\n\nlet logxor_one_bit = Aux.logxor_one_bit\n\nlet secret_bool = Aux.secret_bool\n\nlet lognot_one_bit = Aux.lognot_one_bit\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet get_bitfield\n #t #l x lo hi\n= BF.get_bitfield_eq_2 #(bits t) (v x) (U32.v lo) (U32.v hi);\n // due to https://github.com/FStarLang/karamel/issues/102 we need explicit intermediate operations here\n let op1 = x `shift_left` (U32.uint_to_t (bits t) `U32.sub` hi) in\n let op2 = op1 `shift_right` (U32.uint_to_t (bits t) `U32.sub` hi `U32.add` lo) in\n op2\n\n#restart-solver\n\nlet set_bitfield\n #t #l x lo hi w\n= BF.set_bitfield_eq #(bits t) (v x) (U32.v lo) (U32.v hi) (v w);\n U.lognot_lemma_1 #(bits t);\n // same as before\n let op0 = ones t l in\n let op1 = op0 `shift_right` (U32.uint_to_t (bits t) `U32.sub` (hi `U32.sub` lo)) in\n let op2 = op1 `shift_left` lo in\n let op3 = lognot' op2 in\n let op4 = x `logand` op3 in\n let op5 = w `shift_left` lo in\n let op6 = op4 `logor` op5 in\n op6\n#pop-options\n\n(* Instances *)\n\nlet secrets_are_equal_32_2\n (x: uint32 { v x < pow2 2 })\n (y: uint32 { v y < pow2 2 })\n: Tot (z: uint32 {\n v z == (if v x = v y then 1 else 0)\n })\n= Aux.secrets_are_equal x y\n\nlet secret_is_le_64\n (x: uint64)\n (y: uint64)", "dependencies": { "source_file": "QUIC.Secret.Int.fst", "checked_file": "QUIC.Secret.Int.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.Aux.fst.checked", "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Lib.IntTypes.uint64 -> y: Lib.IntTypes.uint64\n -> z:\n Lib.IntTypes.uint64\n { QUIC.Secret.Int.Base.v z ==\n (match QUIC.Secret.Int.Base.v x <= QUIC.Secret.Int.Base.v y with\n | true -> 1\n | _ -> 0) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.uint64", "QUIC.Secret.Int.lognot_one_bit", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "QUIC.Secret.Int.Aux.secret_is_lt", "Prims.eq2", "Prims.int", "QUIC.Secret.Int.Base.v", "Prims.op_LessThanOrEqual", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val secret_is_le_64\n (x: uint64)\n (y: uint64)\n: Tot (z: uint64 { v z == (if v x <= v y then 1 else 0) })\nlet secret_is_le_64 (x y: uint64) : Tot (z: uint64{v z == (if v x <= v y then 1 else 0)}) =", "completed_definiton": "lognot_one_bit (Aux.secret_is_lt y x)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fst", "name": "QUIC.Secret.Int.secrets_are_equal_62", "original_source_type": "val secrets_are_equal_62\n (x: uint64 { v x < pow2 62 })\n (y: uint64 { v y < pow2 62 })\n: Tot (z: uint64 {\n v z == (if v x = v y then 1 else 0)\n })", "source_type": "val secrets_are_equal_62\n (x: uint64 { v x < pow2 62 })\n (y: uint64 { v y < pow2 62 })\n: Tot (z: uint64 {\n v z == (if v x = v y then 1 else 0)\n })", "source_definition": "let secrets_are_equal_62\n (x: uint64 { v x < pow2 62 })\n (y: uint64 { v y < pow2 62 })\n: Tot (z: uint64 {\n v z == (if v x = v y then 1 else 0)\n })\n= Aux.secrets_are_equal x y", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 105, "start_col": 2, "end_line": 105, "end_col": 27 }, "file_context": "module QUIC.Secret.Int\nmodule Aux = QUIC.Secret.Int.Aux\n\nlet usub\n #t #sec x y\n= x `sub` y\n\nlet cast_up\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet cast_down\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet hide\n #t #sec x\n= cast t SEC x\n\nlet reveal\n #t #sec x\n= mk_int #t (v x)\n\n\nlet lognot'\n #t #l x\n= U.nth_lemma #(bits t) (U.lognot (v x)) (v x `U.logxor` v (ones t l));\n x `logxor` ones t l\n\nlet logand_one_bit = Aux.logand_one_bit\n\nlet logor_one_bit = Aux.logor_one_bit\n\nlet logxor_one_bit = Aux.logxor_one_bit\n\nlet secret_bool = Aux.secret_bool\n\nlet lognot_one_bit = Aux.lognot_one_bit\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet get_bitfield\n #t #l x lo hi\n= BF.get_bitfield_eq_2 #(bits t) (v x) (U32.v lo) (U32.v hi);\n // due to https://github.com/FStarLang/karamel/issues/102 we need explicit intermediate operations here\n let op1 = x `shift_left` (U32.uint_to_t (bits t) `U32.sub` hi) in\n let op2 = op1 `shift_right` (U32.uint_to_t (bits t) `U32.sub` hi `U32.add` lo) in\n op2\n\n#restart-solver\n\nlet set_bitfield\n #t #l x lo hi w\n= BF.set_bitfield_eq #(bits t) (v x) (U32.v lo) (U32.v hi) (v w);\n U.lognot_lemma_1 #(bits t);\n // same as before\n let op0 = ones t l in\n let op1 = op0 `shift_right` (U32.uint_to_t (bits t) `U32.sub` (hi `U32.sub` lo)) in\n let op2 = op1 `shift_left` lo in\n let op3 = lognot' op2 in\n let op4 = x `logand` op3 in\n let op5 = w `shift_left` lo in\n let op6 = op4 `logor` op5 in\n op6\n#pop-options\n\n(* Instances *)\n\nlet secrets_are_equal_32_2\n (x: uint32 { v x < pow2 2 })\n (y: uint32 { v y < pow2 2 })\n: Tot (z: uint32 {\n v z == (if v x = v y then 1 else 0)\n })\n= Aux.secrets_are_equal x y\n\nlet secret_is_le_64\n (x: uint64)\n (y: uint64)\n: Tot (z: uint64 { v z == (if v x <= v y then 1 else 0) })\n= lognot_one_bit (Aux.secret_is_lt y x)\n\nlet secret_is_lt_64\n (x: uint64)\n (y: uint64)\n: Tot (z: uint64 { v z == (if v x < v y then 1 else 0) })\n= Aux.secret_is_lt x y\n\nlet secrets_are_equal_64_2\n (x: uint64 { v x < pow2 2 })\n (y: uint64 { v y < pow2 2 })\n: Tot (z: uint64 {\n v z == (if v x = v y then 1 else 0)\n })\n= Aux.secrets_are_equal x y\n\nlet secrets_are_equal_62\n (x: uint64 { v x < pow2 62 })\n (y: uint64 { v y < pow2 62 })\n: Tot (z: uint64 {\n v z == (if v x = v y then 1 else 0)", "dependencies": { "source_file": "QUIC.Secret.Int.fst", "checked_file": "QUIC.Secret.Int.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.Aux.fst.checked", "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x: Lib.IntTypes.uint64{QUIC.Secret.Int.Base.v x < Prims.pow2 62} ->\n y: Lib.IntTypes.uint64{QUIC.Secret.Int.Base.v y < Prims.pow2 62}\n -> z:\n Lib.IntTypes.uint64\n { QUIC.Secret.Int.Base.v z ==\n (match QUIC.Secret.Int.Base.v x = QUIC.Secret.Int.Base.v y with\n | true -> 1\n | _ -> 0) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.uint64", "Prims.b2t", "Prims.op_LessThan", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "Prims.pow2", "QUIC.Secret.Int.Aux.secrets_are_equal", "Prims.eq2", "Prims.int", "Prims.op_Equality", "Lib.IntTypes.range_t", "Prims.bool" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val secrets_are_equal_62\n (x: uint64 { v x < pow2 62 })\n (y: uint64 { v y < pow2 62 })\n: Tot (z: uint64 {\n v z == (if v x = v y then 1 else 0)\n })\nlet secrets_are_equal_62 (x: uint64{v x < pow2 62}) (y: uint64{v y < pow2 62})\n : Tot (z: uint64{v z == (if v x = v y then 1 else 0)}) =", "completed_definiton": "Aux.secrets_are_equal x y", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fst", "name": "QUIC.Secret.Int.hide", "original_source_type": "val hide\n (#t: inttype { unsigned t })\n (#sec: secrecy_level)\n (x: uint_t t sec)\n: Tot (y: uint_t t SEC { v y == v x })", "source_type": "val hide\n (#t: inttype { unsigned t })\n (#sec: secrecy_level)\n (x: uint_t t sec)\n: Tot (y: uint_t t SEC { v y == v x })", "source_definition": "let hide\n #t #sec x\n= cast t SEC x", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 18, "start_col": 2, "end_line": 18, "end_col": 14 }, "file_context": "module QUIC.Secret.Int\nmodule Aux = QUIC.Secret.Int.Aux\n\nlet usub\n #t #sec x y\n= x `sub` y\n\nlet cast_up\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet cast_down\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet hide", "dependencies": { "source_file": "QUIC.Secret.Int.fst", "checked_file": "QUIC.Secret.Int.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.Aux.fst.checked", "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Lib.IntTypes.uint_t t sec\n -> y:\n Lib.IntTypes.uint_t t Lib.IntTypes.SEC {QUIC.Secret.Int.Base.v y == QUIC.Secret.Int.Base.v x}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "Lib.IntTypes.unsigned", "Lib.IntTypes.secrecy_level", "Lib.IntTypes.uint_t", "Lib.IntTypes.cast", "Lib.IntTypes.SEC", "Prims.eq2", "Lib.IntTypes.range_t", "QUIC.Secret.Int.Base.v" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val hide\n (#t: inttype { unsigned t })\n (#sec: secrecy_level)\n (x: uint_t t sec)\n: Tot (y: uint_t t SEC { v y == v x })\nlet hide #t #sec x =", "completed_definiton": "cast t SEC x", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fst", "name": "QUIC.Secret.Int.cast_up", "original_source_type": "val cast_up\n (#t1: inttype { unsigned t1 })\n (t2: inttype { unsigned t2 /\\ bits t1 <= bits t2 })\n (#sec: secrecy_level)\n (x: uint_t t1 sec)\n: Tot (y: uint_t t2 SEC { v y == v x })", "source_type": "val cast_up\n (#t1: inttype { unsigned t1 })\n (t2: inttype { unsigned t2 /\\ bits t1 <= bits t2 })\n (#sec: secrecy_level)\n (x: uint_t t1 sec)\n: Tot (y: uint_t t2 SEC { v y == v x })", "source_definition": "let cast_up\n #t1 t2 #sec x\n= cast t2 SEC x", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 10, "start_col": 2, "end_line": 10, "end_col": 15 }, "file_context": "module QUIC.Secret.Int\nmodule Aux = QUIC.Secret.Int.Aux\n\nlet usub\n #t #sec x y\n= x `sub` y\n\nlet cast_up", "dependencies": { "source_file": "QUIC.Secret.Int.fst", "checked_file": "QUIC.Secret.Int.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.Aux.fst.checked", "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n t2:\n Lib.IntTypes.inttype{Lib.IntTypes.unsigned t2 /\\ Lib.IntTypes.bits t1 <= Lib.IntTypes.bits t2} ->\n x: Lib.IntTypes.uint_t t1 sec\n -> y:\n Lib.IntTypes.uint_t t2 Lib.IntTypes.SEC {QUIC.Secret.Int.Base.v y == QUIC.Secret.Int.Base.v x}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "Lib.IntTypes.unsigned", "Prims.l_and", "Prims.op_LessThanOrEqual", "Lib.IntTypes.bits", "Lib.IntTypes.secrecy_level", "Lib.IntTypes.uint_t", "Lib.IntTypes.cast", "Lib.IntTypes.SEC", "Prims.eq2", "Prims.int", "Prims.l_or", "Lib.IntTypes.range", "QUIC.Secret.Int.Base.v" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val cast_up\n (#t1: inttype { unsigned t1 })\n (t2: inttype { unsigned t2 /\\ bits t1 <= bits t2 })\n (#sec: secrecy_level)\n (x: uint_t t1 sec)\n: Tot (y: uint_t t2 SEC { v y == v x })\nlet cast_up #t1 t2 #sec x =", "completed_definiton": "cast t2 SEC x", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fst", "name": "QUIC.Secret.Int.lognot'", "original_source_type": "val lognot'\n (#t:inttype { supported_type t })\n (#l:secrecy_level)\n (x: uint_t t l)\n: Tot (y: uint_t t l { v y == U.lognot #(bits t) (v x) })", "source_type": "val lognot'\n (#t:inttype { supported_type t })\n (#l:secrecy_level)\n (x: uint_t t l)\n: Tot (y: uint_t t l { v y == U.lognot #(bits t) (v x) })", "source_definition": "let lognot'\n #t #l x\n= U.nth_lemma #(bits t) (U.lognot (v x)) (v x `U.logxor` v (ones t l));\n x `logxor` ones t l", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 27, "start_col": 2, "end_line": 28, "end_col": 21 }, "file_context": "module QUIC.Secret.Int\nmodule Aux = QUIC.Secret.Int.Aux\n\nlet usub\n #t #sec x y\n= x `sub` y\n\nlet cast_up\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet cast_down\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet hide\n #t #sec x\n= cast t SEC x\n\nlet reveal\n #t #sec x\n= mk_int #t (v x)\n\n\nlet lognot'", "dependencies": { "source_file": "QUIC.Secret.Int.fst", "checked_file": "QUIC.Secret.Int.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.Aux.fst.checked", "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "x: Lib.IntTypes.uint_t t l\n -> y:\n Lib.IntTypes.uint_t t l\n {QUIC.Secret.Int.Base.v y == FStar.UInt.lognot (QUIC.Secret.Int.Base.v x)}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "QUIC.Secret.Int.Base.supported_type", "Lib.IntTypes.secrecy_level", "Lib.IntTypes.uint_t", "Lib.IntTypes.logxor", "Lib.IntTypes.ones", "Prims.unit", "FStar.UInt.nth_lemma", "Lib.IntTypes.bits", "FStar.UInt.lognot", "QUIC.Secret.Int.Base.v", "FStar.UInt.logxor", "Prims.eq2", "Prims.int", "Prims.l_or", "Lib.IntTypes.range", "FStar.UInt.size" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val lognot'\n (#t:inttype { supported_type t })\n (#l:secrecy_level)\n (x: uint_t t l)\n: Tot (y: uint_t t l { v y == U.lognot #(bits t) (v x) })\nlet lognot' #t #l x =", "completed_definiton": "U.nth_lemma #(bits t) (U.lognot (v x)) ((v x) `U.logxor` (v (ones t l)));\nx `logxor` (ones t l)", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fst", "name": "QUIC.Secret.Int.cast_down", "original_source_type": "val cast_down\n (#t1: inttype { unsigned t1 })\n (t2: inttype { unsigned t2 })\n (#sec: secrecy_level)\n (x: uint_t t1 sec { v x < pow2 (bits t2) } )\n: Tot (y: uint_t t2 SEC { v y == v x })", "source_type": "val cast_down\n (#t1: inttype { unsigned t1 })\n (t2: inttype { unsigned t2 })\n (#sec: secrecy_level)\n (x: uint_t t1 sec { v x < pow2 (bits t2) } )\n: Tot (y: uint_t t2 SEC { v y == v x })", "source_definition": "let cast_down\n #t1 t2 #sec x\n= cast t2 SEC x", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 14, "start_col": 2, "end_line": 14, "end_col": 15 }, "file_context": "module QUIC.Secret.Int\nmodule Aux = QUIC.Secret.Int.Aux\n\nlet usub\n #t #sec x y\n= x `sub` y\n\nlet cast_up\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet cast_down", "dependencies": { "source_file": "QUIC.Secret.Int.fst", "checked_file": "QUIC.Secret.Int.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.Aux.fst.checked", "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n t2: Lib.IntTypes.inttype{Lib.IntTypes.unsigned t2} ->\n x: Lib.IntTypes.uint_t t1 sec {QUIC.Secret.Int.Base.v x < Prims.pow2 (Lib.IntTypes.bits t2)}\n -> y:\n Lib.IntTypes.uint_t t2 Lib.IntTypes.SEC {QUIC.Secret.Int.Base.v y == QUIC.Secret.Int.Base.v x}", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "Lib.IntTypes.unsigned", "Lib.IntTypes.secrecy_level", "Lib.IntTypes.uint_t", "Prims.op_LessThan", "QUIC.Secret.Int.Base.v", "Prims.pow2", "Lib.IntTypes.bits", "Lib.IntTypes.cast", "Lib.IntTypes.SEC", "Prims.eq2", "Prims.int", "Prims.l_or", "Lib.IntTypes.range" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val cast_down\n (#t1: inttype { unsigned t1 })\n (t2: inttype { unsigned t2 })\n (#sec: secrecy_level)\n (x: uint_t t1 sec { v x < pow2 (bits t2) } )\n: Tot (y: uint_t t2 SEC { v y == v x })\nlet cast_down #t1 t2 #sec x =", "completed_definiton": "cast t2 SEC x", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fst", "name": "QUIC.Secret.Int.get_bitfield", "original_source_type": "val get_bitfield\n (#t: inttype { supported_type t })\n (#l: secrecy_level)\n (x: uint_t t l)\n (lo: U32.t)\n (hi: U32.t { U32.v lo < U32.v hi /\\ U32.v hi <= bits t })\n: Tot (y: uint_t t l { v y == BF.get_bitfield #(bits t) (v x) (U32.v lo) (U32.v hi) })", "source_type": "val get_bitfield\n (#t: inttype { supported_type t })\n (#l: secrecy_level)\n (x: uint_t t l)\n (lo: U32.t)\n (hi: U32.t { U32.v lo < U32.v hi /\\ U32.v hi <= bits t })\n: Tot (y: uint_t t l { v y == BF.get_bitfield #(bits t) (v x) (U32.v lo) (U32.v hi) })", "source_definition": "let get_bitfield\n #t #l x lo hi\n= BF.get_bitfield_eq_2 #(bits t) (v x) (U32.v lo) (U32.v hi);\n // due to https://github.com/FStarLang/karamel/issues/102 we need explicit intermediate operations here\n let op1 = x `shift_left` (U32.uint_to_t (bits t) `U32.sub` hi) in\n let op2 = op1 `shift_right` (U32.uint_to_t (bits t) `U32.sub` hi `U32.add` lo) in\n op2", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 46, "start_col": 2, "end_line": 50, "end_col": 5 }, "file_context": "module QUIC.Secret.Int\nmodule Aux = QUIC.Secret.Int.Aux\n\nlet usub\n #t #sec x y\n= x `sub` y\n\nlet cast_up\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet cast_down\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet hide\n #t #sec x\n= cast t SEC x\n\nlet reveal\n #t #sec x\n= mk_int #t (v x)\n\n\nlet lognot'\n #t #l x\n= U.nth_lemma #(bits t) (U.lognot (v x)) (v x `U.logxor` v (ones t l));\n x `logxor` ones t l\n\nlet logand_one_bit = Aux.logand_one_bit\n\nlet logor_one_bit = Aux.logor_one_bit\n\nlet logxor_one_bit = Aux.logxor_one_bit\n\nlet secret_bool = Aux.secret_bool\n\nlet lognot_one_bit = Aux.lognot_one_bit\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet get_bitfield", "dependencies": { "source_file": "QUIC.Secret.Int.fst", "checked_file": "QUIC.Secret.Int.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.Aux.fst.checked", "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x: Lib.IntTypes.uint_t t l ->\n lo: FStar.UInt32.t ->\n hi:\n FStar.UInt32.t\n {FStar.UInt32.v lo < FStar.UInt32.v hi /\\ FStar.UInt32.v hi <= Lib.IntTypes.bits t}\n -> y:\n Lib.IntTypes.uint_t t l\n { QUIC.Secret.Int.Base.v y ==\n LowParse.BitFields.get_bitfield (QUIC.Secret.Int.Base.v x)\n (FStar.UInt32.v lo)\n (FStar.UInt32.v hi) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "QUIC.Secret.Int.Base.supported_type", "Lib.IntTypes.secrecy_level", "Lib.IntTypes.uint_t", "FStar.UInt32.t", "Prims.l_and", "Prims.op_LessThan", "FStar.UInt32.v", "Prims.op_LessThanOrEqual", "Lib.IntTypes.bits", "Lib.IntTypes.int_t", "Lib.IntTypes.shift_right", "FStar.UInt32.add", "FStar.UInt32.sub", "FStar.UInt32.uint_to_t", "Lib.IntTypes.shift_left", "Prims.unit", "LowParse.BitFields.get_bitfield_eq_2", "QUIC.Secret.Int.Base.v", "Prims.eq2", "Prims.int", "Prims.l_or", "Lib.IntTypes.range", "FStar.UInt.size", "Prims.pow2", "Prims.op_Subtraction", "LowParse.BitFields.get_bitfield" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val get_bitfield\n (#t: inttype { supported_type t })\n (#l: secrecy_level)\n (x: uint_t t l)\n (lo: U32.t)\n (hi: U32.t { U32.v lo < U32.v hi /\\ U32.v hi <= bits t })\n: Tot (y: uint_t t l { v y == BF.get_bitfield #(bits t) (v x) (U32.v lo) (U32.v hi) })\nlet get_bitfield #t #l x lo hi =", "completed_definiton": "BF.get_bitfield_eq_2 #(bits t) (v x) (U32.v lo) (U32.v hi);\nlet op1 = x `shift_left` ((U32.uint_to_t (bits t)) `U32.sub` hi) in\nlet op2 = op1 `shift_right` (((U32.uint_to_t (bits t)) `U32.sub` hi) `U32.add` lo) in\nop2", "isa_cross_project_example": true }, { "file_name": "QUIC.Secret.Int.fst", "name": "QUIC.Secret.Int.set_bitfield", "original_source_type": "val set_bitfield\n (#t: inttype { supported_type t })\n (#l: secrecy_level)\n (x: uint_t t l)\n (lo: U32.t)\n (hi: U32.t { U32.v lo < U32.v hi /\\ U32.v hi <= bits t })\n (w: uint_t t l { v w < pow2 (U32.v hi - U32.v lo) })\n: Tot (y: uint_t t l { v y == BF.set_bitfield #(bits t) (v x) (U32.v lo) (U32.v hi) (v w) })", "source_type": "val set_bitfield\n (#t: inttype { supported_type t })\n (#l: secrecy_level)\n (x: uint_t t l)\n (lo: U32.t)\n (hi: U32.t { U32.v lo < U32.v hi /\\ U32.v hi <= bits t })\n (w: uint_t t l { v w < pow2 (U32.v hi - U32.v lo) })\n: Tot (y: uint_t t l { v y == BF.set_bitfield #(bits t) (v x) (U32.v lo) (U32.v hi) (v w) })", "source_definition": "let set_bitfield\n #t #l x lo hi w\n= BF.set_bitfield_eq #(bits t) (v x) (U32.v lo) (U32.v hi) (v w);\n U.lognot_lemma_1 #(bits t);\n // same as before\n let op0 = ones t l in\n let op1 = op0 `shift_right` (U32.uint_to_t (bits t) `U32.sub` (hi `U32.sub` lo)) in\n let op2 = op1 `shift_left` lo in\n let op3 = lognot' op2 in\n let op4 = x `logand` op3 in\n let op5 = w `shift_left` lo in\n let op6 = op4 `logor` op5 in\n op6", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Secret.Int.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 56, "start_col": 2, "end_line": 66, "end_col": 5 }, "file_context": "module QUIC.Secret.Int\nmodule Aux = QUIC.Secret.Int.Aux\n\nlet usub\n #t #sec x y\n= x `sub` y\n\nlet cast_up\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet cast_down\n #t1 t2 #sec x\n= cast t2 SEC x\n\nlet hide\n #t #sec x\n= cast t SEC x\n\nlet reveal\n #t #sec x\n= mk_int #t (v x)\n\n\nlet lognot'\n #t #l x\n= U.nth_lemma #(bits t) (U.lognot (v x)) (v x `U.logxor` v (ones t l));\n x `logxor` ones t l\n\nlet logand_one_bit = Aux.logand_one_bit\n\nlet logor_one_bit = Aux.logor_one_bit\n\nlet logxor_one_bit = Aux.logxor_one_bit\n\nlet secret_bool = Aux.secret_bool\n\nlet lognot_one_bit = Aux.lognot_one_bit\n\n#push-options \"--z3rlimit 64\"\n\n#restart-solver\n\nlet get_bitfield\n #t #l x lo hi\n= BF.get_bitfield_eq_2 #(bits t) (v x) (U32.v lo) (U32.v hi);\n // due to https://github.com/FStarLang/karamel/issues/102 we need explicit intermediate operations here\n let op1 = x `shift_left` (U32.uint_to_t (bits t) `U32.sub` hi) in\n let op2 = op1 `shift_right` (U32.uint_to_t (bits t) `U32.sub` hi `U32.add` lo) in\n op2\n\n#restart-solver\n\nlet set_bitfield", "dependencies": { "source_file": "QUIC.Secret.Int.fst", "checked_file": "QUIC.Secret.Int.fst.checked", "interface_file": true, "dependencies": [ "QUIC.Secret.Int.Aux.fst.checked", "prims.fst.checked", "FStar.Pervasives.fsti.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "Aux", "full_module": "QUIC.Secret.Int.Aux" }, { "abbrev": true, "short_module": "BF", "full_module": "LowParse.BitFields" }, { "abbrev": true, "short_module": "U", "full_module": "FStar.UInt" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U16", "full_module": "FStar.UInt16" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret.Int.Base" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Secret" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 8, "initial_ifuel": 1, "max_ifuel": 2, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 64, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n x: Lib.IntTypes.uint_t t l ->\n lo: FStar.UInt32.t ->\n hi:\n FStar.UInt32.t\n {FStar.UInt32.v lo < FStar.UInt32.v hi /\\ FStar.UInt32.v hi <= Lib.IntTypes.bits t} ->\n w:\n Lib.IntTypes.uint_t t l\n {QUIC.Secret.Int.Base.v w < Prims.pow2 (FStar.UInt32.v hi - FStar.UInt32.v lo)}\n -> y:\n Lib.IntTypes.uint_t t l\n { QUIC.Secret.Int.Base.v y ==\n LowParse.BitFields.set_bitfield (QUIC.Secret.Int.Base.v x)\n (FStar.UInt32.v lo)\n (FStar.UInt32.v hi)\n (QUIC.Secret.Int.Base.v w) }", "effect": "Prims.Tot", "effect_flags": [ "total" ], "mutual_with": [], "ideal_premises": [ "Lib.IntTypes.inttype", "Prims.b2t", "QUIC.Secret.Int.Base.supported_type", "Lib.IntTypes.secrecy_level", "Lib.IntTypes.uint_t", "FStar.UInt32.t", "Prims.l_and", "Prims.op_LessThan", "FStar.UInt32.v", "Prims.op_LessThanOrEqual", "Lib.IntTypes.bits", "QUIC.Secret.Int.Base.v", "Prims.pow2", "Prims.op_Subtraction", "Lib.IntTypes.int_t", "Lib.IntTypes.logor", "Lib.IntTypes.shift_left", "Lib.IntTypes.logand", "Prims.eq2", "Prims.int", "Prims.l_or", "Lib.IntTypes.range", "FStar.UInt.size", "Lib.IntTypes.v", "FStar.UInt.lognot", "QUIC.Secret.Int.lognot'", "Lib.IntTypes.shift_right", "FStar.UInt32.sub", "FStar.UInt32.uint_to_t", "Prims.op_Equality", "Lib.IntTypes.ones_v", "Lib.IntTypes.ones", "Prims.unit", "FStar.UInt.lognot_lemma_1", "LowParse.BitFields.set_bitfield_eq", "LowParse.BitFields.set_bitfield" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val set_bitfield\n (#t: inttype { supported_type t })\n (#l: secrecy_level)\n (x: uint_t t l)\n (lo: U32.t)\n (hi: U32.t { U32.v lo < U32.v hi /\\ U32.v hi <= bits t })\n (w: uint_t t l { v w < pow2 (U32.v hi - U32.v lo) })\n: Tot (y: uint_t t l { v y == BF.set_bitfield #(bits t) (v x) (U32.v lo) (U32.v hi) (v w) })\nlet set_bitfield #t #l x lo hi w =", "completed_definiton": "BF.set_bitfield_eq #(bits t) (v x) (U32.v lo) (U32.v hi) (v w);\nU.lognot_lemma_1 #(bits t);\nlet op0 = ones t l in\nlet op1 = op0 `shift_right` ((U32.uint_to_t (bits t)) `U32.sub` (hi `U32.sub` lo)) in\nlet op2 = op1 `shift_left` lo in\nlet op3 = lognot' op2 in\nlet op4 = x `logand` op3 in\nlet op5 = w `shift_left` lo in\nlet op6 = op4 `logor` op5 in\nop6", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Lemmas.fst", "name": "QUIC.Impl.Lemmas.hash_is_keysized_", "original_source_type": "val hash_is_keysized_ (a: QS.ha): Lemma\n (ensures (QS.keysized a (Spec.Hash.Definitions.hash_length a)))", "source_type": "val hash_is_keysized_ (a: QS.ha): Lemma\n (ensures (QS.keysized a (Spec.Hash.Definitions.hash_length a)))", "source_definition": "let hash_is_keysized_\n a\n=\n assert_norm (512 < pow2 61);\n assert_norm (512 < pow2 125)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 17, "start_col": 2, "end_line": 18, "end_col": 30 }, "file_context": "module QUIC.Impl.Lemmas\ninclude QUIC.Spec.Lemmas\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\n/// The usual sequence lemmas\n/// -------------------------\n\nlet lemma_five_cuts\n s i1 i2 i3 i4 i5 s0 s1 s2 s3 s4 s5\n=\n ()\n\nlet hash_is_keysized_\n a", "dependencies": { "source_file": "QUIC.Impl.Lemmas.fst", "checked_file": "QUIC.Impl.Lemmas.fst.checked", "interface_file": true, "dependencies": [ "Spec.Loops.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "FStar.Calc.fsti.checked", "EverCrypt.CTR.fsti.checked", "C.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "QSL", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "a: QUIC.Spec.Crypto.ha\n -> FStar.Pervasives.Lemma\n (ensures QUIC.Spec.Crypto.keysized a (Spec.Hash.Definitions.hash_length a))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "QUIC.Spec.Crypto.ha", "FStar.Pervasives.assert_norm", "Prims.b2t", "Prims.op_LessThan", "Prims.pow2", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val hash_is_keysized_ (a: QS.ha): Lemma\n (ensures (QS.keysized a (Spec.Hash.Definitions.hash_length a)))\nlet hash_is_keysized_ a =", "completed_definiton": "assert_norm (512 < pow2 61);\nassert_norm (512 < pow2 125)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Lemmas.fst", "name": "QUIC.Impl.Lemmas.n_to_be_lower'", "original_source_type": "val n_to_be_lower'\n (len: nat)\n (len' : nat)\n (n: nat)\n: Lemma\n (requires (\n len <= len' /\\\n n < pow2 (8 * len)\n ))\n (ensures (\n let open FStar.Endianness in\n n < pow2 (8 * len') /\\\n n_to_be len' n `S.equal` (S.create (len' - len) 0uy `S.append` n_to_be len n)\n ))", "source_type": "val n_to_be_lower'\n (len: nat)\n (len' : nat)\n (n: nat)\n: Lemma\n (requires (\n len <= len' /\\\n n < pow2 (8 * len)\n ))\n (ensures (\n let open FStar.Endianness in\n n < pow2 (8 * len') /\\\n n_to_be len' n `S.equal` (S.create (len' - len) 0uy `S.append` n_to_be len n)\n ))", "source_definition": "let n_to_be_lower'\n len len' n\n= let open FStar.Math.Lemmas in\n let open FStar.Endianness in\n pow2_le_compat (8 * len') (8 * len);\n let s1 = n_to_be len' n in\n let s2 = S.create (len' - len) 0uy `S.append` n_to_be len n in \n let phi\n (i: nat {i < len'})\n : Lemma\n (S.index s1 i == S.index s2 i)\n = QSL.index_n_to_be len' n i;\n assert (len' - 1 - i == len - 1 - (i - (len' - len)));\n if len' - len <= i\n then begin\n QSL.index_n_to_be len n (i - (len' - len))\n end else begin\n pow2_le_compat (8 * (len' - 1 - i)) (8 * len);\n FStar.Math.Lemmas.small_div n (pow2 (8 * (len' - 1 - i)));\n assert (n / pow2 (8 * (len' - 1 - i)) == 0);\n assert (S.index s1 i == 0uy)\n end\n in\n Classical.forall_intro phi", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 264, "start_col": 2, "end_line": 285, "end_col": 28 }, "file_context": "module QUIC.Impl.Lemmas\ninclude QUIC.Spec.Lemmas\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\n/// The usual sequence lemmas\n/// -------------------------\n\nlet lemma_five_cuts\n s i1 i2 i3 i4 i5 s0 s1 s2 s3 s4 s5\n=\n ()\n\nlet hash_is_keysized_\n a\n=\n assert_norm (512 < pow2 61);\n assert_norm (512 < pow2 125)\n\nlet lemma_slice\n #t s i\n=\n ()\n\nlet lemma_slice3\n #a s i j\n=\n ()\n\nlet lemma_slice0\n #a s\n= ()\n\nlet lemma_slice1\n #a s i j\n=\n ()\n\n\nopen FStar.Mul\n\n#push-options \"--max_fuel 1 --z3rlimit 100\"\nlet pointwise_upd\n #a f b1 b2 i pos x\n=\n calc (S.equal) {\n QSL.pointwise_op f (S.upd b1 i x) b2 pos;\n (S.equal) { lemma_slice (S.upd b1 i x) (i + 1) }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice (S.upd b1 i x) (i + 1) (S.length b1))\n b2 pos;\n (S.equal) { }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice b1 (i + 1) (S.length b1))\n b2 pos;\n (S.equal) {\n QSL.pointwise_op_suff f\n (S.slice (S.upd b1 i x) 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1)) b2 pos\n }\n S.slice (S.upd b1 i x) 0 (i + 1) `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1));\n (S.equal) { }\n S.upd (S.slice b1 0 (i + 1)) i x `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1));\n (S.equal) { }\n S.upd (S.slice b1 0 (i + 1) `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1))\n ) i x;\n (S.equal) {\n QSL.pointwise_op_suff f\n (S.slice b1 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1)) b2 pos\n }\n S.upd (\n QSL.pointwise_op f\n (S.slice b1 0 (i + 1) `S.append` S.slice b1 (i + 1) (S.length b1))\n b2 pos\n ) i x;\n (S.equal) { lemma_slice b1 (i + 1) }\n S.upd (QSL.pointwise_op f b1 b2 pos) i x;\n }\n\nlet rec pointwise_seq_map2\n #a f s1 s2 i\n=\n if S.length s2 = 0 then\n ()\n else\n let l = S.length s1 in\n calc (S.equal) {\n Spec.Loops.seq_map2 f (S.slice s1 i l) s2;\n (S.equal) {}\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (Spec.Loops.seq_map2 f (S.tail (S.slice s1 i l)) (S.tail s2));\n (S.equal) {}\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (Spec.Loops.seq_map2 f (S.slice s1 (i + 1) l) (S.tail s2));\n (S.equal) { pointwise_seq_map2 f s1 (S.slice s2 1 (S.length s2)) (i + 1) }\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (S.slice (QSL.pointwise_op f s1 (S.tail s2) (i + 1)) (i + 1) l);\n (S.equal) { }\n S.slice (\n S.upd (QSL.pointwise_op f s1 (S.tail s2) (i + 1))\n i\n (f (S.head (S.slice s1 i l)) (S.head s2)))\n i\n l;\n (S.equal) { }\n S.slice (\n S.upd (QSL.pointwise_op f s1 (S.slice s2 1 (S.length s2)) (i + 1))\n i\n (f (S.head (S.slice s1 i l)) (S.head s2)))\n i\n l;\n (S.equal) {\n pointwise_upd f s1 (S.slice s2 1 (S.length s2)) i (i + 1)\n (f (S.head (S.slice s1 i l)) (S.head s2))\n }\n S.slice\n (QSL.pointwise_op f\n (S.upd s1 i (f (S.head (S.slice s1 i l)) (S.head s2)))\n (S.slice s2 1 (S.length s2))\n (i + 1))\n i l;\n\n };\n ()\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet rec and_inplace_commutative\n s1 s2\n=\n if S.length s1 = 0 then\n ()\n else (\n FStar.UInt.logand_commutative #8 (U8.v (S.head s1)) (U8.v (S.head s2));\n assert (U8.logand (S.head s1) (S.head s2) = U8.logand (S.head s2) (S.head s1));\n and_inplace_commutative (S.tail s1) (S.tail s2);\n assert (Spec.Loops.seq_map2 U8.logand (S.tail s1) (S.tail s2) `S.equal`\n Spec.Loops.seq_map2 U8.logand (S.tail s2) (S.tail s1))\n )\n#pop-options\n\n#push-options \"--max_fuel 1\"\nlet rec seq_map2_xor0\n s1 s2\n=\n if S.length s1 = 0 then\n ()\n else\n let open FStar.UInt in\n logxor_lemma_1 #8 (Secret.v (S.head s2));\n logxor_lemma_1 #8 (Secret.v (S.head s1));\n logxor_commutative #8 (Secret.v (S.head s1)) (Secret.v (S.head s2));\n assert (Secret.v (S.head (Spec.Loops.seq_map2 EverCrypt.CTR.xor8 s1 s2)) == Secret.v (S.head s2));\n seq_map2_xor0 (S.tail s1) (S.tail s2)\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet upd_op_inplace\n #a op s x\n=\n ()\n#pop-options\n\n/// Endianness lemmas\n/// -----------------\n\n#push-options \"--z3rlimit 16\"\n#restart-solver\nlet rec be_to_n_slice\n s i\n=\n FStar.Endianness.reveal_be_to_n s;\n if S.length s = 0 then\n ()\n else\n let open FStar.Endianness in\n if i = S.length s then begin\n reveal_be_to_n S.empty;\n assert_norm (pow2 (8 * 0) = 1);\n assert (S.slice s (S.length s) (S.length s) `S.equal` S.empty);\n assert (be_to_n S.empty = 0);\n assert (be_to_n s % 1 = 0)\n end else\n let s' = (S.slice s i (S.length s)) in\n let s_prefix = (S.slice s 0 (S.length s - 1)) in\n assert (S.length s' <> 0);\n assert (8 <= 8 * (S.length s - i));\n FStar.Math.Lemmas.pow2_le_compat (8 * (S.length s - i)) 8;\n assert_norm (pow2 (8 * 1) = 256);\n assert (U8.v (S.last s) < pow2 (8 * (S.length s - i)));\n assert (S.length s' = S.length s_prefix - i + 1);\n FStar.Math.Lemmas.pow2_le_compat (8 * (S.length s')) (8 * (S.length s - i));\n calc (==) {\n be_to_n s';\n (==) {\n lemma_be_to_n_is_bounded s';\n FStar.Math.Lemmas.small_mod (be_to_n s') (pow2 (8 * (S.length s - i)))\n }\n (be_to_n s') % (pow2 (8 * (S.length s - i)));\n (==) { reveal_be_to_n s' }\n (U8.v (S.last s') + pow2 8 * be_to_n (S.slice s' 0 (S.length s' - 1))) %\n (pow2 (8 * (S.length s - i)));\n (==) { }\n (U8.v (S.last s) + pow2 8 * be_to_n (S.slice s i (S.length s - 1))) %\n (pow2 (8 * (S.length s - i)));\n (==) { }\n (U8.v (S.last s) + pow2 8 * (be_to_n (S.slice s_prefix i (S.length s_prefix)))) %\n (pow2 (8 * (S.length s - i)));\n (==) { be_to_n_slice s_prefix i }\n (U8.v (S.last s) + pow2 8 * (be_to_n s_prefix % pow2 (8 * (S.length s_prefix - i)))) %\n (pow2 (8 * (S.length s - i)));\n (==) { FStar.Math.Lemmas.pow2_multiplication_modulo_lemma_2\n (be_to_n s_prefix) (8 * (S.length s_prefix - i) + 8) 8\n }\n (U8.v (S.last s) +\n ((be_to_n s_prefix * pow2 8) % pow2 (8 * (S.length s_prefix - i) + 8))\n ) %\n (pow2 (8 * (S.length s - i)));\n (==) { }\n (U8.v (S.last s) +\n ((be_to_n s_prefix * pow2 8) % pow2 (8 * (S.length s - i)))\n ) %\n (pow2 (8 * (S.length s - i)));\n (==) { FStar.Math.Lemmas.lemma_mod_add_distr\n (U8.v (S.last s))\n (be_to_n s_prefix * pow2 8)\n (pow2 (8 * (S.length s - i)))\n }\n (U8.v (S.last s) + pow2 8 * be_to_n (S.slice s 0 (S.length s - 1))) %\n pow2 (8 * (S.length s - i));\n }\n#pop-options\n\nlet n_to_be_lower\n len len' n\n= let open FStar.Math.Lemmas in\n let open FStar.Endianness in\n pow2_le_compat (8 * len') (8 * len);\n let s1 = n_to_be len n in\n let s2 = FStar.Seq.slice (n_to_be len' n) (len' - len) len' in\n let phi\n (i: nat {i < len})\n : Lemma\n (S.index s1 i == S.index s2 i)\n = QSL.index_n_to_be len n i;\n QSL.index_n_to_be len' n (i + len' - len)\n in\n Classical.forall_intro phi\n\n#restart-solver\n\nlet n_to_be_lower'", "dependencies": { "source_file": "QUIC.Impl.Lemmas.fst", "checked_file": "QUIC.Impl.Lemmas.fst.checked", "interface_file": true, "dependencies": [ "Spec.Loops.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "FStar.Calc.fsti.checked", "EverCrypt.CTR.fsti.checked", "C.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "QSL", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "len: Prims.nat -> len': Prims.nat -> n: Prims.nat\n -> FStar.Pervasives.Lemma (requires len <= len' /\\ n < Prims.pow2 (8 * len))\n (ensures\n n < Prims.pow2 (8 * len') /\\\n FStar.Seq.Base.equal (FStar.Endianness.n_to_be len' n)\n (FStar.Seq.Base.append (FStar.Seq.Base.create (len' - len) 0uy)\n (FStar.Endianness.n_to_be len n)))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "FStar.Classical.forall_intro", "Prims.b2t", "Prims.op_LessThan", "Prims.eq2", "FStar.UInt8.t", "FStar.Seq.Base.index", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern", "Prims.op_LessThanOrEqual", "Prims.op_Subtraction", "QUIC.Spec.Lemmas.index_n_to_be", "Prims.bool", "Prims._assert", "FStar.UInt8.__uint_to_t", "Prims.int", "Prims.op_Division", "Prims.pow2", "FStar.Mul.op_Star", "FStar.Math.Lemmas.small_div", "FStar.Math.Lemmas.pow2_le_compat", "FStar.Seq.Base.seq", "FStar.Seq.Base.append", "FStar.Seq.Base.create", "FStar.Endianness.n_to_be", "FStar.Endianness.bytes", "Prims.l_and", "FStar.Seq.Base.length", "FStar.Endianness.be_to_n" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val n_to_be_lower'\n (len: nat)\n (len' : nat)\n (n: nat)\n: Lemma\n (requires (\n len <= len' /\\\n n < pow2 (8 * len)\n ))\n (ensures (\n let open FStar.Endianness in\n n < pow2 (8 * len') /\\\n n_to_be len' n `S.equal` (S.create (len' - len) 0uy `S.append` n_to_be len n)\n ))\nlet n_to_be_lower' len len' n =", "completed_definiton": "let open FStar.Math.Lemmas in\nlet open FStar.Endianness in\npow2_le_compat (8 * len') (8 * len);\nlet s1 = n_to_be len' n in\nlet s2 = (S.create (len' - len) 0uy) `S.append` (n_to_be len n) in\nlet phi (i: nat{i < len'}) : Lemma (S.index s1 i == S.index s2 i) =\n QSL.index_n_to_be len' n i;\n assert (len' - 1 - i == len - 1 - (i - (len' - len)));\n if len' - len <= i\n then QSL.index_n_to_be len n (i - (len' - len))\n else\n (pow2_le_compat (8 * (len' - 1 - i)) (8 * len);\n FStar.Math.Lemmas.small_div n (pow2 (8 * (len' - 1 - i)));\n assert (n / pow2 (8 * (len' - 1 - i)) == 0);\n assert (S.index s1 i == 0uy))\nin\nClassical.forall_intro phi", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Lemmas.fst", "name": "QUIC.Impl.Lemmas.secret_and_inplace_eq", "original_source_type": "val secret_and_inplace_eq\n (b1 b2: S.seq Secret.uint8)\n (pos: nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1/\\\n S.seq_reveal (secret_and_inplace b1 b2 pos) `S.equal` and_inplace (S.seq_reveal b1) (S.seq_reveal b2) pos\n ))\n [SMTPat (secret_and_inplace b1 b2 pos)]", "source_type": "val secret_and_inplace_eq\n (b1 b2: S.seq Secret.uint8)\n (pos: nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1/\\\n S.seq_reveal (secret_and_inplace b1 b2 pos) `S.equal` and_inplace (S.seq_reveal b1) (S.seq_reveal b2) pos\n ))\n [SMTPat (secret_and_inplace b1 b2 pos)]", "source_definition": "let secret_and_inplace_eq\n b1 b2 pos\n= let f\n (i: nat {i < S.length b1})\n : Lemma\n (S.index (S.seq_reveal (secret_and_inplace b1 b2 pos)) i == S.index (and_inplace (S.seq_reveal b1) (S.seq_reveal b2) pos) i)\n =\n pointwise_index (Secret.logand #Secret.U8 #Secret.SEC) b1 b2 i pos;\n pointwise_index U8.logand (S.seq_reveal b1) (S.seq_reveal b2) i pos\n in\n Classical.forall_intro f", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 378, "start_col": 1, "end_line": 386, "end_col": 26 }, "file_context": "module QUIC.Impl.Lemmas\ninclude QUIC.Spec.Lemmas\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\n/// The usual sequence lemmas\n/// -------------------------\n\nlet lemma_five_cuts\n s i1 i2 i3 i4 i5 s0 s1 s2 s3 s4 s5\n=\n ()\n\nlet hash_is_keysized_\n a\n=\n assert_norm (512 < pow2 61);\n assert_norm (512 < pow2 125)\n\nlet lemma_slice\n #t s i\n=\n ()\n\nlet lemma_slice3\n #a s i j\n=\n ()\n\nlet lemma_slice0\n #a s\n= ()\n\nlet lemma_slice1\n #a s i j\n=\n ()\n\n\nopen FStar.Mul\n\n#push-options \"--max_fuel 1 --z3rlimit 100\"\nlet pointwise_upd\n #a f b1 b2 i pos x\n=\n calc (S.equal) {\n QSL.pointwise_op f (S.upd b1 i x) b2 pos;\n (S.equal) { lemma_slice (S.upd b1 i x) (i + 1) }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice (S.upd b1 i x) (i + 1) (S.length b1))\n b2 pos;\n (S.equal) { }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice b1 (i + 1) (S.length b1))\n b2 pos;\n (S.equal) {\n QSL.pointwise_op_suff f\n (S.slice (S.upd b1 i x) 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1)) b2 pos\n }\n S.slice (S.upd b1 i x) 0 (i + 1) `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1));\n (S.equal) { }\n S.upd (S.slice b1 0 (i + 1)) i x `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1));\n (S.equal) { }\n S.upd (S.slice b1 0 (i + 1) `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1))\n ) i x;\n (S.equal) {\n QSL.pointwise_op_suff f\n (S.slice b1 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1)) b2 pos\n }\n S.upd (\n QSL.pointwise_op f\n (S.slice b1 0 (i + 1) `S.append` S.slice b1 (i + 1) (S.length b1))\n b2 pos\n ) i x;\n (S.equal) { lemma_slice b1 (i + 1) }\n S.upd (QSL.pointwise_op f b1 b2 pos) i x;\n }\n\nlet rec pointwise_seq_map2\n #a f s1 s2 i\n=\n if S.length s2 = 0 then\n ()\n else\n let l = S.length s1 in\n calc (S.equal) {\n Spec.Loops.seq_map2 f (S.slice s1 i l) s2;\n (S.equal) {}\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (Spec.Loops.seq_map2 f (S.tail (S.slice s1 i l)) (S.tail s2));\n (S.equal) {}\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (Spec.Loops.seq_map2 f (S.slice s1 (i + 1) l) (S.tail s2));\n (S.equal) { pointwise_seq_map2 f s1 (S.slice s2 1 (S.length s2)) (i + 1) }\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (S.slice (QSL.pointwise_op f s1 (S.tail s2) (i + 1)) (i + 1) l);\n (S.equal) { }\n S.slice (\n S.upd (QSL.pointwise_op f s1 (S.tail s2) (i + 1))\n i\n (f (S.head (S.slice s1 i l)) (S.head s2)))\n i\n l;\n (S.equal) { }\n S.slice (\n S.upd (QSL.pointwise_op f s1 (S.slice s2 1 (S.length s2)) (i + 1))\n i\n (f (S.head (S.slice s1 i l)) (S.head s2)))\n i\n l;\n (S.equal) {\n pointwise_upd f s1 (S.slice s2 1 (S.length s2)) i (i + 1)\n (f (S.head (S.slice s1 i l)) (S.head s2))\n }\n S.slice\n (QSL.pointwise_op f\n (S.upd s1 i (f (S.head (S.slice s1 i l)) (S.head s2)))\n (S.slice s2 1 (S.length s2))\n (i + 1))\n i l;\n\n };\n ()\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet rec and_inplace_commutative\n s1 s2\n=\n if S.length s1 = 0 then\n ()\n else (\n FStar.UInt.logand_commutative #8 (U8.v (S.head s1)) (U8.v (S.head s2));\n assert (U8.logand (S.head s1) (S.head s2) = U8.logand (S.head s2) (S.head s1));\n and_inplace_commutative (S.tail s1) (S.tail s2);\n assert (Spec.Loops.seq_map2 U8.logand (S.tail s1) (S.tail s2) `S.equal`\n Spec.Loops.seq_map2 U8.logand (S.tail s2) (S.tail s1))\n )\n#pop-options\n\n#push-options \"--max_fuel 1\"\nlet rec seq_map2_xor0\n s1 s2\n=\n if S.length s1 = 0 then\n ()\n else\n let open FStar.UInt in\n logxor_lemma_1 #8 (Secret.v (S.head s2));\n logxor_lemma_1 #8 (Secret.v (S.head s1));\n logxor_commutative #8 (Secret.v (S.head s1)) (Secret.v (S.head s2));\n assert (Secret.v (S.head (Spec.Loops.seq_map2 EverCrypt.CTR.xor8 s1 s2)) == Secret.v (S.head s2));\n seq_map2_xor0 (S.tail s1) (S.tail s2)\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet upd_op_inplace\n #a op s x\n=\n ()\n#pop-options\n\n/// Endianness lemmas\n/// -----------------\n\n#push-options \"--z3rlimit 16\"\n#restart-solver\nlet rec be_to_n_slice\n s i\n=\n FStar.Endianness.reveal_be_to_n s;\n if S.length s = 0 then\n ()\n else\n let open FStar.Endianness in\n if i = S.length s then begin\n reveal_be_to_n S.empty;\n assert_norm (pow2 (8 * 0) = 1);\n assert (S.slice s (S.length s) (S.length s) `S.equal` S.empty);\n assert (be_to_n S.empty = 0);\n assert (be_to_n s % 1 = 0)\n end else\n let s' = (S.slice s i (S.length s)) in\n let s_prefix = (S.slice s 0 (S.length s - 1)) in\n assert (S.length s' <> 0);\n assert (8 <= 8 * (S.length s - i));\n FStar.Math.Lemmas.pow2_le_compat (8 * (S.length s - i)) 8;\n assert_norm (pow2 (8 * 1) = 256);\n assert (U8.v (S.last s) < pow2 (8 * (S.length s - i)));\n assert (S.length s' = S.length s_prefix - i + 1);\n FStar.Math.Lemmas.pow2_le_compat (8 * (S.length s')) (8 * (S.length s - i));\n calc (==) {\n be_to_n s';\n (==) {\n lemma_be_to_n_is_bounded s';\n FStar.Math.Lemmas.small_mod (be_to_n s') (pow2 (8 * (S.length s - i)))\n }\n (be_to_n s') % (pow2 (8 * (S.length s - i)));\n (==) { reveal_be_to_n s' }\n (U8.v (S.last s') + pow2 8 * be_to_n (S.slice s' 0 (S.length s' - 1))) %\n (pow2 (8 * (S.length s - i)));\n (==) { }\n (U8.v (S.last s) + pow2 8 * be_to_n (S.slice s i (S.length s - 1))) %\n (pow2 (8 * (S.length s - i)));\n (==) { }\n (U8.v (S.last s) + pow2 8 * (be_to_n (S.slice s_prefix i (S.length s_prefix)))) %\n (pow2 (8 * (S.length s - i)));\n (==) { be_to_n_slice s_prefix i }\n (U8.v (S.last s) + pow2 8 * (be_to_n s_prefix % pow2 (8 * (S.length s_prefix - i)))) %\n (pow2 (8 * (S.length s - i)));\n (==) { FStar.Math.Lemmas.pow2_multiplication_modulo_lemma_2\n (be_to_n s_prefix) (8 * (S.length s_prefix - i) + 8) 8\n }\n (U8.v (S.last s) +\n ((be_to_n s_prefix * pow2 8) % pow2 (8 * (S.length s_prefix - i) + 8))\n ) %\n (pow2 (8 * (S.length s - i)));\n (==) { }\n (U8.v (S.last s) +\n ((be_to_n s_prefix * pow2 8) % pow2 (8 * (S.length s - i)))\n ) %\n (pow2 (8 * (S.length s - i)));\n (==) { FStar.Math.Lemmas.lemma_mod_add_distr\n (U8.v (S.last s))\n (be_to_n s_prefix * pow2 8)\n (pow2 (8 * (S.length s - i)))\n }\n (U8.v (S.last s) + pow2 8 * be_to_n (S.slice s 0 (S.length s - 1))) %\n pow2 (8 * (S.length s - i));\n }\n#pop-options\n\nlet n_to_be_lower\n len len' n\n= let open FStar.Math.Lemmas in\n let open FStar.Endianness in\n pow2_le_compat (8 * len') (8 * len);\n let s1 = n_to_be len n in\n let s2 = FStar.Seq.slice (n_to_be len' n) (len' - len) len' in\n let phi\n (i: nat {i < len})\n : Lemma\n (S.index s1 i == S.index s2 i)\n = QSL.index_n_to_be len n i;\n QSL.index_n_to_be len' n (i + len' - len)\n in\n Classical.forall_intro phi\n\n#restart-solver\n\nlet n_to_be_lower'\n len len' n\n= let open FStar.Math.Lemmas in\n let open FStar.Endianness in\n pow2_le_compat (8 * len') (8 * len);\n let s1 = n_to_be len' n in\n let s2 = S.create (len' - len) 0uy `S.append` n_to_be len n in \n let phi\n (i: nat {i < len'})\n : Lemma\n (S.index s1 i == S.index s2 i)\n = QSL.index_n_to_be len' n i;\n assert (len' - 1 - i == len - 1 - (i - (len' - len)));\n if len' - len <= i\n then begin\n QSL.index_n_to_be len n (i - (len' - len))\n end else begin\n pow2_le_compat (8 * (len' - 1 - i)) (8 * len);\n FStar.Math.Lemmas.small_div n (pow2 (8 * (len' - 1 - i)));\n assert (n / pow2 (8 * (len' - 1 - i)) == 0);\n assert (S.index s1 i == 0uy)\n end\n in\n Classical.forall_intro phi\n\n#push-options \"--z3rlimit 200\"\ninline_for_extraction noextract\nlet op_inplace'\n (#t: Type)\n (dst: B.buffer t)\n (dst_len: Ghost.erased U32.t)\n (src: B.buffer t)\n (src_len: U32.t)\n (ofs: U32.t)\n (op: t -> t -> t)\n:\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf src ]) /\\\n B.disjoint dst src /\\\n B.length src == U32.v src_len /\\\n B.length dst == U32.v dst_len /\\\n B.length dst >= U32.v ofs + B.length src)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n pointwise_op op (B.as_seq h0 dst) (B.as_seq h0 src) (U32.v ofs) /\\\n Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs) `Seq.equal`\n Seq.slice (B.as_seq h1 dst) 0 (U32.v ofs) /\\\n Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (U32.v dst_len) `Seq.equal`\n Seq.slice (B.as_seq h1 dst) (U32.v (ofs `U32.add` src_len)) (U32.v dst_len))\n=\n let h0 = HST.get () in\n let dst0 = B.sub dst 0ul ofs in\n let dst1 = B.sub dst ofs src_len in\n let dst2 = Ghost.hide (B.gsub dst (ofs `U32.add` src_len) (dst_len `U32.sub` (ofs `U32.add` src_len))) in\n C.Loops.in_place_map2 dst1 src src_len op;\n let h1 = HST.get () in\n calc (Seq.equal) {\n B.as_seq h1 dst;\n (Seq.equal) { lemma_slice3 (B.as_seq h1 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len)) }\n Seq.slice (B.as_seq h1 dst) 0 (U32.v ofs) `Seq.append`\n (Seq.slice (B.as_seq h1 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len))) `Seq.append`\n (Seq.slice (B.as_seq h1 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) {}\n Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs) `Seq.append`\n (Seq.slice (B.as_seq h1 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len))) `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) { pointwise_seq_map2 op (B.as_seq h0 dst1) (B.as_seq h0 src) 0 }\n Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs) `Seq.append`\n (pointwise_op op\n (Seq.slice (B.as_seq h0 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len)))\n (B.as_seq h0 src)\n 0) `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) { pointwise_op_suff op (Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs))\n (Seq.slice (B.as_seq h0 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len)))\n (B.as_seq h0 src)\n (U32.v ofs) }\n pointwise_op op\n (Seq.append (Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs))\n (Seq.slice (B.as_seq h0 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len))))\n (B.as_seq h0 src)\n (U32.v ofs) `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) { lemma_slice1 (B.as_seq h0 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len)) }\n pointwise_op op\n (Seq.slice (B.as_seq h0 dst) 0 (U32.v (ofs `U32.add` src_len)))\n (B.as_seq h0 src)\n (U32.v ofs) `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) { pointwise_op_pref op\n (Seq.slice (B.as_seq h0 dst) 0 (U32.v (ofs `U32.add` src_len)))\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst))\n (B.as_seq h0 src)\n (U32.v ofs)\n }\n pointwise_op op\n (Seq.slice (B.as_seq h0 dst) 0 (U32.v (ofs `U32.add` src_len)) `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst)))\n (B.as_seq h0 src)\n (U32.v ofs);\n (Seq.equal) { lemma_slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) }\n pointwise_op op\n (B.as_seq h0 dst)\n (B.as_seq h0 src)\n (U32.v ofs);\n }\n#pop-options\n\nlet op_inplace\n #t dst src src_len ofs op\n= op_inplace' dst (B.len dst) src src_len ofs op\n\nlet secret_and_inplace_eq", "dependencies": { "source_file": "QUIC.Impl.Lemmas.fst", "checked_file": "QUIC.Impl.Lemmas.fst.checked", "interface_file": true, "dependencies": [ "Spec.Loops.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "FStar.Calc.fsti.checked", "EverCrypt.CTR.fsti.checked", "C.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "QSL", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b1: FStar.Seq.Base.seq Lib.IntTypes.uint8 ->\n b2: FStar.Seq.Base.seq Lib.IntTypes.uint8 ->\n pos: Prims.nat\n -> FStar.Pervasives.Lemma (requires FStar.Seq.Base.length b2 + pos <= FStar.Seq.Base.length b1)\n (ensures\n FStar.Seq.Base.length b2 + pos <= FStar.Seq.Base.length b1 /\\\n FStar.Seq.Base.equal (QUIC.Secret.Seq.seq_reveal (QUIC.Impl.Lemmas.secret_and_inplace b1\n b2\n pos))\n (QUIC.Spec.Lemmas.and_inplace (QUIC.Secret.Seq.seq_reveal b1)\n (QUIC.Secret.Seq.seq_reveal b2)\n pos))\n [SMTPat (QUIC.Impl.Lemmas.secret_and_inplace b1 b2 pos)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Lib.IntTypes.uint8", "Prims.nat", "FStar.Classical.forall_intro", "Prims.b2t", "Prims.op_LessThan", "FStar.Seq.Base.length", "Prims.eq2", "FStar.UInt8.t", "FStar.Seq.Base.index", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.PUB", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.SEC", "QUIC.Impl.Lemmas.secret_and_inplace", "QUIC.Spec.Base.byte", "QUIC.Spec.Lemmas.and_inplace", "Lib.IntTypes.int_t", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern", "QUIC.Spec.Lemmas.pointwise_index", "FStar.UInt8.logand", "Lib.IntTypes.logand" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val secret_and_inplace_eq\n (b1 b2: S.seq Secret.uint8)\n (pos: nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1/\\\n S.seq_reveal (secret_and_inplace b1 b2 pos) `S.equal` and_inplace (S.seq_reveal b1) (S.seq_reveal b2) pos\n ))\n [SMTPat (secret_and_inplace b1 b2 pos)]\nlet secret_and_inplace_eq b1 b2 pos =", "completed_definiton": "let f (i: nat{i < S.length b1})\n : Lemma\n (S.index (S.seq_reveal (secret_and_inplace b1 b2 pos)) i ==\n S.index (and_inplace (S.seq_reveal b1) (S.seq_reveal b2) pos) i) =\n pointwise_index (Secret.logand #Secret.U8 #Secret.SEC) b1 b2 i pos;\n pointwise_index U8.logand (S.seq_reveal b1) (S.seq_reveal b2) i pos\nin\nClassical.forall_intro f", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Lemmas.fst", "name": "QUIC.Impl.Lemmas.secret_xor_inplace_eq", "original_source_type": "val secret_xor_inplace_eq\n (b1 b2: S.seq Secret.uint8)\n (pos: nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1/\\\n S.seq_reveal (secret_xor_inplace b1 b2 pos) `S.equal` xor_inplace (S.seq_reveal b1) (S.seq_reveal b2) pos\n ))\n [SMTPat (secret_xor_inplace b1 b2 pos)]", "source_type": "val secret_xor_inplace_eq\n (b1 b2: S.seq Secret.uint8)\n (pos: nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1/\\\n S.seq_reveal (secret_xor_inplace b1 b2 pos) `S.equal` xor_inplace (S.seq_reveal b1) (S.seq_reveal b2) pos\n ))\n [SMTPat (secret_xor_inplace b1 b2 pos)]", "source_definition": "let secret_xor_inplace_eq\n b1 b2 pos\n= let f\n (i: nat {i < S.length b1})\n : Lemma\n (S.index (S.seq_reveal (secret_xor_inplace b1 b2 pos)) i == S.index (xor_inplace (S.seq_reveal b1) (S.seq_reveal b2) pos) i)\n =\n pointwise_index (Secret.logxor #Secret.U8 #Secret.SEC) b1 b2 i pos;\n pointwise_index U8.logxor (S.seq_reveal b1) (S.seq_reveal b2) i pos\n in\n Classical.forall_intro f", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 390, "start_col": 1, "end_line": 398, "end_col": 26 }, "file_context": "module QUIC.Impl.Lemmas\ninclude QUIC.Spec.Lemmas\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\n/// The usual sequence lemmas\n/// -------------------------\n\nlet lemma_five_cuts\n s i1 i2 i3 i4 i5 s0 s1 s2 s3 s4 s5\n=\n ()\n\nlet hash_is_keysized_\n a\n=\n assert_norm (512 < pow2 61);\n assert_norm (512 < pow2 125)\n\nlet lemma_slice\n #t s i\n=\n ()\n\nlet lemma_slice3\n #a s i j\n=\n ()\n\nlet lemma_slice0\n #a s\n= ()\n\nlet lemma_slice1\n #a s i j\n=\n ()\n\n\nopen FStar.Mul\n\n#push-options \"--max_fuel 1 --z3rlimit 100\"\nlet pointwise_upd\n #a f b1 b2 i pos x\n=\n calc (S.equal) {\n QSL.pointwise_op f (S.upd b1 i x) b2 pos;\n (S.equal) { lemma_slice (S.upd b1 i x) (i + 1) }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice (S.upd b1 i x) (i + 1) (S.length b1))\n b2 pos;\n (S.equal) { }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice b1 (i + 1) (S.length b1))\n b2 pos;\n (S.equal) {\n QSL.pointwise_op_suff f\n (S.slice (S.upd b1 i x) 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1)) b2 pos\n }\n S.slice (S.upd b1 i x) 0 (i + 1) `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1));\n (S.equal) { }\n S.upd (S.slice b1 0 (i + 1)) i x `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1));\n (S.equal) { }\n S.upd (S.slice b1 0 (i + 1) `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1))\n ) i x;\n (S.equal) {\n QSL.pointwise_op_suff f\n (S.slice b1 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1)) b2 pos\n }\n S.upd (\n QSL.pointwise_op f\n (S.slice b1 0 (i + 1) `S.append` S.slice b1 (i + 1) (S.length b1))\n b2 pos\n ) i x;\n (S.equal) { lemma_slice b1 (i + 1) }\n S.upd (QSL.pointwise_op f b1 b2 pos) i x;\n }\n\nlet rec pointwise_seq_map2\n #a f s1 s2 i\n=\n if S.length s2 = 0 then\n ()\n else\n let l = S.length s1 in\n calc (S.equal) {\n Spec.Loops.seq_map2 f (S.slice s1 i l) s2;\n (S.equal) {}\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (Spec.Loops.seq_map2 f (S.tail (S.slice s1 i l)) (S.tail s2));\n (S.equal) {}\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (Spec.Loops.seq_map2 f (S.slice s1 (i + 1) l) (S.tail s2));\n (S.equal) { pointwise_seq_map2 f s1 (S.slice s2 1 (S.length s2)) (i + 1) }\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (S.slice (QSL.pointwise_op f s1 (S.tail s2) (i + 1)) (i + 1) l);\n (S.equal) { }\n S.slice (\n S.upd (QSL.pointwise_op f s1 (S.tail s2) (i + 1))\n i\n (f (S.head (S.slice s1 i l)) (S.head s2)))\n i\n l;\n (S.equal) { }\n S.slice (\n S.upd (QSL.pointwise_op f s1 (S.slice s2 1 (S.length s2)) (i + 1))\n i\n (f (S.head (S.slice s1 i l)) (S.head s2)))\n i\n l;\n (S.equal) {\n pointwise_upd f s1 (S.slice s2 1 (S.length s2)) i (i + 1)\n (f (S.head (S.slice s1 i l)) (S.head s2))\n }\n S.slice\n (QSL.pointwise_op f\n (S.upd s1 i (f (S.head (S.slice s1 i l)) (S.head s2)))\n (S.slice s2 1 (S.length s2))\n (i + 1))\n i l;\n\n };\n ()\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet rec and_inplace_commutative\n s1 s2\n=\n if S.length s1 = 0 then\n ()\n else (\n FStar.UInt.logand_commutative #8 (U8.v (S.head s1)) (U8.v (S.head s2));\n assert (U8.logand (S.head s1) (S.head s2) = U8.logand (S.head s2) (S.head s1));\n and_inplace_commutative (S.tail s1) (S.tail s2);\n assert (Spec.Loops.seq_map2 U8.logand (S.tail s1) (S.tail s2) `S.equal`\n Spec.Loops.seq_map2 U8.logand (S.tail s2) (S.tail s1))\n )\n#pop-options\n\n#push-options \"--max_fuel 1\"\nlet rec seq_map2_xor0\n s1 s2\n=\n if S.length s1 = 0 then\n ()\n else\n let open FStar.UInt in\n logxor_lemma_1 #8 (Secret.v (S.head s2));\n logxor_lemma_1 #8 (Secret.v (S.head s1));\n logxor_commutative #8 (Secret.v (S.head s1)) (Secret.v (S.head s2));\n assert (Secret.v (S.head (Spec.Loops.seq_map2 EverCrypt.CTR.xor8 s1 s2)) == Secret.v (S.head s2));\n seq_map2_xor0 (S.tail s1) (S.tail s2)\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet upd_op_inplace\n #a op s x\n=\n ()\n#pop-options\n\n/// Endianness lemmas\n/// -----------------\n\n#push-options \"--z3rlimit 16\"\n#restart-solver\nlet rec be_to_n_slice\n s i\n=\n FStar.Endianness.reveal_be_to_n s;\n if S.length s = 0 then\n ()\n else\n let open FStar.Endianness in\n if i = S.length s then begin\n reveal_be_to_n S.empty;\n assert_norm (pow2 (8 * 0) = 1);\n assert (S.slice s (S.length s) (S.length s) `S.equal` S.empty);\n assert (be_to_n S.empty = 0);\n assert (be_to_n s % 1 = 0)\n end else\n let s' = (S.slice s i (S.length s)) in\n let s_prefix = (S.slice s 0 (S.length s - 1)) in\n assert (S.length s' <> 0);\n assert (8 <= 8 * (S.length s - i));\n FStar.Math.Lemmas.pow2_le_compat (8 * (S.length s - i)) 8;\n assert_norm (pow2 (8 * 1) = 256);\n assert (U8.v (S.last s) < pow2 (8 * (S.length s - i)));\n assert (S.length s' = S.length s_prefix - i + 1);\n FStar.Math.Lemmas.pow2_le_compat (8 * (S.length s')) (8 * (S.length s - i));\n calc (==) {\n be_to_n s';\n (==) {\n lemma_be_to_n_is_bounded s';\n FStar.Math.Lemmas.small_mod (be_to_n s') (pow2 (8 * (S.length s - i)))\n }\n (be_to_n s') % (pow2 (8 * (S.length s - i)));\n (==) { reveal_be_to_n s' }\n (U8.v (S.last s') + pow2 8 * be_to_n (S.slice s' 0 (S.length s' - 1))) %\n (pow2 (8 * (S.length s - i)));\n (==) { }\n (U8.v (S.last s) + pow2 8 * be_to_n (S.slice s i (S.length s - 1))) %\n (pow2 (8 * (S.length s - i)));\n (==) { }\n (U8.v (S.last s) + pow2 8 * (be_to_n (S.slice s_prefix i (S.length s_prefix)))) %\n (pow2 (8 * (S.length s - i)));\n (==) { be_to_n_slice s_prefix i }\n (U8.v (S.last s) + pow2 8 * (be_to_n s_prefix % pow2 (8 * (S.length s_prefix - i)))) %\n (pow2 (8 * (S.length s - i)));\n (==) { FStar.Math.Lemmas.pow2_multiplication_modulo_lemma_2\n (be_to_n s_prefix) (8 * (S.length s_prefix - i) + 8) 8\n }\n (U8.v (S.last s) +\n ((be_to_n s_prefix * pow2 8) % pow2 (8 * (S.length s_prefix - i) + 8))\n ) %\n (pow2 (8 * (S.length s - i)));\n (==) { }\n (U8.v (S.last s) +\n ((be_to_n s_prefix * pow2 8) % pow2 (8 * (S.length s - i)))\n ) %\n (pow2 (8 * (S.length s - i)));\n (==) { FStar.Math.Lemmas.lemma_mod_add_distr\n (U8.v (S.last s))\n (be_to_n s_prefix * pow2 8)\n (pow2 (8 * (S.length s - i)))\n }\n (U8.v (S.last s) + pow2 8 * be_to_n (S.slice s 0 (S.length s - 1))) %\n pow2 (8 * (S.length s - i));\n }\n#pop-options\n\nlet n_to_be_lower\n len len' n\n= let open FStar.Math.Lemmas in\n let open FStar.Endianness in\n pow2_le_compat (8 * len') (8 * len);\n let s1 = n_to_be len n in\n let s2 = FStar.Seq.slice (n_to_be len' n) (len' - len) len' in\n let phi\n (i: nat {i < len})\n : Lemma\n (S.index s1 i == S.index s2 i)\n = QSL.index_n_to_be len n i;\n QSL.index_n_to_be len' n (i + len' - len)\n in\n Classical.forall_intro phi\n\n#restart-solver\n\nlet n_to_be_lower'\n len len' n\n= let open FStar.Math.Lemmas in\n let open FStar.Endianness in\n pow2_le_compat (8 * len') (8 * len);\n let s1 = n_to_be len' n in\n let s2 = S.create (len' - len) 0uy `S.append` n_to_be len n in \n let phi\n (i: nat {i < len'})\n : Lemma\n (S.index s1 i == S.index s2 i)\n = QSL.index_n_to_be len' n i;\n assert (len' - 1 - i == len - 1 - (i - (len' - len)));\n if len' - len <= i\n then begin\n QSL.index_n_to_be len n (i - (len' - len))\n end else begin\n pow2_le_compat (8 * (len' - 1 - i)) (8 * len);\n FStar.Math.Lemmas.small_div n (pow2 (8 * (len' - 1 - i)));\n assert (n / pow2 (8 * (len' - 1 - i)) == 0);\n assert (S.index s1 i == 0uy)\n end\n in\n Classical.forall_intro phi\n\n#push-options \"--z3rlimit 200\"\ninline_for_extraction noextract\nlet op_inplace'\n (#t: Type)\n (dst: B.buffer t)\n (dst_len: Ghost.erased U32.t)\n (src: B.buffer t)\n (src_len: U32.t)\n (ofs: U32.t)\n (op: t -> t -> t)\n:\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf src ]) /\\\n B.disjoint dst src /\\\n B.length src == U32.v src_len /\\\n B.length dst == U32.v dst_len /\\\n B.length dst >= U32.v ofs + B.length src)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n pointwise_op op (B.as_seq h0 dst) (B.as_seq h0 src) (U32.v ofs) /\\\n Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs) `Seq.equal`\n Seq.slice (B.as_seq h1 dst) 0 (U32.v ofs) /\\\n Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (U32.v dst_len) `Seq.equal`\n Seq.slice (B.as_seq h1 dst) (U32.v (ofs `U32.add` src_len)) (U32.v dst_len))\n=\n let h0 = HST.get () in\n let dst0 = B.sub dst 0ul ofs in\n let dst1 = B.sub dst ofs src_len in\n let dst2 = Ghost.hide (B.gsub dst (ofs `U32.add` src_len) (dst_len `U32.sub` (ofs `U32.add` src_len))) in\n C.Loops.in_place_map2 dst1 src src_len op;\n let h1 = HST.get () in\n calc (Seq.equal) {\n B.as_seq h1 dst;\n (Seq.equal) { lemma_slice3 (B.as_seq h1 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len)) }\n Seq.slice (B.as_seq h1 dst) 0 (U32.v ofs) `Seq.append`\n (Seq.slice (B.as_seq h1 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len))) `Seq.append`\n (Seq.slice (B.as_seq h1 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) {}\n Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs) `Seq.append`\n (Seq.slice (B.as_seq h1 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len))) `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) { pointwise_seq_map2 op (B.as_seq h0 dst1) (B.as_seq h0 src) 0 }\n Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs) `Seq.append`\n (pointwise_op op\n (Seq.slice (B.as_seq h0 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len)))\n (B.as_seq h0 src)\n 0) `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) { pointwise_op_suff op (Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs))\n (Seq.slice (B.as_seq h0 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len)))\n (B.as_seq h0 src)\n (U32.v ofs) }\n pointwise_op op\n (Seq.append (Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs))\n (Seq.slice (B.as_seq h0 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len))))\n (B.as_seq h0 src)\n (U32.v ofs) `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) { lemma_slice1 (B.as_seq h0 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len)) }\n pointwise_op op\n (Seq.slice (B.as_seq h0 dst) 0 (U32.v (ofs `U32.add` src_len)))\n (B.as_seq h0 src)\n (U32.v ofs) `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) { pointwise_op_pref op\n (Seq.slice (B.as_seq h0 dst) 0 (U32.v (ofs `U32.add` src_len)))\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst))\n (B.as_seq h0 src)\n (U32.v ofs)\n }\n pointwise_op op\n (Seq.slice (B.as_seq h0 dst) 0 (U32.v (ofs `U32.add` src_len)) `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst)))\n (B.as_seq h0 src)\n (U32.v ofs);\n (Seq.equal) { lemma_slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) }\n pointwise_op op\n (B.as_seq h0 dst)\n (B.as_seq h0 src)\n (U32.v ofs);\n }\n#pop-options\n\nlet op_inplace\n #t dst src src_len ofs op\n= op_inplace' dst (B.len dst) src src_len ofs op\n\nlet secret_and_inplace_eq\n b1 b2 pos\n= let f\n (i: nat {i < S.length b1})\n : Lemma\n (S.index (S.seq_reveal (secret_and_inplace b1 b2 pos)) i == S.index (and_inplace (S.seq_reveal b1) (S.seq_reveal b2) pos) i)\n =\n pointwise_index (Secret.logand #Secret.U8 #Secret.SEC) b1 b2 i pos;\n pointwise_index U8.logand (S.seq_reveal b1) (S.seq_reveal b2) i pos\n in\n Classical.forall_intro f\n\nlet secret_xor_inplace_eq", "dependencies": { "source_file": "QUIC.Impl.Lemmas.fst", "checked_file": "QUIC.Impl.Lemmas.fst.checked", "interface_file": true, "dependencies": [ "Spec.Loops.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "FStar.Calc.fsti.checked", "EverCrypt.CTR.fsti.checked", "C.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "QSL", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n b1: FStar.Seq.Base.seq Lib.IntTypes.uint8 ->\n b2: FStar.Seq.Base.seq Lib.IntTypes.uint8 ->\n pos: Prims.nat\n -> FStar.Pervasives.Lemma (requires FStar.Seq.Base.length b2 + pos <= FStar.Seq.Base.length b1)\n (ensures\n FStar.Seq.Base.length b2 + pos <= FStar.Seq.Base.length b1 /\\\n FStar.Seq.Base.equal (QUIC.Secret.Seq.seq_reveal (QUIC.Impl.Lemmas.secret_xor_inplace b1\n b2\n pos))\n (QUIC.Spec.Lemmas.xor_inplace (QUIC.Secret.Seq.seq_reveal b1)\n (QUIC.Secret.Seq.seq_reveal b2)\n pos))\n [SMTPat (QUIC.Impl.Lemmas.secret_xor_inplace b1 b2 pos)]", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Lib.IntTypes.uint8", "Prims.nat", "FStar.Classical.forall_intro", "Prims.b2t", "Prims.op_LessThan", "FStar.Seq.Base.length", "Prims.eq2", "FStar.UInt8.t", "FStar.Seq.Base.index", "Lib.IntTypes.uint_t", "Lib.IntTypes.U8", "Lib.IntTypes.PUB", "QUIC.Secret.Seq.seq_reveal", "Lib.IntTypes.SEC", "QUIC.Impl.Lemmas.secret_xor_inplace", "QUIC.Spec.Base.byte", "QUIC.Spec.Lemmas.xor_inplace", "Lib.IntTypes.int_t", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern", "QUIC.Spec.Lemmas.pointwise_index", "FStar.UInt8.logxor", "Lib.IntTypes.logxor" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val secret_xor_inplace_eq\n (b1 b2: S.seq Secret.uint8)\n (pos: nat)\n: Lemma\n (requires (S.length b2 + pos <= S.length b1))\n (ensures (\n S.length b2 + pos <= S.length b1/\\\n S.seq_reveal (secret_xor_inplace b1 b2 pos) `S.equal` xor_inplace (S.seq_reveal b1) (S.seq_reveal b2) pos\n ))\n [SMTPat (secret_xor_inplace b1 b2 pos)]\nlet secret_xor_inplace_eq b1 b2 pos =", "completed_definiton": "let f (i: nat{i < S.length b1})\n : Lemma\n (S.index (S.seq_reveal (secret_xor_inplace b1 b2 pos)) i ==\n S.index (xor_inplace (S.seq_reveal b1) (S.seq_reveal b2) pos) i) =\n pointwise_index (Secret.logxor #Secret.U8 #Secret.SEC) b1 b2 i pos;\n pointwise_index U8.logxor (S.seq_reveal b1) (S.seq_reveal b2) i pos\nin\nClassical.forall_intro f", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Lemmas.fst", "name": "QUIC.Impl.Lemmas.n_to_be_lower", "original_source_type": "val n_to_be_lower\n (len: nat)\n (len' : nat)\n (n: nat)\n: Lemma\n (requires (\n len <= len' /\\\n n < pow2 (8 * len)\n ))\n (ensures (\n let open FStar.Endianness in\n n < pow2 (8 * len') /\\\n n_to_be len n `S.equal` S.slice (n_to_be len' n) (len' - len) len'\n ))", "source_type": "val n_to_be_lower\n (len: nat)\n (len' : nat)\n (n: nat)\n: Lemma\n (requires (\n len <= len' /\\\n n < pow2 (8 * len)\n ))\n (ensures (\n let open FStar.Endianness in\n n < pow2 (8 * len') /\\\n n_to_be len n `S.equal` S.slice (n_to_be len' n) (len' - len) len'\n ))", "source_definition": "let n_to_be_lower\n len len' n\n= let open FStar.Math.Lemmas in\n let open FStar.Endianness in\n pow2_le_compat (8 * len') (8 * len);\n let s1 = n_to_be len n in\n let s2 = FStar.Seq.slice (n_to_be len' n) (len' - len) len' in\n let phi\n (i: nat {i < len})\n : Lemma\n (S.index s1 i == S.index s2 i)\n = QSL.index_n_to_be len n i;\n QSL.index_n_to_be len' n (i + len' - len)\n in\n Classical.forall_intro phi", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 246, "start_col": 2, "end_line": 258, "end_col": 28 }, "file_context": "module QUIC.Impl.Lemmas\ninclude QUIC.Spec.Lemmas\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\n/// The usual sequence lemmas\n/// -------------------------\n\nlet lemma_five_cuts\n s i1 i2 i3 i4 i5 s0 s1 s2 s3 s4 s5\n=\n ()\n\nlet hash_is_keysized_\n a\n=\n assert_norm (512 < pow2 61);\n assert_norm (512 < pow2 125)\n\nlet lemma_slice\n #t s i\n=\n ()\n\nlet lemma_slice3\n #a s i j\n=\n ()\n\nlet lemma_slice0\n #a s\n= ()\n\nlet lemma_slice1\n #a s i j\n=\n ()\n\n\nopen FStar.Mul\n\n#push-options \"--max_fuel 1 --z3rlimit 100\"\nlet pointwise_upd\n #a f b1 b2 i pos x\n=\n calc (S.equal) {\n QSL.pointwise_op f (S.upd b1 i x) b2 pos;\n (S.equal) { lemma_slice (S.upd b1 i x) (i + 1) }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice (S.upd b1 i x) (i + 1) (S.length b1))\n b2 pos;\n (S.equal) { }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice b1 (i + 1) (S.length b1))\n b2 pos;\n (S.equal) {\n QSL.pointwise_op_suff f\n (S.slice (S.upd b1 i x) 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1)) b2 pos\n }\n S.slice (S.upd b1 i x) 0 (i + 1) `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1));\n (S.equal) { }\n S.upd (S.slice b1 0 (i + 1)) i x `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1));\n (S.equal) { }\n S.upd (S.slice b1 0 (i + 1) `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1))\n ) i x;\n (S.equal) {\n QSL.pointwise_op_suff f\n (S.slice b1 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1)) b2 pos\n }\n S.upd (\n QSL.pointwise_op f\n (S.slice b1 0 (i + 1) `S.append` S.slice b1 (i + 1) (S.length b1))\n b2 pos\n ) i x;\n (S.equal) { lemma_slice b1 (i + 1) }\n S.upd (QSL.pointwise_op f b1 b2 pos) i x;\n }\n\nlet rec pointwise_seq_map2\n #a f s1 s2 i\n=\n if S.length s2 = 0 then\n ()\n else\n let l = S.length s1 in\n calc (S.equal) {\n Spec.Loops.seq_map2 f (S.slice s1 i l) s2;\n (S.equal) {}\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (Spec.Loops.seq_map2 f (S.tail (S.slice s1 i l)) (S.tail s2));\n (S.equal) {}\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (Spec.Loops.seq_map2 f (S.slice s1 (i + 1) l) (S.tail s2));\n (S.equal) { pointwise_seq_map2 f s1 (S.slice s2 1 (S.length s2)) (i + 1) }\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (S.slice (QSL.pointwise_op f s1 (S.tail s2) (i + 1)) (i + 1) l);\n (S.equal) { }\n S.slice (\n S.upd (QSL.pointwise_op f s1 (S.tail s2) (i + 1))\n i\n (f (S.head (S.slice s1 i l)) (S.head s2)))\n i\n l;\n (S.equal) { }\n S.slice (\n S.upd (QSL.pointwise_op f s1 (S.slice s2 1 (S.length s2)) (i + 1))\n i\n (f (S.head (S.slice s1 i l)) (S.head s2)))\n i\n l;\n (S.equal) {\n pointwise_upd f s1 (S.slice s2 1 (S.length s2)) i (i + 1)\n (f (S.head (S.slice s1 i l)) (S.head s2))\n }\n S.slice\n (QSL.pointwise_op f\n (S.upd s1 i (f (S.head (S.slice s1 i l)) (S.head s2)))\n (S.slice s2 1 (S.length s2))\n (i + 1))\n i l;\n\n };\n ()\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet rec and_inplace_commutative\n s1 s2\n=\n if S.length s1 = 0 then\n ()\n else (\n FStar.UInt.logand_commutative #8 (U8.v (S.head s1)) (U8.v (S.head s2));\n assert (U8.logand (S.head s1) (S.head s2) = U8.logand (S.head s2) (S.head s1));\n and_inplace_commutative (S.tail s1) (S.tail s2);\n assert (Spec.Loops.seq_map2 U8.logand (S.tail s1) (S.tail s2) `S.equal`\n Spec.Loops.seq_map2 U8.logand (S.tail s2) (S.tail s1))\n )\n#pop-options\n\n#push-options \"--max_fuel 1\"\nlet rec seq_map2_xor0\n s1 s2\n=\n if S.length s1 = 0 then\n ()\n else\n let open FStar.UInt in\n logxor_lemma_1 #8 (Secret.v (S.head s2));\n logxor_lemma_1 #8 (Secret.v (S.head s1));\n logxor_commutative #8 (Secret.v (S.head s1)) (Secret.v (S.head s2));\n assert (Secret.v (S.head (Spec.Loops.seq_map2 EverCrypt.CTR.xor8 s1 s2)) == Secret.v (S.head s2));\n seq_map2_xor0 (S.tail s1) (S.tail s2)\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet upd_op_inplace\n #a op s x\n=\n ()\n#pop-options\n\n/// Endianness lemmas\n/// -----------------\n\n#push-options \"--z3rlimit 16\"\n#restart-solver\nlet rec be_to_n_slice\n s i\n=\n FStar.Endianness.reveal_be_to_n s;\n if S.length s = 0 then\n ()\n else\n let open FStar.Endianness in\n if i = S.length s then begin\n reveal_be_to_n S.empty;\n assert_norm (pow2 (8 * 0) = 1);\n assert (S.slice s (S.length s) (S.length s) `S.equal` S.empty);\n assert (be_to_n S.empty = 0);\n assert (be_to_n s % 1 = 0)\n end else\n let s' = (S.slice s i (S.length s)) in\n let s_prefix = (S.slice s 0 (S.length s - 1)) in\n assert (S.length s' <> 0);\n assert (8 <= 8 * (S.length s - i));\n FStar.Math.Lemmas.pow2_le_compat (8 * (S.length s - i)) 8;\n assert_norm (pow2 (8 * 1) = 256);\n assert (U8.v (S.last s) < pow2 (8 * (S.length s - i)));\n assert (S.length s' = S.length s_prefix - i + 1);\n FStar.Math.Lemmas.pow2_le_compat (8 * (S.length s')) (8 * (S.length s - i));\n calc (==) {\n be_to_n s';\n (==) {\n lemma_be_to_n_is_bounded s';\n FStar.Math.Lemmas.small_mod (be_to_n s') (pow2 (8 * (S.length s - i)))\n }\n (be_to_n s') % (pow2 (8 * (S.length s - i)));\n (==) { reveal_be_to_n s' }\n (U8.v (S.last s') + pow2 8 * be_to_n (S.slice s' 0 (S.length s' - 1))) %\n (pow2 (8 * (S.length s - i)));\n (==) { }\n (U8.v (S.last s) + pow2 8 * be_to_n (S.slice s i (S.length s - 1))) %\n (pow2 (8 * (S.length s - i)));\n (==) { }\n (U8.v (S.last s) + pow2 8 * (be_to_n (S.slice s_prefix i (S.length s_prefix)))) %\n (pow2 (8 * (S.length s - i)));\n (==) { be_to_n_slice s_prefix i }\n (U8.v (S.last s) + pow2 8 * (be_to_n s_prefix % pow2 (8 * (S.length s_prefix - i)))) %\n (pow2 (8 * (S.length s - i)));\n (==) { FStar.Math.Lemmas.pow2_multiplication_modulo_lemma_2\n (be_to_n s_prefix) (8 * (S.length s_prefix - i) + 8) 8\n }\n (U8.v (S.last s) +\n ((be_to_n s_prefix * pow2 8) % pow2 (8 * (S.length s_prefix - i) + 8))\n ) %\n (pow2 (8 * (S.length s - i)));\n (==) { }\n (U8.v (S.last s) +\n ((be_to_n s_prefix * pow2 8) % pow2 (8 * (S.length s - i)))\n ) %\n (pow2 (8 * (S.length s - i)));\n (==) { FStar.Math.Lemmas.lemma_mod_add_distr\n (U8.v (S.last s))\n (be_to_n s_prefix * pow2 8)\n (pow2 (8 * (S.length s - i)))\n }\n (U8.v (S.last s) + pow2 8 * be_to_n (S.slice s 0 (S.length s - 1))) %\n pow2 (8 * (S.length s - i));\n }\n#pop-options\n\nlet n_to_be_lower", "dependencies": { "source_file": "QUIC.Impl.Lemmas.fst", "checked_file": "QUIC.Impl.Lemmas.fst.checked", "interface_file": true, "dependencies": [ "Spec.Loops.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "FStar.Calc.fsti.checked", "EverCrypt.CTR.fsti.checked", "C.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "QSL", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "len: Prims.nat -> len': Prims.nat -> n: Prims.nat\n -> FStar.Pervasives.Lemma (requires len <= len' /\\ n < Prims.pow2 (8 * len))\n (ensures\n n < Prims.pow2 (8 * len') /\\\n FStar.Seq.Base.equal (FStar.Endianness.n_to_be len n)\n (FStar.Seq.Base.slice (FStar.Endianness.n_to_be len' n) (len' - len) len'))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "Prims.nat", "FStar.Classical.forall_intro", "Prims.b2t", "Prims.op_LessThan", "Prims.eq2", "FStar.UInt8.t", "FStar.Seq.Base.index", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern", "QUIC.Spec.Lemmas.index_n_to_be", "Prims.op_Subtraction", "Prims.op_Addition", "FStar.Seq.Base.seq", "FStar.Seq.Base.slice", "FStar.Endianness.n_to_be", "FStar.Endianness.bytes", "Prims.l_and", "FStar.Seq.Base.length", "FStar.Endianness.be_to_n", "FStar.Math.Lemmas.pow2_le_compat", "FStar.Mul.op_Star" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val n_to_be_lower\n (len: nat)\n (len' : nat)\n (n: nat)\n: Lemma\n (requires (\n len <= len' /\\\n n < pow2 (8 * len)\n ))\n (ensures (\n let open FStar.Endianness in\n n < pow2 (8 * len') /\\\n n_to_be len n `S.equal` S.slice (n_to_be len' n) (len' - len) len'\n ))\nlet n_to_be_lower len len' n =", "completed_definiton": "let open FStar.Math.Lemmas in\nlet open FStar.Endianness in\npow2_le_compat (8 * len') (8 * len);\nlet s1 = n_to_be len n in\nlet s2 = FStar.Seq.slice (n_to_be len' n) (len' - len) len' in\nlet phi (i: nat{i < len}) : Lemma (S.index s1 i == S.index s2 i) =\n QSL.index_n_to_be len n i;\n QSL.index_n_to_be len' n (i + len' - len)\nin\nClassical.forall_intro phi", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Lemmas.fst", "name": "QUIC.Impl.Lemmas.op_inplace", "original_source_type": "val op_inplace\n (#t: Type)\n (dst: B.buffer t)\n (src: B.buffer t)\n (src_len: U32.t)\n (ofs: U32.t)\n (op: t -> t -> t)\n:\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf src ]) /\\\n B.disjoint dst src /\\\n B.length src == U32.v src_len /\\\n B.length dst >= U32.v ofs + B.length src)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst) h0 h1) /\\\n B.as_seq h1 dst `S.equal`\n pointwise_op op (B.as_seq h0 dst) (B.as_seq h0 src) (U32.v ofs) /\\\n S.slice (B.as_seq h0 dst) 0 (U32.v ofs) `S.equal`\n S.slice (B.as_seq h1 dst) 0 (U32.v ofs) /\\\n S.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst) `S.equal`\n S.slice (B.as_seq h1 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst))", "source_type": "val op_inplace\n (#t: Type)\n (dst: B.buffer t)\n (src: B.buffer t)\n (src_len: U32.t)\n (ofs: U32.t)\n (op: t -> t -> t)\n:\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf src ]) /\\\n B.disjoint dst src /\\\n B.length src == U32.v src_len /\\\n B.length dst >= U32.v ofs + B.length src)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst) h0 h1) /\\\n B.as_seq h1 dst `S.equal`\n pointwise_op op (B.as_seq h0 dst) (B.as_seq h0 src) (U32.v ofs) /\\\n S.slice (B.as_seq h0 dst) 0 (U32.v ofs) `S.equal`\n S.slice (B.as_seq h1 dst) 0 (U32.v ofs) /\\\n S.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst) `S.equal`\n S.slice (B.as_seq h1 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst))", "source_definition": "let op_inplace\n #t dst src src_len ofs op\n= op_inplace' dst (B.len dst) src src_len ofs op", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 374, "start_col": 2, "end_line": 374, "end_col": 48 }, "file_context": "module QUIC.Impl.Lemmas\ninclude QUIC.Spec.Lemmas\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\n/// The usual sequence lemmas\n/// -------------------------\n\nlet lemma_five_cuts\n s i1 i2 i3 i4 i5 s0 s1 s2 s3 s4 s5\n=\n ()\n\nlet hash_is_keysized_\n a\n=\n assert_norm (512 < pow2 61);\n assert_norm (512 < pow2 125)\n\nlet lemma_slice\n #t s i\n=\n ()\n\nlet lemma_slice3\n #a s i j\n=\n ()\n\nlet lemma_slice0\n #a s\n= ()\n\nlet lemma_slice1\n #a s i j\n=\n ()\n\n\nopen FStar.Mul\n\n#push-options \"--max_fuel 1 --z3rlimit 100\"\nlet pointwise_upd\n #a f b1 b2 i pos x\n=\n calc (S.equal) {\n QSL.pointwise_op f (S.upd b1 i x) b2 pos;\n (S.equal) { lemma_slice (S.upd b1 i x) (i + 1) }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice (S.upd b1 i x) (i + 1) (S.length b1))\n b2 pos;\n (S.equal) { }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice b1 (i + 1) (S.length b1))\n b2 pos;\n (S.equal) {\n QSL.pointwise_op_suff f\n (S.slice (S.upd b1 i x) 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1)) b2 pos\n }\n S.slice (S.upd b1 i x) 0 (i + 1) `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1));\n (S.equal) { }\n S.upd (S.slice b1 0 (i + 1)) i x `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1));\n (S.equal) { }\n S.upd (S.slice b1 0 (i + 1) `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1))\n ) i x;\n (S.equal) {\n QSL.pointwise_op_suff f\n (S.slice b1 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1)) b2 pos\n }\n S.upd (\n QSL.pointwise_op f\n (S.slice b1 0 (i + 1) `S.append` S.slice b1 (i + 1) (S.length b1))\n b2 pos\n ) i x;\n (S.equal) { lemma_slice b1 (i + 1) }\n S.upd (QSL.pointwise_op f b1 b2 pos) i x;\n }\n\nlet rec pointwise_seq_map2\n #a f s1 s2 i\n=\n if S.length s2 = 0 then\n ()\n else\n let l = S.length s1 in\n calc (S.equal) {\n Spec.Loops.seq_map2 f (S.slice s1 i l) s2;\n (S.equal) {}\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (Spec.Loops.seq_map2 f (S.tail (S.slice s1 i l)) (S.tail s2));\n (S.equal) {}\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (Spec.Loops.seq_map2 f (S.slice s1 (i + 1) l) (S.tail s2));\n (S.equal) { pointwise_seq_map2 f s1 (S.slice s2 1 (S.length s2)) (i + 1) }\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (S.slice (QSL.pointwise_op f s1 (S.tail s2) (i + 1)) (i + 1) l);\n (S.equal) { }\n S.slice (\n S.upd (QSL.pointwise_op f s1 (S.tail s2) (i + 1))\n i\n (f (S.head (S.slice s1 i l)) (S.head s2)))\n i\n l;\n (S.equal) { }\n S.slice (\n S.upd (QSL.pointwise_op f s1 (S.slice s2 1 (S.length s2)) (i + 1))\n i\n (f (S.head (S.slice s1 i l)) (S.head s2)))\n i\n l;\n (S.equal) {\n pointwise_upd f s1 (S.slice s2 1 (S.length s2)) i (i + 1)\n (f (S.head (S.slice s1 i l)) (S.head s2))\n }\n S.slice\n (QSL.pointwise_op f\n (S.upd s1 i (f (S.head (S.slice s1 i l)) (S.head s2)))\n (S.slice s2 1 (S.length s2))\n (i + 1))\n i l;\n\n };\n ()\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet rec and_inplace_commutative\n s1 s2\n=\n if S.length s1 = 0 then\n ()\n else (\n FStar.UInt.logand_commutative #8 (U8.v (S.head s1)) (U8.v (S.head s2));\n assert (U8.logand (S.head s1) (S.head s2) = U8.logand (S.head s2) (S.head s1));\n and_inplace_commutative (S.tail s1) (S.tail s2);\n assert (Spec.Loops.seq_map2 U8.logand (S.tail s1) (S.tail s2) `S.equal`\n Spec.Loops.seq_map2 U8.logand (S.tail s2) (S.tail s1))\n )\n#pop-options\n\n#push-options \"--max_fuel 1\"\nlet rec seq_map2_xor0\n s1 s2\n=\n if S.length s1 = 0 then\n ()\n else\n let open FStar.UInt in\n logxor_lemma_1 #8 (Secret.v (S.head s2));\n logxor_lemma_1 #8 (Secret.v (S.head s1));\n logxor_commutative #8 (Secret.v (S.head s1)) (Secret.v (S.head s2));\n assert (Secret.v (S.head (Spec.Loops.seq_map2 EverCrypt.CTR.xor8 s1 s2)) == Secret.v (S.head s2));\n seq_map2_xor0 (S.tail s1) (S.tail s2)\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet upd_op_inplace\n #a op s x\n=\n ()\n#pop-options\n\n/// Endianness lemmas\n/// -----------------\n\n#push-options \"--z3rlimit 16\"\n#restart-solver\nlet rec be_to_n_slice\n s i\n=\n FStar.Endianness.reveal_be_to_n s;\n if S.length s = 0 then\n ()\n else\n let open FStar.Endianness in\n if i = S.length s then begin\n reveal_be_to_n S.empty;\n assert_norm (pow2 (8 * 0) = 1);\n assert (S.slice s (S.length s) (S.length s) `S.equal` S.empty);\n assert (be_to_n S.empty = 0);\n assert (be_to_n s % 1 = 0)\n end else\n let s' = (S.slice s i (S.length s)) in\n let s_prefix = (S.slice s 0 (S.length s - 1)) in\n assert (S.length s' <> 0);\n assert (8 <= 8 * (S.length s - i));\n FStar.Math.Lemmas.pow2_le_compat (8 * (S.length s - i)) 8;\n assert_norm (pow2 (8 * 1) = 256);\n assert (U8.v (S.last s) < pow2 (8 * (S.length s - i)));\n assert (S.length s' = S.length s_prefix - i + 1);\n FStar.Math.Lemmas.pow2_le_compat (8 * (S.length s')) (8 * (S.length s - i));\n calc (==) {\n be_to_n s';\n (==) {\n lemma_be_to_n_is_bounded s';\n FStar.Math.Lemmas.small_mod (be_to_n s') (pow2 (8 * (S.length s - i)))\n }\n (be_to_n s') % (pow2 (8 * (S.length s - i)));\n (==) { reveal_be_to_n s' }\n (U8.v (S.last s') + pow2 8 * be_to_n (S.slice s' 0 (S.length s' - 1))) %\n (pow2 (8 * (S.length s - i)));\n (==) { }\n (U8.v (S.last s) + pow2 8 * be_to_n (S.slice s i (S.length s - 1))) %\n (pow2 (8 * (S.length s - i)));\n (==) { }\n (U8.v (S.last s) + pow2 8 * (be_to_n (S.slice s_prefix i (S.length s_prefix)))) %\n (pow2 (8 * (S.length s - i)));\n (==) { be_to_n_slice s_prefix i }\n (U8.v (S.last s) + pow2 8 * (be_to_n s_prefix % pow2 (8 * (S.length s_prefix - i)))) %\n (pow2 (8 * (S.length s - i)));\n (==) { FStar.Math.Lemmas.pow2_multiplication_modulo_lemma_2\n (be_to_n s_prefix) (8 * (S.length s_prefix - i) + 8) 8\n }\n (U8.v (S.last s) +\n ((be_to_n s_prefix * pow2 8) % pow2 (8 * (S.length s_prefix - i) + 8))\n ) %\n (pow2 (8 * (S.length s - i)));\n (==) { }\n (U8.v (S.last s) +\n ((be_to_n s_prefix * pow2 8) % pow2 (8 * (S.length s - i)))\n ) %\n (pow2 (8 * (S.length s - i)));\n (==) { FStar.Math.Lemmas.lemma_mod_add_distr\n (U8.v (S.last s))\n (be_to_n s_prefix * pow2 8)\n (pow2 (8 * (S.length s - i)))\n }\n (U8.v (S.last s) + pow2 8 * be_to_n (S.slice s 0 (S.length s - 1))) %\n pow2 (8 * (S.length s - i));\n }\n#pop-options\n\nlet n_to_be_lower\n len len' n\n= let open FStar.Math.Lemmas in\n let open FStar.Endianness in\n pow2_le_compat (8 * len') (8 * len);\n let s1 = n_to_be len n in\n let s2 = FStar.Seq.slice (n_to_be len' n) (len' - len) len' in\n let phi\n (i: nat {i < len})\n : Lemma\n (S.index s1 i == S.index s2 i)\n = QSL.index_n_to_be len n i;\n QSL.index_n_to_be len' n (i + len' - len)\n in\n Classical.forall_intro phi\n\n#restart-solver\n\nlet n_to_be_lower'\n len len' n\n= let open FStar.Math.Lemmas in\n let open FStar.Endianness in\n pow2_le_compat (8 * len') (8 * len);\n let s1 = n_to_be len' n in\n let s2 = S.create (len' - len) 0uy `S.append` n_to_be len n in \n let phi\n (i: nat {i < len'})\n : Lemma\n (S.index s1 i == S.index s2 i)\n = QSL.index_n_to_be len' n i;\n assert (len' - 1 - i == len - 1 - (i - (len' - len)));\n if len' - len <= i\n then begin\n QSL.index_n_to_be len n (i - (len' - len))\n end else begin\n pow2_le_compat (8 * (len' - 1 - i)) (8 * len);\n FStar.Math.Lemmas.small_div n (pow2 (8 * (len' - 1 - i)));\n assert (n / pow2 (8 * (len' - 1 - i)) == 0);\n assert (S.index s1 i == 0uy)\n end\n in\n Classical.forall_intro phi\n\n#push-options \"--z3rlimit 200\"\ninline_for_extraction noextract\nlet op_inplace'\n (#t: Type)\n (dst: B.buffer t)\n (dst_len: Ghost.erased U32.t)\n (src: B.buffer t)\n (src_len: U32.t)\n (ofs: U32.t)\n (op: t -> t -> t)\n:\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf src ]) /\\\n B.disjoint dst src /\\\n B.length src == U32.v src_len /\\\n B.length dst == U32.v dst_len /\\\n B.length dst >= U32.v ofs + B.length src)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n pointwise_op op (B.as_seq h0 dst) (B.as_seq h0 src) (U32.v ofs) /\\\n Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs) `Seq.equal`\n Seq.slice (B.as_seq h1 dst) 0 (U32.v ofs) /\\\n Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (U32.v dst_len) `Seq.equal`\n Seq.slice (B.as_seq h1 dst) (U32.v (ofs `U32.add` src_len)) (U32.v dst_len))\n=\n let h0 = HST.get () in\n let dst0 = B.sub dst 0ul ofs in\n let dst1 = B.sub dst ofs src_len in\n let dst2 = Ghost.hide (B.gsub dst (ofs `U32.add` src_len) (dst_len `U32.sub` (ofs `U32.add` src_len))) in\n C.Loops.in_place_map2 dst1 src src_len op;\n let h1 = HST.get () in\n calc (Seq.equal) {\n B.as_seq h1 dst;\n (Seq.equal) { lemma_slice3 (B.as_seq h1 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len)) }\n Seq.slice (B.as_seq h1 dst) 0 (U32.v ofs) `Seq.append`\n (Seq.slice (B.as_seq h1 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len))) `Seq.append`\n (Seq.slice (B.as_seq h1 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) {}\n Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs) `Seq.append`\n (Seq.slice (B.as_seq h1 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len))) `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) { pointwise_seq_map2 op (B.as_seq h0 dst1) (B.as_seq h0 src) 0 }\n Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs) `Seq.append`\n (pointwise_op op\n (Seq.slice (B.as_seq h0 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len)))\n (B.as_seq h0 src)\n 0) `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) { pointwise_op_suff op (Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs))\n (Seq.slice (B.as_seq h0 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len)))\n (B.as_seq h0 src)\n (U32.v ofs) }\n pointwise_op op\n (Seq.append (Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs))\n (Seq.slice (B.as_seq h0 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len))))\n (B.as_seq h0 src)\n (U32.v ofs) `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) { lemma_slice1 (B.as_seq h0 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len)) }\n pointwise_op op\n (Seq.slice (B.as_seq h0 dst) 0 (U32.v (ofs `U32.add` src_len)))\n (B.as_seq h0 src)\n (U32.v ofs) `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) { pointwise_op_pref op\n (Seq.slice (B.as_seq h0 dst) 0 (U32.v (ofs `U32.add` src_len)))\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst))\n (B.as_seq h0 src)\n (U32.v ofs)\n }\n pointwise_op op\n (Seq.slice (B.as_seq h0 dst) 0 (U32.v (ofs `U32.add` src_len)) `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst)))\n (B.as_seq h0 src)\n (U32.v ofs);\n (Seq.equal) { lemma_slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) }\n pointwise_op op\n (B.as_seq h0 dst)\n (B.as_seq h0 src)\n (U32.v ofs);\n }\n#pop-options\n\nlet op_inplace", "dependencies": { "source_file": "QUIC.Impl.Lemmas.fst", "checked_file": "QUIC.Impl.Lemmas.fst.checked", "interface_file": true, "dependencies": [ "Spec.Loops.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "FStar.Calc.fsti.checked", "EverCrypt.CTR.fsti.checked", "C.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "QSL", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n dst: LowStar.Buffer.buffer t ->\n src: LowStar.Buffer.buffer t ->\n src_len: FStar.UInt32.t ->\n ofs: FStar.UInt32.t ->\n op: (_: t -> _: t -> t)\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "FStar.UInt32.t", "QUIC.Impl.Lemmas.op_inplace'", "FStar.Ghost.hide", "LowStar.Monotonic.Buffer.len", "LowStar.Buffer.trivial_preorder", "Prims.unit" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val op_inplace\n (#t: Type)\n (dst: B.buffer t)\n (src: B.buffer t)\n (src_len: U32.t)\n (ofs: U32.t)\n (op: t -> t -> t)\n:\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf src ]) /\\\n B.disjoint dst src /\\\n B.length src == U32.v src_len /\\\n B.length dst >= U32.v ofs + B.length src)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst) h0 h1) /\\\n B.as_seq h1 dst `S.equal`\n pointwise_op op (B.as_seq h0 dst) (B.as_seq h0 src) (U32.v ofs) /\\\n S.slice (B.as_seq h0 dst) 0 (U32.v ofs) `S.equal`\n S.slice (B.as_seq h1 dst) 0 (U32.v ofs) /\\\n S.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst) `S.equal`\n S.slice (B.as_seq h1 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst))\nlet op_inplace #t dst src src_len ofs op =", "completed_definiton": "op_inplace' dst (B.len dst) src src_len ofs op", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Lemmas.fst", "name": "QUIC.Impl.Lemmas.and_inplace_commutative", "original_source_type": "val and_inplace_commutative (s1 s2: S.seq U8.t): Lemma\n (requires S.length s1 = S.length s2)\n (ensures Spec.Loops.seq_map2 U8.logand s1 s2 `S.equal`\n Spec.Loops.seq_map2 U8.logand s2 s1)\n (decreases (S.length s1))", "source_type": "val and_inplace_commutative (s1 s2: S.seq U8.t): Lemma\n (requires S.length s1 = S.length s2)\n (ensures Spec.Loops.seq_map2 U8.logand s1 s2 `S.equal`\n Spec.Loops.seq_map2 U8.logand s2 s1)\n (decreases (S.length s1))", "source_definition": "let rec and_inplace_commutative\n s1 s2\n=\n if S.length s1 = 0 then\n ()\n else (\n FStar.UInt.logand_commutative #8 (U8.v (S.head s1)) (U8.v (S.head s2));\n assert (U8.logand (S.head s1) (S.head s2) = U8.logand (S.head s2) (S.head s1));\n and_inplace_commutative (S.tail s1) (S.tail s2);\n assert (Spec.Loops.seq_map2 U8.logand (S.tail s1) (S.tail s2) `S.equal`\n Spec.Loops.seq_map2 U8.logand (S.tail s2) (S.tail s1))\n )", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 141, "start_col": 2, "end_line": 149, "end_col": 3 }, "file_context": "module QUIC.Impl.Lemmas\ninclude QUIC.Spec.Lemmas\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\n/// The usual sequence lemmas\n/// -------------------------\n\nlet lemma_five_cuts\n s i1 i2 i3 i4 i5 s0 s1 s2 s3 s4 s5\n=\n ()\n\nlet hash_is_keysized_\n a\n=\n assert_norm (512 < pow2 61);\n assert_norm (512 < pow2 125)\n\nlet lemma_slice\n #t s i\n=\n ()\n\nlet lemma_slice3\n #a s i j\n=\n ()\n\nlet lemma_slice0\n #a s\n= ()\n\nlet lemma_slice1\n #a s i j\n=\n ()\n\n\nopen FStar.Mul\n\n#push-options \"--max_fuel 1 --z3rlimit 100\"\nlet pointwise_upd\n #a f b1 b2 i pos x\n=\n calc (S.equal) {\n QSL.pointwise_op f (S.upd b1 i x) b2 pos;\n (S.equal) { lemma_slice (S.upd b1 i x) (i + 1) }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice (S.upd b1 i x) (i + 1) (S.length b1))\n b2 pos;\n (S.equal) { }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice b1 (i + 1) (S.length b1))\n b2 pos;\n (S.equal) {\n QSL.pointwise_op_suff f\n (S.slice (S.upd b1 i x) 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1)) b2 pos\n }\n S.slice (S.upd b1 i x) 0 (i + 1) `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1));\n (S.equal) { }\n S.upd (S.slice b1 0 (i + 1)) i x `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1));\n (S.equal) { }\n S.upd (S.slice b1 0 (i + 1) `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1))\n ) i x;\n (S.equal) {\n QSL.pointwise_op_suff f\n (S.slice b1 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1)) b2 pos\n }\n S.upd (\n QSL.pointwise_op f\n (S.slice b1 0 (i + 1) `S.append` S.slice b1 (i + 1) (S.length b1))\n b2 pos\n ) i x;\n (S.equal) { lemma_slice b1 (i + 1) }\n S.upd (QSL.pointwise_op f b1 b2 pos) i x;\n }\n\nlet rec pointwise_seq_map2\n #a f s1 s2 i\n=\n if S.length s2 = 0 then\n ()\n else\n let l = S.length s1 in\n calc (S.equal) {\n Spec.Loops.seq_map2 f (S.slice s1 i l) s2;\n (S.equal) {}\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (Spec.Loops.seq_map2 f (S.tail (S.slice s1 i l)) (S.tail s2));\n (S.equal) {}\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (Spec.Loops.seq_map2 f (S.slice s1 (i + 1) l) (S.tail s2));\n (S.equal) { pointwise_seq_map2 f s1 (S.slice s2 1 (S.length s2)) (i + 1) }\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (S.slice (QSL.pointwise_op f s1 (S.tail s2) (i + 1)) (i + 1) l);\n (S.equal) { }\n S.slice (\n S.upd (QSL.pointwise_op f s1 (S.tail s2) (i + 1))\n i\n (f (S.head (S.slice s1 i l)) (S.head s2)))\n i\n l;\n (S.equal) { }\n S.slice (\n S.upd (QSL.pointwise_op f s1 (S.slice s2 1 (S.length s2)) (i + 1))\n i\n (f (S.head (S.slice s1 i l)) (S.head s2)))\n i\n l;\n (S.equal) {\n pointwise_upd f s1 (S.slice s2 1 (S.length s2)) i (i + 1)\n (f (S.head (S.slice s1 i l)) (S.head s2))\n }\n S.slice\n (QSL.pointwise_op f\n (S.upd s1 i (f (S.head (S.slice s1 i l)) (S.head s2)))\n (S.slice s2 1 (S.length s2))\n (i + 1))\n i l;\n\n };\n ()\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet rec and_inplace_commutative\n s1 s2", "dependencies": { "source_file": "QUIC.Impl.Lemmas.fst", "checked_file": "QUIC.Impl.Lemmas.fst.checked", "interface_file": true, "dependencies": [ "Spec.Loops.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "FStar.Calc.fsti.checked", "EverCrypt.CTR.fsti.checked", "C.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "QSL", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 2, "initial_ifuel": 1, "max_ifuel": 1, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s1: FStar.Seq.Base.seq FStar.UInt8.t -> s2: FStar.Seq.Base.seq FStar.UInt8.t\n -> FStar.Pervasives.Lemma (requires FStar.Seq.Base.length s1 = FStar.Seq.Base.length s2)\n (ensures\n FStar.Seq.Base.equal (Spec.Loops.seq_map2 FStar.UInt8.logand s1 s2)\n (Spec.Loops.seq_map2 FStar.UInt8.logand s2 s1))\n (decreases FStar.Seq.Base.length s1)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma", "" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "FStar.UInt8.t", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "Prims.bool", "Prims._assert", "FStar.Seq.Base.equal", "Spec.Loops.seq_map2", "FStar.UInt8.logand", "FStar.Seq.Properties.tail", "Prims.unit", "QUIC.Impl.Lemmas.and_inplace_commutative", "Prims.b2t", "FStar.Seq.Properties.head", "FStar.UInt.logand_commutative", "FStar.UInt8.v" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val and_inplace_commutative (s1 s2: S.seq U8.t): Lemma\n (requires S.length s1 = S.length s2)\n (ensures Spec.Loops.seq_map2 U8.logand s1 s2 `S.equal`\n Spec.Loops.seq_map2 U8.logand s2 s1)\n (decreases (S.length s1))\nlet rec and_inplace_commutative s1 s2 =", "completed_definiton": "if S.length s1 = 0\nthen ()\nelse\n (FStar.UInt.logand_commutative #8 (U8.v (S.head s1)) (U8.v (S.head s2));\n assert (U8.logand (S.head s1) (S.head s2) = U8.logand (S.head s2) (S.head s1));\n and_inplace_commutative (S.tail s1) (S.tail s2);\n assert ((Spec.Loops.seq_map2 U8.logand (S.tail s1) (S.tail s2))\n `S.equal`\n (Spec.Loops.seq_map2 U8.logand (S.tail s2) (S.tail s1))))", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Lemmas.fst", "name": "QUIC.Impl.Lemmas.seq_map2_xor0", "original_source_type": "val seq_map2_xor0 (s1 s2: S.seq Secret.uint8): Lemma\n (requires\n S.length s1 = S.length s2 /\\\n s1 `S.equal` S.create (S.length s2) (Secret.to_u8 0uy))\n (ensures\n Spec.Loops.seq_map2 EverCrypt.CTR.xor8 s1 s2 `S.equal` s2)\n (decreases (S.length s1))", "source_type": "val seq_map2_xor0 (s1 s2: S.seq Secret.uint8): Lemma\n (requires\n S.length s1 = S.length s2 /\\\n s1 `S.equal` S.create (S.length s2) (Secret.to_u8 0uy))\n (ensures\n Spec.Loops.seq_map2 EverCrypt.CTR.xor8 s1 s2 `S.equal` s2)\n (decreases (S.length s1))", "source_definition": "let rec seq_map2_xor0\n s1 s2\n=\n if S.length s1 = 0 then\n ()\n else\n let open FStar.UInt in\n logxor_lemma_1 #8 (Secret.v (S.head s2));\n logxor_lemma_1 #8 (Secret.v (S.head s1));\n logxor_commutative #8 (Secret.v (S.head s1)) (Secret.v (S.head s2));\n assert (Secret.v (S.head (Spec.Loops.seq_map2 EverCrypt.CTR.xor8 s1 s2)) == Secret.v (S.head s2));\n seq_map2_xor0 (S.tail s1) (S.tail s2)", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 156, "start_col": 2, "end_line": 164, "end_col": 41 }, "file_context": "module QUIC.Impl.Lemmas\ninclude QUIC.Spec.Lemmas\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\n/// The usual sequence lemmas\n/// -------------------------\n\nlet lemma_five_cuts\n s i1 i2 i3 i4 i5 s0 s1 s2 s3 s4 s5\n=\n ()\n\nlet hash_is_keysized_\n a\n=\n assert_norm (512 < pow2 61);\n assert_norm (512 < pow2 125)\n\nlet lemma_slice\n #t s i\n=\n ()\n\nlet lemma_slice3\n #a s i j\n=\n ()\n\nlet lemma_slice0\n #a s\n= ()\n\nlet lemma_slice1\n #a s i j\n=\n ()\n\n\nopen FStar.Mul\n\n#push-options \"--max_fuel 1 --z3rlimit 100\"\nlet pointwise_upd\n #a f b1 b2 i pos x\n=\n calc (S.equal) {\n QSL.pointwise_op f (S.upd b1 i x) b2 pos;\n (S.equal) { lemma_slice (S.upd b1 i x) (i + 1) }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice (S.upd b1 i x) (i + 1) (S.length b1))\n b2 pos;\n (S.equal) { }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice b1 (i + 1) (S.length b1))\n b2 pos;\n (S.equal) {\n QSL.pointwise_op_suff f\n (S.slice (S.upd b1 i x) 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1)) b2 pos\n }\n S.slice (S.upd b1 i x) 0 (i + 1) `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1));\n (S.equal) { }\n S.upd (S.slice b1 0 (i + 1)) i x `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1));\n (S.equal) { }\n S.upd (S.slice b1 0 (i + 1) `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1))\n ) i x;\n (S.equal) {\n QSL.pointwise_op_suff f\n (S.slice b1 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1)) b2 pos\n }\n S.upd (\n QSL.pointwise_op f\n (S.slice b1 0 (i + 1) `S.append` S.slice b1 (i + 1) (S.length b1))\n b2 pos\n ) i x;\n (S.equal) { lemma_slice b1 (i + 1) }\n S.upd (QSL.pointwise_op f b1 b2 pos) i x;\n }\n\nlet rec pointwise_seq_map2\n #a f s1 s2 i\n=\n if S.length s2 = 0 then\n ()\n else\n let l = S.length s1 in\n calc (S.equal) {\n Spec.Loops.seq_map2 f (S.slice s1 i l) s2;\n (S.equal) {}\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (Spec.Loops.seq_map2 f (S.tail (S.slice s1 i l)) (S.tail s2));\n (S.equal) {}\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (Spec.Loops.seq_map2 f (S.slice s1 (i + 1) l) (S.tail s2));\n (S.equal) { pointwise_seq_map2 f s1 (S.slice s2 1 (S.length s2)) (i + 1) }\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (S.slice (QSL.pointwise_op f s1 (S.tail s2) (i + 1)) (i + 1) l);\n (S.equal) { }\n S.slice (\n S.upd (QSL.pointwise_op f s1 (S.tail s2) (i + 1))\n i\n (f (S.head (S.slice s1 i l)) (S.head s2)))\n i\n l;\n (S.equal) { }\n S.slice (\n S.upd (QSL.pointwise_op f s1 (S.slice s2 1 (S.length s2)) (i + 1))\n i\n (f (S.head (S.slice s1 i l)) (S.head s2)))\n i\n l;\n (S.equal) {\n pointwise_upd f s1 (S.slice s2 1 (S.length s2)) i (i + 1)\n (f (S.head (S.slice s1 i l)) (S.head s2))\n }\n S.slice\n (QSL.pointwise_op f\n (S.upd s1 i (f (S.head (S.slice s1 i l)) (S.head s2)))\n (S.slice s2 1 (S.length s2))\n (i + 1))\n i l;\n\n };\n ()\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet rec and_inplace_commutative\n s1 s2\n=\n if S.length s1 = 0 then\n ()\n else (\n FStar.UInt.logand_commutative #8 (U8.v (S.head s1)) (U8.v (S.head s2));\n assert (U8.logand (S.head s1) (S.head s2) = U8.logand (S.head s2) (S.head s1));\n and_inplace_commutative (S.tail s1) (S.tail s2);\n assert (Spec.Loops.seq_map2 U8.logand (S.tail s1) (S.tail s2) `S.equal`\n Spec.Loops.seq_map2 U8.logand (S.tail s2) (S.tail s1))\n )\n#pop-options\n\n#push-options \"--max_fuel 1\"\nlet rec seq_map2_xor0\n s1 s2", "dependencies": { "source_file": "QUIC.Impl.Lemmas.fst", "checked_file": "QUIC.Impl.Lemmas.fst.checked", "interface_file": true, "dependencies": [ "Spec.Loops.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "FStar.Calc.fsti.checked", "EverCrypt.CTR.fsti.checked", "C.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "QSL", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 5, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s1: FStar.Seq.Base.seq Lib.IntTypes.uint8 -> s2: FStar.Seq.Base.seq Lib.IntTypes.uint8\n -> FStar.Pervasives.Lemma\n (requires\n FStar.Seq.Base.length s1 = FStar.Seq.Base.length s2 /\\\n FStar.Seq.Base.equal s1\n (FStar.Seq.Base.create (FStar.Seq.Base.length s2) (Lib.IntTypes.to_u8 0uy)))\n (ensures FStar.Seq.Base.equal (Spec.Loops.seq_map2 NotEverCrypt.CTR.xor8 s1 s2) s2)\n (decreases FStar.Seq.Base.length s1)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma", "" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Lib.IntTypes.uint8", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "Prims.bool", "QUIC.Impl.Lemmas.seq_map2_xor0", "FStar.Seq.Properties.tail", "Prims.unit", "Prims._assert", "Prims.eq2", "Lib.IntTypes.range_t", "Lib.IntTypes.U8", "QUIC.Secret.Int.Base.v", "Lib.IntTypes.SEC", "FStar.Seq.Properties.head", "Lib.IntTypes.int_t", "Spec.Loops.seq_map2", "NotEverCrypt.CTR.xor8", "FStar.UInt.logxor_commutative", "FStar.UInt.logxor_lemma_1" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val seq_map2_xor0 (s1 s2: S.seq Secret.uint8): Lemma\n (requires\n S.length s1 = S.length s2 /\\\n s1 `S.equal` S.create (S.length s2) (Secret.to_u8 0uy))\n (ensures\n Spec.Loops.seq_map2 EverCrypt.CTR.xor8 s1 s2 `S.equal` s2)\n (decreases (S.length s1))\nlet rec seq_map2_xor0 s1 s2 =", "completed_definiton": "if S.length s1 = 0\nthen ()\nelse\n let open FStar.UInt in\n logxor_lemma_1 #8 (Secret.v (S.head s2));\n logxor_lemma_1 #8 (Secret.v (S.head s1));\n logxor_commutative #8 (Secret.v (S.head s1)) (Secret.v (S.head s2));\n assert (Secret.v (S.head (Spec.Loops.seq_map2 EverCrypt.CTR.xor8 s1 s2)) == Secret.v (S.head s2));\n seq_map2_xor0 (S.tail s1) (S.tail s2)", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Lemmas.fst", "name": "QUIC.Impl.Lemmas.pointwise_upd", "original_source_type": "val pointwise_upd (#a: Type) (f: a -> a -> Tot a) (b1 b2: S.seq a) (i: nat) (pos: nat) (x: a): Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.upd (QSL.pointwise_op f b1 b2 pos) i x `S.equal`\n QSL.pointwise_op f (S.upd b1 i x) b2 pos))", "source_type": "val pointwise_upd (#a: Type) (f: a -> a -> Tot a) (b1 b2: S.seq a) (i: nat) (pos: nat) (x: a): Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.upd (QSL.pointwise_op f b1 b2 pos) i x `S.equal`\n QSL.pointwise_op f (S.upd b1 i x) b2 pos))", "source_definition": "let pointwise_upd\n #a f b1 b2 i pos x\n=\n calc (S.equal) {\n QSL.pointwise_op f (S.upd b1 i x) b2 pos;\n (S.equal) { lemma_slice (S.upd b1 i x) (i + 1) }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice (S.upd b1 i x) (i + 1) (S.length b1))\n b2 pos;\n (S.equal) { }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice b1 (i + 1) (S.length b1))\n b2 pos;\n (S.equal) {\n QSL.pointwise_op_suff f\n (S.slice (S.upd b1 i x) 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1)) b2 pos\n }\n S.slice (S.upd b1 i x) 0 (i + 1) `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1));\n (S.equal) { }\n S.upd (S.slice b1 0 (i + 1)) i x `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1));\n (S.equal) { }\n S.upd (S.slice b1 0 (i + 1) `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1))\n ) i x;\n (S.equal) {\n QSL.pointwise_op_suff f\n (S.slice b1 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1)) b2 pos\n }\n S.upd (\n QSL.pointwise_op f\n (S.slice b1 0 (i + 1) `S.append` S.slice b1 (i + 1) (S.length b1))\n b2 pos\n ) i x;\n (S.equal) { lemma_slice b1 (i + 1) }\n S.upd (QSL.pointwise_op f b1 b2 pos) i x;\n }", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 46, "start_col": 2, "end_line": 88, "end_col": 3 }, "file_context": "module QUIC.Impl.Lemmas\ninclude QUIC.Spec.Lemmas\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\n/// The usual sequence lemmas\n/// -------------------------\n\nlet lemma_five_cuts\n s i1 i2 i3 i4 i5 s0 s1 s2 s3 s4 s5\n=\n ()\n\nlet hash_is_keysized_\n a\n=\n assert_norm (512 < pow2 61);\n assert_norm (512 < pow2 125)\n\nlet lemma_slice\n #t s i\n=\n ()\n\nlet lemma_slice3\n #a s i j\n=\n ()\n\nlet lemma_slice0\n #a s\n= ()\n\nlet lemma_slice1\n #a s i j\n=\n ()\n\n\nopen FStar.Mul\n\n#push-options \"--max_fuel 1 --z3rlimit 100\"\nlet pointwise_upd\n #a f b1 b2 i pos x", "dependencies": { "source_file": "QUIC.Impl.Lemmas.fst", "checked_file": "QUIC.Impl.Lemmas.fst.checked", "interface_file": true, "dependencies": [ "Spec.Loops.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "FStar.Calc.fsti.checked", "EverCrypt.CTR.fsti.checked", "C.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "QSL", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n f: (_: a -> _: a -> a) ->\n b1: FStar.Seq.Base.seq a ->\n b2: FStar.Seq.Base.seq a ->\n i: Prims.nat ->\n pos: Prims.nat ->\n x: a\n -> FStar.Pervasives.Lemma\n (requires FStar.Seq.Base.length b2 + pos <= FStar.Seq.Base.length b1 /\\ i < pos)\n (ensures\n FStar.Seq.Base.equal (FStar.Seq.Base.upd (QUIC.Spec.Lemmas.pointwise_op f b1 b2 pos) i x)\n (QUIC.Spec.Lemmas.pointwise_op f (FStar.Seq.Base.upd b1 i x) b2 pos))", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.nat", "FStar.Calc.calc_finish", "FStar.Seq.Base.equal", "QUIC.Spec.Lemmas.pointwise_op", "FStar.Seq.Base.upd", "Prims.Cons", "FStar.Preorder.relation", "Prims.Nil", "Prims.unit", "FStar.Calc.calc_step", "FStar.Seq.Base.append", "FStar.Seq.Base.slice", "Prims.op_Addition", "FStar.Seq.Base.length", "Prims.op_Subtraction", "FStar.Seq.Base.op_At_Bar", "FStar.Calc.calc_init", "FStar.Calc.calc_pack", "QUIC.Impl.Lemmas.lemma_slice", "Prims.squash", "QUIC.Spec.Lemmas.pointwise_op_suff" ], "proof_features": [], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val pointwise_upd (#a: Type) (f: a -> a -> Tot a) (b1 b2: S.seq a) (i: nat) (pos: nat) (x: a): Lemma\n (requires (S.length b2 + pos <= S.length b1 /\\ i < pos))\n (ensures (S.upd (QSL.pointwise_op f b1 b2 pos) i x `S.equal`\n QSL.pointwise_op f (S.upd b1 i x) b2 pos))\nlet pointwise_upd #a f b1 b2 i pos x =", "completed_definiton": "calc (S.equal) {\n QSL.pointwise_op f (S.upd b1 i x) b2 pos;\n (S.equal) { lemma_slice (S.upd b1 i x) (i + 1) }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice (S.upd b1 i x) (i + 1) (S.length b1))\n b2\n pos;\n (S.equal) { () }\n QSL.pointwise_op f S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice b1 (i + 1) (S.length b1)) b2 pos;\n (S.equal) { QSL.pointwise_op_suff f\n (S.slice (S.upd b1 i x) 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1))\n b2\n pos }\n (S.slice (S.upd b1 i x) 0 (i + 1))\n `S.append`\n (QSL.pointwise_op f (S.slice b1 (i + 1) (S.length b1)) b2 (pos - (i + 1)));\n (S.equal) { () }\n (S.upd (S.slice b1 0 (i + 1)) i x)\n `S.append`\n (QSL.pointwise_op f (S.slice b1 (i + 1) (S.length b1)) b2 (pos - (i + 1)));\n (S.equal) { () }\n S.upd ((S.slice b1 0 (i + 1))\n `S.append`\n (QSL.pointwise_op f (S.slice b1 (i + 1) (S.length b1)) b2 (pos - (i + 1))))\n i\n x;\n (S.equal) { QSL.pointwise_op_suff f\n (S.slice b1 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1))\n b2\n pos }\n S.upd (QSL.pointwise_op f\n ((S.slice b1 0 (i + 1)) `S.append` (S.slice b1 (i + 1) (S.length b1)))\n b2\n pos)\n i\n x;\n (S.equal) { lemma_slice b1 (i + 1) }\n S.upd (QSL.pointwise_op f b1 b2 pos) i x;\n}", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Lemmas.fst", "name": "QUIC.Impl.Lemmas.be_to_n_slice", "original_source_type": "val be_to_n_slice (s: S.seq U8.t) (i: nat): Lemma\n (requires i <= S.length s)\n (ensures FStar.Endianness.be_to_n (S.slice s i (S.length s)) =\n FStar.Endianness.be_to_n s % pow2 (8 `op_Multiply` (S.length s - i)))\n (decreases (S.length s))", "source_type": "val be_to_n_slice (s: S.seq U8.t) (i: nat): Lemma\n (requires i <= S.length s)\n (ensures FStar.Endianness.be_to_n (S.slice s i (S.length s)) =\n FStar.Endianness.be_to_n s % pow2 (8 `op_Multiply` (S.length s - i)))\n (decreases (S.length s))", "source_definition": "let rec be_to_n_slice\n s i\n=\n FStar.Endianness.reveal_be_to_n s;\n if S.length s = 0 then\n ()\n else\n let open FStar.Endianness in\n if i = S.length s then begin\n reveal_be_to_n S.empty;\n assert_norm (pow2 (8 * 0) = 1);\n assert (S.slice s (S.length s) (S.length s) `S.equal` S.empty);\n assert (be_to_n S.empty = 0);\n assert (be_to_n s % 1 = 0)\n end else\n let s' = (S.slice s i (S.length s)) in\n let s_prefix = (S.slice s 0 (S.length s - 1)) in\n assert (S.length s' <> 0);\n assert (8 <= 8 * (S.length s - i));\n FStar.Math.Lemmas.pow2_le_compat (8 * (S.length s - i)) 8;\n assert_norm (pow2 (8 * 1) = 256);\n assert (U8.v (S.last s) < pow2 (8 * (S.length s - i)));\n assert (S.length s' = S.length s_prefix - i + 1);\n FStar.Math.Lemmas.pow2_le_compat (8 * (S.length s')) (8 * (S.length s - i));\n calc (==) {\n be_to_n s';\n (==) {\n lemma_be_to_n_is_bounded s';\n FStar.Math.Lemmas.small_mod (be_to_n s') (pow2 (8 * (S.length s - i)))\n }\n (be_to_n s') % (pow2 (8 * (S.length s - i)));\n (==) { reveal_be_to_n s' }\n (U8.v (S.last s') + pow2 8 * be_to_n (S.slice s' 0 (S.length s' - 1))) %\n (pow2 (8 * (S.length s - i)));\n (==) { }\n (U8.v (S.last s) + pow2 8 * be_to_n (S.slice s i (S.length s - 1))) %\n (pow2 (8 * (S.length s - i)));\n (==) { }\n (U8.v (S.last s) + pow2 8 * (be_to_n (S.slice s_prefix i (S.length s_prefix)))) %\n (pow2 (8 * (S.length s - i)));\n (==) { be_to_n_slice s_prefix i }\n (U8.v (S.last s) + pow2 8 * (be_to_n s_prefix % pow2 (8 * (S.length s_prefix - i)))) %\n (pow2 (8 * (S.length s - i)));\n (==) { FStar.Math.Lemmas.pow2_multiplication_modulo_lemma_2\n (be_to_n s_prefix) (8 * (S.length s_prefix - i) + 8) 8\n }\n (U8.v (S.last s) +\n ((be_to_n s_prefix * pow2 8) % pow2 (8 * (S.length s_prefix - i) + 8))\n ) %\n (pow2 (8 * (S.length s - i)));\n (==) { }\n (U8.v (S.last s) +\n ((be_to_n s_prefix * pow2 8) % pow2 (8 * (S.length s - i)))\n ) %\n (pow2 (8 * (S.length s - i)));\n (==) { FStar.Math.Lemmas.lemma_mod_add_distr\n (U8.v (S.last s))\n (be_to_n s_prefix * pow2 8)\n (pow2 (8 * (S.length s - i)))\n }\n (U8.v (S.last s) + pow2 8 * be_to_n (S.slice s 0 (S.length s - 1))) %\n pow2 (8 * (S.length s - i));\n }", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 182, "start_col": 2, "end_line": 241, "end_col": 7 }, "file_context": "module QUIC.Impl.Lemmas\ninclude QUIC.Spec.Lemmas\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\n/// The usual sequence lemmas\n/// -------------------------\n\nlet lemma_five_cuts\n s i1 i2 i3 i4 i5 s0 s1 s2 s3 s4 s5\n=\n ()\n\nlet hash_is_keysized_\n a\n=\n assert_norm (512 < pow2 61);\n assert_norm (512 < pow2 125)\n\nlet lemma_slice\n #t s i\n=\n ()\n\nlet lemma_slice3\n #a s i j\n=\n ()\n\nlet lemma_slice0\n #a s\n= ()\n\nlet lemma_slice1\n #a s i j\n=\n ()\n\n\nopen FStar.Mul\n\n#push-options \"--max_fuel 1 --z3rlimit 100\"\nlet pointwise_upd\n #a f b1 b2 i pos x\n=\n calc (S.equal) {\n QSL.pointwise_op f (S.upd b1 i x) b2 pos;\n (S.equal) { lemma_slice (S.upd b1 i x) (i + 1) }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice (S.upd b1 i x) (i + 1) (S.length b1))\n b2 pos;\n (S.equal) { }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice b1 (i + 1) (S.length b1))\n b2 pos;\n (S.equal) {\n QSL.pointwise_op_suff f\n (S.slice (S.upd b1 i x) 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1)) b2 pos\n }\n S.slice (S.upd b1 i x) 0 (i + 1) `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1));\n (S.equal) { }\n S.upd (S.slice b1 0 (i + 1)) i x `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1));\n (S.equal) { }\n S.upd (S.slice b1 0 (i + 1) `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1))\n ) i x;\n (S.equal) {\n QSL.pointwise_op_suff f\n (S.slice b1 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1)) b2 pos\n }\n S.upd (\n QSL.pointwise_op f\n (S.slice b1 0 (i + 1) `S.append` S.slice b1 (i + 1) (S.length b1))\n b2 pos\n ) i x;\n (S.equal) { lemma_slice b1 (i + 1) }\n S.upd (QSL.pointwise_op f b1 b2 pos) i x;\n }\n\nlet rec pointwise_seq_map2\n #a f s1 s2 i\n=\n if S.length s2 = 0 then\n ()\n else\n let l = S.length s1 in\n calc (S.equal) {\n Spec.Loops.seq_map2 f (S.slice s1 i l) s2;\n (S.equal) {}\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (Spec.Loops.seq_map2 f (S.tail (S.slice s1 i l)) (S.tail s2));\n (S.equal) {}\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (Spec.Loops.seq_map2 f (S.slice s1 (i + 1) l) (S.tail s2));\n (S.equal) { pointwise_seq_map2 f s1 (S.slice s2 1 (S.length s2)) (i + 1) }\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (S.slice (QSL.pointwise_op f s1 (S.tail s2) (i + 1)) (i + 1) l);\n (S.equal) { }\n S.slice (\n S.upd (QSL.pointwise_op f s1 (S.tail s2) (i + 1))\n i\n (f (S.head (S.slice s1 i l)) (S.head s2)))\n i\n l;\n (S.equal) { }\n S.slice (\n S.upd (QSL.pointwise_op f s1 (S.slice s2 1 (S.length s2)) (i + 1))\n i\n (f (S.head (S.slice s1 i l)) (S.head s2)))\n i\n l;\n (S.equal) {\n pointwise_upd f s1 (S.slice s2 1 (S.length s2)) i (i + 1)\n (f (S.head (S.slice s1 i l)) (S.head s2))\n }\n S.slice\n (QSL.pointwise_op f\n (S.upd s1 i (f (S.head (S.slice s1 i l)) (S.head s2)))\n (S.slice s2 1 (S.length s2))\n (i + 1))\n i l;\n\n };\n ()\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet rec and_inplace_commutative\n s1 s2\n=\n if S.length s1 = 0 then\n ()\n else (\n FStar.UInt.logand_commutative #8 (U8.v (S.head s1)) (U8.v (S.head s2));\n assert (U8.logand (S.head s1) (S.head s2) = U8.logand (S.head s2) (S.head s1));\n and_inplace_commutative (S.tail s1) (S.tail s2);\n assert (Spec.Loops.seq_map2 U8.logand (S.tail s1) (S.tail s2) `S.equal`\n Spec.Loops.seq_map2 U8.logand (S.tail s2) (S.tail s1))\n )\n#pop-options\n\n#push-options \"--max_fuel 1\"\nlet rec seq_map2_xor0\n s1 s2\n=\n if S.length s1 = 0 then\n ()\n else\n let open FStar.UInt in\n logxor_lemma_1 #8 (Secret.v (S.head s2));\n logxor_lemma_1 #8 (Secret.v (S.head s1));\n logxor_commutative #8 (Secret.v (S.head s1)) (Secret.v (S.head s2));\n assert (Secret.v (S.head (Spec.Loops.seq_map2 EverCrypt.CTR.xor8 s1 s2)) == Secret.v (S.head s2));\n seq_map2_xor0 (S.tail s1) (S.tail s2)\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet upd_op_inplace\n #a op s x\n=\n ()\n#pop-options\n\n/// Endianness lemmas\n/// -----------------\n\n#push-options \"--z3rlimit 16\"\n#restart-solver\nlet rec be_to_n_slice\n s i", "dependencies": { "source_file": "QUIC.Impl.Lemmas.fst", "checked_file": "QUIC.Impl.Lemmas.fst.checked", "interface_file": true, "dependencies": [ "Spec.Loops.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "FStar.Calc.fsti.checked", "EverCrypt.CTR.fsti.checked", "C.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "QSL", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 16, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "s: FStar.Seq.Base.seq FStar.UInt8.t -> i: Prims.nat\n -> FStar.Pervasives.Lemma (requires i <= FStar.Seq.Base.length s)\n (ensures\n FStar.Endianness.be_to_n (FStar.Seq.Base.slice s i (FStar.Seq.Base.length s)) =\n FStar.Endianness.be_to_n s % Prims.pow2 (8 * (FStar.Seq.Base.length s - i)))\n (decreases FStar.Seq.Base.length s)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma", "" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "FStar.UInt8.t", "Prims.nat", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "Prims.bool", "Prims._assert", "Prims.b2t", "Prims.op_Modulus", "FStar.Endianness.be_to_n", "Prims.unit", "FStar.Seq.Base.empty", "FStar.Seq.Base.equal", "FStar.Seq.Base.slice", "FStar.Pervasives.assert_norm", "Prims.pow2", "FStar.Mul.op_Star", "FStar.Endianness.reveal_be_to_n", "FStar.Calc.calc_finish", "Prims.eq2", "Prims.op_Addition", "FStar.UInt8.v", "FStar.Seq.Properties.last", "Prims.op_Subtraction", "Prims.Cons", "FStar.Preorder.relation", "Prims.Nil", "FStar.Calc.calc_step", "FStar.Calc.calc_init", "FStar.Calc.calc_pack", "FStar.Math.Lemmas.small_mod", "FStar.Endianness.lemma_be_to_n_is_bounded", "Prims.squash", "QUIC.Impl.Lemmas.be_to_n_slice", "FStar.Math.Lemmas.pow2_multiplication_modulo_lemma_2", "FStar.Math.Lemmas.lemma_mod_add_distr", "FStar.Math.Lemmas.pow2_le_compat", "Prims.op_LessThan", "Prims.op_LessThanOrEqual", "Prims.op_disEquality" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val be_to_n_slice (s: S.seq U8.t) (i: nat): Lemma\n (requires i <= S.length s)\n (ensures FStar.Endianness.be_to_n (S.slice s i (S.length s)) =\n FStar.Endianness.be_to_n s % pow2 (8 `op_Multiply` (S.length s - i)))\n (decreases (S.length s))\nlet rec be_to_n_slice s i =", "completed_definiton": "FStar.Endianness.reveal_be_to_n s;\nif S.length s = 0\nthen ()\nelse\n let open FStar.Endianness in\n if i = S.length s\n then\n (reveal_be_to_n S.empty;\n assert_norm (pow2 (8 * 0) = 1);\n assert ((S.slice s (S.length s) (S.length s)) `S.equal` S.empty);\n assert (be_to_n S.empty = 0);\n assert (be_to_n s % 1 = 0))\n else\n let s' = (S.slice s i (S.length s)) in\n let s_prefix = (S.slice s 0 (S.length s - 1)) in\n assert (S.length s' <> 0);\n assert (8 <= 8 * (S.length s - i));\n FStar.Math.Lemmas.pow2_le_compat (8 * (S.length s - i)) 8;\n assert_norm (pow2 (8 * 1) = 256);\n assert (U8.v (S.last s) < pow2 (8 * (S.length s - i)));\n assert (S.length s' = S.length s_prefix - i + 1);\n FStar.Math.Lemmas.pow2_le_compat (8 * (S.length s')) (8 * (S.length s - i));\n calc ( == ) {\n be_to_n s';\n ( == ) { (lemma_be_to_n_is_bounded s';\n FStar.Math.Lemmas.small_mod (be_to_n s') (pow2 (8 * (S.length s - i)))) }\n (be_to_n s') % (pow2 (8 * (S.length s - i)));\n ( == ) { reveal_be_to_n s' }\n (U8.v (S.last s') + pow2 8 * be_to_n (S.slice s' 0 (S.length s' - 1))) %\n (pow2 (8 * (S.length s - i)));\n ( == ) { () }\n (U8.v (S.last s) + pow2 8 * be_to_n (S.slice s i (S.length s - 1))) %\n (pow2 (8 * (S.length s - i)));\n ( == ) { () }\n (U8.v (S.last s) + pow2 8 * (be_to_n (S.slice s_prefix i (S.length s_prefix)))) %\n (pow2 (8 * (S.length s - i)));\n ( == ) { be_to_n_slice s_prefix i }\n (U8.v (S.last s) + pow2 8 * (be_to_n s_prefix % pow2 (8 * (S.length s_prefix - i)))) %\n (pow2 (8 * (S.length s - i)));\n ( == ) { FStar.Math.Lemmas.pow2_multiplication_modulo_lemma_2 (be_to_n s_prefix)\n (8 * (S.length s_prefix - i) + 8)\n 8 }\n (U8.v (S.last s) + ((be_to_n s_prefix * pow2 8) % pow2 (8 * (S.length s_prefix - i) + 8))) %\n (pow2 (8 * (S.length s - i)));\n ( == ) { () }\n (U8.v (S.last s) + ((be_to_n s_prefix * pow2 8) % pow2 (8 * (S.length s - i)))) %\n (pow2 (8 * (S.length s - i)));\n ( == ) { FStar.Math.Lemmas.lemma_mod_add_distr (U8.v (S.last s))\n (be_to_n s_prefix * pow2 8)\n (pow2 (8 * (S.length s - i))) }\n (U8.v (S.last s) + pow2 8 * be_to_n (S.slice s 0 (S.length s - 1))) %\n pow2 (8 * (S.length s - i));\n }", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Lemmas.fst", "name": "QUIC.Impl.Lemmas.pointwise_seq_map2", "original_source_type": "val pointwise_seq_map2 (#a: Type) (f: a -> a -> a) (s1 s2: S.seq a) (i: nat): Lemma\n (requires (\n let l = S.length s1 in\n S.length s2 = l - i /\\ i <= S.length s1))\n (ensures (\n let l = S.length s1 in\n Spec.Loops.seq_map2 f (S.slice s1 i l) s2 `S.equal`\n S.slice (QSL.pointwise_op f s1 s2 i) i l))\n (decreases (S.length s2))", "source_type": "val pointwise_seq_map2 (#a: Type) (f: a -> a -> a) (s1 s2: S.seq a) (i: nat): Lemma\n (requires (\n let l = S.length s1 in\n S.length s2 = l - i /\\ i <= S.length s1))\n (ensures (\n let l = S.length s1 in\n Spec.Loops.seq_map2 f (S.slice s1 i l) s2 `S.equal`\n S.slice (QSL.pointwise_op f s1 s2 i) i l))\n (decreases (S.length s2))", "source_definition": "let rec pointwise_seq_map2\n #a f s1 s2 i\n=\n if S.length s2 = 0 then\n ()\n else\n let l = S.length s1 in\n calc (S.equal) {\n Spec.Loops.seq_map2 f (S.slice s1 i l) s2;\n (S.equal) {}\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (Spec.Loops.seq_map2 f (S.tail (S.slice s1 i l)) (S.tail s2));\n (S.equal) {}\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (Spec.Loops.seq_map2 f (S.slice s1 (i + 1) l) (S.tail s2));\n (S.equal) { pointwise_seq_map2 f s1 (S.slice s2 1 (S.length s2)) (i + 1) }\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (S.slice (QSL.pointwise_op f s1 (S.tail s2) (i + 1)) (i + 1) l);\n (S.equal) { }\n S.slice (\n S.upd (QSL.pointwise_op f s1 (S.tail s2) (i + 1))\n i\n (f (S.head (S.slice s1 i l)) (S.head s2)))\n i\n l;\n (S.equal) { }\n S.slice (\n S.upd (QSL.pointwise_op f s1 (S.slice s2 1 (S.length s2)) (i + 1))\n i\n (f (S.head (S.slice s1 i l)) (S.head s2)))\n i\n l;\n (S.equal) {\n pointwise_upd f s1 (S.slice s2 1 (S.length s2)) i (i + 1)\n (f (S.head (S.slice s1 i l)) (S.head s2))\n }\n S.slice\n (QSL.pointwise_op f\n (S.upd s1 i (f (S.head (S.slice s1 i l)) (S.head s2)))\n (S.slice s2 1 (S.length s2))\n (i + 1))\n i l;\n\n };\n ()", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 93, "start_col": 2, "end_line": 134, "end_col": 6 }, "file_context": "module QUIC.Impl.Lemmas\ninclude QUIC.Spec.Lemmas\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\n/// The usual sequence lemmas\n/// -------------------------\n\nlet lemma_five_cuts\n s i1 i2 i3 i4 i5 s0 s1 s2 s3 s4 s5\n=\n ()\n\nlet hash_is_keysized_\n a\n=\n assert_norm (512 < pow2 61);\n assert_norm (512 < pow2 125)\n\nlet lemma_slice\n #t s i\n=\n ()\n\nlet lemma_slice3\n #a s i j\n=\n ()\n\nlet lemma_slice0\n #a s\n= ()\n\nlet lemma_slice1\n #a s i j\n=\n ()\n\n\nopen FStar.Mul\n\n#push-options \"--max_fuel 1 --z3rlimit 100\"\nlet pointwise_upd\n #a f b1 b2 i pos x\n=\n calc (S.equal) {\n QSL.pointwise_op f (S.upd b1 i x) b2 pos;\n (S.equal) { lemma_slice (S.upd b1 i x) (i + 1) }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice (S.upd b1 i x) (i + 1) (S.length b1))\n b2 pos;\n (S.equal) { }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice b1 (i + 1) (S.length b1))\n b2 pos;\n (S.equal) {\n QSL.pointwise_op_suff f\n (S.slice (S.upd b1 i x) 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1)) b2 pos\n }\n S.slice (S.upd b1 i x) 0 (i + 1) `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1));\n (S.equal) { }\n S.upd (S.slice b1 0 (i + 1)) i x `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1));\n (S.equal) { }\n S.upd (S.slice b1 0 (i + 1) `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1))\n ) i x;\n (S.equal) {\n QSL.pointwise_op_suff f\n (S.slice b1 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1)) b2 pos\n }\n S.upd (\n QSL.pointwise_op f\n (S.slice b1 0 (i + 1) `S.append` S.slice b1 (i + 1) (S.length b1))\n b2 pos\n ) i x;\n (S.equal) { lemma_slice b1 (i + 1) }\n S.upd (QSL.pointwise_op f b1 b2 pos) i x;\n }\n\nlet rec pointwise_seq_map2\n #a f s1 s2 i", "dependencies": { "source_file": "QUIC.Impl.Lemmas.fst", "checked_file": "QUIC.Impl.Lemmas.fst.checked", "interface_file": true, "dependencies": [ "Spec.Loops.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "FStar.Calc.fsti.checked", "EverCrypt.CTR.fsti.checked", "C.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "QSL", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 1, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 100, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "f: (_: a -> _: a -> a) -> s1: FStar.Seq.Base.seq a -> s2: FStar.Seq.Base.seq a -> i: Prims.nat\n -> FStar.Pervasives.Lemma\n (requires\n (let l = FStar.Seq.Base.length s1 in\n FStar.Seq.Base.length s2 = l - i /\\ i <= FStar.Seq.Base.length s1))\n (ensures\n (let l = FStar.Seq.Base.length s1 in\n FStar.Seq.Base.equal (Spec.Loops.seq_map2 f (FStar.Seq.Base.slice s1 i l) s2)\n (FStar.Seq.Base.slice (QUIC.Spec.Lemmas.pointwise_op f s1 s2 i) i l)))\n (decreases FStar.Seq.Base.length s2)", "effect": "FStar.Pervasives.Lemma", "effect_flags": [ "lemma", "" ], "mutual_with": [], "ideal_premises": [ "FStar.Seq.Base.seq", "Prims.nat", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "Prims.bool", "Prims.unit", "FStar.Calc.calc_finish", "FStar.Seq.Base.equal", "Spec.Loops.seq_map2", "FStar.Seq.Base.slice", "QUIC.Spec.Lemmas.pointwise_op", "FStar.Seq.Base.upd", "FStar.Seq.Properties.head", "Prims.op_Addition", "Prims.Cons", "FStar.Preorder.relation", "Prims.Nil", "FStar.Calc.calc_step", "FStar.Seq.Properties.tail", "FStar.Seq.Properties.cons", "FStar.Calc.calc_init", "FStar.Calc.calc_pack", "Prims.squash", "QUIC.Impl.Lemmas.pointwise_seq_map2", "QUIC.Impl.Lemmas.pointwise_upd" ], "proof_features": [ "recursion" ], "is_simple_lemma": null, "is_div": false, "is_proof": true, "is_simply_typed": false, "is_type": null, "partial_definition": "val pointwise_seq_map2 (#a: Type) (f: a -> a -> a) (s1 s2: S.seq a) (i: nat): Lemma\n (requires (\n let l = S.length s1 in\n S.length s2 = l - i /\\ i <= S.length s1))\n (ensures (\n let l = S.length s1 in\n Spec.Loops.seq_map2 f (S.slice s1 i l) s2 `S.equal`\n S.slice (QSL.pointwise_op f s1 s2 i) i l))\n (decreases (S.length s2))\nlet rec pointwise_seq_map2 #a f s1 s2 i =", "completed_definiton": "if S.length s2 = 0\nthen ()\nelse\n let l = S.length s1 in\n calc (S.equal) {\n Spec.Loops.seq_map2 f (S.slice s1 i l) s2;\n (S.equal) { () }\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (Spec.Loops.seq_map2 f (S.tail (S.slice s1 i l)) (S.tail s2));\n (S.equal) { () }\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (Spec.Loops.seq_map2 f (S.slice s1 (i + 1) l) (S.tail s2));\n (S.equal) { pointwise_seq_map2 f s1 (S.slice s2 1 (S.length s2)) (i + 1) }\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (S.slice (QSL.pointwise_op f s1 (S.tail s2) (i + 1)) (i + 1) l);\n (S.equal) { () }\n S.slice (S.upd (QSL.pointwise_op f s1 (S.tail s2) (i + 1))\n i\n (f (S.head (S.slice s1 i l)) (S.head s2)))\n i\n l;\n (S.equal) { () }\n S.slice (S.upd (QSL.pointwise_op f s1 (S.slice s2 1 (S.length s2)) (i + 1))\n i\n (f (S.head (S.slice s1 i l)) (S.head s2)))\n i\n l;\n (S.equal) { pointwise_upd f\n s1\n (S.slice s2 1 (S.length s2))\n i\n (i + 1)\n (f (S.head (S.slice s1 i l)) (S.head s2)) }\n S.slice (QSL.pointwise_op f\n (S.upd s1 i (f (S.head (S.slice s1 i l)) (S.head s2)))\n (S.slice s2 1 (S.length s2))\n (i + 1))\n i\n l;\n };\n ()", "isa_cross_project_example": true }, { "file_name": "QUIC.Impl.Lemmas.fst", "name": "QUIC.Impl.Lemmas.op_inplace'", "original_source_type": "val op_inplace'\n (#t: Type)\n (dst: B.buffer t)\n (dst_len: Ghost.erased U32.t)\n (src: B.buffer t)\n (src_len ofs: U32.t)\n (op: (t -> t -> t))\n : HST.Stack unit\n (requires\n fun h0 ->\n B.(all_live h0 [buf dst; buf src]) /\\ B.disjoint dst src /\\ B.length src == U32.v src_len /\\\n B.length dst == U32.v dst_len /\\ B.length dst >= U32.v ofs + B.length src)\n (ensures\n fun h0 _ h1 ->\n B.(modifies (loc_buffer dst) h0 h1) /\\\n (B.as_seq h1 dst)\n `Seq.equal`\n (pointwise_op op (B.as_seq h0 dst) (B.as_seq h0 src) (U32.v ofs)) /\\\n (Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs))\n `Seq.equal`\n (Seq.slice (B.as_seq h1 dst) 0 (U32.v ofs)) /\\\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (U32.v dst_len))\n `Seq.equal`\n (Seq.slice (B.as_seq h1 dst) (U32.v (ofs `U32.add` src_len)) (U32.v dst_len)))", "source_type": "val op_inplace'\n (#t: Type)\n (dst: B.buffer t)\n (dst_len: Ghost.erased U32.t)\n (src: B.buffer t)\n (src_len ofs: U32.t)\n (op: (t -> t -> t))\n : HST.Stack unit\n (requires\n fun h0 ->\n B.(all_live h0 [buf dst; buf src]) /\\ B.disjoint dst src /\\ B.length src == U32.v src_len /\\\n B.length dst == U32.v dst_len /\\ B.length dst >= U32.v ofs + B.length src)\n (ensures\n fun h0 _ h1 ->\n B.(modifies (loc_buffer dst) h0 h1) /\\\n (B.as_seq h1 dst)\n `Seq.equal`\n (pointwise_op op (B.as_seq h0 dst) (B.as_seq h0 src) (U32.v ofs)) /\\\n (Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs))\n `Seq.equal`\n (Seq.slice (B.as_seq h1 dst) 0 (U32.v ofs)) /\\\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (U32.v dst_len))\n `Seq.equal`\n (Seq.slice (B.as_seq h1 dst) (U32.v (ofs `U32.add` src_len)) (U32.v dst_len)))", "source_definition": "let op_inplace'\n (#t: Type)\n (dst: B.buffer t)\n (dst_len: Ghost.erased U32.t)\n (src: B.buffer t)\n (src_len: U32.t)\n (ofs: U32.t)\n (op: t -> t -> t)\n:\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf src ]) /\\\n B.disjoint dst src /\\\n B.length src == U32.v src_len /\\\n B.length dst == U32.v dst_len /\\\n B.length dst >= U32.v ofs + B.length src)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n pointwise_op op (B.as_seq h0 dst) (B.as_seq h0 src) (U32.v ofs) /\\\n Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs) `Seq.equal`\n Seq.slice (B.as_seq h1 dst) 0 (U32.v ofs) /\\\n Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (U32.v dst_len) `Seq.equal`\n Seq.slice (B.as_seq h1 dst) (U32.v (ofs `U32.add` src_len)) (U32.v dst_len))\n=\n let h0 = HST.get () in\n let dst0 = B.sub dst 0ul ofs in\n let dst1 = B.sub dst ofs src_len in\n let dst2 = Ghost.hide (B.gsub dst (ofs `U32.add` src_len) (dst_len `U32.sub` (ofs `U32.add` src_len))) in\n C.Loops.in_place_map2 dst1 src src_len op;\n let h1 = HST.get () in\n calc (Seq.equal) {\n B.as_seq h1 dst;\n (Seq.equal) { lemma_slice3 (B.as_seq h1 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len)) }\n Seq.slice (B.as_seq h1 dst) 0 (U32.v ofs) `Seq.append`\n (Seq.slice (B.as_seq h1 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len))) `Seq.append`\n (Seq.slice (B.as_seq h1 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) {}\n Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs) `Seq.append`\n (Seq.slice (B.as_seq h1 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len))) `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) { pointwise_seq_map2 op (B.as_seq h0 dst1) (B.as_seq h0 src) 0 }\n Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs) `Seq.append`\n (pointwise_op op\n (Seq.slice (B.as_seq h0 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len)))\n (B.as_seq h0 src)\n 0) `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) { pointwise_op_suff op (Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs))\n (Seq.slice (B.as_seq h0 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len)))\n (B.as_seq h0 src)\n (U32.v ofs) }\n pointwise_op op\n (Seq.append (Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs))\n (Seq.slice (B.as_seq h0 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len))))\n (B.as_seq h0 src)\n (U32.v ofs) `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) { lemma_slice1 (B.as_seq h0 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len)) }\n pointwise_op op\n (Seq.slice (B.as_seq h0 dst) 0 (U32.v (ofs `U32.add` src_len)))\n (B.as_seq h0 src)\n (U32.v ofs) `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) { pointwise_op_pref op\n (Seq.slice (B.as_seq h0 dst) 0 (U32.v (ofs `U32.add` src_len)))\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst))\n (B.as_seq h0 src)\n (U32.v ofs)\n }\n pointwise_op op\n (Seq.slice (B.as_seq h0 dst) 0 (U32.v (ofs `U32.add` src_len)) `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst)))\n (B.as_seq h0 src)\n (U32.v ofs);\n (Seq.equal) { lemma_slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) }\n pointwise_op op\n (B.as_seq h0 dst)\n (B.as_seq h0 src)\n (U32.v ofs);\n }", "source": { "project_name": "everquic-crypto", "file_name": "src/QUIC.Impl.Lemmas.fst", "git_rev": "76c14ada5db16b85a33920d826df0552e4c3cf10", "git_url": "https://github.com/project-everest/everquic-crypto.git" }, "source_range": { "start_line": 313, "start_col": 1, "end_line": 369, "end_col": 3 }, "file_context": "module QUIC.Impl.Lemmas\ninclude QUIC.Spec.Lemmas\n\n#set-options \"--max_fuel 0 --max_ifuel 0\"\n\n/// The usual sequence lemmas\n/// -------------------------\n\nlet lemma_five_cuts\n s i1 i2 i3 i4 i5 s0 s1 s2 s3 s4 s5\n=\n ()\n\nlet hash_is_keysized_\n a\n=\n assert_norm (512 < pow2 61);\n assert_norm (512 < pow2 125)\n\nlet lemma_slice\n #t s i\n=\n ()\n\nlet lemma_slice3\n #a s i j\n=\n ()\n\nlet lemma_slice0\n #a s\n= ()\n\nlet lemma_slice1\n #a s i j\n=\n ()\n\n\nopen FStar.Mul\n\n#push-options \"--max_fuel 1 --z3rlimit 100\"\nlet pointwise_upd\n #a f b1 b2 i pos x\n=\n calc (S.equal) {\n QSL.pointwise_op f (S.upd b1 i x) b2 pos;\n (S.equal) { lemma_slice (S.upd b1 i x) (i + 1) }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice (S.upd b1 i x) (i + 1) (S.length b1))\n b2 pos;\n (S.equal) { }\n QSL.pointwise_op f\n S.(slice (S.upd b1 i x) 0 (i + 1) @| S.slice b1 (i + 1) (S.length b1))\n b2 pos;\n (S.equal) {\n QSL.pointwise_op_suff f\n (S.slice (S.upd b1 i x) 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1)) b2 pos\n }\n S.slice (S.upd b1 i x) 0 (i + 1) `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1));\n (S.equal) { }\n S.upd (S.slice b1 0 (i + 1)) i x `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1));\n (S.equal) { }\n S.upd (S.slice b1 0 (i + 1) `S.append`\n QSL.pointwise_op f\n (S.slice b1 (i + 1) (S.length b1))\n b2 (pos - (i + 1))\n ) i x;\n (S.equal) {\n QSL.pointwise_op_suff f\n (S.slice b1 0 (i + 1))\n (S.slice b1 (i + 1) (S.length b1)) b2 pos\n }\n S.upd (\n QSL.pointwise_op f\n (S.slice b1 0 (i + 1) `S.append` S.slice b1 (i + 1) (S.length b1))\n b2 pos\n ) i x;\n (S.equal) { lemma_slice b1 (i + 1) }\n S.upd (QSL.pointwise_op f b1 b2 pos) i x;\n }\n\nlet rec pointwise_seq_map2\n #a f s1 s2 i\n=\n if S.length s2 = 0 then\n ()\n else\n let l = S.length s1 in\n calc (S.equal) {\n Spec.Loops.seq_map2 f (S.slice s1 i l) s2;\n (S.equal) {}\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (Spec.Loops.seq_map2 f (S.tail (S.slice s1 i l)) (S.tail s2));\n (S.equal) {}\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (Spec.Loops.seq_map2 f (S.slice s1 (i + 1) l) (S.tail s2));\n (S.equal) { pointwise_seq_map2 f s1 (S.slice s2 1 (S.length s2)) (i + 1) }\n S.cons (f (S.head (S.slice s1 i l)) (S.head s2))\n (S.slice (QSL.pointwise_op f s1 (S.tail s2) (i + 1)) (i + 1) l);\n (S.equal) { }\n S.slice (\n S.upd (QSL.pointwise_op f s1 (S.tail s2) (i + 1))\n i\n (f (S.head (S.slice s1 i l)) (S.head s2)))\n i\n l;\n (S.equal) { }\n S.slice (\n S.upd (QSL.pointwise_op f s1 (S.slice s2 1 (S.length s2)) (i + 1))\n i\n (f (S.head (S.slice s1 i l)) (S.head s2)))\n i\n l;\n (S.equal) {\n pointwise_upd f s1 (S.slice s2 1 (S.length s2)) i (i + 1)\n (f (S.head (S.slice s1 i l)) (S.head s2))\n }\n S.slice\n (QSL.pointwise_op f\n (S.upd s1 i (f (S.head (S.slice s1 i l)) (S.head s2)))\n (S.slice s2 1 (S.length s2))\n (i + 1))\n i l;\n\n };\n ()\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet rec and_inplace_commutative\n s1 s2\n=\n if S.length s1 = 0 then\n ()\n else (\n FStar.UInt.logand_commutative #8 (U8.v (S.head s1)) (U8.v (S.head s2));\n assert (U8.logand (S.head s1) (S.head s2) = U8.logand (S.head s2) (S.head s1));\n and_inplace_commutative (S.tail s1) (S.tail s2);\n assert (Spec.Loops.seq_map2 U8.logand (S.tail s1) (S.tail s2) `S.equal`\n Spec.Loops.seq_map2 U8.logand (S.tail s2) (S.tail s1))\n )\n#pop-options\n\n#push-options \"--max_fuel 1\"\nlet rec seq_map2_xor0\n s1 s2\n=\n if S.length s1 = 0 then\n ()\n else\n let open FStar.UInt in\n logxor_lemma_1 #8 (Secret.v (S.head s2));\n logxor_lemma_1 #8 (Secret.v (S.head s1));\n logxor_commutative #8 (Secret.v (S.head s1)) (Secret.v (S.head s2));\n assert (Secret.v (S.head (Spec.Loops.seq_map2 EverCrypt.CTR.xor8 s1 s2)) == Secret.v (S.head s2));\n seq_map2_xor0 (S.tail s1) (S.tail s2)\n#pop-options\n\n#push-options \"--max_fuel 2 --initial_fuel 2 --max_ifuel 1 --initial_ifuel 1\"\nlet upd_op_inplace\n #a op s x\n=\n ()\n#pop-options\n\n/// Endianness lemmas\n/// -----------------\n\n#push-options \"--z3rlimit 16\"\n#restart-solver\nlet rec be_to_n_slice\n s i\n=\n FStar.Endianness.reveal_be_to_n s;\n if S.length s = 0 then\n ()\n else\n let open FStar.Endianness in\n if i = S.length s then begin\n reveal_be_to_n S.empty;\n assert_norm (pow2 (8 * 0) = 1);\n assert (S.slice s (S.length s) (S.length s) `S.equal` S.empty);\n assert (be_to_n S.empty = 0);\n assert (be_to_n s % 1 = 0)\n end else\n let s' = (S.slice s i (S.length s)) in\n let s_prefix = (S.slice s 0 (S.length s - 1)) in\n assert (S.length s' <> 0);\n assert (8 <= 8 * (S.length s - i));\n FStar.Math.Lemmas.pow2_le_compat (8 * (S.length s - i)) 8;\n assert_norm (pow2 (8 * 1) = 256);\n assert (U8.v (S.last s) < pow2 (8 * (S.length s - i)));\n assert (S.length s' = S.length s_prefix - i + 1);\n FStar.Math.Lemmas.pow2_le_compat (8 * (S.length s')) (8 * (S.length s - i));\n calc (==) {\n be_to_n s';\n (==) {\n lemma_be_to_n_is_bounded s';\n FStar.Math.Lemmas.small_mod (be_to_n s') (pow2 (8 * (S.length s - i)))\n }\n (be_to_n s') % (pow2 (8 * (S.length s - i)));\n (==) { reveal_be_to_n s' }\n (U8.v (S.last s') + pow2 8 * be_to_n (S.slice s' 0 (S.length s' - 1))) %\n (pow2 (8 * (S.length s - i)));\n (==) { }\n (U8.v (S.last s) + pow2 8 * be_to_n (S.slice s i (S.length s - 1))) %\n (pow2 (8 * (S.length s - i)));\n (==) { }\n (U8.v (S.last s) + pow2 8 * (be_to_n (S.slice s_prefix i (S.length s_prefix)))) %\n (pow2 (8 * (S.length s - i)));\n (==) { be_to_n_slice s_prefix i }\n (U8.v (S.last s) + pow2 8 * (be_to_n s_prefix % pow2 (8 * (S.length s_prefix - i)))) %\n (pow2 (8 * (S.length s - i)));\n (==) { FStar.Math.Lemmas.pow2_multiplication_modulo_lemma_2\n (be_to_n s_prefix) (8 * (S.length s_prefix - i) + 8) 8\n }\n (U8.v (S.last s) +\n ((be_to_n s_prefix * pow2 8) % pow2 (8 * (S.length s_prefix - i) + 8))\n ) %\n (pow2 (8 * (S.length s - i)));\n (==) { }\n (U8.v (S.last s) +\n ((be_to_n s_prefix * pow2 8) % pow2 (8 * (S.length s - i)))\n ) %\n (pow2 (8 * (S.length s - i)));\n (==) { FStar.Math.Lemmas.lemma_mod_add_distr\n (U8.v (S.last s))\n (be_to_n s_prefix * pow2 8)\n (pow2 (8 * (S.length s - i)))\n }\n (U8.v (S.last s) + pow2 8 * be_to_n (S.slice s 0 (S.length s - 1))) %\n pow2 (8 * (S.length s - i));\n }\n#pop-options\n\nlet n_to_be_lower\n len len' n\n= let open FStar.Math.Lemmas in\n let open FStar.Endianness in\n pow2_le_compat (8 * len') (8 * len);\n let s1 = n_to_be len n in\n let s2 = FStar.Seq.slice (n_to_be len' n) (len' - len) len' in\n let phi\n (i: nat {i < len})\n : Lemma\n (S.index s1 i == S.index s2 i)\n = QSL.index_n_to_be len n i;\n QSL.index_n_to_be len' n (i + len' - len)\n in\n Classical.forall_intro phi\n\n#restart-solver\n\nlet n_to_be_lower'\n len len' n\n= let open FStar.Math.Lemmas in\n let open FStar.Endianness in\n pow2_le_compat (8 * len') (8 * len);\n let s1 = n_to_be len' n in\n let s2 = S.create (len' - len) 0uy `S.append` n_to_be len n in \n let phi\n (i: nat {i < len'})\n : Lemma\n (S.index s1 i == S.index s2 i)\n = QSL.index_n_to_be len' n i;\n assert (len' - 1 - i == len - 1 - (i - (len' - len)));\n if len' - len <= i\n then begin\n QSL.index_n_to_be len n (i - (len' - len))\n end else begin\n pow2_le_compat (8 * (len' - 1 - i)) (8 * len);\n FStar.Math.Lemmas.small_div n (pow2 (8 * (len' - 1 - i)));\n assert (n / pow2 (8 * (len' - 1 - i)) == 0);\n assert (S.index s1 i == 0uy)\n end\n in\n Classical.forall_intro phi\n\n#push-options \"--z3rlimit 200\"\ninline_for_extraction noextract\nlet op_inplace'\n (#t: Type)\n (dst: B.buffer t)\n (dst_len: Ghost.erased U32.t)\n (src: B.buffer t)\n (src_len: U32.t)\n (ofs: U32.t)\n (op: t -> t -> t)\n:\n HST.Stack unit\n (requires fun h0 ->\n B.(all_live h0 [ buf dst; buf src ]) /\\\n B.disjoint dst src /\\\n B.length src == U32.v src_len /\\\n B.length dst == U32.v dst_len /\\\n B.length dst >= U32.v ofs + B.length src)\n (ensures fun h0 _ h1 ->\n B.(modifies (loc_buffer dst) h0 h1) /\\\n B.as_seq h1 dst `Seq.equal`\n pointwise_op op (B.as_seq h0 dst) (B.as_seq h0 src) (U32.v ofs) /\\\n Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs) `Seq.equal`\n Seq.slice (B.as_seq h1 dst) 0 (U32.v ofs) /\\\n Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (U32.v dst_len) `Seq.equal`", "dependencies": { "source_file": "QUIC.Impl.Lemmas.fst", "checked_file": "QUIC.Impl.Lemmas.fst.checked", "interface_file": true, "dependencies": [ "Spec.Loops.fst.checked", "QUIC.Spec.Lemmas.fst.checked", "prims.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Ghost.fsti.checked", "FStar.Endianness.fsti.checked", "FStar.Classical.fsti.checked", "FStar.Calc.fsti.checked", "EverCrypt.CTR.fsti.checked", "C.Loops.fst.checked" ] }, "opens_and_abbrevs": [ { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Mul" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "HST", "full_module": "FStar.HyperStack.ST" }, { "abbrev": true, "short_module": "B", "full_module": "LowStar.Buffer" }, { "abbrev": true, "short_module": "Secret", "full_module": "QUIC.Secret.Int" }, { "abbrev": true, "short_module": "QSL", "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": true, "short_module": "QS", "full_module": "QUIC.Spec.Crypto" }, { "abbrev": true, "short_module": "U8", "full_module": "FStar.UInt8" }, { "abbrev": true, "short_module": "U32", "full_module": "FStar.UInt32" }, { "abbrev": true, "short_module": "U64", "full_module": "FStar.UInt64" }, { "abbrev": true, "short_module": "S", "full_module": "QUIC.Secret.Seq" }, { "abbrev": true, "short_module": "G", "full_module": "FStar.Ghost" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Spec.Lemmas" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "QUIC.Impl" }, { "abbrev": false, "short_module": null, "full_module": "FStar.Pervasives" }, { "abbrev": false, "short_module": null, "full_module": "Prims" }, { "abbrev": false, "short_module": null, "full_module": "FStar" } ], "vconfig": { "initial_fuel": 2, "max_fuel": 0, "initial_ifuel": 1, "max_ifuel": 0, "detail_errors": false, "detail_hint_replay": false, "no_smt": false, "quake_lo": 1, "quake_hi": 1, "quake_keep": false, "retry": false, "smtencoding_elim_box": false, "smtencoding_nl_arith_repr": "boxwrap", "smtencoding_l_arith_repr": "boxwrap", "smtencoding_valid_intro": true, "smtencoding_valid_elim": false, "tcnorm": true, "no_plugins": false, "no_tactics": false, "z3cliopt": [], "z3smtopt": [], "z3refresh": false, "z3rlimit": 200, "z3rlimit_factor": 1, "z3seed": 0, "z3version": "4.8.5", "trivial_pre_for_unannotated_effectful_fns": true, "reuse_hint_for": null }, "interleaved": false, "verbose_type": "\n dst: LowStar.Buffer.buffer t ->\n dst_len: FStar.Ghost.erased FStar.UInt32.t ->\n src: LowStar.Buffer.buffer t ->\n src_len: FStar.UInt32.t ->\n ofs: FStar.UInt32.t ->\n op: (_: t -> _: t -> t)\n -> FStar.HyperStack.ST.Stack Prims.unit", "effect": "FStar.HyperStack.ST.Stack", "effect_flags": [], "mutual_with": [], "ideal_premises": [ "LowStar.Buffer.buffer", "FStar.Ghost.erased", "FStar.UInt32.t", "FStar.Calc.calc_finish", "FStar.Seq.Base.seq", "FStar.Seq.Base.equal", "LowStar.Monotonic.Buffer.as_seq", "LowStar.Buffer.trivial_preorder", "QUIC.Spec.Lemmas.pointwise_op", "FStar.UInt32.v", "Prims.Cons", "FStar.Preorder.relation", "Prims.Nil", "Prims.unit", "FStar.Calc.calc_step", "FStar.Seq.Base.append", "FStar.Seq.Base.slice", "FStar.UInt32.add", "LowStar.Monotonic.Buffer.length", "FStar.Calc.calc_init", "FStar.Calc.calc_pack", "QUIC.Impl.Lemmas.lemma_slice3", "Prims.squash", "QUIC.Impl.Lemmas.pointwise_seq_map2", "QUIC.Spec.Lemmas.pointwise_op_suff", "QUIC.Impl.Lemmas.lemma_slice1", "QUIC.Spec.Lemmas.pointwise_op_pref", "QUIC.Impl.Lemmas.lemma_slice", "FStar.Monotonic.HyperStack.mem", "FStar.HyperStack.ST.get", "C.Loops.in_place_map2", "LowStar.Monotonic.Buffer.mbuffer", "FStar.Ghost.hide", "LowStar.Buffer.gsub", "FStar.UInt32.sub", "FStar.Ghost.reveal", "LowStar.Buffer.sub", "FStar.UInt32.__uint_to_t", "Prims.l_and", "LowStar.Monotonic.Buffer.all_live", "LowStar.Monotonic.Buffer.buf_t", "LowStar.Monotonic.Buffer.buf", "LowStar.Monotonic.Buffer.disjoint", "Prims.eq2", "Prims.int", "Prims.l_or", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "FStar.UInt.size", "FStar.UInt32.n", "Prims.op_Addition", "LowStar.Monotonic.Buffer.modifies", "LowStar.Monotonic.Buffer.loc_buffer" ], "proof_features": [], "is_simple_lemma": null, "is_div": true, "is_proof": false, "is_simply_typed": false, "is_type": null, "partial_definition": "val op_inplace'\n (#t: Type)\n (dst: B.buffer t)\n (dst_len: Ghost.erased U32.t)\n (src: B.buffer t)\n (src_len ofs: U32.t)\n (op: (t -> t -> t))\n : HST.Stack unit\n (requires\n fun h0 ->\n B.(all_live h0 [buf dst; buf src]) /\\ B.disjoint dst src /\\ B.length src == U32.v src_len /\\\n B.length dst == U32.v dst_len /\\ B.length dst >= U32.v ofs + B.length src)\n (ensures\n fun h0 _ h1 ->\n B.(modifies (loc_buffer dst) h0 h1) /\\\n (B.as_seq h1 dst)\n `Seq.equal`\n (pointwise_op op (B.as_seq h0 dst) (B.as_seq h0 src) (U32.v ofs)) /\\\n (Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs))\n `Seq.equal`\n (Seq.slice (B.as_seq h1 dst) 0 (U32.v ofs)) /\\\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (U32.v dst_len))\n `Seq.equal`\n (Seq.slice (B.as_seq h1 dst) (U32.v (ofs `U32.add` src_len)) (U32.v dst_len)))\nlet op_inplace'\n (#t: Type)\n (dst: B.buffer t)\n (dst_len: Ghost.erased U32.t)\n (src: B.buffer t)\n (src_len ofs: U32.t)\n (op: (t -> t -> t))\n : HST.Stack unit\n (requires\n fun h0 ->\n B.(all_live h0 [buf dst; buf src]) /\\ B.disjoint dst src /\\ B.length src == U32.v src_len /\\\n B.length dst == U32.v dst_len /\\ B.length dst >= U32.v ofs + B.length src)\n (ensures\n fun h0 _ h1 ->\n B.(modifies (loc_buffer dst) h0 h1) /\\\n (B.as_seq h1 dst)\n `Seq.equal`\n (pointwise_op op (B.as_seq h0 dst) (B.as_seq h0 src) (U32.v ofs)) /\\\n (Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs))\n `Seq.equal`\n (Seq.slice (B.as_seq h1 dst) 0 (U32.v ofs)) /\\\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (U32.v dst_len))\n `Seq.equal`\n (Seq.slice (B.as_seq h1 dst) (U32.v (ofs `U32.add` src_len)) (U32.v dst_len))) =", "completed_definiton": "let h0 = HST.get () in\nlet dst0 = B.sub dst 0ul ofs in\nlet dst1 = B.sub dst ofs src_len in\nlet dst2 =\n Ghost.hide (B.gsub dst (ofs `U32.add` src_len) (dst_len `U32.sub` (ofs `U32.add` src_len)))\nin\nC.Loops.in_place_map2 dst1 src src_len op;\nlet h1 = HST.get () in\ncalc (Seq.equal) {\n B.as_seq h1 dst;\n (Seq.equal) { lemma_slice3 (B.as_seq h1 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len)) }\n ((Seq.slice (B.as_seq h1 dst) 0 (U32.v ofs))\n `Seq.append`\n (Seq.slice (B.as_seq h1 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len))))\n `Seq.append`\n (Seq.slice (B.as_seq h1 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) { () }\n ((Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs))\n `Seq.append`\n (Seq.slice (B.as_seq h1 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len))))\n `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) { pointwise_seq_map2 op (B.as_seq h0 dst1) (B.as_seq h0 src) 0 }\n ((Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs))\n `Seq.append`\n (pointwise_op op\n (Seq.slice (B.as_seq h0 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len)))\n (B.as_seq h0 src)\n 0))\n `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) { pointwise_op_suff op\n (Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs))\n (Seq.slice (B.as_seq h0 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len)))\n (B.as_seq h0 src)\n (U32.v ofs) }\n (pointwise_op op\n (Seq.append (Seq.slice (B.as_seq h0 dst) 0 (U32.v ofs))\n (Seq.slice (B.as_seq h0 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len))))\n (B.as_seq h0 src)\n (U32.v ofs))\n `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) { lemma_slice1 (B.as_seq h0 dst) (U32.v ofs) (U32.v (ofs `U32.add` src_len)) }\n (pointwise_op op\n (Seq.slice (B.as_seq h0 dst) 0 (U32.v (ofs `U32.add` src_len)))\n (B.as_seq h0 src)\n (U32.v ofs))\n `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst));\n (Seq.equal) { pointwise_op_pref op\n (Seq.slice (B.as_seq h0 dst) 0 (U32.v (ofs `U32.add` src_len)))\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst))\n (B.as_seq h0 src)\n (U32.v ofs) }\n pointwise_op op\n ((Seq.slice (B.as_seq h0 dst) 0 (U32.v (ofs `U32.add` src_len)))\n `Seq.append`\n (Seq.slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) (B.length dst)))\n (B.as_seq h0 src)\n (U32.v ofs);\n (Seq.equal) { lemma_slice (B.as_seq h0 dst) (U32.v (ofs `U32.add` src_len)) }\n pointwise_op op (B.as_seq h0 dst) (B.as_seq h0 src) (U32.v ofs);\n}", "isa_cross_project_example": true } ]